source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Bug%20algorithm | Bug algorithm is a class of algorithm that helps robots deal with motion planning.
Basic assumptions
The robot is treated as a point inside a 2D world.
The obstacles (if any) are unknown and nonconvex.
There are clearly defined starting point and goal.
The robot is able to detect obstacle boundary from a distance of known length.
The robot always knows the direction and how far (in terms of Euclidean distance) it is from the goal.
Algorithm
The most basic form of Bug algorithm (Bug 1) is as follows:
The robot moves towards the goal until an obstacle is encountered.
Follow a canonical direction (clockwise) until the robot reaches the location of initial encounter with the obstacle (in short, walking around the obstacle).
The robot then follows the obstacle's boundary to reach the point on the boundary that is closest to the goal.
Go back to step 1. Repeat this until the goal is reached.
See also
Pathfinding
Motion planning
References
Robot kinematics |
https://en.wikipedia.org/wiki/Audiovisual%20Institute%20of%20Monaco | Audiovisual Institute of Monaco () is a Monegasque organization aimed to list, gather, restore, conserve, protect, share and promote audiovisual archives. The Institute proposes to show how the Principality of Monaco is represented in cinema, and to give a better cross reading of history. Audiovisual Institute of Monaco aims to raise public awareness about the need to use and conserve film as an historic, cultural and educational resource. The director of the Audiovisual Institute of Monaco is Vatrican Vincent.
History
Audiovisual Institute of Monaco was founded in 1997 as the Association of the Audiovisual Archives of the Principality of Monaco, and renamed to its current name in August 2018. In September 2020 the Institute opened to the public of Monaco nearly two years after its move to Boulevard du Jardin Exotique. The new building of the Audiovisual Institute was inaugurated by Prince Albert and Princess Caroline.
In 2020, during the period of quarantine the Audiovisual Institute of Monaco made available some snapshots shot in 1950s and 1960s.
The Audiovisual Institute of Monaco joined forces with the National Audiovisual Institute (INA) of France to expand access to its audiovisual archives via the INA mediapro platform. Almost 4,200 subjects broadcast on the “Monaco Info” channel between 1995 and 1997 are now accessible on the platform.
External links
Official webpage
References
1997 establishments in Europe
Film archives in Europe
Sound archives
Culture of Monaco
Cultural organisations based in Monaco
Cinema of Monaco |
https://en.wikipedia.org/wiki/Semrush | Semrush Holdings, Inc. is an American public company that offers a SaaS platform known as Semrush. The platform is often used for keyword research, competitive analysis, site audits, backlink tracking, and comprehensive online visibility insights. Its keyword research tool provides various data points on each keyword including, metrics such as search volume, search intent, keyword difficulty, and cost per click (CPC). The platform also collects information about online keywords gathered from Google and Bing search engines. It was released by Boston-based company Semrush Inc, founded by Oleg Shchegolev and Dmitri Melnikov.
As of 2022, the company has 1000+ employees and offices in Barcelona, Belgrade, Berlin, Yerevan, Limassol, Prague, Warsaw, Amsterdam, Austin, Boston, Dallas, Philadelphia, and Trevose. It went public in March 2021 and trades on .
History
Oleg Shchegolev and Dmitri Melnikov started out as SEO enthusiasts, interested in industry developments and new technologies, and wanted to create a tool to identify market trends and industry best practices.
The software was released as Seodigger before becoming an extension of Firefox, then renamed SeoQuake Company in 2007, before landing on SEMrush. In 2016, the software broke the one million user mark with customers in more than 100 countries.
In April 2018, the company received $40 million in funding as part of a financing transaction co-led by venture capital firms Greycroft, E.ventures and Siguler Guff, in preparation for its expansion into various platforms of research, including those owned by Amazon, Microsoft, and Baidu.
In December 2020, the company rebranded with a new visual identity, updating its name from "SEMrush" to "Semrush".
In March 2021, Semrush had an initial public offering and went public on NYSE under the symbol . The S-1 form revealed that the company had sales of $213 million and more than 82,000 customers.
In June 2022, the company launched a beta tool for content generation call |
https://en.wikipedia.org/wiki/Wilson%20doctrine%20%28economics%29 | In economic theory, the Wilson doctrine (or Wilson critique) stipulates that game theory should not rely excessively on common knowledge assumptions. Most prominently, it is interpreted as a request for institutional designs to be "detail-free". That is, mechanism designers should offer solutions that do not depend on market details (such as distributions or functional forms of payoff relevant signals) because they may be unknown to practitioners or are subject to intractable change. The name is due to Nobel laureate Robert Wilson, who argued:
Game theory has a great advantage in explicitly analyzing the consequences of trading rules that presumably are really common knowledge; it is deficient to the extent it assumes other features to be common knowledge, such as one agent's probability assessment about another’s preferences or information. I foresee the progress of game theory as depending on successive reductions in the base of common knowledge required to conduct useful analyses of practical problems. Only by repeated weakening of common knowledge assumptions will the theory approximate reality.
While the above quote is often seen as the Wilson doctrine, mechanism design researchers derive an insistence on detail-free mechanisms from it. For instance, Partha Dasgupta and Eric Maskin, as well as Mark Satterthwaite and Steven Williams, attribute this insistence to Wilson. This interpretation might also go back to another paper by Wilson in which he praises the double auction because it "does not rely on features of the agents' common knowledge, such as their probability assessment". While Wilson himself agrees with the spirit of demanding detail-free mechanisms, he is surprised to be credited for it. In line with the above quote, Dirk Bergemann and Stephen Morris see the doctrine as a reminder of John Harsanyi's insight that common knowledge assumptions can be made explicit (and then relaxed) by enriching the type space with beliefs. This interpretation gave ris |
https://en.wikipedia.org/wiki/Ishiguro%20Storm%20Surge%20Computer | The Ishiguro Storm Surge Machine is an analogue computer built by Japanese oceanographer Shizuo Ishiguro. Between 1960 and 1983, it was used to model storm surges in the North Sea by the UK National Institute of Oceanography. It is now on display in the Mathematics Gallery of the Science Museum in London.
History
Following the serious North Sea flood of 1953, the UK government set up a committee (known as the Waverley Committee) to develop a plan to prevent future disasters. The UK National Institute of Oceanography (NIO, now the National Oceanography Centre) was responsible for scientific investigation of storm surges in the UK. In 1957 Shizuo Ishiguro, a Japanese oceanographer who had been developing analogue methods for predicting ocean surges joined the NIO to apply his work to the North Sea. Initially, this was through a UNESCO fellowship but he later became a permanent employee of the NIO. Ishiguro continued to develop and apply his analogue model until the early 1980s, when improvements in digital computers led many oceanographers to favour numerical simulations. Ishiguro retired in 1983 but continued to work on his machine at home until his death in 2007. Ishiguro's storm surge computer was then acquired by the Science Museum, London where it is part of a display in the Mathematics Gallery about modelling the seas.
Description
Ishiguro’s machine is an analogue computer where electrical voltage and current are used to mimic the height and flow of water. The North Sea is represented as a grid with approximately 80 nodes which are connected electrically so that the flow of electricity between the nodes represents the flow of water between different points of the North Sea. The flow of water between points in the North Sea depends on the difference in water height, on fixed physical features such as coastlines and sea depth, on the Coriolis force (due to the Earth's rotation) and on time-dependent effects such as tidal forces (due to the gravitational effec |
https://en.wikipedia.org/wiki/Iterative%20rational%20Krylov%20algorithm | The iterative rational Krylov algorithm (IRKA), is an iterative algorithm, useful for model order reduction (MOR) of single-input single-output (SISO) linear time-invariant dynamical systems. At each iteration, IRKA does an Hermite type interpolation of the original system transfer function. Each interpolation requires solving shifted pairs of linear systems, each of size ; where is the original system order, and is the desired reduced model order (usually ).
The algorithm was first introduced by Gugercin, Antoulas and Beattie in 2008. It is based on a first order necessary optimality condition, initially investigated by Meier and Luenberger in 1967. The first convergence proof of IRKA was given by Flagg, Beattie and Gugercin in 2012, for a particular kind of systems.
MOR as an optimization problem
Consider a SISO linear time-invariant dynamical system, with input , and output :
Applying the Laplace transform, with zero initial conditions, we obtain the transfer function , which is a fraction of polynomials:
Assume is stable. Given , MOR tries to approximate the transfer function , by a stable rational transfer function , of order :
A possible approximation criterion is to minimize the absolute error in norm:
This is known as the optimization problem. This problem has been studied extensively, and it is known to be non-convex; which implies that usually it will be difficult to find a global minimizer.
Meier–Luenberger conditions
The following first order necessary optimality condition for the problem, is of great importance for the IRKA algorithm.
Note that the poles are the eigenvalues of the reduced matrix .
Hermite interpolation
An Hermite interpolant of the rational function , through distinct points , has components:
where the matrices and may be found by solving dual pairs of linear systems, one for each shift [Theorem 1.1]:
IRKA algorithm
As can be seen from the previous section, finding an Hermite interpolator of , through |
https://en.wikipedia.org/wiki/IBM%20Leapfrog | The IBM Leapfrog is a tablet computer prototype by IBM. It was designed by Sam Lucente and Richard Sapper. It is part of the collection of the Museum of Modern Art. It won the Compasso d'Oro in 1994. When the tablet computer was announced, it was mistakenly described by design magazines as a product that could be bought.
References
External links
Video of the Leapfrog
Leapfrog
Prototypes |
https://en.wikipedia.org/wiki/Fuller%20calculator | The Fuller calculator, sometimes called Fuller's cylindrical slide rule, is a cylindrical slide rule with a helical main scale taking 50 turns around the cylinder. This creates an instrument of considerable precision – it is equivalent to a traditional slide rule long. It was invented in 1878 by George Fuller, professor of engineering at Queen's University Belfast, and despite its size and price it remained on the market for nearly a century because it outperformed nearly all other slide rules.
As with other slide rules, the Fuller is limited to calculations based on multiplication and division with additional scales allowing for trigonometical and exponential functions. The mechanical calculators produced in the same era were generally restricted to addition and subtraction with only advanced versions, like the Arithmometer, able to multiply and divide. Even these advanced machines could not perform trigonometry or exponentiation and they were bigger, heavier and much more expensive than the Fuller. In the mid-twentieth century the handheld Curta mechanical calculator became available which also competed in convenience and price. However, for scientific calculations the Fuller remained viable until 1973 when it was made obsolete by the HP-35 handheld scientific electronic calculator.
Design
Model 1, the standard model
In essence, the calculator consists of three separate hollow cylindrical parts that can twist and slide over each other about a common axis without any tendency to slip. The following details describe the version made between 1921 and 1935. There is a papier-mâché cylinder (marked D in the annotated photograph) some long and in diameter fastened to a mahogany handle. A second papier-mâché cylinder (marked C) – long and diameter – is a slide fit over the first. Both cylinders are covered in paper varnished with shellac. The second, outer, cylinder is printed with the slide rule's primary logarithmic scale in the form of a 50-turn helix long |
https://en.wikipedia.org/wiki/Thomson%20TO16 | The Thomson TO16 or Thomson TO16PC is a PC compatible personal computer introduced by French company Thomson SA in 1987, with prices ranging from 9000 to 16000 FF depending on the version.
Prototype
The original concept was a machine similar to the Macintosh. Based on this the Thomson TO16 prototype (codename Théodore) was built around a Motorola 68000 processor with an Intel 82716 graphics chipset. The operating system chosen was OS-9, a preemptive multitasking system similar to Unix. It also featured an integrated 20MB SCSI hard drive.
Work on the prototype was carried on between 1985 and 1988, with five machines built. This concept was abandoned in favor of a PC compatible architecture, with the TO16 model designation being kept.
Specifications
Motorola 68000 @ 8Mhz CPU
2 MB RAM
Two video modes: 320x200 with 256 colors; 640x270 with 16 colors
Mouse
3"1/2 floppy drive
20 MB SCSI hard drive
Thomson TO16
The Thomson TO16 is a IBM PC compatible machine, running MS-DOS 3.2 with MS-DOS Manager and GW-BASIC.
The CPU is an Intel 8088 capable of running at 9.54Mhz on turbo mode with 512KB of RAM and a CGA graphic card with expanded abilities.
Specifications
CPU Intel 8088 running at 4.77 or 9.54 MHz
support for Intel 8087 co-processor
512 KB of RAM, expandable to 768 KB on the motherboard.
32 KB of ROM
IBM Monochrome Display Adapter, Hercules Graphics Card, CGA and Plantronics Colorplus compatible graphic card
Internal 5"1/4 360 KB disc drive
Two ISA expansion slots
Connections for an external disk drive
RS-232C Serie and Centronics Parallel (Micro ribbon connector) interfaces
Optional Modem
Hardware versions
The original TO16 model was expanded into four variations by adding extra hardware, such as a modem or hard drive.
Thomson TO16PC: original and most basic version
Thomson TO16PCM : 2400 bauds modem
Thomson TO16XPDD : two disc drives
Thomson TO16XPHD : 20 MB hard drive, color monitor and EGA graphics
References
IBM PC compatibles
Home computers
Thomson co |
https://en.wikipedia.org/wiki/Dmitrii%20Treschev | Dmitrii (or Dmitry) Valerevich Treschev (Дмитрий Валерьевич Трещёв, born 25 October 1964 im Olenegorsk, Murmansk Oblast) is a Russian mathematician and mathematical physicist, specializing in dynamical systems of classical mechanics.
Education and career
Treschev completed his secondary study in 1981 with degree from the Специализированный учебно-научный центр (СУНЦ) МГУ имени А.Н. Колмогорова (Specialized Educational and Scientific Center, МГУ, Physics and Mathematics Boarding School No. 18 named after A. N. Kolmogorov). Treschev completed his undergraduate study in 1986 with degree from the Faculty of Mechanics and Mathematics, Moscow State University. There in 1988 he received his Candidate of Sciences degree (PhD) with thesis Геометрические методы исследования периодических траекторий динамических систем (Geometric methods of investigation of periodic trajectories of dynamical systems) under the supervision of Valerii Vasilievich Kozlov. In 1992 Treschev received his Russian Doctor of Sciences degree (habilitation) with thesis Качественные методы исследования гамильтоновых систем, близких к интегрируемым (Qualitative methods for studying Hamiltonian systems close to integrable).
At the secondary school СУНЦ, Treschev taught as a professor in the Department of Mathematics from 1986 until his resignation. At Moscow State University, he is since 1993 a leading researcher, since 1998 a professor, and since 2006 head of the Department of Theoretical Mechanics. At the Steklov Institute he became in 2005 a chief researcher and the deputy director for research and is since 2017 the director for research. He is the author or coauthor of over 70 scientific publications. Together with V. V. Kozlov, he supervises the seminar Избранные задачи классической динамики (Selected problems of classical dynamics).
Treschev's research deals with integrability and non-integrability, dynamical stability, KAM theory, separatrix splitting, averaging in slow-fast systems, chaos in Ham |
https://en.wikipedia.org/wiki/Proportional-fair%20rule | In operations research and social choice, the proportional-fair (PF) rule is a rule saying that, among all possible alternatives, one should pick an alternative that cannot be improved, where "improvement" is measured by the sum of relative improvements possible for each individual agent. It aims to provide a compromise between the utilitarian rule - which emphasizes overall system efficiency, and the egalitarian rule - which emphasizes individual fairness.
The rule was first presented in the context of rate control in communication networks. However, it is a general social choice rule and can also be used, for example, in resource allocation.
Definition
Let be a set of possible `states of the world' or `alternatives'. Society wishes to choose a single state from . For example, in a single-winner election, may represent the set of candidates; in a resource allocation setting, may represent all possible allocations of the resource.
Let be a finite set, representing a collection of individuals. For each , let be a utility function, describing the amount of happiness an individual i derives from each possible state.
A social choice rule is a mechanism which uses the data to select some element(s) from which are `best' for society. The question of what 'best' means is the basic question of social choice theory. The proportional-fair rule selects an element such that, for every other state :Note that the term inside the sum, , represents the relative gain of agent i when switching from x to y. The PF rule prefers a state x over a state y, if and only if If the sum of relative gains when switching from x to y is not positive.
Comparison to other rules
The utilitarian rule selects an element that maximizes the sum of individual utilities, that is, for every other state :That rule ignores the current utility of the individuals. In particular, it might select a state in which the utilities of some individuals is zero, if the utilities of some other indivi |
https://en.wikipedia.org/wiki/Else%20Heart.Break%28%29 | Else Heart.Break() is a programming puzzle video game. It was developed by Erik Svedäng with art by Niklas Åkerblad.
Development
Else Heart.Break() was developed by Swedish developer Erik Svedäng. Development began in 2010 after the release of Blueberry Garden. It was released on Windows, Linux, and Mac OS X on September 24, 2015.
Reception
Else Heart.Break() received generally positive reviews from video game critics.
References
External links
2015 video games
Linux games
MacOS games
Programming games
Video games developed in Sweden
Windows games
Single-player video games |
https://en.wikipedia.org/wiki/Mali%20%28elephant%29 | Vishwamali, commonly known as Mali, is a female Asian elephant which is best known for being a major attraction of Manila Zoo in Manila, Philippines.
Early life
Vishwamali, nicknamed Mali, was in Sri Lanka in 1974. Mali is a female Asian elephant (Elephas maximus). She was moved into the Pinnawala Elephant Orphanage after her mother died of natural causes. In 1977, when Mali was three years old, the Sri Lankan government gifted the elephant to then Philippine First Lady Imelda Marcos. The elephant was presented at the Malacañang Palace prior to her transfer to Manila Zoo.
Captivity at Manila Zoo
When Mali was moved to Manila Zoo, she was placed in an enclosure with another female elephant named Shiba. Shiba, who was rescued from a circus, was territorial and behaved aggressively towards Mali. Following Shiba's death, Mali was able to roam around her enclosure more freely.
Treatment and condition
Mali's condition has been a subject of concern by various animal welfare groups.
Mali has been part of a campaign led by People for the Ethical Treatment of Animals (PETA) alleging the elephant is subject to neglect and has been urging for the release of the elephant. PETA has campaigned for the move of Mali to an elephant to a sanctuary in Thailand, but there are concerns that the elephant may not be able to adapt to a new environment if moved out of the Manila Zoo. PETA alternatively had proposed Mali to be moved to the Elephant Sanctuary in the United States. The Network for Animals (NFA), which maintains a stance against zoos in general, makes an exception for Mali. Despite its stance, the NFA expressed in 2018 that Manila Zoo is "the best option" in Mali's case.
There are also contrary reports which suggest Mali is healthy. In 2013, Mali underwent a checkup in a lead up to a potential transfer to Thailand. Nikorn Thongtip of Kasetsart University remarked that Mali is "healthy in every system" although exhibited "a little bit obesity". Thongtip remarked that the e |
https://en.wikipedia.org/wiki/Type%202%20inflammation | Type 2 inflammation is a pattern of immune response. Its physiological function is to defend the body against helminths, but a dysregulation of the type 2 inflammatory response has been implicated in the pathophysiology of several diseases.
Molecular biology
IL-25, IL-33, and TSLP are alarmins released from damaged epithelial cells. These cytokines mediate the activation of type 2 T helper cells (Th2 cells), type 2 innate lymphoid cells (ILC2 cells), and dendritic cells. Th2 cells and ILC2 cells secrete IL-4, IL-5 and IL-13.
IL-4 further drives CD4+ T cell differentiation towards the Th2 subtype and induces isotype switching to IgE in B cells. IL-4 and IL-13 stimulate trafficking of eosinophils to the site of inflammation, while IL-5 promotes both eosinophil trafficking and production.
Dysregulation in human disease
Type 2 inflammation has been implicated in several chronic diseases:
Asthma
Atopic dermatitis
Chronic sinusitis with nasal polyps
Eosinophilic esophagitis
Persons with one type 2 inflammatory disease are more likely to have other type 2 inflammatory diseases.
Pharmacological targets
Several medicines have been developed that target mediators of type 2 inflammation:
IL-4-specific blockers:
Altrakincept
Pascolizumab
IL-5-specific blockers:
Benralizumab
Mepolizumab
Reslizumab
IL-13-specific blockers:
Lebrikizumab
Tralokinumab
Dual IL-4 and IL-13 blockers:
Dupilumab
IgE-blockers:
Ligelizumab
Omalizumab
References
Immunology
Asthma
Atopic dermatitis |
https://en.wikipedia.org/wiki/Smoke%20taint | Smoke taint is a broad term for a set of smoke imparted compounds found in affected wines, constituting a wine fault. Increasing incidences of smoke tainted wines are an important issue, given the recent occurrences of wildfires or bushfires in wine grape producing regions during the growing seasons. Examples of wildfires resulting in smoke tainted wines include the fires in South Africa in late 2017, October 2017 Northern California wildfires, the 2019–20 Australian bushfire season, and the 2020 Glass Fire in Northern California.
Whenever ambient smoke comes into contact with developing grapes on vines for a period of time, there is a risk that the grapes will carry smoke taint and impart this in wine made from them. The risk is higher with red wines, because their fermentation process includes the grape skins. Around 20-25 percent of people are estimated to not be able to taste the smokiness, possibly because of a lack of enzymes in their saliva.
Causes
Smoke taint occurs when developing grapes are exposed to the smoke from wildfires. There are a number of factors that will determine the level of impact the smoke will have on the berries, including the state of berry development during the episode, the grape variety, the type and concentration of smoke and the duration of exposure.
Wildfires in forested areas tend to burn a lot of wood, releasing volatile phenols into the atmosphere. When these are absorbed by developing grapes in nearby vineyards, they can bind to grape sugars within the grapes. These bound phenols, known as glycosides, are likely to be odorless and tasteless until the bond with the sugar is broken during winemaking processes or aging. When the volatile phenols become unbound, the characteristic "smoky" flavor is likely to become detectable. This bond can also become undone upon tasting, when an affected wine comes in contact with enzyme-containing saliva. Thus, smoke taint can exist masked in wine for a period of time before it becomes app |
https://en.wikipedia.org/wiki/Permute%20instruction | Permute (and Shuffle) instructions, part of bit manipulation as well as vector processing, copy unaltered contents from a source array to a destination array, where the indices are specified by a second source array. The size (bitwidth) of the source elements is not restricted but remains the same as the destination size.
There exists two important permute variants, known as gather and scatter, respectively. The gather variant is as follows:
for i = 0 to length-1
dest[i] = src[indices[i]]
where the scatter variant is:
for i = 0 to length-1
dest[indices[i]] = src[i]
Note that unlike in memory-based gather-scatter all three of dest, src, and indices are registers (or parts of registers in the case of bit-level permute), not memory locations.
The scatter variant can be seen to "scatter" the source elements across (into) to the destination, where the "gather" variant is gathering data from the indexed source elements.
Given that the indices may be repeated in both variants, the resultant output is not a strict mathematical permutation because duplicates can occur in the output.
A special case of permute is also used in GPU "swizzling" (again, not strictly a permutation) which performs on-the-fly reordering of subvector data so as to align or duplicate elements with the appropriate SIMD lane.
Occurrences of permute instructions
Permute instructions occur in both scalar processors as well as vector processing engines as well as GPUs. In vector instruction sets they are typically named "Register Gather/Scatter" operations such as in RISC-V vectors, and take Vectors as input for both source elements and source array, and output another Vector.
In scalar instruction sets the scalar registers are broken down into smaller sections (unpacked, SIMD style) where the fragments are then used as array sources. The (small, partial) results are then concatenated (packed) back into the scalar register as the result.
Some ISAs, particularly for cryptographic appl |
https://en.wikipedia.org/wiki/Quran%20code | The term Quran code (also known as Code 19) refers to the claim that the Quranic text contains a hidden mathematically complex code. Advocates think that the code represents a mathematical proof of the divine authorship of the Quran. Proponents of the Quran code claim that the code is based on statistical procedures, however, this claim has not been validated by any independent mathematical or scientific institute.
History
In 1969, Rashad Khalifa, an Egyptian-American biochemist, began analyzing the separated letters of the Quran (also called Quranic initials or Muqattaʿat), and the Quran to examine certain sequences of numbers. In 1973 he published the book Miracle of the Quran: Significance of the Mysterious Alphabets, in which he describes the Quranic initials through enumerations and distributions.
In 1974, Khalifa claimed to have discovered a mathematical code hidden in the Quran, a code based around the number 19. He wrote the book The Computer Speaks: God's Message to the World, in which he thematizes this Quran code. He relies on Surah 74, verse 30 to prove the significance of the number: "Over it is nineteen,".
Proponents of the code include United Submitters International (an association initiated by Rashad Khalifa) as well as some Quranists and traditional Muslims.
Example
Believers in Quran Code often use certain word counts, checksums and cross sums to legitimize the code.
Edip Yüksel, a Turkish Quranistic author and colleague of Rashad Khalifa, makes the following claims in his book Nineteen: God's Signature in Nature and Scripture:
The Bismillah (bismi ʾllāhi ʾr-raḥmāni ʾr-raḥīmi), the Quranic opening formula, which, with one exception, is at the beginning of every Surah of the Quran, consists of exactly 19 letters.
The first word of the Bismillah, Ism (name), without contraction, occurs 19 times in the Quran (19×1). [Also no plural forms, or those with pronoun endings]
The second word of the Bismillah, Allah (God), occurs 2698 times (19×142). |
https://en.wikipedia.org/wiki/Sergey%20Bolotin | Sergey Vladimirovich Bolotin (Сергей Владимирович Болотин, born 1 December 1954 in Moscow) is a Russian mathematician, specializing in dynamical systems of classical mechanics.
Biography
Bolotin graduated in 1976 from the Faculty of Mechanics and Mathematics of Moscow State University. There he received in 1981 his Candidate of Sciences degree (PhD) with thesis Либрационные движения обратимых механических систем (Librational motions of reversible mechanical systems). He received in 1998 his Russian Doctor of Sciences degree (habilitation) with thesis Двоякоасимптотические траектории и условия интегрируемости гамильтоновых систем (Double-asymptotic trajectories and integrability conditions for Hamiltonian systems).
Since 1998 Bolotin is a professor in the Department of Theoretical Mechanics, Faculty of Mechanics and Mathematics, Moscow State University. He is now the head of the Mechanics Department of the Steklov Institute of Mathematics. His research deals with dynamical systems of classical mechanics, Hamiltonian systems, and variational methods. He has supervised four PhD (Candidate of Sciences) students. He is the author or coauthor of over 75 scientific publications, including a textbook on theoretical mechanics (2010). He has served on the editorial board of the journal Regular and Chaotic Dynamics.
In 1994 he was an invited speaker with talk Invariant Sets of Hamiltonian Systems and Variational Methods at the International Congress of Mathematicians in Zurich. In 2016 he was elected a corresponding member of the Russian Academy of Sciences.
As a hobby, Bolotin sails in Olympic class Finn dinghies.
His brother Yuri Vladimirovich Bolotin (born December 1, 1954) is a professor at Moscow State University. Both brothers in 2020 became champions of Russia in the class of yachts "Carter 30".
Selected publications
References
1954 births
Living people
Moscow State University alumni
Academic staff of Moscow State University
Academic staff of the Steklov Institu |
https://en.wikipedia.org/wiki/MacOS%20Monterey | macOS Monterey (version 12) is the eighteenth major release of macOS, Apple's desktop operating system for Macintosh computers. The successor to macOS Big Sur, it was announced at WWDC 2021 on June 7, 2021, and released on October 25, 2021. macOS Monterey was succeeded by macOS Ventura, which was released on October 24, 2022.
The operating system is named after Monterey Bay, continuing the trend of releases named after California locations since 2013's 10.9 Mavericks.
macOS Monterey is the final version of macOS that supports the 2015–2017 MacBook Air, Retina MacBook Pro, 2014 Mac Mini and cylindrical Mac Pro, as its successor, macOS Ventura, drops support for those models.
Changes
Monterey introduced several new features and changes, including the following:
Shortcuts for the Mac
TestFlight for the Mac
Provisions to allow the planned introduction of Universal Control, which allows a single keyboard and mouse to control multiple Macs and iPads. It works on Macs with Apple silicon and some with an Intel processor, including MacBook Pro (2016 and later), MacBook (2016 and later), MacBook Air (2018 and later), iMac (2017 and later), iMac (5K Retina, 27-inch, Late 2015), iMac Pro, Mac Mini (2018 and later), and Mac Pro (2019). It works on these iPads: iPad Pro, iPad Air (3rd generation and later), iPad (6th generation and later), and iPad Mini (5th generation and later).
Support for the Apple Music Voice Plan Subscription.
Portrait Mode and Noise Cancellation features for FaceTime and some apps (in Control Center).
New Toolbar features and designs for Finder and the Preview app.
Have a Live Memoji and Animoji right on the lock screen.
A yellow privacy indicator on the menu bar for indicating if the Mac's microphone or camera is active.
Live Text, which allows a user to copy, paste, translate and look up text from images displayed by Photos, Screenshot, Quick Look, and Safari.
New Passwords Manager for Mac
New on-device machine-learning–activated keyboard dictation |
https://en.wikipedia.org/wiki/Self-supervised%20learning | Self-supervised learning (SSL) is a paradigm in machine learning for processing data of lower quality, rather than improving ultimate outcomes. Self-supervised learning more closely imitates the way humans learn to classify objects.
The typical SSL method is based on an artificial neural network or other model such as a decision list. The model learns in two steps. First, the task is solved based on an auxiliary or pretext classification task using pseudo-labels which help to initialize the model parameters. Second, the actual task is performed with supervised or unsupervised learning. Other auxiliary tasks involve pattern completion from masked input patterns (silent pauses in speech or image portions masked in black).
Self-supervised learning has produced promising results in recent years and has found practical application in audio processing and is being used by Facebook and others for speech recognition.
Types
For a binary classification task, training data can be divided into positive examples and negative examples. Positive examples are those that match the target. For example, if you're learning to identify birds, the positive training data are those pictures that contain birds. Negative examples are those that do not.
Contrastive self-supervised learning
Contrastive self-supervised learning uses both positive and negative examples. Contrastive learning's loss function minimizes the distance between positive samples while maximizing the distance between negative samples.
Non-contrastive self-supervised learning
Non-contrastive self-supervised learning (NCSSL) uses only positive examples. Counterintuitively, NCSSL converges on a useful local minimum rather than reaching a trivial solution, with zero loss. For the example of binary classification, it would trivially learn to classify each example as positive. Effective NCSSL requires an extra predictor on the online side that does not back-propagate on the target side.
Comparison with other forms of |
https://en.wikipedia.org/wiki/VPN%20service | A virtual private network (VPN) service provides a proxy server to help users bypass Internet censorship such as geoblocking and users who want to protect their communications against data profiling or MitM attacks on hostile networks.
A wide variety of entities provide "VPNs" for several purposes. But depending on the provider and the application, they do not always create a true private network. Instead, many providers simply provide an Internet proxy that uses VPN technologies such as OpenVPN or WireGuard. Commercial VPN services are often used by those wishing to disguise or obfuscate their physical location or IP address, typically as a means to evade Internet censorship or geo-blocking.
Providers often market VPN services as privacy-enhancing, citing security features, such as encryption, from the underlying VPN technology. However, users must consider that when the transmitted content is not encrypted before entering the proxy, that content is visible at the receiving endpoint (usually the VPN service provider's site) regardless of whether the VPN tunnel itself is encrypted for the inter-node transport. The only secure VPN is where the participants have oversight at both ends of the entire data path or when the content is encrypted before it enters the tunnel.
On the client side, configurations intended to use VPN services as proxies are not conventional VPN configurations. However, they do typically utilize the operating system's VPN interfaces to capture the user's data to send to the proxy. This includes virtual network adapters on computer OSes and specialized "VPN" interfaces on mobile operating systems. A less common alternative is to provide a SOCKS proxy interface.
In computer magazines, VPN services are typically judged on connection speeds; privacy protection, including privacy at signup and grade of encryption; server count and locations; interface usability; and cost.
In order to determine the degree of privacy and anonymity, various computer |
https://en.wikipedia.org/wiki/BookStack | BookStack is a free and open-source wiki software aimed for a simple, self-hosted, and easy-to-use platform. Based on Laravel, a PHP framework, BookStack is released under the MIT License. It uses the ideas of books to organise pages and store information. BookStack is multilingual and available in over thirty languages.
History
BookStack’s first commit was published on 12 July 2015 by Dan Brown, an English web developer. Originally named ‘Oxbow’, the project was renamed to BookStack after only 11 days. The initial proper layout was inspired by DokuWiki, and in October of the same year, the current layout of BookStack was settled. The overall design was significantly optimised with the release of v0.26 on 6 May 2019, especially on the mobile experience.
After over five years of development by Brown and the community members, it ended the beta stage with the release of v21.04 on 9 April 2021. BookStack has become the most popular wiki software written in PHP on GitHub, as of June 2021.
Features
Installation and configuration
PHP, MySQL or MariaDB, Git (for updates), and Composer are required for the installation of BookStack. It also can be installed via a Docker container. The name, logo and registration options can be changed, and whether the whole system is publicly viewable or not can be also changed.
Content levels
BookStack, as the name suggests, is based of the ideas of a normal stack of books. The categorisation of BookStack is limited to four levels— shelves, books, chapters, and pages. Books and pages are required for storing contents, while chapters are optional for better organisation of pages. Shelves can contain multiple books, and a single book could be placed on multiple shelves.
Organisation
On a BookStack website, chapters and pages can be sorted within a book. A chapter can be moved to another book, and a page can be moved to either another book or another chapter. Page revisions and image management are available, as well as a full |
https://en.wikipedia.org/wiki/Markets%20in%20Crypto-Assets | Markets in Crypto-Assets (MiCA) is a regulation in EU law. It is intended to help streamline distributed ledger technology (DLT) and virtual asset regulation in the European Union (EU) whilst protecting users and investors. MiCA was approved on 20 April 2023 by the EU Parliament and will become law in 2024.
Title
The full name of the 24 September 2020 proposal is the "Proposal for a REGULATION OF THE EUROPEAN PARLIAMENT AND OF THE COUNCIL on Markets in Crypto-assets, and amending Directive (EU) 2019/1937 COM/2020/593 final". MiCA is part of a Digital Finance Package that intends to transform the European economy in the coming decades.
Function
MiCA provides legal certainty around crypto assets – cryptocurrencies, security tokens and stablecoins. It is similar to Europe’s Markets in Financial Instruments Directive (MiFID), which is a legal framework for securities markets, investment intermediaries and trading venues. It is expected to be different from the UK's crypto regulatory framework. The UK will start by regulating only a few crypto assets, while the EU's MiCA regime is expected to have a wider focus.
History
Groundwork for MiCA started in 2018 due to increased public interest within the EU in cryptocurrencies. The European Commission adopted the digital finance package which included MiCA in September 2020, leading to extensive discussions among the preparatory bodies (the EU Council, the European Central Bank, the Economic and Social Committee).
After 18 months of debate, the European Union passed the Markets in Crypto-Assets regulation (MiCA) in 2022. Regulations on stablecoins were expected to take effect in June 2024 and those affecting crypto asset service providers in the following December. However, service providers with fewer than 15 million active users in Europe would not be considered “significant” under Mica and so would be supervised by national EU authorities rather than the European Banking Authority and the European Central Bank. Elizabet |
https://en.wikipedia.org/wiki/DYNAS | DYNAS (from Dynamic Selectivity) is a dynamic analog filtering and tuning technology to improve the reception of FM radio broadcasts under adverse conditions.
Overview
The trademarked DYNAS system is based on the same principles as the In Channel Select (ICS) system by H.u.C. Elektronik. The novel tracking filter arrangement was originally conceived by the German engineer Jens Hansen in 1982. The concept was prototyped as High Select in summer 1983. With funding from innovation funds of the city of Berlin, Hansen left Bosch/Blaupunkt to start, with companion Klaus Müller-Catito, his own company H.u.C. Elektronik in 1984. When licensing negotiations with his former employer failed, the system was marketed in the early 1990s as DYNAS by the German Telefunken electronic (a spin-off of AEG-Telefunken and DASA, firming as since 1992), who, with the related (the former AEG-Telefunken Halbleiterwerk in Heilbronn), also designed integrated circuits implementing the system, the TEMIC/TFK U4290B (stand-alone FM IF DYNAS system in 68-pin PLCC package), U4291B (DYNAS coprocessor) and U4292B (software-controlled DYNAS system in 44-pin SSO package).
Compared to conventional receivers, DYNAS has a more than 26 dB better selectivity and a typically twice as good sensitivity (improved by 6 dB) thereby almost doubling the reception area and allowing to receive even extremely noisy stations. This is achieved by an adaptive bandwidth of the IF filter and by dynamically tracking of the center frequency of the IF filter in real-time.
With a transmitter spacing of 200 kHz an undisturbed reception in stereo is possible, with 100 kHz a largely undisturbed mono reception is still possible.
The principle has been adopted in some high-end FM tuners like the analog Burmester Tuner 915 (1991) or the digital synthesizer tuners Onkyo Integra T-4970 (1992) and T-488F (1993) as well as in various car radios, such as the Alpine 7619R (1989) and 1310R/3681 (1990), the JVC KS-CG10 (1992), the Cla |
https://en.wikipedia.org/wiki/Sphincter%20of%20Boyden | The sphincter of Boyden (also known as the choledochal sphincter) is a sphincter located in the common bile duct before it joins with the pancreatic duct to form the ampulla of vater. This sphincter controls the flow of bile into the pancreatic duct and it helps in filling up of the gallbladder with bile.
Structure
The sphincter of Boyden is a smooth muscle sphincter surrounding the common bile duct (ductus choledocus). It occurs just before the junction with the pancreatic duct, where the ampulla of Vater is formed. Occasionally, some fibres also surround the pancreatic duct.
It is subdivided into two parts - pars superior and pars inferior. The pars inferior is the strongest component of the sphincter of Oddi complex.
Function
The sphincter of Boyden controls the flow of bile from the common bile duct into the pancreatic duct. This helps with filling of the gallbladder with bile.
Its contractions regulate the passage of bile into the gall bladder or the duodenum.
History
This is named after the American anatomist Edward Allen Boyden (1886-1976).
References
Anatomy
Digestive system |
https://en.wikipedia.org/wiki/List%20of%20organisms%20named%20after%20famous%20people%20%28born%20before%201800%29 | In biological nomenclature, organisms often receive scientific names that honor a person. A taxon (e.g. species or genus; plural: taxa) named in honor of another entity is an eponymous taxon, and names specifically honoring a person or persons are known as patronyms. Scientific names are generally formally published in peer-reviewed journal articles or larger monographs along with descriptions of the named taxa and ways to distinguish them from other taxa. Following rules of Latin grammar, species or subspecies names derived from a man's name often end in -i or -ii if named for an individual, and -orum if named for a group of men or mixed-sex group, such as a family. Similarly, those named for a woman often end in -ae, or -arum for two or more women.
This list is part of the List of organisms named after famous people, and includes organisms named after famous individuals born before 1 January 1800. It also includes ensembles in which at least one member was born before that date; but excludes companies, institutions, ethnic groups or nationalities, and populated places. It does not include organisms named for fictional entities, for biologists, paleontologists or other natural scientists, nor for associates or family members of researchers who were not otherwise notable (exceptions are made, however, for natural scientists who are much more famous for other aspects of their lives, such as, for example, writer Johann Wolfgang von Goethe).
Organisms named after famous people born later can be found in:
List of organisms named after famous people (born 1800–1899)
List of organisms named after famous people (born 1900–1949)
List of organisms named after famous people (born 1950–present)
The scientific names are given as originally described (their basionyms); subsequent research may have placed species in different genera, or rendered them taxonomic synonyms of previously described taxa. Some of these names may be unavailable in the zoological sense or illegitimate |
https://en.wikipedia.org/wiki/List%20of%20organisms%20named%20after%20famous%20people%20%28born%201950%E2%80%93present%29 | In biological nomenclature, organisms often receive scientific names that honor a person. A taxon (e.g., species or genus; plural: taxa) named in honor of another entity is an eponymous taxon, and names specifically honoring a person or persons are known as patronyms. Scientific names are generally formally published in peer-reviewed journal articles or larger monographs along with descriptions of the named taxa and ways to distinguish them from other taxa. Following rules of Latin grammar, species or subspecies names derived from a man's name often end in -i or -ii if named for an individual, and -orum if named for a group of men or mixed-sex group, such as a family. Similarly, those named for a woman often end in -ae, or -arum for two or more women.
This list is part of the list of organisms named after famous people, and includes organisms named after famous individuals born on or after 1 January 1950. It also includes ensembles (including bands and comedy troupes) in which at least one member was born after that date; but excludes companies, institutions, ethnic groups or nationalities, and populated places. It does not include organisms named for fictional entities, for biologists, paleontologists or other natural scientists, nor for associates or family members of researchers who are not otherwise notable (exceptions are made, however, for natural scientists who are much more famous for other aspects of their lives, such as, for example, rock musician Greg Graffin).
Organisms named after famous people born earlier can be found in:
List of organisms named after famous people (born before 1800)
List of organisms named after famous people (born 1800–1899)
List of organisms named after famous people (born 1900–1949)
The scientific names are given as originally described (their basionyms): subsequent research may have placed species in different genera, or rendered them taxonomic synonyms of previously described taxa. Some of these names may be unavailable in th |
https://en.wikipedia.org/wiki/Hovlinc | Hovlinc RNA is a self-cleaving ribozyme of about 168 nucleotides found in a very long noncoding RNA (vlincRNA) in humans, chimpanzees, and gorillas. The word "hovlinc" comes from "hominin vlincRNA-located" RNA. Hovlinc is only a fourth known case of a ribozyme in human. Self-cleavage activity of Hovlinc has been shown in human, chimpanzees and bonobos, but is absent in gorillas, raising questions about Hovlinc's biological function and evolution.
There are only a few known examples of ribozymes in human, including Hovlinc, Mammalian CPEB3 ribozyme, Hammerhead ribozyme (HH9 and HH10) and B2 SINE ribozyme. Presumably Hovlinc acquired its self-cleaving activity about 10 to 13 million of years ago, which coincides with the last common ancestor of humans, gorillas, and chimpanzees. Hovlinc presents catalytic activity in hominids but not in gorillas where a mutation abolished the self-cleavage activity.
Hovlinc is a very structured RNA that contains four stem loops joined in a central loop, it also features large pseudoknots that help to bring together the second and fourth helices, which helps the RNA to get the more compacted structure that allows catalytic activity.
References
External links
Hovlinc family in Rfam
Ribozymes
Nucleotides
RNA
Genetics |
https://en.wikipedia.org/wiki/Bayesian%20learning%20mechanisms | Bayesian learning mechanisms are probabilistic causal models used in computer science to research the fundamental underpinnings of machine learning, and in cognitive neuroscience, to model conceptual development.
Bayesian learning mechanisms have also been used in economics and cognitive psychology to study social learning in theoretical models of herd behavior.
See also
Active learning
Bayesian learning
Cognitive acceleration
Cognitivism (learning theory)
Constructivist epistemology
Developmental psychology
Fluid and crystallized intelligence
Inquiry-based learning
Kohlberg's stages of moral development
Theory theory
References |
https://en.wikipedia.org/wiki/Divar%20%28website%29 | Divar (; "wall") is an Iranian Persian classified ads and E-commerce mobile app, and an online platform for users in Iran founded in Iran in 2012 with sections devoted to real estate, vehicles, goods, community service, Industrial equipment and jobs. On average, Divar’s users post more than 139.7 million new ads & over 53.1 million users open the app annually based on the latest published annual report.
Ads
To use this app, users must register, have a valid National Iranian ID number, and they must pay for posting more than 3 ads.
Control and censor
The website periodically censors prices of cars, house rental, and real estate.
This program has put 3500 words in its black list, if the user uses these words, the user's chat or post will be blocked. Masseuse/massage ads are censored and deleted.
Features
Night Mode
Supports screen reader
Accessibility
Foreign investment
One Dutch company has invested $47 million in the company.
Service
The app sorts ads by Iranian cities, districts, and categories
Real estate
Vehicles
Electronics
Home
Services
Personal
Entertainment and leisure
Social
Business
Job hiring and employment
Award
Iran web and mobile festival – best accessibility features
See also
Iran economy
Sheypoor (software)
References
External links
https://play.google.com/store/apps/details?id=ir.divar&hl=en&gl=US
https://apps.apple.com/us/app/divar/id1492874203
Persian-language websites
E-commerce websites
Mobile software
Android (operating system) software
IOS software
Online companies
Online marketplaces of Iran |
https://en.wikipedia.org/wiki/Thomson%20EF9345 | The EF9345 from SGS-Thomson Microelectronics, Inc., was a semigraphic microprocessor for video image control, encapsulated in a 40-pin DIP and used primarily in the Matra Alice 32, Matra Alice 90 and Philips VG5000 microcomputers.
The EF9345 was capable of displaying 8 colors (RGB primaries), 128 alphanumeric characters and 128 semigraphic characters. It had one semigraphic mode and 40- and 80-column text modes. It was able to address up to 16KB of dedicated video RAM.
Video Modes
50/60Hz output
Interlaced or progressive scan
Semigraphics:
128 standard character set with 5x7 pixel font dimensions. User definable 8x10 pixel alphanumeric or semigraphic sets.
40 characters x 25 rows text mode (similar to teletext):
8 x 10 pixel font
Selectable background and foreground colors
Styles: double height, double width, blinking, reverse, underline, conceal, insert, accentuation of lowercase characters
80 characters x 25 rows text mode:
6 x 10 pixel font
Styles: blinking, underlining, reverse, color
8 colors (3-bit RGB palette):
On-Chip Character Generator
The on-chip character generator offered several character sets, including alphanumeric and videotext compatible semigraphics.
See also
Thomson EF936x
Motorola 6847
Motorola 6845
TMS9918
MOS Technology VIC-II
List of home computers by video hardware
References
External links
EF9345 datasheet
Graphics chips
Character sets |
https://en.wikipedia.org/wiki/262%20%28number%29 | 262 (two hundred [and] sixty-two) is a natural number preceded by the number 261 and followed by 263. It has the prime factorization 2·131.
Mathematical properties
There are four divisors of this number, the divisors being , , , and 262 itself, which makes it a semiprime.
It is the sixth meandric number, and the ninth open meandric number.
As it cannot be divided into the sum of the proper divisors of any number, it is the 17th untouchable number.
As it eventually reaches 1 when replaced by the sum of the square of each digit, it is the 40th 10-happy number.
As 262 is 262 backwards, it is a palindromic number.
References
Integers |
https://en.wikipedia.org/wiki/Turtlestitch | Turtlestitch (stylized as TurtleStitch) is a free and open source platform (or web application) for generating and sharing patterns for embroidery machines. Turtlestitch is derived from educational programming languages such as Logo, Scratch and Snap! using the same jigsaw style programming paradigm which offers simplicity suitable for novices but has powerful features, described as ‘low threshold, high ceiling’ by Seymour Papert. Its microworld is a turtle representing the needle of a programmable embroidery machine. Turtlestitch can be used for creating novel patterns for embroidery, combining the abstract logic of computing and the physical materiality of textiles. Its primary use is educational, as it offers a way of introducing programming to audiences with diverse interests. A growing gallery of open source embroidery designs enables community-based collaboration and shared learning. In 2017, Turtlestitch received the award for the best Open Educational Resource in the German-speaking countries.
Educational approach
Embroidery is graphically similar to line drawing and Turtlestitch builds on the concept of Turtle Geometry and the constructionist approach developed by Seymor Papert and Cynthia Solomon at MIT which first informed the Logo and later the Scratch programming languages. Turtlestitch is an active member of the global Scratch community. It updates this approach by bringing it to the Maker Culture (Maker Movement), which combines computing and physical creation.
Turtlestitch's approach does not focus on solving pre-existing problems, but on developing free creativity in programming and designing. Users can approach this field either from the side of code or from the side of textile design, thus speaking to diverse audiences. The shared open-source designs allows for community peer-learning.
A global community is actively using Turtlestitch in formal and informal educational contexts.
Cynthia Solomon, involved since the 1960s in developing the cons |
https://en.wikipedia.org/wiki/Slime%20Rancher%202 | Slime Rancher 2 is a first-person life simulation adventure video game developed and published by American indie studio Monomi Park. Slime Rancher 2 is the direct sequel to its predecessor Slime Rancher (2017). It features the playable character and main protagonist of Slime Rancher, Beatrix LeBeau, exploring a new location called Rainbow Island. The game released in early access on September 22, 2022, for Xbox Series X/S and Microsoft Windows via the Microsoft Store, Steam, and Epic Games Store.
Gameplay
In an open world the player controls the character Beatrix LeBeau, a rancher who moved from planet Earth to a far away planet to live the life of a slime rancher, centered around ranch construction and the exploration of the environment in order to collect, raise, feed, and breed slimes, gelatinous living organisms of various sizes and characteristics.
The game revolves around feeding slimes the correct food so that they can produce "plorts", which can be sold in exchange for Newbucks, a currency required to purchase upgrades for the ranch and its equipment. There are different kinds of slimes in the world, including some introduced for Slime Rancher 2. Slimes react and change based on what they are fed.
Development and release
Slime Rancher 2 was revealed on June 13, 2021, having been featured during the 2021 Xbox & Bethesda Games Showcase. During the Xbox & Bethesda Games Showcase 2022 more information about the game was revealed along with a projected release date of fall 2022. Slime Rancher 2 was released in early access on September 22, 2022, for Microsoft Windows and Xbox Series X/S.
Slime Rancher 2 uses the Unity engine. It utilizes Unity's new High Definition Render Pipeline, a render pipeline that handles graphical features. This required a new approach to the graphics pipeline compared to the one used in the previous game.
References
External links
Upcoming video games
Biological simulation video games
Early access video games
Farming video games
|
https://en.wikipedia.org/wiki/Knowledge%20graph%20embedding | In representation learning, knowledge graph embedding (KGE), also referred to as knowledge representation learning (KRL), or multi-relation learning, is a machine learning task of learning a low-dimensional representation of a knowledge graph's entities and relations while preserving their semantic meaning. Leveraging their embedded representation, knowledge graphs (KGs) can be used for various applications such as link prediction, triple classification, entity recognition, clustering, and relation extraction.
Definition
A knowledge graph is a collection of entities , relations , and facts . A fact is a triple that denotes a link between the head and the tail of the triple. Another notation that is often used in the literature to represent a triple (or fact) is . This notation is called resource description framework (RDF). A knowledge graph represents the knowledge related to a specific domain; leveraging this structured representation, it is possible to infer a piece of new knowledge from it after some refinement steps. However, nowadays, people have to deal with the sparsity of data and the computational inefficiency to use them in a real-world application.
The embedding of a knowledge graph translates each entity and relation of a knowledge graph, into a vector of a given dimension , called embedding dimension. In the general case, we can have different embedding dimensions for the entities and the relations . The collection of embedding vectors for all the entities and relations in the knowledge graph can then be used for downstream tasks.
A knowledge graph embedding is characterized by four different aspects:
Representation space: The low-dimensional space in which the entities and relations are represented.
Scoring function: A measure of the goodness of a triple embedded representation.
Encoding models: The modality in which the embedded representation of the entities and relations interact with each other.
Additional information: Any addition |
https://en.wikipedia.org/wiki/Quantum%20Markov%20semigroup | In quantum mechanics, a quantum Markov semigroup describes the dynamics in a Markovian open quantum system. The axiomatic definition of the prototype of quantum Markov semigroups was first introduced by A. M. Kossakowski in 1972, and then developed by V. Gorini, A. M. Kossakowski, E. C. G. Sudarshan and Göran Lindblad in 1976.
Motivation
An ideal quantum system is not realistic because it should be completely isolated while, in practice, it is influenced by the coupling to an environment, which typically has a large number of degrees of freedom (for example an atom interacting with the surrounding radiation field). A complete microscopic description of the degrees of freedom of the environment is typically too complicated. Hence, one looks for simpler descriptions of the dynamics of the open system. In principle, one should investigate the unitary dynamics of the total system, i.e. the system and the environment, to obtain information about the reduced system of interest by averaging the appropriate observables over the degrees of freedom of the environment. To model the dissipative effects due to the interaction with the environment, the Schrödinger equation is replaced by a suitable master equation, such as a Lindblad equation or a stochastic Schrödinger equation in which the infinite degrees of freedom of the environment are "synthesized" as a few quantum noises. Mathematically, time evolution in a Markovian open quantum system is no longer described by means of one-parameter groups of unitary maps, but one needs to introduce quantum Markov semigroups.
Definitions
Quantum dynamical semigroup (QDS)
In general, quantum dynamical semigroups can be defined on von Neumann algebras, so the dimensionality of the system could be infinite. Let be a von Neumann algebra acting on Hilbert space , a quantum dynamical semigroup on is a collection of bounded operators on , denoted by , with the following properties:
, ,
, , ,
is completely positive for all ,
is a - |
https://en.wikipedia.org/wiki/Reinforcement%20in%20concrete%203D%20printing | The reinforcement of 3D printed concrete is a mechanism where the ductility and tensile strength of printed concrete are improved using various reinforcing techniques, including reinforcing bars, meshes, fibers, or cables. The reinforcement of 3D printed concrete is important for the large-scale use of the new technology, like in the case of ordinary concrete. With a multitude of additive manufacturing application in the concrete construction industryspecifically the use of additively constructed concrete in the manufacture of structural concrete elementsthe reinforcement and anchorage technologies vary significantly. Even for non-structural elements, the use of non-structural reinforcement such as fiber reinforcement is not uncommon. The lack of formwork in most 3D printed concrete makes the installation of reinforcement complicated. Early phases of research in concrete 3D printing primarily focused on developing the material technologies of the cementitious/concrete mixes. These causes combined with the non-existence of codal provisions on reinforcement and anchorage for printed elements speak for the limited awareness and the usage of the various reinforcement techniques in additive manufacturing. The material extrusion-based printing of concrete is currently favorable both in terms of availability of technology and of the cost-effectiveness. Therefore, most of the reinforcement techniques developed or currently under development are suitable to the extrusion-based 3D printing technology.
Types of reinforcement
The reinforcement in concrete 3D printing, much like that in conventional concrete, can be classified based either on the method of placement or the method of action. The methods of placement of reinforcement are preinstallation, co-installation, and post-installation. The examples of each are pre-installed meshes, fibers mixed with concrete, and post-tensioning cables, respectively. The classification based on the structural action is once again the sam |
https://en.wikipedia.org/wiki/TEA1002 | The TEA1002 is a PAL video encoder chip produced by Mullard in 1982 and used on the Mattel Aquarius computer and AlphaTantel Prestel adapter.
It was also used on teletext decoders and color bar generators associated with video test equipment.
The chip is capable of displaying 40 × 24 text blocks with 8 × 8 pixel characters, corresponding a theoretical resolution of 320 × 192 pixels (within borders), with the character set allowing for a 80 × 72 semigraphics display.
It generates 16 colors based on Luminance, Chrominance and Saturation, usually with the 8 basic colors being similar to the EBU 75% color bars.
Levels
According to the TEA1002 datasheet, colors are formed by the combination of three signals, roughly equivalent to the HSL colorspace:
Luminance
Chroma angle (º)
Chroma percentage (%, equivalent to Saturation)
Internally colors are stored in a 4-bit RGBI arrangement. There are three bits for the RGB components (generating 8 primary colors at full saturation but 75% luminance - similar to the EBU colour bars) and an inverter logic input bit that controls a variation of the base color (a 75% Luminance decrease for white; a 50% Chroma saturation decrease for all colors).
The following table lists the internal signals and shows an approximation of the generated colors, as seen on a web standard sRGB monitor. Colors could be different when seen on an analog PAL CRT television.
An alternate configuration of the chip allows it to output 95% luminance color bars - similar to BBC colour bars, more suited for usage in teletext decoders.
See also
Thomson EF9345
Motorola 6845
TMS9918
MOS Technology VIC-II
List of home computers by video hardware
References
Graphics chips |
https://en.wikipedia.org/wiki/Continuum%20robot | A continuum robot is a type of robot that is characterised by infinite degrees of freedom and number of joints. These characteristics allow continuum manipulators to adjust and modify their shape at any point along their length, granting them the possibility to work in confined spaces and complex environments where standard rigid-link robots cannot operate. In particular, we can define a continuum robot as an actuatable structure whose constitutive material forms curves with continuous tangent vectors. This is a fundamental definition that allows to distinguish between continuum robots and snake-arm robots or hyper-redundant manipulators: the presence of rigid links and joints allows them to only approximately perform curves with continuous tangent vectors.
The design of continuum robots is bioinspired, as the intent is to resemble biological trunks, snakes and tentacles. Several concepts of continuum robots have been commercialised and can be found in many different domains of application, ranging from the medical field to undersea exploration.
Classification
Continuum robots can be categorised according to two main criteria: structure and actuation.
Structure
The main characteristic of the design of continuum robots is the presence of a continuously curving core structure, named backbone, whose shape can be actuated. The backbone must also be compliant, meaning that the backbone yields smoothly to external loads.
According to the design principles chosen for the continuum manipulator, we can distinguish between:
single-backbone: these continuum manipulators have one central elastic backbone through which actuation/transmission elements can run.
multi-backbone: the structure of these continuum robots has two or more elastic elements (either rods or tubes) parallel to each other and constrained with one another in some way.
concentric-tube: the backbone is made of concentric tubes that are free to rotate and translate between each other, depending on the a |
https://en.wikipedia.org/wiki/RSS%20Guard | RSS Guard is a free and open-source news aggregator for web feeds and podcasts. It is written in C++ and uses Qt, which allows it to fit with the look and feel of different operating systems while remaining cross-platform. It includes a file downloader, advanced network proxy configuration, and supports external media viewing tools.
RSS Guard is released under the GPL-3.0-only license and is available for Windows, macOS, OS/2 and various Linux distributions.
Features
Supported formats
The feed formats supported by RSS Guard are RSS/RDF, Atom, and JSON Feed.
RSS Guard can synchronize data with online feed services Tiny Tiny RSS, Nextcloud News, Feedly, Inoreader, feed readers which use Google Reader's API such as FreshRSS, The Old Reader, and Bazqux. The application may also act as a simple e-mail client for Gmail.
Other features
RSS Guard can mark articles as read, unread, and important. Both article and feed lists can be filtered using regular expressions.
Time intervals for fetching feeds are configurable, and, through feed settings, they can be adjusted for each feed separately.
Scriptable article filtering and website scraping
RSS Guard is bundled with JavaScript engine which is used to write article filters - small scripts which define how the application should react when new article is downloaded.
RSS Guard also provides unified way of executing custom programs, which gives another way to modify raw feed data or even generate it, scraping the data from websites that do not offer a regular feed.
User interface
The application's toolbar and status bar are highly customizable. They can also be hidden, making RSS Guard look very minimalistic. When in a horizontal layout, the articles viewer of RSS Guard is placed to the right side of the articles list.
RSS Guard supports skins. Light and dark skins are available by default.
Database
Feed data can be stored using SQLite or MariaDB. RSS Guard also supports the ability to import and export the d |
https://en.wikipedia.org/wiki/Windows%2011 | Windows 11 is the latest major release of Microsoft's Windows NT operating system, released on October 5, 2021. It succeeded Windows 10 (2015) and is available for free for any Windows 10 devices that meet the new Windows 11 system requirements.
Windows 11 features major changes to the Windows shell influenced by the canceled Windows 10X, including a redesigned Start menu, the replacement of its "live tiles" with a separate "Widgets" panel on the taskbar, the ability to create tiled sets of windows that can be minimized and restored from the taskbar as a group, and new gaming technologies inherited from Xbox Series X and Series S such as Auto HDR and DirectStorage on compatible hardware. Internet Explorer (IE) has been replaced by the Chromium-based Microsoft Edge as the default web browser, like its predecessor, Windows 10, and Microsoft Teams is integrated into the Windows shell. Microsoft also announced plans to allow more flexibility in software that can be distributed via the Microsoft Store and to support Android apps on Windows 11 (including a partnership with Amazon to make its app store available for the function).
Citing security considerations, the system requirements for Windows 11 were increased over Windows 10. Microsoft only officially supports the operating system on devices using an eighth-generation Intel Core CPU or newer (with some minor exceptions), a second-generation AMD Ryzen CPU or newer, or a Qualcomm Snapdragon 850 ARM system-on-chip or newer, with UEFI and Trusted Platform Module (TPM) 2.0 supported and enabled (although Microsoft may provide exceptions to the TPM 2.0 requirement for OEMs). While the OS can be installed on unsupported processors, Microsoft does not guarantee the availability of updates. Windows 11 removed support for 32-bit x86 and 32-bit ARM CPUs and devices that use BIOS firmware.
Windows 11 has received a mostly positive reception. Pre-release coverage of the operating system focused on its stricter hardware require |
https://en.wikipedia.org/wiki/Antimicrobial%20nanotechnology | Antimicrobial nanotechnology is the study of using biofilms to disrupt a microbe's cell membrane, deliver an electric charge to the microbe, and cause immediate cellular death via a "mechanical kill" process, preventing the original microbe from mutating into a superbug. The biofilms are made up of long atomic chains that can breach the cell wall. These spikes are roughly the size of a human hair and are far too small to injure large cells in mammals. These atom chains have a significant positive charge that attracts bacteria that are negatively charged. A new class of antimicrobial has been created by applying nanotechnology to the challenge of superbugs and multiple drug resistance organisms.
Problem statement
According to a report published in the Archives of Internal Medicine on 22 February 2010, health care–associated infections affect 1.7 million hospitalizations per year.
The most prevalent nosocomial infections can live or stay on surfaces for months, posing a continuing transmission risk. On dry surfaces, most gram-positive bacteria, including Enterococcus spp. (including VRE), Staphylococcus aureus (including MRSA), and Streptococcus pyogenes, can persist for months.
VRE has been cultured from frequently touched objects and has been found to survive on surfaces for more than three days. Dried cotton fabrics have been shown to support Enterococci that is resistant to vancomycin for up to 18 hours and fungi for more than five days.
Nanotechnology antimicrobials are promising because they limit the spread of bacteria by lowering the number of infection agents at frequent contact points (doorknobs, rails, tables, etc.). These new treatments have been certified by the Environmental Protection Agency and are being considered for use in hospitals and other settings where community-acquired illnesses spread quickly, such as cruise ships and jails. Environmental measures and adequate antibiotic use are the first steps in preventing the emergence of superbugs. |
https://en.wikipedia.org/wiki/Sparse%20polynomial | In mathematics, a sparse polynomial (also lacunary polynomial or fewnomial) is a polynomial that has far fewer terms than its degree and number of variables would suggest. For example, is a sparse polynomial as it is a trinomial with a degree of 10.
The motivation for studying sparse polynomials is to concentrate on the structure of a polynomial's monomials instead of its degree, as one can see, for instance, by comparing Bernstein-Kushnirenko theorem with Bezout's theorem. Research on sparse polynomials has also included work on algorithms whose running time grows as a function of the number of terms rather than on the degree, for problems including polynomial multiplication, division, root-finding algorithms, and polynomial greatest common divisors. Sparse polynomials have also been used in pure mathematics, especially in the study of Galois groups, because it has been easier to determine the Galois groups of certain families of sparse polynomials than it is for other polynomials.
The algebraic varieties determined by sparse polynomials have a simple structure, which is also reflected in the structure of the solutions of certain related differential equations. Additionally, a sparse positivstellensatz exists for univariate sparse polynomials. It states that the non-negativity of a polynomial can be certified by sos polynomials whose degree only depends on the number of monomials of the polynomial.
Sparse polynomials oftentimes come up in sum or difference of powers equations. The sum of two cubes states that . , here, is a sparse polynomial.
References
See also
Askold Khovanskii, one of the main contributors to the theory of fewnomials.
Polynomials |
https://en.wikipedia.org/wiki/Selene%20%28supercomputer%29 | Selene is a supercomputer developed by Nvidia, capable of achieving 63.460 petaflops, ranking as the fifth fastest supercomputer in the world, when it entered the list. Selene is based on the Nvidia DGX system consisting of AMD CPUs, Nvidia A100 GPUs, and Mellanox HDDR networking. Selene is based on the Nvidia DGX Superpod, which is a high performance turnkey supercomputer solution provided by Nvidia using DGX hardware. DGX Superpod is a tightly integrated system that combines high performance DGX compute nodes with fast storage and high bandwidth networking. It aims to provide a turnkey solution to high-demand machine learning workloads. Selene was built in three months and is the fastest industrial system in the US while being the second-most energy-efficient supercomputing system ever.
Selene utilizing 1080 AMD Epyc CPUs and 4320 A100 GPUs is used to train BERT, the natural language processor, in less than 16 seconds, which usually takes most smaller systems about 20 minutes to execute. IEEE Spectrum reported that as per December 2021 among all the commercially available supercomputing systems Selene topped all the results of MLPerf benchmark, which is the benchmark developed by the consortium of artificial intelligence developers from academia, research labs, and industry aiming to unbiasedly evaluate the training and inference performance for hardware, software, and services used for AI.
Selene is deployed by the Argonne National Laboratory to research different ways to end the coronavirus. It has been used to tackle problems around the concepts of protein docking and quantum chemistry, which are vital to developing an understanding of the coronavirus and a potential cure for it.
Nvidia used Selene to train its GauGAN2 AI model, which is used in Nvidia Canvas software to create art using artificial intelligence, using 10 million landscape images for training. GauGAN2 AI model uses segmentation mapping, inpainting, and text-to-image generation in a single mod |
https://en.wikipedia.org/wiki/Imperial%20College%20Computing%20Engine | ICCE I and ICCE II were digital computers built at the Imperial College Department of Mathematics in the post-war period.
Computing engines
ICCE I
The first Imperial College Computing Engine, ICCE I, was constructed by Sidney Michaelson, Tony Brooker and Keith Tocher in the Department of Mathematics at Imperial College London in the late 1940s and early 1950s. It was a relay based machine which gave relatively slow but highly reliable service. Its current whereabouts is unknown.
ICCE II
ICCE II was constructed by Sidney Michaelson, Keith Tocher and Manny Lehman in the early 1950s. This valve based machine was never completed. ICCE II was taken by Keith Tocher to British Steel. Its current whereabouts is unknown.
Influence on other machines
ICCE I and II influenced the design of SABRAC, the second computer constructed in Israel by The Israeli MoD Scientific Department.
Project termination
In 1956/7, the project was forcibly terminated. Staff dispersed. In 1951 Tony Brooker had left to join the Computing Machine Laboratory at the University of Manchester. Keith Tocher took ICCE II and went to work at British Steel, Sidney Michaelson went to the University of Edinburgh and founded the Computer Unit which subsequently became the Department of Computer Science, now the school of informatics. Manny Lehman ultimately joined the Israeli MoD Scientific Department which subsequently became Rafael.
See also
Wilks MV and Stringer LJB, Micro-Programming and the Design of the Control Circuits in an Electronic Computer, Proc. Camb. Phil. Soc., vol 49, no. 2, 1953
Tocher KD, Classification and Design of Operation Codes for Automatic Computers, Proc. IEE, 103B, Supplement 1, Apr. 1956
Tocher KD and Lehman MM, A Fast Parallel Arithmetic Unit, Proc. IEE 103B, Supplement 3, Apr. 1956, pp. 520 - 527
Lehman MM, Parallel Arithmetic Units and Their Control, PhD Thesis, University of London, Feb. 1957, 160pps.+
Lehman MM, Short-Cut Multiplication and Division in Automati |
https://en.wikipedia.org/wiki/Coordination%20sequence | In crystallography and the theory of infinite vertex-transitive graphs, the coordination sequence of a vertex is an integer sequence that counts how many vertices are at each possible distance from . That is, it is a sequence
where each is the number of vertices that are steps away from . If the graph is vertex-transitive, then the sequence is an invariant of the graph that does not depend on the specific choice of . Coordination sequences can also be defined for sphere packings, by using either the contact graph of the spheres or the Delaunay triangulation of their centers, but these two choices may give rise to different sequences.
As an example, in a square grid, for each positive integer , there are grid points that are steps away from the origin. Therefore, the coordination sequence of the square grid is the sequence
in which, except for the initial value of one, each number is a multiple of four.
The concept was proposed by Georg O. Brunner and Fritz Laves and later developed by Michael O'Keefe. The coordination sequences of many low-dimensional lattices and uniform tilings are known.
The coordination sequences of periodic structures are known to be quasi-polynomial.
References
Crystallography
Infinite graphs
Integer sequences |
https://en.wikipedia.org/wiki/Redheffer%20star%20product | In mathematics, the Redheffer star product is a binary operation on linear operators that arises in connection to solving coupled systems of linear equations. It was introduced by Raymond Redheffer in 1959, and has subsequently been widely adopted in computational methods for scattering matrices. Given two scattering matrices from different linear scatterers, the Redheffer star product yields the combined scattering matrix produced when some or all of the output channels of one scatterer are connected to inputs of another scatterer.
Definition
Suppose are the block matrices
and
,
whose blocks have the same shape when
.
The Redheffer star product is then defined by:
,
assuming that are invertible,
where is an identity matrix conformable
to or , respectively.
This can be rewritten several ways making use of the so-called
push-through identity
.
Redheffer's definition extends beyond matrices to
linear operators on a Hilbert space .
.
By definition, are linear endomorphisms of ,
making linear endomorphisms of ,
where is the direct sum.
However, the star product still makes sense as long as the transformations are compatible,
which is possible when
and
so that .
Properties
Existence
exists if and only if
exists.
Thus when either exists, so does the Redheffer star product.
Identity
The star identity is the identity on ,
or .
Associativity
The star product is associative, provided all of the relevant matrices are defined.
Thus .
Adjoint
Provided either side exists, the adjoint of a Redheffer
star product is .
Inverse
If is the left matrix inverse of such that
, has a right inverse, and
exists, then .
Similarly, if is the left matrix inverse of such
that , has a right inverse, and
exists, then .
Also, if and has a left inverse
then .
The star inverse equals the matrix inverse and both can be computed with
block inversion as
.
Derivation from a linear system
The star product arises from solving multiple linear systems of equa |
https://en.wikipedia.org/wiki/Pearl.com | Pearl.com is an "online paid question-and-answer service" based in San Francisco. "People aren't always willing to wait" in "legal, medical and other advice" led to "a growing number of those help-seekers are getting their guidance online."
History
Pearl.com began in 2003 as JustAnswer. Founder Andy Kurtzig had previously begun (and subsequently sold) a software company automating newspaper classifieds called Anser, a pun on his mother's ASK Group's name. The time period from attempting to obtaining funding until attaining significant revenue was described as "unusually long:" nine years. Once up and running, their offerings included traditionally high-priced fields such as law and medicine, but also "assistance from computer technicians and relationship counselors." By 2014, based on "the regulatory landscape involved" Pearl undertook to "overhaul" their expert teams.
Controversy
Regarding providing legal advice for "$30 to $40" and glossing over "details that could more easily emerge face to face" founder Andy Kurtzig conceded that an in-person followup may be needed. He said to The Wall Street Journal his service enables "to get key insights that will cut your appointment time from three hours to less than an hour.”
References
History of software |
https://en.wikipedia.org/wiki/The%20Equidistribution%20of%20Lattice%20Shapes%20of%20Rings%20of%20Integers%20of%20Cubic%2C%20Quartic%2C%20and%20Quintic%20Number%20Fields | The Equidistribution of Lattice Shapes of Rings of Integers of Cubic, Quartic, and Quintic Number Fields: An Artist's Rendering is a mathematics book by Piper Harron (also known as Piper H), based on her Princeton University doctoral thesis of the same title. It has been described as "feminist", "unique", "honest", "generous", and "refreshing".
Thesis and reception
Harron was advised by Fields Medalist Manjul Bhargava, and her thesis deals with the properties of number fields, specifically the shape of their rings of integers. Harron and Bhargava showed that, viewed as a lattice in real vector space, the ring of integers of a random number field does not have any special symmetries. Rather than simply presenting the proof, Harron intended for the thesis and book to explain both the mathematics and the process (and struggle) that was required to reach this result.
The writing is accessible and informal, and the book features sections targeting three different audiences: laypeople, people with general mathematical knowledge, and experts in number theory. Harron intentionally departs from the typical academic format as she is writing for a community of mathematicians who "do not feel that they are encouraged to be themselves". Unusually for a mathematics thesis, Harron intersperses her rigorous analysis and proofs with cartoons, poetry, pop-culture references, and humorous diagrams. Science writer Evelyn Lamb, in Scientific American, expresses admiration for Harron for explaining the process behind the mathematics in a way that is accessible to non-mathematicians, especially "because as a woman of color, she could pay a higher price for doing it." Mathematician Philp Ording calls her approach to communicating mathematical abstractions "generous".
Her thesis went viral in late 2015, especially within the mathematical community, in part because of the prologue which begins by stating that "respected research math is dominated by men of a certain attitude". Harron had |
https://en.wikipedia.org/wiki/Doris%20Carver | Doris Loveday Carver (born 1946) is an American computer scientist and software engineer at Louisiana State University, where she is Dow Chemical Distinguished Professor of Computer Science and Engineering, and director of the Software Engineering Laboratory. She is the former president of the IEEE Computer Society and editor-in-chief of IEEE Computer.
Education and career
Carver is a graduate of Carson–Newman College. She earned a master's degree in mathematics at the University of Tennessee in 1969, and entered doctoral study at Texas A&M University in the late 1970s, initially in mathematics, but quickly switching to computer science after taking a course in the subject. She completed her Ph.D. in computer science there in 1981, with the dissertation The effects of complexity on COBOL program changes.
After completing her doctorate, she joined the faculty at Southeastern Louisiana University before moving to Louisiana State University in 1986. At Louisiana State, she has been Interim Dean of the Graduate School, Senior Associate Vice Chancellor of Research and Economic Development, and Interim Vice Chancellor of Research and Economic Development. She has also gone on leave from her faculty position to work as a program officer for the National Science Foundation.
She was president of the IEEE Computer Society in 1998, and later became editor-in-chief of IEEE Computer.
Recognition
Carver was named a Fellow of the IEEE in 1998, "for contributions to the field of software engineering". She became a Fellow of the American Association for the Advancement of Science in 2002. In 2004, the IEEE Computer Society gave her their Richard E. Merwin Award for Distinguished Service.
References
External links
Home page
1946 births
Living people
American computer scientists
American women computer scientists
American software engineers
Software engineering researchers
Carson–Newman University alumni
University of Tennessee alumni
Texas A&M University alumni
Southeastern Lo |
https://en.wikipedia.org/wiki/Spotify%20Live | Spotify Live, formerly Spotify Greenroom, was a social audio app from Spotify, which allowed the user to host or participate in a live-audio virtual environment called room for conversation. The capacity of a room was limited to 1000 people. The app was available for Android and iOS. It rivaled Twitter Spaces and Clubhouse that belonged to the same social media segment. The app was shut down on the 30th of April 2023.
History
In October 2020, Betty Labs released Locker Room exclusively for iOS app store. The app featured virtual audio chat rooms for sportsmen and fans. Later in late March 2021 Spotify acquired Betty Labs for 50 millions and announced plans to rebrand the app with a wider emphasis on sports, music and pop culture. On June 16, 2021, Spotify released the app as Spotify Green room on Android (early access) and iOS. This time, the application is no longer limited to sports.
At launch, the Spotify Greenroom Creator Fund was created to fund creators and shows. It's a rival to Clubhouse's Creator First Accelerator Program. The fund is meant to provide a monetization path for podcasters who integrate Greenroom into their verified Spotify accounts.
As of July 2021, the app had over 140,000 iOS installs and 100,000 Android installs.
In August 2021, Spotify partnered with the WWE to create professional wrestling-related podcasts. Many of these will be recorded by The Ringer, Spotify's in-house podcasting team, using Greenroom.
In March 2022, Spotify Greenroom announced it would be rebranding as Spotify Live and moving to the main Spotify app.
Spotify announced it would shut down the Spotify Live app at the end of April 2023.
Features
Greenroom enabled the user to create or join a room. In terms of the application, a room was a virtual place where people could voice chat in real-time. The user was only permitted to create a room under a group. The groups were pre-defined by the application and represented either a brand or a generic category as its name |
https://en.wikipedia.org/wiki/Zden%C4%9Bk%20Hedrl%C3%ADn | Zdeněk Hedrlín (1933 – April 22, 2018) was a Czech mathematician, specializing in universal algebra and combinatorial theory, both in pure and applied mathematics.
Zdeněk Hedrlín received his PhD from Prague's Charles University in 1963. His thesis on commutative semigroups was supervised by Miroslav Katětov. Hedrlín held the title of Docent (associated professor) at Charles University. There he worked at the Faculty of Mathematics and Physics for over 60 years until he died at age 85. He was among the first Czech mathematicians to do research on category theory.
In 1970 Hedrlín was an Invited Speaker at the International Congress of Mathematicians in Nice. In the later part of his career, he focused on applications of relational structures and led very successful special and interdisciplinary seminars. Applications to biological cell behavior earned him and his students a European grant. (He and his students worked on computational cell models of cancer.)
Hedrlín was a member of the editorial board of the Journal of Pure and Applied Algebra. His Erdős number is 1. His doctoral students include Vojtěch Rödl.
Selected publication
(over 160 citations)
References
20th-century Czech mathematicians
21st-century Czech mathematicians
Czech mathematicians
Category theorists
Combinatorialists
Charles University alumni
Academic staff of Charles University
1933 births
2018 deaths |
https://en.wikipedia.org/wiki/Reverb%20effect | A reverb effect, or reverb, is an audio effect applied to a sound signal to simulate reverberation. It may be created through physical means, such as echo chambers, or electronically through audio signal processing.
The American producer Bill Putnam is credited for the first artistic use of artificial reverb in music, on the 1947 song "Peg o' My Heart" by the Harmonicats. Spring reverb, created with a series of mounted springs, is popular in surf music and dub reggae. Shimmer reverb, which alters the pitch of the reverberated sound, is often used in ambient music. Gated reverb became a staple of 1980s pop music, used by drummers including Phil Collins.
Varieties
Echo chambers
The first reverb effects, introduced in the 1930s, were created by playing recordings through loudspeakers in reverberating spaces and recording the sound. The American producer Bill Putnam is credited for the first artistic use of artificial reverb in music, on the 1947 song "Peg o' My Heart" by the Harmonicats. Putnam placed a microphone and loudspeaker in the studio bathroom to create an echo chamber, adding an "eerie dimension".
Plate reverb
A plate reverb system uses an electromechanical transducer, similar to the driver in a loudspeaker, to create vibrations in a large plate of sheet metal. The plate's motion is picked up by one or more contact microphones whose output is an audio signal which may be added to the original "dry" signal. Plate reverb was introduced in the late 1950s by Elektromesstechnik with the EMT 140.
Spring reverb
Spring reverbs, introduced by Bell Labs, use a set of springs mounted inside a box. They work similarly to plate reverb, with a transducer and pickup placed at either end of the spring. They were popular in the 1960s, and were first used by the Hammond company to add reverb to Hammond organs. They became popular with guitarists, including surf musicians such as Dick Dale, as they could easily be built into guitar amplifiers. They were also used by |
https://en.wikipedia.org/wiki/Blooming%20%28geometry%29 | In the geometry of convex polyhedra, blooming or continuous blooming is a continuous three-dimensional motion of the surface of the polyhedron, cut to form a polyhedral net, from the polyhedron into a flat and non-self-overlapping placement of the net in a plane. As in rigid origami, the polygons of the net must remain individually flat throughout the motion, and are not allowed to intersect or cross through each other. A blooming, reversed to go from the flat net to a polyhedron, can be thought of intuitively as a way to fold the polyhedron from a paper net without bending the paper except at its designated creases.
An early work on blooming by Biedl, Lubiw, and Sun from 1999 showed that some nets for non-convex but topologically spherical polyhedra have no blooming.
The question of whether every convex polyhedron admits a net with a blooming was posed by Robert Connelly, and came to be known as Connelly’s blooming conjecture. More specifically, Miller and Pak suggested in 2003 that the source unfolding, a net that cuts the polyhedral surface at points with more than one shortest geodesic to a designated source point (including cuts across faces of the polyhedron), always has a blooming. This was proven in 2009 by Demaine et al., who showed in addition that every convex polyhedral net whose polygons are connected in a single path has a blooming, and that every net can be refined to a path-connected net. It is unknown whether every net of a convex polyhedron has a blooming, and Miller and Pak were unwilling to make a conjecture in either direction on this question.
Because it is unknown whether every convex polyhedron has a net that cuts only edges of the polyhedron, and not across its faces ("Dürer's conjecture"), it is also unknown whether every convex polyhedron has a blooming that cuts only edges. In an unpublished manuscript from 2009, Igor Pak and Rom Pinchasi have claimed that this is indeed possible for every Archimedean solid.
The problem of finding a |
https://en.wikipedia.org/wiki/MERMOZ | MERMOZ (also, MERMOZ project and Monitoring planEtary suRfaces with Modern pOlarimetric characteriZation) is an astrobiology project designed to remotely detect biosignatures of life. Detection is based on molecular homochirality, a characteristic property of the biochemicals of life. The aim of the project is to remotely identify and characterize life on the planet Earth from space, and to extend this technology to other solar system bodies and exoplanets. The project began in 2018, and is a collaboration of the University of Bern, University of Leiden and Delft University of Technology.
According to a member of the research team, “When light is reflected by biological matter, a part of the light’s electromagnetic waves will travel in either clockwise or counterclockwise spirals ... This phenomenon is called circular polarization and is caused by the biological matter’s homochirality.” These unique spirals of light indicate living materials; whereas, non-living materials do not reflect such unique spirals of light, according to the researchers.
The research team conducted feasibility studies, using a newly designed detection instrument, based on circular spectropolarimetry, and named FlyPol+ (an upgrade from the original FlyPol), by flying in a helicopter at an altitude of and velocity of for 25 minutes. The results were successful in remotely detecting living material, and quickly (within seconds) distinguishing living material from non-living material. The researchers concluded: "Circular spectropolarimetry can be a powerful technique to detect life beyond Earth, and we emphasize the potential of utilizing circular spectropolarimetry as a remote sensing tool to characterize and monitor in detail the vegetation physiology and terrain features of Earth itself."
The researchers next expect to scan the Earth from the International Space Station (ISS) with their detection instruments. One consequence of further successful studies is a possible pathfinder space m |
https://en.wikipedia.org/wiki/Condensed%20mathematics | Condensed mathematics is a theory developed by and Peter Scholze which aims to unify various mathematical subfields, including topology, complex geometry, and algebraic geometry.
Idea
The fundamental idea in the development of the theory is given by replacing topological spaces by condensed sets, defined below. The category of condensed sets, as well as related categories such as that of condensed abelian groups, are much better behaved than the category of topological spaces. In particular, unlike the category of topological abelian groups, the category of condensed abelian groups is an abelian category, which allows for the use of tools from homological algebra in the study of those structures.
The framework of condensed mathematics turns out to be general enough that considering various “spaces" with sheaves valued in condensed algebras, one is able to incorporate both algebraic geometry, p-adic analytic geometry and complex analytic geometry.
Definition
A condensed set is a sheaf of sets on the site of profinite sets, with the Grothendieck topology given by finite, jointly surjective collections of maps. Similarly, a condensed group, condensed ring, etc. is defined as a sheaf of groups, rings etc. on this site.
To any topological space one can associate a condensed set, customarily denoted , which to any profinite set associates the set of continuous maps . If is a topological group or ring, then is a condensed group or ring.
History
In 2013, Bhargav Bhatt and Peter Scholze introduced a general notion of pro-étale site associated to an arbitrary scheme. In 2018, together with Dustin Clausen they arrived at the conclusion that already the pro-étale site of a single point, which is isomorphic to the site of profinite sets introduced above, has rich enough structure to realize large classes of topological spaces as sheaves on it. Further developments have led to a theory of condensed sets and solid abelian groups, through which one is able to incorp |
https://en.wikipedia.org/wiki/List%20of%20plant%20family%20names%20with%20etymologies | Since the first edition of Carl Linnaeus's Species Plantarum in 1753, plants have been assigned one epithet or name for their species and one name for their genus, a grouping of related species. Related are in turn grouped into families. Each family's formal name ends in the Latin suffix -aceae and is derived from the name of a genus that is or once was part of the family.
The table below contains seed-bearing families from Plants of the World by Maarten J. M. Christenhusz (lead author), Michael F. Fay and Mark W. Chase, with two updated families from Plants of the World Online. The second column gives the family's original type genus, unless that name is no longer accepted in taxonomic databases. The fourth column gives an associated meaning, derivation or person.
Key
LG: derived from a Greek word (G), a Latin word (L), another language (–), or a personal name (P)
Ba: listed in Ross Bayton's The Gardener's Botanical
Bu: listed in Lotte Burkhardt's Index of Eponymic Plant Names
CS: listed in both Allen Coombes's The A to Z of Plant Names and William T. Stearn's Stearn's Dictionary of Plant Names for Gardeners
Gl: listed in David Gledhill's The Names of Plants
Qu: listed in Umberto Quattrocchi's four-volume CRC World Dictionary of Plant Names
St: listed in Stearn's Dictionary of Plant Names for Gardeners
Linked numerical citations in the last column refer to Plants of the World.
Except for Plants of the World, these books list genera alphabetically. "Latin plant name" or "Greek plant name" in the fourth column means that the name appears in Classical Latin or Greek or both for some plant, not necessarily the plant listed here.
Families
See also
Glossary of botanical terms
List of Greek and Latin roots in English
List of Latin and Greek words commonly used in systematic names
List of plant genera named for people: A–C, D–J, K–P, Q–Z
List of plant genus names with etymologies: A–C, D–K, L–P, Q–Z
Notes
Citations
References
See http://creativecommons |
https://en.wikipedia.org/wiki/Stacks%20blockchain | Stacks, formerly Blockstack, is a blockchain platform for smart contracts, decentralized finance ("DeFi"), NFTs, and decentralized apps ("DApps"). Stacks blockchain is a layer for bitcoin similar to the Lightning Network.
Design
Concerns around internet privacy, security, and data breaches brought attention to the Stacks project. Software developers have used the Stacks software to build decentralized alternatives to popular services. Stacks (STX) token is the native cryptocurrency of the Stacks blockchain, which is used as gas fee for executing smart contracts and processing transactions.
History
Stacks project was originally started by Muneeb Ali and Ryan Shea as Blockstack. STX became the first SEC qualified token offering in 2019. Blockstack PBC, a company working on the Stacks technology, raised around $75 million through a mix of venture capital and token sales. The main Stacks blockchain launched in Jan 2021.
Applications
Blockchain Naming System (BNS)
The Blockchain Naming System is an application used to register human-readable, globally unique names with accounts on the Stacks blockchain. A BNS name consists of a namespace, the name and optionally a subdomain. Examples are muneeb.id, muneeb.btc and muneeb.id.blockstack.
CityCoins
In 2021, the CityCoins project launched fungible tokens for the cities of Miami and New York City. In September 2021, Miami's city commissioners voted to accept the protocol treasury, valued at $21 million at the time. MiamiCoin's value crashed, and so Stacks donated $5.25M to the City of Miami.
As of March 2023, Bloomberg was reporting that CityCoin was facing a "quiet demise" as liquidity issues and a lack of interest caused both the New York City and Miami coins to be delisted from the OkCoin cryptocurrency exchange.
References
Blockchains
Computing platforms
Cryptocurrencies |
https://en.wikipedia.org/wiki/Slide%20rule%20scale | A slide rule scale is a line with graduated markings inscribed along the length of a slide rule used for mathematical calculations. The earliest such device had a single logarithmic scale for performing multiplication and division but soon an improved technique was developed which involved two such scales sliding alongside each other – hence the name slide rule (colloquially called a slipstick in the United States). Later, multiple scales were provided with the most basic being logarithmic but with others graduated according to the mathematical function required.
Few slide rules have been designed for addition and subtraction, rather the main scales are used for multiplication and division and the other scales are for mathematical calculations involving trigonometric, exponential and, generally, transcendental functions. Before they were superseded by electronic calculators in the 1970s slide rules were an important type of portable calculating instrument.
Slide rule design
A slide rule consists of a body and a slider that can be slid along within the body and both these have numerical scales inscribed on them. On duplex rules the body and/or the slider have scales on the back as well as the front. The slider's scales may be visible from the back or the slider may need to be slid right out and replaced facing the other way round. A cursor (also called runner or glass) containing one (or more) hairlines may be slid along the whole rule so that corresponding readings, front and back, can be taken from the various scales on the body and slider.
In about 1620 Edmund Gunter introduced what is now known as Gunter's line as one element of the Gunter's sector he invented for mariners. The line, inscribed on wood, was a single logarithmic scale going from 1 to 100. It had no sliding parts but by using a pair of dividers it was possible to multiply and divide numbers. The form with a single logarithmic scale eventually developed into such instruments as Fuller's cylindri |
https://en.wikipedia.org/wiki/RDNA%203 | RDNA 3 is a GPU microarchitecture designed by AMD, released with the Radeon RX 7000 series on December 13, 2022. Alongside powering the RX 7000 series, RDNA 3 is also featured in the SoCs designed by AMD for the Asus ROG Ally and Legion Go consoles.
Background
On June 9, 2022, AMD held their Financial Analyst Day where they presented a client GPU roadmap which contained mention of RDNA 3 coming in 2022 and RDNA 4 coming in 2024. AMD announced to investors their intention to achieve a performance-per-watt uplift of over 50% with RDNA 3 and that the upcoming architecture would be built using chiplet packaging on a 5 nm process.
A sneak preview for RDNA 3 was included towards the end of AMD's Ryzen 7000 unveiling event on August 29, 2022. The preview included RDNA 3 running gameplay of Lies of P, AMD CEO Lisa Su confirming that a chiplet design would be used, and a partial look at AMD's reference design for an RDNA 3 GPU.
Full details for the RDNA 3 architecture were unveiled on November 3, 2022 at an event in Las Vegas.
Architectural details
Chiplet packaging
For the first time ever in a consumer GPU, RDNA 3 utilizes modular chiplets. AMD previously had great success with its use of chiplets in its Ryzen desktop and Epyc server processors.
The decision to move to a chiplet-based GPU microarchitecture was led by AMD Senior Vice President Sam Naffziger who had also lead the chiplet initiative with Ryzen and Epyc. The development of RDNA 3's chiplet architecture began towards the end of 2017 with Naffziger leading the AMD graphics team in the effort.
Memory Cache Dies (MCDs)
With a respective 2.05 billion transistors, each Memory Cache Die (MCD) contains large blocks of L3 cache and two physical 32-bit GDDR6 memory interfaces for a combined 64-bit interface per MCD. The Radeon RX 7900 XTX has a 384-bit memory bus through the use of six MCDs while the RX 7900 XT has a 320-bit bus due to its five MCDs.
Chiplet interconnects
The chiplet interconnects have a band |
https://en.wikipedia.org/wiki/Interference%20freedom | In computer science, interference freedom is a technique for proving partial correctness of
concurrent programs with shared variables. Hoare logic had been introduced earlier
to prove correctness of sequential programs. In her PhD thesis (and papers arising from it ) under advisor David Gries, Susan Owicki
extended this work to apply to concurrent programs.
Concurrent programming had been in use since the mid 1960s for coding operating systems as sets
of concurrent processes (see, in particular, Dijkstra.), but there was no
formal mechanism for proving correctness. Reasoning about interleaved execution
sequences of the individual processes was difficult, was error prone,
and didn't scale up. Interference freedom
applies to proofs instead of execution sequences;
one shows that execution of one process cannot interfere with the correctness
proof of another process.
A range of intricate concurrent programs have been proved correct using interference
freedom, and interference freedom provides the basis for much of the ensuing work on
developing concurrent programs with shared variables and proving them correct.
The Owicki-Gries paper An axiomatic proof technique for parallel programs I
received the 1977 ACM Award for best paper in programming languages and
systems.
Note. Lamport
presents a similar idea. He writes, "After writing the
initial version of this paper, we learned of the recent work of
Owicki."
His paper has not received as much attention as Owicki-Gries, perhaps because it used
flow charts instead of the text of programming constructs like the if statement and while loop.
Lamport was generalizing Floyd's method while Owicki-Gries was generalizing
Hoare's method.
Essentially all later work in this area uses text and not flow charts.
Another difference is mentioned below in the
section on Auxiliary variables.
Dijkstra's Principle of non-interference
Edsger W. Dijkstra introduced the principle of non-interference in EWD 117,
"Programming Considered |
https://en.wikipedia.org/wiki/Institution%20of%20Diploma%20Engineers%2C%20Bangladesh | Institution of Diploma Engineers, Bangladesh, widely known as IDEB is a professional organization for Diploma Engineers & Diploma in Architect of Bangladesh, that established on 8 November 1970. The aim is to make a union among diploma engineers and serve as the engineering community.
IDEB is a multidisciplinary organization of engineering societies which dedicated for advancing the knowledge, understanding and practice of engineering sector. To formulate the overall policy of Institution, it has a national council consisting 500 members. IDEB has also 11 member advisory council.
Membership
Diploma Engineer and / or a person having post Matriculation or Post Secondary School Certificate (SSC) with 3 or 4 years of schooling on Engineering and Technology and on successful completion be awarded a Diploma in Engineering by any University or Education Board of UK, USA, India, Pakistan and Bangladesh and/or as recognized by the Government of Bangladesh is eligible for membership of IDEB. IDEB offered six category membership i.e. Student Member, General Member, Fellow Member, Life Member, Donor Member and Honorary Member.
General Member
Any person passed Diploma in Engineering from Bangladesh Govt. recognized educational institute and obtained certificate from Bangladesh Technical Education Board (BTTB) is eligible for the membership of this institution. But he/she has to apply in the prescribed from of the Institute for the membership and be awarded with Membership Certificate.
Student Member
All students of the Diploma-in Engineering course in Polytechnic and Technical Institute and their equivalents shall be eligible to become student member of the Institution subject to be conditions as prescribed in constitution or as may decided by the Central Executive Committee from time to time.
Life Member
Any member shall be entitled to be life member subscribing an amount of Tk. 10,000/- (Ten Thousand) to the IDEB Fund at a time.
Fellow Member
Any member completed 2 |
https://en.wikipedia.org/wiki/Jaak%20Peetre | Jaak Peetre (29 July 1935, Tallinn – 1 April 2019, Lund) was an Estonian-born Swedish mathematician. He is known for the Peetre theorem and Peetre's inequality.
Biography
Jaak Peetre's father was Arthur Peetre (1907–1989), an Estonian jurist, historian, archivist, and from 1941 to 1942 mayor of Pärnu. Jaak Peetre went to Sweden with his parents and brother in 1944. At Lund University he graduated with BSc in 1956 and PhD in 1959. His thesis advisor was Åke Pleijel. At Lund University, Peetre was an assistant professor from 1956 to 1959, an associate professor from 1960 to 1963, and full professor from 1963 to 1988. He was briefly in 1988 a visiting professor at the University of Madrid and was from 1988 to 1992 a visiting professor at Stockholm University. At Lund University he was a lecturer from 1993 to 1997, an assistant professor from 1997 to 2000, and professor emeritus from 2000. He was also a visiting professor at New York University for the academic year 1960–1961 and at University of Maryland for the academic year 1961–1962.
Peetre's research deals with ordinary and partial derivative differential equations, operator interpolation spaces, singular integrals and Besov spaces, differential geometry, Clifford analysis, Fock space and Hankel operators, Fourier and harmonic analysis. Bernard Malgrange, Jacques-Louis Lions, and Peetre were pioneers of modern interpolation theory. In the early 1990s, Peetre's research focused on multilinear forms, especially trilinear forms. He was the author or coauthor of more than 230 research papers. He was the thesis advisor for 8 doctoral students. In 1970 he was an Invited Speaker at the International Congress of Mathematicians in Nice. He gave lectures at more than 30 international mathematical congresses and conferences and in many cases was among the organizers. He was a member of the editorial boards of several international mathematical journals.
In 1984 he was elected a member of the Swedish Royal Academy of Scienc |
https://en.wikipedia.org/wiki/List%20of%20features%20removed%20in%20Windows%2011 | Windows 11 is the latest major release of the Windows NT operating system and the successor of Windows 10. Some features of the operating system were removed in comparison to Windows 10, and further changes in older features have occurred within subsequent feature updates to Windows 11. Following is a list of these.
Features removed in version 21H2: (RTM)
Bundled software
No longer available
The following applications are no longer bundled with Windows 11 and no longer available.
Internet Explorer (still can be opened using Internet Options in Control Panel)
Wallet
Not bundled, but available
The following applications are no longer bundled with Windows 11, but can still be installed from the Microsoft Store.
3D Viewer
OneNote for Windows 10
Paint 3D
Skype
Windows shell
The following parts of the Windows shell are no longer available in Windows 11.
Lock Screen's quick status
Tablet mode
The Timeline feature in Task View
The Save Search option in File Explorer
In addition:
The touch keyboard no longer docks in screens larger than 18 inches.
Windows no longer synchronizes desktop wallpapers across devices with a Microsoft account.
Windows no longer shows a small preview of images or videos on folder thumbnails. Instead, it shows the generic folder icon for any folder containing images or videos. (This change has been reverted in February 2022 insider builds.)
Start menu
Some functionality from the Start menu was removed and replaced with other features.
Folders and groups (reinstated in February 2022 insider builds)
Live tiles (the Widgets panel provides portions of what the live tiles of Windows 10's bundled apps once provided)
Recent and pinned files on pinned apps
Taskbar
The following taskbar features are no longer available as of Windows 11:
Support for moving the taskbar to the top, left, or right of the screen
Support for changing the size of the taskbar or its icons
"Time" is not displayed in the calendar when clicking on the " |
https://en.wikipedia.org/wiki/Features%20new%20to%20Windows%2011 | Windows 11 is a major release of the Windows NT operating system and the successor to Windows 10. It introduces new features such as a redesigned interface, new productivity and social features, and updates to security and accessibility, alongside improvements to performance.
Windows shell
Fluent Design System: Updates to the Fluent Design System, a design language introduced by Microsoft in 2017, are featured in Windows 11. According to Microsoft, the design of Windows 11 is "effortless, calm, personal, familiar, complete, and coherent." The redesign focuses on simplicity, ease of use, and flexibility, addressing some of the deficiencies of Windows 10. Most interfaces in Windows 11 feature rounded geometry, refreshed iconography, new typography, and a refreshed colour palette. In addition, translucency and shadows are made more prevalent throughout the system. Windows 11 also introduces "Mica", a new opaque Material that is tinted with the color of the desktop wallpaper.
The Start menu: The Start menu has been significantly redesigned in Windows 11, adhering to the principles of the updated Fluent Design System. The menu has now been moved to the center by default, with an option to move it back to the left side. The Live Tiles feature introduced in Windows 8 is replaced by a set of pinned apps and a new cloud-powered "Recommended" section that shows recently opened files and documents from any location, including a PC, a smartphone, and OneDrive. The new Start menu also includes a search box.
Taskbar: The Taskbar has also been center-aligned, and now includes new animations for pinning, rearranging, minimizing, and switching apps on the Taskbar. The buttons can still be moved to the left-hand corner as in Windows 10.
Notification Center & Quick Settings: The Action Center from Windows 10 has been replaced by a Notification Center and a Quick Settings menu, both accessible from the lower-right corner of the Taskbar. The Notification Center contains all the u |
https://en.wikipedia.org/wiki/Global%20Commission%20on%20the%20Stability%20of%20Cyberspace | The Global Commission on the Stability of Cyberspace was a multistakeholder Internet governance organization, dedicated to the creation of diplomatic norms of governmental non-aggression in cyberspace. It operated for three years, from 2017 through 2019, and produced the diplomatic norm for which it was chartered and seven others.
Origins
Together with the Global Forum on Cyber Expertise, the GCSC was a product of the 2015-2017 Dutch chairmanship of the London Process, and particularly the work of Wouter Jurgens who, as head of the cyber security department of the Dutch Ministry of Foreign Affairs, had responsibility for organizing the 4th Global Conference on CyberSpace ministerial, which was held in The Hague April 16–17 of 2015, and formalizing its outcomes. Jurgens had been working for several years on the topic of governmental non-aggression in cyberspace, in collaboration with Uri Rosenthal, Bill Woodcock, Olaf Kolkman, James Lewis, and others who would subsequently become GCSC commissioners.
The GCSC was launched by Dutch Foreign Minister Bert Koenders at the 53rd Munich Security Conference, on February 18, 2017, with a three-year charter, and issued its final report at the Paris Peace Forum, on November 13, 2019.
Published norms
Norm to Protect the Public Core of the Internet
The Norm to Protect the Public Core is the GCSC's principal product, and has been included or referenced in many subsequent legislative and diplomatic work. It was included in the European Union's Cybersecurity Act, which extends the mandate of the European Union Agency for Cybersecurity to include the protection of the public core. The Paris Call for Trust and Security in Cyberspace included a call for compliance with the Public Core norm. The United Nations cites the Public Core norm in the 2019 report of the Secretary General and the report of the Secretary General’s High-level Panel on Digital Cooperation, The Age of Digital Interdependence.
Norm to Protect the Electoral In |
https://en.wikipedia.org/wiki/Cobham%27s%20theorem | Cobham's theorem is a theorem in combinatorics on words that has important connections with number theory, notably transcendental numbers, and automata theory. Informally, the theorem gives the condition for the members of a set S of natural numbers written in bases b1 and base b2 to be recognised by finite automata. Specifically, consider bases b1 and b2 such that they are not powers of the same integer. Cobham's theorem states that S written in bases b1 and b2 is recognised by finite automata if and only if S is a finite union of arithmetic progressions. The theorem was proved by Alan Cobham in 1969 and has since given rise to many extensions and generalisations.
Definitions
Let be an integer. The representation of a natural number in base is the sequence of digits such that
where and . The word is often denoted , or more simply, .
A set of natural numbers S is recognisable in base or more simply -recognisable or -automatic if the set of the representations of its elements in base is a language recognisable by a finite automaton on the alphabet .
Two positive integers and are multiplicatively independent if there are no non-negative integers and such that . For example, 2 and 3 are multiplicatively independent, but 8 and 16 are not since . Two integers are multiplicatively dependent if and only if they are powers of a same third integer.
Problem statements
Original problem statement
More equivalent statements of the theorem have been given. The original version by Cobham is the following: Another way to state the theorem is by using automatic sequences. Cobham himself calls them "uniform tag sequences.". The following form is found in Allouche and Shallit's book:We can show that the characteristic sequence of a set of natural numbers S recognisable by finite automata in base k is a k-automatic sequence and that conversely, for all k-automatic sequences and all integers , the set of natural numbers such that is recognisable in base .
Fo |
https://en.wikipedia.org/wiki/Minimally%20manipulated%20cells | Minimally manipulated cells are non-cultured (non-expanded) cells isolated from the biological material by its grinding, homogenization or selective collection of cells, which undergo minimal manipulation. Minimally manipulated cells are usually using for the treatment of skin ulceration, alopecia, and arthritis. Minimally manipulated cells can be used for the intraoperative creation of tissue-engineered grafts in situ.
International regulation
Minimally manipulated cells are allowed to be an object of manufacture and homologous transplantation in USA and European Countries. The criteria of "minimal manipulation" are variative in different countries. European regulations, according to the Reflection Paper on the classification of advanced therapy medicinal products of the European Medicines Agency, define "minimal manipulation" as the procedure that does not change biological characteristics and functions of cells. In particular, enzymatic digestion of biomaterial is prohibited, when cell-to-cell contacts are dissociated.
According to the US regulations (US 21 Code of Federal Regulations § 1271.3(f)(1), Section 361) human cells and tissues and tissue-based products (section 361 HCT/Ps), “minimal manipulation” is a processing that does not alter the original relevant characteristics of the structural tissue relating to the tissue’s utility for reconstruction, repair, or replacement.
Russian regulations provide no specific definition for “minimally manipulated” cells. However, it follows from the content of the Order of Russian Ministry of Health No. 1158n “On amending the list of transplantation objects”. According to the Order, cells obtained from the biomaterial by its grinding, homogenization, enzymatic treatment, removal of unwanted components or by selective collection of cells, could be considered as “minimally manipulated”. Minimally manipulated cells are allowed to be an object of transplantation, when they do not contain any other substances except for w |
https://en.wikipedia.org/wiki/Clive%20Randall | Clive A. Randall is a Distinguished Professor of Materials Science and Engineering and Director of Materials Research Institute at Pennsylvania State University. He is noted for his work on ceramics and functional materials.
He graduated with a BSc in Physics from the University of East Anglia in 1983 and a PhD in Experimental Physics from the University of Essex in 1987.
He received the Fulrath Award from the American Ceramic Society in 2002, and the Spriggs Phase Equilibria Award in 2008. He was elected a Fellow of the American Ceramic Society in 2005.
He has an h-index of 87 according to Google Scholar.
References
External links
Year of birth missing (living people)
Living people
Alumni of the University of East Anglia
Alumni of the University of Essex
Pennsylvania State University faculty
Fellows of the American Ceramic Society
British materials scientists
Nationality missing
Place of birth missing (living people)
American materials scientists |
https://en.wikipedia.org/wiki/Project%20Gyanodaya | Gyanodaya is an e-learning platform launched by Godda District Administration of Government of Jharkhand in collaboration with Eckovation and Adani Foundation. Under this program, the state government schools in the tribal areas of Jharkhand are connected with smart classroom.
History
The project was launched in 2018 to encourage students to attend schools regularly to solve the problem of absenteeism which is a major issue due to onset of monsoon.This initiative also aims to provide online education in government schools for class 6 to 12 in subjects like science and mathematics. The use of audiovisual education medium via web has resulted into achieving higher attendance.
COVID-19 Disruption
During the COVID-19 disruption in 2020 when schools were closed as a part of state's pandemic mitigating guidelines, the online classes model by Gyanodaya was broadcast on Doordarshan's DD Jharkhand channel as a part of state government’s efforts to continue education, reaching out to over 5 million students in the state.
During COVID-19 pandemic, the state government distributed 43,977 tablets via Project Gyanodaya to 38,000 state-run schools.
Awards and recognition
In June 2021, the United Nations Development Programme, India’s 'Aspirational District Programme: An Appraisal' that measures the impact of flagship programmes making defining difference to sustainable development goals, recognized the Gyanodaya platform for mitigating urban-rural divides through digital education.
See also
Project Nanhi Kali, an Indian non-governmental organisation
Khan Academy
References
Educational technology non-profits
Open educational resources
Indian educational websites
Online tutoring |
https://en.wikipedia.org/wiki/Percolation%20surface%20critical%20behavior | Percolation surface critical behavior concerns the influence of surfaces on the critical behavior of percolation.
Background
Percolation is the study of connectivity in random systems, such as electrical conductivity in random conductor/insulator systems, fluid flow in porous media, gelation in polymer systems, etc. At a critical fraction of connectivity or porosity, long-range connectivity can take place, leading to long-range flow. The point where that connectivity takes place is called the percolation threshold, and considerable amount of work has been undertaken in finding those critical values for systems of various geometries, and the mathematical behavior of observables near that point. This leads to the study of critical behavior and the percolation critical exponents. These exponents allow one to describe the behavior as the threshold is approached.
The behavior of the percolating network near a surface will be different from that in the main part of a system, called the "bulk." For example, exact at the percolation threshold, the percolating network in the system is a fractal with large voids and a ramified structure. The surface interrupts this structure, so the percolating cluster is less likely to come in contact to the surface. As an example, consider a lattice system of bond percolation (percolation along the bonds or edges of the lattice). If the lattice is cubic in nature, and is the probability that a bond is occupied (conducting), then the percolation threshold is known to be . At the surface, the lattice becomes a simple square lattice, where the bond threshold is simply 1/2. Therefore, when the bulk of the system is at its threshold, the surface is way below its threshold, and the only way to have long-range connections along the surface is to have a path that goes from the surface to the bulk, conduction through the fractal percolation network, and then a path back to the surface again. This occurs with a different critical beha |
https://en.wikipedia.org/wiki/RVT-802 | RVT-802 (allogeneic cultured postnatal thymus-derived tissue) is a medication being developed by Enzyvant Therapeutics Ireland Limited for the treatment of congenital athymia (absence of a thymus gland), especially in the context of DiGeorge syndrome.
Development history
Enzyvant licensed the technology underlying RVT-802 from Duke University in 2017. In the same year, the Food and Drug Administration granted Regenerative Medicine Advanced Therapy – the second such approval ever to be granted – status to RVT-802. In December 2019, the Food and Drug Administration raised concerns about the manufacturing of RVT-802, and declined to approve it, instead issuing a Complete Response Letter. In April 2021, Enzyvant resubmitted its Biologics License Application. It is expected that the review of RVT-802 will conclude in October 2021 (PDUFA date).
Method of action
RVT-802 is an investigational treatment for congenital athymia, primarily associated with DiGeorge syndrome. It is a tissue-based therapy that consists of cultured donor thymus-derived tissue. RVT-802 consists of donor thymus-derived tissue that is cultured and surgically implanted into the recipient
In patients with congenital athymia, the thymus gland is absent. Because of the crucial role the thymus gland plays in the maturation and differentiation of T cells, athymia results in severe immunodeficiency, typically resulting in death within the first two years of life.
RVT-802 is manufactured by extracting thymus tissue from infants undergoing cardiac surgery, depleting it of immature T cells to prevent graft-versus-host disease, then implanting the processed tissue into the recipient's leg, where it fulfils the immunological role of the thymus.
References
Immunology
Thymus
Orphan drugs |
https://en.wikipedia.org/wiki/Tejas%20Networks | Tejas Networks is an optical, broadband and data networking products company based in India. The company designs develops and sells its products to telecom service providers, internet service providers, utilities, security and government entities in 75 countries. The company has built many IPs in multiple areas of telecom networking and has emerged as an exporter to other developing countries including Southeast Asia and Africa.
History
Founded in 2000 by Sanjay Nayak with initial funding from Gururaj Deshpande. They were later joined by Kumar Sivarajan (an academic at Indian Institute of Science, Bangalore and author of a book on optical fiber) along with Arnob Roy (an ex-colleague of Nayak). Tejas Network made a beginning with the development of Intelligent Network technologies. These networks transferred data between two points at the precise speed as per the requirements of the customer. The network also rerouted and cleaned the traffic in case of disruptions During 2002–2003, the company acquired ten customers.
Tejas Networks went public on BSE and NSE in June 2017 with a valuation of Rs 2301 crore ().The organization is considered to be the first listed player in the optical networking equipment space in India by Centrum Broking analysts Alpesh Thacker and Siddhartha Khemka. The anchor investors that bet on Tejas Networks ahead of its IPO were namely Abu Dhabi Investment Authority, East Bridge Capital and PremjiInvest, the family investment arm of Wipro Ltd. In 2020, Tejas Network developed the world's largest disaggregated packet-optical switch that was called TJ1600S/I.
ICRA reported a downward shift in their rating because the revenue and profitability of the company experienced a decline in the financial year 2020. The decrease in revenue was accounted to reduced revenue from government and the international market.
On 29 July 2021, Tata Sons, through its subsidiary Panatone Finvest Limited, initiated an investment in Tejas Networks to buy a 43.35% st |
https://en.wikipedia.org/wiki/Noise%3A%20A%20Flaw%20in%20Human%20Judgment | Noise: A Flaw in Human Judgment is a nonfiction book by professors Daniel Kahneman, Olivier Sibony and Cass Sunstein. It was first published on May 18, 2021. The book concerns 'noise' in human judgment and decision-making. The authors define noise in human judgment as "undesirable variability in judgments of the same problem" and focus on the statistical properties and psychological perspectives of the issue.
Examples they give include their own finding at an insurance company that the median premiums set by underwriters independently for the same five fictive customers varied by 55%, five times as much as expected by most underwriters and their executives. Another example is that two psychiatrists who independently diagnosed 426 state hospital patients agreed on which mental illness the patient suffered from only in half of the cases and a finding that French court judges were more lenient if it happened to be the defendant's birthday.
Kahneman, Sibony and Sunstein argue that noise in human judgment is a thoroughly prevalent and insufficiently addressed problem in matters of judgment. They write that noise arises because of factors such as cognitive biases, mood, group dynamics and emotional reactions. While contrasting statistical bias to noise, they describe cognitive bias as a significant factor giving rise to both statistical bias and noise.
The authors write that noise can lead to gross injustices, unacceptable health hazards, and loss of time and wealth. They argue that organizations should be more committed to reducing noise and promote noise audits and decision hygiene as strategies to detect, measure, and prevent noise. Noise: A Flaw in Human Judgment became a The New York Times Bestseller and received generally positive reviews among critics. Common critiques against efforts to reduce noise are that such efforts dehumanize those affected by the judgments and that it can lead to discrimination. Some commentators also questioned the authors' claims about |
https://en.wikipedia.org/wiki/Sound%20archive | A sound archive, also known as an audio archive, is a collection of official records or files of sound recordings, broadcasts, or performances. Often these kind of archive consists of radio programmes.
Examples of large sound archives include the British Library Sound Archive, Internet Archive's Audio Archive, and the Australian National Film and Sound Archive.
See also
List of sound archives
References |
https://en.wikipedia.org/wiki/Standard%20Television%20Interface%20Chip | The Standard Television Interface Chip or STIC is a video encoder chip produced by General Instrument as AY-3-8900/AY-3-8900-1 and used on the Mattel Intellivision.
The chip provides all the display functions on the machine, and works as an internal timer. Resolution is 167 × 105 pixels in NTSC and 168 × 104 pixels in PAL, over which movable objects (MOBs) can be placed. These are restricted to a visible area of 159 × 96 pixels.
Other objects, such as a 20 × 12 matrix of 8×8 background cards can be used to create scenery or provide game information.
The STIC also computes collision information between the objects and screen borders.
There are multiple display modes depending on how objects are handles, such as Color Stack, Colored Squares and Foreground/Background mode.
Characteristics
operates at 4 MHz or 3.579545 MHz (NTSC)
14-bit multiplexed data/address bus shared with CPU
20×12 tiled playfield, tiles are 8×8 pixels for a resolution of 159×96 (right pixel not displayed)
16 color palette, two colors per tile
Foreground/Background mode; all 16 colors available for background and colors 1–8 available for foreground per tile; grom cards limited to the first 64
Color Stack mode; all 16 colors available for foreground per tile; background colour from a four colour rotating stack of any four colors, all 277 grom and gram cards available
Colored Squares mode allows each tile to have four different colored 4×4 blocks as in Snafu); first seven colors available for foreground blocks; background colour from the color stack
8 sprites (all visible on the same scanline). Hardware supports the following features per-sprite:
coordinate addressable off screen for smooth edge entries and exits
Size selection: 8×16 or 8 pixels wide by 8 half-pixels high
Stretching: horizontal (1× or 2×) and vertical (1×, 2×, 4× or 8×)
Mirroring: horizontal and vertical
Collision detection: sprite to sprite, sprite to background, and sprite to screen border
Priority: selects whether sprite appea |
https://en.wikipedia.org/wiki/Noisy%20intermediate-scale%20quantum%20era | The current state of quantum computing is referred to as the noisy intermediate-scale quantum (NISQ) era, characterized by quantum processors containing up to 1000 qubits which are not advanced enough yet for fault-tolerance or large enough to achieve quantum supremacy. These processors, which are sensitive to their environment (noisy) and prone to quantum decoherence, are not yet capable of continuous quantum error correction. This intermediate-scale is defined by the quantum volume, which is based on the moderate number of qubits and gate fidelity. The term NISQ was coined by John Preskill in 2018.
Algorithms
NISQ algorithms are designed for quantum processors in the NISQ era, such as the variational quantum eigensolver (VQE) and quantum approximate optimization algorithm (QAOA), which use NISQ devices but offload some calculations to classical processors. These algorithms have been successful in quantum chemistry and have potential applications in various fields including physics, materials science, data science, cryptography, biology, and finance. However, they often require error mitigation techniques to produce accurate results.
Beyond-NISQ era
The creation of a computer with tens of thousands of qubits and enough error correction would eventually end the NISQ era. These beyond-NISQ devices would be able to, for example, implement Shor's algorithm for very large numbers and break RSA encryption.
See also
Quantum supremacy
References
External links
John Preskill lecture on NISQ era
Computer architecture statements
History of computing hardware
Quantum computing
Quantum information science
Computational complexity theory |
https://en.wikipedia.org/wiki/Katalin%20Bal%C3%A1zsi | Katalin Balázsi (née Sedláčková; born 1978) is a Slovakia-born Hungarian material scientist. She is the head of the Thin Film Physics department in the Institute of Technical Physics and Materials Science, a component of the Centre for Energy Research, Eötvös Lóránd Research Network. She has also served as the President of the Association of Hungarian Women in Science (2018-2021).
Early life
Balázsi was born in Šahy (Ipolyság), Slovakia in 1978. While in elementary school, she represented her school in mathematics competitions. For high school, her father enrolled her in an electrician high school: there were four other girls in her class, and thirty-two boys. She graduated with the top ranking in her class.
Balázsi completed her university degrees at the Faculty of Electrical Engineering and Information Technology of the Slovak University of Technology in Bratislava (STU). In 2000, she received a bachelor's degree in Electromaterials Engineering; she received a master's degree in materials science in 2002 from the same. During her master's degree, Balázsi worked as a technician at the Slovak Academy of Sciences. She then became a researcher at the Academy, using transmission electron microscopy to characterise the structures of nanomaterials; she received her doctorate in materials science from the STU in 2005. The Institute of Electrical Engineering at the Academy named her the "Young Researcher".
Career
In 2006, Balázsi became a research fellow at the Institute of Technical Physics and Materials Science, part of the Hungarian Academy of Sciences. She was appointed as a senior scientist at the Institute's Centre for Energy Research in 2012. Besides her work with electron microscopy, Balázsi has also studied the development of different ceramic materials.
Balázsi and nine other female scientists founded the Association of Hungarian Women in Science in 2008 to address the national gender imbalance in Hungary's science sector; this Association won th |
https://en.wikipedia.org/wiki/ALTO%20%28protocol%29 | Application Layer Transport Optimization (ALTO) is a protocol that allows internet clients to obtain information that compares the network properties of paths to other endpoints. Typically, this would be used to identify the lowest-cost location to access a copy of some sort of content.
The ALTO base protocol is specified in RFC 7285. It requires "ALTO servers" to be deployed in the network with knowledge of network properties, often simply the routing cost to various endpoints. An "ALTO client," typically tied to a user agent attempting to obtain a resource, queries the ALTO server over HTTP to obtain the optimal location from which to retrieve the resource.
History
Starting around 2005, the widespread use of peer-to-peer applications such as BitTorrent was a serious concern to many network operators, as the massive amounts of network traffic caused by these applications
had a significant impact on traffic engineering and revenues. Some network operators tried to throttle this traffic.
In May 2008, in an IETF Workshop on Peer-to-Peer Infrastructure, several areas of work were identified:
A standardized interface for the exchange of information between the underlying IP network and an overlay network, such as a peer-to-peer network. The basic idea is, that if the overlay network was aware of the topology and the cost for sending traffic through the underlying IP network, it could optimize decisions with respect to the overlay network's topology (e.g., peer selection) and routing of traffic through the overlay network. The result would be better performance or Quality of Experience in the application while reducing the utilization of the underlying network infrastructure. This work item led to the establishment of the IETF ALTO working group.
Content caches in the network. This has been studied in the IETF DECADE working group. However, no new protocol has been developed and standardized.
A new congestion control mechanism in the transport layer for background tr |
https://en.wikipedia.org/wiki/Assembly%20theory | Assembly theory is a hypothesis that characterizes object complexity. When applied to molecule complexity, its authors claim it to be the first technique that is experimentally verifiable, unlike other molecular complexity algorithms that lack experimental measure. The theory was developed as a means to detect evidence of extraterrestrial life from data gathered by astronomical observations or probes.
Background
The hypothesis was proposed by chemist Leroy Cronin and developed by the team he leads at the University of Glasgow, then extended in collaboration with a team at Arizona State University led by astrobiologist Sara Imari Walker. It is difficult to identify chemical signatures that are unique to life. For example, the Viking lander biological experiments detected molecules that could be explained by either living or natural non-living processes.
Assembly theory outputs how complex a given object is as a function of the number of independent parts and their abundances. To calculate how complex an item is, it is recursively divided into its component parts. The 'assembly index' is defined as the shortest path to put the object back together.
For example, the word 'abracadabra' contains 5 unique letters (a, b, c, d and r) and is 11 symbols long. It can be assembled from its constituents as a + b --> ab + r --> abr + a --> abra + c --> abrac + a --> abraca + d --> abracad + abra --> abracadabra, because 'abra' was already constructed at an earlier stage. Because this requires 7 steps, the assembly index is 7. The string ‘abcdefghijk’ has no repeats so has an assembly index of 10.
While other approaches can provide a measure of complexity, the researchers claim that assembly theory's molecular assembly number is the first to be measurable experimentally. They argue that the molecular assembly number can be used to gauge the improbability that a complex molecule was created without life, with a higher number of steps corresponding to a higher improbability. Th |
https://en.wikipedia.org/wiki/Saudi%20infiltration%20of%20Twitter | In 2014 and 2015, a team of Saudi agents allegedly stole proprietary and sensitive personal data from the American social media platform Twitter, in order to unmask anonymous dissidents of Saudi Arabia. Email addresses, phone numbers, internet IP addresses, dates of birth and a history of all the users' activity of Saudi dissidents, opponents and others, were among the stolen materials.
The United States Department of Justice charged two former Twitter workers and a Saudi intermediary with "acting as illegal agents of Saudi Arabia". Personal data of at least 6,000 Twitter accounts was acquired, according to the complaint.
Human rights groups ANHRI and Prisoners of Conscience have observed that some anonymous Saudi political activists on Twitter were identified and detained after the infiltration, and suspect that it is related. A Saudi scholar in exile in the United States sued Twitter, alleging that dozens of anonymous political activists he was in contact with have died, were tortured, or remain behind bars as a result of being found to have a connection to him.
Background
With roughly 10 million Twitter users, Saudi Arabia is the service's top Arab market. Not requiring use of real names further made Twitter a leading platform for political dissent in the country.
Saud al-Qahtani, one of Saudi Crown Prince Mohammed Bin Salman's top confidants at the time, posted a warning against masked Twitter accounts using his own verified Twitter account in August 2017. Asserting that governments can know the true names of those using Twitter anonymously, he brought up "technical methods" for tracing a person's IP addresses, as well as a "secret I'm not going to reveal." Twitter permanently banned al-Qahtani's account in September 2019, claiming "violations of our platform manipulation policies."
Incident
Perpetrators
Ali Alzabarah, a Saudi national, and Ahmad Abouammo, a U.S. citizen, were the two former Twitter employees that funneled the data, the complaint asserts |
https://en.wikipedia.org/wiki/Adrenal%20androgen-stimulating%20hormone | Adrenal androgen stimulating hormone (AASH), also known as cortical androgen stimulating hormone (CASH), is a hypothetical hormone which has been proposed to stimulate the adrenal glands to produce adrenal androgens such as dehydroepiandrosterone (DHEA), dehydroepiandrosterone sulfate (DHEA-S), and androstenedione (A4). It is hypothesized to be involved in adrenarche and adrenopause. The existence of this hormone is controversial and disputed and it has not been identified to date. A number of other mechanisms and/or hormones may instead play the functional role of the so-called AASH.
See also
Adrenocorticotrophic hormone (ACTH)
References
Biochemistry
Hormones
Adrenal gland |
https://en.wikipedia.org/wiki/Parity%20measurement | Parity measurement (also referred to as Operator measurement) is a procedure in quantum information science used for error detection in quantum qubits. A parity measurement checks the equality of two qubits to return a true or false answer, which can be used to determine whether a correction needs to occur. Additional measurements can be made for a system greater than two qubits. Because parity measurement does not measure the state of singular bits but rather gets information about the whole state, it is considered an example of a joint measurement. Joint measurements do not have the consequence of destroying the original state of a qubit as normal quantum measurements do. Mathematically speaking, parity measurements are used to project a state into an eigenstate of an operator and to acquire its eigenvalue.
Parity measurement is an essential concept of quantum error correction. From the parity measurement, an appropriate unitary operation can be applied to correct the error without knowing the beginning state of the qubit.
Parity and parity checking
A qubit is a two level system and when we measure one qubit, we can have either 1 or 0 as a result. One corresponds odd parity and zero corresponds even parity. This is what a parity check is. This idea can be generalized beyond single qubits. This can be generalized beyond a single qubit and it is useful in QEC. The idea of parity checks in QEC is to have just parity information of multiple data qubits over one (auxiliary) qubit without revealing any other information. Any unitary can be used for the parity check. If we want to have the parity information of a valid quantum observable U, we need to apply the controlled-U gates between the ancilla qubit and the data qubits sequentially. For example, for making parity check measurement in the X basis, we need to apply CNOT gates between the ancilla qubit and the data qubits sequentially since the controlled gate in this case is a CNOT (CX) gate.
The unique state o |
https://en.wikipedia.org/wiki/Kenneth%20L.%20Cooke | Kenneth L. Cooke (August 13, 1925August 25, 2007) was an American mathematical biologist known for his contributions to the study of epidemics. He was the W. M. Keck Professor of Mathematics at Pomona College in Claremont, California.
Early life and education
Cooke was born in Kansas City, Missouri, in 1925. He enrolled at Pomona College, graduating in 1947 after serving in the Navy as a radar and radio technician during World War II. He subsequently earned a doctorate in mathematics from Stanford University.
Career
Cooke taught at Washington State University for seven years. He then joined the Pomona faculty in 1957 and remained at the college for the rest of his career. He was promoted to a named professorship in 1985.
His work on epidemics involved modeling parameters under which a disease will spread or die out. He studied HIV/AIDS and other contagious diseases. His work also involved delay differential equations.
References
20th-century American mathematicians
1925 births
2007 deaths
Pomona College alumni
Stanford University alumni
Washington State University faculty
Pomona College faculty
Mathematical and theoretical biology |
https://en.wikipedia.org/wiki/ETG%20Designers%20and%20Consultants | ETG Designers and Consultants S.C. () formerly known as ETG Designers and Consultants PLC is an architectural design and consulting firm founded in 1996 by Eshetu T. Gelan (Ph.D.). It is headquartered in Addis Ababa, Ethiopia. ETG is known for its work in multiple governmental, non-governmental, and private projects.
Foundation and internal organization
ETG was founded in 1996 as a privately owned architectural firm in Ethiopia with an initial capital of 10,000 Ethiopian Birr (ETB). ETG transformed from a privately owned firm into an employee-owned share company in the late 2010s.
Services
Building design
ETG designed and supervised the headquarters for Wegagen Bank. The project was finalized within six years and had a budget of almost 1 billion Ethiopian Birr (ETB). For the contract administration and supervision, ETG worked closely with China Jiangxi Corporation for International Economic & Technical Cooperation (CJIC) . Following the completion of Wegagen Bank, the company has designed several financial institutions such as a 36-story tower mixed-use building for the Amhara Credit and Savings Institute.
Contract administration and supervision
ETG was responsible for the design and contract administration of Adama stadium, an 80,000-seat stadium with a budget of 1.7 billion ETB ($82 million). In addition, ETG was the contract administrator and supervisor for the expansion of St. Paul's maternity and children hospital and St. Paul's Hospital Millennium Medical College Construction Project.The projects had an approximate budget of 178 million ETB. Another ETG Project is Allana Meat Processing Plant, which is recognized as the largest abattoir plant in Africa was built on 75 hectares of land in Adami Tulu area in Ziway town approximately from Addis Ababa. The company also undertook a project by the Federal Housing Corporation which included 8 buildings in various sites totaling to 435 apartment houses. The project was stated to have a budget of 1.8 billi |
https://en.wikipedia.org/wiki/Climate%20Crisis%20Advisory%20Group | The Climate Crisis Advisory Group (CCAG) is an independent group of scientists which advises on climate change and biodiversity, headed by Sir David King.
The group is funded by the Centre for Climate Repair.
Its goal is to "provide the global public with regular analysis about efforts to tackle the global heating and biodiversity crises".
CCAG's launch statement and first report state that the Earth may have already passed several dangerous tipping points, including melting ice sheets, the slowdown of Atlantic circulation and the dieback of the Amazon rainforest, which highlight the need for speed.
Members
Members of the CCAG are scientists from multiple disciplines that are all advocates for the environment. The group was formed so that every continent (besides Antarctica) was represented. All members volunteer their time to the group. Members include:
Nerilie Abram
Ade Adepitan - Presenter
Laura Diaz Anadon
Dr. Fatih Birol Executive Director of the International Energy Agency (IEA)
Mercedes Bustamante
Dr. Robert W. Corell
Dr. Arunabha Ghosh
Sir David King - Chair
Dr. Klaus Lackner
Mark Maslin
Dr. Tero Mustonen
Lavanya Rajamani
Johan Rockström
Dr. Tara Shirvani - Associate
Lorraine Whitmarsh
Qi Ye
References
External links
List of CCAG Reports
CCAG press releases
CCAG Youtube channel where they stream their monthly meetings
Climate change
Biodiversity |
https://en.wikipedia.org/wiki/GeneXpert%20Infinity | The GeneXpert Infinity is an automated cartridge-based nucleic acid amplification test (NAAT) which is able to tell whether the subject fluid contains shreds of the SARS-CoV-2 virus, amongst others. It is manufactured by Cepheid Inc.
References
Medical tests
Laboratory techniques
Molecular biology
Polymerase chain reaction
Biotechnology |
https://en.wikipedia.org/wiki/Hal%20Chamberlin | Howard Allen Chamberlin, Jr. is an American audio engineer and writer from North Carolina, most widely known as the author of the book Musical Applications of Microprocessors.
Biography
In the 1970s while still at school he built an analog electronic music synthesizer and then a 16 bit computer from surplus IBM 1620 core memories to control it.
He was awarded an MSc in Communication Engineering from NCSU in 1973. The subject of his thesis was the design of a digital music synthesizer utilising an organ keyboard and a Tektronix 453 oscilloscope for a graphics display.
In November 1974 together with others began The Computer Hobbyist magazine.
In 1977 he first published wavetable synthesis in Byte's September 1977 issue and together with David B. Cox started Micro Technology Unlimited. At Micro Technology Unlimited, in 1981, he designed the 6502-based MTU-130/140 microcomputer and the Digisound-16 an early digital to analog converter.
His seminal book Musical Applications of Microprocessors was first published in 1979.
In 1986 he left MTU to work for Kurzweil Music Systems where he remained in one engineering role or another until retirement in 2014. While there amongst other projects he designed the Kurzweil K150
In 1992 he moved to Boston.
See also
Homebrew Computer Club
AIM-65
References
Further reading
Musical Applications of Microprocessors by Hal Chamberlin, Hayden Book Co., 1980,
Musical Applications of Microprocessor by Hal Chamberlin, 2nd ed., Sams, 1985,
External links
Interview by Brian Cowell, Sonikmatter, January 2002. (archived)
"Hal Chamberlin" search at Archive.org
The Computer Hobbyist
Year of birth missing (living people)
Living people
American audio engineers
20th-century American inventors
American engineering writers |
https://en.wikipedia.org/wiki/Industry%20Dive | Industry Dive is an online business-to-business news organization, with an estimated 13 million readers across more than 25 industries, including banking and waste management. Since 2022, it has been owned by Informa plc, which bought its majority stake from Falfurrias Capital Partners for about $530 million.
Industry Dive writes for busy executives using their mobile phones. The company has reported revenues of $30 million to $60 million, mostly from selling ads. It has more than 300 employees, including 80 journalists and 12 engineers. Its headquarters is in Washington, D.C.
History
Industry Dive was formed in 2012 by Sean Griffey (president), Eli Dickinson (chief technology officer) and Ryan Willumson (chief revenue officer) and funded with $900,000 from private investors in 2012 and 2013. The company started by covering five industries: construction, education, marketing, utility, and waste.
In 2016, it began its Dive Awards to recognize the most innovative and disruptive businesses. Industry Dive's revenues quadrupled from 2015 to 2018, putting it in the top half of the Deloitte Technology Fast 500 and the top 20 percent of the Inc top 5000 list. In 2019, Falfurrias Capital Partners acquired a majority stake in the company. ID's content marketing clients included IBM, Siemens, and UPS.
In 2020, DCA Live named Industry Dive to its "Red Hot Companies" list, which recognizes the D.C. area's fastest-growing companies. In the same year, Industry Dive acquired CFO. In 2021, Industry Dive acquired PharmaVOICE.
In 2022, it was purchased by Informa plc, which bought its majority stake from Falfurrias Capital Partners for about $530 million.
Publications
Industry Dive operates through a number of industry verticals, each with their own website:
Agriculture Dive
Automotive Dive
Banking Dive
BioPharma Dive
CFO
CFO Dive
CIO Dive
Construction Dive
C-Store Dive
Cybersecurity Dive
Education Dive
Facilities Dive
Fashion Dive
Food Dive
Grocery Dive
Healthcare Dive
Higher |
https://en.wikipedia.org/wiki/GitHub%20Copilot | GitHub Copilot (not to be confused with "Copilot X", the name of GitHub's "vision" for next-gen Copilot features) is a cloud-based artificial intelligence tool developed by GitHub (owned by Microsoft) and OpenAI to assist users of Visual Studio Code, Visual Studio, Neovim, and JetBrains integrated development environments (IDEs) by autocompleting code. Currently available by subscription to individual developers and to businesses, the tool was first announced by GitHub on 29 June 2021, and works best for users coding in Python, JavaScript, TypeScript, Ruby, and Go.
History
On June 29, 2021, GitHub announced GitHub Copilot for technical preview in the Visual Studio Code development environment. GitHub Copilot was released as a plugin on the JetBrains marketplace on October 29, 2021. October 27, 2021, GitHub released the GitHub Copilot Neovim plugin as a public repository. GitHub announced Copilot's availability for the Visual Studio 2022 IDE on March 29, 2022. On June 21, 2022, GitHub announced that Copilot was out of "technical preview", and is available as a subscription-based service for individual developers.
GitHub Copilot is the evolution of the 'Bing Code Search' plugin for Visual Studio 2013, which was a Microsoft Research project released in February 2014. This plugin integrated with various sources, including MSDN and StackOverflow, to provide high-quality contextually relevant code snippets in response to natural language queries.
Features
When provided with a programming problem in natural language, Copilot is capable of generating solution code. It is also able to describe input code in English and translate code between programming languages.
According to its website, GitHub Copilot includes assistive features for programmers, such as the conversion of code comments to runnable code, and autocomplete for chunks of code, repetitive sections of code, and entire methods and/or functions. GitHub reports that Copilot’s autocomplete feature is accurate r |
https://en.wikipedia.org/wiki/IBM%20WatchPad | The IBM WatchPad was a line of earlier smartwatch prototypes, produced in 2000-2002.
Overview
In June 2000, IBM displayed a prototype for a wristwatch that ran Linux. The original version had only 6 hours of battery life, which was later extended to 12. It featured 8 MB of RAM and ran Linux 2.2. The device was later upgraded with an accelerometer, vibrating mechanism, and fingerprint sensor. IBM began to collaborate with Citizen Watch Co. to create the "WatchPad". The WatchPad 1.5 features a 320 × 240 QVGA monochrome touch sensitive display and runs Linux 2.4. It also features calendar software, Bluetooth, 8 MB of RAM and 16 MB of flash memory. Citizen was hoping to market the watch to students and businessmen, with a retail price of around $399.
Models
IBM WatchPad (2000)
IBM WatchPad 1.5 (2001)
See also
ThinkPad laptops
WorkPad handhelds
References
IBM products
Prototypes |
https://en.wikipedia.org/wiki/Open%203D%20Engine | Open 3D Engine is a free and open-source 3D game engine developed by Open 3D Foundation, a subsidiary of the Linux Foundation, and distributed under the Apache 2.0 open source license. The initial version of the engine is an updated version of Amazon Lumberyard, contributed by Amazon Games.
Partners
Partners were recruited on the basis of resources, expertise, and motivation to foster a self-sustaining open-source community for O3DE. These partners include Accelbyte, Adobe, Apocalypse Studios, Audiokinetic, Backtrace.io, Carbonated, Futurewei, GAMEPOCH, Genvid Technologies, Hadean, Huawei, HERE Technologies, Intel, International Game Developers Association, Kythera AI, Niantic, Open Robotics, PopcornFX, Red Hat, Rochester Institute of Technology, SideFX, Tafi, TLM Partners, and Wargaming.
Premier members are Adobe, AWS, Epic Games, Huawei, Intel, Microsoft, Niantic, and Tencent (with the LightSpeed Studios brand).
References
External links
2021 software
3D graphics software
Cross-platform software
Free and open-source software
Free game engines
Free software programmed in C++
IOS video game engines
Software that uses Qt
Software using the Apache license
Software using the MIT license
Video game engines
Video game IDE
Game engines for Linux
Game engines that support Vulkan (API) |
https://en.wikipedia.org/wiki/Douglas%20Clements | Douglas H. Clements is an American scholar in the field of early mathematics education. Previously a preschool and kindergarten teacher, his research centers on the learning and teaching of early mathematics, computer applications for mathematics teaching, and scaling up successful educational interventions. Clements has contributed to the writing of educational standards including the Common Core State Standards, the NCTM's Principles and Standards for School Mathematics and the NCTM's 2006 Curriculum Focal Points for Prekindergarten through Grade 8 Mathematics.
As of 2021, he is Distinguished University Professor and the Kennedy Endowed Chair in Early Childhood Learning at the University of Denver and the co-director of the Marsico Institute for Early Learning. He was previously a SUNY Distinguished Professor at the University at Buffalo.
Subitizing
Clements is notable for reviving interest in the importance of perceptual and conceptual subitizing in early childhood mathematics education. Perceptual subitizing is the ability to instantly recognise the number of objects in a small group, without counting. Conceptual subitising is the ability to see a whole quantity as groups of smaller quantities (for example, seeing eight as two groups of four). When learning to count, young children use subitizing to develop their understanding of cardinality. They also use their conceptual subitizing and pattern recognition skills to develop their understanding of arithmetic and number sense.
Building Blocks and Learning Trajectories
Together with Julie Sarama, Clements developed the Building Blocks curriculum and the Learning Trajectories approach to early mathematics education. Learning trajectories consist of a learning goal, a developmental path along which children develop to reach that goal, and a set of activities matched to each level in that learning path. Clements has evaluated this approach in randomized controlled trials and shown it to have a positive impact on |
https://en.wikipedia.org/wiki/Telecommunication%20Instructional%20Modeling%20System | TIMS, or Telecommunication Instructional Modeling System, is an electronic device invented by Tim Hooper and developed by Australian engineering company Emona Instruments that is used as a telecommunications trainer in educational settings and universities.
History
TIMS was designed at the University of New South Wales by Tim Hooper in 1971. It was developed to run student experiments for electrical engineering communications courses. Hooper’s concept was developed into the current TIMS model in the late 1980s. In 1986, the project won a competition organized by Electronics Australia for development work using the Texas Instruments TMS320. Emona Instruments also received an award for TIMS at the fifth Secrets of Australian ICT Innovation Competition.
Methodology
TIMS uses a block diagram-based interface for experiments in the classroom. It can model mathematical equations to simulate electric signals, or it can use block diagrams to simulate telecommunications systems. It uses a different hardware card to represent functions for each block of the diagram.
TIMS consists of a server, a chassis, and boards that can emulate the configurations of a telecommunications system. It uses electronic circuits as modules to simulate the components of analog and digital communications systems. The modules can perform different functions such as signal generation, signal processing, signal measurement, and digital signal processing.
Variants
The block diagram approach to modeling the mathematics of a telecommunication system has also been ported across to other domains.
Simulation
Where the blocks are patched together onscreen to mimic the hardware implementation but with a simulation engine (known as TutorTIMS).
Remote access
It can be used by multiple students at once across the internet or LAN via a browser based client screen. This utilises a statistical time division multiplexing architecture in the control unit. The method is applied both to Telecommunications |
https://en.wikipedia.org/wiki/Agricultural%20weed%20syndrome | The agricultural weed syndrome is the set of common traits which make a plant a successful agricultural weed. Most of these traits are not, themselves, phenotypes but are instead methods of rapid adaptation. So equipped, plants of various origins - invasives, natives, mildly successful marginal weeds of agriculture, weeds of other settings - accumulate other characteristics which allow them to compete in an environment with a high degree of human management.
Nonetheless, some of the syndrome traits are themselves phenotypic.
Syndrome traits
Rapid growth
Efficient use of nutrients
Seed dormancy
Effective seed dispersal, often more aggressive shattering
Vavilovian mimicry including introgression of crop alleles if there are nearby crop relatives
Herbicide resistance
Short life cycle
High fertility
Some of these are the opposite of domestication traits.
Evolution
Insufficient information is available as to the exact contribution of mutations, particular mutation types, pre-existing genetic diversity, specific genes, and introgression to syndrome acquisition. It is also unknown whether we can discern the genetic signatures of adaptation to different weed management regimes from different times.
In some cases domestication alleles may produce weeds that are weedier than the wild parent they were derived from. For example, California wild radish is weedier and more aggressive than Raphanus raphanistrum, despite being merely a combination of R. raphanistrum and R. raphanistrum'''s own subspecies R. r. sativus.
Pre-existing allelic variety which suddenly became more adaptive when the cultivated environment appeared likely has contributed to the success of Amaranthus tuberculatus, A. palmeri, Lolium rigidum and Ipomoea purpurea especially their quick development of herbicide resistance.
On the other hand, novel mutations may be the source herbicide resistance in Echinochloa crus-galli and E. oryzicola, whose worldwide combined populations have developed resist |
https://en.wikipedia.org/wiki/Electrical%20device | Electric(al) devices are devices that functionally rely on electric energy (AC or DC) to drive their core parts (electric motors, transformers, lighting, rechargeable batteries, control electronics). They can be contrasted with traditional mechanical devices which depend on different power sources like fuels or human physical strength. Electronic devices are a specialized kind of electrical devices in which electric power is predominantly used for data processing rather than the generation of mechanical forces. To better differentiate between both classes, electric devices that emphasize physical work are also called electromechanical. Mechatronics accentuates the intersection of both fields.
Together, electronic and electric devices, their development, maintenance, and power supply comprise the subject of electrical engineering.
The majority of electric devices in households is stationary and — due to their considerable power consumption — relies on electrical installation, especially electric outlets instead of small electric generators, batteries, rechargeable or not.
Due to their dependence on electric power sources, in general well-evolved power grids, electric devices and their power consumption pattern have moved into the focus of smart metering.
Electrical equipment
Electrical equipment includes any machine powered by electricity. It usually consists of an enclosure, a variety of electrical components, and often a power switch. Examples of these include:
Lighting
Major appliance
Small appliances
IT equipment (computers, printers etc.)
Motors, pumps and HVAC Systems
More specifically, electrical equipment refers to the individual components of an electrical distribution system. These components may involve:
Electric switchboards
Distribution boards
Circuit breakers and disconnects
Transformers
Electricity meter
See also
Electrical equipment in hazardous areas
Electrical equipment
Power transmission
Electrical room
Grounding kit
List of largest manufac |
https://en.wikipedia.org/wiki/List%20of%20Stellantis%20platforms | This is a list of car platforms created by the multinational automotive manufacturing corporation Stellantis.
Pre-existing platforms
The following platforms were inherited in 2021 when the Stellantis corporation was created:
Chrysler
Chrysler LX platform
Wrangler JL platform
Ram DT platform
Chrysler RU platform
Jeep WS platform
Jeep WL platform
Chrysler KL platform
Fiat
Fiat Mini platform
Fiat Small platform
Fiat Compact platform
FCA Giorgio platform
Maserati M156 platform
PSA
PSA EMP1 platform
PSA EMP2 platform
Electric vehicle platforms
In 2021 Stellantis announced plans to create new shared platforms as part of their electric vehicle (EV) strategy. The group plans to have 39 electrified vehicle models available by the end of 2021. There are four EV platforms with configurable drivetrains planned to be developed by the end of the 2020s:
STLA Small, for B/C-segment vehicles
STLA Medium, for C/D-segments
STLA Large, for D/E/F-segments
STLA Frame, for large trucks and light commercial vehicles
See also
Stellantis
:Category:Stellantis platforms
List of Chrysler platforms
List of PSA platforms
List of Fiat platforms
References
Stellantis platforms
Manufacturing-related lists |
https://en.wikipedia.org/wiki/Total%20mycosynthesis | Total mycosynthesis is the combination of the use of a filamentous fungal host organism with a genetic expression system that allows the assembly and controlled expression of one or more biosynthetic genes. Total mycosynthesis involves the reconstruction and/or engineering of biosynthetic pathways for the production of secondary metabolites. It is competitive with chemical total synthesis. It can be used both for the production of known natural products, and for the engineering of pathways to produce new compounds or pathway intermediates.Examples include the total mycosynthesis of tenellin where the tenS, tenC, tenA and tenB genes were transferred from Beauveria bassiana to the expression host Aspergillus oryzae. The expression system allows the engineering of TenS to control chain-length and methylation pattern.
Examples
References
Mycology |
https://en.wikipedia.org/wiki/Matrix%20sign%20function | In mathematics, the matrix sign function is a matrix function on square matrices analogous to the complex sign function.
It was introduced by J.D. Roberts in 1971 as a tool for model reduction and for solving Lyapunov and Algebraic Riccati equation in a technical report of Cambridge University, which was later published in a journal in 1980.
Definition
The matrix sign function is a generalization of the complex signum function
to the matrix valued analogue . Although the sign function is not analytic, the matrix function is well defined for all matrices that have no eigenvalue on the imaginary axis, see for example the Jordan-form-based definition (where the derivatives are all zero).
Properties
Theorem: Let , then .
Theorem: Let , then is diagonalizable and has eigenvalues that are .
Theorem: Let , then is a projector onto the invariant subspace associated with the eigenvalues in the right-half plane, and analogously for and the left-half plane.
Theorem: Let , and be a Jordan decomposition such that corresponds to eigenvalues with positive real part and to eigenvalue with negative real part. Then , where and are identity matrices of sizes corresponding to and , respectively.
Computational methods
The function can be computed with generic methods for matrix functions, but there are also specialized methods.
Newton iteration
The Newton iteration can be derived by observing that , which in terms of matrices can be written as , where we use the matrix square root. If we apply the Babylonian method to compute the square root of the matrix , that is, the iteration , and define the new iterate , we arrive at the iteration
,
where typically . Convergence is global, and locally it is quadratic.
The Newton iteration uses the explicit inverse of the iterates .
Newton–Schulz iteration
To avoid the need of an explicit inverse used in the Newton iteration, the inverse can be approximated with one step of the Newton iteration for the inverse, , derived |
https://en.wikipedia.org/wiki/SpankChain | SpankChain is an adult entertainment website and cryptocurrency exchange mostly used for exchanges in the sex work industry. Users pay for services using SpankChain Ethereum-based coin "SPANK". The SpankChain's tokens are sometimes referred to as "SpankCoin".
History
In April 2018, SpankChain offered a $25,000 reward to sex workers who revealed information about political clients who supported the passing of the FOSTA/SESTA acts, which regulated sex work in the United States. The company reportedly had 6,000 users as of October 2018.
In 2018, a malicious attacker stole 165 Ethers (valued at $40,000) from SpankChain by exploiting a vulnerability in the Ethereum blockchain. After the cryptocurrency bubble of 2018 burst, the company downsized to eight employees.
References
External links
https://spankchain.com
Cryptocurrencies
Pornography |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.