text
stringlengths 5
10.5k
| source
stringlengths 33
146
|
|---|---|
necessary to create a reliable base of future patronage. This approach should improve diversion behavior and in the long term will be consistent with both improved mobility and revenue generation assuming other issues related to pricing and revenue use in initial and later years have been dealt with. It is therefore recommended that: • Initially low peak and off-peak rates should be imposed. This dual approach is good for public acceptability initially but not good for revenue generation or welfare. This approach is also not good for demand management. These initial low rates can be based on willingness to pay market studies. • At a later stage, when demand is stimulated and elasticity improves, such projects can implement other pricing techniques to effectively manage demand and at the same time raise revenue. A privately funded project, however, will be primarily concerned with revenue generation. The success of such projects will rely on the effective management of demand to raise revenue. Their pricing structures will in general be much higher than those of publicly funded projects. A final comment in this regard is needed to conform to some guidelines in price setting. Hau provides some excellent criteria that a good road pricing system must follow. From the user ’spoint of view the following criteria can be put forward (30): • The system should be simple and user friendly. • Drivers should be informed about prices ahead of time and place. Otherwise, the system will fail to be incentive-correct. • User privacy should prevail. • Transaction costs should be low, and billing and charges should be easy to check. From the operator ’s point of view the following points should be emphasized: • The system should be able to directly influence traffic flows and improve efficiency. • Tolls should be demand-responsive. 49
|
{"source": 7320, "title": "from dpo"}
|
lack of magazines or clubs dedicated to miniature wargames. Miniature wargaming was seen as a niche within the larger hobby of making and collecting model soldiers. === Post-War growth === In 1955, an American named Jack Scruby began making inexpensive miniature models for miniature wargames out of type metal. Scruby's major contribution to the miniature wargaming hobby was to network players across America and the UK. At the time, the miniature wargaming community was minuscule, and players struggled to find each other. In 1956, Scruby organized the first miniature wargaming convention in America, which was attended by just fourteen people. From 1957 to 1962, he self-published the world's first miniature wargaming magazine, titled The War Game Digest, through which wargamers could publish their rules and share game reports. It had less than two hundred subscribers, but it did establish a community that kept growing. Around the same time in the United Kingdom, Donald Featherstone began writing an influential series of books on wargaming, which represented the first mainstream published contribution to wargaming since Little Wars. Titles included : War Games (1962), Advanced Wargames, Solo Wargaming, Wargame Campaigns, Battles with Model Tanks, Skirmish Wargaming. Such was the popularity of such titles that other authors were able to have published wargaming titles. This output of published wargaming titles from British authors coupled with the emergence at the same time of several manufacturers providing suitable wargame miniatures (e.g. Miniature Figurines, Hinchliffe, Peter Laing, Garrison, Airfix, Skytrex, Davco, Heroic & Ros) was responsible for the huge upsurge of popularity of the hobby in the late 1960s and into the 1970s. In 1956, Tony Bath published what was the first ruleset for a miniature wargame set in the medieval period. In 1971, Gary Gygax developed his own miniature wargame system for medieval warfare called Chainmail.
|
{"page_id": 284670, "title": "Miniature wargaming"}
|
introduced Averroes to the Almohad caliph Abu Yaqub Yusuf. In a famous account reported by historian 'Abd al-Wahid al-Marrakushi, the caliph asked Averroes whether the heavens had existed since eternity or had a beginning. Knowing this question was controversial and worried a wrong answer could put him in danger, Averroes did not answer. The caliph then elaborated the views of Plato, Aristotle and Muslim philosophers on the topic and discussed them with Ibn Tufayl. This display of knowledge put Averroes at ease; Averroes then explained his views on the subject, which impressed the caliph. Averroes was similarly impressed by Abu Yaqub and later said the caliph had "a profuseness of learning I did not suspect". After their introduction, Averroes remained in Abu Yaqub's favor until the caliph died in 1184. When the caliph complained to Ibn Tufayl about the difficulty of understanding Aristotle's work, Ibn Tufayl recommended to the caliph that Averroes work on explaining it. This was the beginning of Averroes's massive commentaries on Aristotle; his first works on the subject were written in 1169. In the same year, Averroes was appointed qadi (judge) in Seville. In 1171 he became qadi in his hometown of Córdoba. As qadi he would decide cases and give fatwas (legal opinions) based on religious law. The writing rate increased during this time despite other obligations and his travels within the Almohad empire. He also took the opportunity from his travels to conduct astronomical research. Many of his works produced between 1169 and 1179 were dated in Seville rather than Córdoba. In 1179 he was again appointed qadi in Seville. In 1182, he succeeded his friend Ibn Tufayl as court physician. Later the same year, he was appointed chief qadi of Córdoba, then controlled by the Taifa of Seville, a prestigious office that his
|
{"page_id": 47836, "title": "Averroes"}
|
A number of electrical laws apply to all linear resistive networks. These include: Kirchhoff's current law: The sum of all currents entering a node is equal to the sum of all currents leaving the node. Kirchhoff's voltage law: The directed sum of the electrical potential differences around a loop must be zero. Ohm's law: The voltage across a resistor is equal to the product of the resistance and the current flowing through it. Norton's theorem: Any network of voltage or current sources and resistors is electrically equivalent to an ideal current source in parallel with a single resistor. Thévenin's theorem: Any network of voltage or current sources and resistors is electrically equivalent to a single voltage source in series with a single resistor. Superposition theorem: In a linear network with several independent sources, the response in a particular branch when all the sources are acting simultaneously is equal to the linear sum of individual responses calculated by taking one independent source at a time. Applying these laws results in a set of simultaneous equations that can be solved either algebraically or numerically. The laws can generally be extended to networks containing reactances. They cannot be used in networks that contain nonlinear or time-varying components. == Design methods == To design any electrical circuit, either analog or digital, electrical engineers need to be able to predict the voltages and currents at all places within the circuit. Simple linear circuits can be analyzed by hand using complex number theory. In more complex cases the circuit may be analyzed with specialized computer programs or estimation techniques such as the piecewise-linear model. Circuit simulation software, such as HSPICE (an analog circuit simulator), and languages such as VHDL-AMS and verilog-AMS allow engineers to design circuits without the time, cost and risk of error involved in
|
{"page_id": 9559, "title": "Electrical network"}
|
A Carey mask (named after the inventor, George F. Carey) is a focusing aid for astronomical telescopes. The mask is in the form of a thin card or sheet that is placed over the front aperture of the telescope. There are four series of slits in the mask which form a diffraction pattern in the image plane. In this example the two sets of slits on the left are angled at 12 degrees to each other. Those on the right are angled at 10 degrees to each other. Different telescope and imaging combinations may require slightly different angles. The diffraction pattern caused by the left hand slits will be in the form of an 'X'. The right hand slits will also form an 'X' shape, but the lines forming the 'X' will cross at a narrower angle. When perfect focus is achieved the two 'X's will be superimposed and be perfectly symmetrical. Any slight error in focus will cause the 'X's to be offset, and this is very noticeable to the naked eye. In the example images below, focus error is obvious in the first two images. The third image is very close to perfect focus as shown by the equal spacing between the elongated spikes on the left and the right. A negative image can sometimes show the diffraction spikes more clearly. The enlarged view below shows the left hand spikes to be slightly further apart than those on the right. This is an indication that the focus knob needs to be rotated slightly anti-clockwise. If the right hand spikes were further apart, a clockwise rotation would be needed. The mask should always be placed over the aperture with the same orientation. If the mask was rotated 180 degrees, then the focus knob directions would be reversed. The operator
|
{"page_id": 23630641, "title": "Carey mask"}
|
be counted. For example, the busy beaver game can also be generalized to two dimensions using Turing machines on two-dimensional tapes, or to Turing machines that are allowed to stay in the same place as well as move to the left and right. Alternatively a "busy beaver function" for diverse models of computation can be defined with Kolmogorov complexity. This is done by taking B B ( n ) {\displaystyle {BB}(n)} to be the largest integer m {\displaystyle m} such that K L ( m ) ≤ n {\displaystyle K_{L}(m)\leq n} , where K L ( m ) {\displaystyle K_{L}(m)} is the length of the shortest program in L {\displaystyle L} that outputs m {\displaystyle m} : B B ( n ) {\displaystyle {BB}(n)} is thereby the largest integer a program with length n {\displaystyle n} or less can output in L {\displaystyle L} . The longest running 6-state, 2-symbol machine which has the additional property of reversing the tape value at each step produces 6147 1s after 47339970 steps. So for the Reversal Turing Machine (RTM) class, SRTM(6) ≥ 47339970 and ΣRTM(6) ≥ 6147. Likewise we could define an analog to the Σ function for register machines as the largest number which can be present in any register on halting, for a given number of instructions. === Different numbers of symbols === A simple generalization is the extension to Turing machines with m symbols instead of just two (0 and 1). For example a trinary Turing machine with m = 3 symbols would have the symbols 0, 1, and 2. The generalization to Turing machines with n states and m symbols defines the following generalized busy beaver functions: Σ(n, m): the largest number of non-zeros printable by an n-state, m-symbol machine started on an initially blank tape before halting,
|
{"page_id": 67911, "title": "Busy beaver"}
|
ranges in deionized waters, whereas NDIR detection excels in all TOC ranges. A variation described as "membrane conductometric detection can allow for measurement of TOC across a wide analytical range in both deionized and non-deionized water samples. Modern high-performance TOC instruments are capable of detecting carbon concentrations well below 1 μg/L (1 part per billion or ppb). A total organic carbon analyser determines the amount of carbon in a water sample. By acidifying the sample and flushing with nitrogen or helium the sample removes inorganic carbon, leaving only organic carbon sources for measurement. There are two types of analysers. One uses combustion and the other chemical oxidation. This is used as a water purity test, as the presence of bacteria introduces organic carbon. === Analyser field testing and reports === A non-profit research and testing organization, the Instrumentation Testing Association (ITA) can provide results of field testing online TOC analysers in an industrial wastewater application. Gulf Coast Waste Disposal Authority (GCWDA), Bayport Industrial Wastewater Treatment Plant in Pasadena, Texas sponsored and conducted this test in 2011. The GCWDA Bayport facility treats approximately 30 mgd of industrial waste received from approximately 65 customers (primarily petrochemical). Field tests consisted of operating online TOC analysers at the influent of the Bayport facility in which TOC concentrations can range from 490 to 1020 mg/L with an average of 870 mg/L. GCWDA conducts approximately 102 TOC analyses in their laboratory per day at their Bayport treatment facility and use TOC measurements for process control and billing purposes. GCWDA plans to use online TOC analysers for process control, detecting influent slug loads from industries and to potentially use online TOC analysers to detect and monitor volatiles of the incoming stream. Field tests were conducted for a period of 90-days and used laboratory conformance measurements once per
|
{"page_id": 1940140, "title": "Total organic carbon"}
|
The U.S. Bureau of Mines (USBM), developed by Donaldson et al. in 1969, is a method to measure wettability of petroleum reservoir rocks. In this method, the areas under the forced displacement Capillary pressure curves of oil and water drive processes are denoted as A 1 {\displaystyle A1} and A 2 {\displaystyle A2} to calculate the USBM index. U S B M = l o g A 1 A 2 {\displaystyle USBM=log{\frac {A_{\mathit {1}}}{\ A_{\mathit {2}}}}} USBM index is positive for water-wet rocks, and negative for oil-wet systems. == Bounded USBM (or USBM*) == The USBM index is theoretically unbounded and can vary from negative infinity to positive infinity. Since other wettability indices such as Amott-Harvey, Lak wettability index and modified Lak are bounded in the range of -1 to 1, Abouzar Mirzaei-Paiaman highlighted the bounded form of USBM (called USBM*) as a replacement of the traditional USBM as U S B M ∗ = A 1 − A 2 A 1 + A 2 {\displaystyle USBM*={\frac {A_{\mathit {1}}-A_{\mathit {2}}}{\ A_{\mathit {1}}+A_{\mathit {2}}}}} USBM* varies from -1 to 1 for strongly oil-wet and strongly water-wet rocks, respectively. == See also == Wetting Amott test Lak wettability index == References ==
|
{"page_id": 69615015, "title": "USBM wettability index"}
|
cope with drought that commonly occurs later in the growing season. Deficit irrigation is beneficial for the farmers because it reduces the cost of water and prevents a loss of crop yield (for certain crops) later on in the growing season due to drought. In addition to these findings, ARS scientists suggest that deficit irrigation accompanied with conservation tillage would greatly reduce the peanut crop water requirement. For other crops, the application of deficit irrigation will result in a lower water use efficiency and yield. This is the case when crops are sensitive to drought stress throughout the complete season, such as maize. Apart from university research groups and farmers associations, international organizations such as FAO, ICARDA, IWMI and the CGIAR Challenge Program on Water and Food are studying DI. == Reasons for increased water productivity under deficit irrigation == If crops have certain phenological phases in which they are tolerant to water stress, DI can increase the ratio of yield over crop water consumption (evapotranspiration) by either reducing the water loss by unproductive evaporation, and/or by increasing the proportion of marketable yield to the totally produced biomass (harvest index), and/or by increasing the proportion of total biomass production to transpiration due to hardening of the crop - although this effect is very limited due to the conservative relation between biomass production and crop transpiration, - and/or due to adequate fertilizer application and/or by avoiding bad agronomic conditions during crop growth, such as water logging in the root zone, pests and diseases, etc. == Advantages == The correct application of deficit irrigation for a certain crop: maximizes the productivity of water, generally with adequate harvest quality; allows economic planning and stable income due to a stabilization of the harvest in comparison with rainfed cultivation; decreases the risk of certain diseases
|
{"page_id": 23254182, "title": "Deficit irrigation"}
|
is granted one last chance to win their money back. He offers not one word of objection to Obanno's feigned amputation of Valenka's arm, leading the ruthless warlord to advise her to find a new partner. As Obanno leaves the room, his bodyguard spots Bond and Vesper in the hallway, and hears Valenka's cries coming from Bond's earpiece. Bond kills the bodyguard by throwing him over a railing, then chokes Obanno to death with Vesper's assistance after relieving Obanno of his machete. René Mathis (Giancarlo Giannini) arranges the blame to be placed on Le Chiffre's bodyguard Leo (Emmanuel Avena) by planting the bodies in the trunk of Leo's car. On the second day of the tournament, Le Chiffre initially outwits and bankrupts Bond, who cannot get additional funding approved by Vesper. However, Felix Leiter (Jeffrey Wright), a Central Intelligence Agency agent sent to participate in the game, also in hopes of bankrupting Le Chiffre, agrees to bankroll Bond, on the condition that CIA is allowed to take Le Chiffre in afterwards. Desperate, Le Chiffre has Valenka spike Bond's drink. Bond almost dies, but, thanks to an antitoxin kit in his car, a defibrillator, and Vesper's timely assistance, he is revived at the last moment and returns to the game. During the final round, Le Chiffre's full house bests the hands of Infante (Ade) and Fukutu (Tom So), the two players preceding him, but loses to Bond's straight flush. Le Chiffre kidnaps Vesper, forcing Bond to give chase, and leads him straight into a trap. Le Chiffre leaves Vesper, bound at the feet and hands, in the middle of the road, and Bond is forced to swerve to avoid hitting her and crashes his car. Semiconscious, Bond is stripped naked and bound to a chair with the seat removed. Le Chiffre
|
{"page_id": 2058776, "title": "Le Chiffre"}
|
2018, and such activities were consistent with U.S. sanctions in effect at the time the loans or credits were extended, the U.S. government would allow the non-U.S., non-Iranian person to receive repayment of the related debt or obligation according to the terms of the written contract or written agreement. This allowance is designed for non-U.S., non-Iranian parties to be made whole for debts and obligations owed or due to them for goods or services fully provided or delivered or loans or credit extended to an Iranian party prior to the end of the 90-day or 180-day wind-down period, as applicable. Any payments would need to be consistent with U.S. sanctions, including that payments could not involve U.S. persons or the U.S. financial system, unless the transactions are exempt from regulation or authorized by OFAC (see FAQ 634 and FAQ 636). The U.S. government would evaluate matters falling outside the above parameters on a case-by-case basis. Iran Sanctions 632. Will the U.S. government provide assurances beyond the guidance described in 631 and 634 that receipt of payment by non-U.S., non-Iranian persons is not sanctionable? OFAC encourages non-U.S., non-Iranian persons to rely on the guidance provided in FAQs 631 and 634. Non-U.S., non-Iranian persons can seek guidance from OFAC or the State Department, as appropriate, prior to the receipt of payment, if they would like to confirm that the payments would meet the criteria set forth in FAQ 631 and FAQ 634 and would not be subject to U.S. sanctions. Iran Sanctions 633. Under what circumstances are goods or services considered “fully provided or delivered” prior to the expiration of the relevant wind-down period, as referenced in FAQ 631 above? OFAC looks to the industry standard to determine whether particular goods or services are considered fully provided or delivered prior to the
|
{"source": 54, "title": "from dpo"}
|
same, so the problem size must scale at the same rate as the processor count. Notice that, because we have changed the problem size, we cannot fairly compare the speedup of the original problem and the scaled problem. We will return to the critical issue of scaling applications for multiprocessors in Section I.6. In this section, we focus first on synchronization performance problems in larger multiprocessors and then on solutions for those problems. # Synchronization Performance Challenges To understand why the simple spin lock scheme presented in Chapter 5 does not scale well, imagine a large multiprocessor with all processors contending for the same lock. The directory or bus acts as a point of serialization for all the proces-sors, leading to lots of contention, as well as traffic. The following example shows how bad things can be. Example Suppose there are 10 processors on a bus and each tries to lock a variable simul-taneously. Assume that each bus transaction (read miss or write miss) is 100 clock cycles long. You can ignore the time of the actual read or write of a lock held in the cache, as well as the time the lock is held (they won’t matter much!). Determine the number of bus transactions required for all 10 processors to acquire the lock, assuming they are all spinning when the lock is released at time 0. About how long will it take to process the 10 requests? Assume that the bus is > T32 Compute time + Communication time =0.8 T×48-------------------0.2 T×4()8×+=0.1 T×40.57 T×4+=0.67 T×4=Speedup T4 > T32 --------T40.67 T×4----------------------1.49 === # I.4 Synchronization: Scaling Up I.4 Synchronization: Scaling Up ■ I-13 totally fair so that every pending request is serviced before a new request and that the processors are equally fast. Answer When i processes are contending
|
{"source": 2299, "title": "from dpo"}
|
n. In general, if we know that X can take values only from {x1, x2, . . . , xN }, it should be clear that > N # ∑ > i=1 P[X = xi ] = 1Given, for example, the distribution of the vertex degrees, we will regularly ask ourselves what the average vertex degree will be. For any discrete random variable X the notion of average is more accurately expressed in terms of its mean , also known as its expected value , defined as: E[X] def = > N # ∑ > i=1 xi · P[X = xi ] At first sight, this may seem a rather strange definition, but when giving the matter some thought it is not difficult to see that it boils down to computing what is known as a weighted average . First, if asked to compute the average of all xi, anyone would do the obvious and compute x1 + x2 + · · · + xN N In essence, what we’re doing is giving an equal weight to the contribution that each xi has to the average of X. In terms of probabilities, we are interested the expected occurrence of each xi, which is determined by the probability P[X = xi ].In our example of just computing the average, P[X = xi ] = 1 > N for each xi, and indeed, x1 + x2 + · · · + xN N = > N # ∑ > i=1 xi · 1 N = > N # ∑ > i=1 xi · P[X = xi ] If it turns out that the expected occurrence of xi is higher than that of, say, xj, xi’s contribution to the average of X will be higher than that of xj. In other words, we
|
{"source": 4215, "title": "from dpo"}
|
in Fig.3-anonymous. \(\square \) **Fig. 3** ![Image 3: figure 3\)-anonymity for \(k>1\) and \(2\le \ell \le 8\). **b** A (2,1)-anonymous graph not satisfying _k_-symmetry for \(k>1\). **c** A graph where the success probability of any active attack leveraging 2 sybil nodes is at most 1/2, despite the graph neither satisfying (2,2)-anonymity nor 2-symmetry Full size image K-automorphism: a general framework for privacy preserving network publication. Proc VLDB Endow 2(1):946–957")] does not protect against active attacks. This is a surprising result, given that _k_-automorphism and _k_-symmetry have traditionally been considered equivalent. We refer the interested reader to AppendixA K-automorphism: a general framework for privacy preserving network publication. Proc VLDB Endow 2(1):946–957")] as a sufficient condition to achieve _k_-automorphism, also guarantees _k_-symmetry. Given a graph _G_ and a value of _k_, the K-Match algorithm obtains a supergraph \(G'\) of _G_ satisfying the following conditions: 1. 1. \(V_{G'}\supseteq V_G\) and \(E_{G'}\supseteq E_G\). 2. 2. There exist \(k-1\) automorphisms \(\gamma _1, \gamma _2, \ldots , \gamma _{k-1}\) of \(G'\) such that: 1. (a) For every \(v\in V_{G'}\) and every \(i\in \{1,\ldots ,k-1\}\), \(\gamma _i(v)\ne v\). 2. (b) For every \(v\in V_{G'}\) and every \(i,j\in \{1,\ldots ,k-1\}\), \(i\ne j \Longleftrightarrow \gamma _i(v)\ne \gamma _j(v)\). 3. (c) For every \(v\in V_{G'}\) and every _i_,_j_ such that \(1\le i<j\le k-1\), \(\gamma _{i+j}(v)=\gamma _i(\gamma _j(v))=\gamma _j(\gamma _i(v))\), with addition taken modulo _k_. To obtain \(G'\), the algorithm first splits the vertices of \(G'\) into _k_ groups and arranges
|
{"source": 6109, "title": "from dpo"}
|
Information Service – cancer of unknown primary origin – cancer stem cell – cancer vaccine – Cancer.gov – Candidiasis – Candidosis – CAP-1 – capecitabine – capsaicin – captopril – carbendazim – carbogen – carbon-11 acetate – carboplatin – carboxyamidotriazole – carboxypeptidase-G2 – carcinoembryonic antigen – carcinoembryonic antigen peptide-1 – carcinogen – carcinogenesis – carcinoid – carcinoid syndrome – carcinoma – carcinoma in situ – carcinomatosis – carcinosarcoma – carcinosis – carcinostatic – cardin (oncology) – carmustine – carnitine – carotenoid – carzelesin – case report – case series – case-control study – caspofungin acetate – Castleman's disease – CAT scan – catechol – cauterization – cauterize – cBR96-doxorubicin immunoconjugate – CC-1088 – CC-49 monoclonal antibody – CC-5013 – CC-8490 – CCI-779 – CD34 antigen – CD40-ligand – CEA – CEA assay – cecum – cefalexin – cefepime – cefixime – ceftriaxone – celecoxib – celiac disease – cell – cell differentiation – cell motility – cell proliferation – cell respiration – cell adhesion – cellular adoptive immunotherapy – cellular metabolism – cellulitis – central nervous system primitive neuroectodermal tumor – central venous access catheter – CEP-2563 dihydrochloride – CEP-701 – cephalosporin – ceramide – cerebellar hemangioblastoma – cerebellopontine – cerebral hemisphere – cerebrospinal fluid – cerebrospinal fluid diversion – cervical – cervical intraepithelial neoplasia – cervix – cetuximab – cevimeline – CGP 48664 – Chamberlain procedure – chemoembolization – chemoimmunotherapy – chemoprevention – chemoprevention studies – chemoprotective – chemoradiation – chemoradiotherapy – chemosensitivity – chemosensitivity assay – chemosensitizer – chemotherapeutic agent – chemotherapy – chemotherapy-induced peripheral neuropathy – chest x-ray – chiasma – child-life worker – chitin – chlorambucil – chlorine – chloroma – chloroquinoxaline sulfonamide – cholangiocarcinoma – cholangiosarcoma – cholelith – cholestasis – chondrocyte – chondroitin sulfate – chondrosarcoma – chordoma – chorioallantoic membrane – choriocarcinoma –
|
{"page_id": 1120426, "title": "Index of oncology articles"}
|
so. === Huygens and Newton: Rival explanations === Christiaan Huygens, in his Treatise on Light (1690), paid much attention to the threshold at which the incident ray is "unable to penetrate into the other transparent substance". Although he gave neither a name nor an algebraic expression for the critical angle, he gave numerical examples for glass-to-air and water-to-air incidence, noted the large change in the angle of refraction for a small change in the angle of incidence near the critical angle, and cited this as the cause of the rapid increase in brightness of the reflected ray as the refracted ray approaches the tangent to the interface. Huygens' insight is confirmed by modern theory: in Eqs. (13) and (15) above, there is nothing to say that the reflection coefficients increase exceptionally steeply as θt approaches 90°, except that, according to Snell's law, θt itself is an increasingly steep function of θi. Huygens offered an explanation of TIR within the same framework as his explanations of the laws of rectilinear propagation, reflection, ordinary refraction, and even the extraordinary refraction of "Iceland crystal" (calcite). That framework rested on two premises: first, every point crossed by a propagating wavefront becomes a source of secondary wavefronts ("Huygens' principle"); and second, given an initial wavefront, any subsequent position of the wavefront is the envelope (common tangent surface) of all the secondary wavefronts emitted from the initial position. All cases of reflection or refraction by a surface are then explained simply by considering the secondary waves emitted from that surface. In the case of refraction from a medium of slower propagation to a medium of faster propagation, there is a certain obliquity of incidence beyond which it is impossible for the secondary wavefronts to form a common tangent in the second medium; this is what we
|
{"page_id": 30426, "title": "Total internal reflection"}
|
This is a list of electric aircraft, whose primary flight power is electrical. == References ==
|
{"page_id": 52728545, "title": "List of electric aircraft"}
|
Mizar and Alcor are two stars forming a naked eye double in the handle of the Big Dipper (or Plough) asterism in the constellation of Ursa Major. Their magnitudes are 2.2 and 3.9, and the pair can easily be seen without the aid of a telescope. Mizar and its fainter companion Alcor are actually a four-star binary system consisting of two pairs of double stars that are gravitationally bound to each other. The traditional name Mizar derives from the Arabic المئزر or miʼzar, meaning "apron; wrapper, covering, cover". Alcor was originally the Arabic سها or Suhā/Sohā, meaning either the "forgotten" or "neglected" one. The ancient Persians and the Bedouins used distinguishing Mizar and Alcor as a test of vision. Mizar, also designated Zeta Ursae Majoris (ζ Ursae Majoris, abbreviated Zeta UMa, ζ UMa), is itself a quadruple system and Alcor, also designated 80 Ursae Majoris (80 UMa), is a binary, the pair together forming a sextuple system. In fact, Mizar was the first known binary star system, claimed to be discovered by Italian astronomer Giovanni Battista Riccioli in 1650. The whole system lies about 83 light-years away from the Sun, as measured by the Hipparcos astrometry satellite. == Appearance == With normal eyesight Alcor appears at about 12 minutes of arc from Mizar. Alcor is of magnitude 3.99 and spectral class A5V. It has a faint red dwarf companion separated by 1 second of arc. == Stellar system == Mizar and Alcor's proper motions show they move together, along with most of the other stars of the Big Dipper except Alpha Ursae Majoris and Eta Ursae Majoris, as members of the Ursa Major Moving Group, a mostly dispersed group of stars sharing a common birth. However, it has yet to be demonstrated conclusively that they are gravitationally bound. Gaia parallax
|
{"page_id": 2728875, "title": "Mizar and Alcor"}
|
PL/C is an instructional dialect of the programming language PL/I, developed at the Department of Computer Science of Cornell University in the early 1970s in an effort headed by Professor Richard W. Conway and graduate student Thomas R. Wilcox. PL/C was developed with the specific goal of being used for teaching programming. The PL/C compiler, which implemented almost all of the large PL/I language, had the unusual capability of never failing to compile a program, through the use of extensive automatic correction of many syntax errors and by converting any remaining syntax errors to output statements. This was important because, at the time, students submitted their programs on IBM punch cards and might not get their output back for several hours. Over 250 other universities adopted PL/C; as one late-1970s textbook on PL/I noted, "PL/C ... the compiler for PL/I developed at Cornell University ... is widely used in teaching programming." Similarly, a mid-late-1970s survey of programming languages said that "PL/C is a widely used dialect of PL/I." == Origins and rationale == Work on this project was based on a prior Cornell compiler for the programming language CUPL, which in turn was influenced by the earlier Cornell language implementation CORC. Both of these were small, very restricted languages intended for the teaching of beginning programming. CORC had been used at Cornell from 1962 to 1966 and CUPL from 1965 to 1969. Conway's group had been involved in the development of both of those efforts, each of which attempted automatic repair of source code errors. As the 1970s began, Cornell was attempting to find a teaching language that had general commercial acceptance but also contained modern language features. As another Cornell computer science professor, David Gries, wrote at the time, the first criterion effectively eliminated the ALGOL family of languages
|
{"page_id": 309357, "title": "PL/C"}
|
another article for the magazine, explaining how to make a home wireless set. Both pieces were aimed at Girl Guides. Her employer, Margaret Partridge, encouraged her to study electrical engineering at the Victoria University of Manchester; in 1932, alongside Sheila McGuffie, she received a bachelor's degree and then studied for a further year to get a Master of Science degree in mechanical engineering. Jobs were hard to find in the Great Depression; she worked as a research assistant for Professor G. F. Mucklow at the University of Birmingham. In 1936 she was recruited as a scientific officer by the Royal Aircraft Establishment (RAE), the research and development agency of the Royal Air Force (RAF) in Farnborough, Hampshire. Her first position was as a technical author with the Air Ministry's technical publications department. She was allowed to transfer to doing work on aircraft engines. On 1 November 1939 she was promoted to become technical officer in charge of carburettor research and development and later promoted again to principal technical officer. Even as a senior member of staff she was respected by the factory workers for her hands-on skills, such as brazing a copper butt-joint with the skills of a dedicated fitter. == Royal Aircraft Establishment == Shilling worked on many projects for the Royal Aircraft Establishment (RAE) during the Second World War, the best-known of which was the RAE Restrictor modification (also known as Miss Shilling's Orifice) that solved the problem of Rolls-Royce Merlin engines stalling during negative-g flight. === The RAE Restrictor === During the Battle of France and Battle of Britain in 1940, RAF pilots discovered a serious problem in fighter planes with Rolls-Royce Merlin engines, such as the Hurricane and Spitfire. When the plane went nose-down to begin a dive the resulting negative g-force would flood the engine's
|
{"page_id": 11614323, "title": "Beatrice Shilling"}
|
Risk aversion is a preference for a sure outcome over a gamble with higher or equal expected value. Conversely, rejection of a sure thing in favor of a gamble of lower or equal expected value is known as risk-seeking behavior. The psychophysics of chance induce overweighting of sure things and of improbable events, relative to events of moderate probability. Underweighting of moderate and high probabilities relative to sure things contributes to risk aversion in the realm of gains by reducing the attractiveness of positive gambles. The same effect also contributes to risk seeking in losses by attenuating the aversiveness of negative gambles. Low probabilities, however, are overweighted, which reverses the pattern described above: low probabilities enhance the value of long-shots and amplify aversion to a small chance of a severe loss. Consequently, people are often risk seeking in dealing with improbable gains and risk averse in dealing with unlikely losses. == Related theories == Most theoretical analyses of risky choices depict each option as a gamble that can yield various outcomes with different probabilities. Widely accepted risk-aversion theories, including Expected Utility Theory (EUT) and Prospect Theory (PT), arrive at risk aversion only indirectly, as a side effect of how outcomes are valued or how probabilities are judged. In these analyses, a value function indexes the attractiveness of varying outcomes, a weighting function quantifies the impact of probabilities, and value and weight are combined to establish a utility for each course of action. This last step, combining the weight and value in a meaningful way to make a decision, remains sub-optimal in EUT and PT, as people's psychological assessments of risk do not match objective assessments. === Expected utility theory === Expected Utility Theory (EUT) poses a utility calculation linearly combining weights and values of the probabilities associated with various outcomes.
|
{"page_id": 41275963, "title": "Risk aversion (psychology)"}
|
12 Hydrae is a probable astrometric binary star system located 202 light years away from the Sun in the equatorial constellation of Hydra. It has the Bayer designation D Hydrae; 12 Hydrae is the Flamsteed designation. This system is visible to the naked eye as a faint, yellow-hued star with a combined apparent visual magnitude of 4.32. It is moving closer to the Earth with a heliocentric radial velocity of −8.5 km/s. This was found to be a double star by R. A. Rossiter in 1953, with the magnitude 13.7 companion having an angular separation of 26.8″ along a position angle of 266°, as of 2016. The brighter, magnitude 4.32 component A is a spectroscopic binary. As of 2009, the orbital solution for this pair is of low quality, giving a period of roughly 4 years and an eccentricity of around 0.4. The primary component is an aging giant star with a stellar classification of G8 IIIb CN-1, where the suffix notation indicates an underabundance of the cyanogen molecule. It is 910 million years old with 2.32 times the mass of the Sun. After exhausting the hydrogen at its core and evolving off the main sequence, the star has swollen to 11.5 times the Sun's radius. It is radiating 77 times the luminosity of the Sun from its enlarged photosphere at an effective temperature of 4,968 K. == References ==
|
{"page_id": 37122743, "title": "12 Hydrae"}
|
points and a line. (Baker 1922b, vol 2, p. 49) embedded An embedded variety is one contained in a larger variety, sometimes called the ambient variety. enneaedro A set of 9 tritangent planes to a cubic surface containing the 27 lines. envelope A curve tangent to a family of curves. See Salmon (1879, p. 65). epitrochoid An epitrochoid is the curve traced by a point of a disc rolling along another disc. Salmon (1879) equiaffine equiaffinity An equiaffinity is an equiaffine transformation, meaning an affine transformation preserving area. equianharmonic 1. Four points whose cross ratio (or anharmonic ratio) is a cube root of 1 2. An equianharmonic cubic is a cubic curve with j-invariant 0 equivalence In intersection theory, a positive-dimensional variety sometimes behaves formally as if it were a finite number of points; this number is called its equivalence. evectant A contravariant defined by Sylvester depending on an invariant. See Salmon (1879, p. 184). evolute An evolute is the envelope of the normal lines of a plane curve. See Salmon (1879, p. 40). exceptional 1. Corresponding to something of lower dimension under a birational correspondence, as in exceptional curve, exceptional divisor 2. An exceptional curve on a surface is one that corresponds to a simple point on another surface under a birational correspondence. It is called an exceptional curve of the first kind if it is transformed into a point of the other surface, and an exceptional curve of the second kind if it is transformed into a curve of the other surface. == F == facultative A facultative point is one where a given function is positive. (Salmon 1885, p.243) first kind holomorphic or regular (when applied to differentials) flat 1. (Noun) A linear subspace of projective space, such as a point, line, plane, hyperplane. 2. (Adjective) Having
|
{"page_id": 35326250, "title": "Glossary of classical algebraic geometry"}
|
Pangenomes" Speaking on Virgin Births (parthenogenesis) for FBMH's science-themed advent calendar Synopsis of Nature (2015) paper "Endosymbiotic origin and differential loss of eukaryotic genes" Radio interview for RTE's "Bright Sparks" radio series Synopsis of polar bear paper Cell (2014) paper "Population Genomics Reveal Recent Speciation and Rapid Evolutionary Adaptation in Polar Bears" == References ==
|
{"page_id": 61316914, "title": "James O. McInerney"}
|
things: • The performance measure that defines the criterion of success. • The agent’s prior knowledge of the environment. • The actions that the agent can perform. • The agent’s percept sequence to date. This leads to a definition of a rational agent :DEFINITION OF A RATIONAL AGENT > For each possible percept sequence, a rational agent should select an action that is ex-pected to maximize its performance measure, given the evidence provided by the percept sequence and whatever built-in knowledge the agent has. 38 Chapter 2. Intelligent Agents Consider the simple vacuum-cleaner agent that cleans a square if it is dirty and moves to the other square if not; this is the agent function tabulated in Figure 2.3. Is this a rational agent? That depends! First, we need to say what the performance measure is, what is known about the environment, and what sensors and actuators the agent has. Let us assume the following: • The performance measure awards one point for each clean square at each time step, over a “lifetime” of 1000 time steps. • The “geography” of the environment is known a priori (Figure 2.2) but the dirt distri-bution and the initial location of the agent are not. Clean squares stay clean and sucking cleans the current square. The Left and Right actions move the agent left and right except when this would take the agent outside the environment, in which case the agent remains where it is. • The only available actions are Left , Right , and Suck . • The agent correctly perceives its location and whether that location contains dirt. We claim that under these circumstances the agent is indeed rational; its expected perfor-mance is at least as high as any other agent’s. Exercise 2.2 asks you to prove this. One can
|
{"source": 1019, "title": "from dpo"}
|
the target attribute from rest of the data columns Y = iris.target # Take a look at the dataframe X.head() # This prints the shape of the dataframe (150 rows and 4 columns) X.shape() ``` When you check out the summary statistics for the data using `print(iris.DESCR)`, the image below is the summary you will receive. For the feature ‘sepal length’, the range is 4.3 – 7.9 centimeters. Similarly, for ‘sepal width’, the range is 2 – 4.4 centimeters. For ‘petal length’ the range is 1-6.9 centimeters and finally, for ‘petal width’ the range is 0.1 – 2.5 centimeters. !Image 1 ``` Was this AI assistant helpful? A usual step after loading the data and dividing the data into a training-testing set is to perform data cleaning, data imputing to handle missing values and to handle data outliers. However, since the focus of the article is on normalization – we will skip these preprocessing steps and jump to see normalization in action. We will now transform this data to fall under the range of 0 – 1 centimeter using min-max normalization technique. To normalize the data, we will use the `MinMaxScaler`functionality from sklearn library and apply it to our dataset; we have already imported
|
{"source": 2760, "title": "from dpo"}
|
and, therefore, cheaply (Hirschman & Chinchor, 1997). Before passing an opinion about whether annotation efforts have been sufficiently ambi - tious, readers should pore over the annotation guidelines compiled for any of the past efforts, which grow exponentially as developers try to cover the overwhelming complex - ity of real language as used by real people. As Sampson (2003) notes in his thoughtful review of the history of annotation efforts, the annotation scheme needed to cover the syn - tactic phenomena in his corpus ran to 500 pages— which he likens both in content and in length to the in de pen dently produced 300 + page guidelines for Penn Treebank II (Bies et al., 1995). Hundreds of pages for syntax alone—we can only imagine what would be needed to cover semantics and discourse as well. Since interannotator agreement and cost are among the most impor tant factors in annotation proj ects, semiautomation— that is, automatically generating annotations to be checked and corrected by people— has been pursued in earnest. Marcus et al. (1993) report an experiment revealing that semiautomating the annotation of parts of speech and light syntax in En glish doubled annotation speed, showed about twice as good interannotator agreement, and was much less error-prone than manual tagging. However, even though semiautomation can speed up and improve annotation for simpler tasks, the cost should still not be underestimated. Brants (2000) reports that although the semiautomated anno - tation of German parts of speech and syntax required approximately fifty seconds per sen - tence, with sentences averaging 17.5 tokens, the actual cost— counting annotator training and the time for two annotators to carry out the task, for their results to be compared, and for difficult issues to be resolved— added up to ten minutes per sentence. The cost of
|
{"source": 4999, "title": "from dpo"}
|
Newton’s Laws r1 5 25 m. Find the force that a seat in the roller-coaster car exerts on a 50-kg passenger at the lowest point. 39. A string under a ten-sion of 50.0 N is used to whirl a rock in a horizontal circle of radius 2.50 m at a speed of 20.4 m/s on a frictionless surface as shown in Figure P6.39. As the string is pulled in, the speed of the rock increases. When the string on the table is 1.00 m long and the speed of the rock is 51.0 m/s, the string breaks. What is the breaking strength, in newtons, of the string? 40. Disturbed by speeding cars outside his workplace, Nobel laureate Arthur Holly Compton designed aspeed bump (called the “Holly hump”) and had it in stalled. Suppose a 1 800-kg car passes over a hump in a roadway that follows the arc of a circle of radius 20.4 m as shown in Figure P6.40. (a) If the car travels at 30.0 km/h, what force does the road exert on the car as the car passes the high-est point of the hump? (b) What If? What is the maximum speed the car can have with-out losing contact with the road as it passes this highest point? 41. A car of mass m passes over a hump in a road that fol-lows the arc of a circle of radius R as shown in Figure P6.40. (a) If the car travels at a speed v, what force does the road exert on the car as the car passes the highest point of the hump? (b) What If? What is the maximum speed the car can have without losing contact with the road as it passes this highest point? 42. A child’s toy consists of a small wedge
|
{"source": 6367, "title": "from dpo"}
|
Energy Partnership Integrated Nuclear Fuel Cycle Information System Lists of nuclear disasters and radioactive incidents Nuclear fuel bank Nuclear fuel cycle Reprocessed uranium Uranium market == Notes == == References == == External links == Plutonium Fuel Fabrication by Argonne National Laboratory on YouTube === PWR fuel === "NEI fuel schematic". Archived from the original on 2004-10-22. Retrieved 2005-12-14. "Picture of a PWR fuel assembly". Archived from the original on 2015-04-23. Retrieved 2005-12-14. Picture showing handling of a PWR bundle "Mitsubishi nuclear fuel Co". Archived from the original on 2012-02-24. Retrieved 2005-12-14. === BWR fuel === "Picture of a "canned" BWR assembly". Archived from the original on 2006-08-28. Retrieved 2005-12-14. Physical description of LWR fuel Links to BWR photos from the nuclear tourist webpage === CANDU fuel === CANDU Fuel pictures and FAQ Basics on CANDU design The Evolution of CANDU Fuel Cycles and their Potential Contribution to World Peace "CANDU Fuel-Management Course" (PDF). Archived from the original (PDF) on 2006-03-15. Retrieved 2005-12-17. CANDU Fuel and Reactor Specifics (Nuclear Tourist) Candu Fuel Rods and Bundles === TRISO fuel === Alameri, Saeed A.; Alrwashdeh, Mohammad (2021). "Preliminary three-dimensional neutronic analysis of IFBA coated TRISO fuel particles in prismatic-core advanced high temperature reactor". Annals of Nuclear Energy. 163. Bibcode:2021AnNuE.16308551A. doi:10.1016/j.anucene.2021.108551. Alrwashdeh, Mohammad; Alameri, Saeed A.; Alkaabi, Ahmed K. (2020). "Preliminary Study of a Prismatic-Core Advanced High-Temperature Reactor Fuel Using Homogenization Double-Heterogeneous Method". Nuclear Science and Engineering. 194 (2): 163–167. Bibcode:2020NSE...194..163A. doi:10.1080/00295639.2019.1672511. S2CID 209983934. TRISO fuel descripción Non-Destructive Examination of SiC Nuclear Fuel Shell using X-Ray Fluorescence Microtomography Technique GT-MHR fuel compact process Archived 2006-03-06 at the Wayback Machine Description of TRISO fuel for "pebbles" LANL webpage showing various stages of TRISO fuel production Method to calculate the temperature profile in TRISO fuel Archived 2016-04-15 at the Wayback Machine === QUADRISO fuel ===
|
{"page_id": 2046416, "title": "Nuclear fuel"}
|
and Saturn to depths where the pressure is about equal to 1 bar, approximately Earth's atmospheric pressure at sea level.: 131 The Galileo probe penetrated to 22 bars. This is a small fraction of the planet, which is expected to reach pressures of over 40 Mbar. To constrain the composition in the interior, thermodynamic models are constructed using the information on temperature from infrared emission spectra and equations of state for the likely compositions.: 131 High-pressure experiments predict that hydrogen will be a metallic liquid in the interior of Jupiter and Saturn, while in Uranus and Neptune it remains in the molecular state.: 135–136 Estimates also depend on models for the formation of the planets. Condensation of the presolar nebula would result in a gaseous planet with the same composition as the Sun, but the planets could also have formed when a solid core captured nebular gas.: 136 In current models, the four giant planets have cores of rock and ice that are roughly the same size, but the proportion of hydrogen and helium decreases from about 300 Earth masses in Jupiter to 75 in Saturn and just a few in Uranus and Neptune.: 220 Thus, while the gas giants are primarily composed of hydrogen and helium, the ice giants are primarily composed of heavier elements (O, C, N, S), primarily in the form of water, methane, and ammonia. The surfaces are cold enough for molecular hydrogen to be liquid, so much of each planet is likely a hydrogen ocean overlaying one of heavier compounds. Outside the core, Jupiter has a mantle of liquid metallic hydrogen and an atmosphere of molecular hydrogen and helium. Metallic hydrogen does not mix well with helium, and in Saturn, it may form a separate layer below the metallic hydrogen.: 138 === Terrestrial planets ===
|
{"page_id": 39562, "title": "Geochemistry"}
|
and CASE. An additional benefit of a structured program is that it lends itself to proofs of correctness using mathematical induction. == Legal status == By themselves, algorithms are not usually patentable. In the United States, a claim consisting solely of simple manipulations of abstract concepts, numbers, or signals does not constitute "processes" (USPTO 2006), so algorithms are not patentable (as in Gottschalk v. Benson). However practical applications of algorithms are sometimes patentable. For example, in Diamond v. Diehr, the application of a simple feedback algorithm to aid in the curing of synthetic rubber was deemed patentable. The patenting of software is controversial, and there are criticized patents involving algorithms, especially data compression algorithms, such as Unisys's LZW patent. Additionally, some cryptographic algorithms have export restrictions (see export of cryptography). == Classification == === By implementation === Recursion A recursive algorithm invokes itself repeatedly until meeting a termination condition and is a common functional programming method. Iterative algorithms use repetitions such as loops or data structures like stacks to solve problems. Problems may be suited for one implementation or the other. The Tower of Hanoi is a puzzle commonly solved using recursive implementation. Every recursive version has an equivalent (but possibly more or less complex) iterative version, and vice versa. Serial, parallel or distributed Algorithms are usually discussed with the assumption that computers execute one instruction of an algorithm at a time on serial computers. Serial algorithms are designed for these environments, unlike parallel or distributed algorithms. Parallel algorithms take advantage of computer architectures where multiple processors can work on a problem at the same time. Distributed algorithms use multiple machines connected via a computer network. Parallel and distributed algorithms divide the problem into subproblems and collect the results back together. Resource consumption in these algorithms is not only processor
|
{"page_id": 775, "title": "Algorithm"}
|
49.4% infrared, 42.3% visible, and 8% ultraviolet. It is sometimes asserted that the Sun's maximum output is in the visible range. However, this statement is a misconception based on only seeing the solar spectral irradiance plotted on a per-wavelength basis. When plotted that way, the power spectral density of sunlight peaks at a wavelength of about 501 nm, which is in the visible range. However, the solar spectral irradiance can with equal validity be calculated on a per-frequency basis, in which case the maximum is at 3.40×1014 Hz, corresponding to a wavelength of about 882 nm, which is in the near infrared (Infrared-A) range. Counterintuitively, it is not meaningful to assert that the solar output is greatest at some precise location in the spectrum. === Published tables === Tables of direct solar radiation on various slopes from 0 to 60 degrees north latitude, in calories per square centimetre, issued in 1972 and published by Pacific Northwest Forest and Range Experiment Station, Forest Service, U.S. Department of Agriculture, Portland, Oregon, USA, appear on the web. == Intensity in the Solar System == Different bodies of the Solar System receive light of an intensity inversely proportional to the square of their distance from the Sun. A table comparing the amount of solar radiation received by each planet in the Solar System at the top of its atmosphere: The actual brightness of sunlight that would be observed at the surface also depends on the presence and composition of an atmosphere. For example, Venus's thick atmosphere reflects more than 60% of the solar light it receives. The actual illumination of the surface is about 14,000 lux, comparable to that on Earth "in the daytime with overcast clouds". Sunlight on Mars would be more or less like daylight on Earth during a slightly overcast day,
|
{"page_id": 27979, "title": "Sunlight"}
|
co-founder of KLIM investment group Michael E. Selick Jr., president of SeaAgri Solutions === Scientists === Bryce Bayer, color scientist (1929–2012) Harry Coover, polymer chemist (1917–2011) F. J. Duarte, laser physicist and author (left in 2006) Marion B. Folsom, statistician (1893–1976) Loyd A. Jones, camouflage physicist (1884–1954) Maurice Loyal Huggins, polymer scientist (1897–1981) Rudolf Kingslake, optical designer (1903–2003) David MacAdam, color scientist (1910–1998) Kenneth Mees, film scientist and founder of the research laboratories (1882–1960) Perley G. Nutting, physicist and founder of OSA (1873–1949) Steven Sasson, electrical engineer Ludwik Silberstein, physicist (1872–1948) Steven Van Slyke, OLED scientist (left in 2010) Warren J. Smith, optical engineer (1922–2008) Ching W. Tang, OLED scientist (left in 2006) John Texter, physical chemist and materials scientist (1978–1998) Arthur Widmer, Special Effects Film Pioneer and receiver of an Academy of Motion Picture Arts and Sciences Award of Commendation (1914–2006) === Photographers === Jeannette Klute, research photographer (1918–2009) == Archive donation == In 2005, Kodak Canada donated its entire historic company archives to Ryerson University in Toronto, Ontario, Canada. The Ryerson University Library also acquired an extensive collection of materials on the history of photography from the private collection of Nicholas M. and Marilyn A. Graver of Rochester, New York. The Kodak Archives, begun in 1909, contain the company's Camera Collection, historic photos, files, trade circulars, Kodak magazines, price lists, daily record books, equipment, and other ephemera. It includes the contents of the Kodak Heritage Collection Museum, a museum established in 1999 for Kodak Canada's centennial that Kodak closed in 2005 along with the company's entire "Kodak Heights" manufacturing campus in Mount Dennis, Toronto. == Controversies and lawsuits == === Early legal issues === ==== Patent infringement ==== Kodak encountered a number of challenges from rival patents for film and cameras. These began while Eastman was still developing
|
{"page_id": 57627, "title": "Kodak"}
|
Ministry for the Information and Communications Technologies (Spanish: Ministerio de Tecnologías de la Información y las Comunicaciones, abbreviated MinTIC), is the national executive ministry of the Government of Colombia responsible for overseeing the information and communication technologies, telecommunications and broadcasting industries in Colombia. == History == Former Ministry of Telecommunications, adopted its new name by decree 1341 of 2009. The current Minister is Mauricio Lizcano, appointed by Colombia's president Gustavo Petro. == List of ministers of ITC == == References ==
|
{"page_id": 28397568, "title": "Ministry of Information Technologies and Communications (Colombia)"}
|
Honeywell's JetWave is a piece of satellite communications hardware produced by Honeywell that enables global in-flight internet connectivity. Its connectivity is provided using Inmarsat’s GX Aviation network. The JetWave platform is used in business and general aviation, as well as defense and commercial airline users. == History == In 2012, Honeywell announced it would provide Inmarsat with the hardware for its GX Ka-band in-flight connectivity network. The Ka-band (pronounced either "kay-ay band" or "ka band") is a portion of the microwave part of the electromagnetic spectrum defined as frequencies in the range 27.5 to 31 gigahertz (GHz). In satellite communications, the Ka-band allows higher bandwidth communication. In 2017, after five years and more than 180 flight hours and testing, JetWave was launched as part of GX Aviation with Lufthansa Group. Honeywell’s JetWave was the exclusive terminal hardware option for the Inmarsat GX Aviation network; however, the exclusivity clause in that contract has expired. In July 2019, the United States Air Force selected Honeywell’s JetWave satcom system for 70 of its C-17 Globemaster III cargo planes. In December 2019, it was reported that six AirAsia aircraft had been fitted with Inmarsat’s GX Aviation Ka-band connectivity system and is slated to be implemented fleetwide across AirAsia’s Airbus A320 and A330 models in 2020, requiring installation of JetWave atop AirAsia’s fuselages. Today, Honeywell’s JetWave hardware is installed on over 1,000 aircraft worldwide. In August 2021, the Civil Aviation Administration of China approved a validation of Honeywell’s MCS-8420 JetWave satellite connectivity system for Airbus 320 aircraft. In December 2021, Honeywell, SES, and Hughes Network Systems demonstrated multi-orbit high-speed airborne connectivity for military customers using Honeywell’s JetWave MCX terminal with a Hughes HM-series modem, and SES satellites in both medium Earth orbit (MEO) and geostationary orbit (GEO). The tests achieved full duplex data rates of
|
{"page_id": 64359579, "title": "Honeywell JetWave"}
|
this former mentor, now on Earth posing as the abbot K'anpo Rimpoche, in Planet of the Spiders. In "The Girl in the Fireplace", according to Madame de Pompadour who psychically linked with the Doctor's memories, the Doctor experienced a very lonely childhood. An elderly woman on Gallifrey died and was shrouded in veils and surrounded by flies, giving the Doctor recurring nightmares, which the confession dial in "Heaven Sent" would later visualise to torment him. In "Listen", it is ambiguously revealed the Doctor as a child often slept alone in a barn in the Drylands (a desert region outside the city capital), was withdrawn from other children, and was cared for by guardian figures who privately doubted the child's ability as an eventual Time Lord. Through the dialogue, it is suggested that several Gallifreyan children were pressured into joining the army, a path which did not sit right with the Doctor's pacifist beliefs, and as a result he wished to enroll into the Time Lord Academy instead. The classic series refers to his time at the academy and his affiliation with the notoriously devious Prydonian chapter of Time Lords. In "The Sound of Drums", the Doctor describes an academy initiation where, at the age of eight, Gallifreyan children were taken from their families and made to look into the Untempered Schism, a gap in the fabric of reality, to view the Time Vortex. According to the Doctor, when regarding the effects of the initiation on participants: "Some would be inspired, some would run away and some would go mad (as he suggests happened to his nemesis, the Master)." When asked to which group he belonged, he replied, "Oh, the ones that ran away. I never stopped!" The Doctor was taught by future Lord President Borusa and Azmael, where he met
|
{"page_id": 959699, "title": "The Doctor"}
|
Choi, Kristy; Fromme, Rachel M.; Dao, Phuong; McKenney, Peter T.; Wasti, Ruby C.; Kadaveru, Krishna; Mazutis, Linas; Rudensky, Alexander Y.; Pe'Er, Dana (2018). "Single-Cell Map of Diverse Immune Phenotypes in the Breast Tumor Microenvironment". Cell. 174 (5): 1293–1308.e36. doi:10.1016/j.cell.2018.05.060. PMC 6348010. PMID 29961579. Nowotschin, Sonja; Setty, Manu; Kuo, Ying-Yi; Liu, Vincent; Garg, Vidur; Sharma, Roshan; Simon, Claire S.; Saiz, Nestor; Gardner, Rui; Boutet, Stéphane C.; Church, Deanna M.; Hoodless, Pamela A.; Hadjantonakis, Anna-Katerina; Pe'Er, Dana (2019). "The emergent landscape of the mouse gut endoderm at single-cell resolution". Nature. 569 (7756): 361–367. Bibcode:2019Natur.569..361N. doi:10.1038/s41586-019-1127-1. PMC 6724221. PMID 30959515. Laughney, Ashley M.; Hu, Jing; Campbell, Nathaniel R.; Bakhoum, Samuel F.; Setty, Manu; Lavallée, Vincent-Philippe; Xie, Yubin; Masilionis, Ignas; Carr, Ambrose J.; Kottapalli, Sanjay; Allaj, Viola; Mattar, Marissa; Rekhtman, Natasha; Xavier, Joao B.; Mazutis, Linas; Poirier, John T.; Rudin, Charles M.; Pe'Er, Dana; Massagué, Joan (2020). "Regenerative lineages and immune-mediated pruning in lung cancer metastasis". Nature Medicine. 26 (2): 259–269. doi:10.1038/s41591-019-0750-6. PMC 7021003. PMID 32042191. Friedman, N.; Linial, M.; Nachman, I.; Pe'er, D. (2000). "Using Bayesian Networks to Analyze Expression Data". Journal of Computational Biology. 7 (3–4): 601–620. CiteSeerX 10.1.1.191.139. doi:10.1089/106652700750050961. PMID 11108481. Segal, E.; Shapira, M.; Regev, A.; Pe'er, D.; Botstein, D.; Koller, D.; Friedman, N. (2003). "Module networks: Identifying regulatory modules and their condition-specific regulators from gene expression data". Nature Genetics. 34 (2): 166–176. doi:10.1038/ng1165. PMID 12740579. S2CID 6146032. Sachs, K.; Perez, O; Pe'Er, D; Lauffenburger, D. A.; Nolan, G. P. (2005). "Causal Protein-Signaling Networks Derived from Multiparameter Single-Cell Data". Science. 308 (5721): 523–9. Bibcode:2005Sci...308..523S. doi:10.1126/science.1105809. PMID 15845847. S2CID 8160280. Bendall, S. C.; Simonds, E. F.; Qiu, P.; Amir, E. -A. D.; Krutzik, P. O.; Finck, R.; Bruggner, R. V.; Melamed, R.; Trejo, A.; Ornatsky, O. I.; Balderas, R. S.; Plevritis, S. K.; Sachs, K.; Pe'Er, D.; Tanner, S. D.; Nolan,
|
{"page_id": 41892219, "title": "Dana Pe'er"}
|
attend simultaneously to two different targets located in opposite hemifields. Research has even suggested that humans are able to focus attention across two to four locations in the visual field. Another perspective is that spatial attention can be split only under certain conditions. This perspective suggests that the splitting of spatial attention is flexible. Research demonstrated that whether spatial attention is unitary or divided depends on the goals of the task. Therefore, if dividing attention is beneficial to the observer then a divided focus of attention will be utilised. One of the main difficulties in establishing whether spatial attention can be divided is that a unitary focus model of attention can also explain a number of the findings. For example, when two non-contiguous locations are attended to, it may not be that attention has been split between these two locations but instead it may be that the unitary focus of attention has expanded. Alternatively, the two locations may not be attended to simultaneously and instead the area of focus is moving quickly from one location to another. Consequently, it appears very difficult to prove undoubtedly that spatial attention can be split. == Deficits in visual spatial attention == === Hemineglect === Hemineglect [1], also known as unilateral visual neglect, attentional neglect, hemispatial neglect or spatial neglect, is a disorder incorporating a significant deficit in visuospatial attention. Hemineglect refers to the inability of patients with unilateral brain damage to detect objects in the side of space contralateral to the lesion (contralesional); i.e. damage to the right cerebral hemisphere resulting in neglect of objects on the left side of space, and is characterized by hemispheric asymmetry. Performance is generally preserved in the side ipsilateral to the lesion (ipsilesional). Hemineglect is more frequent and arguably more severe following damage to the right cerebral
|
{"page_id": 42980268, "title": "Visual spatial attention"}
|
. ( 2008 ) SuperTarget and Matador: resources for exploring drug-target relationships . Nucleic Acids Res. , 36 , D919 – D922 . Hall M. et al. . ( 2009 ) The WEKA data mining software: an update . SIGKDD Explor. Newsl. , 11 , 10 – 18 . He Z. et al. . ( 2010 ) Predicting drug-target interaction networks based on functional groups and biological features . PloS One , 5 , e9603 . Hu Y. Bajorath J. ( 2012 ) Extending the activity cliff concept: structural categorization of activity cliffs and systematic identification of different types of cliffs in the ChEMBL database . J. Chem. Inf. Model. , 52 , 1806 – 1811 . Huang D.W. et al. . ( 2009 ) Systematic and integrative analysis of large gene lists using DAVID bioinformatics resources . Nat. Protoc. , 4 , 44 – 57 . Iorio F. et al. . ( 2010 ) Discovery of drug mode of action and drug repositioning from transcriptional responses . Proc. Natl. Acad. Sci. USA , 107 , 14621 – 14626 . Jaccard P. ( 1908 ) Nouvelles recherches sur la distribution florale . Bul. Soc. Vaudoise Sci. Nat. , 44 , 223 – 270 . Jacob L. Vert J.P. ( 2008 ) Protein-ligand interaction prediction: an improved chemogenomics approach . Bioinformatics , 24 , 2149 – 2156 . Jaeger S. et al. . ( 2014 ) Causal network models for predicting compound targets and driving pathways in cancer . J. Biomol. Screen. , 19 , 791 – 802 . Jaroch S.E. Weinmann H. (eds) ( 2006 ) Chemical genomics: small molecule probes to study cellular function . . Kuhn M. et al. . ( 2010 ) A side effect resource to capture phenotypic effects of drugs . Mol. Syst. Biol ,
|
{"source": 1462, "title": "from dpo"}
|
θtn = 0 otherwise . (4.112) 4.3. Probabilistic Discriminative Models 211 Figure 4.13 Schematic example of a probability density p(θ) > shown by the blue curve, given in this example by a mixture of two Gaussians, along with its cumulative distribution function > f(a), shown by the red curve. Note that the value of the blue curve at any point, such as that indicated by the vertical green line, corresponds to the slope of the red curve at the same point. Conversely, the value of the red curve at this point corresponds to the area under the blue curve indicated by the shaded green region. In the stochastic threshold model, the class label takes the value t= 1 if the value of a=wTφexceeds a threshold, oth-erwise it takes the value t= 0 . This is equivalent to an activation function given by the cumulative distribution function f(a). > 0123400.2 0.4 0.6 0.8 1 If the value of θ is drawn from a probability density p(θ), then the corresponding activation function will be given by the cumulative distribution function f (a) = ∫ a > −∞ p(θ) d θ (4.113) as illustrated in Figure 4.13. As a specific example, suppose that the density p(θ) is given by a zero mean, unit variance Gaussian. The corresponding cumulative distribution function is given by Φ( a) = ∫ a > −∞ N (θ|0, 1) d θ (4.114) which is known as the probit function. It has a sigmoidal shape and is compared with the logistic sigmoid function in Figure 4.9. Note that the use of a more gen-eral Gaussian distribution does not change the model because this is equivalent to a re-scaling of the linear coefficients w. Many numerical packages provide for the evaluation of a closely related function defined by erf( a) =
|
{"source": 3852, "title": "from dpo"}
|
quality of the self-evaluated feedback. we find llms often exhibit overconfidence or high randomness when self-evaluate, offering stubborn or inconsistent feedback, which causes poor reflection. to remedy this, we advocate self-contrast: it adaptively explores diverse solving perspectives tailored to the request, contrasts the differences, and summarizes these discrepancies into a checklist which could be used to re-examine and eliminate discrepancies. our method endows llm with diverse perspectives to alleviate stubborn biases. moreover, their discrepancies indicate potential errors or inherent uncertainties that llm often overlooks. reflecting upon these can catalyze more accurate and stable reflection. experiments conducted on a series of reasoning and translation tasks with different llms serve to underscore the effectiveness and generality of our strategy. Expand Abstract U-Trustworthy models.reliability, Competence, and Confidence in Decision-Making Ritwik Vashistha, Arya Farahi Abstract: with growing concerns regarding bias and discrimination in predictive models, the ai community has increasingly focused on assessing ai system trustworthiness. conventionally, trustworthy ai literature relies on the probabilistic framework and calibration as prerequisites for trustworthiness. in this work, we depart from this viewpoint by proposing a novel trust framework inspired by the philosophy literature on trust. we present a precise mathematical definition of trustworthiness, termed \mathcal{u}-trustworthiness, specifically tailored for a subset of tasks aimed at maximizing a utility function. we argue that a model's \mathcal{u}-trustworthiness is contingent upon its ability to maximize bayes utility within this task subset. our first set of results challenges the probabilistic framework by demonstrating its potential to favor less trustworthy models and introduce the risk of misleading trustworthiness assessments. within the context of \mathcal{u}-trustworthiness, we prove that properly-ranked models are inherently \mathcal{u}-trustworthy. furthermore, we advocate for the adoption of the auc metric as the preferred measure of trustworthiness. by offering both theoretical guarantees and experimental validation, auc enables robust evaluation of trustworthiness, thereby
|
{"source": 5788, "title": "from dpo"}
|
clear that ‖follower (x)‖ = O(‖F‖2). 4.3 The distributed machine’s execution Next, we write a collection of formulas describing the network of the leader and its followers, and, combining these formulas with the ones in the previous two subsections, we form Spec (M). # 123 Formal Methods in System Design (2021) 58:440–468 453 The following two formulas enforce the intended semantics for the predicates past μ ( μ ∈ T L > in ) and past μ (·) ( μ ∈ T F > in ). Recall from the beginning of this section that past μ ( μ ∈ T L > in ) is to be read as “a message μ has in the past been broadcast by the leader” and past μ (x) ( μ ∈ T F > in ) as “follower x has in the past sent a message μ to the leader”. Thus, past μ must be false until (and when) the leader takes transition tl μ (if it ever does) and true thereafter; and likewise for past μ (x) and tf μ (x). Let pastm (short for past messages ) be the logical conjunction of the following two formulas: ∧ > μ∈TL > out ((¬past μ ∧ ¬ past μ W tl μ ) ∧ [(( ¬past μ ∧ ¬ tl μ ∧ tl μ ) → ¬past μ ) ∧ (tl μ → past μ )]), ∀x ∧ > μ∈TF > out ((¬past μ (x) ∧ ¬ past μ (x) W tf μ (x)) ∧ [(( ¬past μ (x) ∧ ¬ tf μ (x) ∧ tf μ (x)) → ¬past μ (x)) ∧ (tf μ (x) → past μ (x)) ]). The following two formulas specify the conditions for message delivery when the leader broadcasts a message to the followers ( bcastla ,
|
{"source": 7332, "title": "from dpo"}
|
as a voltage generated at the electrodes. A typical industrial electrodialysis stack consists of two chambers: a product-water chamber and a concentrate-reject chamber. During stack operation, salts are transferred from the product to the concentrate. As a result, the reject stream is concentrated up while the product stream is desalted. Exemplary applications of ion-exchange membranes utilized in electrodialysis and EDR include seawater desalination, industrial wastewater treatment of highly scaling waters, food and beverage production, and other industrial wastewaters. == References == == See also == Proton-exchange membrane
|
{"page_id": 46750217, "title": "Ion-exchange membrane"}
|
An electrolyte is a substance that conducts electricity through the movement of ions, but not through the movement of electrons. This includes most soluble salts, acids, and bases, dissolved in a polar solvent like water. Upon dissolving, the substance separates into cations and anions, which disperse uniformly throughout the solvent. Solid-state electrolytes also exist. In medicine and sometimes in chemistry, the term electrolyte refers to the substance that is dissolved. Electrically, such a solution is neutral. If an electric potential is applied to such a solution, the cations of the solution are drawn to the electrode that has an abundance of electrons, while the anions are drawn to the electrode that has a deficit of electrons. The movement of anions and cations in opposite directions within the solution amounts to a current. Some gases, such as hydrogen chloride (HCl), under conditions of high temperature or low pressure can also function as electrolytes. Electrolyte solutions can also result from the dissolution of some biological (e.g., DNA, polypeptides) or synthetic polymers (e.g., polystyrene sulfonate), termed "polyelectrolytes", which contain charged functional groups. A substance that dissociates into ions in solution or in the melt acquires the capacity to conduct electricity. Sodium, potassium, chloride, calcium, magnesium, and phosphate in a liquid phase are examples of electrolytes. In medicine, electrolyte replacement is needed when a person has prolonged vomiting or diarrhea, and as a response to sweating due to strenuous athletic activity. Commercial electrolyte solutions are available, particularly for sick children (such as oral rehydration solution, Suero Oral, or Pedialyte) and athletes (sports drinks). Electrolyte monitoring is important in the treatment of anorexia and bulimia. In science, electrolytes are one of the main components of electrochemical cells. In clinical medicine, mentions of electrolytes usually refer metonymically to the ions, and (especially) to their concentrations (in
|
{"page_id": 48336, "title": "Electrolyte"}
|
annealing involves homologous/repeated sequences flanking a DSB. The process starts with the key end resection factor CtlP, which mediates the end resection of DSBs, resulting in the formation of a 3' ssDNA extension. Meditated by RAD52, the flanking homologous sequences are annealed, and forms a synapse intermediate. Then, the nonhomologous 3’ extension is removed by the ERCC1-XPF complex through endonucleolytic cleavage, with RAD52 increasing the efficiency of the ERCC1-XPF complex activity. It is only after the removal of 3’ ssDNA, where the polymerase will fill the missing gaps and the ligase to ligate the strands. Since SSA results in the deletion of repetitive sequences, this could potentially lead to error-prone repair. Single-strand annealing differs from SDSA and DSBR in numerous ways. For instance, the 3’ extension after the end resection in SSA anneals to the repeated/homologous sequences of the other end, whereas in other pathways the strand invasion to another homologous DNA template. Moreover, SSA does not require RAD51, because it does not involve strand invasion, but rather the annealing of homologous sequences. === Non-homologous end joining === Non-homologous end joining (NHEJ) is one of the major pathways in DSB repair besides HR. The basic concept of NHEJ involves three steps. First, the ends of a DSB is captured by a group of enzymes. The enzymes then form a bridge which connects the DSB ends together, and is lastly followed by religation of the DNA strands. To initiate whole process, the Ku70/80 protein complex binds to the damaged ends of the DSB strands. This forms a preliminary scaffold which allows the recruitment of various NHEJ factors, such as the DNA-dependent protein kinase catalytic subunit (DNA-PKcs), DNA Ligase IV and X-ray cross complementing protein 4 (XRCC4) to form a bridge and bring both ends of the damaged DNA strands together. This
|
{"page_id": 67265858, "title": "Double-strand break repair model"}
|
can also be captured. The tracking functionality in CPV modules is used to orient the optics such that the incoming light is focused to a photovoltaic collector. CPV modules that concentrate in one dimension must be tracked normal to the Sun in one axis. CPV modules that concentrate in two dimensions must be tracked normal to the Sun in two axes. Accuracy requirements The physics behind CPV optics requires that tracking accuracy increases as the system's concentration ratio increases. However, for a given concentration, nonimaging optics provide the widest possible acceptance angles, which may be used to reduce tracking accuracy. In typical high-concentration systems, tracking accuracy must be in the ± 0.1° range to deliver approximately 90% of the rated power output. In low concentration systems, tracking accuracy must be in the ± 2.0° range to deliver 90% of the rated power output. As a result, high-accuracy tracking systems are typical. Technologies supported Concentrated photovoltaic trackers are used with refractive and reflective concentrator systems. There are a range of emerging photovoltaic cell technologies used in these systems. These range from conventional, crystalline-silicon-based photovoltaic receivers to germanium-based triple junction receivers. == Single-axis trackers == Single-axis trackers have one degree of freedom that acts as an axis of rotation. The axis of rotation of single-axis trackers is typically aligned along a true North meridian. It is possible to align them in any cardinal direction with advanced tracking algorithms. There are several common implementations of single-axis trackers. These include horizontal single-axis trackers (HSAT), horizontal single-axis tracker with tilted modules (HTSAT), vertical single-axis trackers (VSAT), tilted single-axis trackers (TSAT), and polar-aligned single-axis trackers (PSAT). The orientation of the module with respect to the tracker axis is important when modeling performance. === Horizontal === Horizontal single axis tracker (HSAT) The axis of rotation for a
|
{"page_id": 4232526, "title": "Solar tracker"}
|
sampling method, as it provides the opportunity to analyze DNA from eDNA or by sampling living organisms. For fish parasites, metabarcoding allows for detection of cryptic or microscopic parasites from aquatic environments, which is difficult with more direct methods (e.g. identifying species from samples with microscopy). Some parasites exhibit cryptic variation and metabarcoding can be helpful method in revealing this. The application of eDNA metabarcoding is cost-effective in large surveys or when many samples are required. eDNA can reduce the costs of fishing, transport of samples and time invested by taxonomists, and in most cases requires only small amounts of DNA from target species to reach reliable detection. Constantly decreasing prices for barcoding/metabarcoding due to technical development is another advantage. The eDNA approach is also suitable for monitoring of inaccessible environments. == Challenges == The results obtained from metabarcoding are limited or biased to the frequency of occurrence. It is also problematic that far from all species have barcodes attached to them. Even though metabarcoding may overcome some practical limitations of conventional sampling methods, there is still no consensus regarding experimental design and the bioinformatic criteria for application of eDNA metabarcoding. The lack of criteria is due to the heterogeneity of experiments and studies conducted so far, which dealt with different fish diversities and abundances, types of aquatic ecosystems, numbers of markers and marker specificities. Another significant challenge for the method is how to quantify fish abundance from molecular data. Although there are some cases in which quantification has been possible there appears to be no consensus on how, or to what extent, molecular data can meet this aim for fish monitoring. == See also == DNA barcoding DNA barcoding in diet assessment Algae DNA barcoding Microbial DNA barcoding Aquatic macroinvertebrate DNA barcoding == References ==
|
{"page_id": 60361757, "title": "Fish DNA barcoding"}
|
Permutation Patterns is an annual international academic conference focusing on permutation patterns and their applications in combinatorics, computer science, and other areas of mathematics. == History == The conference was founded by Michael H. Albert and Mike Atkinson and was first held at the University of Otago in Dunedin, New Zealand in 2003. Since then, it has been held annually at various locations around the world. The conference typically features plenary talks, contributed talks, and poster sessions. The proceedings of the meetings in the series have been published as special issues in journals including Advances in Applied Mathematics, Annals of Combinatorics, Discrete Mathematics & Theoretical Computer Science (DMTCS), Enumerative Combinatorics and Applications, and Pure Mathematics and Applications. == List of meetings == == Related meetings == In addition to the main conference series, several related meetings have been organized: === AMS special sessions === Special Sessions on Patterns in Permutations have been held at the following American Mathematical Society meetings: Spring Eastern Sectional Meeting, March 7–8, 2015, Georgetown University, Washington, DC, USA Central Fall Sectional Meeting, September 20–21, 2014, University of Wisconsin-Eau Claire, Eau Claire, Wisconsin, USA Joint Mathematics Meetings, January 12, 2013, San Diego, California, USA Fall Eastern Sectional Meeting, September 22–23, 2012, Rochester Institute of Technology, Rochester, New York, USA === Other meetings === Pattern Avoidance, Statistical Mechanics and Computational Complexity, March 19–24, 2023, Schloss Dagstuhl, Wadern, Germany Genomics, Pattern Avoidance, and Statistical Mechanics, November 4–9, 2018, Schloss Dagstuhl, Wadern, Germany Pattern Avoidance and Genome Sorting, February 14–19, 2016, Schloss Dagstuhl, Wadern, Germany Workshop on Permutation Patterns, May 29–June 3, 2005, University of Haifa, Haifa, Israel == References == == External links == Official website
|
{"page_id": 80059893, "title": "Permutation Patterns (conference)"}
|
2015, Bell Mobile TV usage is counted as part of subscribers' overall mobile data usage. As compensation, subscribers will also receive 5 hours of Mobile TV access over Wi-Fi. == Channels == Bell divides its Mobile TV channels into several themes. Although each previously incurred separate charges, Bell's current rates include access to all channels without having to choose specific themes: HBO: Curb Your Enthusiasm, Entourage, Sex and the City and True Blood Sports: TSN, TSN2, RDS, RDS2, NFL, NFL Network, NFL RedZone, Vancouver Whitecaps FC and CBN English entertainment: CBC, CTV, CTV 2, Stingray Juicebox, MTV, Treehouse TV, YTV, bpm:tv, B4U Music, CTV Comedy Channel, A.Side TV and Makeful French entertainment: Radio-Canada, TVA and V News: BNN, CBC News Network, CTV News Channel, CP24 (Ontario only), CNN, NDTV 24x7 Channels and programming in italics are On Demand. These channels are also available Live, with the exception of Aux, Bite, Comedy, and all HBO offerings. == Criticism == In 2011, the CRTC ruled in a complaint by Telus that Bell could not use the Mobile TV service to tie exclusive mobile rights to television content (specifically, NHL and NFL games) to its own services without offering them to competing providers. In December 2013, the CRTC received a complaint alleging that Bell's original pricing structure for Mobile TV was a violation of the undue preference rules in the Telecommunications Act; as the service charged by hours viewed, counting separately from overall mobile data use, it was considered to be an effective subsidy on Bell-owned content transmitted over the mobile network that does not apply to any other competing video services. On January 29, 2015, the CRTC ruled that Bell had violated the undue preference rules with its mobile TV offerings, and ordered the company to change its pricing structure by April
|
{"page_id": 33439867, "title": "Bell Mobile TV"}
|
contributes to the synthesis of key neuroactive compounds, including serotonin, dopamine, and gamma-amino butyric acid (GABA), which are essential for mood regulation. Approximately 90% of the body’s serotonin is produced in the gut by enterochromaffin cell, with microbial metabolites influencing its availability and signaling. Dysbiosis, or microbial imbalance, has been linked to altered serotonin production, which may contribute to depressive symptoms. Gut microbiota significantly influence the Hypothalamic–pituitary–adrenal axis (HPA), the body’s central stress response system, with dysbiosis leading to HPA hyperactivation and increased cortisol levels, a common feature in major depressive disorder (MDD). Additionally, an imbalance in gut bacteria can trigger chronic low-grade inflammation through the release of lipopolysaccharide (LPS) from Gram-negative bacteria, stimulating an immune response that elevates pro-inflammatory cytokines such as Interleukin 6 (IL-6) and tumor necrosis factor-alpha (TNF-a). These inflammatory mediators can disrupt neurotransmitter function and impair neuroplasticity, contributing to depressive symptoms. Emerging research highlights the therapeutic potential of probiotics and microbiota-targeted interventions, with strains like Lactobacillus and Bifidobacterium shown to reduce inflammation, restore neurotransmitter balance, and improve mood-related behaviors in both animal models and human trials. Given these findings, microbiota-based therapies are being explored as adjunctive treatments for depression. Further evidence suggests that changes in the composition of gut bacteria can also increase intestinal permeability and stimulate immune system activity, contributing to the persistence of depressive symptoms. Therapeutic approaches aimed at modulating the gut microbiota, including the use of probiotics, specific diets, and fecal transplants, are being actively investigated for their potential to reduce inflammation and improve emotional regulation. === Schizophrenia === Different neurotrophins play a role in schizophrenia. One of the main ones is called Brain-Derived Neurotrophic Factor (BDNF). BDNF has been associated with schizophrenia and is believed to be a part of the molecular mechanism that has to do with cognitive dysfunction during neurodevelopmental
|
{"page_id": 41080840, "title": "Gut–brain axis"}
|
Cherry AG (formerly Cherry Corporation and stylized as CHERRY) is a German computer peripheral-device maker. The company has its roots in the United States and is headquartered in Germany. It has additional offices in the United States, France, and China. They manufactured a large range of products including sensors, vibrators and automotive modules until 2008, when Peter Cherry, the son of Walter L. Cherry, sold his company to ZF Friedrichshafen AG, a German supplier to the automotive industry. Cherry was renamed ZF Electronics GmbH, while the Cherry brand was continued only for its computer input devices. Since the beginning of 2016 this product line has been operating independently on the market as the Cherry Group. == History == Cherry was founded by Walter Lorain Cherry in 1953 in the basement of a restaurant in Highland Park, Illinois, USA. With the passing of its founder, his son Peter took over the ownership of the organization. Among the 37 victims of a 1971 US Army CH-47 helicopter crash in Germany was Pfc. Samuel Mansfield Cherry, one of the three sons of the founder. In 1979, the company's headquarters were moved to Auerbach in der Oberpfalz, West Germany, which is located between the crash site at Pegnitz and Grafenwöhr Training Area. Cherry has manufactured keyboards since 1973, and claims to be the oldest keyboard manufacturer still in business. In 2008, Cherry was bought by ZF Friedrichshafen AG and incorporated as the ZF Electronics GmbH Corporate Division. After an eight-year partnership with ZF Friedrichshafen AG, Cherry (the computer input device manufacturer) was sold to GENUI Partners in October 2016. In October 2020, Cherry was acquired by the private equity firm Argand Partners and as of June 2021 is now listed on the Frankfurt Stock Exchange as C3RY. The Cherry brand continues to be used.
|
{"page_id": 2583913, "title": "Cherry AG"}
|
greatly in their organization, making a detailed and workable division of Federal agency jurisdiction by individual State, county, or municipal entity unrealistic. This regulation applies the delegation concept to the investigation of complaints of discrimination on the basis of disability by public entities under the ADA. It designates eight agencies, rather than all agencies currently administering programs of Federal financial assistance, as responsible for investigating complaints under this part. These "designated agencies" generally have the largest civil rights compliance staffs, the most experience in complaint investigations and disability issues, and broad yet clear subject area responsibilities. This division of responsibilities is made functionally rather than by public entity type or name designation. For example, all entities (regardless of their title) that exercise responsibilities, regulate, or administer services or programs relating to lands and natural resources fall within the jurisdiction of the Department of Interior. Complaints under this part will be investigated by the designated agency most closely related to the functions exercised by the governmental component against which the complaint is lodged. For example, a complaint against a State medical board, where such a board is a recognizable entity, will be investigated by the Department of Health and Human Services (the designated agency for regulatory activities relating to the provision of health care), even if the board is part of a general umbrella department of planning and regulation (for which the Department of Justice is the designated agency). If two or more agencies have apparent responsibility over a complaint, section 35.190(c) provides that the Assistant Attorney General shall determine which one of the agencies shall be the designated agency for purposes of that complaint. Thirteen commenters, including four proposed designated agencies, addressed the Department of Justice’s identification in the proposed regulation of nine "designated agencies" to investigate complaints under this
|
{"source": 54, "title": "from dpo"}
|
rates are all under 1% except for one benchmark (XALANCBMK), which has a 2.9% miss rate. Because a 64-byte block typically contains 16 –20 instructions, the effective miss rate per instruction is much lower, depending on the degree of spatial locality in the instruction stream. The frequency at which the instruction fetch unit is stalled waiting for the I-cache misses is similarly small (as a percentage of total cycles) increasing to 2% for two benchmarks and 12% for XALANCBMK, which has the highest I-cache miss rate. In the next chapter, we will see how stalls in the IFU contribute to overall reductions in pipeline throughput in the i7. The L1 data cache is more interesting and even trickier to evaluate because in addition to the effects of prefetching and speculation, the L1 data cache is not write-allocated, and writes to cache blocks that are not present are not treated as misses. For this reason, we focus only on memory reads. The performance monitor measurements in the i7 separate out prefetch accesses from demand accesses, but only keep demand accesses for those instructions that graduate. The effect of spec-ulative instructions that do not graduate is not negligible, although pipeline effects probably dominate secondary cache effects caused by speculation; we will return to the issue in the next chapter. 138 ■ Chapter Two Memory Hierarchy Design To address these issues, while keeping the amount of data reasonable, Figure 2.26 shows the L1 data cache misses in two ways: 1. The L1 miss rate relative to demand references given by the L1 miss rate includ-ing prefetches and speculative loads/L1 demand read references for those instructions that graduate. > ASTAR BZIP2 GCC HMMER LIBQUANTUM MCF OMNETPP PERLBENCH SJENG XALANCBMK H264REF GOBMK 0% L1 miss rate prefetches and demand reads L1 miss rate demand reads
|
{"source": 2300, "title": "from dpo"}
|
to appease the religipus inclinations of the Hellenists by the Syrian government so as to bring the revolt to an end. -106- Document No. 3 provides us with an indication of the concessions offered, namely that permission would be granted to anybody taking advantage of this token of appeasement to enjoy ·their own choice of foods and to live under their own laws. Yet it is also noteworthy that a fundamental cause of dissension, indeed the very explosive issue which triggered off the whole revolt, the conduct of Temple affairs, is significantly omitted from the concession. For to the followers of the Zadokite dynasty, primarily those of Hellenistic tendencies, such a provision would amount to a sine qua non in any peace negotiations. Indeed subsequent events indicate that the Hassidim were, at this stage of the revolt, prepared to forego the principle of succession of the Zadokite dynasty in Temple organisation. The refusal of the Syrian government to acquiesce on this cardinal issue, perhaps on account of the influence of Menelaus, is a plausible reason for the failure of these negotiations to win over the Maccabean Hellenists. This contention is supported by the contents of Document No. 2 (30) written after the compilation of the earlier document (162 BCE), where official recognition is given to the Maccabean claim, and the restoration of the Temple is tacitly referred to. The question as to the purpose of such a concession after the Temple had been occupied and cleansed by J.udah is not difficult to answer, for by issuing this decree, the Syrian government accepted de jure, that·which had been established de facto, and the execution of Menelaus by Lysias (31) supports our theory that the recognition of the transfer of the Temple to the Jewish authorities was opposed by Nenelaus, as suggested
|
{"source": 4218, "title": "from dpo"}
|
theme, 147 Marburg presentation theme, 142 math text color, 173 math text displayed color, 173 math text inlined color, 173 middle separation line foot color, 175 middle separation line head color, 175 mini frame template/color/font, 64 mini frame in current subsection template, 64 mini frame in other subsection template, 64 mini frames parent template, 64 miniframes outer theme, 152 \mode , 194, 195 Montpellier presentation theme, 140 \movie , 125 msc package, 15 \multiinclude , 129 multimedia package, 125 musixtex package, 15 \MyLogo , 213 navigation symbols template/color/font, 67 \newcommand , 80 \newenvironment , 81 \newtheorem , 113 noamsthm class option, 113 \nonboxedsteps , 215 normal text color/font, 174 normal text in math text color, 173 \note , 185 note page template/color/font, 186 notes environment, 208 notheorems class option, 113 \only , 75 onlyenv environment, 78 \onlyInPDF , 208 \onlyInPS , 208 \OnlySlide , 207 \onlySlide , 207 \onslide , 75 \opaqueness , 176 orchid color theme, 168 Outer themes default , 151 221 infolines , 152 miniframes , 152 shadow , 155 sidebar , 153 smoothbars , 153 smoothtree , 156 split , 154 tree , 155 \overlay , 210 overlayarea environment, 79 \overlays , 206 overprint environment, 79 Packages 〈professional font package 〉, 16 AlDraTex , 13 alltt , 13 amsthm , 14 babel , 14 beamerarticle , 190 beamerfoils , 212 beamerprosper , 205 beamerseminar , 209 beamertexpower , 214 CJK , 14 color , 14 colortbl , 14 deluxetable , 14 DraTex , 14 enumerate , 14 fontenc , 14 fourier , 15 HA-prosper , 15 hyperref , 15 inputenc , 15 listings , 15 msc , 15 multimedia , 125 musixtex , 15 pdfpages , 15 pstricks , 16 texpower , 16 textpos , 16 ucs , 16 xcolor , 16 xmpmulti , 129 page
|
{"source": 6120, "title": "from dpo"}
|
radius (calculated), van der Waals radius, covalent radius Electrical resistivities of the elements (data page) – electrical resistivity Thermal conductivities of the elements (data page) – thermal conductivity Thermal expansion coefficients of the elements (data page) – thermal expansion Speeds of sound of the elements (data page) – speed of sound Elastic properties of the elements (data page) – Young's modulus, Poisson ratio, bulk modulus, shear modulus Hardnesses of the elements (data page) – Mohs hardness, Vickers hardness, Brinell hardness Abundances of the elements (data page) – Earth's crust, sea water, Sun and solar system List of oxidation states of the elements – oxidation states List of compounds List of CAS numbers by chemical compound List of Extremely Hazardous Substances List of inorganic compounds List of organic compounds List of alkanes List of alloys Other List of thermal conductivities List of purification methods in chemistry List of unsolved problems in chemistry == See also == Outline of biochemistry Outline of physics == References == == External links == International Union of Pure and Applied Chemistry Archived 2007-10-31 at the Wayback Machine IUPAC Nomenclature Home Page, see especially the "Gold Book" containing definitions of standard chemical terms Interactive Mind Map of Chemistry / Chemical energetics
|
{"page_id": 6896, "title": "Outline of chemistry"}
|
The symmetry number or symmetry order of an object is the number of different but indistinguishable (or equivalent) arrangements (or views) of the object, that is, it is the order of its symmetry group. The object can be a molecule, crystal lattice, lattice, tiling, or in general any kind of mathematical object that admits symmetries. In statistical thermodynamics, the symmetry number corrects for any overcounting of equivalent molecular conformations in the partition function. In this sense, the symmetry number depends upon how the partition function is formulated. For example, if one writes the partition function of ethane so that the integral includes full rotation of a methyl, then the 3-fold rotational symmetry of the methyl group contributes a factor of 3 to the symmetry number; but if one writes the partition function so that the integral includes only one rotational energy well of the methyl, then the methyl rotation does not contribute to the symmetry number. == See also == Group theory, a branch of mathematics which discusses symmetry, symmetry groups, symmetry spaces, symmetry operations Point groups in three dimensions Space group in 3 dimensions Molecular symmetry List of the 230 crystallographic 3D space groups Fixed points of isometry groups in Euclidean space Symmetric group, mathematics Symmetry group, mathematics == References ==
|
{"page_id": 23230613, "title": "Symmetry number"}
|
An equivalent dumping coefficient is a mathematical coefficient used in the calculation of the energy dispersed when a structure moves. As a civil engineering term, it defines the percent of a cycle of oscillation that is absorbed (converted to heat by friction) for the structure or sub-structure under analysis. Usually it is assumed that the equivalent dumping coefficient is linear, which is to say invariant compare to oscillatory amplitude. Modern seismic studies have shown this not to be a satisfactory assumption for larger civic structures, and have developed sophisticated amplitude and frequency based functions for equivalent dumping coefficient. When a building moves, the materials it is made from absorb a fraction of the kinetic energy (this is especially true of concrete) due primarily to friction and to viscous or elastomeric resistance which convert motion or kinetic energy to heat. == References ==
|
{"page_id": 9363637, "title": "Equivalent dumping coefficient"}
|
Temple syndrome is a rare genetic disorder that is caused by mutations in paternal chromosome 14 or by maternal UPD(14). The signs of this syndrome are oligohydramnios, intrauterine growth restriction, small placenta, low birth weight and length, hypotonia, motor and speech delay, joint laxity, clinodactyly, kyphoscoliosis, precocious puberty, obesity and the facial signs are: trigonocephaly, depressed nasal bridge, broad nose, small jaw, high-arched palate. == Symptoms == The symptoms of this syndrome are: Very frequent Hypotonia Motor delay Precocious puberty Small hand Short foot Intrauterine Growth Restriction Frequent Delayed speech Feeding difficulties Mild intellectual disability Obesity Premature birth Short stature Occasional Undescended testis Polyphagia Scoliosis Type II diabetes Very rare Bifid uvula Clinodactyly Frontal bossing Hydrocephalus Pointed chin Recurrent hypoglycaemia == Cause == There are three main mechanisms that can cause Temple syndrome: Maternal unipaternal disomy of chromosome 14 (in 60-75% cases): That phenomenon can be caused by trisomy rescue. Maternal UPD arises from nondisjunction in oocyte and causes trisomy when it gets fertilised, there will be 3 chromosomes(trisomy) which is fatal most of the times, so one of the chromosome gets lost and it can get two results: biparental contribution of chromosome or maternal heterodisomy. Last one can cause Temple Syndrome. Epimutaion (in 10-20% cases): Epimutation is a phenomenon when DNA gets mutated although it doesn’t change coding sequence. The genes on Paternal Chromosome 14 gets hypomethylated and subsequently causes silencing of those genes. Deletion of the 14q32.2 region (in 5-15% cases): Cases when 14q32.2 region gets deleted is the rarest. In that case part of Paternal chromosome 14 gets deleted. The genes which mutations are responsible for causing this syndrome are DLK1 and RTL1. DIO3 mutation is also associated with Temple syndrome. == Diagnosis == Temple syndrome can be suspected by combination of symptoms and diagnosis confirmed through
|
{"page_id": 78924696, "title": "Temple syndrome"}
|
fabricated by optical patterning of a photoresist-coated metal substrate through a photomask. If homogeneous patterns on large areas are required, interference lithography is a very attractive patterning technique. Other patterning techniques (including even double patterning) may also be used. Kumar and Schroers at Yale developed the nanopatterning of amorphous metals which can be used as inexpensive templates for nanoimprinting. Currently, state-of-the-art nanoimprint lithography can be used for patterns down to 20 nm and below. === Template wear === The use of substantial pressure to not only contact but also penetrate a layer during imprinting accelerates the wear of imprint templates compared to other types of lithographic masks. Template wear is reduced with proper use of an anti-adhesion FDTS monolayer coating on a stamp. A very efficient and precise AFM based method for characterizing the degradation of PDMS stamps enables to optimize materials and processes in order to minimize wear. === Other === Future applications of nanoimprint lithography may involve the use of porous low-κ materials. These materials are not stiff and, as part of the substrate, are readily damaged mechanically by the pressure of the imprint process. == Removal of residual layers == A key characteristic of nanoimprint lithography (except for electrochemical nanoimprinting) is the residual layer following the imprint process. It is preferable to have thick enough residual layers to support alignment and throughput and low defects. However, this renders the nanoimprint lithography step less critical for critical dimension (CD) control than the etch step used to remove the residual layer. Hence, it is important to consider the residual layer removal an integrated part of the overall nanoimprint patterning process. In a sense, the residual layer etch is similar to the develop process in conventional lithography. It has been proposed to combine photolithography and nanoimprint lithography techniques in one
|
{"page_id": 2669179, "title": "Nanoimprint lithography"}
|
Aldaz. Specifically, let the nonnegative numbers x1, x2, . . . , xn and the nonnegative weights w1, w2, . . . , wn be given. Assume further that the sum of the weights is 1. Then ∑ i = 1 n w i x i ≥ ∏ i = 1 n x i w i + ∑ i = 1 n w i ( x i 1 2 − ∑ i = 1 n w i x i 1 2 ) 2 {\displaystyle \sum _{i=1}^{n}w_{i}x_{i}\geq \prod _{i=1}^{n}x_{i}^{w_{i}}+\sum _{i=1}^{n}w_{i}\left(x_{i}^{\frac {1}{2}}-\sum _{i=1}^{n}w_{i}x_{i}^{\frac {1}{2}}\right)^{2}} . ==== Proof using Jensen's inequality ==== Using the finite form of Jensen's inequality for the natural logarithm, we can prove the inequality between the weighted arithmetic mean and the weighted geometric mean stated above. Since an xk with weight wk = 0 has no influence on the inequality, we may assume in the following that all weights are positive. If all xk are equal, then equality holds. Therefore, it remains to prove strict inequality if they are not all equal, which we will assume in the following, too. If at least one xk is zero (but not all), then the weighted geometric mean is zero, while the weighted arithmetic mean is positive, hence strict inequality holds. Therefore, we may assume also that all xk are positive. Since the natural logarithm is strictly concave, the finite form of Jensen's inequality and the functional equations of the natural logarithm imply ln ( w 1 x 1 + ⋯ + w n x n w ) > w 1 w ln x 1 + ⋯ + w n w ln x n = ln x 1 w 1 x 2 w 2 ⋯ x n w n w . {\displaystyle {\begin{aligned}\ln {\Bigl (}{\frac {w_{1}x_{1}+\cdots +w_{n}x_{n}}{w}}{\Bigr )}&>{\frac
|
{"page_id": 605011, "title": "AM–GM inequality"}
|
Researcher award from the Generalitat of Catalonia. He was invited to give the prestigious Gumbel Lecture at the Annual Meeting of the German Statistical Society in Cologne in 2008. == Selected publications == Books Politis, Dimitris N.; Romano, Joseph P.; Wolf, Michael (1999). Subsampling. Springer Series on Statistics. ISBN 978-0-387-98854-2. Articles on Shrinkage Estimation of Covariance Matrices Ledoit, Olivier; Wolf, Michael (December 2003). "Improved estimation of the covariance matrix of stock returns with an application to portfolio selection" (PDF). Journal of Empirical Finance. 10 (5): 603–621. doi:10.1016/S0927-5398(03)00007-0. hdl:10016/10089. S2CID 14422126. Archived from the original (PDF) on 2014-12-05. Ledoit, Olivier; Wolf, Michael (February 2004). "A well-conditioned estimator for large-dimensional covariance matrices" (PDF). Journal of Multivariate Analysis. 88 (2): 365–411. doi:10.1016/S0047-259X(03)00096-4. hdl:10016/10087. Archived from the original (PDF) on 2014-12-05. Ledoit, Olivier; Wolf, Michael (Summer 2004). "Honey, I shrunk the sample covariance matrix" (PDF). The Journal of Portfolio Management. 30 (4): 110–119. doi:10.3905/jpm.2004.110. hdl:10230/560. S2CID 219237399. Archived from the original (PDF) on 2015-01-21. Retrieved 2015-01-21. Articles on Subsampling Romano, Joseph P.; Wolf, Michael (September 2001). "Subsampling intervals in autoregressive models with linear time trend" (PDF). Econometrica. 69 (5): 1283–1314. doi:10.1111/1468-0262.00242. hdl:10016/6400. Archived from the original (PDF) on 2015-09-23. Retrieved 2015-01-21. Gonzalo, Jesús; Wolf, Michael (August 2005). "Subsampling inference in threshold autoregressive models" (PDF). Journal of Econometrics. 127 (2): 201–224. doi:10.1016/j.jeconom.2004.08.004. hdl:10016/3218. Archived from the original (PDF) on 2015-01-21. Retrieved 2015-01-21. Articles on Multiple Testing Romano, Joseph P.; Wolf, Michael (March 2005). "Exact and approximate stepdown methods for multiple hypothesis testing" (PDF). Journal of the American Statistical Association. 100 (469): 94–108. doi:10.1198/016214504000000539. hdl:10230/576. S2CID 219594470. Archived from the original (PDF) on 2015-01-21. Retrieved 2015-01-21. Romano, Joseph P.; Wolf, Michael (July 2005). "Stepwise multiple testing as formalized data snooping" (PDF). Econometrica. 73 (4): 1237–1282. CiteSeerX 10.1.1.198.2473. doi:10.1111/j.1468-0262.2005.00615.x. hdl:10230/1216. Archived from the original (PDF) on 2015-01-21.
|
{"page_id": 45147577, "title": "Michael Wolf (statistician)"}
|
later development at IBM and elsewhere, DIAG instructions were used to create a non-virtualized interface, to what became called a hypervisor. Client operating systems could use this mechanism to communicate directly with the control program; this offered dramatic performance improvements. Any S/360 operating system could in fact be run under CP, but normal users ran Cambridge Monitor System (CMS), a simple, single-user operating system. CMS allowed users to run programs and manage their virtual devices. CP-67 versions 1 and 2 did not support virtual memory inside a virtual machine. This was added in version 3. At that point, testing and development of CP itself could be done by running a full copy of CP/CMS inside a single virtual machine. Some CP/CMS operating system work, such as CP-370 development and MVS testing, ran four- or five-level deep stacks of hardware and OS simulations. The CP/CMS design is different from IBM's previous monolithic operating systems, it separates complex "big system" (dispatching, hardware management, mass storage) from "little system" (application program execution, file I/O, console input/output). The re-categorization of both systems into their own entities prevents a bug in one users' system from affecting both. This is a model feature in microkernel operating systems. IBM's decision to implement virtualization and virtual memory features in the subsequent S/370 design (although missing from the initial S/370 series) reflects, at least in part, the success of the CP/CMS approach. In turn the survival and success of IBM's VM operating system family, and of virtualization technology in general, owe much to the S/360-67. In many respects, IBM's CP-67 and CP/CMS products anticipated (and heavily influenced) contemporary virtualization software, such as VMware Workstation, Xen, and Microsoft Virtual PC. == Related terminology == CP: Control Program. CP-40 and CP-67 were implementations for CSC's customized S/360-40 and the standard S/360-67,
|
{"page_id": 315784, "title": "CP/CMS"}
|
mechanism, which produces and loads data streams conforming to the .m3g file format specification for 3D model data, including animation data format. This allows developers to create content on desktop computers that can be loaded by M3G on mobile devices. == Further reading == Pulli, Kari; Aarnio, Tomi; Roimela, Kimmo & Vaarala, Jani (2005). "Designing graphics programming interfaces for mobile devices". IEEE Computer Graphics and Applications. 25 (6). IEEE CG&A 2005: 66–75. doi:10.1109/MCG.2005.129. PMID 16315479. S2CID 8177273. Aarnio, Callow, Miettinen and Vaarala: Developing Mobile 3D Applications With OpenGL ES and M3G, SIGGRAPH 2005: Courses Alessio Malizia: Mobile 3D Graphics, Springer, 2006, ISBN 978-1-84628-383-3 Kari Pulli, Tomi Aarnio, Ville Miettinen, Kimmo Roimela, Jani Vaarala: Mobile 3D Graphics with OpenGL ES and M3G, Morgan Kaufmann, 2007, ISBN 0-12-373727-3 Claus Höfele: Mobile 3D Graphics: Learning 3D Graphics with the Java Micro Edition, Thomson Course Technology PTR, 2007, ISBN 1-59863-292-2 Carlos Morales, David Nelson: Mobile 3D Game Development: From Start to Market, Charles River Media, 2007, ISBN 1-58450-512-5 == References == == External links == Java Community Process JSR 184 (Mobile 3D Graphics API for J2ME 1.0, 1.1 Final Release 2) JSR 297 (Mobile 3D Graphics API 2.0 Proposed Final Draft) JSR 239 (Java Bindings for OpenGL ES) – related Java ME graphics specification Specifications JSR-000184 Mobile 3D Graphics API for J2ME(TM) 1.1 Maintenance Release JSR 184 1.1 Specification (Mobile 3D Graphics API Technical Specification, Version 1.1, June 22 2005) Getting Started With the Mobile 3D Graphics API for J2ME 3D graphics for Java mobile devices: Part 1 and Part 2 list of compatible devices JSR 184 compatible devices (Performance listing of most mobile 3D devices) Source code released by Symbian Foundation on GitHub SymbianSource/oss.FCL.sf.app.JRT
|
{"page_id": 30870475, "title": "Mobile 3D Graphics API"}
|
scientist at the Weizmann Institute. He was from 1988 to 1991 an assistant professor at the University of Florida. In 1990 he joined the physics department of the Technion, where he is now a professor of physics. For the academic year 1997–1998 he was a visiting member of UCSB's ITP. In 2020 he published, with Shankar Ghosh and five other colleagues, research on the development of rechargeable N95 masks. == Awards and honors == National Science Foundation Presidential Young Investigator Award Alon Fellowship at Tel Aviv University Minoru and Ethel Tsutsui Distinguished Graduate Research Award from the New York Academy of Sciences. With Paul Steinhardt and Alan Mackay, the Oliver E. Buckley Condensed Matter Prize 2021 Fellow of the American Physical Society. == Selected publications == Levine, Dov; Steinhardt, Paul J. (1986). "Quasicrystals. I. Definition and structure". Physical Review B. 34 (2): 596–616. Bibcode:1986PhRvB..34..596L. doi:10.1103/PhysRevB.34.596. PMID 9939667. (over 850 citations) Chaikin, P.M.; Behrooz, A.; Itzler, M.A.; Wilks, C.; Whitehead, B.; Grest, G.; Levine, D. (1988). "Studies of quasicrystalline superconducting networks". Physica B: Condensed Matter. 152 (1–2): 113–124. Bibcode:1988PhyB..152..113C. doi:10.1016/0921-4526(88)90076-2. Biham, Ofer; Middleton, A. Alan; Levine, Dov (1992). "Self-organization and a dynamical transition in traffic-flow models". Physical Review A. 46 (10): R6124 – R6127. arXiv:cond-mat/9206001. Bibcode:1992PhRvA..46.6124B. doi:10.1103/PhysRevA.46.R6124. PMID 9907993. S2CID 14543020. (over 1050 citations) Zik, O.; Levine, Dov; Lipson, S. G.; Shtrikman, S.; Stavans, J. (1994). "Rotationally Induced Segregation of Granular Materials". Physical Review Letters. 73 (5): 644–647. Bibcode:1994PhRvL..73..644Z. doi:10.1103/PhysRevLett.73.644. PMID 10057501. (over 350 citations) Lacasse, Martin-D.; Grest, Gary S.; Levine, Dov; Mason, T. G.; Weitz, D. A. (1996). "Model for the Elasticity of Compressed Emulsions". Physical Review Letters. 76 (18): 3448–3451. arXiv:mtrl-th/9603006. Bibcode:1996PhRvL..76.3448L. doi:10.1103/PhysRevLett.76.3448. PMID 10060969. S2CID 15288740. Lau, A. W. C.; Levine, Dov; Pincus, P. (2000). "Novel Electrostatic Attraction from Plasmon Fluctuations". Physical Review Letters. 84 (18): 4116–4119. arXiv:cond-mat/0006266.
|
{"page_id": 71279138, "title": "Dov Levine"}
|
attach degrees of belief to propositions and rules and to devise purely local schemes for combining and propagating those degrees of belief. The schemes 548 Chapter 14. Probabilistic Reasoning are also truth-functional; for example, the degree of belief in A ∨ B is a function of the belief in A and the belief in B.The bad news for rule-based systems is that the properties of locality, detachment, and truth-functionality are simply not appropriate for uncertain reasoning. Let us look at truth-functionality first. Let H1 be the event that a fair coin flip comes up heads, let T1 be the event that the coin comes up tails on that same flip, and let H2 be the event that the coin comes up heads on a second flip. Clearly, all three events have the same probability, 0.5, and so a truth-functional system must assign the same belief to the disjunction of any two of them. But we can see that the probability of the disjunction depends on the events themselves and not just on their probabilities: P (A) P (B) P (A ∨ B) P (H1) = 0 .5 P (H1 ∨ H1) = 0 .50 P (H1) = 0 .5 P (T1) = 0 .5 P (H1 ∨ T1) = 1 .00 P (H2) = 0 .5 P (H1 ∨ H2) = 0 .75 It gets worse when we chain evidence together. Truth-functional systems have rules of the form A % → B that allow us to compute the belief in B as a function of the belief in the rule and the belief in A. Both forward- and backward-chaining systems can be devised. The belief in the rule is assumed to be constant and is usually specified by the knowledge engineer—for example, as A % →0.9 B.Consider the wet-grass situation
|
{"source": 1019, "title": "from dpo"}
|
at OOD detection (a new task), and thus we propose a general methodology named watermarking in this paper. Specifically, we learn a unified pattern that is superimposed onto features of original data, and the model's detection capability is largely boosted after watermarking. Extensive experiments verify the effectiveness of watermarking, demonstrating the significance of the reprogramming property of deep models in OOD detection. Continuous-time dynamic graphs naturally abstract many real-world systems, such as social and transactional networks. While the research on continuous-time dynamic graph representation learning has made significant advances recently, neither graph topological properties nor temporal dependencies have been well-considered and explicitly modeled in capturing dynamic patterns. In this paper, we introduce a new approach, Neural Temporal Walks (NeurTWs), for representation learning on continuous-time dynamic graphs. By considering not only time constraints but also structural and tree traversal properties, our method conducts spatiotemporal-biased random walks to retrieve a set of representative motifs, enabling temporal nodes to be characterized effectively. With a component based on neural ordinary differential equations, the extracted motifs allow for irregularly-sampled temporal nodes to be embedded explicitly over multiple different interaction time intervals, enabling the effective capture of the underlying spatiotemporal dynamics. To enrich supervision signals, we further design a harder contrastive pretext task for model optimization. Our method demonstrates overwhelming superiority under both transductive and inductive settings on six real-world datasets. We propose InsNet, an expressive insertion-based text generator with efficient training and flexible decoding (parallel or sequential). Unlike most existing insertion-based text generation works that require re-encoding of the (decoding) context after each insertion operation and thus are inefficient to train, InsNet only requires one pass of context encoding for the entire insertion sequence during training by using a novel insertion-oriented position encoding to enable computation sharing. Furthermore, InsNet provides a controllable switch between parallel
|
{"source": 2773, "title": "from dpo"}
|
2020). 20 While clearly a useful step in the right direction, note though > 18 In the context of the factor content of trade literature, Puzzello (2012) finds that such proportionality assumptions do not appear to generate a large bias if the purpose is to decompose the content of net trade. This is done by comparing the accounting results when using the Asian International Input-Output Tables (AIIO), which incorporates information from firm surveys on imported input purchases to help pin down the off-diagonal block entries, against that obtained when applying the standard proportionality assumptions. > 19 Direct information on the composition of imports of services by end-uses is even more challenging to obtain. The WIOD 2013 release uses the Eurostat import tables, computes for each service industry a simple average across countries of the share of imports by broad end-use categories, and applies this set of benchmark weights to the entire sample of countries in the WIOD. See Dietzenbacher et al. (2013) for further caveats on the quality of the WIOD data on services trade flows. > 20 This modification to the proportionality assumptions appears to result in some meaningful adjustments to measures of GVC participation. See for example Figure 2 in Timmer et al. (2015), which compares country-level > V AX/GX ratios computed from different leading sources of WIOT data. While the V AX/GX measure is highly correlated across the different WIOT sources, slightly larger gaps emerge between the measures calculated from the WIOD and those from Johnson and Noguera (2012), where the latter is based on an underlying set of tables constructed using common weights across end-use categories. The gaps are more noticeable among countries with low 17 that a common set of ωrij weights continues to be applied to imports of inputs across all purchasing industries in
|
{"source": 5181, "title": "from dpo"}
|
SubBytes emulate their respective AES counterparts. Additionally, there exists another operation, A(X), which involves the composition of MixColumns, ShiftRows, and SubBytes (X). The round function R(S,X 0,X 1) (Fig.4, symbolized by R(S,X 0,X 1)→S′. Notably, this update involves the application of constants Z 0 and Z 1 in the process. S′=S⊕SS′=AES(S,X 0)S′=AES(S,S)S′=AES(S,S)S′=AES(S,X 1)S′=AES(S,S)S′=AES(S,S) **Figure 4** ![Image 4: figure 4. Full size image is iteratively applied 16 times. Finally, the keys K 0 and K 1 are XOR-ed with specific substates. Precisely, K 0 is XOR-ed with substates _S_, _S_, _S_, and _S_, while K 1 is XOR-ed with _S_, _S_, and _S_. This final step completes the initialization process, preparing the state for subsequent operations within the Rocca-S encryption scheme. _Processing the associated data_ In this phase, the process of updating the state is contingent on the length of the associated data _AD_. Initially, padding bits are appended to _AD_ to ensure it is a multiple
|
{"source": 6373, "title": "from dpo"}
|
the hammer, and the hold-down bar. All of these must be in place for the mousetrap to work, as the removal of any one piece destroys the function of the mousetrap. Likewise, he asserts that biological systems require multiple parts working together in order to function. Intelligent design advocates claim that natural selection could not create from scratch those systems for which science is currently unable to find a viable evolutionary pathway of successive, slight modifications, because the selectable function is only present when all parts are assembled. In his 2008 book Only A Theory, biologist Kenneth R. Miller challenges Behe's claim that the mousetrap is irreducibly complex. Miller observes that various subsets of the five components can be devised to form cooperative units, ones that have different functions from the mousetrap and so, in biological terms, could form functional spandrels before being adapted to the new function of catching mice. In an example taken from his high school experience, Miller recalls that one of his classmates...struck upon the brilliant idea of using an old, broken mousetrap as a spitball catapult, and it worked brilliantly.... It had worked perfectly as something other than a mousetrap.... my rowdy friend had pulled a couple of parts—probably the hold-down bar and catch—off the trap to make it easier to conceal and more effective as a catapult... [leaving] the base, the spring, and the hammer. Not much of a mousetrap, but a helluva spitball launcher.... I realized why [Behe's] mousetrap analogy had bothered me. It was wrong. The mousetrap is not irreducibly complex after all. Other systems identified by Miller that include mousetrap components include the following: use the spitball launcher as a tie clip (same three-part system with different function) remove the spring from the spitball launcher/tie clip to create a two-part key
|
{"page_id": 15387, "title": "Irreducible complexity"}
|
Morbius must now feed on fresh blood regularly or risk death. His appearance and personality also shift, making him now prone to bouts of rage, paranoia, and bloodlust. During one of these early bouts of bloodlust and madness, Morbius' first victim is his friend Emil. Horrified by his actions and mutation, Morbius leaves for New York to conduct more research in secret. He encounters the scientist-turned-monster known as the Lizard and the hero Spider-Man, who at the time is dealing with a mutation that has left him with four extra arms. Samples of Morbius' blood leads the Lizard to revert to his human form of Curt Connors and allows Spider-Man to lose his extra limbs. It is discovered that a few of Morbius' victims did not die and are now infected with a form of his own mutation, giving them increased strength and bloodlust but no further superhuman abilities. Morbius and Martine synthesize an antidote for these victims, but the serum does not work on Morbius' own condition. Overtaken by bloodlust, Morbius attacks Martine, turning her into a pseudo-vampire as well. After using their serum to cure her, Morbius flees rather than endanger Martine again. Morbius eventually leaves New York, moving location frequently to avoid capture. During this time, he rescues Amanda Saint from a Satanic cult known as Demon-Fire, then encounters John Jameson, who at the time is cursed to transform into the Man-Wolf. Alongside the Man-Wolf, Morbius battles Spider-Man again. Later, Morbius encounters Reverend Daemond, the Caretakers of the planet Arcturus IV, the Cat People of the Land Within and Tara the Girlchild, the extra-dimensional demon known as Helleyes, and the Living Eraser. He also meets other monsters, such as the Werewolf (Jack Russell), the Ghost Rider (Johnny Blaze), and the Man-Thing (Ted Sallis), and superhuman adventurers such
|
{"page_id": 1809522, "title": "Morbius"}
|
cl C . {\displaystyle C^{\circ \circ }=\operatorname {cl} C.} == Relation to the Fenchel–Moreau theorem == Let f ( x ) := δ ( x | C ) = { 0 x ∈ C ∞ otherwise {\displaystyle f(x):=\delta (x|C)={\begin{cases}0&x\in C\\\infty &{\text{otherwise}}\end{cases}}} be the indicator function for a cone C . {\displaystyle C.} Then the convex conjugate, f ∗ ( x ∗ ) = δ ( x ∗ | C ∘ ) = δ ∗ ( x ∗ | C ) = sup x ∈ C ⟨ x ∗ , x ⟩ {\displaystyle f^{*}(x^{*})=\delta \left(x^{*}|C^{\circ }\right)=\delta ^{*}\left(x^{*}|C\right)=\sup _{x\in C}\langle x^{*},x\rangle } is the support function for C , {\displaystyle C,} and f ∗ ∗ ( x ) = δ ( x | C ∘ ∘ ) . {\displaystyle f^{**}(x)=\delta (x|C^{\circ \circ }).} Therefore, C = C ∘ ∘ {\displaystyle C=C^{\circ \circ }} if and only if f = f ∗ ∗ . {\displaystyle f=f^{**}.} : 54 == See also == Dual system Fenchel–Moreau theorem – Mathematical theorem in convex analysis − A generalization of the bipolar theorem. Polar set – Subset of all points that is bounded by some given point of a dual (in a dual pairing) == References == == Bibliography == Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. ISBN 978-1584888666. OCLC 144216834. Schaefer, Helmut H.; Wolff, Manfred P. (1999). Topological Vector Spaces. GTM. Vol. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. ISBN 978-1-4612-7155-0. OCLC 840278135. Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322.
|
{"page_id": 35128576, "title": "Bipolar theorem"}
|
wires holding an electric charge to deflect particles, which may have more controllable directionality. Magnetic sails deflect charged particles from the solar wind with a magnetic field, thereby imparting momentum to the spacecraft. For instance, the so-called Magsail is a large superconducting loop proposed for acceleration/deceleration in the solar wind and deceleration in the Interstellar medium. A variant is the mini-magnetospheric plasma propulsion system and its successor, the magnetoplasma sail, which inject plasma at a low rate to enhance the magnetic field to more effectively deflect charged particles in a plasma wind. Japan launched a solar sail-powered spacecraft, IKAROS in May 2010, which successfully demonstrated propulsion and guidance (and is still active as of this date). As further proof of the solar sail concept, NanoSail-D became the first such powered satellite to orbit Earth. As of August 2017, NASA confirmed the Sunjammer solar sail project was concluded in 2014 with lessons learned for future space sail projects. The U.K. Cubesail programme will be the first mission to demonstrate solar sailing in low Earth orbit, and the first mission to demonstrate full three-axis attitude control of a solar sail. ==== Other propulsion types ==== The concept of a gravitational slingshot is a form of propulsion to carry a space probe onward to other destinations without the expense of reaction mass; harnessing the gravitational energy of other celestial objects allows the spacecraft to gain kinetic energy. However, more energy can be obtained from the gravity assist if rockets are used via the Oberth effect. A tether propulsion system employs a long cable with a high tensile strength to change a spacecraft's orbit, such as by interaction with a planet's magnetic field or through momentum exchange with another object. Beam-powered propulsion is another method of propulsion without reaction mass, and includes sails pushed
|
{"page_id": 28506, "title": "Spacecraft propulsion"}
|
health hazard for humans. One local veterinarian, Richard Weitzman, agreed that the lab was very dirty, but said the monkeys seemed well fed and "in pretty good health". Pacheco reported the situation to the Montgomery County police, who raided the laboratory on September 11, 1981, under Maryland's Prevention of Cruelty to Animals law. PETA tipped off the media beforehand, so that the raid was witnessed by several reporters and a camera crew, to the irritation of the police. The officers later testified that the monkeys were living in filthy conditions. Richard Swain, who led the raid, told The Washington Post in 1991: "It was absolutely filthy, just incredibly dirty, like nothing I've ever been in. I've executed lots and lots of search warrants. I've worked in murder, in narcotics, in vice, but this was the first time I went into a room, and I felt legitimately concerned for my health just being there." Taub was charged with 17 counts of animal cruelty and failing to provide adequate veterinary care. The police removed the monkeys from the lab to the basement of a house in Rockville owned by Lori Kenealy of the local humane society. The monkeys were given toys, groomed with toothbrushes by the activists, watched 24 hours a day, and allowed to watch daytime soap operas. In the meantime, Taub's lawyers went to court and demanded their return, and ten days after the raid a judge granted the request. Immediately afterward, the monkeys disappeared. Kenealy was not at home when it happened, and insisted she knew nothing about it. Richard Swain, who had led the police raid, arrested her and put her in the local jail overnight. PETA was told there could be no legal action against Taub without the monkeys as evidence. Five days later the monkeys were
|
{"page_id": 3204006, "title": "Silver Spring monkeys"}
|
RNA, an essential building block in all organisms, by stringing hippie beads for the nine known tRNA sequences in four colors to represent the four nucleic acid bases, pairing the bases, and folding them into a logical structure. While a post doc in the Stanford biochemistry department, she discovered the first physical evidence for intermediate states in the folding of protein molecules doing "temperature jump NMR," a technique she imagined while watching water melting from a glacier in Central Asia. Her Stanford advisor, Robert Baldwin, stated in his oral history that this work was a first step towards solving the problem of the mechanism of protein folding. Blum's research with biochemist Bruce Ames at the UC Berkeley found that the flame retardant called Tris, used at high levels in most children's pajamas in the middle of the 1970s, was a mutagen and likely carcinogen. Three months after their 1977 paper in Science was published, children's sleepwear containing Tris was banned in the United States. == Science policy work == After a 26-year long hiatus, Blum returned to science and policy work in 2006—when her daughter started college—and her memoir Breaking Trail: A Climbing Life was published. She discovered that the same Tris her research had helped remove from children's pajamas was back in American couches and baby products. As a result, Blum founded the Green Science Policy Institute (GSP) in 2007 to bring scientific research results to decision makers in government and industry to protect human health and the environment from toxic chemicals. Blum and her team collaborate with scientists on policy-relevant research projects and translate scientific information to educate decision makers, the press, and the public. The Institute's work has contributed to many policies and business practices that reduce the use of toxic chemicals, particularly halogenated chemicals such as
|
{"page_id": 4287527, "title": "Arlene Blum"}
|
the world, because it is in these environments that vegetation does not prevent the presence and motion of fields of sand. Wind-blown very fine-grained dust is capable of entering the upper atmosphere and moving across the globe. Dust from the Sahara deposits on the Canary Islands and islands in the Caribbean, and dust from the Gobi Desert has deposited on the western United States. This sediment is important to the soil budget and ecology of several islands. Deposits of fine-grained wind-blown glacial sediment are called loess. === Fluvial === === Coastal === Coastal sediment transport takes place in near-shore environments due to the motions of waves and currents. At the mouths of rivers, coastal sediment and fluvial sediment transport processes mesh to create river deltas. Coastal sediment transport results in the formation of characteristic coastal landforms such as beaches, barrier islands, and capes. === Glacial === As glaciers move over their beds, they entrain and move material of all sizes. Glaciers can carry the largest sediment, and areas of glacial deposition often contain a large number of glacial erratics, many of which are several metres in diameter. Glaciers also pulverize rock into "glacial flour", which is so fine that it is often carried away by winds to create loess deposits thousands of kilometres afield. Sediment entrained in glaciers often moves approximately along the glacial flowlines, causing it to appear at the surface in the ablation zone. === Hillslope === In hillslope sediment transport, a variety of processes move regolith downslope. These include: Soil creep Tree throw Movement of soil by burrowing animals Slumping and landsliding of the hillslope These processes generally combine to give the hillslope a profile that looks like a solution to the diffusion equation, where the diffusivity is a parameter that relates to the ease of sediment
|
{"page_id": 7999492, "title": "Sediment transport"}
|
has since been incorporated into numerous pieces of software and academic research. == Adoption == == References == == External links == Official website for the current specification. Python SigMF Module for reading, writing, and editing datasets. C++ SigMF Library Julia SigMF Library
|
{"page_id": 77244212, "title": "SigMF"}
|
Lord Rayleigh in 1871 is a famous example of applying dimensional analysis to solving problems in physics. Scattering and absorption are major causes of the attenuation of sunlight radiation by the atmosphere. Scattering varies as a function of the ratio of particle diameters (of particulates in the atmosphere) to the wavelength of the incident radiation. When this ratio is less than about one-tenth, Rayleigh scattering occurs. (In this case, the scattering coefficient varies inversely with the fourth power of the wavelength. At larger ratios scattering varies in a more complex fashion, as described for spherical particles by the Mie theory.) The laws of geometric optics begin to apply at higher ratios. Daily at any global venue experiencing sunrise or sunset, most of the solar beam of visible sunlight arrives nearly tangentially to Earth's surface. Here, the path of sunlight through the atmosphere is elongated such that much of the blue or green light is scattered away from the line of perceivable visible light. This phenomenon leaves the Sun's rays, and the clouds they illuminate, abundantly orange-to-red in colors, which one sees when looking at a sunset or sunrise. For the example of the Sun at zenith, in broad daylight, the sky is blue due to Rayleigh scattering, which also involves the diatomic gases N2 and O2. Near sunset and especially during twilight, absorption by ozone (O3) significantly contributes to maintaining blue color in the evening sky. == Under an overcast sky == There is essentially no direct sunlight under an overcast sky, so all light is then diffuse sky radiation. The flux of light is not very wavelength-dependent because the cloud droplets are larger than the light's wavelength and scatter all colors approximately equally. The light passes through the translucent clouds in a manner similar to frosted glass. The intensity
|
{"page_id": 212101, "title": "Diffuse sky radiation"}
|
a down-pointing arrow located below the fixation sign) than to incongruent ones (i.e., an up-pointing arrow located below the fixation sign). A similar effect, the Simon effect, uses non-spatial stimuli. === Numerical === The Numerical Stroop effect demonstrates the close relationship between numerical values and physical sizes. Digits symbolize numerical values but they also have physical sizes. A digit can be presented as big or small (e.g., 5 vs. 5), irrespective of its numerical value. Comparing digits in incongruent trials (e.g., 3 5) is slower than comparing digits in congruent trials (e.g., 5 3) and the difference in reaction time is termed the numerical Stroop effect. The effect of irrelevant numerical values on physical comparisons (similar to the effect of irrelevant color words on responding to colors) suggests that numerical values are processed automatically (i.e., even when they are irrelevant to the task). === Reverse === Another variant of the classic Stroop effect is the reverse Stroop effect. It occurs during a pointing task. In a reverse Stroop task, individuals are shown a page with a black square with an incongruent colored word in the middle—for instance, the word "red" written in the color green (red)—with four smaller colored squares in the corners. One square would be colored green, one square would be red, and the two remaining squares would be other colors. Studies show that if the individual is asked to point to the color square of the written color (in this case, red) they would present a delay. Thus, incongruently-colored words significantly interfere with pointing to the appropriate square. However, some research has shown there is very little interference from incongruent color words when the objective is to match the color of the word. == In popular culture == The Brain Age: Train Your Brain in Minutes a
|
{"page_id": 1038051, "title": "Stroop effect"}
|
is easy. Yet, in this ever-demanding environment, finding time to quiet your brain and create a space for contemplation is increasingly important” # 852. Select the best sentence from among the given choices. (A) You want your brain to work at its best, whether you want to stay sharp to keep up with your children or to excel at you’re work. (B) You want your brain to work at its best, whether you want to stay sharp to keep up with your children or to Excel at you’re work. (C) You want your brains to work at its best, whether you want to stay sharp to keep up with your children or to Excel at your work. (D) You want your brain to work at its best, whether you want to stay sharp to keep up with your children or to excel at your work. # 853. Select the best sentence from among the given choices. (A) The brain weighs a mere three pounds, yet it’s responsible for the smooth running of your whole body. (B) The brain weighs a mere three pounds, yet its responsible for the smooth running of your whole body. (C) The brain weighs a mere three pounds, yet its responsible for the smooth running of your hole body. (D) The brain weighs a mere three pounds, yet it’s responsible for the smooth running of your hole body. # 854. Select the best sentence from among the given choices. (A) This understanding gives you the foundation for know how to best train your brain. (B) This understanding gives you the foundation for knowing how to best training your brain. (C) This understanding gives you the foundation for knowing how to best train your brain. (D) This understanding gives you the foundation for know how to best
|
{"source": 1463, "title": "from dpo"}
|
· Mojmir Mutny · Melanie Zeilinger · Andreas Krause [ Halle B ] Abstract In reinforcement learning (RL), rewards of states are typically considered additive, and following the Markov assumption, they are independent of states visited previously. In many important applications, such as coverage control, experiment design and informative path planning, rewards naturally have diminishing returns, i.e., their value decreases in light of similar states visited previously. To tackle this, we propose Submodular RL (subRL), a paradigm which seeks to optimize more general, non-additive (and history-dependent) rewards modelled via submodular set functions, which capture diminishing returns. Unfortunately, in general, even in tabular settings, we show that the resulting optimization problem is hard to approximate. On the other hand, motivated by the success of greedy algorithms in classical submodular optimization, we propose subPO, a simple policy gradient-based algorithm for subRL that handles non-additive rewards by greedily maximizing marginal gains. Indeed, under some assumptions on the underlying Markov Decision Process (MDP), subPO recovers optimal constant factor approximations of submodular bandits. Moreover, we derive a natural policy gradient approach for locally optimizing subRL instances even in large state- and action- spaces. We showcase the versatility of our approach by applying subPO to several applications, such as biodiversity monitoring, Bayesian experiment design, informative path planning, and coverage maximization. … Spotlight Poster Tianjian Li · Haoran Xu · Philipp Koehn · Daniel Khashabi · Kenton Murray [ Halle B ] Abstract Text generation models are notoriously vulnerable to errors in the training data. With the wide-spread availability of massive amounts of web-crawled data becoming more commonplace, how can we enhance the robustness of models trained on a massive amount of noisy web-crawled text? In our work, we propose Error Norm Truncation (ENT), a robust enhancement method to the standard training objective that truncates noisy data.
|
{"source": 3852, "title": "from dpo"}
|
language models (llms) are trained on large amounts of data, which can include sensitive information that may compromise personal privacy. llms showed to memorize parts of the training data and emit those data verbatim when an adversary prompts appropriately. previous research has primarily focused on data preprocessing and differential privacy techniques to address memorization or prevent verbatim memorization exclusively, which can give a false sense of privacy. however, these methods rely on explicit and implicit assumptions about the structure of the data to be protected, which often results in an incomplete solution to the problem. to address this, we propose a novel framework that utilizes a reinforcement learning approach (ppo) to fine-tune llms to mitigate approximate memorization. our approach utilizes a negative similarity score, such as bertscore or sacrebleu, as a reward signal to learn a dissimilarity policy. our results demonstrate that this framework effectively mitigates approximate memorization while maintaining high levels of coherence and fluency in the generated samples. furthermore, our framework is robust in mitigating approximate memorization across various circumstances, including longer context, which is known to increase memorization in llms. Expand Abstract Discern and Answer: Mitigating the Impact of Misinformation in Retrieval-Augmented Models With Discriminators Giwon Hong, Jeonghwan Kim, Junmo Kang, Sung-Hyon Myaeng, Joyce Jiyoung Whang Abstract: most existing retrieval-augmented language models (lms) for question answering assume all retrieved information is factually correct. in this work, we study a more realistic scenario in which retrieved documents may contain misinformation, causing conflicts among them. we observe that the existing models are highly brittle to such information in both fine-tuning and in-context few-shot learning settings. we propose approaches to make retrieval-augmented lms robust to misinformation by explicitly fine-tuning a discriminator or prompting to elicit discrimination capability in gpt-3. our empirical results on open-domain question answering show that these approaches
|
{"source": 5788, "title": "from dpo"}
|
a round, then an arbitrary subset (possibly all) of its messages for that round are lost, as determined by the adversary. The message complexity of an execution is the total number of messages sent by all processes during the entire execution. The commu-nication complexity of an execution is the total number of bits for all messages. Each process has access to an arbitrary number of random bits. We assume that the round in which a process fails is independent of the random bits, i.e., the adversary is oblivious . Formally, the oblivious adversary chooses, prior to every execution: (i) a function F : Π → Z∪{⊥} specifying in which round each process fails, and (ii) a function M : Π → P(Π) specifying which subset of messages are delivered by a process in the round in which it fails. If a process p never fails, i.e., if F (p) = ⊥,we say that it is correct . We say that a process p is non-failed in round r if it is either correct or F (p) > r . If a message is sent by a faulty process p in round F (p) to a process q ∈ M (p), then it is delivered; if it is sent to a process q′ /∈ M (p) then it is not delivered 2 3 Communication-Optimal Consensus In this section, we present a randomized algorithm for solving consensus using only O(n) messages and O(n)bits of communication. We begin with an overview of the basic structure of the algorithm. We then describe the individual building blocks, and discuss how to assemble them into an efficient solution. The first step, described in Section 3.1, is to choose a set of Θ(log n) coordinators that are responsible for determining the eventual decision. The coordinators are selected
|
{"source": 7338, "title": "from dpo"}
|
New Mexico from 1995 to 2003; Libertarian Party nominee for President of the United States in 2012 and 2016. Judge Jim Gray: Presiding judge of the Superior Court of Orange County, California (1989–2009), and the 2012 Libertarian Party vice presidential nominee. Adam Kokesh: American activist, talk show host, and "Iraq Veterans Against the War" activist. Mary Ruwart: Research scientist, libertarian speaker, author, and candidate for 2008 Libertarian Party presidential nomination. Gregory Creswell: 2006 Libertarian Party of Michigan gubernatorial nominee, and advocate for the Michigan Civil Rights Initiative, an anti-affirmative action ballot initiative. == Carl Levin recall effort == Boman was cosponsor of an unsuccessful effort to recall United States Senator Carl Levin of Michigan. Michigan law states that Persons holding the office of United States senator are subject to recall by the qualified and registered electors of the state as provided in chapter 36 of this act. Boman and Warren Raftshol of Suttons Bay Michigan were granted a clarity review hearing with the Wayne County Election Commission on May 1, 2012. While the initial wording was rejected, the recall sponsors were able to use alternative wording and started circulating petitions on July 4, 2012, after Wayne County Election Chair, Milton Mack, refused to schedule a hearing for the revised language. Michigan law provides for such circumstances: (3) The board of county election commissioners, not less than 10 days or more than 20 days after submission to it of a petition for the recall of an officer, shall meet and shall determine whether each reason for the recall stated in the petition is of sufficient clarity to enable the officer whose recall is sought and the electors to identify the course of conduct that is the basis for the recall. Failure of the board of county election commissioners to comply with
|
{"page_id": 12540806, "title": "Scott Boman"}
|
The U.S. National Ambient Air Quality Standards (NAAQS, pronounced naks) are limits on atmospheric concentration of six pollutants that cause smog, acid rain, and other health hazards. Established by the United States Environmental Protection Agency (EPA) under authority of the Clean Air Act (42 U.S.C. 7401 et seq.), NAAQS is applied for outdoor air throughout the country. The six criteria air pollutants (CAP), or criteria pollutants, for which limits are set in the NAAQS are ozone (O3), atmospheric particulate matter (PM2.5/PM10), lead (Pb), carbon monoxide (CO), sulfur oxides (SOx), and nitrogen oxides (NOx). These are typically emitted from many sources in industry, mining, transportation, electricity generation and agriculture. In many cases they are the products of the combustion of fossil fuels or industrial processes. The National Emissions Standards for Hazardous Air Pollutants cover many other chemicals, and require the maximum achievable reduction that the EPA determines is feasible. == Background == The six criteria air pollutants were the first set of pollutants recognized by the United States Environmental Protection Agency as needing standards on a national level. The Clean Air Act requires the EPA to set US National Ambient Air Quality Standards (NAAQS) for the six CAPs. The NAAQS are health based and the EPA sets two types of standards: primary and secondary. The primary standards are designed to protect the health of 'sensitive' populations such as asthmatics, children, and the elderly. The secondary standards are concerned with protecting the environment. They are designed to address visibility, damage to crops, vegetation, buildings, and animals. The EPA established the NAAQS according to Sections 108 and 109 of the U.S. Clean Air Act, which was last amended in 1990. These sections require the EPA "(1) to list widespread air pollutants that reasonably may be expected to endanger public health or welfare; (2)
|
{"page_id": 1621705, "title": "National Ambient Air Quality Standards"}
|
factorials, and can be used to count the trailing zeros of the factorials. Daniel Bernoulli and Leonhard Euler interpolated the factorial function to a continuous function of complex numbers, except at the negative integers, the (offset) gamma function. Many other notable functions and number sequences are closely related to the factorials, including the binomial coefficients, double factorials, falling factorials, primorials, and subfactorials. Implementations of the factorial function are commonly used as an example of different computer programming styles, and are included in scientific calculators and scientific computing software libraries. Although directly computing large factorials using the product formula or recurrence is not efficient, faster algorithms are known, matching to within a constant factor the time for fast multiplication algorithms for numbers with the same number of digits. == History == The concept of factorials has arisen independently in many cultures: In Indian mathematics, one of the earliest known descriptions of factorials comes from the Anuyogadvāra-sūtra, one of the canonical works of Jain literature, which has been assigned dates varying from 300 BCE to 400 CE. It separates out the sorted and reversed order of a set of items from the other ("mixed") orders, evaluating the number of mixed orders by subtracting two from the usual product formula for the factorial. The product rule for permutations was also described by 6th-century CE Jain monk Jinabhadra. Hindu scholars have been using factorial formulas since at least 1150, when Bhāskara II mentioned factorials in his work Līlāvatī, in connection with a problem of how many ways Vishnu could hold his four characteristic objects (a conch shell, discus, mace, and lotus flower) in his four hands, and a similar problem for a ten-handed god. In the mathematics of the Middle East, the Hebrew mystic book of creation Sefer Yetzirah, from the Talmudic period (200
|
{"page_id": 10606, "title": "Factorial"}
|
Susie Wong Håkansson (born July 15, 1940) is known for her work in mathematics education, teacher preparation and professional development. Since 1999, she has been Executive Director of the California Mathematics Project. == Life == Susie (Susan) Wong Håkansson is a native Southern Californian born and raised in Los Angeles. Her parents are first generation Chinese immigrants who owned a small business in the Larchmont area. After gaining her master's degree, Håkansson taught for several years at Huntington Park High School in Los Angeles Unified School District and was involved in several projects to improve the teaching and learning of mathematics. She served as a head track and field coach and official specializing in pole vault and had the opportunity of working at the 1984 Olympics at Los Angeles. In 1984, she joined Center X in the UCLA Graduate School of Education and Information Studies and served as the site director of the UCLA Mathematics Project. She took on the position as the statewide Executive Director for the California Mathematics Project in 1999. === Education === After completing her primary schooling at Los Angeles High School, went on to receiving her bachelor's and master's degrees in mathematics, and a teaching credential from University of California, Santa Barbara, and her doctorate in education from University of California, Los Angeles. Her graduate advisor was Dr. Noreen Webb and her thesis was titled The effects of daily problem solving on problem-solving performance, attitudes towards mathematics, and mathematics achievement. == Awards == Robert Sorgenfrey Distinguished Teaching Award, UCLA, 2009 Walter Denham Memorial Award (Advocacy for Mathematics Education), California Mathematics Council, 2009 == References ==
|
{"page_id": 37263324, "title": "Susie W. Håkansson"}
|
team of five "highly skilled operatives" to do the job that Michael Knight used to do. They are Kyle Stewart (Brixton Karnes), Jenny Andrews (Christine Steel), Duke DePalma (Duane Davis), Erica West (Kathy Trageser), and Kevin "Trek" Sanders, (Nick Wechsler). In one of the episodes it is implied that Jenny Andrews is the daughter of Michael Knight. However, it is never confirmed. The series was created by writer/producers Rick Copp and David A. Goodman, and was distributed by Universal Domestic Television. It ran for a single season of 22 one-hour episodes before it was canceled due to poor ratings. === Knight Rider (2008–2009) === The new Knight Rider series followed Michael "Mike" Traceur, the estranged son of Michael Knight, as he takes up the mantle of the FLAG driver. This time, he is driving the Knight Industries Three Thousand, also known as "KITT". The series stars Justin Bruening as Mike Traceur/Knight, and Deanna Russo as Sarah Graiman, Traceur's former girlfriend and love interest. Sarah is the daughter of Charles Graiman, played by Bruce Davison, the creator of a new generation of KITT, which is voiced by Val Kilmer. On May 19, 2009, NBC announced that Knight Rider was canceled after one season because of poor ratings. === Knight Rider === In 2016, it was announced that Machinima, YOMYOMF and NBCUniversal Brand Development are developing a Knight Rider reboot with Justin Lin producing and directing the series. There has been no info about this since. It has more than likely been cancelled == Television films == === Knight Rider 2000 (1991) === Knight Rider 2000 is a television sequel movie to the original Knight Rider series. It aired on May 19, 1991. It was directed by Alan J. Levi and written by Rob Hedden and Glen A. Larson. The movie sees
|
{"page_id": 35196753, "title": "Knight Rider"}
|
A gravitational keyhole is a tiny region of space where a planet's gravity would alter the orbit of a passing asteroid such that the asteroid would collide with that planet on a given future orbital pass. The word "keyhole" contrasts the large uncertainty of trajectory calculations (between the time of the observations of the asteroid and the first encounter with the planet) with the relatively narrow bundle(s) of critical trajectories. The term was coined by P. W. Chodas in 1999. It gained some public interest when it became clear, in January 2005, that the asteroid 99942 Apophis would miss the Earth in 2029 but may go through one or another keyhole leading to impacts in 2036 or 2037. Further research has since been done, however, which revealed the probability of Apophis passing through the keyhole was extremely low. Keyholes for the nearer or further future are named by the numbers of orbital periods of the planet and the asteroid, respectively, between the two encounters (for example “7:6 resonance keyhole”). There are even more but smaller secondary keyholes, with trajectories including a less close intermediate encounter ("bank shots"). Secondary gravitational keyholes are searched for by importance sampling: virtual asteroid trajectories (or rather their ‘initial’ values at the time of the first encounter) are sampled according to their likelihood given the observations of the asteroid. Very few of these virtual asteroids are virtual impactors. == Background == Due to observational inaccuracies, inaccuracies in the frame of reference stars, bias in the weighting of major observatories over smaller ones, and largely unknown non-gravitational forces on the asteroid, mainly the Yarkovsky effect, its position at the predicted time of encounter is uncertain in three dimensions. Typically, the region of probable positions is formed like a hair, thin and elongated, because visual observations yield 2-dimensional
|
{"page_id": 14000306, "title": "Gravitational keyhole"}
|
A stored-program computer is a computer that stores program instructions in electronically, electromagnetically, or optically accessible memory. This contrasts with systems that stored the program instructions with plugboards or similar mechanisms. The definition is often extended with the requirement that the treatment of programs and data in memory be interchangeable or uniform. == Description == In principle, stored-program computers have been designed with various architectural characteristics. A computer with a von Neumann architecture stores program data and instruction data in the same memory, while a computer with a Harvard architecture has separate memories for storing program and data. However, the term stored-program computer is sometimes used as a synonym for the von Neumann architecture. Jack Copeland considers that it is "historically inappropriate, to refer to electronic stored-program digital computers as 'von Neumann machines'". Hennessy and Patterson wrote that the early Harvard machines were regarded as "reactionary by the advocates of stored-program computers". == History == The concept of the stored-program computer can be traced back to the 1936 theoretical concept of a universal Turing machine. Von Neumann was aware of this paper, and he impressed it on his collaborators. Many early computers, such as the Atanasoff–Berry computer, were not reprogrammable. They executed a single hardwired program. As there were no program instructions, no program storage was necessary. Other computers, though programmable, stored their programs on punched tape, which was physically fed into the system as needed, as was the case for the Zuse Z3 and the Harvard Mark I, or were only programmable by physical manipulation of switches and plugs, as was the case for the Colossus computer. In 1936, Konrad Zuse anticipated in two patent applications that machine instructions could be stored in the same storage used for data. In 1948, the Manchester Baby, built at University of Manchester,
|
{"page_id": 148417, "title": "Stored-program computer"}
|
can include polystyrene foam, fiberglass, and even aluminum-- styrene plastic, ABS plastic, and urethane are considered to be the industry standard, and are most often specified in plans by architects and engineers. The form liners are attached to forms and concrete is placed against the liner. The liner pattern is transferred into the wet concrete. After the concrete has cured, the liner is stripped and the unique sculpture is exposed. == Origins == Architectural elastomeric urethane form liners were pioneered in 1968 at RECKLI GmbH, Herne Germany. The inception of form liners began with fairly simple images for concrete, including cut-out shapes and silhouettes resting on a background texture. As time passed, these designs grew in complexity, and creative artists and sculptors began to work with form liner manufactures to produce and design anything imaginable in concrete walls, and on a grand scale. Form liner textures were popularized in the early 1970s with graphic inlays. In 1972, Scott System created a fluted form liner with graphic inlays of shrimp boats, a famous crawfish wrapped around an oil bearing, tug boats and race boats. This sound/retaining wall, located in Morgan City, LA, was to be the first use ever of graphic inlays in form liner. == References ==
|
{"page_id": 17750835, "title": "Form liner"}
|
George Butler (5 July 1774 – 30 April 1853) was an English schoolmaster and divine, Headmaster of Harrow School from 1805 to 1829 and Dean of Peterborough from 1842 to his death in 1853. == Biography == The son of Weeden Butler (1742–1823), George Butler was educated at the Chelsea school where his father taught and proceeded to Sidney Sussex College, Cambridge, where he graduated senior wrangler in 1794 (M.A. 1797; B.D. 1804; D.D. (litterae regiae) 1805). He became a fellow of Sidney Sussex, first as mathematical lecturer, and afterwards as classical tutor. He was elected a public examiner of the university in 1804, and in the following year was one of the select preachers. As headmaster of Harrow School (1805–1829) his all-round knowledge, his tact and his skill as a track and field athlete rendered his administration successful and popular. On his retirement he settled down at Gayton, Northamptonshire, a living which had been presented to him by his college in 1814. In 1836 he became chancellor of the diocese of Peterborough, and in 1842 was appointed dean of Peterborough. His few publications include some notes of Harrow, entitled Harrow, a Selection of Lists of the School between 1770 and 1828 (Peterborough, 1849). == Personal life == Butler and his wife Sarah Maria Gray had four sons and at least three daughters: The Rev. Dr. George Butler (1819–1890), principal of Liverpool College (1866–1882) and canon of Winchester, whose wife, Josephine Butler, was a noted campaigner for the welfare of prostitutes Spencer Perceval Butler (1828–1915), lawyer and administrator, father of Sir Cyril Kendall Butler, Sir Spencer Harcourt Butler, Sir Montagu Sherard Dawes Butler and Sir George Geoffrey Gilbert Butler, and grandfather of the Conservative politician Richard Austen Butler The Rev. Arthur Gray Butler (1831–1909), Headmaster of Haileybury College and Dean
|
{"page_id": 8089914, "title": "George Butler (headmaster)"}
|
or the duration of events. Performance-analysis software can use the data to calculate the frequency of certain events, or the time spent performing specific activities. That information can be used to suggest areas for improvement and the types of optimizations that are helpful. The performance-monitoring facilities are fully described in “Performance Monitoring Counters” on page 410. The specific events that can be monitored are generally implementation specific. For more information, refer to the BIOS and Kernel Developer’s Guide (BKDG) or Processor Programming Reference Manual (PPR) applicable to your product. [AMD Public Use] 23 x86 and AMD64 Architecture Differences > AMD64 Technology 24593—Rev. 3.42—March 2024 # 2 x86 and AMD64 Architecture Differences The AMD64 architecture is designed to provide full binary compatibility with all previous AMD implementations of the x86 architecture. This chapter summarizes the new features and architectural enhancements introduced by the AMD64 architecture, and compares those features and enhancements with previous AMD x86 processors. Most of the new capabilities introduced by the AMD64 architecture are available only in long mode (64-bit mode, compatibility mode, or both). However, some of the new capabilities are also available in legacy mode, and are mentioned where appropriate. The material throughout this chapter assumes the reader has a solid understanding of the x86 architecture. For those who are unfamiliar with the x86 architecture, please read the remainder of this volume before reading this chapter. # 2.1 Operating Modes See “Operating Modes” on page 11 for a complete description of the operating modes supported by the AMD64 architecture. 2.1.1 Long Mode The AMD64 architecture introduces long mode and its two sub-modes: 64-bit mode and compatibility mode. > 64-Bit Mode. 64-bit mode provides full support for 64-bit system software and applications. The new features introduced in support of 64-bit mode are summarized throughout this chapter. To
|
{"source": 76, "title": "from dpo"}
|
is accessed in cycle one. A way hit (address match in predicted way) implies a cache hit. A way miss dictates examining all the tag subarrays in the second cycle. In case of a way hit, only one data subarray (the one whose tag matched) is accessed in cycle two. Assume the way predictor hits. > Cache block Set Way Possible memory blocks > 000M0, M8, M16, M24 110M1, M9, M17, M25 220M2, M10, M18, M26 330….440….550….660….770M7, M15, M23, M31 > Figure B.30 Memory blocks distributed to direct-mapped cache. Array Power consumption weight (per way accessed) > Data array 20 units Tag Array 5 units Miscellaneous array 1 unit Memory access 200 units > Figure B.31 Power consumption costs of different operations. Exercises by Amr Zaky ■ B-61 f. Repeat part (e) assuming that the way predictor misses (the way it choses is wrong). When it fails, the way predictor adds an extra cycle in which it accesses all the tag subarrays. Assume the way predictor miss is followed by a cache read hit. g. Repeat part (f) assuming a cache read miss. h. Use parts (e), (f), and (g) for the general case where the workload has the following statistics: way predictor miss rate = 5% and cache miss rate = 3%. (Consider different replacement policies.) Estimate the memory system (cache + memory) power usage (in power units) for the following configurations. We assume the cache is four-way set associative. Provide answers for the LRU, FIFO, and random replacement policies. B.4 [10/10/15/15/15/20] We compare the write bandwidth requirements of write-through versus write-back caches using a concrete example. Let us assume that we have a 64 KB cache with a line size of 32 bytes. The cache will allocate a line on a write miss. If configured
|
{"source": 2300, "title": "from dpo"}
|
because the difference can overflow (see Exercise R9.15). However, the Integer.compare method always works: > return Integer.compare(id, other.id); // Safe for negative integers You cannot compare floating-point values by subtraction (see Exercise R9.16). Instead, use the Double.compare method: > public class BankAccount implements Comparable {...public int compareTo(Object otherObject) {BankAccount other =(BankAccount) otherObject; return Double.compare(balance, other.balance); }} Constants in Interfaces Interfaces cannot have instance variables, but it is legal to specify constants .When declaring a constant in an interface, you can (and should) omit the reserved words > public static final , because all variables in an interface are automatically public static final .For example, > public interface Measurable {double OUNCES_PER_LITER =33.814; ...} To use this constant in your programs, add the interface name: > Measurable.OUNCES_PER_LITER Generic Interface Types In Section 9.6.3, you saw how to use the “raw” version of the Comparable interface type. In fact, the Comparable interface is a parameterized type, similar to the ArrayList type: > public interface Comparable {int compareTo(T other) } The type parameter specifies the type of the objects that this class is willing to accept for com-parison. Usually, this type is the same as the class type itself. For example, the BankAccount class would implement Comparable , like this: > public class BankAccount implements Comparable {...public int compareTo(BankAccount other) {return Double.compare(balance, other.balance); }} Special Topic 9.8 > © Eric Isselé/iStockphoto. Special Topic 9.9 > © Eric Isselé/iStockphoto. 9.6 Interface Types 477 The type parameter has a significant advantage: You need not use a cast to convert an Object parameter variable into the desired type. Similarly, the Measurer interface can be improved by making it into a generic type: > public interface Measurer {double measure( T anObject); } The type parameter specifies the type of the parameter of the measure method. Again, you avoid
|
{"source": 4220, "title": "from dpo"}
|
their temporal relation. But it is a fallacy to speak of this relation as never changing or being ‘‘permanent’’, as does McTaggart 9, since these things can only be said of things existing in time. Neither point-events, nor temporal re-lations connecting them, nor four-dimensional objects like worldlines or indeed the whole of spacetime, can be said to exist through time (for a duration, or forever — senses (iii) and (iv) above), and only some events (a proper subset of those in the manifold) exist at any given time (sense (ii) above). One can grant that events EXIST in the sense of being contained in a manifold; but since a manifold can also only be said to EXIST in an atemporal sense (sense (i) above), we have not succeeded in identifying any sense of ‘‘exist’’ that will support the argument that since events already exist, they do not need also to become. 7 Cf. the similar remark about time Leibniz made to Clarke: ‘‘Whatever exists of time and duration, being successive, perishes continually, and how can a thing exist eternally which (to speak exactly) does not exist at all?’’; Fifth Paper, y49; Westphal and Levenson (1993, p. 51). 8 This formulation, it seems to me, is fully in keeping with what Nerlich wants to say about the reality of spacetime and spacetime structure (see Nerlich, 1994, 40ff.). 9 ‘‘If N is ever earlier than O and later than M, it will always be, and has always been, earlier than O and later than M, since the relations of earlier and later are permanent’’ J. M. E. McTaggart (1908, p. 96). > R.T.W. Arthur 134 At this juncture an appeal is often made to a purported distinction between becoming present and the ‘‘tenseless occurrence’’ of events 10 . According to Adolf Gru
|
{"source": 6137, "title": "from dpo"}
|
the company to withdraw it. It was reintroduced into the US market in 2017. Brentuximab vedotin (trade name: Adcetris, marketed by Seattle Genetics and Millennium/Takeda) was approved for relapsed HL and relapsed systemic anaplastic large-cell lymphoma (sALCL)) by the FDA on August 19, 2011, and received conditional marketing authorization from the European Medicines Agency in October 2012. Trastuzumab emtansine (ado-trastuzumab emtansine or T-DM1, trade name: Kadcyla, marketed by Genentech and Roche) was approved in February 2013 for the treatment of people with HER2-positive metastatic breast cancer (mBC) who had received prior treatment with trastuzumab and a taxane chemotherapy. The European Commission approved Inotuzumab ozogamicin as a monotherapy for the treatment of adults with relapsed or refractory CD22-positive B-cell precursor acute lymphoblastic leukemia (ALL) on June 30, 2017, under the trade name Besponsa® (Pfizer/Wyeth), followed on August 17, 2017, by the FDA. The first immunology antibody–drug conjugate (iADC), ABBV-3373, showed an improvement in disease activity in a Phase 2a study of patients with rheumatoid arthritis and a study with the second iADC, ABBV-154 to evaluate adverse events and change in disease activity in participants treated with subcutaneous injection of ABBV-154 is ongoing. In July 2018, Daiichi Sankyo Company, Limited and Glycotope GmbH have inked a pact regarding the combination of Glycotope's investigational tumor-associated TA-MUC1 antibody gatipotuzumab and Daiichi Sankyo's proprietary ADC technology for developing gatipotuzumab antibody drug conjugate. In 2019 AstraZeneca agreed to pay up to US$6.9 billion to jointly develop DS-8201 with Japan's Daiichi Sankyo. It is intended to replace Herceptin for treating breast cancer. DS8201 carries eight payloads, compared to the usual four. == Commercial products == Fourteen ADCs have received market approval by the FDA – all for oncotherapies. Belantamab mafodotin is in the process of being withdrawn from US marketing. == Components of an ADC == An
|
{"page_id": 28646624, "title": "Antibody–drug conjugate"}
|
Silvia Curteanu, (Ph.D., 1998), is a Romanian chemist, who is active in the field of environmental science; she is a professor of the Gheorghe Asachi Technical University of Iași (TUIASI). == Works == Modelling and simulation applied to free radical polymerization (Ph.D. thesis, 1998) == Literature == Polymer Engineering / eds. Bartosz Tylkowski, Karolina Wieszczycka, Renata Jastrzab. — Berlin; Boston: De Gruyter, 2017. — 490 p. — ISBN 9783110469752. — ISBN 3110469758. Raluca-Maria Hlihor, Laura-Carmen Apostol, Maria Gavrilescu. Environmental Bioremediation by Biosorption and Bioaccumulation: Principles and Applications // Enhancing Cleanup of Environmental Pollutants. — Cham: Springer International Publishing, 2017. — P. 289–315. — ISBN 9783319554259. — DOI:10.1007/978-3-319-55426-6 14. == References == == Additional sources == "Prof. Dr.Ing. Silvia Curteanu". Department of Chemical Engineering, Technical University of Iași. 26 February 2013. Retrieved 2018-10-05.
|
{"page_id": 58871295, "title": "Silvia Curteanu"}
|
=== Ring closing metathesis === Hoveyda and Schrock have developed a catalyst for ring-closing metathesis kinetic resolution of dienyl allylic alcohols. The molybdenum alkylidene catalyst selectively catalyzes one enantiomer to perform ring closing metathesis, resulting in an enantiopure alcohol, and an enantiopure closed ring, as shown below. The catalyst is most effective at resolving 1,6-dienes. However, slight structural changes in the substrate, such as increasing the inter-alkene distance to 1,7, can sometimes necessitate the use of a different catalyst, reducing the efficacy of this method. == Enzymatic reactions == === Acylations === As with synthetic kinetic resolution procedures, enzymatic acylation kinetic resolutions have seen the broadest application in a synthetic context. Especially important has been the use of enzymatic kinetic resolution to efficiently and cheaply prepare amino acids. On a commercial scale, Degussa's methodology employing acylases is capable of resolving numerous natural and unnatural amino acids. The racemic mixtures can be prepared via Strecker synthesis, and the use of either porcine kidney acylase (for straight chain substrates) or an enzyme from the mold Aspergillus oryzae (for branched side chain substrates) can effectively yield enantioenriched amino acids in high (85-90%) yields. The unreacted starting material can be racemized in situ, thus making this a dynamic kinetic resolution. In addition, lipases are used extensively for kinetic resolution in both academic and industrial settings. Lipases have been used to resolve primary alcohols, secondary alcohols, a limited number of tertiary alcohols, carboxylic acids, diols, and even chiral allenes. Lipase from Pseudomonas cepacia (PSL) is the most widely used in the resolution of primary alcohols and has been used with vinyl acetate as an acylating agent to kinetically resolve the primary alcohols shown below. For the resolution of secondary alcohols, pseudomonas cepecia lipase (PSL-C) has been employed effectively to generate excellent ee's of the (R)-enantiomer
|
{"page_id": 5497456, "title": "Kinetic resolution"}
|
50 pre-industrial cultures. The occurrence of extramarital sex by men is described as "universal" in 6 cultures, "moderate" in 29 cultures, "occasional" in 6 cultures, and "uncommon" in 10 cultures. The occurrence of extramarital sex by women is described as "universal" in 6 cultures, "moderate" in 23 cultures, "occasional" in 9 cultures, and "uncommon" in 15 cultures. Three studies using nationally representative samples in the United States found that between 10 and 15% of women and 20–25% of men engage in extramarital sex. Many of the world's major religions look with disfavor on sexual relations outside marriage. In some non-secular Islamic countries, there are criminal penalties for sexual intercourse before marriage. Sexual relations by a married person with someone other than his/her spouse is known as adultery. Adultery is considered in many jurisdictions to be a crime and grounds for divorce. In some countries, such as Saudi Arabia, Pakistan, Afghanistan, Iran, Kuwait, Maldives, Morocco, Oman, Mauritania, United Arab Emirates, Sudan, Yemen, any form of sexual activity outside marriage is illegal. In some parts of the world, women and girls accused of having sexual relations outside marriage are at risk of becoming victims of honor killings committed by their families. In 2011 several people were sentenced to death by stoning after being accused of adultery in Iran, Somalia, Afghanistan, Sudan, Mali and Pakistan. Practices such as honor killings and stoning continue to be supported by mainstream politicians and other officials in some countries. In Pakistan, after the 2008 Balochistan honour killings in which five women were killed by tribesmen of the Umrani Tribe of Balochistan, Pakistani Federal Minister for Postal Services Israr Ullah Zehri defended the practice. ==== Sexual violence ==== An issue that is a serious concern regarding marriage and which has been the object of international scrutiny is that
|
{"page_id": 19728, "title": "Marriage"}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.