id int32 0 100k | text stringlengths 21 3.54k | source stringlengths 1 124 | similarity float32 0.78 0.88 |
|---|---|---|---|
33,700 | Track gauge – The distance between the rails. Over time, rail may become too wide or too narrow. In North America and most of the world, standard gauge is 4 ft 8+1⁄2 in (1,435 mm). Rail profile – Looks for rail wear and deviations from standard profile. Warp – The maximum change in crosslevel over a predetermined chord... | Track geometry car | 0.803312 |
33,701 | Curvature – The amount by which the rail deviates from being straight or tangent. The geometry car checks the actual curvature (in degree of curvature) of a curve versus its design curvature. Overhead lines (or catenary) – Measures the height and stagger of contact wire, the position of catenary masts or poles, and the... | Track geometry car | 0.803312 |
33,702 | In the United States, railroads are looking into new ways to measure geometry that cause even less interference to train operations. Testing performed by Transportation Technology Center, Inc. (TTCI) at the Transportation Technology Center in Pueblo, Colorado, uses a portable ride quality monitoring system attached to ... | Track geometry car | 0.803312 |
33,703 | Many times, maintenance gangs will follow the geometry car and fix defects as the geometry car moves along the track.Because track geometry cars are full-sized rail cars (with the exception of some lighter hi-rail geometry cars), track geometry cars also provide a better picture of the geometry of the track under loadi... | Track geometry car | 0.803312 |
33,704 | Track geometry cars may travel up to 217 miles per hour (335 kilometers per hour), inspecting track the whole time. More commonly, on freight railroads, geometry cars travel at track speed (up to 70 miles per hour) to minimize service disruptions. Current track geometry cars may cover large portions of the system in a ... | Track geometry car | 0.803312 |
33,705 | Track inspection was originally done by track inspectors walking the railroad and visually inspecting every section of track. This was hazardous as it had to be done while trains were running. It was also manpower intensive, and inspectors were limited in the amount of track they could inspect on a given day. Manual in... | Track geometry car | 0.803312 |
33,706 | By at least 1977, self-propelled geometry cars had emerged. Southern Pacific's GC-1 (built by Plasser American) was among the first and utilized twelve measuring wheels in conjunction with strain gauges, computers, and spreadsheets to give managers a clear picture of the condition of the railroad. Even in 1981, the Enc... | Track geometry car | 0.803312 |
33,707 | In Switzerland, the first track geometry recording equipment was integrated in an already existing dynamometer car in 1930.One of the earliest track geometry cars was Car T2 used by the U.S. Department of Transportation's Project HISTEP (High-Speed Train Evaluation Program). It was built by the Budd Company for Project... | Track geometry car | 0.803312 |
33,708 | By 1927 the Atchison, Topeka and Santa Fe Railway had a track car in operation followed by the Estrada de Ferro Central do Brasil in 1929. These two cars were built by Baldwin using the gyroscope technology of Sperry Corporation.The first track geometry car in Germany appeared in 1929 and was operated by Deutsche Reich... | Track geometry car | 0.803312 |
33,709 | Track geometry cars emerged in the 1920s when rail traffic became sufficiently dense that manual and visual inspections were no longer practical. Furthermore, the increased operating speeds of trains of that era required more meticulously maintained tracks. In 1925, the Chemins de fer de l'Est put a track geometry car ... | Track geometry car | 0.803312 |
33,710 | A class I defect is a defect in violation of the Federal Railroad Administration's (FRA) track safety standards. Railroads must fix these defects within a certain period of time after their discovery or else they risk being fined. Alignment – "Alignment is the projection of the track geometry of each rail or the track ... | Track geometry car | 0.803312 |
33,711 | The tolerances of each parameter varies by the track class of the track being measured. In the United States, geometry cars generally classify each defect as either "Class II" or "Class I" (though the exact name may vary by the railroad). A class II defect is known as a maintenance level defect, meaning that the track ... | Track geometry car | 0.803312 |
33,712 | A track geometry car (also known as a track recording car) is an automated track inspection vehicle on a rail transport system used to test several parameters of the track geometry without obstructing normal railroad operations. Some of the parameters generally measured include position, curvature, alignment of the tra... | Track geometry car | 0.803312 |
33,713 | In the United States, the Federal Railroad Administration (FRA) maintains a fleet of three geometry cars as part of its Automated Track Inspection Program (ATIP). The FRA runs its fleet of geometry cars around the country to check railroads for compliance with Federal Track Safety Standards (FTSS). According to the FRA... | Track geometry car | 0.803312 |
33,714 | It does not include original research in physics, but rather: Surveys of research at a level accessible to students Original insights into the derivation of results Descriptions of new laboratory exercises Scholarly or reflective articles at appropriate levels Descriptions of successful original student projects Discus... | European Journal of Physics | 0.803311 |
33,715 | The European Journal of Physics is a peer-reviewed, scientific journal dedicated to maintaining and improving the standard of physics education in higher education. The journal, published since 1980, is now published by IOP Publishing on behalf of the European Physical Society. The current editor-in-chief is Mojca Čepi... | European Journal of Physics | 0.803311 |
33,716 | 1998: A team from the University of Wisconsin, Madison (James A. Thomson, Joseph Itskovitz-Eldor, Sander S. Shapiro, Michelle A. Waknitz, Jennifer J. Swiergiel, Vivienne S. Marshall, and Jeffrey M. Jones) publish a paper titled "Embryonic Stem Cell Lines Derived From Human Blastocysts". The researchers behind this stud... | Embryonic stem cell research | 0.803311 |
33,717 | These genetic aberrations further emphasized the need to be able to culture pluripotent cells directly from the inner cell mass.1981: Embryonic stem cells (ES cells) were independently first derived from a mouse embryos by two groups. Martin Evans and Matthew Kaufman from the Department of Genetics, University of Cambr... | Embryonic stem cell research | 0.803311 |
33,718 | The 50 Most Extreme Places in Our Solar System is a science book by David Baker, professor of physics at Austin College and Todd Ratcliff, a planetary geophysicist at the Jet Propulsion Laboratory. | The 50 Most Extreme Places in Our Solar System | 0.803309 |
33,719 | Reviews have been positive including being awarded Honorable Mention in Cosmology and Astronomy in the 2010 PROSE Awards and named an Outstanding University Press Book for Public and Secondary School Libraries by the Association of American University Presses. | The 50 Most Extreme Places in Our Solar System | 0.803309 |
33,720 | The Encyclopedic Dictionary of Astronomy (Ukrainian: Астрономічний енциклопедичний словник) is a Ukrainian encyclopedia of astronomy. It was published in 2003 and has around 3000 entries. | Encyclopedic Dictionary of Astronomy | 0.803306 |
33,721 | A theorem due to Joseph Wedderburn completely classifies finite-dimensional semisimple algebras over a field k {\displaystyle k} . Any such algebra is isomorphic to a finite product ∏ M n i ( D i ) {\displaystyle \prod M_{n_{i}}(D_{i})} where the n i {\displaystyle n_{i}} are natural numbers, the D i {\displaystyle D_{... | Semisimple algebra | 0.803305 |
33,722 | The Jacobson radical of an algebra over a field is the ideal consisting of all elements that annihilate every simple left-module. The radical contains all nilpotent ideals, and if the algebra is finite-dimensional, the radical itself is a nilpotent ideal. A finite-dimensional algebra is then said to be semisimple if it... | Semisimple algebra | 0.803305 |
33,723 | By maximality of J1 as an ideal in J2 and also the semisimplicity of A, the algebra J 2 / J 1 {\displaystyle J_{2}/J_{1}\,} is simple. Proceed by induction in similar fashion proves the claim. For example, J3 is the Cartesian product of simple algebras J 3 ≃ J 2 × J 3 / J 2 ≃ J 1 × J 2 / J 1 × J 3 / J 2 . | Semisimple algebra | 0.803305 |
33,724 | So J1 is a unital subalgebra and an ideal of J2. Therefore, one can decompose J 2 ≃ J 1 × J 2 / J 1 . {\displaystyle J_{2}\simeq J_{1}\times J_{2}/J_{1}.} | Semisimple algebra | 0.803305 |
33,725 | × J n / J n − 1 × A / J n {\displaystyle A\simeq J_{1}\times J_{2}/J_{1}\times J_{3}/J_{2}\times ...\times J_{n}/J_{n-1}\times A/J_{n}} where each J i + 1 / J i {\displaystyle J_{i+1}/J_{i}\,} is a simple algebra. The proof can be sketched as follows. First, invoking the assumption that A is semisimple, one can show th... | Semisimple algebra | 0.803305 |
33,726 | Let A be a finite-dimensional semisimple algebra, and { 0 } = J 0 ⊂ ⋯ ⊂ J n ⊂ A {\displaystyle \{0\}=J_{0}\subset \cdots \subset J_{n}\subset A} be a composition series of A, then A is isomorphic to the following Cartesian product: A ≃ J 1 × J 2 / J 1 × J 3 / J 2 × . . . | Semisimple algebra | 0.803305 |
33,727 | If {Ai} is a finite collection of simple algebras, then their Cartesian product A=Π Ai is semisimple. If (ai) is an element of Rad(A) and e1 is the multiplicative identity in A1 (all simple algebras possess a multiplicative identity), then (a1, a2, ...) · (e1, 0, ...) = (a1, 0..., 0) lies in some nilpotent ideal of Π A... | Semisimple algebra | 0.803305 |
33,728 | Because A2 is an ideal of A and A is simple, A2 = A. By induction, An = A for every positive integer n, i.e. A is not nilpotent. Any self-adjoint subalgebra A of n × n matrices with complex entries is semisimple. | Semisimple algebra | 0.803305 |
33,729 | As the terminology suggests, simple algebras are semisimple. The only possible ideals of a simple algebra A are A and {0}. Thus if A is simple, then A is not nilpotent. | Semisimple algebra | 0.803305 |
33,730 | {\displaystyle J_{3}\simeq J_{2}\times J_{3}/J_{2}\simeq J_{1}\times J_{2}/J_{1}\times J_{3}/J_{2}.} The above result can be restated in a different way. For a semisimple algebra A = A1 ×...× An expressed in terms of its simple factors, consider the units ei ∈ Ai. The elements Ei = (0,...,ei,...,0) are idempotent eleme... | Semisimple algebra | 0.803305 |
33,731 | In thermodynamics and solid-state physics, the Debye model is a method developed by Peter Debye in 1912 for estimating the phonon contribution to the specific heat (Heat capacity) in a solid. It treats the vibrations of the atomic lattice (heat) as phonons in a box, in contrast to the Einstein photoelectron model, whic... | Debye model | 0.8033 |
33,732 | We can find the energy contribution for all oscillators oscillating at frequency ν {\displaystyle \nu } . Quantum harmonic oscillators can have energies E i = ( i + 1 / 2 ) h ν {\displaystyle E_{i}=(i+1/2)h\nu } where i = 0 , 1 , 2 , … {\displaystyle i=0,1,2,\dotsc } and using Maxwell-Boltzmann statistics, the number o... | Debye model | 0.8033 |
33,733 | An isometric action of a group G {\displaystyle G} on the hyperbolic plane H 2 {\displaystyle \mathbb {H} ^{2}} is called geometric if this action is properly discontinuous and cocompact. Every geometric action of G {\displaystyle G} on H 2 {\displaystyle \mathbb {H} ^{2}} induces a uniform convergence action of G {\di... | Convergence group | 0.803299 |
33,734 | It was already observed by Gromov that the natural action by translations of a word-hyperbolic group G {\displaystyle G} on its boundary ∂ G {\displaystyle \partial G} is a uniform convergence action (see for a formal proof). Bowditch proved an important converse, thus obtaining a topological characterization of word-h... | Convergence group | 0.803299 |
33,735 | In mathematics, a convergence group or a discrete convergence group is a group Γ {\displaystyle \Gamma } acting by homeomorphisms on a compact metrizable space M {\displaystyle M} in a way that generalizes the properties of the action of Kleinian group by Möbius transformations on the ideal boundary S 2 {\displaystyle ... | Convergence group | 0.803299 |
33,736 | In the mathematical areas of linear algebra and representation theory, a problem is wild if it contains the problem of classifying pairs of square matrices up to simultaneous similarity. Examples of wild problems are classifying indecomposable representations of any quiver that is neither a Dynkin quiver (i.e. the unde... | Wild problem | 0.803299 |
33,737 | The original patent forming the basis for the nCounter Analysis System was invented and licensed by The Institute for Systems Biology. The business plan was written by Amber Ratcliffe and Aaron Coe and won seed funding in multiple business plan competitions. NanoString was spun out of The Institute for Systems Biology ... | NanoString Technologies | 0.803296 |
33,738 | In addition, NanoString has developed the AtoMx™ Spatial Informatics Platform, a cloud-based informatics solution with advanced analytics and global collaboration capabilities, which is expected to launch in 2022. The AtoMx platform provides a comprehensive, integrated ecosystem for spatial biology insights, enabling g... | NanoString Technologies | 0.803296 |
33,739 | NanoString Technologies, Inc. (NASDAQ: NSTG) is a publicly-held biotech company offering discovery and translational research solutions.NanoString's products include the nCounter® Gene Expression System, the GeoMx® Digital Spatial Profiler, the CosMx™ Spatial Molecular Imager, and the AtoMx™ Spatial Informatics Platfor... | NanoString Technologies | 0.803296 |
33,740 | In mathematics, a projective range is a set of points in projective geometry considered in a unified fashion. A projective range may be a projective line or a conic. A projective range is the dual of a pencil of lines on a given point. For instance, a correlation interchanges the points of a projective range with the l... | Harmonic range | 0.803293 |
33,741 | Reverse pharmacology routinely uses docking for target identification. lead optimization – docking can be used to predict in where and in which relative orientation a ligand binds to a protein (also referred to as the binding mode or pose). This information may in turn be used to design more potent and selective analog... | Docking (molecular) | 0.803293 |
33,742 | One can think of molecular docking as a problem of “lock-and-key”, in which one wants to find the correct relative orientation of the “key” which will open up the “lock” (where on the surface of the lock is the key hole, which direction to turn the key after it is inserted, etc.). Here, the protein can be thought of as... | Docking (molecular) | 0.803293 |
33,743 | The Sippewissett microbial mat is a microbial mat in the Sippewissett Salt Marsh located along the lower eastern Buzzards Bay shoreline of Cape Cod, about 5 miles north of Woods Hole and 1 mile southwest of West Falmouth, Massachusetts, in the United States. The marsh has two regions, the Great Sippewisset Marsh to the... | Sippewissett microbial mat | 0.803291 |
33,744 | In cryptography, a pseudorandom permutation (PRP) is a function that cannot be distinguished from a random permutation (that is, a permutation selected at random with uniform probability, from the family of all permutations on the function's domain) with practical effort. | Pseudorandom permutation | 0.803289 |
33,745 | It was later shown that if a super-logarithmic number of rounds in the Feistel construction is used, then the resulting UP construction is secure even if the adversary gets all the intermediate round values along with the permutation output.There is also a theorem that has been proven in this regard which states that i... | Pseudorandom permutation | 0.803289 |
33,746 | {\displaystyle \varphi (u,v)=u\otimes v=cu\otimes c^{-1}v=\varphi (cu,c^{-1}v).\ } Considering the underlying projective spaces P(U) and P(V), this mapping becomes a morphism of varieties σ: P ( U ) × P ( V ) → P ( U ⊗ V ) . {\displaystyle \sigma :P(U)\times P(V)\to P(U\otimes V).\ } This is not only injective in the s... | Segre embedding | 0.803286 |
33,747 | In the language of linear algebra, for given vector spaces U and V over the same field K, there is a natural way to map their cartesian product to their tensor product. φ: U × V → U ⊗ V . {\displaystyle \varphi :U\times V\to U\otimes V.\ } In general, this need not be injective because, for u {\displaystyle u} in U {\d... | Segre embedding | 0.803286 |
33,748 | In symplectic geometry, the Clifford torus gives an example of an embedded Lagrangian submanifold of C2 with the standard symplectic structure. (Of course, any product of embedded circles in C gives a Lagrangian torus of C2, so these need not be Clifford tori.) The Lawson conjecture states that every minimally embedded... | Clifford torus | 0.803285 |
33,749 | If S1a and S1b each has a radius of 1 / 2 {\displaystyle \textstyle {\sqrt {1/2}}} , their Clifford torus product will fit perfectly within the unit 3-sphere S3, which is a 3-dimensional submanifold of R4. When mathematically convenient, the Clifford torus can be viewed as residing inside the complex coordinate space C... | Clifford torus | 0.803285 |
33,750 | In geometric topology, the Clifford torus is the simplest and most symmetric flat embedding of the Cartesian product of two circles S1a and S1b (in the same sense that the surface of a cylinder is "flat"). It is named after William Kingdon Clifford. It resides in R4, as opposed to in R3. To see why R4 is necessary, not... | Clifford torus | 0.803285 |
33,751 | Let R {\displaystyle R} be a Noetherian commutative ring. Hilbert's basis theorem has some immediate corollaries. By induction we see that R {\displaystyle R} will also be Noetherian. Since any affine variety over R n {\displaystyle R^{n}} (i.e. a locus-set of a collection of polynomials) may be written as the locus o... | Hilbert's basis theorem | 0.803284 |
33,752 | In mathematics, specifically commutative algebra, Hilbert's basis theorem says that a polynomial ring over a Noetherian ring is Noetherian. | Hilbert's basis theorem | 0.803284 |
33,753 | The modern formulation of the Muller–Schupp theorem is as follows:Let G be a finitely generated group with a finite marked generating set X. Then G is virtually free if and only if W ( G , X ) {\displaystyle {\mathcal {W}}(G,X)} is a context-free language. | Muller–Schupp theorem | 0.803283 |
33,754 | They also obtained results providing significant evidence in favor of the above conjecture of Brough. Nyberg-Brodda generalised the Muller-Schupp theorem from groups to ``special monoids", a class of semigroups containing, but strictly larger than, the class of groups, characterising such semigroups with a context-free... | Muller–Schupp theorem | 0.803283 |
33,755 | Gilman, Hermiller, Holt and Rees used the Muller–Schupp theorem to prove that a finitely generated group G is virtually free if and only if there exist a finite generating set X for G and a finite set of length-reducing rewrite rules over X whose application reduces any word to a geodesic word. Ceccherini-Silberstein a... | Muller–Schupp theorem | 0.803283 |
33,756 | As a consequence, they show that the monadic theory of a ``context-free" graph (such as the Cayley graph of a virtually free group) is decidable, generalizing a classic result of Rabin for binary trees. Later Kuske and Lohrey proved that virtually free groups are the only finitely generated groups whose Cayley graphs h... | Muller–Schupp theorem | 0.803283 |
33,757 | In the case of torsion-free groups, the situation is simplified as the accessibility results are not needed and one instead uses Grushko theorem about the rank of a free product. In this setting, as noted in the original Muller and Schupp paper, the Muller–Schupp theorem says that a finitely generated torsion-free grou... | Muller–Schupp theorem | 0.803283 |
33,758 | Since finitely generated groups with context-free word problem are finitely presentable, Dunwoody's result together with the original Muller–Schupp theorem imply that a finitely generated group is virtually free if and only if it has context-free word problem (which is the modern formulation of the Muller–Schupp theore... | Muller–Schupp theorem | 0.803283 |
33,759 | The Muller–Schupp theorem is a far-reaching generalization of a 1971 theorem of Anisimov which states that for a finitely generated group G with a finite marked generating set X the word problem W ( G , X ) {\displaystyle {\mathcal {W}}(G,X)} is a regular language if and only if the group G is finite. At the time the 1... | Muller–Schupp theorem | 0.803283 |
33,760 | In mathematics, the Muller–Schupp theorem states that a finitely generated group G has context-free word problem if and only if G is virtually free. The theorem was proved by David Muller and Paul Schupp in 1983. | Muller–Schupp theorem | 0.803283 |
33,761 | The converse direction of the Muller–Schupp theorem is more straightforward. If G is a finitely generated virtually free group, then G admits a finite index normal subgroup N such that N is a finite rank free group. Muller and Schupp use this fact to directly verify that G has context-free word problem. | Muller–Schupp theorem | 0.803282 |
33,762 | This means that every closed path in Γ ( G , X ) {\displaystyle \Gamma (G,X)} can be, by adding several ``diagonals", decomposed into triangles in such a way that the label of every triangle is a relation in G of length at most K over X. They then use this triangulability property of the Cayley graph to show that eithe... | Muller–Schupp theorem | 0.803282 |
33,763 | The distinction between convergent and parallel evolution is somewhat unresolved in evolutionary biology. Some authors have claimed it is a false dichotomy, while others have argued that there are important distinctions. These debates are important when considering recurrent evolution because the basis for the distinct... | Recurrent evolution | 0.803281 |
33,764 | Therefore, this result should merely be thought of as showing "possibility" and providing a target that we should then strive to match constructively. Moreover, this result also highlights the difference between "error-correction/detection" and "non-malleability" since a result of this form could not be true for the fo... | Non-malleable codes | 0.803281 |
33,765 | This is a list of general topology topics. | List of general topology topics | 0.803279 |
33,766 | Discrete space Locally constant function Trivial topology Cofinite topology Finer topology Product topology Restricted product Quotient space Unit interval Continuum (topology) Extended real number line Long line (topology) Sierpinski space Cantor set, Cantor space, Cantor cube Space-filling curve Topologist's sine cur... | List of general topology topics | 0.803279 |
33,767 | Baire category theorem Nowhere dense Baire space Banach–Mazur game Meagre set Comeagre set | List of general topology topics | 0.803279 |
33,768 | T0 space T1 space Hausdorff space Completely Hausdorff space Regular space Tychonoff space Normal space Urysohn's lemma Tietze extension theorem Paracompact Separated sets | List of general topology topics | 0.803279 |
33,769 | Simply connected Semi-locally simply connected Path (topology) Homotopy Homotopy lifting property Pointed space Wedge sum Smash product Cone (topology) Adjunction space | List of general topology topics | 0.803279 |
33,770 | Limit point Net (topology) Filter (topology) Ultrafilter | List of general topology topics | 0.803279 |
33,771 | Topological space Topological property Open set, closed set Clopen set Closure (topology) Boundary (topology) Dense (topology) G-delta set, F-sigma set closeness (mathematics) neighbourhood (mathematics) Continuity (topology) Homeomorphism Local homeomorphism Open and closed maps Germ (mathematics) Base (topology), sub... | List of general topology topics | 0.803279 |
33,772 | Topological algebra Topological group Topological ring Topological vector space Topological module Topological abelian group Properly discontinuous Sheaf space | List of general topology topics | 0.803279 |
33,773 | Compact space Relatively compact subspace Heine–Borel theorem Tychonoff's theorem Finite intersection property Compactification Measure of non-compactness Paracompact space Locally compact space Compactly generated space Axiom of countability Sequential space First-countable space Second-countable space Separable space... | List of general topology topics | 0.803279 |
33,774 | Stone duality Stone's representation theorem for Boolean algebras Specialization (pre)order Sober space Spectral space Alexandrov topology Upper topology Scott topology Scott continuity Lawson topology | List of general topology topics | 0.803279 |
33,775 | Polytope Simplex Simplicial complex CW complex Manifold Triangulation Barycentric subdivision Sperner's lemma Simplicial approximation theorem Nerve of an open covering | List of general topology topics | 0.803279 |
33,776 | Metric topology Manhattan distance Ultrametric space P-adic numbers, p-adic analysis Open ball Bounded subset Pointwise convergence Metrization theorems Complete space Cauchy sequence Banach fixed-point theorem Polish space Hausdorff distance Intrinsic metric Category of metric spaces | List of general topology topics | 0.803279 |
33,777 | In molecular biology, barrier-to-autointegration factor (BAF) is a family of essential proteins that is highly conserved in metazoan evolution, and which may act as DNA-bridging proteins. BAF binds directly to double-stranded DNA, to transcription activators, and to inner nuclear membrane proteins, including lamin A fi... | Barrier-to-autointegration factor | 0.803277 |
33,778 | In a one-dimensional space, a ball is a line segment. In other contexts, such as in Euclidean geometry and informal use, sphere is sometimes used to mean ball. In the field of topology the closed n {\displaystyle n} -dimensional ball is often denoted as B n {\displaystyle B^{n}} or D n {\displaystyle D^{n}} while the o... | 4-ball (mathematics) | 0.803275 |
33,779 | The German biotechnology company MorphoSys generates human antibodies using its phage display-based 'HuCal' (Human Combinatorial Antibody Library) technology. In the late 1990s both companies found themselves jockeying for strong IP position in the area of therapeutic human antibody generation by way of a specific disp... | Cambridge Antibody Technology | 0.80327 |
33,780 | CAT was also behind belimumab, the anti-BlyS antibody drug marketed as Benlysta and the first new approved drug for systemic lupus in more than 50 years. In 2018, the Nobel Prize organisation awarded one quarter of the Nobel Prize in Chemistry to a founding member of CAT, Sir Greg Winter FRS "for the phage display of p... | Cambridge Antibody Technology | 0.80327 |
33,781 | Cambridge Antibody Technology (officially Cambridge Antibody Technology Group Plc, informally CAT) was a biotechnology company headquartered in Cambridge, England, United Kingdom. Its core focus was on antibody therapeutics, primarily using Phage Display and Ribosome Display technology. Phage Display Technology was use... | Cambridge Antibody Technology | 0.80327 |
33,782 | He was formerly with Index Ventures, having joined the venture capital firm in 2010.Jane Osbourn OBE joined CAT as a senior scientist in 1993. Osbourn was a co-author of several, high-impact publications to come out of CAT. When merged with MedImmune, after the acquisition by AstraZeneca, Osbourn became the site leader... | Cambridge Antibody Technology | 0.80327 |
33,783 | McCafferty founded a new therapeutic antibody discovery biotechnology company, IONTAS Ltd. In 2018, McCafferty's 1990 phage research paper was cited by the Nobel committee when awarding the chemistry prize to Sir Gregory Winter, George Smith and Frances Arnold.Kevin Johnson joined CAT in 1990, contributed to the discov... | Cambridge Antibody Technology | 0.80327 |
33,784 | Sir Aaron Klug OM FRS FMedSci HonFRMS, a Nobel prize-winning laureate, was a British chemist and biophysicist, and winner of the 1982 Nobel Prize in Chemistry for his development of crystallographic electron microscopy. He sat on both the board and the scientific advisory board. Professor Peter Garland – appointed as a... | Cambridge Antibody Technology | 0.80327 |
33,785 | Chiswell announced he was standing down from CAT on 26 November 2001. During his time at CAT, Chiswell had established himself as a significant character in the biotechnology business. | Cambridge Antibody Technology | 0.80327 |
33,786 | CAT was founded by David Chiswell MBE and Sir Greg Winter, with major scientific contributions from John McCafferty. Sir Greg Winter FRS is credited with invented techniques to both humanise (1986) and, later, to fully humanise using phage display, antibodies for therapeutic uses. Previously, antibodies had been derive... | Cambridge Antibody Technology | 0.80327 |
33,787 | In 2013, Abbott split it business in half, whereby AbbVie became responsible for its research-based pharmaceutical business, and thus Humira. Humira went on to dominate the best-selling drugs lists. In 2016, the best selling drugs list researched by Genetic Engineering & Biotechnology News, published in March 2017, det... | Cambridge Antibody Technology | 0.80327 |
33,788 | Some reported that this activity represented the UK biotechnology industry's first-ever bidding war. Despite this improved offer from Celltech, OGS continued to recommend the CAT offer.Celltech continued to buy OGS shares and the OGS board pressed CAT to improve the terms of its offer as the Celltech shareholding reach... | Cambridge Antibody Technology | 0.80327 |
33,789 | On 23 January 2003 CAT made a share-based offer for Oxford Glycosciences (OGS) and at an Extraordinary General Meeting shareholders voted to approve the merger. In March of this year CAT saw a decline in its share price. Discussions regarding the applicability of the royalty offset provisions for HUMIRA with Abbott Lab... | Cambridge Antibody Technology | 0.80327 |
33,790 | On 1 November 2005 CAT announced it was acquiring two anti-CD22 immunotoxin products from Genencor, namely GCR-3888 and GCR-8015. Genencor is the biotechnology division of Danisco and the acquisition meant CAT would hire certain former Genencor key employees to be responsible for the development of the programmes.GCR-3... | Cambridge Antibody Technology | 0.80327 |
33,791 | Origination of Organismal Form: The Forgotten Cause in Evolutionary Theory, Gerd B. Müller and Stuart A. Newman The Cambrian "Explosion" of Metazoans, Simon Conway Morris Convergence and Homoplasy in the Evolution of Organismal Form, Pat Willmer Homology:The Evolution of Morphological Organization, Gerd B. Müller Only ... | Origination of Organismal Form | 0.803267 |
33,792 | Origination of Organismal Form: Beyond the Gene in Developmental and Evolutionary Biology is an anthology published in 2003 edited by Gerd B. Müller and Stuart A. Newman. The book is the outcome of the 4th Altenberg Workshop in Theoretical Biology on "Origins of Organismal Form: Beyond the Gene Paradigm", hosted in 199... | Origination of Organismal Form | 0.803267 |
33,793 | In mathematics, Probabilistic number theory is a subfield of number theory, which explicitly uses probability to answer questions about the integers and integer-valued functions. One basic idea underlying it is that different prime numbers are, in some serious sense, like independent random variables. This however is n... | Probabilistic number theory | 0.803267 |
33,794 | The drag resistance to a moving sphere, also known as Stokes' solution is here summarised. Given a sphere of radius a {\displaystyle a} , travelling at velocity U {\displaystyle U} , in a Stokes fluid with dynamic viscosity μ {\displaystyle \mu } , the drag force F D {\displaystyle F_{D}} is given by: F D = 6 π μ a U {... | Oseen tensor | 0.803265 |
33,795 | The adaptor hypothesis is a theoretical scheme in molecular biology to explain how information encoded in the nucleic acid sequences of messenger RNA (mRNA) is used to specify the amino acids that make up proteins during the process of translation. It was formulated by Francis Crick in 1955 in an informal publication o... | Adaptor hypothesis | 0.803264 |
33,796 | "The adaptor hypothesis was fully formalised in 1957. Crick presented the elaborate explanation in a lecture titled "Protein synthesis" on 19 September 1957 at the Society for Experimental Biology symposium on the Biological Replication of Macromolecules, held at University College London. The lecture was further expan... | Adaptor hypothesis | 0.803264 |
33,797 | Perhaps a special class of DNA-made proteins exists, almost always in small quantities (and thus normally overlooked). The template could consist of perhaps a single chain of RNA…Each adaptor molecule containing, say, a di- or trinucleotide would each be joined to its own amino acid by a special enzyme. These molecules... | Adaptor hypothesis | 0.803264 |
33,798 | There can be no objection at the present time to assuming that the genes are templates, but it is not necessary to assume that the genes act directly as templates for protein synthesis. Dounce was also close to a correct and fundamental explanation of the gene protein relationship, as he said: "the relationship between... | Adaptor hypothesis | 0.803264 |
33,799 | In radio astronomy it is difficult to achieve a good signal-to-noise ratio because of background noise from modern communications. Even for strong astronomical radio emission it is typical for SNR levels to be below 0 decibels. To counter this problem exposure of the antenna to the source over large periods of time are... | Array gain | 0.803261 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.