source
stringlengths 31
227
| text
stringlengths 9
2k
|
|---|---|
https://en.wikipedia.org/wiki/Society%20for%20Mathematical%20Biology
|
The Society for Mathematical Biology (SMB) is an international association co-founded in 1972 in the United States by George Karreman, Herbert Daniel Landahl and (initially chaired) by Anthony Bartholomay for the furtherance of joint scientific activities between Mathematics and Biology research communities. The society publishes the Bulletin of Mathematical Biology, as well as the quarterly SMB newsletter.
History
The Society for Mathematical Biology emerged and grew from the earlier school of mathematical biophysics, initiated and supported by the Founder of Mathematical Biology, Nicolas Rashevsky. Thus, the roots of SMB go back to the publication in 1939 of the first international journal of mathematical biology, previously entitled "The Bulletin of Mathematical Biophysics"—which was founded by Nicolas Rashevsky, and which is currently published by SMB under the name of "Bulletin of Mathematical Biology". Professor Rashevsky also founded in 1969 the non-profit organization "Mathematical Biology, Incorporated"—the precursor of SMB. Another notable member of the University of Chicago school of mathematical biology was Anatol Rapoport whose major interests were in developing basic concepts in the related area of mathematical sociology, who cofounded the Society for General Systems Research and became a president of the latter society in 1965. Herbert D. Landahl was initially also a member of Rashevsky's school of mathematical biology, and became the second president of SMB in the 1980s; both Herbert Landahl and Robert Rosen from Rashevsky's research group were focused on dynamical systems approaches to complex systems biology, with the latter researcher becoming in 1980 the president of the Society for General Systems Research.
Leadership
The Society for Mathematical Biology is governed by its Officers and Board of Directors, elected by the membership. Current SMB President is Jane Heffernan (York University), and Past-President serving as vice president is Heik
|
https://en.wikipedia.org/wiki/Ivan%20Panin%20%28mathematician%29
|
Ivan Aleksandrovich Panin (Иван Александрович Панин, born 2 July 1959 in Apatity, Russia) is a Russian mathematician, specializing in algebra, algebraic geometry, and algebraic K-theory.
Education and career
In 1973 he entered boarding school at D. K. Faddeev Academic Gymnasium and graduated there in 1976 There he graduated in 1981 from the Faculty of Mathematics and Mechanics of Saint Petersburg State University. At the St. Petersburg Department of Steklov Institute of Mathematics of Russian Academy of Sciences (abbreviated ПОМИ им. В. А. Стеклова РАН in Russian), he defended in 1984 his thesis for the degree of candidate of physical and mathematical sciences (Ph.D.) with supervisor Andrei Suslin and then became employed there as a staff member. Panin received in 1996 the degree of Doctor nauk from the St. Petersburg Department of Steklov Institute of Mathematics of Russian Academy of Sciences. There in 1999 he became the head of the laboratory of algebra and number theory. In 2003 he was elected a corresponding member of the Russian Academy of Sciences in the Department of Mathematical Sciences. In 2018 in Rio de Janeiro he was an invited speaker at the International Congress of Mathematicians.
Research
The main directions of I. A. Panin's work are the theory of oriented cohomology on algebraic varieties, algebraic K-theory of homogeneous varieties, Gersten's conjecture, the Grothendieck-Serre conjecture on principal G-bundles, and purity in algebraic geometry.
I. A. Panin proved (together with A. L. Smirnov) theorems of the Riemann-Roch type for oriented cohomology theories and Riemann-Roch type theorems for the Adams operation. Panin found a proof of Gersten's conjecture in the case of equal characteristic and an affirmative solution (jointly with Manuel Ojanguren) of the "purity" problem for quadratic forms.
Panin computed the algebraic K-groups of all twisted forms of flag varieties and all principal homogeneous spaces over the inner forms of semisimple a
|
https://en.wikipedia.org/wiki/Hemibiotrophs
|
Hemibiotrophs are the spectrum of plant pathogens, including bacteria, oomycete and a group of plant pathogenic fungi that keep its host alive while establishing itself within the host tissue, taking up the nutrients with brief biotrophic-like phase. It then, in later stages of infection switches to a necrotrophic life-style, where it rampantly kills the host cells, deriving its nutrients from the dead tissues.
This mode of interaction, in which initial biotrophy followed by a switch to necrotrophy, has been observed in the fungal model Magnaporthe oryzae (rice blast fungus) and other pathogens such as many Colletotrichum spp. (often called anthracnose diseases, e.g. Colletotrichum lindemuthianum), Southern corn leaf blight (Bipolaris maydis) and, Zymoseptoria tritici (syn. Mycosphaerella graminicola, leaf blotch of wheat). Collectively, they represent some of the most destructive plant parasites, causing huge economic losses, threatening global food security.
A spectrum of hemibiotrophic plant pathogens, including the bacterium Pseudomonas syringae and the oomycete Phytophthora infestans (potato blight), also exhibit characteristics of both biotrophs and necrotrophs and thus are called hemibiotrophs, depending on the stages of their life cycle.
Life style
In contrast to biotrophs, hemibiotrophs have dual life-styles. The initial biotrophic life-style of hemibiotrophs causes minimum damage to the plant tissues, while the fungus obtains nutrients from living plant tissues Hemibiotrophic fungi require living plant tissue to survive to complete their life cycle.
Most fungal hemibiotrophs develop haustoria, whereas some produce intracellular hyphae to acquire nutrients from the host cytoplasm. However, in the hemibiotrophic life-style the pathogen later breaks down host cell walls through secretion of hydrolytic enzymes and feeds on the released nutrients. These hydrolytic enzymes and toxins are synthesized during the later necrotrophic phase. They also produce ex
|
https://en.wikipedia.org/wiki/Life%20Sciences%20Research%20Foundation
|
The Life Sciences Research Foundation (LSRF) is a postdoctoral fellowship program, with missions "to identify and fund exceptional young scientists at a critical juncture of their training in all areas of basic life sciences" and "to establish partnerships between those who support research in the life sciences and academic institutions for their mutual benefit".
Historical background
LSRF was established in 1983 by Donald D. Brown of the Carnegie Institution for Science Department of Embryology. As one of four highly competitive postdoctoral awards in the life sciences, each year LSRF receives more than 1000 applications and awards 15-25 fellowships. The Board of Directors also includes Douglas Koshland and Solomon H. Snyder. The 56 sponsors include many top companies in the biotech and pharmaceutical industry.
In 2012, Brown won the Albert Lasker Special Achievement Award in Medical Science, in part for his initiation and 30-year dedication to LSRF.
Alumni
Notable alumni include：
Philip Beachy of Stanford
Ben Barres of Stanford
George M. Church of Harvard
Gerald F. Joyce of the Scripps Research Institute
Robert Sapolsky of Stanford.
|
https://en.wikipedia.org/wiki/Radon%E2%80%93Nikodym%20theorem
|
In mathematics, the Radon–Nikodym theorem is a result in measure theory that expresses the relationship between two measures defined on the same measurable space. A measure is a set function that assigns a consistent magnitude to the measurable subsets of a measurable space. Examples of a measure include area and volume, where the subsets are sets of points; or the probability of an event, which is a subset of possible outcomes within a wider probability space.
One way to derive a new measure from one already given is to assign a density to each point of the space, then integrate over the measurable subset of interest. This can be expressed as
where is the new measure being defined for any measurable subset and the function is the density at a given point. The integral is with respect to an existing measure , which may often be the canonical Lebesgue measure on the real line or the n-dimensional Euclidean space (corresponding to our standard notions of length, area and volume). For example, if represented mass density and was the Lebesgue measure in three-dimensional space , then would equal the total mass in a spatial region .
The Radon–Nikodym theorem essentially states that, under certain conditions, any measure can be expressed in this way with respect to another measure on the same space. The function is then called the Radon–Nikodym derivative and is denoted by . An important application is in probability theory, leading to the probability density function of a random variable.
The theorem is named after Johann Radon, who proved the theorem for the special case where the underlying space is in 1913, and for Otto Nikodym who proved the general case in 1930. In 1936 Hans Freudenthal generalized the Radon–Nikodym theorem by proving the Freudenthal spectral theorem, a result in Riesz space theory; this contains the Radon–Nikodym theorem as a special case.
A Banach space is said to have the Radon–Nikodym property if the generalization of the Radon
|
https://en.wikipedia.org/wiki/Blastopirellula%20cremea
|
Blastopirellula cremea is an aerobic and motile bacterium from the genus of Blastopirellula which has been isolated from a dead ark clam (Scapharca broughtonii) from Korea.
|
https://en.wikipedia.org/wiki/HLA-Cw4
|
Alleles
|
https://en.wikipedia.org/wiki/Basic%20hostility
|
Basic hostility is a psychological concept first described by psychoanalyst Karen Horney. Horney described it as aggression which a child develops as a result of "basic evil". Horney generally defines basic evil as "invariably the lack of genuine warmth and affection". Basic evil includes all range of inappropriate parental behavior – from lack of affection to abuse. This situation of abuse and torment that can not be avoided or escaped causes kids to have a higher level of irritability. The same can be said for anxiety.
Background
Specifically, basic hostility pertains to a sense of anger and betrayal that a child feels towards his parents for their failure to provide a secure environment. Horney associated this concept with "basic anxiety", citing that the two are inseparably interwoven and are both offshoots of the "basic evil" of parental mistreatment. Their relationship can be explained in this manner: The existence of basic evil leads to basic hostility towards the parents and the world. Once such hostility is repressed it becomes basic anxiety or the feeling of being helpless.
The pattern of basic hostility
The child wants to leave, but cannot. Although the child wants to avoid the abuse, their parents are perpetrating it.
The child is dependent on their parents and therefore cannot move or back away.
The child therefore redirects their feelings and expressions of hostility toward people they do not depend on for support.
According to Horney, some children find Basic Hostility to be an aggressive coping strategy and continue using it to deal with life's problems.
See also
Basic anxiety
Disorganized attachment
|
https://en.wikipedia.org/wiki/Approximation%20algorithm
|
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under this conjecture, a wide class of optimization problems cannot be solved exactly in polynomial time. The field of approximation algorithms, therefore, tries to understand how closely it is possible to approximate optimal solutions to such problems in polynomial time. In an overwhelming majority of the cases, the guarantee of such algorithms is a multiplicative one expressed as an approximation ratio or approximation factor i.e., the optimal solution is always guaranteed to be within a (predetermined) multiplicative factor of the returned solution. However, there are also many approximation algorithms that provide an additive guarantee on the quality of the returned solution. A notable example of an approximation algorithm that provides both is the classic approximation algorithm of Lenstra, Shmoys and Tardos for scheduling on unrelated parallel machines.
The design and analysis of approximation algorithms crucially involves a mathematical proof certifying the quality of the returned solutions in the worst case. This distinguishes them from heuristics such as annealing or genetic algorithms, which find reasonably good solutions on some inputs, but provide no clear indication at the outset on when they may succeed or fail.
There is widespread interest in theoretical computer science to better understand the limits to which we can approximate certain famous optimization problems. For example, one of the long-standing open questions in computer science is to determine whether there is an algorithm that outperforms the 2-approximation for the Steiner Fores
|
https://en.wikipedia.org/wiki/Transition%20nuclear%20protein
|
Transition nuclear proteins (TNPs) are proteins that are involved in the packaging of sperm nuclear DNA during spermiogenesis. They take the place of histones associated with the sperm DNA, and are subsequently themselves replaced by protamines.
TNPs in humans include TNP1 and TNP2.
See also
Chromatin
Histone
Protamine
Sperm
Spermatogenesis
Spermiogenesis
|
https://en.wikipedia.org/wiki/MutS-1
|
MutS is a mismatch DNA repair protein, originally described in Escherichia coli.
Mismatch repair contributes to the overall fidelity of DNA replication and is essential for combating the adverse effects of damage to the genome. It involves the correction of mismatched base pairs that have been missed by the proofreading element (Klenow fragment) of the DNA polymerase complex. The post-replicative Mismatch Repair System (MMRS) of Escherichia coli involves MutS (Mutator S), MutL and MutH proteins, and acts to correct point mutations or small insertion/deletion loops produced during DNA replication.
MutS and MutL are involved in preventing recombination between partially homologous DNA sequences. The assembly of MMRS is initiated by MutS, which recognizes and binds to mispaired nucleotides and allows further action of MutL and MutH to eliminate a portion of newly synthesized DNA strand containing the mispaired base. MutS can also collaborate with methyltransferases in the repair of O(6)-methylguanine damage, which would otherwise pair with thymine during replication to create an O(6)mG:T mismatch. MutS exists as a dimer, where the two monomers have different conformations and form a heterodimer at the structural level. Only one monomer recognises the mismatch specifically and has ADP bound. Non-specific major groove DNA-binding domains from both monomers embrace the DNA in a clamp-like structure. Mismatch binding induces ATP uptake and a conformational change in the MutS protein, resulting in a clamp that translocates on DNA.
MutS is a modular protein with a complex structure, and is composed of:
N-terminal mismatch-recognition domain, which is similar in structure to tRNA endonuclease.
Connector domain, which is similar in structure to Holliday junction resolvase ruvC.
Core domain, which is composed of two separate subdomains that join together to form a helical bundle; from within the core domain, two helices act as levers that extend towards (but do not touch) t
|
https://en.wikipedia.org/wiki/Magnetohydrodynamics%20%28journal%29
|
Magnetohydrodynamics is a peer-reviewed physics journal published by the Institute of Physics of the University of Latvia, covering fundamental and applied problems of magnetohydrodynamics in incompressible media, including magnetic fluids. This involves both classical and emerging areas in the physics, thermodynamics, hydrodynamics, and electrodynamics of magnetic fluids. , the editor-in-chief is Andrejs Cēbers of the Institute of Physics of the University of Latvia. Since 2001 the journal has been published solely in English.
The English and online edition were published by Kluwer Academic Publishers (now part of Springer-Verlag) through volume 36, number 4 (2001). Now the entire content is available by subscription directly from the journal's website.
Abstracting and indexing
The journal is abstracted and indexed in the Science Citation Index Expanded, as well as the Journal Citation Reports, and Inspec.
|
https://en.wikipedia.org/wiki/NCR2
|
Natural cytotoxicity triggering receptor 2 is a protein that in humans is encoded by the NCR2 gene. NCR2 has also been designated as CD336 (cluster of differentiation 336), NKp44, NKP44; NK-p44, LY95, and dJ149M18.1.
|
https://en.wikipedia.org/wiki/Pack%20hunter
|
A pack hunter or social predator is a predatory animal which hunts its prey by working together with other members of its species. Normally animals hunting in this way are closely related, and with the exceptions of chimpanzees where only males normally hunt, all individuals in a family group contribute to hunting. When hunting cooperation is across two or more species, the broader term cooperative hunting is commonly used.
A well known pack hunter is the gray wolf; humans too can be considered pack hunters. Other pack hunting mammals include chimpanzees, dolphins, lions, dwarf and banded mongooses, and spotted hyenas. Avian social predators include the Harris's hawk, butcherbirds, three of four kookaburra species and many helmetshrikes. Other pack hunters include army ants, the goldsaddle goatfish, and occasionally crocodiles.
Pack hunting is typically associated with cooperative breeding and its concentration in the Afrotropical realm is a reflection of this. Most pack hunters are found in the southern African savannas, with a notable absence in tropical rainforests and with the exception of the wolf and coyote, higher latitudes. It is thought that either on the ancient and poor soils of the southern African savanna it is not possible for individual predators to find adequate food, or that the environment's inherent unpredictability due to ENSO or IOD events means that in very bad conditions it will not be possible to raise the young necessary to prevent declining populations from adult mortality. It is also argued that Africa's large area of continuous flat and open country, which was even more extensive while rainforest contracted during glacial periods of the Quaternary, may have helped encourage pack hunting to become much more common than on any other continent.
Around 80–95% of carnivores are solitary and hunt alone; the others including lions, wild dogs, spotted hyenas, chimpanzees, and humans hunt cooperatively, at least some of the time. Cooperative
|
https://en.wikipedia.org/wiki/Equity%20ratio
|
The equity ratio is a financial ratio indicating the relative proportion of equity used to finance a company's assets. The two components are often taken from the firm's balance sheet or statement of financial position (so-called book value), but the ratio may also be calculated using market values for both, if the company's equities are publicly traded.
The equity ratio is a very common financial ratio, especially in Central Europe and Japan, while in the US the debt to equity ratio is more often used in financial (research) reports.
Interpretation
The equity ratio is a good indicator of the level of leverage used by a company. The equity ratio measures the proportion of the total assets that are financed by stockholders, as opposed to creditors. A low equity ratio will produce good results for stockholders as long as the company earns a rate of return on assets that is greater than the interest rate paid to creditors.
|
https://en.wikipedia.org/wiki/Calpak%20Plant%20No.%2011
|
The Calpak Plant No. 11 in Sacramento, California, is a building built in 1925. Calpak (later renamed "Del Monte Foods") constructed the building as a fruit cannery but it is now used by Blue Diamond Almonds It was listed on the National Register of Historic Places in 1984.
See also
History of Sacramento Cannery Industry
List of canneries
|
https://en.wikipedia.org/wiki/264%20%28number%29
|
264 is the natural number following 263 and preceding 265.
In mathematics
264 is an even composite number, composed of three prime numbers multiplied together.
264 is a Harshad number.
264 can be divided by each of its digits.
In technology
Advanced Video Coding also known as "H-264"
+264 is the telephone country code for Namibia
Other fields
The calendar years 264 AD and 264 BC
The longest someone has gone without sleeping is 264 hours.
NGC 264, a lenticular galaxy
|
https://en.wikipedia.org/wiki/Synthetic%20measure
|
A synthetic measure (or synthetic indicator) is a value that is the result of combining other metrics, which are measurements of various features.
Examples
Quality of service
There is a method to measure quality of service in hotels. In related study authors aggregate tourist opinions, measured on a scale from 1 to 10. Synthetic measure (indicator) of service quality in each hotel is calculated with the help of the aggregation operator.
Project performance
Other study proposed to use classical parameters EV, PV and AC to carry out the synthetic measure of project performance.
Rankings of countries
Different normalized stimulants and destimulants were used in research to create synthetic measure that selects countries with the best and the worst levels of implementation of Europe 2020 targets.
|
https://en.wikipedia.org/wiki/Nirenberg%20and%20Matthaei%20experiment
|
The Nirenberg and Matthaei experiment was a scientific experiment performed in May 1961 by Marshall W. Nirenberg and his post-doctoral fellow, J. Heinrich Matthaei, at the National Institutes of Health (NIH). The experiment deciphered the first of the 64 triplet codons in the genetic code by using nucleic acid homopolymers to translate specific amino acids.
In the experiment, an extract was prepared from bacterial cells that could make protein without the presence of intact living cells. An artificial form of RNA consisting entirely of uracil-containing nucleotides (polyuridylic acid or poly-U) was added to the extract, causing it to form a protein composed entirely of the amino acid phenylalanine. This experiment cracked the first codon of the genetic code and showed that RNA controlled the production of specific types of protein.
Background
Discoveries by Frederick Griffith and improved on by Oswald Avery discovered that the substance responsible for producing inheritable change in the disease-causing bacteria (Streptococcus pneumoniae) was neither a protein nor a lipid, rather deoxyribonucleic acid (DNA). In 1944, he and his colleagues Colin MacLeod and Maclyn McCarty suggested that DNA was responsible for transferring genetic information. Later, Erwin Chargaff(1950) discovered that the makeup of DNA differs from one species to another. These experiments helped pave the way for the discovery of the structure of DNA. In 1953, with the help of Maurice Wilkins and Rosalind Franklin's X-ray crystallography, James Watson and Francis Crick proposed DNA is structured as a double helix.
In the 1960s, one main DNA mystery scientists needed to figure out was the number of bases found in each code word, or codon, during transcription. Scientists knew there was a total of four bases (guanine, cytosine, adenine, and thymine). They also knew that were 20 known amino acids. George Gamow suggested that the genetic code was made of three nucleotides per amino acid. He reasone
|
https://en.wikipedia.org/wiki/National%20Quantum%20Initiative%20Act
|
The National Quantum Initiative Act is an Act of Congress passed on December 13, 2018, and signed into law on December 21, 2018. The law gives the United States a plan for advancing quantum technology, particularly quantum computing.
Act
The act was passed unanimously by the United States Senate and was signed into law by President Donald Trump. The National Quantum Initiative (NQI) provides an umbrella under which a number of government agencies develop and operate programs related to improving the climate for quantum science and technology in the US, coordinated by the National Quantum Coordination Office. These agencies include the National Institute of Standards and Technology (NIST), the National Science Foundation (NSF), and the United States Department of Energy (DOE). Under the authority of the NQI, the NSF and the DOE have established new research centers and institutes, and NIST has established the Quantum Economic Development Consortium (QED-C), a consortium of industrial, academic, and governmental entities.
|
https://en.wikipedia.org/wiki/Wire%20%28software%29
|
Wire is an encrypted communication and collaboration app created by Wire Swiss. It is available for iOS, Android, Windows, macOS, Linux, and web browsers such as Firefox. Wire offers a collaboration suite featuring messenger, voice calls, video calls, conference calls, file-sharing, and external collaboration – all protected by a secure end-to-end-encryption. Wire offers three solutions built on its security technology: Wire Pro – which offers Wire's collaboration feature for businesses, Wire Enterprise – includes Wire Pro capabilities with added features for large-scale or regulated organizations, and Wire Red – the on-demand crisis collaboration suite. They also offer Wire Personal, which is a secure messaging app for personal use.
History
Skype's co-founder Janus Friis helped create Wire and many Wire employees previously worked for Skype. Wire Swiss GmbH launched the Wire app on 3 December 2014. In August 2015, the company added group calling to their app. From its launch until March 2016, Wire's messages were only encrypted between the client and the company's server. In March 2016, the company added end-to-end encryption for its messaging traffic, as well as a video calling feature. Wire Swiss GmbH released the source code of the Wire client applications in July 2016. In 2018, Wire launched its collaboration solution featuring end-to-end encrypted chat, conferencing, video calls and file-sharing on desktop and mobile for businesses.
Features
Wire offers end-to-end encrypted messaging, file-sharing, video and voice calls, and guest rooms for external communication.
The app allows group calling with up to twenty-five participants and video conferences support up to 12 people. A stereo feature places participants in "virtual space" so that users can differentiate voice directionality. The application adapts to varying network conditions.
The application supports the exchange of animated GIFs up to 5MB through a media integration with Giphy. The iOS and Andr
|
https://en.wikipedia.org/wiki/Bessel%27s%20inequality
|
In mathematics, especially functional analysis, Bessel's inequality is a statement about the coefficients of an element in a Hilbert space with respect to an orthonormal sequence. The inequality was derived by F.W. Bessel in 1828.
Let be a Hilbert space, and suppose that is an orthonormal sequence in . Then, for any in one has
where ⟨·,·⟩ denotes the inner product in the Hilbert space . If we define the infinite sum
consisting of "infinite sum" of vector resolute in direction , Bessel's inequality tells us that this series converges. One can think of it that there exists that can be described in terms of potential basis .
For a complete orthonormal sequence (that is, for an orthonormal sequence that is a basis), we have Parseval's identity, which replaces the inequality with an equality (and consequently with ).
Bessel's inequality follows from the identity
which holds for any natural n.
See also
Cauchy–Schwarz inequality
Parseval's theorem
|
https://en.wikipedia.org/wiki/Wavelet
|
A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times. Wavelets are termed a "brief oscillation". A taxonomy of wavelets has been established, based on the number and direction of its pulses. Wavelets are imbued with specific properties that make them useful for signal processing.
For example, a wavelet could be created to have a frequency of Middle C and a short duration of roughly one tenth of a second. If this wavelet were to be convolved with a signal created from the recording of a melody, then the resulting signal would be useful for determining when the Middle C note appeared in the song. Mathematically, a wavelet correlates with a signal if a portion of the signal is similar. Correlation is at the core of many practical wavelet applications.
As a mathematical tool, wavelets can be used to extract information from many different kinds of data, including but not limited to audio signals and images. Sets of wavelets are needed to analyze data fully. "Complementary" wavelets decompose a signal without gaps or overlaps so that the decomposition process is mathematically reversible. Thus, sets of complementary wavelets are useful in wavelet-based compression/decompression algorithms, where it is desirable to recover the original information with minimal loss.
In formal terms, this representation is a wavelet series representation of a square-integrable function with respect to either a complete, orthonormal set of basis functions, or an overcomplete set or frame of a vector space, for the Hilbert space of square-integrable functions. This is accomplished through coherent states.
In classical physics, the diffraction phenomenon is described by the Huygens–Fresnel principle that treats each point in a propagating wavefront as a collection of individual spherical wavelets. The characteristic bending pattern is most pronounced when a wave from a coherent source (such as a lase
|
https://en.wikipedia.org/wiki/Gene%20therapy%20of%20the%20human%20retina
|
Retinal gene therapy holds a promise in treating different forms of non-inherited and inherited blindness.
In 2008, three independent research groups reported that patients with the rare genetic retinal disease Leber's congenital amaurosis had been successfully treated using gene therapy with adeno-associated virus (AAV). In all three studies, an AAV vector was used to deliver a functional copy of the RPE65 gene, which restored vision in children suffering from LCA. These results were widely seen as a success in the gene therapy field, and have generated excitement and momentum for AAV-mediated applications in retinal disease.
In retinal gene therapy, the most widely used vectors for ocular gene delivery are based on adeno-associated virus. The great advantage in using adeno-associated virus for the gene therapy is that it poses minimal immune responses and mediates long-term transgene expression in a variety of retinal cell types. For example, tight junctions that form the blood-retina barrier, separate subretinal space from the blood supply, providing protection from microbes and decreasing most immune-mediated damages.
There is still a lot of knowledge missing in regards of retina dystrophies. Detail characterization is needed in order to improve knowledge. To address this issue, creation of Registries is an attempt to grouped and characterize rare diseases. Registries help to localize, and measure all the phenotype of these conditions and therefore to provide easy follow-ups and provide a source of information to scientist community. Registry designs varies from region to region, however localization and characterization of the phenotype are the standard gold.
Examples of Registries are:
RetMxMap<ARVO 2009>. A Mexican and Latin-American registry created since 2009. This registry was created by Dr Adda Lízbeth Villanueva Avilés. She is a clinical-scientist gene mapping inherited retina dystrophies in Mexico and other Latin countries.
Clinical trials
Lebe
|
https://en.wikipedia.org/wiki/VVO2max
|
{{DISPLAYTITLE:vVO2max}}
vV̇O2max (velocity at maximal oxygen uptake), also known as maximal aerobic speed (MAS), is an intense running or swimming pace. This is the minimum speed for which the organism's maximal oxygen uptake (VO2 max) is reached, after a few minutes of constantly maintaining this exercise intensity. At higher paces, any additional increase in power is provided by anaerobic processes. In an incremental exercise test, it is the first speed at which any increase in exercise intensity fails to elicit an increase in oxygen consumption.
The vV̇O2max of world class middle- and long-distance runners may exceed or 2:30/km pace ( or about 4:00/mile), making this speed slightly comparable to 3000 m race pace. For many athletes, vV̇O2max may be slightly slower than or mile race pace.
Measuring vV̇O2max
While a sophisticated lab may be required to obtain precise measures of vV̇O2max, it can be estimated using a simple field test on a 400 m running track. In a 2015 study of 28 male rugby players, the authors measured vV̇O2max and then had the subjects perform short time trials (TT) of various distances on the track. Using the average speed of a 2000 m TT gave the best estimate of vV̇O2max, with the limits of agreement estimated as ±5%.
For a better estimate, several time trials at distances varying from 1200–2200 m could be run, with adequate rest between them (e.g. 48 h in Bellenger et al.). Then vV̇O2max may be estimated from the following linear equation
vV̇O2max = TTs × (0.117 × TTd + 0.766)
where TTs is the average time trial speed, and TTd is the time trial distance in km.
Training at vV̇O2max
Research by Véronique Billat has shown that training at vV̇O2max pace improves both V̇O2max and the economy required to maintain pace at this intensity.
Training at vV̇O2max takes the form of interval workouts. For example, 3 × with 3 minutes recovery between each repetition.
Determining vV̇O2max from VO2max
The formula from Léger and Mercier links
|
https://en.wikipedia.org/wiki/Dynamic%20Markov%20compression
|
Dynamic Markov compression (DMC) is a lossless data compression algorithm developed by Gordon Cormack and Nigel Horspool. It uses predictive arithmetic coding similar to prediction by partial matching (PPM), except that the input is predicted one bit at a time (rather than one byte at a time). DMC has a good compression ratio and moderate speed, similar to PPM, but requires somewhat more memory and is not widely implemented. Some recent implementations include the experimental compression programs hook by Nania Francesco Antonio, ocamyd by Frank Schwellinger, and as a submodel in paq8l by Matt Mahoney. These are based on the 1993 implementation in C by Gordon Cormack.
Algorithm
DMC predicts and codes one bit at a time. It differs from PPM in that it codes bits rather than bytes, and from context mixing algorithms such as PAQ in that there is only one context per prediction. The predicted bit is then coded using arithmetic coding.
Arithmetic coding
A bitwise arithmetic coder such as DMC has two components, a predictor and an arithmetic coder. The predictor accepts an n-bit input string x = x1x2...xn and assigns it a probability p(x), expressed as a product of a series of predictions, p(x1)p(x2|x1)p(x3|x1x2) ... p(xn| x1x2...xn–1). The arithmetic coder maintains two high precision binary numbers, plow and phigh, representing the possible range for the total probability that the model would assign to all strings lexicographically less than x, given the bits of x seen so far. The compressed code for x is px, the shortest bit string representing a number between plow and phigh. It is always possible to find a number in this range no more than one bit longer than the Shannon limit, log2 1 / p(x). One such number can be obtained from phigh by dropping all of the trailing bits after the first bit that differs from plow.
Compression proceeds as follows. The initial range is set to plow = 0, phigh = 1. For each bit, the predictor estimates p0 = p(xi = 0|x
|
https://en.wikipedia.org/wiki/Vaginal%20flora
|
Vaginal flora, vaginal microbiota or vaginal microbiome are the microorganisms that colonize the vagina. They were discovered by the German gynecologist Albert Döderlein in 1892 and are part of the overall human flora.
The amount and type of bacteria present have significant implications for an individual's overall health. The primary colonizing bacteria of a healthy individual are of the genus Lactobacillus, such as L. crispatus, and the lactic acid they produce is thought to protect against infection by pathogenic species.
Lactobacilli
The primary colonizing bacteria of a healthy individual are of the genus Lactobacillus (90–95%), the most common being L. crispatus, L. iners, L. jensenii, and L. gasseri. Since the first description of lactobacilli by Döderlein, lactobacilli have been generally considered the gatekeepers of the vaginal ecosystem. Lactobacilli have been shown to inhibit in vitro growth of pathogenic microorganisms, e.g. Bacteroides fragilis, Escherichia coli, Gardnerella vaginalis, Mobiluncus spp., Neisseria gonorrhoeae, Peptostreptococcus anaerobius, Prevotella bivia and Staphylococcus aureus. It is generally accepted that this is achieved mainly through the action of lactic acid. Moreover, lactobacilli normally help to prevent long-term colonization of the vagina by adhering to vaginal epithelial cells. This usually reduces pathogens from infecting to the vaginal epithelium.
Next to lactic acid production and competition for adherence, other antagonistic mechanisms include hydrogen peroxide (a broad-spectrum antimicrobial) and bacteriocins (target-specific antimicrobials) production.
pH and lactic acid
Low pH is generally accepted to be the main mechanism controlling the composition of the vaginal microflora. Although the lactic acid produced by lactobacilli contributes to the vaginal acidity, it is still not proven to be the primary source of low vaginal pH, but the fact remains that most lactobacilli thrive best at a pH < 3.5 .
Normal va
|
https://en.wikipedia.org/wiki/Open%20Source%20Cluster%20Application%20Resources
|
Open Source Cluster Application Resources (OSCAR) is a Linux-based software installation for high-performance cluster computing. OSCAR allows users to install a Beowulf type high performance computing cluster.
See also
TORQUE Resource Manager
Maui Cluster Scheduler
Beowulf cluster
External links
Official OSCAR site
github repository
Cluster computing
Parallel computing
|
https://en.wikipedia.org/wiki/Automated%20Meteorological%20Data%20Acquisition%20System
|
AMeDAS (Automated Meteorological Data Acquisition System), commonly known in Japanese as "アメダス" (amedasu), is a high-resolution surface observation network developed by the Japan Meteorological Agency (JMA) used for gathering regional weather data and verifying forecast performance. The system began operating on 1 November 1974, and currently comprises 1,300 stations throughout Japan (of which over 1,100 are unstaffed), with an average separation of .
Observations at staffed stations cover weather, wind direction and speed, types and amounts of precipitation, types and base heights of clouds, visibility, air temperature, humidity, sunshine duration, and atmospheric pressure. All of these (except weather, visibility and cloud-related meteorological elements) are observed automatically.
At unstaffed stations, observations are performed every 10 minutes. About 700 of the unstaffed stations observe precipitation, air temperature, wind direction and speed, and sunshine duration, while the other stations observe only precipitation.
For about 280 stations (staffed or unstaffed) located in areas of heavy snowfall, snow depth is also observed.
All the observational data is transmitted to the AMeDAS Center at JMA Headquarters in Tokyo on a real time basis via dedicated telephone lines. The data is then delivered to the whole country after a quality check.
As well as weather conditions, AMeDAS is also used in the observation of natural disasters. Temporary observation points are set up in areas where there are signs of volcanic eruptions or earthquakes.
See also
Mesonet
External links
Japan Meteorological Agency observations descriptions
1974 establishments in Japan
1974 in computing
Japanese inventions
Geography of Japan
Japan Meteorological Agency
Meteorological data and networks
Meteorological instrumentation and equipment
Science and technology in Japan
|
https://en.wikipedia.org/wiki/Norman%20White
|
Norman White (born January 7, 1938, San Antonio Texas) Canadian New Media artist considered to be a pioneer in the use of electronic technology and robotics in art.
Life
White was born in San Antonio Texas in 1938. He grew up in and around Boston, Massachusetts, and obtained his B.A. in Biology from Harvard University in 1959. Originally planning to become a fisheries biologist, White changed his mind and decided to travel to places like New York City, San Francisco, London, and the Middle East during the 1960s.
While living in San Francisco, he worked as an electrician at Hunter's Point Naval Shipyard, and developed a fascination for electrical switching systems. In London England, 1965-1967, he began to experiment with electronics. He then moved to Toronto, Ontario, Canada, where he began creating a series of kinetic, digital logic driven light machines. His first artwork utilizing "RTL" integrated circuits was shown in the E.A.T. sponsored group exhibition entitled "Some More Beginnings", in 1969, at the Brooklyn Museum. From 1978 to 2003. White taught classes such as "Mechanics for Real Time Sculpture" as part of the Integrated Media Program of the Ontario College of Art & Design
A retrospective of his work and influence, called Norm’s Robots and Machine Life, with works by both White and several Canadian artists he has influenced, was shown at the Agnes Etherington Art Centre, Kingston, Ontario in 2004.
From 1992 to 2003, White was an essential force behind the OCAD Sumo Robot Challenge, an annual competition akin to an automaton Olympics.
From 2003 to 2016 , White taught in the Radio Television Arts Department of Ryerson University, Toronto, Ontario. He retired from teaching in 2016.
Work
Early light works
White's early electronic art consisted mostly of gridded installations of light bulbs controlled by contemporary-vintage digital logic circuits. Like most of his art, these displays were concerned more with communicating internal rules and behaviours
|
https://en.wikipedia.org/wiki/Petrifilm
|
The 3M Petrifilm plate is an all-in-one plating system made by the Food Safety Division of the 3M Company. They are heavily used in many microbiology-related industries and fields to culture various micro-organisms and are meant to be a more efficient method for detection and enumeration compared to conventional plating techniques. A majority of its use is for the testing of foodstuffs.
Petrifilm plates are designed to be as accurate as conventional plating methods. Ingredients usually vary from plate to plate depending on what micro-organism is being cultured, but generally a Petrifilm comprises a cold-water-soluble gelling agent, nutrients, and indicators for activity and enumeration.
A typical Petrifilm plate has a 10 cm(H) × 7.5 cm(W) bottom film which contains a foam barrier accommodating the plating surface, the plating surface itself (a circular area of about 20 cm2), and a top film which encloses the sample within the Petrifilm. A 1 cm × 1 cm yellow grid is printed on the back of the plate to assist enumeration. A plastic “spreader” is also used to spread the inoculum evenly.
Comparisons between Petrifilm plates and standard methods
Petrifilm plates have become widely used because of their cost-effectiveness, simplicity, convenience, and ease of use. For example, conventional plating would require preparing agar for pour plating, or using agar plates and vial inoculum loops for streak plating; but for Petrifilm plates, the agar is completely housed in a single unit so that only the sample has to be added, which saves time.
For incubation, Petrifilm plates can be safely stacked and incubated just like Petri dishes. Since they are paper thin, more plates can be stacked together than Petri dishes (although 3M recommends that Petrifilms be stacked no higher than 20).
For enumeration, Petrifilm plates can be used on any colony counter for enumeration just like a Petri dish. Various enumeration experiments have shown very little or no variance betw
|
https://en.wikipedia.org/wiki/Aerosol%20mass%20spectrometry
|
Aerosol mass spectrometry is the application of mass spectrometry to the analysis of the composition of aerosol particles. Aerosol particles are defined as solid and liquid particles suspended in a gas (air), with size range of 3 nm to 100 μm in diameter and are produced from natural and anthropogenic sources, through a variety of different processes that include wind-blown suspension and combustion of fossil fuels and biomass. Analysis of these particles is important owing to their major impacts on global climate change, visibility, regional air pollution and human health. Aerosols are very complex in structure, can contain thousands of different chemical compounds within a single particle, and need to be analysed for both size and chemical composition, in real-time or off-line applications.
Off-line mass spectrometry is performed on collected particles, while on-line mass spectrometry is performed on particles introduced in real time.
History
In literature from ancient Rome there are complaints of foul air, while in 1273 the inhabitants of London were discussing the prohibition of coal burning to improve air quality. However, the measurement and analysis of aerosols only became established in the second half of the 19th century.
In 1847 Henri Becquerel presented the first concept of particles in the air in his condensation nuclei experiment and his ideas were confirmed in later experiments by Coulier in 1875. These ideas were expanded on between 1880 and 1890 by meteorologist John Aitken who demonstrated the fundamental role of dust particles in the formation of clouds and fogs. Aitken's method for aerosol analysis consisted of counting and sizing particles mounted on a slide, using a microscope. The composition of the particles was determined by their refractive index.
In the 1920s aerosol measurements, using Aitken's simple microscopic method, became more common place because the negative health effects of industrial aerosols and dust were starting to be re
|
https://en.wikipedia.org/wiki/Center%20%28algebra%29
|
The term center or centre is used in various contexts in abstract algebra to denote the set of all those elements that commute with all other elements.
The center of a group G consists of all those elements x in G such that xg = gx for all g in G. This is a normal subgroup of G.
The similarly named notion for a semigroup is defined likewise and it is a subsemigroup.
The center of a ring (or an associative algebra) R is the subset of R consisting of all those elements x of R such that xr = rx for all r in R. The center is a commutative subring of R.
The center of a Lie algebra L consists of all those elements x in L such that [x,a] = 0 for all a in L. This is an ideal of the Lie algebra L.
See also
Centralizer and normalizer
Center (category theory)
|
https://en.wikipedia.org/wiki/Shuttle%20vector
|
A shuttle vector is a vector (usually a plasmid) constructed so that it can propagate in two different host species. Therefore, DNA inserted into a shuttle vector can be tested or manipulated in two different cell types. The main advantage of these vectors is they can be manipulated in E. coli, then used in a system which is more difficult or slower to use (e.g. yeast).
Shuttle vectors include plasmids that can propagate in eukaryotes and prokaryotes (e.g. both Saccharomyces cerevisiae and Escherichia coli) or in different species of bacteria (e.g. both E. coli and Rhodococcus erythropolis). There are also adenovirus shuttle vectors, which can propagate in E. coli and mammals.
Shuttle vectors are frequently used to quickly make multiple copies of the gene in E. coli (amplification). They can also be used for in vitro experiments and modifications (e.g. mutagenesis, PCR).
One of the most common types of shuttle vectors is the yeast shuttle vector. Almost all commonly used S. cerevisiae vectors are shuttle vectors. Yeast shuttle vectors have components that allow for replication and selection in both E. coli cells and yeast cells. The E. coli component of a yeast shuttle vector includes an origin of replication and a selectable marker, e.g. antibiotic resistance, beta lactamase, beta galactosidase. The yeast component of a yeast shuttle vector includes an autonomously replicating sequence (ARS), a yeast centromere (CEN), and a yeast selectable marker (e.g. URA3, a gene that encodes an enzyme for uracil synthesis, Lodish et al. 2007).
|
https://en.wikipedia.org/wiki/Obligate%20nasal%20breathing
|
Obligate nasal breathing describes a physiological necessity to breathe through the nose (or other forms of external nasal passages, depending on the species) as opposed to breathing through the mouth.
Definition
The term may be misleading, as it implies that the organism has no choice but to breathe through its nose; however, it is also used to describe cases where effective breathing through the mouth is possible but not preferred. Alternatively, the term has been defined by some as the ability to breathe through the nose while swallowing. While this ability is a common trait of obligate nasal breathers, the definition does not require that nasal breathing is necessary for the animal. Even in obligate nasal breathers such as horses, rabbits, and rodents, there is a potential patent path for air to travel from the mouth to the lungs which can be used for endotracheal intubation. It has been suggested that obligate nasal breathing is an adaptation especially useful in prey species, as it allows an animal to feed while preserving their ability to detect predators by scent.
Animals
Horses are considered obligate nasal breathers. The respiratory system of the horse prevents horses from breathing orally. The epiglottis rests above the soft palate while the animal is not swallowing, forming an airtight seal. Oral breathing can only occur with significant anatomical abnormalities or pathological conditions. For example, denervation of the pharyngeal branch of the vagus nerve results in the dorsal displacement of the soft palate (DDSP), and it has been suggested that this leads to a clinical syndrome which may include oral breathing. However, significant respiratory dysfunction including airway obstruction is observed with DDSP, and the animal cannot function normally in this state.
Rabbits, cats, and rodents are also obligate nasal breathers. Like horses, the normal anatomical position of the epiglottis causes it to be engaged over the caudal rim of the soft palate, s
|
https://en.wikipedia.org/wiki/Kanpei
|
Kanpei, also known as Ehime queen splash, is a Citrus cultivar that originated in Japan.
Genetics
Kanpei was created by crossing the dekopon and nishinokaori varieties in 1991, although it was not officially introduced until August 2007.
Description
The tree is vigorous and grows upright until the onset of fruit. The thorns are initially large and robust but become smaller with age, and fruit-bearing branches are thornless. The fruit ripens from January to March and weighs on average and is oblate in shape. The rind is orange in color and is mostly smooth but slightly bumpy; the flesh is orange to red-orange in color. It peels easily and puffing is rare. It is typically a seedless fruit, although when pollinated by surrounding cultivars, may contain a few seeds. It is a firm fruit and is said to have a sweet, rich flavor. The sugar content rating is at least 13 brix and the citric acid content is 1%. The fruit cracks easily in summer and autumn.
Uses
It is sold and cultivated in Japan, especially in Ehime Prefecture, and is most commonly eaten raw. It is sometimes used in desserts.
See also
Japanese citrus
List of citrus fruits
|
https://en.wikipedia.org/wiki/Mivirus
|
Mivirus is a genus of negative-strand RNA viruses which infect arthropods. Member viruses have nonsegmented and bisegmented genomes. There are nine species in the genus.
Etymology
The name Mivirus derives from (), the ancestral name of King Zhuang of Chu during the Spring and Autumn period, along with -virus, the suffix for a virus genus.
Genome
Miviruses have nonsegmented and bisegmented genomes which are linear. Some member viruses may have circular genomes.
Taxonomy
The following species are recognized:
Mivirus amblyommae
Mivirus boleense
Mivirus changpingense
Mivirus dermacentoris
Mivirus genovaense
Mivirus karukeraense
Mivirus rhipicephali
Mivirus suffolkense
Mivirus wuhanense
|
https://en.wikipedia.org/wiki/Nicotiana%20%C3%97%20sanderi
|
Nicotiana × sanderi, also known as Nicotiana × sanderae, is a hybrid of the tobacco species Nicotiana alata (syn. N. affinis) and Nicotiana forgetiana (syn. N. rubra). It is the most common ornamental Nicotiana variety found and sold in the United Kingdom. Nicotiana × sanderi requires soft soil mixed with sand to thrive. The plant will grow to heights of and will give off a sweet scent in the evening, like most Nicotiana plants. Nicotiana × sanderi is not hardy against frost and will die if it comes in contact with it; however, it withstands drought. Because of its size, N. × sanderi is used as a house or garden plant.
An analytical study published in 1963 concluded that N. × sanderi leaves have a low nicotine concentration and a moderately low nornicotine concentration.
|
https://en.wikipedia.org/wiki/Triclocarban
|
Triclocarban (sometimes abbreviated as TCC) is an antibacterial chemical once common in, but now phased out of, personal care products like soaps and lotions. It was originally developed for the medical field. Although the mode of action is unknown, TCC can be effective in fighting infections by targeting the growth of bacteria such as Staphylococcus aureus. Additional research seeks to understand its potential for causing antibacterial resistance and its effects on organismal and environmental health.
Usage
Triclocarban has been used as an antimicrobial and antifungal compound since the 1960s. It was commonly found in personal care products as an antimicrobial in soaps, lotions, deodorants, toothpaste, and plastic. about 80% of all antimicrobial bar soap sold in the United States contained triclocarban. In 2011 United States consumers were spending nearly 1 billion dollars annually on products containing triclocarban and triclosan.
In December 2013, the Food and Drug Administration (FDA) required all companies to prove within the next year, that triclocarban is not harmful to consumers. Companies like Johnson & Johnson, Procter & Gamble, Colgate-Palmolive, and Avon began phasing out antibacterial ingredients due to health concerns.
By 2016 usage of triclocarban in soaps had declined to 40%, and that September the FDA banned triclocarban, triclosan and 17 other common antibacterial chemicals by September 2017, for their failure to be proven safe, or more effective than plain soap and water.
Chemical structure and properties
Triclocarban, 3-(4-chlorophenyl)-1-(3,4-dichlorophenyl)urea, is a white powder that is insoluble in water. While triclocarban has two chlorinated phenyl rings, it is structurally similar to carbanilide compounds often found in pesticides (such as diuron) and some drugs. Chlorination of ring structures is often associated with hydrophobicity, persistence in the environment, and bioaccumulation in fatty tissues of living organisms. For this re
|
https://en.wikipedia.org/wiki/DIN%20sync
|
DIN sync, also called Sync24, is a synchronization interface for electronic musical instruments. It was introduced in 1980 by Roland Corporation and has been superseded by MIDI.
Definition and history
DIN sync was introduced in 1980 by Roland Corporation with the release of the TR-808 drum machine. The intended use was the synchronization of music sequencers, drum machines, arpeggiators and similar devices. It was superseded by MIDI in the mid-to-late 1980s.
DIN sync consists of two signals, clock (tempo) and run/stop. Both signals are TTL compatible, meaning the low state is 0 V and the high state is about +5 V. The clock signal is a low-frequency pulse wave suggesting the tempo. Instead of measuring the waveform's frequency, the machine receiving the signal merely has to count the number of pulses to work out when to increment its position in the music. Roland equipment uses 24 pulses per quarter note, known as Sync24. Therefore, a Roland-compatible device playing sixteenth notes would have to advance to the next note every time it receives 6 pulses. Korg equipment uses 48 pulses per quarter note. The run/stop signal indicates whether the sequence is playing or not.
If a device is a DIN sync sender, the positive slope of start/stop must reset the clock signal, and the clock signal must start with a delay of 9 ms.
A detailed description on how to implement a DIN sync sender with Play, Pause, Continue and Stop functionality was published by E-RM Erfindungsbuero.
Pinouts
DIN sync is so named because it uses 5-pin DIN connectors, the same as used for MIDI. DIN sync itself is not a DIN standard. Note that despite using the same connectors as MIDI, it uses different pins on these connectors (1, 2, and 3 rather than MIDI's 2, 4 and 5), so a cable made specifically for MIDI will not necessarily have the pins required for DIN sync connected. In some applications the remaining DIN sync pins (4 and 5) are used as tap and fill in or reset and start, but this di
|
https://en.wikipedia.org/wiki/Open%20Rights%20Group
|
The Open Rights Group (ORG) is a UK-based organisation that works to preserve digital rights and freedoms by campaigning on digital rights issues and by fostering a community of grassroots activists. It campaigns on numerous issues including mass surveillance, internet filtering and censorship, and intellectual property rights.
History
The organisation was started by Danny O'Brien, Cory Doctorow, Ian Brown, Rufus Pollock, James Cronin, Stefan Magdalinski, Louise Ferguson and Suw Charman after a panel discussion at Open Tech 2005. O'Brien created a pledge on PledgeBank, placed on 23 July 2005, with a deadline of 25 December 2005: "I will create a standing order of 5 pounds per month to support an organisation that will campaign for digital rights in the UK but only if 1,000 other people will too." The pledge reached 1000 people on 29 November 2005. The Open Rights Group was launched at a "sell-out" meeting in Soho, London.
Work
The group has made submissions to the All Party Internet Group (APIG) inquiry into digital rights management and the Gowers Review of Intellectual Property.
The group was honoured in the 2008 Privacy International Big Brother Awards alongside No2ID, Liberty, Genewatch UK and others, as a recognition of their efforts to keep state and corporate mass surveillance at bay.
In 2010 the group worked with 38 Degrees to oppose the introduction of the Digital Economy Act, which was passed in April 2010.
The group opposes measures in the draft Online Safety Bill introduced in 2021, that it sees as infringing free speech rights and online anonymity.
The group campaigns against the Department for Digital, Culture, Media and Sport's plan to switch to an opt-out model for cookies. The group spokesperson stated that "[t]he UK government propose to make online spying the default option" in response to the proposed switch.
Goals
To collaborate with other digital rights and related organisations.
To nurture a community of campaigning volunteers, from
|
https://en.wikipedia.org/wiki/Chuen%20Yan%20Cheng
|
Chuen Yan Cheng () is a Senior Scientist for the Population Council's Center for Biomedical Research. He is most well known as the inventor of the non-steroid male contraceptive drug——Adjudin, which is the first male contraceptive drug on the market now finished clinical trials showing no side effects.
Career
He graduated from the Chinese University of Hong Kong with a B.Sc. in 1977, and obtained his Ph.D. in biochemistry and cell biology at the University of Newcastle, Australia, in 1981. He came to New York as a Population Council post-doctoral trainee in 1981, studying in the laboratory of Drs. Wayne Bardin, Neal Musto, and Glen Gunsalus and was appointed as a research investigator in December 1982.
Cheng's research focuses on the development of a novel contraceptive for human males. These studies currently are supported by grants from the National Institutes of Health, the CONRAD Program, and the Andrew Mellon Foundation.
|
https://en.wikipedia.org/wiki/Critical%20hours
|
Critical hours for radio stations is the time from sunrise to two hours after sunrise, and from two hours before sunset until sunset, local time. During this time, certain American radio stations may be operating with reduced power as a result of Section 73.187 of the Federal Communications Commission's rules.
Canadian restricted hours are similar to critical hours, except that the restriction results from the January 17, 1984, U.S.-Canadian AM Agreement. Canadian restricted hours are called "critical hours" in the U.S.-Canadian Agreement, but in the AM Engineering database, the FCC calls them "Canadian restricted hours" to distinguish them from the domestically defined critical hours. Canadian restricted hours is that time from sunrise to one and one-half hours after sunrise, and from one and one-half hours before sunset until sunset, local time. U.S. stations operate with restricted hours because of Canadian stations, and vice versa.
Those radio stations that must lower their power during the critical hours are required to do so because this is when the propagation of radio waves changes from groundwave to skywave (at sunset) or vice versa (at sunrise). This can cause radio stations to be picked up much farther away, possibly causing interference with other stations on the same frequency or adjacent frequencies. Usually stations operating under the restrictions of Critical Hours must sign off the air between the end of the evening critical hours and the beginning of the morning critical hours. In effect, permission to operate during critical hours gives daytime-only stations a few more hours in their broadcast day. This is especially important in autumn and winter, when these stations might otherwise need to be off the air during the important morning and afternoon drive times, when AM radio listening is at its highest.
See also
Pre-sunrise and post-sunset authorization
|
https://en.wikipedia.org/wiki/Integral%20graph
|
In the mathematical field of graph theory, an integral graph is a graph whose adjacency matrix's spectrum consists entirely of integers. In other words, a graph is an integral graph if all of the roots of the characteristic polynomial of its adjacency matrix are integers.
The notion was introduced in 1974 by Frank Harary and Allen Schwenk.
Examples
The complete graph Kn is integral for all n.
The only cycle graphs that are integral are , , and .
If a graph is integral, then so is its complement graph; for instance, the complements of complete graphs, edgeless graphs, are integral. If two graphs are integral, then so is their Cartesian product and strong product; for instance, the Cartesian products of two complete graphs, the rook's graphs, are integral. Similarly, the hypercube graphs, as Cartesian products of any number of complete graphs , are integral.
The line graph of an integral graph is again integral. For instance, as the line graph of , the octahedral graph is integral, and as the complement of the line graph of , the Petersen graph is integral.
Among the cubic symmetric graphs the utility graph, the Petersen graph, the Nauru graph and the Desargues graph are integral.
The Higman–Sims graph, the Hall–Janko graph, the Clebsch graph, the Hoffman–Singleton graph, the Shrikhande graph and the Hoffman graph are integral.
A regular graph is periodic if and only if it is an integral graph.
A walk-regular graph that admits perfect state transfer is an integral graph.
The Sudoku graphs, graphs whose vertices represent cells of a Sudoku board and whose edges represent cells that should not be equal, are integral.
|
https://en.wikipedia.org/wiki/Ballard%20Maturational%20Assessment
|
The Ballard Maturational Assessment, Ballard Score, or Ballard Scale is a commonly used technique of gestational age assessment. It was devised by Dr Jeanne L Ballard, Professor Emeritus of Pediatrics, Obstetrics and Gynecology at the University of Cincinnati College of Medicine.
The assessment assigns a score to various criteria, the sum of all of which is then extrapolated to the gestational age of the fetus. These criteria are divided into physical and neurological criteria. This scoring allows for the estimation of age in the range of 26 weeks-44 weeks. The New Ballard Score is an extension of the above to include extremely pre-term babies i.e. up to 20 weeks.
The scoring relies on the intra-uterine changes that the fetus undergoes during its maturation. Whereas the neurological criteria depend mainly upon muscle tone, the physical ones rely on anatomical changes. The neonate (less than 37 weeks of age) is in a state of physiological hypotonia. This tone increases throughout the fetal growth period, meaning a more premature baby would have lesser muscle tone.
It was developed in 1979.
The neuromuscular criteria
These are:
Posture:muscle tone is reflected in the infant's preferred posture at rest. As maturation progresses, the foetus gradually assumes increasing passive flexor tone at rest that precedes in a centripetal direction with lower extremities slightly ahead of upper extremities. Term newborn (flexed posture) and preterm newborn (extended posture).
Square window, assessing the flexibility of the wrist. Wrist flexibility and resistance to extensor stretching are responsible for the resulting angle of flexion at the wrist. The examiner strengthen the infant's fingers and applies gentle pressure on the dorsum of the hand, close to the fingers. From extremely preterm to post term, the resulting angle between the palm of the infant's hand and forearm is gradually diminished.
Arm recoil: Arm recoil examines the passive flexor tone of the biceps muscle b
|
https://en.wikipedia.org/wiki/Surround%20optical-fiber%20immunoassay
|
Surround optical-fiber immunoassay (SOFIA) is an ultrasensitive, in vitro diagnostic platform incorporating a surround optical-fiber assembly that captures fluorescence emissions from an entire sample. The technology's defining characteristics are its extremely high limit of detection, sensitivity, and dynamic range. SOFIA's sensitivity is measured at the attogram level (10−18 g), making it about one billion times more sensitive than conventional diagnostic techniques. Based on its enhanced dynamic range, SOFIA is able to discriminate levels of analyte in a sample over 10 orders of magnitude, facilitating accurate titering.
As a diagnostic platform, SOFIA has a broad range of applications. Several studies have already demonstrated SOFIA's unprecedented ability to detect naturally occurring prions in the blood and urine of disease carriers. This is expected to lead to the first reliable ante mortem screening test for vCJD, BSE, scrapie, CWD, and other transmissible spongiform encephalopathies. Given the technology's extreme sensitivity, additional unique applications are anticipated, including in vitro tests for other neurodegenerative diseases, such as Alzheimer's and Parkinson's disease.
SOFIA was developed as a result of a joint-collaborative research project between Los Alamos National Laboratory and State University of New York, and was supported by the Department of Defense's National Prion Research Program.
Background
The conventional method of performing laser-induced fluorescence, as well as other types of spectroscopic measurements, such as infrared, ultraviolet-visible spectroscopy, phosphorescence, etc., is to use a small transparent laboratory vessel, a cuvette, to contain the sample to be analyzed.
To perform a measurement, the cuvette is filled with the liquid to be investigated and then illuminated with a laser focused through one of the cuvette's faces. A lens is placed in line with one of the faces of the cuvette located at 90° from the input wi
|
https://en.wikipedia.org/wiki/Harry%20Mairson
|
Harry George Mairson is a theoretical computer scientist and professor of computer science in the Volen National Center for Complex Systems at Brandeis University in Waltham, Massachusetts. His research is in the fields of logic in computer science, lambda calculus and functional programming, type theory and constructive mathematics, computational complexity theory, and algorithmics.
His Ph.D. thesis, The Program Complexity of Searching a Table, won the Machtey Award at the 1983 IEEE Symposium on Foundations of Computer Science (FOCS). Mairson was a Postdoctoral researcher at INRIA Rocqencourt from 1984 to 1985, at Stanford University in 1985, and at the University of Oxford in 1986. He held a visiting professor position from 1999 to 2001 at Boston University. From 2005 to 2007, Mairson has served as the Chair of the Faculty Senate at Brandeis. He is currently an Associate Editor of the journal Logical Methods in Computer Science and Information and Computation, and sits on the editorial board of Higher-Order and Symbolic Computation.
Mairson's contributions to the theory of programming languages include proving that type inference for the ML programming language, so-called Hindley–Milner type inference, is complete for exponential time and that parallel beta reduction is non-elementary.
Education
Mairson received a B.A. in mathematics from Yale University in 1978 and a Ph.D. in computer science from Stanford University in 1984 under the supervision of Jeffrey Ullman.
External links
Harry Mairson at Brandeis University
Brandeis University Faculty Guide: Harry Mairson
DBLP: Harry G. Mairson
The Mathematics Genealogy Project - Harry Mairson
|
https://en.wikipedia.org/wiki/Horton%20overland%20flow
|
In soil science, Horton overland flow describes the tendency of water to flow horizontally across land surfaces when rainfall has exceeded infiltration capacity and depression storage capacity. It is named after Robert E. Horton, the engineer who made the first detailed studies of the phenomenon.
Paved surfaces such as asphalt, which are designed to be flat and impermeable, rapidly achieve Horton overland flow. It is shallow, sheetlike, and fast-moving, and hence capable of extensively eroding soil and bedrock.
Horton overland flow is most commonly encountered in urban construction sites and unpaved rural roads, where vegetation has been stripped away, exposing bare dirt. The process also poses a significant problem in areas with steep terrain, where water can build up great speed and where soil is less stable, and in farmlands, where soil is flat and loose.
See also
Horton's equation
Urban runoff
|
https://en.wikipedia.org/wiki/Zoo
|
A zoo (short for zoological garden; also called an animal park or menagerie) is a facility in which animals are kept within enclosures for public exhibition and often bred for conservation purposes.
The term zoological garden refers to zoology, the study of animals. The term is derived from the Greek , , 'animal', and the suffix , , 'study of'. The abbreviation zoo was first used of the London Zoological Gardens, which was opened for scientific study in 1828, and to the public in 1847. The first modern Zoo was the Tierpark Hagenbeck by Carl Hagenbeck in Germany.
In the United States alone, zoos are visited by over 181 million people annually.
Etymology
The London Zoo, which was opened in 1828, was initially known as the "Gardens and Menagerie of the Zoological Society of London", and it described itself as a menagerie or "zoological forest". The abbreviation "zoo" first appeared in print in the United Kingdom around 1847, when it was used for the Clifton Zoo, but it was not until some 20 years later that the shortened form became popular in the rhyming song "Walking in the Zoo" by music-hall artist Alfred Vance. The term "zoological park" was used for more expansive facilities in Halifax, Nova Scotia, Washington, D.C., and the Bronx in New York, which opened in 1847, 1891 and 1899 respectively.
Relatively new terms for zoos in the late 20th century are "conservation park" or "bio park". Adopting a new name is a strategy used by some zoo professionals to distance their institutions from the stereotypical and nowadays criticized zoo concept of the 19th century. The term "bio park" was first coined and developed by the National Zoo in Washington D.C. in the late 1980s. In 1993, the New York Zoological Society changed its name to the Wildlife Conservation Society and re branded the zoos under its jurisdiction as "wildlife conservation parks".
History
Royal menageries
The predecessor of the zoological garden is the menagerie, which has a long history from the an
|
https://en.wikipedia.org/wiki/Enaptin
|
Enaptin also known as nesprin-1 or synaptic nuclear envelope protein 1 (syne-1) is an actin-binding protein that in humans that is encoded by the SYNE1 gene.
Function
This gene encodes a spectrin repeat containing protein expressed in skeletal and smooth muscle, and peripheral blood lymphocytes, that localizes to the nuclear membrane.
Enaptin is a nuclear envelope protein found in human myocytes and synapses, which is made up of 8,797 amino acids. Enaptin is involved in the maintenance of nuclear organization and structural integrity, tethering the cell nucleus to the cytoskeleton by interacting with the nuclear envelope and with F-actin in the cytoplasm.
Structure
Enaptin contains a coiled alpha-helical region and a large beta-sheet region in the upper part and at least four alpha-helices spliced together, indicating the similarity with collagen. The protein is made up of three main parts, as can be seen in the diagram: cytoplasmic (1-8746), anchor for type IV membrane protein (8747-8767), and the sequence for perinuclear space (8768-8797). The region in the perinuclear space contains a KASH domain.
The molecular weight of the mature protein is approximately 1,011 kDa, and it has a theoretical pI of 5.38. The protein's chemical formula is C44189H71252N12428O14007S321. It has a theoretical Instability Index (II) of 51.63, indicating that it would be unstable in a test tube. The protein's in vivo half-life, the time it takes for half of the amount of protein in a cell to disappear after its synthesis in the cell, is predicted to be approximately 30 hours (in mammalian reticulocytes).
Clinical significance
Mutations in this gene have been associated with autosomal recessive spinocerebellar ataxia 8, also referred to as autosomal recessive cerebellar ataxia type 1 or recessive ataxia of Beauce.
|
https://en.wikipedia.org/wiki/Travel%20Wifi
|
DHI Telecom, LLC is a US commercial Internet service provider (ISP) that operates on U.S. and NATO bases in the Middle East including Iraq, Kuwait, and Afghanistan. DHI provides wired, fiber-optic cable, mobile Wi-Fi, and wireless commercial Internet access to US, coalition armed forces, direct-hire DoD, Department of the Army and State Department civilians, authorized civilian contractors, and international businesses participating in Operation New Dawn and Operation Enduring Freedom. DHI has additional operations in the UAE, Jordan, The Congo, Poland and Romania.
Summary
DHI Telecom competed against scores of companies for a contract with the DOD. On October 26, 2010 DHI was awarded a long-term DoD contract under the Army & Airforce Exchange Service, (The Exchange). As of September 2019, the company's operations on US and NATO bases throughout Afghanistan and Iraq are located in Baghdad, Kirkuk, and Um Qasr in Iraq and Bagram Airfield, Jalalabad, Kabul, Kandahar, Mazar e-Sharif, Camp Dwyer and Shindand Air Base in Afghanistan. DHI technology is also sold at The Exchange stores at major bases in Europe and the U.S.
Services
ISP services offer seven packages tiered by download speed and length of each plan. The different plans range from 24-hour service, up to 30 days of unlimited service. Businesses supporting US/NATO missions can opt for small business plans.
In 2017 DHI Telecom launched Sapphire International Mobile Wi-Fi Hotspots. The pocket-sized devices use CloudSIM technology to connect in 130+ countries without SIM cards and local carrier plans. The Sapphire device connects to the strongest cellular signal and provides a secure Wi-Fi hub with up to 4G LTE speeds and can connect up to five internet devices such as smartphones, laptops, and tablets to a private hub. https://www.sapphirego.com/
Access
Users can auto-obtain wireless connectivity using Dynamic Host Configuration Protocol (DHCP)-IP addressing. Upon launching their Internet browser, subscrib
|
https://en.wikipedia.org/wiki/PB-28
|
PB-28 is an agonist of the sigma-2 receptor.
It is derived from cyclohexylpiperazine.
|
https://en.wikipedia.org/wiki/Intercollegiate%20Biomathematics%20Alliance
|
The Intercollegiate Biomathematics Alliance (IBA) is a syndicate of organizations focused on connecting both academic and non-academic institutions to promote the study of biomathematics, ecology, and other related fields. Biomathematics is a scientific area connecting biology, ecology, mathematics, and computer science. Founded in 2014 by Executive director Olcay Akman of Illinois State University, the Intercollegiate Biomathematics Alliance helps organizations to work together and share resources among one another that are not regularly available at all institutions. The IBA is still young and typically attracts smaller colleges around the United States who tend to benefit more from being part of a consortium. However, in recent years, universities such as Arizona State University have joined and the IBA continues to maintain connections with larger research groups such as the Mathematical Bioscience Institute (MBI) and the National Institute for Mathematical and Biological Synthesis (NIMBioS).
History
In 2007, Olcay Akman of mathematics and Steven Juliano of biological sciences started a master's degree program at Illinois State University. The program grew and is now operated under the same umbrella as the IBA, the Center for Collaborative Studies in Mathematical Biology. In 2008, the first BEER (Biomathematics Ecology Education and Research) conference was held at Illinois State University with only 10 speakers and less than 50 attendees. In 2014, the BEER conference was the second largest biomathematics conference globally with more than 100 speakers. Then in 2014, other universities were asked to collaborate with the common goal of educating students about biomathematics, and this led to the creation of the Intercollegiate Biomathematics Alliance (IBA).
The IBA is not the first to create a network of institutions. Morehouse College in Atlanta, GA participates in its own network of institutions that helps to provide students with greater access to resources
|
https://en.wikipedia.org/wiki/PUC19
|
pUC19 is one of a series of plasmid cloning vectors created by Joachim Messing and co-workers. The designation "pUC" is derived from the classical "p" prefix (denoting "plasmid") and the abbreviation for the University of California, where early work on the plasmid series had been conducted. It is a circular double stranded DNA and has 2686 base pairs. pUC19 is one of the most widely used vector molecules as the recombinants, or the cells into which foreign DNA has been introduced, can be easily distinguished from the non-recombinants based on color differences of colonies on growth media. pUC18 is similar to pUC19, but the MCS region is reversed.
Components
Notably, it has an N-terminal fragment of β-galactosidase (lacZ) gene of E. coli. The multiple cloning site (MCS) region is split into codons 6-7 of the lacZ gene, providing for many restriction endonucleases restriction sites. In addition to β-galactosidase, pUC19 also encodes for an ampicillin resistance gene (ampR), via a β-lactamase enzyme that functions by degrading ampicillin and reducing its toxicity to the host.
The ori site, or origin of replication, is derived from the plasmid pMB1. pUC19 is small but has a high copy number. The high copy number is a result of the lack of the rop gene and a single point mutation in the ori of pMB1. The lacZ gene codes for β-galactosidase. The recognition sites for HindIII, SphI, PstI, SalI, XbaI, BamHI, SmaI, KpnI, SacI and EcoRI restriction enzymes have been derived from the vector M13mp19.
Function
This plasmid is introduced into a bacterial cell by a process called "transformation", where it can multiply and express itself. However, due to the presence of MCS and several restriction sites, a foreign piece of DNA of choice can be introduced into it by inserting it into place in MCS region. The cells which have taken up the plasmid can be differentiated from cells which have not taken up the plasmid by growing it on media with ampicillin. Only the cells with the
|
https://en.wikipedia.org/wiki/W-test
|
In statistics, the W-test is designed to test the distributional differences between cases and controls for categorical variable set, which can be a single SNP, SNP-SNP, or SNP-environment pairs. It takes a combined log of odds ratio form, calculated from the contingency table of the variable set. The test inherits a chi-squared distribution with data-set adaptive degrees of freedom f, estimated from smaller bootstrapped samples of the data. The flexible and data-corrected probability distribution allows W-test to give relatively accurate p-values under complex genetic architectures.
Applications
Theoretically, the test is not restricted to pairwise interactions, and can go to higher order if sample size of the data can support it. The W-test's application for pairwise interaction effect has been tested in common genome-wide association study (GWAS) dataset with less than 5,000 subjects [1]. Since it corrects for probability distribution bias due to sparse data through the bootstrapped parameters, it has persistent power in low frequency variant environment, when the minor allele frequency (MAF) of single-nucleotide polymorphism (SNP) is between 1% and 5%.
Software
The W-test C++ software, linux version and R package are available from the wtest official website.
|
https://en.wikipedia.org/wiki/Electrocorticography
|
Electrocorticography (ECoG), a type of intracranial electroencephalography (iEEG), is a type of electrophysiological monitoring that uses electrodes placed directly on the exposed surface of the brain to record electrical activity from the cerebral cortex. In contrast, conventional electroencephalography (EEG) electrodes monitor this activity from outside the skull. ECoG may be performed either in the operating room during surgery (intraoperative ECoG) or outside of surgery (extraoperative ECoG). Because a craniotomy (a surgical incision into the skull) is required to implant the electrode grid, ECoG is an invasive procedure.
History
ECoG was pioneered in the early 1950s by Wilder Penfield and Herbert Jasper, neurosurgeons at the Montreal Neurological Institute. The two developed ECoG as part of their groundbreaking Montreal procedure, a surgical protocol used to treat patients with severe epilepsy. The cortical potentials recorded by ECoG were used to identify epileptogenic zones – regions of the cortex that generate epileptic seizures. These zones would then be surgically removed from the cortex during resectioning, thus destroying the brain tissue where epileptic seizures had originated. Penfield and Jasper also used electrical stimulation during ECoG recordings in patients undergoing epilepsy surgery under local anesthesia. This procedure was used to explore the functional anatomy of the brain, mapping speech areas and identifying the somatosensory and somatomotor cortex areas to be excluded from surgical removal.
A doctor named Robert Galbraith Heath was also an early researcher of the brain at the Tulane University School of Medicine.
Electrophysiological basis
ECoG signals are composed of synchronized postsynaptic potentials (local field potentials), recorded directly from the exposed surface of the cortex. The potentials occur primarily in cortical pyramidal cells, and thus must be conducted through several layers of the cerebral cortex, cerebro
|
https://en.wikipedia.org/wiki/Animal%20track
|
__notoc__
An animal track is an imprint left behind in soil, snow, or mud, or on some other ground surface, by an animal walking across it. Animal tracks are used by hunters in tracking their prey and by naturalists to identify animals living in a given area.
Books are commonly used to identify animal tracks, which may look different based on the weight of the particular animal and the type of strata in which they are made.
Tracks can be fossilized over millions of years. It is for this reason we are able to see fossilized dinosaur tracks in some types of rock formations. These types of fossils are called trace fossils since they are a trace of an animal left behind rather than the animal itself. In paleontology, tracks often preserve as sandstone infill, forming a natural mold of the track.
Gallery
See also
Flukeprint, track of whale on ocean surface
Footprint
Pugmark
Spoor (animal)
|
https://en.wikipedia.org/wiki/Linear%20time%20property
|
In model checking, a branch of computer science, linear time properties are used to describe requirements of a model of a computer system. Example properties include "the vending machine does not dispense a drink until money has been entered" (a safety property) or "the computer program eventually terminates" (a liveness property). Fairness properties can be used to rule out unrealistic paths of a model. For instance, in a model of two traffic lights, the liveness property "both traffic lights are green infinitely often" may only be true under the unconditional fairness constraint "each traffic light changes colour infinitely often" (to exclude the case where one traffic light is "infinitely faster" than the other).
Formally, a linear time property is an ω-language over the power set of "atomic propositions". That is, the property contains sequences of sets of propositions, each sequence known as a "word". Every property can be rewritten as "P and Q both occur" for some safety property P and liveness property Q. An invariant for a system is something that is true or false for a particular state. Invariant properties describe an invariant that every reachable state of a model must satisfy, while persistence properties are of the form "eventually forever some invariant holds".
Temporal logics such as linear temporal logic describe types of linear time properties using formulae.
This article is about propositional linear-time properties and cannot handle predicates about program states, so it cannot define a property like: the current value of y determines the number of times that x toggles between 0 and 1 before termination. The more general formalism used in Safety and liveness properties can handle this.
Definition
Let AP be a set of atomic propositions. A word over (the power set of AP) is an infinite sequence of sets of propositions, such as (for the atomic propositions ). A linear time (LT) property over AP is a subset of i.e. a set of words. An example of
|
https://en.wikipedia.org/wiki/Pestov%E2%80%93Ionin%20theorem
|
The Pestov–Ionin theorem in the differential geometry of plane curves states that every simple closed curve of curvature at most one encloses a unit disk.
History and generalizations
Although a version of this was published for convex curves by Wilhelm Blaschke in 1916, it is named for and , who published a version of this theorem in 1959 for non-convex doubly differentiable () curves, the curves for which the curvature is well-defined at every point. The theorem has been generalized further, to curves of bounded average curvature (singly differentiable, and satisfying a Lipschitz condition on the derivative), and to curves of bounded convex curvature (each point of the curve touches a unit disk that, within some small neighborhood of the point, remains interior to the curve).
Applications
The theorem has been applied in algorithms for motion planning. In particular it has been used for finding Dubins paths, shortest routes for vehicles that can move only in a forwards direction and that can turn left or right with a bounded turning radius. It has also been used for planning the motion of the cutter in a milling machine for pocket machining, and in reconstructing curves from scattered data points.
|
https://en.wikipedia.org/wiki/Capillary%20action
|
Capillary action (sometimes called capillarity, capillary motion, capillary rise, capillary effect, or wicking) is the process of a liquid flowing in a narrow space without the assistance of, or even in opposition to, any external forces like gravity.
The effect can be seen in the drawing up of liquids between the hairs of a paint-brush, in a thin tube such as a straw, in porous materials such as paper and plaster, in some non-porous materials such as sand and liquefied carbon fiber, or in a biological cell.
It occurs because of intermolecular forces between the liquid and surrounding solid surfaces. If the diameter of the tube is sufficiently small, then the combination of surface tension (which is caused by cohesion within the liquid) and adhesive forces between the liquid and container wall act to propel the liquid.
Etymology
Capillary comes from the Latin word capillaris, meaning "of or resembling hair." The meaning stems from the tiny, hairlike diameter of a capillary. While capillary is usually used as a noun, the word also is used as an adjective, as in "capillary action," in which a liquid is moved along — even upward, against gravity — as the liquid is attracted to the internal surface of the capillaries.
History
The first recorded observation of capillary action was by Leonardo da Vinci. A former student of Galileo, Niccolò Aggiunti, was said to have investigated capillary action. In 1660, capillary action was still a novelty to the Irish chemist Robert Boyle, when he reported that "some inquisitive French Men" had observed that when a capillary tube was dipped into water, the water would ascend to "some height in the Pipe". Boyle then reported an experiment in which he dipped a capillary tube into red wine and then subjected the tube to a partial vacuum. He found that the vacuum had no observable influence on the height of the liquid in the capillary, so the behavior of liquids in capillary tubes was due to some phenomenon different from that
|
https://en.wikipedia.org/wiki/Riser%20card
|
A riser card is a printed circuit board that gives a computer motherboard the option for additional expansion cards to be added to the computer.
Usage
A riser is usually connected to the mainboard's slot through an edge connector, though some, such as NLX and Next Unit of Computing Extreme, instead are plugged into an edge connector on the mainboard itself. In general, the main purpose is to change the orientation of the expansion cards such that they fit a limited space within casing.
Riser cables
Riser cables are an evolution of riser cards utilizing improved specifications (specifically the use of PCI Express) and better materials, which allows further distances of data transmission and greater orientation flexibility than traditional riser cards. These cables use a Riser Card PCB and an edge connector on each side of the cable, with a copper alloy surrounded by a plastic insulator that allows for the further data transmission distances.
Such cables are now commonly used in modern household gaming PC's to allow for different positioning of PCI Express Cards and GPU cards in a computer case. This allows for customization and the addition of additional parts to suit the creator or builders needs. They can additionally be installed into vertical brackets to function similarly to a riser card, but with further flexibility. They are also used in small-form-factor PC's to allow for a GPU to be positioned behind a computer motherboard.
Specifications
There are only a few specified standards in regards to riser designs. Most use PCI Express edge connectors for data transfer. This allows for maximum data transfer speeds of 32 GB/s when using PCIe 4.0, along with 75W of power to be delivered from the host device. Other specifications used for these cards include ExpressCard and PCI-X.
Applications
Riser cards have applications in both industrial and consumer spaces.
Industrial
In servers, height for expansion cards is limited by rack units. A unit (U) is the tradit
|
https://en.wikipedia.org/wiki/Glutaredoxin
|
Glutaredoxins (also known as Thioltransferase) are small redox enzymes of approximately one hundred amino-acid residues that use glutathione as a cofactor. In humans this oxidation repair enzyme is also known to participate in many cellular functions, including redox signaling and regulation of glucose metabolism. Glutaredoxins are oxidized by substrates, and reduced non-enzymatically by glutathione. In contrast to thioredoxins, which are reduced by thioredoxin reductase, no oxidoreductase exists that specifically reduces glutaredoxins. Instead, glutaredoxins are reduced by the oxidation of glutathione. Reduced glutathione is then regenerated by glutathione reductase. Together these components compose the glutathione system.
Like thioredoxin, which functions in a similar way, glutaredoxin possesses an active centre disulfide bond. It exists in either a reduced or an oxidized form where the two cysteine residues are linked in an intramolecular disulfide bond. Glutaredoxins function as electron carriers in the glutathione-dependent synthesis of deoxyribonucleotides by the enzyme ribonucleotide reductase. Moreover, GRX act in antioxidant defense by reducing dehydroascorbate, peroxiredoxins, and methionine sulfoxide reductase. Beside their function in antioxidant defense, bacterial and plant GRX were shown to bind iron-sulfur clusters and to deliver the cluster to enzymes on demand.
In viruses
Glutaredoxin has been sequenced in a variety of viruses. On the basis of extensive sequence similarity, it has been proposed that Vaccinia virus protein O2L is, it seems, a glutaredoxin. Bacteriophage T4 thioredoxin seems to be evolution-related. In position 5 of the pattern T4, thioredoxin has Val instead of Pro.
In plants
Approximately 30 GRX isoforms are described in the model plant Arabidopsis thaliana and 48 in Oryza sativa L. According to their redox-active centre, they are subgrouped in six classes of the CSY[C/S]-, CGFS-, CC-type and 3 groups with additional domain of
|
https://en.wikipedia.org/wiki/Hamming%20weight
|
The Hamming weight of a string is the number of symbols that are different from the zero-symbol of the alphabet used. It is thus equivalent to the Hamming distance from the all-zero string of the same length. For the most typical case, a string of bits, this is the number of 1's in the string, or the digit sum of the binary representation of a given number and the ℓ₁ norm of a bit vector. In this binary case, it is also called the population count, popcount, sideways sum, or bit summation.
History and usage
The Hamming weight is named after Richard Hamming although he did not originate the notion. The Hamming weight of binary numbers was already used in 1899 by James W. L. Glaisher to give a formula for the number of odd binomial coefficients in a single row of Pascal's triangle. Irving S. Reed introduced a concept, equivalent to Hamming weight in the binary case, in 1954.
Hamming weight is used in several disciplines including information theory, coding theory, and cryptography. Examples of applications of the Hamming weight include:
In modular exponentiation by squaring, the number of modular multiplications required for an exponent e is log2 e + weight(e). This is the reason that the public key value e used in RSA is typically chosen to be a number of low Hamming weight.
The Hamming weight determines path lengths between nodes in Chord distributed hash tables.
IrisCode lookups in biometric databases are typically implemented by calculating the Hamming distance to each stored record.
In computer chess programs using a bitboard representation, the Hamming weight of a bitboard gives the number of pieces of a given type remaining in the game, or the number of squares of the board controlled by one player's pieces, and is therefore an important contributing term to the value of a position.
Hamming weight can be used to efficiently compute find first set using the identity ffs(x) = pop(x ^ (x - 1)). This is useful on platforms such as SPARC that have hardware H
|
https://en.wikipedia.org/wiki/FlyBase
|
FlyBase is an online bioinformatics database and the primary repository of genetic and molecular data for the insect family Drosophilidae. For the most extensively studied species and model organism, Drosophila melanogaster, a wide range of data are presented in different formats.
Information in FlyBase originates from a variety of sources ranging from large-scale genome projects to the primary research literature. These data types include mutant phenotypes; molecular characterization of mutant alleles; and other deviations, cytological maps, wild-type expression patterns, anatomical images, transgenic constructs and insertions, sequence-level gene models, and molecular classification of gene product functions. Query tools allow navigation of FlyBase through DNA or protein sequence, by gene or mutant name, or through terms from the several ontologies used to capture functional, phenotypic, and anatomical data. The database offers several different query tools in order to provide efficient access to the data available and facilitate the discovery of significant relationships within the database. Links between FlyBase and external databases, such as BDGP or modENCODE, provide opportunities for further exploration into other model organism databases and other resources of biological and molecular information. The FlyBase project is carried out by a consortium of Drosophila researchers and computer scientists at Harvard University and Indiana University in the United States, and University of Cambridge in the United Kingdom.
FlyBase is one of the organizations contributing to the Generic Model Organism Database (GMOD).
the FlyBase home page requested a website access fee of US$150.00 per person per year, stating that "The NHGRI has reduced the funding of FlyBase by 50%".
Background
Drosophila melanogaster has been an experimental organism since the early 1900s, and has since been placed at the forefront of many areas of research. As this field of research spread an
|
https://en.wikipedia.org/wiki/Vi%20Hart
|
Victoria Hart (born 1988), commonly known as Vi Hart (), is an American mathematician and YouTuber. They describe themself as a "recreational mathemusician" and are well-known for creating mathematical videos on YouTube and popularizing mathematics. Hart founded the virtual reality research group eleVR and has co-authored several research papers on computational geometry and the mathematics of paper folding.
Together with another YouTube mathematics popularizer, Matt Parker, Hart won the 2018 Communications Award of the Joint Policy Board for Mathematics for "entertaining, thought-provoking mathematics and music videos on YouTube that explain mathematical concepts through doodles".
Early life and education
Hart is the child of mathematical sculptor George W. Hart, and received a degree in music at Stony Brook University. Hart identifies as "gender agnostic"; in a video released in 2015, they spoke about their lack of gender identity—including lacking non-binary identities such as agender—and their attitude to gendered terms such as pronouns as a "linguistic game" they were not interested in playing. They said they have no preference and do not care which pronouns they are called by.
Career
Hart's career as a mathematics popularizer began in 2010 with a video series about "doodling in math class". After these recreational mathematics videos—which introduced topics like fractal dimensions—grew popular, Hart was featured in The New York Times and on National Public Radio, eventually gaining the support of the Khan Academy and making videos for it as its "Resident Mathemusician". Many of Hart's videos combine mathematics and music, such as "Twelve tones", which Salon called "deliriously and delightfully profound".
Together with Henry Segerman, Hart wrote "The Quaternion Group as a Symmetry Group", which was included in the anthology The Best Writing on Mathematics 2015.
In 2014, Hart, Emily Eifler, and Andrea Hawksley founded the research group eleVR to research v
|
https://en.wikipedia.org/wiki/Renminbi
|
The renminbi (; symbol: ¥; ISO code: CNY; abbreviation: RMB) is the official currency of the People's Republic of China. It is the 5th most traded currency as of April 2022.
The yuan ( or ) is the basic unit of the renminbi, but the word is also used to refer to the Chinese currency generally, especially in international contexts. One yuan is divided into 10 jiao (), and the jiao is further subdivided into 10 fen (). The renminbi is issued by the People's Bank of China, the monetary authority of China.
Valuation
Until 2005, the value of the renminbi was pegged to the US dollar. As China pursued its transition from central planning to a market economy and increased its participation in foreign trade, the renminbi was devalued to increase the competitiveness of Chinese industry. It has previously been claimed that the renminbi's official exchange rate was undervalued by as much as 37.5% against its purchasing power parity. However, more recently, appreciation actions by the Chinese government, as well as quantitative easing measures taken by the American Federal Reserve and other major central banks, have caused the renminbi to be within as little as 8% of its equilibrium value by the second half of 2012. Since 2006, the renminbi exchange rate has been allowed to float in a narrow margin around a fixed base rate determined with reference to a basket of world currencies. The Chinese government has announced that it will gradually increase the flexibility of the exchange rate. As a result of the rapid internationalization of the renminbi, it became the world's 8th most traded currency in 2013, 5th by 2015, but 6th in 2019.
On 1 October 2016, the renminbi became the first emerging market currency to be included in the IMF's special drawing rights basket, the basket of currencies used by the IMF as a reserve currency. Its initial weighting in the basket was 10.9%.
Terminology
The ISO code for the renminbi is CNY, the PRC's country code (CN) plus "Y" from "yuan". Hon
|
https://en.wikipedia.org/wiki/Linear%20equation%20over%20a%20ring
|
In algebra, linear equations and systems of linear equations over a field are widely studied. "Over a field" means that the coefficients of the equations and the solutions that one is looking for belong to a given field, commonly the real or the complex numbers. This article is devoted to the same problems where "field" is replaced by "commutative ring", or, typically "Noetherian integral domain".
In the case of a single equation, the problem splits in two parts. First, the ideal membership problem, which consists, given a non-homogeneous equation
with and in a given ring , to decide if it has a solution with in , and, if any, to provide one. This amounts to decide if belongs to the ideal generated by the . The simplest instance of this problem is, for and , to decide if is a unit in .
The syzygy problem consists, given elements in , to provide a system of generators of the module of the syzygies of that is a system of generators of the submodule of those elements in that are solutions of the homogeneous equation
The simplest case, when amounts to find a system of generators of the annihilator of .
Given a solution of the ideal membership problem, one obtains all the solutions by adding to it the elements of the module of syzygies. In other words, all the solutions are provided by the solution of these two partial problems.
In the case of several equations, the same decomposition into subproblems occurs. The first problem becomes the submodule membership problem. The second one is also called the syzygy problem.
A ring such that there are algorithms for the arithmetic operations (addition, subtraction, multiplication) and for the above problems may be called a computable ring, or effective ring. One may also say that linear algebra on the ring is effective.
The article considers the main rings for which linear algebra is effective.
Generalities
To be able to solve the syzygy problem, it is necessary that the module of syzygies is finitely gener
|
https://en.wikipedia.org/wiki/Fatty%20acid-binding%20protein
|
The fatty-acid-binding proteins (FABPs) are a family of transport proteins for fatty acids and other lipophilic substances such as eicosanoids and retinoids. These proteins are thought to facilitate the transfer of fatty acids between extra- and intracellular membranes. Some family members are also believed to transport lipophilic molecules from outer cell membrane to certain intracellular receptors such as PPAR. The FABPs are intracellular carriers that “solubilize” the endocannabinoid anandamide (AEA), transporting AEA to the breakdown by FAAH, and compounds that bind to FABPs block AEA breakdown, raising its level. The cannabinoids (THC and CBD) are also discovered to bind human FABPs (1, 3, 5, and 7) that function as intracellular carriers, as THC and CBD inhibit the cellular uptake and catabolism of AEA by targeting FABPs. Competition for FABPs may in part or wholly explain the increased circulating levels of endocannabinoids reported after consumption of cannabinoids. Levels of fatty-acid-binding protein have been shown to decline with ageing in the mouse brain, possibly contributing to age-associated decline in synaptic activity.
Family members
Members of this family include:
Pseudogenes
|
https://en.wikipedia.org/wiki/Chiron%20FS
|
Chiron Filesystem is a fault-tolerant replication file system.
Chiron FS is a FUSE based filesystem that implements replication at the filesystem level like RAID 1 does at the device level. The replicated filesystem may be of any kind; the only requisite is that it is mounted.
There is no need for special configuration files; the setup is as simple as one mount command (or one line in fstab). There is no specific communication protocol, at mount time the invoking parameters indicate two or more paths to directories which will be the replicated underlying filesystems (they must be already in sync). This allows the client to use any kind of underlying filesystems such as Ext3, NFS or SSHFS and even mix them. Every write in the Chiron FS mount point subtree will be echoed to the underlying filesystems. Any read from Chiron FS mount point subtree will be made from only one of the underlying filesystems using a prioritized round robin algorithm.
If one or more underlying filesystems fails, the virtualized filesystem provided by Chiron FS continues operating as long as there is at least one replica available. In this case, the failures are reported to a log file. If the failure is on a write operation, the failed replica is disabled and it is not used by Chiron FS until it is available and resynchronized with the others. Synchronization is not implemented yet in Chiron FS, so it must be done manually. If all replica fails then the calling application receives the error message as it would receive if it was accessing a non replicated filesystem. In this case there will be no log report.
See also
List of file systems
External links
Chiron FS web page
Chiron FS repository
Announcement list
Discussion list
Issues list
File systems supported by the Linux kernel
Network file systems
Internet Protocol based network software
Userspace file systems
Discontinued software
|
https://en.wikipedia.org/wiki/Cray-3/SSS
|
The Cray-3/SSS (Super Scalable System) was a pioneering massively parallel supercomputer project that bonded a two-processor Cray-3 to a new SIMD processing unit based entirely in the computer's main memory. It was later considered as an add-on for the Cray T90 series in the form of the T94/SSS, but there is no evidence this was ever built.
Design
The SSS project started after a Supercomputing Research Center (SRC) engineer, Ken Iobst, noticed a novel way to implement a parallel computer. Previous massively SIMD designs, like the Connection Machines, consisted of a large number of individual processing elements consisting of a simple processor and some local memory. Results that needed to be passed from element to element were passed along networking links at relatively slow speeds. This was a serious bottleneck in most parallel designs, which limited their use to certain roles where these interdependencies could be reduced.
Iobst's idea was to use the super-fast scatter/gather hardware from the Cray-3 to move the data around instead of using a separate network. This would offer at least an order of magnitudes better performance than systems based on "commodity" hardware. Better yet, the machine would still include a complete Cray-3 CPU, allowing the machine as a whole to use either SIMD or vector instructions depending on the particulars of the problem.
Now all that remained was the selection of a processor. Since the Cray-3 already had a vector processor for heavy computing, the SIMD processors themselves could be considerably simpler, handling only the most basic instructions. This is where the SSS concept was truly unique; since the problem with most SIMD machines was moving data around, Iobst suggested that the processors be built into the SRAM chips themselves.
Memory is normally organized within the RAM chips in a row/column format, with a controller on the chip reading requested data from the chip in parallel across the rows, then assembling the result
|
https://en.wikipedia.org/wiki/Simplex%20category
|
In mathematics, the simplex category (or simplicial category or nonempty finite ordinal category) is the category of non-empty finite ordinals and order-preserving maps. It is used to define simplicial and cosimplicial objects.
Formal definition
The simplex category is usually denoted by . There are several equivalent descriptions of this category. can be described as the category of non-empty finite ordinals as objects, thought of as totally ordered sets, and (non-strictly) order-preserving functions as morphisms. The objects are commonly denoted (so that is the ordinal ). The category is generated by coface and codegeneracy maps, which amount to inserting or deleting elements of the orderings. (See simplicial set for relations of these maps.)
A simplicial object is a presheaf on , that is a contravariant functor from to another category. For instance, simplicial sets are contravariant with the codomain category being the category of sets. A cosimplicial object is defined similarly as a covariant functor originating from .
Augmented simplex category
The augmented simplex category, denoted by is the category of all finite ordinals and order-preserving maps, thus , where . Accordingly, this category might also be denoted FinOrd. The augmented simplex category is occasionally referred to as algebraists' simplex category and the above version is called topologists' simplex category.
A contravariant functor defined on is called an augmented simplicial object and a covariant functor out of is called an augmented cosimplicial object; when the codomain category is the category of sets, for example, these are called augmented simplicial sets and augmented cosimplicial sets respectively.
The augmented simplex category, unlike the simplex category, admits a natural monoidal structure. The monoidal product is given by concatenation of linear orders, and the unit is the empty ordinal (the lack of a unit prevents this from qualifying as a monoidal structure on ).
|
https://en.wikipedia.org/wiki/Ideographic%20approach
|
The ideographic approach refers to the idea in psychology proposed by Marc Brysbaert that the conclusions of a study stay limited to the phenomenon under study. It also focuses on the importance of individual traits when determining behavior instead of group norms. It reinforces the position that the study of the individual is the most effective method of understanding behavior.
Background
A major tradition in behavioral psychology is concerned with the variables and how one's characteristics are abstracted from other people's. The ideographic approach emerged out of the position among pioneers in personality psychology that focuses on the study of individuality.
Methodologies
The ideographic approach often use qualitative methodologies in its study of small number of individuals rather than make generalizations out of information collected from a large quantitative database. The methods operate according to the idea that each person is like no other person.
The psychological literature distinguishes ideographic approach from the nomothetic laws, which are concerned with the general perspective.
|
https://en.wikipedia.org/wiki/Computationally%20bounded%20adversary
|
In information theory, the computationally bounded adversary problem is a different way of looking at the problem of sending data over a noisy channel. In previous models the best that could be done was ensuring correct decoding for up to d/2 errors, where d was the Hamming distance of the code. The problem with doing it this way is that it does not take into consideration the actual amount of computing power available to the adversary. Rather, it only concerns itself with how many bits of a given code word can change and still have the message decode properly. In the computationally bounded adversary model the channel – the adversary – is restricted to only being able to perform a reasonable amount of computation to decide which bits of the code word need to change. In other words, this model does not need to consider how many errors can possibly be handled, but only how many errors could possibly be introduced given a reasonable amount of computing power on the part of the adversary. Once the channel has been given this restriction it becomes possible to construct codes that are both faster to encode and decode compared to previous methods that can also handle a large number of errors.
Comparison to other models
Worst-case model
At first glance, the worst-case model seems intuitively ideal. The guarantee that an algorithm will succeed no matter what is, of course, highly alluring. However, it demands too much. A real-life adversary cannot spend an indefinite amount of time examining a message in order to find the one error pattern which an algorithm would struggle with.
As a comparison, consider the Quicksort algorithm. In the worst-case scenario, Quicksort makes O(n2) comparisons; however, such an occurrence is rare. Quicksort almost invariably makes O(n log n) comparisons instead, and even outperforms other algorithms which can guarantee O(n log n) behavior. Let us suppose an adversary wishes to force the Quicksort algorithm to make O(n2) comparisons. Then he
|
https://en.wikipedia.org/wiki/VCaP
|
VCaP cells are a cell line of human prostate cancer commonly used in the field of oncology. The tissue was harvested at autopsy from a metastatic lesion to a lumbar vertebrae of a 59 year old Caucasian male with hormone refractory prostate cancer in 1997, which was then xenografted into SCID mice and later harvested and plated on tissue culture dishes, where it can be propagated as an immortalized prostate cancer cell line.
Characteristics
VCaP are an adherent, epithelial cell line with high Androgen receptor and Prostate specific antigen expression. VCaP are the only prostate cancer cell model that express the Androgen receptor splice variant, AR-V7, and the TMPRSS2-ERG gene fusion.
The cells have an approximate doubling time of 53 hours, and require more specific culture conditions than other prostate cancer cell lines. VCaP cells are XMRV virus positive and produce the mouse xenotropic retrovirus Bxv-1, likely acquired during passaging in infected mice.
|
https://en.wikipedia.org/wiki/Jer%C3%B4nimo%20de%20Sousa%20Monteiro
|
Jerônimo de Sousa Monteiro (June 4, 1870 – October 23, 1933) was a Brazilian politician. He was a representative (in the local Espírito do Santo's Chamber of Representative and in the Brazilian Federal Chamber of Representatives), a Senator, and the 13th president (governor) of the state of Espírito Santo, a position he held from May 23, 1908, to May 23, 1912.
Monteiro, who was born in Cachoeiro do Itapemirim ES, is traditionally considered the author of the flag of the state of Espírito Santo, which is formed of three horizontal bands—a cyan band on the top, a white band in the middle and a pink band on the bottom—, and has the motto "Trabalha e Confia" (which means "Work and trust") written on the white band. "Work and trust" being a shortened version of a quote from the Spanish Jesuit father José de Anchieta, "Work as if everything depended on you, and trust as if everything depended on God".
Jerônimo Monteiro helped on the improvement of the urbanization of the capital city, Vitória, adding it better services of potable water, sewage and electric power; he also reformed the port of Vitória and the public hospital of the Holly House of the Mercy. He also tried to install an industrial zone in the regions of the state south to Cachoeiro do Itapemirim but the industrialists preferred to install in Vitória though.
However, Jerônimo Monteiro was the leader of a strong political group in South Espírito Santo, which was a group basically composed by landowners, and opposed to the more heterogeneous socially political group from the central region of Espírito Santo. By the time his brother Bernardino de Sousa Monteiro was in his late term, Jerônimo Monteiro tried to impede Nestor Gomez, legally elected governor of Espírito Santo in 1924, to be inaugurated officially, though he could not succeed on that.
|
https://en.wikipedia.org/wiki/Comparison%20of%20file%20comparison%20tools
|
This article compares computer software tools which are used for accomplishing comparisons of files of various types. The file types addressed by individual file comparison apps varies, but may include text, symbols, images, audio, or video. This category of software tool is often called "file comparison" or "diff tool", but those effectively are equivalent terms — where the term "diff" is more commonly associated with the Unix diff utility.
A typical rudimentary case is the comparison of one file against another. However, it also may include comparisons between two populations of files, such as in the case of comparing directories or folders, as part of file management. For instance, this might be to detect problems with corrupted backup versions of a collection of files ... or to validate a package of files is in compliance with standards before publishing.
Note that comparisons must be made among the same file type. Meaning, a text file cannot be compared to a picture containing text, unless an optical character reader (OCR) process is done first to extract the text. Likewise, text cannot be compared to spoken words, unless the spoken words first are transcribed into text. Additionally, text in one language cannot be compared to text in another, unless one is translated into the language of other.
A critical consideration is how the two files being compared must be substantially similar and thus not radically different. Even different revisions of the same document — if there are many changes due to additions, removals, or moving of content — may make comparisons of file changes very difficult to interpret. This suggests frequent version saves of a critical document, to better facilitate a file comparison.
A "diff" file comparison tool is a vital time and labor saving utility, because it aids in accomplishing tedious comparisons. Thus, it is a vital part of demanding comparison processes employed by individuals, academics, legal arena, forensics field, and ot
|
https://en.wikipedia.org/wiki/K%C3%A1roly%20Bezdek
|
Károly Bezdek (born May 28, 1955 in Budapest, Hungary) is a Hungarian-Canadian mathematician. He is a professor as well as a Canada Research Chair of mathematics and the director of the Centre for Computational and Discrete Geometry at the University of Calgary in Calgary, Alberta, Canada. Also he is a professor (on leave) of mathematics at the University of Pannonia in Veszprém, Hungary. His main research interests are in geometry in particular, in combinatorial, computational, convex, and discrete geometry. He has authored 3 books and more than 130 research papers. He is a founding Editor-in-Chief of the e-journal Contributions to Discrete Mathematics (CDM).
Early life and family
Károly Bezdek was born in Budapest, Hungary, but grew up in Dunaújváros, Hungary. His parents are Károly Bezdek, Sr. (mechanical engineer) and Magdolna Cserey. His brother András Bezdek is also a mathematician. Károly and his brother have scored at the top level in several Mathematics and Physics competitions for high school and university students in Hungary. Károly's list of awards include winning the first prize in the traditional KöMal (Hungarian Math. Journal for Highschool Students) contest in the academic year 1972–1973, as well as winning the first prize for the research results presented at the National Science Conference for Hungarian Undergraduate Students (TDK) in 1978. Károly entered the Faculty of Science of the Eötvös Loránd University in Hungary, and completed his Diploma in Mathematics in 1978. Bezdek is married to Éva Bezdek, and has three sons: Dániel, Máté and Márk .
Career
Károly Bezdek received his Ph.D. (1980) as well as his Habilitation degree (1997) in mathematics from Eötvös Loránd University, in Budapest, Hungary and his Candidate of Mathematical Sciences degree (1985) as well as his Doctor of
Mathematical Sciences degree (1995) from the Hungarian Academy of Sciences. He has been a faculty member of the Department of Geometry at Eötvös Loránd University in
|
https://en.wikipedia.org/wiki/Tag%20URI%20scheme
|
The tag URI scheme is a uniform resource identifier (URI) scheme for unique identifiers called tags, defined by RFC 4151 in October 2005.
The RFC identifies four requirements for tags:
Identifiers are likely to be unique across space and time, and come from a practically inexhaustible supply.
Identifiers are relatively convenient for humans to mint (create), read, type, remember etc.
No central registration is necessary, at least for holders of domain names or email addresses; and there is negligible cost to mint each new identifier.
The identifiers are independent of any particular resolution scheme.
Tags are used extensively in YAML.
Format
The general syntax of a tag URI is:
"tag:" authorityName "," YYYY-MM-DD-date ":" specific [ "#" fragment ]
In this syntax, the authorityName is either a domain name or an email address,
and the date is in the YYYY-MM-DD format, such as 2017-01-01. Thus, a specific tag is tied to a specific domain name or email address at a specific point of time. It is required that the "tagging entity" creating the tag be in control of the specified domain or email address as of 00:00 UTC on the specified date. This requirement makes each tag globally and persistently unique. The authority name alone would not suffice for global uniqueness, since the ownership of domains and email addresses is subject to change.
The date used in a tag may be a past date, provided the tagging entity controlled the authority name on that past date. An entity which acquires control of an authority name immediately after a period when it was unassigned is allowed to mint tags as if it controlled the authority name during the unassigned period, provided the entity has evidence that the name was unassigned. The date used in a newly-minted tag may not be a date in the future.
The date may be abbreviated; the month and day default to 01, but tags which have defaulted month and day values are reckoned as different from tags where the 01 value is specified.
|
https://en.wikipedia.org/wiki/Space%20geodesy
|
Space geodesy is geodesy by means of sources external to Earth, mainly artificial satellites (in satellite geodesy) but also quasars (in very-long-baseline interferometry, VLBI), visible stars (in stellar triangulation), and the retroreflectors on the Moon (in lunar laser ranging, LLR).
See also
Astronomical geodesy
Geodesy
Geodesy
|
https://en.wikipedia.org/wiki/Multiplicative%20weight%20update%20method
|
The multiplicative weights update method is an algorithmic technique most commonly used for decision making and prediction, and also widely deployed in game theory and algorithm design. The simplest use case is the problem of prediction from expert advice, in which a decision maker needs to iteratively decide on an expert whose advice to follow. The method assigns initial weights to the experts (usually identical initial weights), and updates these weights multiplicatively and iteratively according to the feedback of how well an expert performed: reducing it in case of poor performance, and increasing it otherwise. It was discovered repeatedly in very diverse fields such as machine learning (AdaBoost, Winnow, Hedge), optimization (solving linear programs), theoretical computer science (devising fast algorithm for LPs and SDPs), and game theory.
Name
"Multiplicative weights" implies the iterative rule used in algorithms derived from the multiplicative weight update method. It is given with different names in the different fields where it was discovered or rediscovered.
History and background
The earliest known version of this technique was in an algorithm named "fictitious play" which was proposed in game theory in the early 1950s. Grigoriadis and Khachiyan applied a randomized variant of "fictitious play" to solve two-player zero-sum games efficiently using the multiplicative weights algorithm. In this case, player allocates higher weight to the actions that had a better outcome and choose his strategy relying on these weights. In machine learning, Littlestone applied the earliest form of the multiplicative weights update rule in his famous winnow algorithm, which is similar to Minsky and Papert's earlier perceptron learning algorithm. Later, he generalized the winnow algorithm to weighted majority algorithm. Freund and Schapire followed his steps and generalized the winnow algorithm in the form of hedge algorithm.
The multiplicative weights algorithm is also wid
|
https://en.wikipedia.org/wiki/George%20Csicsery
|
George Paul Csicsery (born March 17, 1948) is a Hungarian-American writer and independent filmmaker who has directed 35 films including performance films, dramatic shorts and documentaries. He is best known for his documentaries about mathematicians and mathematical communities.
Life and career
George Csicsery was born in Regensburg, Germany to Hungarian parents who had fled their native country after WWII (his father was a monarchist army officer). In 1951, the family emigrated to Cleveland, Ohio. After a series of menial jobs his father became a successful stained glass and enamel artist and his mother became head of the slide library at the Cleveland Museum of Art (CMA), and assistant to renowned Asian art historian, Sherman Lee.
George obtained a BA in Comparative Religion from UC Berkeley (1969), and an MFA in Film Production from San Francisco State University (1972).
He taught film editing at Film Arts Foundation in San Francisco from 1982 to 1997, and general cinema courses to undergraduates at San Francisco State University in 1996 and at UC Davis in 1998.
He once said, "I am interested in people who can find happiness in creating their own world. That is true of mathematicians and romance writers. These people are creating universes different from where they live." In 2009 he received the Joint Policy Board for Mathematics (JPBM) Communications Award for his work showing the process of mathematical thinking through the medium of film.
Csicsery has written about the difficulties of being a displaced person after WWII, and about his two brothers−one of whom fought in the Hungarian Revolution.
Reception
Writing in Nature Magazine Davide Castelvecchi said, "Csicsery has carved a niche as a maker of compelling films about mathematicians".
Beginning in March 2022, as part of the celebration of Women's History Month, Secrets of the Surface: The Mathematical Vision of Maryam Mirzakhani will be shown on more than 300 PBS stations.
Filmography
Songs Along
|
https://en.wikipedia.org/wiki/Gravitometer
|
Gravitometer may refer to:
Gravimeter, an instrument for measuring the local gravitational field
Hydrometer, referred to in pipeline work as a gravitometer
Gravimetry
|
https://en.wikipedia.org/wiki/Contralateral%20brain
|
The contralateral organization of the forebrain (Latin: contra‚ against; latus‚ side; lateral‚ sided) is the property that the hemispheres of the cerebrum and the thalamus represent mainly the contralateral side of the body. Consequently, the left side of the forebrain mostly represents the right side of the body, and the right side of the brain primarily represents the left side of the body. The contralateral organization involves both executive and sensory functions (e.g., a left-sided brain lesion may cause a right-sided hemiplegia). The contralateral organization is only present in vertebrates.
According to the current theory, the forebrain is twisted about the long axis of the body, so that not only the left and right sides, but also dorsal and ventral sides, are interchanged (see also ).
Anatomy
Anatomically, the contralateral organization is manifested by major decussations (based upon the Latin notation for ten, 'deca,' as an uppercase 'X') and chiasmas (after the Greek uppercase letter 'Χ,' chi). A decussation denotes a crossing of bundles of axonal fibres inside the central nervous system. As a result of such decussations: The efferent connections of the cerebrum to the basal ganglia, the cerebellum and the spine are crossed; and the afferent connections from the spine, the cerebellum and the pons to the thalamus are crossed. Thus, motor, somatosensory, auditory, and visual primary regions in the forebrain predominantly represent the contralateral side of the body.
Two of the cranial nerves show chiasmas: (1) the chiasm of the optic tract (i.e., cranial nerve II), which originates from the eyes and inserts on the optic tectum of the midbrain; and (2) the trochlear nerve (i.e., cranial nerve IV), which originates in the ventral midbrain and innervates one of the six muscles that rotate the eye (i.e., the superior oblique muscle).
The contralateral organization is incomplete
Although the forebrain of all vertebrates shows a contralateral organizati
|
https://en.wikipedia.org/wiki/Irish%20grid%20reference%20system
|
The Irish grid reference system is a system of geographic grid references used for paper mapping in Ireland (both Northern Ireland and the Republic of Ireland). The Irish grid partially overlaps the British grid, and uses a similar co-ordinate system but with a meridian more suited to its westerly location.
Usage
In general, neither Ireland nor Great Britain uses latitude or longitude in describing internal geographic locations. Instead grid reference systems are used for mapping.
The national grid referencing system was devised by the Ordnance Survey, and is heavily used in their survey data, and in maps (whether published by the Ordnance Survey of Ireland, the Ordnance Survey of Northern Ireland or commercial map producers) based on those surveys. Additionally grid references are commonly quoted in other publications and data sources, such as guide books or government planning documents.
2001 recasting: the ITM grid
In 2001, the Ordnance Survey of Ireland and the Ordnance Survey of Northern Ireland jointly implemented a new coordinate system for Ireland called Irish Transverse Mercator, or ITM, a location-specific optimisation of UTM, which runs in parallel with the existing Irish grid system. In both systems, the true origin is at 53° 30' N, 8° W — a point in Lough Ree, close to the western (Co. Roscommon) shore, whose grid reference is . The ITM system was specified so as to provide precise alignment with modern high-precision global positioning receivers.
Grid letters
The area of Ireland is divided into 25 squares, measuring , each identified by a single letter. The squares are numbered A to Z with I being omitted. Seven of the squares do not actually cover any land in Ireland: A, E, K, P, U, Y and Z.
Eastings and northings
Within each square, eastings and northings from the origin (south west corner) of the square are given numerically. For example, G0305 means 'square G, east, north'. A location can be indicated to varying resolutions numericall
|
https://en.wikipedia.org/wiki/Unique%20factorization%20domain
|
In mathematics, a unique factorization domain (UFD) (also sometimes called a factorial ring following the terminology of Bourbaki) is a ring in which a statement analogous to the fundamental theorem of arithmetic holds. Specifically, a UFD is an integral domain (a nontrivial commutative ring in which the product of any two non-zero elements is non-zero) in which every non-zero non-unit element can be written as a product of irreducible elements, uniquely up to order and units.
Important examples of UFDs are the integers and polynomial rings in one or more variables with coefficients coming from the integers or from a field.
Unique factorization domains appear in the following chain of class inclusions:
Definition
Formally, a unique factorization domain is defined to be an integral domain R in which every non-zero element x of R can be written as a product (an empty product if x is a unit) of irreducible elements pi of R and a unit u:
x = u p1 p2 ⋅⋅⋅ pn with n ≥ 0
and this representation is unique in the following sense:
If q1, ..., qm are irreducible elements of R and w is a unit such that
x = w q1 q2 ⋅⋅⋅ qm with m ≥ 0,
then m = n, and there exists a bijective map φ : {1, ..., n} → {1, ..., m} such that pi is associated to qφ(i) for i ∈ {1, ..., n}.
Examples
Most rings familiar from elementary mathematics are UFDs:
All principal ideal domains, hence all Euclidean domains, are UFDs. In particular, the integers (also see fundamental theorem of arithmetic), the Gaussian integers and the Eisenstein integers are UFDs.
If R is a UFD, then so is R[X], the ring of polynomials with coefficients in R. Unless R is a field, R[X] is not a principal ideal domain. By induction, a polynomial ring in any number of variables over any UFD (and in particular over a field or over the integers) is a UFD.
The formal power series ring K[[X1,...,Xn]] over a field K (or more generally over a regular UFD such as a PID) is a UFD. On the other hand, the formal power series ring o
|
https://en.wikipedia.org/wiki/Quique%20Somenzini
|
Quique Somenzini is a professional radio controlled aircraft pilot and designer, owner of model manufacturer QuiQue's Aircraft Company and the 2007 FAI world champion.
A native of Rio Cuarto, Argentina, Somenzini has the distinction of being the youngest competitor in the history of the FAI championships, flying in competition in 1979 at the age of twelve. His father, Mario, is a former champion as well and introduced Somenzini to the hobby of model aircraft flight at the age of nine.
Somenzini has since become one of the top R/C pilots in the world - he was Argentina's national champion 21 times - and is credited with the invention of so-called "3-D" flying, characterized by tight loops, rolls and hovers at little to no forward airspeed.
On November 18, 2007, Somenzini earned the title of FAI F3A world champion at the 25th FAI World Championship in Argentina, marking the first time he had earned the title.
In addition to his accomplishments as an R/C pilot, Somenzini is also a model aircraft designer with his own company, QuiQue's Aircraft Company of Springfield, Ohio USA where he makes his present home. He is also a product tester and sponsored pilot for Spektrum and JR, both divisions of Horizon Hobby as well as for Team RCU, the competitive arm of RCUniverse.com, a major online radio control site.
External links and references
Somenzini's bio at RCUniverse.com
Article on Somenzini's FAI win at Spektrumrc.com
Living people
Model aircraft
Year of birth missing (living people)
|
https://en.wikipedia.org/wiki/Tremella%20fuciformis
|
Tremella fuciformis is a species of fungus; it produces white, frond-like, gelatinous basidiocarps (fruiting bodies). It is widespread, especially in the tropics, where it can be found on the dead branches of broadleaf trees. This fungus is commercially cultivated and is one of the most popular fungi in the cuisine and medicine of China. T. fuciformis is commonly known as snow fungus, snow ear, silver ear fungus, white jelly mushroom, and white cloud ears.
T. fuciformis is a parasitic yeast, and grows as a slimy, mucus-like film until it encounters its preferred hosts, various species of Annulohypoxylon (or possibly Hypoxylon) fungi, whereupon it then invades, triggering the aggressive mycelial growth required to form the fruiting bodies.
Description
Fruit bodies are gelatinous, watery white, up to across (larger in cultivated specimens), and composed of thin but erect, seaweed-like, branching fronds, often crisped at the edges. Microscopically, the hyphae are clamped and occur in a dense gelatinous matrix. Haustorial cells arise on the hyphae, producing filaments that attach to and penetrate the hyphae of the host. The basidia are tremelloid (ellipsoid, with oblique to vertical septa), 10–13 μm × 6.5–10 μm, sometimes stalked. The spores are ellipsoid, smooth, 5–8 μm × 4–6 μm, and germinate by hyphal tube or by yeast cells.
Taxonomy
Tremella fuciformis was first described in 1856 by English mycologist Miles Joseph Berkeley, based on collections made in Brazil by botanist and explorer Richard Spruce. In 1939, Japanese mycologist Yosio Kobayasi described Nakaiomyces nipponicus, a similar-looking fungus that differed by having scattered, dark spines on its surface. Later research, however, showed that the fruit bodies were those of Tremella fuciformis parasitized by an ascomycete, Ceratocystis epigloeum, that formed the dark spines. Nakaiomyces nipponicus is therefore a synonym of T. fuciformis.
In Mandarin Chinese, it is called 银耳 (pinyin: yín ěr; literally "si
|
https://en.wikipedia.org/wiki/Bitonic%20sorter
|
Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was devised by Ken Batcher. The resulting sorting networks consist of comparators and have a delay of , where is the number of items to be sorted. This makes it a popular choice for sorting large numbers of elements on an architecture which itself contains a large number of parallel execution units running in lockstep, such as a typical GPU.
A sorted sequence is a monotonically non-decreasing (or non-increasing) sequence. A bitonic sequence is a sequence with for some , or a circular shift of such a sequence.
Complexity
Let and .
It is evident from the construction algorithm that the number of rounds of parallel comparisons is given by .
It follows that the number of comparators is bounded (which establishes an exact value for when is a power of 2).
Although the absolute number of comparisons is typically higher than Batcher's odd-even sort, many of the consecutive operations in a bitonic sort retain a locality of reference, making implementations more cache-friendly and typically more efficient in practice.
How the algorithm works
The following is a bitonic sorting network with 16 inputs:
The 16 numbers enter as the inputs at the left end, slide along each of the 16 horizontal wires, and exit at the outputs at the right end. The network is designed to sort the elements, with the largest number at the bottom.
The arrows are comparators. Whenever two numbers reach the two ends of an arrow, they are compared to ensure that the arrow points toward the larger number. If they are out of order, they are swapped. The colored boxes are just for illustration and have no effect on the algorithm.
Every red box has the same structure: each input in the top half is compared to the corresponding input in the bottom half, with all arrows pointing down (dark red) or all up (light red). If the inputs happen to form a biton
|
https://en.wikipedia.org/wiki/Incremental%20heuristic%20search
|
Incremental heuristic search algorithms combine both incremental and heuristic search to speed up searches of sequences of similar search problems, which is important in domains that are only incompletely known or change dynamically. Incremental search has been studied at least since the late 1960s. Incremental search algorithms reuse information from previous searches to speed up the current search and solve search problems potentially much faster than solving them repeatedly from scratch. Similarly, heuristic search has also been studied at least since the late 1960s.
Heuristic search algorithms, often based on A*, use heuristic knowledge in the form of approximations of the goal distances to focus the search and solve search problems potentially much faster than uninformed search algorithms. The resulting search problems, sometimes called dynamic path planning problems, are graph search problems where paths have to be found repeatedly because the topology of the graph, its edge costs, the start vertex or the goal vertices change over time.
So far, three main classes of incremental heuristic search algorithms have been developed:
The first class restarts A* at the point where its current search deviates from the previous one (example: Fringe Saving A*).
The second class updates the h-values (heuristic, i.e. approximate distance to goal) from the previous search during the current search to make them more informed (example: Generalized Adaptive A*).
The third class updates the g-values (distance from start) from the previous search during the current search to correct them when necessary, which can be interpreted as transforming the A* search tree from the previous search into the A* search tree for the current search (examples: Lifelong Planning A*, D*, D* Lite).
All three classes of incremental heuristic search algorithms are different from other replanning algorithms, such as planning by analogy, in that their plan quality does not deteriorate with the nu
|
https://en.wikipedia.org/wiki/G%C3%A9rard%20Huet
|
Gérard Pierre Huet (; born 7 July 1947) is a French computer scientist, linguist and mathematician. He is senior research director at INRIA and mostly known for his major and seminal contributions to type theory, programming language theory and to the theory of computation.
Biography
Gérard Huet graduated from the Université Denis Diderot (Paris VII), Case Western Reserve University, and the Université de Paris.
He is senior research director at INRIA, a member of the French Academy of Sciences, and a member of Academia Europaea. Formerly he was a visiting professor at Asian Institute of Technology in Bangkok, a visiting professor at Carnegie Mellon University, and a guest researcher at SRI International.
He is the author of a unification algorithm for simply typed lambda calculus, and of a complete proof method for Church's theory of types (constrained resolution). He worked on the Mentor program editor in 1974–1977 with Gilles Kahn. He worked on the Knuth–Bendix (KB) equational proof system in 1978–1984 with Jean-Marie Hullot. He led the Formel project in the 1980s, which developed the Caml programming language. He designed the calculus of constructions in 1984 with Thierry Coquand. He led the Coq project in the 1990s with Christine Paulin-Mohring, who developed the Coq proof assistant. He invented the zipper data structure in 1996. He was Head of International Relations for INRIA in 1996–2000. He designed the Zen Computational Linguistics toolkit in 2000–2004.
He organized the Institute of Logical Foundations of Functional Programming during the Year of Programming at the University of Texas at Austin in Spring 1987. He organised the Colloquium “Proving and Improving Programs’’ in Arc-et-Senans in 1975, the 5th International Conference on Automated Deduction (CADE) in Les Arcs in 1980, the Logic in Computer Science Symposium (LICS) in Paris in 1994, and the First International Symposium in Sanskrit Computational Linguistics in 2007. He was coordinator of the
|
https://en.wikipedia.org/wiki/Generalized%20Timing%20Formula
|
Generalized Timing Formula is a standard by VESA which defines exact parameters of the component video signal for analogue VGA display interface.
The video parameters defined by the standard include horizontal blanking (retrace) and vertical blanking intervals, horizontal frequency and vertical frequency (collectively, pixel clock rate or video signal bandwidth), and horizontal/vertical sync polarity. Unlike predefined discrete modes (VESA DMT), any mode in a range can be produced using a formula by GTF.
A GTF-compliant display is expected to calculate the blanking intervals from the signal frequencies, producing a properly centered image. At the same time, a compliant graphics card is expected to use the calculation to produce a signal that will work on the display — either a GTF default formula for then-ordinary CRT displays or via a custom formula provided via EDID signaling.
These parameters are used by the XFree86 Modeline, for example.
This video timing standard is available for free.
History
The standard was adopted in 1999, and was superseded by the Coordinated Video Timings specification in 2002.
See also
Similar standards
Coordinated Video Timings
Extended display identification data, as it can interact with the video card with respect to providing information on permissible timings.
Standards organizations
VESA
|
https://en.wikipedia.org/wiki/Remote%20direct%20memory%20access
|
In computing, remote direct memory access (RDMA) is a direct memory access from the memory of one computer into that of another without involving either one's operating system. This permits high-throughput, low-latency networking, which is especially useful in massively parallel computer clusters.
Overview
RDMA supports zero-copy networking by enabling the network adapter to transfer data from the wire directly to application memory or from application memory directly to the wire, eliminating the need to copy data between application memory and the data buffers in the operating system. Such transfers require no work to be done by CPUs, caches, or context switches, and transfers continue in parallel with other system operations. This reduces latency in message transfer.
However, this strategy presents several problems related to the fact that the target node is not notified of the completion of the request (single-sided communications).
Acceptance
As of 2018 RDMA had achieved broader acceptance as a result of implementation enhancements that enable good performance over ordinary networking infrastructure. For example RDMA over Converged Ethernet (RoCE) now is able to run over either lossy or lossless infrastructure. In addition iWARP enables an Ethernet RDMA implementation at the physical layer using TCP/IP as the transport, combining the performance and latency advantages of RDMA with a low-cost, standards-based solution. The RDMA Consortium and the DAT Collaborative have played key roles in the development of RDMA protocols and APIs for consideration by standards groups such as the Internet Engineering Task Force and the Interconnect Software Consortium.
Hardware vendors have started working on higher-capacity RDMA-based network adapters, with rates of 100 Gbit/s reported. Software vendors, such as IBM, Red Hat and Oracle Corporation, support these APIs in their latest products, and engineers have started developing network adapters that implement RDMA over
|
https://en.wikipedia.org/wiki/Snag%20%28ecology%29
|
In forest ecology, a snag refers to a standing, dead or dying tree, often missing a top or most of the smaller branches. In freshwater ecology it refers to trees, branches, and other pieces of naturally occurring wood found sunken in rivers and streams; it is also known as coarse woody debris. Snags provide habitat for a wide variety of wildlife but pose hazards to river navigation. When used in manufacturing, especially in Scandinavia, they are often called dead wood and in Finland, kelo wood.
Forest snags
Snags are an important structural component in forest communities, making up 10–20% of all trees present in old-growth tropical, temperate, and boreal forests. Snags and downed coarse woody debris represent a large portion of the woody biomass in a healthy forest.
In temperate forests, snags provide critical habitat for more than 100 species of bird and mammal, and snags are often called 'wildlife trees' by foresters. Dead, decaying wood supports a rich community of decomposers like bacteria and fungi, insects, and other invertebrates. These organisms and their consumers, along with the structural complexity of cavities, hollows, and broken tops make snags important habitat for birds, bats, and small mammals, which in turn feed larger mammalian predators.
Snags are optimal habitat for primary cavity nesters such as woodpeckers which create the majority of cavities used by secondary cavity users in forest ecosystems. Woodpeckers excavate cavities for more than 80 other species and the health of their populations relies on snags. Most snag-dependent birds and mammals are insectivorous and represent a major portion of the insectivorous forest fauna, and are important factors in controlling forest insect populations. There are many instances in which birds reduced outbreak populations of forest insects, such as woodpeckers affecting outbreaks of southern hardwood borers and Engelmann spruce beetles.
Snag creation occurs naturally as trees die due to old age, di
|
https://en.wikipedia.org/wiki/Crown-rump%20length
|
Crown-rump length (CRL) is the measurement of the length of human embryos and fetuses from the top of the head (crown) to the bottom of the buttocks (rump). It is typically determined from ultrasound imagery and can be used to estimate gestational age.
Introduction
The embryo and fetus float in the amniotic fluid inside the uterus of the mother usually in a curved posture resembling the letter C. The measurement can actually vary slightly if the fetus is temporarily stretching (straightening) its body. The measurement needs to be in the natural state with an unstretched body which is actually C shaped. The measurement of CRL is useful in determining the gestational age (menstrual age starting from the first day of the last menstrual period) and thus the expected date of delivery (EDD). Different human fetuses grow at different rates and thus the gestational age is an approximation. Recent evidence has indicated that CRL growth (and thus the approximation of gestational age) may be influenced by maternal factors such as age, smoking, and folic acid intake. Early in pregnancy gestational age 8 weeks, it is accurate within about +/- 5 days but later in pregnancy due to different growth rates, the accuracy is less. In that situation, other parameters can be used in addition to CRL. The length of the umbilical cord is approximately equal to the CRL throughout pregnancy.
Gestational age is not the same as fertilization age. It takes about 14 days from the first day of the last menstrual period for conception to take place and thus for the conceptus to form. The age from this point in time (conception) is called the fertilization age and is thus 2 weeks shorter than the gestational age. Thus a 6-week gestational age would be a 4-week fertilization age. Some authorities however casually interchange these terms and the reader is advised to be cautious. An average gestational period (duration of pregnancy from the first day of the last menstrual period up to delivery) is
|
https://en.wikipedia.org/wiki/Topological%20derivative
|
The topological derivative is, conceptually, a derivative of a shape functional with respect to infinitesimal changes in its topology, such as adding an infinitesimal hole or crack. When used in higher dimensions than one, the term topological gradient is also used to name the first-order term of the topological asymptotic expansion, dealing only with infinitesimal singular domain perturbations. It has applications in shape optimization, topology optimization, image processing and mechanical modeling.
Definition
Let be an open bounded domain of , with , which is subject to a nonsmooth perturbation confined in a small region of size with an arbitrary point of and a fixed domain of . Let be a characteristic function associated to the unperturbed domain and be a characteristic function associated to the perforated domain . A given shape functional associated to the topologically perturbed domain, admits the following topological asymptotic expansion:
where is the shape functional associated to the reference domain, is a positive first order correction function of and is the remainder. The function is called the topological derivative of at .
Applications
Structural mechanics
The topological derivative can be applied to shape optimization problems in structural mechanics. The topological derivative can be considered as the singular limit of the shape derivative. It is a generalization of this classical tool in shape optimization. Shape optimization concerns itself with finding an optimal shape. That is, find to minimize some scalar-valued objective function, . The topological derivative technique can be coupled with level-set method.
In 2005, the topological asymptotic expansion for the Laplace equation with respect to the insertion of a short crack inside a plane domain had been found. It allows to detect and locate cracks for a simple model problem: the steady-state heat equation with the heat flux imposed and the temperature measured on the bo
|
https://en.wikipedia.org/wiki/Chemokine%20receptor
|
Chemokine receptors are cytokine receptors found on the surface of certain cells that interact with a type of cytokine called a chemokine. There have been 20 distinct chemokine receptors discovered in humans. Each has a rhodopsin-like 7-transmembrane (7TM) structure and couples to G-protein for signal transduction within a cell, making them members of a large protein family of G protein-coupled receptors. Following interaction with their specific chemokine ligands, chemokine receptors trigger a flux in intracellular calcium (Ca2+) ions (calcium signaling). This causes cell responses, including the onset of a process known as chemotaxis that traffics the cell to a desired location within the organism. Chemokine receptors are divided into different families, CXC chemokine receptors, CC chemokine receptors, CX3C chemokine receptors and XC chemokine receptors that correspond to the 4 distinct subfamilies of chemokines they bind. Four families of chemokine receptors differ in spacing of cysteine residues near N-terminal of the receptor.
Structural characteristics
Chemokine receptors are G protein-coupled receptors containing 7 transmembrane domains that are found predominantly on the surface of leukocytes, making it one of the rhodopsin-like receptors. Approximately 19 different chemokine receptors have been characterized to date, which share many common structural features; they are composed of about 350 amino acids that are divided into a short and acidic N-terminal end, seven helical transmembrane domains with three intracellular and three extracellular hydrophilic loops, and an intracellular C-terminus containing serine and threonine residues that act as phosphorylation sites during receptor regulation. The first two extracellular loops of chemokine receptors are linked together by disulfide bonding between two conserved cysteine residues. The N-terminal end of a chemokine receptor binds to chemokines and is important for ligand specificity. G-proteins couple
|
https://en.wikipedia.org/wiki/Blebbishield%20emergency%20program
|
Blebbishield emergency program is a process which acts as a last line of defense for cancer stem cells after induction of apoptosis where the apoptotic blebs fuse to shield the cells/nucleus from the destructive force of apoptosis by forming blebbishields. Blebbishields in turn fuse to each other and generate cancer stem cell spheres/cellular transformation, essentially shifting the balance of dying cells back towards survival.
Discovery
Blebbishields were first identified in human bladder cancer cell line RT4 (HTB-2: ATCC), referred to as RT4P (RT4 parent) in the initial report.
Blebbishield formation
Every cell type, especially cancer cells, are capable of undergoing apoptosis, a process in which the plasma membrane undergoes blebbing followed by orderly deconstruction of cells into apoptotic bodies. Cancer stem cells have the extraordinary ability to construct blebbishields from these apoptotic bodies by bleb-bleb fusion and form stem cell spheres/cellular transformation by sub-sequent blebbishield-blebbishield fusion. Endocytosis and endocytosis-driven serpentine filopodia are necessary to tether and tie apoptotic bodies to facilitate fusion. The involvement of membrane fusion was confirmed by inhibiting cholesterol using the cholesterol antagonist Filipin-III.
Blebbishields and cancer stem cells
Sphere forming cells widely display characteristics of tumorigenesis. Cells from blebbishield derived spheres are tumorigenic in nature, providing an important clue for tumorigenesis. Blebbishield emergency program is postulated to have the strong rationale for bladder cancer recurrence as it is a potential cause for multifocal/satellite bladder tumors. The blebbishield derived cells exhibit strong drug resistance behavior and exhibit high sensitivity to Hoechst-33342 similar to side-population cells.
Positive and negative regulators of blebbishield survival
Caspases
Caspases (Caspase-3, caspase-8, caspase-9) are found to have important roles in contributing the fo
|
https://en.wikipedia.org/wiki/Jewish%20Museum%20of%20the%20American%20West
|
The Jewish Museum of the American West is an online museum sponsored by the Western States Jewish History Association dedicated to telling the stories of the participation of Jews in the development of the American West and why they were so successful. It was established in 2013 by Gladys Sturman and David W. Epstein of the Western States Jewish History Association as a continuation of its journal published from 1968 to 2018.
|
https://en.wikipedia.org/wiki/Ahlfors%20theory
|
Ahlfors theory is a mathematical theory invented by Lars Ahlfors as a geometric counterpart of the Nevanlinna theory. Ahlfors was awarded one of the two very first Fields Medals for this theory in 1936.
It can be considered as a generalization of the basic properties of covering maps to the
maps which are "almost coverings" in some well defined sense. It applies to bordered Riemann surfaces equipped with conformal Riemannian metrics.
Preliminaries
A bordered Riemann surface X can be defined as a region on a compact Riemann surface whose boundary ∂X consists of finitely many disjoint Jordan curves. In most applications these curves are piecewise analytic, but there is some explicit minimal regularity condition on these curves which is necessary to make the theory work; it is called the Ahlfors regularity. A conformal Riemannian metric is defined by a length element ds which is expressed in conformal local coordinates z as ds = ρ(z) |dz|, where ρ is a smooth positive function with isolated zeros.
If the zeros are absent, then the metric is called smooth. The length element defines the lengths of rectifiable curves and areas of regions by the formulas
Then the distance between two points is defined as the infimum of the lengths of the curves
connecting these points.
Setting and notation
Let X and Y be two bordered Riemann surfaces, and suppose that Y is equipped with a smooth (including the boundary) conformal metric σ(z) dz. Let f be a holomorphic map from X to Y. Then there exists the pull-back metric on X, which is defined by
When X is equipped with this metric, f becomes a local isometry; that is, the length of a curve equals to the length of its image. All lengths and areas on X and Y are measured with respect to these two metrics.
If f sends the boundary of X to the boundary of Y, then f is a ramified covering. In particular,
a) Each point has the same (finite) number of preimages, counting multiplicity. This number is the degree of the covering
|
https://en.wikipedia.org/wiki/Autonomous%20robot%20architecture
|
The Autonomous Robot Architecture (AuRA) is a hybrid deliberative/reactive robot architecture developed by American roboticist and roboethicist Ronald C. Arkin at the Georgia Institute of Technology. It was developed in mid-1980s. AuRA is one of the first Hybrid Robotic Architecture developed. Hybrid Robotic Architecture forms form combination of reactive and deliberative approaches and gets best from both the approaches.
See also
Three-layer architecture
Servo, subsumption, and symbolic architecture
Distributed architecture for mobile navigation (DAMN)
ATLANTIS architecture
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.