text
stringlengths 5
10.5k
| source
stringlengths 33
146
|
|---|---|
family of launch vehicles. In 1962, the US began Project Gemini, which flew 10 missions with two-man crews launched by Titan II rockets in 1965 and 1966. Gemini's objective was to support Apollo by developing American orbital spaceflight experience and techniques to be used during the Moon mission. Meanwhile, the USSR remained silent about their intentions to send humans to the Moon and proceeded to stretch the limits of their single-pilot Vostok capsule by adapting it to a two or three-person Voskhod capsule to compete with Gemini. They were able to launch two orbital flights in 1964 and 1965 and achieved the first spacewalk, performed by Alexei Leonov on Voskhod 2, on 8 March 1965. However, the Voskhod did not have Gemini's capability to maneuver in orbit, and the program was terminated. The US Gemini flights did not achieve the first spacewalk, but overcame the early Soviet lead by performing several spacewalks, solving the problem of astronaut fatigue caused by compensating for the lack of gravity, demonstrating the ability of humans to endure two weeks in space, and performing the first space rendezvous and docking of spacecraft. The US succeeded in developing the Saturn V rocket necessary to send the Apollo spacecraft to the Moon, and sent Frank Borman, James Lovell, and William Anders into 10 orbits around the Moon in Apollo 8 in December 1968. In 1969, Apollo 11 accomplished Kennedy's goal by landing Neil Armstrong and Buzz Aldrin on the Moon on 21 July and returning them safely on 24 July, along with Command Module pilot Michael Collins. Through 1972, a total of six Apollo missions landed 12 men to walk on the Moon, half of which drove electric powered vehicles on the surface. The crew of Apollo 13—Jim Lovell, Jack Swigert, and Fred Haise—survived an in-flight spacecraft
|
{"page_id": 18896, "title": "Human spaceflight"}
|
energy (MFE) secondary structure, the equilibrium base-pairing probabilities, its equilibrium concentration, including rigorous treatment of distinguishability issues that arise in the multi-stranded setting. === Design === The Design page allows users to design sequences for one or more strands intended to adopt an unpseudoknotted target secondary structure at equilibrium. Sequence design is formulated as an optimization problem with the goal of reducing the ensemble defect below a user-specified stop condition. For a candidate sequence and a given target secondary structure, the ensemble defect is the average number of incorrectly paired over the structural ensemble of the ordered complex. For a target secondary structure with N nucleotides, the algorithm seeks to achieve an ensemble defect below N/100. Empirically, the design algorithm exhibits asymptotic optimality as N increases: for sufficiently large N, the cost of sequence design is typically only 4/3 the cost of a single evaluation of the ensemble defect. === Utilities === The Utilities page allows users to evaluate, display, and annotate the equilibrium properties of a complex of interacting nucleic acid strands. The page accepts as input either sequence information, structure information, or both, performing diverse functions based on the information provided, including automatic layout and rendering of secondary structures with or without ideal helical geometry. In either case, the structure layout can be edited dynamically within the web application. == Implementation == The NUPACK web application is programmed within the Ruby on Rails framework, employing Ajax and the Dojo Toolkit to implement dynamic features and interactive graphics. Plots and graphics are generated using NumPy and matplotlib. The site is supported on current versions of the web browsers Safari, Chrome, and Firefox. The NUPACK library of analysis and design algorithms is written in the programming language C. Dynamic programs are parallelized using Message Passing Interface (MPI). == Terms of
|
{"page_id": 29145096, "title": "NUPACK"}
|
that it had measured radioactivity in the plant-site groundwater which was 10,000 times the government limit. The company did not think that this radioactivity had spread to drinking water. NISA questioned the radioactivity measurement and TEPCO is re-evaluating it. Some debris around the plant has been found to be highly radioactive, including a concrete fragment emanating 900 mSv/h. ==== Air and direct radiation ==== Air outside, but near, unit 3 was reported at 70 mSv/h on 26 April 2011. This was down from radiation levels as high as 130 mSv/h near units 1 and 3 in late March. Removal of debris reduced the radiation measurements from localized highs of up to 900 mSv/h to less than 100 mSv/h at all exterior locations near the reactors; however, readings of 160 mSv/h were still measured at the waste-treatment facility. === Discharge to seawater and contaminated sealife === Results revealed on 22 March from a sample taken by TEPCO about 100 m south of the discharge channel of units 1–4 showed elevated levels of Cs-137, caesium-134 (Cs-134) and I-131. A sample of seawater taken on 22 March 330 m south of the discharge channel (30 kilometers off the coastline) had elevated levels of I-131 and Cs-137. Also, north of the plant elevated levels of these isotopes were found on 22 March (as well as Cs-134, tellurium-129 and tellurium-129m (Te-129m)), although the levels were lower. Samples taken on 23 and/or 24 March contained about 80 Bq/mL of iodine-131 (1850 times the statutory limit) and 26 Bq/mL and caesium-137, most likely caused by atmospheric deposition. By 26 and 27 March this level had decreased to 50 Bq/mL (11) iodine-131 and 7 Bq/mL (2.9) caesium-137 (80 times the limit). Hidehiko Nishiyama, a senior NISA official, stated that radionuclide contamination would "be very diluted by the time
|
{"page_id": 31275000, "title": "Radiation effects from the Fukushima nuclear accident"}
|
some combination. ==== Necessary ==== For x to be a necessary cause of y, the presence of y must imply the prior occurrence of x. The presence of x, however, does not imply that y will occur. Necessary causes are also known as "but-for" causes, as in y would not have occurred but for the occurrence of x.: 261 ==== Sufficient causes ==== For x to be a sufficient cause of y, the presence of x must imply the subsequent occurrence of y. However, another cause z may independently cause y. Thus the presence of y does not require the prior occurrence of x. ==== Contributory causes ==== For x to be a contributory cause of y, the presence of x must increase the likelihood of y. If the likelihood is 100%, then x is instead called sufficient. A contributory cause may also be necessary. == Model == === Causal diagram === A causal diagram is a directed graph that displays causal relationships between variables in a causal model. A causal diagram includes a set of variables (or nodes). Each node is connected by an arrow to one or more other nodes upon which it has a causal influence. An arrowhead delineates the direction of causality, e.g., an arrow connecting variables A {\displaystyle A} and B {\displaystyle B} with the arrowhead at B {\displaystyle B} indicates that a change in A {\displaystyle A} causes a change in B {\displaystyle B} (with an associated probability). A path is a traversal of the graph between two nodes following causal arrows. Causal diagrams include causal loop diagrams, directed acyclic graphs, and Ishikawa diagrams. Causal diagrams are independent of the quantitative probabilities that inform them. Changes to those probabilities (e.g., due to technological improvements) do not require changes to the model. === Model elements
|
{"page_id": 6672748, "title": "Causal model"}
|
Robert Irving Soare is an American mathematician. He is the Paul Snowden Russell Distinguished Service Professor of Mathematics and Computer Science at the University of Chicago, where he has been on the faculty since 1967. He proved, together with Carl Jockusch, the low basis theorem, and has done other work in mathematical logic, primarily in the area of computability theory. His doctoral students at the University of Chicago have included Barbara Csima. In 2012 he became a fellow of the American Mathematical Society. == Selected publications == Soare, R. (2016). Turing Computability - Theory and Applications. Springer-Verlag. ISBN 978-3-642-31932-7. Soare, R. (1987). Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. Springer-Verlag. ISBN 3-540-15299-7. C. G. Jockusch Jr. and R. I. Soare, "Π(0, 1) Classes and Degrees of Theories" in Transactions of the American Mathematical Society (1972).[1] == See also == Jockusch–Soare forcing == References == == External links == Professional homepage
|
{"page_id": 2660900, "title": "Robert I. Soare"}
|
October 2022. It has four medium motors from Spike Prime, two sensors (distance sensor and color/light sensor) also from Spike Prime, a Spike Prime hub with a six-axis gyroscope, an accelerometer, and support for controllers and phone control. It also has 902+ Lego Technic elements. This set was discontinued in 2022 with Lego promising app support through 2024. == Programming languages == == Use in education == Mindstorms kits are also sold and used as an educational tool, originally through a partnership between Lego and the MIT Media Laboratory. The educational version of the products is called Mindstorms for Schools or Mindstorms Education, and later versions come with the ROBOLAB GUI-based programming software, developed at Tufts University using the National Instruments LabVIEW as an engine. == Use in Competition == Due to its user friendliness towards children, Lego Mindstorms has been used as a platform for several child-oriented robotics competitions, most prominently the FIRST Lego League (FLL), but also World Robot Olympiad or Robocup Junior FIRST Lego League Challenge (founded as FIRST Lego League) is a robotics competition that uses Lego Mindstorms products. It was founded in 1998 concurrent with the launch of LEGO Mindstorms and continues to exist to this day. It is a collaboration between FIRST and The Lego Group to involve a lower age bracket than the FIRST Robotics Competition. FLL teams consist of children between the ages of 9 and 14, and an adult coach. == See also == FIRST Lego League World Robot Olympiad (WRO) Robofest FIRST Tech Challenge RoboCup Junior Lego Education (WeDo 2.0) Big Trak iRobot Create Robotis Bioloid The Robotic Workshop Robotics suite C-STEM Studio Botball CubeStormer II Cubestormer 3 Arduino DIY Kindle Scanner == Notes == == References == == Further reading == Bagnall, Brian. Maximum Lego NXT: Building Robots with
|
{"page_id": 198856, "title": "Lego Mindstorms"}
|
of the producer class, and became the ruler of Rome; the second, Tōz, was the ancestor of the warrior-aristocracy, and became the ruler of Turkestan and the desert; the third, Ēriz, was the ancestor of the priesthood, and became the ruler of Iran and India. This variant of the myth had, however, undergone some modifications proper to Zoroastrianism, so that the dominant class descended from the youngest son of Ferēdūn was that of the priests rather than the warrior aristocracy. Some aspects of the original version of the myth were nevertheless still present, so that Ferēdūn still gave to Ēriz the xᵛarᵊnah, which was normally an attribute of the kings and of the warrior aristocracy; and the power of Ēriz it itself described in the Ayādgār-ī Jāmāspīg as consisting of xvatāyīh u pātexšāhīh, that is of royalty and rulership. In the Dēnkard, Ēriz instead received from his father the vāxš (𐬬𐬁𐬑𐬱), that is speech, due to the replacement of the original royal attributes of Ēriz by priestly ones. The roles of the sons of Ferēdūn as the ancestors of three peoples parallel the second version of the Scythian genealogical myth recorded by Herodotus of Halicarnassus, where the sons of "Hēraklēs" each became the ancestors of a Scythic tribe. ====== The sons of Mihr-Narseh ====== In the 5th century AD, the Sasanid wuzurg framadār Mihr-Narseh had his three sons appointed to important positions at the head of the three estates of Persian society: the eldest son was named the hērbadān hērbad, which was the second highest position within the clerical hierarchy; the second son was appointed as the vāstryōšān-sālār, that is the head of the agriculturists, who was also the minister in charge of taxation and finance; the third son became the artēštārān-sālār, that is the head of the warriors, and
|
{"page_id": 72851094, "title": "Scythian genealogical myth"}
|
Miss. The Indigo Book 166 indigobook-2.0-rev2023-2 Category Dates Abbreviation Smedes and Marshall 1843–1850 e.g., 9 Miss. (1 S. & M.) Howard 1834–1843 e.g., 2 Miss. (1 Howard) Walker 1818–1832 1 Miss. (1 Walker) Mississippi Decisions 1820–1885 Miss. Dec. Court of Appeals (Miss. Ct. App.): Cite to So. 2d or So. 3d. Southern Reporter 1995–date So. 2d, So. 3d Statutory compilations: Cite to Miss. Code Ann. (published by LexisNexis). Mississippi Code 1972 Annotated (LexisNexis) Miss. Code Ann. § x-x-x () West’s Annotated Mississippi Code Miss. Code Ann. § x-x-x (West ) Session laws: Cite to Miss. Laws. General Laws of Mississippi Miss. Laws Mississippi General Laws Advance Sheets (LexisNexis) - Miss. Laws Adv. Sh. (LexisNexis) West's Mississippi Legislative Service Miss. Legis. Serv. (West) Administrative compilation Code of Mississippi Rules (LexisNexis) - Miss. Code R. § x (LexisNexis ) Administrative register Mississippi Government Register (LexisNexis) Miss. H. TABLES > indigobook-2.0-rev2023-1 167 Category Dates Abbreviation Gov’t Reg. (LexisNexis ) Local Notes: Mississippi has adopted a public domain citation format for cases after July 1, 1997. See Miss. R. App. P. 28(f), /Rules%20of%20Appellate%20Procedure%20Current.pdf. Examples: Okoloise v. Yost , 2017-CA-01472-SCT (Miss. 2019). Okoloise v. Yost , 2017-CA-01472-SCT (¶ 30) (Miss. 2019). Missouri Supreme Court (Mo.): Cite to S.W., S.W.2d, or S.W.3d. South Western Reporter 1886–date S.W., S.W.2d, S.W.3d Missouri Reports 1821–1956 Mo. Court of Appeals (Mo. Ct. App.): Cite to S.W., S.W.2d, or S.W.3d. South Western Reporter 1902–date S.W., S.W.2d, S.W.3d Missouri Appeals Reports 1876–1954 Mo. App. Statutory compilations: Cite to Mo. Rev. Stat. Missouri Revised Statutes Mo. Rev. Stat. § x.x () Vernon’s Annotated Missouri Statutes (West) Mo. Ann. Stat. § x.x (West ) Session laws: Cite to Mo. Laws. Session Laws of Missouri Mo. Laws Missouri Legislative Service (West) Mo. Legis. The Indigo Book 168 indigobook-2.0-rev2023-2 Category Dates Abbreviation Serv. (West) Administrative
|
{"source": 2291, "title": "from dpo"}
|
Electronic (doepfer.de) PicsEngine - beautiful new Cappuccino app for storing and sharing photos (picsengine.com) Show HN: “Who Is Hiring?” Stats Broken Down by Month (gosmartsolutions.com) Odd Jobs on Disco Street: An Introduction to BASIC (discorunner.com) Weather: On a Strictly Need to Know Basis (imsoocd.com) Introduction to The Developer's Passive Income (developerspassiveincome.com) Flappy Thirds (tef.github.io) Introduction of C4 traits into rice to increase photosynthetic efficiency (c4rice.com) Motion Experiments (michaelvillar.com) Show HN: LaraJobs – Jobs for web artisans (larajobs.com) Ask HN: Review our startup (bitloot) (bitloot.com) Analysts Say Apple Should Buy DuckDuckGo Search Engine (baseread.com) Just launched: (talkminer.com) Strange Loop conference - freaking awesome. (strangeloop2010.com) Children’s Village Forever (thelocal.to) Show HN: A better way to track fitness goals (my nights and weekend project) (12labs.com) The Economic Consequences of the Peace by John Maynard Keynes, 1919 (marshlib.blogspot.com) The Four Stages of Burnout (stressdoc.com) Cheap Arduino Wireless Communications (glacialwanderer.com) Outlawry, Supervillians, and Modern Law (2010) (lawandthemultiverse.com) Build a Pi Zero W pocket projector (mickmake.com) List your accomplishments (timrpeterson.com) 4-Day Fast (48things.com) Mesh network before/after Hurricane Sandy in Red Hook, Brooklyn [pdf] (tidepools.co) Urbit: The Internet failed (slides and video) (personal-clouds.org) Pragmatic Array Oriented Functional Programming [video] (jiotalks.com) How to Understand Developing Native, Hybrid and Progressive Web Apps (creatorsneverdie.com) Show HN: Survival Thriller Game that uses Echolocation (lurking-game.com) Quick R (statmethods.net) The first web framework and ORM for C++ (touchideas.com) aSMtris – Tetris in assembly language (2016) (sebastianmihai.com) Elements of Ruby Style (pathf.com) 10 reasons you should start a startup before turning 25 (techiteasy.org) Squarespace: They Asked for My Password. (keepitlit.co) Domain hacks and the creation of Hipster Domain Finder (coffeecodecou.ch) Why the US is collapsing (falkvinge.com) Fake and cheap 3D metaball (edankwan.com) Using Deferreds in jQuery 1.5 (erichynds.com) Coronavirus and Crime – what the Covid is happening in SF? (goodcover.com) 50 Apps in
|
{"source": 2757, "title": "from dpo"}
|
non-occurrence of both “a” and “b.” Therefore, they refined the measures of Attraction and Reliance using the Delta P algorithm1 and ΔP Reliance (Expression 7b), with the formulas provided in Table 2 noted, most current approaches are statistically based on word association measures. In this study, we will use the aforementioned association measures to individually calculate the co-occurring salience of the constituent words in a sentence stem (internal association calculation) and then compare the extracted CSSs using these measures. Specifically, in Section [4.4]( we will illustrate the process of internal association calculation using MI as an example. In Section [5.2]( we will compare and evaluate the results derived from the combined use of MI and border entropy with those obtained through the utilization of alternative association measures. In addition, as mentioned earlier, most association measures are designed for evaluating the association between two words; it is necessary to adjust existing two-word association algorithms to measuring longer multi-words sequences, with a specific focus on sentence stems. The adjusted approach will be further detailed in Section [4.4]( 3. The concept of CSS and the corpus ------------------------------------ ### 3.1.
|
{"source": 4997, "title": "from dpo"}
|
F22 5 2.24 units, b c M Field forces d qm Q e Iron N S f Contact forces a Figure 5.1 Some examples of applied forces. In each case, a force is exerted on the object within the boxed area. Some agent in the environment external to the boxed area exerts a force on the object. Isaac Newton English physicist and mathematician (1642–1727) Isaac Newton was one of the most brilliant scientists in history. Before the age of 30, he formulated the basic concepts and laws of mechanics, discovered the law of universal gravita-tion, and invented the mathematical methods of calculus. As a consequence of his theories, Newton was able to explain the motions of the planets, the ebb and flow of the tides, and many special features of the motions of the Moon and the Earth. He also interpreted many fundamental obser-vations concerning the nature of light. His contributions to physical theories dominated scientific thought for two centuries and remain important today. > Bridgeman-Giraudon/Art Resource, NY www.aswarphysics.weebly.com 5.2 Newton’s First Law and Inertial Frames 113 and its direction is u 5 tan 21 (20.500) 5 226.6°. Because forces have been experi-mentally verified to behave as vectors, you must use the rules of vector addition to obtain the net force on an object. ## 5.2 Newton’s First Law and Inertial Frames We begin our study of forces by imagining some physical situations involving a puck on a perfectly level air hockey table (Fig. 5.3). You expect that the puck will remain stationary when it is placed gently at rest on the table. Now imagine your air hockey table is located on a train moving with constant velocity along a perfectly smooth track. If the puck is placed on the table, the puck again remains where it is placed. If
|
{"source": 6367, "title": "from dpo"}
|
is a moderately strong oxidizing agent, indium(III) is not, and many indium(I) compounds are powerful reducing agents. While the energy required to include the s-electrons in chemical bonding is lowest for indium among the group 13 metals, bond energies decrease down the group so that by indium, the energy released in forming two additional bonds and attaining the +3 state is not always enough to outweigh the energy needed to involve the 5s-electrons. Indium(I) oxide and hydroxide are more basic and indium(III) oxide and hydroxide are more acidic. A number of standard electrode potentials, depending on the reaction under study, are reported for indium, reflecting the decreased stability of the +3 oxidation state: Indium metal does not react with water, but it is oxidized by stronger oxidizing agents such as halogens to give indium(III) compounds. It does not form a boride, silicide, or carbide, and the hydride InH3 has at best a transitory existence in ethereal solutions at low temperatures, being unstable enough to spontaneously polymerize without coordination. Indium is rather basic in aqueous solution, showing only slight amphoteric characteristics, and unlike its lighter homologs aluminium and gallium, it is insoluble in aqueous alkaline solutions. === Isotopes === Indium has 39 known isotopes, ranging in mass number from 97 to 135. Only two isotopes occur naturally as primordial nuclides: indium-113, the only stable isotope, and indium-115, which has a half-life of 4.41×1014 years, four orders of magnitude greater than the age of the Universe and nearly 30,000 times greater than half life of thorium-232. The half-life of 115In is very long because the beta decay to 115Sn is spin-forbidden. Indium-115 makes up 95.7% of all indium. Indium is one of three known elements (the others being tellurium and rhenium) of which the stable isotope is less abundant in nature than
|
{"page_id": 14749, "title": "Indium"}
|
This page provides supplementary chemical data on bromine pentafluoride. == Material Safety Data Sheet == The handling of this chemical may incur notable safety precautions. It is highly recommended that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source such as Matheson Trigas, and follow its directions. == Structure and properties == == Thermodynamic properties == == Spectral data == == References ==
|
{"page_id": 8362544, "title": "Bromine pentafluoride (data page)"}
|
In number theory, Weyl's inequality, named for Hermann Weyl, states that if M, N, a and q are integers, with a and q coprime, q > 0, and f is a real polynomial of degree k whose leading coefficient c satisfies | c − a / q | ≤ t q − 2 , {\displaystyle |c-a/q|\leq tq^{-2},} for some t greater than or equal to 1, then for any positive real number ε {\displaystyle \scriptstyle \varepsilon } one has ∑ x = M M + N exp ( 2 π i f ( x ) ) = O ( N 1 + ε ( t q + 1 N + t N k − 1 + q N k ) 2 1 − k ) as N → ∞ . {\displaystyle \sum _{x=M}^{M+N}\exp(2\pi if(x))=O\left(N^{1+\varepsilon }\left({t \over q}+{1 \over N}+{t \over N^{k-1}}+{q \over N^{k}}\right)^{2^{1-k}}\right){\text{ as }}N\to \infty .} This inequality will only be useful when q < N k , {\displaystyle q<N^{k},} for otherwise estimating the modulus of the exponential sum by means of the triangle inequality as ≤ N {\displaystyle \scriptstyle \leq \,N} provides a better bound. == References == Vinogradov, Ivan Matveevich (1954). The method of trigonometrical sums in the theory of numbers. Translated, revised and annotated by K. F. Roth and Anne Davenport, New York: Interscience Publishers Inc. X, 180 p. Allakov, I. A. (2002). "On One Estimate by Weyl and Vinogradov". Siberian Mathematical Journal. 43 (1): 1–4. doi:10.1023/A:1013873301435. S2CID 117556877.
|
{"page_id": 69730965, "title": "Weyl's inequality (number theory)"}
|
CubeStormer 3 is a robot built primarily with Lego Mindstorms and the Samsung Galaxy S4. On 15 March 2014, at the Big Bang fair in Birmingham, England, the CubeStormer 3 broke the previous record, held by its predecessor, the CubeStormer II, for the fastest time to solve a Rubik's Cube. The previous Guinness World Records time was 5.270 seconds. The official time taken to solve the Rubik's Cube by the CubeStormer 3 was 3.253 seconds. This robot was created by inventors David Gilday and Mike Dobson. It took the two of them 18 months to perfect the technology of this robot. The robot was able to conquer the cube by use of four robotic hands. The robot is made out of LEGO and ARM architecture. Gilday and Dobson hope to beat their record again with another faster robot in the future. == External links == LEGO robot sets new Rubik's cube world record | Crave - CNET Video of Cubestormer3 Breaking World Record == References ==
|
{"page_id": 42233042, "title": "Cubestormer 3"}
|
foundation for products such as IBM Lotus Quickr for Domino, for document management, and IBM Sametime for instant messaging, audio and video communication, and web conferencing, and with Release 8.5, IBM Connections. In early releases of IBM Notes, there was considerable emphasis on client-side integration with the IBM Lotus SmartSuite environment. With Microsoft's increasing predominance in office productivity software, the desktop integration focus switched for a time to Microsoft Office. With the release of version 8.0 in 2007, based on the Eclipse framework, IBM again added integration with its own office-productivity suite, the OpenOffice.org-derived IBM Lotus Symphony. IBM Lotus Expeditor is a framework for developing Eclipse-based applications. Other IBM products and technologies have also been built to integrate with IBM Notes. For mobile-device synchronization, this previously included the client-side IBM Lotus Easysync Pro product (no longer in development) and IBM Notes Traveler, a newer no-charge server-side add-on for mail, calendar and contact sync. A recent addition to IBM's portfolio are two IBM Lotus Protector products for mail security and encryption, which have been built to integrate with IBM Notes. === Related software from other vendors === With a long market history and large installed base, Notes and Domino have spawned a large third-party software ecosystem. Such products can be divided into four broad, and somewhat overlapping classes: Notes and Domino applications are software programs written in the form of one or more Notes databases, and often supplied as NTF templates. This type of software typically is focused on providing business benefit from Notes' core collaboration, workflow and messaging capabilities. Examples include customer relationship management (CRM), human resources, and project tracking systems. Some applications of this sort may offer a browser interface in addition to Notes client access. The code within these programs typically uses the same languages available to an
|
{"page_id": 60408, "title": "HCL Notes"}
|
revealed that iron sulfide precipitates are the common minerals in the "smoke" and walls of the chimneys. In 2005, Neptune Resources NL, a mineral exploration company, applied for and was granted 35,000 km2 of exploration rights over the Kermadec Arc in New Zealand's Exclusive Economic Zone to explore for seafloor massive sulfide deposits, a potential new source of lead-zinc-copper sulfides formed from modern hydrothermal vent fields. The discovery of a vent in the Pacific Ocean offshore of Costa Rica, named the Medusa hydrothermal vent field (after the serpent-haired Medusa of Greek mythology), was announced in April 2007. The Ashadze hydrothermal field (13°N on the Mid-Atlantic Ridge, elevation -4200 m) was the deepest known high-temperature hydrothermal field until 2010, when a hydrothermal plume emanating from the Beebe site (18°33′N 81°43′W, elevation -5000 m) was detected by a group of scientists from NASA Jet Propulsion Laboratory and Woods Hole Oceanographic Institution. This site is located on the 110 km long, ultraslow spreading Mid-Cayman Rise within the Cayman Trough. In early 2013, the deepest known hydrothermal vents were discovered in the Caribbean Sea at a depth of almost 5,000 metres (16,000 ft). Oceanographers are studying the volcanoes and hydrothermal vents of the Juan de Fuca mid ocean ridge where tectonic plates are moving away from each other. Hydrothermal vents and other geothermal manifestations are currently being explored in the Bahía de Concepción, Baja California Sur, Mexico. == Distribution == Hydrothermal vents are distributed along the Earth's plate boundaries, although they may also be found at intra-plate locations such as hotspot volcanoes. As of 2009 there were approximately 500 known active submarine hydrothermal vent fields, with about half visually observed at the seafloor and the other half suspected from water column indicators and/or seafloor deposits. Rogers et al. (2012) recognized at least 11 biogeographic
|
{"page_id": 354588, "title": "Hydrothermal vent"}
|
Examples == === Individual === Rationalization can be used to avoid admitting disappointment: "I didn't get the job that I applied for, but I really didn't want it in the first place." Egregious rationalizations intended to deflect blame can also take the form of ad hominem attacks or DARVO. Some rationalizations take the form of a comparison. Commonly, this is done to lessen the perception of an action's negative effects, to justify an action, or to excuse culpability: "At least [what occurred] is not as bad as [a worse outcome]." In response to an accusation: "At least I didn't [worse action than accused action]." As a form of false choice: "Doing [undesirable action] is a lot better than [a worse action]." In response to unfair or abusive behavior from a separate individual or group to the person: "I must have done something wrong if they treat me like this." Based on anecdotal and survey evidence, John Banja states that the medical field features a disproportionate amount of rationalization invoked in the "covering up" of mistakes. Common excuses made are: "Why disclose the error? The patient was going to die anyway." "Telling the family about the error will only make them feel worse." "It was the patient's fault. If he wasn't so (sick, etc.), this error wouldn't have caused so much harm." "Well, we did our best. These things happen." "If we're not totally and absolutely certain the error caused the harm, we don't have to tell." "They're dead anyway, so there's no point in blaming anyone." In 2018, Muel Kaptein and Martien van Helvoort developed a model, called the Amoralizations Alarm Clock, that covers all existing amoralizations in a logical way. Amoralizations, also called neutralizations, or rationalizations, are defined as justifications and excuses for deviant behavior. Amoralizations are important explanations
|
{"page_id": 1706965, "title": "Rationalization (psychology)"}
|
Pole Vault system at Cape Dyer, and an additional link from Thule to Hall Beach and then ionosphere skip to the MCL at RCAF Station Bird in Manitoba. The installation of the Ballistic Missile Early Warning System (BMEWS) required links not only in the U.S. and Canada, but also across the Atlantic to Iceland and the UK where it also linked to existing radars. For this task a new system was installed, the North Atlantic Radio System (NARS). Bell was contracted to help build stations in this network, at Sondrestrom and Narssarssuaq on Greenland, linking to Cape Dyer. This system went operational in 1961. NARS also served as the trans-Atlantic portion of the Allied Command Europe Highband (ACE High) network which extended links across Europe. As the number of links increased, Pole Vault had to be upgraded to handle up to 70 circuits. === Shutdown === Advances in communications were continual from the 1950s and a number of new technologies emerged that began to compete with Pole Vault. Notable among these were greatly improved submarine cables, which led to the installation of a high-capacity system from Thule to Cape Dyer, and then on to Newfoundland. The addition of satellite communications for high-value links further eroded the value of the system. It was eventually shut down in 1975. Other sections of the system remained in use, notably the endpoint at Cape Dyer which was still used for NARS and ACE High traffic for some time. == Description == According to map prepared by the 1876 Radio Relay Squadron, the final layout of the system included nine primary stations. From the north end of the line, these were Frobisher Bay, Resolution Island, CFS Saglek, Hopedale Air Station, CFB Goose Bay, Saint Anthony Air Station, CFB Gander, Pepperrell Air Force Base in St.
|
{"page_id": 68068426, "title": "Pole Vault (communications system)"}
|
An abstract family of acceptors (AFA) is a grouping of generalized acceptors. Informally, an acceptor is a device with a finite state control, a finite number of input symbols, and an internal store with a read and write function. Each acceptor has a start state and a set of accepting states. The device reads a sequence of symbols, transitioning from state to state for each input symbol. If the device ends in an accepting state, the device is said to accept the sequence of symbols. A family of acceptors is a set of acceptors with the same type of internal store. The study of AFA is part of AFL (abstract families of languages) theory. == Formal definitions == === AFA Schema === An AFA Schema is an ordered 4-tuple ( Γ , I , f , g ) {\displaystyle (\Gamma ,I,f,g)} , where Γ {\displaystyle \Gamma } and I {\displaystyle I} are nonempty abstract sets. f {\displaystyle f} is the write function: f : Γ ∗ × I → Γ ∗ ∪ { ∅ } {\displaystyle f:\Gamma ^{*}\times I\rightarrow \Gamma ^{*}\cup \{\emptyset \}} (N.B. * is the Kleene star operation). g {\displaystyle g} is the read function, a mapping from Γ ∗ {\displaystyle \Gamma ^{*}} into the finite subsets of Γ ∗ {\displaystyle \Gamma ^{*}} , such that g ( ϵ ) = { ϵ } {\displaystyle g(\epsilon )=\{\epsilon \}} and ϵ {\displaystyle \epsilon } is in g ( γ ) {\displaystyle g(\gamma )} if and only if γ = ϵ {\displaystyle \gamma =\epsilon } . (N.B. ϵ {\displaystyle \epsilon } is the empty word). For each γ {\displaystyle \gamma } in g ( Γ ∗ ) {\displaystyle g(\Gamma ^{*})} , there is an element 1 γ {\displaystyle 1_{\gamma }} in I {\displaystyle I} satisfying f ( γ ′ ,
|
{"page_id": 14891304, "title": "Abstract family of acceptors"}
|
Dade-Collier Training and Transition Airport, formerly the Everglades Jetport, (IATA: TNT, ICAO: KTNT, FAA LID: TNT) is a public airport located within the Florida Everglades, 36 miles (58 km) west of the central business district of Miami, in Collier County, Florida, United States. It is owned by Miami-Dade County and operated by the Miami-Dade Aviation Department. The airport is on Tamiami Trail near the border between Dade and Collier counties in central South Florida. == History == Begun in 1968 as the Everglades Jetport (also known as Big Cypress Jetport or Big Cypress Swamp Jetport), the airport was planned to be the largest airport in the world, covering 39 square miles with six runways, and connected to both central Miami and the Gulf of Mexico by an expressway and monorail line. The airport would have been five times the size of JFK Airport in New York. At the time, the Boeing 2707 was under development and it was anticipated that supersonic aircraft would dominate long-haul air transportation. South Florida was viewed as an ideal location for an intercontinental SST hub due to the limitation that such aircraft would have to fly over water. Because of environmental concerns and the cancellation of the 2707 program, construction was halted in 1970 after the completion of just one 10,500' runway. The remaining land became the Big Cypress National Reserve. Although the airport was left abandoned and unfinished, it was still retained by the local government as a general aviation airport and (to a greater extent) training airport. It was originally heavily used by Pan Am and Eastern Airlines as a training airport, as the long runway at Dade-Collier could accommodate aircraft as large as Boeing 747s, and was equipped with a relatively new instrument landing system, which allowed pilots to train for landing
|
{"page_id": 9583109, "title": "Dade-Collier Training and Transition Airport"}
|
we need to perform random accesses, but we have only a limited amount of central memory, we may load the offset array only partially; more precisely, we only keep the offsets of nodes 0, J , 2 J , . . . , for a suitable parameter J (called the jump ). When we need to access the adjacency list S(x), we use the offset relative to node J bx/J c,and then we skip over (i.e., read and ignore) x mod J entries se-quentially. If J is large, we spare memory but lose time when ac-cessing a node; if J is small, we have faster access times but higher memory consumption. Note that J is not a compression parameter: rather, it is fixed when reading the graph into memory. A minor point to take into consideration here is the following: as explained in the previous sections, each adjacency list is stored in an almost self-delimiting format, except for the list of residuals, whose length k depends on the number β of links copied from the reference list, which may in turn depend on the outdegree |S(x −r)| of the reference list itself. Unfortunately, when skipping over an adjacency list we need to know k, and this fact implies that posi-tioning on the start of a given adjacency list may require a recursive 599 18.5 Mpages, 300 Mlinks from .uk R Average reference chain Bits/node Bits/link W = 1 W = 3 W = 7 W = 1 W = 3 W = 7 W = 1 W = 3 W = 7 ∞ 171.45 198.68 195.98 44.22 38.28 35.81 2.75 2.38 2.22 3 1.04 1.41 1.70 62.31 52.37 48.30 3.87 3.25 3.00 1 0.36 0.55 0.64 81.24 62.96 55.69 5.05 3.91 3.46 Tranpose ∞ 18.50 25.34 26.61 36.23 33.48 31.88
|
{"source": 1458, "title": "from dpo"}
|
(2.146) for the gamma distribution. 2.3. The Gaussian Distribution 101 From (2.150), we see that the effect of observing N data points is to increase the value of the coefficient a by N/ 2. Thus we can interpret the parameter a0 in the prior in terms of 2a0 ‘effective’ prior observations. Similarly, from (2.151) we see that the N data points contribute N σ 2ML /2 to the parameter b, where σ2ML is the variance, and so we can interpret the parameter b0 in the prior as arising from the 2a0 ‘effective’ prior observations having variance 2b0/(2 a0) = b0/a 0. Recall that we made an analogous interpretation for the Dirichlet prior. These distributions Section 2.2 are examples of the exponential family, and we shall see that the interpretation of a conjugate prior in terms of effective fictitious data points is a general one for the exponential family of distributions. Instead of working with the precision, we can consider the variance itself. The conjugate prior in this case is called the inverse gamma distribution, although we shall not discuss this further because we will find it more convenient to work with the precision. Now suppose that both the mean and the precision are unknown. To find a conjugate prior, we consider the dependence of the likelihood function on μ and λp(X|μ, λ ) = > N ∏ > n=1 ( λ 2π )1/2 exp { − λ 2 (xn − μ)2 } ∝ [ λ1/2 exp ( − λμ 2 2 )] N exp { λμ > N ∑ > n=1 xn − λ 2 > N ∑ > n=1 x2 > n } . (2.152) We now wish to identify a prior distribution p(μ, λ ) that has the same functional dependence on μ and λ as the likelihood
|
{"source": 3852, "title": "from dpo"}
|
could enable users to understand and evaluate possible flaws in learned reward functions. we propose counterfactual trajectory explanations (ctes) to interpret reward functions in reinforcement learning by contrasting an original with a counterfactual partial trajectory and the rewards they each receive. we derive six quality criteria for ctes and propose a novel monte-carlo-based algorithm for generating ctes that optimises these quality criteria. finally, we measure how informative the generated explanations are to a proxy-human model by training it on ctes. ctes are demonstrably informative for the proxy-human model, increasing the similarity between its predictions and the reward function on unseen trajectories. further, it learns to accurately judge differences in rewards between trajectories and generalises to out-of-distribution examples. although ctes do not lead to a perfect understanding of the reward, our method, and more generally the adaptation of xai methods, are presented as a fruitful approach for interpreting learned reward functions. Expand Abstract Exploring Responsible Applications of Synthetic Data to Advance Online Safety Research and Development Pica Johansson, Jonathan Bright, Shyam Krishna, Claudia Fischer, David Leslie Abstract: the use of synthetic data provides an opportunity to accelerate online safety research and development efforts while showing potential for bias mitigation, facilitating data storage and sharing, preserving privacy and reducing exposure to harmful content. however, the responsible use of synthetic data requires caution regarding anticipated risks and challenges. this short report explores the potential applications of synthetic data to the domain of online safety, and addresses the ethical challenges that effective use of the technology may present. Expand Abstract Pedagogical Alignment of Large Language Models Shashank Sonkar, Kangqi Ni, Sapana Chaudhary, Richard G. Baraniuk Abstract: in this paper, we introduce the novel concept of pedagogically aligned large language models (llms) that signifies a transformative shift in the application of llms within educational contexts.
|
{"source": 5788, "title": "from dpo"}
|
system models. Instead, different solutions can usually be proposed and none of these solutions might strictly be supe-rior to the others: each might have its own advantages and disadvantages, performing better under different network or load conditions, making differ-ent trade-offs between network traffic and message latency, etc. To rely on *DRAFT* 7 (22/11/2004) 1.4. SOFTWARE COMPONENTS CHAPTER 1. INTRO a modular approach allows the most suitable implementation to be selected when the application is deployed, or even commute in run-time among dif-ferent implementations in response to changes in the operational envelope of the application. Encapsulating tricky issues of distributed interactions within abstractions with well defined interfaces significantly helps reason about the correctness of the application and port it from one system to the other. We strongly believe that, in many distributed applications, especially those that require many-to-many interaction, building preliminary prototypes of the distributed application using several abstraction layers can be very helpful. Ultimately, one might indeed consider optimizing the performance of the final release of a distributed application and using some integrated prototype that implements several abstractions in one monolithic peace of code. How-ever, full understanding of each of the inclosed abstractions in isolation is fundamental to ensure the correctness of the combined code. ## 1.4 Software Components 1.4.1 Composition Model Notation. One of the biggest difficulties we had to face when thinking about describing distributed algorithms was to find out an adequate way to repre-sent these algorithms. When representing a centralized algorithm, one could decide to use a programming language, either by choosing an existing popular one, or by inventing a new one with pedagogical purposes in mind. Although there have indeed been several attempts to come up with dis-tributed programming languages, these attempts have resulted in rather com-plicated notations that would not have been viable to describe
|
{"source": 7326, "title": "from dpo"}
|
is small scale rural digesters, with about 200 biogas plants using human excreta and animal dung as feedstock. Linking up of public toilets with biogas digesters as a way of improving communal hygiene and combating hygiene-related communicable diseases including cholera and dysentery is also a notable solution within Ghana. == See also == Compost Ecological sanitation Fecal sludge management Manure Night soil Resource recovery Vermifilter toilet == Notes == == References == == External links == Documents on reuse of excreta in the library of the Sustainable Sanitation Alliance Photos on reuse of excreta in photo database of the Sustainable Sanitation Alliance
|
{"page_id": 44915117, "title": "Reuse of human excreta"}
|
the paraffin and wood. The departure of D'Agostino meant that the Rome group no longer had a chemist, and the subsequent loss of Rasetti and Segrè reduced the group to just Fermi and Amaldi, who abandoned the research into transmutation to concentrate on exploring the physics of slow neutrons. The current model of the nucleus in 1934 was the liquid drop model first proposed by George Gamow in 1930. His simple and elegant model was refined and developed by Carl Friedrich von Weizsäcker and, after the discovery of the neutron, by Werner Heisenberg in 1935 and Niels Bohr in 1936. It agreed closely with observations. In the model, the nucleons were held together in the smallest possible volume (a sphere) by the strong nuclear force, which was capable of overcoming the longer ranged Coulomb electrical repulsion between the protons. The model remained in use for certain applications into the 21st century, when it attracted the attention of mathematicians interested in its properties, but in its 1934 form it confirmed what physicists thought they already knew: that nuclei were static, and that the odds of a collision chipping off more than an alpha particle were practically zero. == Discovery == === Objections === Fermi won the 1938 Nobel Prize in Physics for his "demonstrations of the existence of new radioactive elements produced by neutron irradiation, and for his related discovery of nuclear reactions brought about by slow neutrons". However, not everyone was convinced by Fermi's analysis of his results. Ida Noddack suggested in September 1934 that instead of creating a new, heavier element 93, that: One could assume equally well that when neutrons are used to produce nuclear disintegrations, some distinctly new nuclear reactions take place which have not been observed previously with proton or alpha-particle bombardment of atomic nuclei. In
|
{"page_id": 64011351, "title": "Discovery of nuclear fission"}
|
a computationally simpler version of the method, and tested it on a study of the bus engine replacement problem. The method works by estimating conditional choice probabilities using simulation, then backing out the implied differences in value functions. == See also == Inverse reinforcement learning == References == == Further reading == Aguirregabiria, Victor; Mira, Pedro (2010). "Dynamic discrete choice structural models: A survey" (PDF). Journal of Econometrics. 156 (1). Elsevier BV: 38–67. doi:10.1016/j.jeconom.2009.09.007. ISSN 0304-4076. Keane, Michael P.; Wolpin, Kenneth I. (2009). "Empirical applications of discrete choice dynamic programming models". Review of Economic Dynamics. 12 (1): 1–22. doi:10.1016/j.red.2008.07.001. Rust, John (1987). "Optimal Replacement of GMC Bus Engines: An Empirical Model of Harold Zurcher". Econometrica. 55 (5): 999–1033. doi:10.2307/1911259. ISSN 0012-9682. JSTOR 1911259. Rust, John (1994). "Chapter 51 Structural estimation of markov decision processes". Handbook of Econometrics. Vol. 4. Elsevier. pp. 3081–3143. doi:10.1016/s1573-4412(05)80020-0. ISBN 978-0-444-88766-5. ISSN 1573-4412.
|
{"page_id": 60827351, "title": "Dynamic discrete choice"}
|
then f z ( x ) {\displaystyle f_{z}(x)} is equal to the product of greatest common divisors gcd ( f z ( x ) ; g 0 ( x ) ) {\displaystyle \gcd(f_{z}(x);g_{0}(x))} and gcd ( f z ( x ) ; g 1 ( x ) ) {\displaystyle \gcd(f_{z}(x);g_{1}(x))} . === Berlekamp's method === The property above leads to the following algorithm: Explicitly calculate coefficients of f z ( x ) = f ( x − z ) {\displaystyle f_{z}(x)=f(x-z)} , Calculate remainders of x , x 2 , x 2 2 , x 2 3 , x 2 4 , … , x 2 ⌊ log 2 p ⌋ {\textstyle x,x^{2},x^{2^{2}},x^{2^{3}},x^{2^{4}},\ldots ,x^{2^{\lfloor \log _{2}p\rfloor }}} modulo f z ( x ) {\displaystyle f_{z}(x)} by squaring the current polynomial and taking remainder modulo f z ( x ) {\displaystyle f_{z}(x)} , Using exponentiation by squaring and polynomials calculated on the previous steps calculate the remainder of x ( p − 1 ) / 2 {\textstyle x^{(p-1)/2}} modulo f z ( x ) {\textstyle f_{z}(x)} , If x ( p − 1 ) / 2 ≢ ± 1 ( mod f z ( x ) ) {\textstyle x^{(p-1)/2}\not \equiv \pm 1{\pmod {f_{z}(x)}}} then gcd {\displaystyle \gcd } mentioned below provide a non-trivial factorization of f z ( x ) {\displaystyle f_{z}(x)} , Otherwise all roots of f z ( x ) {\displaystyle f_{z}(x)} are either residues or non-residues simultaneously and one has to choose another z {\displaystyle z} . If f ( x ) {\displaystyle f(x)} is divisible by some non-linear primitive polynomial g ( x ) {\displaystyle g(x)} over F p {\displaystyle \mathbb {F} _{p}} then when calculating gcd {\displaystyle \gcd } with g 0 ( x ) {\displaystyle g_{0}(x)} and g 1 ( x ) {\displaystyle g_{1}(x)}
|
{"page_id": 61379828, "title": "Berlekamp–Rabin algorithm"}
|
It was a blockbuster hit and went on to gross over $914 million worldwide in its original theatrical run, surpassing Spielberg's own E.T. the Extra-Terrestrial to become the highest-grossing film of all time until the release of Titanic (1997), surpassing it in early 1998. The film received critical acclaim, with praise to its special effects, sound design, action sequences, John Williams's score, and Spielberg's direction. The film won 20 awards, including three Academy Awards for technical achievements in visual effects and sound design. Following its 20th anniversary re-release in 2013, Jurassic Park became the oldest film in history to surpass $1 billion in ticket sales and the 17th overall. In the years since its release, film critics and industry professionals have often cited Jurassic Park as one of the greatest movies in history. Its pioneering use of computer-generated imagery is considered to have paved the way for the visual effects practices of modern cinema. In 2018, it was selected for preservation in the United States National Film Registry by the Library of Congress as "culturally, historically, or aesthetically significant". The film spawned a multimedia franchise that includes six sequels, video games, theme park attractions, comic books and various merchandise. == Plot == Industrialist John Hammond has created Jurassic Park, a theme park of de-extincted dinosaurs, on the tropical island Isla Nublar, off of the coast of Costa Rica. After a Velociraptor kills a dinosaur handler, the park's investors, represented by lawyer Donald Gennaro, demand a safety certification, or else they'll pull their funding. Gennaro invites chaotician Ian Malcolm, and Hammond invites paleontologist Alan Grant and paleobotanist Ellie Sattler. Upon arrival, the group is shocked to see living Brachiosaurus and Parasaurolophus. At the park's visitor center, the group learns that the cloning was accomplished by extracting dinosaur DNA from prehistoric mosquitoes
|
{"page_id": 68485, "title": "Jurassic Park (film)"}
|
of new technologies, such as NREL- developed transpired solar collectors. == Repeal == Executive Order 13514 was replaced by Executive Order 13693, titled Planning for Federal Sustainability in the Next Decade, issued by Obama on March 19, 2015. On May 17, 2018, U.S. President Donald Trump signed an executive order repealing Executive Order 13693, including all requirements to reduce greenhouse gas pollution. The Trump Executive Order maintains the Federal government's commitment to energy efficiency and to meeting all statutory requirements to reduce energy use, to conserve water, and to increase the use of renewable energy. All previous Federal Environmental Executives and Federal Chief Sustainability officers including those serving under former Presidents Clinton, Bush, and Obama joined to call on the Trump Administration to maintain the Federal government's commitment to sustainability. == See also == Net metering Energy conservation == References ==
|
{"page_id": 31764581, "title": "Executive Order 13514"}
|
equations; calculations with numbers, points and vectors Calculus: direct input of functions (including piecewise-defined); intersections and roots of functions; symbolic derivatives and integrals (built-in CAS); sliders as parameters Parametric Graphs: Yes Implicit Polynomials: Yes Web Export: all constructions exportable as web pages as a Java applet Macros: usable both as tools with the mouse and as commands in the input field Animation: Yes Spreadsheet: Yes, the cells can contain any GeoGebra object (numbers, points, functions etc.) Dynamic text: Yes (including LaTeX) Platforms: Mac OS, Unix/Linux, Windows (any platform that supports Java 1.5 or later) Continuity: uses a heuristic 'near-to-approach' to avoid jumping objects === GeoKone.NET === GeoKone.NET is an interactive recursive natural geometry (or "sacred geometry") generator that runs in a web browser. GeoKone allows the user to create geometric figures using naturalistic rules of recursive copying, such as the Golden ratio. === Geolog === Geolog is a logic programming language for finitary geometric logic. === Geometry Expressions === Geometry Expressions Does symbolic geometry. It uses real symbolic inputs and returns real and symbolic outputs. It emphasises use with a Computer Algebra System (CAS), as well as exporting and sharing via interactive HTML5, Lua and OS X dashboard widget apps. === The Geometer's Sketchpad === The Geometer's Sketchpad (GSP) Deterministic Languages: English, Spanish, Danish, Russian, Korean, Thai, Traditional and Simplified Chinese, French, Lithuanian (current version); others (older versions) Macros: Yes ("custom tools" and "scripts") Java-applet: Yes Animation: Yes Locus: Yes, including point on locus Assignments: No Measurement/Calculations: Yes Platform: Windows, Mac OS, TI-92+, works under Wine Proofs: No === The Geometric Supposer === The Geometric Supposer === Géoplan-Géospace === === Geonext === Geonext was developed by the University of Bayreuth until 2007 and is completely implemented in Java. Its final version was 1.74. === GeoProof === GeoProof is a free
|
{"page_id": 1196020, "title": "List of interactive geometry software"}
|
Smart highways and smart roads are highways and roads that incorporate electronic technologies. They are used to improve the operation of connected and autonomous vehicles (CAVs), for traffic lights and street lighting, and for monitoring the condition of the road, as well as traffic levels and the speed of vehicles. == Intelligent transportation systems == Intelligent transportation systems usually refer to the use of information and communication technologies (rather than innovations in the construction of the roadway) in the field of road transport, infrastructure, vehicles, and users, and in traffic management and mobility management, as well as for interfaces with other modes of transportation. == Vehicle infrastructure integration == == Structural health monitoring == == Solar road panels == === Purpose === The principal idea of solar road panels is to utilize the space occupied by the roads to generate electricity via photovoltaic panels installed in place of a conventional concrete or asphalt road surface. Other functions for solar road panels have since then been proposed. One proposition is its use to power LED lights for creating dynamic road markings, such as lane markings, or warning messages such as “Reduce Speed” signs. Another function that has been proposed is using it to power heating elements that produce sufficient energy to clear ice and snow from roadways. It has also been suggested that they could power wireless charging technology to recharge the batteries of electric vehicles that drive over the panels. === Criticism === Critics have highlighted that solar roadways would be more expensive, due to the cost of panels and the required extensive maintenance associated. Furthermore, they have argued they are less productive than more conventional forms of solar power infrastructure, as the panels cannot be angled towards the Sun, requiring thicker glass to withstand the weight of traffic and
|
{"page_id": 22682196, "title": "Smart highway"}
|
In type theory, session types are used to ensure correctness in concurrent programs. They guarantee that messages sent and received between concurrent programs are in the expected order and of the expected type. Session type systems have been adapted for both channel and actor systems. Session types are used to ensure desirable properties in concurrent and distributed systems, i.e. absence of communication errors or deadlocks, and protocol conformance. == Binary versus multiparty session types == Interaction between two processes can be checked using binary session types, while interactions between more than two processes can be checked using multiparty session types. In multiparty session types interactions between all participants are described using a global type, which is then projected into local types that describe communication from the local view of each participant. Importantly, the global type encodes the sequencing information of the communication, which would be lost if we were to use binary session types to encode the same communication. == Formal definition of binary session types == Binary session types can be described using send operations ( ! {\displaystyle !} ), receive operations ( ? {\displaystyle ?} ), branches ( & {\displaystyle \&} ), selections ( ⊕ {\displaystyle \oplus } ), recursion ( r e c {\displaystyle rec} ) and termination ( e n d {\displaystyle end} ). For example, S = ! b o o l . ? i n t . e n d {\displaystyle S=\;!bool.?int.end} represents a session type S {\displaystyle S} which first sends a boolean ( ! b o o l {\displaystyle !bool} ), then receives an integer ( ? i n t {\displaystyle ?int} ) before finally terminating ( e n d {\displaystyle end} ). == Implementations == Session types have been adapted for several existing programming languages, including: lchannels (Scala) Effpi (Scala) STMonitor
|
{"page_id": 68644033, "title": "Session type"}
|
commenter explained that not all of its facilities offer the same programs or the same levels of medical or mental health services. An inmate, for example, who needs education, substance abuse treatment, and sex offender counseling may be transferred between facilities in order to meet his needs. The inmate population is always in flux and there are not always beds or program availability for every inmate at his security level. This commenter stated that the Department’s proposed language would put the State in the position of choosing between adding accessible cells and modifying paths of travel to programs and services at great expense or not altering old facilities, causing them to become in states of disrepair and obsolescent, which would be fiscally irresponsible. The Department is persuaded by these comments and has modified the alterations requirement in § 35.151(k)(2)(iv) in the final rule to allow that if it is technically infeasible to provide substitute cells in the same facility, cells can be provided elsewhere within the corrections system. _Number of accessible cells._ Section 232.2.1 of the 2004 ADAAG requires at least 2 percent, but no fewer than one, of the cells in newly constructed detention and correctional facilities to have accessibility features for individuals with mobility disabilities. Section 232.3 provides that, where special holding cells or special housing cells are provided, at least one cell serving each purpose shall have mobility features. The Department sought input on whether these 2004 ADAAG requirements are sufficient to meet the needs of inmates with mobility disabilities. A major association representing county jails throughout the country stated that the 2004 ADAAG 2 percent requirement for accessible cells is sufficient to meet the needs of county jails. Similarly, a large county sheriff’s department advised that the 2 percent requirement far exceeds the need at its
|
{"source": 54, "title": "from dpo"}
|
to addressing this question: 1. No source code modifications are allowed. 2. Source code modifications are allowed but are essentially impossible. For example, database benchmarks rely on standard database programs that are tens of millions of lines of code. The database companies are highly unlikely to make changes to enhance the performance for one particular computer. 3. Source modifications are allowed, as long as the altered version produces the same output. 40 ■ Chapter One Fundamentals of Quantitative Design and Analysis The key issue that benchmark designers face in deciding to allow modification of the source is whether such modifications will reflect real practice and provide useful insight to users, or whether these changes simply reduce the accuracy of the bench-marks as predictors of real performance. As we will see in Chapter 7, domain-specific architects often follow the third option when creating processors for well-defined tasks. To overcome the danger of placing too many eggs in one basket, collections of benchmark applications, called benchmark suites , are a popular measure of perfor-mance of processors with a variety of applications. Of course, such collections are only as good as the constituent individual benchmarks. Nonetheless, a key advan-tage of such suites is that the weakness of any one benchmark is lessened by the presence of the other benchmarks. The goal of a benchmark suite is that it will char-acterize the real relative performance of two computers, particularly for programs not in the suite that customers are likely to run. A cautionary example is the Electronic Design News Embedded Microproces-sor Benchmark Consortium (or EEMBC, pronounced “embassy ”) benchmarks. It is a set of 41 kernels used to predict performance of different embedded applications: automotive/industrial, consumer, networking, office automation, and telecommunications. EEMBC reports unmodified performance and “full fury ” performance, where almost anything goes.
|
{"source": 2300, "title": "from dpo"}
|
F. A Hebrew and English Lexicon of the Old Testament, Oxford: Clarendon Press, (no date). Catholic Encyclopaedia (The) http: //www. newadvent.org LAMPE, G. H. W. (ed. ) A Patristic Greek Lexicon, Oxford: Clarendon Press, 1961 - 1968 MOULTON, Harold K. (ed. ) The Analytical Greek Lexicon Revised, USA: Regency Reference Library (Zondervan Publishing House) 1978. SMITH, W. Latin-English Dictionary based upon the works of Forcellini and Freund., London: John Murray, 1855. 281 APPENDIX IChallenges to catechesis: how far do young people understand `Be sealed with the gift of the Holy Spirit'? Some questionnaire and interview data has been collected to investigate how far newly confirmed young people understand what it means to be sealed with the gift of the Holy Spirit'. This `opportunity sample' was too small' to be representative of general trends but provided indications of how snowball sampling2 might be used for further research. The summary below illustrates how some of the challenges to confirmation identified in Chapter 1 are perceived by diocesan coordinators, catechists and candidates at particular church level. Questionnaires The questionnaire used Likhert scale strength of agreement and priority questions to elicit what the young people understood about confirmation and in particular how far they understood the meaning of the bishop's words be sealed with the gift of the Holy Spirit'. The responsessuggest that confirmation is seen as a rite of passageand respondents may not understand that receiving the 'seal of the Spirit' at confirmation is more than becoming an adult in the Church in a superficial sense. 3 In summary, the questionnaires revealed that most candidates understand the Holy Spirit to be an active presence in their lives and responded that confirmation preparation has helped them understand what it means to receive the gift of the Holy Spirit. However candidates appear unclear about what
|
{"source": 4218, "title": "from dpo"}
|
Fakt , Beispiel , and Beispiele .Here is a typical example on how to use them: > \begin{frame} \frametitle{A Theorem on Infinite Sets} \begin{theorem} There exists an infinite set. \end{theorem} \begin{proof} This follows from the axiom of infinity. \end{proof} \begin{example}[Natural Numbers] The set of natural numbers is infinite. \end{example} \end{frame} In the following, only the English versions are discussed. The German ones behave analogously. \begin{theorem}[ 〈additional text 〉] 〈environment contents 〉 111 \end{theorem} Inserts a theorem. Only one 〈action specification 〉 may be given. If present, the 〈additional text 〉 is shown behind the word “Theorem” in rounded brackets (although this can be changed by the template). The appearance of the theorem is governed by the templates theorem begin and theorem end , see their description later on for details on how to change these. Every theorem is put into a block environment, thus the templates for blocks also apply. The theorem style (a concept from amsthm ) used for this environment is plain . In this style, the body of a theorem should be typeset in italics. The head of the theorem should be typeset in a bold font, but this is usually overruled by the templates. If the option envcountsect is given either as class option in one of the presentation modes or as an option to the package beamerarticle in article mode, then the numbering of the theorems is local to each section with the section number prefixing the theorem number; otherwise they are numbered consecutively throughout the presentation or article. I recommend using this option in article mode. By default, no theorem numbers are shown in the presentation modes. Example: > \begin{theorem}[Kummer, 1992] If $\#^_A^n$ is $n$-enumerable, then $A$ is recursive. \end{theorem} \begin{theorem}[Tantau, 2002] If $\#_A^2$ is $2$-fa-enumerable, then $A$
|
{"source": 6120, "title": "from dpo"}
|
next fish, the player's fish has to find enough food (which can include plants, crustaceans or coral as well as fish) to prevent its constantly decreasing energy bar from reaching 0 and death. The other main concern, besides avoiding predators, is health, which can only be repaired by finding a bluestreak cleaner wrasse while playing as a diurnal fish, or a banded coral shrimp while playing as a nocturnal fish, and moving next to it. Health takes a serious drop if the fish eats something poisonous to it, often a sea slug or sponge. The game also includes a field guide with information about the tropical fish featured in the game. Some versions included a teacher management system, allowing teachers to track students' scores and change preferences such as sound and music. == References == == External links == Odell Down Under at MobyGames
|
{"page_id": 3938944, "title": "Odell Down Under"}
|
the mixture to produce a reaction. The product was then subjected to carbonization at 900 degrees Celsius and the MCN's were generated. The researchers found that MCN's had a surface area of 1575 m^2/g, a pore size of 2.2 nm, and an average diameter of 115 nm. == External stimuli == There is a number of external triggers that can be used to release cargo on gated delivery systems. Examples of some triggers include pH, redox, enzyme, light, temperature, magnetic, ultrasound, and small molecule responsive gated systems. === pH === One of the most common triggers for drug delivery systems is pH. This stimulus is abundantly used in cancer therapies due to the fact that the tumor microenvironment is acidic. The development of pH triggered systems meant that drug could be introduced to the body but not be deployed until encountering the tumor microenvironment. Hence a possible and probable reason that pH triggered systems are so common. There are a few approaches to making these systems. One method is using linkages that dissolve at certain pH levels. As the system enters an acidic environment, the linkages that hold that gates onto the porous scaffold are hydrolyzed and the cargo can be released. Examples of pH linkages are imine, amides, esters, and acetals. Another method that can be used is protonation. This method relies on electrostatic interactions between the gate molecule and the porous scaffold. The two will be linked together with a certain molecule, for example, acetylated carboxymethyl. When the system reaches an acidic environment, protonation of the molecule is initiated. The protonation causes a disruption in the linkage and the cargo can be released. === Redox === Redox reactions are also used for gated delivery systems. Within cells and the bloodstream there are several reducing agents that can be
|
{"page_id": 70675314, "title": "Gated drug delivery systems"}
|
disease (e.g. genetic disease, cancer, organ/tissue failure), as well as biological computing (e.g. DNA computing) and agriculture (target delivery of pesticides, hormones and fertilizers. The impact of bionanoscience, achieved through structural and mechanistic analyses of biological processes at nanoscale, is their translation into synthetic and technological applications through nanotechnology. Nanobiotechnology takes most of its fundamentals from nanotechnology. Most of the devices designed for nano-biotechnological use are directly based on other existing nanotechnologies. Nanobiotechnology is often used to describe the overlapping multidisciplinary activities associated with biosensors, particularly where photonics, chemistry, biology, biophysics, nanomedicine, and engineering converge. Measurement in biology using wave guide techniques, such as dual-polarization interferometry, is another example. == Applications == Applications of bionanotechnology are extremely widespread. Insofar as the distinction holds, nanobiotechnology is much more commonplace in that it simply provides more tools for the study of biology. Bionanotechnology, on the other hand, promises to recreate biological mechanisms and pathways in a form that is useful in other ways. === Nanomedicine === Nanomedicine is a field of medical science whose applications are increasing. Nanobots The field includes nanorobots and biological machines, which constitute a very useful tool to develop this area of knowledge. In the past years, researchers have made many improvements in the different devices and systems required to develop functional nanorobots – such as motion and magnetic guidance. This supposes a new way of treating and dealing with diseases such as cancer; thanks to nanorobots, side effects of chemotherapy could get controlled, reduced and even eliminated, so some years from now, cancer patients could be offered an alternative to treat such diseases instead of chemotherapy, which causes secondary effects such as hair loss, fatigue or nausea killing not only cancerous cells but also the healthy ones. Nanobots could be used for various therapies, surgery, diagnosis, and
|
{"page_id": 2154572, "title": "Nanobiotechnology"}
|
Activities in 2008 included the distribution of refurbished computers to educational institutions (US$86 million), connectivity financing for small and medium enterprises ($15 million), conversion of all public institutions to online institutions ($70 million), and e-medicine ($5 million). USAID also promotes telecommunications connectivity for underserved and rural populations, as well as education and content to support economic and social development, through its Last Mile Initiative. Major contributors to this public-private alliance are Avantel, Intel, Cisco, Microsoft, Google, Polyvision, regional and local governments, and the MOC. Through the program, USG-provided equipment and training will connect 50 municipalities in the departments of Meta, Huila and Magdalena, including 21,000 small businesses and 325,000 institutions such as schools, hospitals, justice houses and local government offices. On the technical side, USAID assisted the MOC with the development of its National Plan and presently advises the CRT on "unbundling the local loop" to increase competition in broadband provision. Colombia remains behind Latin American neighbors such as Mexico, Brazil and Argentina in most IT indicators, but since the GOC privatized its state-owned National Telecommunications Company in 2003, the IT sector has expanded rapidly. The sector contributed a record 3 percent of total GDP in 2008. Local experts agree that IT sector will continue to experience accelerated growth as Colombia's domestic security situation improves and the legal economy strengthens. However, they also emphasize that continued private investment is key to the GOC achieving its lofty goals by 2019. ==== Dominican Republic ==== In October 2009, the Dominican Republic's telecoms regulator, Instituto Dominicano de las Telecomunicaciones (INDOTEL), has said it has plans to roll out fixed line telecoms services to an additional 1,000 rural communities as part of an initiative aimed at providing broadband and home voice services to all towns with more than 300 inhabitants. According to TeleGeography's GlobalComms
|
{"page_id": 24423543, "title": "National broadband plan"}
|
is the point at infinity on the projective line P F q 1 {\displaystyle \mathbb {P} _{\mathbb {F} _{q}}^{1}} and D = P 1 + ⋯ + P q {\displaystyle D=P_{1}+\dots +P_{q}} is the sum of the other F q {\displaystyle \mathbb {F} _{q}} -rational points. === One-point Hermitian codes === The Hermitian curve is given by the equation x q + 1 = y q + y {\displaystyle x^{q+1}=y^{q}+y} considered over the field F q 2 {\displaystyle \mathbb {F} _{q^{2}}} . This curve is of particular importance because it meets the Hasse–Weil bound with equality, and thus has the maximal number of affine points over F q 2 {\displaystyle \mathbb {F} _{q^{2}}} . With respect to algebraic geometry codes, this means that Hermitian codes are long relative to the alphabet they are defined over. The Riemann–Roch space of the Hermitian function field is given in the following statement. For the Hermitian function field F q 2 ( x , y ) {\displaystyle \mathbb {F} _{q^{2}}(x,y)} given by x q + 1 = y q + y {\displaystyle x^{q+1}=y^{q}+y} and for m ∈ Z + {\displaystyle m\in \mathbb {Z} ^{+}} , the Riemann–Roch space L ( m P ∞ ) {\displaystyle {\mathcal {L}}(mP_{\infty })} is L ( m P ∞ ) = ⟨ x a y b : 0 ≤ b ≤ q − 1 , a q + b ( q + 1 ) ≤ m ⟩ , {\displaystyle {\mathcal {L}}(mP_{\infty })=\left\langle x^{a}y^{b}:0\leq b\leq q-1,aq+b(q+1)\leq m\right\rangle ,} where P ∞ {\displaystyle P_{\infty }} is the point at infinity on H q ( F q 2 ) {\displaystyle {\mathcal {H}}_{q}(\mathbb {F} _{q^{2}})} . With that, the one-point Hermitian code can be defined in the following way. Let H q {\displaystyle {\mathcal {H}}_{q}} be the Hermitian curve defined over F q
|
{"page_id": 1882683, "title": "Algebraic geometry code"}
|
Based on the Sun == The position of the Sun in the sky can be used for orientation if the general time of day is known. In the morning the Sun rises roughly in the east (due east only on the equinoxes) and tracks southward (in the northern hemisphere) or northward (in the southern hemisphere). In the evening, the Sun sets in the west, again roughly and only due west exactly on the equinoxes. In the middle of the day, it is to the south for viewers in the northern hemisphere, who live north of the Tropic of Cancer, and the north for those in the southern hemisphere, who live south of the Tropic of Capricorn. This method does not work very well when closer to the equator (i.e. between the Tropic of Cancer and the Tropic of Capricorn) since, in the northern hemisphere, the sun may be directly overhead or even to the north in summer. Conversely, at low latitudes in the southern hemisphere the sun may be to the south of the observer in summer. In these locations, one needs first to determine whether the sun is moving from east to west through north or south by watching its movements—left to right means it is going through south while the right to left means it is going through north; or one can watch the sun's shadows. If they move clockwise, the sun will be in the south at midday, and if they move anticlockwise, then the sun will be in the north at midday. The sun rises from east and sets in West. Because of the Earth's axial tilt, no matter what the location of the viewer, there are only two days each year when the sun rises precisely due east. These days are the equinoxes. On all
|
{"page_id": 71806847, "title": "Direction determination"}
|
include servomotors, HMIs, and controls. FA is a foundational FANUC technology with roots back to the 1970's when FANUC was marrying its servomotor product with computers to create the field of computer numerical control technology. Today, FA products continue to be used to create automated systems in over 100 countries around the world. It is common for the FA group to deliver controls and servomotors to machine tool builders who integrate them into a conventional CNC machine. A significant proportion of the world's CNC machines are powered by FANUC controls. === ROBOT === The robot group integrates FANUC servomotor and control technology into robotic arms for use in industrial environments. === Robomachine === FANUC also produces a range of finished machines included ROBODRILL machining centers, ROBOSHOT injection molding machines, and ROBOCUT EDM machines. == Subsidiaries and joint ventures == FANUC Europe Corporation S.A., a sister company, is headquartered in Luxembourg, with customers in Europe, and which provides sales, service and support in Europe and abroad. FANUC America Corporation is responsible for FANUC operations in North and South America. The current incarnation, organized in 2013, unifies FANUC activities in the Americas, including the former FANUC Robotics America Corporation (1992-2013) and FANUC CNC America (2010-2013), which succeeded an earlier incarnation of FANUC America Corporation. FANUC Robotics America Corporation (1992-2013) supplied robotic automation in North and South America, with over 240,000 robots installed. It also produced software, controls, and vision products that aid in the development of robotic systems. Headquartered in Rochester Hills, Michigan, the company had 10 regional locations in the U.S., Canada, Mexico, and Brazil. The company provided these systems for applications including automotive and fabricated metals to medical devices and plastics. It was founded in 1982 as a joint venture between FANUC Ltd and General Motors Corporation, named GMFanuc Robotics
|
{"page_id": 1430758, "title": "FANUC"}
|
Aganirsen (previously GS-101) is a 25 mer DNA antisense oligonucleotide therapeutic inhibiting insulin receptor substrate-1 (IRS-1), which is being investigated as a topical treatment for ocular neovascularization. Aganirsen is a candidate for the treatment of ocular neovascularization in patients with front of the eye (cornea) or back of the eye (retinal) diseases, including progressive corneal neovascularization in patients with infectious keratitis and wet age related macular degeneration (AMD). Aganirsen actively inhibits the production of IRS-1 by binding IRS-1 mRNA (antisense therapy). Aganirsen therefore induces an upstream inhibition of the neovascularization pathway, most notably by inhibiting excess VEGF and Il-1β expression. == Structure == Aganirsen is a 25-mer (5'-TATCCGGAGGGCTCGCCATGCTGCT-3'), first-generation antisense oligonucleotide (phosphorothioate linkage). Aganirsen has a molecular mass of 8036 (Da), a melting point of approximately 64.2 °C, and a GC content of 64%. Aganirsen is highly soluble in water. == Mechanism of action == IRS-1 is an intracellular docking protein deprived of enzymatic activity. IRS-1 is overexpressed in endothelial cells under neovascularization conditions. IRS-1 has been suggested as a target for the regulation of angiogenesis mediated by hypoxia, insulin and inflammation. IRS-1's main function is to act as a signal transmitter for intracellular pathways. IRS-1mainly interacts with the angiogenesis pathway by interacting with the VEGF-receptor complex. Aganirsen therefore reduces angiogenesis by inhibiting VEGF and inflammatory cytokines production upstream by specifically targeting IRS-1 mRNA. == Clinical development == The drug was discovered by S. Al-Mahmood, in Paris, France and then developed to Phase III in progressive corneal neovascularisation in patients with infectious keratitis and on the waiting list for Corneal Graft replacement (an EU Orphan Drug designation). The dose-dependent effect of topical Aganirsen on Choroidal Neovascularization has also been evaluated in a non-human primate (NHP) laser-induced model of wet-AMD. Aganirsen has also been investigated in Psoriasis, where it was found
|
{"page_id": 41579834, "title": "Aganirsen"}
|
Appeal to motive is a pattern of argument which consists in challenging a thesis by calling into question the motives of its proposer. It can be considered as a special case of the ad hominem circumstantial argument. As such, this type of argument is an informal fallacy. A common feature of appeals to motive is that only the possibility of a motive (however small) is shown, without showing the motive actually existed or, if the motive did exist, that the motive played a role in forming the argument and its conclusion. Indeed, it is often assumed that the mere possibility of motive is evidence enough. == Examples == "The Nature Conservancy promoted an "ivory-bill" in the Big Woods merely to raise funds from the public to purchase more conservation lands." "That website recommended ACME's widget over Megacorp's widget. But the website also displays ACME advertising on their site, so they must be biased in their review." The thesis in this case is the website's evaluation of the relative merits of the two products. "The referee is a New York City native, so his refereeing was obviously biased towards New York teams." In this case, the thesis consists of the referee's rulings. "My opponent argues on and on in favor of allowing that mall to be built in the center of town. What he won't tell you is that his daughter and her friends plan to shop there once it's open." == See also == == References ==
|
{"page_id": 985983, "title": "Appeal to motive"}
|
IITERNITI (Korean: 이터니티; RR: Iteoniti; formerly: ETERNITY) is a South Korean virtual band formed by Pulse9. The group debuted on March 22, 2021, with the single "I'm Real". The group consists of 11 members: Seoa, Sujin, Minji, Zae-in, Hyejin, Dain, Chorong, Jiwoo, Yeoreum, Sarang and Yejin. They are created with artificial intelligence technology, Deep Real. == History == On March 22, 2021, IITERNITI released their debut single "I'm Real", sung by Hyejin, Seoa, Yeoreum, Sujin and Minji. On August 25 and 26, Pulse9 released the teasers of sixth member, Dain's solo debut single "No Filter", and released the song on August 27. On September 19, 2023, it was confirmed that Eternity has rebranded to IITERNITI through IITERNITI's official Discord message. == Members == Yeoreum (여름) - leader, vocalist Minji (민지) - rapper, dancer Hyejin (혜진) - rapper Seoa (서아) Sujin (수진) - vocalist Dain (다인) Chorong (초롱) Zae-In (제인) - rapper Jiwoo (지우) Sarang (사랑) Yejin (예진) == Discography == === Singles === == See also == Aespa == References == == External links == Eternity Official Website (Korean) Julie Yoonnyung Lee and Amelia Hemphill, K-pop: the rise of the virtual girl bands, BBC News, 12 December 2022
|
{"page_id": 68657574, "title": "Eternity (group)"}
|
and any inferences that were derived from Pi. The sentences Pi+1 through Pn can then be added again. This is simple, and it guarantees that the knowledge base will be consistent, but retracting Pi requires retracting and reasserting n − i sentences as well as undoing and redoing all the inferences drawn from those sentences. For systems to which many facts are being added—such as large commercial databases—this is impractical. A more efficient approach is the justification-based truth maintenance system, or JTMS .JTMS In a JTMS, each sentence in the knowledge base is annotated with a justification consisting JUSTIFICATION of the set of sentences from which it was inferred. For example, if the knowledge base already contains P ⇒ Q, then T ELL (P ) will cause Q to be added with the justification {P, P ⇒ Q}. In general, a sentence can have any number of justifications. Justifica-tions make retraction efficient. Given the call R ETRACT (P ), the JTMS will delete exactly those sentences for which P is a member of every justification. So, if a sentence Q had the single justification {P, P ⇒ Q}, it would be removed; if it had the additional justi-fication {P, P ∨ R ⇒ Q}, it would still be removed; but if it also had the justification {R, P ∨ R ⇒ Q}, then it would be spared. In this way, the time required for retraction of P depends only on the number of sentences derived from P rather than on the number of other sentences added since P entered the knowledge base. The JTMS assumes that sentences that are considered once will probably be considered again, so rather than deleting a sentence from the knowledge base entirely when it loses all justifications, we merely mark the sentence as being out
|
{"source": 1019, "title": "from dpo"}
|
sufficient to empirically study various real-world aspects of these questions. In this paper, we contribute WCLD, a curated large dataset of 1.5 million criminal cases from circuit courts in the U.S. state of Wisconsin. We used reliable public data from 1970 to 2020 to curate attributes like prior criminal counts and recidivism outcomes. The dataset contains large number of samples from five racial groups, in addition to information like sex and age (at judgment and first offense). Other attributes in this dataset include neighborhood characteristics obtained from census data, detailed types of offense, charge severity, case decisions, sentence lengths, year of filing etc. We also provide pseudo-identifiers for judge, county and zipcode. The dataset will not only enable researchers to more rigorously study algorithmic fairness in the context of criminal justice, but also relate algorithmic challenges with various systemic issues. We also discuss in detail the process of constructing the dataset and provide a datasheet. The WCLD dataset is available at Poster #223 Optimal and Fair Encouragement Policy Evaluation and Learning Angela Zhou In consequential domains, it is often impossible to compel individuals to take treatment, so that optimal policy rules are merely suggestions in the presence of human non-adherence to treatment recommendations. In these same domains, there may be heterogeneity both in who responds in taking-up treatment, and heterogeneity in treatment efficacy. For example, in social services, a persistent puzzle is the gap in take-up of beneficial services among those who may benefit from them the most. When in addition the decision-maker has distributional preferences over both access and average outcomes, the optimal decision rule changes. We study identification, doubly-robust estimation, and robust estimation under potential violations of positivity. We consider fairness constraints such as demographic parity in treatment take-up, and other constraints, via constrained optimization. Our framework
|
{"source": 2773, "title": "from dpo"}
|
noun nr++++ singular adverbial noun (east, west, today, home, ...) nrs++++ plural adverbial noun NB: In the following pronoun tags, the number 1 is used to mark first person, while the letter l (i.e. lower case L) is used to mark reflexives. pp1a+pp1+++ first person subject pronoun + first person pronoun pp1a+pp1+++0 first person subject pronoun + 1st person pro. + contracted pp1o+pp1+++ first person object pronoun + first person pronoun pp$+pp1+++ possessive determiner + first person pronoun (my, our) ppl+pp1+++ singular reflexive pronoun + first person pronoun (myself) ppls+pp1+++ plural reflexive pronoun + first person pronoun (ourselves) pp2+pp2+++ second person pronoun + second person pronoun pp$+pp2+++ possessive determiner + second person pronoun (your) ppl+pp2+++ singular reflexive pronoun + second person pronoun (yourself) pp3a+pp3+++ third person subject pronoun + third person personal pronoun pp3o+pp3+++ third person object pronoun + third person personal pronoun pp3+pp3+++0 third person pronoun + 3rd person personal pro. + contracted pp$+pp3+++ possessive + 3rd pers. personal pro. (his, her, their) ppl+pp3+++ sg. reflexive pronoun + 3rd pers. personal pro. (her/himself) ppls+pp3+++ pl. reflexive pronoun + 3rd pers. personal pro. (themselves) pp3+it+++ third person pronoun + third person impersonal pronoun (it) pp$+it+++ possessive determiner + third person impersonal pronoun (its) pp$$++++ possessive pronoun (mine, yours, ...) pn"++++ multi-word nominal pronoun (no one, ...) pn++++ nominal pronoun (someone, everything, ...) ql++++ qualifier + (as, less, more, too) ql+amp+++ qualifier + amplifier (very) ql+emph+++ qualifier + emphatic (most) qlp++++ post-qualifier (enough, indeed) All adverb forms can be marked as 'splt' in Field 3 (e.g., rb+amp+splt++) to indicate that the adverb occurs within the auxiliary (e.g., they've probably been looking...). rb++++ general adverb rb"++++ multi-word adverb (at last, in general) rb+cnj adverb + conjunct (however, therefore, thus, ...) rb++neg++ neither rb+amp+++ adverb + amplifier (absolutely, completely, entirely, ...) rb+down+++ adverb
|
{"source": 4999, "title": "from dpo"}
|
Frequently Asked Questions,” Congressional Research Service, December 15, 2020, [ 126 Joseph L. Barloon et al., “USTR Relaunches Exclusion Process for China Section 301 Tariffs,” Skadden, Arps, Slate, Meagher & Flom, October 12, 2021 [ 127 Chad P. Bown and Cathleen Cimino-Isaacs, “Will Trump Invoke National Security to Start a Trade War?,” PIIE, July 5, 2017, [ 128 19 U.S.C. § 1862. 129 19 U.S.C. § 1862(d). 130 Chad P. Bown and Melina Kolb, “Trump’s Trade War Timeline: An Up-to-Date Guide,” PIIE, October 31, 2021, [ 131 Chad P. Bown, “Trump’s Long-awaited Steel and Aluminum Tariffs Are Just the Beginning,” PIIE, March 26, 2018, [ and Chad P. Bown and Melina Kolb, “Trump’s Trade War Timeline: An Up-to-Date Guide,” PIIE, October 31, 2021, [ 132 19 U.S.C. § 1307. 133 “Withhold Release Orders and Findings List,” Customs and Border Protection (CBP), [ 134 “DHS Cracks Down on Goods Produced by China’s State-Sponsored Forced Labor,” press release, CBP, September 14, 2020, [ and “The Department of Homeland Security Issues Withhold Release Order on Silica-Based Products Made by Forced Labor in Xinjiang,” press release, CBP, June 24, 2021, [ 135 Uyghur Forced Labor Prevention Act of 2021, Public Law No. 117-78, § 3, [ 136 “Sanctions Programs and Country Information,” Treasury Department, [ 137 “Reference Sheet on Economic Sanctions,” Brookings Institution, December 2020, [ 138 50 U.S.C. § 1701. 139 50 U.S.C. § 1701, 1702. 140 As of March 11, 2022. “Declared National Emergencies Under the National Emergencies Act,” Brennan Center, December 15, 2021, [ 141 50 U.S.C. §§ 1601-1651. 142 “Reference Sheet on Economic Sanctions,” Brookings Institution, December 2020, [ 143 As of March 27, 2022, based on author’s analysis of the Treasury Department’s Sanctions List Search and SDN spreadsheet, available at [ and [ (primary names). Figures exclude all entries
|
{"source": 6372, "title": "from dpo"}
|
although researchers aren't sure exactly how alum kills these cells. It has been speculated that the dying cells release DNA which serves as an immune alarm. Some studies found that DNA from dying cells causes them to adhere more tightly to helper T cells which ultimately leads to an increased release of antibodies by B cells. No matter what the mechanism is, alum is not a perfect adjuvant because it does not work with all antigens (e.g. malaria and tuberculosis). However, recent research indicates that alum formulated in a nanoparticle form rather than microparticles can broaden the utility of alum adjuvants and promote stronger adjuvant effects. === Organic adjuvants === Freund's complete adjuvant is a solution of inactivated Mycobacterium tuberculosis in mineral oil developed in 1930. It is not safe enough for human use. A version without the bacteria, that is only oil in water, is known as Freund's incomplete adjuvant. It helps vaccines release antigens for a longer time. Despite the side effects, its potential benefit has led to a few clinical trials. Squalene is a naturally-occurring organic compound used in human and animal vaccines. Squalene is an oil, made up of carbon and hydrogen atoms, produced by plants and is present in many foods. Squalene is also produced by the human liver as a precursor to cholesterol and is present in human sebum. MF59 is an oil-in-water emulsion of squalene adjuvant used in some human vaccines. As of 2021, over 22 million doses of one vaccine with squalene, FLUAD, have been administered with no severe adverse effects reported. AS03 is another squalene-containing adjuvant. In addition, squalene-based O/W emulsions have also been shown to stably incorporate small molecule TLR7/8 adjuvants (e.g. PVP-037) and lead to enhanced adjuvanticity via synergism. The plant extract QS-21 is a liposome loaded with saponins
|
{"page_id": 10173410, "title": "Immunologic adjuvant"}
|
senescence program. RNA splicing is another mechanism influencing NKG2D ligand expression. For MICA, ULBP4 and ULBP5, alternative splicing isoforms have been shown. However, the molecular mechanisms of this type of regulation are unknown. In posttranscriptional regulation, stabilization of NKG2D ligand mRNA plays a key role. For example AUF1 protein, which mediates RNA degradation, constitutively targets mRNA of NKG2D ligands. Additionally, surface expression levels of NKG2D can be controlled by soluble forms of various protease-mediated cleavages and exosome expression. == Function == NKG2D is a major recognition receptor for the detection and elimination of transformed and infected cells as its ligands are induced during cellular stress, either as a result of infection or genomic stress such as in cancer. In NK cells, NKG2D serves as an activating receptor, which itself is able to trigger cytotoxicity. The function of NKG2D on CD8+ T cells is to send co-stimulatory signals to activate them. === Role in viral infection === Viruses, as intracellular pathogens, can induce the expression of stress ligands for NKG2D. NKG2D is thought to be important in viral control as viruses have adapted mechanisms by which to evade NKG2D responses. For example, cytomegalovirus (CMV) encodes a protein, UL16, which binds to NKG2D ligands ULBP1 and 2 (thus their name "UL16-binding protein") and MICB, which prevents their surface expression. === Role in tumor control === As cancerous cells are "stressed", NKG2D ligands become upregulated, rendering the cell susceptible to NK cell-mediated lysis. However, some tumor cells have acquired the capacity to evade this immune surveillance. They have created the capacity of reducing and eliminating the high volume of NKG2DL present on the cell surface of tumor cells by secreting metalloproteases that cleave these ligands, and therefore they escape from the control of NK cells and their cytotoxic activity. TGF-β allows immune surveillance
|
{"page_id": 35036168, "title": "NKG2D"}
|
Roessler (1995) estimated the length of this piece at 1.0 metre (3 ft 3 in). Henry Cousens hypothesized that the fourth piece had a garuda figure (the Paramara royal emblem) or a trishula (trident) at the top. As Bhoja was a Shaivite king, R. Balasubramaniam analyzed Shaivite iconography to conclude that the top had a trishula. Balasubramaniam also theorizes that an iron pillar in front of Mandu's Jami Masjid might be a re-shaped version of the Dhar pillar's missing piece. This pillar is called Allaudin's Sang (spear) after Alauddin Khalji. == Chemical composition == According to R. Balasubramaniam and A. V. Ramesh Kumar (2003), the pillar shows "excellent" atmospheric corrosion resistance. Ray et al. (1997) analyzed portions of the two smaller fragments. Their analysis revealed the following chemical composition (weight %): Balasubramaniam (2002) also obtained a small portion of the pillar with ASI's permission, and used an electron probe microanalyzer to analyze its chemical composition. He found that "the composition varied from one location to another": The typical composition of the slag was 55.8% iron, 27.8% silicon, 16.3% phosphorus, and 0.1% manganese. == See also == == References == === Bibliography === Balasubramaniam, R. (2002). "A new study of the Dhar iron pillar" (PDF). Indian Journal of History of Science. 37: 115–151. Balasubramaniam, R.; Kumar, A.V. Ramesh (2003). "Corrosion resistance of the Dhar iron pillar" (PDF). Corrosion Science. 45 (11): 2451–2465. doi:10.1016/S0010-938X(03)00074-X.
|
{"page_id": 50594967, "title": "Dhar iron pillar"}
|
signals was used to gather information about the electron density of the ionosphere, while temperature and pressure data was encoded in the duration of radio beeps. The results indicated that the satellite was not punctured by a meteoroid. Sputnik 1 was launched by an R-7 rocket. It burned up upon re-entry on 3 January 1958. === First human outer space flight === The first successful human spaceflight was Vostok 1 ("East 1"), carrying the 27-year-old Russian cosmonaut, Yuri Gagarin, on 12 April 1961. The spacecraft completed one orbit around the globe, lasting about 1 hour and 48 minutes. Gagarin's flight resonated around the world; it was a demonstration of the advanced Soviet space program and it opened an entirely new era in space exploration: human spaceflight. === First astronomical body space explorations === The first artificial object to reach another celestial body was Luna 2 reaching the Moon in 1959. The first soft landing on another celestial body was performed by Luna 9 landing on the Moon on 3 February 1966. Luna 10 became the first artificial satellite of the Moon, entering in a lunar orbit on 3 April 1966. The first crewed landing on another celestial body was performed by Apollo 11 on 20 July 1969, landing on the Moon. There have been a total of six spacecraft with humans landing on the Moon starting from 1969 to the last human landing in 1972. The first interplanetary flyby was the 1961 Venera 1 flyby of Venus, though the 1962 Mariner 2 was the first flyby of Venus to return data (closest approach 34,773 kilometers). Pioneer 6 was the first satellite to orbit the Sun, launched on 16 December 1965. The other planets were first flown by in 1965 for Mars by Mariner 4, 1973 for Jupiter by Pioneer 10,
|
{"page_id": 28431, "title": "Space exploration"}
|
enabled by the presence of bivalent chromatin. The Grb10 gene in mice has a bivalent domain that uses H3K4me3 and H3K27me3 modifications as a tool to express genes from one parent while the other is silenced. This allows the gene to be expressed by only one parent in a specific tissue. In most somatic tissues, the Grb10 gene is expressed from the maternal allele, except in the brain where it is expressed from the paternal allele. H3K4me3 and H3K27me3 marks are used on the paternal allele of the gene to keep it silenced in all tissues except the brain. The same methylation marks are used on the maternal allele of the gene in brain tissue. When the genes are being expressed the H3K27me3 repressive mark is removed from the bivalent domain. == References ==
|
{"page_id": 19719002, "title": "Bivalent chromatin"}
|
important box, however, and the source of much ongoing debate, is that representing the underlying representation (or UR). In essence, an underlying representation captures information stored in a child's mind about a word he or she knows and uses. As the following description of several models will illustrate, the nature of this information and thus the type(s) of representation present in the child's knowledge base have captured the attention of researchers for some time. (Elise Baker et al. Psycholinguistic Models of Speech Development and Their Application to Clinical Practice. Journal of Speech, Language, and Hearing Research. June 2001. 44. p 685–702.) == Computational models == A computational model is a mathematical model in computational science that requires extensive computational resources to study the behavior of a complex system by computer simulation. Computational cognitive models examine cognition and cognitive functions by developing process-based computational models formulated as sets of mathematical equations or computer simulations. The system under study is often a complex nonlinear system for which simple, intuitive analytical solutions are not readily available. Rather than deriving a mathematical analytical solution to the problem, experimentation with the model is done by changing the parameters of the system in the computer, and studying the differences in the outcome of the experiments. Theories of operation of the model can be derived/deduced from these computational experiments. Examples of common computational models are weather forecasting models, earth simulator models, flight simulator models, molecular protein folding models, and neural network models. === Symbolic === A symbolic model is expressed in characters, usually non-numeric ones, that require translation before they can be used. === Subsymbolic === A cognitive model is subsymbolic if it is made by constituent entities that are not representations in their turn, e.g., pixels, sound images as perceived by the ear, signal samples; subsymbolic
|
{"page_id": 355240, "title": "Cognitive model"}
|
left from the set. Finally, in the integration stage, the semantic and syntactic properties of activated words are incorporated into the high-level utterance representation. For example, in the auditory recognition of the word "candle", the following steps take place. When the hearer hears the first two phonemes /k/ and /æ/ ((1) and (2) in the image), he or she would activate the word "candle", along with competitors such as "candy", "canopy", "cattle", and numerous others. Once the phoneme /n/ is added ((3) in the image), "cattle" would be kicked out; with /d/, "canopy" would be kicked out; and this process would continue until the recognition point, the final /l/ of "candle", were reached ((5) in the image). The recognition point need not always be the final phoneme of the word; the recognition point of "slander", for example, occurs at the /d/ (since no other English words begin "sland-"); all competitors for "spaghetti" are ruled out as early as /spəɡ/; Jerome Packard has demonstrated that the recognition point of the Chinese word huŏchē ("train") occurs before huŏch-; and a landmark study by Pienie Zwitserlood demonstrated that the recognition point of the Dutch word kapitein (captain) was at the vowel before the final /n/. Since its original proposal, the model has been adjusted to allow for the role that context plays in helping the hearer rule out competitors, and the fact that activation is "tolerant" to minor acoustic mismatches that arise because of coarticulation (a property by which language sounds are slightly changed by the sounds preceding and following them). == Experimental evidence == Much evidence in favor of the cohort model has come from priming studies, in which a priming word is presented to a subject and then closely followed by a target word and the subject asked to identify if
|
{"page_id": 20320137, "title": "Cohort model"}
|
A transductor is a type of magnetic amplifier used in power systems for compensating reactive power. It consists of an iron-cored inductor with two windings - a main winding through which an alternating current flows from the power system, and a secondary control winding which carries a small direct current. By varying the direct current, the iron core of the transductor can be arranged to saturate at different levels and thus vary the amount of reactive power absorbed. Transductors were widely used before the advent of solid-state electronics but today have been largely replaced by power electronic devices such as the Static VAR compensator and STATCOM. A formerly common use for Transductors was in CRT displays, to correct a distortion called pincushion distortion, where the side of the picture bowed in at the centre as a result of the geometry of large deflection angles. It would have one set of windings in the horizontal deflection circuit and the other set in the vertical; the action of the transductor caused the deflection waveforms to modulate each other - reducing line scan at the top and bottom (where the magnetization from the vertical deflection waveform was greatest) and similarly on the vertical waveform (where the magnetization from horizontal scan current was greatest). An additional use for the transductor, prior to Hall effect devices, was as a feedback transducer for large dc current measurement. The dc bus to be measured passed through the center of the toroidal iron core saturable reactor and 120vac excitation was applied to the winding around the iron core. As the current in the dc bus increased, the iron saturated more and more, which in turn allowed a higher level of ac current to flow. This ac current was then rectified as an output signal proportional to the bus
|
{"page_id": 6989486, "title": "Transductor"}
|
the U.S. Geological Survey, and Kathleen Crane of Scripps Institution of Oceanography. This team published their observations of the vents, organisms, and the composition of the vent fluids in the journal Science. In 1979, a team of biologists led by J. Frederick Grassle, at the time at WHOI, returned to the same location to investigate the biological communities discovered two year earlier. High temperature hydrothermal vents, the "black smokers", were discovered in spring 1979 by a team from the Scripps Institution of Oceanography using the submersible Alvin. The RISE expedition explored the East Pacific Rise at 21° N with the goals of testing geophysical mapping of the sea floor with the Alvin and finding another hydrothermal field beyond the Galápagos Rift vents. The expedition was led by Fred Spiess and Ken Macdonald and included participants from the U.S., Mexico and France. The dive region was selected based on the discovery of sea floor mounds of sulfide minerals by the French CYAMEX expedition in 1978. Prior to dive operations, expedition member Robert Ballard located near-bottom water temperature anomalies using a deeply towed instrument package. The first dive was targeted at one of those anomalies. On Easter Sunday April 15, 1979 during a dive of Alvin to 2,600 meters, Roger Larson and Bruce Luyendyk found a hydrothermal vent field with a biological community similar to the Galápagos vents. On a subsequent dive on April 21, William Normark and Thierry Juteau discovered the high temperature vents emitting black mineral particle jets from chimneys; the black smokers. Following this Macdonald and Jim Aiken rigged a temperature probe to Alvin to measure the water temperature at the black smoker vents. This observed the highest temperatures then recorded at deep sea hydrothermal vents (380±30 °C). Analysis of black smoker material and the chimneys that fed them
|
{"page_id": 354588, "title": "Hydrothermal vent"}
|
that the importance of a firm psychological basis was recognized and became an essential part of genetic counseling, the writings of Seymour Kessler making a particular contribution to this. The first master's degree genetic counseling program in the United States was founded in 1969 at Sarah Lawrence College in Bronxville, New York. In 1979, the National Society of Genetic Counselors (NSGC) was founded and led by the first president, Audrey Heimler. == Detection and early processes == Diagnostic testing occurs when an individual is showing signs or symptoms associated with a specific condition. Genetic testing can be used to arrive at a definitive diagnosis in order to provide better prognosis as well as medical management or treatment options. Testing can reveal conditions can be mild or asymptomatic with early treatment, as opposed to debilitating without treatment (such as phenylketonuria). Genetic tests are available for a number of genetic conditions, including but not limited to: Down syndrome, sickle cell disease, Tay–Sachs disease, muscular dystrophy. Establishing a genetic diagnosis can provide information to other at-risk individuals in the family. Any reproductive risks (e.g. a chance to have a child with the same diagnosis) can also be explored after a diagnosis. Many disorders cannot occur unless both the mother and father pass on their genes, such as cystic fibrosis; this is known as autosomal recessive inheritance. Other autosomal dominant diseases can be inherited from one parent, such as Huntington disease and DiGeorge syndrome. Yet other genetic disorders are caused by an error or mutation occurring during the cell division process (e.g. aneuploidy) and are usually not inherited. Screening tests are often used prior to diagnostic testing, designed to separate people according to a fixed characteristic or property, with the intention of detecting early evidence of disease. For example, if a screening test during
|
{"page_id": 251487, "title": "Genetic counseling"}
|
number of dogs to cats to rabbits that the students prefer? Simplify your answer as much as possible. (A) (B) (C) (D) # 187. How many more students preferred fish than rodents? __________ # 188. If , which of the following represents the value of p? (A) 1 (B) (C) (D) # 189. If and , which of the following is true for all cases? (A) (B) (C) (D) # 190. Regular tickets to a concert cost $25 each, and VIP tickets cost $45 each. The concert hall sold a total of 270 tickets and made $7,650 on ticket sales. The number of VIP tickets sold was __________, and the number of regular tickets sold was __________. # 191. The product of the first six prime numbers is divisible by which of the following? (A) 16 (B) 18 (C) 22 (D) 24 Questions 192 and 193 are based on the following function. # 192. What is the value of the function when ? (A) –8 (B) 0 (C) 16 (D) 32 # 193. For what value of x does ?(A) 96 (B) 2 and –6 (C) 6 and –2 (D) 0 and 6 # 194. Simplify the following expression: (A) (B) (C) (D) # 195. In this triangle, angle x equals ______ and angle y equals ________. # 196. A cube with 3-inch sides is painted blue and then cut into 27 smaller cubes with 1-inch sides. How many of the new smaller cubes have exactly two faces that are painted blue? __________ # 197. The lengths of the legs of a right triangle are 4 inches and 5 inches, respectively. What is the length of the hypotenuse? (A) 3 inches (B) 9 inches (C) inches (D) 41 inches Questions 198 through 200 are based on the following linear equation.
|
{"source": 1463, "title": "from dpo"}
|
REFERENCES 713 Bishop, C. M. (1991). A fast procedure for retraining the multilayer perceptron. International Journal of Neural Systems 2(3), 229–236. Bishop, C. M. (1992). Exact calculation of the Hes-sian matrix for the multilayer perceptron. Neural Computation 4(4), 494–501. Bishop, C. M. (1993). Curvature-driven smoothing: a learning algorithm for feedforward networks. IEEE Transactions on Neural Networks 4(5), 882–884. Bishop, C. M. (1994). Novelty detection and neu-ral network validation. IEE Proceedings: Vision, Image and Signal Processing 141 (4), 217–222. Special issue on applications of neural networks. Bishop, C. M. (1995a). Neural Networks for Pattern Recognition . Oxford University Press. Bishop, C. M. (1995b). Training with noise is equiv-alent to Tikhonov regularization. Neural Compu-tation 7(1), 108–116. Bishop, C. M. (1999a). Bayesian PCA. In M. S. Kearns, S. A. Solla, and D. A. Cohn (Eds.), Ad-vances in Neural Information Processing Sys-tems , Volume 11, pp. 382–388. MIT Press. Bishop, C. M. (1999b). Variational principal components. In Proceedings Ninth Interna-tional Conference on Artificial Neural Networks, ICANN’99 , Volume 1, pp. 509–514. IEE. Bishop, C. M. and G. D. James (1993). Analysis of multiphase flows using dual-energy gamma den-sitometry and neural networks. Nuclear Instru-ments and Methods in Physics Research A327 ,580–593. Bishop, C. M. and I. T. Nabney (1996). Modelling conditional probability distributions for periodic variables. Neural Computation 8(5), 1123–1133. Bishop, C. M. and I. T. Nabney (2008). Pattern Recognition and Machine Learning: A Matlab Companion . Springer. In preparation. Bishop, C. M., D. Spiegelhalter, and J. Winn (2003). VIBES: A variational inference engine for Bayesian networks. In S. Becker, S. Thrun, and K. Obermeyer (Eds.), Advances in Neural Information Processing Systems , Volume 15, pp. 793–800. MIT Press. Bishop, C. M. and M. Svens´ en (2003). Bayesian hi-erarchical mixtures of experts. In U. Kjaerulff and C. Meek (Eds.), Proceedings Nineteenth Conference on Uncertainty in
|
{"source": 3852, "title": "from dpo"}
|
false statements. in doing so, we construct the commonclaim dataset of 20,000 statements labeled by humans as common-knowledge-true, common knowledge-false, or neither. we are making code and data available. Expand Abstract 2023-06-13 Large Language Models Sometimes Generate Purely Negatively-Reinforced Text Fabien Roger Abstract: when using adversarial training, it is common practice to train against the most egregious failures. however, this might imply using examples with sensitive information (such as leaked passwords or security vulnerabilities) as training data. one might assume that language models trained with gradient descent never generate text snippets which were only present in examples associated with the lowest possible reward. in this paper, we show that this assumption is wrong: in some situations, large language models do learn from such negatively-reinforced examples. we present a specific training setup that enables pythia-160m to guess passwords 13% more often than it would by guessing randomly, despite only showing it these passwords on examples where the model is incentivized to not output these passwords. our code is available at www.github.com/fabienroger/learning-from-negative-examples Expand Abstract H2ogpt: Democratizing Large Language Models Arno Candel, Jon Mckinney, Philipp Singer, Pascal Pfeiffer, Maximilian Jeblick, Prithvi Prabhu, Jeff Gambera, Mark Landry, Shivam Bansal, Ryan Chesler, Chun Ming Lee, Marcos V. Conde, Pasha Stetsenko, Olivier Grellier, Srisatish Ambati Abstract: applications built on top of large language models (llms) such as gpt-4 represent a revolution in ai due to their human-level capabilities in natural language processing. however, they also pose many significant risks such as the presence of biased, private, or harmful text, and the unauthorized inclusion of copyrighted material. we introduce h2ogpt, a suite of open-source code repositories for the creation and use of llms based on generative pretrained transformers (gpts). the goal of this project is to create the world's best truly open-source alternative to closed-source approaches. in
|
{"source": 5788, "title": "from dpo"}
|
such studies are not able to determine local dose to the target tissue which in this case was any residual thyroid cells plus metastases of thyroidal origin. 12.5.2. Biomonitoring studies After having been validated as an in vivo biomonitor in several patient studies, the CBMN assay as well as the CBMN-centromere assay have been applied for large scale biomonitoring of occupationally exposed radiation workers, e.g. nuclear power plant and hospital staff [266, 278–280, 293–295]. These biomonitoring studies showed the dependence of MN on the accumulated dose received over the years preceding the venipuncture. In the study of Thierens et al. a linear regression of the individual micronucleus frequencies, corrected for the age effect (see Section 12.4.2.), showed an increase of 0.0175 MN per 1000 BN cells/mSv with a Pearson correlation coefficient value of 0.10. Application of the CBMN-centromere assay in a second study of radiation workers by Thierens et al. resulted in almost the same increase of MN with dose, 0.025 MN per 1000 BN cells/mGy and demonstrated that this dose dependence is completely due to MNCM -ve pointing to the clastogenic action of ionizing radiation. Dose dependence of MN in an occupational exposure setting was also found in a study by Vaglenov et al. . They reported an increase of 0.03 MN per 1000 BN cells/mGy. Large scale biomonitoring studies show that the micronucleus assay is able to demonstrate genetic damage at the population level for accumulated doses received occupationally exceeding 50 mGy. 122 12.5.3. Accident studies 12.5.3.1. Chernobyl accidental The CBMN assay has also been used successfully for assessing the protracted exposure due to incorporation of long lived radionuclides by residents in the vicinity of the Chernobyl nuclear power plant. Eighty individuals who were located between 100–200 km from Chernobyl at the time of the accident
|
{"source": 7334, "title": "from dpo"}
|
In eukaryotic cells, an aggresome refers to an aggregation of misfolded proteins in the cell, formed when the protein degradation system of the cell is overwhelmed. Aggresome formation is a highly regulated process that possibly serves to organize misfolded proteins into a single location. == Biogenesis == Correct folding requires proteins to assume one particular structure from a constellation of possible but incorrect conformations. The failure of polypeptides to adopt their proper structure is a major threat to cell function and viability. Consequently, elaborate systems have evolved to protect cells from the deleterious effects of misfolded proteins. Upon synthesis, proteins are in their linear and non-functional form, called a nascent protein. They must undergo co-translational folding as quickly as possible in order to become a functional, three-dimensional structure. Normally folded proteins are referred to as being in their native structure. In this state, they have undergone a hydrophobic collapse process, indicated by outward-facing hydrophilic components and inward-facing hydrophobic components. The solubility of proteins is an important biochemical aspect of protein folding as it has been shown to affect the formation of protein aggregates. Contrary to native structures, a misfolded protein will often have outward-facing hydrophobic regions which acts as an attractant to other insoluble proteins. There are some chaperones which identify aggregates by recognizing their hydrophobic region. These chaperone may work as solubilizers. Cells mainly deploy three mechanisms to counteract misfolded proteins: up-regulating chaperones to assist protein refolding, proteolytic degradation of the misfolded/damaged proteins involving ubiquitin–proteasome and autophagy–lysosome systems, and formation of detergent-insoluble aggresomes by transporting the misfolded proteins along microtubules to a region near the nucleus. Intracellular deposition of misfolded protein aggregates into ubiquitin-rich cytoplasmic inclusions is linked to the pathogenesis of many diseases. Functional blockade of either degradative system leads to an enhanced aggresome formation. Why these aggregates
|
{"page_id": 8936239, "title": "Aggresome"}
|
migration timing and pathways, which are then used to predict when and where petroleum can be found; petroleum sources can be predicted if material associated with source rock is found. === Surface Prospecting === Petroleum, or evidence of its immediate occurrence, can be found on the surface of the Earth. Oil seeps can be found near a fault zone, where the movement of Earth's crust can expose petroleum source rock, and thus the crude oil itself. They can also be found on the ocean floor, and can be found using satellite imaging. === Distillation === While not used as commonly as other techniques today, distillation is used in the process of refining petroleum. It involves the dividation of the crude oil into hydrocarbon categories, and products are recovered from the heated material. A distillation tower is used in separation of the oil, with anywhere between 2 and 300 theoretical plates. === Gas Chromatography === Similar to the process of distillation, gas-liquid chromatography (typically referred to as gas chromatography, or, more simply, GC) utilises a distillation tower to separate the petroleum. However, compared to distillation's 2 to 300 theoretical plates, gas chromatography includes more than 25,000. This provides a greater degree of separation. In order to achieve more complete analyses, gas chromatography is used along with mass spectrometry (to make gas chromatography/mass spectrometry, or GCMS), with infrared spectrometry (to make gas chromatography/infrared spectrometry, or GCIR), and with isotope ratio mass spectrometry (to make gas chromatography/isotope ratio mass spectrometry, or GSIRMS). === Pyrolysis === While the crude oil from a petroleum source rock is easily separated using gas chromatography and gas chromatography/mass spectrometry, the organic matter found is not soluble in the solvents used in these techniques, and thus cannot be properly analysed. Pyrolysis is used to characterise kerogens (insoluble hydrocarbons) and
|
{"page_id": 1687153, "title": "Petroleum geochemistry"}
|
Tom Van Vleck is an American computer software engineer. == Life and work == Van Vleck graduated from MIT in 1965 with a BS in Mathematics. He worked on CTSS at MIT, and co-authored its first email program with Noel Morris. In 1965, he joined Project MAC, the predecessor of the MIT Computer Science and Artificial Intelligence Laboratory. He worked on the development of Multics for more than 16 years at MIT and at Honeywell Information Systems. He has also worked at Tandem Computers, Taligent, CyberCash, Sun Microsystems, Encirq (an internet advertising company), and SPARTA (a computer security company). He is also known as a computer security expert. == Notes == == Bibliography == Operational changes for MR 4.0, T. H. Van Vleck, MULTICS OPERATING STAFF NOTE MOSN-A001, Honeywell, April 23, 1976 The Multics System Programming Process, Van Vleck, T. H. and Clingen, C. T.; Invited Paper, ICSE 1978, pp. 278–280 Getting the picture; it can be done, IEEE Computer, vol. 27, no. 5, pp. 112, May 1994 SPMA - Java Binary Enhancement Tool, DARPA Information Survivability Conference and Exposition - Volume II, pp. 152, April 2003; (DOI) Self-Protecting Mobile Agents Obfuscation Report, L. D'Anna, B. Matt, A. Reisse, T. Van Vleck, S. Schwab, and P. LeBlanc, Report #03-015, Network Associates Laboratories, June 2003. Anti-Phishing: Best Practices for Institutions and Consumers; Tally, Gregg; Thomas, Roshan; Van Vleck, Tom; McAfee Research, Technical Report # 04-004 Three Questions about Each Bug You Find, Software Engineering Notes 14:5:62-63 (July 1989) Cleaning Up the Basement in the Dark, Software Engineering Notes, (April 1992) --, ed., with David Walden, The Compatible Time Sharing System (1961-1973) Fiftieth Anniversary Commemorative Overview, (also at Multicians.org) IEEE Computer Society, 2011 The IBM 7094 and CTSS The IBM 360/67 and CP/CMS The IBM 7070 1401s I have Known == References
|
{"page_id": 23079143, "title": "Tom Van Vleck"}
|
26% (2005) Dhaka, Bangladesh 29% (2010) Italy 29% (2005) Chile 34% (2006) Eastern Jakarta, Indonesia 42% (2016), down from 59% in 1998 Amman, Jordan 34% (2010) Mexico 51% (2003) Western Jakarta, Indonesia 39% (2011), down from 57% in 1998 Kosovo 58% Bauchi state, Nigeria 70% Yerevan, Armenia 72% (1999) Lagos, Nigeria 96% (pre-2003) === Expressed in cubic meters per network length === The following figures are expressed in cubic meters per kilometer of distribution network per day: Netherlands 1.5 Denmark 1.6 Germany (towns) 0.7–2.4 Germany (large cities) 2.4–5 Australia 4.4 Malmö, Sweden 5 California Water Service Company 6 Portugal 7 England and Wales 10 Helsinki 18 Penn American Water 19 Russia 20 (2006) Stockholm 21 Scotland 21.3 Illinois American Water 26 Ireland 29 Brazil 42 (2006) China 52 (2006) Bucharest 350 in 2000 and 176 in 2007 These levels are given per km of network, not per connection. == Benefits of NRW reduction == The World Bank has estimated the total cost of NRW to utilities worldwide at US$14 billion per year. Reducing by half the current levels of losses in developing countries, where relative losses are highest, could generate an estimated US$2.9 billion in cash and serve an additional 90 million people. Benefits of NRW reduction, in particular of leakage reduction, include financial gains from increased water sales or reduced water production, including possibly the delay of costly capacity expansion; increased knowledge about the distribution system; increased firefighting capability due to increased pressure; reduced property damage; reduced risk of contamination. More stabilized water pressure throughout the system Leakage reduction may also be an opportunity to improve relations with the public and employees. A leak detection program may be highly visible, encouraging people to think about water conservation. The reduction of commercial losses, while politically and socially challenging, can also
|
{"page_id": 8689519, "title": "Non-revenue water"}
|
Nucleic acid metabolism refers to the set of chemical reactions involved in the synthesis and degradation of nucleic acids (DNA and RNA). Nucleic acids are polymers (biopolymers) composed of monomers called nucleotides. Nucleotide synthesis is an anabolic process that typically involves the chemical reaction of a phosphate group, a pentose sugar, and a nitrogenous base. In contrast, the degradation of nucleic acids is a catabolic process in which nucleotides or nucleobases are broken down, and their components can be salvaged to form new nucleotides. Both synthesis and degradation reactions require multiple enzymes to facilitate these processes. Defects or deficiencies in these enzymes can lead to a variety of metabolic disorders. == Synthesis of nucleotides == Nucleotides are the monomers that polymerize to form nucleic acids. Each nucleotide consists of a sugar, a phosphate group, and a nitrogenous base. The nitrogenous bases found in nucleic acids belong to one of two categories: purines or pyrimidines. In complex multicellular animals, both purines and pyrimidines are primarily synthesized in the liver, but they follow distinct biosynthetic pathways. However, all nucleotide synthesis requires phosphoribosyl pyrophosphate (PRPP), which donates the ribose and phosphate needed to form a nucleotide. === Purine synthesis === Adenine and guanine are the two nitrogenous bases classified as purines. In purine synthesis, phosphoribosyl pyrophosphate (PRPP) is converted into inosine monophosphate (IMP). The production of IMP from PRPP requires glutamine, glycine, aspartate, and six molecules of adenosine triphosphate (ATP), among other components. IMP serves as a precursor for both adenosine monophosphate (AMP) and guanosine monophosphate (GMP). AMP is synthesized from IMP using guanosine triphosphate (GTP) and aspartate, with aspartate being converted into fumarate. In contrast, the synthesis of GMP requires an intermediate step: IMP is first oxidized by NAD⁺ to form xanthosine monophosphate (XMP), which is subsequently converted into GMP via the
|
{"page_id": 6360807, "title": "Nucleic acid metabolism"}
|
possible lattice packings. In 1998, Thomas Callister Hales, following the approach suggested by László Fejes Tóth in 1953, announced a proof of the Kepler conjecture. Hales' proof is a proof by exhaustion involving checking of many individual cases using complex computer calculations. Referees said that they were "99% certain" of the correctness of Hales' proof. On 10 August 2014, Hales announced the completion of a formal proof using automated proof checking, removing any doubt. === Other common lattice packings === Some other lattice packings are often found in physical systems. These include the cubic lattice with a density of π 6 ≈ 0.5236 {\displaystyle {\frac {\pi }{6}}\approx 0.5236} , the hexagonal lattice with a density of π 3 3 ≈ 0.6046 {\displaystyle {\frac {\pi }{3{\sqrt {3}}}}\approx 0.6046} and the tetrahedral lattice with a density of π 3 16 ≈ 0.3401 {\displaystyle {\frac {\pi {\sqrt {3}}}{16}}\approx 0.3401} . === Jammed packings with a low density === Packings where all spheres are constrained by their neighbours to stay in one location are called rigid or jammed. The strictly jammed (mechanically stable even as a finite system) regular sphere packing with the lowest known density is a diluted ("tunneled") fcc crystal with a density of only π√2/9 ≈ 0.49365. The loosest known regular jammed packing has a density of approximately 0.0555. == Irregular packing == If we attempt to build a densely packed collection of spheres, we will be tempted to always place the next sphere in a hollow between three packed spheres. If five spheres are assembled in this way, they will be consistent with one of the regularly packed arrangements described above. However, the sixth sphere placed in this way will render the structure inconsistent with any regular arrangement. This results in the possibility of a random close packing of spheres
|
{"page_id": 368621, "title": "Sphere packing"}
|
Groups associated with low-technology == Arts and Crafts Movement, popularized by Gustav Stickley in America around 1900. Bauhaus movement of Germany around the same time. Do-It-Yourself phenomenon arising in America following World War II. Back-to-the-land movement beginning in America during the 1960s. Hippie Luddites, whose activities date to the very beginning of the Industrial Revolution. Living history and open-air museums around the world, which strives to recreate bygone societies. Simple living adherents, such as the Amish and to a lesser extent some sects of the Mennonites, who specifically refuse some newer technologies to avoid undesirable effects on themselves or their societies. Survivalists are often proponents, since low-technology is inherently more robust than its high-technology counterpart. == See also == Obsolescence Do it yourself Anti-consumerism Degrowth Simple living Embodied energy Intermediate technology – sometimes used to mean technology between low and high technology Pre-industrial society == Sources == Falk, William W.; Lyson, Thomas A. (1988). High tech, low tech, no tech: recent industrial and occupational change in the South. SUNY Press. ISBN 978-0-88706-729-7. De Decker, Kris (2012). Low-tech magazine (tome 1 and 2). Low-tech Magazine. ISBN 978-1-79471-152-5. Berkes, Fikret (1999). Sacred Ecology (first ed.). Taylor & Francis Ltd. ISBN 1138071498. Watson, Julia (2020). Lo—TEK. Design by Radical Indigenism. Taschen. ISBN 978-3-8365-7818-9. Ginn, Peter (2019). Slow Tech: The Perfect Antidote to Today's Digital World. Haynes UK. ISBN 978-1-78521-616-9. == References == General Merriam webster dictionary == External links == Low-Tech Magazine – Doubts on progress and technology Low-tech lab (english version)
|
{"page_id": 1721135, "title": "Low technology"}
|
centers. This was exacerbated by preparation for the 1988 Seoul Olympics with ordinance No. 410 from President Chun Doo-Hwan. A notable welfare center was Brothers Home. == In Tanzania == === Victims and methods === The most common victims of social cleansing efforts in Tanzania are elderly women, the majority of whom are of low socioeconomic status, but several groups of people who are considered burdens to the community, such as children, the sick, infants, and the handicapped, are also victims. These people are usually accused of witchcraft following deaths or other misfortunes in society and tend to flee, choosing homelessness over death. Those who do not flee successfully are killed violently in their homes. Sometimes those considered burdens are simply reduced to zero consumption and are starved to death. This occurs particularly among infants, who have no ability to flee or attempt to provide for themselves. === Perpetrators and motivations === Victims are typically killed by members of their own families, who blame them for economic suffering and household misfortune. Accusations and subsequent killings are often incited by death or illness in the family or the family's livestock. However, general misfortune in the form of "failed crops, lost jobs, and bad dreams also arouse suspicion". While often accusations are raised to the effect of creating a scapegoat, not all forms of social cleansing are connected to witch hunting. The extreme scarcity theory suggests that some families to drive out or starve unproductive family members to provide more nutrients for other members. Many of these perpetrators are young, unemployed men who see the elderly as a burden on their potential for success. Another key perpetrator of social cleansing in Tanzania are the Sungusungu, councils of male elders that operate under the premise of promoting village security. These groups formed under
|
{"page_id": 23517808, "title": "Social cleansing"}
|
A geofact (a portmanteau of geology and artifact) is a natural stone formation that is difficult to distinguish from a man-made artifact. Geofacts could be fluvially reworked and be misinterpreted as an artifact, especially when compared to Paleolithic artifacts. Possible examples include several purported prominent ancient artifacts, such as the Venus of Berekhat Ram and the Venus of Tan-Tan. These are thought by many in the archaeological community to be geofacts. A site which shows an abundance of what are likely geofacts is the Gulf of Cambay. Geofacts can be distinguished from lithic debitage, through experiments and comparisons. Separating geofacts from artifacts is a challenge that archaeologists can face while excavating a site. == Origins == Hans-Peter Schulz describes geofacts as being multi-shaped rocks that can be found while archaeologists are trying to find true artifacts during past glacial periods. Glacial periods such as the Eemian interglacial and the Middle Weichselian glaciation located in the northern parts of the world melted and began to move rocks from their original areas while they scraped everything around them. The rock movement created sometimes weapon like spears from smaller rocks and appear as artifacts but instead are just a product of glacial melting. Another element Schulz explained is the mixing of natural and salt water during the glaciations, which changed sediment locations within rocks such as the Susiluola cave located in Finland. Once the ice melted the sediment and ice created some artificial markings on pebble sized rocks. Some elements that could morph rock shapes in caves include sandstone, siltstone and quartzite creating a kinetic process of shaping the rocks. There are measurements Schulz created to distinguish a geofact such as blow angles from a sandstone or quartzite rock with a limit between 45 and 90 degrees, and if the abrasions were rounded
|
{"page_id": 9924698, "title": "Geofact"}
|
byte of kernel memory (which ranges from 0–255) is multiplied by the page size of the system, which is typically 4096. 5. In this step, the multiplied byte of kernel memory is then used to read from the probe array into a dummy value. The multiplication of the byte by 4096 is to avoid a CPU feature called the “prefetcher” from reading more data than we want into into the cache. 6. By this step, the CPU has realized its mistake and rolled back to step 3. However, the results of the speculated instructions are _still visible in cache_. The attacker uses operating system functionality to trap the faulting instruction and continue execution (e.g., handling SIGFAULT). 7. In step 7, the attacker iterates through and sees how long it takes to read each of the 256 possible bytes in the probe array that could have been indexed by the kernel memory. The CPU will have loaded one of the locations into cache and this location will load substantially faster than all the other locations (which need to be read from main memory). _This location is the value of the byte in kernel memory_. Using the above technique, and the fact that it is standard practice for modern operating systems to map all of physical memory into the kernel virtual address space, _an attacker can read the computer’s entire physical memory_. Now, you might be wondering: “You said that page tables have permission bits. How can it be that user mode code was able to speculatively access kernel memory?” _The reason is this is a bug in Intel processors_. In my opinion, there is no good reason, performance or otherwise, for this to be possible. Recall that all virtual memory access must occur through the TLB. It is easily possible during
|
{"source": 69, "title": "from dpo"}
|
all the modes the VAX supports. Most measurements in this appendix, however, will use the more recent register-register architectures to show how programs use instruction sets of current computers. As Figure A.7 shows, displacement and immediate addressing dominate addressing mode usage. Let ’s look at some properties of these two heavily used modes. # Displacement Addressing Mode The major question that arises for a displacement-style addressing mode is that of the range of displacements used. Based on the use of various displacement sizes, a decision of what sizes to support can be made. Choosing the displacement field sizes is important because they directly affect the instruction length. Figure A.8 > 30% 35% 40% 25% 20% 15% 10% 5% 0% 012345678910 11 12 13 14 Percentage of displacement Number of bits of displacement Floating-point average Integer average 15 Figure A.8 Displacement values are widely distributed. There are both a large num-ber of small values and a fair number of large values. The wide distribution of displace-ment values is due to multiple storage areas for variables and different displacements to access them (see Section A.8) as well as the overall addressing scheme the compiler uses. The x-axis is log 2 of the displacement, that is, the size of a field needed to represent the magnitude of the displacement. Zero on the x-axis shows the percentage of dis-placements of value 0. The graph does not include the sign bit, which is heavily affected by the storage layout. Most displacements are positive, but a majority of the largest dis-placements (14 + bits) are negative. Because these data were collected on a computer with 16-bit displacements, they cannot tell us about longer displacements. These data were taken on the Alpha architecture with full optimization (see Section A.8) for SPEC CPU2000, showing the average of integer
|
{"source": 2300, "title": "from dpo"}
|
67.5 54 32 > scores =3 > values =factor =10 About to return to the caller double[] > 350 290 675 540 320 > scores =4 > After method call double[] > 350 290 675 540 320 282 Chapter 6 Arrays and Array Lists A method can return an array. Simply build up the result in the method and return it. In this example, the squares method returns an array of squares from 0 2 up to ( n – 1) 2: > public static int[] squares(int n) {int[] result =new int[n]; for (int i=0; i= 0; i--) 54 { 55 System.out.print(values[i] + " "); 56 } 57 System.out.println(); 58 } 59 } Program Run Enter 5 numbers: 12 25 20 0 10 100.0 0.0 200.0 250.0 120.0 19. How do you call the squares method to compute the first five squares and store the result in an array numbers ? 20. Write a method fill that fills all elements of an array of integers with a given value. For example, the call fill(scores, 10) should fill all elements of the array scores with the value 10. 21. Describe the purpose of the following method: public static int[] mystery(int length, int n) {int[] result = new int[length]; for (int i = 0; i © Nicholas Homrich/iStockphoto. S E L F C H E C K 284 Chapter 6 Arrays and Array Lists Suppose the reverse method is called with an array scores that contains the numbers 1, 4, and
|
{"source": 4220, "title": "from dpo"}
|
the object encoding the properties of spacetime. How might a semantic realist take the GA formulation of classical fields at its face value? Unlike the Einstein algebra case, GA comes pre-packaged with an intended interpretation. The objects of a geometric algebra, and the Dirac al-gebra in particular, are interpreted as multivectors. One option for a semantic realist is to include them as the fundamental geometric entities in the ontology of classical field theories. This perhaps suggests a relationalist’s view of space-time as arising from the algebraic relations between multivectors in the Dirac algebra. Alternatively, the algebraic structuralist of Section 4.2 may claim that the concrete representations of a geometric algebra G should not be read lit-erally, but rather the structure defined by G. Such a structuralist will claim that spacetime has the structure inherent in the abstract real Clifford algebra Cð1;3Þ. 6. Spacetime as structure The above review of alternative formalisms indicates that classical field-theoretic physics can be done without a 4-dimensional differentiable manifold, at least for most theories of interest. Minimally, this suggests that, if we desire to read classical field theories at their ‘‘face value’’, differentiable manifolds need not enter into our considerations: manifold substantivalism is not the only way to literally interpret a classical field theory. What does this suggest about the ontological status of spacetime? In particular, if we desire to be semantic realists with respect to classical field theories, what attitude should we adopt toward the nature of spacetime? One initial moral that can be drawn from the preceding discussion is that ‘‘funda-mentalism’’ is in the eye of the beholder. In particular, all the alternative formal-isms discussed above disagree on what the essential structure is that is minimally required to kinematically and dynamically support classical field theories. 6.1. Against fundamentalism Note first that the relations
|
{"source": 6137, "title": "from dpo"}
|
They hold a special knowledge and deep understanding of how Earth recycles and maintains the sustainability of itself. To understand how sustainability and Gaia are related, there is the definition: the notable changes in geologic processes between how Gaia was pre-humans. Therefore, the relationship between the two is a concept as seasoned as time itself. Their very similarities have many limitations due to gradual changes. However, there is an issue between this relationship. Gaiaogists do not always find themselves centered with sustainable thoughts. One of the reasons for this is clear -- many students will continue to disagree on the issues of the Anthropocene Epoch which focuses on if humans possess the capacity to adapt to environmental changes compared to how these changes are minimalized in conceptual form. Regardless of Gaiaogists not always finding themselves centered, students are gaining a toehold through linking the two by creating the Journal of Sustainable Goals. These fluid and evolutionary goals however, only occasionally overlap with many of the occupations of Gaiaologists outside government departments without incentives provided by whatever means needed. Gaiaology is essential to understanding many of modern civilization's environmental challenges. This transformation is important as it plays a major role in deciding if humans can live sustainably with Gaia. Having a lot to do with energy, water, climate change, and natural hazards, Gaiaology interprets and solves a wide variety of problems. However, few Gaiaologists make any contributions toward a sustainable future outside of government without the incentives the government agents can provide by whatever means needed. Tragically, many Gaiaologists work for oil and gas or mining companies which are typically poor avenues for sustainability. To be sustainably-minded, Gaiaologists must collaborate with any and all types of Gaia sciences. For example, Gaiaologists collaborating with sciences like ecology, zoology, physical geography, biology, environmental,
|
{"page_id": 17945609, "title": "Sustainability science"}
|
be of particular use for non-metals. Strictly, Fowler–Nordheim-type equations apply only to emission from the conduction band of bulk crystalline solids. However, empirical equations of form (42) should apply to all materials (though, conceivably, modification might be needed for very sharp emitters). It seems very likely that one way in which CFE equations for newer materials may differ from Fowler–Nordheim-type equations is that these CFE equations may have a different power of F (or V) in their pre-exponentials. Measurements of κ might provide some experimental indication of this. == Fowler–Nordheim plots and Millikan–Lauritsen plots == The original theoretical equation derived by Fowler and Nordheim has, for the last 80 years, influenced the way that experimental CFE data has been plotted and analyzed. In the very widely used Fowler–Nordheim plot, as introduced by Stern et al. in 1929, the quantity ln{i/V2} is plotted against 1/V. The original thinking was that (as predicted by the original or the elementary Fowler–Nordheim-type equation) this would generate an exact straight line of slope SFN. SFN would be related to the parameters that appear in the exponent of a Fowler–Nordheim-type equation of i–V form by: Hence, knowledge of φ would allow β to be determined, or vice versa. [In principle, in system geometries where there is local field-enhancing nanostructure present, and the macroscopic conversion factor βM can be determined, knowledge of β then allows the value of the emitter's effective field enhancement factor γ to be determined from the formula γ = β/βM. In the common case of a film emitter generated on one plate of a two-plate arrangement with plate-separation W (so βM = 1/W) then Nowadays, this is one of the most likely applications of Fowler–Nordheim plots.] It subsequently became clear that the original thinking above is strictly correct only for the physically unrealistic
|
{"page_id": 293392, "title": "Field electron emission"}
|
ability to access resources that are important for their development and also aids the development of their society at large. If IVF becomes more popular without the birth rate decreasing, there could be more large family homes with fewer options to send their newborn children. This could result in an increase of orphaned children and/or a decrease in resources for the children of large families. This would ultimately stifle the children's and the community's growth. In the US, the pineapple has emerged as a symbol of IVF users, possibly because some people thought, without scientific evidence, that eating pineapple might slightly increase the success rate for the procedure. == Emotional involvement with children == Studies have indicated that IVF mothers show greater emotional involvement with their child, and they enjoy motherhood more than mothers by natural conception. Similarly, studies have indicated that IVF fathers express more warmth and emotional involvement than fathers by adoption and natural conception and enjoy fatherhood more. Some IVF parents become overly involved with their children. == Men and IVF == Research has shown that men largely view themselves as "passive contributors": 340 since they have "less physical involvement" in IVF treatment. Despite this, many men feel distressed after seeing the toll of hormonal injections and ongoing physical intervention on their female partner.: 344 Fertility was found to be a significant factor in a man's perception of his masculinity, driving many to keep the treatment a secret.: 344 In cases where the men did share that he and his partner were undergoing IVF, they reported to have been teased, mainly by other men, although some viewed this as an affirmation of support and friendship. For others, this led to feeling socially isolated.: 336 In comparison with females, males showed less deterioration in mental health in the
|
{"page_id": 57880, "title": "In vitro fertilisation"}
|
be achieved on players without ReplayGain capability. == Licensing, ownership, and legislation == The basic MP3 decoding and encoding technology is patent-free in the European Union, all patents having expired there by 2012 at the latest. In the United States, the technology became substantially patent-free on 16 April 2017 (see below). MP3 patents expired in the US between 2007 and 2017. In the past, many organizations have claimed ownership of patents related to MP3 decoding or encoding. These claims led to several legal threats and actions from a variety of sources. As a result, in countries that allow software patents, uncertainty about which patents must have been licensed to create MP3 products without committing patent infringement was common in the early stages of the technology's adoption. The initial near-complete MPEG-1 standard (parts 1, 2, and 3) was publicly available on 6 December 1991 as ISO CD 11172. In most countries, patents cannot be filed after prior art has been made public, and patents expire 20 years after the initial filing date, which can be up to 12 months later for filings in other countries. As a result, patents required to implement MP3 expired in most countries by December 2012, 21 years after the publication of ISO CD 11172. An exception is the United States, where patents in force but filed before 8 June 1995 expire after the later of 17 years from the issue date or 20 years from the priority date. A lengthy patent prosecution process may result in a patent issued much later than normally expected (see submarine patents). The various MP3-related patents expired on dates ranging from 2007 to 2017 in the United States. Patents for anything disclosed in ISO CD 11172 filed a year or more after its publication are questionable. If only the known MP3
|
{"page_id": 19673, "title": "MP3"}
|
In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order. This concept first arose in calculus, and was later generalized to the more abstract setting of order theory. == In calculus and analysis == In calculus, a function f {\displaystyle f} defined on a subset of the real numbers with real values is called monotonic if it is either entirely non-decreasing, or entirely non-increasing. That is, as per Fig. 1, a function that increases monotonically does not exclusively have to increase, it simply must not decrease. A function is termed monotonically increasing (also increasing or non-decreasing) if for all x {\displaystyle x} and y {\displaystyle y} such that x ≤ y {\displaystyle x\leq y} one has f ( x ) ≤ f ( y ) {\displaystyle f\!\left(x\right)\leq f\!\left(y\right)} , so f {\displaystyle f} preserves the order (see Figure 1). Likewise, a function is called monotonically decreasing (also decreasing or non-increasing) if, whenever x ≤ y {\displaystyle x\leq y} , then f ( x ) ≥ f ( y ) {\displaystyle f\!\left(x\right)\geq f\!\left(y\right)} , so it reverses the order (see Figure 2). If the order ≤ {\displaystyle \leq } in the definition of monotonicity is replaced by the strict order < {\displaystyle <} , one obtains a stronger requirement. A function with this property is called strictly increasing (also increasing). Again, by inverting the order symbol, one finds a corresponding concept called strictly decreasing (also decreasing). A function with either property is called strictly monotone. Functions that are strictly monotone are one-to-one (because for x {\displaystyle x} not equal to y {\displaystyle y} , either x < y {\displaystyle x<y} or x > y {\displaystyle x>y} and so, by monotonicity, either f ( x ) < f ( y )
|
{"page_id": 48260, "title": "Monotonic function"}
|
since 2015. While success has been slower than was hoped (the original goal for eradication was 1995), the WHO has certified 180 countries free of the disease, and in 2020 six countries—South Sudan, Ethiopia, Mali, Angola, Cameroon and Chad—reported cases of guinea worm. As of 2010, the WHO predicted it would be "a few years yet" before eradication is achieved, on the basis that it took 6–12 years for the countries that have so far eliminated guinea worm transmission to do so after reporting a similar number of cases to that reported by Sudan in 2009. Nonetheless, the last 1% of the effort may be the hardest, with cases not substantially decreasing from 2015 (22) to 2020 (24). As a result of missing the 2020 target, the WHO has revised its target for eradication to 2030. The worm is now understood to be able to infect dogs, domestic cats and baboons as well as humans, providing a natural reservoir for the pathogen and thus complicating eradication efforts. In response, the eradication effort is now also targeting animals (especially wild dogs) for treatment and isolation since animal infections far outnumber human infections now (in 2020 Chad reported 1570 animal infections and 12 human infections). === Yaws === Yaws is a rarely fatal but highly disfiguring disease caused by the spiral-shaped bacterium (spirochete) Treponema pallidum pertenue, a close relative of the syphilis bacterium Treponema pallidum pallidum, spread through skin to skin contact with infectious lesions. The global prevalence of this disease and the other endemic treponematoses, bejel and pinta, was reduced by the Global Control of Treponematoses programme between 1952 and 1964 from about 50 million cases to about 2.5 million (a 95% reduction). However, following the cessation of this program these diseases remained at a low prevalence in parts of Asia,
|
{"page_id": 14499186, "title": "Eradication of infectious diseases"}
|
language Zonnon John Guttag, co-developer of the Larch family of formal specification languages and the Larch Prover (LP) Michael Guy, co-author of ALGOL 68C == H == Nico Habermann, co-designer of BLISS Robert Harper, contributions to Standard ML and the LF logical framework, ACM SIGPLAN 2021 PL Achievement Award for foundational contributions to type theory Eric Hehner, for predicative programming, a formal method for specification and refinement Anders Hejlsberg, original author of Turbo Pascal, chief architect of C# Laurie Hendren, continuous and significant contributions for 30+ years to the field of OO programming languages and compiling Thomas Henzinger, received the 2015 Milner Award for "fundamental advances in the theory and practice of formal verification and synthesis of reactive, real-time, and hybrid computer systems" Maurice Herlihy, 2003, 2012, and 2022 Dijkstra Prizes, one for work on transactional memory Rich Hickey, designer of Clojure Tony Hoare, first axiomatic basis for proving programs correct, CSP, the 1980 Turing Award for fundamental contributions to the definition and design of programming languages Ric Holt, the Turing programming language, contributions to Grok, Euclid, SP/k, and S/SL Urs Hölzle, co-implemented Strongtalk, a Smalltalk environment with optional static typing support, later became Googles first Vice President of Engineering Grace Hopper, co-designer of COBOL Jim Horning, interests included programming languages, programming methodology, specification; co-developer of the Larch approach to formal specification Susan B. Horwitz, noted for research on programming languages and software engineering, and in particular on program slicing and dataflow-analysis Paul Hudak, known for involvement in designing the language Haskell, and for several textbooks on it and computer music Gérard Huet, ACM SIGPLAN 2013 PL Software Award and the 2015 ACM Software System Award for the Coq proof assistant John Hughes, PhD thesis The Design and Implementation of Programming Languages., co-developer of the QuickCheck software library, 2018 ACM
|
{"page_id": 20567976, "title": "List of programming language researchers"}
|
a non-linear virtually zeroed resistance where the logarithmic forward IV curve of a diode is transformed to a vertical straight line overlapping the y {\displaystyle y} axis. Not constant coefficient. If the coefficient K {\displaystyle K} varies, some exotic virtual elements can be obtained. A gyrator circuit is an example of such a virtual element where the resistance R L {\displaystyle R_{L}} is modified so that to mimic inductance, capacitance or inversed resistance. == Dual Miller theorem (for currents) == === Definition === There is also a dual version of Miller theorem that is based on Kirchhoff's current law (Miller theorem for currents): if there is a branch in a circuit with impedance Z {\displaystyle Z} connecting a node, where two currents I 1 {\displaystyle I_{1}} and I 2 {\displaystyle I_{2}} converge to ground, we can replace this branch by two conducting the referred currents, with impedances respectively equal to ( 1 + α ) Z {\displaystyle (1+\alpha )Z} and ( 1 + α ) Z α {\displaystyle {\frac {(1+\alpha )Z}{\alpha }}} , where α = I 2 I 1 {\displaystyle \alpha ={\frac {I_{2}}{I_{1}}}} . The dual theorem may be proved by replacing the two-port network by its equivalent and by applying the source absorption theorem. === Explanation === Dual Miller theorem actually expresses the fact that connecting a second current source producing proportional current I 2 = K I 1 {\displaystyle I_{2}=KI_{1}} in parallel with the main input source and the impedance element changes the current flowing through it, the voltage and accordingly, the circuit impedance seen from the side of the input source. Depending on the direction, I 2 {\displaystyle I_{2}} acts as a supplemental current source helping or opposing the main current source I 1 {\displaystyle I_{1}} to create voltage across the impedance. The combination of the
|
{"page_id": 28211376, "title": "Miller theorem"}
|
of Fomalhaut's massive, cold debris disk (or dust belt/ring). The belt is not centered on the star, and has a sharper inner boundary than would normally be expected. The initial theory was that a massive planet on a wide orbit but located interior to this debris ring could clear out parent bodies and dust in its vicinity, leaving the ring appearing to have a sharp inner edge and making it appear offset from the star. In May 2008, Paul Kalas, James Graham and their collaborators identified Fomalhaut b from Hubble/ACS images taken in 2004 and 2006 at visible wavelengths (i.e. 0.6 and 0.8 μm). NASA released the composite discovery photograph on November 13, 2008, coinciding with the publication of discovery by Kalas et al. in Science. Kalas remarked, "It's a profound and overwhelming experience to lay eyes on a planet never before seen. I nearly had a heart attack at the end of May when I confirmed that Fomalhaut b orbits its parent star." In the image, the bright outer oval band is the dust ring, while the features inside of this band represent noise from scattered starlight. === Early follow-up observations and doubts === In the discovery paper, Kalas and collaborators suggested that Fomalhaut b's emission originates from two sources: from circumplanetary dust scattering starlight and from planet thermal emission. Here, the former explains most of the 0.6 μm brightness and planet thermal emission contributes to much of the 0.8 μm brightness. Their non-detections with ground-based infrared data suggested that Fomalhaut b could not be more massive than about three times Jupiter's mass if it were a planet. However, Fomalhaut b should be detectable in space-based infrared data if it is a planet and has a mass between 1–3 times Jupiter's mass. On the contrary, observations from the infrared-sensitive
|
{"page_id": 20203716, "title": "Fomalhaut b"}
|
diagonal form: Ric = Q 2 ρ 4 [ 1 0 0 0 0 − 1 0 0 0 0 1 0 0 0 0 1 ] {\displaystyle {\mbox{Ric}}={\frac {Q^{2}}{\rho ^{4}}}{\begin{bmatrix}1&0&0&0\\0&-1&0&0\\0&0&1&0\\0&0&0&1\\\end{bmatrix}}} Notice the location of the minus-one entry: this comes entirely from the electromagnetic contribution. Namely, when the electromagnetic stress tensor F a b {\displaystyle F_{ab}} has only two non-vanishing components: F 01 {\displaystyle F_{01}} and F 23 {\displaystyle F_{23}} , then the corresponding energy–momentum tensor takes the form T Maxwell = F 01 2 + F 23 2 4 [ 1 0 0 0 0 − 1 0 0 0 0 1 0 0 0 0 1 ] {\displaystyle T^{\mbox{Maxwell}}={\frac {F_{01}^{2}+F_{23}^{2}}{4}}{\begin{bmatrix}1&0&0&0\\0&-1&0&0\\0&0&1&0\\0&0&0&1\\\end{bmatrix}}} Equating this with the energy–momentum tensor for the gravitational field leads to the Kerr–Newman electrovacuum solution. == References == Shapiro, S. L.; Teukolsky, S. A. (1983). Black Holes, White Dwarfs, and Neutron Stars: The Physics of Compact Objects. New York: Wiley. p. 357. ISBN 9780471873167.
|
{"page_id": 2597983, "title": "Boyer–Lindquist coordinates"}
|
in the scene must be smaller. If they are not, then they are false positives. Images from Hoiem et al. (2008) c ©IEEE. feet are, and pedestrians whose feet are closer to the horizon in the image are farther away from the camera (Figure 24.22). Pedestrians who are farther away from the camera must also be smaller in the image. This means we can rule out some detector responses — if a detector finds a pedestrian who is large in the image and whose feet are close to the horizon, it has found an enormous pedestrian; these don’t exist, so the detector is wrong. In fact, many or most image windows are not acceptable pedestrian windows, and need not even be presented to the detector. There are several strategies for finding the horizon, including searching for a roughly horizontal line with a lot of blue above it, and using surface orientation estimates obtained from texture deformation. A more elegant strategy exploits the reverse of our geometric constraints. A reasonably reliable pedestrian detector is capable of producing estimates of the horizon, if there are several pedestrians in the scene at different distances from the camera. This is because the relative scaling of the pedestrians is a cue to where the horizon is. So we can extract a horizon estimate from the detector, then use this estimate to prune the pedestrian detector’s mistakes. 956 Chapter 24. Perception If the object is familiar, we can estimate more than just the distance to it, because what it looks like in the image depends very strongly on its pose, i.e., its position and orientation with respect to the viewer. This has many applications. For instance, in an industrial manipulation task, the robot arm cannot pick up an object until the pose is known. In the
|
{"source": 1019, "title": "from dpo"}
|
I error]( "Type I error")). In this case a single multivariate test is preferable for hypothesis testing. Fisher's Method for combining multiple tests with _alpha_ reduced for positive correlation among tests is one. Another is Hotelling's _T_ 2 statistic follows a _T_ 2 distribution. However, in practice the distribution is rarely used, since tabulated values for _T_ 2 are hard to find. Usually, _T_ 2 is converted instead to an _F_ statistic. For a one-sample multivariate test, the hypothesis is that the mean vector (**μ**) is equal to a given vector (**μ**0). The test statistic is Hotelling's _t_ 2: !Image 66: {\displaystyle t^{2}=n({\bar {\mathbf {x} }}-{{\boldsymbol {\mu }}_{0}})'{\mathbf {S} }^{-1}({\bar {\mathbf {x} }}-{{\boldsymbol {\mu }}_{0}})}. For a two-sample multivariate test, the hypothesis is that the mean vectors (**μ**1, **μ**2) of two samples are equal. The test statistic is Hotelling's two-sample _t_ 2: !Image 67: {\displaystyle t^{2}={\frac {n_{1}n_{2}}{n_{1}+n_{2}}}\left({\bar {\mathbf {x} }}_{1}-{\bar {\mathbf {x} }}_{2}\right)'{\mathbf {S} _{\text{pooled}}}^{-1}\left({\bar {\mathbf {x} }}_{1}-{\bar {\mathbf {x} }}_{2}\right).}] The two-sample _t_-test is a special case of simple linear regression as illustrated by the following example. A clinical trial examines 6 patients given drug or placebo. Three (3) patients get 0 units of drug (the placebo group). Three (3) patients get 1 unit of drug (the active treatment group). At the end of treatment, the researchers measure the change from baseline in the number of words that each patient can
|
{"source": 2779, "title": "from dpo"}
|
_The Emeritimes, Fall 2003_ **J. M. (JAY) METCALF**, Emeritus Professor of Art, 1960-1977, died on February 14, 2003 in Albuquerque, where he lived following his retirement in 1980. He was 89 years old. Jay joined the faculty in 1960 after an extended career in elementary and secondary art education. A veteran of both World War II and the Korean War, Jay went up through the Army ranks, including Officer Candidate School, and ended his military service as a captain in the Reserves. Before his Army years, Jay had earned a B.A. in 1939 at New Mexico Highlands University and an M.A. in 1941 at Colorado State University. Between the wars, he taught at Portales (New Mexico) High School, where he started the program in art. In 1953, he moved to California, teaching first at Montebello High School and later in Burlingame. Returning to Southern California, he earned a M.Ed. degree in art education in 1960 at the University of Southern California, having completed the coursework for the Ed.D. But he became too busy to write a dissertation after beginning his faculty service at Los Angeles State College in its formative years. In addition to teaching art in various media and preparing prospective art teachers, Jay was very active in square dancing. He served as president of the Bachelors �n' Bachelorettes from 1972 to 1980 and received the Silver Spur Award from the American Square Dance Society for his leadership in square dance activities, including the tours he organized to performance destinations on every continent. As a traveler, Jay started very early. He was born on June 13, 1914 in Paducah, Texas. His parents took him further west the following year, in a covered wagon. They settled in rural eastern New Mexico, where he attended the local public schools and went
|
{"source": 5205, "title": "from dpo"}
|
rectangle satisfies a = xy . By the AM–GM inequality, we have a = xy 6 ( x + y 2 )2 = p2 16 Equality holds if and only if x = y, in other words, if and only if the rectangle is a square. Exercise 6.1.43. Let a, b > 0 be real numbers. Prove that a2 + b2 2 > ab . Example 6.1.44. Let x > 0. We find the minimum possible value of x + 9 > x . By the AM–GM inequality, we have x + 9 x > 2 √ x · 9 x = 2 √9 = 6 with equality if and only if x = 9 > x , which occurs if and only if x = 3. Hence the minimum value of x + 9 > x when x > 0 is 6. Exercise 6.1.45. Let x > 0 and let n ∈ N. Find the minimum possible value of > n ∑ > k=−n xk.Exercises 6.1.46 and 6.1.47 complete the proof of the AM–GM inequality (Theorem 6.1.41). Before proceeding with the exercises, let’s fix some notation. For each n ∈ N, let pAM–GM (n) be the assertion that the AM–GM inequality (Theorem 6.1.41) holds for collections of n numbers; that is, pAM–GM (n) is the assertion: For all x1, x 2, . . . , x n > 0, we have 1 n > n ∑ > i=1 xi 6 n √√√√ n∏ > i=1 xi with equality if and only if x1 = x2 = · · · = xn.Note that we already proved pAM–GM (2). Exercise 6.1.46. Let r ∈ N and let x1, x 2, . . . , x 2r ∈ R. Write a = 1 r > r ∑ > i=1 xi and g
|
{"source": 6389, "title": "from dpo"}
|
for correct chromosome congression and mitotic progression, and that it interacts with components of the cohesin and condensin complexes. Different laboratories have shown that the Ndc80 complex is essential for stabilization of the kinetochore-microtubule anchoring, required to support the centromeric tension implicated in the establishment of the correct chromosome congression in high eukaryotes. Cells with impaired function of Ndc80 (using RNAi, gene knockout, or antibody microinjection) have abnormally long spindles, lack of tension between sister kinetochores, chromosomes unable to congregate at the metaphase plate and few or any associated kMTs. There is a variety of strong support for the ability of the Ndc80 complex to directly associate with microtubules and form the core conserved component of the kinetochore-microtubule interface. However, formation of robust kinetochore-microtubule interactions may also require the function of additional proteins. In yeast, this connection requires the presence of the complex Dam1-DASH-DDD. Some members of this complex bind directly to MTs, whereas some others bind to the Ndc80 complex. This means that the complex Dam1-DASH-DDD might be an essential adapter between kinetochores and microtubules. However, in animals an equivalent complex has not been identified, and this question remains under intense investigation. === Verification of kinetochore–MT anchoring === During S-Phase, the cell duplicates all the genetic information stored in the chromosomes, in the process termed DNA replication. At the end of this process, each chromosome includes two sister chromatids, which are two complete and identical DNA molecules. Both chromatids remain associated by cohesin complexes until anaphase, when chromosome segregation occurs. If chromosome segregation happens correctly, each daughter cell receives a complete set of chromatids, and for this to happen each sister chromatid has to anchor (through the corresponding kinetochore) to MTs generated in opposed poles of the mitotic spindle. This configuration is termed amphitelic or bi-orientation. However, during the
|
{"page_id": 998893, "title": "Kinetochore"}
|
Kazimierz Boratyński (Polish pronunciation: [kaˈʑi.mjɛʂ bɔratɨɲski]; July 30, 1906, in Gródek – December 8, 1991, in Wrocław) was a Polish chemist. He specialized in the field of soil science. In his research work, he dealt with the chemistry of mineral fertilizers, soil chemistry and physics, humus processes in soil, and soil geography. == Publications == O kwasach metafosforowych (1932) Metafosforany i pirofosforany jako źródło fosforu dla roślin (1933) O odmianach pięciotlenku fosforu (1933) Badania nad próchnicą (1962–1965) Wpływ nawożenia na związki próchnicze gleby lekkiej (1968)
|
{"page_id": 18328075, "title": "Kazimierz Boratyński"}
|
from the Baltic States, Belarus, Poland and Russia whilst EHG-related ancestries are highest in Finland and Estonia. Steppe-related ancestries are found in high levels in northern Europe, peaking in Ireland, Iceland, Norway and Sweden, but decrease further south, especially in southern Europe, where Neolithic Anatolian-related farmer ancestries dominate. ==== Autosomal genetic distances (Fst) based on SNPs (2009) ==== The genetic distance between populations is often measured by Fixation index (Fst), based on genetic polymorphism data, such as single-nucleotide polymorphisms (SNPs) or microsatellites. Fst is a special case of F-statistics, the concept developed in the 1920s by Sewall Wright. Fst is simply the correlation of randomly chosen alleles within the same sub-population relative to that found in the entire population. It is often expressed as the proportion of genetic diversity due to allele frequency differences among populations. The values range from 0 to 1. A zero value implies that the two populations are panmictic, that they are interbreeding freely. A value of one would imply that the two populations are completely separate. The greater the Fst value, the greater the genetic distance. Essentially, these low Fst values suggest that the majority of genetic variation is at the level of individuals within the same population group (~ 85%); whilst belonging to a different population group within same ‘race’/ continent, and even to different racial/ continental groups added a much smaller degree of variation (3–8%; 6–11%, respectively). CEU – Utah residents with ancestry from Northern and Western Europe. == History of research == === Classical genetic markers (by proxy) === One of the first scholars to perform genetic studies was Luigi Luca Cavalli-Sforza. He used classical genetic markers to analyse DNA by proxy. This method studies differences in the frequencies of particular allelic traits, namely polymorphisms from proteins found within human blood (such
|
{"page_id": 6578583, "title": "Genetic history of Europe"}
|
DCC tape is the same 0.15 inches (3.8 mm) width as in analog compact cassettes, and operates at the same speed: 1+7⁄8 inches (4.8 cm) per second. The tape that was used in production cassettes was chromium dioxide- or cobalt-doped ferric oxide, 3–4 μm thick in a total tape thickness of 12 μm, identical to the tape that was widely in use for video tapes. Nine heads are used to read/write half the width of the tape; the other half of the width are used for the B-side. Eight of these tracks contain audio data, the ninth track is used for auxiliary information such as song titles and track markers, as well as markers to make the player switch from side A to side B (with or without winding towards the end of the tape first) and end-of-tape markers. The (theoretical) maximum capacity of a DCC tape is 120 minutes, compared to 3 hours for DAT; however, no 120-minute tapes were ever produced. Also, because of the time needed for the mechanism to switch direction, there is always a short interruption in the audio between the two sides of the tape. DCC recorders could record from digital sources that used the S/PDIF standard, at sample rates of 32 kHz, 44.1 kHz or 48 kHz, or they could record from analog sources at 44.1 kHz. Because of the low tape speed, the achievable bit rate of DCC is limited. To compensate, DCC uses Precision Adaptive Sub-band Coding (PASC) for audio data compression. PASC was later integrated into the ISO/IEC 11172-3 standard as MPEG-1 Audio Layer I (MP1). Though MP1 allows various bit rates, PASC is fixed at 384 kilobits per second. The bandwidth of a CD recording of approximately 1.4 megabits per second is reduced to 384 kilobits per second, a
|
{"page_id": 291003, "title": "Digital Compact Cassette"}
|
required to overcome in order to form nuclei. It is the formation of the nuclei from the bulk to a surface that is the interfacial free energy. The interfacial free energy is always a positive term and acts to destabilize the nucleus allowing the continuation of the growing polymer chain. The nucleation continues as a favorable reaction. == Thermodynamics of polymer crystallization == The Lauritzen–Hoffman plot (right) models the three different regimes when (logG) + U*/k(T-T0) is plotted against (TΔT)−1. It can be used to describe the rate at which secondary nucleation competes with lateral addition at the growth front among the different temperatures. This theory can be used to help understand the preferences of nucleation and growth based on the polymer's properties including its standard melting temperature. === Lamellar thickening (Hoffman–Weeks plot) === For many polymers, the change between the initial lamellar thickness at Tc is roughly the same as at Tm and can thus be modeled by the Gibbs–Thomson equation fairly well. However, since it implies that the lamellar thickness over the given supercooling range (Tm–Tc) is unchanged, and many homogeneous nucleation of polymers implies a change of thickness at the growth front, Hoffman and Weeks pursued a more accurate representation. In this regard, the Hoffman-Weeks plot was created and can be modeled through the equation T m = T c β + ( 1 − 1 β ) T m ∘ {\displaystyle T_{\text{m}}={T_{\text{c}} \over \beta }+(1-{1 \over \beta })T_{\text{m}}^{\circ }} where β is representative of a thickening factor given by L = L0 β and Tcand Tm are the crystallization and melting temperatures, respectively. Applying this experimentally for a constant β allows for the determination of the equilibrium melting temperature, Tm° at the intersection of Tcand Tm. == Kinetics of polymer crystallization == The crystallization process of
|
{"page_id": 39642591, "title": "Hoffman nucleation theory"}
|
agricultural crops—soybeans, maize, wheat and cotton. Monsanto agreed to indemnify Pharmacia against potential liabilities from judgments against Solutia. As a result, the new Monsanto continued to be a party to numerous lawsuits over the prior Monsanto. Pharmacia was bought by Pfizer in 2003. In 2005, Monsanto acquired Emergent Genetics and its Stoneville and NexGen cotton brands. Emergent was the third-largest U.S. cotton seed company, with about 12% of the U.S. market. Monsanto's goal was to obtain "a strategic cotton germplasm and traits platform". Also in 2005, Monsanto purchased Seminis, the California-based world leader in vegetable seed production, for $1.4 billion. Seminis developed new vegetable varieties using advanced cross-pollination methods. Monsanto indicated that Seminis would continue with non-GM development, while not ruling out GM in the longer term. In June 2007, Monsanto purchased Delta and Pine Land Company, a major cotton seed breeder, for $1.5 billion. As a condition for approval from the Department of Justice, Monsanto was obligated to divest its Stoneville cotton business, which it sold to Bayer, and to divest its NexGen cotton business, which it sold to Americot. Monsanto also exited the pig-breeding business by selling Monsanto Choice Genetics to Newsham Genetics LC in November, divesting itself of "any and all swine-related patents, patent applications, and all other intellectual property".: 108 In 2007, Monsanto and BASF announced a long-term agreement to cooperate in the research, development, and marketing of new plant biotechnology products. In 2008, Monsanto purchased Dutch seed company De Ruiter Seeds for €546 million, and sold its POSILAC bovine somatotropin brand and related business to Elanco Animal Health, a division of Eli Lilly & Co, in August for $300 million plus "additional contingent consideration". ==== 2010 to 2017: Further growth, Syngenta ==== In 2012, Monsanto purchased for $210 million Precision Planting Inc., a company that
|
{"page_id": 93825, "title": "Monsanto"}
|
In computing, an abstraction layer or abstraction level is a way of hiding the working details of a subsystem. Examples of software models that use layers of abstraction include the OSI model for network protocols, OpenGL, and other graphics libraries, which allow the separation of concerns to facilitate interoperability and platform independence. In computer science, an abstraction layer is a generalization of a conceptual model or algorithm, away from any specific implementation. These generalizations arise from broad similarities that are best encapsulated by models that express similarities present in various specific implementations. The simplification provided by a good abstraction layer allows for easy reuse by distilling a useful concept or design pattern so that situations, where it may be accurately applied, can be quickly recognized. Just composing lower-level elements into a construct doesn't count as an abstraction layer unless it shields users from its underlying complexity. A layer is considered to be on top of another if it depends on it. Every layer can exist without the layers above it, and requires the layers below it to function. Frequently abstraction layers can be composed into a hierarchy of abstraction levels. The OSI model comprises seven abstraction layers. Each layer of the model encapsulates and addresses a different part of the needs of digital communications, thereby reducing the complexity of the associated engineering solutions. A famous aphorism of David Wheeler is, "All problems in computer science can be solved by another level of indirection." This is often deliberately misquoted with "abstraction" substituted for "indirection." It is also sometimes misattributed to Butler Lampson. Kevlin Henney's corollary to this is, "...except for the problem of too many layers of indirection." == Computer architecture == In a computer architecture, a computer system is usually represented as consisting of several abstraction levels such as: software
|
{"page_id": 574775, "title": "Abstraction layer"}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.