source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Semisimple%20representation | In mathematics, specifically in representation theory, a semisimple representation (also called a completely reducible representation) is a linear representation of a group or an algebra that is a direct sum of simple representations (also called irreducible representations). It is an example of the general mathematical notion of semisimplicity.
Many representations that appear in applications of representation theory are semisimple or can be approximated by semisimple representations. A semisimple module over an algebra over a field is an example of a semisimple representation. Conversely, a semisimple representation of a group G over a field k is a semisimple module over the group ring k[G].
Equivalent characterizations
Let V be a representation of a group G; or more generally, let V be a vector space with a set of linear endomorphisms acting on it. In general, a vector space acted on by a set of linear endomorphisms is said to be simple (or irreducible) if the only invariant subspaces for those operators are zero and the vector space itself; a semisimple representation then is a direct sum of simple representations in that sense.
The following are equivalent:
V is semisimple as a representation.
V is a sum of simple subrepresentations.
Each subrepresentation W of V admits a complementary representation: a subrepresentation W such that .
The equivalences of the above conditions can be shown based on the next lemma, which is of independent interest:
Proof of the lemma: Write where are simple representations. Without loss of generality, we can assume are subrepresentations; i.e., we can assume the direct sum is internal. Now, consider the family of all possible direct sums with various subsets . Put the partial ordering on it by saying the direct sum over K is less than the direct sum over J if . By Zorn's lemma, we can find a maximal such that . We claim that . By definition, so we only need to show that . If is a proper subrepresentatiom of then t |
https://en.wikipedia.org/wiki/Risk-sensitive%20foraging%20models | Risk-sensitive foraging models help to explain the variance in foraging behaviour in animals. This model allows powerful predictions to be made about expected foraging behaviour for individual groups of animals. Risk sensitive foraging is based on experimental evidence that the net energy budget level of an animal is predictive of type of foraging activity an animal will employ. Experimental evidence has indicated that individuals will change the type of foraging strategy that they use depending on environmental conditions and ability to meet net energy levels. When individuals can meet net energy level requirements by accessing food in risk aversive methods they do so. However, when net energy level requirements are not met by employing risk aversive methods, individuals are more likely to take risk prone actions in order to meet their net energy requirements.
Caraco’s experiment (Juncos)
Thomas Caraco and his colleagues in 1980 were amongst the first to study risk sensitive foraging behaviour in yellow-eyed juncos. For the original study seven yellow-eyed juncos were used in a two-part experiment. Part one examined foraging behaviours in five juncos when they were given a choice of eating on a perch where enough seeds were placed every time to meet their 24-hour energy requirements, or on a perch where they would sometimes find an abundance of seeds and sometimes no seeds. All individuals showed a preference to feed at the perch where they could get their daily seed requirement, the risk aversive choice. Part two examined foraging preference in four juncos, on one perch seeds were present every time but not enough to meet their 24-hour energy requirement. On the other perch they could sometimes find and abundance of seeds or no seeds. In this case the juncos showed a preference to feeding at the variable reward perch, choosing the risk prone feeding option. In order to test if individuals would change their strategy as a result of changed environment, two of the |
https://en.wikipedia.org/wiki/Pump-areometer | The Pump-areometer was an early hydrometer (a variant of the syphon-hydrometer), credited to Floris Nollet.
Principle
The principle is an inverted glass tube with one leg in each of two liquids, the upper end being connected to a pump. Once sufficient air is removed from the pipe, the liquids rise in both legs, in inverse proportion to their density. If the density of one liquid is known, that of the other can be simply calculated. A reasonably wide tube is used to minimise the effects of capillary attraction.
More sophisticated "four leg" variants could eliminate the capillary effect on the calculation.
See also
Specific gravity
References
Measuring instruments
Laboratory equipment |
https://en.wikipedia.org/wiki/Himanshu%20Pandya | Himanshu Pandya is an Indian professor and academic at Botany Department Gujarat University, Ahmedabad, Gujarat, India. He earned a MSc and PhD in botany and areas of specialization In vivo and In vitro studies on physiological and biochemical parameters on Gladiolus, Chrysanthemum and Lily.
Career
Pandya taught for 27 years. He is also a professor and Head of the Department of Biochemistry and Forensic Science. His research focused on horticulture, plant biotechnology, plant physiology, plant biochemistry, bioinformatics, climate change and impacts management, forensic science, and biochemistry.
From 2005 - 2017 he was a Professor in the Department of Botany, Bioinformatics and Climate Change Impacts Management.
In 2017 he became Vice Chancellor of the Gujarat University.
References
Living people
Academic staff of Gujarat University
Year of birth missing (living people)
Botany |
https://en.wikipedia.org/wiki/OpenQASM | Open Quantum Assembly Language (OpenQASM; pronounced open kazm) is a programming language designed for describing quantum circuits and algorithms for execution on quantum computers. It is designed to be an intermediate representation that can be used by higher-level compilers to communicate with quantum hardware, and allows for the description of a wide range of quantum operations, as well as classical feed-forward flow control based on measurement outcomes.
The language includes a mechanism for describing explicit timing of instructions, and allows for the attachment of low-level definitions to gates for tasks such as calibration. OpenQASM is not intended for general-purpose classical computation, and hardware implementations of the language may not support the full range of data manipulation described in the specification. Compilers for OpenQASM are expected to support a wide range of classical operations for compile-time constants, but the support for these operations on runtime values may vary between implementations.
The language was first described in a paper published in July 2017, and a reference source code implementation was released as part of IBM's Quantum Information Software Kit (Qiskit) for use with their IBM Quantum Experience cloud quantum computing platform. The language has similar qualities to traditional hardware description languages such as Verilog.
OpenQASM defines its version at the head of a source file as a number, as in the declaration: OPENQASM 3;
The level of OpenQASM's original published implementations is OpenQASM 2.0. Version 3.0 of the specification is the current one and can be viewed at the OpenQASM repository on GitHub.
Examples
The following is an example of OpenQASM source code from the official library. The program adds two four-bit numbers.
/*
* quantum ripple-carry adder
* Cuccaro et al, quant-ph/0410184
*/
OPENQASM 3;
include "stdgates.inc";
gate majority a, b, c {
cx c, b;
cx c, a;
ccx a, b, c;
}
ga |
https://en.wikipedia.org/wiki/Quil%20%28instruction%20set%20architecture%29 | Quil is a quantum instruction set architecture that first introduced a shared quantum/classical memory model. It was introduced by Robert Smith, Michael Curtis, and William Zeng in A Practical Quantum Instruction Set Architecture. Many quantum algorithms (including quantum teleportation, quantum error correction, simulation, and optimization algorithms) require a shared memory architecture. Quil is being developed for the superconducting quantum processors developed by Rigetti Computing through the Forest quantum programming API. A Python library called pyQuil was introduced to develop Quil programs with higher level constructs. A Quil backend is also supported by other quantum programming environments.
Underlying quantum abstract machine
In the paper presented by Smith, Curtis and Zeng, Quil specifies the instruction set for a Quantum Abstract Machine (QAM,) akin to a Turing machine, yet more practical for accomplishing "real-world" tasks. The state of the QAM can be represented as a 6-tuple where:
is the (quantum) state of a fixed but arbitrary number of qubits indexed using a 0-based indexing.
is a classical memory of a number of classical bits indexed using a 0-based indexing.
a fixed but arbitrary list of static gates (quantum gates that do not depend on parameters, like the Hadamard gate.)
a fixed but arbitrary list of parametric gates (gates that depend on a number of complex parameters like the phase shift gate that requires an angle parameter to be completely defined.)
a sequence of Quil instructions to be executed, representing the program. The length of is denoted by .
an integer program counter pointing to the next instruction to be executed. always starts at 0 (pointing to the instruction) and ends at indicating program halting (note that the last instruction has the index .) The program counter is incremented after every instruction, except for special control flow instructions (conditional and unconditional jumps, and the speci |
https://en.wikipedia.org/wiki/Quantum%20Computation%20Language | Quantum Computation Language (QCL) is one of the first implemented quantum programming languages. The most important feature of QCL is the support for user-defined operators and functions. Its syntax resembles the syntax of the C programming language and its classical data types are similar to primitive data types in C. One can combine classical code and quantum code in the same program.
The language was created to explore programming concepts for quantum computers.
The QCL library provides standard quantum operators used in quantum algorithms such as:
Controlled-not with many target qubits,
Hadamard operation on many qubits,
Phase and controlled phase.
Quantum algorithms for addition, multiplication and exponentiation with binary constants (all modulus n)
The quantum fourier transform
Syntax
Data types
Quantum - qureg, quvoid, quconst, quscratch, qucond
Classical - int, real, complex, boolean, string, vector, matrix, tensor
Function types
qufunct - Pseudo-classic operators. Can only change the permutation of basis states.
operator - General unitary operators. Can change the amplitude.
procedure - Can call measure, print, and dump inside this function. This function is non-invertible.
Built-in functions
Quantum
qufunct - Fanout, Swap, Perm2, Perm4, Perm8, Not, CNot
operator - Matrix2x2, Matrix4x4, Matrix8x8, Rot, Mix, H, CPhase, SqrtNot, X, Y, Z, S, T
procedure - measure, dump, reset
Classical
Arithmetic - sin, cos, tan, log, sqrt, ...
Complex - Re, Im, conj
Examples
The basic built-in quantum data type in QCL is the qureg (quantum register). It can be interpreted as an array of qubits (quantum bits).
qureg x1[2]; // 2-qubit quantum register x1
qureg x2[2]; // 2-qubit quantum register x2
H(x1); // Hadamard operation on x1
H(x2[1]); // Hadamard operation on the first qubit of the register x2
Since the qcl interpreter uses qlib simulation library, it is possible to observe the internal state of the quantum machine during execution of the quantum progra |
https://en.wikipedia.org/wiki/Misra%E2%80%93Gries%20summary | In the field of streaming algorithms, Misra–Gries summaries are used to solve the frequent elements problem in the data stream model. That is, given a long stream of input that can only be examined once (and in some arbitrary order), the Misra-Gries algorithm can be used to compute which (if any) value makes up a majority of the stream, or more generally, the set of items that constitute some fixed fraction of the stream.
The term "summary" is due to Graham Cormode. The algorithm is also called the Misra–Gries heavy hitters algorithm.
The Misra–Gries summary
As for all algorithms in the data stream model, the input is a finite sequence of integers from a finite domain. The algorithm outputs an associative array which has values from the stream as keys, and estimates of their frequency as the corresponding values. It takes a parameter which determines the size of the array, which impacts both the quality of the estimates and the amount of memory used.
algorithm misra-gries:
input:
A positive integer
A finite sequence taking values in the range 1,2,...,
output: An associative array with frequency estimates for each item in
:= new (empty) associative array
while is not empty:
take a value from
if is in keys():
[] := [i] + 1
else if |keys()| < - 1:
[] := 1
else:
for each in keys():
[] := [] - 1
if [] = 0:
remove from keys()
return
Properties
The Misra–Gries algorithm uses O((log()+log())) space, where is the number of distinct values in the stream and is the length of the stream. The factor accounts for the number of entries that are kept in the associative array . Each entry consists of a value and an associated counter . The counter can, in principle, take any value in {0,...,}, which requires ⌈log(+1)⌉ bits to store. Assuming that the values are integers in {0,.. |
https://en.wikipedia.org/wiki/Mathspace | Mathspace is an online mathematics program designed for students in primary/elementary, secondary, and higher education. It is designed for students aged between 7 and 18, and is used by schools in Australia, New Zealand, the United States, Canada, the United Kingdom, Hong Kong and India.
Mathspace uses an adaptive learning model to personalize the software experience for each student. The questions presented to a user are chosen by an algorithm that responds to past performance, and student input is evaluated to provide feedback on their progress within each problem. Additional support is offered in the form of hints and video tutorials to guide them to the solution. The software assesses each student's performance and generates accompanying report statistics.
Partnerships
Mathspace partnered with Eddie Woo in 2017. Together they created a video hub to categorize Woo's education videos in the various state curricula across Australia.
Awards
External links
References
Educational math software
Education companies of Australia
Companies based in Sydney |
https://en.wikipedia.org/wiki/Calcium%20signaling%20in%20cell%20division | Calcium plays a crucial role in regulating the events of cellular division. Calcium acts both to modulate intracellular signaling as a secondary messenger and to facilitate structural changes as cells progress through division. Exquisite control of intracellular calcium dynamics are required, as calcium appears to play a role at multiple cell cycle checkpoints.
The major downstream calcium effectors are the calcium-binding calmodulin protein and downstream calmodulin-dependent protein kinases I / II. Evidence points to this signaling cascade as a major mediator of calcium signaling in cell division.
Meiosis
Historically, one of the most well characterized roles of intracellular calcium is activation of the ovum after sperm fertilization. In deuterosome eggs (mammals, fish, amphibians, ascidians, sea urchins, etc.), successful sperm entry leads to a distinct rise in intracellular calcium ions (Ca2+), with mammals and ascidians displaying a series of intracellular calcium spikes required for completion of meiosis.... Unfertilized vertebrate eggs arrest development after meiosis I. This developmental pause is attributed to the vaguely defined cytostatic factor (CSF). Current researches suggest “CSF” is actually multiple pathways working together to halt division at metaphase of meiosis II. Upon sperm entry into the egg, Ca2+ is released from intracellular stores, leading to inhibition of the CSF-arrest mechanism. Calmodulin dependent kinase II was shown to be the protein responsible for converting the Ca2+ influx signal into inhibition of CSF and activation of cyclin degradation machinery to degrade cyclin B, resulting in progression through meiosis II.
In mammals, this rise in Ca2+ was shown to be driven by IP3 stimulation induced by PLCζ provided by the sperm. In general, PLC enzymes stimulate calcium release by internal stores through the breakdown of PIP2 into IP3 and DAG.
Mitosis
Signaling
Beyond the events of meiosis, changes in Ca2+ levels are observed |
https://en.wikipedia.org/wiki/Dejean%27s%20theorem | Dejean's theorem (formerly Dejean's conjecture) is a statement about repetitions in infinite strings of symbols. It belongs to the field of combinatorics on words; it was conjectured in 1972 by Françoise Dejean and proven in 2009 by Currie and Rampersad and, independently, by Rao.
Context
In the study of strings, concatenation is seen as analogous to multiplication of numbers. For instance, if is any string,
then the concatenation of two copies of is called the square of , and denoted . This exponential notation may also be extended to fractional powers: if has length , and is a non-negative rational number of the form , then denotes the string formed by the first characters of the infinite repetition .
A square-free word is a string that does not contain any square as a substring. In particular, it avoids repeating the same symbol consecutively, repeating the same pair of symbols, etc. Axel Thue showed that there exists an infinite square-free word using a three-symbol alphabet, the sequence of differences between consecutive elements of the Thue–Morse sequence. However, it is not possible for an infinite two-symbol word (or even a two-symbol word of length greater than three) to be square-free.
For alphabets of two symbols, however, there do exist infinite cube-free words,
words with no substring of the form . One such example is the Thue–Morse sequence itself; another is the Kolakoski sequence. More strongly, the Thue–Morse sequence contains no substring that is a power strictly greater than two.
In 1972, Dejean investigated the problem of determining, for each possible alphabet size, the threshold between exponents for which there exists an infinite -power-free word, and the exponents for which no such word exists. The problem was solved for two-symbol alphabets by the Thue–Morse sequence, and Dejean solved it as well for three-symbol alphabets.
She conjectured a precise formula for the threshold exponent for every larger alphabet size; this formula |
https://en.wikipedia.org/wiki/Wtfast | wtfast is a Canadian company that provides an optimized gaming network, also known as the Gamers Private Network (GPN), for MMO, FPS, and MOBA gamers. It is a platform that online gamers use to access gaming servers with an uninterrupted connection. The company is operated by AAA Internet Publishing, Inc. with headquarters in Kelowna, British Columbia.
History
The company was initially founded by Rob Bartlett in 1997, as AAA Internet Publishing Inc. to provide internet and technology services. However, the trademark name wtfast was registered in December 1, 2009, and the company has since operated under that name to provide lag reduction services for MMO games. In 2014, it was the top ten finalist of BCIC New Ventures Competition. In 2015, it was the top five national finalist for the TELUS and The Globe & Mail Small Business Competition. In 2016, wtfast was the finalist of Sir Richard Branson's Extreme Tech Challenge. Since 2017, some of the notable company partners include ASUS, MSI, Gigabyte, Linksys, HiNet, and ASI Networks.
References
External links
Online video game services
Companies based in Kelowna
Video game companies established in 2009
2009 establishments in British Columbia |
https://en.wikipedia.org/wiki/Qandisha | Qandisha is a French language online magazine for women in Morocco and the wider Arab world. It was founded in 2011 by Fedwa Misk, a Moroccan journalist, feminist, and women's rights activist, and a group of other women concerned that women's rights were being ignored by the media during the Arab Spring. The publication is a hybrid between a magazine and a webzine, and is a collaborative effort, encouraging participation from its readers.
History and profile
Qandisha was established in 2011 and is published in French. The name is derived from Qandisa, a female jinn from Moroccan folklore. The magazine focuses on a range of subjects including political and social current events. In an interview, Fedwa Misk stated "We want to give a boost to all the women who want to discuss and comment on current events, whether political or social – to encourage women to speak up. In our Arab Muslim conservative countries, women are less inclined to make their voices heard." The magazine is developing video and audio content in both French and Darija, a colloquial form of Arabic. The magazine often covers controversial subjects and the website has been hacked on more than one occasion.
References
External links
Official website
Magazines published in Morocco
Magazines established in 2011
2011 establishments in Morocco
French-language magazines
Online magazines
Feminist magazines
Feminism in Morocco
Women's magazines |
https://en.wikipedia.org/wiki/Automated%20machine%20learning | Automated machine learning (AutoML) is the process of automating the tasks of applying machine learning to real-world problems.
AutoML potentially includes every stage from beginning with a raw dataset to building a machine learning model ready for deployment. AutoML was proposed as an artificial intelligence-based solution to the growing challenge of applying machine learning. The high degree of automation in AutoML aims to allow non-experts to make use of machine learning models and techniques without requiring them to become experts in machine learning. Automating the process of applying machine learning end-to-end additionally offers the advantages of producing simpler solutions, faster creation of those solutions, and models that often outperform hand-designed models.
Common techniques used in AutoML include hyperparameter optimization, meta-learning and neural architecture search.
Comparison to the standard approach
In a typical machine learning application, practitioners have a set of input data points to be used for training. The raw data may not be in a form that all algorithms can be applied to. To make the data amenable for machine learning, an expert may have to apply appropriate data pre-processing, feature engineering, feature extraction, and feature selection methods. After these steps, practitioners must then perform algorithm selection and hyperparameter optimization to maximize the predictive performance of their model. If deep learning is used, the architecture of the neural network must also be chosen by the machine learning expert.
Each of these steps may be challenging, resulting in significant hurdles to using machine learning. AutoML aims to simplify these steps for non-experts, and to make it easier for them to use machine learning techniques correctly and effectively.
AutoML plays an important role within the broader approach of automating data science, which also includes challenging tasks such as data engineering, data exploratio |
https://en.wikipedia.org/wiki/Shadow%20board | A shadow board is a type of tool board for organizing a set of tools; the board defines where particular tools should be placed when they are not in use. Shadow boards have the outlines of a work station's tools marked on them, allowing operators to identify quickly which tools are in use or missing. The boards are commonly located near the work station where the tools are used. Shadow boards are often used in the manufacturing environment to improve a facility's lean six sigma capabilities.
Shadow boards reduce time spent looking for tools and also reduce losses. They improve work station safety because tools are replaced safely after use, rather than becoming potential hazards.
See also
Knolling
5S (methodology)
Peg board
References
Tools
Industrial equipment
Containers
Ordering
Lean manufacturing |
https://en.wikipedia.org/wiki/List%20of%20syndromes | This is an alphabetically sorted list of medical syndromes.
#
13q deletion syndrome
17q21.31 microdeletion syndrome
1p36 deletion syndrome
1q21.1 deletion syndrome
1q21.1 duplication syndrome
22q11.2 distal deletion syndrome
22q11.2 duplication syndrome
22q13 deletion syndrome
2p15-16.1 microdeletion syndrome
2q37 deletion syndrome
3-M syndrome
3C syndrome
3q29 microdeletion syndrome
49,XXXXY
4D syndrome
8p23.1 duplication syndrome
9q34 deletion syndrome
A
Aagenaes syndrome
Aarskog–Scott syndrome
Aase syndrome
Abandoned child syndrome
ABCD syndrome
Abdallat–Davis–Farrage syndrome
Abderhalden–Kaufmann–Lignac syndrome
Abdominal compartment syndrome
abdominal wall pain syndrome
Ablepharon macrostomia syndrome
Abruzzo–Erickson syndrome
Achard syndrome
Achard–Thiers syndrome
Ackerman syndrome
Acorea, microphthalmia and cataract syndrome
Acrocallosal syndrome
Acropectoral syndrome
Acro–dermato–ungual–lacrimal–tooth syndrome
Activation syndrome
Acute aortic syndrome
Acute brain syndrome
Acute chest syndrome
Acute coronary syndrome
Acute HME syndrome
Acute interstitial pneumonitis
Acute motor axonal neuropathy
acute platelet activation syndrome
Acute radiation syndrome
Acute respiratory distress syndrome
Acute retroviral syndrome
Adams–Nance syndrome
Adams–Oliver syndrome
Adams–Stokes syndrome
Adducted thumb syndrome
Adie syndrome
Adiposogenital dystrophy
Adult-onset immunodeficiency syndrome
Advanced sleep phase disorder
Aerotoxic syndrome
Afferent loop syndrome
Aicardi syndrome
Aicardi–Goutières syndrome
AIDS dysmorphic syndrome
Al-Raqad syndrome
Alagille syndrome
Albinism–deafness syndrome
Alcohol withdrawal syndrome
Alezzandrini syndrome
Alice in Wonderland syndrome
Alien hand syndrome
Allan–Herndon–Dudley syndrome
Allopurinol hypersensitivity syndrome
Alopecia contractures dwarfism mental retardation syndrome
Alpha-thalassemia mental retardation syndrome
Alport syndrome
Alström syndrome
Alvarez' syndrome
Amennorrhea-galactorrhea syndrome
Amniotic band constriction
Am |
https://en.wikipedia.org/wiki/Moment%20distance%20index | The moment distance index (MDI) is a shape-based metric or shape index that can be used to analyze spectral reflectance curves and waveform LiDAR, proposed by Salas and Henebry in 2014. In the case of spectral data, the shape of the reflectance curve should unmask fine points of the spectra usually not considered by existing band-specific indices. It has been used to identify spectral regions for chlorophyll and carotenoids, detect greenhouses using WorldView-2, Landsat, and Sentinel-2 satellite data, identify greenhouse crops, compute canopy heights, estimate green vegetation fraction, and optimize Fourier-transform infrared (FTIR) scans for soil spectroscopy.
Various approaches have been devised to analyze medium and fine spectral resolution data and maximize their use to extract specific information for vegetation biophysical and biochemical properties. Combinations of spectral bands, called indices, have been used to diminish the effects of soil background and/or atmospheric conditions while highlighting specific spectral features associated with plant or canopy properties. Vegetation indices (VIs) use the concept of band ratio and differences or weighted linear combinations to take advantage of the visible and NIR bands, two important spectral bands for vegetation studies, in measuring the photosynthetic activity of the plant and explore vegetation dynamics. There is an extensive list of such indices, including the normalized difference vegetation index (NDVI), ratio-based indices such as the modified simplerRatio, soil-distance-based indices such as the modified soil adjusted vegetation index (MSAVI), and many others. Whereas most indices incorporate two-band or three-band relations – slope-based, distance-based on soil line or optimized (slope-based and distance-based concepts combined) – no approach deals with the raw shape of the spectral curve. MDI, however, investigates the shape of the reflectance curve using multiple spectral bands not considered |
https://en.wikipedia.org/wiki/Not-all-equal%203-satisfiability | In computational complexity, not-all-equal 3-satisfiability (NAE3SAT) is an NP-complete variant of the Boolean satisfiability problem, often used in proofs of NP-completeness.
Definition
Like 3-satisfiability, an instance of the problem consists of a collection of Boolean variables and a collection of clauses, each of which combines three variables or negations of variables. However, unlike 3-satisfiability, which requires each clause to have at least one true Boolean value, NAE3SAT requires that the three values in each clause are not all equal to each other (in other words, at least one is true, and at least one is false).
Hardness
The NP-completeness of NAE3SAT can be proven by a reduction from 3-satisfiability (3SAT). First the nonsymmetric 3SAT is reduced to the symmetric NAE4SAT by adding a common dummy literal to every clause, then NAE4SAT is reduced to NAE3SAT by splitting clauses as in the reduction of general -satisfiability to 3SAT.
In more detail, a 3SAT instance (where the are arbitrary literals) is reduced to the NAE4SAT instance where is a new variable. A satisfying assignment for becomes a satisfying assignment for by setting . Conversely a satisfying assignment with for must have at least one other literal true in each clause and thus be a satisfying assignment for . Finally a satisfying assignment with for can because of symmetry of and be flipped to produce a satisfying assignment with .
NAE3SAT remains NP-complete when all clauses are monotone (meaning that variables are never negated), by Schaefer's dichotomy theorem.
Monotone NAE3SAT can also be interpreted as an instance of the set splitting problem, or as a generalization
of graph bipartiteness testing to 3-uniform hypergraphs: it asks whether the vertices of a hypergraph can be colored with two colors so that no hyperedge is monochromatic. More strongly, it is NP-hard to find colorings of 3-uniform hypergraphs with any constant number of colors, even when a 2-coloring exist |
https://en.wikipedia.org/wiki/Elsagate | Elsagate was a controversy surrounding videos on YouTube and YouTube Kids that were categorized as child-friendly, but contained themes inappropriate for children. These videos often featured fictional characters from family-oriented media, sometimes via crossovers, used without legal permission. The term itself is a portmanteau of Disney's Elsa from Frozen—known for frequently appearing in such videos—and , a suffix for scandals. The controversy also included channels that focused on real-life children, such as Toy Freaks, that raised concern about possible child abuse.
Most videos in this category were produced either with live action or Flash animation, but some used claymation or computer-generated imagery. The videos were sometimes tagged in such a way as to circumvent YouTube's child safety algorithms, and some appeared on YouTube Kids. These videos were difficult to moderate due to the large scale of YouTube. In order to capture search results and attract attention from users, their titles and descriptions featured the names of fictional characters, as well as keywords such as "education", "learn colors", and "nursery rhymes". They also included automatically placed advertisements, making them lucrative to their owners and YouTube.
Public awareness of the phenomenon grew in late 2017. That year—after reports on child safety on YouTube by several media outlets—YouTube adopted stricter guidelines regarding children's content. In late November, the platform deleted channels and videos falling into the Elsagate category, as well as inappropriate videos and user comments relating to children.
History
Early history (2016–2017)
In June 2016, The Guardian published an article about the channel Webs and Tiaras, which had been created in March of the same year. The channel showed people dressed as characters like Spider-Man, Elsa, and the Joker engaging in bizarre or nonsensical actions. The videos themselves had background music but no dialogue. The lack of dialo |
https://en.wikipedia.org/wiki/Dresselhaus%20effect | The Dresselhaus effect is a phenomenon in solid-state physics in which spin–orbit interaction causes energy bands to split. It is usually present in crystal systems lacking inversion symmetry. The effect is named after Gene Dresselhaus, who discovered this splitting in 1955.
Spin–orbit interaction is a relativistic coupling between the electric field produced by an ion-core and the resulting dipole moment arising from the relative motion of the electron, and its intrinsic magnetic dipole proportional to the electron spin. In an atom, the coupling weakly splits an orbital energy state into two states: one state with the spin aligned to the orbital field and one anti-aligned. In a solid crystalline material, the motion of the conduction electrons in the lattice can be altered by a complementary effect due to the coupling between the potential of the lattice and the electron spin. If the crystalline material is not centro-symmetric, the asymmetry in the potential can favour one spin orientation over the opposite and split the energy bands into spin aligned and anti-aligned subbands.
The Rashba spin–orbit coupling has a similar energy band splitting, but the asymmetry comes either from the bulk asymmetry of uniaxial crystals (e.g. of wurtzite type) or the spatial inhomogeneity of an interface or surface. Dresselhaus and Rashba effects are often of similar strength in the band splitting of GaAs nanostructures.
Zincblende Hamiltonian
Materials with zincblende structure are non-centrosymmetric (i.e., they lack inversion symmetry). This bulk inversion asymmetry (BIA) forces the perturbative Hamiltonian to contain only odd powers of the linear momentum. The bulk Dresselhaus Hamiltonian or BIA term is usually written in this form:
where , and are the Pauli matrices related to the spin of the electrons as (here is the reduced Planck constant), and , and are the components of the momentum in the crystallographic directions [100], [010] and [001], respectively.
Wh |
https://en.wikipedia.org/wiki/Marine%20Station%20of%20Endoume | The Marine Station of Endoume is an oceanography and marine biology research institute located in Marseille (France). It was founded in 1882 by Antoine-Fortuné Marion (1846–1900). It is today one of the sites for the joint research unit IMBE(Mediterranean Institute of marine and terrestrial Biodiversity and Ecology) hosting research teams from Aix-Marseille University and the CNRS.
History
The first marine biology laboratory in France outside Paris was founded in Marseille in 1869. The project to build a marine station in Marseille was initiated by its director Antoine-Fortuné Marion in 1872 and accepted in 1882. The station was built between 1883 and 1889, on the site of an old artillery battery in the neighbourhood of Endoume. The first scientific studies started in the summer of 1889.
In 1891, the first public aquarium in Marseille opened at the marine station; in 1894, a marine natural reserve was created right in front of the marine station. A-F Marion was director of the station until his death in 1900.
Directors
Architecture
The original building had a single wing bordered, to its right, by a rounded turret containing the main staircase. It was extended to the left by a terrace flanked on either side by two stone staircases. Inaugurated in 1889 by Fortuné Marion, this original building was first restored in 1954 by Jean-Marie Pérès, and was succeeded by three other phases of construction:
building 2 (1958), at right angles to the original building, on the seaward side: laboratories and private apartments of the Director of the station. The left exterior staircase, of which we can still find traces, was sacrificed on this occasion.
building 3 (1963), 850 m2 extension, on the north side: laboratories, workshops, plankton net room and offices.
building 4 (1966), a construction independent of the other three, with a surface area of 1,080 m2, overlooking the Anse des Cuivres: laboratories, conference room, practical workrooms and dining hall.
building pro |
https://en.wikipedia.org/wiki/Tannenberg%20%28video%20game%29 | Tannenberg is a squad-based multiplayer first-person shooter video game set during World War I. It is a sequel to Verdun, and entered Steam Early Access on November 17, 2017. Tannenberg left Steam Early Access on February 13, 2019. It was released on PlayStation 4 and Xbox One on July 24, 2020.
Tannenberg is inspired by the 1914 Battle of Tannenberg in East Prussia. The game includes historically accurate World War I weapons, authentic uniforms and equipment, detailed injury and gore modeling, and maps based on the real battlefields of the Eastern Front.
The game runs on the Unity engine and was developed by independent studios M2H and Blackmill Games.
Gameplay
Tannenberg is a squad based game set on the Eastern Front of World War I that can be played with up to 64 players (40 players on consoles). There are 3 game modes in Tannenberg: Maneuver, Attrition Warfare and Rifle Deathmatch. In April 2019 a temporary 'Wolf Truce' feature was added to the Maneuver game mode, based on historical reports of armies calling truces to fight wolves. During this event, packs of wolves would sometimes enter the battlefield and attack players. Players would then be able to conduct a truce while wolves were present, or they could break the truce and continue fighting normally. In April 2019, a 'Film Memoir' visual mode was added which switches the game's art and user interface to black and white, while adding a film grain effect. Another console update in December 2020 added cross-platform play between Xbox and PlayStation for Verdun and Tannenberg. The game is said to be evidently accurate to the real war to quite an extent.
Maneuver game mode
In the Maneuver game mode, players join either the Entente or the Central Powers. After choosing a squad type and role within the squad, players join the battle where they have to capture sectors. Holding sectors provides control points (more or less depending on the value of the sector) and the team with the most control points will drain |
https://en.wikipedia.org/wiki/Osram%20ne%20nsoromma | Osram ne nsoromma is one of the Bono Adinkra symbols, which is interpreted to mean "Osram" Moon "Ne" and "Nsoromma" Star. This symbol signifies love, bonding and faithfulness in marriage. The symbol is represented by a half moon with a star slightly hanging within the circumference of the moon. Adinkra are symbols that carry a message or a concept. They are very much used by the Bono people of the Bonoman and the Gyaman, an Akan people of Ghana and Côte d'Ivoire. Osram ne nsoromma symbols are incorporated into walls and other architectural features and quite recently has become common with tattoo designers. The most common ways through which the Adinkra messages are carried out or conveyed is having them printed extensively in fabrics and used in pottery.
Adinkra is an Akan name which means farewell or goodbye. Osram ne nsoromma are two different powerful objects of creation put together (Moon and Star). Both co exist in the sky to produce magnificent light or brightness at night. There are some wise sayings closely related to the Osram ne nsoromma symbol, often linked with proverbs
Related proverbs
The Akans of Ghana use an Adinkra symbol to express proverbs and other philosophical ideas or traditional wisdom, aspects of life or the environment.
Some of the familiar proverbs are:
Awaree nye nsafufuo na waka ahwe, which means marriage is not palm-wine that you can decide to have a taste before you get served. It can also be interpreted to mean marriage is not a venture, committee or an organization that you can be a member today and withdraw your membership tomorrow. This proverb frowns upon break ups or separations in marriages or relationships.
Woreko awaree a bisa, This proverb talks about due diligence before marriage. it is wise to do a background check on your partner before marriage or the worse will happen. Making the wrong choice is sometimes costly. Similarly, most of the proverbs seem to put value on the object being addressed. This symbol signifie |
https://en.wikipedia.org/wiki/VMix | vMix is a software vision mixer available for the Windows operating system. The software is developed by StudioCoast PTY LTD. Like most vision mixing software, it allows users to switch inputs, mix audio, record outputs, and live stream cameras, videos files, audio, and more, in resolutions of up to 4K. The software is also capable of serving image magnification (IMAG) and projection needs in many instances, with various configurable external output and display options.
vMix is available in multiple editions ranging in price and available features. Current editions include Basic, Basic HD, SD, HD, 4K, and Pro. Users can upgrade from one edition to another for the difference between the original edition purchased and the one you wish to upgrade to. Updates are provided for free for 1 year with a purchase of any edition, after 1 year users can opt to purchase additional years for US$60.
vMix heavily takes advantage of the GPU, and relies on graphics libraries such as Direct3D, making the software exclusive to the Windows operating system, though it can be run through Boot Camp. StudioCoast has previously indicated that the software performs best on dedicated Nvidia video cards.
Features
vMix Call
With the release of version 19, vMix Call is available, marking the first time a software vision mixer has been released with built in video-conferencing. With vMix call, any third party with access to a web browser (on any platform including mobile) can connect remotely to the vMix software. This allows the operator to incorporate the call into a live production in the same way that they would with any other source. The number of simultaneous calls varies by version with 1 caller available on the HD level, 4 with 4K and 8 calls on the pro level. vMix call is not available with Basic or Basic HD versions.
vMix Social
vMix Social allows operators to incorporate social media content and comments from Twitter, Facebook, Twitch and YouTube Live and IRC Channels. Content ca |
https://en.wikipedia.org/wiki/4OR | 4OR - A Quarterly Journal of Operations Research is a peer-reviewed scientific journal that was
established in 2003 and is published by Springer Science+Business Media.
It is a joint official journal of the Belgian,
French, and
Italian Operations Research Societies.
The journal publishes research papers and surveys on the theory and applications of Operations Research.
The Editors-in-chief are Yves Crama (University of Liège),
Michel Grabisch (Pantheon-Sorbonne University), and Silvano Martello (University of Bologna).
Abstracting and indexing
The journal is abstracted and indexed in the following databases:
DBLP
EconLit
EBSCO Information Services
Google Scholar
International Abstracts in Operations Research
Journal Citation Reports
Mathematical Reviews
OCLC
ProQuest
Science Citation Index
SCImago Journal Rank
Scopus
Zentralblatt Math
According to the Journal Citation Reports, the journal has a 2021 impact factor of 1.763.
References
External links
Operations research
Behavioural sciences
English-language journals
Springer Science+Business Media academic journals
Academic journals established in 2003 |
https://en.wikipedia.org/wiki/Internet%20interventions%20for%20post-traumatic%20stress | Internet interventions for post-traumatic stress have grown in popularity due to the limits that many patients face in their ability to seek therapy to treat their symptoms. These limits include lack of resources and residing in small towns or in the countryside. These patients may find it difficult to seek treatment because they do not have geographical access to treatment, and this can also limit the time they have to seek help. Additionally, those who live in rural areas may experience more stigma related to mental health issues. Internet interventions can increase the possibility that those who suffer from PTSD can seek help by eliminating these barriers to treatment.
Most of the internet interventions for PTSD currently being studied use Cognitive Behavioral Therapy (CBT) tenants to provide treatment. Often these internet interventions also pull from Cognitive Processing Therapy (CPT) and exposure therapy as well. There are two types of internet interventions. Those that are “therapist-assisted,” which means there is an actual therapist guiding the patient through some, but not all of the intervention, and those that are self-guided, which means they do not provide this service. In therapist assisted interventions, patients have access to a live therapist either via video conferencing, instant messenger, or telephone. Therapists can provide feedback to the patient's assignments, and help them process their trauma. In self-guided interventions, patients do not have contact with therapists, unless there is an emergency in which they are a risk to themselves or others. Throughout these interventions, patients are given coping skills and resources. The resources available to patients participating in a self-guided intervention are typically crisis lines, emergency services, and outside sources in which the person can seek help or treatment. The resources provided in a self-guided treatment protocol are not a part of the intervention itself.
While there is a recen |
https://en.wikipedia.org/wiki/Facebook%20Watch | Facebook Watch (currently rebranding to Facebook Video) is a video on demand service operated by American company Meta Platforms (previously named Facebook, Inc.). The company announced the service in August 2017 and it was available to all U.S. users that month. Facebook Watch's original video content is produced for the company by others, who earn 55% of advertising revenue (Facebook keeps the other 45%).
Facebook Watch offers tailored video recommendations and organizes content into categories based on metrics like popularity and user engagement. The platform hosts both short and long-form entertainment. In 2018, Facebook allocated a $1 billion budget for content creation. The company generates revenue from mid-roll ads and also explored the introduction of pre-roll ads in the same year. As of August 30, 2018, Facebook Watch became globally accessible to all Facebook users.
As of September 2020, Facebook reported that Facebook Watch had more than 1.25 billion monthly visitors, 46% of its monthly active user base at that time.
History
On August 9, 2017, Facebook, Inc. announced that it would be launching its own video on demand service. During the same announcement it was stated that the new service would be called Facebook Watch. The video on demand service was launched for a small group of U.S. users a day later, with a rollout to all U.S. users beginning at the end of August.
In May and June 2018, Facebook launched around six news programs from partners including BuzzFeed, Vox, CNN, and Fox News. These programs, developed by Facebook's head of news partnerships Campbell Brown, reportedly had an overall budget of US$90 million.
On July 25, 2018, Facebook gave their first presentation ever at the annual Television Critics Association's annual summer press tour. During Facebook's allotted time, Fidji Simo, the Vice President of Product for Video, and Ricky Van Veen, the Head of Global Creative Strategy, showcased Facebook's continuing ramp-up of original prog |
https://en.wikipedia.org/wiki/Acylindrically%20hyperbolic%20group | In the mathematical subject of geometric group theory, an acylindrically hyperbolic group is a group admitting a non-elementary 'acylindrical' isometric action on some geodesic hyperbolic metric space. This notion generalizes the notions of a hyperbolic group and of a relatively hyperbolic group and includes a significantly wider class of examples, such as mapping class groups and Out(Fn).
Formal definition
Acylindrical action
Let G be a group with an isometric action on some geodesic hyperbolic metric space X. This action is called acylindrical if for every there exist such that for every with one has
If the above property holds for a specific , the action of G on X is called R-acylindrical. The notion of acylindricity provides a suitable substitute for being a proper action in the more general context where non-proper actions are allowed.
An acylindrical isometric action of a group G on a geodesic hyperbolic metric space X is non-elementary if G admits two independent hyperbolic isometries of X, that is, two loxodromic elements such that their fixed point sets and are disjoint.
It is known (Theorem 1.1 in ) that an acylindrical action of a group G on a geodesic hyperbolic metric space X is non-elementary if and only if this action has unbounded orbits in X and the group G is not a finite extension of a cyclic group generated by loxodromic isometry of X.
Acylindrically hyperbolic group
A group G is called acylindrically hyperbolic if G admits a non-elementary acylindrical isometric action on some geodesic hyperbolic metric space X.
Equivalent characterizations
It is known (Theorem 1.2 in ) that for a group G the following conditions are equivalent:
The group G is acylindrically hyperbolic.
There exists a (possibly infinite) generating set S for G, such that the Cayley graph is hyperbolic, and the natural translation action of G on is a non-elementary acylindrical action.
The group G is not virtually cyclic, and there exists an isometric acti |
https://en.wikipedia.org/wiki/Gyoukou | is a supercomputer developed by and PEZY Computing, based around ExaScaler's ZettaScaler immersion cooling system.
It was deployed at the Japan Agency for Marine-Earth Science and Technology (JAMSTEC) Yokohama Institute for Earth Sciences, the same floor where the Earth Simulator is located. Amid the scandal regarding the development grant, it was removed from JAMSTEC in April 2018.
System
Gyoukou is based on ExaScaler's ZettaScaler-2.x technology which features liquid immersion cooling system using Fluorinert.
Each immersion tank can contain 16 Bricks. A Brick consists of a backplane board, 32 PEZY-SC2 modules, 4 Intel Xeon D host processors, and 4 InfiniBand EDR cards. Modules inside a Brick are connected by hierarchical PCI Express fabric switches, and the Bricks are interconnected by InfiniBand.
Each PEZY-SC2 module contains 2048 processing elements (1 GHz design), six MIPS64 control processors, and 4 DDR4 DIMMs (64GB per module as of November 2017).
Performance
With partial configuration, Gyoukou was ranked 69th at 1,677.1 teraflops on the June 2017 TOP500 ranking.
After upgrade to full scale (equivalent of 19.5 immersion tanks) using newer ZettaScaler-2.2 system, it ranked 4th at 19,135.8 teraflops on the November 2017 TOP500 ranking. At the time of benchmarking, 1984 out of 2048 cores of each PEZY-SC2 were used at 700 MHz clock.
Gyoukou has high energy efficiency, and it ranked 5th at 14.173 gigaflops/watt on the November 2017 Green500 energy efficiency ranking. at the time benchmarked as 19,860,000 "cores" (after an upgrade).
Notes
External links
ExaScaler Inc.
PEZY Computing K.K.
Supercomputers
Supercomputing in Japan
Japan Agency for Marine-Earth Science and Technology |
https://en.wikipedia.org/wiki/List%20of%20antibiotic-resistant%20bacteria | A list of antibiotic resistant bacteria is provided below. These bacteria have shown antibiotic resistance (or antimicrobial resistance).
Enzyme NDM-1 (New Delhi Metallo-beta-lactamase-1)
NDM-1 is an enzyme that makes bacteria resistant to a broad range of beta-lactam antibiotics.
NDM-1 (New Delhi Metallo-beta-lactamase-1) originated in India. In Indian hospitals, hospital-acquired infections are common, and with the new super-bugs on rise in India, this can make them dangerous. Mapping of sewage and water supply samples that were NDM-1-positive indicates widespread infection in New Delhi already back in 2011.
NDM-1 was first detected in a Klebsiella pneumoniae isolate from a Swedish patient of Indian origin in 2008. It was later detected in bacteria in India, Pakistan, the United Kingdom, the United States, Canada, and Japan.
Gram positive
Clostridium difficile
Clostridium difficile is a nosocomial pathogen that causes diarrheal disease worldwide. Diarrhea caused by C. difficile can be life-threatening. Infections are most frequent in people who have had recent medical and/or antibiotic treatment. C. difficile infections commonly occur during hospitalization.
According to a 2015 CDC report, C. difficile caused almost 500,000 infections in the United States over a year period. Associated with these infections were an estimated 15,000 deaths. The CDC estimates that C. difficile infection costs could amount to $3.8 billion over a 5-year span.
C. difficile colitis is most strongly associated with fluoroquinolones, cephalosporins, carbapenems, and clindamycin.
Some research suggests the overuse of antibiotics in the raising of livestock is contributing to outbreaks of bacterial infections such as C. difficile.[16]
Antibiotics, especially those with a broad activity spectrum (such as clindamycin) disrupt normal intestinal flora. This can lead to an overgrowth of C. difficile, which flourishes under these conditions. Pseudomembranous colitis can follow, creatin |
https://en.wikipedia.org/wiki/Oracle%20Cloud%20Platform | Oracle Cloud Platform refers to a Platform as a Service (PaaS) offerings by Oracle Corporation as part of Oracle Cloud Infrastructure. These offerings are used to build, deploy, integrate and extend applications in the cloud. The offerings support a variety of programming languages, databases, tools and frameworks including Oracle-specific, open source and third-party software and systems.
Deployment Models
Oracle Cloud Platform offers public, private and hybrid cloud deployment models.
Architecture
Oracle Cloud Platform provides both Infrastructure as a Service (IaaS) and Platform as a Service (PaaS). The infrastructure is offered through a global network of Oracle managed data centers. Oracle deploys their cloud in Regions. Inside each Region are at least three fault-independent Availability Domains. Each of these Availability Domains contains an independent data center with power, thermal and network isolation. Oracle Cloud is generally available in North America, EMEA, APAC and Japan with announced South America and US Govt. regions coming soon.
See also
Platform as a service
Oracle Cloud (including Oracle Cloud Infrastructure)
Oracle Advertising and Customer Experience (CX)
Oracle Cloud Enterprise Resource Planning (ERP)
Oracle Cloud Human Capital Management (HCM)
Oracle Cloud Supply Chain Management (SCM)
Further reading
Ovum Decision Matrix: Selecting a Cloud Platform for Hybrid Integration Vendor, 2019-20
References
External links
Official website
Oracle Corporation
Cloud computing
Cloud computing providers
Cloud platforms
Cloud infrastructure
Oracle Cloud Services |
https://en.wikipedia.org/wiki/UMANG | Unified Mobile Application for New-age Governance (UMANG) is a mobile app, a Digital India initiative of Ministry of Electronics and Information Technology (in short form MeitY), by the Government of India for access to central and state government services. The app supports 13 Indian languages and is available for Android, iOS and Windows.
The app is aimed at all citizens of India and offers hundreds of services including payment, registration, information search and application forms. It is a component of the Digital India initiative, intending to make government services available to the general public online and around the clock.
The app was developed by the Ministry of Electronics and Information Technology with the National e-Governance Division and launched in November 2017 by Prime Minister Narendra Modi at the Global Conference on Cyberspace in New Delhi. At launch the app offered 162 services from 33 state and central government departments and four states.
See also
Aarogya Setu
BharatNet
T App Folio
CoWIN
References
Electronic funds transfer
Mobile payments
Online payments
Payment systems
E-government in India |
https://en.wikipedia.org/wiki/Category%20of%20representations | In representation theory, the category of representations of some algebraic structure has the representations of as objects and equivariant maps as morphisms between them. One of the basic thrusts of representation theory is to understand the conditions under which this category is semisimple; i.e., whether an object decomposes into simple objects (see Maschke's theorem for the case of finite groups).
The Tannakian formalism gives conditions under which a group G may be recovered from the category of representations of it together with the forgetful functor to the category of vector spaces.
The Grothendieck ring of the category of finite-dimensional representations of a group G is called the representation ring of G.
Definitions
Depending on the types of the representations one wants to consider, it is typical to use slightly different definitions.
For a finite group and a field , the category of representations of over has
objects: pairs (, ) of vector spaces over and representations of on that vector space
morphisms: equivariant maps
composition: the composition of equivariant maps
identities: the identity function (which is an equivariant map).
The category is denoted by or .
For a Lie group, one typically requires the representations to be smooth or admissible. For the case of a Lie algebra, see Lie algebra representation. See also: category O.
The category of modules over the group ring
There is an isomorphism of categories between the category of representations of a group over a field (described above) and the category of modules over the group ring [], denoted []-Mod.
Category-theoretic definition
Every group can be viewed as a category with a single object, where morphisms in this category are the elements of and composition is given by the group operation; so is the automorphism group of the unique object. Given an arbitrary category , a representation of in is a functor from to . Such a functor sends the unique object t |
https://en.wikipedia.org/wiki/Micom | Micom was a manufacturer of telecommunications equipment, best known for their line of concentrators. The company was founded by serial entrepreneur Stephen Bernard Dorsey in 1975 and sold to Philips NV in 1984. Micom acquired Spectrum Digital Corporation in 1987.
Micom concentrators
Micom became known for its ads, often run on the back pages of popular-in-their-day computer industry publications, with the slogan "Concentrate. Because it's cheaper!" The initial ads showed oranges and what resembled a can of frozen orange juice, with a "brand name" of Micom. After adding variations, they began advertising on television. The focus of the ads, within their telecommunications products, was their line of concentrators.
Their print ads included the trademarked phrase "MICOM: MicroComputers for DataCommunications(tm)"
References
Defunct networking companies
History of telecommunications
Defunct computer companies of the United States |
https://en.wikipedia.org/wiki/Byju%27s | Byju's (stylised as BYJU'S) is an Indian multinational educational technology company, headquartered in Bangalore. It was founded in 2011 by Byju Raveendran and Divya Gokulnath. As of Sept 2023, Byju's was valued at $5.1 billion. As of April 2023, the company claims to have over 150 million registered students.
History
Byju's app was developed by Think and Learn Pvt. Ltd, a company which was established by Byju Raveendran, Divya Gokulnath and a group of students in 2011. Byju, an engineer by profession, was coaching students in mathematics since 2006. During the initial days, the company focused on offering online video-based learning programs for the K-12 segment and for competitive exams. In 2012, the firm entered Deloitte Technology Fast 50 India and Deloitte Technology Fast 500 Asia Pacific ratings and has been present there ever since.
In August 2015, the firm launched Byju's: The Learning App. In 2017, they launched Byju's Math App for kids and Byju's Parent Connect app. By 2018, it had 15 million users out of which 900,000 were paid users at that time. In the same year, Byju's became India's first edtech unicorn. By 2019, 60% of BYJU’S students were from non-metros and rural cities.
In January 2022, the company joined Simplilearn, Unacademy, upGrad, PrepInsta Prime and Vedantu to become one of the founding members of IAMAI's India EdTech Consortium.
In March 2022, it signed a contract with Qatar Investment Authority to establish a new edtech company and an R&D centre in Doha.
In August 2022, Bloomberg News reported that the Ministry of Corporate Affairs sent a letter to Byju's asking them to explain the non-filing of its audited financials for the year ending March 2021. Byju's reasoned that the 17-month delay was due to the challenge of consolidating the accounts of its acquisitions during that year. In spite of the delay, Deloitte gave the company a clean audit. In November 2022, many employees of Byju's came out to speak against the company's unfa |
https://en.wikipedia.org/wiki/Pulse-cross | A pulse-cross is the representation of normally invisible portions of an analog video signal on a studio screen for error analysis.
Only part of the video signal contains image information: with an analog 625-line video signal, each field lasts 20 ms. Of these, only 18.4 ms (287.5 lines) are provided for image information; the remaining 1.6 ms (25 lines) form the vertical blanking interval, a time reserved for the vertical retrace of the electron beam. Likewise, of the 64 μs of each line, only 52 μs contain image information; the remaining 12 μs form the horizontal blanking interval for the horizontal retrace. These blanking intervals are thus outside the picture.
A pulse-cross circuit delays synchronization in the monitor, shifting the image to the left or up. This will reveal areas of the video signal that are usually outside the image. In addition, the circuit reduces the contrast of the image, so that the sync pulses are also shown, where the voltage is below the black level.
In a standard-compliant video signal, the vertical synchronization signal consists of five long pulses of 59.3 μs duration and is framed by five 2.35 μs short pulses before and after, the pre-equalizing pulses. Home computers, game consoles, etc. often do not provide a standard-compliant signal: the sync signal contains no gaps and no pre-equalizing pulses. A pulse-cross circuit will reveal these inaccuracies.
For PAL color coding, the colorburst signal can be seen in the form of an orange bar. For a pure black and white signal, the burst is missing.
Furthermore, the timing error of a video recorder can be recognized on the signal cross. Switching the video heads will cause a single line in the image to be either too long or too short. This error can be corrected by a time base corrector.
Literature
Ru van Wezel, Video-Handbuch (German language)
Martin Hinner, PAL video timing specification
Television technology
Test equipment |
https://en.wikipedia.org/wiki/Frobenius%20formula | In mathematics, specifically in representation theory, the Frobenius formula, introduced by G. Frobenius, computes the characters of irreducible representations of the symmetric group Sn. Among the other applications, the formula can be used to derive the hook length formula.
Statement
Let be the character of an irreducible representation of the symmetric group corresponding to a partition of n: and . For each partition of n, let denote the conjugacy class in corresponding to it (cf. the example below), and let denote the number of times j appears in (so ). Then the Frobenius formula states that the constant value of on
is the coefficient of the monomial in the homogeneous polynomial in variables
where is the -th power sum.
Example: Take . Let and hence , , . If (), which corresponds to the class of the identity element, then is the coefficient of in
which is 2. Similarly, if (the class of a 3-cycle times an 1-cycle) and , then , given by
is −1.
For the identity representation, and . The character will be equal to the coefficient of in ,
which is 1 for any as expected.
Analogues
In , Arun Ram gives a q-analog of the Frobenius formula.
See also
Representation theory of symmetric groups
References
Macdonald, I. G. Symmetric functions and Hall polynomials. Second edition. Oxford Mathematical Monographs. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1995. x+475 pp.
Representation theory |
https://en.wikipedia.org/wiki/SHIFT%20Inc. | is a Japanese software testing company, headquartered in Tokyo, that provides software quality assurance and software testing solutions.
Overview
SHIFT Inc. was founded in 2005 by Masaru Tange, who was a manufacturing process improvement consultant.
In the earliest years, it was a tiny consulting company specializing in manufacturing and business process improvements. In 2007, it entered the software testing industry by undertaking consultancy work for the improvement of E-commerce testing. In 2009, Tange changed the company's direction from the process improvement consultancy to the software testing business. The company then grew so rapidly to be listed on the Tokyo Stock Exchange Mothers market in 2014. In April 2020, it has the market capitalization of 143 billion yen ($1.3 billion), which is the largest of the listed Japanese companies specialized in software quality assurance and testing services.
The company covers software testing outsourcing, project management office and test strategy planning supports, test execution, test design, automated testing, software inspection, and educational program services.
Notes
References
External links
SHIFT Inc.
Software companies of Japan
Service companies based in Tokyo
Software testing
Companies listed on the Tokyo Stock Exchange
Japanese companies established in 2005
Software companies established in 2005 |
https://en.wikipedia.org/wiki/Disposable%20soma%20theory%20of%20aging | The disposable soma theory of aging states that organisms age due to an evolutionary trade-off between growth, reproduction, and DNA repair maintenance. Formulated by Thomas Kirkwood, the disposable soma theory explains that an organism only has a limited amount of resources that it can allocate to its various cellular processes. Therefore, a greater investment in growth and reproduction would result in reduced investment in DNA repair maintenance, leading to increased cellular damage, shortened telomeres, accumulation of mutations, compromised stem cells, and ultimately, senescence. Although many models, both animal and human, have appeared to support this theory, parts of it are still controversial.
Specifically, while the evolutionary trade-off between growth and aging has been well established,
the relationship between reproduction and aging is still without scientific consensus, and the cellular mechanisms largely undiscovered.
Background and history
British biologist Thomas Kirkwood first proposed the disposable soma theory of aging in a 1977 Nature review article. The theory was inspired by Leslie Orgel's Error Catastrophe Theory of Aging, which was published fourteen years earlier, in 1963. Orgel believed that the process of aging arose due to mutations acquired during the replication process, and Kirkwood developed the disposable soma theory in order to mediate Orgel's work with evolutionary genetics.
Principles
The disposable soma theory of aging posits that there is a trade-off in resource allocation between somatic maintenance and reproductive investment. Too low an investment in self-repair would be evolutionarily unsound, as the organism would likely die before reproductive age. However, too high an investment in self-repair would also be evolutionarily unsound due to the fact that one's offspring would likely die before reproductive age. Therefore, there is a compromise and resources are partitioned accordingly. However, this compromise is thought |
https://en.wikipedia.org/wiki/Demonstration%20and%20Shakedown%20Operation | A Demonstration and Shakedown Operation (DASO) is a series of missile tests conducted by the United States Navy and the Royal Navy. These tests are employed to validate a weapon system (SLBM) and ensure a submarine crew's readiness to use that system. A shakedown operation usually occurs after a refueling and overhaul process or construction of a new submarine. Testing of missile systems allows collection of flight-data, and examinations of submarine launch platforms.
The first DASO test occurred July 20, 1960 on the USS George Washington, using the Polaris A-1. Modern tests use the UGM-133 Trident II, launching from an Ohio-class submarine.
References
Aerospace engineering
Product testing
Ballistic missile submarines |
https://en.wikipedia.org/wiki/Battery%20simulator | A battery simulator is an electronic device designed to test battery chargers by simulating the behavior of a battery during the charging process.
Characteristics
Highlights in the battery simulator are the IGBT or MOSFET high frequency regulator (which allows the equipment to work with constant current and voltage), the programmable digital panel.
A battery simulator may have the following features:
An IGBT or MOSFET high frequency regulator
Digital voltmeter
Analogue ammeter
Test voltage selector
Potentiometer fine tension adjustment.
Potentiometer current selection (0-200 A)
self-test
Automatic stop in case of failure
Thermal protection in case of overtemperature
Functioning
Battery simulator mimics a battery’s electrical characteristic of outputting a voltage and is able to source as well as sink current. This type of power supply is called two-quadrant power supply. In contrast, a conventional power supply can only source current when the voltage is positive.
A battery simulator may be able to set the simulated battery voltage either remotely via PC or manually. Often battery simulators have built-in voltage and current display and monitoring. For example, the user selects the voltage of the battery to be simulated, using the potentiometer knob for adjusting the voltage, while the current value is displayed on the digital screen. An independent potentiometer is available to select the maximum current that the equipment can source or sink.
Battery Charger Testing
The basic use of battery simulator is replacing a real battery with a simulator. This enables the testing of the charger both during development and during production testing.
Once the simulated battery voltage is set, the user connects the charger to be tested to the input of the simulator. The charger will detect that a battery has been connected and the charging process will begin. The simulator keeps the voltage constant at the set value, while the analogue ammeter indicates the c |
https://en.wikipedia.org/wiki/Topological%20geometry | Topological geometry deals with incidence structures consisting of a point set and a family of subsets of called lines or circles etc. such that both and carry a topology and all geometric operations like joining points by a line or intersecting lines are continuous. As in the case of topological groups, many deeper results require the point space to be (locally) compact and connected. This generalizes the observation that the line joining two distinct points in the Euclidean plane depends continuously on the pair of points and the intersection point of two lines is a continuous function of these lines.
Linear geometries
Linear geometries are incidence structures in which any two distinct points and are joined by a unique line . Such geometries are called topological if depends continuously on the pair with respect to given topologies on the point set and the line set. The dual of a linear geometry is obtained by interchanging the roles of points and lines. A survey of linear topological geometries is given in Chapter 23 of the Handbook of incidence geometry. The most extensively investigated topological linear geometries are those which are also dual topological linear geometries. Such geometries are known as topological projective planes.
History
A systematic study of these planes began in 1954 with a paper by Skornyakov. Earlier, the topological properties of the real plane had been introduced via ordering relations on the affine lines, see, e.g., Hilbert, Coxeter, and O. Wyler. The completeness of the ordering is equivalent to local compactness and implies that the affine lines are homeomorphic to and that the point space is connected. Note that the rational numbers do not suffice to describe our intuitive notions of plane geometry and that some extension of the rational field is necessary. In fact, the equation for a circle has no rational solution.
Topological projective planes
The approach to the topological properties of projective planes via |
https://en.wikipedia.org/wiki/The%20Turing%20Guide | The Turing Guide, written by Jack Copeland, Jonathan Bowen, Mark Sprevak, Robin Wilson, and others and published in 2017, is a book about the work and life of the British mathematician, philosopher, and early computer scientist, Alan Turing (1912–1954).
Overview
The book includes 42 contributed chapters by a variety of authors, including some contemporaries of Alan Turing. The book was published in January 2017 by Oxford University Press, in hardcover, paperback, and e-book formats.
Contents
The Turing Guide is divided into eight main parts, covering various aspects of Alan Turing's life and work:
Biography: Biographical aspects of Alan Turing.
The Universal Machine and Beyond: Turing's universal machine (now known as a Turing machine), developed while at King's College, Cambridge, which provides a theoretical framework for reasoning about computation, a starting point for the field of theoretical computer science.
Codebreaker: Turing's work on codebreaking during World War II at Bletchley Park, especially the Bombe for decrypting the German Enigma machine.
Computers after the War: Turing's post-War work on computing, at the National Physical Laboratory (NPL) and at the University of Manchester. He made contributions to both hardware design, through the ACE computer (later implemented as the Pilot ACE) at the NPL, and software, especially at Manchester using the Manchester Baby computer, later the Manchester Mark 1 and Ferranti Mark 1.
Artificial Intelligence and the Mind: Turing's pioneering and philosophical contribution to machine intelligence (now known as Artificial Intelligence or AI), including the Turing test.
Biological Growth: Morphogenesis, Turing's last major scientific contribution, on the generation of complex patterns through chemical processes in biology and on the mathematics behind them, foundational in mathematical biology.
Mathematics: Some of Turing's mathematical achievements, including one of his most significant influences, Max New |
https://en.wikipedia.org/wiki/Sierra%20%28supercomputer%29 | Sierra or ATS-2 is a supercomputer built for the Lawrence Livermore National Laboratory for use by the National Nuclear Security Administration as the second Advanced Technology System. It is primarily used for predictive applications in stockpile stewardship, helping to assure the safety, reliability and effectiveness of the United States' nuclear weapons.
Sierra is very similar in architecture to the Summit supercomputer built for the Oak Ridge National Laboratory. The nodes in Sierra are Witherspoon IBM S922LC OpenPOWER servers with two GPUs per CPU and four GPUs per node. These nodes are connected with EDR InfiniBand. In 2019 Sierra was upgraded with IBM Power System AC922 nodes.
Sierra is composed of 4,474 nodes, 4,284 of which are compute nodes. Each node has 256GB of RAM, 44 IBM POWER9 cores spread across two physical sockets, and Four Nvidia Tesla V100 GPUs, each providing 16GB of VRAM. This gives the complete system 8,948 CPUs, 17,896 GPUs, 1.14 PB of RAM, and 286 TB of VRAM.
Sierra has consistently appeared on the Top500 list, peaking at #2 in November 2018 and currently at #6 on the June 2023 Top500 list. Only 4.6 petaflops of its performance come from its CPUs, with the large majority (120.9 petaflops) coming from the Tesla GPUs.
See also
Trinity (supercomputer) – ATS-1, the first Advanced Technology System
OpenBMC
References
External links
GPGPU supercomputers
IBM supercomputers
Lawrence Livermore National Laboratory
NNSA Advanced Technology Systems
Petascale computers |
https://en.wikipedia.org/wiki/Hecke%20algebra | In mathematics, the Hecke algebra is the algebra generated by Hecke operators.
Properties
The algebra is a commutative ring.
In the classical elliptic modular form theory, the Hecke operators Tn with n coprime to the level acting on the space of cusp forms of a given weight are self-adjoint with respect to the Petersson inner product. Therefore, the spectral theorem implies that there is a basis of modular forms that are eigenfunctions for these Hecke operators. Each of these basic forms possesses an Euler product. More precisely, its Mellin transform is the Dirichlet series that has Euler products with the local factor for each prime p is the reciprocal of the Hecke polynomial, a quadratic polynomial in p−s. In the case treated by Mordell, the space of cusp forms of weight 12 with respect to the full modular group is one-dimensional. It follows that the Ramanujan form has an Euler product and establishes the multiplicativity of τ(n).
See also
Abstract algebra
Wiles's proof of Fermat's Last Theorem
References
Algebra
Number theory
Modular forms |
https://en.wikipedia.org/wiki/Ovulatory%20shift%20hypothesis | The ovulatory shift hypothesis holds that women experience evolutionarily adaptive changes in subconscious thoughts and behaviors related to mating during different parts of the ovulatory cycle. It suggests that what women want, in terms of men, changes throughout the menstrual cycle. Two meta-analyses published in 2014 reached opposing conclusions on whether the existing evidence was robust enough to support the prediction that women's mate preferences change across the cycle. A newer 2018 review does not show women changing the type of men they desire at different times in their fertility cycle.
Overview
The theory proposes that women's behavior may change during the most fertile time in their ovulatory cycle. At high fertility, the theory holds that women may become more physically active and avoid male relatives.
The hypothesis separately proposes that hormonal changes across the cycle cause women, when they are most likely to get pregnant, to be more attracted to traits in potential short-term male sexual partners that indicate high genetic quality, leading to greater reproductive success. It has been proposed that genetic traits like compatible major histocompatibility complex gene profiles are considered more attractive. Newer studies do not support female changes in desired reproductive partners when more fertile.
Estrus in humans
Most female mammals experience reproductive fertility cycles. They typically consist of a long period of low fertility, and a brief period of high fertility just prior to and including ovulation. In humans, this is called the ovulatory cycle, or menstrual cycle. The period of high fertility is also called the fertile window, and is the only time during the cycle when sex can result in conception.
Females of most mammalian species display hormonally-induced physical and behavioral signals of their fertility during the fertile window, such as sexual swellings and increased motivation to mate. Some species will not—or cannot |
https://en.wikipedia.org/wiki/Golic%20and%20Wingo | Golic and Wingo was an American sports-talk radio show that was hosted by Mike Golic, Sr., his son Mike Jr. and co-host Trey Wingo that aired on the ESPN networks. The show was carried on ESPN Radio and simulcast on television on ESPNEWS since April 2, 2018 (prior to this, it was simulcast on ESPN2), and acted as the morning show for both the radio and television sides of the production. Outside of a few radio stations that were able to move or decline carriage of the show for their own local morning productions (or for daytime-only operations, may not be able to carry), Golic and Wingo was effectively a compulsory element of the ESPN Radio schedule, which all affiliates of the network were required to carry and was the premier morning show on ESPN.
The show started on November 27, 2017, and succeeded Mike & Mike, with Golic's previous co-host, Mike Greenberg leaving the show on November 17, 2017 for a morning show on ESPN called Get Up! (which premiered on April 2, 2018) after an 18-year run together.
ESPN announced that Golic and Wingo would be ending on July 31, 2020. Mike Golic retired from ESPN Radio after the final Golic and Wingo show on July 31, 2020. At the time, there was no show announced for Trey Wingo (he is no longer at ESPN as of September 4, 2020), while Mike Golic Jr. joined Chiney Ogwumike for their new late afternoon radio show, Chiney & Golic Jr., which started on August 17, 2020.
As for the Golic and Wingo show itself, it was replaced with Keyshawn, JWill & Zubin, which also debuted August 17, 2020.
References
ESPN Radio programs
ESPN2 original programming
American sports radio programs
Radio programs on XM Satellite Radio
Simulcasts
Television series based on radio series |
https://en.wikipedia.org/wiki/Andrea%20Goldsmith%20%28engineer%29 | Andrea Goldsmith is an American electrical engineer and the Dean of Engineering and Applied Science at Princeton University. She is also the Arthur LeGrand Doty Professor of Electrical Engineering at Princeton. She was previously the Stephen Harris Professor in the School of Engineering at Stanford University, as well as a faculty affiliate at the Stanford Neurosciences Institute. Her interests are in the design, analysis and fundamental performance limits of wireless systems and networks, and in the application of communication theory and signal processing to neuroscience. She also co-founded and served as chief technology officer of Plume WiFi and Quantenna Communications. Since 2021, she has been a member of the President’s Council of Advisors on Science and Technology (PCAST).
Early life and education
Goldsmith was raised in the San Fernando Valley, California. Her father Werner Goldsmith was a professor of mechanical engineering at UC Berkeley, and her mother Adrienne Goldsmith was an animator for cartoon shows including The Rocky and Bullwinkle Show. Goldsmith earned her bachelor's degree in engineering math from the University of California, Berkeley, in 1986, and her MS and PhD in electrical engineering from UC Berkeley in 1991 and 1994, respectively. In the years between obtaining her bachelor's and PhD, she spent four years as a systems engineer at a Silicon Valley defense communications startup.
Work and academic career
Goldsmith started her academic career at the California Institute of Technology and was there for four years. She joined Stanford in 1999, becoming an associate professor in 2002 and a full professor in 2007. At Stanford, she has served as chair of the faculty senate, and on the school's task force on women and leadership. In 2006, she took a leave of absence from Stanford and co-founded Quantenna Communications, a company that produces silicon chipsets designed for high-speed, wireless high-definition video home networking. She serve |
https://en.wikipedia.org/wiki/Commercial%20Operating%20System | Commercial Operating System (COS) is a discontinued family of operating systems from Digital Equipment Corporation.
They supported the use of DIBOL, a programming language combining features of BASIC, FORTRAN and COBOL. COS also supported IBM RPG (Report Program Generator).
Implementations
The Commercial Operating System was implemented to run on hardware from the PDP-8 and PDP-11 families.
COS-310
COS-310 was developed for the PDP-8 to provide an operating environment for DIBOL. A COS-310 system was purchased as a package which included a desk, VT52 VDT (Video Display Tube), and a pair of eight inch floppy drives. It could optionally be purchased with one or more 2.5 MB removable media hard drives. COS-310 was one of the operating systems available on the DECmate II.
COS-350
COS-350 was developed to support the PDP-11 port of DIBOL, and was the focus for some vendors of turnkey software packages.
Pre-COS-350, a PDP 11/05 single-user batch-oriented implementation was released; the multi-user PDP 11/10-based COS came about 4 years later. The much more powerful PDP-11/34 "added significant configuration flexibility and expansion capability."
See also
Comparison of operating systems
Timeline of operating systems
Notes
References
DEC operating systems
Time-sharing operating systems |
https://en.wikipedia.org/wiki/Russian%20Engineer%20Troops | The Engineer Troops of the Russian Federation () are a Combat Arm and military administrative corps of the Russian Ground Forces of the Russian Federation designed to perform military engineering operations (combat actions), requiring special training of personnel and use of means of engineer equipment, as well as for damaging the enemy through application of engineer ammunition.
Origins
Imperial era
One of the first engineering units founded in the Russian Empire was the Pososhniye lyudi, a collective name for conscripts in the Imperial Russian Army called up for military service from each sokha unit. In the late 17th century, the first engineering training maneuvers were carried out under the patronage of Peter I. The day of the Engineering Forces is recognized as 21 January 1701, with on the opening of the School of the Pushkar Order. The first engineering schools were created: in 1708 in Moscow and then in March 1719 in St. Petersburg. The term of study at these schools ranged from 5 to 12 years. The Imperial Engineering Troops first took part in the Battle of Poltava, the Patriotic War of 1812, Crimean War from 1853 to 1856, and the First World War.
Soviet Engineer Troops
After the February Revolution and the Great October Socialist Revolution of 1917 the newly formed Red Army and Soviet Navy incorporated the sapper units of the former Imperial Russian Army and Navy in its structure. By 1919, pontoon and electrical battalions and a mine-blasting brigade were raised in time for the Civil War. 10 years later, the Engineering Troops of the USSR () were in much better shape and had a much better organization. During the Second World War, ten sapper armies operated, later reorganized into brigades. From the mid-1940s to the 1970s, Engineer-Sapper Companies (ISR) were located in Soviet Army regiments, divisions, as well as combined-arms armies. Due to miscalculations in planning by the Ministry of Defense of the Soviet Union, there was a shortage of engineering |
https://en.wikipedia.org/wiki/MyCujoo | MyCujoo was a video streaming platform providing live and on-demand broadcast of football matches, sports events, and highlights from around the world. Founded in 2014, and launched in 2015 by brothers Pedro and João Presa, and specialising in the long tail of football, MyCujoo provided a platform and channels for teams, leagues, and federations to broadcast their own content including streaming live merely by using a cellphone.
Customers included the Canadian Soccer Association, Jordan Football Association, Football Association of Indonesia,Myanmar National League, the Japan Women's Football League, Fluminense Football Club, the Football Association of Singapore, the Asian Football Confederation, the Bhutan Football Federation, the All Nepal Football Association, the Football Federation Islamic Republic of Iran, ADO Den Haag, US Soccer, the Football Association of Thailand, the Brazilian Football Confederation, the Oceania Football Confederation, the Lebanon Football Association, United Women's Soccer, Beach Soccer Worldwide (BSWW), National Independent Soccer Association, National Premier Soccer League, Federação Paulista de Futebol and Campeonato Brasileiro Série D.
According to the company, beginning with its inaugural partnership with FC Zürich Frauen, MyCujoo grew from streaming 56 games in 2015 to over 300 by the end of the first quarter in 2017, and by the end of the year approximately 4,200 games had been broadcast from 60 countries with roughly 40 million viewers. Since its partnership with the AFC launched in 2016 there have been 1,544 matches streamed from AFC member association territories, reaching nearly 19 million viewers in over 122 countries. In October 2018, the company was the subject of an Amazon Studios documentary, and in November 2018 was described by the Financial Times as one of Europe's 100 digital champions.
In January 2019, it was announced that MyCujoo had concluded a five year agreement with the International Hockey Federation to p |
https://en.wikipedia.org/wiki/Glass%20bead%20road%20surface%20marking | Glass beads composed of soda lime glass are essential for providing retroreflectivity in many kinds of road surface markings. Retroreflectivity occurs when incident light from vehicles is refracted within glass beads that are imbedded in road surface markings and then reflected back into the driver's field of view. In North America, approximately 227 million kilograms of glass beads are used for road surface markings annually. Roughly 520 kilograms of glass beads are used per mile during remarking of a five lane highway system, and road remarking can occur every two to five years. In the United States, the massive demand for glass beads has led to importing from countries using outdated manufacturing regulations and techniques. These techniques include the use of heavy metals such as arsenic, antimony, and lead during the manufacturing process as decolorizes and fining agents. It has been found that the heavy metals become incorporated into the bead's glass matrix and may leach under environmental conditions that roads experience.
Composition and manufacturing
The synthesis of these beads begins when calcium carbonate is heated to anywhere from 800-1300C. This heating causes a decomposition reaction which forms solid calcium oxide and releases carbon dioxide gas.
CaCO3 ->[{800-1300C}]{CaO(s)} + CO2(g)
Similarly, sodium carbonate decomposes to sodium oxide and releases carbon dioxide gas.
Na2CO3 -> [{800-1300C}] {Na2O(s)} + CO2(g)
Sodium oxide is then reacted with silica to produce sodium silicate liquid glass.
{Na2O(s)}+SiO2(s) -> Na2SiO3(l)
Lastly, to complete the general structure of the soda-lime glass, calcium oxide is dissolved in solution with sodium silicate glass, which ultimately reduces the softening temperature of the glass. Additional metals and ions are added to this melted glass to improve its properties, and the compound is then sprayed and formed into beads using either the direct or indirect method.
{Na2SiO3(l)}+ CaO(s) -> Na2O*CaO* |
https://en.wikipedia.org/wiki/HQ%20%28video%20game%29 | HQ is a mobile trivia game developed by Intermedia Labs for iOS, Android, iPadOS, and tvOS. First released in 2017, the HQ app allowed users to participate in daily, live, trivia games in which they could win or split prize money. HQ was developed by Vine creators Rus Yusupov and Colin Kroll and credited as a production of Intermedia Labs.
The app's original game was HQ Trivia, in which players have 10 seconds to answer multiple-choice questions that increase in difficulty. Additional games, such as HQ Words and HQ Tunes, were later added. The last HQ games were supposed to be hosted once a week, with a prize pot of $1,500, and typically saw about 15,000 players each. HQ has only approved payouts for games up to June 30, leaving winnings since then unpaid.
On February 14, 2020, Intermedia Labs Trivia sent a memo to staff stating the company would "cease operations and move to dissolution". However, four days later, Yusupov said he had a tentative deal in place with another company to purchase the HQ franchise and keep it operational. On March 29, HQ Trivia resumed its daily games.
While HQ never officially announced a shutdown, it has not had a game since November 17, 2022. Shortly after, the app went dark, and was removed from both the Apple App Store and Google Play Store on August 5, 2023.
History
The game's original concept, a gameshow hosted by astronauts, was created by Rus Yusupov, who had been experimenting with the idea at his tech incubator, Big Human, prior to co-founding Intermedia Labs. HQ Trivia was first released on August 26, 2017, for iOS, and on December 31, 2017, for Android. Shows were broadcast live from New York City. The primary host of HQ Trivia was initially Scott Rogowsky. In April 2019, Rogowsky was replaced by Matt Richards as the primary host of the game after negotiations between HQ and Rogowsky broke down over his new baseball show on DAZN. Richards, a stand-up comedian from Queens, New York, who has played comedy roles in severa |
https://en.wikipedia.org/wiki/Bioactive%20terrarium | A bioactive terrarium (or vivarium) is a terrarium for housing one or more terrestrial animal species that includes live plants and populations of small invertebrates and microorganisms to consume and break down the waste products of the primary species. In a functional bioactive terrarium, the waste products will be broken down by these detritivores, reducing or eliminating the need for cage cleaning. Bioactive vivariums are used by zoos and hobbyists to house reptiles and amphibians in an aesthetically pleasing and enriched environment.
Enclosure
Any terrarium can be made bioactive by addition of the appropriate substrate, plants, and detritivores. Bioactive enclosures are often maintained as display terraria constructed of PVC, wood, glass and/or acrylic. Bioactive enclosures in laboratory "rack" style caging are uncommon.
Cleanup crew
Waste products of the primary species are consumed by a variety of detritivores, referred to as the "cleanup crew" by hobbyists. These can include woodlice, springtails, earthworms, millipedes, and various beetles, with different species being preferred in different habitats - the cleanup crew for a tropical rainforest bioactive terrarium may rely primarily on springtails, isopods, and earthworms, while a desert habitat might use beetles. If the primary species is insectivorous, they may consume the cleanup crew, and thus the cleanup crew must have sufficient retreats to avoid being completely depopulated.
Additionally, bioactive terraria typically have a flourishing population of bacteria and other microorganisms which break down the wastes of the cleanup crew and primary species. Fungi may occur as part of the terrarium cycle and will be consumed by the cleanup crew.
Substrate
Bioactive enclosures require some form of substrate to grow plants and to provide habitat for the cleanup crew. The choice of substrate is typically determined by the habitat of the primary species (e.g. jungle vs desert), and created by mixing a v |
https://en.wikipedia.org/wiki/Climate%20restoration | Climate restoration is the climate change goal and associated actions to restore to levels humans have actually survived long-term, below 300 ppm. This would restore the Earth system generally to a safe state, for the well-being of future generations of humanity and nature. Actions include carbon dioxide removal from the Carbon dioxide in Earth's atmosphere, which, in combination with emissions reductions, would reduce the level of in the atmosphere and thereby reduce the global warming produced by the greenhouse effect of an excess of over its pre-industrial level. Actions also include restoring pre-industrial atmospheric methane levels by accelerating natural methane oxidation.
Climate restoration enhances legacy climate goals (stabilizing earth's climate) to include ensuring the survival of humanity by restoring to levels of the last 6000 years that allowed agriculture and civilization to develop.
Restoration and mitigation
Climate restoration is the goal underlying climate change mitigation, whose actions are intended to "limit the magnitude or rate of long-term climate change". Advocates of climate restoration accept that climate change has already had major negative impacts which threaten the long-term survival of humanity. The current mitigation pathway leaves the risk that conditions will go beyond adaptation and abrupt climate change will be upon us. There is a human moral imperative to maximize the chances of future generations' survival. By promoting the vision of the "survival and flourishing of humanity", with the Earth System restored to a state close to that in which our species and civilization evolved, advocates claim that there is a huge incentive for innovation and investment to ensure that this restoration takes place safely and in a timely fashion. As stated in "The Economist" in November 2017, "in any realistic scenario, emissions cannot be cut fast enough to keep the total stock of greenhouse gases sufficiently small to limit the ris |
https://en.wikipedia.org/wiki/Waldspurger%20formula | In representation theory of mathematics, the Waldspurger formula relates the special values of two L-functions of two related admissible irreducible representations. Let be the base field, be an automorphic form over , be the representation associated via the Jacquet–Langlands correspondence with . Goro Shimura (1976) proved this formula, when and is a cusp form; Günter Harder made the same discovery at the same time in an unpublished paper. Marie-France Vignéras (1980) proved this formula, when and is a newform. Jean-Loup Waldspurger, for whom the formula is named, reproved and generalized the result of Vignéras in 1985 via a totally different method which was widely used thereafter by mathematicians to prove similar formulas.
Statement
Let be a number field, be its adele ring, be the subgroup of invertible elements of , be the subgroup of the invertible elements of , be three quadratic characters over , , be the space of all cusp forms over , be the Hecke algebra of . Assume that, is an admissible irreducible representation from to , the central character of π is trivial, when is an archimedean place, is a subspace of such that . We suppose further that, is the Langlands -constant [ ; ] associated to and at . There is a such that .
Definition 1. The Legendre symbol
Comment. Because all the terms in the right either have value +1, or have value −1, the term in the left can only take value in the set {+1, −1}.
Definition 2. Let be the discriminant of .
Definition 3. Let .
Definition 4. Let be a maximal torus of , be the center of , .
Comment. It is not obvious though, that the function is a generalization of the Gauss sum.
Let be a field such that . One can choose a K-subspace of such that (i) ; (ii) . De facto, there is only one such modulo homothety. Let be two maximal tori of such that and . We can choose two elements of such that and .
Definition 5. Let be the discriminants of .
Comment. When the , the rig |
https://en.wikipedia.org/wiki/Subrepresentation | In representation theory, a subrepresentation of a representation of a group G is a representation such that W is a vector subspace of V and .
A nonzero finite-dimensional representation always contains a nonzero subrepresentation that is irreducible, the fact seen by induction on dimension. This fact is generally false for infinite-dimensional representations.
If is a representation of G, then there is the trivial subrepresentation:
References
Representation theory |
https://en.wikipedia.org/wiki/ISO%2017800 | ISO 17800 is an international standard for the Facility Smart Grid Information Model (FSGIM), which is currently under development. ISO 17800 is one of the International Organization for Standardization's group of standards for building environment design, and is the responsibility of ISO Technical Committee 205 (TC205).
Standard documents
The first edition of ISO 17800 is detailed in the ISO 17800 standard document which was published in December 2017.
According to ISO, the scope of the standard is defined as:ISO 17800:2017 provides the basis for common information exchange between control systems and end use devices found in single - and multi-family homes, commercial and institutional buildings, and industrial facilities that is independent of the communication protocol in use. It provides a common basis for electrical energy consumers to describe, manage, and communicate about electrical energy consumption and forecasts.ISO 17800:2017 defines a comprehensive set of data objects and actions that support a wide range of energy management applications and electrical service provider interactions including:a) on-site generation,b) demand response,c) electrical storage,d) peak demand management,e) forward power usage estimation,f) load shedding capability estimation,g) end load monitoring (sub metering),h) power quality of service monitoring,i) utilization of historical energy consumption data, andj) direct load control.In addition to the printed text, the standard also contains a UML (Unified Modeling Language) model of all of the concepts in the standard.
See also
ISO 15118
IEC 61850
IEC 61851
IEC 63110
References
17800 |
https://en.wikipedia.org/wiki/Giganten%20%28board%20game%29 | Giganten , also named as "Dinosaures Giganti" is a 2-player board game designed by Herbert Pinthus and first published in 1981 by Carlit. Gameplay is inspired by another game "Stratego" and created in prehistoric setting. There were two editions.
Small edition, added variable terrain (land, swamp, lakes). Lakes were not terrain but obstacles.
Large edition: added variable board consisting of 4 parts and added 2 more dinosaurs.
The large won the Essen Feather-prize (prize for the best rules) in 1983.
Gameplay
Each player has a set of 23 saurians (dinosaurs of various kinds, pterodactyls, plesiosaurs, etc) which are stand-up cardboard pieces with plain backs, so the opponent cannot tell which piece is which. Pieces move and attack each other Stratego-fashion, with the goal being to find your opponent's eggs. Pieces have numbers to indicate their strength.
Awards
1983 Essen Feather
References
External links
Board games
Biology-themed board games
Board games introduced in 1981 |
https://en.wikipedia.org/wiki/Multifidelity%20simulation | Multifidelity (or multi-fidelity) methods leverage both low- and high-fidelity data in order to maximize the accuracy of model estimates, while minimizing the cost associated with parametrization. They have been successfully used in impedance cardiography, wing-design optimization, robotic learning, computational biomechanics, and have more recently been extended to human-in-the-loop systems, such as aerospace and transportation. They include both model-based methods, where a generative model is available or can be learned, in addition to model-free methods, that include regression-based approaches, such as stacked-regression. A more general class of regression-based multi-fidelity methods are Bayesian approaches, e.g. Bayesian linear regression, Gaussian mixture models, Gaussian processes, auto-regressive Gaussian processes, or Bayesian polynomial chaos expansions.
The approach used depends on the domain and properties of the data available, and is similar to the concept of metasynthesis, proposed by Judea Pearl.
Data fidelity spectrum
The fidelity of data can vary along a spectrum between low- and high-fidelity. The next sections provide examples of data across the fidelity spectrum, while defining the benefits and limitations of each type of data.
Low fidelity data (LoFi)
Low-fidelity data (LoFi) includes any data that was produced by a person or Stochastic Process that deviates from the real-world system of interest. For example, LoFi data can be produced by models of a physical system that use approximations to simulate the system, rather than modeling the system in an exhaustive manner.
Moreover, in human-in-the-loop (HITL) situations the goal may be to predict the impact of technology on expert behavior within the real-world operational context. Machine learning can be used to train statistical models that predict expert behavior, provided that an adequate amount of high-fidelity (i.e., real-world) data are available or can be produced.
LoFi benefits |
https://en.wikipedia.org/wiki/Data%20query%20language | Data query language (DQL) is part of the base grouping of SQL sub-languages. These sub-languages are mainly categorized into four categories: a data query language (DQL), a data definition language (DDL), a data control language (DCL), and a data manipulation language (DML). Sometimes a transaction control language (TCL) is argued to be part of the sub-language set as well.
DQL statements are used for performing queries on the data within schema objects. The purpose of DQL commands is to get the schema relation based on the query passed to it.
Although often considered part of DML, the SQL SELECT statement is strictly speaking an example of DQL. When adding FROM or WHERE data manipulators to the SELECT statement the statement is then considered part of the DML.
Related language types
Data definition language
Data manipulation language
Data control language
Transactional control language
Data modeling
SQL |
https://en.wikipedia.org/wiki/Autocorrelation%20%28words%29 | In combinatorics, a branch of mathematics, the autocorrelation of a word is the set of periods of this word. More precisely, it is a sequence of values which indicate how much the end of a word looks likes the beginning of a word. This value can be used to compute, for example, the average value of the first occurrence of this word in a random string.
Definition
In this article, A is an alphabet, and a word on A of length n. The autocorrelation of can be defined as the correlation of with itself. However, we redefine this notion below.
Autocorrelation vector
The autocorrelation vector of is , with being 1 if the prefix of length equals the suffix of length , and with being 0 otherwise. That is indicates whether .
For example, the autocorrelation vector of is since, clearly, for being 0, 1 or 2, the prefix of length is equal to the suffix of length . The autocorrelation vector of is since no strict prefix is equal to a strict suffix. Finally, the autocorrelation vector of is 100011, as shown in the following table:
Note that is always equal to 1, since the prefix and the suffix of length are both equal to the word . Similarly, is 1 if and only if the first and the last letters are the same.
Autocorrelation polynomial
The autocorrelation polynomial of is defined as . It is a polynomial of degree at most .
For example, the autocorrelation polynomial of is and the autocorrelation polynomial of is . Finally, the autocorrelation polynomial of is .
Property
We now indicate some properties which can be computed using the autocorrelation polynomial.
First occurrence of a word in a random string
Suppose that you choose an infinite sequence of letters of , randomly, each letter with probability , where is the number of letters of . Let us call the expectation of the first occurrence of ? in ? . Then equals . That is, each subword of which is both a prefix and a suffix causes the average value of the first occurrence of to occur letters |
https://en.wikipedia.org/wiki/Intensity-duration-frequency%20curve | An intensity-duration-frequency curve (IDF curve) is a mathematical function that relates the intensity of an event (e.g. rainfall) with its duration and frequency of occurrence. Frequency is the inverse of the probability of occurrence. These curves are commonly used in hydrology for flood forecasting and civil engineering for urban drainage design. However, the IDF curves are also analysed in hydrometeorology because of the interest in the time concentration or time-structure of the rainfall, but it is also possible to define IDF curves for drought events. Additionally, applications of IDF curves to risk-based design are emerging outside of hydrometeorology, for example some authors developed IDF curves for food supply chain inflow shocks to US cities.
Mathematical approaches
The IDF curves can take different mathematical expressions, theoretical or empirically fitted to observed event data. For each duration (e.g. 5, 10, 60, 120, 180 ... minutes), the empirical cumulative distribution function (ECDF), and a determined frequency or return period is set. Therefore, the empirical IDF curve is given by the union of the points of equal frequency of occurrence and different duration and intensity Likewise, a theoretical or semi-empirical IDF curve is one whose mathematical expression is physically justified, but presents parameters that must be estimated by empirical fits.
Empirical approaches
There is a large number of empirical approaches that relate the intensity (I), the duration (t) and the return period (p), from fits to power laws such as:
Sherman's formula, with three parameters (a, c and n), which are a function of the return period, p:
Chow's formula, also with three parameters (a, c and n), for a particular return period p:
Power law according to Aparicio (1997), with four parameters (a, c, m and n), already adjusted for all return periods of interest:
In hydrometeorology, the simple power law (taking ) is used as a measure of the time-st |
https://en.wikipedia.org/wiki/Alspach%27s%20conjecture | Alspach's conjecture is a mathematical theorem that characterizes the disjoint cycle covers of complete graphs with prescribed cycle lengths. It is named after Brian Alspach, who posed it as a research problem in 1981. A proof was published by .
Formulation
In this context, a disjoint cycle cover is a set of simple cycles, no two of which use the same edge, that include all of the edges of a graph. For a disjoint cycle cover to exist, it is necessary for every vertex to have even degree, because the degree of each vertex is two times the number of cycles that include that vertex, an even number. And for the cycles in a disjoint cycle cover to have a given collection of lengths,
it is also necessary for the sum of the given cycle lengths to equal the total number of edges in the given graph. Alspach conjectured that, for complete graphs, these two necessary conditions are also sufficient: if is odd (so that the degrees are even) and a given list of cycle lengths (all at most ) adds to (the number of edges in the complete graph) then the complete graph can always be decomposed into cycles of the given length. It is this statement that Bryant, Horsley, and Pettersson proved.
Generalization to even numbers of vertices
For complete graphs whose number of vertices is even, Alspach conjectured that it is always possible to decompose the graph into a perfect matching and a collection of cycles of prescribed lengths summing to . In this case the matching eliminates the odd degree at each vertex, leaving a subgraph of even degree, and the remaining condition is again that the sum of the cycle lengths equals the number of edges to be covered. This variant of the conjecture was also proven by Bryant, Horsley, and Pettersson.
Related problems
The Oberwolfach problem on decompositions of complete graphs into copies of a given 2-regular graph is related, but neither is a special case of the other.
If is a 2-regular graph, with vertices, formed from a disjoint union of cy |
https://en.wikipedia.org/wiki/Oberwolfach%20problem | The Oberwolfach problem is an unsolved problem in mathematics that may be formulated either as a problem of scheduling seating assignments for diners,
or more abstractly as a problem in graph theory, on the edge cycle covers of complete graphs. It is named after the Oberwolfach Research Institute for Mathematics, where the problem was posed in 1967 by Gerhard Ringel. It is known to be true for all sufficiently-large complete graphs.
Formulation
In conferences held at Oberwolfach, it is the custom for the participants to dine together in a room with circular tables, not all the same size, and with assigned seating that rearranges the participants from meal to meal. The Oberwolfach problem asks how to make a seating chart for a given set of tables so that all tables are full at each meal and all pairs of conference participants are seated next to each other exactly once. An instance of the problem can be denoted as where are the given table sizes. Alternatively, when some table sizes are repeated, they may be denoted using exponential notation; for instance, describes an instance with three tables of size five.
Formulated as a problem in graph theory, the pairs of people sitting next to each other at a single meal can be represented as a disjoint union of cycle graphs of the specified lengths, with one cycle for each of the dining tables. This union of cycles is a 2-regular graph, and every 2-regular graph has this form. If is this 2-regular graph and has vertices, the question is whether the complete graph of order can be represented as an edge-disjoint union of copies of .
In order for a solution to exist, the total number of conference participants (or equivalently, the total capacity of the tables, or the total number of vertices of the given cycle graphs) must be an odd number. For, at each meal, each participant sits next to two neighbors, so the total number of neighbors of each participant must be even, and this is only possible when the total numbe |
https://en.wikipedia.org/wiki/Leading-one%20detector | A leading-one detector is an electronic circuit commonly found in central processing units and especially their arithmetic logic units (ALUs). It is used to detect whether the leading bit in a computer word is 1 or 0, which is used to perform basic binary tests like IF A>0.
Binary arithmetic |
https://en.wikipedia.org/wiki/Word%20RAM | In theoretical computer science, the word RAM (word random-access machine) model is a model of computation in which a random-access machine does arithmetic and bitwise operations on a word of bits. Michael Fredman and Dan Willard created it in 1990 to simulate programming languages like C.
Model
The word RAM model is an abstract machine similar to a random-access machine, but with finite memory and word-length. It works with words of size up to bits, meaning it can store integers up to . Because the model assumes that the word size matches the problem size, that is, for a problem of size , , the word RAM model is a transdichotomous model. The model allows both arithmetic operations and bitwise operations including logical shifts to be done in constant time (the precise instruction set assumed by an algorithm or proof using the model may vary).
Algorithms and data structures
In the word RAM model, integer sorting can be done fairly efficiently. Yijie Han and Mikkel Thorup created a randomized algorithm to sort integers in expected time of (in Big O notation) , while Han also created a deterministic variant with running time .
The dynamic predecessor problem is also commonly analyzed in the word RAM model, and was the original motivation for the model. Dan Willard used y-fast tries to solve this in time, or, more precisely, where is a bound on the values stored. Michael Fredman and Willard also solved the problem using fusion trees in time. Using exponential search trees, a query can be performed in .
Additional results in the word RAM model are listed in the article on range searching.
Lower bounds applicable to word RAM algorithms are often proved in the cell-probe model.
See also
Transdichotomous model
References
Models of computation |
https://en.wikipedia.org/wiki/Migration%20%28ecology%29 | Migration, in ecology, is the large-scale movement of members of a species to a different environment. Migration is a natural behavior and component of the life cycle of many species of mobile organisms, not limited to animals, though animal migration is the best known type. Migration is often cyclical, frequently occurring on a seasonal basis, and in some cases on a daily basis. Species migrate to take advantage of more favorable conditions with respect to food availability, safety from predation, mating opportunity, or other environmental factors.
Migration is most commonly seen as animal migration, the physical movement by animals from one area to another. That includes bird, fish, and insect migration. However, plants can be said to migrate, as seed dispersal enables plants to grow in new areas, under environmental constraints such as temperature and rainfall, resulting in changes such as forest migration.
Mechanisms
While members of some species learn a migratory route on their first journey with older members of their group, other species genetically pass on information regarding their migratory paths. Despite many differences in organisms’ migratory cues and behaviors, “considerable similarities appear to exist in the cues involved in the different phases of migration.” Migratory organisms use environmental cues like photoperiod and weather conditions as well as internal cues like hormone levels to determine when it is time to begin a migration. Migratory species use senses such as magnetoreception or olfaction to orient themselves or navigate their route, respectively.
Factors
The factors that determine migration methods are variable due to the inconsistency of major seasonal changes and events. When an organism migrates from one location to another, its energy use and rate of migration are directly related to each other and to the safety of the organism. If an ecological barrier presents itself along a migrant's route, the migrant can either choose t |
https://en.wikipedia.org/wiki/Ecomedia | Ecomedia is a field of study that deals with the relationship between non-print media and the natural environment. Generally, this is divided into two domains: cultural representations of the environment in media and environmental impact of media forms.
The first domain, the environment in media, is very broad and can potentially include any form of media that deals with an environmental issue. The second domain, environmental impacts and concerns of media, focuses on the environmental impacts at every level production of media projects and seeks to make media as sustainable as possible
History
The field of ecomedia is still developing and remains mainly an academic discourse. It can be considered a subgroup of media studies, and it crosses the bounds of traditionally “single media” disciplines like literature, art history, and music.
The website EcomediaStudies.org was created in 2009 by Steve Rust and Salma Monani as a forum to generate conversation about ecomedia and to make a space for people writing about ecomedia to publish their work. The website’s creators sketch the history of their field as developing out of “the 2009 Association for the Study of Literature and Environment (ASLE) conference in Victoria, British Columbia” which featured a special session and several panels on Ecological Media. Although the website has since been shut down, due to the creators wanting to focus on promoting the study of ecomedia, the website is still up and holds a significant amount of information about ecomedia and its development.
In 2015 Rust and Monani, along with Sean Cubitt, edited and published Ecomedia: Key Issues (Key Issues in Environment and Sustainability), a book that outlines the important factors at stake in ecomedia studies by looking from various theoretical perspectives at the interactions of environmental issues and media. The text covers multiple types of media with chapters on photography, cinema, newspaper strips, radio, television, mapping system |
https://en.wikipedia.org/wiki/Pathao | Pathao (); is a Bangladeshi on-demand digital platform company headquartered in Dhaka, Bangladesh. The company operates in four cities in Bangladesh: Dhaka, Chittagong, Khulna,Sylhet , and in two cities in Nepal: Kathmandu and Chitwan. Pathao has ride-sharing services, food delivery, courier and E-commerce services. Pathao is the first major ride-sharing company in Bangladesh to get enlistment certificate from the authorities.
Pathao is a Bengali word meaning "send". The company was founded by Fahim Saleh, Hussain Elius, and Shifat Adnan.
On 1 November 2021, Pathao appointed its chief financial officer, Fahim Ahmed, as Managing Director & Chief Executive Officer of the ride-sharing platform.
History
Pathao started as a delivery service back in 2015 with its fleet of motorcycles and bicycles. They acted as a delivery service for several E-Commerce Companies of Bangladesh. Later in 2016, Pathao started bike-sharing services in mid-2016 and successfully signed up more than 100,000 drivers and around 1 million users in March 2018 across the country. In an interview with TechCrunch, Pathao Co-founder, Hussain M Elius confirmed that Pathao currently has over 50,000 bikes registered on its platform and the company is valued at over $100 million as of April 2018. In September 2018, Pathao launched its services in Nepal. Pathao is the first Bangladeshi company to offer On-demand Transport Sharing services abroad. On 3 December 2019, Pathao became the first major ride-sharing service providing company in Bangladesh to get enlistment certificate from the authorities in Bangladesh.
Operations
Pathao follows a SuperApp model, providing all of its services through one app.
Services
Pathao currently provides on-demand ride-sharing, on-demand parcel, courier, food delivery services in major cities like Dhaka, Chittagong and Sylhet and in Kathmandu, Lalitpur, Chitwan and many more cities of Nepal and Bangladesh. Its food delivery services are currently available in Dhaka, Chitt |
https://en.wikipedia.org/wiki/Business%20process%20outsourcing%20in%20China | The business process outsourcing industry in China including IT and other outsourcing services for onshore and export markets surpassed 1 trillion yuan (about $145 billion) in 2016 according to the Ministry of Commerce (MOC).
History
The outsourcing industry grew rapidly in the 2000s in China by beginning from an "embryonic" scale. IDC, an IT industry consultancy, estimated in 2006 that while outsourcing of IT services was growing at 30% annually, the market size was only $586 million at the end of 2005. Most IT services then were offered to domestic companies with offshore clients concentrated in Japan.
By 2016, outsourcing was still growing fast at about 20% annually, driven by "cloud computing, big data, Internet of things and mobile Internet" according to Xinhua.
IT services
IT related services accounted for about half of the US$87 billion in total service outsourcing provided to export markets in 2015.
The largest IT outsourcing companies based in China include ChinaSoft and Pactera. One of the largest China-focused outsourcing companies but based in the US is VXI Global. ChinaSoft is backed by Huawei. Pactera was formed in 2012 by the merger of two industry leaders, VanceInfo and HiSoft. VXI Global was acquired in 2016 by the Carlyle Group, a marquee private equity firm, for around US$1 billion. The deal was seen by Dow Jones as "making a big bet that the future of the outsourcing industry, long associated with India, will be in China."
Painting
Art production is outsourced to China either to mass-produce thousands of paintings or execute original works based on instructions from foreign artists. A center for art outsourcing is Dafen Village in Shenzhen, well known for production of imitations of masterworks, but also home to artists who are commissioned to execute original works. At the high end of the art world, outsourcing to China is practice by Kehinde Wiley, an American portrait painter, who opened a studio in Beijing in 2006. Under Wiley's 4 to 10 |
https://en.wikipedia.org/wiki/Fluorescence%20biomodulation | Fluorescence biomodulation is a form of photobiomodulation, which utilizes fluorescence energy to induce multiple transduction pathways that can modulate biological processes through the activation of photoacceptors found within many different cell and tissue types. According to Magalhães and Yoshimura, photoacceptors are molecules that do not explicitly specialize in light absorption but possess the ability to do so in the presence of light which in turn can enhance their functioning.
To generate fluorescence, specialized light absorbing molecules (chromophores) are employed to translate light energy into a high-energy emission of fluorescence through a mechanism known as stokes shift. Fluorescence biomodulation differs from photobiomodulation in that it employs fluorescence as a photo vehicle to induce biomodulation. Fluorescence, as generated by chromophores, is displayed as a broad spectral distribution of wavelengths and/or frequencies which can be controlled to penetrate tissues to various degrees. Tailoring fluorescence biomodulation allows compatibility between the specific emissions of fluorescence and the unique light absorbing characteristics of different cell and tissue types in the body. Shorter wavelengths (<600 nm) within the visible spectrum cannot penetrate deep into tissue and are localized within the epidermis or dermis. Conversely, longer wavelengths (>600 nm) within the visible spectrum penetrate further up into the hypodermis.
References
Fluorescence techniques |
https://en.wikipedia.org/wiki/Authorized%20Program%20Analysis%20Report | An APAR (Authorized Program Analysis Report) (pronounced A-PAR, rhymes with far) is an IBM designation of a document intended to identify situations that could result in potential problems. It also serves as a request for the correction of a defect in current releases of IBM-supplied programs.
The Process
"Occasionally" IBM software has a bug.
Once it has been ascertained that the situation has not been caused by problems in third-party hardware or software or the user's configuration errors, IBM support staff, if they suspect that a defect in a current release of an IBM program is the cause, will file a formal report confirming the existence of an issue. In addition to confirming the existence of an issue, APARs include information on known workarounds, information on whether a formal fix is scheduled to be included in future releases, and whether or not a Program Temporary Fix (PTF) is planned.
Documenting the problem
IBM has a program to facilitate documenting the problem.
Solution levels
There are at least 2 levels of fix:
The APAR may result in "an APAR fix."
a permanent correction called a PTF. whereas the PTF "is a tested APAR... The PTF 'closes' the APAR." Prior to that, an APAR is "a problem with an IBM program that is formally tracked until a solution is provided.”
A PTF is a permanent correction with respect to the VRM (Version, Release, Modification) level of the product to which it is applicable, and is a temporary fix in the sense that the problem correction will temporarily be available as a permanent fix, and later will be incorporated into the product base code, and will thereby no longer be a fix, although the associated PTF and/or APAR numbers will, as a rule, be included in the source documentation associated with the ensuing base code update.
System Improvement/Difficulty Report
SIDR was Xerox's acronym, covering APAR and PTF.
The acronym referred to: System Improvement / Difficulty Report.
System Improvement Request
SIR (System Impr |
https://en.wikipedia.org/wiki/Flow-induced%20dispersion%20analysis | Flow-induced dispersion analysis (FIDA) is an immobilization-free technology used for characterization and quantification of biomolecular interaction and protein concentration under native conditions. In the FIDA assay, the size of a ligand (indicator) with affinity to the target analyte is measured. When the indicator interacts with the analyte the apparent size increases and this change in size can be used to determine the analyte concentration and interaction. Additionally, the hydrodynamic radius of the analyte-indicator complex is obtained. A FIDA assay is typically completed in minutes and only requires a modest sample consumption of a few µl.
Applications
Quantification of analytes (e.g. proteins, peptides, DNA, nanoparticles) in complex solutions (e.g. plasma and fermentation broth )
Determination of
affinity constants
binding kinetics
molecular size (hydrodynamic radius)
oligomeric state
diffusion coefficient
Principle
The FIDA principle is based on measuring the change in the apparent size (diffusivity) of a selective indicator interacting with the analyte molecule. The apparent indicator size is measured by Taylor dispersion analysis in a capillary under hydrodynamic flow.
References
Protein methods
Analytical chemistry
Protein–protein interaction assays
Biochemistry methods |
https://en.wikipedia.org/wiki/Copying%20network%20models | Copying network models are network generation models that use a copying mechanism to form a network, by repeatedly duplicating and mutating existing nodes of the network. Such a network model has first been proposed in 1999 to explain the network of links between web pages, but since has been used to model biological and citation networks as well.
Origins
In 1999 Jon Kleinberg and 3 co-authors published an article to Computing and combinatorics attempting to construct a network model that explains patterns found in an analysis of the World Wide Web. The intuition behind the model was that when a user decides to build and publish her own web page, she encounters a list of links for her topic of interest on the web and ends up copying this collection, or many such collections to her own web page. This creating a new node in the network - the new page - and copying edges from already existing nodes in some fashion.
They outlined a model very generally, but didn't analyse the predictions of an exact model in detail, mostly due to computational limitations, but suggested that copying nodes randomly is a simple, model worthy mechanism for creating Zipfian distribution networks.
This paper since, has been cited over 1200 times, which is a number comparable to significant papers contributing to network science, like the one describing the Erdős–Rényi model (about 8300) and includes notable network science books like Mark Newman's.
Description
General model
To understand a general model, take a basic network growth model, which is characterized by four stochastic processes. Creation processes and for node- and edge-creation, and deletion processes and for node- and edge-deletion.
Take a discrete time timeframe, where consists of simply at each step, creating a node with probability , and similarly is deleting a node with probability ad(t). Consequently, this also means includes removing all edges that belonged to a node that was removed.
is where the essenc |
https://en.wikipedia.org/wiki/List%20of%20mammals%20that%20perform%20mass%20migrations | Mass migrations take place, or used to take place, by the following mammals:
Africa:
Hartebeest
Springbok
Black wildebeest
Blue wildebeest
Blesbok
Tiang
Burchell's zebra
Quagga (extinct)
Thompson's gazelle
Mongalla gazelle
White-eared kob
Grant's gazelle
Scimitar-horned oryx
Giant eland
North America:
Pronghorn
Mule deer
Bison
Wapiti
Mexican free-tailed bat
North America and Eurasia:
Reindeer/caribou
Eurasia:
Siberian roe deer
Chiru
Kulan
Mongolian gazelle
Saiga
Of these migrations, those of the springbok, black wildebeest, blesbok, scimitar-horned oryx, and kulan have ceased.
References
Lists of mammals
Mammal behavior
Ecology |
https://en.wikipedia.org/wiki/History%20of%20computed%20tomography | The history of X-ray computed tomography dates back to at least 1917 with the mathematical theory of the Radon transform In October 1963, William H. Oldendorf received a U.S. patent for a "radiant energy apparatus for investigating selected areas of interior objects obscured by dense material". The first clinical CT scan was performed in 1971 using a scanner invented by Sir Godfrey Hounsfield.
Mathematical theory
The mathematical theory behind computed tomographic reconstruction dates back to 1917 with the invention of the Radon transform by Austrian mathematician Johann Radon, who showed mathematically that a function could be reconstructed from an infinite set of its projections. In 1937, Polish mathematician Stefan Kaczmarz developed a method to find an approximate solution to a large system of linear algebraic equations. This, along with Allan McLeod Cormack's theoretical and experimental work, laid the foundation for the algebraic reconstruction technique, which was adapted by Godfrey Hounsfield as the image reconstruction mechanism in his first commercial CT scanner.
In 1956, Ronald N. Bracewell used a method similar to the Radon transform to reconstruct a map of solar radiation. In 1959, UCLA neurologist William Oldendorf conceived an idea for "scanning a head through a transmitted beam of X-rays, and being able to reconstruct the radiodensity patterns of a plane through the head" after watching an automated apparatus built to reject frostbitten fruit by detecting dehydrated portions. In 1961, he built a prototype in which an X-ray source and a mechanically coupled detector rotated around the object to be imaged. By reconstructing the image, this instrument could get an X-ray picture of a nail surrounded by a circle of other nails, which made it impossible to X-ray from any single angle. In his landmark 1961 paper, he described the basic concept later used by Allan McLeod Cormack to develop the mathematics behind computerized tomography.
In October 1963, O |
https://en.wikipedia.org/wiki/Infinidat | Infinidat is an Israeli-American data storage company.
History
Infinidat was founded by Moshe Yanai in 2011. By 2015 it was valued at $1.2 billion, and in 2017 it was valued at $1.6 billion. The company has offices in 17 countries and two headquarters: one in Waltham, MA and one in Herzliya, Israel.
InfiniBox
In 2013 the company filed for thirty-nine patents, and later that year released its flagship product, the InfiniBox. Each system initially managed about five petabytes of data.
As of October 2017, the company had shipped about two exabytes worth of storage to its customers. The company uses conventional and flash storage, and has a better than one million IOPS performance and 99.99999 percent reliability. The product is used by large corporations and clients including cloud service providers, telecoms, financial services firms, healthcare providers, and others that require large amounts of data storage.
Funding
In 2015 the company received $150 million in funding during its Series B round led by TPG Growth.
In 2017, the company received $95 million in funding, in a Series C round led by Goldman Sachs. At this stage it had received $325 million in total funding.
References
Software companies established in 2011
Technology companies of Israel
Technology companies of the United States
Software companies based in Massachusetts
Computer storage companies
Software companies of the United States
2011 establishments in the United States
2011 establishments in Massachusetts
Companies established in 2011 |
https://en.wikipedia.org/wiki/Engineering%20Critical%20Assessment | Engineering Critical Assessment (ECA) is a procedure by which the safety of a welded structure with defects or flaws can be determined. ECAs utilize the material properties and expected stress history to determine a flaw acceptance criteria which will ensure that welds will not fail during the construction or service life of the welded structure. The assessment can be used before the structure is in use, or during in-service inspection, to determine whether a given weld is in need of repair. ECAs are used throughout the energy, manufacturing, and infrastructure industries. ECAs are based heavily upon fracture mechanics principles, and reflect an improvement over traditional methods of weld quality assurance, which can be arbitrary or overly conservative.
Background
During welding, defects or flaws can develop. In some cases, these flaws could potentially affect the integrity of the weld, resulting in failure by fatigue, creep, brittle fracture, or yielding. Therefore, codes to determine weld quality must be developed. Traditionally, welding codes have been based on workmanship criteria. These criteria are determined empirically, typically by estimating the level of weld quality expected from a skilled welder. While these criteria have been reliable historically, improvements made in welding technology and materials science are not taken into account. As a result, over time, workmanship criteria have become increasingly conservative. This conservatism results in unnecessary repairs, which can increase construction costs and can yield undesirable residual stresses at the location of the repair weld.
Beginning in the late 1970s to early 1980s, engineering critical assessments began to emerge as an alternative to traditional workmanship criteria. These ECAs relied heavily on recent developments in the field of fracture mechanics. Where workmanship criteria were developed with a limited understanding of material characteristics, and considered only the le |
https://en.wikipedia.org/wiki/Natural%20disturbance%20regime%20of%20the%20Sagebrush%20Sea%20of%20the%20Great%20Basin | The Sagebrush Sea, also called the sagebrush steppe, is an ecosystem of the Great Basin that is primarily centered on the 27 species of sagebrush that grow from sea level to about 12,000 feet. This ecosystem is home to hundreds of species of both fauna and flora. It includes small mammals such as pygmy rabbits, reptiles such as the sagebrush lizard, birds such as the golden eagles, and countless other species that are solely found in this ecosystem. This ecosystem at one point occupied over 62 million hectares in the western United States and southwestern Canada. It currently only occupies about 56 percent of historic range and is continuing to decline due to several factors.
Location
Sagebrush steppe ecosystems occur in Nevada and parts of Utah, Oregon, Idaho, and California. Its western edge is defined by the Sierra Nevada and the Cascade Range, and its eastern edge is the Wasatch Mountains. The northern boundary is the Snake river, and its southern boundary is defined by the Mojave dessert in California.
Threats
Some sagebrush ecosystems rely on recurrent fire. Due to the disruption of the fire cycle, several species have encroached on sagebrush. These species that threaten the sagebrush are:
Conifer woodlands
Conifer woodlands consist of two main species: Juniperus or Junipers and Pinus or Pinyon. These conifers are able to establish and increase in density to the point where sagebrush are outcompeted because they cannot get adequate sunlight and nutrients from the soil. This decline in sagebrush has fragmented sagebrush habitats and caused a disruption in the fauna (e.g., sage grouse). Predation may increase in fragment habitats due to lack of cover for the prey.
Exotic annual grasses
Several exotic grasses have come into these sagebrush ecosystem and have been labeled noxious weeds which is determined by the agricultural authority. The two main annual grasses that are causes much of the problems are: Bromus tectorum or cheatgrass and Agropyron cristat |
https://en.wikipedia.org/wiki/Multispecies%20coalescent%20process | Multispecies Coalescent Process is a stochastic process model that describes the genealogical relationships for a sample of DNA sequences taken from several species. It represents the application of coalescent theory to the case of multiple species. The multispecies coalescent results in cases where the relationships among species for an individual gene (the gene tree) can differ from the broader history of the species (the species tree). It has important implications for the theory and practice of phylogenetics and for understanding genome evolution.
A gene tree is a binary graph that describes the evolutionary relationships between a sample of sequences for a non-recombining locus. A species tree describes the evolutionary relationships between a set of species, assuming tree-like evolution. However, several processes can lead to discordance between gene trees and species trees. The Multispecies Coalescent model provides a framework for inferring species phylogenies while accounting for ancestral polymorphism and gene tree-species tree conflict. The process is also called the Censored Coalescent.
Besides species tree estimation, the multispecies coalescent model also provides a framework for using genomic data to address a number of biological problems, such as estimation of species divergence times, population sizes of ancestral species, species delimitation, and inference of cross-species gene flow.
Gene tree-species tree congruence
If we consider a rooted three-taxon tree, the simplest non-trivial phylogenetic tree, there are three different tree topologies but four possible gene trees. The existence of four distinct gene trees despite the smaller number of topologies reflects the fact that there are topologically identical gene tree that differ in their coalescent times. In the type 1 tree the alleles in species A and B coalesce after the speciation event that separated the A-B lineage from the C lineage. In the type 2 tree the alleles in species A and B |
https://en.wikipedia.org/wiki/Graph%20polynomial | In mathematics, a graph polynomial is a graph invariant whose values are polynomials. Invariants of this type are studied in algebraic graph theory.
Important graph polynomials include:
The characteristic polynomial, based on the graph's adjacency matrix.
The chromatic polynomial, a polynomial whose values at integer arguments give the number of colorings of the graph with that many colors.
The dichromatic polynomial, a 2-variable generalization of the chromatic polynomial
The flow polynomial, a polynomial whose values at integer arguments give the number of nowhere-zero flows with integer flow amounts modulo the argument.
The (inverse of the) Ihara zeta function, defined as a product of binomial terms corresponding to certain closed walks in a graph.
The Martin polynomial, used by Pierre Martin to study Euler tours
The matching polynomials, several different polynomials defined as the generating function of the matchings of a graph.
The reliability polynomial, a polynomial that describes the probability of remaining connected after independent edge failures
The Tutte polynomial, a polynomial in two variables that can be defined (after a small change of variables) as the generating function of the numbers of connected components of induced subgraphs of the given graph, parameterized by the number of vertices in the subgraph.
See also
Knot polynomial
References
Polynomials
Graph invariants |
https://en.wikipedia.org/wiki/Bailey%20peptide%20synthesis | The Bailey peptide synthesis is a name reaction in organic chemistry developed 1949 by J. L. Bailey. It is a method for the synthesis of a peptide from α-amino acid-N-carboxylic acid anhydrides (NCAs) and amino acids or peptide esters. The reaction is characterized by short reaction times and a high yield of the target peptide.
The reaction can be carried out at low temperatures in organic solvents. The residues R1 and R2 can be organic groups or hydrogen atoms, R3 is the used amino acid or peptide ester:
Reaction mechanism
The reaction mechanism is not known in detail. Supposedly, the reaction begins with a nucleophilic attack of the amino group on the carbonyl carbon of the anhydride group of the N-carboxylic acid anhydride (1). After an intramolecular proton migration, a 1,4-proton shift and the cleavage of carbon dioxide follows, resulting in the peptide bond in the final product (2):
Atom economy
The advantage in atom economy of using NCAs for peptide formation is that there is no need for a protecting group on the functional group reacted with the amino acid. For example, the Merrifield synthesis depends on the use of Boc and Bzl protecting groups, which need be removed after the reaction. In the case of Bailey peptide synthesis, the free peptide is directly obtained after the reaction. However, unwanted and difficult to remove by-products may be formed. An N-substitution of the NCA (for example, by an o-nitrophenylsulfenyl group) can simplify the subsequent purification process, but on the other hand deteriorates the atom economy of the reaction. The synthesis of NCAs can be carried out by the Leuchs reaction or by the reaction of N-(benzyloxycarbonyl)-amino acids with oxalyl chloride. In the latter case, again the procedure is less efficient in the sense of atom economy.
Synthesized peptides
The following peptides were synthesized using this method by 1949:
DL-Ala-Gly
L-Tyr-Gly
DL-Tyr-Tyr
DL-Ala-DL-Ala-Gly
DL-di-Ala-L-cystinyl-di-Gly
DL-Ala-L- |
https://en.wikipedia.org/wiki/The%20Ken | The Ken is an Indian business news website based out of Bangalore, India. It was launched in 2016 as a premium subscriber-only platform that publishes one article per day. Its founders include Rohin Dharmakumar, Seema Singh, Sumanth Raghavendra and Ashish Mishra. PayTM founder Vijay Shekhar Sharma is an investor.
As of September 2021, it had over 30,000 individual subscribers and over 150 corporate subscribers.
History and Funding
The Ken was launched by Rohin Dharmakumar, Seema Singh, Sumanth Raghavendra and Ashish Mishra in 2016 as a premium subscriber only platform.
Till 2018, the website raised and in 2018, it raised from several investors including the Omidyar Network. It later said it had raised a further $1.9 million between the two rounds. In August 2023, it closed a ₹16 crore ($2 million) Series B round of funding from two new investors, Rainmatter Capital and Baskar Subramanian, in a mixed round consisting of primary and secondary investments by both.
Controversies and lawsuits
From 2019 to 2022, The Ken and another business news website, The Morning Context, were involved in lawsuits against one another. In 2019, Ashish Mishra left The Ken and started a rival online publication called The Morning Context. The Ken then filed a lawsuit against Mishra alleging unauthorised use of confidential information which it alleged was used to "set up and operate" The Morning Context . Following this The Morning Context filed a defamation suit against The Ken alleging “false, derogatory & slanderous public statements amounting to defamation”. The Ken responded to the notice by "categorically rejecting" the claims made in it. Later, The Ken withdrew its lawsuit against The Morning Context, Ashish Mishra and others on 24 May 2022.
Content
The Ken publishes articles that focus on Indian business, healthcare and other similar topics. In 2019, The Ken expanded to Southeast Asia by launching a Southeast Asia Edition which is also run as subscriber-only platform th |
https://en.wikipedia.org/wiki/NOYB | NOYB – European Center for Digital Rights (styled as "noyb", from "none of your business") is a non-profit organization based in Vienna, Austria established in 2017 with a pan-European focus. Co-founded by Austrian lawyer and privacy activist Max Schrems, NOYB aims to launch strategic court cases and media initiatives in support of the General Data Protection Regulation (GDPR), the proposed ePrivacy Regulation, and information privacy in general. The organisation was established after a funding period during which it has raised annual donations of €250,000 by supporting members. Currently, NOYB is financed by more than 4,400 supporting members.
While many privacy organisations focus attention on governments, NOYB puts its focus on privacy issues and privacy violations in the private sector. Under Article 80, the GDPR foresees that non-profit organizations can take action or represent users. NOYB is also recognized as a "qualified entity" to bring consumer class actions in Belgium.
Notable actions
EU–US data transfers/"Schrems I" (2016)
The Irish Data Protection Commission (DPC) filed a lawsuit against Schrems and Facebook in 2016, based on a complaint from 2013, which had led to the so-called "Safe Harbor Decision". Back then, the Court of Justice of the European Union (CJEU) had invalidated the Safe Harbor data transfer system with its decision. When the case was referred back to the DPC the Irish regulator found that Facebook had in fact relied on Standard Contact Clauses, not on the invalidated Safe Harbor. The DPC then found that there were "well-founded" concerns by Schrems under these instruments too, but instead of taking action against Facebook, initiated proceedings against Facebook and Schrems before the Irish High Court. The case was ultimately referred to the CJEU in C-311/18 (called "Schrems II"; see Max Schrems#Schrems II). NOYB supported this private case of Schrems.
"Forced consent" complaints (2018)
Within hours after General Data Protection |
https://en.wikipedia.org/wiki/Mars%20Organic%20Molecule%20Analyser | The Mars Organic Molecule Analyser (MOMA) is a mass spectrometer-based instrument on board the Rosalind Franklin rover to be launched in 2028 to Mars on an astrobiology mission. It will search for organic compounds (carbon-containing molecules) in the collected soil samples. By characterizing the molecular structures of detected organics, MOMA can provide insights into potential molecular biosignatures. MOMA will be able to detect organic molecules at concentrations as low as 10 parts-per-billion by weight (ppbw). MOMA examines solid crushed samples exclusively; it does not perform atmospheric analyses.
The Principal Investigator is Fred Goesmann, from the Max Planck Institute for Solar System Research in Germany.
Overview
The goal of MOMA is to seek signs of past life on Mars (biosignatures) by analysing a wide range of organic compounds that may be found in drilled samples acquired from 2 meters below the Martian surface by the Rosalind Franklin rover. MOMA examines solid crushed samples only; it does not perform atmospheric analyses.
MOMA will first volatilize solid organic compounds so that they can be analysed by a mass spectrometer; this volatilisation of organic material is achieved by two different techniques: laser desorption and thermal volatilisation, followed by separation using four GC-MS columns. The identification of the organic molecules is then performed with an ion trap mass spectrometer.
Organic biosignatures
While there is no unambiguous Martian biosignature to look for, a pragmatic approach is to look out for certain molecules such as lipids and phospholipids that may be forming cell membranes which can be preserved over geological timescales. Lipids and other organic molecules may exhibit biogenic features that are not present in abiogenic organic material. If biogenic (synthesized by a life form), such compounds may be found at high concentrations only over a narrow range of molecular weights, unlike in carbonaceous meteorites where th |
https://en.wikipedia.org/wiki/Microbivory | Microbivory (adj. microbivorous, microbivore) is a feeding behavior consisting of eating microbes (especially bacteria) practiced by animals of the mesofauna, microfauna and meiofauna.
Microbivorous animals include some soil nematodes, springtails or flies such as Drosophila sharpi. A well known example of microbivorous nematodes is the model roundworm Caenorhabditis elegans which is maintained in culture in labs on agar plates, fed with the 'OP50' Escherichia coli strain of bacteria.
In food webs of ecosystems, microbivores can be distinguished from detritivores, generally thought playing the roles of decomposers, as they don't consume decaying dead matter but only living microorganisms.
Use of term in robotics
There is also use of the term 'microbivore' to qualify the concept of robots autonomously finding their energy in the production of bacteria. Robert Freitas has also proposed microbivore robots that would attack pathogens in the manner of white blood cells.
See also
Bacterivore
References
External links
Biological interactions
Animals by eating behaviors
Ethology
Eating behaviors
Microorganisms |
https://en.wikipedia.org/wiki/European%20Data%20Protection%20Board | The European Data Protection Board (EDPB) is a European Union independent body with juridical personality whose purpose is to ensure consistent application of the General Data Protection Regulation (GDPR) and to promote cooperation among the EU’s data protection authorities. On 25 May 2018, the EDPB replaced the Article 29 Working Party.
Tasks
The EDPB remit includes issuing guidelines and recommendations, identifying best practices related to the interpretation and application of the GDPR, advising the European Commission on matters related to the protection of personal data in the European Economic Area (EEA), and adopting opinions to ensure the consistency of application of the GDPR by the national supervisory authorities, in particular on decisions having cross-border effects. Additionally, the EDPB is tasked with acting as a dispute resolution body in case of dispute between the national authorities cooperating on enforcement in the context of cross-border cases, encouraging the development of codes of conduct and establishing certification mechanisms in the field of data protection, and promoting cooperation and effective exchange of information and good practices among national supervisory authorities.
Chairmanship
The European Data Protection Board is represented by its Chair who is elected from the members of the Board by simple majority for a five-year term, renewable once. The same election procedure and term of office apply to the two deputy chairs.
Currently, the Chairmanship of the Board is held by:
Andrea Jelinek, Chair,
Ventsislav Karadjov, Deputy Chair
Aleid Wolfsen, Deputy Chair
Members
The Board is composed of representatives of the 27 EU and 3 EEA EFTA national data protection authorities and the European Data Protection Supervisor (EDPS).
External links
EDPB official website
European Commission website on the EDPB
European Union official website, EDPB
References
European Union law
Information privacy |
https://en.wikipedia.org/wiki/National%20Prize%20for%20Natural%20Sciences%20%28Chile%29 | The National Prize for Natural Sciences () was created in 1992 as one of the replacements for the National Prize for Sciences under Law 19169. The other two prizes in this same area are for Exact Sciences and Applied Sciences and Technologies.
It is part of the National Prize of Chile.
Winners
1992, Jorge Allende (biochemistry)
1994, Humberto Maturana (neurobiology)
1996, (hydrobiology)
1998, Juan Antonio Garbarino Bacigalupo (chemistry)
2000, (biophysics)
2002, Ramón Latorre (biophysics)
2004, Pedro Labarca Prado (biophysics)
2006, Cecilia Hidalgo Tapia (biochemistry)
2008, (neurobiology)
2010, Mary Kalin Arroyo (botany)
2012, (marine biology)
2014, Ligia Gargallo (chemistry)
2016, Francisco Rothhammer Engel (genetics)
2018, (ecology)
See also
List of biology awards
List of earth sciences awards
List of chemistry awards
List of medicine awards
List of neuroscience awards
List of psychology awards
CONICYT
References
1992 establishments in Chile
Awards established in 1992
Chilean science and technology awards
Earth sciences awards
Chemistry awards
Biology awards
Medicine awards
Neuroscience awards
Cognitive science awards
1992 in Chilean law |
https://en.wikipedia.org/wiki/Goldmont%20Plus | Goldmont Plus is a microarchitecture for low-power Atom, Celeron and Pentium Silver branded processors used in systems on a chip (SoCs) made by Intel. The Gemini Lake platform with 14 nm Goldmont Plus core was officially launched on December 11, 2017. Intel launched the Gemini Lake Refresh platform on November 4, 2019.
Design
Goldmont Plus is an enhanced 2nd generation out-of-order low-power Atom microarchitecture designed for entry level desktop and notebook computers. Goldmont Plus is built on the 14 nm manufacturing process and supports up to four cores for the consumer devices. It includes the Intel Gen9 graphics architecture with improvements introduced with the Kaby Lake microarchitecture.
The Goldmont Plus microarchitecture builds on the success of the Goldmont microarchitecture, and provides the following enhancements:
Widened previous generation Atom processor back-end pipeline to 4-wide allocation to 4-wide retire, while maintaining 3-wide fetch and decode pipeline.
Enhanced branch prediction unit.
64 KB shared second level pre-decode cache (16 KB in Goldmont microarchitecture).
Larger reservation station and re-order buffer entries to support large out-of-order window.
Wider integer execution unit. New dedicated JEU port with support for faster branch redirection.
Radix-1024 floating point divider for fast scalar/packed single, double and extended precision floating point divides.
Improved AES-NI instruction latency and throughput.
Larger load and store buffers. Improved store-to-load forwarding latency store data from register.
Shared instruction and data second level TLB. Paging cache enhancements (PxE/ePxE caches).
Modular system design with four cores sharing up to 4 MB L2 cache.
Support for Read Processor ID (RDPID) new instruction.
Technology
A 14 nm manufacturing process
System on a chip architecture
3D tri-gate transistors
Consumer chips up to four cores
Supports SSE4.2 instruction set
Supports Intel AESNI and PCLMUL inst |
https://en.wikipedia.org/wiki/Q%20Sharp | Q# (pronounced as Q sharp) is a domain-specific programming language used for expressing quantum algorithms. It was initially released to the public by Microsoft as part of the Quantum Development Kit.
History
Historically, Microsoft Research had two teams interested in quantum computing, the QuArC team based in Redmond, directed by Krysta Svore, that explored the construction of quantum circuitry, and Station Q initially located in Santa Barbara and directed by Michael Freedman, that explored topological quantum computing.
During a Microsoft Ignite Keynote on September 26, 2017, Microsoft announced that they were going to release a new programming language geared specifically towards quantum computers. On December 11, 2017, Microsoft released Q# as a part of the Quantum Development Kit.
At Build 2019, Microsoft announced that it would be open-sourcing the Quantum Development Kit, including its Q# compilers and simulators.
Bettina Heim currently leads the Q# language development effort.
Usage
Q# is available as a separately downloaded extension for Visual Studio, but it can also be run as an independent tool from the Command line or Visual Studio Code. The Quantum Development Kit ships with a quantum simulator which is capable of running Q#.
In order to invoke the quantum simulator, another .NET programming language, usually C#, is used, which provides the (classical) input data for the simulator and reads the (classical) output data from the simulator.
Features
A primary feature of Q# is the ability to create and use qubits for algorithms. As a consequence, some of the most prominent features of Q# are the ability to entangle and introduce superpositioning to qubits via Controlled NOT gates and Hadamard gates, respectively, as well as Toffoli Gates, Pauli X, Y, Z Gate, and many more which are used for a variety of operations; see the list at the article on quantum logic gates.
The hardware stack that will eventually come together with Q# is expected to imp |
https://en.wikipedia.org/wiki/Elisha%20Pazner | Elisha Aryeh Pazner (April 16, 1941 – March 28, 1979) was an Israeli economic- and game theorist with important contributions in the theory of welfare economics and fair division.
He was a member of the Department of Economics at Tel-Aviv University from 1971 until his death. During this time he spent over two years as a visiting professor at Northwestern University.
He received his B.A., Economics from the Hebrew University of Jerusalem (1966), and his M.A. and PhD from Harvard University (1969 and 1971 respectively). His Dissertation, "Optimal Resource Allocation and Distribution: The Role of the Public Sector", was under the direction of Richard Musgrave and Stephen Marglin.
References
1941 births
1979 deaths
Game theorists
Hebrew University of Jerusalem Faculty of Social Sciences alumni
Academic staff of Tel Aviv University
Harvard University alumni |
https://en.wikipedia.org/wiki/Comparison%20of%20MQTT%20implementations | MQTT is an ISO standard (ISO/IEC PRF 20922) publish–subscribe-based messaging protocol. It works on top of the Internet protocol suite TCP/IP. It is designed for connections with remote locations where a "small code footprint" is required or the network bandwidth is limited. The publish-subscribe messaging pattern requires a message broker.
All comparison categories use the stable version of each implementation listed in the overview section. The comparison is limited to features that relate to the MQTT protocol.
Overview
The following table lists MQTT both libraries and implementations, along with general information about each.
A more complete list of MQTT implementations can be found on GitHub.
Protocol support
There are several versions of the MQTT protocol currently standardized. Below is a list containing the more recent versions of the MQTT protocol, with the organization that standardized them.
MQTT-SN v1.2, standardized by IBM.
MQTT v3.1, standardized by Eurotech and IBM.
MQTT v3.1.1, standardized by OASIS.
MQTT v5.0, standardized by OASIS.
The following table lists the versions of MQTT that each implementation supports, and also lists their support for SSL/TLS and TCP. The security provided by SSL/TLS may be desirable depending on the type traffic being sent between devices, as MQTT transmits messages in the clear.
Quality of service levels offered
From the MQTT page, quality of service (QoS) is described as,Quality of service refers to traffic prioritization and resource reservation control mechanisms rather than the achieved service quality. Quality of service is the ability to provide different priority to different applications, users, or data flows, or to guarantee a certain level of performance to a data flow.A description of each QoS level is found below.
At most once delivery (fire and forget)
At least once delivery (acknowledged delivery)
Exactly once delivery (assured delivery)
The following table lists each implementation's s |
https://en.wikipedia.org/wiki/Barbara%20Paulson | Barbara Jean Paulson (née Lewis; April 11, 1928 – February 26, 2023) was an American human computer at NASA's Jet Propulsion Laboratory (JPL) and one of the first female scientists employed there. Paulson began working as a mathematician at JPL in 1948, where she calculated rocket trajectories by hand. She is among the women who made early progress at JPL.
Early life
Barbara Jean Lewis was born in Columbus, Ohio on April 11, 1928. She was raised with three siblings
(two older sisters and one younger brother), and when she was 12 years old her father died. Beginning in 9th grade, Paulson took four years of Latin and math while her sisters took short hand as Paulson did not want to be a secretary. After attending Ohio State University for one year, Paulson's sister, who was already working in Pasadena at the time, convinced her mother to move to Pasadena as well. In 1947 the family moved to Pasadena, California, where her career at JPL would begin.
In 1959 Barbara married Harry Murray Paulson in Pasadena where they lived until 1962 before moving to Monrovia. In 1975 they finally settled in Glendora.
Career
Paulson joined the Jet Propulsion Laboratory in 1948 as a computer, calculating rocket paths and working on the MGM-5 Corporal, the first guided missile designed by the United States to carry a nuclear warhead. Paulson and her colleagues were at one point invited to sign their names on the 100th Corporal rocket prior to its transport to the White Sands test range. The rocket exploded shortly after liftoff. On January 31, 1958., Paulson was assigned to the operations center for Explorer-1, the first satellite of the United States, launched during the Space Race with the Soviet Union. Paulson did the work with minimal equipment: a mechanical pencil, light table, and graph paper. The multi-stage launch that Paulson aided in calculations for allowed the Corporal could carry a warhead over 200 miles.
In 1960, when Paulson was 32 years old, her husband Harry were e |
https://en.wikipedia.org/wiki/Proof%20of%20authority | Proof of authority (PoA) is an algorithm used with blockchains that delivers comparatively fast transactions through a consensus mechanism based on identity as a stake. The most notable platforms using PoA are VeChain, Bitgert, Palm Network and Xodex.
Proof-of-authority
In PoA-based networks, transactions and blocks are validated by approved accounts, known as validators. Validators run software allowing them to put transactions in blocks. The process is automated and does not require validators to be constantly monitoring their computers. It, however, does require maintaining the computer (the authority node) uncompromised. The term was coined by Gavin Wood, co-founder of Ethereum and Parity Technologies.
With PoA, individuals earn the right to become validators, so there is an incentive to retain the position that they have gained. By attaching a reputation to identity, validators are incentivized to uphold the transaction process, as they do not wish to have their identities attached to a negative reputation. This is considered more robust than PoS (proof-of-stake) - PoS, while a stake between two parties may be even, it does not take into account each party’s total holdings. This means that incentives can be unbalanced.
On the other hand, PoA only allows non-consecutive block approval from any one validator, meaning that the risk of serious damage is centralized to the authority node.
PoA is suited for both private networks and public networks, like POA Network or Eurus, where trust is distributed.
References
Algorithms
Blockchains |
https://en.wikipedia.org/wiki/Predecessor%20problem | In computer science, the predecessor problem involves maintaining a set of items to, given an element, efficiently query which element precedes or succeeds that element in an order. Data structures used to solve the problem include balanced binary search trees, van Emde Boas trees, and fusion trees. In the static predecessor problem, the set of elements does not change, but in the dynamic predecessor problem, insertions into and deletions from the set are allowed.
The predecessor problem is a simple case of the nearest neighbor problem, and data structures that solve it have applications in problems like integer sorting.
Definition
The problem consists of maintaining a set , which contains a subset of integers. Each of these integers can be stored with a word size of , implying that . Data structures that solve the problem support these operations:
predecessor(x), which returns the largest element in less than or equal to
successor(x), which returns the smallest element in greater than or equal to
In addition, data structures which solve the dynamic version of the problem also support these operations:
insert(x), which adds to the set
delete(x), which removes from the set
The problem is typically analyzed in a transdichotomous model of computation such as word RAM.
Data structures
One simple solution to this problem is to use a balanced binary search tree, which achieves (in Big O notation) a running time of for predecessor queries. The Van Emde Boas tree achieves a query time of , but requires space. Dan Willard proposed an improvement on this space usage with the x-fast trie, which requires space and the same query time, and the more complicated y-fast trie, which only requires space. Fusion trees, introduced by Michael Fredman and Willard, achieve query time and for predecessor queries for the static problem. The dynamic problem has been solved using exponential trees with query time, and with expected time using hashing.
Mathemati |
https://en.wikipedia.org/wiki/Jyoti%20Prakash%20Tamang | Jyoti Prakash Tamang (born 16 November 1961) is an Indian food microbiologist, working on fermented foods and alcoholic beverages of the Himalayan regions of India, Nepal and Bhutan and South East Asia for last 36 years and the Senior Professor in Microbiology of the Sikkim Central University. Known for his studies on fermented food, Prof. Tamang is an elected fellow of the Indian National Science Academy (FNA), National Academy of Science, India (NASI),National Academy of Agricultural Sciences, Indian Academy of Microbiological Sciences and the Biotech Research Society of India. The Department of Biotechnology of the Government of India awarded him the National Bioscience Award for Career Development, one of the highest Indian science awards, for his contributions to biosciences in 2004, and International Centre for Integrated Mountain Development (ICIMOD)-Mountain Chair (2019-2022). Prof. Tamang was nominated as Global Kimchi Ambassador by World Institute of Kimchi of Government of South Korea.
Biography
Jyoti Prakash Tamang was born on 16 November 1961 in the mountain district of Darjeeling in the Indian state of West Bengal. He completed his schooling at Turnbull High School, Darjeeling in 1977 and class XII at the St Joseph's College, Darjeeling in 1979. His undergraduate education was at the Darjeeling Government College of North Bengal University from where he passed B.Sc. honors in 1982 and continued at the institution to earn an M.Sc. in microbiology in 1984, passing the examination winning a gold medal for academic excellence. He started his career in 1986 as an associate professor at the department of botany of Sikkim Government College, Tadong where he worked until 2011. Simultaneously, he enrolled at North Bengal University for his doctoral studies and after securing a PhD in microbiology in 1992, he did his post-doctoral work at two institutions abroad during 1994–95; first at the National Food Research Institute, Tsukuba with a fellowship from the U |
https://en.wikipedia.org/wiki/Kafbikh | Kafbikh (Persian: کفبیخ)is a kind of traditional Iranian sweet is made in Khorasan, specially in the city of Gonabad and Birjand. This is made for Yalda, the Iranian celebration of winter solstice.
Preparation
The sweet Kaf is based on the root of Acanthophyllum squarrosum the root should be cleaned and boiled at least three times and the boiled water be discarded until the water has a good smell and good taste.
During this ceremony, the root of the plant called "Chubak", or Bikh which is known as Acanthophyllum , is soaked in water and after several boils, they are shed in a large pot called "Tegar". Families and men, with a handful of thin pods of pomegranate trees, called the "batches" shake of the liquid, for hours, to become rigid, and this should be done in a cool environment so that the liquid is foamed and then hardened to dry. Like Isfahan Gaz
The prepared Kaf shuld sweetened at the end by mixing the juice or sugar or honey , and after being decorated, the walnut and pistachio are taken to the guests. at the beginning before sweetening the kaf , a youngs are allowed to throwing it to each other and rubbing the kaf to face of each other adding happiness to the guests.
Another custom performed in certain parts of Iran and khorasan on the night of yalda (Chelleh) involves young engaged couples. The men send an edible arrangement containing seven kinds of fruits and a variety of gifts to their fiancees on this night. In some areas, the girl and her family return the favor by sending gifts back for the young man.
Gallery
See also
Nowruz
yalda
Gonabad
zibad
Jesuite
Konditorei
Kuo Yuan Ye Museum of Cake and Pastry
List of baked goods
List of desserts
List of food preparation utensils
List of pastries
Mold (cooking implement)
Pan dulce (sweet bread)
References
Parssea magazine what is Kaf? Gonabadis traditional festivals by Dr Mohammad Ajam Gonapa magazine December 2016
KafBikh in khorasan for Yalda
South Khorasan traditions.Kaf
KafBikh i |
https://en.wikipedia.org/wiki/1in6 | 1in6 is an American nonprofit organization that provides support and information to male survivors of sexual abuse and assault, as well as their loved ones and service providers.
In January 2007, 1in6 was founded by a group of individuals including Steve LePore, Jim Hopper, Greg LeMond, and David Lisak. In December 2018, the Board of Directors of 1in6 announced that longtime nonprofit leader Matthew Ennis would succeed founder Steve LePore as the organization's President & Chief Executive Officer following LePore's retirement.
The organization partners with RAINN to provide a free and anonymous 24/7 helpline, as well as confidential weekly online support groups for male survivors. In 2016, nearly 400,000 people visited the 1in6 website. The Bristlecone Project, created by Lisak, is 1in6’s multimedia awareness campaign that features portraits and stories of a community of male survivors.
Based in Los Angeles, the organization conducts trainings for professionals, organizations, and military branches around the world, including the US Navy, US Army, US Air Force, and the US Marine Corps. 1in6 also provides technical support for various organizations including RAINN, Pennsylvania Coalition Against Rape, ECPAT International, National Sexual Violence Resource Center, Your Safe Haven, Centre County Women’s Resource Center, Men Can Stop Rape, Victim Services Incorporated, Family Services of Blair County, and all branches of the United States Military at bases around the world.
NO MORE Celebrity PSA Campaign - Male Survivors
In 2016, 1in6 partnered with Viacom, NO MORE, and The Joyful Heart Foundation (founded by Mariska Hargitay) to produce public service announcements featuring celebrities and highlighting the prevalence of sexual trauma among males. On March 2, 2016, the broadcast PSAs debuted on Viacom’s networks and in Times Square, during which the PSAs were visible to approximately 21 million people.
References
External links
Official website
The Bristlecone |
https://en.wikipedia.org/wiki/Roposo | Roposo is an Indian video-sharing social media service, owned by Glance, a subsidiary of InMobi. Roposo provides a space where users can share posts related to different topics like food, comedy, music, poetry, fashion and travel. It is a platform where people express visually with homemade videos and photos. The app offers a TV-like browsing experience with user-generated content on its channels. Users can also use editing tools on the platform and upload their content.
History
Established in July 2014, under the aegis of Relevant E-solutions Pvt. Ltd., Roposo is the brainchild of three IIT Delhi alumni – Mayank Bhangadia, Avinash Saxena and Kaushal Shubhank.
In November 2019, Roposo was acquired by InMobi's Glance Digital Experience Pvt. Ltd.(the mobile content platform and part of the InMobi Group). When the Chinese-owned video-sharing app Tiktok was banned on 30 June 2020, the app saw a huge spike in users with several TikTok users registering on Roposo.
Technology
The open platform has some features such as a TV-like browsing, different channels, a chat feature that lets buyers and sellers converse directly through the platform, and creation tools such as an option to add voice-over, music and GIF stickers for videos and photos.
References
External links
Official website
Social networking services
Indian entertainment websites
Privately held companies of India
2014 establishments in Karnataka
Mobile applications
2019 mergers and acquisitions |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.