source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Polynomial%20differential%20form | In algebra, the ring of polynomial differential forms on the standard n-simplex is the differential graded algebra:
Varying n, it determines the simplicial commutative dg algebra:
(each induces the map ).
References
Aldridge Bousfield and V. K. A. M. Gugenheim, §1 and §2 of: On PL De Rham Theory and Rational Homotopy Type, Memoirs of the A. M. S., vol. 179, 1976.
External links
https://ncatlab.org/nlab/show/differential+forms+on+simplices
https://mathoverflow.net/questions/220532/polynomial-differential-forms-on-bg
Differential algebra
Ring theory |
https://en.wikipedia.org/wiki/JSFiddle | JSFiddle is an online IDE service and online community for testing and showcasing user-created and collaborational HTML, CSS and JavaScript code snippets, known as 'fiddles'. It allows for simulated AJAX calls. In 2019, JSFiddle was ranked the second most popular online IDE by the PopularitY of Programming Language (PYPL) index based on the number of times it was searched, directly behind Cloud9 IDE, worldwide and in the USA.
Concept
JSFiddle is an online IDE which is designed to allow users to edit and run HTML, JavaScript, and CSS code on a single page. Its interface is minimalist and split into four main frames, which correspond to editable HTML, JavaScript and CSS fields and a result field which displays the user's project after it is run. Since early on, JSFiddle adopted smart source-code editor with programming features.
As of 2020, JSFiddle uses CodeMirror to support its editable fields, providing multicursors, syntax highlighting, syntax verification (linter), brace matching, auto indentation, autocompletion, code/text folding, Search and Replace to assist web developers in their actions. On the left, a sidebar allows users to integrate external resources such as external CSS stylesheets and external JavaScript libraries. The most popular JavaScript frameworks and CSS frameworks are suggested to users and available via a click.
JSFiddle allows users to publicly save their code an uncapped number of times for free. Each version is saved online at the application's website with an incremental numbered suffix. This allows users to re-access their saved code. Code saved on JSFiddle may also be edited into new versions, shared with other parties, and forked into a new line.
JSFiddle is widely used among web developers to share simple tests and demonstrations. JSFiddle is also widely used on Stack Overflow, the dominant question-answer online forum for the web industry.
History
In 2009, JSFiddle's predecessor, MooShell, was created by Piotr Zalewa as a w |
https://en.wikipedia.org/wiki/Locally%20constant%20sheaf | In algebraic topology, a locally constant sheaf on a topological space X is a sheaf on X such that for each x in X, there is an open neighborhood U of x such that the restriction is a constant sheaf on U. It is also called a local system. When X is a stratified space, a constructible sheaf is roughly a sheaf that is locally constant on each member of the stratification.
A basic example is the orientation sheaf on a manifold since each point of the manifold admits an orientable open neighborhood (while the manifold itself may not be orientable.)
For another example, let , be the sheaf of holomorphic functions on X and given by . Then the kernel of P is a locally constant sheaf on but not constant there (since it has no nonzero global section).
If is a locally constant sheaf of sets on a space X, then each path in X determines a bijection Moreover, two homotopic paths determine the same bijection. Hence, there is the well-defined functor
where is the fundamental groupoid of X: the category whose objects are points of X and whose morphisms are homotopy classes of paths. Moreover, if X is path-connected, locally path-connected and semi-locally simply connected (so X has a universal cover), then every functor is of the above form; i.e., the functor category is equivalent to the category of locally constant sheaves on X.
If X is locally connected, the adjunction between the category of presheaves and bundles restricts to an equivalence between the category of locally constant sheaves and the category of covering spaces of X.
References
External links
https://golem.ph.utexas.edu/category/2010/11/locally_constant_sheaves.html (recommended)
Algebraic topology
Topological spaces |
https://en.wikipedia.org/wiki/Woody%20plant%20encroachment | Woody plant encroachment (also called bush encroachment, shrub encroachment, woody encroachment, bush thickening, or woody plant proliferation) is a natural phenomenon characterised by the increase in density of woody plants, bushes and shrubs, at the expense of the herbaceous layer, grasses and forbs. It predominantly occurs in grasslands, savannas and woodlands and can cause biome shifts from open grasslands and savannas to closed woodlands. The term bush encroachment refers to the expansion of native plants and not the spread of alien invasive species. It is thus defined by plant density, not species. Bush encroachment is often considered an ecological regime shift and can be a symptom of land degradation. The phenomenon is observed across different ecosystems and with different characteristics and intensities globally.
Its causes include land use intensification, such as high grazing pressure and the suppression of wildfires. Climate change is found to be an accelerating factor for woody encroachment. The impact of woody plant encroachment is highly context specific. It is often found to have severe negative consequences on key ecosystem services, especially biodiversity, animal habitat, land productivity and groundwater recharge. Across rangelands, woody encroachment has led to significant declines of productivity, threatening the livelihoods of affected land users. Various countries actively counter woody encroachment, through adapted grassland management practices, controlled fire and mechanical bush thinning.
In some cases, areas affected by woody encroachment are classified as carbon sinks and form part of national greenhouse gas inventories. The carbon sequestration effects of woody plant encroachment are however highly context specific and still insufficiently researched. Depending on rainfall, temperature and soil type, among other factors, woody plant encroachment may either increase or decrease the carbon sequestration potential of a given ecosystem. |
https://en.wikipedia.org/wiki/Google%20Feud | Google Feud is a browser-based trivia game featuring answers pulled from Google. It is based on the American show Family Feud, and is unaffiliated with Google.
History
The game was created in 2013 by American indie developer Justin Hook, a writer for Bob's Burgers on Fox.
Google Feud was demonstrated on @midnight with Chris Hardwick, referenced in the monologue of The Tonight Show Starring Jimmy Fallon.Time declared it "the online game we didn't know we were waiting for".
According to Colin McMillen, a staff software engineer at Google, a very similar game was played internally at Google.
Controversy
Google Feud became the subject of some controversy for promoting the online game Push Trump Off A Cliff Again!, also created by Hook, after celebrities including John Leguizamo and Rosie O'Donnell promoted the game on their Twitter profiles.
Awards
Google Feud won the "People's Voice" Webby Award for Games in 2016.
References
External links
2013 video games
Internet memes introduced in 2013
Browser games
Family Feud
Internet-related controversies
Criticism of Google
Online games
Quiz games
Video games developed in the United States |
https://en.wikipedia.org/wiki/Tone-Lok | Tone-Lok Effects are guitar effects pedals from a (now discontinued) product line, introduced by Ibanez in 1999. In contrast with other guitar pedals, they included a "Lok" feature, engaged for each adjustment by pressing down on its corresponding potentiometer's control knob.
Pedals
Guitar
AP7 Analog Phaser
AW7 Autowah
CF7 Stereo Chorus/Flanger
DE7 Delay/Echo
DS7 Distortion
FZ7 Fuzz
LF7 Lo Fi
PH7 Phaser
PM7 Phase Modulator
SH7 Seventh Heaven
SM7 Smashbox
TC7 Tri Mode Chorus
TS7 Tubescreamer
WD7 Weeping Demon
WD7JR Weeping Demon Junior
Bass
PD7 Phat-Hed Bass Overdrive
SB7 Synthesizer Bass
References
Audio electronics
Signal processing |
https://en.wikipedia.org/wiki/BY1 | BY1 is a taxonomically unidentified basidiomycete fungus. ITS sequencing has placed it in the Russulales and is referred to as a stereaceous basidiomycete. Chemotaxonomically supporting its placement in this group, it produces fomannoxins and vibralactones. The fungus' mycelia were isolated from dead aspen in Minnesota, USA. It is presumed to decompose wood by white rot.
The mycelium can be grown on YMG agar at room temperature (4 g/L d-glucose, 4 g/L yeast extract, 10 g/L malt extract, 18 g/L agar). The culture can be obtained at the Jena Microbial Resource Collection registration number SF:011241.
When the mycelia is wounded by scalpel damage, a yellow pigment appears. These pigments were identified as polyenes by characteristic UV-Vis spectra. The structures of the polyenes were determined by NMR. They were identified as 1) (3Z,5E,7E,9E,11E,13Z,15E,17E)-18-methyl-19-oxoicosa-3,5,7,9,11,13,15,17-octaenoic acid; and 2) (3E,5Z,7E,9E,11E,13E,15Z,17E,19E)-20-methyl-21-oxodocosa-3,5,7,9,11,13,15,17,19-nonaenoic acid. The shorter polyene was found to be highly toxic against Drosophila melanogaster larvae. Feeding experiments with [1-13C]acetate revealed a polyketidic origin, and feeding experiments with l-[methyl-13C]methionine revealed methyl branching likely via S-adenosyl-l-methionine-dependent methyltransferase(s). Additionally, MALDI-TOF imaging at the mycelial wounding site identified these poylenes as localized at the wounded area. Two putative alleles of polyketide genes were identified, referred to as PPS1 and PPS2. QRT-PCR monitoring of PPS1 showed up-regulation of this gene after mycelial wounding. The domain architecture was the following for PPS1: KS, AT, DH, MT, KR, ACP, and thus was classified as a highly-reducing polyketide synthase (HR-PKS). This was the first characterized HR-PKS of basidiomycetic origin and forms its own clade in comparison to ascomycete HR-PKSs, bacterial polyene-forming PKSs, basidiomycete non-reducing PKSs, and ascomycete non-red |
https://en.wikipedia.org/wiki/17776 | 17776 (also known as What Football Will Look Like in the Future) is a serialized speculative fiction multimedia narrative by Jon Bois, published online through SB Nation. Set in the distant future in which all humans have become immortal and infertile, the series follows three sapient space probes that watch humanity play an evolved form of American football in which games can be played for millennia over distances of thousands of miles. The series debuted on July 5, 2017, and new chapters were published daily until the series concluded with its twenty-fifth chapter on July 15, 2017.
Bois began developing 17776 in 2016. Because the story incorporates text, animated GIFs, still images, and videos hosted on YouTube, new tools were developed to allow it to be hosted efficiently on the SB Nation website. The work explores themes of consciousness, hope, despair, and why humans play sports. 17776 was well received by critics, who praised it for its innovative use of its medium and for the depth of emotion it evoked. In 2018, the story won a National Magazine Award for Digital Innovation and was longlisted for both the Hugo Awards for Best Novella and Best Graphic Story.
It is followed by a sequel series: 20020, released from September to October 2020, which Bois intends to follow up with a further series entitled 20021. The sequel series follows a 111-team game of college football on fields spanning 236 million yards across the United States.
Premise
The story takes place on a future Earth where humans stopped dying, aging, and being born in 2026. All social ills were subsequently eliminated, and technology preventing humans from any injury was developed. In the United States, American football evolved to include new rules, including those that allow fields thousands of miles long, hundreds of in-game players, and games millennia long. Over time, computers gained sentience due to constant exposure to broadcast human data.
By the year 17776, the space probe Pioneer 9 |
https://en.wikipedia.org/wiki/Differential%20testing | Differential testing, also known as differential fuzzing, is a popular software testing technique that attempts to detect bugs, by providing the same input to a series of similar applications (or to different implementations of the same application), and observing differences in their execution. Differential testing complements traditional software testing, because it is well-suited to find semantic or logic bugs that do not exhibit explicit erroneous behaviors like crashes or assertion failures. Differential testing is sometimes called back-to-back testing.
Differential testing finds semantic bugs by using different implementations of the same functionality as cross-referencing oracles, pinpointing differences in their outputs over the same input: any discrepancy between the program behaviors on the same input is marked as a potential bug.
Application domains
Differential testing has been used to find semantic bugs successfully in diverse domains like SSL/TLS implementations, C compilers, JVM implementations, Web application firewalls, security policies for APIs, and antivirus software. Differential testing has also been used for automated fingerprint generation from different network protocol implementations.
Input generation
Unguided
Unguided differential testing tools generate test inputs independently across iterations without considering the test program’s behavior on past inputs. Such an input generation process does not use any information from past inputs and essentially creates new inputs at random from a prohibitively large input space. This can make the testing process highly inefficient, since large numbers of inputs need to be generated to find a single bug.
An example of a differential testing system that performs unguided input generation is "Frankencerts". This work synthesizes Frankencerts by randomly combining parts of real certificates. It uses syntactically valid certificates to test for semantic violations of SSL/TLS certificate valid |
https://en.wikipedia.org/wiki/Tony%20Stark%20%28Marvel%20Cinematic%20Universe%29 | Anthony Edward Stark is a fictional character primarily portrayed by Robert Downey Jr. in the Marvel Cinematic Universe (MCU) media franchise—based on the Marvel Comics character of the same name—commonly known by his alias, Iron Man. Stark is initially depicted as an industrialist, genius inventor, and playboy who is CEO of Stark Industries. Initially the chief weapons manufacturer for the U.S. military, he has a change of heart and redirects his technical knowledge into the creation of mechanized suits of armor which he uses to defend Earth.
Stark becomes a founding member and eventual leader of the Avengers. Following his failed Ultron Program, the internal conflict within the Avengers due to the Sokovia Accords, and Thanos successfully erasing half of all life in the Blip, Stark retires, marries Pepper Potts, and they have a daughter named Morgan. However, Stark rejoins the Avengers on a final mission to undo Thanos' actions. He engineers a time travel device and the Avengers successfully restore trillions of lives across the universe. However, Stark inevitably sacrifices his life to defeat Thanos and his army. Stark chooses Peter Parker as a successor.
Stark is one of the central figures of the MCU, having appeared in eleven films as of 2023. The character and Downey's performance have been credited with helping to cement the MCU as a multi-billion-dollar franchise, with Stark's evolution often being considered the defining arc of the series.
Alternate versions of Stark from within the MCU multiverse appear in the animated series What If...? (2021), voiced by Mick Wingert.
Fictional character biography
Early life
Anthony Edward "Tony" Stark was born on May 29, 1970, in Manhattan, New York to Howard Stark, a famous genius inventor and businessman, and Maria Stark, a socialite and philanthropist. Growing up under the eye of family butler Edwin Jarvis, his life was characterized by a cold and affectionless relationship with his father. Seeing that his son cou |
https://en.wikipedia.org/wiki/Random%20sequential%20adsorption | Random sequential adsorption (RSA) refers to a process where particles are randomly introduced in a system, and if they do not overlap any previously adsorbed particle, they adsorb and remain fixed for the rest of the process. RSA can be carried out in computer simulation, in a mathematical analysis, or in experiments. It was first studied by one-dimensional models: the attachment of pendant groups in a polymer chain by Paul Flory, and the car-parking problem by Alfréd Rényi. Other early works include those of Benjamin Widom. In two and higher dimensions many systems have been studied by computer simulation, including in 2d, disks, randomly oriented squares and rectangles, aligned squares and rectangles, various other shapes, etc.
An important result is the maximum surface coverage, called the saturation coverage or the packing fraction. On this page we list that coverage for many systems.
The blocking process has been studied in detail in terms of the random sequential adsorption (RSA) model. The simplest RSA model related to deposition of spherical particles considers irreversible adsorption of circular disks. One disk after another is placed randomly at a surface. Once a disk is placed, it sticks at the same spot, and cannot be removed. When an attempt to deposit a disk would result in an overlap with an already deposited disk, this attempt is rejected. Within this model, the surface is initially filled rapidly, but the more one approaches saturation the slower the surface is being filled. Within the RSA model, saturation is sometimes referred to as jamming. For circular disks, saturation occurs at a coverage of 0.547. When the depositing particles are polydisperse, much higher surface coverage can be reached, since the small particles will be able to deposit into the holes in between the larger deposited particles. On the other hand, rod like particles may lead to much smaller coverage, since a few misaligned rods may block a large portion of the surface.
For |
https://en.wikipedia.org/wiki/Recording%20studio%20as%20an%20instrument | In music production, the recording studio is often treated as a musical instrument when it plays a significant role in the composition of music. Sometimes called "playing the studio", the approach is typically embodied by artists or producers who favor the creative use of studio technology in record production, as opposed to simply documenting live performances in studio. Techniques include the incorporation of non-musical sounds, overdubbing, tape edits, sound synthesis, audio signal processing, and combining segmented performances (takes) into a unified whole.
Composers have exploited the potential of multitrack recording from the time the technology was first introduced. Before the late 1940s, musical recordings were typically created with the idea of presenting a faithful rendition of a real-life performance. Following the advent of three-track tape recorders in the mid-1950s, recording spaces became more accustomed for in-studio composition. By the late 1960s, in-studio composition had become standard practice, and has remained as such into the 21st century.
Despite the widespread changes that have led to more compact recording set-ups, individual components such as digital audio workstations (DAW) are still colloquially referred to as "the studio".
Definitions
"Playing the studio" is equivalent to 'in-studio composition', meaning writing and production occur concurrently. Definitions of the specific criterion of a "musical instrument" vary, and it is unclear whether the "studio as instrument" concept extends to using multi-track recording simply to facilitate the basic music writing process. According to academic Adam Bell, some proposed definitions may be consistent with music produced in a recording studio, but not with music that relies heavily on digital audio workstations (DAW). Various music educators alluded to "using the studio as a musical instrument" in books published as early as the late 1960s.
Rock historian Doyle Greene defines "studio as c |
https://en.wikipedia.org/wiki/IEC-P27-1 | IEC-P27-1 (or ISO IR-143) is an 8-bit character set developed by the IEC. When combined with the ISO/IEC 646 character set, this includes all characters required to print the symbols defined in IEC 60027-1.
Character set
References
Character sets |
https://en.wikipedia.org/wiki/Cyphal | Cyphal is a lightweight protocol designed for reliable intra-vehicle communications using various communications transports, originally destined for CAN bus, but targeting various network types in subsequent revisions. OpenCyphal is an open-source project that aims to provide MIT-licensed implementations of the Cyphal protocol. The project was known as UAVCAN (Uncomplicated Application-level Vehicular Computing and Networking) prior to rebranding in March 2022.
History
The first RFC broadly outlining the general ideas that would later form the core design principles of Cyphal (branded UAVCAN at the time) was published in early 2014. It was a response to the perceived lack of adequate technology that could facilitate robust real-time intra-vehicular data exchange between distributed components of modern intelligent vehicles (primarily unmanned aircraft).
Since the original RFC, the protocol has been through three major design iterations, which culminated in the release of the first long-term stable revision in 2020 (6 years later) labelled UAVCAN v1.0. In the meantime, the protocol has been deployed in numerous diverse systems including unmanned aerial vehicles, spacecraft, underwater robots, racing cars, general robotic systems, and micromobility vehicles. In 2022, the protocol was rebranded as Cyphal.
Cyphal is positioned by its developers as a highly deterministic, safety-oriented alternative to high-level publish-subscribe frameworks such as DDS or the computation graph of ROS, which is sufficiently compact and simple to be usable in deeply embedded high-integrity applications. Cyphal has been shown to be usable with bare metal microcontrollers equipped with as little as 32K ROM and 8K RAM.
The protocol is open and can be reused freely without approval or licensing fees. The development of the core standard and its reference implementations is conducted in an open manner, coordinated via the public discussion forum.
As of 2020, the project is supported by sev |
https://en.wikipedia.org/wiki/Trophic%20coherence | Trophic coherence is a property of directed graphs (or directed networks). It is based on the concept of trophic levels used mainly in ecology, but which can be defined for directed networks in general and provides a measure of hierarchical structure among nodes. Trophic coherence is the tendency of nodes to fall into well-defined trophic levels. It has been related to several structural and dynamical properties of directed networks, including the prevalence of cycles and network motifs, ecological stability, intervality, and spreading processes like epidemics and neuronal avalanches.
Definition
Consider a directed network defined by
the adjacency matrix .
Each node can be assigned a trophic level according to
where is 's in-degree, and nodes
with (basal nodes) have by convention.
Each edge has a trophic difference associated, defined as .
The trophic coherence of the network is a measure of how tightly peaked the distribution of trophic distances,
,
is around its mean value, which is always .
This can be captured by an incoherence parameter ,
equal to the standard deviation of :
where is the number of edges in the network.
The figure shows two networks which differ in their trophic coherence. The position of the nodes on the vertical axis corresponds to their trophic level. In the network on the left, nodes fall into distinct (integer) trophic levels, so the network is maximally coherent .
In the one on the right, many of the nodes have fractional trophic levels, and the network is more incoherent .
Trophic coherence in nature
The degree to which empirical networks are trophically coherent (or incoherent) can be investigated by comparison with a null model.
This is provided by the basal ensemble, which comprises networks in which all non-basal nodes have the same proportion of basal nodes
for in-neighbours. Expected values in this ensemble converge to those of the widely used configuration ensemble in the limit , (with and the numbers of no |
https://en.wikipedia.org/wiki/INIS%20character%20set | INIS is a 7-bit subset of ASCII developed by the International Nuclear Information System (INIS). It has MIB 51 and is also known as iso-ir-49 and csISO49INIS.
Character set
See also
ISO 646 § Variant comparison chart
INIS-8
References
Character sets
International Atomic Energy Agency |
https://en.wikipedia.org/wiki/Shock%20synthesis | Shock synthesis is the process of complex organic chemical creation through high velocity impact on simple amino acids, theorized to take place when a comet strikes a planetary body, or through the shock-wave created by a thunder clap. Hyper-velocity impact shock of a typical comet ice mixture produced several amino acids after hydrolysis. These include equal amounts of D- and L-alanine, and the non-protein amino acids α-aminoisobutyric acid and isovaline as well as their precursors.
References
Origin of life
Amino acids |
https://en.wikipedia.org/wiki/INIS-8 | INIS-8 is an 8-bit character encoding developed by the International Nuclear Information System (INIS). It is an 8-bit extension of the 7-bit INIS character set (itself a subset of ASCII), adding a G1 set, and has MIB 52. It is also known as iso-ir-50 (after the ISO 2022 registration of its G1 set) and csISO50INIS8.
Character set
ISO-IR-51
ISO-IR-51, "INIS Cyrillic Extension", is an alternative G1 set for 8-bit INIS, supporting KOI-8 encoded Russian alphabet letters, at the expense of the superscript and subscript digits.
See also
INIS character set
Footnotes
References
Character sets
International Atomic Energy Agency |
https://en.wikipedia.org/wiki/ARP%20cache | An ARP cache is a collection of Address Resolution Protocol entries (mostly dynamic) that are created when an IP address is resolved to a MAC address (so the computer can effectively communicate with the IP address).
An ARP cache has the disadvantage of potentially being used by hackers and cyber attackers (an ARP cache poisoning attack). An ARP cache helps the attackers hide behind a fake IP address. Beyond the fact that ARP caches may help attackers, it may also prevent the attacks by "distinguish[ing] between low level IP and IP based vulnerabilities".
References
Address Resolution Protocol |
https://en.wikipedia.org/wiki/Komar%20superpotential | In general relativity, the Komar superpotential, corresponding to the invariance of the Hilbert–Einstein Lagrangian , is the tensor density:
associated with a vector field , and where denotes covariant derivative with respect to the Levi-Civita connection.
The Komar two-form:
where denotes interior product, generalizes to an arbitrary vector field the so-called above Komar superpotential, which was originally derived for timelike Killing vector fields.
Komar superpotential is affected by the anomalous factor problem: In fact, when computed, for example, on the Kerr–Newman solution, produces the correct angular momentum, but just one-half of the expected mass.
See also
Superpotential
Einstein–Hilbert action
Komar mass
Tensor calculus
Christoffel symbols
Riemann curvature tensor
Notes
References
Equations of physics
Tensors
General relativity
Potentials |
https://en.wikipedia.org/wiki/Sixth%20power | In arithmetic and algebra the sixth power of a number n is the result of multiplying six instances of n together. So:
.
Sixth powers can be formed by multiplying a number by its fifth power, multiplying the square of a number by its fourth power, by cubing a square, or by squaring a cube.
The sequence of sixth powers of integers is:
0, 1, 64, 729, 4096, 15625, 46656, 117649, 262144, 531441, 1000000, 1771561, 2985984, 4826809, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64000000, 85766121, 113379904, 148035889, 191102976, 244140625, 308915776, 387420489, 481890304, ...
They include the significant decimal numbers 106 (a million), 1006 (a short-scale trillion and long-scale billion), 10006 (a Quintillion and a long-scale trillion) and so on.
Squares and cubes
The sixth powers of integers can be characterized as the numbers that are simultaneously squares and cubes.
In this way, they are analogous to two other classes of figurate numbers: the square triangular numbers, which are simultaneously square and triangular,
and the solutions to the cannonball problem, which are simultaneously square and square-pyramidal.
Because of their connection to squares and cubes, sixth powers play an important role in the study of the Mordell curves, which are elliptic curves of the form
When is divisible by a sixth power, this equation can be reduced by dividing by that power to give a simpler equation of the same form.
A well-known result in number theory, proven by Rudolf Fueter and Louis J. Mordell, states that, when is an integer that is not divisible by a sixth power (other than the exceptional cases and ), this equation either has no rational solutions with both and nonzero or infinitely many of them.
In the archaic notation of Robert Recorde, the sixth power of a number was called the "zenzicube", meaning the square of a cube. Similarly, the notation for sixth powers used in 12th century Indian mathematics by Bhāskara II also called them either the s |
https://en.wikipedia.org/wiki/Seventh%20power | In arithmetic and algebra the seventh power of a number n is the result of multiplying seven instances of n together. So:
.
Seventh powers are also formed by multiplying a number by its sixth power, the square of a number by its fifth power, or the cube of a number by its fourth power.
The sequence of seventh powers of integers is:
0, 1, 128, 2187, 16384, 78125, 279936, 823543, 2097152, 4782969, 10000000, 19487171, 35831808, 62748517, 105413504, 170859375, 268435456, 410338673, 612220032, 893871739, 1280000000, 1801088541, 2494357888, 3404825447, 4586471424, 6103515625, 8031810176, ...
In the archaic notation of Robert Recorde, the seventh power of a number was called the "second sursolid".
Properties
Leonard Eugene Dickson studied generalizations of Waring's problem for seventh powers, showing that every non-negative integer can be represented as a sum of at most 258 non-negative seventh powers (17 is 1, and 27 is 128). All but finitely many positive integers can be expressed more simply as the sum of at most 46 seventh powers. If powers of negative integers are allowed, only 12 powers are required.
The smallest number that can be represented in two different ways as a sum of four positive seventh powers is 2056364173794800.
The smallest seventh power that can be represented as a sum of eight distinct seventh powers is:
The two known examples of a seventh power expressible as the sum of seven seventh powers are
(M. Dodrill, 1999);
and
(Maurice Blondot, 11/14/2000);
any example with fewer terms in the sum would be a counterexample to Euler's sum of powers conjecture, which is currently only known to be false for the powers 4 and 5.
See also
Eighth power
Sixth power
Fifth power (algebra)
Fourth power
Cube (algebra)
Square (algebra)
References
Integers
Number theory
Elementary arithmetic
Integer sequences
Unary operations
Figurate numbers |
https://en.wikipedia.org/wiki/Video%20Multimethod%20Assessment%20Fusion | Video Multimethod Assessment Fusion (VMAF) is an objective full-reference video quality metric developed by Netflix in cooperation with the University of Southern California, The IPI/LS2N lab Nantes Université, and the Laboratory for Image and Video Engineering (LIVE) at The University of Texas at Austin. It predicts subjective video quality based on a reference and distorted video sequence. The metric can be used to evaluate the quality of different video codecs, encoders, encoding settings, or transmission variants.
History
The metric is based on initial work from the group of Professor C.-C. Jay Kuo at the University of Southern California. Here, the applicability of fusion of different video quality metrics using support vector machines (SVM) has been investigated, leading to a "FVQA (Fusion-based Video Quality Assessment) Index" that has been shown to outperform existing image quality metrics on a subjective video quality database.
The method has been further developed in cooperation with Netflix, using different subjective video datasets, including a Netflix-owned dataset ("NFLX"). Subsequently renamed "Video Multimethod Assessment Fusion", it was announced on the Netflix TechBlog in June 2016 and version 0.3.1 of the reference implementation was made available under a permissive open-source license.
In 2017, the metric was updated to support a custom model that includes an adaptation for cellular phone screen viewing, generating higher quality scores for the same input material. In 2018, a model that predicts the quality of up to 4K resolution content was released. The datasets on which these models were trained have not been made available to the public.
In 2021, a Technology and Engineering Emmy Award was awarded to Beamr, Netflix, University of Southern California, University of Nantes, The University of Texas at Austin, SSIMWAVE, Disney, Google, Brightcove and ATEME for the Development of Open Perceptual Metrics for Video Encoding Optimization. It w |
https://en.wikipedia.org/wiki/OT1%20encoding | OT1 (aka TeX text) is a 7-bit TeX encoding developed by Donald E. Knuth.
Character set
See also
OML encoding
OMS encoding
References
Character sets |
https://en.wikipedia.org/wiki/International%20System%20for%20Human%20Cytogenomic%20Nomenclature | The International System for Human Cytogenomic Nomenclature (previously International System for Human Cytogenetic Nomenclature), ISCN in short, is an international standard for human chromosome nomenclature, which includes band names, symbols and abbreviated terms used in the description of human chromosome and chromosome abnormalities.
The ISCN has been used as the central reference among cytogeneticists since 1960.
Abbreviations of this system include a minus sign (-) for chromosome deletions, and del for deletions of parts of a chromosome.
Revision history
ISCN (2020). S. Karger Publishing.
ISCN (2016). S. Karger Publishing.
ISCN (2013). S. Karger Publishing.
ISCN (2009). S. Karger Publishing.
ISCN (2005). S. Karger Publishing.
ISCN (1995). S. Karger Publishing.
ISCN (1991). S. Karger Publishing.
ISCN (1985). S. Karger Publishing.
ISCN (1981). S. Karger Publishing.
ISCN (1978). S. Karger Publishing.
Paris Conference (1971): "Standardization in Human Cytogenetics." (PDF) Birth Defects: Original Article Series, Vol 8, No 7 (The National Foundation, New York 1972)
Chicago Conference (1966): "Standardization in Human Cytogenetics." Birth Defects: Original Article Series, Vol 2, No 2 (The National Foundation, New York 1966).
London Conference (1963): "London Conference on the Normal Human Karyotype." Cytogenetics 2:264–268 (1963)
Denver Conference (1960): "A proposed standard system of nomenclature of human mitotic chromosomes." The Lancet 275.7133 (1960): 1063-1065.
See also
Locus (genetics)
Cytogenetic notation
References
External links
About the ISCN recommendations - Human Genome Variation Society
Cytogenetics
Biological nomenclature |
https://en.wikipedia.org/wiki/LY1%20encoding | LY1 (Y&Y 256 glyph encoding) is an 8-bit TeX encoding developed by Berthold Horn.
Character set
References
Character sets |
https://en.wikipedia.org/wiki/Chip-firing%20game | The chip-firing game is a one-player game on a graph which was invented around 1983 and since has become an important part of the study of structural combinatorics.
Each vertex has the number of "chips" indicated by its state variable. On each firing, a vertex is selected and one of its chips is transferred to each neighbour (vertex it shares an edge with). The number of chips on each vertex cannot be negative. The game ends when no firing is possible.
Definition
Let the finite graph G be connected and loopless, with vertices V = {1, 2, . . . , n}. Let deg(v) be the degree of a vertex, and e(v,w) the number of edges between vertices v and w. A configuration or state of the game is defined by assigning each vertex a nonnegative integer s(v), representing the number of chips on this vertex. A move starts with selecting a vertex w which has at least as many chips as its degree: s(w) ≥ deg(w). The vertex w is fired, moving one chip from w along each incident edge to a neighbouring vertex, producing a new configuration defined by:and for v ≠ w, A state in which no further firing is possible is a stable state. Starting from an initial configuration, the game proceeds with the following results (on a connected graph).
If the number of chips is less than the number of edges, the game is always finite, reaching a stable state.
If each vertex has fewer chips than its degree, the game is finite.
If the number of chips is at least the number of edges, the game can be infinite, never reaching a stable state, for an appropriately chosen initial configuration.
If the number of chips is more than twice the number of edges minus the number of vertices, the game is always infinite.
For finite chip-firing games, the possible orders of firing events can be described by an antimatroid. It follows from the general properties of antimatroids that the number of times each vertex fires, and the eventual stable state, do not depend on the order of firing events.
Dollar games
Some |
https://en.wikipedia.org/wiki/Dottie%20number | In mathematics, the Dottie number is a constant that is the unique real root of the equation
,
where the argument of is in radians.
The decimal expansion of the Dottie number is .
Since is decreasing and its derivative is non-zero at , it only crosses zero at one point. This implies that the equation has only one real solution. It is the single real-valued fixed point of the cosine function and is a nontrivial example of a universal attracting fixed point. It is also a transcendental number because of the Lindemann-Weierstrass theorem. The generalised case for a complex variable has infinitely many roots, but unlike the Dottie number, they are not attracting fixed points.
Using the Taylor series of the inverse of at (or equivalently, the Lagrange inversion theorem), the Dottie number can be expressed as the infinite series where each is a rational number defined for odd n as
The name of the constant originates from a professor of French named Dottie who observed the number by repeatedly pressing the cosine button on her calculator.
If a calculator is set to take angles in degrees, the sequence of numbers will instead converge to , the root of .
Closed form
The Dottie number can be expressed as
where is the inverse regularized Beta function. This value can be obtained using Kepler's equation.
In Microsoft Excel and LibreOffice Calc spreadsheets, the Dottie number can be expressed in closed form as . In the Mathematica computer algebra system, the Dottie number is .
Integral representations
Dottie number can be represented as
.
Another integral representation:
Notes
References
Mathematical constants
Real transcendental numbers
Fixed points (mathematics)
External links |
https://en.wikipedia.org/wiki/Chandrasekhar%27s%20H-function | In atmospheric radiation, Chandrasekhar's H-function appears as the solutions of problems involving scattering, introduced by the Indian American astrophysicist Subrahmanyan Chandrasekhar. The Chandrasekhar's H-function defined in the interval , satisfies the following nonlinear integral equation
where the characteristic function is an even polynomial in satisfying the following condition
.
If the equality is satisfied in the above condition, it is called conservative case, otherwise non-conservative. Albedo is given by . An alternate form which would be more useful in calculating the H function numerically by iteration was derived by Chandrasekhar as,
.
In conservative case, the above equation reduces to
.
Approximation
The H function can be approximated up to an order as
where are the zeros of Legendre polynomials and are the positive, non vanishing roots of the associated characteristic equation
where are the quadrature weights given by
Explicit solution in the complex plane
In complex variable the H equation is
then for , a unique solution is given by
where the imaginary part of the function can vanish if is real i.e., . Then we have
The above solution is unique and bounded in the interval for conservative cases. In non-conservative cases, if the equation admits the roots , then there is a further solution given by
Properties
. For conservative case, this reduces to .
. For conservative case, this reduces to .
If the characteristic function is , where are two constants(have to satisfy ) and if is the nth moment of the H function, then we have
and
See also
Chandrasekhar's X- and Y-function
External links
MATLAB function to calculate the H function https://www.mathworks.com/matlabcentral/fileexchange/29333-chandrasekhar-s-h-function
References
Special functions
Integral equations
Scattering
Scattering, absorption and radiative transfer (optics) |
https://en.wikipedia.org/wiki/Apple%20II%20character%20set | Apple II text mode uses the 7-bit ASCII (us-ascii) character set. The high-bit is set to display in normal mode on the 40x24 text screen.
Character sets
Apple II / Apple II plus
The original Signetics 2513 character generator chip has 64 glyphs for upper case, numbers, symbols, and punctuation characters. Each 5x7 pixel bitmap matrix is displayed in a 7x8 character cell on the text screen. The 64 characters can be displayed in INVERSE in the range $00 to $3F, FLASHing in the range $40 to $7F, and NORMAL mode in the range $80 to $FF. Normal mode characters are repeated in the $80 to $FF range.
To display lowercase letters, applications can run in the graphics modes and use custom fonts, rather than running in text mode using the font in ROM.
Apple IIe
Apple IIc
Apple IIc alternate
Apple IIGS
Apple II MouseText character set
References
External links
Typography in 8 bits: System fonts
Video ROMs
Character sets
Apple II computers |
https://en.wikipedia.org/wiki/RigExpert | Rig Expert Ukraine Ltd is a manufacturer of ham and PMR Two-way radio RF antenna analysis and antenna tuning equipment. The company was founded in 2003 and is headquartered in Kyiv, Ukraine.
Current products
The AA-30, AA-54 & AA-170 are almost the same product except for the frequency range. Similarly, the AA-600, AA-1000 & AA-1400 are the same product except for the different frequency range.
See also
Antenna analyzer
Antenna tuner
Impedance matching
References
External links
Ukraine:
USA: (website has been closed, May 2022)
Canada:
UK:
Electrical circuits
Radio electronics
Impedance measurements
Electronic test equipment manufacturers |
https://en.wikipedia.org/wiki/Hunza%20diet | The Hunza cuisine also called the Burusho cuisine () consists of a series of selective food and drink intake practiced by the Burusho people (also called the Hunza people) of northern Pakistan. Alternative medicine and natural health advocates have argued without providing any scientific evidence that the Hunza diet can increase longevity to 120 years. The diet mostly consists of raw food including nuts, fresh vegetables, dry vegetables, mint, fruits and seeds added with yogurt. The cooked meal, daal included with chappati, is included for dinner.
Longevity myth
In the 1930s, Swiss-German physician Ralph Bircher conducted research on the Hunza diet. In his book about the Hunza, Jay Hoffman argued that, by the ratio to cats, dogs and horses, humans should live up to 120 to 150 years, and argues the Hunza diet to be the key to this longevity. Such ideas also promoted by natural health advocates have been discredited. There is no reliable documentation validating the age of alleged Hunza supercentenarians.
In 2005, the Encyclopedia of World Geography stated that "to date there is no credible evidence that determines that the Hunzakut diet of old, not to mention the current diet of the past four decades, contributes to longevity."
Another myth associated with the Hunza people is that because their diet is alleged to be high in apricot seeds they are free from disease. This has proven to be untrue as medical scientists have found that the Hunzas suffer from a variety of disease including cancer.
See also
Longevity myths
Pakistani cuisine
References
Further reading
Kinji Imanishi. (1963). Personality and Health in Hunza Valley. Kyoto University.
Gerontology
Hunza
Longevity myths
Nutrient-rich, low calorie diets
Pakistani cuisine |
https://en.wikipedia.org/wiki/IEEE%20Std%20260.1-2004 | IEEE Std 260.1-2004 was a standard from the Institute of Electrical and Electronics Engineers that provided standard letter symbols for units of measurement for use in all applications in multiple contexts. It has been withdrawn.
It covers primarily SI units and customary inch–pound units. The symbols are sorted in alphabetical order of name from ampere (symbol A) to zetta (symbol Z), including barrel (symbol bbl), bit (symbol b), foot (symbol ft), inch (symbol in), microinch (symbol μin), kibibyte (symbol KiB) kilowatthour (symbol kWh), quart (symbol qt), slug (symbol slug) and year (symbol a). In some cases the same symbol is used for different units. Examples are the symbols B (for bel and byte), Gb (for gigabit and gilbert), L (for liter and lambert) and rad (for rad and radian).
See also
ISO 80000
References
IEEE standards
Units of measurement |
https://en.wikipedia.org/wiki/KOI8-B | KOI8-B is the informal name for an 8-bit Roman / Cyrillic character set constituting the common subset of the major KOI-8 variants (KOI8-R, KOI8-U, KOI8-RU, KOI8-E, KOI8-F). Accordingly, it is closely related to KOI8-R, but defines only the letter subset in the upper half. As such it was implemented by some font vendors for PC Unixes like Xenix in the late 1980s.
Character set
The following table shows the KOI8-B encoding. Each character is shown with its equivalent Unicode code point.
See also
KOI character encodings
References
External links
http://czyborra.com/charsets/koi8-b.txt.gz
http://czyborra.com/charsets/koi8-b.bdf.gz
Character sets
Computing in the Soviet Union |
https://en.wikipedia.org/wiki/Workshop%20on%20Numerical%20Ranges%20and%20Numerical%20Radii | Workshop on Numerical Ranges and Numerical Radii (WONRA) is a biennial workshop series on numerical ranges and numerical radii which began in 1992.
About
Numerical ranges and numerical radii are useful in the study of matrix and operator theory.
These topics have applications in many subjects in pure and applied mathematics, such as
quadratic forms, Banach spaces, dilation theory, control theory, numerical analysis, quantum information science.
History
In the early 1970s, numerical range workshops were organized by Frank Bonsall and John Duncan. More activities were started in early 1990s, including the biennial workshop series, which began in 1992,
and special issues devoted to this workshop were published.
Workshops
Symposium in conferences
References
External links
WONRA 2008 – Williamsburg, VA, USA
WONRA 2010 – Krakow, Poland
WONRA 2012 – Kaohsiung, Taiwan
WONRA 2014 – Sanya, China
WONRA 2016 – Taipei, Taiwan
WONRA 2018 – Munich, Germany
WONRA 2019 - Kawagoe, Japan
WONRA 2023 - Coimbra, Portugal
Mathematics conferences
Matrix theory
Operator theory
Functional analysis
Mathematical analysis |
https://en.wikipedia.org/wiki/Jean-Fran%C3%A7ois%20Quint | Jean-François Quint is a French mathematician, specializing in dynamical systems theory for homogeneous spaces.
He studied at the École normale supérieure de Lyon and then received his Ph.D. from École Normale Supérieure (ENS) in Paris under Yves Benoist with Thèse de Doctorat: Sous-groupes discrets des groupes de Lie semi-simples réels et p-adiques.
In 2002 he joined the faculty of the Institut Camille Jordan as Chargé de recherche of the Centre national de la recherche scientifique (CNRS). In 2005 he joined the staff working on "Ergodic theory and dynamics systems" of Laboratoire Analyse, Géométrie et Applications (LAGA) at the Institut Galilée of the University of Paris 13. Since 2012 he has worked as CNRS Directeur de recherche at the University of Bordeaux.
In 2011, Yves Benoist and Jean-François Quint received the Clay Research Award for their collaborative research (and Jonathan Pila also received the 2011 Clay Research Award for unrelated research).
Selected publications
Mesures de Patterson-Sullivan en rang supérieur. Geom. Funct. Anal. 12 (2002), no. 4, 776–809.
with Benoist: Mesures stationnaires et fermés invariants des espaces homogènes, Parts 1,2, Comptes Rendus Mathématiques, vol. 347, 2009, pp. 9–13, vol. 349, 2011, pp. 341–345; and Annals of Mathematics, vol. 174, 2011, pp. 1111–1162
with Benoist: Random walks on finite volume homogeneous spaces, Inventiones Mathematicae, vol. 187, 2012, pp. 37–59
with Benoist: Stationary measures and invariant subsets of homogeneous spaces (II). J. Amer. Math. Soc. 26 (2013), no. 3, 659–734.
with Benoist: Stationary measures and invariant subsets of homogeneous spaces (III). Ann. of Math. (2) 178 (2013), no. 3, 1017–1059.
with Benoist:
References
External links
Jean-François Quint - Institut de Mathématiques de Bordeaux website
Jean-François Quint - 1/6 Mesures stationnaires et fermés invariants des espaces homogènes, YouTube
Jean-François Quint - 2/6 Mesures stationnaires et fermés invariants de |
https://en.wikipedia.org/wiki/Explainable%20artificial%20intelligence | Explainable AI (XAI), often known as Interpretable AI, or Explainable Machine Learning (XML), either refers to an AI system over which it is possible for humans to retain intellectual oversight, or to the methods to achieve this. The main focus is usually on the reasoning behind the decisions or predictions made by the AI which are made more understandable and transparent. XAI counters the "black box" tendency of machine learning, where even the AI's designers cannot explain why it arrived at a specific decision.
XAI hopes to help users of AI-powered systems perform more effectively by improving their understanding of how those systems reason. XAI may be an implementation of the social right to explanation. Even if there is no such legal right or regulatory requirement, XAI can improve the user experience of a product or service by helping end users trust that the AI is making good decisions. XAI aims to explain what has been done, what is being done, and what will be done next, and to unveil which information these actions are based on. This makes it possible to confirm existing knowledge, challenge existing knowledge, and generate new assumptions.
Machine learning (ML) algorithms used in AI can be categorized as white-box or black-box. White-box models provide results that are understandable to experts in the domain. Black-box models, on the other hand, are extremely hard to explain and can hardly be understood even by domain experts. XAI algorithms follow the three principles of transparency, interpretability, and explainability. A model is transparent “if the processes that extract model parameters from training data and generate labels from testing data can be described and motivated by the approach designer.” Interpretability describes the possibility of comprehending the ML model and presenting the underlying basis for decision-making in a way that is understandable to humans. Explainability is a concept that is recognized as important, but a consensus defi |
https://en.wikipedia.org/wiki/HAIFA%20construction | The HAIFA construction (hash iterative framework) is a cryptographic structure used in the design of hash functions. It is one of the modern alternatives to the Merkle–Damgård construction, avoiding its weaknesses like length extension attacks. The construction was designed by Eli Biham and Orr Dunkelman in 2007.
Three of the 14 second round candidates in the NIST hash function competition were based on HAIFA constructions (BLAKE, SHAvite-3, ECHO). Other hash functions based on it are LAKE, Sarmal, SWIFFTX and HNF-256. The construction of Skein (Unique Block Iteration) is similar to HAIFA. Another alternative construction is the sponge construction.
References
External links
Cryptographic hash functions
Theory of cryptography |
https://en.wikipedia.org/wiki/99Vidas | 99Vidas (Portuguese for "99 Lives") is a retro-styled side-scrolling beat 'em up video game developed and published by Brazilian studio QuByte Interactive. It was first released for Microsoft Windows, macOS, and Linux in late 2016, followed by PlayStation 3, PlayStation 4 and PlayStation Vita in 2017. A Nintendo Switch version was released in November 2018.
Gameplay
99Vidas is a side-scrolling beat 'em up initially featuring six playable characters. Five more unlocked through multiple play sessions, bringing the total number of playable characters to 11. It features cooperative and competitive game modes, for up to four players, which can be played either locally or online.
Each character has unique attributes such as speed and strength, as well as an elemental alignment (fire, water, wind, lightning, et al.), which dictates the quality of their attacks, combos and special moves. Characters gain experience points by defeating enemies and collecting special items which can then be used by the player to upgrade their abilities and combos, or to unlock new ones.
The campaign and survival modes can be played solo or by up to four players cooperatively. In campaign mode, players progress through the story together, while in survival, they face unending waves of enemies, with a limited number of lives and ever-increasing difficulty, the objective being attaining high scores, which are posted to an arcade-style leaderboard. In versus mode, two to four players can play head-to-head competitive matches, where the last one standing wins.
Plot
99Vidas is set in an anachronistic fictional universe inspired by 1980s and 1990s pop culture and video game aesthetic. The story starts as an artifact known as 99Vidas goes missing. This artifact is believed to hold such great power it is a menace to the very existence of the universe, should it ever fall into the wrong hands. Players play as "guardians" of 99Vidas, heroes with elemental powers whose duty it is to protect the arti |
https://en.wikipedia.org/wiki/Nasalo | Nasalo or Nos is one of the oldest traditions in parts of Gilgit-Baltistan, in the northmost territories of Pakistan. In the winter (yoono), animals such as the Tibetan yak (Shina: bepo), oxen, and cows etc. are slaughtered, for dried meat and other processed food items prepared with the meat, such as warkì or ghittey, a kind of sausage. (Pork is not used.), and in seasonal temperatures that are below freezing, the sausages are left to dry. The food items produced during this initial phase of winter are used throughout the winter to prepare different recipes.
It is a preventive measure to survive during severe winters.
The tradition of seasoned meat is found in other cultures in the world, especially in most of the countries in Europe. The concept of seasoning and drying is more emphasized in the case of Nasalo.
History
According to local sources, the tradition of Nasalo during the reign of cannibal king Shribadat.
Legend of cannibal king
Shribadat or Shribat is mentioned as the last Buddhist or Hindu king in the history books of Gilgit-Baltistan. The festival of Nasalo is celebrated in the month of the death anniversary of the cannibal king.
The legend says the king was an adam-khor (cannibal) and fed on infants. In medieval times it was believed that if people stopped sacrificing animals, he would return again with evil thoughts of killing infants to feed himself. Each family sacrifices an animal on that day every year.
In various parts of the region in countryside, the festival is still celebrated at its fullest. The celebration starts on the early morning of 21 December, when all the heads of household gather at an untilled field holding flambeaus of pine wood.
The flaming sticks are then collected to form a conflagration, a bonfire made of flambeaus commemorating the death of the cannibal king Shri Badat.
Meanwhile, the people march towards the venue singing folk songs, and the entire place resounds with melodious and unique music by local musicians, and jo |
https://en.wikipedia.org/wiki/Aequationes%20Mathematicae | Aequationes Mathematicae is a mathematical journal. It is primarily devoted to functional equations, but also publishes papers in dynamical systems, combinatorics, and geometry. As well as publishing regular journal submissions on these topics, it also regularly reports on international symposia on functional equations and produces bibliographies on the subject.
János Aczél founded the journal in 1968 at the University of Waterloo, in part because of the long publication delays of up to four years in other journals at the time of its founding.
It is currently published by Springer Science+Business Media, with Zsolt Páles of the University of Debrecen as its editor in chief. János Aczél remains its honorary editor in chief.
it was listed as a second-quartile mathematics journal by SCImago Journal Rank.
References
Functional equations
Mathematics journals
Academic journals established in 1968 |
https://en.wikipedia.org/wiki/Bluetooth%20mesh%20networking | Bluetooth Mesh is a computer mesh networking standard based on Bluetooth Low Energy that allows for many-to-many communication over Bluetooth radio. The Bluetooth Mesh specifications were defined in the Mesh Profile and Mesh Model specifications by the Bluetooth Special Interest Group (Bluetooth SIG). Bluetooth Mesh was conceived in 2014 and adopted on .
Overview
Bluetooth Mesh is a mesh networking standard that operates on a flood network principle. It's based on the nodes relaying the messages: every relay node that receives a network packet that authenticates against a known network key that is not in message cache, that has a TTL ≥ 2 can be retransmitted with TTL = TTL - 1. Message caching is used to prevent relaying messages recently seen.
Communication is carried in the messages that may be up to 384 bytes long, when using Segmentation and Reassembly (SAR) mechanism, but most of the messages fit in one segment, that is 11 bytes. Each message starts with an opcode, which may be a single byte (for special messages), 2 bytes (for standard messages), or 3 bytes (for vendor-specific messages).
Every message has a source and a destination address, determining which devices process messages. Devices publish messages to destinations which can be single things / groups of things / everything.
Each message has a sequence number that protects the network against replay attacks.
Each message is encrypted and authenticated. Two keys are used to secure messages: (1) network keys – allocated to a single mesh network, (2) application keys – specific for a given application functionality, e.g. turning the light on vs reconfiguring the light.
Messages have a time to live (TTL). Each time message is received and retransmitted, TTL is decremented which limits the number of "hops", eliminating endless loops.
Architecture
Bluetooth Mesh has a layered architecture, with multiple layers as below.
Topology
Nodes that support the various features can be formed into a mesh net |
https://en.wikipedia.org/wiki/Biometric%20voter%20registration | Biometric voter registration implicates using biometric technology (capturing unique physical features of an individual – fingerprinting is the most commonly used), most of the times in addition to demographics of the voter, for polling registration and/or authentication. The enrollment infrastructure allows collecting and maintaining a database of the biometric templates for all voters.
A biometric voting project might include introducing biometric registration kits for enrolment of voters; using electronic voter identification devices before and on Election Day; issuing of voter identification documents (i.e. biometric voter cards), among others. The chronological stages for adopting a biometric voting registration project usually include assessment; feasibility studies; securing funding; reviewing legislation; doing pilot projects and mock registration exercises; procurement; distribution of equipment, installation, and testing; recruitment and training of staff; voter information; deployment and, post-election audits.
The final aim of implementing biometric election technology is achieving de-duplication of the voting register, thus preventing multiple voter registration and multiple voting; improving identification of the voter at the polling station, and mitigating the incidence of voter fraud (e.g. buy/rent of voters IDs before an election).
However, it is vital that commissions carrying out these election projects first and foremost guarantee that the legal framework supports biometric voter identification, and then that the data captured during the registration process will be secured while maintaining two basic requirements: personalization and privacy. Likewise, it is imperative to have contingency mechanisms in place, in case biometric systems malfunction. One of the main challenges is to ensure that given the eventualities of technological hitches and failures, not a single voter is disenfranchised.
Countries with biometric voter registration
Accord |
https://en.wikipedia.org/wiki/CloudHealth%20Technologies | CloudHealth Technologies, now CloudHealth by VMware, is a privately held software company based in Boston, Massachusetts. The company provides cloud computing services related to cost management, governance, automation, security, and performance.
History
CloudHealth Technologies was founded by Joe Kinsella in 2012. Dan Phillips joined as CEO and co-founder in late 2012, and Dave Eicher joined as co-Founder in January 2013. In May 2016, the company announced plans to expand from its Boston headquarters with branch offices in San Francisco, London, Washington, D.C., Sydney, Amsterdam, Tel Aviv, and Singapore. Headquarters moved in Boston from Fort Point to 100 Summer Street in the Spring of 2018, tripling in square footage.
In September 2017, Tom Axbey—who was previously at Rave Mobile Safety—joined as the new CEO and President. VMware announced its intention to acquire CloudHealth Technologies on August 27, 2018. The acquisition is "part of the information technology company's continued push into cloud-based software services" according to Reuters. The deal closed on October 4, 2018, and was reported to be in excess of $500 million.
Technology
Delivered through a software as a service (SaaS) model, CloudHealth Technologies's platform collects and analyzes data from cloud computing services and other IT environments so clients can report on costs, inform their business models, and project future trends. CloudHealth Technologies is compatible with Amazon Web Services, Microsoft Azure, Google Cloud Platform, multicloud, and hybrid cloud environments. CloudHealth Technologies has received Amazon Web Services(AWS) Education Competency status, AWS Migration Competency status and achieved SOC 2 Type 2 Compliance.
Funding
As of June 2017, CloudHealth Technologies has raised a total of $85.7 million through four rounds of funding.
In March 2013, CloudHealth Technologies announced that it had secured $4.5 million in Series A funding. This round was led by .406 Ventures |
https://en.wikipedia.org/wiki/Minimum-Pairs%20Protocol | The minimum-pairs (or MP) is an active measurement protocol to estimate in real-time the smaller of the forward and reverse one-way network delays (OWDs). It is designed to work in hostile environments, where a set of three network nodes can estimate an upper-bound OWD between themselves and a fourth untrusted node. All four nodes must cooperate, though honest cooperation from the fourth node is not required. The objective is to conduct such estimates without involving the untrusted nodes in clock synchronization, and in a manner more accurate than simply half the round-trip time (RTT). The MP protocol can be used in delay-sensitive applications (such as placing content delivery network replicas) or for secure Internet geolocation.
Methodology
The MP protocol requires the three trusted network nodes to synchronize their clocks, and securely have access to their public keys, which could be achieved through a closed public key infrastructure (PKI) system. The untrusted node need not follow suit because it is not assumed to cooperate honestly. To estimate an upper bound to the smaller of the forward and reverse OWD between node A and the untrusted node X (see figure for notation), X first establishes an application-layer connection to all three nodes. This could be done transparently over the browser using, e.g., WebSockets. The three nodes then take turns in exchanging digitally-signed timestamps.
Assuming node A begins, it sends a signed timestamp to X. Node X forwards that message to the other two nodes. When the message is received, its receiving time is recorded. The receiving node then verifies the signature, and calculates the time it took the message to traverse the network from its originator to the recipient passing by the untrusted node. This is done by subtracting the timestamp in the message from the receiving time. Node B then repeats the process, followed by node C. After all three nodes have taken turns, they end-up with six delay estimates corresp |
https://en.wikipedia.org/wiki/Monoque | A monoque is a linear data structure which provides dynamic array semantics. A monoque is similar in structure to a deque but is limited to operations on one end. Hence the name, mono-que. A monoque offers O(1) random access and O(1) push_back/pop_back. Unlike a C++ vector, the push_back/pop_back functions are not amortized and are strictly O(1) in time complexity. Because the block list is never reallocated or resized, it maintains strictly O(1) non-amortized worst case performance. Unlike C++'s deque, the O(1) performance guarantee includes the time complexity of working with the block list, whereas the C++ standard only guarantees the deque to be O(1) in terms of operations on the underlying value type.
The monoque consists of a size variable and a fixed-size block list of blocks with exponentially increasing sizes. Thus, the size of the monoque in bits is roughly proportional to the square of the system pointer size. Though arguably O(lg N) in size, because lg(pointer_size) is constant on any particular machine the block list is O(1) in size and is an upper bound to O(lg(N)), it bounds the space complexity of the structure by a constant.
Data structures |
https://en.wikipedia.org/wiki/Perfect%20obstruction%20theory | In algebraic geometry, given a Deligne–Mumford stack X, a perfect obstruction theory for X consists of:
a perfect two-term complex in the derived category of quasi-coherent étale sheaves on X, and
a morphism , where is the cotangent complex of X, that induces an isomorphism on and an epimorphism on .
The notion was introduced by for an application to the intersection theory on moduli stacks; in particular, to define a virtual fundamental class.
Examples
Schemes
Consider a regular embedding fitting into a cartesian square
where are smooth. Then, the complex
(in degrees )
forms a perfect obstruction theory for X. The map comes from the composition
This is a perfect obstruction theory because the complex comes equipped with a map to coming from the maps and . Note that the associated virtual fundamental class is
Example 1
Consider a smooth projective variety . If we set , then the perfect obstruction theory in is
and the associated virtual fundamental class is
In particular, if is a smooth local complete intersection then the perfect obstruction theory is the cotangent complex (which is the same as the truncated cotangent complex).
Deligne–Mumford stacks
The previous construction works too with Deligne–Mumford stacks.
Symmetric obstruction theory
By definition, a symmetric obstruction theory is a perfect obstruction theory together with nondegenerate symmetric bilinear form.
Example: Let f be a regular function on a smooth variety (or stack). Then the set of critical points of f carries a symmetric obstruction theory in a canonical way.
Example: Let M be a complex symplectic manifold. Then the (scheme-theoretic) intersection of Lagrangian submanifolds of M carries a canonical symmetric obstruction theory.
Notes
References
See also
Behrend function
Gromov–Witten invariant
Differential topology
Symplectic geometry
Hamiltonian mechanics
Smooth manifolds |
https://en.wikipedia.org/wiki/Cellular%20thermal%20shift%20assay | CEllular Thermal Shift Assay (CETSA®) is a patented label free chemoproteomics method that has enabled measurements of compound target engagement in intact cells and tissue, without modifications to the target protein. This is accomplished by comparing the measured cellular thermal stability of the protein in the presence and absence of the test compound. An efficacious compound binding to its intended target will affect associated proteins and thereby leave traces in the cell in form of changed signalling patterns. Such patterns can arise from for example loss or gain of protein-protein interactions, phosphorylations or release of regulatory molecules.
References
Chemical biology |
https://en.wikipedia.org/wiki/Domestication%20syndrome | Domestication syndrome refers to two sets of phenotypic traits that are common to either domesticated animals, or domesticated plants. These traits were identified by Charles Darwin in The Variation of Animals and Plants Under Domestication.
Domesticated animals tend to be smaller and less aggressive than their wild counterparts, they may also have floppy ears, variations to coat color, a smaller brain, and a shorter muzzle. Other traits may include changes in the endocrine system and an extended breeding cycle.
Research suggests that modified neural crest cells are potentially responsible for the traits that are common across many domesticated animal species.
The process of plant domestication has produced changes in shattering/fruit abscission, shorter height, larger grain or fruit size, easier threshing, synchronous flowering, and increased yield, as well as changes in color, taste, and texture.
Origin
Charles Darwin's study of The Variation of Animals and Plants Under Domestication in 1868 identified behavioral, morphological, and physiological traits that are shared by domestic animals, but not by their wild ancestors. These shared traits became known as the domestication syndrome. These traits include tameness, docility, floppy ears, altered tails, novel coat colors and patterns, reduced brain size, reduced body mass and smaller teeth. Other traits include changes in craniofacial morphology, alterations to the endocrine system, and changes to the female estrous cycles including the ability to breed all year-round.
A recent hypothesis suggests that neural crest cell behaviour may be modified by domestication, which then leads to those traits that are common across many domesticated animal species.
Cause
Many similar traits – both in animals and plants – are produced by orthologs, however whether this is true for domestication traits or merely for wild forms is less clear. Especially in the case of crops, doubt has been cast because some domestication |
https://en.wikipedia.org/wiki/Log%20reduction | Log reduction is a measure of how thoroughly a decontamination process reduces the concentration of a contaminant.
It is defined as the common logarithm of the ratio of the levels of contamination before and after the process, so an increment of 1 corresponds to a reduction in concentration by a factor of 10.
In general, an -log reduction means that the concentration of remaining contaminants is only times that of the original. So for example, a 0-log reduction is no reduction at all, while a 1-log reduction corresponds to a reduction of 90 percent from the original concentration, and a 2-log reduction corresponds to a reduction of 99 percent from the original concentration.
Mathematical definition
Let and be the numerical values of the concentrations of a given contaminant, respectively before and after treatment, following a defined process.
It is irrelevant in what units these concentrations are given, provided that both use the same units.
Then an and -log reduction is achieved, where
.
For the purpose of presentation, the value of is rounded down to a desired precision, usually to a whole number.
Example
Let the concentration of some contaminant be 580 ppm before and 0.725 ppm after treatment. Then
Rounded down, is 2, so a 2-log reduction is achieved.
Conversely, an -log reduction means that a reduction by a factor of has been achieved.
Log reduction and percentage reduction
Reduction is often expressed as a percentage. The closer it is to 100%, the better.
Letting and be as before, a reduction by % is achieved, where
Example
Let, as in the earlier example, the concentration of some contaminant be 580 ppm before and 0.725 ppm after treatment. Then
So this is (better than) a 99% reduction, but not yet quite a 99.9% reduction.
The following table summarizes the most common cases.
{| class="wikitable"
! Log reduction
! Percentage
|-
|1-log reduction
|90%
|-
|2-log reduction
|99%
|-
|3-log reduction
|99.9%
|-
|4-log reduction
|99.99%
|-
|5-log |
https://en.wikipedia.org/wiki/Ziegler%20spectrum | In mathematics, the (right) Ziegler spectrum of a ring R is a topological space whose points are (isomorphism classes of) indecomposable pure-injective right R-modules. Its closed subsets correspond to theories of modules closed under arbitrary products and direct summands. Ziegler spectra are named after Martin Ziegler, who first defined and studied them in 1984.
Definition
Let R be a ring (associative, with 1, not necessarily commutative). A (right) pp-n-formula is a formula in the language of (right) R-modules of the form
where are natural numbers, is an matrix with entries from R, and is an -tuple of variables and is an -tuple of variables.
The (right) Ziegler spectrum, , of R is the topological space whose points are isomorphism classes of indecomposable pure-injective right modules, denoted by , and the topology
has the sets
as subbasis of open sets, where range over
(right) pp-1-formulae and denotes the subgroup of consisting of all elements that satisfy the one-variable formula . One can show that these sets form a basis.
Properties
Ziegler spectra are rarely Hausdorff and often fail to have the -property. However they are always compact and have a basis of compact open sets given by the sets where are pp-1-formulae.
When the ring R is countable is sober. It is not currently known if all Ziegler spectra are sober.
Generalization
Ivo Herzog showed in 1997 how to define the Ziegler spectrum of a locally coherent Grothendieck category, which generalizes the construction above.
References
Model theory |
https://en.wikipedia.org/wiki/Erazmo%20Ti%C4%87ac | Erazmo Bernard Tićac (1904, Žurkovo - 1968) was Croatian shipbuilding engineer from Žurkovo near Kostrena. He worked for American Design Company George G. Sharp Inc. He is well known for being the main ship design engineer of NS Savannah, the first commercial, passenger-cargo ship of nuclear power.
See also
List of Croatian inventors
References
Croatian engineers
Croatian inventors
People from Rijeka
1904 births
1968 deaths
Yugoslav inventors
Yugoslav engineers |
https://en.wikipedia.org/wiki/Operation%20Bayonet%20%28darknet%29 | Operation Bayonet was a multinational law enforcement operation culminating in 2017 targeting the AlphaBay and Hansa darknet markets. Many other darknet markets were also shut down.
References
2017 in law
Law enforcement operations
Informal economy
Cybercrime
Underground culture
Tor (anonymity network) |
https://en.wikipedia.org/wiki/KaiOS | KaiOS is a mobile Linux distribution for keypad feature phones based on the Firefox OS open-source project. It is developed by KaiOS Technologies (Hong Kong) Limited; a company based in Hong Kong, whose largest shareholder is Chinese electronics conglomerate TCL Corporation. KaiOS runs on feature phones made with low-power hardware and low power consumption (and therefore long battery life). KaiOS supports modern connectivity technologies like 4G LTE E, VoLTE, GPS, and Wi-Fi. KaiOS runs HTML5-based apps. KaiOS supports over-the-air updates and has a dedicated app marketplace called KaiStore. Some applications are preloaded, including Facebook and YouTube. , there are 500+ apps in KaiStore. The mobile operating system is comparatively lightweight on hardware resource usage, and is able to run on devices with just 256 megabytes (MB) of memory.
History
The operating system was first released in 2017, and is developed by KaiOS Technologies Inc., a Hong Kong-based company headed by CEO Sebastien Codeville, with offices in other countries. In June 2018, Google invested US$22 million in the operating system. That same year, India-based telecom operator Reliance Jio also invested $7 million through its sister concern, Reliance Retail for a 16% stake in the company. In May 2019, KaiOS raised an additional US$50 million from Cathay Innovation, and previous investors Google and TCL Holdings.
In market share study results announced in May 2018, KaiOS beat Apple's iOS for second place in India, while Android dominates with 71%, albeit down by 9%. KaiOS growth is being largely attributed to the popularity of the competitively-priced JioPhone. In Q1 2018, 23 million KaiOS devices were produced.
In March 2020, Mozilla and KaiOS Technologies announced a partnership to update KaiOS with a modern version of the Gecko browser engine, and more closely aligned testing infrastructure. This change should give KaiOS four years worth of performance and security improvements and new feat |
https://en.wikipedia.org/wiki/Walk-regular%20graph | In discrete mathematics, a walk-regular graph is a simple graph where the number of closed walks of any length from a vertex to itself does not depend on the choice of vertex.
Equivalent definitions
Suppose that is a simple graph. Let denote the adjacency matrix of , denote the set of vertices of , and denote the characteristic polynomial of the vertex-deleted subgraph for all Then the following are equivalent:
is walk-regular.
is a constant-diagonal matrix for all
for all
Examples
The vertex-transitive graphs are walk-regular.
The semi-symmetric graphs are walk-regular.
The distance-regular graphs are walk-regular. More generally, any simple graph in a homogeneous coherent algebra is walk-regular.
A connected regular graph is walk-regular if:
It has at most four distinct eigenvalues.
It is triangle-free and has at most five distinct eigenvalues.
It is bipartite and has at most six distinct eigenvalues.
Properties
A walk-regular graph is necessarily a regular graph.
Complements of walk-regular graphs are walk-regular.
Cartesian products of walk-regular graphs are walk-regular.
Categorical products of walk-regular graphs are walk-regular.
Strong products of walk-regular graphs are walk-regular.
In general, the line graph of a walk-regular graph is not walk-regular.
-walk-regular graphs
A graph is -walk regular if for any two vertices and of graph-distance the number of walks of length from to depends only of and .
For these are exactly the walk-regular graphs.
If is at least the diameter of the graph, then the -walk regular graphs coincide with the distance-regular graphs.
In fact, if and the graph has an eigenvalue of multiplicity at most (except for eigenvalues and , where is the degree of the graph), then the graph is already distance-regular.
References
External links
Chris Godsil and Brendan McKay, Feasibility conditions for the existence of walk-regular graphs.
Algebraic graph theory
Graph families
Regular |
https://en.wikipedia.org/wiki/Riemann%E2%80%93Roch-type%20theorem | In algebraic geometry, there are various generalizations of the Riemann–Roch theorem; among the most famous is the Grothendieck–Riemann–Roch theorem, which is further generalized by the formulation due to Fulton et al.
Formulation due to Baum, Fulton and MacPherson
Let and be functors on the category C of schemes separated and locally of finite type over the base field k with proper morphisms such that
is the Grothendieck group of coherent sheaves on X,
is the rational Chow group of X,
for each proper morphism f, are the direct images (or push-forwards) along f.
Also, if is a (global) local complete intersection morphism; i.e., it factors as a closed regular embedding into a smooth scheme P followed by a smooth morphism , then let
be the class in the Grothendieck group of vector bundles on X; it is independent of the factorization and is called the virtual tangent bundle of f.
Then the Riemann–Roch theorem amounts to the construction of a unique natural transformation:
between the two functors such that for each scheme X in C, the homomorphism satisfies: for a local complete intersection morphism , when there are closed embeddings into smooth schemes,
where refers to the Todd class.
Moreover, it has the properties:
for each and the Chern class (or the action of it) of the in the Grothendieck group of vector bundles on X.
it X is a closed subscheme of a smooth scheme M, then the theorem is (roughly) the restriction of the theorem in the smooth case and can be written down in terms of a localized Chern class.
The equivariant Riemann–Roch theorem
Over the complex numbers, the theorem is (or can be interpreted as) a special case of the equivariant index theorem.
The Riemann–Roch theorem for Deligne–Mumford stacks
Aside from algebraic spaces, no straightforward generalization is possible for stacks. The complication already appears in the orbifold case (Kawasaki's Riemann–Roch).
The equivariant Riemann–Roch theorem for finite groups is equival |
https://en.wikipedia.org/wiki/Australian%20Cyber%20Security%20Centre | The Australian Cyber Security Centre (ACSC), the successor to the Cyber Security Operations Centre, is the Australian Government's lead agency for cyber security. The ACSC is part of the Australian Signals Directorate and is based at the Australian Security Intelligence Organisation headquarters in Brindabella Business Park in Canberra. The Centre is overseen by the Cyber Security Operations Board and is the joint responsibility of the Minister for Defence.
History
The Australian Cyber Security Centre was established in 2014, replacing the Cyber Security Operations Centre, also housed by the Australian Signals Directorate. In line with the recommendations of the 2017 Independent Review of the Australian Intelligence Community led by Michael L'Estrange and Stephen Merchant, Prime Minister Malcolm Turnbull announced that the role of the Australian Cyber Security Centre would be strengthened and that the Prime Minister's Special Adviser on Cyber Security, Alastair MacGibbon, would assume the responsibilities as the Head of the Centre within the Australian Signals Directorate, which was established as a statutory agency.
Role and responsibilities
The role of the Australian Cyber Security Centre is to:
lead the Australian Government’s operational response to cyber security incidents
organise national cyber security operations and resources
encourage and receive reporting of cyber attacks and cyber security incidents
raise awareness of the level of cyber threats to Australia
study and investigate cyber threats
The ACSC integrates the national security cyber capabilities across the Australian Signals Directorate cyber security mission, cyber security experts from the Digital Transformation Agency, the Defence Intelligence Organisation strategic intelligence analysts, the Computer Emergency Response Team, the Cyber Security Policy Division of the Department of Home Affairs, Australian Security Intelligence Organisation cyber and telecommunications specialists, Australian |
https://en.wikipedia.org/wiki/MSX%20character%20set | MSX character sets are a group of single- and double-byte character sets developed by Microsoft for MSX computers. They are based on code page 437.
Character sets
The following table shows the MSX character set. Each character is shown with a potential Unicode equivalent if available. Control characters and other non-printing characters are represented by their names.
Character set differences exist, depending on the target market of the machine. These are the variations:
Arabic
Brazilian
German DIN
International
Japanese
Korean
Russian
The German DIN and International character sets are identical, apart from the style of zero (0) character. The international character set has a zero with a slash, while the DIN character set has a dotted zero.
The MSX terminal is compatible with VT52 escape codes, plus extra control codes shown below.
Brazilian variants
Gradiente custom charset
The Brazilian manufacturer Gradiente have initially included a modified MSX character set on their v1.0 machines to allow writing correct Portuguese. Differences are shown boxed. The symbol at 0x9E (158) is the currency symbol for the Brazilian cruzado which is not used anymore.
BRASCII
Later Brazilian MSX models (v1.1 or higher) included a standardized character set named BRASCII, which solved the accentuation incompatibility problems amongst the different makers.
References
Character sets
MSX |
https://en.wikipedia.org/wiki/Aiken%20code | The Aiken code (also known as 2421 code) is a complementary binary-coded decimal (BCD) code. A group of four bits is assigned to the decimal digits from 0 to 9 according to the following table. The code was developed by Howard Hathaway Aiken and is still used today in digital clocks, pocket calculators and similar devices.
The Aiken code differs from the standard 8421 BCD code in that the Aiken code does not weight the fourth digit as 8 as with the standard BCD code but with 2.
The following weighting is obtained for the Aiken code: 2-4-2-1.
One might think that double codes are possible for a number, for example 1011 and 0101 could represent 5. However, here one makes sure that the digits 0 to 4 are mirror image complementary to the numbers 5 to 9.
See also
Excess-3 code
Gray code
O'Brien code type I
References
Further reading
(3 pages)
Computer arithmetic
Numeral systems
Non-standard positional numeral systems |
https://en.wikipedia.org/wiki/All-Russian%20Institute%20Of%20Aviation%20Materials | The All-Russian Institute Of Aviation Materials (VIAM) () is a state research centre of the Russian Federation based in Moscow, Russia, established in 1932.
VIAM has broad responsibility for research, development, testing, and certification of all metallic and nonmetallic materials used in the Russian aerospace industry. Over 90 percent of the materials used in Soviet aircraft and space vehicles were developed at VIAM.
Bibliography
List of VIAM publications in the Scientific electronic library elibrary.ru
References
Companies based in Moscow
Metal companies of the Soviet Union
Buran program
Research institutes in Russia
Research institutes in the Soviet Union
Aviation in the Soviet Union
Aerospace research institutes
Aviation research institutes
Aerospace engineering organizations
Research and development organizations
Federal State Unitary Enterprises of Russia
1932 establishments in the Soviet Union |
https://en.wikipedia.org/wiki/Chaplygin%20Siberian%20Scientific%20Research%20Institute%20Of%20Aviation | Chaplygin Siberian Scientific Research Institute Of Aviation (SibNIA) () is a research institute based in Novosibirsk, Russia and established in 1941.
SIBNIA is one of Russia's leading aviation research institutes, with departments devoted to aerodynamics, avionics testing, full-scale fatigue testing, thermal strength testing, fatigue and loading spectra, and dynamic strength testing.
Researchers at SIBNIA have published work on topics such as localization of the sources of acoustic emissions in strength testing of aviation materials, fatigue and fracture in steel and concrete structures, piezotransducer amplification, strengths of materials, and metallurgy. Since 1943, over 180 aircraft and 200 aircraft components have been tested at SIBNIA's facilities.
SIBNIA came into existence in 1941 when the Central Aerohydrodynamics Institute (TsAGI) was evacuated to Novosibirsk to escape from the German advance on Moscow. Sergey Chaplygin, the second director of TsAGI, died in Novosibirsk on 8 October 1942 and was buried in front of SIBNIA's main administration building. The bulk of TsAGI's personnel returned to Moscow in 1943, leaving behind a cadre of researchers and equipment at what then became the S.A. Chaplygin Siberian Scientific Research Institute of Aviation.
References
External links
Official website
Companies based in Novosibirsk
Federal State Unitary Enterprises of Russia
Ministry of the Aviation Industry (Soviet Union)
Science and technology in Siberia
Research institutes in Novosibirsk
Dzerzhinsky City District, Novosibirsk
Research institutes in the Soviet Union
Aerospace engineering organizations
Aviation research institutes
Aviation in the Soviet Union |
https://en.wikipedia.org/wiki/Sol%C3%A8r%27s%20theorem | In mathematics, Solèr's theorem is a result concerning certain infinite-dimensional vector spaces. It states that any orthomodular form that has an infinite orthonormal sequence is a Hilbert space over the real numbers, complex numbers or quaternions. Originally proved by Maria Pia Solèr, the result is significant for quantum logic and the foundations of quantum mechanics. In particular, Solèr's theorem helps to fill a gap in the effort to use Gleason's theorem to rederive quantum mechanics from information-theoretic postulates. It is also an important step in the Heunen-Kornell axiomatisation of the category of Hilbert spaces.
Physicist John C. Baez notes,Nothing in the assumptions mentions the continuum: the hypotheses are purely algebraic. It therefore seems quite magical that [the division ring over which the Hilbert space is defined] is forced to be the real numbers, complex numbers or quaternions.Writing a decade after Solèr's original publication, Pitowsky calls her theorem "celebrated".
Statement
Let be a division ring. That means it is a ring in which one can add, subtract, multiply, and divide but in which the multiplication need not be commutative. Suppose this ring has a conjugation, i.e. an operation for which
Consider a vector space V with scalars in , and a mapping
which is -linear in left (or in the right) entry, satisfying the identity
This is called a Hermitian form. Suppose this form is non-degenerate in the sense that
For any subspace S let be the orthogonal complement of S. Call the subspace "closed" if
Call this whole vector space, and the Hermitian form, "orthomodular" if for every closed subspace S we have that is the entire space. (The term "orthomodular" derives from the study of quantum logic. In quantum logic, the distributive law is taken to fail due to the uncertainty principle, and it is replaced with the "modular law," or in the case of infinite-dimensional Hilbert spaces, the "orthomodular law.")
A set o |
https://en.wikipedia.org/wiki/Right%20to%20explanation | In the regulation of algorithms, particularly artificial intelligence and its subfield of machine learning, a right to explanation (or right to an explanation) is a right to be given an explanation for an output of the algorithm. Such rights primarily refer to individual rights to be given an explanation for decisions that significantly affect an individual, particularly legally or financially. For example, a person who applies for a loan and is denied may ask for an explanation, which could be "Credit bureau X reports that you declared bankruptcy last year; this is the main factor in considering you too likely to default, and thus we will not give you the loan you applied for."
Some such legal rights already exist, while the scope of a general "right to explanation" is a matter of ongoing debate. There have been arguments made that a "social right to explanation" is a crucial foundation for an information society, particularly as the institutions of that society will need to use digital technologies, artificial intelligence, machine learning. In other words, that the related automated decision making systems that use explainability would be more trustworthy and transparent. Without this right, which could be constituted both legally and through professional standards, the public will be left without much recourse to challenge the decisions of automated systems.
Examples
Credit scoring in the United States
Under the Equal Credit Opportunity Act (Regulation B of the Code of Federal Regulations),
Title 12, Chapter X, Part 1002, §1002.9, creditors are required to notify applicants who are denied credit with specific reasons for the detail. As detailed in §1002.9(b)(2):
The official interpretation of this section details what types of statements are acceptable. Creditors comply with this regulation by providing a list of reasons (generally at most 4, per interpretation of regulations), consisting of a numeric (as identifier) and an associated explanation, identif |
https://en.wikipedia.org/wiki/Single%20cell%20epigenomics | Single cell epigenomics is the study of epigenomics (the complete set of epigenetic modifications on the genetic material of a cell) in individual cells by single cell sequencing. Since 2013, methods have been created including whole-genome single-cell bisulfite sequencing to measure DNA methylation, whole-genome ChIP-sequencing to measure histone modifications, whole-genome ATAC-seq to measure chromatin accessibility and chromosome conformation capture.
Single-cell DNA methylome sequencing
Single cell DNA genome sequencing quantifies DNA methylation. This is similar to single cell genome sequencing, but with the addition of a bisulfite treatment before sequencing. Forms include whole genome bisulfite sequencing, and reduced representation bisulfite sequencing
Single-cell ATAC-seq
ATAC-seq stands for Assay for Transposase-Accessible Chromatin with high throughput sequencing. It is a technique used in molecular biology to identify accessible DNA regions, equivalent to DNase I hypersensitive sites. Single cell ATAC-seq has been performed since 2015, using methods ranging from FACS sorting, microfluidic isolation of single cells, to combinatorial indexing. In initial studies, the method was able to reliably separate cells based on their cell types, uncover sources of cell-to-cell variability, and show a link between chromatin organization and cell-to-cell variation.
Single-cell ChIP-seq
ChIP-sequencing, also known as ChIP-seq, is a method used to analyze protein interactions with DNA. ChIP-seq combines chromatin immunoprecipitation (ChIP) with massively parallel DNA sequencing to identify the binding sites of DNA-associated proteins. In epigenomics, this is often used to assess histone modifications (such as methylation). ChIP-seq is also often used to determine transcription factor binding sites.
Single-cell ChIP-seq is extremely challenging due to background noise caused by nonspecific antibody pull-down, and only one study so far has performed it successfully |
https://en.wikipedia.org/wiki/Football%20Live | Football Live was the name given to the project and computer system created and utilised by PA Sport to collect Real Time Statistics from major English & Scottish Football Matches and distribute to most leading media organisations. At the time of its operation, more than 99% of all football statistics displayed across Print, Internet, Radio & TV Media outlets would have been collected via Football Live.
Background
Prior to implementation of Football Live, the collection process consisted of a news reporter or press officer at each club telephoning the Press Association, relaying information on Teams, Goals and Half-Time & Full Time.
The basis for Football Live was to have a representative of the Press Association (FBA - Football Analyst) at every ground. Throughout the whole match they would stay on an open line on a mobile phone to a Sports Information Processor (SIP), constantly relaying in real time statistical information for every :
Shot
Foul
Free Kick
Goal
Cross
Goal Kick
Offside
This information would be entered in real time and passed to our media customers.
The Football Live project was in use from Season 2001/02 until the service was taken over by Opta in 2013/14
Commercial Customers
The most famous use for the Football Live data was for the Vidiprinter services on BBC & Sky Sports, allowing goals to be viewed on TV screens within 20 seconds of the event happening.
League competitions
From its inception in 2001/02 season, the following leagues/competitions were fully covered by Football live
English Premier League
Championship
League One
League Two
Conference
Scottish Premier League
English FA Cup
English Football League Cup
World Cup
European Championships
Champions League
Europa League
Football Analysts (FBA's)
During the early development stages, the initial idea was to employee ex-referees to act as Football Analysts, but this was soon dismissed in favour of ex-professional Footballers. The most famous of which were Brendon O |
https://en.wikipedia.org/wiki/Teknomo%E2%80%93Fernandez%20algorithm | The Teknomo–Fernandez algorithm (TF algorithm), is an efficient algorithm for generating the background image of a given video sequence.
By assuming that the background image is shown in the majority of the video, the algorithm is able to generate a good background image of a video in -time using only a small number of binary operations and Boolean bit operations, which require a small amount of memory and has built-in operators found in many programming languages such as C, C++, and Java.
History
People tracking from videos usually involves some form of background subtraction to segment foreground from background. Once foreground images are extracted, then desired algorithms (such as those for motion tracking, object tracking, and facial recognition) may be executed using these images.
However, background subtraction requires that the background image is already available and unfortunately, this is not always the case. Traditionally, the background image is searched for manually or automatically from the video images when there are no objects. More recently, automatic background generation through object detection, medial filtering, medoid filtering, approximated median filtering, linear predictive filter, non-parametric model, Kalman filter, and adaptive smoothening have been suggested; however, most of these methods have high computational complexity and are resource-intensive.
The Teknomo–Fernandez algorithm is also an automatic background generation algorithm. Its advantage, however, is its computational speed of only -time, depending on the resolution of an image and its accuracy gained within a manageable number of frames. Only at least three frames from a video is needed to produce the background image assuming that for every pixel position, the background occurs in the majority of the videos. Furthermore, it can be performed for both grayscale and colored videos.
Assumptions
The camera is stationary.
The light of the environment changes only slowly |
https://en.wikipedia.org/wiki/Joint%20Cyberspace%20Command | The Joint Cyberspace Command (MCCE), known until 2020 as Joint Cyber-Defence Command (MCCD), is a Spanish cyberspace service of the Defence Staff responsible for planning and carrying out the actions related to cyber defence in networks and information and telecommunications systems of the Ministry of Defense or others that might be entrusted, as well as contributing to the adequate response in cyberspace to threats or aggressions that may affect to the National Defense.
In this sense, the MCCD directs and coordinates, in the matter of cyber defense, the activity of the centers of response to incidents of security of the information of the different branches of the Armed Forces; it exercises the timely, legitimate and proportionate response in cyberspace to threats or aggressions that may affect the National Defense and defines, directs and coordinates awareness, training and specialized training in this area. In addition, he is responsible for the development and detail of the Information Security policies in the Information and Telecommunications Systems (SEGINFOSIT) and the direction of execution and control of compliance with these policies, within the scope of the Ministry of Defense.
The MCCD was created on February 19, 2013 by a Defence Ministry Order 10/2013, by which the Joint Cyber-Defence Command is created. In 2020, it was renamed Joint Cyberspace Command. The current Chief Commander of the MCCD is divisional general Rafael García Hernández.
Functions
The functions of the Joint Cyberspace Command are:
Ensure free access to cyberspace, in order to fulfill the missions and tasks assigned to the Armed Forces, through the development and use of the necessary resources and procedures.
Guarantee the availability, integrity and confidentiality of the information, as well as the integrity and availability of the networks and systems that manage and have it commissioned.
Guarantee the operation of the critical services of the Armed Forces' information and t |
https://en.wikipedia.org/wiki/BKash | bKash () is a mobile financial service (MFS) in Bangladesh operating under the authority of Bangladesh Bank as a subsidiary of BRAC Bank PLC. This mobile financial service company started as a joint venture between BRAC Bank Limited, and Money in Motion LLC. As a mobile financial service (MFS) provider in Bangladesh, bKash users can transfer money into their mobile accounts and then access a range of services. In particular, transferring and receiving money domestically and making payments. Services like mobile recharge and paying utility bills are also possible through bKash USSD (*247#) and bKash App. A user can receive remittance on bKash. In November 2021, bKash became the first ever unicorn startup (a startup whose valuation is $1 billion or more) company in Bangladesh. In May 2023, bKash became the regional sponsors of the Argentina Football Association.
Fortune magazine ranked bKash 23rd among the top 50 companies in their Change the World list in 2017. According to the Prothom Alo, a leading national newspaper, bKash has reached a consumer base of 70 million registered Bangladeshi adults. Asiamoney magazine declared bKash as the Best Digital Solution (2018). World HRD Congress declared it as one of Asia's best employers in 2017.
History
bKash was launched by Kamal Quadir and Iqbal Quadir. In the mid-2000s, mobile financial services Mobile Service Internet Service Value Added Service had taken off in the Philippines, Kenya, and other emerging markets when the two Quadir brothers decided to bring it to Bangladesh. In need of a local partner, the Quadir brothers began to engage BRAC's founder, Sir Fazle Hasan Abed, in 2008. Discussions between them and Abed continued over a two-year period. In 2010, they committed to establishing a joint venture between Money in Motion and BRAC Bank. bKash launched in 21 July, 2011 in Bangladesh, with basic services: Cash In, Cash Out and Send Money, keeping in mind that more than 70% of the population of Bangladesh lives in |
https://en.wikipedia.org/wiki/Shape%20Modeling%20International | Shape Modeling International (SMI), also known as International Conference on Shape Modeling and Applications is an annual symposium whose goal is to promote the dissemination of new mathematical theories and novel computational techniques for modeling, simulating, and processing digital shape representations. Initiated in 1997 by Tosyiasu L. Kunii and Bianca Falcidieno, the symposium became an annual event in 2001 after its merge with the Eurographics / ACM SIGGRAPH Workshop on Implicit Surfaces. The venue of the symposium rotates in turn among Asia, Europe and America.
Overview
Since 2009, proceedings of SMI are published by Elsevier as a special issue of the Computers & Graphics journal. Proceedings until the year 2010 are available at DPLP, computer.org, and IEEE Explore.
See also
Symposium on Geometry Processing
SIGGRAPH
Solid modeling
References
Models of computation
International conferences
Organizations established in 1997 |
https://en.wikipedia.org/wiki/Dream%20Market | Dream Market was an online darknet market founded in late 2013. Dream Market operated on a hidden service of the Tor network, allowing online users to browse anonymously and securely while avoiding potential monitoring of traffic. The marketplace sold a variety of content, including drugs, stolen data, and counterfeit consumer goods, all using cryptocurrency. Dream provided an escrow service, with disputes handled by staff. The market also had accompanying forums, hosted on a different URL, where buyers, vendors, and other members of the community could interact. It is one of the longest running darknet markets.
Administrator and prolific vendor Gal Vallerius was arrested in August 2017. The site shut down on April 30, 2019.
History
Following the seizures and shutdowns of the AlphaBay and Hansa markets in July 2017 as part of Operation Bayonet, there was much speculation that Dream Market would become the predominant darknet marketplace. Formerly, Dream Market had been considered the second-largest darknet marketplace, with AlphaBay being the largest and Hansa the third-largest. Many vendors and buyers from AlphaBay and Hansa communities registered on Dream Market in the aftermath of Operation Bayonet. Rumors at the time suggested that Dream Market was under law enforcement control.
At the time, Dream Market was reported to have "57,000 listings for drugs and 4,000 listings for opioids".
Dream Market administrator and prolific vendor Gal Vallerius was arrested in August 2017, after a border search of his laptop confirmed his identity as online drug dealer OxyMonster. The equivalent of US$500,000 in the cryptocurrency Bitcoin was also discovered on this device. Vallerius is the subject of an ongoing investigation regarding large online narcotics purchases which began in February 2016.
On March 24, 2019, a banner was added to the Dream Market site announcing its shutdown on April 30, 2019, with the addition that it "is transferring its services to a partner compa |
https://en.wikipedia.org/wiki/Zoothamnium%20niveum | Zoothamnium niveum is a species of ciliate protozoan which forms feather-shaped colonies in marine coastal environments. The ciliates form a symbiosis with sulfur-oxidizing chemosynthetic bacteria of the species "Candidatus Thiobios zoothamnicoli", which live on the surface of the colonies and give them their unusual white color.
Characteristics
The conspicuously white and feather-shaped colonies are composed of individual bell-shaped cells known as zooids. The stalks of individual cells grow from a single central stalk. Colonies can reach a length of up to 15 mm, formed from hundreds of single zooids, each with a length of only 120 µm. An entire colony can contract into a ball-shaped bunch through the contraction of myonemes in their stalks.
The white color is produced by chemolithoautotrophic sulfur-oxidizing bacteria, which cover the entire surface of the Z. niveum colony. In most other species of Zoothamnium, bacteria are only known to cover the stalks. The bacteria contain elemental sulfur, which appear white. Z. niveum appears colorless when the bacteria are absent.
Like in other ciliates, a contractile vacuole maintains osmotic balance for the cell, and allows it to survive the salt concentrations in both marine and brackish water. The vacuole is located in Z. niveum directly below the lip of the peristome.
Polymorphism
Most ciliates live as single-celled organisms in aquatic environments, and the single cell carries out all functions of life, such as nutrition, metabolism, and reproduction. Colonies of Z. niveum are composed of numerous individual cells that form a feather-like colonial unit, with several different cell types. Old branches of the colony illustrate the polymorphism of the zooids when viewed under the microscope. Three different forms of the individual ciliate cells are present, which are distinct in both form and function. The large macrozooids can transform into swarmers and leave the colony. They settle on suitable surfaces and develo |
https://en.wikipedia.org/wiki/Infant%20food%20safety | Foodborne illness (also foodborne disease and colloquially referred to as food poisoning) is any illness resulting from the food spoilage of contaminated food, pathogenic bacteria, viruses, or parasites that contaminate food.
Infant food safety is the identification of risky food handling practices and the prevention of illness in infants. Foodborne illness is a serious health issue, especially for babies and children.
Infants and young children are particularly vulnerable to foodborne illness because their immune systems are not developed enough to fight off foodborne bacterial infections. In fact, 800,000 illnesses affect children under the age of 10 in the U.S. each year.
Therefore, extra care should be taken when handling and preparing their food.
Prevention
Handwashing is the first step in maintaining the safety of infant food. Caregivers hands can pick up bacteria and spread bacteria to the baby. Situations in which one can encounter high levels of bacteria are:
Diapers containing feces and urine
Raw meat and raw poultry
Uncooked seafood, and eggs
Dogs and cats, turtles, snakes, birds, and lizards, among other animals.
Soil
Other children
Handwashing can remove harmful bacteria and will help to prevent foodborne illness. Instructing other children in a family on good handwashing will help to limit the spread of bacteria that cause illness.
Handwashing is most effective in providing safe food for the infant during 'key times':
Before preparing and feeding bottles or foods to the baby.
Before touching the baby's mouth.
Before touching pacifiers or other things that go into the baby's mouth.
After using the toilet or changing diapers.
Infant formula
Though breastfeeding helps prevent many kinds of sicknesses among infants, caregivers often choose to use infant formula. Promoting food safety in infants requires safe preparation and use.
Use infant formula within two hours of preparation. If the infant does not finish the entire bottle, the remainder |
https://en.wikipedia.org/wiki/Group-stack | In algebraic geometry, a group-stack is an algebraic stack whose categories of points have group structures or even groupoid structures in a compatible way. It generalizes a group scheme, which is a scheme whose sets of points have group structures in a compatible way.
Examples
A group scheme is a group-stack. More generally, a group algebraic-space, an algebraic-space analog of a group scheme, is a group-stack.
Over a field k, a vector bundle stack on a Deligne–Mumford stack X is a group-stack such that there is a vector bundle V over k on X and a presentation . It has an action by the affine line corresponding to scalar multiplication.
A Picard stack is an example of a group-stack (or groupoid-stack).
Actions of group-stacks
The definition of a group action of a group-stack is a bit tricky. First, given an algebraic stack X and a group scheme G on a base scheme S, a right action of G on X consists of
a morphism ,
(associativity) a natural isomorphism , where m is the multiplication on G,
(identity) a natural isomorphism , where is the identity section of G,
that satisfy the typical compatibility conditions.
If, more generally, G is a group-stack, one then extends the above using local presentations.
Notes
References
Algebraic geometry |
https://en.wikipedia.org/wiki/Donecle | Donecle is a Toulouse-based aircraft manufacturer which develops autonomous aircraft inspection UAVs. The company offers single UAVs and swarms of UAVs to visually inspect the exterior of airliners.
Autonomous navigation of the UAVs is based on laser positioning technology. UAVs take pictures of the aircraft with high resolution cameras. Image processing and machine learning algorithms analyse the images. The system then provides a diagnostic of the aircraft surface to a qualified inspector, who reviews the images and validates or refutes the provided analysis.
The company works with airlines such as Air France Industries-KLM and aircraft manufacturers such as Dassault Aviation and is one of the players in the field of aeronautical maintenance automation.
History
Background
Aircraft manufacturers, such as Airbus, Boeing and ATR, and certification bodies, such as the Federal Aviation Administration (FAA) and the European Aviation Safety Agency (EASA), require regular visual inspections of the entire external surface of the aircraft to assess the condition of their structures. About 80% of the required inspections are visual. All aircraft are visually inspected prior to each flight, as part of scheduled maintenance operations and after unplanned events such as a lightning strike, hail storm or other possible external damage. One possible solution to improve the traceability of these operations and reduce costs is the robotization of aeronautical maintenance and its visual inspections.
In January 2013, the French research and development project Air-Cobot began to develop a collaborative mobile robot capable of inspecting an aircraft during maintenance operations. Carried out by the Akka Technologies group, this multi-partner project involved research laboratories and companies, including Airbus. In 2014, in partnership with the Bristol Robotics Laboratory, the British airline easyJet became interested in drones guided by technicians to reduce the inspection tim |
https://en.wikipedia.org/wiki/Exchange%20to%20exchange | Exchange to exchange (sometimes Exchange-to-exchange, abbreviated E2E) is integration, between certain pairs of computer systems. To qualify as E2E, each of the paired systems must have a primary use of acting as an exchange, or gateway, among its own customers.
A common example is a connection between stock brokerage firms' internal systems and systems of a stock market in which the broker trades. These connections are often facilitated by middleware services, such as object request brokers.
Each E2E partner system has a primary function to its own clients of allowing them to transfer information or conduct other transactions, This is a form of the business to business (B2B) commerce model, as each E2E partner is a B2B gateway for its clients, and in turn exchanges information with at least one other B2B gateway. The connection between the two B2B systems (exchanges) is then an exchange to exchange integration.
E2E is an alternative to direct application to application integration (A2A), though some A2A can be classified as E2E.
References
Systems engineering
Systems analysis
Interoperability |
https://en.wikipedia.org/wiki/Scene%20text | Scene text is text that appears in an image captured by a camera in an outdoor environment. The detection and recognition of scene text from camera captured images are computer vision tasks which became important after smart phones with good cameras became ubiquitous. The text in scene images varies in shape, font, colour and position. The recognition of scene text is further complicated sometimes by non-uniform illumination and focus.
To improve scene text recognition, the International Conference on Document Analysis and Recognition (ICDAR) conducts a robust reading competition once in two years. The competition was held in 2003, 2005 and during every ICDAR conference. International association for pattern recognition (IAPR) has created a list of datasets as Reading systems.
Text detection
Text detection is the process of detecting the text present in the image, followed by surrounding it with a rectangular bounding box. Text detection can be carried out using image based techniques or frequency based techniques.
In image based techniques, an image is segmented into multiple segments. Each segment is a connected component of pixels with similar characteristics. The statistical features of connected components are utilised to group them and form the text. Machine learning approaches such as support vector machine and convolutional neural networks are used to classify the components into text and non-text.
In frequency based techniques, discrete Fourier transform (DFT) or discrete wavelet transform (DWT) are used to extract the high frequency coefficients. It is assumed that the text present in an image has high frequency components and selecting only the high frequency coefficients filters the text from the non-text regions in an image.
Word recognition
In word recognition, the text is assumed to be already detected and located and the rectangular bounding box containing the text is available. The word present in the bounding box needs to be recognized. The |
https://en.wikipedia.org/wiki/International%20Roadmap%20for%20Devices%20and%20Systems | The International Roadmap for Devices and Systems, or IRDS, is a set of predictions about likely developments in electronic devices and systems. The IRDS was established in 2016 and is the successor to the International Technology Roadmap for Semiconductors.
These predictions are intended to allow coordination of efforts across academia, manufacturers, equipment suppliers, and national research laboratories.
The IEEE specifies the goals of the roadmap as:
Identifying key trends related to devices, systems, and all related technologies by generating a roadmap with a 15-year horizon
Determining generic devices and systems needs, challenges, potential solutions, and opportunities for innovation.
Encouraging related activities world-wide through collaborative events such as related IEEE conferences and roadmap workshops
The executive committee is drawn from regions with a major stake in developments in electronics: Europe, South Korea, Japan, Taiwan, and the United States.
International Focus Teams (IFTs) assess present status and future evolution of the ecosystem in their specific field of expertise and produce a 15-year roadmap. IFT reports includes evolution, key challenges, major roadblocks, and possible solutions. IFTs include:
Application Benchmarking
Systems and Architectures
More Moore - further developments in traditional integrated circuits, referring to historical improvements described by Moore's law
Beyond CMOS - technologies that may allow further progress once CMOS reaches its fundamental limits.
Packaging Integration
Outside System Connectivity
Factory Integration
Lithography
Metrology
Emerging Research Materials
Environment, Safety, Health, and Sustainability
Yield Enhancement
Cryogenic Electronics and Quantum Information Processing (added in 2018)
References |
https://en.wikipedia.org/wiki/Chandrasekhar%27s%20X-%20and%20Y-function | In atmospheric radiation, Chandrasekhar's X- and Y-function appears as the solutions of problems involving diffusive reflection and transmission, introduced by the Indian American astrophysicist Subrahmanyan Chandrasekhar. The Chandrasekhar's X- and Y-function defined in the interval , satisfies the pair of nonlinear integral equations
where the characteristic function is an even polynomial in generally satisfying the condition
and is the optical thickness of the atmosphere. If the equality is satisfied in the above condition, it is called conservative case, otherwise non-conservative. These functions are related to Chandrasekhar's H-function as
and also
Approximation
The and can be approximated up to nth order as
where and are two basic polynomials of order n (Refer Chandrasekhar chapter VIII equation (97)), where are the zeros of Legendre polynomials and , where are the positive, non vanishing roots of the associated characteristic equation
where are the quadrature weights given by
Properties
If are the solutions for a particular value of , then solutions for other values of are obtained from the following integro-differential equations
For conservative case, this integral property reduces to
If the abbreviations for brevity are introduced, then we have a relation stating In the conservative, this reduces to
If the characteristic function is , where are two constants, then we have .
For conservative case, the solutions are not unique. If are solutions of the original equation, then so are these two functions , where is an arbitrary constant.
See also
Chandrasekhar's H-function
References
Special functions
Integral equations
Scattering
Scattering, absorption and radiative transfer (optics) |
https://en.wikipedia.org/wiki/Online%20discussion%20platform | An online discussion platform is an online platform that allows for, or is built specifically for, online discussion.
History
In 1979 students from Duke University created the first online discussion platform with Usenet.
Uses
Online discussion platforms can engage people in collective reflection and exchanging perspectives and cross-cultural understanding.
Public display of ideas can encourage intersubjective meaning making.
Online discussion platforms may be an important structural means for effective large-scale participation.
In education
Online discussion platforms can play a role in education. In recent years, online discussion platform have become a significant part of not only distance education but also in campus-based settings.
The proposed interactive e-learning community (iELC) is a platform that engages physics students in online and classroom learning tasks. In brief classroom discussions fundamental physics formulas, definitions and concepts are disclosed, after which students participate in the iELC form discussion and utilize chat and dialogue tools to improve their understanding of the subject. The teacher then discusses selected forum posts in the subsequent classroom session.
Classroom online discussion platforms are one type of such platforms.
Rose argues that the basic motivation for the development of e–learning platforms is efficiency of scale — teaching more students for less money.
A study found that learners will enhance the frequencies of course discussion and actively interact with e-learning platform when e-learning platform integrates the curriculum reward mechanism into learning activities.
In smart cities
"City townhall" includes a participation platform for policy-making in Rotterdam.
In 2022, United Nations reported that D-Agree Afghanistan is used as a digital and smart city solutions in Afghanistan. D-Agree, is a discussion support platform with artificial intelligence–based facilitation. The discussion trees in |
https://en.wikipedia.org/wiki/Knower%20paradox | The knower paradox is a paradox belonging to the family of the paradoxes of self-reference (like the liar paradox). Informally, it consists in considering a sentence saying of itself that it is not known, and apparently deriving the contradiction that such sentence is both not known and known.
History
A version of the paradox occurs already in chapter 9 of Thomas Bradwardine’s Insolubilia. In the wake of the modern discussion of the paradoxes of self-reference, the paradox has been rediscovered (and dubbed with its current name) by the US logicians and philosophers David Kaplan and Richard Montague, and is now considered an important paradox in the area. The paradox bears connections with other epistemic paradoxes such as the hangman paradox and the paradox of knowability.
Formulation
The notion of knowledge seems to be governed by the principle that knowledge is factive:
(KF): If the sentence ' P ' is known, then P
(where we use single quotes to refer to the linguistic expression inside the quotes and where 'is known' is short for 'is known by someone at some time'). It also seems to be governed by the principle that proof yields knowledge:
(PK): If the sentence ' P ' has been proved, then ' P ' is known
Consider however the sentence:
(K): (K) is not known
Assume for reductio ad absurdum that (K) is known. Then, by (KF), (K) is not known, and so, by reductio ad absurdum, (K) is not known. Now, this conclusion, which is the sentence (K) itself, depends on no undischarged assumptions, and so has just been proved. Therefore, by (PK), we can further conclude that (K) is known. Putting the two conclusions together, we have the contradiction that (K) is both not known and known.
Solutions
Since, given the diagonal lemma, every sufficiently strong theory will have to accept something like (K), absurdity can only be avoided either by rejecting one of the two principles of knowledge (KF) and (PK) or by rejecting classical logic (which validates the reasoning fro |
https://en.wikipedia.org/wiki/Flood.io | Flood IO is a load testing platform that executes globally-distributed performance tests from open source tools, including JMeter, Gatling, and Selenium. It also runs test plans written with Ruby JMeter, an open source RubyGem.
Tricentis Flood
Flood is SaaS load testing service that runs existing test scripts across a globally-distributed grid infrastructure. It was built with a shared nothing architecture and integrates with AWS and Azure. Users can generate over 1 million globally-distributed requests per second without manually setting up the associated infrastructure or correlating the distributed results. The service provides detailed analysis reports and real-time monitoring.
In July 2017, Flood IO was acquired by Tricentis and now goes by the name Tricentis Flood
Ruby JMeter
Ruby JMeter is a RubyGem that lets users write test plans for JMeter in any text editor with an expressive domain-specific language for communication with JMeter. It also includes API integration with Flood. Ruby JMeter is licensed as open-source software under the MIT License, which means it permits reuse within proprietary software provided that all copies of the licensed software include a copy of the MIT License terms and the copyright notice.
Flood Element
Flood Element is a load generation tool which uses the Google Chrome web browser to generate load on a web application by spawning thousands of browser instances and running a predefined test script to simulate a series of user interactions. Flood Element test scripts are written in TypeScript and follow a similar syntax to Selenium.
See also
Load testing tools
Performance Engineering
JMeter
Gatling
Selenium
Software performance testing
Software testing
Web server benchmarking
References
External links
Flood home page
Load testing tools
Software testing tools |
https://en.wikipedia.org/wiki/Azure%20Data%20Lake | Azure Data Lake is a scalable data storage and analytics service. The service is hosted in Azure, Microsoft's public cloud.
History
Azure Data Lake service was released on November 16, 2016. It is based on COSMOS, which is used to store and process data for applications such as Azure, AdCenter, Bing, MSN, Skype and Windows Live. COSMOS features a SQL-like query engine called SCOPE upon which U-SQL was built.
Azure Data Lake Store
Users can store structured, semi-structured or unstructured data produced from applications including social networks, relational data, sensors, videos, web apps, mobile or desktop devices. A single Azure Data Lake Store account can store trillions of files where a single file can be greater than a petabyte in size.
Azure Data Lake Analytics
Azure Data Lake Analytics is a parallel on-demand job service. The parallel processing system is based on Microsoft Dryad. Dryad can represent arbitrary Directed Acyclic Graphs (DAGs) of computation. Data Lake Analytics provides a distributed infrastructure that can dynamically allocate or de-allocate resources so customers pay for only the services they use.
Azure Data Lake Analytics uses Apache YARN, the part of Apache Hadoop which governs resource management across clusters. Microsoft Azure Data Lake Store supports any application that uses the Hadoop Distributed File System (HDFS) interface.
U-SQL
Using Data Lake Analytics, users can develop and run parallel data transformation and processing programs in U-SQL, a query language that combines SQL with C#. U-SQL was designed as an evolution of the declarative SQL language with native extensibility through the user code written in C#. U-SQL uses C# data types and the C# expression language.
See also
Data lake
References
External links
Data Lake on Microsoft Azure
Cloud computing
Cloud computing providers
Cloud infrastructure
Cloud platforms
Microsoft cloud services |
https://en.wikipedia.org/wiki/Patton%20Electronics | Patton Electronics was incorporated in 1984 and headquartered in Gaithersburg, Maryland, USA. Patton manufacture devices ranging from micro-sized widgets that connect "this-with-that," to carrier-grade Telecom gear that connects subscribers to service providers. Patton Electronics offers a wide range of electrical solutions.
References
External links
Patton Company Website
About Patton Electronics
Networking companies of the United States
Companies based in Gaithersburg, Maryland
Telecommunications companies established in 1984
1984 establishments in Maryland |
https://en.wikipedia.org/wiki/Marshall%E2%80%93Olkin%20exponential%20distribution | In applied statistics, the Marshall–Olkin exponential distribution is any member of a certain family of continuous multivariate probability distributions with positive-valued components. It was introduced by Albert W. Marshall and Ingram Olkin.
One of its main uses is in reliability theory, where the Marshall–Olkin copula models the dependence between random variables subjected to external shocks.
Definition
Let be a set of independent, exponentially distributed random variables, where has mean . Let
The joint distribution of is called the Marshall–Olkin exponential distribution with parameters
Concrete example
Suppose b = 3. Then there are seven nonempty subsets of { 1, ..., b } = { 1, 2, 3 }; hence seven different exponential random variables:
Then we have:
References
Xu M, Xu S. "An Extended Stochastic Model for Quantitative Security Analysis of Networked Systems". Internet Mathematics, 2012, 8(3): 288–320.
Statistics articles needing expert attention
Continuous distributions
Exponentials
Exponential family distributions |
https://en.wikipedia.org/wiki/TRS-80%20character%20set | The TRS-80 computer manufacturered by Tandy / Radio Shack contains an 8-bit character set. It is partially derived from ASCII, and shares the code points from 32 - 95 on the standard model. Code points 96 - 127 are supported on models that have been fitted with a lower-case upgrade.
The character set consists of letters, various numeric and special characters as well as 64 semigraphics called squots (square dots) from a 2×3 matrix. These were located at code points 128 to 191 with bits 5-0 following their binary representation, similar to alpha-mosaic characters in World System Teletext. These characters were used for graphics in games, such as Android Nim.
Character set
The following table shows the TRS-80 model I character set. Each character is shown with a potential Unicode equivalent. Space and control characters are represented by the abbreviations for their names.
References
Citations
Sources
Further reading
Character sets
TRS-80 |
https://en.wikipedia.org/wiki/Cross%20slip | In materials science, cross slip is the process by which a screw dislocation moves from one slip plane to another due to local stresses. It allows non-planar movement of screw dislocations. Non-planar movement of edge dislocations is achieved through climb.
Since the Burgers vector of a perfect screw dislocation is parallel to the dislocation line, it has an infinite number of possible slip planes (planes containing the dislocation line and the Burgers vector), unlike an edge or mixed dislocation, which has a unique slip plane. Therefore, a screw dislocation can glide or slip along any plane that contains its Burgers vector. During cross slip, the screw dislocation switches from gliding along one slip plane to gliding along a different slip plane, called the cross-slip plane. The cross slip of moving dislocations can be seen by transmission electron microscopy.
Mechanisms
The possible cross-slip planes are determined by the crystal system. In body centered cubic (BCC) metals, a screw dislocation with b=0.5<11> can glide on {110} planes or {211} planes. In face centered cubic (FCC) metals, screw dislocations can cross-slip from one {111} type plane to another. However, in FCC metals, pure screw dislocations dissociate into two mixed partial dislocations on a {111} plane, and the extended screw dislocation can only glide on the plane containing the two partial dislocations. The Friedel-Escaig mechanism and the Fleischer mechanism have been proposed to explain the cross-slip of partial dislocations in FCC metals.
In the Friedel-Escaig mechanism, the two partial dislocations constrict to a point, forming a perfect screw dislocation on their original glide plane, and then re-dissociate on the cross-slip plane creating two different partial dislocations. Shear stresses then may drive the dislocation to extend and move onto the cross-slip plane. Atomic simulations have confirmed the Friedel-Escaig mechanism.
Alternatively, in the Fleischer mechanism, one partial dislo |
https://en.wikipedia.org/wiki/Network%20eavesdropping | Network eavesdropping, also known as eavesdropping attack, sniffing attack, or snooping attack, is a method that retrieves user information through the internet. This attack happens on electronic devices like computers and smartphones. This network attack typically happens under the usage of unsecured networks, such as public wifi connections or shared electronic devices. Eavesdropping attacks through the network is considered one of the most urgent threats in industries that rely on collecting and storing data. Internet users use eavesdropping via the Internet to improve information security.
A typical network eavesdropper may be called a Black-hat hacker and is considered a low-level hacker as it is simple to network eavesdrop successfully. The threat of network eavesdroppers is a growing concern. Research and discussions are brought up in the public's eye, for instance, types of eavesdropping, open-source tools, and commercial tools to prevent eavesdropping. Models against network eavesdropping attempts are built and developed as privacy is increasingly valued. Sections on cases of successful network eavesdropping attempts and its laws and policies in the National Security Agency are mentioned. Some laws include the Electronic Communications Privacy Act and the Foreign Intelligence Surveillance Act.
Types of attacks
Types of network eavesdropping include intervening in the process of decryption of messages on communication systems, attempting to access documents stored in a network system, and listening on electronic devices. Types include electronic performance monitoring and control systems, keystroke logging, man-in-the-middle attacks, observing exit nodes on a network, and Skype & Type.
Electronic performance monitoring and control systems (EPMCSs)
Electronic performance monitoring and control systems are used by employees or companies and organizations to collect, store, analyze, and report actions or performances of employers when they are working. Th |
https://en.wikipedia.org/wiki/Video%20line%20selector | A video line selector is an electronic circuit or device for picking a line from an analog video signal. The input of the circuit is connected to an analog video source, the output triggers an oscilloscope, so display the selected line on the oscilloscope or similar device.
Properties
Video line selectors are circuits or units of other devices, fitted to the demand of the unit or a separate device for use in workshops, production and laboratories. They contain analog and digital circuits and an internal or external DC power supply. There's a video signal input, sometimes an output to prevent reflexions of the video signal and the cause of shadows of the video picture, also a trigger output. There is also an input or adjust for the line number(s) to be picked out and as an option an automatic or manual setting to fit other video standards and non-interlaced video. Video line selectors do not need all the picture signal, just the synchronisation signals are needed. Sometimes inputs for H- and V-sync were installed, only.
Setup and References
The video signal input is 75 Ω terminated or connected to the video output for a monitor. The amplified video signal is connected to the inputs of the H- und V-sync detector circuits. The H-sync detector outputs the horizontal synchronisation pulse filtered from the video signal. This is the line synchronisation and makes the lines fit vertically. The V-sync detector filters the vertical synchronisation and makes the picture fit the same position on the screen than the previous one.
Both synchronisation output pulses are fed to a digital synchron counter. The V-sync resets the counter. The H-sync is being counted. On every frame picture, the counter is being reset and the lines were counted. Most often interlaced video was used, spitting up a picture in the odd numbered lines, followed by the even-numbered lines in a half picture each. (→deninterlacing).
Interlace video requires a V-sync detector which detects first a second |
https://en.wikipedia.org/wiki/Flutter%20%28software%29 | Flutter is an open-source UI software development kit created by Google. It is used to develop cross platform applications from a single codebase for any web browser, Fuchsia, Android, iOS, Linux, macOS, and Windows. First described in 2015, Flutter was released in May 2017.
History
The first version of Flutter was known as "Sky" and ran on the Android operating system. It was unveiled at the 2015 Dart developer summit with the stated intent of being able to render consistently at 120 frames per second. During the keynote of Google Developer Days in Shanghai in September 2018, Google announced Flutter Release Preview 2, the last major release before Flutter 1.0. On December 4, 2018, Flutter 1.0 was released at the Flutter Live event, denoting the first stable version of the framework. On December 11, 2019, Flutter 1.12 was released at the Flutter Interactive event.
On May 6, 2020, the Dart software development kit (SDK) version 2.8 and Flutter 1.17.0 were released, adding support for the Metal API which improves performance on iOS devices by approximately 50%, as well as new Material widgets and network tracking development tools.
On March 3, 2021, Google released Flutter 2 during an online Flutter Engage event. This major update brought official support for web-based applications with a new Canvas Kit renderer and web specific widgets, early-access desktop application support for Windows, macOS, and Linux and improved Add-to-App APIs. This release also utilized Dart 2.0 that featured null-safety, which caused many breaking changes and issues with many external packages; however, the Flutter team included instructions and tools to mitigate these issues.
On September 8, 2021, Dart 2.14 and Flutter 2.5 were released by Google. The update brought improvements to the Android full-screen mode and the latest version of Google's Material Design called Material You. Dart received two new updates, standardizing lint conditions and marking support for Apple Silicon as st |
https://en.wikipedia.org/wiki/Gun%20Violence%20Archive | Gun Violence Archive (GVA) is an American nonprofit group with an accompanying website and social media delivery platforms which catalogs every incident of gun violence in the United States. It was founded by Michael Klein and Mark Bryant.
Klein is the founder of Sunlight Foundation, and Bryant is a retired systems analyst.
Website
GVA maintains a database of known shootings in the United States, coming from law enforcement, media and government sources from all 50 states.
GVA's statistics, mapping, methodology and definitions are found on the organisation's website.
The website records police shooting injuries and deaths, mass shootings, individual gun related incidents, suicides, injuries, teen, child and adult related injuries and deaths.
History
GVA was established in 2013 and began in 2014 and is ongoing. It provides gun violence data and statistics. Gaps in both CIA and FBI data, as well as their lagging distribution, showed a need for near real-time data collection. The GVA typically publishes incidents in its database within 3 days whereas the government agencies like the FBI usually take months or years.
GVA has a staff of professionals, with specialities from MSLS/MIS-degreed researchers and data archivists to systems architects and software engineers.
See also
Armed violence reduction
Crime in the United States
Firearm death rates in the United States by state
Gun cultures
Gun show loophole
Gunfire locator
Gunshot wound
Index of gun politics articles
List of countries by firearm-related death rate
Second Amendment to the United States Constitution
References
External links
Gun violence in the United States
Internet properties established in 2013
Online databases
Gun violence
Gun politics
Violence |
https://en.wikipedia.org/wiki/Graphcore | Graphcore is a British semiconductor company that develops accelerators for AI and machine learning. It aims to make a massively parallel Intelligence Processing Unit (IPU) that holds the complete machine learning model inside the processor.
History
Graphcore was founded in 2016 by Simon Knowles and Nigel Toon.
In the autumn of 2016, Graphcore secured a first funding round led by Robert Bosch Venture Capital. Other backers include Samsung, Amadeus Capital Partners, C4 Ventures, Draper Esprit, Foundation Capital, and Pitango.
In July 2017, Graphcore secured a round B funding led by Atomico, which was followed a few months later by $50 million in funding from Sequoia Capital.
In December 2018, Graphcore closed its series D with $200 million raised at a $1.7 billion valuation, making the company a unicorn. Investors included Microsoft, Samsung and Dell Technologies.
On 13 November 2019, Graphcore announced that their Graphcore C2 IPUs are available for preview on Microsoft Azure.
Meta Platforms acquired the AI networking technology team from Graphcore in early 2023.
Products
In 2016, Graphcore announced the world's first graph tool chain designed for machine intelligence called Poplar Software Stack.
In July 2017, Graphcore announced their first chip, called the Colossus GC2, a "16 nm massively parallel, mixed-precision floating point processor", first available in 2018. Packaged with two chips on a single PCI Express card called the Graphcore C2 IPU (an Intelligence Processing Unit), it is stated to perform the same role as a GPU in conjunction with standard machine learning frameworks such as TensorFlow. The device relies on scratchpad memory for its performance rather than traditional cache hierarchies.
In July 2020, Graphcore presented their second generation processor called GC200 built in TSMC's 7nm FinFET manufacturing process. GC200 is a 59 billion transistor, 823 square-millimeter integrated circuit with 1,472 computational cores and 900 Mbyte of loca |
https://en.wikipedia.org/wiki/Serbian%20Citation%20Index | Serbian Citation Index (; SCIndeks) is a combination of an online multidisciplinary bibliographic database, a national citation index, an Open Access full-text journal repository and an electronic publishing platform. It is produced and maintained by the Centre for Evaluation in Education and Science (CEON/CEES), based in Belgrade, Serbia. In July 2017, it indexed 230 Serbian scholarly journals in all areas of science and contained more than 80,000 bibliographic records and more than one million bibliographic references.
SCIndeks operates as a DOI registration agency and an OAI-PMH data provider. It is also an OpenAIRE data provider. Serbian Citation Index is a member of the Committee on Publication Ethics (COPE).
Features
While the content of SCIndeks is freely available to users, the publishers of the indexed journals subscribe to one of four service packages that provide various levels of content indexing and quality control: from basic bibliographic data (no full text) to full-text availability, DOI assignment, bibliometric evaluation, journal management support and plagiarism detection.
The core of SCIndeks is a searchable bibliographic database that also contains citation information. It relies on a full text repository (SCIndeks Repository). The repository and journal profiles are maintained through the Editor Service, a back-end platform for journal editors. Publishers may also subscribe to SCIndeks Assistant, a journal management system based on Open Journal Systems and enriched with a number of in-house developed services, tools and protocols that enable the normalization of names, affiliations and funding information; automated parsing and formatting of references; matching of references and citations; keywords assignment, etc. SCIndeks Assistant also enables plagiarism detection through CrossRef Similarity Check, using iThenticate.
Bibliometric data contained in SCindeks are used to generate cumulative annual reports on the performance of the indexe |
https://en.wikipedia.org/wiki/Syrian%20Collegiate%20Programming%20Contest | ACM Syrian Collegiate Programming Contest (abbreviated as ACM-SCPC or SCPC) is an annual multi-tiered competitive programming competition among the universities of Syria and it's a qualifying round to the ACM Arabian Collegiate Programming Contest (ACPC). Winners of the SCPC qualify to the ACPC Finals. It is usually held in July of each year. Headquartered at SCS Syrian Computer Society. The SCPC operates in autonomous cities in Syria under the auspices of the ICPC Foundation in accordance with the ACPC Policies and Procedures.
History
The SCPC traces its roots to a competition held at SCS Syrian Computer Society in 2011. Then, it was also hosted at SCS Syrian Computer Society in 2012 and 2013. In 2014, it was co-hosted by Damascus and Tishreen University. In 2015, it was hosted at Tishreen University. In 2016, it was hosted by the Higher Institute of Applied Sciences and Technology. In 2017, it was hosted by the Syrian Virtual University.
Latest (RIP English) SCPC Standings
SCPC 2017 First 10 places
See also
ACM Student Research Competition
Competitive programming, a type of mind sport involved in programming competitions
International Collegiate Programming Contest
Online judge, a service to practice for programming contests and run them online
PC², the Programming Contest Control System in support of Computer Programming Contest activities (used at ICPC World Finals until 2008)
References
External links
Official Website of the ACM-SCPC
Official Website of the ACM-ICPC - maintained at Baylor University.
ACM-ICPC Live Archive - maintained at Baylor University.
ACM-SCPC - Facebook
Programming contests |
https://en.wikipedia.org/wiki/Uniphore | Uniphore is a conversational automation technology company. Uniphore sells software for conversational analytics, conversational assistants and conversational security. The company is headquartered in Palo Alto, California, with offices in the United States, Singapore, India, Japan, Spain, and Israel. Its products help up to 75,000 customer service agents during approximately 160 million interactions per month.
Deloitte Technology Fast 50 India identified Uniphore as the 17th fastest-growing technology company in India in 2012 and one of the top 500 fastest growing companies in the Asia-Pacific region in 2014. In 2016, Time included Sachdev on its list of "10 millennials who are changing the world" for “building a phone that can understand almost any language”. NASSCOM named Uniphore to its "League of 10" emerging Indian technology companies in 2017. In 2020, the San Francisco Business Times ranked Uniphore as among small companies in its list of the best places to work in the San Francisco Bay Area. In 2022, the company was featured on the Forbes AI 50 list.
History
Uniphore Software Systems was founded by Umesh Sachdev and Ravi Saraogi in 2008 and was incubated at IIT Madras. The company received an initial grant of $100,000 from the National Research Development Corporation.
Initially, the company operated a call center providing voice-based internet services to people in rural areas. Uniphore then began working on speech recognition technology, partnering with companies that specialized in English and European languages, and adapting the technology for Indian languages and dialects. In 2014, Uniphore released its flagship product, auMina, along with two other products, Akeira and amVoice.
Uniphore raised series A funding, led by Kris Gopalakrishnan (cofounder of Infosys), in April 2015. The next month, Uniphore received additional investment from IDG Ventures. With input from its investors, Uniphore changed its business model from license fee-based income |
https://en.wikipedia.org/wiki/Highsnobiety | Highsnobiety is a global fashion and lifestyle media brand founded in 2005 by David Fischer. It was bought by German e-commerce giant Zalando in 2022.
Highsnobiety is headquartered in Berlin and has offices in Amsterdam, London, Milan, New York, Los Angeles and Sydney.
Highsnobiety has a digital-first publishing approach, with a multichannel presence. The print magazine first launched in 2010, with quarterly issues published globally.
Highsnobiety Shop, a multi-brand online fashion and lifestyle retailer, was launched in 2019. Highsnobiety launched their apparel collection in 2021.
Since 2018, the brand publishes regular research papers in the fields of luxury and young consumer trends in collaboration with Boston Consulting Group.
In 2021, Highsnobiety launched Gate Zero, a travel retail concept with locations in Zurich International Airport. In 2022, travel retail company Gebr. Heinemann announced a joint venture to expand the concept, beginning with a location at Copenhagen International Airport.
Awards and honors
2022 D&AD Wood Pencil Award for Advertising, Design, Craft, Culture and Impact
2022 Webby Award for Advertising, Media & PR Fashion, Beauty & Lifestyle
2022 Webby Award for Video Fashion & Lifestyle (Branded)
2018 Digiday Award for Best In-House Content/Brand Studio
2017 Webby Award for Cultural Blog/Website
2017 BoF 500, Business of Fashion
References
External links
German news websites
Online magazines
Fashion websites
Sneaker culture |
https://en.wikipedia.org/wiki/Cumulative%20accuracy%20profile | A cumulative accuracy profile (CAP) is a concept utilized in data science to visualize discrimination power. The CAP of a model represents the cumulative number of positive outcomes along the y-axis versus the corresponding cumulative number of a classifying parameter along the x-axis. The output is called a CAP curve. The CAP is distinct from the receiver operating characteristic (ROC) curve, which plots the true-positive rate against the false-positive rate.
CAPs are used in robustness evaluations of classification models.
Analyzing a CAP
A cumulative accuracy profile can be used to evaluate a model by comparing the current curve to both the 'perfect' and a randomized curve. A good model will have a CAP between the perfect and random curves; the closer a model is to the perfect CAP, the better is.
The accuracy ratio (AR) is defined as the ratio of the area between the model CAP and random CAP, and the area between the perfect CAP and random CAP. In a successful model, the AR has values between zero and one, and the higher the value is, the stronger the model.
The cumulative number of positive outcomes indicates a model's strength. For a successful model, this value should lie between 50% and 100% of the maximum, with a higher percentage for stronger models. In sporadic cases, the accuracy ratio can be negative. In this case, the model is performing worse than the random CAP.
Applications
The cumulative accuracy profile (CAP) and ROC curve are both commonly used by banks and regulators to analyze the discriminatory ability of rating systems that evaluate credit risks. The CAP is also used by instructional design engineers to assess, retrain and rebuild instructional design models used in constructing courses, and by professors and school authorities for improved decision-making and managing educational resources more efficiently.
References
Mathematical modeling |
https://en.wikipedia.org/wiki/Who%20Dares%20Wins%20II | Who Dares Wins II is a run and gun game developed and published by Alligata Software and released in late 1985 for the Commodore 64, as well as the Amstrad CPC, Atari 8-bit family, BBC Micro, Commodore 16, Plus/4, MSX, and ZX Spectrum.
The game is a remake of the earlier Who Dares Wins, which was given an injunction after it was accused of being too similar to Commando; Computer Gamer magazine had described Who Dares Wins as an "accurate reproduction" of Commando.
Gameplay
The main character is a lone soldier sent into enemy territory, wielding a gun and five grenades. The player must capture eight enemy outposts against massive opposition. The player can blow up vehicles and rescue prisoners in each level. If the player takes too long, the prisoners are executed by firing squad.
Reception
Zzap!64 rated the game a 90/100, calling the game "fantastic" and the landscapes "incredible". It revisited the game 7 years later and gave it a revised rating of 78/100, saying that "it just hasn't weathered the years too well", but that it was "still very playable".
Dion Guy of Nintendo Life called the game something he wished was on the Nintendo Virtual Console, and "a lot of fun" despite not being extremely difficult.
References
External links
Who Dares Wins II at Atari Mania
1985 video games
Single-player video games
Shooter games
Commodore 64 games
Amstrad CPC games
Atari 8-bit family games
BBC Micro and Acorn Electron games
Commodore 16 and Plus/4 games
MSX games
Video games developed in the United Kingdom
ZX Spectrum games
Tynesoft games
Alligata games |
https://en.wikipedia.org/wiki/Kentrophoros | Kentrophoros is a genus of ciliates in the class Karyorelictea. Ciliates in this genus lack a distinct oral apparatus and depend primarily on symbiotic bacteria for their nutrition.
Systematics
Kentrophoros is the sole genus in the family Kentrophoridae Jankowski 1980. The type species of the genus is K. fasciolatus Sauerbrey 1928, first described from the Bay of Kiel. Synonyms are Centrophorus Kahl 1931 (an illegitimate synonym because the name was already used for a genus of sharks) and Centrophorella Kahl 1935. Fifteen species of Kentrophoros have been formally described, although several of these names may be synonyms for the same species.
Description
The ciliates are long and ribbon-shaped, like other karyorelictean ciliates that live in the marine interstitial habitat. In some species, the cell body is folded or involuted into a tube or more elaborate shapes. The ventral side is ciliated, while the dorsal side is mostly unciliated except for a single "circle kinety" at the margin. The dorsal side is covered with a single layer of symbiotic bacteria. Kentrophoros lacks a distinct oral apparatus, although densely-spaced kinetids associated with fibers (nematodesmata) at the anterior part of the cell may be vestiges of the oral apparatus. The number and arrangement of nuclei within the cell are also variable between species. Some species have only one micronucleus and two macronuclei, but others can have multiple clusters of macro- and micronuclei, or so-called "composite nuclei" where each cluster of macro- and micronuclei is enclosed in another membrane.
Kentrophoros live in coastal marine sediments, where they prefer the interface between oxic and anoxic layers.
Symbiotic bacteria
The dorsal side of Kentrophoros is covered in a single layer of rod-shaped bacterial symbionts. These bacteria gain their energy from oxidizing sulfide, and unlike other sulfur-oxidizing symbionts, lack the genetic capacity to fix CO2 autotrophically into biomass; instead they |
https://en.wikipedia.org/wiki/IBM%208750%20Business%20Communication%20System | The IBM 8750 Business Communications System was a voice and data switching system PABX, suitable for medium to large numbers of extensions, used on customer premises." The 8750 was the European version of the IBM 9751, also a ROLM design.
In 1984, IBM bought the American company ROLM. In 1987 IBM started to market the ROLM-derived IBM 8750 in Austria, Belgium, France, Germany, Italy, Luxemburg, and the UK. Principally for homologation, a few had been installed in IBM locations, such as IBM Havant in England – however none were installed in customer locations.
The 8750 had from 91 to 3000 telephone extensions; up to 1000 simultaneous conversations; a computer based on a Motorola 68020; up to 16 IBM 8755 Operator Consoles; a 30MB fixed disk; main/satellite working with IBM 3750 and 1750 Switching Systems; digital trunks in Belgium, Italy and the UK; and ISDN and Systems Network Architecture (SNA) networks.
IBM later sold ROLM to Siemens who then continued to market the 8750.
See also
IBM 1750, 2750 and 3750 Switching Systems
References
Telephone exchange equipment
8750
8750 |
https://en.wikipedia.org/wiki/Nephromyces | Nephromyces is a genus of apicomplexans that are symbionts of the ascidian genus Molgula (sea grapes).
Systematics
Nephromyces was first described in 1888 by Alfred Mathieu Giard as a chytrid fungus, because of its filamentous cells. He formally named three species, each corresponding to a different species of the host animal. Molecular phylogenetics later showed that Nephromyces are not actually fungi, but instead constitute a group within the Apicomplexa that is related to the Piroplasmida.
Species of Nephromyces
Nephromyces molgularum Giard, 1888
Nephromyces rosocovitanus Giard, 1888
Nephromyces sorokini Giard, 1888
Description
Nephromyces is found in the lumen of the renal sac of its host animals. The renal sac is a closed, fluid-filled structure that is derived from the epicardium during development. There are different cell types (at least seven in Nephromyces from Molgula manhattensis) which appear to be different life cycle stages, as the different types appear in a consistent sequence after initial infection of the host animal. However, in a mature infection, different stages simultaneously co-occur in the same host individual. They include filaments (trophic stages), spores, motile but non-flagellated cells, and biflagellated swarmer cells. The non-flagellated motile cells resemble the sporozoites of other apicomplexans, while the spores contain structures that resemble the rhoptries of the apical complex, another typical apicomplexan feature.
Symbiosis
Nephromyces is specific to the family Molgulidae, and has been found in species of Molgula and at least one other molgulid genus, Bostrichobranchus (B. pilularis). Every wild-collected adult Molgula animal examined has been found to contain Nephromyces, suggesting that it is a beneficial symbiont rather than a parasite; this makes Nephromyces an exception among apicomplexans, which are usually parasitic on their animal hosts. However, animals without Nephromyces can be obtained by spawning and r |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.