source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/OpenHarmony | OpenAtom OpenHarmony, or abbreviated as OpenHarmony (OHOS), is an open-source version of HarmonyOS donated by Huawei to the OpenAtom Foundation. Similar to HarmonyOS, the open-source distributed operating system is designed with a layered architecture, which consists of four layers from the bottom to the top, i.e., the kernel layer, system service layer, framework layer, and application layer.
OpenHarmony supports various devices running a mini system such as printers, speakers, smartwatches and any other smart device with memory as small as 128 KB, or running a standard system with memory greater than 128 MB.
The system contains the basic capabilities of HarmonyOS.
History
The first version of OpenHarmony was launched by the OpenAtom Foundation on September 10, 2020, after receiving a donation of the open-source code from Huawei, with support for devices with RAM volumes ranging from 128 KB to 128 MB.
The OpenHarmony 2.0 (Canary version) was launched in June 2021, supporting a variety of smart terminal devices.
Based on its earlier version, OpenAtom Foundation launched OpenHarmony 3.0 on September 30, 2021, and brought substantial improvements over the past version to optimize the operating system.
A release of OpenHarmony supporting devices with up to 4 GB RAM was made available in October 2021.
OpenAtom Foundation added a UniProton kernel, a hardware-based real-time operating system, into its repo as part of the Kernel Abstraction Layer (KAL) subsystem of the OpenHarmony operating system on August 10, 2022.
Timeline
September 10, 2020 – Initial release of OpenHarmony with support for devices with 128 KB – 128 MB RAM
April 2021 – OpenHarmony release with support for smartphones and other devices with 128 MB – 4 GB RAM
October 2021 – OpenHarmony release with support for additional devices with 4+ GB RAM
Hardware
OpenHarmony can be deployed on various hardware devices of ARM, RISC-V and x86 architectures with memory volumes ranging from as small a |
https://en.wikipedia.org/wiki/Graduate%20School%20of%20Engineering%20and%20Faculty%20of%20Engineering%2C%20Kyoto%20University | Graduate School of Engineering and Faculty of Engineering (京都大学大学院工学研究科・工学部) is one of schools at the Kyoto University. The Faculty (Undergraduate) and the Graduate School operate as one.
According to the QS World University Rankings by Subject 2020 in the field of Engineering & Technology, KU is ranked third in Japan after University of Tokyo and TokyoTech.
History
In 1897, College of Science and Engineering (理工科大学) was established with the establishment of Imperial University of Kyoto. It was divided into College of Engineering (工科大学) and College of Science in 1914.
College of Engineering was reorganized into Faculty of Engineering (工学部) in 1919.
In 1953, Graduate School of Engineering (工学研究科) was established.
In the 1990s, A four-year plan to emphasize graduate school education was implemented and some departments were converted into independent graduate schools; Graduate School of Energy Science was established in 1996 and Graduate School of Informatics in 1998.
Divisions
It consists of the undergraduate schools, departments and centers.
Undergraduate Schools
The Faculty of Engineering has 6 Undergraduate Schools, some of which have more specialized courses.
Civil, Environmental and Resources Engineering
Civil Engineering course
Environmental Engineering course - connected to the Graduate School of Global Environmental Studies
Earth Resources and Energy Engineering course - connected to the Graduate School of Energy Science
Architecture
Engineering Science
Mechanical and Systems Engineering course
Aeronautics and Astronautics course
Materials Science course
Nuclear Engineering course
Applied Energy Science and Engineering course
Electrical and Electronic Engineering
Informatics and Mathematical Science - connected to the Graduate School of Informatics
Applied Mathematics and Physics course
Computer Science course
Chemical Science and Technology
Frontier Chemistry course
Advanced Chemistry course
Chemical Process Engineering course |
https://en.wikipedia.org/wiki/List%20of%20influencer%20boxing%20matches | These bouts consist of YouTubers, streamers, TikTokers, and other types of internet celebrities across traditional boxing, chess boxing and bare-knuckle boxing.
Boxing
Chess boxing
Bare-knuckle boxing
References
See also
KSI vs Jake Paul
White-collar boxing
2018 establishments in England
2018 introductions
Boxing matches
Boxing-related lists
Boxing
Boxing
Crossover boxing events
Internet culture
YouTube boxing events
YouTube-related lists |
https://en.wikipedia.org/wiki/StarkWare%20Industries | StarkWare Industries is an Israeli software company that specializes in cryptography. It develops zero-knowledge proof technology that compresses information to address the scalability problem of the blockchain, and works on the Ethereum platform.
In May 2022, the company's estimated value was $8 billion, an increase from $2 billion six months earlier.
History
StarkWare Industries was founded in 2018 by Eli Ben-Sasson (President) from the Technion, one of the founders of Zcash,
his former phd. student Michael Riabzev, Uri Kolodny (CEO), and Alessandro Chiesa from UC Berkeley (chief scientist).
In April 2019 Technion sued Ben-Sasson and Riabazev for violating its Intellectual property
The institute claimed that Ben-Sasson established StarkWare clandestinely, for his academic research without consent and demand 50% of his stake in the company. Ben-Sasson claimed that he didn't use any invention belonging to the Technion, merely based on StarkWares’ employees' knowledge. In 2020 the two sides reached an agreement and Ben-Sasson left the Technion.
Starkware raised $6 million in seed money and afterward $30 million in series A round led by Paradigm, VC fund by Fred Ehrsam. Other participants were Intel Capital, Sequoia Capital, Coinbase and Vitalik Buterin. In March 2021 the company raised $75 million in series B round. It was led by Paradigm, along with other VCs such as Sequoia, DCVC, Pantera Capital, Wing, Alameda Research, and Founders Fund. In addition it received $12 million from the Ethereum Foundation.
In November 2021 StarkWare raised $50 million in a Series C round led by Sequoia, making its total raised money to $163 million and bringing its value to $2 billion, making it a Unicorn. In May 2022 StarkWare raised 100 million in a Series D round led by Greenoaks Capital and Coatue Management, bringing its value to $8 billion. Series D was carried out despite a bear market.
Starkware's scientific advisors include: Avi Wigderson, Shafi Goldwasser, Noam Nisan |
https://en.wikipedia.org/wiki/Media%20History%20Digital%20Library | The Media History Digital Library (MHDL) is a non-profit, open access digital archive founded by David Pierce and directed by Eric Hoyt that compiles books, magazines, and other print materials related to the histories of film, broadcasting, and recorded sound and makes these materials accessible online for free. The MHDL both digitizes physical materials and acquires digital copies from outside libraries, archives, collectors, and other collaborators. Most of the material in its more than 2.5 million pages is in the public domain and therefore free for all to use with no restrictions.
Projects of the Media History Digital Library include its search engine Lantern and its data visualization platform Arclight. The Media History Digital Library is led by the Wisconsin Center for Film and Theater Research at the University of Wisconsin–Madison, in Madison, Wisconsin. Film and media studies librarian James Steffen has called the MHDL one of "the two most important digital collections today for studying media industries."
History
Film historian David Pierce founded the Media History Digital Library in 2009 to address the scholarly and fan communities' lack of access to historical film industry publications such as trade papers and fan magazines. Even those documents that had been transferred to microfilm were infrequently digitized, making both the original works and any microfilm copies only available at specific libraries, archives, and private collections. Having knowledge of copyright laws, Pierce determined that while many early Hollywood films, kinescopes, recordings, and similar materials would be protected by copyright, most publications would not. Working with partners at collections such as the Museum of Modern Art Library, the Academy of Motion Picture Arts and Sciences' Margaret Herrick Library, and the Library of Congress National Audio Visual Conservation Center as well as private collectors, Pierce began to scan the original copies of many of these pub |
https://en.wikipedia.org/wiki/Harris%20Computer%20Systems | Harris Computer Systems Corporation was an American computer company, in existence during the mid-1990s, that made real-time computing systems. Its products powered a variety of applications, including those for aerospace simulation, data acquisition and control, and signal processing. It was based in Fort Lauderdale, Florida. For twenty years prior, it had been the Harris Computer Systems Division of Harris Corporation, until being spun off as an independent company in 1994. Then in 1996, Harris Computer Systems Corporation itself was acquired by Concurrent Computer Corporation.
Origins
The origins of Harris Computer Systems began in 1967 in Fort Lauderdale, Florida, when Datacraft Corporation was founded. It would specialize in minicomputers for the scientific engineering market and for educational use.
The best known of these were the DC-6024 line, which were based on a 24-bit computing architecture and debuted in 1969. Successive models were denoted with names such as DC-6024/1 and DC-6024/4, which became known as "Slash 1", "Slash 4", and so forth. The Slash 1 made cost-effective use of hardware for floating-point operations and quickly became popular as alternatives to computers from Systems Engineering Laboratories.
Harris Computer Systems Division
In 1974, Harris Corporation acquired Datacraft, which led to the formation of the Harris Computer Systems Division. Some of the later "Slash" systems were sold under the Harris name.
The Harris Computer Systems Division then came out with the H-Series product line, which featured virtual memory as a key aspect. It remained one of the few 24-bit computers available at the time. Such models included the H80 and H100 minicomputers. Like other Harris Computer systems, these were geared towards multiple-processing jobs and real-time environments. H-series products were generally good at maintaining binary compatibility, meaning old application executables could still run on newer models. Later models |
https://en.wikipedia.org/wiki/Capacitated%20arc%20routing%20problem | In mathematics, the capacitated arc routing problem (CARP) is that of finding the shortest tour with a minimum graph/travel distance of a mixed graph with undirected edges and directed arcs given capacity constraints for objects that move along the graph that represent snow-plowers, street sweeping machines, or winter gritters, or other real-world objects with capacity constraints. The constraint can be imposed for the length of time the vehicle is away from the central depot, or a total distance traveled, or a combination of the two with different weighting factors.
There are many different variations of the CARP described in the book Arc Routing:Problems, Methods, and Applications by Ángel Corberán and Gilbert Laporte.
Solving the CARP involves the study of graph theory, arc routing, operations research, and geographical routing algorithms to find the shortest path efficiently.
The CARP is NP-hard arc routing problem.
The CARP can be solved with combinatorial optimization including convex hulls.
The large-scale capacitated arc routing problem (LSCARP) is a variant of the capacitated arc routing problem that applies to hundreds of edges and nodes to realistically simulate and model large complex environments.
References
Graph theory |
https://en.wikipedia.org/wiki/Inception%20score | The Inception Score (IS) is an algorithm used to assess the quality of images created by a generative image model such as a generative adversarial network (GAN). The score is calculated based on the output of a separate, pretrained Inceptionv3 image classification model applied to a sample of (typically around 30,000) images generated by the generative model. The Inception Score is maximized when the following conditions are true:
The entropy of the distribution of labels predicted by the Inceptionv3 model for the generated images is minimized. In other words, the classification model confidently predicts a single label for each image. Intuitively, this corresponds to the desideratum of generated images being "sharp" or "distinct".
The predictions of the classification model are evenly distributed across all possible labels. This corresponds to the desideratum that the output of the generative model is "diverse".
It has been somewhat superseded by the related Fréchet inception distance. While the Inception Score only evaluates the distribution of generated images, the FID compares the distribution of generated images with the distribution of a set of real images ("ground truth").
Definition
Let there be two spaces, the space of images and the space of labels . The space of labels is finite.
Let be a probability distribution over that we wish to judge.
Let a discriminator be a function of type where is the set of all probability distributions on . For any image , and any label , let be the probability that image has label , according to the discriminator. It is usually implemented as an Inception-v3 network trained on ImageNet.
The Inception Score of relative to isEquivalent rewrites include is nonnegative by Jensen's inequality.
Pseudocode:
Interpretation
A higher inception score is interpreted as "better", as it means that is a "sharp and distinct" collection of pictures.
, where is the total number of possible labels.
iff for almost all Th |
https://en.wikipedia.org/wiki/World%20Backup%20Day | World Backup Day is a commemorative date celebrated annually by the backup industry and tech industry all over the world. It highlights the importance of protecting data and keeping systems and computers secure.
World Backup Day started with a post on Reddit where a user wrote about losing their hard drive and wishing someone had reminded them about how important it is to backup data. The campaign started by Ismail Jadun in 2011 and every year news outlets write articles about the importance of backing up data on World Backup Day.
Observance
Every year on March 31, companies tweet and have podcasts about the importance of backing up data to prevent data loss. On the website WorldBackupDay.com people can make a pledge in ten languages on various social media channels about the importance of backing up their data. The World Backup Day is recognized as National Calendar Day on many national holiday websites.
References
External links
Official site
Backup
Awareness days
Unofficial observances |
https://en.wikipedia.org/wiki/Garbhanga%20Wildlife%20Sanctuary | Garbhanga Wildlife Sanctuary (formerly Garbhanga and Rani Reserve Forest) is a wildlife sanctuary on the southwestern side of Guwahati City, bordering the state of Meghalaya, India. The forested area is the key urban wildlife site and catchment area near Guwahati City.
Located approximately 15 km (10 miles) away from Guwahati, Garbhanga Wildlife Sanctuary is situated in the southern part of Assam, bordering the foothills of Meghalaya. It is located very close to the Deepor Bill, and because of its location in an urban area it is considered a key wildlife area of Guwahati City.
Garbhanga Wildlife Sanctuary has a total land area of 117 km2 and lies between the Garbhanga and Rani ranges.
Etymology
The origin of wildlife sanctuary's name is unclear. However, some believe that the name comes from the Karbi people, who came from the Markang area of Sonapur and eventually entered the hilly forest for Jhum cultivation.
Garbhanga was declared a wildlife sanctuary by the second secretary to the government of Assam, Mr G.T. Lloyd. He was under the supervision of Major Briggs, who surveyed the forest in 1862.
Brief boundary description
The Garbhanga Wildlife Sanctuary is surrounded by Guwahati City and Dipor Bill in the South, the Meghalayan ranges on the east and north, and Rani Range on the west.
North
The northern boundary starts at BSF headquarters near the VIP Road, then runs along the foothills of Matia, Chakradeo, Dipor Bil, Mahua Para, Pamohi, and Mainakhurung up to Paschdhora River, which is the common boundary between Garbhanga Reserve Forest and Rani Reserve Forest. From there, the boundary runs along Phalbama, Nawagaon, and Nalapara, up to Lokhara Village and to the Siva Temple, which is situated in the northeast corner.
East
On the east side, the boundary runs along the Basistha river, up to the front side of the Government Art School and then follows the stream. Permanent boundary pillars are situated near the Basistha River, then the eastern boundary runs |
https://en.wikipedia.org/wiki/Capability%20curve | Capability curve of an electrical generator describes the limits of the active (MW) and reactive power (MVAr) that the generator can provide. The curve represents a boundary of all operating points in the MW/MVAr plane; it is typically drawn with the real power on the horizontal axis, and, for the synchronous generator, resembles a letter D in shape, thus another name for the same curve, D-curve. In some sources the axes are switched, and the curve gets a dome-shaped appearance.
Synchronous generators
For a traditional synchronous generator the curve consists of multiple segments, each due to some physical constraint:
at the right part of the curve (close to the rated voltage), the generator is constrained by the heat dissipation in the armature (stator for large generators). The heating is proportional to the sum of squares of active and reactive currents, at the near-constant voltage it is closely proportional to the sum of squares of MW and MVAr, therefore this part of the curve (armature heating limit) resembles a section of a semicircle with the center at (0,0);
at the upper part of the curve (generator produces a lot of reactive power) operation requires higher voltage on the output of the generator and thus higher excitation field. The rotating excitation winding has its own field heating limit;
at the bottom of the curve (generator absorbs a lot of reactive power) the magnetic flux constraints in the stator cause heating of the magnetic core at the stator end (core end heating limit).
The corners between the sections of the curve define the limits of the power factor (PF) that the generator can sustain at its nameplate capacity (the illustration has the PF ticks placed at 0.85 lagging and 0.95 leading angles). In practice, the prime mover (a power source that drives the generator) is designed for less active power than the generator is capable of (due to the fact that in real life generator always has to deliver some reactive power), so a prime move |
https://en.wikipedia.org/wiki/Heterostrain | The term heterostrain was proposed in 2018 in the context of materials science to simplify the designation of possible strain situations in van der Waals heterostructures where two (or more) two-dimensional materials are stacked on top of each other. These layers can experience the same deformation (homostrain) or different deformations (heterostrain). In addition to twist, heterostrain can have important consequences on the electronic and optical properties of the resulting structure. As such, the control of heterostrain is emerging as a sub-field of straintronics in which the properties of 2D materials are controlled by strain. Recent works have reported a deterministic control of heterostrain by sample processing or with the tip of an AFM of particular interest in twisted heterostructures. Heterostrain alone (without twist) has also been identified as a parameter to tune the electronic properties of van der Waals structures as for example in twisted graphene layers with biaxial heterostrain.
Etymology
Heterostrain is constructed from the Greek prefix hetero- (different) and the noun strain. It means that the two layers constituting the structure are subject to different strains. This is in contrast with homostrain in which the two layers as subject to the same strain. Heterostrain is designated as "relative strain" by some authors.
Manifestation and measurement of heterostrain
For simplicity, the case of two graphene layers is considered. The description can be generalized for the case of different 2D materials forming an heterostructure.
In nature, the two graphene layers usually stack with a shift of half a unit cell. This configuration is the most energetically favorable and is found in graphite. If one layer is strained while the other is left intact, a moiré pattern signaling the regions where the atomic lattices of the two layers are in or out of registry. The shape of the moiré pattern depends on the type of strain.
If the layer is deformed along o |
https://en.wikipedia.org/wiki/Standardised%20Precipitation%20Evapotranspiration%20Index | The Standardized Precipitation Evapotranspiration Index (SPEI) is a multiscalar Drought index based on climatic data. It Developed by Vicente-Serrano et al. (2010) at the Institute Pirenaico de Ecologia in Zaragoza, Spain. It can be used for determining the onset, duration and magnitude of drought conditions with respect to normal conditions in a variety of natural and managed systems such as crops, ecosystems, rivers, water resources, etc.
See also
Keetch–Byram drought index
palmer drought Index
Drought
References
External links
SPEI world database, updated monthly
R package that calculates the SPEI
Meteorological indices
Droughts
Hydrology |
https://en.wikipedia.org/wiki/Interactive%20application%20security%20testing | Interactive application security testing (abbreviated as IAST) is a security testing method that detects software vulnerabilities by interaction with the program coupled with observation and sensors. The tool was launched by several application security companies. It is distinct from static application security testing, which does not interact with the program, and dynamic application security testing, which considers the program as a black box. It may be considered a mix of both.
References
Security testing |
https://en.wikipedia.org/wiki/Gauss%20separation%20algorithm | Carl Friedrich Gauss, in his treatise Allgemeine Theorie des Erdmagnetismus, presented a method, the Gauss separation algorithm, of partitioning the magnetic field vector, B, measured over the surface of a sphere into two components, internal and external, arising from electric currents (per the Biot–Savart law) flowing in the volumes interior and exterior to the spherical surface, respectively. The method employs spherical harmonics. When radial currents flow through the surface of interest, the decomposition is more complex, involving the decomposition of the field into poloidal and toroidal components. In this case, an additional term (the toroidal component) accounts for the contribution of the radial current to the magnetic field on the surface.
The method is commonly used in studies of terrestrial and planetary magnetism, to relate measurements of magnetic fields either at the planetary surface or in orbit above the planet to currents flowing in the planet's interior (internal currents) and its magnetosphere (external currents). Ionospheric currents would be exterior to the planet's surface, but might be internal currents from the vantage point of a satellite orbiting the planent.
Notes
References
.
.
Magnetism
Geomagnetism
Physical quantities
Harmonic analysis |
https://en.wikipedia.org/wiki/Lyra%20%28codec%29 | Lyra is a lossy audio codec developed by Google that is designed for compressing speech at very low bitrates. Unlike most other audio formats, it compresses data using a machine learning-based algorithm.
Features
The Lyra codec is designed to transmit speech in real-time when bandwidth is severely restricted, such as over slow or unreliable network connections. It runs at fixed bitrates of 3.2, 6, and 9 kbit/s and it is intended to provide better quality than codecs that use traditional waveform-based algorithms at similar bitrates. Instead, compression is achieved via a machine learning algorithm that encodes the input with feature extraction, and then reconstructs an approximation of the original using a generative model. This model was trained on thousands of hours of speech recorded in over 70 languages to function with various speakers. Because generative models are more computationally complex than traditional codecs, a simple model that processes different frequency ranges in parallel is used to obtain acceptable performance. Lyra imposes 20 ms of latency due to its frame size. Google's reference implementation is available for Android and Linux.
Quality
Lyra's initial version performed significantly better than traditional codecs at similar bitrates. Ian Buckley at MakeUseOf said, "It succeeds in creating almost eerie levels of audio reproduction with bitrates as low as 3 kbps." Google claims that it reproduces natural-sounding speech, and that Lyra at 3 kbit/s beats Opus at 8 kbit/s. Tsahi Levent-Levi writes that Satin, Microsoft's AI-based codec, outperforms it at higher bitrates.
History
In December 2017, Google researchers published a preprint paper on replacing the Codec 2 decoder with a WaveNet neural network. They found that a neural network is able to extrapolate features of the voice not described in the Codec 2 bitstream and give better audio quality, and that the use of conventional features makes the neural network calculation simpler compa |
https://en.wikipedia.org/wiki/Carbon%20%28programming%20language%29 | Carbon is an experimental programming language designed for interoperability with C++. The project is open-source and was started at Google. Google engineer Chandler Carruth first introduced Carbon at the CppNorth conference in Toronto in July 2022. He stated that Carbon was created to be a C++ successor. The language is expected to have a 1.0 release in 2024 or 2025.
The language intends to fix several perceived shortcomings of C++ but otherwise provides a similar feature set.
The main goals of the language are readability and "bi-directional interoperability" (which allows the user to include C++ code in the Carbon file), as opposed to using a new language like Rust, that, while being influenced by C++, is not two-way compatible with C++ programs. Changes to the language will be decided by the Carbon leads.
Carbon's documents, design, implementation, and related tools are hosted on GitHub under the Apache-2.0 license with LLVM Exceptions.
Example
The following shows how a "Hello, World!" program is written in Carbon:
package Sample api;
fn Main() -> i32 {
var s: auto = "Hello, World!";
Print(s);
return 0;
}
The following is the equivalent "Hello, World!" program written in C++:
#include <iostream>
int main() {
auto s = "Hello, World!";
std::cout << s;
return 0;
}
See also
Comparison of programming languages
Timeline of programming languages
C++
D
Rust
References
External links
Carbon at the Compiler Explorer (godbolt)
Google
Programming languages
Statically typed programming languages
Cross-platform software
Object-oriented programming languages
Programming languages created in 2022 |
https://en.wikipedia.org/wiki/Continuous%20poset | In order theory, a continuous poset is a partially ordered set in which every element is the directed supremum of elements approximating it.
Definitions
Let be two elements of a preordered set . Then we say that approximates , or that is way-below , if the following two equivalent conditions are satisfied.
For any directed set such that , there is a such that .
For any ideal such that , .
If approximates , we write . The approximation relation is a transitive relation that is weaker than the original order, also antisymmetric if is a partially ordered set, but not necessarily a preorder. It is a preorder if and only if satisfies the ascending chain condition.
For any , let
Then is an upper set, and a lower set. If is an upper-semilattice, is a directed set (that is, implies ), and therefore an ideal.
A preordered set is called a continuous preordered set if for any , the subset is directed and .
Properties
The interpolation property
For any two elements of a continuous preordered set , if and only if for any directed set such that , there is a such that . From this follows the interpolation property of the continuous preordered set : for any such that there is a such that .
Continuous dcpos
For any two elements of a continuous dcpo , the following two conditions are equivalent.
and .
For any directed set such that , there is a such that and .
Using this it can be shown that the following stronger interpolation property is true for continuous dcpos. For any such that and , there is a such that and .
For a dcpo , the following conditions are equivalent.
is continuous.
The supremum map from the partially ordered set of ideals of to has a left adjoint.
In this case, the actual left adjoint is
Continuous complete lattices
For any two elements of a complete lattice , if and only if for any subset such that , there is a finite subset such that .
Let be a complete lattice. Then the following conditions are equiva |
https://en.wikipedia.org/wiki/Walter%20Lambrecht | Walter R. L. Lambrecht (born 1955) is a Belgian physicist.
Born in Aalst, Belgium, in 1955, Lambrecht attended the University of Ghent, where he earned a Lic. Sc. and a Dr. Sc. in 1977 and 1980, respectively. He is a professor at Case Western Reserve University. In 2002, Lambrecht was elected a fellow of the American Physical Society, "[f]or his seminal contributions to a better understanding of the electronic structure and linear and nonlinear optical properties of semiconductors, in particular wide band gap semiconductors, chalcopyrites and rare-earth pnictides".
References
Semiconductor physicists
People from Aalst, Belgium
1955 births
Living people
Belgian physicists
21st-century Belgian scientists
Ghent University alumni
Case Western Reserve University faculty
20th-century Belgian scientists
Belgian expatriates in the United States
Fellows of the American Physical Society |
https://en.wikipedia.org/wiki/Glossary%20of%20lichen%20terms | This glossary provides an overview of terms used in the description of lichens, composite organisms arising from algae or cyanobacteria living symbiotically among filaments of multiple fungus species.
Erik Acharius, known as the "father of lichenology," coined many lichen terms still in use today around the turn of the 18th century. Before that, only a couple of lichen-specific terms had been proposed. Johann Dillenius introduced in 1742 to describe the cup-shaped structures associated with genus Cladonia, while in 1794 Michel Adanson used for the furrowed fruitbodies of the genus Graphis. Acharius introduced numerous terms to describe lichen structures, including , , , , , , and . In 1825, Friedrich Wallroth published the first of his multi-volume work Naturgeschichte der Flechten ("Natural History of Lichens"), in which he proposed an alternative terminology based largely on roots from the Greek language. His work, presented as an alternative to that of Acharius (of whom he was critical) was not well received, and the only terms he proposed to gain widespread acceptance were and , and , and , the last of which remained in use until the 1960s. Until about 1850, there were 21 terms for features of the lichen thallus that remain in use today.
The increasing availability of the optical microscope as an aid to identifying and characterizing lichens led to the creation of new terms to describe structures that were previously too small to be visualized. Contributions were made by Julius von Flotow (e.g. ), Edmond Tulasne (e.g ), and William Nylander (e.g. , ). Gustav Wilhelm Körber, an early proponent of using spore structure as a in lichen taxonomy, introduced , , and "polari-dyblastae", later anglicized to "polari-bilocular" and then shortened to . In the next five decades that followed, many other additions were made to the repertoire of lichen terms, subsequent to the increased understanding of lichen anatomy and physiology made possible by microscopy. For wha |
https://en.wikipedia.org/wiki/BlankOn%20Linux | BlankOn Linux is a Debian-based Linux distribution made in Indonesia. This distribution was developed by the BlankOn Development Team with support from the Indonesian Linux Mobilization Foundation (YPLI) since 2004.
History
In April 2021, BlankOn 12 Beta was released to the public.
References
2004 software
Computer-related introductions in 2004
Free software operating systems
Linux distributions
Debian-based distributions
X86-64 Linux distributions
State-sponsored Linux distributions |
https://en.wikipedia.org/wiki/List%20of%20taxa%20named%20after%20human%20genitals | This a list of species, genera, and other taxa named after human genitals.
Plants
Families
Orchidaceae. The type genus is Orchis, whose name comes from the Ancient Greek (), literally meaning "testicle", because of the shape of the twin tubers in some species of Orchis.
Genera
Amorphophallus
Clitoria
Orchis
Species
Alysicarpus vaginalis
Baumea vaginalis
Chenopodium vulvaria
Festuca vaginalis
Pontederia vaginalis
Varieties
Capsicum annum annum var. annum 'penis pepper'
Fungi
Orders
Phallales
Families
Phallaceae
Genera
Phallus
Species
Amanita phalloides
Amanita vaginata
Animals
Subspecies
Muntiacus muntjak vaginalis
General
Pubescens. The word originates from the Latin pubes, "adult, full-grown"; "genital area, groin" (e.g., Pubis); "the down or soft hair which begins to grow on young persons when they come to the age of puberty". The use of the term in biology to refer to hairiness or soft down is recorded since 1760 for plants and since 1826 for insects.
Vaginalis. The common specific name is derived from the Latin vagina, originally meaning "sheath, scabbard, covering; sheath of an ear of grain, hull, husk." The specific epithet may refer to a sheathed trait or habit of an organism (e.g. Alysicarpus vaginalis), or may refer to resemblance/relation to the vagina (e.g. Gardnerella vaginalis)
References
Taxa
Science-related lists
Human reproductive system |
https://en.wikipedia.org/wiki/The%20Applicability%20of%20Mathematics%20in%20Science%3A%20Indispensability%20and%20Ontology | The Applicability of Mathematics in Science: Indispensability and Ontology is a 2012 book on the philosophy of mathematics by Sorin Bangu. It argues for an improved form of indispensability argument based on a Quinean-inspired naturalism and confirmational holism, as well as a position he calls "posit realism". It also explores the applications of mathematics in scientific discovery and explanation.
References
Mathematics books
Books about philosophy of mathematics |
https://en.wikipedia.org/wiki/Equisingularity | In algebraic geometry, an equisingularity is, roughly, a family of singularities that are not non-equivalent and is an important notion in singularity theory. There is no universal definition of equisingularity but Zariki's equisingularity is the most famous one. Zariski's equisingualrity, introduced in 1971 under the name " algebro-geometric equisingularity", gives a stratification that is different from the usual Whitney stratification on a real or complex algebraic variety.
See also
stratified space
References
Further reading
https://mathoverflow.net/questions/299314/a-general-definition-of-an-equisingular-family-of-singular-varieties
algebraic geometry |
https://en.wikipedia.org/wiki/Tame%20topology | In mathematics, a tame topology is a hypothetical topology proposed by Alexander Grothendieck in his research program Esquisse d’un programme under the French name topologie modérée (moderate topology). It is a topology in which the theory of dévissage can be applied to stratified structures such as semialgebraic or semianalytic sets.
Some authors consider an o-minimal structure to be a candidate for realizing tame topology in the real case. There are also some other suggestions.
See also
Thom's first isotopy lemma
References
External links
https://ncatlab.org/nlab/show/tame+topology
Algebraic analysis
Geometry education
Stratifications
Topology |
https://en.wikipedia.org/wiki/Solid%20State%20Logic%20SL%204000 | The Solid State Logic SL 4000 is a series of large-format analogue mixing consoles designed and manufactured by Solid State Logic (SSL) from 1976 to 2002. 4000 Series consoles were widely adopted by major commercial recording studios in the 1980s.
History
Origin of the SSL console
SSL founder Colin Sanders owned and operated Acorn Studios, a recording studio in Stonesfield, Oxfordshire. When he sought a recording console with routing flexibility and settings recall unavailable on recording consoles at that time, Sanders applied his experience to design and build a mixing console himself, resulting in the SL 4000 A Series large-format analogue mixing console, which featured one-button switching between recording, tracking and mixdown modes. A total of two SL 4000 A Series consoles were built, the beginning of a series of products that would define and establish SSL as a company over the next two decades.
B Series
The SL 4000 B Series, introduced in 1976, revolutionized the recording industry by combining the in-line mixing console with a computer which provided fader automation and programmable tape transport auto-location functionality., The B Series was in production for four years, during which a total of six B Series consoles were built and sold, the first B Series console purchased by Abbey Road Studios in London, England. The second B Series console was purchased by Le Studio in Morin-Heights, Canada, where it was used in the recording of such notable albums as Moving Pictures and several subsequent Rush albums, as well as Bryan Adams Cuts Like a Knife. Kendun Recorders in Burbank, California also purchased an SL 4000 B.
Another early SL 4000 B was purchased by Virgin Records' Townhouse Studios in London, and it was with that console that engineer Hugh Padgham accidentally discovered gated reverb while recording Phil Collins' drum parts for Peter Gabriel's 1980 song "Intruder". The console featured a "Listen Mic", or reverse talkback function intended to a |
https://en.wikipedia.org/wiki/Sergey%20Piletsky | Sergey Piletsky is a professor of Bioanalytical Chemistry and the Research Director for School of Chemistry, University of Leicester, United Kingdom.
Education
Sergey graduated from Kiev University, Ukraine, obtaining an MSc in chemistry in 1985 and researched on synthesis of the polymers selective for nucleic acids, for which he was awarded with a PhD in 1991. Cranfield University awarded Sergey with a DSc for his work on Molecularly imprinted polymers for diagnostics applications.
Awards
Sergey is a recipient of Royal Society Wolfson Research Merit Award, Leverhulme Trust Fellowship, DFG Fellowship from the Institute of Analytical Chemistry, Award of President of Ukraine, and Japan Society for Promotion of Science and Technology Fellowship.
Research
Sergey's work in molecular imprinting focuses on: (i) the fundamental study of the recognition properties of molecularly imprinted polymers; (ii) the development of sensors and assays for environmental and clinical analysis; and (iii) the development of molecularly imprinted polymers nanoparticles for theranostic applications.
Sergey introduced computational design into the field of molecular imprinting, by scientifically demonstrating that non-covalent interaction between the template molecule and polymer is through the technique 'bite and switch' where functional groups first non-covalently bond with the binding site, but during the rebinding step, the polymer matrix forms irreversible covalent bonds with the target molecule. A number of research groups around the world follow his idea, for developing functional imprinted polymers for a variety of applications.
Most widely cited journal publications
Surface-grafted molecularly imprinted polymers for protein recognition, A Bossi, SA Piletsky, EV Piletska, PG Righetti, APF Turner, Analytical chemistry 73 (21), 5281-5286
Electrochemical sensor for catechol and dopamine based on a catalytic molecularly imprinted polymer-conducting polymer hybrid recogni |
https://en.wikipedia.org/wiki/C17orf75 | Chromosome 17 open reading frame 75 is a protein that in humans is encoded by the C17orf75 gene. C17orf75 is also known as SRI2 (sensitization to ricin complex subunit 2) and is a human protein encoding gene located at 17q11.2 on the complementary strand. The protein this gene encodes is also known as NJMU-R1. The C17orf75 gene is ubiquitously expressed at medium-low levels throughout the body and at slightly higher levels in the brain and testes. This protein is thought to be part of a complex associated with golgin-mediated vesicle capture.
Gene
The C17orf75 gene spans from position 32,328,441 to position 32,342,173 with a length of 13,733 nucleotides. The length after intron excision is 4,547 nucleotides, and the coding sequence is 1,191 nucleotides in length. C17orf75 has 10 exons.
RNA
C17orf75 has 4 transcript isoforms: C17orf75 and 3 predicted isoforms which are C17orf75 transcript variant X1 (4,568 nucleotides in length), C17orf75 transcript variant X2 (4,449 nucleotides in length), and C17orf75 transcript variant X3 (4,464 nucleotides in length).
Protein
Structure
The primary isoform of the protein NJMU-R1 is 396 amino acids long. The theoretical isoelectric point for the protein NJMU-R1 is around 5, and its predicted molecular weight is around 44 kD. This protein has a leucine zipper that is predicted to contribute to a coiled coil in the protein's folded structure. The secondary structure of the protein is predicted to dominated by helices, with some beta sheets. 3 potential disulfide bridge sites via cysteine residues are predicted in the protein.
Post-Translational Modifications
The protein NJMU-R1 has two experimentally determined serine phosphorylation sites near the N-terminus. Predicted post-translational modifications include tyrosine sulfation, O-linked glycosylation, and GPI anchor attachment.
Tissue Localization
Immunohistochemistry staining images show moderate protein levels throughout mouse brain tissues, but the Purkinje layer in |
https://en.wikipedia.org/wiki/Bryophilous%20lichen | A bryophilous lichen is one that grows on a bryophyte – that is, on a moss or liverwort. Those which grow on mosses are known as muscicolous lichens, while those grow on liverworts are called hepaticolous lichens. Muscicolous derives from the Latin muscus meaning moss, while the suffix colous means "living or growing in or on". Lichens are slow-growing organisms, and so are far more likely to be overgrown by a bryophyte than to overgrow one. However, they are better able to compete if the bryophyte is sickly or decaying and they can be parasitic upon them. Some, rather than overgrowing the bryophyte, instead live among its branches. Bryophilous lichens are particularly common in heathland and arctic or alpine tundra. Because many are small and inconspicuous, they are easy to overlook.
Citations
References
Lichenology |
https://en.wikipedia.org/wiki/Elementary%20modes | Elementary modes may be considered minimal realizable flow patterns through a biochemical network that can sustain a steady state. This means that elementary modes cannot be decomposed further into simpler pathways. All possible flows through a network can be constructed from linear combinations of the elementary modes.
The set of elementary modes for a given network is unique (up to an arbitrary scaling factor). Given the fundamental nature of elementary modes in relation to uniqueness and non-decomposability, the term `pathway' can be defined as an elementary mode. Note that the set of elementary modes will change as the set of expressed enzymes change during transitions from one cell state to another. Mathematically, the set of elementary modes is defined as the set of flux vectors, , that satisfy the steady state condition,
where is the stoichiometry matrix, is the vector of rates, the vector of steady state floating (or internal) species and , the vector of system parameters.
An important condition is that the rate of each irreversible reaction must be non-negative, .
A more formal definition is given by:
An elementary mode, , is defined as a vector of fluxes, , such that the three conditions listed in the following criteria are satisfied.
The vector must satisfy: , that is: the steady state condition.
For all irreversible reactions: . This means that all flow patterns must use reactions that proceed in their most natural direction. This makes the pathway described by the elementary mode a thermodynamically feasible pathway.
The vector must be elementary. That is, it should not be possible to generate by combining two other vectors that satisfy the first and second requirements using the same set of enzymes that appear as non-zero entries in . In other words, it should not be possible to decompose into two other pathways that can themselves sustain a steady state. This is called elementarity. A more formal test is that the null space of the subm |
https://en.wikipedia.org/wiki/Hugging%20Face | Hugging Face, Inc. is a French-American company and open-source community that develops tools and resources to build, deploy, and train machine learning models. Based in New York City, the company is most notable for its Transformers library built for natural language processing and emphasis on community collaboration and accessibility. Its platform allows users to share machine learning models and datasets and showcase their work.
History
The company was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf in New York City, originally as a company that developed a chatbot app targeted at teenagers. After open-sourcing the model behind the chatbot, the company pivoted to focus on being a platform for machine learning.
In March 2021, Hugging Face raised US$40 million in a Series B funding round.
On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM, a multilingual large language model with 176 billion parameters.
On December 21, 2021, the company announced its acquisition of Gradio, a software library used to make interactive browser demos of machine learning models.
On May 5, 2022, the company announced its Series C funding round led by Coatue and Sequoia. The company received a $2 billion valuation.
On May 13, 2022, the company introduced its Student Ambassador Program to help fulfill its mission to teach machine learning to 5 million people by 2023.
On May 26, 2022, the company announced a partnership with Graphcore to optimize its Transformers library for the Graphcore IPU.
On August 3, 2022, the company announced the Private Hub, an enterprise version of its public Hugging Face Hub that supports SaaS or on-premises deployment.
In February 2023, the company announced partnership with Amazon Web Services (AWS) which would allow Hugging Face's |
https://en.wikipedia.org/wiki/Plasticolous%20lichen | A plasticolous lichenized fungi is a lichen which grows on plastic surfaces. This behaviour was first observed in 1994 when foliicolous lichens were found growing on plastic tape but they have since been observed growing on artificial plastic leaves, plastic signs and nylon nets.
References
Lichenology |
https://en.wikipedia.org/wiki/Black%20hole%20stability%20conjecture | The black hole stability conjecture is the conjecture that a perturbed Kerr black hole will settled back down to a stable state. This has been an open problem in general relativity for some time.
A 2016 paper proved the stability of slowly rotating Kerr black holes in de Sitter space.
A limited stability result for Kerr black holes in Schwarzschild space-time was published by Klainerman et. al. in 2017.
Culminating in 2022, a series of papers was published by Klainerman et. al. which present a proof of the conjecture for slowly rotating Kerr black holes in Minkowski space-time.
See also
Final state conjecture
References
Black holes
General relativity
Conjectures that have been proved |
https://en.wikipedia.org/wiki/Aurora%20OS%20%28Russian%20Open%20mobile%20platform%29 | Aurora OS or Russian Open mobile platform (OMP) is a Russian Linux-based smartphone operating system derived from Sailfish OS. Aurora OS is owned by Rostelecom and is developed for business and governmental use. The operating system was branched from Sailfish OS into its own version in 2019. As a difference from the Sailfish platform, the operating system has its own application store and it is integrated with the Russian government's official radio network ERA.
History
In 2016, Jolla started a development project whose goal was to localize the Sailfish platform in Russia. For this, its own company was founded and the Russian-language version was called Sailfish Mobile OS RUS. The first users of the platform were the Russian Post. In 2018, the Russian state applied for a secure mobile phone operating system for official use. Sailfish Mobile OS RUS was chosen and Rostelecom was the company that developed it. In 2019, the platform was renamed Aurora OS. In 2021, Jolla announced that they had left the project and was no longer developing it. In November 2021, according to Nokiamob.net, there would be around 400,000 devices using it.
However, in 2022 Vedomosti reported that sales of the latest model Scale Trustphone T1 to consumers were minimal. Also, because of sanctions set by the 2022 Russian invasion of Ukraine, the ability to produce the hardware needed for the newer models is limited. Development of Trustphone T2 with domestic ARM processor Scythian by SPC Elvis was halted because sanctions and overheating problems.
Devices
Known devices using Aurora OS are
Tablets
Aquarius Cmp NS208
Aquarius CMP NS220
Aquarius CMP NS220 v5.2
BytErg МВК-2020
F+ Life Tab Plus
INOI T8 Tablet (discontinued)
Phones
Qtech QMP-M1-N
Qtech QMP-M1-N IP68
MIG С55 (discontinued)
INOI 5i pro
INOI R7 (discontinued)
Blackview bs6000s (discontinued)
F+ R570
Scale Trustphone T1 / AYYA T1
Aquarius NS M11
References
External links
Tadadviser, Rostelecom has integrated d |
https://en.wikipedia.org/wiki/Free%20ad-supported%20streaming%20television | Free ad-supported streaming television (FAST) is a category of streaming television services, akin to linear or cable TV, represented by platforms such as Pluto TV and Samsung TV Plus. These services offer traditional television programming and studio-produced movies without a paid subscription, funded exclusively by advertising. They stand apart from platforms predominantly featuring user-generated content like YouTube and Twitch, as well as from subscription-based ad-supported services like Hulu and Netflix.
FAST services have both linear channels (sometimes referred to as "FAST channels") and video on demand content. The earliest documented use of the term was in a December 2018 article by media analyst Alan Wolk about Pluto TV. Wolk came up with the term as a way to differentiate between subscription ad-supported streaming TV services like Hulu and free ad-supported linear streaming TV services like Pluto TV.
Platforms
The FAST ecosystem has several layers. The best-known FASTs are the aggregators, which fall into three categories.
FASTs owned by major media companies: Paramount's Pluto TV, Fox's Tubi, Charter Communications and Comcast's Xumo, Dish Network's Sling Freestream, and ITV’s ITVX service.
FASTs owned by device manufacturers: Amazon Freevee (previously IMDb TV), The Roku Channel, Samsung TV Plus, LG Channels, Vizio WatchFree+, and TCL Electronics' TCL Channel.
Independent FASTs: Plex, Chicken Soup for the Soul Entertainment’s Crackle, Mometu, Herogo TV, and Flixhouse.
These aggregators operate primarily in the United States as of 2022, though some, like Pluto TV, Plex, and Samsung TV Plus operate in additional countries or worldwide.
In addition to aggregator apps, there are FASTs run by a single provider such as E.W. Scripps' Scripps News, PocketWatch and FilmRise that also provide their content for use in linear channels on the aggregator apps.
Content and channels
Content on FAST services can potentially cover all television genres as w |
https://en.wikipedia.org/wiki/Reverse-search%20algorithm | Reverse-search algorithms are a class of algorithms for generating all objects of a given size, from certain classes of combinatorial objects. In many cases, these methods allow the objects to be generated in polynomial time per object, using only enough memory to store a constant number of objects (polynomial space). (Generally, however, they are not classed as polynomial-time algorithms, because the number of objects they generate is exponential.) They work by organizing the objects to be generated into a spanning tree of their state space, and then performing a depth-first search of this tree.
Reverse-search algorithms were introduced by David Avis and Komei Fukuda in 1991, for problems of generating the vertices of convex polytopes and the cells of arrangements of hyperplanes. They were formalized more broadly by Avis and Fukuda in 1996.
Principles
A reverse-search algorithm generates the combinatorial objects in a state space, an implicit graph whose vertices are the objects to be listed and whose edges represent certain "local moves" connecting pairs of objects, typically by making small changes to their structure. It finds each objects using a depth-first search in a rooted spanning tree of this state space, described by the following information:
The root of the spanning tree, one of the objects
A subroutine for generating the parent of each object in the tree, with the property that if repeated enough times it will eventually reach the root
A subroutine for listing all of the neighbors in the state space (not all of which may be neighbors in the tree)
From this information it is possible to find the children of any given node in the tree, reversing the links given by the parent subroutine: they are simply the neighbors whose parent is the given node. It is these reversed links to child nodes that the algorithm searches.
A classical depth-first search of this spanning tree would traverse the tree recursively, starting from the root, at each node listing |
https://en.wikipedia.org/wiki/Gordon%20S.%20Kino | Gordon Stanley Kino (June 15, 1928, Melbourne, Australia – October 9, 2017, Stanford, California) was an Australian-British-American inventor and professor of electrical engineering and applied physics. He is known for "inventing new microscopes that improved semiconductor manufacturing and transformed medical diagnostics." His dual-axis confocal microscope has several advantages over the single-axis confocal microscope.
Biography
Born in Australia, Kino grew up in London. At the University of London he graduated with a B.Sc. in 1952 and an M.Sc. in mathematics in 1954. At Stanford University he graduated in 1955 with a Ph.D. in electrical engineering. His dissertation Perturbation theory of transmission systems was supervised by Marvin Chodorow. In October 1955 in San Francisco, Gordon Kino married Dorothy Beryl Lovelace, who was a former Londoner that he met in California. Their daughter, Carol Ann Kino, was born in December 1956. From 1956 to 1957 he worked at Bell Labs in Murray Hill, New Jersey. At Stanford University he held a research position from 1957 to 1961, joined the faculty of the department of electrical engineering in 1961, and was promoted to full professor in 1965, officially retiring as professor emeritus in 1997. He became in 1967 a naturalized U.S. citizen and for the academic year 1967–1968 held a Guggenheim fellowship.
Kino is credited with at least 119 U.S. patents. He did research on "microwave triodes, traveling wave tubes, klystrons, microwave tubes, magnetrons, electron guns, wave propagation in plasmas, solid-state oscillators and amplifiers, microwave acoustics, and acoustic imaging devices for medical instrumentation and nondestructive testing." His research helped in the 1990s to greatly improve data storage. At Stanford he was one the pioneers of interdisciplinary research and development for technological innovation. Along with Calvin Quate and Herbert John Shaw, he was one of the most important members of Stanford's Ginzton Labor |
https://en.wikipedia.org/wiki/NLTS%20conjecture | In quantum information theory, the no low-energy trivial state (NLTS) conjecture is a precursor to a quantum PCP theorem (qPCP) and posits the existence of families of Hamiltonians with all low-energy states of non-trivial complexity. An NLTS proof would be a consequence of one aspect of qPCP problems the inability to certify an approximation of local Hamiltonians via NP completeness. In other words, an NLTS proof would be one consequence of the QMA complexity of qPCP problems. On a high level, if proved, NLTS would be one property of the non-Newtonian complexity of quantum computation. NLTS and qPCP conjectures posit the near-infinite complexity involved in predicting the outcome of quantum systems with many interacting states. These calculations of complexity would have implications for quantum computing such as the stability of entangled states at higher temperatures, and the occurrence of entanglement in natural systems. There is currently a proof of NLTS conjecture published in preprint.
NLTS property
The NLTS property is the underlying set of constraints that forms the basis for the NLTS conjecture.
Definitions
Local hamiltonians
A k-local Hamiltonian (quantum mechanics) is a Hermitian matrix acting on n qubits which can be represented as the sum of Hamiltonian terms acting upon at most qubits each:
The general k-local Hamiltonian problem is, given a k-local Hamiltonian , to find the smallest eigenvalue of . is also called the ground-state energy of the Hamiltonian.
The family of local Hamiltonians thus arises out of the k-local problem. Kliesch states the following as a definition for local Hamiltonians in the context of NLTS:
Let I ⊂ N be an index set. A family of local Hamiltonians is a set of Hamiltonians {H(n)}, n ∈ I, where each H(n) is defined on n finite-dimensional subsystems (in the following taken to be qubits), that are of the form
where each Hm(n) acts non-trivially on O(1) qubits. Another constraint is the operator norm of Hm(n) |
https://en.wikipedia.org/wiki/Convergence%20proof%20techniques | Convergence proof techniques are canonical components of mathematical proofs that sequences or functions converge to a finite limit when the argument tends to infinity.
There are many types of series and modes of convergence requiring different techniques. Below are some of the more common examples. This article is intended as an introduction aimed to help practitioners explore appropriate techniques. The links below give details of necessary conditions and generalizations to more abstract settings. The convergence of series is already covered in the article on convergence tests.
Convergence in Rn
It is common to want to prove convergence of a sequence or function , where and refer to the natural numbers and the real numbers, and convergence is with respect to the Euclidean norm, .
Useful approaches for this are as follows.
First principles
The analytic definition of convergence of to a limit is that for all there exists a such for all , . The most basic proof technique is to find such a and prove the required inequality. If the value of is not known in advance, the techniques below may be useful.
Contraction mappings
In many cases, the function whose convergence is of interest has the form for some transformation . For example, could map to for some conformable matrix . Alternatively, may be an element-wise operation, such as replacing each element of by the square root of its magnitude.
In such cases, if the problem satisfies the conditions of Banach fixed-point theorem (the domain is a non-empty complete metric space) then it is sufficient to prove that for some constant which is fixed for all and . Such a is called a contraction mapping.
Example
Famous example of the use of this approach include
If has the form for some matrices and , then convergence to occurs if the magnitudes of all eigenvalues of are less than 1.
Convergent subsequences
Every bounded sequence in has a convergent subsequence, by the Bolzano–Weierstra |
https://en.wikipedia.org/wiki/Faltings%27%20annihilator%20theorem | In abstract algebra (specifically commutative ring theory), Faltings' annihilator theorem states: given a finitely generated module M over a Noetherian commutative ring A and ideals I, J, the following are equivalent:
for any ,
there is an ideal in A such that and annihilates the local cohomologies ,
provided either A has a dualizing complex or is a quotient of a regular ring.
The theorem was first proved by Faltings in .
References
Abstract algebra
Commutative algebra |
https://en.wikipedia.org/wiki/Wang%20algebra | In algebra and network theory, a Wang algebra is a commutative algebra , over a field or (more generally) a commutative unital ring, in which has two additional properties:(Rule i) For all elements x of , x + x = 0 (universal additive nilpotency of degree 1).(Rule ii) For all elements x of , xx = 0 (universal multiplicative nilpotency of degree 1).
History and applications
Rules (i) and (ii) were originally published by K. T. Wang (Wang Ki-Tung, 王 季同) in 1934 as part of a method for analyzing electrical networks. From 1935 to 1940, several Chinese electrical engineering researchers published papers on the method. The original Wang algebra is the Grassman algebra over the finite field mod 2. At the 57th annual meeting of the American Mathematical Society, held on December 27–29, 1950, Raoul Bott and Richard Duffin introduced the concept of a Wang algebra in their abstract (number 144t) The Wang algebra of networks. They gave an interpretation of the Wang algebra as a particular type of Grassman algebra mod 2. In 1969 Wai-Kai Chen used the Wang algebra formulation to give a unification of several different techniques for generating the trees of a graph. The Wang algebra formulation has been used to systematically generate King-Altman directed graph patterns. Such patterns are useful in deriving rate equations in the theory of enzyme kinetics.
According to Guo Jinhai, professor in the Institute for the History of Natural Sciences of the Chinese Academy of Sciences, Wang Ki Tung's pioneering method of analyzing electrical networks significantly promoted electrical engineering not only in China but in the rest of the world; the Wang algebra formulation is useful in electrical networks for solving problems involving topological methods, graph theory, and Hamiltonian cycles.
Wang Algebra and the Spanning Trees of a Graph
The Wang Rules for Finding all Spanning Trees of a Graph G
For each node write the sum of all the edge-labels that meet that node.
Leave out one node |
https://en.wikipedia.org/wiki/Deep%20Space%20Transport%20LLC | Deep Space Transport LLC is a joint venture that is set to provide launch services for the Space Launch System rocket. The joint venture consists of Boeing, the prime contractor for the Space Launch System core stage and the Exploration Upper Stage that will be used on Space Launch System missions, and Northrop Grumman, the prime contractor for the Space Launch System's solid rocket boosters.
Deep Space Transport LLC would be responsible for producing hardware and services for up to 10 Artemis launches beginning with the Artemis 5 mission, and up to 10 launches for other NASA missions. NASA expects to procure at least one flight per year to the Moon or other deep-space destinations. NASA is expected to issue an award by Dec. 31, 2023.
See also
United Space Alliance, a similar entity for streamlining Space Shuttle contracts (partnership between Rockwell International and Lockheed Martin)
United Launch Alliance, a similar entity for streamlining 21st-century United States Department of Defense launch contracts (partnership between Boeing and Lockheed Martin)
References
Space
Space missions
Space Shuttle program
NASA programs
Boeing |
https://en.wikipedia.org/wiki/Laakso%20space | In mathematical analysis and metric geometry, Laakso spaces are a class of metric spaces which are fractal, in the sense that they have non-integer Hausdorff dimension, but that admit a notion of differential calculus. They are constructed as quotient spaces of where K is a Cantor set.
Background
Cheeger defined a notion of differentiability for real-valued functions on metric measure spaces which are doubling and satisfy a Poincaré inequality, generalizing the usual notion on Euclidean space and Riemannian manifolds. Spaces that satisfy these conditions include Carnot groups and other sub-Riemannian manifolds, but not classic fractals such as the Koch snowflake or the Sierpiński gasket. The question therefore arose whether spaces of fractional Hausdorff dimension can satisfy a Poincaré inequality. Bourdon and Pajot were the first to construct such spaces. Tomi J. Laakso gave a different construction which gave spaces with Hausdorff dimension any real number greater than 1. These examples are now known as Laakso spaces.
Construction
We describe a space with Hausdorff dimension . (For integer dimensions, Euclidean spaces satisfy the desired condition, and for any Hausdorff dimension in the interval , where is an integer, we can take the space .) Let be such that
Then define K to be the Cantor set obtained by cutting out the middle portion of an interval and iterating that construction. In other words, K can be defined as the subset of containing 0 and 1 and satisfying
The space will be a quotient of , where I is the unit interval and is given the metric induced from .
To save on notation, we now assume that , so that K is the usual middle thirds Cantor set. The general construction is similar but more complicated. Recall that the middle thirds Cantor set consists of all points in whose ternary expansion consists of only 0's and 2's. Given a string of 0's and 2's, let be the subset of points of K consisting of points whose ternary expa |
https://en.wikipedia.org/wiki/LARIAT | The Lincoln Adaptable Real-time Information Assurance Testbed (LARIAT) is a physical computing platform developed by the MIT Lincoln Laboratory as a testbed for network security applications. Use of the platform is restricted to the United States military, though some academic organizations can also use the platform under certain conditions.
LARIAT was designed to help with the development and testing of intrusion detection (ID) and information assurance (IA) technologies. Initially created in 2002, LARIAT was the first simulated platform for ID testing and was created to improve upon a preexisting non-simulated testbed that was created for DARPA's 1998 and 1999 ID analyses. LARIAT is used by the United States military for training purposes and automated systems testing.
Function
The platform simulates users and reflects vulnerabilities caused by design flaws and user interactions and allows for interaction with real-world programs such as web browsers and office suites while simulating realistic user activity on these applications. These virtual users are managed by Markov models which allow them to act differently from each other in a realistic way.
This results in a realistic simulation of an active network of users that can then be targeted for malicious attacks to test the effectiveness of the attacks against network defenses, while also testing the effectiveness of intrusion detection methods and software in a simulated real-world environment with actual users in amongst the malicious traffic on the network. This is done because network intrusion detection software cannot as easily find instances of malicious network traffic when it is mixed in with non-malicious network traffic generated by legitimate users of the network.
The traffic generators used by the testbed run on a modified version of Linux, and a Java-based graphical user interface called Director is provided to allow users of the platform to configure and control testing parameters and to monit |
https://en.wikipedia.org/wiki/Path%20space%20%28algebraic%20topology%29 | In algebraic topology, a branch of mathematics, the path space of a based space is the space that consists of all maps from the interval to X such that , called paths. In other words, it is the mapping space from to .
The space of all maps from to X (free paths or just paths) is called the free path space of X. The path space can then be viewed as the pullback of along .
The natural map is a fibration called the path space fibration.
References
Further reading
https://ncatlab.org/nlab/show/path+space
Algebraic topology |
https://en.wikipedia.org/wiki/Category%20of%20compactly%20generated%20weak%20Hausdorff%20spaces | In mathematics, the category of compactly generated weak Hausdorff spaces CGWH is one of typically used categories in algebraic topology as a substitute for the category of topological spaces, as the latter lacks some of the pleasant properties one would desire. There is also such a category for based spaces, defined by requiring maps to preserve the base points.
The articles compactly generated space and weak Hausdorff space define the respective topological properties. For the historical motivation behind these conditions on spaces, see Compactly generated space#Motivation. This article focuses on the properties of the category.
Properties
CGWH has the following properties:
It is complete and cocomplete.
The forgetful functor to the sets preserves small limits.
It contains all the locally compact Hausdorff spaces and all the CW complexes.
The internal Hom exists for any pairs of spaces X, Y; it is denoted by or and is called the (free) mapping space from X to Y. Moreover, there is a homeomorphism
that is natural in X, Y, Z. In short, the category is Cartesian closed in an enriched sense.
A finite product of CW complexes is a CW complex.
If X, Y are based spaces, then the smash product of them exists. The (based) mapping space from X to Y consists of all base-point-preserving maps from X to Y and is a closed subspace of the mapping space between the underlying unbased spaces. It is a based space with the base point the unique constant map. For based spaces X, Y, Z, there is a homeomorphism
that is natural in X, Y, Z.
Notes
References
Further reading
The CGWH category, Dongryul Kim 2017
Algebraic topology
Categories in category theory |
https://en.wikipedia.org/wiki/Approximate%20fibration | In algebraic topology, a branch of mathematics, an approximate fibration is a sort of fibration such that the homotopy lifting property holds only approximately. The notion was introduced by Coram and Duvall in 1977.
A manifold approximate fibration is a proper approximate fibration between manifolds. Some authors believe that manifold approximate fibrations are the "correct bundle theory for topological manifolds and singular spaces".
References
Further reading
nLab - approximate fibration
Algebraic topology |
https://en.wikipedia.org/wiki/Ant%20supercolony | An ant supercolony is an exceptionally large ant colony, consisting of a high number of spatially separated but socially connected nests of a single ant species (meaning that the colony is polydomous), spread over a large area without territorial borders. Supercolonies are typically polygynous, containing many egg-laying females (queens or gynes). Workers and queens from different nests within the same supercolony can freely move among the nests, and all workers cooperate indiscriminately with each other in collecting food and care of the brood, and show no apparent mutual aggressive behavior.
As long as suitable unoccupied space with sufficient resources is available, supercolonies expand continuously through budding, as queens together with some workers migrate over short distances and establish a new connected nest. The supercolony can also expand over long distances through jump-dispersal, potentially ranging between continents. Jump-dispersal usually occurs unintentionally through human-mediated transport. A striking example of an ant species forming supercolonies across continents is the Argentine ant (Linepithema humile). The also highly invasive red imported fire ant (Solenopsis invicta) and Solenopsis geminata additionally use classic mating flights, thus using three primary modes of dispersal. Out of some 14,000 described ant species, supercolonialism is found in less than 1% of all ants.
In general, ants that form supercolonies are invasive and harmful in the non-native environments. While not all supercolonial species are invasive and not all invasive ants are dominant, supercolonies are usually associated with invasive populations. Some invasive species are known to form supercolonies in their native habitat as well. In their native range, relatively small supercolonies are observed, whereas they are much larger, dominant and a threat for ecological diversity in their invasive range. Exceptions of species that form supercolonies without being invasive |
https://en.wikipedia.org/wiki/Metric%20lattice | In the mathematical study of order, a metric lattice is a lattice that admits a positive valuation: a function satisfying, for any , and
Relation to other notions
A Boolean algebra is a metric lattice; any finitely-additive measure on its Stone dual gives a valuation.
Every metric lattice is a modular lattice, c.f. lower picture. It is also a metric space, with distance function given by With that metric, the join and meet are uniformly continuous contractions, and so extend to the metric completion (metric space). That lattice is usually not the Dedekind-MacNeille completion, but it is conditionally complete.
Applications
In the study of fuzzy logic and interval arithmetic, the space of uniform distributions is a metric lattice. Metric lattices are also key to von Neumann's construction of the continuous projective geometry. A function satisfies the one-dimensional wave equation if and only if it is a valuation for the lattice of spacetime coordinates with the natural partial order. A similar result should apply to any partial differential equation solvable by the method of characteristics, but key features of the theory are lacking.
References
Lattice theory
Metric spaces |
https://en.wikipedia.org/wiki/ISO%2025119 | ISO 25119, titled "Tractors and machinery for agriculture and forestry – Safety-related parts of control systems", is an international standard for functional safety of electrical and/or electronic systems that are installed in tractors and machines used in agriculture and forestry, defined by the International Organization for Standardization (ISO).
Parts of ISO 25119
ISO 25119 consists of following parts:
General principles for design and development
Concept phase
Series development, hardware and software
Production, operation, modification and supporting processes
See also
IEC 61508
References
25119
Safety engineering |
https://en.wikipedia.org/wiki/ZOBODAT | ZOBODAT is an online catalogue of taxonomic, bibliographic, author and specimen data, from mainly German language sources. The database is published by and was founded in 1972 by . At August 16, 2022, it contained 3,476,485 occurrence records, 1,089 journal records (together with their contents), 25,379 authors (including their publications, and specimens collected and determined), and information on 62,977 species.
The reader may access the information in German, French, English, Spanish, Portuguese or Hungarian.
References
External links
Biological databases
Taxonomy (biology) |
https://en.wikipedia.org/wiki/Selenosulfide | In chemistry, a selenosulfide refers to distinct classes of inorganic and organic compounds containing sulfur and selenium. The organic derivatives contain Se-S bonds, whereas the inorganic derivatives are more variable.
Organic selenosulfides
These species are classified as both organosulfur and organoselenium compounds. They are hybrids of organic disulfides and organic diselenides.
Preparation, structure, and reactivity
Selenosulfides have been prepared by the reaction of selenyl halides with thiols:
The equilibrium between diselenides and disulfides lies on the left:
RSeSeR + R'SSR' 2 RSeSR'
Because of the facility of this equilibrium, many of the best characterized examples of selenosulfides are cyclic, whereby S-Se bonds are stabilized intramolecularly. One example is the 1,8-selenosulfide of naphthalene. The selenium-sulfur bond length is about 220 picometers, the average of a typical S-S and Se-Se bond.
Occurrence
Selenosulfide groups can be found in almost all living organisms as part of various peroxidase enzymes, such as glutathione peroxidase and thioredoxin reductase. They are formed by the oxidative coupling of selenocysteine and cysteine residues. This reaction is powered by the decomposition of cellular peroxides, which can be highly damaging and a source of oxidative stress. Selenocysteine has a lower reduction potential than cysteine, making it very suitable for proteins that are involved in antioxidant activity.
Selenosulfides have been identified in some species of Allium and in roasted coffee. The mammalian version of the protein thioredoxin reductase contains a selenocysteine residue which forms a thioselenide (analogous to a disulfide) upon oxidation.
Inorganic selenosulfides
Some inorganic selenide sulfide compounds are also known. Simplest is the material selenium sulfide, which has medicinal properties. It adopt the diverse structures of elemental sulfur but with some S atoms replaced by Se.
Other inorganic selenide sulfid |
https://en.wikipedia.org/wiki/FN%20Meka | FN Meka is a fictional rapper/avatar originally developed by Brandon Le in 2019 as part of the company Factory New, with Anthony Martini joining the project in early 2020 as co-founder. Self-described as a "virtual rapper", the project had claimed that the music and lyrics were generated by an AI using thousands of data points compiled from video games and social media. Later, this was called into question when Houston, Texas-based rapper Kyle the Hooligan claimed to be the anonymous human voice behind FN Meka. It is currently the most prominent virtual rapper, with over 10 million followers and over a billion views on TikTok.
FN Meka garnered media coverage when it was signed to Capitol Records on August 14, 2022, becoming the first "AI-generated rapper" to be signed to a major label. However, due to controversy over its stereotyping of black people, Capitol dropped FN Meka from its label ten days later on August 23, 2022.
Characterization
FN Meka's avatar appears as a Black male cyborg. Factory New claimed that all of FN Meka's character and music, except his voice, was solely based on artificial intelligence (AI). The AI, according to Martini, analysed popular songs and video games and then generated recommendations for its lyrical content, chords, melody, tempo and sounds. The proprietary technology supposedly used in FN Meka's song development was provided by the music company Vydia. However, Martini later walked back on these statements, saying that he made these claims to "create intrigue and provide cover for songs at the time which weren’t ready for scrutiny." FN Meka also has the ability to sell virtual items and non-fungible tokens (NFTs). In March 2021, FN Meka (in collaboration with RTFKT) sold a NFT of a "Lamborghini porta-potty" for $6,432 on SuperRare.
History
Development
FN Meka was designed in 2019 by Brandon Le, originally to sell non-fungible tokens. After his daughter showed him FN Meka on Instagram, American business executive Anthony Mar |
https://en.wikipedia.org/wiki/First%20Things%20First%20%28talk%20show%29 | First Things First is an American sports and entertainment talk show starring Nick Wright, Chris Broussard, and Kevin Wildes. Originally titled First Things First with Cris Carter and Nick Wright, the series premiered on Fox Sports 1 on September 5, 2017. The show is also released as a podcast and radio simulcast.
Development
FS1 hired former NFL wide receiver Cris Carter and local sports radio host Nick Wright to co-host First Things First. Shortly after, former Today correspondent Jenna Wolfe was brought on to join Carter and Wright on the show.
History
The show premiered on September 5, 2017, and featured Carter and Wright debating sports topics, with Wolfe serving as co-host and moderator. Carter last appeared on the show on October 30, 2019. While some sports media outlets reported that Carter and network executives disagreed over him being left off Fox Sport's Thursday Night Football pregame broadcast, neither Carter nor Fox Sports gave a reasoning for his departure. A spokesperson for the network only commented that Carter "is no longer with Fox Sports," without further elaboration. Former NFL defensive lineman Chris Canty briefly filled-in for Carter.
Following Carter's departure from the show, Fox Sports looked to pivot First Things First into a "second iteration" that would feature "a loose, free-flowing, conversational format and add a still-to-be-determined fourth talent to the set," in addition to Carter's permanent replacement. In February 2020, television producer and development executive Kevin Wildes was announced to join Wright and Wolfe on the show. In August 2020, former NFL wide receiver Brandon Marshall was announced as the fourth on-air personality as First Things First fully shifted to a panel format.
Marshall's tenure on the show lasted until August 2021. Later that month, sports media journalist and reporter Chris Broussard, who made frequent appearances as an NBA analyst on the show, was named as an official host on the show. Wolfe mad |
https://en.wikipedia.org/wiki/PrivadoVPN | PrivadoVPN is a VPN service provider with applications for Windows, macOS, Android, iOS, AndroidTV and Amazon Fire TV along with custom configuration support for routers and Linux. PrivadoVPN is based in Switzerland and operates under Swiss privacy laws.
Overview
PrivadoVPN has server locations at 60 cities in 47 countries. It has 256-bit-AES encryption, streaming support for all users, kill switch, zero-log guarantee, unlimited speed, SOCKS5 proxy, split tunneling, and 10 simultaneous connections. The VPN offers both free and paid tiers, with users paying to unlock all features.
Reception
In 2021, Paul McNally of PCguide.com wrote: “The Privado[VPN] app has been made deliberately easy to get around and is all the better for that. It’s quite simple to turn it on and never, ever think about it again which is great, and also quite a relief that you can just turn on ‘internet safety’ and forget about it.”
PrivadoVPN was ranked as the #1 free VPN by Security.org and as one of the top 5 VPNs available in 2022 by TechRadar, Tech Advisor, PCMag, Netzwelt, Macworld, and Digital Trends.
The app was praised by Tom’s Guide, as they gave PrivadoVPN “full marks across the board,” stating that the VPN offers “an impressive showing for a near-brand new service just beginning to get a foothold in the industry.”
In a review on PCMag, PrivadoVPN was credited with having a generous free plan and affordable paid plans, but that it lacked additional security features and had not yet conducted a third-party audit.
See also
Comparison of virtual private network services
Encryption
Internet privacy
Secure communication
Virtual private network
References
External links
Virtual private network services
Information technology companies of Switzerland |
https://en.wikipedia.org/wiki/PayNow | PayNow is a near-instant real-time payment system developed by Association of Banks in Singapore. The interface facilitates inter-bank peer-to-peer and person-to-merchant transactions. The system is supported by all major Singaporean banks and is regulated by the Monetary Authority of Singapore (MAS) and works by transferring funds between two bank accounts.
Payments can be made to any registered Singaporean mobile number, NRIC, corporate Unique Entity Number (UEN) or Virtual Payment Address (VPA). Scanning QR codes is also an option. PayNow is linked with other payment providers including Stripe, DuitNow (Malaysia), PromptPay (Thailand) and UPI (India).
In 2020, 125 million transactions worth S$22 billion were processed through PayNow.
References
2017 establishments in Singapore
Payment interchange standards
Interbank networks
Banking in Singapore
Mobile payments
Mobile payments in Singapore |
https://en.wikipedia.org/wiki/Bretagnolle%E2%80%93Huber%20inequality | In information theory, the Bretagnolle–Huber inequality bounds the total variation distance between two probability distributions and by a concave and bounded function of the Kullback–Leibler divergence . The bound can be viewed as an alternative to the well-known Pinsker's inequality: when is large (larger than 2 for instance.), Pinsker's inequality is vacuous, while Bretagnolle–Huber remains bounded and hence non-vacuous. It is used in statistics and machine learning to prove information-theoretic lower bounds relying on hypothesis testing
Formal statement
Preliminary definitions
Let and be two probability distributions on a measurable space .
Recall that the total variation between and is defined by
The Kullback-Leibler divergence is defined as follows:
In the above, the notation stands for absolute continuity of with respect to , and stands for the Radon–Nikodym derivative of with respect to .
General statement
The Bretagnolle–Huber inequality says:
Alternative version
The following version is directly implied by the bound above but some authors prefer stating it this way.
Let be any event. Then
where is the complement of .
Indeed, by definition of the total variation, for any ,
Rearranging, we obtain the claimed lower bound on .
Proof
We prove the main statement following the ideas in Tsybakov's book (Lemma 2.6, page 89), which differ from the original proof (see C.Canonne's note for a modernized retranscription of their argument).
The proof is in two steps:
1. Prove using Cauchy–Schwarz that the total variation is related to the Bhattacharyya coefficient (right-hand side of the inequality):
2. Prove by a clever application of Jensen’s inequality that
Step 1:
First notice that
To see this, denote and without loss of generality, assume that such that . Then we can rewrite
And then adding and removing we obtain both identities.
Then
because
Step 2:
We write and apply Jensen's inequal |
https://en.wikipedia.org/wiki/Buford%20Dam | Buford Dam is a dam in Buford, Georgia which is located at the southern end of Lake Lanier, a reservoir formed by the construction of the dam in 1956. The dam itself is managed by the United States Army Corps of Engineers.
The dam is made of earth and concrete, supplemented by three saddle dikes, and was built to provide a water source for the Atlanta area, power homes, and prevent flooding of the Chattahoochee River.
Electricity from the dam is marketed by the Southeastern Power Administration.
Construction
Congress authorized construction of the dam in 1946, and in 1949 the federal government gave the State of Georgia $750,000 (equivalent to $ in ) towards the building of the dam and accompanying powerhouse.
On March 1, 1950, a groundbreaking ceremony was held, which included dignitaries such as Atlanta mayor William B. Hartsfield. The United States Army Corps of Engineers oversaw the construction of the dam.
During construction, land was bought in the area that would become the reservoir. Homes, churches, graveyards, and all other structures that would float were removed or burned. Many residents in the reservoir area fought the buying of their homes with unsuccessful civil lawsuits.
The powerhouse required crews to use dynamite to blast a U-shaped space through granite rock structures to hollow out an area for the powerhouse and release gates. During the construction of the dam, Johnnie Callahan died during a rockslide when cutting an intake tunnel into the face of the granite rock wall.
On February 1, 1956, the dam was completed when the sluice gates were closed and Lake Lanier began to fill. Unit 2 began operation on June 20, 1957, Unit 3 on July 26, 1957, and Unit 1 on October 10, 1957. The dam was dedicated on October 9, 1957. The power plant went into full-scale operation in July 1958, and the lake reached its intended level on August 1 of that year.
Operation
When water is released from the dam's turbines, several sirens sound as well as an AM war |
https://en.wikipedia.org/wiki/Camo%20%28app%29 | Camo is a freemium webcam app by British software company Reincubate allowing phones and other mobile devices to be used as webcams and document cameras.
The app runs on macOS and Microsoft Windows and is compatible with iOS and Android phones.
The app comes in a free and Pro version. The free version uses the mobile device's main camera, while the Pro version gives accesses to all cameras.
Using Camo requires downloading an app to the mobile device and a counterpart app, Camo Studio.
References
External links
Webcams
Video recording software
Livestreaming software
Streaming software
Cross-platform software
Freemium
Proprietary cross-platform software
Windows multimedia software
MacOS multimedia software
Windows software
MacOS software
IOS software |
https://en.wikipedia.org/wiki/PHY-Level%20Collision%20Avoidance | PHY-Level Collision Avoidance (PLCA) is a component of the Ethernet reconciliation sublayer (between the PHY and the MAC) defined within IEEE 802.3 clause 148. The purpose of PLCA is to avoid the shared medium collisions and associated retransmission overhead. PLCA is used in 802.3cg (10BASE-T1), which focuses on bringing ethernet connectivity to short-haul embedded internet of things and low throughput, noise-tolerant, industrial deployment use cases.
In order for a multidrop 10BASE-T1S standard to successfully compete with CAN XL, some kind of arbitration was necessary. The linear arbitration scheme of PLCA somewhat resembles the one of the Byteflight, but PLCA was designed from scratch to accommodate the existing shared medium Ethernet MACs with their busy sensing mechanisms.
Operation
Under a PLCA scheme all nodes are assigned unique sequential numbers (IDs) in the range from 0 to N. Zero ID corresponds to a special "master" node that during the idle intervals transmits the synchronization beacon (a special heartbeat frame). After the beacon (within PLCA cycle) each node gets its transmission opportunity (TO). Each opportunity interval is very short (typically 20 bits), so overhead for the nodes that do not have anything to transmit is low. If the PLCA circuitry discovers that the node's TO cannot be used (the other node with a lower ID have started its transmission and the media is busy at the beginning of the TO for this node), it asserts the "local collision" input of the MAC thus delaying the transmission. The condition is cleared once the node gets its TO. A standard MAC reacts to the local collision with a backoff, however, since this is the first and only backoff for this frame, the backoff interval is equal to the smallest possible frame - and the backoff timer will definitely expire by the time the TO is granted, so there is no additional loss of performance.
See also
Internet of things (IOT)
References
Sources
Ethernet
Computer networking
A |
https://en.wikipedia.org/wiki/Socolar%20tiling | A Socolar tiling is an example of an aperiodic tiling, developed in 1989 by Joshua Socolar in the exploration of quasicrystals. There are 3 tiles a 30° rhombus, square, and regular hexagon. The 12-fold symmetry set exist similar to the 10-fold Penrose rhombic tilings, and 8-fold Ammann–Beenker tilings.
The 12-fold tiles easily tile periodically, so special rules are defined to limit their connections and force nonperiodic tilings. The rhombus and square are disallowed from touching another of itself, while the hexagon can connect to both tiles as well as itself, but only in alternate edges.
Dodecagonal rhomb tiling
The dodecagonal rhomb tiling include three tiles, a 30° rhombus, a 60° rhombus, and a square. And expanded set can also include an equilateral triangle, half of the 60° rhombus.60° rhombus.
See also
Pattern block - 6 tiles based on 12-fold symmetry, including the 3 Socolar tiles
Socolar–Taylor tile - A different tiling named after Socolar
References
Aperiodic tilings |
https://en.wikipedia.org/wiki/DoITPoMS | Dissemination of IT for the Promotion of Materials Science (DoITPoMS) is a web-based educational software resource designed to facilitate the teaching and learning of Materials science, at the tertiary level for free.
History
The DoITPoMS project originated in the early 1990s, incorporating customized online sources into the curriculum of the Materials Science courses in the Natural Sciences Tripos of the University Cambridge. The initiative became formalized in 2000, with the start of a project supported by the UK national Fund for the Development of Teaching and Learning (FDTL). This was led by the Department of Materials Science and Metallurgy at the University of Cambridge with five partner institutions, including the University of Leeds, London Metropolitan University, the University of Manchester, Oxford Brookes University, and the University of Sheffield. This period of cooperation lasted for about 10 years.
The FDTL project was aimed at building on expertise concerning the use of Information Technology (IT) to enhance the student learning experience and to disseminate these techniques within the Materials Education community in the UK and globally. This was done by creating an archive of background information, such as video clips, micrographs, simulations, etc, and libraries of teaching and learning packages (TLPs) that covers a particular topic, which were designed both for independent usage by students and as a teaching aid for educators. A vital feature of these packages is a high level of user interactivity.
DoITPoMS has no commercial sponsors and no advertising is permitted on the site. The background science to the resources within DoITPoMS has all been input by unpaid volunteers, most of whom have been academics based in universities. A single person retains responsibility for a particular resource, and these people are credited to the site. While the logo of University of Cambridge does appear on the site, is content is available freely and lice |
https://en.wikipedia.org/wiki/Lattice%20Boltzmann%20methods%20for%20solids | The Lattice Boltzmann methods for solids (LBMS) are a set of methods for solving partial differential equations (PDE) in solid mechanics. The methods use a discretization of the Boltzmann equation(BM), and their use is known as the lattice Boltzmann methods for solids.
LBMS methods are categorized by their reliance on:
Vectorial distributions
Wave solvers
Force tuning
The LBMS subset remains highly challenging from a computational aspect as much as from a theoretical point of view. Solving solid equations within the LBM framework is still a very active area of research. If solids are solved, this shows that the Boltzmann equation is capable of describing solid motions as well as fluids and gases: thus unlocking complex physics to be solved such as fluid-structure interaction (FSI) in biomechanics.
Proposed insights
Vectorial distributions
The first attempt of LBMS tried to use a Boltzmann-like equation for force (vectorial) distributions. The approach requires more computational memory but results are obtained in fracture and solid cracking.
Wave solvers
Another approach consists in using LBM as acoustic solvers to capture waves propagation in solids.
Force tuning
Introduction
This idea consists of introducing a modified version of the forcing term: (or equilibrium distribution) into the LBM as a stress divergence force. This force is considered space-time dependent and contains solid properties
,
where denotes the Cauchy stress tensor. and are respectively the gravity vector and solid matter density.
The stress tensor is usually computed across the lattice aiming finite difference schemes.
Some results
Force tuning has recently proven its efficiency with a maximum error of 5% in comparison with standard finite element solvers in mechanics. Accurate validation of results can also be a tedious task since these methods are very different, common issues are:
Meshes or lattice discretization
Location of computed fields at elements or nodes
Hid |
https://en.wikipedia.org/wiki/Thodex | Koineks Teknoloji A.Ş, known online as Thodex, is a defunct Turkey based cryptocurrency exchange founded by Faruk Fatih Özer.
Thodex was the first global exchange based in Turkey and of the 40 cryptocurrency exchanges in Turkey at the time, it was one of the big ones. It had 391,000 users when it froze in April 2021 and the owner fled Turkey with the clients' money.
Thodex was founded as Koineks in 2017, at the time only the 4th cryptocurrency exchange to be founded in Turkey. They established Turkey's first Bitcoin ATMs.
Koineks went global in 2020 changing its name to Thodex in March 2020. That year, Thodex was also licensed by Financial Crimes Enforcement Network as a Money Service Business (MSB). The total transaction volume on Thodex was ~$3 billion as of November 2020. The exchange had various rewards campaigns to draw in new users and new capital.
Shutdown
What would turn out to be the last of these rewards campaigns ran from 15 March to 15 April 2021. It was a Dogecoin rewards campaign where they stated that they would distribute 2 million dogecoin, 150 per new user that signs up. This campaign was set up in the month leading up to what is known by fans of Dogecoin as Dogeday (April 20) a day at which Dogecoin fans expected Dogecoin to go up in price significantly. Due to the hype, over half of the trading on the exchange was in Dogecoin. On the 19th of April, users experienced some disruptions in their transactions. Following complaints, Thodex stated that the issues were due to the exchange being under a cyberattack and the next day, April 20, trading on Thodex was halted entirely.
Thodex assured users in a statement that things would resume to normal in 4–5 days and that trading had temporarily shut down because "big-name banks" were interested in investing substantially as partners of the exchange, and they needed to temporarily suspend trading for the partnership to settle. In the meantime, Faruk Fatih Özer, the owner of the exchange, left Turkey |
https://en.wikipedia.org/wiki/Yelp%20%28software%29 | Yelp, also known as the GNOME Help Browser is the default help viewer for GNOME that allows users to access help documentation. Yelp follows the freedesktop.org help system specification and reads mallard, DocBook, man pages, info, and HTML documents. HTML is available by using XSLT to render XML documents into HTML.
Yelp has a search feature as well as a toolbar at the top for navigation through previously viewed documentation.
Yelp can be accessed by typing either into GNOME Shell, after pressing within GNOME, or within a terminal using the format. The command can also be used to access Yelp.
Although Yelp is not required for GNOME to function, it is required to view GNOME's help documentation. Ubuntu also uses yelp to provide a customized help interface for its software.
A format string vulnerability in GNOME versions 2.19.90 and 2.24 allowed arbitrary code execution through Yelp.
References
External links
GNOME Help
GNOME Applications
Technical communication
Software documentation
Online help |
https://en.wikipedia.org/wiki/Intracellular%20delivery | Intracellular delivery is the process of introducing external materials into living cells. Materials that are delivered into cells include nucleic acids (DNA and RNA), proteins, peptides, impermeable small molecules, synthetic nanomaterials, organelles, and micron-scale tracers, devices and objects.
Such molecules and materials can be used to investigate cellular behavior, engineer cell operations or correct a pathological function.
Medical applications of intracellular delivery range from in vitro fertilisation (IVF)
and mRNA vaccines
to gene therapy
and preparation of CAR-T cells
.
Industrial applications include protein production
, biomanufacture
, and genetic engineering of plants and animals
.
Intracellular delivery is a fundamental technique in the study of biology and genetics, such as the use of DNA plasmid transfection to investigate protein function in living cells
.
A wide range of approaches exist for performing intracellular delivery including biological, chemical and physical techniques that work through either membrane disruption or packaging the delivery material in carriers
.
Intracellular delivery is at the intersection of cell biology and technology, and is related to many fields across science and medicine including genetics, biotechnology, bioengineering and drug delivery.
Applications
Analogous to the way computers operate through electronic signals, cells process and transmit information through molecules. Depending on the molecules and materials that are loaded into cells, different outcomes or applications can be achieved (see Figure "Applications of Intracellular Delivery" for examples). Below are some of the main classifications of cargo materials used to investigate and engineer cells through intracellular delivery.
Cargo Types
Nucleic Acids
Transfection refers to the intracellular delivery of nucleic acids: DNA, RNA and their analogues. Nucleic acids materials that are commonly transfected into cells are plasmid DNA, mRNA, si |
https://en.wikipedia.org/wiki/Vegeta%20%28software%29 | Vegeta is an HTTP load testing tool written in Go that can be used as a command in a command-line interface or as a library. The program tests how an HTTP-based application behaves when multiple users access it at the same time by generating a background load of GET requests. Vegeta is used to generate a sustained, constant number of requests per second in order to discover how long a service can sustain a peak load before dropping in performance.
In addition to preemptive load testing, the program can also be used for shadow testing, where traffic from a live version of an application is mirrored onto a test version to determine how it handles the same traffic load, without causing potential disruption to the live version of the application. Shadow testing is done in this way in order to analyze anticipated server performance.
Vegeta is provided for use by web hosting services such as Scaleway to use varied and multiple requests to stress test client HTTP services. It is also used with dedicated load-testing platform services such as BlazeMeter.
Usage
The command-line usage is in the format of . The three global flags are which specifies the number of CPUs to use, which enables profiling, and which prints the software version and then terminates the program.
The commands available are , , , and , each with its own various command flag options, and both attack input and report output can be done in an optional JSON format when specified with the appropriate flag.
Vegeta can specify targets as URLs in a separate file with optional custom headers and requests, which can then be used as an input option on the command line.
Example
An example usage would be to issue from the command-line. This example uses the echo command to output , and then executes the attack command for that output for five seconds. After that, it uses the tee command to write results to a file called results.bin, and runs the report command to display the output of the attack results.
R |
https://en.wikipedia.org/wiki/List%20of%20grid%20computing%20projects | This is a comprehensive list of Grid computing infrastructure projects.
Grid computing infrastructure projects
BREIN uses the Semantic Web and multi-agent systems to build simple and reliable grid systems for business, with a focus on engineering and logistics management.
A-Ware is developing a stable, supported, commercially exploitable, high quality technology to give easy access to grid resources.
AssessGrid addresses obstacles to wide adoption of grid technologies by bringing risk management and assessment to this field, enabling use of grid computing in business and society.
Cohesion Platform – A Java-based modular peer-to-peer multi-application desktop grid computing platform for irregularly structured problems developed at the University of Tübingen (Germany)
The European Grid Infrastructure (EGI) – A series of projects funded by the European Commission which links over 70 institutions in 27 European countries to form a multi-science computing grid infrastructure for the European Research Area, letting researchers share computer resources
GridCOMP provides an advanced component platform for an effective invisible grid.
GridECON takes a user-oriented perspective and creates solutions to grid challenges to promote widespread use of grids.
neuGRID develops a new user-friendly grid-based research e-infrastructure enabling the European neuroscience community to perform research needed for the pressing study of degenerative brain diseases, for example, Alzheimer's disease.
OurGrid aims to deliver grid technology that can be used today by current users to solve present problems. To achieve this goal, it uses a different trade-off compared to most grid projects: it forfeits supporting arbitrary applications in favor of supporting only bag-of-tasks applications.
ScottNet NCG – A distributed neural computing grid. A private commercial effort in continuous operation since 1995. This system performs a series of functions including data synchronization amongst |
https://en.wikipedia.org/wiki/Jacques-Fran%C3%A7ois%20Le%20Poivre | Jacques-François Le Poivre (11 February 1652 – 6 December 1710) was a Belgian mathematician and geometer who was a pioneer of projective geometry. He is largely known from a single book in French on conic sections, Traité des sections du cylindrie et du cône considérées dans le solide et dans le plan, avec des démonstrations simples & nouvelles (1704).
Le Poivre was born in Mons to son of Jacques and Catherine Demeurs. The Le Poivre family had many engineers including Pierre Le Poivre (1546-1626), an architect and military engineer. Jacques-François too studied mathematics and geometry and worked as a clerk and surveyor for the city of Mons. In 1700 he moved to Paris and in 1704 he published a treatise in two parts on cylindrical and conic sections. This work largely escaped serious study and some reviewers considered it to be plagiarism of Philippe de la Hire. In any case, de la Hire's work was more well-known. In part 2, his method of central projection was essentially the same as used by de La Hire in his 1673 work Nouvelle méthode en géométrie, pour les sections des superficies coniques et cylindriques but it has been suggested that Le Poivre independently discovered this since the book included several original theorems. A second edition of the Traité was published in 1708. An earlier work on an introduction to arithmetic that Le Poivre published in 1687 has never been located. He was a friend of Guillaume de l'Hôpital and a simple proof of the intersecting chords theorem by Le Poivre impressed l'Hôpital and may have made its way into l'Hôpital's Traité analytique des sections coniques. A biography claimed that Le Poivre was a poet.
References
External links
Traité des sections du cylindrie et du cône considérées dans le solide et dans le plan, avec des démonstrations simples & nouvelles (1704) - at the German national library
Scientists from Paris
People from Mons
1710 deaths
Belgian mathematicians
1652 births
Belgian emigrants to France
Geometers
Belgia |
https://en.wikipedia.org/wiki/TOSS%20%28operating%20system%29 | The Tri-Lab Operating System Stack (TOSS) is a Linux distribution based on Red Hat Enterprise Linux (RHEL) that was created to provide a software stack for high performance computing (HPC) clusters for laboratories within the National Nuclear Security Administration (NNSA). The operating system allows multiple smaller systems to emulate a high-performance computing (HPC) platform.
Linux distribution
The name "tri-lab" refers to the three major NNSA labs, the Lawrence Livermore National Laboratory, the Los Alamos National Laboratory, and the Sandia National Laboratories.
The OS is used by NNSA computers including the El Capitan supercomputer and systems using ARM architecture including the ThunderX2 system on a chip (SoC). In addition to being used by the National Nuclear Security Administration (NNSA), most of the systems in NASA's High-End Computing Capabiity Project, part of the NASA Advanced Supercomputing Division, were all migrated to TOSS in March 2022.
Many of the software packages included in TOSS are from the RHEL repository. Additional packages are built using Fedora's Koji build system to create RPM packages. The system also uses SLURM and Flux scheduling and resource management software.
References
Linux distributions
RPM-based Linux distributions |
https://en.wikipedia.org/wiki/EUginius | EUginius is an Internet-based database application for Genetically modified organisms (GMOs). The name EUginius is an acronym and stands for EUropean GMO Initiative for a Unified Database System.
Development and commissioning
The EUginius database was created on the initiative of the German Federal Office of Consumer Protection and Food Safety (BVL) and the Dutch research Institute Wageningen Food Safety Research (WFSR, formerly RIKILT). Building on parallel preparatory work by both cooperation partners, EUginius has been jointly developed and maintained since 2010, and has been online since October 2014. The information is provided in English.
Goal
EUginius aims to assist competent authorities as well as interested private users in finding accurate information on the presence, detection and identification of GMOs. Data on the GMOs’ molecular characterisation and traits, detection methods, reference materials, and authorisation status (currently limited to the EU) are provided. EUginius is tax-financed and therefore offers its information on the GMOs freely accessible. Information on releases carried out and their geographical location are not provided in EUginius.
Types of organisms present in EUginius
Most of the GMOs present in EUginius are used for genetically modified food and feed, the majority plants (e.g. pest resistant Bt maize, Golden rice with enhanced synthesis of ß-carotene), and thus come from the field of green biotechnology. There is also information on genetically modified animals. EUginius provides for example information on a fast-growing genetically modified salmon (AquAdvantage) as well as information on genetically modified insects that have been developed to combat vectors of pathogens (e.g. Aedes aegypti OX5034, used to reduce the yellow fever mosquito population). In addition, in some cases, information is provided for the detection of genetically modified microbial production strains of food or feed additives (white biotechnology).
|
https://en.wikipedia.org/wiki/Potassium%20phosphide | Potassium phosphide is an inorganic semiconductor compound with the formula K3P. It appears as a white crystalline solid or powder. It reacts violently with water and is toxic via ingestion, inhalation and skin absorption. It has a hexagonal structure.
Synthesis
Potassium phosphide can be synthesised by simply reacting the two elements together:
12K + P4 -> 4K3P
Applications
Potassium phosphide is used in high power, high frequency applications and also in laser diodes.
References
Phosphides
Potassium compounds
Semiconductors |
https://en.wikipedia.org/wiki/Glossary%20of%20quantum%20computing | This glossary of quantum computing is a list of definitions of terms and concepts used in quantum computing, its sub-disciplines, and related fields.
References
Further reading
Textbooks
Academic papers
Table 1 lists switching and dephasing times for various systems.
Models of computation
Quantum cryptography
Information theory
Computational complexity theory
Classes of computers
Theoretical computer science
Open problems
Computer-related introductions in 1980
Emerging technologies
Quantum computing
Wikipedia glossaries using description lists |
https://en.wikipedia.org/wiki/Project%20Nimbus | Project Nimbus () is a cloud computing project of the Israeli government and its military. The Israeli Finance Ministry announced April 2021, that the contract is to provide "the government, the defense establishment, and others with an all-encompassing cloud solution." Under the contract, the companies will establish local cloud sites that will "keep information within Israel's borders under strict security guidelines."
Project Nimbus has four planned phases: the first is purchasing and constructing the cloud infrastructure, the second is crafting government policy for moving operations onto the cloud, the third is moving operations to the cloud, and the fourth is implementing and optimizing cloud operations. Under a $1.2 billion contract, technology companies Google (Google Cloud Platform) and Amazon (Amazon Web Services) were selected to provide Israeli government agencies with cloud computing services, including artificial intelligence and machine learning.
The terms Israel set for the project contractually forbid Amazon and Google from halting services due to boycott pressure. The tech companies are also forbidden from denying service to any particular government entities.
Criticism
The contract has drawn rebuke and condemnation from the companies' shareholders as well as their employees, over concerns that the project will lead to further abuses of Palestinians' human rights in the context of the ongoing occupation and the Israeli–Palestinian conflict. Specifically, they voice concern over how the technology will enable further surveillance of Palestinians and unlawful data collection on them as well as facilitate the expansion of Israel's illegal settlements on Palestinian land.
Ariel Koren, who had worked as a marketing manager for Google’s educational products and was an outspoken opponent of the project, was given the ultimatum of moving to São Paulo within 17 days or losing her job. In a letter announcing her resignation to her colleagues, Koren wrot |
https://en.wikipedia.org/wiki/IBM%20PS/2%20Model%2025 | The Personal System/2 Model 25 and its later submodels the 25 286 and 25 SX are IBM's lowest-end entries in the Personal System/2 (PS/2) family of personal computers. Like its sibling the Model 30, the Model 25 features an Industry Standard Architecture bus, allowing it to use expansion cards from its direct predecessors, the PC/XT and the PC/AT—but not from higher entries in the PS/2 line, which use Micro Channel. Unlike all other entries in the PS/2 line, the Model 25 and its submodels are built into an all-in-one form factor, with its cathode-ray tube (CRT) monitor and system board occupying the same enclosure. IBM oriented the Model 25 at home office workers and students.
Development and release
IBM unveiled the Model 25 on August 4, 1987. It is the fifth entry of the Personal System/2 range. The first Model 25 is powered by an Intel 8086 running at 8 MHz, roughly twice the speed of the original IBM Personal Computer. A college student-oriented version of the Model 25, the Collegiate, has two 720 KB floppy drives, with a maximum RAM capacity of 640 KB, and was packaged with the official PS/2 Mouse, Windows 2.0, and four blank floppy disks.
In 1990, IBM released the Model 25 286, which upgrades the original to an Intel 80286 running at 10 MHz. In late 1991, IBM's Boca Raton facility, led by José García, developed the Model 25 SX, which features an Intel 80386SX clocked at 20 MHz. This version of the Model 25 was sold only to K–12 schools. The Model 25 series was never officially sold outside of the United States.
IBM neither included nor supported hard disk drives in the original Model 25, although several aftermarket kits were available by late 1987. The later 25 286 and 25 SX were sold with a hard drive as an option.
Reception
Multiple contemporary reviewers compared the Model 25 to Apple's original Macintosh. Stephen Satchell of InfoWorld wrote when he first saw the Model 25 on its announcement: "[M]y immediate impression was that I was looking at a defor |
https://en.wikipedia.org/wiki/Stable%20Diffusion | Stable Diffusion is a deep learning, text-to-image model released in 2022 based on diffusion techniques. It is primarily used to generate detailed images conditioned on text descriptions, though it can also be applied to other tasks such as inpainting, outpainting, and generating image-to-image translations guided by a text prompt. It was developed by researchers from the CompVis Group at Ludwig Maximilian University of Munich and Runway with a compute donation by Stability AI and training data from non-profit organizations.
Stable Diffusion is a latent diffusion model, a kind of deep generative artificial neural network. Its code and model weights have been released publicly, and it can run on most consumer hardware equipped with a modest GPU with at least 4 GB VRAM. This marked a departure from previous proprietary text-to-image models such as DALL-E and Midjourney which were accessible only via cloud services.
Development
The development of Stable Diffusion was funded and shaped by the start-up company Stability AI.
The technical license for the model was released by the CompVis group at Ludwig Maximilian University of Munich. Development was led by Patrick Esser of Runway and Robin Rombach of CompVis, who were among the researchers who had earlier invented the latent diffusion model architecture used by Stable Diffusion. Stability AI also credited EleutherAI and LAION (a German nonprofit which assembled the dataset on which Stable Diffusion was trained) as supporters of the project.
In October 2022, Stability AI raised US$101 million in a round led by Lightspeed Venture Partners and Coatue Management.
Technology
Architecture
Stable Diffusion uses a kind of diffusion model (DM), called a latent diffusion model (LDM) developed by the CompVis group at LMU Munich. Introduced in 2015, diffusion models are trained with the objective of removing successive applications of Gaussian noise on training images, which can be thought of as a sequence of denoising autoenc |
https://en.wikipedia.org/wiki/Journal%20of%20Food%20Protection | Journal of Food Protection is a scientific journal that covers original research in food science. The journal is published by Elsevier.
Abstracting and indexing
The journal is abstracted and indexed for example in:
Scopus
Science Citation Index
PubMed/Medline
According to the Journal Citation Reports, the journal has a 2021 impact factor of 2.745.
References
External links
Food science journals
Elsevier academic journals
English-language journals |
https://en.wikipedia.org/wiki/Code%20property%20graph | In computer science, a code property graph (CPG) is a computer program representation that captures syntactic structure, control flow, and data dependencies in a property graph. The concept was originally introduced to identify security vulnerabilities in C and C++ system code, but has since been employed to analyze web applications, cloud deployments, and smart contracts. Beyond vulnerability discovery, code property graphs find applications in code clone detection, attack-surface detection, exploit generation, measuring code testability, and backporting of security patches.
Definition
A code property graph of a program is a graph representation of the program obtained by merging its abstract syntax trees (AST), control-flow graphs (CFG) and program dependence graphs (PDG) at statement and predicate nodes. The resulting graph is a property graph, which is the underlying graph model of graph databases such as Neo4j, JanusGraph and OrientDB where data is stored in the nodes and edges as key-value pairs. In effect, code property graphs can be stored in graph databases and queried using graph query languages.
Example
Consider the function of a C program:
void foo() {
int x = source();
if (x < MAX) {
int y = 2 * x;
sink(y);
}
}
The code property graph of the function is obtained by merging its abstract syntax tree, control-flow graph, and program dependence graph at statements and predicates as seen in the following figure:
Implementations
Joern CPG. The original code property graph was implemented for C/C++ in 2013 at University of Göttingen as part of the open-source code analysis tool Joern. This original version has been discontinued and superseded by the open-source Joern Project, which provides a formal code property graph specification applicable to multiple programming languages. The project provides code property graph generators for C/C++, Java, Java bytecode, Kotlin, Python, JavaScript, TypeScript, LLVM bitcode, and x86 binaries (via th |
https://en.wikipedia.org/wiki/EduQuest | IBM EduQuest, later shortened to EduQuest, was a subsidiary of American multinational technology corporation IBM that catered to the elementary and secondary educational market. A spin-off of the company's Educational Systems division spearheaded by James Elton Dezell Jr. (1933–2000), EduQuest developed software and hardware for schools. Most prominent was their line of all-in-one personal computers, whose form factor was based on IBM's PS/2 Model 25.
History
The roots of EduQuest began with a division within IBM called Educational Systems, formed in 1982 by James Elton Dezell Jr. (1933–2000), an IBM executive and former teacher. IBM spun it off as EduQuest in 1992 and named Dezell as president. Its initial personnel comprised 1,000 sales and support employees, including 400 at its headquarters in Atlanta, Georgia. From 1992 to 1994, EduQuest operated independently of IBM, the latter describing EduQuest as a "company within a company" in promotional material. IBM reserved their role as a holding company, renting real estate and equipment to EduQuest. In January 1994, EduQuest was consolidated with IBM's two other educational divisions, Academic Information Systems (or ACIS; geared toward higher education) and Skill Dynamics (computer and management training products used within IBM and marketed to other corporations). The post-consolidation subsidiary was named IBM Education Businesses, with the three divisions including EduQuest still operating in their original capacities. EduQuest retained close ties with the IBM Personal Computer Company, another spin-off of IBM formed in August 1992 that assumed responsibility of developing and selling IBM's desktop and mobile computers, such as the ThinkPad and PS/ValuePoint.
EduQuest sold both hardware and software to schools. The subsidiary directly competed with Apple Computer, who had long cornered the educational computer market. Most of EduQuest's software was interactive multimedia material and edutainment games co-de |
https://en.wikipedia.org/wiki/Silver%27s%20dichotomy | In descriptive set theory, a branch of mathematics, Silver's dichotomy (also known as Silver's theorem) is a statement about equivalence relations, named after Jack Silver.
Statement and history
A relation is said to be coanalytic if its complement is an analytic set. Silver's dichotomy is a statement about the equivalence classes of a coanalytic equivalence relation, stating any coanalytic equivalence relation either has countably many equivalence classes, or else there is a perfect set of reals that are each incomparable to each other. In the latter case, there must be uncountably many equivalence classes of the relation.
The first published proof of Silver's dichotomy was by Jack Silver, appearing in 1980 in order to answer a question posed by Harvey Friedman. One application of Silver's dichotomy appearing in recursive set theory is since equality restricted to a set is coanalytic, there is no Borel equivalence relation such that , where denotes Borel-reducibility. Some later results motivated by Silver's dichotomy founded a new field known as invariant descriptive set theory, which studies definable equivalence relations. Silver's dichotomy also admits several weaker recursive versions, which have been compared in strength with subsystems of second-order arithmetic from reverse mathematics, while Silver's dichotomy itself is provably equivalent to over .
References
Set theory |
https://en.wikipedia.org/wiki/Weak%20stability%20boundary | Weak stability boundary (WSB), including low-energy transfer, is a concept introduced by Edward Belbruno in 1987. The concept explained how a spacecraft could change orbits using very little fuel.
Weak stability boundary is defined for the three-body problem. This problem considers the motion of a particle P of negligible mass moving with respect to two larger bodies, P1, P2, modeled as point masses, where these bodies move in circular or elliptical orbits with respect to each other, and P2 is smaller than P1.
The force between the three bodies is the classical Newtonian gravitational force. For example, P1 is the Earth, P2 is the Moon and P is a spacecraft; or P1 is the Sun, P2 is Jupiter and P is a comet, etc. This model is called the restricted three-body problem. The weak stability boundary defines a region about P2 where P is temporarily captured. This region is in position-velocity space. Capture means that the Kepler energy between P and P2 is negative. This is also called weak capture.
Background
This boundary was defined for the first time by Edward Belbruno of Princeton University in 1987. He described a Low-energy transfer which would allow a spacecraft to change orbits using very little fuel. It was for motion about Moon (P2) with P1 = Earth. It is defined algorithmically by monitoring cycling motion of P about the Moon and finding the region where cycling motion transitions between stable and unstable after one cycle. Stable motion means P can completely cycle about the Moon for one cycle relative to a reference section, starting in weak capture. P needs to return to the reference section with negative Kepler energy. Otherwise, the motion is called unstable, where P does not return to the reference section within one cycle or if it returns, it has non-negative Kepler energy.
The set of all transition points about the Moon comprises the weak stability boundary, . The motion of is sensitive or chaotic as it moves about the Moon within . A mathematic |
https://en.wikipedia.org/wiki/Endemixit | Endemixit is a project that studies the effects of reduced population size in five Italian endemic species at risk of extinction. The final objective is to estimate the risk of extinction from genomic data and contribute to the preservation of these species. The project was funded by the MUR (Italian Ministry for Research) and coordinated by the Department of Life Sciences and Biotechnology of the University of Ferrara with the involvement of five other Italian universities: Ancona, Florence, Padua, Rome Tor Vergata and Trieste.
Species under study
The species considered are all classified in danger or in critical danger of extinction in the IUCN Red List:
Podarcis raffonei (Aeolian wall lizard), a lizard with a current range restricted to three Aeolian Islands and subdivided into isolated and relatively distant populations.
Hipparchia sbordonii (Ponza grayling), currently only found on some Pontine Islands.
Acipenser naccarii (Adriatic sturgeon), once widespread in the Northern Adriatic Sea and in many rivers of Northern Italy, but today almost extinct in nature.
Bombina pachypus (Apennine yellow-bellied toad), an endemic and endangered species of the Italian Peninsula closely related to the most common European yellow-bellied toad (B. variegata).
Ursus arctos marsicanus (Marsican, or Apennine, brown bear), a subspecies of brown bear (U. arctos), present exclusively in a small region of the central Apennines Mountains.
Applications and innovative aspects
Endemixit is a genomic project applied to the conservation of biodiversity. Five reference genomes will be produced (one for each endemic species/subspecies), and 20 to 30 individuals per species will be re-sequenced (whole genomes at intermediate coverage). Population genomics analyses will be used to reconstruct past demographic processes and to estimate the genetic load possibly accumulated due to genetic drift. The results will be theoretically important to understand the genetic load dynamic. Practic |
https://en.wikipedia.org/wiki/Fog%20Reveal | Fog Reveal is a tracking tool that aggregates location data from mobile apps. It is a product of FOG Data Science.
FOG Data Science
FOG Data Science is a limited liability company based in Virginia. It was founded in 2016 by two former United States Department of Homeland Security officials. Matthew Broderick, managing partner at the company, was director of operations for the DHS from 2005 to 2006.
Functionality
FOG Data Science purchases commercially available location data from Virginia-based company Venntel, collected from hundreds of mobile apps that sell information on user interests and movements, including the apps of Starbucks and Waze. The information is derived from advertising IDs, unique user IDs assigned to mobile devices allowing advertisers to track people's movements, habits, and usage of apps. Subscriptions to the service cost at least $7,500 per year. While the data is anonymized, officials have commented that competent law enforcement could use the information to identify individuals. According to FOG Data Science partner Matthew Broderick, their historical data profiles go back three years.
Use by law enforcement
Fog Reveal is used by local, state and federal law enforcement agencies in the United States, since at least 2018. Documents procured by the Electronic Frontier Foundation through the Freedom of Information Act revealed that FOG Data Science had 40 contracts with "nearly two dozen agencies," including the Dallas Police Department and the Rockingham County, North Carolina sheriff's office. The software has been used to track individuals without requiring a search warrant.
According to a 2022 Associated Press investigation supported by the Pulitzer Center on Crisis Reporting, law enforcement agencies used Fog Reveal "to search hundreds of billions of records from 250 million mobile devices, and harnessed the data to create location analyses known among law enforcement as 'patterns of life.'"
Reception
Privacy advocates raised con |
https://en.wikipedia.org/wiki/Xx%20messenger | xx messenger is a cross-platform decentralized encrypted instant messaging service developed by PrivaTegrity Corporation. Messages are delivered over a variety of mix network first described in 2016. Users can send one-to-one and group messages, which can include voice notes and images.
xx messenger uses usernames as identifiers which can be optionally attached to standard cellular telephone numbers or email addresses for contact discovery. All communications between users are secured with quantum-resistant end-to-end encryption.
xx messenger's software is free and open-source. Its mobile clients are published under the 2-clause BSD License, while its server software is published under a modified, patent-protected Business Source License.
History
An alpha version of xx messenger was first presented on January 6, 2016 by David Chaum at the Real World Crypto conference with the stated goal of demonstrating a new type of mix network encryption scheme. The encryption scheme, known as PrivaTegrity, was described by Chaum and team of academic partners at Purdue University, Radboud University Nijmegen, University of Birmingham, and other schools.
xx messenger was released to the public as a mobile app on Android and IOS on 25 January 2022.
Architecture
cMix
xx messenger uses cMix - a network of decentralized servers that are run by independent operators in approximately 80 countries - for data transmission. cMix attempts to address traditional latency and scalability limitations of mix networks by performing computationally expensive public-key operations between mix nodes prior to any client data being transmitted over the network. Messages sent by users of xx messenger are grouped in batches of 1,000 and routed through a subset of cMix nodes. Once the mixing process is complete, each message can be retrieved and decrypted by their recipient.
Encryption protocols
The cMix protocol uses XChaCha20, BLAKE2b, HMAC-SHA-256, Diffie–Hellman key exchange, and Supersingu |
https://en.wikipedia.org/wiki/BIOTECanada | BIOTECanada, or the Industrial Biotechnology Association of Canada, is a Canadian biotechnology industry association based in Ottawa, Ontario. It is an industry-funded membership organization composed of over 250 national and international pharmaceutical and gene therapy companies, medical device manufacturers, agricultural science businesses, law firms, academic institutions, research and development networks, advertising agencies, insurance companies and financial services firms.
BIOTECanada and the University of Western Ontario jointly administer the Gold Leaf Awards, presented annually to individuals and organizations who are deemed to have made significant contributions to Canada's biotechnology sector.
History
The organization was incorporated in 1987 as the Industrial Biotechnology Association of Canada.
Health Canada partnered with BIOTECanada in May 2012 to organize a summit on clinical and regulatory topics associated with biosimilars. The event was held in association with the International Alliance for Biological Standardization, and was observed by representatives from the Patented Medicine Prices Review Board and the Canadian Agency for Drugs and Technologies in Health. Panelists included representatives from academia, regulatory bodies and industry, such as UMass Memorial Health, Janssen Pharmaceuticals, the Robarts Research Institute, Alberta Blue Cross, Mount Sinai Hospital and Sunnybrook Health Sciences Centre.
In 2017, BIOTECanada published a report detailing proposed initiatives to use biotechnology to address issues including population growth, climate change, food security, health, and economic instability. President and CEO Andrew Casey sent a letter in July 2017 to Innovation, Science and Economic Development Canada proposing measures to offset costs of patent filings, and to reduce taxation on intellectual property revenues.
COVID-19
Several representatives of BIOTECanada participated as members and advisors in the COVID-19 Therapeut |
https://en.wikipedia.org/wiki/Malaria%20therapy | The malaria therapy (or malaria inoculation, and sometimes malariotherapy) is an archaic medical procedure of treating diseases using artificial injection of malaria parasites. It is a type of pyrotherapy (or pyretotherapy) by which high fever is induced to stop or eliminate symptoms of certain diseases. In malaria therapy, malarial parasites (Plasmodium) are specifically used to cause fever, and an elevated body temperature reduces the symptoms of or cure the diseases. As the primary disease is treated, the malaria is then cured using antimalarial drugs. The method was developed by Austrian physician Julius Wagner-Jauregg in 1917 for the treatment of neurosyphilis for which he received the 1927 Nobel Prize in Physiology or Medicine.
Background
The beneficial effects of infections in mental problems were known in the Ancient world. Hippocrates in the 4th century BCE recorded bacterial infections such as dysentery and dropsy reducing the symptoms of madness; and that malaria (quartan fever) could stop epileptic convulsions. Galen in the 2nd century CE described a case of mental illness that ended after malarial infection. There are medical records from the 19th century which indicate that insanity stopped temporarily or permanently when the individuals had severe infections.
Russian psychiatrist Alexander Samoilovich Rosenblum was the first to experimentally use infections for the treatment of psychosis. In 1876, he induced fever in psychotic individuals using malaria, typhoid, and relapsing fever. He claimed that he cured 50% of all those he treated. However, his work was not widely known as his publication in 1877 was in a small journal in Odesa, Ukraine, and written in Russian. He also preferred not to spread his findings. He understood that it was a dangerous experiment and potentially controversial. It was, however, reported by J. Motschukoffsky in a German medical journal Centralblatt für die Medicinischen Wissenschaften, but the underlying cause of how mal |
https://en.wikipedia.org/wiki/Alzheimer%27s%20disease%20in%20the%20Hispanic/Latino%20population | Alzheimer's disease (AD) in the Hispanic/Latino population is becoming a topic of interest in AD research as Hispanics and Latinos are disproportionately affected by Alzheimer's Disease and underrepresented in clinical research. AD is a neurodegenerative disease, characterized by the presence of amyloid-beta plaques and neurofibrillary tangles, that causes memory loss and cognitive decline in its patients. However, pathology and symptoms have been shown to manifest differently in Hispanic/Latinos, as different neuroinflammatory markers are expressed and cognitive decline is more pronounced. Additionally, there is a large genetic component of AD, with mutations in the amyloid precursor protein (APP), Apolipoprotein E APOE), presenilin 1 (PSEN1), bridging Integrator 1 (BIN1), SORL1, and Clusterin (CLU) genes increasing one's risk to develop the condition. However, research has shown these high-risk genes have a different effect on Hispanics and Latinos then they do in other racial and ethnic groups. Additionally, this population experiences higher rates of comorbidities, that increase their risk of developing AD. Hispanics and Latinos also face socioeconomic and cultural factors, such as low income and a language barrier, that affect their ability to engage in clinical trials and receive proper care.
Alzheimer's disease
Alzheimer's disease is the most common form of dementia, accounting for 60% of all cases, and is the sixth leading cause of death in the elderly. The disease typically presents itself with intracellular aggregation of hyper-phosphorylated tau, forming neurofibrillary tangles (NFTs), and the extracellular aggregation of amyloid beta (Aβ), forming neuritic plaques. As of 2020, 5.4 million Americans have been diagnosed with Alzheimer's disease, and this number is projected to reach 15-22 million by 2050. Hispanics and Latinos account for 55 million of the population and this population is projected to rise to 97 million, accounting for 25% of the U.S. |
https://en.wikipedia.org/wiki/Orthogonality%20%28mathematics%29 | In mathematics, orthogonality is the generalization of the geometric notion of perpendicularity to the linear algebra of bilinear forms.
Two elements u and v of a vector space with bilinear form B are orthogonal when . Depending on the bilinear form, the vector space may contain nonzero self-orthogonal vectors. In the case of function spaces, families of orthogonal functions are used to form a basis.
The concept has been used in the context of orthogonal functions, orthogonal polynomials, and combinatorics.
Definitions
In geometry, two Euclidean vectors are orthogonal if they are perpendicular, i.e., they form a right angle.
Two vectors x and y in an inner product space V are orthogonal if their inner product is zero. This relationship is denoted .
An orthogonal matrix is a matrix whose column vectors are orthonormal to each other.
An orthonormal basis is a basis whose vectors are both orthogonal and normalized (they are unit vectors).
A conformal linear transformation preserves angles and distance ratios, meaning that transforming orthogonal vectors by the same conformal linear transformation will keep those vectors orthogonal.
Two vector subspaces A and B of an inner product space V are called orthogonal subspaces if each vector in A is orthogonal to each vector in B. The largest subspace of V that is orthogonal to a given subspace is its orthogonal complement.
Given a module M and its dual M∗, an element m′ of M∗ and an element m of M are orthogonal if their natural pairing is zero, i.e., . Two sets and are orthogonal if each element of S′ is orthogonal to each element of S.
A term rewriting system is said to be orthogonal if it is left-linear and is non-ambiguous. Orthogonal term rewriting systems are confluent.
A set of vectors in an inner product space is called pairwise orthogonal if each pairing of them is orthogonal. Such a set is called an orthogonal set.
In certain cases, the word normal is used to mean orthogonal, particularly in the g |
https://en.wikipedia.org/wiki/Big%20Stan%20%28drill%20rig%29 | Big Stan is a vehicle-mounted drill rig built in 1986 by Anderson Drilling. The rig has been used on a number of construction projects in which conventional, smaller drilling rigs were unable to be used, particularly when projects call for drilling into hard soil. Notably, Big Stan was used in the construction of the First National Bank Tower in Omaha, the Benicia-Martinez bridge near San Francisco, and on expansions to the I-15/215 Beltway in Las Vegas. The drill rig was featured on Discovery Channel’s show “Monster Machines” in 2007.
Big Stan features a two-piece design, significantly lowering the time and manpower needed to assemble it compared to contemporary rigs. Big Stan employs a screw conveyor capable of exerting of torque and of downward force to a maximum depth of . Its drill bit is capable of moving of soil per rotation and its drill bucket is able to move up to of soil per rotation. The rig has been estimated as one of, if not the largest, vehicle-mounted drilling rigs in the world.
History
Big Stan was built in 1986 by Anderson Drilling (Now part of Keller Group PLC) in Lakeside, California. The machine cost $1.5 million to construct and was named after the company president at the time, Stan Anderson, who was given a similar nickname due to his height of 6 ft 3 in (1.91 m). The rig was originally built to meet the demand for a more powerful mobile drilling rig, specifically a demand for rigs capable of boring up to deep. At the time, Big Stan was claimed to be the largest portable drill rig in the United States, with some estimates placing it as the largest vehicle-mounted drill rig in the world.
From May to June 1999, Big Stan was used to drill the caissons for the First National Bank Tower in Omaha, Nebraska. In 2004, while working on an expansion to the Benicia-Martinez bridge near San Francisco, Big Stan was filmed by Discovery Channel’s Canadian outlet for the show “Monster Machines”. The episode aired in 2007. In June 2007, Big Stan wa |
https://en.wikipedia.org/wiki/Phageome | A phageome is a community of bacteriophages and their metagenomes localized in a particular environment, similar to a microbiome. The term was first used in an article by Modi et al in 2013 and has continued to be used in scientific articles that relate to bacteriophages and their metagenomes. A bacteriophage, or phage for short, is a virus that has the ability to infect bacteria and archaea, and can replicate inside of them. Phageome is a subcategory of virome, which is all of the viruses that are associated with a host or environment. Phages make up the majority of most viromes and are currently understood as being the most abundant organism. Oftentimes scientists will look only at a phageome instead of a virome while conducting research.
In humans
Although bacteriophages do not have the capability to infect human cells, they are found in abundance in the human virome.
The human gut phageome has recently become a topic of interest in the scientific community. The makeup of the gut phageome can be responsible for different gut related diseases such as IBD. The composition of phages that make up a healthy human gut phageome is currently debated, since different methods of research can lead to different results.
See also
Virosphere
References
Microbiology
Bacteriophages
Biology
Wikipedia Student Program
Microbiomes |
https://en.wikipedia.org/wiki/D-Orbit | D-Orbit is a private aerospace company headquartered in Italy with subsidiaries in Portugal, the UK and the US.
D-orbit is mainly active in the Space tug also known as orbital transfer vehicle (OTV) market. While this concept has existed for several decades, it is only in the last few years that more examples are being produced and used.
D-Orbit has been operating commercial ION missions since September 2020, deploying satellites for customers like Planet Labs, EnduroSat, Elecnor Deimos, University of Southern California, SatRevolution, and Kleos, and operating payloads for the German HPS, High Performance Space Structure Systems, the Instituto de Astrofísica de Canarias (IAC), and the Swiss data security company Cysec SA.
History
D-Orbit was founded in 2011 by Luca Rossettini, currently serving as chief executive officer (CEO), and Renato Panesi, currently serving as chief commercial officer (COO).
The company's initial focus was the development of a smart and autonomous decommissioning motor for satellites and launcher stages called D3 (D-Orbit Decommissioning Device). In 2015, the D3 project was partially funded by the European Union under the framework of Horizon 2020.
This provided the origin of the D-orbit name, being just a contraction of the term "de-orbit", which denotes an orbital manoeuver that pulls a spacecraft out of its operational orbit and inserts it into a reentry trajectory that will eventually cause it to burn up upon atmospheric entry.
In 2017, the company began the development of ION Satellite Carrier, an orbital transfer vehicle able to host a batch of satellites, transport them across orbits, and release each one of them, individually, into a custom orbital slot and operate third-party payloads.
The OTV performed its first commercial mission in September 2020.
In 2022, the company planned to go public via a SPAC with a valuation of $1.4bn, however this was cancelled.
In June 2022, the company gained an award of around 1.95 million E |
https://en.wikipedia.org/wiki/Loab | Loab ( ) is a fictional character that Twitter user Supercomposite has claimed to have discovered with an unspecified text-to-image AI model in April 2022. The user described it as an unexpectedly emergent property of the software, saying they discovered it when asking the model to produce something "as different from the prompt as possible".
History
Swedish-based musician and artist Supercomposite has said they first generated these images in April 2022 by using the algorithmic technique of "negative prompt weights" accessing latent space, the initial prompt – 'Brando::-1', requesting the opposite of actor Marlon Brando – generated a "skyline logo" with cryptic lettering. Attempting to generate the opposite of this image using the prompt "DIGITA PNTICS skyline logo::-1" yielded what Supercomposite described as "off-putting images, all of the same devastated-looking older woman with defined triangles of rosacea(?) on her cheeks". Supercomposite nicknamed the character "Loab", after one of the generated images resembled an album cover that included the printed word "loab".
Supercomposite says that using the image as a prompt for further images produced increasingly violent and gory results. Supercomposite speculated that something about the image could be "adjacent to extremely gory and macabre imagery in the distribution of the AI's world knowledge". Supercomposite says that when they combined images of Loab with other pictures, the subsequent results consistently return an image including Loab, regardless of how much distortion they added to the prompts to try and remove her visage. Supercomposite speculated that the latent space region of the AI map that Loab is located in, in addition to being near gruesome imagery, must be isolated enough that any combinations with other images could only use Loab from her area and no related images due to its isolation. After enough crossbreeding of images and dilution attempts, Supercomposite was able to eventually generate |
https://en.wikipedia.org/wiki/Kevin%20Brindle | Kevin Michael Brindle, , (born 27 August 1955) is a British biochemist, currently Professor of Biomedical Magnetic Resonance in the Department of Biochemistry at the University of Cambridge and a Senior Group Leader at Cancer Research UK. He is known for developing magnetic resonance imaging (MRI) techniques for use in cell biochemistry and new imaging methods for early detection, monitoring, and treatment of cancer.
Early life and career
Brindle took his BA in Biochemistry at Oxford University in 1978, before earning a D.Phil in 1982. He became a Royal Society University Research Fellow, also at Oxford, in 1986. Four years later, he took up a lectureship at Manchester University. He came a lecturer at Cambridge in 1993 and has been a professor there since 2005.
Research interests
Brindle's research focuses on the use and development of new kinds of magnetic resonance imaging for investigating the biochemistry of cells, most recently in the early detection, monitoring of progression, and treatment of tumours. He has developed and patented a novel imaging agent for detecting cell death. He has also worked on the development of hyperpolarized carbon-13 MRI in cancer treatment, which involves injecting a carbon-13-labelled molecule into a tumour and using MRI to monitor how quickly it is growing or dying following drug treatment. Brindle estimates the technique to be between 10,000 and 100,000 times more sensitive than conventional techniques such as magnetic resonance spectroscopy and magnetic resonance spectroscopic imaging, and its main advantage is that it can show whether cancer drugs are working within days rather than weeks or months. It has been tested on numerous different types of cancer, including lung, brain, oesophageal, and breast cancers.
Awards
Brindle has received numerous awards and recognition for his work, including the European Society for Molecular Imaging (ESMI) Award in 2013 and the Gold Medal of the World Molecular Imaging Society the |
https://en.wikipedia.org/wiki/Von%20Neumann%27s%20elephant | Von Neumann's elephant is a problem in recreational mathematics, consisting of constructing a planar curve in the shape of an elephant from only four fixed parameters. It originated from a discussion between physicists John von Neumann and Enrico Fermi.
History
In a 2004 article in the journal Nature, Freeman Dyson recounts his meeting with Fermi in 1953. Fermi evokes his friend von Neumann who, when asking him how many arbitrary parameters he used for his calculations, replied, "With four parameters I can fit an elephant, and with five I can make him wiggle his trunk." By this he meant that the Fermi simulations relied on too many input parameters, presupposing an overfitting phenomenon.
Solving the problem (defining four complex numbers to draw an elephantine shape) subsequently became an active research subject of recreational mathematics. A 1975 attempt through least-squares function approximation required dozens of terms. The best approximation was found by three physicists in 2010.
Construction
The construction is based on complex Fourier analysis.
The curve found in 2010 is parameterized by:
The four fixed parameters used are complex, with affixes , , , .
The affix point is added to make the eye of the elephant and this value serves as a parameter for the movement of the "trunk".
See also
Epicycloid
Curve fitting
References
External links
"Fitting an Elephant" at the Wolfram Demonstrations Project site
Curves
Recreational mathematics |
https://en.wikipedia.org/wiki/Cyber%20range | Cyber ranges are virtual environments used for cybersecurity, cyberwarfare training, simulation or emulation and development of technologies related to cybersecurity. Their scale can vary drastically, from just a single node to an internet-like network.
See also
National Cyber Range
References
Computer security
Computer network security |
https://en.wikipedia.org/wiki/Version%20history%20for%20TLS/SSL%20support%20in%20web%20browsers | Version history for TLS/SSL support in web browsers tracks the implementation of Transport Layer Security protocol versions in major web browsers.
Notes
References
Transport Layer Security
History of computer networks
History of the Internet |
https://en.wikipedia.org/wiki/Ralph%20Ungermann | Ralph Kelley Ungermann (January 20, 1942 – June 2, 2015) was an American engineer and entrepreneur. He is best known for founding Zilog with Federico Faggin and Ungermann-Bass with Charlie Bass. Due to his work at U-B, he was considered to be a founding father of the data communications industry.
Early life and education
Ralph was born in Provo, Utah on January 20, 1942. When he was 5 years old, his family moved to Santa Paula, California.
At first, Ralph wanted to study law but he changed his idea to study engineering after witnessing the launch of Sputnik 1, the first satellite ever to space. He enrolled at University of California, Berkeley and received a Bachelor's degree in electrical engineering. Then he received a Master's degree in Computer architecture from University of California, Irvine. After college, Ralph started to work at Kodak in Rochester, NY. He then joined Collins Radio in 1967, where he became fascinated with semiconductors and early LAN technology.
1 year before Rockwell International acquired Collins Radio in 1971, Ralph left the company prior to business failure.
Work at Intel
After searching for a company involved in the semiconductor industry, Ralph joined Intel in 1971 under supervision of Federico Faggin. At Intel, he was responsible for microprocessor development and his team developed the USART and the I/O chips.
During the 1973–1974 stock market crash, Ralph and Faggin decided to leave Intel due to low wages and form their own company. At first they planned to be involved in the systems business, but as their departure became public via Electronic News due to Intel's popularity, Exxon reached out and convinced them to keep their dedication in microprocessors.
Work at Zilog
In 1974, Ralph and Faggin founded Zilog, Inc., the first company dedicated to microprocessor production for the personal computer. Together with Faggin, they decide to develop a better competitor to Intel 8080. Exxon became interested in this and decided to in |
https://en.wikipedia.org/wiki/List%20of%20quantum%20logic%20gates | In gate-based quantum computing, various sets of quantum logic gates are commonly used to express quantum operations. The following tables list several unitary quantum logic gates, together with their common name, how they are represented, and some of their properties. Controlled or conjugate transpose (adjoint) versions of some of these gates may not be listed.
Identity gate and global phase
The identity gate is the identity operation , most of the times this gate is not indicated in circuit diagrams, but it is useful when describing mathematical results.
It has been described as being a "wait cycle", and a NOP.
The global phase gate introduces a global phase to the whole qubit quantum state. A quantum state is uniquely defined up to a phase. Because of the Born rule, a phase factor has no effect on a measurement outcome: for any .
Because when the global phase gate is applied to a single qubit in a quantum register, the entire register's global phase is changed.
Also,
These gates can be extended to any number of qubits or qudits.
Clifford qubit gates
This table includes commonly used Clifford gates for qubits.
Other Clifford gates, including higher dimensional ones are not included here but by definition can be generated using and .
Note that if a Clifford gate A is not in the Pauli group, or controlled-A are not in the Clifford gates.
The Clifford set is not a universal quantum gate set.
Non-Clifford qubit gates
Relative phase gates
The phase shift is a family of single-qubit gates that map the basis states and . The probability of measuring a or is unchanged after applying this gate, however it modifies the phase of the quantum state. This is equivalent to tracing a horizontal circle (a line of latitude), or a rotation along the z-axis on the Bloch sphere by radians. A common example is the T gate where (historically known as the gate), the phase gate. Note that some Clifford gates are special cases of the phase shift gate:
The ar |
https://en.wikipedia.org/wiki/Stixel | In computer vision, a stixel (portmanteau of "stick" and "pixel") is a superpixel representation of depth information in an image, in the form of a vertical stick that approximates the closest obstacles within a certain vertical slice of the scene. Introduced in 2009, stixels have applications in robotic navigation and advanced driver-assistance systems, where they can be used to define a representation of robotic environments and traffic scenes with a medium level of abstraction.
Definition
One of the problems of scene understanding in computer vision is to determine horizontal freespace around the camera, where the agent can move, and the vertical obstacles delimiting it. An image can be paired with depth information (produced e.g. from stereo disparity, lidar, or monocular depth estimation), allowing a dense tridimensional reconstruction of the observed scene. One drawback of dense reconstruction is the large amount of data involved, since each pixel in the image is mapped to an element of a point cloud. Vision problems characterised by planar freespace delimited by mostly vertical obstacles, such as traffic scenes or robotic navigation, can benefit from a condensed representation that allows to save memory and processing time.
Stixels are thin vertical rectangles representing a slice of a vertical surface belonging to the closest obstacle in the observed scene. They allow to dramatically reduce the amount of information needed to represent a scene in such problems. A stixel is characterised by three parameters: vertical coordinate of the bottom, height of the stick, and depth. Stixels have fixed width, with each stixel spanning over a certain number of image columns, allowing downsampling of the horizontal image resolution. In the original formulation, each column of the image would contain at most one stixel, and later extensions were developed to allow multiple stixels on each column, allowing to represent multiple objects at different distances.
Stixel e |
https://en.wikipedia.org/wiki/Hydrogen%20evolution%20reaction | Hydrogen evolution reaction (HER) is a chemical reaction that yields H2. The conversion of protons to H2 requires reducing equivalents and usually a catalyst. In nature, HER is catalyzed by hydrogenase enzymes. Commercial electrolyzers typically employ platinum metal as the catalyst. HER is useful for producing hydrogen gas, providing a clean-burning fuel. HER, however, can also be an unwelcome side reaction that competes with other reductions such as nitrogen fixation, or electrochemical reduction of carbon dioxide or chrome plating.
References
Electrolysis
Energy engineering |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.