text
stringlengths 5
10.5k
| source
stringlengths 33
146
|
|---|---|
storm drains, watercourses, moving vehicles, and equipment. 6. Furnish containers with enough storage volume at convenient satellite locations for collection of hazardous waste. When full or no longer needed, immediately move the containers to secure, temporary containment facilities. 7. Store hazardous waste and potentially hazardous waste in secure, temporary containment enclosures within secondary containment facilities. The secondary containment facilities must be impervious to the stored materials for a minimum contact time of 72 hours. Locate the temporary enclosures away from public access. Acceptable secure enclosures include a locked, chain-link-fenced area or a lockable shipping container located on the job site until disposal as authorized. 8. Design and construct secondary containment facilities with the capacity to contain the greater of: 8.1. Precipitation from a 24-hour-long, 25-year storm and 10 percent of the aggregate volume of all containers 8.2. Entire volume of the largest container within the facility 9. Cover secondary containment facilities during non–working days and if a storm event is predicted. Secondary containment facilities must be adequately ventilated. SECTION 14 ENVIRONMENTAL STEWARDSHIP 232 10. Keep secondary containment facilities free of accumulated rainwater or spills. After a storm event or a spill or leak, collect the accumulated liquid and place it into storage drums within 24 hours. Handle these liquids as hazardous waste unless testing determines them to be nonhazardous. 11. Do not store incompatible wastes such as chlorine and ammonia in the same secondary containment facility. 12. Provide enough separation between storage containers to allow for cleanup of spills or emergency-response access. Keep storage areas clean, organized, and equipped with supplies appropriate for cleaning up the hazardous wastes being stored. 13. Inspect storage areas at least daily and before and after a storm event. 14. Repair or replace perimeter controls, containment structures, covers, and liners as needed. Do not: 1.
|
{"source": 1498, "title": "from dpo"}
|
Essays on Contest theory Real time monitoring of glutamate flux in neurons by using a self referencing carbon nanotube based biosensor The crossmodal spotlight of visual attention for proximal-distal tactile cueing Total synthesis of in silico designed (+)-discodermolide analogs via vinyl sulfone chemistry Derivation and characterization of zebrafish embryonic germ cell cultures and the effects of kit ligand a Splitting identities: The effects of religion, political identity, interest in science, and personal interest on attitudes about embryonic stem cell research Acute post-ingestive and second-meal effects of almond form on diabetes risk factors Predicting the grief of midlife adults following the death of a parent: The role of meaning reconstruction Deliberative rhetoric and colonial identity in New England, 1632-1646: Miantonomi, Roger Williams, Samuel Gorton, and Edward Winslow Population genetics of the Hessian fly, Mayetiola destructor (Say) Commitment and attachment dimensions: Contributions to adult attachment development Preservice teachers' identity development and participation in a video club focused on mathematical thinking Constructing the new right ethnic: Cultural politics at the intersection of nostalgia and anger Urbanization, agriculture, and economic output: Essays in economic geography One hundred years of solitary light: Rites of passage for modern American and Chinese women writers, 1899-1996 The role of phosphorylation of serine 59 of Lck on T-cell receptor mediated signaling [The effects of The Apple Genomics Project active-learning lessons on high school students' knowledge, motivation and perceptions of learning experiences and teachers' perceptions of teaching experiences]( **Mueller, Kevin**
|
{"source": 3879, "title": "from dpo"}
|
asked that the guidelines clarify that information submitted by contractors and grantees, as well as commenters, may be subject to the guidelines. We agree, and have added another example. COC and CRE also ask that third-party proprietary models seldom or never be used, and that strong robustness checks be employed when they are. DOT agencies seldom, if ever, use third-party proprietary models. Robustness checks in this situation are called for by the OMB guidelines, and we have added language to this effect. ATA asked that the guidelines specifically apply to the Federal Motor Carrier Safety Administration (FMCSA) “SafeStat” system. This is a web-available ranking system for the safety performance of motor carriers. The inputs for the system include data from state as well as FMCSA inspectors. ATA is concerned that if some of the data from state sources is erroneous, there is no present mechanism by which FMCSA can correct it. On the other hand, the state-generated information, while used and disseminated by FMCSA, is not owned or in the hands of FMCSA, making correction problematic at best. We agree with ATA that data quality of the SafeStat system is important and that the system, as a general matter, is covered by these guidelines. However, like other information systems in which the Department inputs and then makes use of data supplied by the states, FMCSA does not own, possess, or control the state-generated data. This makes application of the guidelines’ administrative correction mechanism difficult. Suppose, for example, that a motor carrier contacts FMCSA and says that the SafeStat web site contains inaccurate information about the carrier (e.g., the system says there was a crash involving one of the carrier’s trucks and the carrier denies it). The information came from a local law enforcement agency to a state safety agency, which
|
{"source": 5824, "title": "from dpo"}
|
River. In 1993, those findings were borne out when the town's abandoned main street was swallowed by a massive 17-hectare landslide. On November 30, 1977, the Tuve landslide in western Sweden killed 9 people and destroyed 67 houses. Another famous flow of quick clay in Rissa Municipality, Norway, in 1978 caused about 33 hectares (82 acres) of farmland to liquefy and flow into the lake Botn over a few hours, with the loss of one life. The Rissa slide was well recorded by local citizens and a documentary film was made about it in 1981. On 11 May 2010, quick clay took the lives of a family living in Saint-Jude, Quebec, when the land their house was built on suddenly tumbled down toward the Salvail River. The landslide was so sudden that the family members died where they sat; they had been watching an ice hockey game on television. The slide took out a portion of rural road which took a year to reinstate. On 2 February 2015, a landslide collapsed a pillar on the Skjeggestad Bridge in South-East Norway. The landslide was caused by nearby earthworks. On 3 June 2020, eight buildings were swept into the sea by a landslide in Kråkneset in Alta Municipality in Norway. The landslide was filmed by a resident. There were no casualties, and a dog was rescued from the sea. On 30 December 2020, part of a housing area was swept away by a landslide in the village of Ask in Gjerdrum Municipality in Norway, about 25 kilometres (16 mi) northeast of the capital Oslo. The 300-by-700-metre (980 ft × 2,300 ft) quick clay landslide wrecked several houses and killed 10 people. On 23 September 2023, near the town of Stenungsund, Sweden, an area of c. 15 hectares (37 acres) was affected by
|
{"page_id": 1770024, "title": "Quick clay"}
|
ant communities in the Sonoran Desert. Four ant species (Camponotus atriceps, Pheidole sciophila, and Pheidole titanis) "were associated with tree habitats, whereas Pheidole sp. A was associated with open areas". In the Sonoran Desert, ant species are greater than in the Mojave Desert, Chihuahuan Desert, or Chihuahuan desert grassland, and that is due to greater precipitation. When rainfall increases, so does the ant diversity. == See also == Nurse log == References ==
|
{"page_id": 60579726, "title": "Nurse plant"}
|
a brass mounting plate that can be temperature-controlled and then covered with an acrylic glass cover that has a tapered mouth. The tapered mouth is aligned above a vial containing detergent solution. The mounting plate is then placed atop a solenoid activated every 30 minutes. The vials of detergent are placed in a circular tray that is rotated at a rate of one vial per hour. The activation allows the mounting plate to be lifted and dropped against a rubber stopper that shakes out all of the emerging flies from the last 30 minutes into the vial of detergent. Researchers counted the number of flies in each vial to determine the times of day where eclosion activity was highest. Pittendrigh used this model to demonstrate that the circadian clock in drosophila is temperature-compensated (meaning its period is stable over a broad range of temperatures) and to design an early theoretical model for phase response curves. The bang box was the primary means of investigation in chronobiology in the 1960s and 1970s. The application of this technique includes, but is not limited to: determining the impact of external stimuli on flies' internal biological clock, measuring the circadian rhythm of eclosion, and defining how gene alleles such as period genes contribute to the presence or shifts in the Drosophila circadian rhythm. The bang box allows for visualization of what happens to circadian rhythms when a gene gets knocked out. Using this method, the researchers were able to collect a large data sample on the number of eclosed individuals every fixed time period. Furthermore, the bang box was used by Pittendrigh earlier to conclude that the oscillation phase assay is affected by the phase response curve. Later research builds on this relationship in order to use eclosion assays to study circadian rhythms. For
|
{"page_id": 73515834, "title": "Eclosion assay"}
|
"Let none ignorant of geometry enter here." However, the story is considered to be untrue. Though he was not a mathematician himself, his views on mathematics had great influence. Mathematicians thus accepted his belief that geometry should use no tools but compass and straightedge – never measuring instruments such as a marked ruler or a protractor, because these were a workman's tools, not worthy of a scholar. This dictum led to a deep study of possible compass and straightedge constructions, and three classic construction problems: how to use these tools to trisect an angle, to construct a cube twice the volume of a given cube, and to construct a square equal in area to a given circle. The proofs of the impossibility of these constructions, finally achieved in the 19th century, led to important principles regarding the deep structure of the real number system. Aristotle (384–322 BC), Plato's greatest pupil, wrote a treatise on methods of reasoning used in deductive proofs (see Logic) which was not substantially improved upon until the 19th century. === Hellenistic geometry === ==== Euclid ==== Euclid (c. 325–265 BC), of Alexandria, probably a student at the Academy founded by Plato, wrote a treatise in 13 books (chapters), titled The Elements of Geometry, in which he presented geometry in an ideal axiomatic form, which came to be known as Euclidean geometry. The treatise is not a compendium of all that the Hellenistic mathematicians knew at the time about geometry; Euclid himself wrote eight more advanced books on geometry. We know from other references that Euclid's was not the first elementary geometry textbook, but it was so much superior that the others fell into disuse and were lost. He was brought to the university at Alexandria by Ptolemy I, King of Egypt. The Elements began with definitions
|
{"page_id": 11953, "title": "History of geometry"}
|
i = 0 1 n i exp ( β α i ϕ ) = exp ( β ϕ ) + exp ( − β ϕ ) . {\displaystyle \sum _{i=0}^{1}n_{i}\exp(\beta \alpha _{i}\phi )=\exp(\beta \phi )+\exp(-\beta \phi ).} Then if β {\displaystyle \beta } is purely imaginary, β = i b {\displaystyle \beta =ib} with b {\displaystyle b} real and, without loss of generality, positive, then this is 2 cos ( b ϕ ) {\displaystyle 2\cos(b\phi )} . The Lagrangian is then L = 1 2 ∂ μ ϕ ∂ μ ϕ + 2 m 2 b 2 cos ( b ϕ ) , {\displaystyle {\mathcal {L}}={\frac {1}{2}}\partial _{\mu }\phi \partial ^{\mu }\phi +{\frac {2m^{2}}{b^{2}}}\cos(b\phi ),} which is the sine-Gordon Lagrangian. == References == Mussardo, Giuseppe (2009), Statistical Field Theory: An Introduction to Exactly Solved Models in Statistical Physics, Oxford University Press, ISBN 978-0-199-54758-6
|
{"page_id": 1350841, "title": "Toda field theory"}
|
of variation as 0.057 magnitudes. == References ==
|
{"page_id": 30479733, "title": "Chi2 Orionis"}
|
collapse. One class that is expected to have no more than a few thousand years before exploding are the WO Wolf–Rayet stars, which are known to have exhausted their core helium. Only eight of them are known, and only four of those are in the Milky Way. A number of close or well-known stars have been identified as possible core collapse supernova candidates: the high-mass blue stars Spica, Rigel and Deneb, the red supergiants Betelgeuse, Antares, and VV Cephei A; the yellow hypergiant Rho Cassiopeiae; the luminous blue variable Eta Carinae that has already produced a supernova impostor; and both components, a blue supergiant and a Wolf–Rayet star, of the Regor or Gamma Velorum system. Mimosa, Acrux and Hadar or Beta Centauri, three bright star systems in the southern constellation of Crux and Centaurus respectively, each contain blue stars with sufficient masses to explode as supernovae. Others have gained notoriety as possible, although not very likely, progenitors for a gamma-ray burst; for example WR 104. Identification of candidates for a type Ia supernova is much more speculative. Any binary with an accreting white dwarf might produce a supernova, although the exact mechanism and timescale is still debated. These systems are faint and difficult to identify, but the novae and recurrent novae are such systems that conveniently advertise themselves. One example is U Scorpii. == See also == Kilonova – Neutron star merger List of supernovae List of supernova remnants List of supernova candidates Quark-nova – Hypothetical violent explosion resulting from conversion of a neutron star to a quark star Superluminous supernova – Supernova at least ten times more luminous than a standard supernova Supernovae in fiction Timeline of white dwarfs, neutron stars, and supernovae – Chronological list of developments in knowledge and records Collapsar – Star that has undergone gravitational
|
{"page_id": 27680, "title": "Supernova"}
|
his award-winning documentaries The Sea Around Us and The Animal World. In May 1955, Allen announced he would write, produce and direct a film based on the book, and Warner Bros. agreed to distribute the film. Jack Warner announced that 42 nations would be represented. Allen said securing the rights was "very complicated." In March 1956, Allen said the film had been in preproduction for a year and that filming would start in June. The original intention was for only two actors to appear in the film, a man and a woman representing mankind through the ages. The film would take over two years to shoot in 18 countries, and Warner Bros. invited several prominent theologians, historians and philosophers to an advisory board for the production. This plan was soon jettisoned. Allen finished a script with Charles Bennett by August 1956. === Casting === Allen wanted an all-star cast to play various people in history. This casting strategy had recently proved very popular in Around the World in 80 Days. "Where we can't do justice to a time and place we won't just brush them off summarily," said Allen, "We just won't use them. There have been 400 or more giants of history in all our fields. Our big problem has been to bring them down to about 50, asking about each: was what he or she did lasting - and how long did it last? Telling history on the screen can be like telling a bad joke twice. You first have to find a handle, a gimmick." The first four names cast were Vincent Price, Cedric Hardwicke, Diana Lynn (as Joan of Arc) and Peter Lorre. Next were Ronald Colman, Yvonne de Carlo (as Cleopatra), Charles Coburn and Hedy Lamarr, who replaced Lynn as Joan of Arc. Groucho Marx
|
{"page_id": 4868957, "title": "The Story of Mankind (film)"}
|
rate of the medium (for fluids like seawater or air). The heat transfer in fluids depends on the fluid velocity, and the response usually varies over time scales. The measurements of the temperature response to heating may be used to discriminate different layers within the air-snow-ice-ocean system. The thermistor chain is usually installed in a standard hole produced by a 2-inch auger. A weight is attached to the bottom end to keep it straight. The data is typically returned after each sample using the Iridium SBD system, while some buoys require manual data collection. During the deployment, the manual measurements of snow thickness, ice draft and freeboard, and location of IMB sensors are usually made. The IMB deployment disturbs the system around sea ice. For example, snow may have poor contact with the thermistor chain. Additionally, the 2-inch hole may refreeze very slowly if the air temperatures are high or the snow is deep. In summer, the presence of the chain may lead to additional solar energy absorption, which may influence the rates of snow and ice melt. == Usage in research == IMBs were used in several Arctic and Antarctic expeditions, including the SHEBA expedition in Beaufort Gyre, N-ICE2015 expedition north of Svalbard, and the MOSAiC expedition across Transpolar drift. The usage of IMBs revealed that in the Central Arctic regions with high sea ice concentration, surface and bottom ice melt are comparable. In contrast, in regions with low sea ice concentration, the amount of ice bottom melt is substantially larger. IMBs can also be used to show spatial and temporal variability of sea ice growth and melt, also providing an estimate of ocean heat fluxes. They can also be used for studying pressure ridges for analysis of their winter consolidation rates, for analysis of ridge consolidation during their
|
{"page_id": 74375642, "title": "Ice mass balance buoy"}
|
ZetaGrid was at one time the largest distributed computing project, designed to explore the non-trivial roots of the Riemann zeta function, checking over one billion roots a day. Roots of the zeta function are of particular interest in mathematics; a single root out of alignment would disprove the Riemann hypothesis, with far-reaching consequences for all of mathematics. The project ended in November 2005 due to instability of the hosting provider. The first more than 1013 zeroes were checked. The project administrator stated that after the results were analyzed, they would be posted on the American Mathematical Society website. The official status remains unclear, however, as it was never published nor independently verified. This is likely because there was no evidence that each zero was actually computed, as there was no process implemented to check each one as it was calculated. == References == == External links == Home page (Web archive)
|
{"page_id": 2848762, "title": "ZetaGrid"}
|
any product which proves to be defective within limited warranty. For any product believed to be defective within limited warranty. first write or call dealer from whom the product was purchased. Dealer will give additional directions. If unable to resolve satisfactorily, write to Dayton at address below, giving dealer's name, address, date, and number of dealer's invoice, and describing the nature of the defect Title and risk of loss pass to buyer on delivery to common carrier. If product was damaged in transit to you, file claim with carrier. ManufactuFPd f o r Dayton Electric M f g . Co.. 5959 w. Howard St.. Niles, lllinois 60714 u.S.A. Manufactured for Dayton Electric Mfg. Co. Niles, Illinois 60714 U.S.A. 2OPERATING INSTRUCTIONS & PARTS MANUP2L # GAS UNlT HEATERS WlTH ELECTRONIC IGNITIONS MODELS 3E366C THRU 3E368C, 3E369B THRU 3E375B, 3E379C THRU 3E381 C, 3E382B THRU 3E386B, 3E4065 & 3E407B FORM 552486 > 08262 > 0993126711.5M READ CAREFULLY BEFORE ATTEMPTING TO ASSEMBLE, INSTALL, OPERATE OR MAINTAIN THE PRODUCT DESCRIBED. PROTECT YOURSELF AND OTHERS BY OBSERVING ALL SAFETY INFORMATION. FAILURE TO COMPLY WlTH INSTRUCTIONS COULD RESULT IN PERSONAL INJURY AND/OR PROPERTY'DAMAGE! RETAIN INSTRUCTIONS FOR FUTURE REFERENCE. Description Dayton .gas unit heaters are factory assembled, low static pressure type, propeller fan heaters desi ned to be suspended within the space to be heated. PHEsE HEATERS ARE NOT TO BE CONNECTED TO DUCT- WORK. These units are certified by AGA/CGA. All models provide a minimum of 80% thermal efficiency. DO NOT MODIFY THESE GAS UNlT HEATERS IN ANY WAY! NOTE: This equipment has been test fired and inspected. It has been shipped free from defects from our factory. However, during shipment and installation, problems such as loose wires, leaks or loose fasteners may occur. It i s the installer's responsibility t o inspect andcorrect any problem
|
{"source": 957, "title": "from dpo"}
|
tasks. 6.3.1 Consider the following binary search algorithm (a classic divide and conquer algorithm) that searches for a value X in a sorted N-element array A and returns the index of matched entry: > BinarySearch(A[0..N−1], X) { low = 0 high = N −1 while (low X) high = mid −1 else if (A[mid] Next, assume that Y is equal to N. How would this affect your conclusions in your previous answer? If you were tasked with obtaining the best speedup factor possible (i.e., strong scaling), explain how you might change this code to obtain it. 6.4 Consider the following piece of C code: > for (j=2;j 6.16 Exercises 565 566 Chapter 6 Parallel Processors from Client to Cloud The MIPS code corresponding to the above fragment is: addiu $s2,$zero,7992 addiu $s1,$zero,16 loop: l.d $f0, 16($s1) l.d $f2, 8($s1) add.d $f4, $f0, $f2 s.d $f4, 0($s1) addiu $s1, $s1, 8bne $s1, $s2, loop Instructions have the following associated latencies (in cycles): > add.d l.d s.d addiu > 4612 6.4.1 How many cycles does it take for all instructions in a single iteration of the above loop to execute? 6.4.2 When an instruction in a later iteration of a loop depends upon a data value produced in an earlier iteration of the same loop, we say that there is a loop carried dependence between iterations of the loop. Identify the loop-carried dependences in the above code. Identify the dependent program variable and assembly-level registers. You can ignore the loop induction variable j. 6.4.3 Loop unrolling was described in Chapter 4. Apply loop unrolling to this loop and then consider running this code on a 2-node distributed memory
|
{"source": 2304, "title": "from dpo"}
|
Columbia Accident Investigation Board (CAIB) Report , 6 volumes: Aug. 26, Oct. 2003. > > html NASA. Diaz Report, A Renewed Commitment to Excellence : An Assessment of the NASA Agency- wide Applicability of the Columbia Accident Investigation Board Report , January 30, 2004. Mr. Al Diaz, Director, Goddard Space Flight Center, and team. International Organization for Standardization (ISO) 9000:2015, Quality management sys - tems – Fundamentals and vocabulary . Geneva: International Organization for Standardization, 2015. Section 1.1 Purpose NPR 7123.1. Systems Engineering Processes and Requirements Section 1.2 Scope and Depth NASA Office of Chief Information Officer (OCIO), Information Technology Systems Engineering Handbook Version 2.0 NASA-HDBK-2203, NASA Software Engineering Handbook (February 28, 2013) Section 2.0 Fundamentals of Systems Engineering NPR 7120.5, NASA Space Flight Program and Project Management Requirements NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Management Requirements NPR 7120.8, NASA Research and Technology Program and Project Management Requirements NPR 7123.1, NASA Systems Engineering Processes and Requirements NASA Engineering Network (NEN) Systems Engineering Community of Practice (SECoP), located at Griffin, Michael D., NASA Administrator. “System Engineering and the Two Cultures 261 NASA SYSTEMS ENGINEERING HANDBOOK > References Cited of Engineering.” Boeing Lecture, Purdue University, March 28, 2007. Rechtin, Eberhardt. Systems Architecting of Organizations: Why Eagles Can’t Swim . Boca Raton: CRC Press, 2000. Section 2.1 The Common Technical Processes and the SE Engine NPR 7123.1, NASA Systems Engineering Processes and Requirements Society of Automotive Engineers (SAE) and the European Association of Aerospace Industries (EAAI). AS9100C Quality Management Systems (QMS) – Requirements for Aviation, Space, and Defense Organizations Revision C: January 15, 2009. Section 2.3 Example of Using the SE Engine NPD 1001.0, 2006 NASA Strategic Plan NPR 7120.5, NASA Space Flight Program and Project Management Requirements Section 2.5 Cost Effectiveness Considerations Department of Defense
|
{"source": 4933, "title": "from dpo"}
|
for implementation in hardware or software. Hardware implementations may measure the complexity in terms of gate count or energy consumption, which are important parameters for resource-constrained devices. * The cipher's _performance_ in terms of processing throughput on various platforms, including its memory requirements. * The _cost_ of the cipher refers to licensing requirements that may apply due to intellectual property rights. * The _flexibility_ of the cipher includes its ability to support multiple key sizes and block lengths. Notable block ciphers --------------------- [edit] Lucifer") is generally considered to be the first civilian block cipher, developed at IBM in the 1970s based on work done by Horst Feistel. A revised version of the algorithm was adopted as a U.S. government Federal Information Processing Standard: FIPS PUB 46 Data Encryption Standard (DES).[]( It was chosen by the U.S. National Bureau of Standards (NBS) after a public invitation for submissions and some internal changes by NBS (and, potentially, the NSA). DES was publicly released in 1976 and has been widely used._[citation needed_] DES was designed to, among other things, resist a certain cryptanalytic attack known to the NSA and rediscovered by IBM, though unknown publicly until rediscovered again and published by Eli Biham and Adi Shamir in the late 1980s. The technique is called differential cryptanalysis and remains one of the few general attacks against block ciphers; linear cryptanalysis is another but may have been unknown even to the NSA, prior to its publication by Mitsuru Matsui. DES prompted a large amount of other work and
|
{"source": 6145, "title": "from dpo"}
|
looking into the mechanisms underlying the key receptors on taste cells, and applying this knowledge to the future of medications and artificial food products. Meanwhile, the Taste and Smell Clinic at the University of Connecticut Health Center is integrating behavioral, neurophysiological, and genetic studies involving stimulus concentrations and intensities, in order to better understand taste function. == See also == Anosmia Parosmia == References == == External links == Dysgeusia at NIH
|
{"page_id": 205156, "title": "Dysgeusia"}
|
SMN complex === The snRNAs (U1, U2, U4, U5, and the less abundant U11, U12 and U4atac) quickly interact with the SMN (survival of motor neuron protein); encoded by SMN1 gene) and Gemins 2-8 (Gem-associated proteins: GEMIN2, GEMIN3, GEMIN4, GEMIN5, GEMIN6, GEMIN7, GEMIN8) forming the SMN complex. It is here that the snRNA binds to the SmD1-SmD2-SmF-SmE-SmG pentamer, followed by addition of the SmD3-SmB dimer to complete the Sm ring around the so-called Sm site of the snRNA. This Sm site is a conserved sequence of nucleotides in these snRNAs, typically AUUUGUGG (where A, U and G represent the nucleosides adenosine, uridine and guanosine, respectively). After assembly of the Sm ring around the snRNA, the 5' terminal nucleoside (already modified to a 7-methylguanosine cap) is hyper-methylated to 2,2,7-trimethylguanosine and the other (3') end of the snRNA is trimmed. This modification, and the presence of a complete Sm ring, is recognized by the snurportin 1 protein. === Final assembly of the snRNPs in the nucleus === The completed core snRNP-snurportin 1 complex is transported into the nucleus via the protein importin β. Inside the nucleus, the core snRNPs appear in the Cajal bodies, where final assembly of the snRNPs take place. This consists of additional proteins and other modifications specific to the particular snRNP (U1, U2, U4, U5). The biogenesis of the U6 snRNP occurs in the nucleus, although large amounts of free U6 are found in the cytoplasm. The LSm ring may assemble first, and then associate with the U6 snRNA. === Disassembly of snRNPs === The snRNPs are very long-lived, but are assumed to be eventually disassembled and degraded. Little is known about the degradation process. === Defective assembly === Defective function of the survival of motor neuron (SMN) protein in snRNP biogenesis, caused by a genetic defect in
|
{"page_id": 3768056, "title": "SnRNP"}
|
physics Ensemble (fluid mechanics) – Imaginary collection of notionally identical experiments Ensemble interpretation – Concept in Quantum mechanics Phase space – Space of all possible states that a system can take Liouville's theorem (Hamiltonian) – Key result in Hamiltonian mechanics and statistical mechanics Maxwell–Boltzmann statistics – Statistical distribution used in many-particle mechanics Replication (statistics) – Principle that variation can be better estimated with nonvarying repetition of conditions == Notes == == References == == External links == Monte Carlo applet applied in statistical physics problems.
|
{"page_id": 59052, "title": "Ensemble (mathematical physics)"}
|
Cog sought to cut costs with the diesel, which could make three round trips for the cost of one steam train round trip. In December 2016, the owner of the Cog proposed building a 35-room hotel along the line, about one mile (1.6 km) below the summit and two miles (3.2 km) above the station, to be opened in 2019 for the 150th anniversary of the train. However, the proposal drew opposition due to its location in the alpine zone of the mountain and was shelved. In April 2017, the Bedor family sold its interest in the railway to Wayne Presby, the only remaining member of the original group, which had purchased the railway in 1983. Presby assumed direct management control of the railway in December 2017. In 2021, the railway completed two of the largest improvement projects in its history. The existing 25 lb/yd (12.4 kg/m) rail was replaced with 100 lb/yd (49.6 kg/m) rail and a new 34,000 sq ft (3,159 m2) maintenance facility was completed. The new facility enabled the railway to resume winter operations in 2020. During the winter, the railway operates its trains to Waumbek Station at an elevation of approximately 3,800 feet (1,158 m). === "Devil's shingle" slideboards === In the early days of the railway's construction, the workers wanted to minimize time when climbing and descending the ramp, so they invented slideboards fitting over the cog rack and providing enough room for themselves and their tools. These boards – no two were exactly alike – were approximately 35 in (90 cm) long by 9.8 in (25 cm) wide, made of wood with hand-forged iron and with two long, hardwood handles usually attached at the down-mountain end. The average time for the descent of the mountain using these boards was about 15 minutes. The
|
{"page_id": 379369, "title": "Mount Washington Cog Railway"}
|
j . {\displaystyle E_{ij}=x_{i}{\frac {\partial }{\partial x_{j}}}.} In particular, for the polynomials of the first degree it is seen that: E i j x k = δ j k x i . {\displaystyle E_{ij}x_{k}=\delta _{jk}x_{i}.~~~~~~~~~~~~~~} Hence the action of E i j {\displaystyle E_{ij}} restricted to the space of first-order polynomials is exactly the same as the action of matrix units e i j {\displaystyle e_{ij}} on vectors in C n {\displaystyle \mathbb {C} ^{n}} . So, from the representation theory point of view, the subspace of polynomials of first degree is a subrepresentation of the Lie algebra g l n {\displaystyle {\mathfrak {gl}}_{n}} , which we identified with the standard representation in C n {\displaystyle \mathbb {C} ^{n}} . Going further, it is seen that the differential operators E i j {\displaystyle E_{ij}} preserve the degree of the polynomials, and hence the polynomials of each fixed degree form a subrepresentation of the Lie algebra g l n {\displaystyle {\mathfrak {gl}}_{n}} . One can see further that the space of homogeneous polynomials of degree k can be identified with the symmetric tensor power S k C n {\displaystyle S^{k}\mathbb {C} ^{n}} of the standard representation C n {\displaystyle \mathbb {C} ^{n}} . One can also easily identify the highest weight structure of these representations. The monomial x 1 k {\displaystyle x_{1}^{k}} is a highest weight vector, indeed: E i j x 1 k = 0 {\displaystyle E_{ij}x_{1}^{k}=0} for i < j. Its highest weight equals to (k, 0, ... ,0), indeed: E i i x 1 k = k δ i 1 x 1 k {\displaystyle E_{ii}x_{1}^{k}=k\delta _{i1}x_{1}^{k}} . Such representation is sometimes called bosonic representation of g l n {\displaystyle {\mathfrak {gl}}_{n}} . Similar formulas E i j = ψ i ∂ ∂ ψ j {\displaystyle E_{ij}=\psi _{i}{\frac {\partial
|
{"page_id": 22069816, "title": "Capelli's identity"}
|
NGC 4206 is a spiral galaxy located about 70 million light-years away from Earth in the constellation of Virgo. The galaxy is visible with most moderate amateur telescopes at 13th magnitude. It was discovered by British astronomer William Herschel on 17 April 1784 and is a member of the Virgo Cluster. == References == == External links == Media related to NGC 4206 at Wikimedia Commons
|
{"page_id": 44122992, "title": "NGC 4206"}
|
many years of neglect and several attempts by traffic engineers to remove the structure (including a proposal for the unbuilt Lower Manhattan Expressway that would have required removing the arch), the arch and colonnade were repaired and restored in 2000. ==== Brooklyn plaza ==== The Brooklyn approach to the Manhattan Bridge also contained a terraced plaza with balustrades. The Brooklyn plaza was originally bounded by Sands, Bridge, Nassau, and Jay streets. French designed a pair of 20-short-ton (18-long-ton; 18 t) pylons named Brooklyn and Manhattan on the Brooklyn side of the Manhattan Bridge. These were installed in November 1916. Each pylon measured 12 feet (3.7 m) high and rested on a base 15 feet (4.6 m) off the ground. The statues on each pylon represented French's impressions of life in each borough. The Brooklyn pylon depicted a young woman with a child and symbols of art and progress, while the Manhattan pylon depicted a seated, upright woman with symbols of art and prosperity. There were granite railings and walkways at the base of either pylon. A bas-relief memorializing former mayor William Jay Gaynor was dedicated at the bridge's Brooklyn plaza in 1927; it was relocated in 1939 to the nearby Brooklyn Bridge Plaza. The pylons were relocated to the Brooklyn Museum in 1963. The pylons never constituted a true portal, even when they were in place. Following their removal, the Brooklyn approach did not contain a formal entrance. === Exit list === Access to the Manhattan Bridge is provided by a series of ramps on both the Manhattan and Brooklyn sides of the river. All exits are unnumbered. === Proposed I-478 designation === As early as the 1940s, there had been plans for an expressway running across Manhattan, connecting with the bridge. As part of the Interstate Highway System, the
|
{"page_id": 384805, "title": "Manhattan Bridge"}
|
submitted for Grammy consideration for the best rap song and song of the year. It went viral and gained traction on TikTok and received a positive response from the audience, leading to its official release on Apple Music, Spotify, and YouTube in April 2023. Many believed the track was fully composed by an AI software, but the producer claimed the songwriting, production, and original vocals (pre-conversion) were still done by him. It would later be rescinded from any Grammy considerations due to it not following the guidelines necessary to be considered for a Grammy award. The track would end up being removed from all music platforms by Universal Music Group. The song was a watershed moment for AI voice cloning, and models have since been created for hundreds, if not thousands, of popular singers and rappers. === "Where That Came From" === In 2013, country music singer Randy Travis suffered a stroke which left him unable to sing. In the meantime, vocalist James Dupré toured on his behalf, singing his songs for him. Travis and longtime producer Kyle Lehning released a new song in May 2024 titled "Where That Came From", Travis's first new song since his stroke. The recording uses AI technology to re-create Travis's singing voice, having been composited from over 40 existing vocal recordings alongside those of Dupré. == Technical approaches == Artificial intelligence music encompasses a number of technical approaches used for music composition, analysis, classification, and suggestion. Techniques used are drawn from deep learning, machine learning, natural language processing, and signal processing. Current systems are able to compose entire musical compositions, parse affective content, accompany human players in real-time, and acquire patterns of user and context-dependent preferences. === Symbolic music composition === Symbolic music generation is the generation of music in discrete symbolic forms such
|
{"page_id": 21659435, "title": "Music and artificial intelligence"}
|
555 (five hundred [and] fifty-five) is the natural number following 554 and preceding 556. == In mathematics == 555 is a sphenic number. In base 10, it is a repdigit, and because it is divisible by the sum of its digits, it is a Harshad number. It is also a Harshad number in binary, base 11, base 13 and hexadecimal. 555 is a Harshad number as 555 ÷ (5, 5, 5) is 555 ÷ 15 is 37. It is the sum of the first triplet of three-digit permutable primes in decimal: 113 + 131 + 311 = 555 {\displaystyle 113+131+311=555} . It is the twenty-sixth number such that its Euler totient (288) is equal to the totient value of its sum-of-divisors: φ ( 555 ) = φ ( σ ( 555 ) ) {\displaystyle \varphi (555)=\varphi (\sigma (555))} . == References == == External links == Media related to 555 (number) at Wikimedia Commons
|
{"page_id": 463989, "title": "555 (number)"}
|
Det Syntetiske Parti (English: The Synthetic Party) is the world's first political party driven by artificial intelligence (AI), founded in May 2022 in Denmark. It aims to represent non-voters and fringe political parties while raising awareness of AI's societal role and exploring how AI can be integrated into democratic processes. == Founder == A philosopher from Aarhus University and a conceptual artist Asker Bryld Staunæs is the party founder and continuous party secretary. == Main goal == The political goals have been machine learned from texts by Danish fringe parties since 1970 and represent the 20 percent of Danes who do not vote in the election. The party is synthetic; as such, many of the policies, such as universal basic income, can be contradictory to one another. == International collaborations == The Synthetic Party has signed bilateral collaboration agreements with the Finnish AI Party and The Japanese AI Party concerning the development of a global project created around artificial intelligence and politics == References ==
|
{"page_id": 72105334, "title": "The Synthetic Party (Denmark)"}
|
activities, resulting in diminished quality and yields, with some farmers even transitioning out of coffee altogether. If the current scenario of low and volatile prices continues, the volume, quality and diversity of the global coffee supply will be severely diminished. 44 Low productivity, low and volatile prices, high production costs and poor access to training, research and development are at the core of this poverty trap, especially for women. If labour productivity can be increased through innovations, then returns to farmers will improve and they will be more likely to remain engaged in the coffee farming sector. Research and technology that can improve yields, access to finance, extension services and enabling policies are some of the solutions to secure a sustainable future for coffee farmers – and the coffee industry at large. # Sharing value: Where do we stand? Historically, value has been inequitably distributed across the supply chain. Several factors are at play that need to be addressed to rectify this imbalance. Volatile and low prices challenge producers The volatility and slump of coffee prices have severe economic and social consequences for producing countries. The most acute symptoms of low and volatile prices on the producers’ side of the value chain are the lack of profit, increase in uncertainty and an inability to flourish. Fair prices that reward quality and offer greater stability and reliability in supply are one way to address this imbalance. Innovation, technology and a range of capacity-building activities are also required to lower the cost of inputs at one end and increase labour productivity at the other. This helps reduce the total cost of production and improve yields. The International Coffee Organization estimates that the coffee retail market generates revenues of more than $200 billion annually. 45 Consumption is highest in Europe, the United States
|
{"source": 1026, "title": "from dpo"}
|
Indeed there is a lot in common between the two disciplines, in terms of both the goals and techniques used. There are, however, a few significant differences of emphasis; if a doctor comes up with the hypothesis that there is a correlation between smoking and heart disease, it is the statistician’s role to view samples of patients and check the validity of that hypothesis (this is the common statistical task of hypothe-sis testing). In contrast, machine learning aims to use the data gathered from samples of patients to come up with a description of the causes of heart disease. The hope is that automated techniques may be able to figure out meaningful patterns (or hypotheses) that may have been missed by the human observer. In contrast with traditional statistics, in machine learning in general, and in this book in particular, algorithmic considerations play a major role. Ma-chine learning is about the execution of learning by computers; hence algorith-mic issues are pivotal. We develop algorithms to perform the learning tasks and are concerned with their computational efficiency. Another difference is that while statistics is often interested in asymptotic behavior (like the convergence of sample-based statistical estimates as the sample sizes grow to infinity), the theory of machine learning focuses on finite sample bounds. Namely, given the size of available samples, machine learning theory aims to figure out the degree of accuracy that a learner can expect on the basis of such samples. There are further differences between these two disciplines, of which we shall mention only one more here. While in statistics it is common to work under the assumption of certain presubscribed data models (such as assuming the normal-ity of data-generating distributions, or the linearity of functional dependencies), in machine learning the emphasis is on working under a “distribution-free” set-ting,
|
{"source": 3334, "title": "from dpo"}
|
35/135 Data Stream Algorithms Algorithm 1 The Misra–Gries frequency estimation algorithm Initialize: 1: A ← (empty associative array) Process (token j) : 2: if j ∈ keys (A) then 3: A[ j] ← A[ j] + 1 4: else if |keys (A)| < k − 1 then 5: A[ j] ← 1 6: else 7: foreach ℓ ∈ keys (A) do 8: A[ℓ] ← A[ℓ] − 1 9: if A[ℓ] = 0 then remove ℓ from A Output (query a) : 10: if a ∈ keys (A) then report ˆ fa = A[a] else report ˆ fa = 0 1.3 Analysis of the Algorithm To process each token quickly, we could maintain the associative array A using a balanced binary search tree. Each key requires ⌈log n⌉ bits to store and each value requires at most ⌈log m⌉ bits. Since there are at most k − 1 key/value pairs in A at any time, the total space required is O(k(log m + log n)) .We now analyze the quality of the algorithm’s output. Pretend that A consists of n key/value pairs, with A[ j] = 0 whenever j is not actually stored in A by the algorithm. Consider the increments and decrements to A[ j]s as the stream comes in. For bookkeeping, pretend that upon entering the loop at line 7, A[ j] is incremented from 0 to 1, and then immediately decremented back to 0. Further, noting that each counter A[ j] corresponds to a set of occurrences of j in the input stream, consider a variant of the algorithm (see Algorithm 2) that explicitly maintains this set. Of course, actually doing so is horribly space-inefficient! Algorithm 2 Thought-experiment algorithm for analysis of Misra–Gries Initialize: 1: B ← (empty associative array) Process (stream-position i, token j) : 2: if
|
{"source": 5222, "title": "from dpo"}
|
máximum outdegree d in the dependency digraph is roughly ( 2) ( fe ™2)- F° r ^gz k and much larger n (which is the case of interest for us) we have d > J^ 1~0(1/fc ); that is, quite a lot of dependencies. On the other hand, if we consider small sets S (e.g., sets of size 3) we observe that out of the total K = Q) of them each shares an edge with only 3(n — 3) « K1/' 3. This suggests that the Local Lemma may be much more significant in improving the off-diagonal Ramsey numbers R(k, £), especially if one of the parameters, say, £, is small. Let us consider, for example, following Spencer (1977), the Ramsey number R(k, 3). Here, of course, we have to apply the nonsymmetric form of the Local Lemma. Let us two-color the edges of Kn randomly and independently, where each edge is colored blue with probability p. For each set of three vértices T, let AT be the event that the triangle on T is blue. Similarly, for each set of k vértices S, let Bs be the event that the complete graph on S is red. Clearly Pr [AT] = p 3 and Pr [Bs] = (1 — p)^ 2'- Construct a dependency digraph for the events AT and Bs by joining two vértices by edges (in both directions) iff the corresponding complete graphs share an edge. Clearly each AT-node of the dependency graph is adjacent to 3(n — 3) < 3n v4y/-nodes and to at most (£) S^'-nodes. Similarly, each i?s-node is adjacent to at most (íj) (n — 2) < k2n/2 ^4 T'-nodes and to at most (£) fís"-nodes. It follows from the general case of the Local Lemma (Lemma 5.1.1) that if we can find
|
{"source": 6424, "title": "from dpo"}
|
Legends Only League to become the media partner for its boxing events, with its inaugural event being an exhibition fight between Tyson and Roy Jones Jr. on November 28, 2020, distributed via pay-per-view. Triller would handle distribution of the fight to pay-per-view platforms and services such as Fite TV, and also carry a documentary miniseries leading into the fight. The PPV would not be carried within the Triller app itself due to its focus on short-form video, and a goal for wider distribution via traditional PPV outlets. Following the event, it was reported that the PPV had at least 1.6 million buys, surpassing UFC 251 as the most-bought combat sports PPV of 2020. Ryan Kavanaugh, CEO of parent company Proxima Media, described the fight as being the launch of Triller's "high-end live events business", and explained that they aimed to reach audiences beyond core boxing fans by leveraging the present "cultural zeitgeist"; the PPV included a co-main event between internet celebrity and boxer Jake Paul and former NBA player Nate Robinson, music performances by acts such as Wiz Khalifa, and featured Snoop Dogg as a commentator. Kavanaugh later referred to this practice as a "four-quadrant" entertainment event, supplementing boxing with internet, music, and sports personalities. === Launch === In December 2020, Triller announced a partnership with Snoop Dogg to form Triller Fight Club—a "boxing league" that would be produced and hosted by Snoop Dogg, and consist of a series of annual PPV cards with "four-quadrant" elements carried over from the Tyson/Jones event. The first event under the banner was held on April 17, 2021, with a main event between Jake Paul and Ben Askren, and performances by The Black Keys, Diplo, Doja Cat, Justin Bieber, Major Lazer, Saweetie, and Mt. Westmore —a supergroup featuring Snoop, Ice Cube, Too Short and
|
{"page_id": 69574153, "title": "Triller (company)"}
|
The Central Institute of Fisheries Technology (CIFT) is an autonomous organization established by the government of India, engaged in research related to fishing and fish processing in the country. The institute has its headquarters in Matsyapuri, Willingdon Island, Kochi and is a subsidiary of Indian Council of Agricultural Research (ICAR), New Delhi, under the Ministry of Agriculture and farmers' Welfare. The Central Institute of Fisheries Technology (CIFT) was formed in 1954 and started functioning in 1957 from its headquarters in Kochi. It is considered to be the only institute where research facilities are available in all disciplines related to fishing and fish processing. CIFT is an ISO/IEC 17025:2005 NABL accredited and ISO 9001:2015 certified body. CIFT has been selected as the seat for the establishment of the south zone Zonal Technology Management – Business Planning and Development (ZTM-BPD) Unit for catering to the individual and collective needs of 22 agricultural institutes of ICAR in south India. == Mandate == Basic and strategic research in fishing and processing, bioactive compounds & food safety Design and develop energy efficient fishing systems for responsible fishing and sustainable management Development of implements and machinery for fishing and fish processing Human resource development through training, education and extension == Objectives == Basic and strategic research in fishing and processing. Design and develop energy efficient fishing systems for responsible fishing and sustainable management Development of implements and machinery for fishing and fish processing. Human resource Development through training, education and extension. == Divisions == The institute has six divisions and one section that coordinates its activities across various disciplines. Fishing Technology Division. Fish Processing Division. Biochemistry & Nutrition Division. Quality Assurance & Management Division. Extension, Information & Statistics Division. Microbiology, Fermentation and Biotechnology Division. Engineering Section. == Research centers == CIFT has three research centers in
|
{"page_id": 43033311, "title": "Central Institute of Fisheries Technology"}
|
sulfur to form a brown and eventually black surface layer of copper sulfide which, if regularly exposed to slightly acidic water such as urban rainwater, can then oxidize in air to form a patina of green-blue copper carbonate. Depending on how the patina layer was formed, it may protect the underlying brass from further damage. Although copper and zinc have a large difference in electrical potential, the resulting brass alloy does not experience internalized galvanic corrosion because of the absence of a corrosive environment within the mixture. However, if brass is placed in contact with a more noble metal such as silver or gold in such an environment, the brass will corrode galvanically; conversely, if brass is in contact with a less-noble metal such as zinc or iron, the less noble metal will corrode and the brass will be protected. == Lead content == To enhance the machinability of brass, lead is often added in concentrations of about 2%. Since lead has a lower melting point than the other constituents of the brass, it tends to migrate towards the grain boundaries in the form of globules as it cools from casting. The pattern the globules form on the surface of the brass increases the available lead surface area which, in turn, affects the degree of leaching. In addition, cutting operations can smear the lead globules over the surface. These effects can lead to significant lead leaching from brasses of comparatively low lead content. In October 1999, the California State Attorney General sued 13 key manufacturers and distributors over lead content. In laboratory tests, state researchers found the average brass key, new or old, exceeded the California Proposition 65 limits by an average factor of 19, assuming handling twice a day. In April 2001 manufacturers agreed to reduce lead content to
|
{"page_id": 3292, "title": "Brass"}
|
PR interval, then eventually disappearance of the P wave, widening of the QRS complex, and finally, asystole. This process can occur in the span of 30 to 60 seconds, but there have been cases of 'botched' procedures, leading to one inmate gasping for air for approximately 10 to 13 minutes. ==== Sodium thiopental ==== Lethal injection dosage: 2–5 grams Sodium thiopental (US trade name: Sodium Pentothal) is an ultra-short acting barbiturate, often used for anesthesia induction and for medically induced coma. The typical anesthesia induction dose is 0.35 grams. Loss of consciousness is induced within 30–45 seconds at the typical dose, while a 5 gram dose (14 times the normal dose) is likely to induce unconsciousness in 10 seconds. A full medical dose of thiopental reaches the brain in about 30 seconds. This induces an unconscious state. Five to twenty minutes after injection, approximately 15% of the drug is in the brain, with the rest in other parts of the body. The half-life of this drug is about 11.5 hours, and the concentration in the brain remains at around 5–10% of the total dose during that time. When a 'mega-dose' is administered, as in state-sanctioned lethal injection, the concentration in the brain during the tail phase of the distribution remains higher than the peak concentration found in the induction dose for anesthesia, because repeated doses—or a single very high dose as in lethal injection—accumulate in high concentrations in body fat, from which the thiopental is gradually released. This is the reason why an ultra-short acting barbiturate, such as thiopental, can be used for long-term induction of medical coma. Historically, thiopental has been one of the most commonly used and studied drugs for the induction of coma. Protocols vary for how it is given, but the typical doses are anywhere from
|
{"page_id": 62745, "title": "Lethal injection"}
|
number of those cause most cases of Wilson's disease; which mutation an individual will have tends to be specific to the population they are part of. For instance, in Western populations, the H1069Q mutation (replacement of a histidine by a glutamine at position 1069 in the protein) is present in 37%–63% of cases, while in China this mutation is very uncommon; R778L (arginine to leucine at 778) is found more often there. Relatively little is known about the relative impact of the various mutations, although the H1069Q mutation seems to predict later onset and predominantly neurological problems, according to some studies. A comprehensive clinically annotated resource, WilsonGen, provides a clinical classification for the variants as per the recent ACMG & AMP guidelines. A normal variation in the PRNP gene can modify the course of the disease by delaying the age of onset and affecting the type of symptoms that develop. This gene produces prion protein, which is active in the brain and other tissues and also appears to be involved in transporting copper. A role for the ApoE gene was initially suspected, but could not be confirmed. The condition is inherited in an autosomal recessive pattern. To inherit it, both of the parents of an individual must carry an affected gene. Most people with Wilson's disease have no family history of the condition. People with only one abnormal gene are called carriers (heterozygotes) and may have mild, but medically insignificant, abnormalities of copper metabolism. There are several hereditary diseases that cause copper overload in the liver; Wilson's disease is the most common of them. All can cause cirrhosis at a young age. The other copper overload diseases are Indian childhood cirrhosis (ICC), endemic Tyrolean infantile cirrhosis, and idiopathic copper toxicosis. These three, unlike Wilson's disease, are not related to ATP7B
|
{"page_id": 60138, "title": "Wilson's disease"}
|
An incumbent local exchange carrier (ILEC) is a local telephone company which held the regional monopoly on landline service before the market was opened to competitive local exchange carriers, or the corporate successor of such a firm, in the United States and Canada. == Definition == An incumbent local exchange carrier is a local exchange carrier (LEC) in a specific area that on the date of enactment of the Telecommunications Act of 1996, provided telephone exchange service on the date of enactment, was deemed to be a member of the National Exchange Carrier Association pursuant to the Code of Federal Regulations (C.F.R) Title 47, section 69.601(b). or is a person or entity that, on or after such date of enactment, became a successor or assignee of a member described in the previous bullet. The Federal Communications Commission (FCC) may, by rule, provide for the treatment of an LEC (or class or category thereof) as an ILEC if: such carrier occupies a position in the market for telephone exchange service within an area that is comparable to the position occupied by a carrier described previously such carrier has substantially replaced an ILEC described previously such treatment is consistent with the public interest, convenience and necessity == Duties == ILECs have the same duties as a LEC and in addition: Duty to negotiate – The duty to negotiate in good faith the particular terms and conditions of agreements to fulfill the duties described for a LEC and the specific ones for the ILEC. The requesting telecommunications carrier also has the duty to negotiate in good faith the terms and conditions of such agreements. Interconnection – The duty to provide, for the facilities and equipment of any requesting telecommunications carrier, interconnection with the LEC's network – For the transmission and routing of telephone
|
{"page_id": 620244, "title": "Incumbent local exchange carrier"}
|
winning the lottery, or having an accident) into context. For example if one out of 17 million tickets is a winner, then the surprisal of winning from a single random selection is about 24 bits. Tossing 24 coins a few times might give you a feel for the surprisal of getting all heads on the first try. The additive nature of this measure also comes in handy when weighing alternatives. For example, imagine that the surprisal of harm from a vaccination is 20 bits. If the surprisal of catching a disease without it is 16 bits, but the surprisal of harm from the disease if you catch it is 2 bits, then the surprisal of harm from NOT getting the vaccination is only 16+2=18 bits. Whether or not you decide to get the vaccination (e.g. the monetary cost of paying for it is not included in this discussion), you can in that way at least take responsibility for a decision informed to the fact that not getting the vaccination involves more than one bit of additional risk. More generally, one can relate probability p to bits of surprisal sbits as probability = 1/2sbits. As suggested above, this is mainly useful with small probabilities. However, Jaynes pointed out that with true-false assertions one can also define bits of evidence ebits as the surprisal against minus the surprisal for. This evidence in bits relates simply to the odds ratio = p/(1-p) = 2ebits, and has advantages similar to those of self-information itself. == Applications in games of chance == Information theory can be thought of as a way of quantifying information so as to make the best decision in the face of imperfect information. That is, how to make the best decision using only the information you have available. The point of
|
{"page_id": 5642853, "title": "Gambling and information theory"}
|
from several themes. 18th and 19th century scientists, engineers and inventors: Matthew Boulton; Henry Cavendish; Thomas Hawksley; Hunter; Lord Kelvin; John McAdam; Munro; William Murdoch; James Watt. Sailing vessels: Ketch; Schooner. A Norfolk castle: Caister. Personal names: Katy, Rita. Gemstone: Topaz (cf. Amethyst gas field). == Developments == The gas fields were developed through an array of platforms and subsea facilities. These were as shown in the following table, together with data on the peak rate and cumulative production of gas in million cubic metres (mcm). In addition to the gas pipelines there was also a methanol distribution system. Methanol/corrosion inhibitor was pumped from TGT through a 4-inch pipeline to Murdoch MD. From here it was distributed to the platforms and wellheads through 3-inch and 2-inch pipelines. New pipeline reception facilities and process plant was installed at TGT as part of the CMS development. === Production === The production profile, in mcm/y, of the Murdoch field was as shown. === Gas compression === Wellhead gas from the individual fields was routed to either the Suction, the Interstage or the Discharge Manifold on Murdoch MC depending on its pressure. Gas from the Suction Manifold was routed to the Suction Slug Catcher where liquids were removed. Gas flowed successively to the LP Suction Scrubber, the First Stage Gas Compressor and the Intercooler. Here it was comingled with gas from the Interstage Manifold which had flowed through the Interstage Slug Catcher. The combined flow was routed to the Interstage Scrubber, the Second Stage Gas Compressor and the Export Gas Cooler. Gas was returned to the MD platform and to the Theddlethorpe trunk line. Recovered liquids were injected into the trunk line. To increase the compression capacity a compressor module was added to the Murdoch MC platform in 2003. === Telecommunications === Murdoch MD
|
{"page_id": 69382163, "title": "Caister Murdoch System gas fields"}
|
∈ H ( E ) . {\displaystyle \langle F,G\rangle _{{\mathcal {H}}(E)}:=\sum _{(x_{i},x_{j})\in E}F(x_{i},x_{j})G(x_{i},x_{j}),\quad \forall F,G\in {\mathcal {H}}(E).} Additionally, for any edge function F ∈ H ( V ) {\displaystyle F\in {\mathcal {H}}(V)} the ℓ p {\displaystyle \ell _{p}} -norm and ℓ ∞ {\displaystyle \ell _{\infty }} -norm of F {\displaystyle F} are defined as: ‖ F ‖ p = { ( ∑ ( x i , x j ) ∈ E | F ( x i , x j ) | p ) 1 p for 1 ⩽ p < ∞ , max ( x i , x j ) ∈ E | F ( x i , x j ) | , for p = ∞ . {\displaystyle \|F\|_{p}={\begin{cases}\left(\sum _{(x_{i},x_{j})\in E}|F(x_{i},x_{j})|^{p}\right)^{\frac {1}{p}}&{\text{ for }}1\leqslant p<\infty \ ,\\\max _{(x_{i},x_{j})\in E}|F(x_{i},x_{j})|,&{\text{ for }}p=\infty \ .\end{cases}}} The ℓ 2 {\displaystyle \ell _{2}} -norm is induced by the inner product. If one extends the edge set E {\displaystyle E} in a way such that E = V × V {\displaystyle E=V\times V} than it becomes clear that H ( E ) ≅ R n × n {\displaystyle {\mathcal {H}}(E)\cong \mathbb {R} ^{n\times n}} because H ( V ) ≅ R n {\displaystyle {\mathcal {H}}(V)\cong \mathbb {R} ^{n}} . This means that each edge function can be identified with a linear matrix operator. == Differential graph operators == An important ingredient in the calculus on finite weighted graphs is the mimicking of standard differential operators from the continuum setting in the discrete setting of finite weighted graphs. This allows one to translate well-studied tools from mathematics, such as partial differential equations and variational methods, and make them usable in applications which can best be modeled by a graph. The fundamental concept which makes this translation possible is the graph gradient, a first-order difference operator
|
{"page_id": 61556353, "title": "Calculus on finite weighted graphs"}
|
John Maron Abowd (born December 22, 1951) is the associate director for research and methodology and chief scientist of the US Census Bureau, where he serves on leave from his position as the Edmund Ezra Day Professor of Economics, professor of information science, and member of the Department of Statistical Science at Cornell University. At Cornell, Abowd has taught and conducted research since 1987, including seven years on the faculty of the Johnson Graduate School of Management. Abowd is best known for his contributions in the field of labor economics, and in particular his work in creating, disseminating, and using longitudinal employee-employer matched data. == Career == Abowd received a BA in economics (with highest honors) from the University of Notre Dame in 1973 and a PhD in economics from the University of Chicago in 1977, under supervision of Arnold Zellner. Prior to arriving at Cornell University in 1987, Abowd served on the faculty at Princeton University, the University of Chicago, and the Massachusetts Institute of Technology. In addition to his professorship at Cornell University, Abowd is currently a research associate at the National Bureau of Economic Research (NBER), a research affiliate at the Centre de Recherche en Economie et Statistique (CREST), and a research fellow at the Institute for the Study of Labor (IZA). Abowd is also the director of the Labor Dynamics Institute (LDI) at Cornell. Abowd is the 2014 president of the Society of Labor Economists. He was chair in 2013 for the Business and Economic Statistics Section and fellow of the American Statistical Association. He is an elected member of the International Statistical Institute (2012). Abowd served as a distinguished senior research fellow at the United States Census Bureau from 1998 to 2012. He also served on the National Academies' Committee on National Statistics from 2010
|
{"page_id": 39313783, "title": "John M. Abowd"}
|
of 3 cuts for every 1,000 sq ft of coating. Surfaces must exhibit no peeling or delamination. Test coating adhesion to steel before applying seal coating. Thermal spray coating must have an adhesion to substrate of at least 850 psi. Perform 3 tests for every 200 sq ft of coating. Repair areas represented by tests failing adhesion or cut testing by removing and reapplying coating. 59-5.02 MATERIALS Abrasives must be (1) slag or mineral abrasive or (2) steel or recycled steel. Wire feedstock must be 85/15 Zn/Al complying with ASTM B833. Seal coat paint must be authorized before use. 59-5.03 CONSTRUCTION Do not apply coating when the steel surface temperature is less than 32 degrees F. Prepare the surfaces under section 59-2.01C(3)(a). Blast clean surfaces under SSPC-SP 10/NACE no. 2. Surfaces must have a sharp, angular anchor pattern of from 2.5 to 4.0 mils. Reblast surfaces that rust or become contaminated before coating is applied. Apply coating using arc-spray equipment within 6 hours of starting blast cleaning. Coating thickness must be 10 ± 2 mils. Coating thickness on faying surfaces must be not more than 10 mils. SECTION 59 STRUCTURAL STEEL COATINGS 854 Apply a seal coating to thermal spray-coated surfaces. Apply the seal coat within 6 hours of applying the thermal spray coating. Dry film thickness must be from 1.5 to 2.0 mils. Do not apply the seal coating to faying surfaces. You may field weld thermal spray-coated surfaces if authorized in advance. Remove thermal spray coating from weld locations by blast cleaning under SSPC-SP 10/NACE no. 2 or with power tools under SSPC-SP 11 immediately before welding. Recoat welded connections after fabrication. Repair test areas of thermal spray coating that meet adhesion and cut test requirements with 2 coats of organic zinc-rich primer. 59-5.04 PAYMENT Not Used 59-6–59-15
|
{"source": 1498, "title": "from dpo"}
|
reoccurrence reopen reopened reopening reopens reorder reordered reordering reorders reorganization reorganizational reorganizationist reorganize reorganized reorient reorientate reorientated reorientates reorientating reorientation reoriented reoxidize reoxidizes reoxygenize reoxygenizes rep repack repackage repackaged repackager repackages repackaging repacked repacker repacking repacks repaganization repaganize repaganizer repaganizers repaganizes repaid repaint repainted repainter repainters repainting repaints repair repairability repairable repaired repairer repairers repairing repairman repairmen repairs repand reparable reparation reparations reparation's reparative repartee repartition repartitioned repartitioner repartitioners repartitioning repartitions repass repassage repassivation repast repasts repast's repatriate repatriated repatriates repatriating repatriation repatriations repatronize repatronizes repaving repay repayable repaying repayment repayments repays repeal repealable repealed repealer repealing repeals repeat repeatability repeatable repeated repeatedly repeater repeaters repeating repeats repechage repel repellant repelled repellency repellent repellently repeller repelling repels repent repentance repentant repentantly repented repenter repenting repents repercussion repercussions repercussion's repercussive repersonalize repertoire repertory repetend repetition repetitional repetitions repetition's repetitious repetitiously repetitiousness repetitive repetitively repetitiveness rephosphorization rephosphorizations rephosphorization's rephosphorize rephrase rephrased rephrases rephrasing repine repined repiner repining replace replaceable replaced replacement replant replanted replay replayed replaying replays repleader replenish replenished replenisher replenishes replenishing replenishment replenishments replete repleteness repletion repleviable replevied replevies replevin replevy replica replicable replicas replica's replicate replicated replicates replicating replication replications replicative replicator replicators replied replier replies reply replying repoint repolymerization repolymerizations repolymerization's repolymerize repone repopularize report reportable reportage reported reportedly reporter reporters reporting reportorial reportorially reports reposal repose reposed reposeful reposefully reposefulness reposes reposing reposit reposited repositing reposition repositories repository repository's repossess repossession repost reposted reposter reposting repostings reposts repot repower reprehend reprehensibility reprehensible reprehensibleness reprehensibly reprehension reprehensive represent representable representably representation representational representationalism representationalist representationally representative representatively representativeness representatives representativity represented representer representing represents repress repressed represses repressibility repressible repressing repression repressionist repressions repression's repressive repressively repressiveness repressor reprieval reprieve reprieved reprieves reprieving reprimand reprimanded reprint reprinted reprinter reprinting reprints reprisal reprisals reprisal's reprise reprised reprising repristinate repristination
|
{"source": 3879, "title": "from dpo"}
|
trap is a special input to the CPU which includes an address, called an interrupt vector , in an interrupt vector table . The interrupt table gives the location of the program which deals with the condition specified in the trap. This program is called the interrupt handler . When a trap occurs, the system saves its current state on the stack and then executes the interrupt handler (Figure 6.5). In this way, control is taken away from the user program. The interrupt handler has to make sure that the system is restored to 96 6 REFERENCE MONITORS memory interrupt vector table interrupt interrupt handler n 10interrupt vector TRAP # n Figure 6.5: Processing of an Interrupt a proper state, e.g. by clearing the supervisor status bit, before returning control to the user program. It is possible for a further interrupt to arrive while the processor deals with a current interrupt. The processor may then have to interrupt the current interrupt handler. Improper handling of such a situation can lead to security flaws. On early PCs, a user could interrupt the execution of a program by pressing CTRL-C so that the processor returns to the operating system prompt with the status bit of the current process. A user could then enter supervisor mode by interrupting the execution of an operating system call. It is therefore important that before executing a program, the interrupt table is set up so that interrupts will be handled in an appropriate way. From this discussion, it should be clear that the interrupt table is an interesting point of attack and has to be protected adequately. Changing an entry in the interrupt table so that it points to attack code, which is then executed before jumping to the proper interrupt handler, is one of the strategies
|
{"source": 5831, "title": "from dpo"}
|
Tetra-amido macrocyclic ligands (TAMLs) constitute a class of macrocyclic ligands. When complexed to metals, TAMLs are proposed as environmentally friendly catalysts. Although never commercialized, iron-TAML complexes catalyze the degradation of pesticides, effluent streams from paper mills, dibenzothiophenes from diesel fuels, and anthrax spores. == References ==
|
{"page_id": 4260804, "title": "Tetra-amido macrocyclic ligand"}
|
α-Ketovaleric acid is a keto acid that is found in human blood. Unlike related keto acids, it is not an intermediate or metabolite associated with amino acids and its origin is unknown. == See also == α-Ketoisovaleric acid 3-Oxopentanoic acid (β-ketovaleric acid) Levulinic acid (γ-ketovaleric acid) == References ==
|
{"page_id": 31351153, "title": "Α-Ketovaleric acid"}
|
In pattern recognition, iDistance is an indexing and query processing technique for k-nearest neighbor queries on point data in multi-dimensional metric spaces. The kNN query is one of the hardest problems on multi-dimensional data, especially when the dimensionality of the data is high. iDistance is designed to process kNN queries in high-dimensional spaces efficiently and performs extremely well for skewed data distributions, which usually occur in real-life data sets. iDistance employs a two-phase search strategy involving an initial filtering of candidate regions and a subsequent refinement of results, an approach aligned with the Filter and Refine Principle (FRP). This means that the index first prunes the search space to eliminate unlikely candidates, then verifies the true nearest neighbors in a refinement step, following the general FRP paradigm used in database search algorithms. The iDistance index can also be augmented with machine learning models to learn data distributions for improved searching and storage of multi-dimensional data. == Indexing == Building the iDistance index has two steps: A number of reference points in the data space are chosen. There are various ways of choosing reference points. Using cluster centers as reference points is the most efficient way. The data points are partitioned into Voronoi cells based on well-chosen reference points. The distance between a data point and its closest reference point is calculated. This distance plus a scaling value is called the point's iDistance. By this means, points in a multi-dimensional space are mapped to one-dimensional values, and then a B+-tree can be adopted to index the points using the iDistance as the key. The figure on the right shows an example where three reference points (O1, O2, O3) are chosen. The data points are then mapped to a one-dimensional space and indexed in a B+-tree. Various extensions have been proposed to
|
{"page_id": 18990485, "title": "IDistance"}
|
deposits are formed beside, below or downstream from the ice. They include kames, kame terraces and eskers formed in ice contact and outwash fans and outwash plains below the ice margin. Typically the outwash sediment is carried by fast and turbulent fluvio-glacial meltwater streams, but occasionally it is carried by catastrophic outburst floods. Larger elements such as boulders and gravel are deposited nearer to the ice margin, while finer elements are carried farther, sometimes into lakes or the ocean. The sediments are sorted by fluvial processes. They differ from glacial till, which is moved and deposited by the ice of the glacier, and is unsorted. === Ice-contact deposits === A subglacial megaflood may cut cavities into the base of the ice. As the flood dies down, sediment is deposited into these cavities to form cavity-fill drumlins in cavities aligned with the flow, ribbed terrain in cavities that cross the flow and hummocky terrain elsewhere. Low, straight ridges as much as 10 metres (33 ft) high may be formed where sediment fills in crevasses within the glacier or at its base. A kame is a short mound or ridge with steep sides of sands and gravels deposited from melted ice. Kames may be isolated or formed in groups. Some are formed at the base of a glacier by meltwater flowing down from the surface of the ice in a moulin, or from a water body within the glacier. Others are formed at the margin of the ice as small deltas. Kame terraces are benches of sand and gravel that were deposited by braided rivers flowing between the side of the valley and the glacier's ice margin. Kame terraces on opposite sides of a valley glacier may be at different elevations. Sometimes stratified drift is deposited in the tunnels that run through
|
{"page_id": 11034502, "title": "Fluvioglacial landform"}
|
Clarke, S M; McCormac, M; Lawrence, D J D. (2010). "Acadian Orogeny, Devonian, Northern England, British regional geology: Northern England, Fifth edition, Keyworth, Nottingham". British Geological Survey. Strachan, R.A; Friderichsen, J.D; Holdsworth, R.E; Jepsen, H.F (1994-01-01). "Regional geology and Caledonian structure, Dronning Louise Land, North-East Greenland". Rapport Grønlands Geologiske Undersøgelse. 162. Geological Survey of Denmark and Greenland: 71–76. doi:10.34194/rapggu.v162.8249. ISSN 2597-2944. Thigpen, J.R.; Law, R.D.; Loehn, C.L.; Strachan, R. A.; Tracy, R.J.; Lloyd, G.E.; Roth, B.L.; Brown, S.J. (2013). "Thermal structure and tectonic evolution of the Scandian orogenic wedge, S cottish Caledonides: integrating geothermometry, deformation temperatures and conceptual kinematic-thermal models". Journal of Metamorphic Geology. 31 (8): 813–842. Bibcode:2013JMetG..31..813T. doi:10.1111/jmg.12046. ISSN 0263-4929. TODD, S. P.; MURPHY, F. C.; KENNAN, P. S. (1991). "On the trace of the Iapetus suture in Ireland and Britain". Journal of the Geological Society. 148 (5). Geological Society of London: 869–880. Bibcode:1991JGSoc.148..869T. doi:10.1144/gsjgs.148.5.0869. ISSN 0016-7649. Toghill, P. (1990). "Ten years of geology in Shropshire" (PDF). Proceedings of the Shropshire Geological Society (9): 1–3. Torsvik, Trond H.; Cocks, L. Robin M. (2004). "Earth geography from 400 to 250 Ma: a palaeomagnetic, faunal and facies review". Journal of the Geological Society. 161 (4): 555–572. Bibcode:2004JGSoc.161..555T. doi:10.1144/0016-764903-098. ISSN 0016-7649. Torsvik, Trond H.; Rehnström, Emma F. (2003). "The Tornquist Sea and Baltica–Avalonia docking". Tectonophysics. 362 (1–4). Elsevier BV: 67–82. Bibcode:2003Tectp.362...67T. doi:10.1016/s0040-1951(02)00631-5. ISSN 0040-1951. TORSVIK, T; SMETHURST, M; MEERT, J; VANDERVOO, R; MCKERROW, W; BRASIER, M; STURT, B; WALDERHAUG, H (1996). "Continental break-up and collision in the Neoproterozoic and Palaeozoic — A tale of Baltica and Laurentia" (PDF). Earth-Science Reviews. 40 (3–4). Elsevier BV: 229–258. Bibcode:1996ESRv...40..229T. doi:10.1016/0012-8252(96)00008-6. ISSN 0012-8252. van Roermund, Herman; Brueckner, Hannes (2004-01-01). The Jämtlandian: A new orogeny in the Caledonides of central Sweden. International Geological Congress (IGC) At Florence, Italy. Waldron, John W.F.; Floyd, James D.; Simonetti, Antonio; Heaman,
|
{"page_id": 2399919, "title": "Caledonian orogeny"}
|
and Grapple Fixtures (GF). During normal operations, one end effector is connected to a base point on the station, this provides a sufficiently stiff connection between the station and ERA, as well as enabling the transmission of power, data and video signals for operation of the ERA. At the same time, the second end effector provides mechanical and electrical power to the grappled objects, and allows for data transfer. Both of the end effectors are also capable of measuring torques/forces as well as contain a Camera and Lighting Unit (CLU) which aids in the control of the arm; an additional two CLUs are located on both limbs. ==== Integrated Servicing Tool ==== Located within each of the end effectors' lower compartment is an integrated servicing tool. It is used to provide torque for a grappled object, acting like a wrench. It is capable of screwing and unscrewing bolts. The IST head starts with rotating slowly at first upon system comment, until popping into the IST head receptacle, which allows it to provide the mechanical power to the screw interface. === Hardware and software === The ERA is controlled from a central computer called the ERA control computer. Control is assisted by the additional microprocessors located in the different subsystems. ==== ERA control computer (ECC) ==== The ECC is located towards the elbow of the ERA, and composes three main components; the Application Layer (AL), the Service Layer (SL), and the operating system (OS). The application layer contains the high level command, mission plan, and event handling; the service layer contains the main robot motion control loops, motion related checks and image processing; together the AL and SL constitute the Application software (ASW). Together the OS and ASW provide the main control the arm. Located with in the ECC's RISC subsystem
|
{"page_id": 1120311, "title": "European Robotic Arm"}
|
FireStarter is a 2003 first-person shooter video game developed by Ukrainian GSC Game World and published by Hip Games for Microsoft Windows. Set in the year 2010, the player's consciousness has been trapped inside of a virtual reality game with a deadly computer virus hellbent on making sure you'll never be able to leave the game again. == Plot == By the year 2010, video games have gotten so advanced that people are able to upload their consciousnesses into virtual reality machines to experience more realistic and lifelike simulations than ever before. You (the player) are the owner of one such gaming machine: called the FireStarter. However a malicious computer virus has infected the machine and it has trapped the player's consciousness inside with it. The game has been altered in a deadly manner and there's only one possible way for the player to escape the game with their life intact; they must complete the game within 48 hours or face certain death. == Gameplay == You can choose from six different types of characters to play as. A few examples of which include the Agent (a women with excellent acrobatic skills), the Cyborg (a heavily armored man with cybernetic implants who can regenerate armor) and the Mutant (a four armed mutant creature who has the ability to fire with all his four arms). The game has many RPG elements and the player can unlock different skills for their various characters as they level up throughout the game. == Reception == FireStarter received mixed to generally positive reviews upon release. GameSpot gave the game a review of 6.2/10. The game also received a score of 7.5 from IGN as well as a score of 8 from Russian gaming magazine Igromania == References == == External links == FireStarter at MobyGames
|
{"page_id": 51399430, "title": "FireStarter (video game)"}
|
incising events to occur and produce terracing. == Climate and tectonics == When terraces have the same age and/or shape over a region, it is often indicative that a large-scale geologic or environmental mechanism is responsible. Tectonic uplift and climate change are viewed as dominant mechanisms that can shape the earth’s surface through erosion. River terraces can be influenced by one or both of these forcing mechanisms and therefore can be used to study variation in tectonics, climate, and erosion, and how these processes interact. === Scale of observation === Scale of observation is always a factor when evaluating tectonic and climatic forcing. At a glimpse in geologic time, one of these forcing mechanisms may look to be the dominant process. Observations made on long geologic times scales (≥106annum) typically reveal much about slower, larger-magnitude geologic processes such as tectonism from a regional to even global scale. Evaluation on geologically short time scales (103-105 a) can reveal much about the relatively shorter climatic cycles, local to regional erosion, and how they could drive terrace development. Regional periods of terrace formation likely mark a time of when stream erosion was much greater than sediment accumulation. River erosion can be driven by tectonic uplift, climate, or potentially both mechanisms. It is difficult in many areas, however, to decisively pinpoint whether tectonism or climate change can individually drive tectonic uplift, enhanced erosion, and therefore terrace formation. In many cases, tectonic-climate interactions occur together in a positive feedback cycle. === Climatic changes === Rivers in continental interiors that have not experienced tectonic activity in the geological recent history likely record climatic changes through terracing. Terraces record natural, periodic variations driven by cycles such as the Milankovitch cycle. These cycles can describe how the Earth's orbit and rotational wobble vary over time. The Milankovitch cycles,
|
{"page_id": 80105177, "title": "User:Hike395/Fluvial terrace/merged"}
|
in 1940 the Soviet Union inherited the respective prefixes of Lithuania, Latvia, and Estonia, LY, YL, and ES. Following their independence fifty years later these countries resumed these calls. Guinea used to use 7G until 1967 and now uses 3X. Andorra used to use PX (assigned to Brazil) and now uses C3 since 1970. == Call signs used in unassigned ITU block ranges == Some call sign block ranges are unassigned by the ITU, e.g. the 1AA–1ZZ and QAA-QZZ blocks. Any call sign used by an amateur in these unassigned block ranges usually had it assigned to them by a group with an unrecognized national claim. Unless otherwise noted, they have no value for DXCC awards, nor are they valid under UK license conditions. 1A is used by the Sovereign Military Order of Malta, a Roman Catholic order based in Rome, Italy. This entity is recognized by ARRL for the DXCC program. 1B is used by the Turkish Republic of Northern Cyprus, a de facto country recognized internationally only by Turkey, as such this has not been allocated by the ITU. Contact with 1B stations can lead to revocation of amateur operators' licenses outside the northern Cyprus. 1C and 1X are occasionally used by separatists in the Chechnya, a federal subject of Russia. 1S is sometimes used on the Spratly Islands in the South China Sea, as the islands are the subject of international dispute over ownership. Without taking a position on the claims involved, this entity is recognized by ARRL for the DXCC program, although prefixes from claimant nations are often used instead. 1Z has been used in Kawthoolei, an unrecognized breakaway region of Myanmar. D0 and 1C were used in 2014, allegedly from the unrecognized Donetsk People's Republic. D1 has also been used on occasion. O19 was used
|
{"page_id": 27714849, "title": "Amateur radio call signs"}
|
these genes are evident through the human developmental disorders that result. Of these genes, the FOXP2 variant was the first to be connected to inherited language and speech disorders. Within the islands of Calleja, FOXP2 gene expression has been observed in the developing basal forebrain of monkeys as well as rodents; furthermore, this gene expression has been viewed alongside the expression of two other transcription factors, PBX3 and MEIS2. Developing neurons that express these genes originate from the subventricular zone; for this reason, the involvement of all three of these genes is thought to be responsible for determining the final destination of the neurons in the islands of Calleja. == Structure and neuronal pathways == In rodents, the islands of Calleja are composed of seven distinct clusters within the olfactory tubercle, with the major island creating a border between the septum, the nucleus accumbens, and the diagonal band. Some of the islands contain a "core" of neuropil, or unmyelinated axons and dendrites, filled with a large cell in some cases. Projections to and from the islands connect the structures to the piriform cortex, which is responsible for processing smell, as well as areas of the basal forebrain, a region responsible for determining an animal's level of wakefulness. The projections with the piriform cortex align with the rest of the olfactory system, the path beginning in the sensory cells of the nose and then proceeding through the olfactory bulb to regions such as the piriform cortex, olfactory tubercle, and amygdala. However, the projections to the basal forebrain structures actually originate from the smaller outer cells of the island clusters as opposed to the large cells within the "core." The islands of Calleja receive inputs from the back of the amygdala, which processes emotional memory, as well as the septum, nucleus accumbens,
|
{"page_id": 5208907, "title": "Islands of Calleja"}
|
on analytical interviewing techniques for law enforcement personnel. 304 Basic Forensics for Detectives (0.5) > LECTURE, 0.5 HOUR. This course provides the student with information on pro - cessing a crime scene and the types of evidence that needs to be collected. 305 Intermediate Forensics for Detectives (0.5) > LECTURE, 0.5 HOUR. Note: This course is offered on a PASS/NO-PASS basis only. This course provides the student with information on the identification, collection, storage, and presentation of evidence. 306 Legal Update For Investigations (2) > LECTURE, 2 HOURS. This course offers updated information related to con - ducting criminal investigations involving search and seizure, case and statutory law, and search and arrest warrants. 308 Current Aspects of Statements and Confessions (0.5) > LECTURE, 0.5 HOUR. Note: This course is offered on a PASS/NO-PASS basis only. This course updates the legal interactions of the 4th, 5th, 6th, and 14th Amendments to the United States Constitu - tion with daily applications. 309 Current Aspects of Miranda Rights (0.5) > LECTURE, 0.5 HOUR. Note: This course is offered on a PASS/NO-PASS basis only. This course is designed to review and update the basic requirements of the Miranda decision including the 4th and 5th Amendments. Public Safety Affiliation Department > EAST LOS ANGELES COLLEGE |GENERAL CATALOG |2023-2024 359 316 Homicide and Death Investigation (4.5) > LECTURE, 4.5 HOURS. This course provides an overview of the investigative tech - niques and resources that are utilized when investigat - ing a homicide or death, including forensics and criminal profiling. 317 Operation Safe Streets Investigation (2.0) > LECTURE, 2.25 HOURS. This course provides instruction for field officers in the application of laws, tactics, and intelligence-gathering techniques for investigations of California street gangs. 318 Sexual Assault Investigation (2.0) > LECTURE, 2.25 HOURS. This course meets the training needs
|
{"source": 957, "title": "from dpo"}
|
design automation must be continuously improved. Decision Diagrams (DDs) are an important data structure in the design and analysis of circuits because they allow efficient algorithms for their manipulation. The practical relevance of DDs leads to an ongoing quest for appropriate software solutions that enable working with different DD types. Unfortunately, existing DD software libraries focus either on efficiency or usability. Consequences are a disproportionately high effort for extensions or considerable loss of performance. To tackle these issues, a modular and efficient Framework to Engineer Decision Diagrams Yourself (FrEDDY) is proposed in this paper. Various experiments demonstrate that no compromise with regard to performance has to be made when using FrEDDY. It is on par with or clearly more efficient than established DD libraries. TS29 Approximate Computing Solutions Add this session to my calendar Date: Wednesday, 02 April 2025 Time: 16:30 CEST - 18:00 CEST Location / Room: St Clair 3AB Session chair: Chang Meng, EPFL, CH Session co-chair: Yu-Guang Chen, National Central University, TW Time Label Presentation Title Authors 16:30 CEST TS29.1 EFFICIENT APPROXIMATE LOGIC SYNTHESIS WITH DUAL-PHASE ITERATIVE FRAMEWORK Speaker: Ruicheng Dai, Shanghai Jiao Tong University, CN Authors: Ruicheng Dai1, Xuan Wang1, Wenhui Liang1, Xiaolong Shen2, Menghui Xu2, Leibin Ni2, Gezi Li2 and Weikang Qian1 1Shanghai Jiao Tong University, CN; 2Huawei Technologies Co., Ltd., China, CN Abstract Approximate computing is an emerging paradigm to improve the energy efficiency for error-tolerant applications. Many iterative approximate logic synthesis (ALS) methods were proposed to automatically design approximate circuits. However, as the sizes of circuits grow, the runtime of ALS grows rapidly. Thus, a crucial challenge is to ensure circuit quality while improving the efficiency of ALS. This work proposes a dual-phase iterative framework to accelerate the iterative ALS flows. In the first phase, a comprehensive circuit analysis is performed to gather
|
{"source": 2311, "title": "from dpo"}
|
itself •• Particular Text Relations. Relation connecting two elements of text where one is an example of the other •• Reformulation Text Relation. Relation connecting two elements of text similar in meaning, but expressed in different ways •• Conclusion Text Relation. Relation where a textual element marks the end of a seg-ment of discourse • TEMPORAL Relations: expressing a partial ordering between TIME structures, which are as-sociated with PROPOSITION s, thus establishing (partial) temporal ordering of events. • COREFERENCE Relations: identify that two instantiations in fact refer to the same real-world entity (although, possibly, at different time intervals) • QUANTIFIER Relations: which are used for comparison of numerical quantities • DOMAIN Relations: represent real-world connections (and, therefore, are instantiations of on-tological relations) between objects or events. •• CAUSAL : Relations of dependence among events, states, and objects; can be either Voli-tional (the relation between a deliberate, intentional action of an intelligent agent, and its consequence) or Non-volitional (the relation between a non-intentional action or a state of an intelligent agent and its consequence. Subtypes: REASON, ENABLEMENT, PURPOSE, CONDITION •• CONJUNCTION Domain Relations. Relations among adjacent elements that are compo-nents of a larger textual element. Subtypes: ADDITION, ENUMERATION, CONTRAST, CONCESSION, COMPARISON •• PARTICULAR/REPRESENTATIVE Domain Relations. Relations which identify that one el-ement is an example, or a special case, of the other element. Subtypes: PARTICULAR, REPRESENTATIVE •• ALTERNATION Domain Relations. Relations that are used in situations of choice, paral-lel to the logical connector “OR.” Subtypes: INCLUSIVE-OR, EXCLUSIVE-OR — 50 — •• TEMPORAL Domain Relations. Identify when one event (or object instance/snapshot) happened relative to another. Subtypes: AT, AFTER, DURING •• SPATIAL Domain Relations. Identify relations between objects and/or events in space. Subtypes: IN-FRONT-OF, ABOVE, ON, LEFT-OF , for example (exact inventory remains to be determined). Recent inventories of relations, such as those
|
{"source": 4938, "title": "from dpo"}
|
\textsf{SO}(\texttt{TC}) are defined analogously by adding these operators to \textsf{SO} and allowing them to apply to formulas containing second-order variables. We may now state another major result of descriptive complexity theory: **Theorem 4.3** (Immerman 1982; Vardi 1982) \textbf{P} is captured by \textsf{FO}(\texttt{LFP}) relative to ordered models (i.e. models \mathcal{A} for structures interpreting \leq as a linear order on A). Immerman (1999, p. 61) describes Theorem 4.3 as “increas[ing] our intuition that polynomial time is a class whose fundamental nature goes beyond the machine models with which it is usually defined”. Taken in conjunction with Theorem 4.2 it also provides a logical reformulation of the \textbf{P} \neq \textbf{NP}? problem itself – i.e. \textbf{P} \neq \textbf{NP} if and only if there exists a class of ordered structures definable in existential second-order logic which is not definable by a formula of \textsf{FO}(\texttt{LFP}). On the other hand, the restriction to ordered structures in the formulation of Theorem 4.3 is known to be essential in the sense that there are simply describable languages in \textbf{P} – e.g. \sc{PARITY} = \{w \in \{0,1\}^* : w \text{ contains an odd number of 1s}\} – which cannot be define over \textsf{FO}(\texttt{LFP}) without using \leq. More generally, the question of there exists a logic which captures \textbf{P} over unordered structures is currently one of the major open questions in descriptive complexity. See, e.g., (Ebbinghaus and Flum 1999) and (Chen and Flum 2010). Complexity class Logic Reference \textbf{AC}^0\mathsf{FO}(Immerman 1999) \textbf{NL}\textsf{FO}(\texttt{TC})(Immerman 1987) \textbf{P}\textsf{FO}(\texttt{LFP})(Immerman 1982), (Vardi 1982) \textbf{NP}\textsf{SO}\exists(Fagin 1974) \Sigma^P_i\textsf{SO}\Sigma^1_i(Stockmeyer 1977) \Pi^P_i\textsf{SO}\Pi^1_i(Stockmeyer 1977) \textbf{PH}\textsf{SO}(Stockmeyer 1977) \textbf{PSPACE}\textsf{SO}(\texttt{TC})(Immerman 1987) \textbf{EXP}\textsf{SO}(\texttt{LFP})(Immerman 1999) Table 2. Descriptive characterization of complexity classes. ### 4.5 Bounded arithmetic Another connection between logic and computational complexity is provided by first-order arithmetical theories which are similar in form to familiar systems such as Primitive Recursive Arithmetic and Peano arithmetic. Connections between formal
|
{"source": 6170, "title": "from dpo"}
|
Wahlenbergiella tavaresiae and the brown alga Petroderma maculiforme. phenocortex Plural phenocortices, phenocortexes. A structure, similar to a cortex, containing hyphal fragments and dead, collapsed algal cells sloughed off from the algal layer. photobiont Also defined: phycobiont, cyanobiont. The photosynthetic component of a lichen. This can be either a green alga (known as a phycobiont) or a cyanobacteria (known as a cyanobiont). The term "phycobiont" was proposed by George Scott in 1957. photobiont layer See algal layer. photomorph An organism whose morphology is determined by the nature of its photosynthesis; applied to lichen-forming fungi whose thalli have different forms with green algal versus cyanobacterial photobionts. The term was introduced by Jack Laundon in 1995 to address what he believed were deficiencies in related terms such as morph, morphotype, and photosymbiodeme. photosymbiodeme Morphologically different structures formed by the interaction of a single mycobiont with two different photobionts. Examples occur in the genera Pseudocyphellaria and Sticta. phycobiont See: photobiont phycolichen A historical lichenological term with multiple meanings. Originally introduced by Fries (1831) as "Phyco-Lichenes" for lichens morphologically resembling seaweeds. Later redefined by Massalongo (1855) for homoiomerous cyanobacterial lichens, then by Diels (1936) for lichens with Phycomycetes as their fungal partner. More recently proposed but discouraged as a term for green algal lichens, with "chlorolichen" recommended instead as a counterpart to "cyanolichen". Generally considered obsolete in modern lichenology due to its ambiguous history. phyllidium Plural phyllidia. A small leaf-like or scale-like propagule that is corticate and has distinct upper and lower sides (i.e., it is dorsiventral); it originates from the margins or on the upper surface of thallus. Phyllidia occur in some species of the Lecanorales and the Peltigerales. phyllocladium Plural phyllocladia. A photobiont-containing, corticate outgrowth of pseudopodetia; common in the genus Stereocaulon. Their morphology can be characterised with various descriptors: coralloid, digitate, granular,
|
{"page_id": 71377690, "title": "Glossary of lichen terms"}
|
for the target molecule. Off-target binding to related molecules could have significant clinical effects. SELEX has been used to develop a number of aptamers that bind targets interesting for both clinical and research purposes. Nucleotides with chemically modified sugars and bases have been incorporated into SELEX reactions to increase the chemical diversity at each base, expanding the possibilities for specific and sensitive binding, or increasing stability in serum or in vivo. == Procedure == Aptamers have emerged as a novel category in the field of bioreceptors due to their wide applications ranging from biosensing to therapeutics. Several variations of their screening process, called SELEX have been reported which can yield sequences with desired properties needed for their final use. === Generating single stranded oligonucleotide library === The first step of SELEX involves the synthesis of fully or partially randomized oligonucleotide sequences of some length flanked by defined regions which allow PCR amplification of those randomized regions and, in the case of RNA SELEX, in vitro transcription of the randomized sequence. While Ellington and Szostak demonstrated that chemical synthesis is capable of generating ~1015 unique sequences for oligonucleotide libraries in their 1990 paper on in vitro selection, they found that amplification of these synthesized oligonucleotides led to significant loss of pool diversity due to PCR bias and defects in synthesized fragments. The oligonucleotide pool is amplified and a sufficient amount of the initial library is added to the reaction so that there are numerous copies of each individual sequence to minimize the loss of potential binding sequences due to stochastic events. Before the library is introduced to target for incubation and selective retention, the sequence library must be converted to single stranded oligonucleotides to achieve structural conformations with target binding properties. === Target incubation === Immediately prior to target introduction, the
|
{"page_id": 8028338, "title": "Systematic evolution of ligands by exponential enrichment"}
|
Telium, plural telia, are structures produced by rust fungi as part of the reproductive cycle. They are typically yellow or orange drying to brown or black and are exclusively a mechanism for the release of teliospores which are released by wind or water to infect the alternate host in the rust life-cycle. The telial stage provides an overwintering strategy in the life cycle of a parasitic heteroecious fungus by producing teliospores; this occurs on cedar trees. A primary aecial stage is spent parasitizing a separate host plant which is a precursor in the life cycle of heteroecious fungi. Teliospores are released from the telia in the spring. The spores can spread many kilometers through the air, however most are spread near the host plant. == Host plants == There are a number of plants that can be infected by the telial stage. Therefore, the telial stage is considered a pathogen to those plants. A few specific plant pathogenic species are listed here with their hosts. Puccinia graminis or known commonly as black stem rust. It infects many different cereal crops. Gymnosporangium juniperi-virginianae. It infects the eastern red cedar. This is shown to the right. Gymnosporangium sabinae. It infects pear trees. == Spore stages == The life cycle of rust fungi can have up to five different spore stages and can get quite complex. These stages are: Stage 0: Pycniospores Stage I: Aeciospores Stage II: Urediniospores Stage III: Teliospores Stage IV: Basidiospores == References ==
|
{"page_id": 31385731, "title": "Telium"}
|
far more scholarly and public attention. Other media studies scholars have followed Boykoff's lead incorporating discourses analysis in their work. In another communications-related study, David Ockwell, Lorraine Whitmarsh and Saffron O’Neill applied governmentality concepts to a U.K. government marketing campaign aimed at increasing "green" behaviors in citizens. In their analysis of why the campaign was ineffective, they identify regime-based barriers to behavior change, including infrastructure, financial, and structural barriers. Chris Methmann has published work on global warming as a form of global governmentality in the field of international relations, citing the carbon market as a means of conducting individual conduct from a global scale. He concluded that the Clean Development Mechanism of carbon credit trading has become easily established because it protects "business as usual" – the established order of power. Robyn Dowling argued for inclusion of ecogovernmentality perspectives regarding identity formation in the field of human geography in her 2008 paper, which addressed a variety of issues, including climate change. == Further reading == Agrawal, Arun. (2005) Environmentality: Technologies of Government and the Making of Subjects. Durham : Duke University Press. [1] Braun, Bruce. (2000) "Producing Vertical Territory: Geology and Governmentality in Late Victorian Canada." Ecumene, 7(1). Braun, Bruce. (2003) The Intemperate Rainforest. Minneapolis: University of Minnesota Press. Bryant, Raymond. (2001) "Political Ecology: A Critical Agenda for Change?" in Castree, N. & Brawn, B. eds. Social Nature: Theory Practice and Politics. Malden, MA: Blackwell Publishers. 151-169. Darier, Eric. (1999) "Foucault and the Environment: An Introduction" in Darier, E. ed. Discourses of the Environment. Malden, Mass: Blackwell Publishers. 1-34. Foucault, Michel. (1991) "Governmentality" in Burchell, G.; Gordon C.; and Miller, P. eds. The Foucault Effect. London : Harvester Wheatsheaf. 87-104. Lemke, Thomas. (2004) "Foucault, Governmentality, and Critique" in Rethinking Marxism, Volume 14, Issue 3 September 2002, pp. 49 – 64
|
{"page_id": 15225843, "title": "Ecogovernmentality"}
|
meaning "a flowing of water, tide, an overflowing of land by water, a deluge, Noah's Flood; mass of water, river, sea, wave". The Old English word flōd comes from the Proto-Germanic floduz (Old Frisian flod, Old Norse floð, Middle Dutch vloet, Dutch vloed, German Flut, and Gothic flodus derives from floduz). == See also == Disaster response – Second phase of the disaster management cycle Diversion dam – Dam that diverts some flow of a river Emergency management – Dealing with all humanitarian aspects of emergencies Flood alert – Weather warning indicating areal flooding has been observed or is imminentPages displaying short descriptions of redirect targets Mudflow – Form of mass wasting == References ==
|
{"page_id": 50482, "title": "Flood"}
|
user to see the baby in a dark room. Video baby monitors that have night vision mode will switch to this mode automatically in the dark. Some advanced baby cams now work over Wi-Fi so parents can watch babies through their smartphone or computer. Baby monitors continue to evolve and now also can utilize features such as night lights and built-in lullabies. These are not available in all monitors. Some include temperature and movement monitoring devices to sit underneath a mattress or close to the baby within a cot. == Movement monitors == A baby movement monitor uses sensor pads placed under the crib mattress to detect movement, if movement stops for more than 20 seconds an alarm will sound. == Wired and wireless == Baby monitors generally use wireless systems, but can also use wires or may operate over existing household wiring such as X10. Wireless systems use radio frequencies that are designated by governments for unlicensed use. For example, in North America frequencies near 49 MHz, 902 MHz or 2.4 GHz are available. While these frequencies are not assigned to powerful television or radio broadcasting transmitters, interference from other wireless devices such as cordless telephones, wireless toys, computer wireless networks, radar, Smart Power Meters and microwave ovens is possible. Digital audio wireless systems using DECT, are resistant to interference and have a range up to 300 m. Analog audio transmissions can be picked up at a distance from the home by a scanner receiver or other baby monitor receivers, and so present a risk to privacy as long as the transmitter is switched on. Digital transmission such as Frequency-hopping spread spectrum provides a level of protection from casual interception. Some wireless baby monitors support multiple cameras on one handheld monitor-receiver. These systems are even compatible with a standard
|
{"page_id": 1394141, "title": "Baby monitor"}
|
NGC 2326 is a barred spiral galaxy in the Lynx constellation. Its velocity with respect to the cosmic microwave background is 6062 ± 11 km/s, which corresponds to a Hubble distance of 291.6 ± 20.4 Mly (89.41 ± 6.26 Mpc). It was discovered by William Herschel on 9 February 1788. Its apparent magnitude is 14.3 and its size is 2.71 arc minutes. It is located near NGC 2326A. The SIMBAD database lists NGC 2326 as a radio galaxy, i.e. it has giant regions of radio emission extending well beyond its visible structure. One supernova has been observed in NGC 2326. SN 2023pgb (type II, mag. 17.4) was discovered on 12 August 2023 by the Zwicky Transient Facility. == See also == List of NGC objects (2001–3000) == References ==
|
{"page_id": 56484556, "title": "NGC 2326"}
|
since software tools have automated many tasks of printed circuit board (PCB) engineers. == Computer software and programming language timeline == The following tables include year by year development of many different aspects of computer software including: High level languages Operating systems Networking software and applications Computer graphics hardware, algorithms and applications Spreadsheets Word processing Computer aided design === 1971–1974 === === 1975–1978 === === 1979–1982 === === 1983–1986 === === 1987–1990 === === 1991–1994 === === 1995–1998 === === 1999–2002 === === 2003–2006 === === 2007–2010 === === 2011–2014 === == See also == Forensic software engineering History of computing hardware History of operating systems History of software engineering List of failed and overbudget custom software projects List of pioneers in computer science Women in computing Timeline of women in computing == References == === Sources === Ceruzzi, Paul E. (1998). History of Computing. Cambridge, Massachusetts: MIT Press. ISBN 978-0-262-03255-1 – via EBSCOhost. Evans, Claire L. (2018). Broad Band: The Untold Story of the Women Who Made the Internet. New York: Portfolio/Penguin. ISBN 978-0-7352-1175-9. Gürer, Denise (1995). "Pioneering Women in Computer Science" (PDF). Communications of the ACM. 38 (1): 45–54. doi:10.1145/204865.204875. S2CID 6626310. Light, Jennifer S. (1999). "When Computers Were Women". Technology and Culture. 40 (3): 455–483. doi:10.1353/tech.1999.0128. JSTOR 25147356. S2CID 108407884. Mindell, David A. (2008). Digital Apollo: Human and Machine in Spaceflight. Cambridge, Massachusetts: The MIT Press. ISBN 978-0-262-26668-0. Smith, Erika E. (2013). "Recognizing a Collective Inheritance through the History of Women in Computing". CLCWeb: Comparative Literature and Culture. 15 (1): 1–9. doi:10.7771/1481-4374.1972. == External links == Media related to History of software at Wikimedia Commons
|
{"page_id": 40601008, "title": "History of software"}
|
L g {\displaystyle T={\frac {2\pi }{\operatorname {agm} (1,\cos(\theta _{0}/2))}}{\sqrt {\frac {L}{g}}}} Period of a spring-mass system with spring constant k {\displaystyle k} and mass m {\displaystyle m} : T = 2 π m k {\displaystyle T=2\pi {\sqrt {\frac {m}{k}}}} Kepler's third law of planetary motion: R 3 T 2 = G M 4 π 2 {\displaystyle {\frac {R^{3}}{T^{2}}}={\frac {GM}{4\pi ^{2}}}} The buckling formula: F = π 2 E I L 2 {\displaystyle F={\frac {\pi ^{2}EI}{L^{2}}}} A puzzle involving "colliding billiard balls": ⌊ b N π ⌋ {\displaystyle \lfloor {b^{N}\pi }\rfloor } is the number of collisions made (in ideal conditions, perfectly elastic with no friction) by an object of mass m initially at rest between a fixed wall and another object of mass b2Nm, when struck by the other object. (This gives the digits of π in base b up to N digits past the radix point.) == Formulae yielding π == === Integrals === 2 ∫ − 1 1 1 − x 2 d x = π {\displaystyle 2\int _{-1}^{1}{\sqrt {1-x^{2}}}\,dx=\pi } (integrating two halves y ( x ) = 1 − x 2 {\displaystyle y(x)={\sqrt {1-x^{2}}}} to obtain the area of the unit circle) ∫ 0 2 4 − x 2 d x = π {\displaystyle \int _{0}^{2}{\sqrt {4-x^{2}}}\,dx=\pi } (integrating a quarter of a circle with a radius of two x 2 + y 2 = 4 {\displaystyle x^{2}+y^{2}=4} to obtain 4 π / 4 {\displaystyle {4\pi }/4} ) ∫ − ∞ ∞ sech x d x = π {\displaystyle \int _{-\infty }^{\infty }\operatorname {sech} x\,dx=\pi } ∫ − ∞ ∞ ∫ t ∞ e − 1 / 2 t 2 − x 2 + x t d x d t = ∫ − ∞ ∞ ∫ t ∞ e − t 2 − 1 /
|
{"page_id": 4659082, "title": "List of formulae involving π"}
|
'test_env' object extend sys { test_env: environment_u is instance; }; '> === Randomization === In e each field is randomized by default. Field randomization can be controlled by hard constraints, soft constraints or even be turned off completely. Soft constraints are used as the default constraints, and may be automatically overridden by the test layer if a conflict occurs. Otherwise it behaves like a regular constraint. ==== Example ==== <' struct my_pkt_s { destination_address: uint (bits: 48); // this field is randomized and is not constrained. data_payload : list of byte; !parity_field : uint (bits: 32); // '!' prevents the parity_field from being randomized. keep soft data_payload.size() in [64..1500]; // a soft constraint, used to provide a default randomization keep data_payload.size() not in [128..256]; // this is a hard constraint }; '> === Assertions === e supports assertions with temporal expressions. A temporal expression is used at the same syntactic level as fields and methods and is thereby declarative by nature. A temporal expression describes timed behavior. ==== Example ==== <' unit temporal_example_u { event a; // declaring an event 'a' event b; // declaring an event 'b' event c; // declaring an event 'c' // This assertion expects that the next cycle after event a // has been detected that event b followed by event c occurs. expect @a => {@b;@c} }; '> === Coverage === e supports coverage that are grouped according to their sampled event and those groups are internally structured with items. Items can be simple items or complex items such as crossed items or transitional items. ==== Example ==== unit coverage_example_u { event cov_event_e; // collecting coverage will be tied to this event cover cov_event_e is { item a: uint (bits: 4); // this item has 16 buckets from 0 to 15 item b: bool;
|
{"page_id": 8367715, "title": "E (verification language)"}
|
half, at least, of the incident rays immediately passed through the screen. Thus it was evident that it was the other only which was stopped at the first surface of the glass. The effect of conduction must therefore be limited to this latter half. But as the screen, when blackened, stops the whole radiation, it is then exposed to a heat twice as strong, and therefore exhibits a far greater effect of conduction. Hence it follows that when we deduct from the observation furnished by the transparent glass the observation furnished by the glass blackened, the result obtained will be lower than the true temperature of the rays transmitted freely. But the error will not be the same in all cases. Being of no account when boiling water is employed, it will increase in proportion as the temperature of the source is raised. The measures of the free radiations which suffer the greatest diminution will be those furnished by the highest temperatures. Radon transform on $\bbh^{k+1}$. Thus, the existence of $\tilde \H_k f$ is equivalent to the existence of $(\H f_v)(\z)$. The latter is characterized by Theorem \ref{hyptag31th} which should be applied to $f_v$. To reformulate the conditions of that theorem in terms of $f$, we need the following \begin{lemma} The equality \be\label {hoyiii} \intl_{S^{n-k-1}}\!\! \!dv\!\intl_{\bbh^{k+1}}\!\! f_v (\eta)\,d\eta\!=\!2 \intl_{\bbh^n} \frac{f(x)}{|x'|^{n-k-1}}\,dx, \quad x'\!=\!(x_1, \ldots, x_{n-k}),\ee holds provided that either side of it is finite when $f$ is replaced by $|f|$. \end{lemma} \begin{proof} Let $\eta=\eta_{n-k} \, e_{n-k}+\tilde \eta$, $\tilde \eta=(\eta_{n-k+1}, \ldots \eta_{n+1})$. Then $\tilde \gam_v \eta=v\, \eta_{n-k}+\tilde \eta$ and (\ref {hfoeehhh4}) yields \bea l.h.s &=& \intl_{S^{n-k-1}} dv \intl_{\bbh^{k+1}} f(v\, \eta_{n-k}+\tilde \eta)\,d\eta\nonumber\\ &=&\intl_{S^{n-k-1}} dv \intl_{-\infty}^\infty \cosh^k r\, dr \intl_{\bbh^{k}} f(v\,\sinh\, r +u\,\cosh\, r)\,du\nonumber\\ &=&2\intl_0^\infty \frac{d\nu (r)}{\sinh^{n-k-1} r} \intl_{S^{n-k-1}} dv \intl_{\bbh^{k}} f(v\,\sinh\, r +u\,\cosh\, r)\,du,\nonumber\eea $d\nu(r)=\sinh^{n-k-1}\, r\,\cosh^k\, r \, dr$. By (\ref{hfohhh4}), the result
|
{"source": 1030, "title": "from dpo"}
|
test the proposed mechanisms. Codes are available at this https URL (replaced) [pdf, html, other] Title: Expand and Compress: Exploring Tuning Principles for Continual Spatio-Temporal Graph Forecasting Wei Chen; Artificial Intelligence (cs.AI) The widespread deployment of sensing devices leads to a surge in data for spatio-temporal forecasting applications such as traffic flow, air quality, and wind energy. Although spatio-temporal graph neural networks have achieved success in modeling various static spatio-temporal forecasting scenarios, real-world spatio-temporal data are typically received in a streaming manner, and the network continuously expands with the installation of new sensors. Thus, spatio-temporal forecasting in streaming scenarios faces dual challenges: the inefficiency of retraining models over newly arrived data and the detrimental effects of catastrophic forgetting over long-term history. To address these challenges, we propose a novel prompt tuning-based continuous forecasting method, following two fundamental tuning principles guided by empirical and theoretical analysis: expand and compress, which effectively resolve the aforementioned problems with lightweight tuning parameters. Specifically, we integrate the base spatio-temporal graph neural network with a continuous prompt pool, utilizing stored prompts (i.e., few learnable parameters) in memory, and jointly optimize them with the base spatio-temporal graph neural network. This method ensures that the model sequentially learns from the spatio-temporal data stream to accomplish tasks for corresponding periods. Extensive experimental results on multiple real-world datasets demonstrate the multi-faceted superiority of our method over the state-of-the-art baselines, including effectiveness, efficiency, universality, etc. arXiv:2410.13448 (replaced) [pdf, other] Title: Fast Estimation of Partial Dependence Functions using Trees Jinyang Liu; Machine Learning (stat.ML) Many existing interpretation methods are based on Partial Dependence (PD) functions that, for
|
{"source": 3339, "title": "from dpo"}
|
are majority but not $n-1$ in size, we can indeed get feasibility results in some meaningful parameter regimes. We give a complete characterization of the regime in which CSP-fair coin toss is possible, by providing a matching upper- and lower-bound. Our complete characterization theorem also shows that the mathematical structure of game-theoretic fairness is starkly different from the de facto strong fairness notion in the multi-party computation literature. Media:![Image 100: Paper: Xiaoyang Dong (online) When generating quartets for the rectangle attack on ciphers with linear key-schedule ciphers, we find the right quartets which may suggest key candidates have to satisfy some nonlinear relationships. However, some quartets generated always violate these relationships, so that they will never suggest any key candidates. Inspired by previous rectangle frameworks, we find that guessing certain key cells before generating quartets may reduce the number of those invalid quartets. However, guessing a lot of key cells at once may lose the benefit from the early abort technique, which may lead to a higher overall complexity. To get better tradeoff, we build a new rectangle attack framework on ciphers with linear key-schedule with the purpose of reducing the overall complexity or attacking more rounds. In the tradeoff model, there are many parameters affecting the overall complexity, especially for the choices of the number and positions of key guessing cells before generating quartets. To identify optimal parameters, we build a uniform automatic tool on SKINNY as an example,
|
{"source": 5782, "title": "from dpo"}
|
post that reflects on some of the defenses around this problem space, however I’m still trying to get my footing for things like distillation and adversarial training. But I will leave you with an insight that [adversarial ML godfather Ian Goodfellow]( stated around four years ago: > It’s also important to emphasize that all of the defenses so far are based on unrealistically easy threat models where the attacker is very limited…as a research problem it’s been really hard to solve even the limited version and this remains a very active research area with a lot of important challenges to solve. For future work in this specific area, here are a few general goals I’m hoping to pursue: * Examine text-based obfuscation detection instead of the AST approach described in this series. This affects the feasibility of deployment in some scenarios. * Test the effectiveness of adversarial ML defenses against these specific models. * Run this type of white/black box case study on another dataset for comparison. * Dive more into attacking tree ensembles. * ??? Now that we’re at the end of this firehose of information [spread]( over [three]( posts, I hope you enjoyed reading this material as much as I enjoyed researching and writing it. This has been a long but rewarding journey for me, and if this has sparked your interest in this field I say jump in! You can join us in the DEF CON [AI Village Discord]( the#DeepThought channel on the [BloodHound Slack]( or feel free to email me at will [at] harmj0y.net. [Edit] Shortly after the publishing of this post, [Battista Biggio]( pointed out that I had overlooked the [secml_malware]( repo and the [associated papers]( for attacks implemented in that framework. I’ve updated references in this post to reflect this prior work. While I
|
{"source": 6449, "title": "from dpo"}
|
Lutetium is a chemical element; it has symbol Lu and atomic number 71. It is a silvery white metal, which resists corrosion in dry air, but not in moist air. Lutetium is the last element in the lanthanide series, and it is traditionally counted among the rare earth elements; it can also be classified as the first element of the 6th-period transition metals. Lutetium was independently discovered in 1907 by French scientist Georges Urbain, Austrian mineralogist Baron Carl Auer von Welsbach, and American chemist Charles James. All of these researchers found lutetium as an impurity in ytterbium. The dispute on the priority of the discovery occurred shortly after, with Urbain and Welsbach accusing each other of publishing results influenced by the published research of the other; the naming honor went to Urbain, as he had published his results earlier. He chose the name lutecium for the new element, but in 1949 the spelling was changed to lutetium. In 1909, the priority was finally granted to Urbain and his names were adopted as official ones; however, the name cassiopeium (or later cassiopium) for element 71 proposed by Welsbach was used by many German scientists until the 1950s. Lutetium is not a particularly abundant element, although it is significantly more common than silver in the Earth's crust. It has few specific uses. Lutetium-176 is a relatively abundant (2.5%) radioactive isotope with a half-life of about 38 billion years, used to determine the age of minerals and meteorites. Lutetium usually occurs in association with the element yttrium and is sometimes used in metal alloys and as a catalyst in various chemical reactions. 177Lu-DOTA-TATE is used for radionuclide therapy (see Nuclear medicine) on neuroendocrine tumours. Lutetium has the highest Brinell hardness of any lanthanide, at 890–1300 MPa. == Characteristics == === Physical properties ===
|
{"page_id": 17745, "title": "Lutetium"}
|
as yeast are alive or dead. The methylene blue is reduced in viable cells, leaving them unstained. However dead cells are unable to reduce the oxidized methylene blue and the cells are stained blue. Methylene blue can interfere with the respiration of the yeast as it picks up hydrogen ions made during the process. === Aquaculture === Methylene blue is used in aquaculture and by tropical fish hobbyists as a treatment for fungal infections. With the help of light it is also effective against bacteria and viruses. It can also be effective in treating fish infected with the parasitic protozoa Ichthyophthirius multifiliis (ich), although a combination of malachite green and formaldehyde is far more effective against it. Methylene blue also works against nitrite poisoning as it treats the resulting methemoglobinemia. Like in humans, it also treats cyanide poisoning. Non-professional sources also claim that it works for ammonia poisoning, but there is little medical literature to back this up. It is usually used to protect newly laid fish eggs from being infected by fungus. This is useful when the hobbyist wants to artificially hatch the fish eggs. For poisoning, injury (prevention of infection), or sickness, methylene blue is given as a "medicated bath" for the fish. Methylene blue is not without side effects to fish. == History == Methylene blue has been described as "the first fully synthetic drug used in medicine". Methylene blue was first prepared in 1876 by German chemist Heinrich Caro. Its use in the treatment of malaria was pioneered by Paul Guttmann and Paul Ehrlich in 1891. During this period before World War I, researchers like Ehrlich believed that drugs and dyes worked in the same way, by preferentially staining pathogens and possibly harming them. Changing the cell membrane of pathogens is in fact how various drugs
|
{"page_id": 238790, "title": "Methylene blue"}
|
In analytic number theory, a Dirichlet series, or Dirichlet generating function (DGF), of a sequence is a common way of understanding and summing arithmetic functions in a meaningful way. A little known, or at least often forgotten about, way of expressing formulas for arithmetic functions and their summatory functions is to perform an integral transform that inverts the operation of forming the DGF of a sequence. This inversion is analogous to performing an inverse Z-transform to the generating function of a sequence to express formulas for the series coefficients of a given ordinary generating function. For now, we will use this page as a compendia of "oddities" and oft-forgotten facts about transforming and inverting Dirichlet series, DGFs, and relating the inversion of a DGF of a sequence to the sequence's summatory function. We also use the notation for coefficient extraction usually applied to formal generating functions in some complex variable, by denoting [ n − s ] D f ( s ) =: f ( n ) {\displaystyle [n^{-s}]D_{f}(s)=:f(n)} for any positive integer n ≥ 1 {\displaystyle n\geq 1} , whenever D f ( s ) := ∑ n ≥ 0 f ( n ) n s , ℜ ( s ) > σ 0 , f , {\displaystyle D_{f}(s):=\sum _{n\geq 0}{\frac {f(n)}{n^{s}}},\quad \Re (s)>\sigma _{0,f},} denotes the DGF (or Dirichlet series) of f which is taken to be absolutely convergent whenever the real part of s is greater than the abscissa of absolute convergence, σ 0 , f ∈ R {\displaystyle \sigma _{0,f}\in \mathbb {R} } . The relation of the Mellin transformation of the summatory function of a sequence to the DGF of a sequence provides us with a way of expressing arithmetic functions f ( n ) {\displaystyle f(n)} such that f ( 1 ) ≠ 0
|
{"page_id": 61869767, "title": "Dirichlet series inversion"}
|
ruthless, see for example the Távora affair. In literature, the first Enlightenment ideas in Portugal can be traced back to the diplomat, philosopher, and writer António Vieira who spent a considerable amount of his life in colonial Brazil denouncing discriminations against New Christians and the indigenous peoples in Brazil. During the 18th century, enlightened literary movements such as the Arcádia Lusitana (lasting from 1756 until 1776, then replaced by the Nova Arcádia in 1790 until 1794) surfaced in the academic medium, in particular involving former students of the University of Coimbra. A distinct member of this group was the poet Manuel Maria Barbosa du Bocage. The physician António Nunes Ribeiro Sanches was also an important Enlightenment figure, contributing to the Encyclopédie and being part of the Russian court. The ideas of the Enlightenment influenced various economists and anti-colonial intellectuals throughout the Portuguese Empire, such as José de Azeredo Coutinho, José da Silva Lisboa, Cláudio Manoel da Costa, and Tomás Antônio Gonzaga. The Napoleonic invasion of Portugal had consequences for the Portuguese monarchy. With the aid of the British navy, the Portuguese royal family was evacuated to Brazil, its most important colony. Even though Napoleon had been defeated, the royal court remained in Brazil. The Liberal Revolution of 1820 forced the return of the royal family to Portugal. The terms by which the restored king was to rule was a constitutional monarchy under the Constitution of Portugal. Brazil declared its independence of Portugal in 1822 and became a monarchy. === Russia === In Russia, the government began to actively encourage the proliferation of arts and sciences in the mid-18th century. This era produced the first Russian university, library, theatre, public museum, and independent press. Like other enlightened despots, Catherine the Great played a key role in fostering the arts, sciences and
|
{"page_id": 30758, "title": "Age of Enlightenment"}
|
advocated for changes in jurisprudence or legislation to restore statutory damages to their proper place in copyright law. === Copyright injunctions === When a court finds a violation of the law in a civil case, it may award money damages or issue an injunction—an order to do something or refrain from doing it. For many years it was standard practice for courts to issue injunctions when they found copyright infringement had occurred. However, in the 2006 patent case eBay v. MercExchange, the U.S. Supreme Court held that injunctive relief should issue only when plaintiffs can satisfy the same 4-part test used in other injunctive relief situations. Most notably, the eBay test requires the plaintiff to demonstrate that "irreparable harm" would occur without the injunction. Samuelson and Krzysztof Bebenek analyzed eBay's impact on copyright cases and argued that the case set a standard "far more in line with traditional principles of equity which place the burden of proof of irreparable injury squarely on the shoulder of plaintiffs who seek the extraordinary remedy of preliminary injunctive relief". In 2022, Samuelson reassessed the caselaw, and reported that injunctions had become less frequent. == Advocating for innovation == Consistent with her view that copyright protection should be understood as a tool to advance society's knowledge, Samuelson has argued for limits on copyright protection that promote innovation by preserving the ability to create products compatible with other products. === Preserving interoperability and Oracle v. Google === In 2010, Oracle sued Google claiming that Google had infringed its copyright by reimplementing parts of the Java API in the Android platform. Samuelson (sometimes with other scholars, including Clark Asay) filed several amicus briefs as the case wound through the courts, arguing both that court holdings were incorrect in holding that copyright (as opposed to patent) protection was
|
{"page_id": 2420085, "title": "Pamela Samuelson"}
|
classical theory has no mass scale so there is a conformal symmetry. Naively, we would expect that the proton is nearly massless because the quark kinetic energy and potential energy cancel by the relativistic virial theorem. However, in the quantum case the symmetry is broken by a conformal anomaly. This introduces a scale, the scale at which colour confinement occurs and determines the masses of hadrons, and the phenomenon of chiral symmetry breaking. Beside the anomaly (believed to contribute to about 20% of the proton mass), the rest can be attributed to the light quarks sigma terms (i.e., the fact that quark have small non-zero masses that are not associated with the trace anomaly) believed to contribute to about 17%, and the quark and gluon energies believed to contribute to about 29% and 34% of the proton mass, respectively. Hence QCD, via the trace anomaly, quark and gluon energies and sigma terms, is responsible for more than 99% of the mass of ordinary matter in the Universe, the Higgs mechanism directly contributing only less than one percent via mostly the u quark, d quark and electron masses. == Coleman–Weinberg potentials == Sidney Coleman and Erick Weinberg showed how spontaneous symmetry breaking of electroweak interactions involving a fundamental Higgs scalar could occur via Feynmans loops. Moreover, the authors showed how to "improve" the results of their calculation using the renormalization group. In fact, the Coleman–Weinberg mechanism can be traced entirely to the renormalization group running of the quartic Higgs coupling, λ {\displaystyle \lambda } . The resulting Coleman–Weinberg potential is proportional to the associated β {\displaystyle \beta } -function, while the trace anomaly is given by β ( λ ) / λ {\displaystyle \beta (\lambda )/\lambda } , hence the Coleman–Weinberg potential can be viewed as arising directly from the trace
|
{"page_id": 1931704, "title": "Conformal anomaly"}
|
Staatsmijn Maurits was a state-owned coal mine in Geleen, Netherlands. In 1911 the Dutch Government bought the concessions "Maasvelden". In 1912 and 1913 drillings were carried out by the Internationale Bohrgesellschaft Erkelenz in the areas west of the Staatsmijn Emma and Staatsmijn Hendrik concessions. Drillings were made at the towns of Geleen-Lutterade, Krawinkel and Schinnen. Additional shallow drillings were made near Urmond. In 1915 it was decided to position the mine at Lutterade, Geleen. Railways were constructed for connection with the railway Sittard-Maastricht. In 1916 it was decided to name this 4th State Mine "Maurits", after 17th century stadtholder Maurice of Nassau, Prince of Orange. In 1916, construction of the shafts was begun and the mine was taken in production in 1926. In 1947 the mine was connected to the Emma Mine by a 13 km straight tunnel. In the second half of the 1940s and in the 1950s the mine was expanded, and mining reached a depth of 810 m. A third shaft was completed in 1958. At the time of completion of the third shaft, the Maurits mine was the largest two-shafts mine in the world. It was the largest coal mine in the Netherlands. When in the beginning of the 1960s the economic tide for coal mining turned, it was already anticipated to close the Maurits as one of the first mines. The mine was finally closed down in 1967. The surface facilities were afterwards demolished. Directly adjacent to the mine site, DSM had already decades before started with cokes production and gasproduction. The "Stikstof Bindingsbedrijf" (SBB - or "nitrogen bonding plant") became the locus for the next step in the history of DSM: it became (and still is) a large chemicals company. == External links == http://citg.tudelft.nl/?id=18387 Coal Mining in the Netherlands (Delft University of Technology)
|
{"page_id": 32906579, "title": "Staatsmijn Maurits"}
|
Schema-agnostic databases or vocabulary-independent databases aim at supporting users to be abstracted from the representation of the data, supporting the automatic semantic matching between queries and databases. Schema-agnosticism is the property of a database of mapping a query issued with the user terminology and structure, automatically mapping it to the dataset vocabulary. The increase in the size and in the semantic heterogeneity of database schemas bring new requirements for users querying and searching structured data. At this scale it can become unfeasible for data consumers to be familiar with the representation of the data in order to query it. At the center of this discussion is the semantic gap between users and databases, which becomes more central as the scale and complexity of the data grows. == Description == The evolution of data environments towards the consumption of data from multiple data sources and the growth in the schema size, complexity, dynamicity and decentralisation (SCoDD) of schemas increases the complexity of contemporary data management. The SCoDD trend emerges as a central data management concern in Big Data scenarios, where users and applications have a demand for more complete data, produced by independent data sources, under different semantic assumptions and contexts of use, which is the typical scenario for Semantic Web Data applications. The evolution of databases in the direction of heterogeneous data environments strongly impacts the usability, semiotics and semantic assumptions behind existing data accessibility methods such as structured queries, keyword-based search and visual query systems. With schema-less databases containing potentially millions of dynamically changing attributes, it becomes unfeasible for some users to become aware of the 'schema' or vocabulary in order to query the database. At this scale, the effort in understanding the schema in order to build a structured query can become prohibitive. == Schema-agnostic queries == Schema-agnostic
|
{"page_id": 51295111, "title": "Schema-agnostic databases"}
|
The Oracle is a fictional character in The Matrix franchise. She was created by The Wachowskis, and portrayed by Gloria Foster in the first and second film and Mary Alice in the third film. The character also appears in the video game Enter the Matrix and the massively multiplayer online role-playing game The Matrix Online. == Character history == === Appearances === In the first film, the Oracle is depicted as a cheerful old lady who smokes cigarettes and bakes cookies. She possesses the power of foresight, which she uses to advise and guide the humans attempting to fight the Matrix. Later, she is revealed to be a sapient program who is integral to the very nature of the Matrix itself. The Oracle is played by Gloria Foster in The Matrix and The Matrix Reloaded, and by Mary Alice in The Matrix Revolutions and Enter the Matrix, one of the franchise's video games. In reality, Mary Alice played the Oracle because Gloria Foster died of complications from diabetes before her role in Matrix Revolutions was shot. Neo meets with the Oracle three times over the course of the series. In The Matrix, Neo meets the Oracle in an apartment filled with various "potentials" — children whose ability to control their surroundings suggests that they may be The One. During Reloaded, he returns to the apartment only to find it empty, then later finds her waiting for him in a paved courtyard between city buildings. She has with her a purse filled with candies that resemble the red pill Neo took to free himself from the Matrix. In Revolutions, the two meet in the kitchen of the apartment, sometime after Morpheus and Trinity seek her advice in the living room. === The Prophecy of the One === In The Matrix, Agent
|
{"page_id": 477591, "title": "The Oracle (The Matrix)"}
|
Eugene Lodewick Grant (February 15, 1897 – July 9, 1996), was an American civil engineer and educator. He graduated with a BS from the University of Wisconsin in 1917. He started teaching in 1920 at Montana State University and then in 1930 at the School of Engineering, Stanford University where he taught until 1962. He is known for his work in Engineering Economics with his textbook first published in 1930. Grant was the intellectual heir of work performed by John Charles Lounsbury Fish who published Engineering Economics: First Principles in 1923, providing the critical bridge between Grant and the pioneering effort of Arthur M. Wellington in his engineering economics work of the 1870s. Grant was awarded many academic and professional honors such as an honorary doctorate in civil engineering at Montana State University; Fellow of the American Statistical Association, American Society for Quality(ASQ) and the American Association for the Advancement of Science as well as membership in the National Academy of Engineering in 1987. He was part of the effort to found the American Society for Quality which awarded Grant its top award, the Shewhart Medal in 1952. In 1967, ASQ created the E.L. Grant Award which is granted annually to the individual who has been deemed to have demonstrated outstanding leadership in the areas of educational programs in quality. Joseph Juran said that Grant was a "quiet doer who didn't receive enough credit for what he did" and did much to advance the field of quality to what it was in the middle of the 20th century. == Early life and career == Eugene Lodewick Grant was born on February 15, 1897, in Chicago, Illinois, to Bertrand Eugene and Eva May (Lodewick). In 1923, he married Mildred Brooks Livingston and they had one child, Nancy Livingston. He attended University
|
{"page_id": 56616066, "title": "Eugene L. Grant"}
|
solve basic algorithmic questions like linked lists or binary trees during interviews).. I've seen code written by so-called "senior" engineers that should never have made it past review; had they simply paid attention in their CS 101 courses, it wouldn't exist. On top of that, as long as poor software quality doesn’t hurt a company's bottom line, why would executives care if their app takes 20 seconds to load? Consumers have become desensitized to bloat, and regulators remain asleep at the wheel.. laweijfmvo 3 months ago | parent | next [–] There are plenty of us that would love to just sit and fix things all day, but then you get a poor performance review for not shipping new features and find yourself out of a job :) markus_zhang 3 months ago | root | parent | next [–] I wonder how can I join MSFT or Apple just to fix stuffs? Don't care about salary as long as it's on par with my current one. AlotOfReading 3 months ago | root | parent | next [–] That's not how Apple works. You'd be given requirements specific to your team and expected to implement them. End of story. You wouldn't be empowered to seek out other teams and fix their stuff (or even necessarily talk to them). It's deliberate and intentional to have very few people with that cross-functional power. JKCalhoun 3 months ago | root | parent | next [–] You're right and not right. There were the infrequent occasions when an engineer would be tracking down a problem they were having and end up in another teams framework/code. A Radar would be created, a polite code diff attached and, often, the team would take the patch and roll it into the next build. It did not happen often
|
{"source": 1705, "title": "from dpo"}
|
Jan Stovicek, we will present some criteria for the existence of such uniform upper bounds in terms of certain form of generation in singularity categories. One ingredient of our approach is based on certain generalizations of the ”delooping level” of Gélinas. (Received September 10, 2024) 1203-16-44330 Andrew B Conner* , Peter Goetz . Algebras associated to inverse systems of projective schemes. Let \k be an algebraically closed field. Let \mathscr Z=\{Z_d\subset (\P ^n)^{\times d}\} be a sequence of subschemes having the property that , where project onto the first and last factors, respectively. Artin-Tate-van den Bergh described a canonical way to associate a graded algebra to the sequence . Of principal interest in noncommutative projective geometry is the following special case: Let be a free associative \k-algebra, and a homogeneous ideal. Let be the subscheme of zeros of elements of , viewed as multilinear forms on . If is a quadratic, three-dimensional Artin-Schelter regular algebra, then for all , and is the graph of an automorphism \s of . In that case, is isomorphic to the twisted homogeneous coordinate ring of (E,\s ). This is not true when is a non-degenerate 4-dimensional Sklyanin algebra; however, one can recover from . In this talk we will discuss the ring structure of , and describe its relationship to the twisted homogeneous coordinate ring construction. (Received September 10, 2024) 1203-16-44357 Aria Masoomi* . Irreducible Representations of Quantum Flag Varieties at Roots of Unity. Preliminary report. In this work, we focus on classifying irreducible representations of the Quantum function algebra at a root of unity for partial flag varieties , where is a simply connected, semisimple algebraic group over a field of characteristic 0, and is a primitive root of unity for an odd positive integer, and . Our approach involves descending the action
|
{"source": 3883, "title": "from dpo"}
|
BCG +13a, DFGK14, Gro16]. The approaches of [GGPR13, PHGR13], which led to concretely efficient proofs were generalized in [BCI +13] under the concept of Linear PCP (LPCP) and extractable linear-only encryption scheme, that is, an encryption scheme where a valid new ciphertext output by the adversary is an affine combination of the encryptions that the adversary sees as input. 11 4.1 Non-Falsifiable Assumptions Noteworthy is that all SNARG constructions are based on non-falsifiable assumptions [Nao03b], a class of assumptions that is likely to be inherent in proving the security of SNARGs (without random oracles), as stated by Gentry and Wichs in their work [GW11]. They show that no construction of SNARGs can be proven secure via a black-box reduction from any falsifiable assumption (unless that assumption is already false). Most standard cryptographic assumptions are falsifiable (e.g., hardness of factoring, DLog , RSA , CDH ,etc.) in the sense of the formal notion of cryptographic falsifiability introduced by Naor [Nao03a]. Roughly speaking, a computational hardness assumption is said to be falsifiable if it can be formulated in terms of a challenge: an interactive protocol between an adversary and a challenger (verifier), where an efficient adversary can convince the verifier to accept if and only if the assumption is false, meaning that if the assumption were false, then it would be possible to prove it. Intuitively, assumptions that are not falsifiable are more laborious to reason about, and therefore we have significantly less confidence in them. The knowledge assumptions are the most common non-falsifiable assumptions that we use in cryp-tography. They are considered non-standard assumptions. Knowledge assumptions capture our belief that certain computational tasks can be achieved efficiently only by (essentially) going through specific intermediate stages and thereby obtaining, along the way, some specific intermediate values. A number of different knowledge assumptions
|
{"source": 6429, "title": "from dpo"}
|
there are five simultaneous Neils (that are known) in the world during the moments of the climactic scene inside the Stalsk-12 hypocenter where he dies (two inverted and one normal on the battlefield, one inverted at the opera siege and one more normal somewhere else in the world who will later meet the Protagonist in Neil's first appearance of the film), and the implication is that an older future Protagonist is orchestrating the events of the film behind the scenes without ever being seen by the viewer or his past self, in an example of a temporal pincer movement. Inversion also sets up bootstrap paradoxes, whereby events are caused by themselves in a "chicken or the egg" scenario. Free will is a theme in Tenet. There are suggestions that Tenet's universe is deterministic, so what happens (including bootstrap paradoxes) will always happen, and consequently, there is arguably no free will. One of the film's common refrains, "ignorance is our ammunition", could hint at the illusionist stance that free will does not exist but people should act as if they have free will. However, the characters (especially Neil) express uncertainty as to whether history can be altered, and say several times during the film, "what's happened, happened". Neil's attitude towards free will could be interpreted as compatibilist, whereby free will and determinism are seen as compatible. Kat is seen as the character who most strongly embodies free will in Tenet by choosing to stray from the plan and shoot Sator, at which point she is free from his control. Kat relays to the Protagonist that when she was returning with Max to Sator's yacht in Vietnam and saw a woman (her future self, unbeknownst to past Kat) diving gracefully off the yacht, she felt jealous of that woman's freedom. Similarly, there
|
{"page_id": 59770239, "title": "Tenet (film)"}
|
Meat extenders are non-meat substances with substantial protein content. They are used to partially replace meat in a meat product. Extenders are distinguished from fillers by their high protein content, compared to the high carbohydrate content of fillers. Extenders were originally used to reduce costs, but they were later used to make meat products more healthy by adding plant protein, dietary fiber, or to improve the texture. Meat extenders were used in the United States in the 1940s, with rolled oats used as an extender in sausage meat, and dishes such as stuffed cabbage were considered to be a suitable way of extending meat. By the 1970s, soy protein was commonly used as a meat extender. Textured vegetable protein, which was invented in the 1960s, has become a common extender in the 1990s. == See also == List of meat substitutes Fillers Meat analogue == References ==
|
{"page_id": 31613711, "title": "Meat extenders"}
|
caseinate anions, which can ultimately cause the cross-linked caseinate to form pockets of hydrophobic regions. Calcium caseinate forms visco-elastic suspensions which increase remarkably when increasing concentration (50–300 g L−1) and decreasing temperature(10–50 °C). == Application in food == Several foods, baked goods, creamers, and toppings all contain a variety of caseinates. Calcium caseinate's nutritional benefits include improving the structure configuration of foods; emulsifying and stabilizing fat; and enhancing foaming and foam stability. Sodium caseinate acts as a greater food additive for stabilizing processed foods, however companies could opt to use calcium caseinate to increase calcium content and decrease sodium levels in their products. There are two Calcium Caseinate forms, spray-dried (Scaca) or roller-dried (Rcaca) which are used for multiple applications. Scaca can be found in dry milk powder, instant soups, medications, and instant coffee. It plays an important role in the conversion of fruit and vegetable juices into instant powders, instant coffees and teas, drying of eggs and dairy products such as ice cream mixes. Rcaca is mostly used in meat products and processed cheese. At high temperatures, Scaca can decrease while there is no impact on Rcaca. Some mechanical properties such as Fibrous calcium caseinate gel shows that its structure is more anisotropic than plant-based meat analogue candidates. Its formation is strongly influenced because of its solvent isotope effect. 30% of Scaca mixed with H2O gives more anisotropic fibers. On the other hand, Rcaca results in a homogeneous gel meaning that there is no effect. This demonstrates that both Scaca and Rcaca make a significant impact in the field of food science, given that these methods are commonly used for the industrial production of food biopolymers. == Calcium caseinate role in the body == === Muscle mass === Caseinate, being a protein, plays an important role for muscle hypertrophy,
|
{"page_id": 2410430, "title": "Calcium caseinate"}
|
and other cameras. These lenses will not work on the Phase One XF unless modified. All Mamiya 645 lenses are multi-coated. Nearly all have curved aperture blades, rendering smooth backgrounds at wider aperture settings. The internal shutter in the first-generation 645 bodies only supported flash synchronization at 1/60th of a second. This made outdoors fill flash difficult, and so some lenses were equipped with a built-in leaf shutter which supported flash synchronization at all speeds up to 1/500th of a second. Leaf shutter lenses had a separate PC socket. In order to take advantage of the faster speeds the internal shutter had to be fired at 1/30th of a second or slower. ==== Lens abbreviations ==== A or APO — the lens has an apochromatic (or near-apochromatic) design C — the lens is stamped “Sekor C” on the lens barrel. All manual-focus lenses for Mamiya 645 are Sekor C lenses, which Mamiya used to designate multi-coated lenses. E — only for the 70mm f/2.8 E lens sold as a kit with the original M645, apparently late in the M645's production run to differentiate it from the leaf-shutter version. Macro — the lens is optimized for close focusing and close-up (macro) photography N — the lens has a "new" cosmetic design. "N" lenses were launched with the second generation manual-focus cameras. Many "N" lenses are the same as their prior "C" or "S" lens version, but have changes to the lens coatings and a plastic aperture ring instead of metal. Some "C" lenses received a cosmetic update (removal of the chrome on the focus ring) but were not otherwise changed and did not receive a "N" marking, such as the 50mm f/4.5 and 500mm f/5.6. "N" lenses may also be called "CN" lenses. N/L — the lens has the "new" cosmetic
|
{"page_id": 58471071, "title": "Mamiya 645"}
|
A diplexer is a passive device that implements frequency-domain multiplexing. Two ports (e.g., L and H) are multiplexed onto a third port (e.g., S). The signals on ports L and H occupy disjoint frequency bands. Consequently, the signals on L and H can coexist on port S without interfering with each other. Typically, the signal on port L will occupy a single low frequency band and the signal on port H will occupy a higher frequency band. In that situation, the diplexer consists of a lowpass filter connecting ports L and S and high pass filter connecting ports H and S. Ideally, all the lowband signal power on port L is transferred to the S port and vice versa. All the highband signal power on port H is transferred to port S and vice versa. Ideally, the separation of the signals is complete. None of the low band signal is transferred from the L port to the H port. In the real world, some power will be lost, and some signal power will leak to the wrong port. The diplexer, being a passive device, is normally reciprocal: the device itself doesn't have a notion of input or output. However poorly designed diplexers may have differing impedance on various ports, so it should not simply be assumed that any such device is fully reciprocal unless it is stated or the return loss measured. The diplexer is a different device than a passive combiner or splitter. The ports of a diplexer are frequency selective; the ports of a combiner are not. There is also a power "loss" difference - a combiner takes all the power delivered to the S port and equally divides it between the A and B ports. A diplexer does not. A diplexer frequency multiplexes two ports onto one
|
{"page_id": 948432, "title": "Diplexer"}
|
two being potentially renewable and perpetual. Nonrenewable resources, such as fossil fuels and metals, are finite, and therefore cannot be replenished during human lifetime, but are being depleted at a high rate. Due to their importance in many economies, this creates an issue as the world keeps developing the technologies used to exploit these resources. Some important roles of these nonrenewable resources are to heat homes, fuel cars, and build infrastructure. Environmental geology has been used to approach this issue with the sustainable development of recycling and reusing. Recycling is the process of collecting recyclable consumer and industrial materials and products and then sorting them so they can be processed into raw materials with the intention of then using the raw materials to create new products. Recycling and reusing can be done on an individual scale as well as an industrial scale. These practices maximize the usage of resources as much as possible all while minimizing waste. They also manage the industrial and domestic waste disposal as they reduce the amount of waste discharged into the global environment. Reusing and recycling include: composting: the biological decomposition of organic garden and food waste in order to use it as soil conditioner, upcycling: increasing the value and quality in materials and products through the recycling process, freecycling: giving or getting free items from others before buying new ones industrial ecology: dismantling of massive artifacts to become input for new processes Environmental geology's approach to the decline of nonrenewable resources along with high amounts of waste polluting the Earth has been to reduce wasteful usage and recycle when possible. === Land use === Planning out the usage of land is important to reduce the risk of natural hazards on humans and their infrastructure, but mostly to reduce negative human impact on the natural
|
{"page_id": 72584, "title": "Environmental geology"}
|
updates to keep the database in sync with upstream data providers (in release 5), and the incorporation of a multilayer network model to guide Drug repositioning through nice user-friendly visualizations (in release 6). == See also == ChEMBL == References ==
|
{"page_id": 32616043, "title": "TDR Targets"}
|
In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin. == Definition and characterization of centrality indices == Centrality indices are answers to the question "What characterizes an important vertex?" The answer is given in terms of a real-valued function on the vertices of a graph, where the values produced are expected to provide a ranking which identifies the most important nodes. The word "importance" has a wide number of meanings, leading to many different definitions of centrality. Two categorization schemes have been proposed. "Importance" can be conceived in relation to a type of flow or transfer across the network. This allows centralities to be classified by the type of flow they consider important. "Importance" can alternatively be conceived as involvement in the cohesiveness of the network. This allows centralities to be classified based on how they measure cohesiveness. Both of these approaches divide centralities in distinct categories. A further conclusion is that a centrality which is appropriate for one category will often "get it wrong" when applied to a different category. Many, though not all, centrality measures effectively count the number of paths (also called walks) of some type going through a given vertex; the measures differ in how the relevant walks are defined and counted. Restricting consideration to this group allows for taxonomy which places many centralities on a spectrum from those concerned with walks of length one (degree centrality) to infinite walks (eigenvector centrality). Other centrality
|
{"page_id": 1462712, "title": "Centrality"}
|
engineer William Edwards Deming, who was initially ignored by his home country. The same methods of quality control later turned Japanese factories into world leaders in cost-effectiveness and production quality. 3. Industrial robots on the factory floor, introduced in the late 1970s: These computer-controlled welding arms and grippers could perform simple tasks such as attaching a car door quickly and flawlessly 24 hours a day. This cut costs and improved production speed. == History == The history of manufacturing engineering can be traced to factories in the mid-19th century USA and 18th century UK. Although large home production sites and workshops were established in China, ancient Rome, and the Middle East, the Venice Arsenal provides one of the first examples of a factory in the modern sense of the word. Founded in 1104 in the Republic of Venice several hundred years before the Industrial Revolution, this factory mass-produced ships on assembly lines using manufactured parts. The Venice Arsenal apparently produced nearly one ship every day and, at its height, employed 16,000 people. Many historians regard Matthew Boulton's Soho Manufactory (established in 1761 in Birmingham) as the first modern factory. Similar claims can be made for John Lombe's silk mill in Derby (1721), or Richard Arkwright's Cromford Mill (1771). The Cromford Mill was purpose-built to accommodate the equipment it held and to take the material through the various manufacturing processes. One historian, Jack Weatherford, contends that the first factory was in Potosí. The Potosi factory took advantage of the abundant silver that was mined nearby and processed silver ingot slugs into coins. British colonies in the 19th century built factories simply as buildings where a large number of workers gathered to perform hand labor, usually in textile production. This proved more efficient for the administration and distribution of materials to individual
|
{"page_id": 11200529, "title": "Manufacturing engineering"}
|
SQL Server Management Objects (SMO) are .NET objects introduced by Microsoft as of Microsoft SQL Server 2005, designed to allow for easy and simple programmatic management of Microsoft SQL Server. Using SMO, .NET programmers can design applications similar in functionality to Microsoft's SQL Server Management Studio. SMO objects comes with all SQL Server versions starting from SQL Server 2005 (2005, 2008, 2008R2, 2012, 2014, 2016). It is included in all SQL Server editions, including the Express Edition. == References ==
|
{"page_id": 20976986, "title": "SQL Server Management Objects"}
|
all times most ready and willing to favour the public with as many "merrie peals" as may be required. We really think that great credit is due to Mr. Champion and his coadjutors, no less for their unremitting exertions in the hanging of the bells, and in arranging definitively for their purchase by becoming security for a considerable sum of money, but for their judgment in selecting colonial youths as ringers, who will become, as it were, identified with the vocation, and very soon acquire the means of delighting us with a peal as well rung, as any in Old England itself. The bells have been cast by one of the first founders in London, and all that is required is attentive practice to ensure perfect success. In the meantime those who have placed their names upon the subscription list, ought to make good their payments, while others who have not done so, should forthwith perform this pleasing duty, so that the bells may be exclusively the property of the public. "THE BELLS", The Britannia and Trades' Advocate (6 July 1848), 3 The choir of Bell-ringers deserve greater praise than can be awarded. Night after night they practise without any remuneration, or reward beyond the satisfaction of gradually making themselves perfect in an art which cannot but afford pleasure to others. Mr. Champion, as the number one of the club, deserves a testimonial which he can hand down to after times, and every other promoter of the manly British exercise, so congenial to the feelings of us all, ought also to be held in kindly estimation. Let every one remember that the bells ring nearly every night, without any charge upon the community of a single shilling, and let those who grumble at a wrong pull now and then,
|
{"source": 959, "title": "from dpo"}
|
ignored when the ‘ --text-section-literals ’ op-tion is not used. The assembler will automatically place text section literal pools before ENTRY instruc-tions, so the .literal_position directive is only needed to specify some other location for a literal pool. You may need to add an explicit jump instruction to skip over an inline literal pool. For example, an interrupt vector does not begin with an ENTRY instruction so the as-sembler will be unable to automatically find a good place to put a literal pool. Moreover, the code for the interrupt vector must be at a specific starting address, so the literal pool cannot come before the start of the code. The literal pool for the vector must be explic-itly positioned in the middle of the vector (before any uses of the literals, of course). The .literal_position directive can be used to do this. In the following code, the literal for ‘M’ will automatically be aligned correctly and is placed after the unconditional jump. Chapter 8: Machine Dependent Features 197 .global M code_start: j continue .literal_position .align 4 continue: movi a4, M ## 8.33.5.7 literal prefix The literal_prefix directive allows you to specify different sections to hold literals from different portions of an assembly file. With this directive, a single assembly file can be used to generate code into multiple sections, including literals generated by the assembler. .begin literal_prefix [ name ].end literal_prefix For the code inside the delimited region, the assembler puts literals in the section name .literal . If this section does not yet exist, the assembler creates it. The name parameter is optional. If name is not specified, the literal prefix is set to the “default” for the file. This default is usually .literal but can be changed with the ‘ --rename-section ’command-line argument. ## 8.33.5.8 freeregs This directive
|
{"source": 2314, "title": "from dpo"}
|
ephraim ephram ephrayim ephrem ephron epi epic epicure epicurean epicycle epicyclic epidemic epidemiologie epidemiology epidermic epidermis epifani epifanio epigenetic epigram epigrammatic epigraph epileptic epilog epilogue epimorphism epiphanie epiphany epiphyseal epiphysis episcopal episcopalian episcopate episode episodes episodic epistemology epistle epistolatory epita epitaph epitaxial epitaxy epithelial epithelium epithet epitome epk epkzz epl eplans eplx epn epo epoch epochal epoche epois epoque epos epoxy epp eppel eppelmann eppensteiner eppenstiner epperly epperson eppich epping epple eppler epplett eppling epps eppstein eppsteiner epri eprom eproms eps epscs epsilon epsom epson epsonuk epstein epting epyicd epyuh eq eqa eqeu eqf eqh eqk eql eqp eqpt eqs equ equable equal equalization equalizer equally equals equaly equanimity equate equated equates equation equations equatorial equestrian equial equidistant equifax equilateral equilibrate equilibria equilibrium equimpment equine equinoctial equinox equip equipe equiped equipement equipent equipment equipmentc equipoise equipotent equipped equipping equips equitable equitation equity equiv equivalence equivalences equivalency equivalent equivalents equivaut equivocal equivocate equlpment equpiment eqv eqx er era erachtens erachtet eradicable eradicate eradication erah eraiba eramo eran erano erar erarbeiten erarbeitet erarbeitete erarbeiteten erarbeiteter erarbeitung erasable erase erased erasers erases erasing erasmia erasmus erastus erasure eratea eratives erato eratosthenes erb erba erbach erberus erbes erbilgin erbittersten erbitterte erbitterten erbium erblicken erblickten erboste erbracht erbringen erbringt erby erc ercb ercc ercim ercolani erd erda erdacht erdal erdbeben erdbebenwellen erde erdei erdem erden erdenklichen erdentfernung erdgeschoss erdie erdkunde erdman erdmann erdmasse erdoberflaeche erdoel erdos erdrueckt erdulden erdwin ere erect erected erectus ered eredia erehebliche erehw ereichbar ereignis ereignisprofilen ereignisse ereignissen erek erena erenity erenj erep ereth erevax erewi erez erf erfa erfaehrt erfahen erfahre erfahren erfahrene erfahrenen erfahrener erfahreneren erfahrenheit erfahrung erfahrungen erfahrungs erfahrungsaus erfahrungsaustausch erfahrungsaustausches erfahrungsaustauschkreis erfahrungsboerse erfahrungschatz erfahrungsgemaess erfahrungspunkte erfahrungswelt erfahrungswissenschaftlicher erfakreis erfakreise erfakreisen erfani erfassbare erfassen erfasst erfassung erfassungs erfgcuoy erfinden erfinder erfinders erfindung erfindungskraft erfolg erfolge erfolgen erfolges erfolglos
|
{"source": 5213, "title": "from dpo"}
|
and we all need stepping stones to get to better designs and analyses at the very end. We hope to have contributed to that field, in particular, to block ciphers. Analyzing the AES and constructions based upon it is an enormously interesting field whose details are still not fully understood. Authenticated encryption is one of the most important applications of primitives. In this context, this work tried to build a bracket to study and use tweakable block ciphers and in particular such based on the AES for higher security. During the work, we identified methods for implementing high-speed cryptography on modern pro-cessors. All of our works are therefore accompanied by implementations freely available to the public. Our main objective has been to connect the dots between existing works to improve the existing analysis and AE schemes. Some of our observations were a little surprising while working on them. One example was the simple change from a three-round unbalanced Feistel cipher only by fixing one plaintext input to RIV. While the three-round Feistel construction is well-known for decades to be insecure against chosen-plain and -ciphertext attacks, RIV became robust against the repetition of nonces as well as leakage of plaintext, that is robust in a very strong sense of chosen-plain and -ciphertext security. The previous years have mainly gone a step backward towards the identification of novel properties of AES-like ciphers [GRR17, Gra17b, SLG +16a] that cover fewer rounds instead of \epsilon improvements in terms of the best attacks. Our observation has taken part in this movement. Though, we see that this direction yields exciting observations that are likely to yield stronger distinguishing and key-recovery attacks in the close future. We and 184 CHAPTER 11. SUMMARY AND OUTLOOK other researchers, as in [Røn19] are actively working on further generalizing our attacks
|
{"source": 6182, "title": "from dpo"}
|
of this approximation, "It was, and indeed still is, hard to improve on the original van der Waals recipe when expressed in [this] form". == Validity of the equation == Since van der Waals presented his thesis, "[m]any derivations, pseudo-derivations, and plausibility arguments have been given" for it. However, no mathematically rigorous derivation of the equation over its entire range of molar volume that begins from a statistical mechanical principle exists. Indeed, such a proof is not possible, even for hard spheres. Goodstein writes, "Obviously the value of the van der Waals equation rests principally on its empirical behavior rather than its theoretical foundation." Although the use of the vdW equation is not justified mathematically, it has empirical validity. Its various applications in this region that attest to this, both qualitative and quantitative, have been described previously in this article. This point was also made by Alder, et al. who, at a conference marking the 100th anniversary of van der Waals' thesis, noted that: It is doubtful whether we would celebrate the centennial of the Van der Waals equation if it were applicable only under circumstances where it has been proven to be rigorously valid. It is empirically well established that many systems whose molecules have attractive potentials that are neither long-range nor weak conform nearly quantitatively to the Van der Waals model. An example is the theoretically much studied system of Argon, where the attractive potential has only a range half as large as the repulsive core. They continued by saying that this model has "validity down to temperatures below the critical temperature, where the attractive potential is not weak at all but, in fact, comparable to the thermal energy." They also described its application to mixtures "where the Van der Waals model has also been applied with great
|
{"page_id": 206064, "title": "Van der Waals equation"}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.