source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Server-side%20request%20forgery | Server-side request forgery (SSRF) is a type of computer security exploit where an attacker abuses the functionality of a server causing it to access or manipulate information in the realm of that server that would otherwise not be directly accessible to the attacker.
Similar to cross-site request forgery which utilises a web client, for example, a web browser, within the domain as a proxy for attacks; an SSRF attack utilizes a vulnerable server within the domain as a proxy.
If a parameter of a URL is vulnerable to this attack, it is possible an attacker can devise ways to interact with the server directly (via localhost) or with the backend servers that are not accessible by the external users. An attacker can practically scan the entire network and retrieve sensitive information.
Types
Basic
In this type of attack the response is displayed to the attacker. The server fetches the URL requested by the attacker and sends the response back to the attacker.
Blind
In this type of attack the response is not sent back to the attacker. Therefore, the attacker has to devise ways to confirm this vulnerability.
Steps
Exploiting Misconfigurations: An attacker identifies a vulnerable endpoint in a web application. This could be, for example, an endpoint that fetches external resources like images or web pages.
Crafting the Payload: The attacker crafts a malicious URL targeting internal resources. This could target localhost (127.0.0.1), or other IPs indicative of internal resources, like 10.*.*.* or 192.168.*.*.
Bypassing Filters: If there are any filters in place, the attacker might try various techniques to bypass them. For instance, by using an IP address instead of "localhost", or by employing different URL schemes and encodings.
Fetching Internal Resources: The vulnerable server processes the malicious URL and makes a request to the targeted internal resource. This could expose internal services, databases, or even cloud-specific metadata, as in the case of t |
https://en.wikipedia.org/wiki/Jean%20%C3%89calle | Jean Écalle (born 1947) is a French mathematician, specializing in dynamic systems, perturbation theory, and analysis.
Écalle received, in 1974 from the University of Paris-Saclay in Orsay, a doctorate under the supervision of Hubert Delange with Thèse d'État entitled La théorie des invariants holomorphes. He is a directeur de recherche (senior researcher) of the Centre national de la recherche scientifique (CNRS) and is a professor at the University of Paris-Saclay.
He developed a theory of so-called "resurgent functions", analytic functions with isolated singularities, which have a special algebra of derivatives (Alien calculus, Calcul différentiel étranger). "Resurgent functions" are divergent power series whose Borel transforms converge in a neighborhood of the origin and give rise, by means of analytic continuation, to (usually) multi-valued functions, but these multi-valued functions have merely isolated singularities without singularities that form cuts with dimension one or greater. Écalle's theory has important applications to solutions of generalizations of Abel's integral equation; the method of resurgent functions provides for such solutions a (Borel) resummation method for dealing with divergent series arising from semiclassical asymptotic developments in quantum theory.
He applied his theory to dynamic systems and to the interplay between diophantine small denominators and resonance involved in problems of germs of vector fields.
Independently of Yulij Ilyashenko he proved that the number of limit cycles of polynomial vector fields in the plane is finite, which Henri Dulac had already tried to prove in 1923. This result is related to Hilbert's sixteenth problem.
In 1988 Écalle was the inaugural recipient of the of the Académie des Sciences. He was in 1990 an Invited Speaker at International Congress of Mathematicians in Kyoto.
Selected publications
Les Fonctions Résurgentes , 3 volumes, pub. Math. Orsay, 1985 (downloadable pdf's available her |
https://en.wikipedia.org/wiki/Evolution%20in%20fiction | Evolution has been an important theme in fiction, including speculative evolution in science fiction, since the late 19th century, though it began before Charles Darwin's time, and reflects progressionist and Lamarckist views as well as Darwin's. Darwinian evolution is pervasive in literature, whether taken optimistically in terms of how humanity may evolve towards perfection, or pessimistically in terms of the dire consequences of the interaction of human nature and the struggle for survival. Other themes include the replacement of humanity, either by other species or by intelligent machines.
Context
Charles Darwin's evolution by natural selection, as set out in his 1859 On the Origin of Species, is the dominant theory in modern biology, but it is accompanied as a philosophy and in fiction by two earlier evolutionary theories, progressionism (orthogenesis) and Lamarckism. Progressionism is the view that evolution is progress towards some goal of perfection, and that it is in some way directed towards that goal. Lamarckism, a philosophy that long predates Jean-Baptiste de Lamarck, is the view that evolution is guided by the inheritance of characteristics acquired by use or disuse during an animal's lifetime.
Progressionism
Ideas of progress and evolution were popular, long before Darwinism, in the 18th century, leading to Nicolas-Edme Rétif's allegorical 1781 story (The Southern Hemisphere Discovery by a Flying Man).
The evolutionary biologist Kayla M. Hardwick quotes from the 2013 film Man of Steel, where the villain Faora states: "The fact that you possess a sense of morality, and we do not, gives us an evolutionary advantage. And if history has taught us anything, it is that evolution always wins." She points out that the idea that evolution wins is progressionist, while (she argues) the idea that evolution gives evil an advantage over the moral and good, driving the creation of formidable monsters, is a popular science fiction misconception. Hardwick gives |
https://en.wikipedia.org/wiki/Abernethy%20and%20Co%20Stonemason%27s%20Lathe | The Abernethy and Co Stonemason's Lathe is a heritage-listed former stonemason's lathe located at Moruya and District Historical Society, 85 Campbell Street, Moruya in the Eurobodalla Shire local government area of New South Wales, Australia. It was built during 1881 by J. Abernethy & Co, . The property is owned by the Office of Environment and Heritage, an agency of the Government of New South Wales. It was added to the New South Wales State Heritage Register on 2 April 1999.
History
This twin bed lathe was made in 1881 at Aberdeen by J. Abernethy and Co. and brought to Sydney where it was used to turn columns for the Sydney GPO, The Queen Victoria Building and for the granite pedestal for the Queen Victoria statue in Queen's Square, Sydney. It was last in use at Loveridge and Hudson's Yard in Sydney in the 1960s.
It was given by Mr Ted Hudson to the Lachlan Vintage Village at Forbes and disposed at auction in May 1987. It was subsequently repurchased by the Heritage Council of NSW and ownership transferred to the Minister for Planning under the NSW Heritage Act 1977. The lathe was reassembled at the Lachlan Vintage Village, Forbes, following recognition of its significance. In 1999, the lathe was transferred to the State Heritage Register under the Act.
The Heritage Council resolved at its 4 November 2009 meeting to recommend that the Minister:
acting as a corporation sole under section 102 of the NSW Heritage Act 1977, transfers title of the Abernethy Stonemason's Lathe from the corporation sole to Eurobodalla Shire Council.
The Abernethy Stonemason's Lathe is the only moveable item of its type known to have survived in Australia. The item is currently owned and managed by the Minister for Planning under the Heritage Act 1977. Eurobodalla Shire Council has approached the Heritage Branch, NSW Department of Planning, to obtain the item for public display at Moruya. Council has also indicated its willingness to obtain legal title to the lathe in perpetuity, fro |
https://en.wikipedia.org/wiki/ADRON-RM | ADRON-RM (Autonomous Detector of Radiation of Neutrons Onboard Rover at Mars) is a neutron spectrometer to search for subsurface water ice and hydrated minerals. This analyser is part of the science payload on board the European Space Agency Rosalind Franklin rover, tasked to search for biosignatures and biomarkers on Mars. The rover is planned to be launched in August–October 2022 and land on Mars in spring 2023.
ADRON-RM is a near copy of ADRO-EM on the stationary ExoMars 2020 surface platform and the Dynamic Albedo of Neutrons (DAN) neutron detector on board NASA's Curiosity rover, all designed by Igor Mitrofanov from the Russian Space Research Institute (IKI).
Overview
ADRON-RM is a neutron spectrometer that will search for hydrogen in the form of bound water or water ice, and hydrogen-bearing compounds. It will be used in combination with WISDOM instrument (a ground-penetrating radar) to study the subsurface beneath the rover and to search for optimal sites for drilling and sample collection. It can also detect trace elements such as Gd and major elements that constitute soil, such as Cl, Fe, Ti. It will also monitor the neutron component of the radiation background on Mars' surface.
Development
The Principal Investigator is Igor Mitrofanov from the Russian Space Research Institute (IKI). The instrument is almost a reproduction of the Dynamic Albedo of Neutrons (DAN) neutron detector on board NASA's Curiosity rover also developed in Russia. Mitrofanov is also developing the active gamma and neutron spectrometer, ADRON-EM (Active Detection of Radiation of Nuclei-ExoMars) for the stationary Kazachok lander—the primary goal of which will be to measure water distribution in the Martian subsurface. Measurements by ADRON-RM and ADRON-EM will work in synergy with other ExoMars instruments.
ADRON-RM uses two 3He proportional counters with a cylindrical shape of about 25 mm in diameter and 55 mm in total length. Each counter is filled with 3He gas under 4 atmosph |
https://en.wikipedia.org/wiki/DARSIMCO | DARSIMCO, short for Dartmouth Simplified Code, was a simple programming language written by John Kemeny in 1956 that expanded simple mathematical operations into IBM 704 assembly language (Share Assembly Language, SAL). It was an attempt to simplify basic mathematical processing, a common theme in the 1950s, but found little use before the arrival of FORTRAN at MIT the next year.
Description
This language was essentially a set of macros that expanded out user source code into a series of assembly language instructions, which were then compiled using the existing SAL assembler, Symbolic Assembly Program. For instance, the formula A + B = C would add the values in memory locations A and B and put the result in C. To do this, the DARSIMCO compiler would write out the following three instructions:
LDA A
FAD B
STO C
The language included similar expansions for subtraction, multiplication, division, and simple looping.
The language was implemented on the IBM 704 at MIT's New England Regional Computer Center. Programmed using punch cards, the system had a two-week turnaround because Kemeny had to take the cards in via train from Dartmouth.
See also
Autocode, a similar concept for mathematical programming
References
Programming languages
Programming languages created in 1956 |
https://en.wikipedia.org/wiki/Monorepo | In version-control systems, a monorepo ("mono" meaning 'single' and "repo" being short for 'repository') is a software-development strategy in which the code for a number of projects is stored in the same repository. This practice dates back to at least the early 2000s, when it was commonly called a shared codebase. Google, Meta, Microsoft, Uber, Airbnb, and Twitter all employ very large monorepos with varying strategies to scale build systems and version control software with a large volume of code and daily changes.
A related concept is the monolithic application, but whereas a monolith combines its sub-projects into one large project, a monorepo may contain multiple independent projects.
Advantages
There are a number of potential advantages to a monorepo over individual repositories:
Ease of code reuse
Similar functionality or communication protocols can be abstracted into shared libraries and directly included by projects, without the need of a dependency package manager.
Simplified dependency management
In a multiple repository environment where multiple projects depend on a third-party dependency, that dependency might be downloaded or built multiple times. In a monorepo the build can be easily optimized, as referenced dependencies all exist in the same codebase.
Atomic commits
When projects that work together are contained in separate repositories, releases need to sync which versions of one project work with the other. And in large enough projects, managing compatible versions between dependencies can become dependency hell. In a monorepo this problem can be negated, since developers may change multiple projects atomically.
Large-scale code refactoring
Since developers have access to the entire project, refactors can ensure that every piece of the project continues to function after a refactor.
Collaboration across teams
In a monorepo that uses source dependencies (dependencies that are compiled from source), teams can improve projects being w |
https://en.wikipedia.org/wiki/Symbiosis%20in%20fiction | Symbiosis (mutualism) appears in fiction, especially science fiction, as a plot device. It is distinguished from parasitism in fiction, a similar theme, by the mutual benefit to the organisms involved, whereas the parasite inflicts harm on its host.
Relationships
Relationships between species in early science fiction were often imaginatively parasitic, with the parasites draining the vital energy of their human hosts and taking over their minds, as in Arthur Conan Doyle's 1895 The Parasite.
After the Second World War, science fiction moved towards more mutualistic relationships, as in Ted White's 1970 By Furies Possessed; Brian Stableford argues that White was consciously opposing the xenophobia of Robert Heinlein's 1951 The Puppet Masters which involved a parasitic relationship close to demonic possession, with a more positive attitude towards aliens. Stableford notes, however, that Octavia Butler's 1984 Clay's Ark and other of her works such as Fledgling, and Dan Simmons's 1989 Hyperion take an ambivalent position, in which the aliens may confer powers such as Hyperion'''s ability to regenerate continually—but at a price, in its case an incremental loss of intelligence at each regeneration.
In Star Trek, the Trill were a race of humanoids who incorporated a long-living symbiont. One of them was a main character on the series Star Trek: Deep Space Nine.
In the series Stargate SG-1, both the principal villains, the Goa'uld and their benevolent versions, the Tok'ra were symbionts who grafted themselves into the human nervous system.
The Force in the Star Wars universe is described by the fictional seer Obi-Wan Kenobi as "an energy field created by all living things". In The Phantom Menace, Qui-Gon Jinn says microscopic lifeforms called midi-chlorians, inside all living cells, allow characters with enough of these symbionts in their cells to feel and use the Force.
In Douglas Adams's humorous 1978 The Hitchhiker's Guide to the Galaxy'', the Babel fish lives in |
https://en.wikipedia.org/wiki/WISDOM%20%28radar%29 | WISDOM (Water Ice and Subsurface Deposit Observation on Mars) is a ground-penetrating radar that is part of the science payload on board the European Space Agency Rosalind Franklin rover, tasked to search for biosignatures and biomarkers on Mars. The rover is planned to be launched in August–October 2022 and land on Mars in spring 2023.
Overview
The search for evidence of past or present life on Mars is the principal objective of the ExoMars programme. If such evidence exists, it will most likely be in the subsurface, where organic
molecules are shielded from the destructive effects of ionizing radiation and atmospheric oxidants. For this reason, the Rosalind Franklin rover mission has been optimized to investigate the subsurface and sample those locations where conditions for the preservation of evidence of past life are most likely to be found.
WISDOM is a step frequency radar that operates in the frequency range from 0.5 to 3 GHz. It will provide high-resolution 3D imaging down to a depth of 3 metres. WISDOM will use UHF radar pulses to provide the three-dimensional geological context of the shallow subsurface underneath the ExoMars rover. It will be used to identify optimal drilling sites and to ensure the safety of the core drill, as well as investigate the local distribution and state of subsurface water ice and brine.
It can transmit and receive signals using two, small Vivaldi-antennas mounted on the aft section of the rover. Electromagnetic waves penetrating into the ground are reflected at places where there is a sudden transition in the electrical parameters of the soil. By studying these reflections it is possible to construct a stratigraphic map of the subsurface and identify underground targets down to in depth, comparable to the reach of the rover's drill. These data, combined with those produced by the PanCam and by the analyses carried out on previously collected samples, will be used to support drilling activities.
Field tests with a remote- |
https://en.wikipedia.org/wiki/Dmitri%20Burago | Dmitri Yurievich Burago (Дмитрий Юрьевич Бураго, born 1964) is a leading Russian - American mathematician, specializing in differential, Riemannian, Finsler geometry, geometric analysis, dynamical systems and applications to mathematical physics.
He is the son of the celebrated Geometer and Russian mathematician Yuri Dmitrievich Burago, with whom he also published well known book on metric geometry. Burago studied at 45th Physics-Mathematics School. Burago received his doctorate in 1994 at Saint Petersburg State University under the supervision of Anatoly Vershik. He was at the Steklov Institute in Saint Petersburg and is now a professor at Pennsylvania State University's Center for Dynamical Systems and Geometry.
In 1992, he was awarded the prize of the Saint Petersburg Mathematical Society. In 1998, he was an Invited Speaker at the International Congress of Mathematicians in Berlin. In 2014, he was awarded the Leroy P. Steele Prize with Yuri Burago and Sergei Vladimirovich Ivanov for their book A course in metric geometry.
Selected publications
Articles
"Periodic metrics." In: Seminar on dynamical systems, pp. 90–95. Birkhäuser, Basel, 1994.
with Sergei Ivanov: "Riemannian tori without conjugate points are flat." Geometric & Functional Analysis GAFA 4, no. 3 (1994): 259–269.
with Sergei Ivanov and Bruce Kleiner: "On the structure of the stable norm of periodic metrics." Mathematical Research Letters 4, no. 6 (1997): 791-808.
with Michael Brin and Sergei Ivanov: "On partially hyperbolic diffeomorphisms of 3-manifolds with commutative fundamental group." Modern dynamical systems and applications 307 (2004): 312
with Sergei Ivanov and Leonid Polterovich: "Conjugation-invariant norms on groups of geometric origin." arXiv preprint arXiv:0710.1412 (2007).
Books
with Yuri Burago and Sergei Ivanov: A Course in Metric Geometry, American Mathematical Society 2001
References
External links
Mathnet.ru
20th-century Russian mathematicians
21st-century Russian |
https://en.wikipedia.org/wiki/Carbon%20source%20%28biology%29 | The molecules that an organism uses as its carbon source for generating biomass are referred to as "carbon sources" in biology. It is possible for organic or inorganic sources of carbon. Heterotrophs must use organic molecules as both are a source of carbon and energy, in contrast to autotrophs, which can use inorganic materials as both a source of carbon and an abiotic source of energy, such as, for instance, inorganic chemical energy or light (photoautotrophs) (chemolithotrophs).
The carbon cycle, which begins with a carbon source that is inorganic, such as carbon dioxide and progresses through the carbon fixation process, includes the biological use of carbon as one of its components.[1]
Types of organism by carbon source
Heterotrophs
Autotrophs
References
Carbon cycle
Biochemistry |
https://en.wikipedia.org/wiki/Disease%20in%20fiction | Diseases, both real and fictional, play a significant role in fiction, with certain diseases like Huntington's disease and tuberculosis appearing in many books and films. Pandemic plagues threatening all human life, such as The Andromeda Strain, are among the many fictional diseases described in literature and film.
Real diseases
Genuine plagues have formed the central elements of books from Giovanni Boccaccio's c. 1353 The Decameron onwards. Boccaccio tells the tales of ten people of Florence who escape from the Black Death in their city. The book inspired Geoffrey Chaucer's 14th-century Canterbury Tales, which similarly tells the stories of people on pilgrimage in a time of plague. Ingmar Bergman's 1957 film The Seventh Seal () is set in Denmark during the Black Death, and features a game of chess with Death personified as a monk-like figure.
Tuberculosis was a common disease in the 19th century, and it appeared in several major works of Russian literature. Fyodor Dostoevsky used the theme of the consumptive nihilist repeatedly, with Katerina Ivanovna in Crime and Punishment; Kirillov in The Possessed, and both Ippolit and Marie in The Idiot. Turgenev did the same with Bazarov in Fathers and Sons. In English literature of the Victorian era, major tuberculosis novels include Charles Dickens's 1848 Dombey and Son, Elizabeth Gaskell's 1855 North and South, and Mrs. Humphry Ward's 1900 Eleanor.
Albert Camus's 1947 The Plague, probably based on cholera in 19th-century France, was seen both as fable about the need for people to help each other in the meaningless world seen by existentialism, and as alluding to the German invasion of France, fresh in Camus's mind.
Huntington's disease appears in many novels, such as Ian McEwan's 2005 Saturday. It was criticised as prejudiced in the medical journal The Lancet for its negative portrayal of the protagonist with the disease.
Fictional diseases
Diseases, especially if infectious, have long been popular themes and plot |
https://en.wikipedia.org/wiki/Biology%20in%20fiction | Biology appears in fiction, especially but not only in science fiction, both in the shape of real aspects of the science, used as themes or plot devices, and in the form of fictional elements, whether fictional extensions or applications of biological theory, or through the invention of fictional organisms. Major aspects of biology found in fiction include evolution, disease, genetics, physiology, parasitism and symbiosis (mutualism), ethology, and ecology.
Speculative evolution enables authors with sufficient skill to create what the critic Helen N. Parker calls biological parables, illuminating the human condition from an alien viewpoint. Fictional alien animals and plants, especially humanoids, have frequently been created simply to provide entertaining monsters. Zoologists such as Sam Levin have argued that, driven by natural selection on other planets, aliens might indeed tend to resemble humans to some extent.
Major themes of science fiction include messages of optimism or pessimism; Helen N. Parker has noted that in biological fiction, pessimism is by far the dominant outlook. Early works such as H. G. Wells's novels explored the grim consequences of Darwinian evolution, ruthless competition, and the dark side of human nature; Aldous Huxley's Brave New World was similarly gloomy about the effects of genetic engineering.
Fictional biology, too, has enabled major science fiction authors like Stanley Weinbaum, Isaac Asimov, John Brunner, and Ursula Le Guin to create what Parker called biological parables, with convincing portrayals of alien worlds able to support deep analogies with Earth and humanity.
Aspects of biology
Aspects of biology found in fiction include evolution, disease, ecology, ethology, genetics, physiology, parasitism, and mutualism (symbiosis).
Evolution
Evolution, including speculative evolution, has been an important theme in fiction since the late 19th century. It began, however, before Charles Darwin's time, and reflects progressioni |
https://en.wikipedia.org/wiki/Sup%27R%27Mod | The Sup 'R' Mod II is an RF modulator which was sold by M&R Enterprises in the late 1970s and early 1980s. It connects computers and other devices with composite video outputs, to a television.
History
Apple Computer wanted to provide Apple II computers with color output on a television, but had trouble getting FCC approval because the RF modulation solution is too noisy. Apple made an arrangement with a small nearby company, M&R Enterprises, to manufacture and sell the devices. Apple could not sell the modulator and computer as a package, but retail computer dealers could sell both devices to the end user.
Marty Spergel, who ran M&R Enterprises, was told by Steve Jobs that it might sell up to 50 units a month. Spergel later estimated that he had sold about 400,000 units.
The Sup 'R' Mod II began selling in April 1978, for .
Technical features
The Sup 'R' Mod II kit has a small printed circuit board, an antenna switch, and a coaxial cable with a ferrite core and RCA connectors. Composite video is received by the circuit board through a short cable terminating in a Molex connector, which plugs into a header on the Apple II motherboard. Input can also be provided through an RCA connector. The output of the RF modulator goes out through a coaxial cable to the antenna switch.
The antenna switch allows the user to select between television broadcasts and computer output. The television antenna connects to inputs on the switch, and the switch output connects to the back of the television. The connections use screw terminals with spade lugs. Moving the switch from "TV" to "GAME PLAY" selects the computer output.
The modulator presents a color signal on UHF channel 33.
References
Audiovisual connectors
Consumer electronics
Computer-related introductions in 1978
Apple II peripherals |
https://en.wikipedia.org/wiki/Adesto%20Technologies | Adesto Technologies is an American corporation founded in 2006 and based in Santa Clara, California. The company provides application-specific semiconductors and embedded systems for the Internet of Things (IoT), and sells its products directly to original equipment manufacturers (OEMs) and original design manufacturers (ODMs) that manufacture products for its end customers. In 2020, Adesto was bought by Dialog Semiconductor.
History
Adesto Technologies was founded by Narbeh Derhacobian, Shane Hollmer, and Ishai Naveh in 2006. Derhacobian formerly served in senior technical and managerial roles at AMD, Virage Logic, and Cswitch Corporations. The company developed a non-volatile memory based on the movement of copper ions in a programmable metallization cell technology licensed from Axon Technologies Corp., a spinoff of Arizona State University.
In October 2010, Adesto acquired intellectual property and patents related to Conductive Bridging Random Access Memory (CBRAM) technology from Qimonda AG, and their first CBRAM product began production in 2011.
In 2015, the company held an initial public offering under the symbol IOTS, which entered the market at $5 per share. Underwriters included Needham & Company, Oppenheimer & Co. Inc., and Roth Capital Partners. The entire offering was valued at $28.75 million.
Between May and September 2018, Adesto completed two acquisitions of S3 Semiconductors and Echelon Corporation. In May, the company acquired S3 Semiconductors, a provider of analog and mixed-signal ASICs and Intellectual Property (IP) cores. In June, the company announced its intention to buy Echelon Corporation, a home and industrial automation company, for $45 million. The acquisition was completed three months later. The company's offerings were expanded to include ASICs and IP from S3 Semiconductors and embedded systems from Echelon Corporation, in addition to its original non-volatile memory (NVM) products.
In 2020, Adesto was acquired by Dialog Semicon |
https://en.wikipedia.org/wiki/Mario%20Klingemann | Mario Klingemann (born 1970 in Laatzen, Lower Saxony) is a German artist best known for his work involving neural networks, code, and algorithms. Klingemann was a Google Arts and Culture resident from 2016 to 2018, and he is considered as a pioneer in the use of computer learning in the arts. His works examine creativity, culture, and perception through machine learning and artificial intelligence, and have appeared at the Ars Electronica Festival, the Museum of Modern Art New York, the Metropolitan Museum of Art New York, the Photographers’ Gallery London, the Centre Pompidou Paris, and the British Library. Today he lives in Munich, where, in addition to his art under the name "Dog & Pony", he still runs a creative free space between gallery and Wunderkammer with the paper artist Alexandra Lukaschewitz.
In 2018 his work The Butcher's Son won the Lumen Prize Gold Award 2018 by working with figurative visual input.
Mario Klingemann is part of ONKAOS, the new media artist support programme of Colección SOLO. In collaboration with ONKAOS he has created works such as Memories of Passerby I, the first work made with AI to be auctioned at Sotheby's in 2019.
In 2020, Mario Klingemann won an Honorary Mention in the Prix Ars Electronica with his AI installation Appropriate Response.
In 2023, with the support of ONKAOS, Klingemann presented A.I.C.C.A., a performative sculpture in the form of a dog capable of elaborating art critiques thanks to AI programming.
References
External links
Quasimondo
Twitter feed
X Degrees of Separation Google Arts & Culture Experiments
Interview with Bayerischer Rundfunk (German)
Presentation at Beyond Tellerrand conference, Dusseldorf, Germany 2017
Artificial intelligence art
Artificial intelligence researchers
Digital artists
German conceptual artists
Living people
1970 births |
https://en.wikipedia.org/wiki/Robophysics | Robophysics is an emerging scientific field to understand the physical principles of how robots move in the complex real world, analogous to biophysics to understand the motions of biological systems. This emerging area has demonstrated the need for a physics of robotics and reveal interesting problems at the interface of nonlinear dynamics, soft matter, control and biology.
References
Terrestrial locomotion
Robot locomotion |
https://en.wikipedia.org/wiki/Fine-Resolution%20Epithermal%20Neutron%20Detector | The Fine-Resolution Epithermal Neutron Detector (FREND) is a neutron detector that is part of the instrument payload on board the Trace Gas Orbiter (TGO), launched to Mars in March 2016. This instrument is currently mapping hydrogen levels to a maximum depth of beneath the Martian surface, thus revealing shallow water ice distribution. This instrument has an improved resolution of 7.5 times over the one Russia contributed to NASA's 2001 Mars Odyssey orbiter.
Overview
FREND can provide information while orbiting Mars on the presence of hydrogen, in the form of water or hydrated minerals in the top of the Martian surface. Locations where hydrogen is found may indicate water-ice deposits, which is one of the key ingredients for life. Mapping ground ice could also be useful for future resource utilization (ISRU) and crewed missions.
FREND also features a dosimeter to monitor the radiation environment along its orbit around Mars.
Objectives
The main science objective of the instrument is to carry out high spatial resolution mapping of epithermal and fast neutron fluxes from the Martian surface. FREND will work in synergy and complement orbital and ground data as measured the Dynamic Albedo of Neutrons (DAN) instrument on the Curiosity rover, the ADRON-RM instrument on the Rosalind Franklin rover and the ADRON-EM on the Kazachok.
The second goal of FREND is to use its dosimeter to measure the radiation dose at the TGO orbit from energetic particles of galactic cosmic rays and solar flares. The data will be used to estimate exposure levels of spacecraft and maintain radiation safety of crewed interplanetary flights.
Principle and development
Cosmic rays are sufficiently energetic to break apart atoms in the top one or two metres of Mars' surface, releasing high-energy neutrons, which can be measured by FREND instrument. The distribution of neutron velocities measured reveals the hydrogen content, which are a good indicator of hydrogen abundance —water or hydrat |
https://en.wikipedia.org/wiki/Polynomial%20solutions%20of%20P-recursive%20equations | In mathematics a P-recursive equation can be solved for polynomial solutions. Sergei A. Abramov in 1989 and Marko Petkovšek in 1992 described an algorithm which finds all polynomial solutions of those recurrence equations with polynomial coefficients. The algorithm computes a degree bound for the solution in a first step. In a second step an ansatz for a polynomial of this degree is used and the unknown coefficients are computed by a system of linear equations. This article describes this algorithm.
In 1995 Abramov, Bronstein and Petkovšek showed that the polynomial case can be solved more efficiently by considering power series solution of the recurrence equation in a specific power basis (i.e. not the ordinary basis ).
Other algorithms which compute rational or hypergeometric solutions of a linear recurrence equation with polynomial coefficients also use algorithms which compute polynomial solutions.
Degree bound
Let be a field of characteristic zero and a recurrence equation of order with polynomial coefficients , polynomial right-hand side and unknown polynomial sequence . Furthermore denotes the degree of a polynomial (with for the zero polynomial) and denotes the leading coefficient of the polynomial. Moreover letfor where denotes the falling factorial and the set of nonnegative integers. Then . This is called a degree bound for the polynomial solution . This bound was shown by Abramov and Petkovšek.
Algorithm
The algorithm consists of two steps. In a first step the degree bound is computed. In a second step an ansatz with a polynomial of that degree with arbitrary coefficients in is made and plugged into the recurrence equation. Then the different powers are compared and a system of linear equations for the coefficients of is set up and solved. This is called the method undetermined coefficients. The algorithm returns the general polynomial solution of a recurrence equation.
algorithm polynomial_solutions is
input: Linear recurrence |
https://en.wikipedia.org/wiki/Abramov%27s%20algorithm | In mathematics, particularly in computer algebra, Abramov's algorithm computes all rational solutions of a linear recurrence equation with polynomial coefficients. The algorithm was published by Sergei A. Abramov in 1989.
Universal denominator
The main concept in Abramov's algorithm is a universal denominator. Let be a field of characteristic zero. The dispersion of two polynomials is defined aswhere denotes the set of non-negative integers. Therefore the dispersion is the maximum such that the polynomial and the -times shifted polynomial have a common factor. It is if such a does not exist. The dispersion can be computed as the largest non-negative integer root of the resultant . Let be a recurrence equation of order with polynomial coefficients , polynomial right-hand side and rational sequence solution . It is possible to write for two relatively prime polynomials . Let andwhere denotes the falling factorial of a function. Then divides . So the polynomial can be used as a denominator for all rational solutions and hence it is called a universal denominator.
Algorithm
Let again be a recurrence equation with polynomial coefficients and a universal denominator. After substituting for an unknown polynomial and setting the recurrence equation is equivalent toAs the cancel this is a linear recurrence equation with polynomial coefficients which can be solved for an unknown polynomial solution . There are algorithms to find polynomial solutions. The solutions for can then be used again to compute the rational solutions .
algorithm rational_solutions is
input: Linear recurrence equation .
output: The general rational solution if there are any solutions, otherwise false.
Solve for general polynomial solution
if solution exists then
return general solution
else
return false
end if
Example
The homogeneous recurrence equation of order over has a rational solution. I |
https://en.wikipedia.org/wiki/P-recursive%20equation | In mathematics a P-recursive equation is a linear equation of sequences where the coefficient sequences can be represented as polynomials. P-recursive equations are linear recurrence equations (or linear recurrence relations or linear difference equations) with polynomial coefficients. These equations play an important role in different areas of mathematics, specifically in combinatorics. The sequences which are solutions of these equations are called holonomic, P-recursive or D-finite.
From the late 1980s, the first algorithms were developed to find solutions for these equations. Sergei A. Abramov, Marko Petkovšek and Mark van Hoeij described algorithms to find polynomial, rational, hypergeometric and d'Alembertian solutions.
Definition
Let be a field of characteristic zero (for example ), polynomials for , a sequence and an unknown sequence. The equationis called a linear recurrence equation with polynomial coefficients (all recurrence equations in this article are of this form). If and are both nonzero, then is called the order of the equation. If is zero the equation is called homogeneous, otherwise it is called inhomogeneous.
This can also be written as where is a linear recurrence operator with polynomial coefficients and is the shift operator, i.e. .
Closed form solutions
Let or equivalently be a recurrence equation with polynomial coefficients. There exist several algorithms which compute solutions of this equation. These algorithms can compute polynomial, rational, hypergeometric and d'Alembertian solutions. The solution of a homogeneous equation is given by the kernel of the linear recurrence operator: . As a subspace of the space of sequences this kernel has a basis. Let be a basis of , then the formal sum for arbitrary constants is called the general solution of the homogeneous problem . If is a particular solution of , i.e. , then is also a solution of the inhomogeneous problem and it is called the general solution of the inhomoge |
https://en.wikipedia.org/wiki/Mythily%20Ramaswamy | Mythily Ramaswamy (born 6 June 1954) is an Indian mathematician and professor in the Department of Mathematics at the TIFR Centre for Applicable Mathematics of the Tata Institute of Fundamental Research in Bangalore. Her research involves functional analysis and controllability of partial differential equations.
Education
Ramaswamy was born near Mumbai, to a banking family, but moved often to other parts of India as a child.
She obtained her doctorate in 1990 from Pierre and Marie Curie University in Paris. Her dissertation, Sur des questions de symetrie dans des problemes elliptiques [On questions of symmetry in elliptic problems] was supervised by Henri Berestycki.
Recognition
Ramaswamy was the 2004 winner of the Kalpana Chawla Award of the Karnataka State Council for Science and Technology, "given to a young woman scientist for achievements in the field of science and technology".
She was elected to the Indian Academy of Sciences in 2007. She became a Fulbright Scholar for 2016–2017, funding her to visit Michael Renardy at Virginia Tech.
References
1954 births
Living people
Indian mathematicians
Women mathematicians
Control theorists
Mathematical analysts
Pierre and Marie Curie University alumni
Academic staff of Tata Institute of Fundamental Research |
https://en.wikipedia.org/wiki/Advanced%20Electric%20Propulsion%20System | Advanced Electric Propulsion System (AEPS) is a solar electric propulsion system for spacecraft that is being designed, developed and tested by NASA and Aerojet Rocketdyne for large-scale science missions and cargo transportation. The first application of the AEPS is to propel the Power and Propulsion Element (PPE) of Gateway, to be launched in 2024. The PPE module is built by Maxar space solutions in Palo Alto, California. Two identical AEPS engines would consume 25 kW being generated by the roll-out solar array (ROSA) assembly, which can produce over 60 kW of power.
The Power and Propulsion Element (PPE) for the Lunar Gateway will have a mass of 8-9 metric tons and will be capable of generating 50 kW of solar electric power for its Hall-effect thrusters for maneuverability, which can be supported by chemical monopropellant thrusters for high-thrust attitude control maneuvers.
Overview
Solar-electric propulsion has been shown to be reliable and efficient, and allows a significant mass reduction of spacecraft. High-power solar electric propulsion is a key technology that has been prioritized because of its significant exploration benefits in cis-lunar space and crewed missions to Mars.
The AEPS Hall thruster system was originally developed since 2015 by NASA Glenn Research Center and the Jet Propulsion Laboratory to be used on the now canceled Asteroid Redirect Mission. Work on the thruster did not stop following the mission cancellation in April 2017 because there is demand of such thrusters for a range of NASA, defense and commercial missions in deep space. Since May 2016, further work on AEPS has been transitioned to Aerojet Rocketdyne that is currently designing and testing the engineering-model hardware. This is a contract worth $65 million, where Aerojet Rocketdyne developed, qualified and will deliver five 12.5 kW Hall thruster subsystems, including thrusters, PPUs and xenon flow controllers.
Design
AEPS is based on the 12.5 kW development model thruster |
https://en.wikipedia.org/wiki/CBRP | CBRP, or Cluster Based Routing Protocol, is a routing protocol for wireless mesh networks. CBRP was originally designed in mid 1998 by the National University of Singapore and subsequently published as an Internet Draft in August 1998. CBRP is one of the earlier hierarchical ad-hoc routing protocols. In CBRP, nodes dynamically form clusters to maintain structural routing support and to minimize excessive discovery traffic typical for ad-hoc routing.
Many performance studies on CBRP have been conducted in the area of Vehicular Ad-Hoc Network (VANET). CBRP is shown to perform moderately well in large and high density mesh networks
See also
Wireless ad hoc networks
Mesh networking
List of Ad Hoc Routing Protocols
References
Ad hoc routing protocols
Mesh networking |
https://en.wikipedia.org/wiki/Zhihong%20Xia | Zhihong "Jeff" Xia (; born 20 September 1962, in Dongtai, Jiangsu, China) is a Chinese-American mathematician.
Education and career
Xia received, in 1982, from Nanjing University a bachelor's degree in astronomy and in 1988, a PhD in mathematics from Northwestern University with thesis advisor Donald G. Saari, for his thesis, The Existence of the Non-Collision Singularities. From 1988 to 1990, Xia was an assistant professor at Harvard University and from 1990 to 1994, an associate professor at Georgia Institute of Technology (and Institute Fellow). In 1994, he became a full professor at Northwestern University and since 2000, he has been the Arthur and Gladys Pancoe Professor of Mathematics.
His research deals with celestial mechanics, dynamical systems, Hamiltonian dynamics, and ergodic theory. In his dissertation, he solved the Painlevé conjecture, a long-standing problem posed in 1895 by Paul Painlevé. The problem concerns the existence of singularities of non-collision character in the -body problem in three-dimensional space; Xia proved the existence for . For the existence proof, he constructed an example of five masses, of which four are separated into two pairs which revolve around each other in eccentric elliptical orbits about the z-axis of symmetry, and a fifth mass moves along the z-axis. For selected initial conditions, the fifth mass can be accelerated to an infinite velocity in a finite time interval (without any collision between the bodies involved in the example). The case was open until 2014, when it was solved by Jinxin Xue. For , Painlevé had proven that the singularities (points of the orbit in which accelerations become infinite in a finite time interval) must be of the collision type. However, Painlevé's proof did not extend to the case .
In 1993, Xia was the inaugural winner of the Blumenthal Award of the American Mathematical Society. From 1989 to 1991, he was a Sloan Fellow. From 1993 to 1998, he received the National Young Investigat |
https://en.wikipedia.org/wiki/Base62 | The base62 encoding scheme uses 62 characters. The characters consist of the capital letters A-Z, the lower case letters a-z and the numbers 0–9. It is a binary-to-text encoding scheme that represents binary data in an ASCII string format.
123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz
= 58 characters = base58
0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz
= 62 characters = base62
0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz+/
= 64 characters = base64
In some fonts the 0 (zero), I (capital i), O (capital o) and l (lower case L) characters look the same, and thus are not used in the base58 encoding scheme.
Base62 table
The Base62 index table:
See also
List of numeral systems
References
Internet Standards
Binary-to-text encoding formats
Data serialization formats |
https://en.wikipedia.org/wiki/Woldemar%20Weyl | Woldemar Anatol Weyl (1901 – July 30, 1975) was a German-born scientist.
Weyl taught at the Kaiser Wilhelm Institute between 1932 and 1936, when he began traveling to the United States as a visiting professor at Pennsylvania State University. Due to the increasing influence of the Nazi Party, Weyl choose not to return to Germany and was offered full tenure at PSU in 1938. In 1960, Weyl and mathematician Haskell Curry were appointed to the first two Evan Pugh Professorships at Penn State. Weyl died in State College, Pennsylvania on July 30, 1975, aged 74.
References
1901 births
1975 deaths
Emigrants from Nazi Germany to the United States
20th-century American scientists
Glass engineering and science |
https://en.wikipedia.org/wiki/Brain-specific%20homeobox | Brain-specific homeobox is a protein that in humans is encoded by the BSX gene.
Structure and expression pattern
Bsx is an evolutionarily highly-conserved homeodomain-containing transcription factor that belongs to the ANTP-class. In mouse it has been shown to be expressed in the telencephalic septum, pineal gland, the mammillary bodies and arcuate nucleus.
Function in the hypothalamus
In the hypothalamic arcuate nucleus, Bsx has been demonstrated to be necessary for normal expression levels of the two orexigenic neuropeptides Agouti-related peptide and Neuropeptide Y.
Function in the pineal gland
In the pineal gland of the clawed frog Xenopus, Bsx is expressed following the circadian rhythm and controls photoreceptor cell differentiation. In zebrafish Bsx is required for normal development of all cell types within the pineal gland, including melatonin-releasing pinealocytes, photoreceptor cells and leftwards migrating parapineal cells, which in zebrafish are crucial for the establishment of brain asymmetry.
References
Brain
Proteins
Transcription factors
Genes
Molecular biology |
https://en.wikipedia.org/wiki/Blakiston%27s%20Line | The Blakiston Line or Blakiston's Line is a faunal boundary line drawn between two of the four largest islands of Japan: Hokkaidō in the north and Honshū, south of it. It can be compared with faunal boundary lines like the Wallace Line. Certain animal species can only be found north of Blakiston's Line, while certain other species can only be found south of it.
Thomas Blakiston, who lived in Japan from 1861 to 1884 and who spent much of that time in Hakodate, Hokkaido, was the first person to notice that animals in Hokkaidō, Japan's northern island, were related to northern Asian species, whereas those on Honshū to the south were related to those from southern Asia. The Tsugaru Strait between the two islands was therefore established as a zoogeographical boundary, and became known as Blakiston's Line. This finding was first published to the Asiatic Society of Japan in a paper of 14 February 1883, named Zoological Indications of Ancient Connection of the Japan islands with the Continent.
Explanations and hypotheses on the existence of Blakiston's Line
The difference in the fauna can probably be attributed to land bridges that may have existed in the past. Whilst Hokkaido may have had land bridges to the north of Asia, via Sakhalin and the Kuril Islands, the other islands of Japan like Honshu, Shikoku and Kyushu, may have been connected to the Asian continent via the Korean Peninsula. As to when these land bridges existed, scientists do not agree. It may have been between 26,000 and 18,000 years ago, it may have been later than that. Sakhalin, the island just north of Japan, and Hokkaido may even have been connected to the mainland as recently as 10,000 years ago or less. Apart from these former land bridges, there are more factors that play a role in why there is a difference in the fauna north and south of the line:
The Tsugaru Strait is relatively deep, the maximum depth is 449 m.
The narrowest part of the Tsugaru Strait is 12.1 miles (19.5 km).
Currents in |
https://en.wikipedia.org/wiki/Business%20Controls%20Corporation | Business Controls Corporation is a privately held computer company
that developed an application-program-generator and also a series of accounting software packages. These packages were widely enough used for various business magazines to have back-of-the-book ads for companies seeking accountants with experience in one or more of them.
Computer magazines ran coverage for their SB-5 application-program-generator as from time to time new versions were released, each with new or improved features.
Early days
The company's initial offerings were packages for the DEC PDP-8, although Business Controls Corporation also wrote custom-written programs for customers.
Large customers with mainframes who also used smaller systems for departmental use and distributed processing also used BCC's services.
SB-5
The addition of an application-program-generator named SB-5 that, from specifications, could generate COBOL code was a major step forward. Although this began with supporting the DEC PDP-11, they subsequently began to support COBOL on DEC's DECsystem-10 & DECSYSTEM-20. VAX support came later.
The specifications also permitted COBOL inserts and overrides: SB-5 could build an application that was all COBOL, yet only code the portions that varied from BCC's "vanilla" accounting packages.
Similar offerings
A similar idea was done for the IBM mainframe world in the form of a series of application-program-generators from Dylakor Corporation. They were named DYL-250, DYL-260, DYL-270 & DYL-280. Dylakor was acquired by Computer Associates.
The specific syntax was different, but it had wider use, and - a mark of success and recognition in the industry - syntax-compatible implementations were released by a competitor.
Still another alternative was Peat Marwick Mitchell's PMM2170 application-program-generator package. Like the others, it supported COBOL inserts and overrides.
Extended integration
Business Controls Corporation subsequently extended SB-5's feature set to provid |
https://en.wikipedia.org/wiki/Column%20level%20encryption | Column level encryption is a type of database encryption method that allows user to select specific information or attributes to be encrypted instead of encrypting the entire database file. To understand why column level encryption is different from other encryption methods like file level encryption, disk encryption, and database encryption, a basic understanding of encryption is required.
Generally, when data are being collected and stored as records, those records will appear in a tabular format in rows in the database with each rows logging specific attributes. Some data can be more sensitive than others, for example, data of birth, social security number, home address, etc., which can act as a personal identification. In order to ensure that these private information is transferred and stored securely, data goes through encryption, which is the process of encoding plaintext into ciphertext. Non-designated readers or receivers will not be able to read the data without the decryption key. Another example to illustrate this concept is, given a database stores client's phone numbers. The set of phone numbers will appear to most readers as gibberish alphanumerical text with a mix of symbols, totally useless to those who do not have access privilege to view the data in plaintext (original form).
Because not all stored data are always sensitive and important, column level encryption was created to allow users the flexibility in choosing what sort of attributes should or should not be encrypted. This is to minimize performance disruption when executing crypto algorithms by moving data in and out of devices.
Application and advantages
The technology has been adopted by many encryption software companies around the world, including IBM, MyDiamo (Penta Security), Oracle and more. Column level encryption does not store the same encryption key like table encryption does but rather separate keys for each column. This method minimizes the probability of unauthorized access |
https://en.wikipedia.org/wiki/UTAMS%20Motor%2C%20Rocket%2C%20Explosive%20Detector | Unattended Transient Acoustic MASINT Sensor (UTAMS) Mortar, Rocket, Explosive Locator System is an acoustic localization sensor system developed by the Sensors and Electronic Devices Directorate (SEDD) of the U.S. Army Research Laboratory (ARL) in 2004. This technology is utilized to detect and isolate transient events such as mortar or rocket firings, munition impacts, and other explosive events. It consists of an array of acoustic sensor stations that are linked via radio to a receiving base. Each sensor has the ability to monitor hostile territory, international borders, and/or detect indirect weapon fire covertly with 24-hour surveillance. These small, inexpensive, non-imaging sensors can monitor large areas without a significant need for power sources and manpower.
System concept
Three to five acoustic arrays are set up in a roughly equilateral configuration several hundred meters from each other. Each array detects an impulsive event such as motor/rocket launch and determines the line of bearing from the array to the launch site. The lines of bearing from each array are transmitted via radio link to a central point where the results are combined to establish the location of the firing point through triangulation. Impact points are detected and located the same way. Results are displayed on a georeferenced map as icons using a laptop PC. The system generally detects the weapons out to their maximum range and screens out false results due to local noises from vehicles, people, etc.
UTAMS can locate the x, y, and z directions from an acoustic signal and are sensitive in the 20–500 Hz frequency range. Noise canceling algorithms produced a continuous resonance that UTAMS separated out through adaptive filtering. Processing for infra-sound was combined with acoustic microphones and deployed in Iraq with smaller sensor arrays to detect rockets, small arms, and mortars.
History
In 2001, ARL fielded infrasonic sensors (<20 Hz) in the Republic of Korea to meet a U.S. |
https://en.wikipedia.org/wiki/ZX-calculus | The ZX-calculus is a rigorous graphical language for reasoning about linear maps between qubits, which are represented as string diagrams called ZX-diagrams. A ZX-diagram consists of a set of generators called spiders that represent specific tensors. These are connected together to form a tensor network similar to Penrose graphical notation. Due to the symmetries of the spiders and the properties of the underlying category, topologically deforming a ZX-diagram (i.e. moving the generators without changing their connections) does not affect the linear map it represents. In addition to the equalities between ZX-diagrams that are generated by topological deformations, the calculus also has a set of graphical rewrite rules for transforming diagrams into one another. The ZX-calculus is universal in the sense that any linear map between qubits can be represented as a diagram, and different sets of graphical rewrite rules are complete for different families of linear maps. ZX-diagrams can be seen as a generalisation of quantum circuit notation.
History
The ZX-calculus was first introduced by Bob Coecke and Ross Duncan in 2008 as an extension of the categorical quantum mechanics school of reasoning. They introduced the fundamental concepts of spiders, strong complementarity and most of the standard rewrite rules.
In 2009 Duncan and Perdrix found the additional Euler decomposition rule for the Hadamard gate, which was used by Backens in 2013 to establish the first completeness result for the ZX-calculus. Namely that there exists a set of rewrite rules that suffice to prove all equalities between stabilizer ZX-diagrams, where phases are multiples of , up to global scalars. This result was later refined to completeness including scalar factors.
Following an incompleteness result, in 2017, a completion of the ZX-calculus for the approximately universal fragment was found, in addition to two different completeness results for the universal ZX-calculus (where phases are allow |
https://en.wikipedia.org/wiki/Edward%20Norman%20Dancer | Edward Norman Dancer FAA (born 29 December 1946, Bundaberg, Queensland, Australia) is an Australian mathematician, specializing in nonlinear analysis.
Dancer received in 1969 a Bachelor of Science with Honours (BSc (Hons)) from the Australian National University and in 1972 a PhD from the University of Cambridge with thesis advisor Frank Smithies and thesis Bifurcation in Banach Spaces. As a postdoc Dancer was from 1971 to 1972 at the University of Newcastle-upon-Tyne, UK and from 1972 to 1973 at the Institute of Advanced Studies at the Australian National University. At the University of New England in New South Wales, he was from 1973 to 1975 a lecturer, from 1976 to 1981 a senior lecturer, from 1981 to 1987 an associate professor, and from 1987 to 1993 a full professor. From 1993 to the present, he has been a full professor and chair of the school of mathematics and statistics at the University of Sydney.
Dancer is also a part time professor at Swansea University.
Honours and awards
1996 — elected a Fellow of the Australian Academy of Science (FAA)
2002 — Humboldt Research Award received from the Humboldt Foundation and Helmholtz Association
2009 — Hannan Medal awarded by the Australian Academy of Science
2010 — Invited Speaker at the International Congress of Mathematicians in Hyderabad
2017 — Schauder Medal
Selected publications
with Ralph S. Phillips:
with Peter Hess:
with Shusen Yan:
with Yihong Du:
with Juncheng Wei and Tobias Weth:
with Kelei Wang and Zhitao Zhang:
References
20th-century Australian mathematicians
21st-century Australian mathematicians
Fellows of the Australian Academy of Science
Mathematical analysts
Dynamical systems theorists
Australian National University alumni
Alumni of the University of Cambridge
Academic staff of the University of New England (Australia)
Academic staff of the University of Sydney
1946 births
Living people |
https://en.wikipedia.org/wiki/CLUPI | CLUPI (Close-UP Imager) is a miniaturized camera system on board the planned European Space Agency Rosalind Franklin rover. CLUPI was designed to acquire high-resolution close-up images in colour of soils, outcrops, rocks, drill fines and drill core samples, as well as and the search for potential biosignature structures and patterns. This camera assembly is part of the science payload on board the European Space Agency Rosalind Franklin rover, tasked to search for biosignatures and biomarkers on Mars. The rover is planned to be launched in August–October 2022 and land on Mars in spring 2023.
Overview
The CLUPI instrument is being developed by a Swiss–French consortium supported by the Swiss Space Office and the French Space Agency (CNES). Its Principal Investigator is Jean-Luc Josset, from the Space Exploration Institute, Neuchatel in Switzerland. Frances Westall and Beda Hofmann are Co-PIs. The science team includes scientists from Canada, Europe and Russia, especially for biosignature recognition. Instrument field tests started in 2009 with preliminary CLUPI systems tested during several Arctic winters.
CLUPI will be mounted on the movable rover's drill box and it will acquire high-resolution, close-up images in colour of the texture, structure and morphology of rocks and soil. The resolution will be similar to what geologists would obtain by using a hand-held magnifying lens: at a distance of 10 cm from the target, the maximum resolution is 7 µm/pixel. Its field of view can be changed by the use of two fixed, flat mirrors (FOV2 and FOV3). The CLUPI visual images will complement those provided by PanCam to provide the context necessary for interpretation of mineralogy and potential visible biosignatures.
CLUPI will observe the drilling area very closely from different angles to help characterise rock structures such as embedded crystals and fractures. After the drill has been used and retracted, CLUPI will be used to image the amount and appearance of dis |
https://en.wikipedia.org/wiki/Veiling%20glare | Veiling glare is an imperfection of performance in optical instruments (such as cameras and telescopes) arising from incoming light that strays from the normal image-forming paths, and reaches the focal plane. The effect superimposes a form of noise onto the normal image sensed by the detector (film, digital sensor, or eye viewing through an eyepiece), resulting in a final image degraded by loss of contrast and reduced definition.
Scenes
In scenes where a bright object is next to a faint object, veiling glare from the bright object may hide the faint object from view, even though the instrument is otherwise capable of spatially resolving the two. Veiling glare is a limiting factor in high-dynamic-range imaging.
Glare in optical instruments differs from glare in vision, even though they both follow the same physical principles, because the phenomenon arises from mechanical versus physiological features.
Factors and design techniques
Light strays or scatters in lenses due to many potential factors in design and operation. These factors include dirt, film, or scratches on lens surfaces; reflections from lens surfaces or their mounts; and the slightly imperfect transparency (or reflection) of real glass (or mirrors).
Typical optical engineering design techniques to minimize stray light include: black coatings on internal surfaces, knife edges on mounts, antireflection lens coatings, internal baffles and stops, and tube extensions which block sources outside the field of view.
Veiling glare is a performance factor tested by UL standard 2802, Testing and Certification for the Performance of Video Cameras.
References
Optical metrology
Photometry
Geometrical optics
Geometric centers
Science of photography |
https://en.wikipedia.org/wiki/Kernel-phase | Kernel-phases are observable quantities used in high resolution astronomical imaging used for superresolution image creation. It can be seen as a generalization of closure phases for redundant arrays. For this reason, when the wavefront quality requirement are met, it is an alternative to aperture masking interferometry that can be executed without a mask while retaining phase error rejection properties. The observables are computed through linear algebra from the Fourier transform of direct images. They can then be used for statistical testing, model fitting, or image reconstruction.
Prerequisites
In order to extract kernel-phases from an image, some requirements must be met:
Images are nyquist-sampled (at least 2 pixels per resolution element ())
Images are taken in near monochromatic light
Exposure time is shorter than the timescale of aberrations
Strehl ratio is high (good adaptive optics)
Linearity of the pixel response (i.e. no saturation)
Deviations from these requirements are known to be acceptable, but lead to observational bias that should be corrected by the observation of calibrators.
Definition
The method relies on a discrete model of the instrument's pupil plane and the corresponding list of baselines to provide corresponding vectors of pupil plane errors and of image plane Fourier Phases. When the wavefront error in the pupil plane is small enough (i.e. when the Strehl ratio of the imaging system is sufficiently high), the complex amplitude associated to the instrumental phase in one point of the pupil , can be approximated by . This permits the expression of the pupil-plane phase aberrations to the image plane Fourier phase as a linear transformation described by the matrix :
Where is the theoretical Fourier phase vector of the object. In this formalism, singular value decomposition can be used to find a matrix satisfying . The rows of constitute a basis of the kernel of .
The vector is called the kernel-phase vector of observab |
https://en.wikipedia.org/wiki/Andreas%20Seeger | Andreas Seeger is a mathematician who works in the field of harmonic analysis. He is a professor of mathematics at the University of Wisconsin–Madison. He received his PhD from Technische Universität Darmstadt in 1985 under the supervision of Walter Trebels.
He was elected a fellow of the American Mathematical Society in 2014 for his contributions to Fourier integral operators, local smoothing,
oscillatory integrals, and Fourier multipliers. In 2017, he was awarded the Humboldt Prize.
He was awarded a Simons Fellowship in 2019.
References
External links
Living people
Year of birth missing (living people)
Place of birth missing (living people)
Nationality missing
20th-century German mathematicians
21st-century German mathematicians
University of Wisconsin–Madison faculty
Technische Universität Darmstadt alumni
Fellows of the American Mathematical Society
Mathematical analysts |
https://en.wikipedia.org/wiki/Information-centric%20networking%20caching%20policies | In computing, cache algorithms (also frequently called cache replacement algorithms or cache replacement policies) are optimizing instructionsor algorithmsthat a computer program or a hardware-maintained structure can follow in order to manage a cache of information stored on the computer. When the cache is full, the algorithm must choose which items to discard to make room for the new ones. Due to the inherent caching capability of nodes in Information-centric networking ICN, the ICN can be viewed as a loosely connect network of caches, which has unique requirements of Caching policies. Unlike proxy servers, in Information-centric networking the cache is a network level solution. Therefore, it has rapidly changing cache states and higher request arrival rates; moreover, smaller cache sizes further impose different kind of requirements on the content eviction policies. In particular, eviction policies for Information-centric networking should be fast and lightweight. Various cache replication and eviction schemes for different Information-centric networking architectures and applications are proposed.
Policies
Time aware least recently used (TLRU)
The Time aware Least Recently Used (TLRU) is a variant of LRU designed for the situation where the stored contents in cache have a valid life time. The algorithm is suitable in network cache applications, such as information-centric networking (ICN), content delivery networks (CDNs) and distributed networks in general. TLRU introduces a new term: TTU (Time to Use). TTU is a time stamp of a content/page which stipulates the usability time for the content based on the locality of the content and the content publisher announcement. Owing to this locality based time stamp, TTU provides more control to the local administrator to regulate in network storage.
In the TLRU algorithm, when a piece of content arrives, a cache node calculates the local TTU value based on the TTU value assigned by the content publisher. The local TTU |
https://en.wikipedia.org/wiki/Aluthge%20transform | In mathematics and more precisely in functional analysis, the Aluthge transformation is an operation defined on the set of bounded operators of a Hilbert space. It was introduced by Ariyadasa Aluthge to study p-hyponormal linear operators.
Definition
Let be a Hilbert space and let be the algebra of linear operators from to . By the polar decomposition theorem, there exists a unique partial isometry such that and , where is the square root of the operator . If and is its polar decomposition, the Aluthge transform of is the operator defined as:
More generally, for any real number , the -Aluthge transformation is defined as
Example
For vectors , let denote the operator defined as
An elementary calculation shows that if , then
Notes
References
External links
Bilinear forms
Matrices
Topology |
https://en.wikipedia.org/wiki/WatchGuard | WatchGuard, formally known as WatchGuard Technologies, Inc, is an American technology company based in Seattle, Washington. It specializes in network security solutions aimed at safeguarding computer networks from external threats such as malware and ransomware.
The company was founded in 1996.
History
WatchGuard was initially established in 1996 under the name Seattle Software Labs, Inc. Its inaugural product was a network firewall known as the WatchGuard Security Management System, which included the WatchGuard Firebox, a "firewall in a box" security appliance, along with configuration and administration software.
In 1997, the company rebranded itself as WatchGuard Technologies, Inc.
Come July 1999, WatchGuard Technologies, Inc. went public, trading on Nasdaq.
In October 2006, the company was acquired for $151 million by private equity firms Francisco Partners and Vector Capital. Bruce Coleman assumed the role of interim CEO.
In August 2007, Joe Wang took over as the company's permanent CEO, succeeding Coleman.
In May 2014, CEO Wang stepped down, and interim CEO Michael Kohlsdorf, an operating partner with Francisco Partners, assumed leadership.
In April 2015, Kohlsdorf passed the CEO mantle to Prakash Panjwani. It was announced that both Panjwani and Kohlsdorf were joining WatchGuard's board.
In June 2016, the company acquired HawkEye G, a threat-detection and response technology from Hexis Cyber Solutions, now part of KEYW Holding Corp. In October, the company launched the WatchGuard Wi-Fi Cloud to expand its network security coverage to Wi-Fi networks.
In August 2017, WatchGuard acquired Datablink, a provider of multi-factor authentication software used to secure laptops, servers, and other devices.
In January 2018, the company acquired Percipient Networks, a domain name system service provider.
In July 2018, the company unveiled AuthPoint, an application designed to offer multi-factor authentication security for businesses.
In March 2020, WatchGu |
https://en.wikipedia.org/wiki/1995%20University%20of%20Maryland%20conference%20on%20crime%20and%20genetics | The University of Maryland hosted a 1995 conference to examine and discuss the relationship between genetics and crime. It took place from September 22 to 24 at the Aspen Institute in Queenstown, Maryland. It was originally planned for 1992, but was effectively cancelled after the original proposal was met with fierce backlash and accusations of racism.
Background
Originally planned 1992 conference
In 1992, UMD professor David Wasserman set out to organize a meeting to discuss the potential genetic bases for criminal behavior. The originally planned conference was entitled "Genetic Factors in Crime: Findings, Uses and Implications", and was scheduled to be held on the University of Maryland's College Park campus on October 9, 1992. It was to be funded by a $78,000 grant from the National Institutes of Health (NIH).
When the planned conference became known to the public, it faced swift backlash and condemnation from civil rights activists, as well as from Peter Breggin, a prominent critic of psychiatry. Breggin's claim that the conference was racist had attracted the attention of the Congressional Black Caucus, which subsequently joined Breggin in protesting the conference, as did the Association of Black Psychologists and the NAACP's Baltimore chapter. Wasserman responded to the conference's critics by saying that the conference would aim to critically examine, not promote, research linking genes to crime, but this did not satisfy its critics. The backlash to Alcohol, Drug Abuse, and Mental Health Administration then-director Frederick K. Goodwin's controversial statement earlier that year, which compared inner cities in the United States to "jungles", inspired further opposition. Breggin had publicly linked the planned conference both to Goodwin's remarks and to an anti-violence initiative that had recently been proposed by then-Secretary of Health and Human Services Louis Wade Sullivan.
In July 1992, the NIH's National Center for Human Genome Research revoked |
https://en.wikipedia.org/wiki/Hine%20Taimoa | Emily Jean Rawei (née Sizemore; 10 February 1873 – 15 October 1939), known by the stage name Hine Taimoa, was a New Zealand Māori lecturer and singer, with her husband, Wherahiko Francis Rawei, and other family members. The family toured internationally from the 1890s through the 1910s to demonstrate and speak on Māori culture.
Early life and family
Emily Jean Sizemore was born on 10 February 1873, the fourth daughter of James and Sarah Sizemore (née Thomson), and was of both Māori and European descent. Her paternal grandparents were whaler Richard Sizemore, who was the brother-in-law of Johnny Jones, and Waniwani also known as Waiuwaiu from the Bay of Islands area/and daughter of a Ngapuhi Rangatira . On 1 January 1893, Emily Sizemore married Francis Rawei at her mother's property, Woodend Farm, in Waikouaiti.
Career
The Rawei family toured internationally, singing, telling stories, and presenting a magic lantern show of hand-coloured scenes from Māori life in New Zealand. They started their travels in Australia in 1893, with a show called "Land of the Maori" that included Hine's sister, Hari Taimoa. "Her voice is full and beautiful, and her speech the essence of refinement," noted an 1898 Australian reporter of Hine Taimoa. The also made appearances in England, in 1897.
They toured the United States from their arrival at New York in 1903 into the 1910s, lecturing and performing on the Chautauqua and lyceum circuit in the United States and Canada. They also gave their presentation, titled "The New Zealanders in Song, Story, and Picture: From Cannibalism to Culture", at museums and teachers' conventions. Taimoa was also called upon to speak on women's suffrage (because New Zealand women had the vote before American women), on the preparation of food and clothing, and on American childrearing practices (she considered them less healthful compared to those of Māori parents). She was not impressed with life in Chicago, where the family were based during some of thei |
https://en.wikipedia.org/wiki/Cast-in-place%20concrete | Cast-in-place concrete or Cast-in-situ concrete is a technology of construction of buildings where walls and slabs of the buildings are cast at the site in formwork. This differs from precast concrete technology where slabs are cast elsewhere and then brought to the construction site and assembled. It uses concrete slabs for walls instead of bricks or wooden panels, and formwork is used for both walls and roof.
Advantages of this technology are strength of the building, insulation, and versatility for different types of buildings. A disadvantage is the high amount of labor required to install and remove formwork.
See also
Precast concrete
Formwork
References
Building engineering |
https://en.wikipedia.org/wiki/Periodic%20lateralized%20epileptiform%20discharges | Periodic lateralized epileptiform discharges are a type of EEG abnormality. They are one of the most frequent paroxystic complexes. They are basically triphasic with sharply contoured wave followed by a slow wave mostly occurring unilaterally with duration 100-300 msec and amplitude 100-300 often present with fast rhythm between discharges. In recent literature it is referred to as Lateralized periodic discharges.
References
Electroencephalography
Neuroscience |
https://en.wikipedia.org/wiki/Augmented%20Reality%20Sandtable | The Augmented Reality Sandtable (ARES) is an interactive, digital sand table that uses augmented reality (AR) technology to create a 3D battlespace map. It was developed by the Human Research and Engineering Directorate (HRED) at the Army Research Laboratory (ARL) to combine the positive aspects of traditional military sand tables with the latest digital technologies to better support soldier training and offer new possibilities of learning. It uses a projector to display a topographical map on top of the sand in a regular sandbox as well as a motion sensor that keeps track of changes in the layout of the sand to appropriately adjust the computer-generated terrain display.
An ARL study conducted in 2017 with 52 active duty military personnel (36 males and 16 females) found that the participants who used ARES spent less time setting up the table compared to participants who used a traditional sand table. In addition, ARES demonstrated a lower perceived workload score, as measured using the NASA Task Load Index (NASA-TLX) ratings, compared to the traditional sand table. However, there was no significant difference in post-knowledge test scores in recreating the visual map.
Development
The ARES project was one of the 25 ARL initiatives in development from 1995 to 2015 that focused on visualizing spatial data on virtual or sand table interfaces. It was developed by HRED's Simulation and Training Technology Center (STTC) with Charles Amburn as the principal investigator. Collaborations involved with ARES included Dignitas Technologies, Design Interactive (DI), the University of Central Florida's Institute for Simulation and Training, and the U.S. Military Academy at West Point.
ARES was largely designed to be a tangible user interface (TUI), in which digital information can be manipulated using physical objects such as a person's hand. It was constructed using commercial off-the-shelf components, including a projector, a laptop, an LCD monitor, Microsoft's Xbox Kinec |
https://en.wikipedia.org/wiki/Code%20stylometry | Code stylometry (also known as program authorship attribution or source code authorship analysis) is the application of stylometry to computer code to attribute authorship to anonymous binary or source code. It often involves breaking down and examining the distinctive patterns and characteristics of the programming code and then comparing them to computer code whose authorship is known. Unlike software forensics, code stylometry attributes authorship for purposes other than intellectual property infringement, including plagiarism detection, copyright investigation, and authorship verification.
History
In 1989, researchers Paul Oman and Curtis Cook identified the authorship of 18 different Pascal programs written by six authors by using “markers” based on typographic characteristics.
In 1998, researchers Stephen MacDonell, Andrew Gray, and Philip Sallis developed a dictionary-based author attribution system called IDENTIFIED (Integrated Dictionary-based Extraction of Non-language-dependent Token Information for Forensic Identification, Examination, and Discrimination) that determined the authorship of source code in computer programs written in C++. The researchers noted that authorship can be identified using degrees if flexibility in the writing style of the source code, such as:
The way the algorithm in the source code solves the given problem
The way the source code is laid out (spacing, indentation, bordering characteristics, standard headings, etc.)
The way the algorithm is implemented in the source code
The IDENTIFIED system attributed authorship by first merging all the relevant files to produce a single source code file and then subjecting it to a metrics analysis by counting the number of occurrences for each metric. In addition, the system was language-independent due to its ability to create new dictionary files and meta-dictionaries.
In 1999, a team of researchers led by Stephen MacDonell tested the performance of three different program author |
https://en.wikipedia.org/wiki/Cylindrical%20coordinate%20measuring%20machine | Cylindrical coordinate measuring machine or CCMM, is a special variation of a standard coordinate measuring machine (CMM) which incorporates a moving table to rotate the part relative to the probe. The probe moves perpendicular to the part axis and radial data is collected at regular angular intervals.
Description
Where the standard CMM uses a three dimensional Cartesian X, Y, Z system where each axis is orthogonal to the other, a Cylindrical Coordinate Measuring Machine omits the X or Y axis. The probe moves in only two axes (the vertical Z and either X or Y horizontal) and the rotating table positions the subject of inspection (a cylindrical part, hence the word "cylindrical" in the title) in a precise manner. The probe may be tactile in nature, or optical. Optical probing methods include laser interferometry and telecentric lensing.
Coordinate System
The CCMM coordinate system differs from standard cartesian coordinates in that it employs a rotating table. For this reason, a spherical coordinate system is employed to define the axis. A complete definition can be found here: The cylindrical coordinate system allows for the construction of crankshaft gages, transmission shaft gages and inspection machines for other shaft applications.
Uses
Where the standard CMM is suitable for prismatic parts, the Cylindrical CMM is ideally suited for cylindrical parts. Examples include camshafts, crankshafts, transmission shafts and other rotating parts with a length longer than their diameter. Parts with a length less than the diameter are typically measured on a roundness gauge.
Technology
The method for recording the angular position of the part will always make use of an optical encoder. However, the radial measurement probe may incorporate an optical technology, or tactile technology. Optical technologies include non-contact laser interferometry or shadow systems, while tactile systems use an optical grating.
Standardization
Standards similar to those u |
https://en.wikipedia.org/wiki/Loi%20pour%20une%20R%C3%A9publique%20num%C3%A9rique | The loi pour une République numérique (abr. loi numérique) is a French law first proposed by Axelle Lemaire, Secretary of State for Digital Affairs, voted on 7 October 2016.
This law enables the government to fulfill a two-fold purpose : "to give France a head start in the digital field by promoting an open data and knowledge policy" and to "adopt a progressive digital approach, based on individuals, to strengthen their power to act and their rights in the digital world". To do so, the law is organized around three lines: the circulation of data and knowledge, the protection of individuals in the digital society and access to digital for all.
The discussion began with an online public consultation, until 18 October 2015, then, enriched with some proposals from Internet users, the law was debated and voted in the National Assembly from 19 to 26 January 2016. It follows the "Digital Ambition" consultation led by Benoit Thieulin and Yann Bonnet, as part of the work of the National Digital Council.
It's a major IT law. It supersedes the Loi pour la confiance dans l'économie numérique (Confidence in the Digital Economy Act) of 2004.
Themes
The bill voted by MEPs at first reading introduces in particular the default opening of public data, net neutrality, an obligation of loyalty for online platforms, as well as increased protection for the personal data of Internet users. The law for a digital Republic also provides the conditions of an Internet accessible to the greatest number, through the acceleration of the coverage of the territory in very high bandwidth and in mobile telecommunications, measures for a better access of people with disabilities to online services, and the creation of a right to the continuation of the Internet connection in case of unpaid bills for households in difficulty.
Accessibility
Measures to promote accessibility for people with disabilities on public service sites had been planned. However, they are now only recommended, with an oblig |
https://en.wikipedia.org/wiki/HMA%20%28VPN%29 | HMA (formerly HideMyAss!) is a VPN service founded in 2005 in the United Kingdom. It has been a subsidiary of the Czech cybersecurity company Avast since 2016.
History
HMA was created in 2005 in Norfolk, England by Jack Cator. At the time, Cator was sixteen years-old. He created HMA in order to circumvent restrictions his school had on accessing games or music from their network. According to Cator, the first HMA service was created in just a few hours using open-source code. The first product was a free proxy website where users typed in a URL and it delivered the website in the user's web browser.
Cator promoted the tool in online forums and it was featured on the front page of digg. After attracting more than one thousand users, Cator incorporated ads. HMA did not take any venture capital funding. It generated about $1,000 - $2,000 per month while the founder went to college to pursue a degree in computer science. In 2009, Cator dropped out of college to focus on HMA and added a paid VPN service. Most early HMA employees were freelancers found on oDesk. In 2012, one of the freelancers set up a competing business. HMA responded by hiring its contractors as full-time employees and establishing physical offices in London.
In 2012, the United Kingdom's government sent HMA a court order demanding it provide information about Cody Andrew Kretsinger's use of HMA's service to hack Sony as a member of the LulzSec hacking group. HMA provided the information to authorities. HMA said it was a violation of the company's terms of use to use its software for illegal activities.
In 2013, HMA added software to anonymize internet traffic from mobile devices was first added in 2013. In 2014, the company introduced HideMyPhone! service, which allowed mobile phone users to make their calls appear to come from a different location.
By 2014, the service had 10 million users and 215,000 paying subscribers of its VPN service. It made £11 million in revenue that year. HMA had 100 sta |
https://en.wikipedia.org/wiki/Dimension%20of%20a%20scheme | In algebraic geometry, the dimension of a scheme is a generalization of a dimension of an algebraic variety. Scheme theory emphasizes the relative point of view and, accordingly, the relative dimension of a morphism of schemes is also important.
Definition
By definition, the dimension of a scheme X is the dimension of the underlying topological space: the supremum of the lengths ℓ of chains of irreducible closed subsets:
In particular, if is an affine scheme, then such chains correspond to chains of prime ideals (inclusion reversed) and so the dimension of X is precisely the Krull dimension of A.
If Y is an irreducible closed subset of a scheme X, then the codimension of Y in X is the supremum of the lengths ℓ of chains of irreducible closed subsets:
An irreducible subset of X is an irreducible component of X if and only if the codimension of it in X is zero. If is affine, then the codimension of Y in X is precisely the height of the prime ideal defining Y in X.
Examples
If a finite-dimensional vector space V over a field is viewed as a scheme over the field, then the dimension of the scheme V is the same as the vector-space dimension of V.
Let , k a field. Then it has dimension 2 (since it contains the hyperplane as an irreducible component). If x is a closed point of X, then is 2 if x lies in H and is 1 if it is in . Thus, for closed points x can vary.
Let be an algebraic pre-variety; i.e., an integral scheme of finite type over a field . Then the dimension of is the transcendence degree of the function field of over . Also, if is a nonempty open subset of , then .
Let R be a discrete valuation ring and the affine line over it. Let be the projection. consists of 2 points, corresponding to the maximal ideal and closed and the zero ideal and open. Then the fibers are closed and open, respectively. We note that has dimension one, while has dimension and is dense in . Thus, the dimension of the closure of an open subset can be strictly bigge |
https://en.wikipedia.org/wiki/Rashmila%20Shakya | Rashmila Shakya (born 1980) is a Nepalese writer, software engineer, and Programme Director for Child Workers in Nepal. She authored the autobiography From Goddess to Mortal: the True Life Story of a Former Royal Kumari, which documents her time as Royal Kumari of Kathmandu.
Biography
She was recognized as the living reincarnation of the goddess Taleju when she was four years old. She served as the Royal Kumari from 1984 until 1991. She wrote the autobiography to change perceptions about the Kumari and raise awareness about the experiences of young girls who are chosen as the living Hindu goddesses. In her book she critiques the lack of education received by Kumaris and describes the challenges they face when returning to school and society after their time as Kumari has ended.
On 2 October 2015, Shakya, along with former Kumaris Nanimaiya Shakya, Sunina Shakya, Anita Shakya, Amita Shakya and Priti Shakya, was given money and acknowledgments for her contributions to culture and religion by Rudra Singh Tamang, the chief executive officer of Kathmandu Metropolitan City. Although criticizing the conditions and lack of education for Kumari, Shakya has not made an opinion as to whether the custom of Kumaris should continue, but believes it is culturally important. Shakya is married, despite the superstitions surrounding Kumari and marriage.
References
1980 births
Living people
Nepalese engineers
Software engineers
Kumaris (goddesses)
21st-century Nepalese writers
21st-century Nepalese women writers |
https://en.wikipedia.org/wiki/Cortical%20thymic%20epithelial%20cells | Cortical thymic epithelial cells (cTECs) form unique parenchyma cell population of the thymus which critically contribute to the development of T cells.
Thymus tissue is compartmentalized into cortex and medulla and each of these two compartments comprises its specific thymic epithelial cell subset. cTECs reside in the outer part- cortex, which mostly serves as a developmental site for T cells. Precursors of T cells originate in the bone marrow from which they migrate via bloodstream into thymic cortex, where they encounter stromal cells including cTECs, which form the microenvironment crucial for proliferation and development of T cells by expression of DLL4 (delta-like notch ligand 4), cytokines IL-7, TGFβ or stem cell factor and chemokines CCL25, CXCL12 or CCRL1 etc. Essential part of T cell development forms process called VDJ recombination, mediated by RAG recombinases, that stochastically changes DNA sequences of T cell receptors (TCR) and endows them with diverse recognition specificity. Thanks to this process, T cells can recognize vast repertoire of pathogens, but also self-peptides or even their TCRs don't respond to any surrounding signals. Major role of thymic epithelial cells is to test, whether TCRs are "functional" and on the other hand "harmless" to our body. While cTECs control the functionality of TCRs during the process called positive selection, Medullary thymic epithelial cells (mTECs) that home in the inner part of the thymus- medulla, present on their MHC molecules self-peptides, generated mostly by protein Autoimmune regulator, to eliminate T cells with self-reactive TCRs via processes of central tolerance e.g. negative selection and protect the body against development of autoimmunity.
Positive selection of T cells
Major function of cTECs is to positively select those T cells that are capable to recognize and interact with MHC molecules on their surface . Once T cell precursors enter the thymic cortex, they start their transformation fr |
https://en.wikipedia.org/wiki/Non%20functional%20pad | A non-functional pad is a pad in a printed circuit board that is not connected to a track on the layer it is on.
Removal
Non-functional pads can be removed at any phase of the design process. Some software allows precise control during the design process, and also removes the non-functional pads during output file creation. Furthermore, some board manufacturers remove non-functional pads during data preparations.
Occasionally, this process of non-functional pad removal is also called unused pad suppression.
The benefits of removing the non-functional pads are limited. Electrically, it creates needless extra capacitance in certain designs, which needs to be removed. Removing non-functional pads can improve the drilling process, as it lessens drill wear.
Non-functional pad removal can influence the reliability. (e.g. barrel cracking failure mode). Removal can increase or decrease reliability. Depending on design parameters, removing the non-functional pads can free up routing space.
Non-functional pads naturally also affect thermal characteristics.
Sometimes, non-functional pads (or their removal) are used for copper balancing, which affects etching, bow and twist and other effects.
Bibliography
Non-functional Pads: Should They Stay or Should They Go
Pads/Nopads
Printed circuit board manufacturing |
https://en.wikipedia.org/wiki/Marlin%20%28firmware%29 | Marlin is open source firmware originally designed for RepRap project FDM (fused deposition modeling) 3D printers using the Arduino platform.
Once the firmware has been compiled from C++ source code; it is installed and runs on a mainboard with onboard components and general-purpose I/O pins to control and communicate with other components. For control the firmware receives input from a USB port or attached media in the form of G-code commands instructing the machine what to do. For example, the command G1 X10 tells the machine to perform a smooth linear move of the X axis to position 10. The main loop manages all of the machine's real-time activities like commanding the stepper motors through stepper drivers, controlling heaters, sensors, and lights, managing the display and user interface, etc.
Marlin supports many different types of 3D printing robot platforms, including basic Cartesian, Core XY, Delta, and SCARA printers, as well as some other less conventional designs like Hangprinter and Beltprinter.
In addition to 3D printers, Marlin is generally adaptable to any machine requiring control and interaction. It has been used to drive SLA and SLS 3D printers, custom CNC mills, laser engravers (or laser beam machining), laser cutters, vinyl cutters, pick-and-place machines, foam cutters, and egg painting robots.
History
Marlin was first created in 2011 for the RepRap and Ultimaker printers by combining elements from the open source Grbl and Sprinter projects. Development continued at a slow pace while gaining in popularity and acceptance as a superior alternative to the other available firmware. By 2015, companies were beginning to introduce commercial 3D printers with Marlin pre-installed and contributing their improvements to the project. Early machines included the Ultimaker 1, the TAZ series by Aleph Objects and the Prusa i3 by Prusa Research.
By 2018 manufacturers had begun to favor boards with more powerful and efficient ARM processors, often at a lowe |
https://en.wikipedia.org/wiki/Exterior%20calculus%20identities | This article summarizes several identities in exterior calculus.
Notation
The following summarizes short definitions and notations that are used in this article.
Manifold
, are -dimensional smooth manifolds, where . That is, differentiable manifolds that can be differentiated enough times for the purposes on this page.
, denote one point on each of the manifolds.
The boundary of a manifold is a manifold , which has dimension . An orientation on induces an orientation on .
We usually denote a submanifold by .
Tangent and cotangent bundles
, denote the tangent bundle and cotangent bundle, respectively, of the smooth manifold .
, denote the tangent spaces of , at the points , , respectively. denotes the cotangent space of at the point .
Sections of the tangent bundles, also known as vector fields, are typically denoted as such that at a point we have . Sections of the cotangent bundle, also known as differential 1-forms (or covector fields), are typically denoted as such that at a point we have . An alternative notation for is .
Differential k-forms
Differential -forms, which we refer to simply as -forms here, are differential forms defined on . We denote the set of all -forms as . For we usually write , , .
-forms are just scalar functions on . denotes the constant -form equal to everywhere.
Omitted elements of a sequence
When we are given inputs and a -form we denote omission of the th entry by writing
Exterior product
The exterior product is also known as the wedge product. It is denoted by . The exterior product of a -form and an -form produce a -form . It can be written using the set of all permutations of such that as
Directional derivative
The directional derivative of a 0-form along a section is a 0-form denoted
Exterior derivative
The exterior derivative is defined for all . We generally omit the subscript when it is clear from the context.
For a -form we have as the -form that gives the directi |
https://en.wikipedia.org/wiki/Theorem%20of%20the%20highest%20weight | In representation theory, a branch of mathematics, the theorem of the highest weight classifies the irreducible representations of a complex semisimple Lie algebra . There is a closely related theorem classifying the irreducible representations of a connected compact Lie group . The theorem states that there is a bijection
from the set of "dominant integral elements" to the set of equivalence classes of irreducible representations of or . The difference between the two results is in the precise notion of "integral" in the definition of a dominant integral element. If is simply connected, this distinction disappears.
The theorem was originally proved by Élie Cartan in his 1913 paper. The version of the theorem for a compact Lie group is due to Hermann Weyl. The theorem is one of the key pieces of representation theory of semisimple Lie algebras.
Statement
Lie algebra case
Let be a finite-dimensional semisimple complex Lie algebra with Cartan subalgebra . Let be the associated root system. We then say that an element is integral if
is an integer for each root . Next, we choose a set of positive roots and we say that an element is dominant if for all . An element dominant integral if it is both dominant and integral. Finally, if and are in , we say that is higher than if is expressible as a linear combination of positive roots with non-negative real coefficients.
A weight of a representation of is then called a highest weight if is higher than every other weight of .
The theorem of the highest weight then states:
If is a finite-dimensional irreducible representation of , then has a unique highest weight, and this highest weight is dominant integral.
If two finite-dimensional irreducible representations have the same highest weight, they are isomorphic.
For each dominant integral element , there exists a finite-dimensional irreducible representation with highest weight .
The most difficult part is the last one; the construction of a finit |
https://en.wikipedia.org/wiki/Optically%20detected%20magnetic%20resonance | In physics, optically detected magnetic resonance (ODMR) is a double resonance technique by which the electron spin state of a crystal defect may be optically pumped for spin initialisation and readout.
Like electron paramagnetic resonance (EPR), ODMR makes use of the Zeeman effect in unpaired electrons. The negatively charged nitrogen vacancy centre (NV−) has been the target of considerable interest with regards to performing experiments using ODMR.
ODMR of NV−s in diamond has applications in magnetometry and sensing, biomedical imaging, quantum information and the exploration of fundamental physics.
NV ODMR
The nitrogen vacancy defect in diamond consists of a single substitutional nitrogen atom (replacing one carbon atom) and an adjacent gap, or vacancy, in the lattice where normally a carbon atom would be located.
The nitrogen vacancy occurs in three possible charge states: positive (NV+), neutral (NV0) and negative (NV−). As NV− is the only one of these charge states which has shown to be ODMR active, it is often referred to simply as the NV.
The energy level structure of the NV− consists of a triplet ground state, a triplet excited state and two singlet states. Under resonant optical excitation, the NV may be raised from the triplet ground state to the triplet excited state. The centre may then return to the ground state via two routes; by the emission of a photon of 637 nm in the zero phonon line (ZPL) (or longer wavelength from the phonon sideband) or alternatively via the aforementioned singlet states through intersystem crossing and the emission of a 1042 nm photon. A return to the ground state via the latter route will preferentially result in the state.
Relaxation to the state necessarily results in a decrease in visible wavelength fluorescence (as the emitted photon is in the infrared range). Microwave pumping at a resonant frequency of places the centre in the degenerate state. The application of a magnetic field lifts this degeneracy, causing |
https://en.wikipedia.org/wiki/Nu-transform | In the theory of stochastic processes, a ν-transform is an operation that transforms a measure or a point process into a different point process. Intuitively the ν-transform randomly relocates the points of the point process, with the type of relocation being dependent on the position of each point.
Definition
For measures
Let denote the Dirac measure on the point and let be a simple point measure on . This means that
for distinct and for every bounded set in . Further, let be a Markov kernel from to .
Let be independent random elements with distribution . Then the point process
is called the ν-transform of the measure if it is locally finite, meaning that for every bounded set
For point processes
For a point process , a second point process is called a -transform of if, conditional on , the point process is a -transform of .
Properties
Stability
If is a Cox process directed by the random measure , then the -transform of is again a Cox-process, directed by the random measure (see Transition kernel#Composition of kernels)
Therefore, the -transform of a Poisson process with intensity measure is a Cox process directed by a random measure with distribution .
Laplace transform
It is a -transform of , then the Laplace transform of is given by
for all bounded, positive and measurable functions .
References
Point processes |
https://en.wikipedia.org/wiki/Output%20signal%20switching%20device | An output signal switching device (or OSSD) is an electronic device used as part of the safety system of a machine. It provides a coded signal which, when interrupted due to a safety event, signals the machine to shut down. It works by converting the standard direct current supply, usually 24 volts, into two pulsed and out-of-phase signals. The benefit of this is to avoid the possibility of a stray signal keeping the machine operating while actually in an unsafe condition.
Technical description
The device usually acts as the interface of a sensor (such as a light curtain), designed to signal a safety-related event, typically when the light curtain beams being "broken". OSSD signals are the outputs from the protective device (light curtain or scanner) to a safety relay. OSSD outputs are typically semiconductor or transistor outputs, as opposed to relay or contact type outputs. There are usually two independent channels, so-called OSSD1 and OSSD2.
The non-tripped state is typically 24 VDC, and the tripped state (when the safety barrier has been violated) 0 VDC. If a wire were to break between the light curtain and the safety relay, the safety relay would trip to the safe state.
The OSSD outputs are self-checked. In the non-tripped state, the outputs periodically pulse low. The protective device checks the output, to make sure it does indeed go low when commanded. If not, the output may have failed or has shorted to 24V somewhere else. Between OSSD1 and OSSD2 the pulse intervals are staggered to check for crisscrossed wiring between the two.
The technology relies on two independent channels carrying the same information output by the device:
Idle signal is 24 V, periodically shortly pulsed to 0 V (pulses are not synchronous) in order for the receiver to ensure no shortcut to either 0 V or 24 V.
Active signal is issued when both lines present 0 V; a single line presenting 0 V for a duration longer than the test pulses is sufficient to signal an event.
Some relat |
https://en.wikipedia.org/wiki/Mixed%20Groups%20of%20Reconstruction%20Machines | Mixed Groups of Reconstruction Machines (), commonly known by the acronym MOMA, was a Greek military construction organization which was active from 1957 to 1992.
It was established in 1957, with sections based in Athens, Thessaloniki, Heraklion, Patras, Lamia, Larissa, and Ioannina, and comprised both permanent and conscript personnel from the Engineers arm of the Hellenic Army, as well as contracted civilian engineers, drivers, workers, and other personnel. Its main purpose was the construction of infrastructure (bridges, airports, roads etc) in the country following the extensive devastation of World War II, the Axis occupation of Greece, and the Greek Civil War. It was abolished in 1992, but in 2015, a similar service, under the name "MOMKA" (Μονάδα Μελετών και Κατασκευών) was established.
References
History of the Hellenic Army
1957 establishments in Greece
History of Greece (1949–1974)
Engineering units and formations
Military units and formations of the Hellenic Army |
https://en.wikipedia.org/wiki/Peano%20kernel%20theorem | In numerical analysis, the Peano kernel theorem is a general result on error bounds for a wide class of numerical approximations (such as numerical quadratures), defined in terms of linear functionals. It is attributed to Giuseppe Peano.
Statement
Let be the space of all functions that are differentiable on that are of bounded variation on , and let be a linear functional on . Assume that that annihilates all polynomials of degree , i.e.Suppose further that for any bivariate function with , the following is valid:and define the Peano kernel of asusing the notationThe Peano kernel theorem states that, if , then for every function that is times continuously differentiable, we have
Bounds
Several bounds on the value of follow from this result:
where , and are the taxicab, Euclidean and maximum norms respectively.
Application
In practice, the main application of the Peano kernel theorem is to bound the error of an approximation that is exact for all . The theorem above follows from the Taylor polynomial for with integral remainder:
defining as the error of the approximation, using the linearity of together with exactness for to annihilate all but the final term on the right-hand side, and using the notation to remove the -dependence from the integral limits.
See also
Divided differences
References
Numerical analysis |
https://en.wikipedia.org/wiki/4MLinux | 4MLinux is a lightweight Linux distribution made for both the 32 bit and 64 bit architectures. It is named "4MLinux" since it has 4 main components of the OS. Maintenance (it can be used a rescue Live CD), Multimedia (There is inbuilt support for almost every multimedia format), Miniserver (It comes with a 64-bit server is included running LAMP suite), and Mystery (Includes a collection of classic Linux games). The distribution is developed in Poland, and was first released in 2010. The distribution does not include a package manager, and uses JWM (Joe's Window Manager) as its default window manager. It also comes with Conky preinstalled. When installing programs with the distribution, the distribution will retrieve the Windows version rather than the Linux version due to it coming pre-installed with Wine (A compatibility layer for Windows applications), and not having any package manager. The distribution is geared towards people who prefer a lightweight distribution. There is a version of the distribution called the "4MLinux Game Edition" which provides 90s games natively such as Doom, and Hexen.
The distribution comes in two different version, 4MServer, and 4MLinux. 4MLinux requires 128 MB of RAM when installed to an HDD, and 1024 MB of RAM when being used as a live CD/USB. Whereas, 4MServer requires 256 MB of RAM when installed to an HDD, and 2048 MB of RAM when being used as a live CD/USB.
Resources
External links
4MLinux official website
Linux distributions
Linux distributions without systemd
Operating system distributions bootable from read-only media |
https://en.wikipedia.org/wiki/Journal%20of%20Open%20Source%20Software | The Journal of Open Source Software is a peer-reviewed open-access scientific journal covering open-source software from any research discipline. The journal was founded in 2016 by editors Arfon Smith, Kyle Niemeyer, Dan Katz, Kevin Moerman, and Karthik Ram. The editor-in-chief is Arfon Smith (Space Telescope Science Institute), and associate editors-in-chief: Dan Foreman-Mackey, Olivia Guest, Daniel Katz, Kevin Moerman, Kyle Niemeyer, George Thiruvathukal, and Krysten Thyng (retired: Lorena A. Barba). The journal is a sponsored project of NumFOCUS and an affiliate of the Open Source Initiative. The journal uses GitHub as publishing platform.
The journal was established in May 2016 and in its first year published 111 articles, with more than 40 additional articles under review. They reported approximately 1200 published articles in March 2021.
The journal has been discussed in several peer-reviewed papers which describe its publishing model and its effectiveness.
Abstracting and indexing
The journal is abstracted and indexed in the Astrophysics Data System and in the DBLP computer science bibliography online database.
References
Further reading
External links
Creative Commons Attribution-licensed journals
Academic journals established in 2016
Continuous journals
Software engineering publications
English-language journals
Computer science journals
Open access journals |
https://en.wikipedia.org/wiki/LeoPay | LeoPay (previously LeuPay) is an E-wallet payment and financial platform that enables money transfers and offers clients multi-currency IBAN accounts.
Originally based in Malta, it is now operated by iCard Services AD in Bulgaria. It offers Visa debit cards.
In summer 2018, it rebranded from LeuPay to LeoPay.
On 22.10.2018 LeoPay terminated accounts of clients that are not EU residents with immediate effect. In the email sent out to the owners of the blocked accounts the company promised to redeem the remaining balances within 2 months.
References
External links
LeoPay official website
Mobile payments
Payment systems
Online payments |
https://en.wikipedia.org/wiki/Samsung%20Galaxy%20Home | The Samsung Galaxy Home is a smart speaker developed by Samsung Electronics. It was officially announced alongside the Galaxy Note 9 and Galaxy Watch on August 9, 2018, but as of the start of 2023, has yet to be commercially released.
History
The Wall Street Journal reported in July 2017 that a Bixby smart-speaker, codenamed Vega, was under development. It was later confirmed by Dong-Jin Koh, CEO of Samsung Electronics, in August 2017.
The Galaxy Home was revealed at the Samsung Unpacked event on August 9, 2018, with more information promised during the Samsung Developer Conference in November.
At the Samsung Developer Conference 2019, held in San Jose, California, they showed the Samsung Galaxy Home Mini, which launched on February 12, 2020.
Specifications
Hardware
The Galaxy Home has a vase shape and features black cloth material with a mesh design, supported by 3 metal tripod legs. The top surface has a glass touch interface with music and volume controls, and also has an illuminated ring and AKG logo. There are 3 mid-range and high-range speakers and a subwoofer, as well as 8 far-field microphones for voice commands.
Software
The speaker features the Bixby voice assistant and can be activated by saying “Hi Bixby”. Its functionality is similar to that found on mobile devices such as the Note 9. The Galaxy Home can adjust its sound to adapt to its environment and also features Sound Steer, a Bixby voice command that allows the device to identify the location of the user in the room and better direct sound.
The speaker features SmartThings Hub integration, allowing it to control other smart home appliances compatible with the Samsung SmartThings platform. Spotify is the default music player, and can be controlled via voice. Audio playback can be also switched between Samsung home appliances.
References
External links
Samsung Galaxy
Smart speakers
Products introduced in 2018 |
https://en.wikipedia.org/wiki/Sorting%20number | In mathematics and computer science, the sorting numbers are a sequence of numbers introduced in 1950 by Hugo Steinhaus for the analysis of comparison sort algorithms. These numbers give the worst-case number of comparisons used by both binary insertion sort and merge sort. However, there are other algorithms that use fewer comparisons.
Formula and examples
The th sorting number is given by the formula
where
The sequence of numbers given by this formula (starting with ) is
0, 1, 3, 5, 8, 11, 14, 17, 21, 25, 29, 33, 37, 41, ... .
The same sequence of numbers can also be obtained from the recurrence relation,
or closed form
It is an example of a 2-regular sequence.
Asymptotically, the value of the th sorting number fluctuates between approximately and depending on the ratio between and the nearest power of two.
Application to sorting
In 1950, Hugo Steinhaus observed that these numbers count the number of comparisons used by binary insertion sort, and conjectured (incorrectly) that they give the minimum number of comparisons needed to sort items using any comparison sort. The conjecture was disproved in 1959 by L. R. Ford Jr. and Selmer M. Johnson, who found a different sorting algorithm, the Ford–Johnson merge-insert sort, using fewer comparisons.
The same sequence of sorting numbers also gives the worst-case number of comparisons used by merge sort to sort items.
Other applications
The sorting numbers (shifted by one position) also give the sizes of the shortest possible superpatterns for the layered permutations.
References
Integer sequences
Comparison sorts |
https://en.wikipedia.org/wiki/Exercism | Exercism is an online, open-source, free coding platform that offers code practice and mentorship on 66 different programming languages.
History
Software developer Katrina Owen created Exercism while she was teaching programming at Jumpstart Labs. The platform was developed as an internal tool to solve the problem of her own students not receiving feedback on the coding problems they were practicing. Katrina put the site publicly online and found that people were sharing it with their friends, practicing together and giving each other feedback. Within 12 months, the site had organically grown to see over 6,000 users had submitted code or feedback, and hundreds of volunteers contribute to the languages or tooling on the platform.
In July 2018, the site was relaunched with a new design and centred around a formal mentoring mode.
Product
The website differs from other coding platforms by requiring students to download exercises through a command line client, solve the code on their own computers then submit the solution for feedback, at which point they can also view other's solutions to the same problem.
Exercism has tracks for 66 different programming languages. including ABAP, C, C#, C++, CoffeeScript, Elm, Erlang, F#, Go, Java, JavaScript, Julia, Kotlin, Objective-C, PHP, Python, Raku, Ruby, Rust, Scala, Swift and Delphi.
In 2023, the site launched a "12 in 23" challenge for users to learn the basics of 12 different languages - one per month in 2023.
Open source
The Exercism codebase is open source.
In April 2016, it consisted of 50 repositories including website code, API code, command-line code and, most of all, over 40 stand-alone repositories for different language tracks.
Exercism has 3,500 contributors, now maintaining 340 repositories, and 11,500 mentors.
References
Open-source cloud applications
Free software
Online services
Virtual learning environments
Open educational resources |
https://en.wikipedia.org/wiki/Supergolden%20ratio | In mathematics, two quantities are in the supergolden ratio if their quotient equals the unique real solution to the equation This solution is commonly denoted The name supergolden ratio results of a analogy with the golden ratio , which is the positive root of the equation
Using formulas for the cubic equation, one can show that
or, using the hyperbolic cosine,
The decimal expansion of this number begins as 1.465571231876768026656731... ().
Properties
Many properties of the supergolden ratio are closely related to golden ratio . For example, while we have for the golden ratio, the inverse square of the supergolden ratio obeys . Additionally, the supergolden ratio can be expressed in terms of itself as the infinite geometric series
in comparison to the golden ratio identity
The supergolden ratio is also the fourth smallest Pisot number, which means that its algebraic conjugates are both smaller than 1 in absolute value.
Supergolden sequence
The supergolden sequence, also known as the Narayana's cows sequence, is a sequence where the ratio between consecutive terms approaches the supergolden ratio. The first three terms are each one, and each term after that is calculated by adding the previous term and the term two places before that; that is, , with . The first values are 1, 1, 1, 2, 3, 4, 6, 9, 13, 19, 28, 41, 60, 88, 129, 189, 277, 406, 595… ().
Supergolden rectangle
A supergolden rectangle is a rectangle whose side lengths are in a ratio. When a square with the same side length as the shorter side of the rectangle is removed from one side of the rectangle, the sides of the resulting rectangle will be in a ratio. This rectangle can be divided into two more supergolden rectangles with opposite orientations and areas in a ratio. The larger rectangle has a diagonal of length times the short side of the original rectangle, and which is perpendicular to the diagonal of the original rectangle.
In addition, if the line segment that separates the |
https://en.wikipedia.org/wiki/Cranial%20evolutionary%20allometry | Cranial evolutionary allometry (CREA) is a scientific theory regarding trends in the shape of mammalian skulls during the course of evolution in accordance with body size (i.e., allometry). Specifically, the theory posits that there is a propensity among closely related mammalian groups for the skulls of the smaller species to be short and those of the larger species to be long. This propensity appears to hold true for placental as well as non-placental mammals, and is highly robust. Examples of groups which exhibit this characteristic include antelopes, fruit bats, mongooses, squirrels and kangaroos as well as felids.
It is believed that the reason for this trend has to do with size-related constraints on the formation and development of the mammalian skull. Facial length is one of the best known examples of heterochrony.
References
Branches of biology |
https://en.wikipedia.org/wiki/Nadir%20and%20Occultation%20for%20Mars%20Discovery | Nadir and Occultation for MArs Discovery (NOMAD) is a 3-channel spectrometer on board the ExoMars Trace Gas Orbiter (TGO) launched to Mars orbit on 14 March 2016.
NOMAD is designed to perform high-sensitivity orbital identification of atmospheric components, concentration and temperature, their sources, loss, and cycles. It measures the sunlight reflected from the surface and atmosphere of Mars, and it analyses its wavelength spectrum to identify the components of the Martian atmosphere that may suggest a biological source. The Principal Investigator is Ann Carine Vandaele, from the Belgian Institute for Space Aeronomy, Belgium.
Overview
NOMAD is one of four science instruments on board the European ExoMars TGO orbiter. This spectrometer consists of three separate channels: solar occultation (SO), limb nadir and occultation (LNO), and ultraviolet and visible spectrometer (UVIS). The first two channels work in the infrared (2.2 to 4.3 μm); the third channel (UVIS) works in the UV-visible range (0.2 to 0.65 μm), which is able to measure ozone, sulphuric acid, and perform aerosol studies. Measurements are carried out during solar occultation, i.e. the instrument points toward the sunset as the orbiter moves toward or away the dark side of Mars. It also measures in nadir mode, i.e. looking directly at the sunlight reflected from the surface and atmosphere of Mars.
Since 9 April 2018, NOMAD is measuring the existing atmospheric concentrations of gases, their temperature and total densities. Atmospheric methane concentrations below 1 ppb can be detected. These measurements will also facilitate investigations in the production and loss processes for the cycles of water, carbon, and dust.
NOMAD development and fabrication was carried out by OIP Sensor Systems at Belgium, in collaboration with partners in Spain, the United Kingdom, Italy, US, and Canada. Its development was based on the SPICAV spectrometer flown on Venus Express.
Objectives
NOMAD will map the compos |
https://en.wikipedia.org/wiki/Julia%20Ward | Julia Ward (December 1900 – June 18, 1962) was the founder of the central reference division of the National Security Agency (NSA). She was inducted into the Cryptologic Hall of Honor in 2002.
Education
Ward received her A.B. from Bryn Mawr College in 1923 and her Ph.D from Bryn Mawr College in 1940.
World War II
Ward joined the cryptologic service during WWII and worked for the Signal Security Agency (the Army's cryptologic organization). She also worked as a librarian and eventually built a collection of classified and unclassified materials for use by analysts. In 1945, she became the deputy chief of the reference section. Within a few years, she turned the section from one that was known as poorly organized, into a section that was widely recognized and highly respected.
In 1949, Ward was named head of the Collateral Branch, thereby becoming the only female branch head in the Office of Operations. In 1955, Ward was promoted to deputy chief of NSA's Liaison and Foreign Operations Section.
Cryptologic Hall of Honor
Ward was inducted into the NSA's Cryptologic Hall of Honor in June 2002 at the National Cryptologic Museum in Baltimore, MD. Bryn Mawr College has a plaque to commemorate her placement in the Hall of Honor.
References
American spies
Cryptologic education
American cryptographers
1900 births
1962 deaths
National Security Agency cryptographers
Bryn Mawr College alumni |
https://en.wikipedia.org/wiki/Rolled%20plate%20glass | Rolled plate is a type of industrially produced glass. It was invented and patented by James Hartley circa 1847. Rolled plate is used architecturally; for example, in the mid-19th century uses for rolled plate glass included roofing railway stations and greenhouses.
References
Glass production
Industrial processes
History of glass |
https://en.wikipedia.org/wiki/Transseries | In mathematics, the field of logarithmic-exponential transseries is a non-Archimedean ordered differential field which extends comparability of asymptotic growth rates of elementary nontrigonometric functions to a much broader class of objects. Each log-exp transseries represents a formal asymptotic behavior, and it can be manipulated formally, and when it converges (or in every case if using special semantics such as through infinite surreal numbers), corresponds to actual behavior. Transseries can also be convenient for representing functions. Through their inclusion of exponentiation and logarithms, transseries are a strong generalization of the power series at infinity () and other similar asymptotic expansions.
The field was introduced independently by Dahn-Göring and Ecalle in the respective contexts of model theory or exponential fields and of the study of analytic singularity and proof by Ecalle of the Dulac conjectures. It constitutes a formal object, extending the field of exp-log functions of Hardy and the field of accelerando-summable series of Ecalle.
The field enjoys a rich structure: an ordered field with a notion of generalized series and sums, with a compatible derivation with distinguished antiderivation, compatible exponential and logarithm functions and a notion of formal composition of series.
Examples and counter-examples
Informally speaking, exp-log transseries are well-based (i.e. reverse well-ordered) formal Hahn series of real powers of the positive infinite indeterminate , exponentials, logarithms and their compositions, with real coefficients. Two important additional conditions are that the exponential and logarithmic depth of an exp-log transseries that is the maximal numbers of iterations of exp and log occurring in must be finite.
The following formal series are log-exp transseries:
The following formal series are not log-exp transseries:
— this series is not well-based.
— the logarithmic depth of this series is infini |
https://en.wikipedia.org/wiki/Bin%20picking | Bin picking (also referred to as random bin picking) is a core problem in computer vision and robotics. The goal is to have a robot with sensors and cameras attached to it pick-up known objects with random poses out of a bin using a suction gripper, parallel gripper, or other kind of robot end effector.
Early work on bin picking made use of Photometric Stereo
in recovering the shapes of objects and to determine their orientation in space.
Amazon previously held a competition focused on bin picking referred to as the "Amazon Picking Challenge", which was held from 2015 to 2017. The challenge tasked entrants with building their own robot hardware and software that could attempt simplified versions of the general task of picking and stowing items on shelves. The robots were scored by how many items were picked and stowed in a fixed amount of time. The first Amazon Robotics challenge was won by a team from TU Berlin in 2015, followed by a team from TU Delft and the Dutch company "Fizyr" in 2016. The last Amazon Robotics Challenge was won by the Australian Centre for Robotic Vision at Queensland University of Technology with their robot named Cartman. The Amazon Robotics/Picking Challenge was discontinued following the 2017 competition.
Although there can be some overlap, bin picking is distinct from "each picking" and the bin packing problem.
See also
3D pose estimation
Bowl feeder
References
Robotics
Computer vision |
https://en.wikipedia.org/wiki/Diane%20Maclagan | Diane Margaret Maclagan (born 1974) is a professor of mathematics at the University of Warwick. She is a researcher in combinatorial and computational commutative algebra and algebraic geometry, with an emphasis on toric varieties, Hilbert schemes, and tropical geometry.
Education and career
As a student at Burnside High School in Christchurch, New Zealand, Maclagan competed in the International Mathematical Olympiad in 1990 and 1991, earning a bronze medal in 1991. As an undergraduate, she studied at the University of Canterbury, graduating in 1995. She did her PhD at the University of California, Berkeley, graduating in 2000. Her dissertation, Structures on Sets of Monomial Ideals, was supervised by Bernd Sturmfels.
After postdoctoral research at the Institute for Advanced Study, Maclagan was a Szegő Assistant Professor at Stanford University from 2001 to 2004, an assistant professor at Rutgers University from 2004 to 2007, then an associate professor there from 2007 to 2009. She moved to her present position at the University of Warwick in 2007.
Books
With Bernd Sturmfels, Maclagan is the author of the book Introduction to Tropical Geometry. With Rekha R. Thomas, Sara Faridi, Leah Gold, A. V. Jayanthan, Amit Khetan, and Tony Puthenpurakal, she is the author of Computational Algebra and Combinatorics of Toric Ideals.
References
External links
Home page
Living people
Women mathematicians
Academics of the University of Warwick
Geometers
20th-century New Zealand mathematicians
1974 births
21st-century New Zealand mathematicians |
https://en.wikipedia.org/wiki/Multitask%20optimization | Multi-task optimization is a paradigm in the optimization literature that focuses on solving multiple self-contained tasks simultaneously. The paradigm has been inspired by the well-established concepts of transfer learning and multi-task learning in predictive analytics.
The key motivation behind multi-task optimization is that if optimization tasks are related to each other in terms of their optimal solutions or the general characteristics of their function landscapes, the search progress can be transferred to substantially accelerate the search on the other.
The success of the paradigm is not necessarily limited to one-way knowledge transfers from simpler to more complex tasks. In practice an attempt is to intentionally solve a more difficult task that may unintentionally solve several smaller problems.
Methods
There are several common approaches for multi-task optimization: Bayesian optimization, evolutionary computation, and approaches based on Game theory.
Multi-task Bayesian optimization
Multi-task Bayesian optimization is a modern model-based approach that leverages the concept of knowledge transfer to speed up the automatic hyperparameter optimization process of machine learning algorithms. The method builds a multi-task Gaussian process model on the data originating from different searches progressing in tandem. The captured inter-task dependencies are thereafter utilized to better inform the subsequent sampling of candidate solutions in respective search spaces.
Evolutionary multi-tasking
Evolutionary multi-tasking has been explored as a means of exploiting the implicit parallelism of population-based search algorithms to simultaneously progress multiple distinct optimization tasks. By mapping all tasks to a unified search space, the evolving population of candidate solutions can harness the hidden relationships between them through continuous genetic transfer. This is induced when solutions associated with different tasks crossover. Recently, |
https://en.wikipedia.org/wiki/Unimicron | Unimicron Technology Corporation (Unimicron; ) is a printed circuit board (PCB) manufacturer headquartered in Taiwan. The company produces PCBs, high density interconnection (HDI) boards, flexible PCBs, rigid flex PCBs, integrated circuit (IC) carriers, and others. In addition, it provides testing and burn-in services of IC substrates and PCBs. Applications of its products and services include liquid crystal display (LCD) monitors, personal computers (PCs) and peripheral products, notebook computers, network cards, facsimile machines, scanners, mobile phones, personal digital assistants (PDAs), and others. Unimicron has manufacturing sites and/or service centers in Taiwan, China, Germany, and Japan.
Overview
Unimicron, a subsidiary of United Microelectronics Corporation, started in 1990, grew to global rank of 6th in 2006, and became global No. 1 in the PCB industry in 2009 and 2010. Unimicron arrived at a second position in the 2012 global PCB market with a market share of 3.7% and $2.4 billion in revenue.
References
External links
Official Website
PCB Assembly
1990 establishments in Taiwan
Companies based in Taoyuan City
Electronics companies established in 1990
Printed circuit board manufacturing |
https://en.wikipedia.org/wiki/List%20of%20works%20by%20Petr%20Van%C3%AD%C4%8Dek | This is the list of works by Petr Vaníček.
Remarks
B Book
TB Textbook
LN Lecture Notes
PR Paper in a Refereed Journal
R Research Paper
C Critique, Reference Paper
IP Invited Paper to a Meeting
NP Paper Read at a Meeting
TH Thesis
RT Report (non-technical)
RW Review Paper (technical)
List of works
Sources
Works about mathematics
Geodesy
Geophysics
University of New Brunswick |
https://en.wikipedia.org/wiki/New%20South%20Wales%20Heritage%20Database | New South Wales Heritage Database, or State Heritage Inventory, is an online database of information about historic sites in New South Wales, Australia with statutory heritage listings.
Contents
It holds the information about sites listed on the New South Wales State Heritage Register (over 1,650 entries) in addition to sites on heritage lists managed by New South Wales local government authorities and other statutory heritage registers.
It is important to note that this is an online database holding information about historic sites but is not in itself a heritage register. An historic site can have multiple entries in this database if it is listed multiple heritage registers. For example, Young railway station is on three heritage registers and therefore has three entries in the database.
Licensing
The database is licensed CC BY except for material identified as being the copyright of third parties.
References
External links
Search the New South Wales Heritage Database (State Heritage Inventory)
Databases in Australia
Online databases |
https://en.wikipedia.org/wiki/Introduction%20to%20Electrodynamics | Introduction to Electrodynamics is a textbook by the physicist David J. Griffiths. Generally regarded as a standard undergraduate text on the subject, it began as lecture notes that have been perfected over time. Its most recent edition, the fourth, was published in 2013 by Pearson and in 2017 by Cambridge University Press. This book uses SI units (the mks convention) exclusively. A table for converting between SI and Gaussian units is given in Appendix C.
Griffiths said he was able to reduce the price of his textbook on quantum mechanics simply by changing the publisher, from Pearson to Cambridge University Press. He has done the same with this one. (See the ISBN in the box to the right.)
Contents
The front cover has a picture of the handwritten Poisson's equations for electricity and magnetism on a chalkboard. The first inner cover contains vector identities, vector derivatives in Cartesian, spherical, and cylindrical coordinates, and the fundamental theorems of vector calculus. The second inner cover contains the basic equations of electrodynamics, the accepted values of some fundamental constants, and the transformation equations for spherical and cylindrical coordinates.
Table of Contents (4th edition)
Preface
Advertisement
Chapter 1: Vector Analysis
Chapter 2: Electrostatics
Chapter 3: Potentials
Chapter 4: Electric Fields in Matter
Chapter 5: Magnetostatics
Chapter 6: Magnetic Fields in Matter
Chapter 7: Electrodynamics
Chapter 8: Conservation Laws
Chapter 9: Electromagnetic Waves
Chapter 10: Potentials and Fields
Chapter 11: Radiation
Chapter 12: Electrodynamics and Relativity
Appendix A: Vector Calculus in Curvilinear Coordinates
Appendix B: The Helmholtz Theorem
Appendix C: Units
Index
Reception
Paul D. Scholten, a professor at Miami University (Ohio), opined that the first edition of this book offers a streamlined, though not always in-depth, coverage of the fundamental physics of electrodynamics. Special topics such as superconductivity or plasma ph |
https://en.wikipedia.org/wiki/Cellular%20V2X | Cellular V2X (C-V2X) is a 3GPP standard for V2X applications such as self-driving cars. It is an alternative to 802.11p, the IEEE specified standard for V2V and other forms of V2X communications.
Cellular V2X uses 3GPP standardised 4G LTE or 5G mobile cellular connectivity to exchange messages between vehicles, pedestrians, and wayside traffic control devices such as traffic signals. It commonly uses the 5.9 GHz frequency band, which is the officially designated intelligent transportation system (ITS) frequency in most countries. C-V2X can function without network assistance and exceeds the range of DSRC by about 25%.
C-V2X was developed within the 3rd Generation Partnership Project (3GPP) to replace DSRC in the US and C-ITS in Europe.
History
In 2014, 3GPP Release 13 spurred studies to test the applicability of the then current standards to V2X. This resulted in the 3GPP Release 14 specifications for C-V2X communications, finalised in 2017. 3GPP Release 15 introduced 5G for V2N use-cases and 3GPP Release 16 includes work on 5G NR direct communications for V2V/V2I.
In Europe, the EU announced in July 2019 that it was adopting a technology-neutral approach to C-ITS, leaving the way forward for 4G, 5G and other advanced technologies to be part of V2X applications and services.
In the United States, the Federal Communications Commission proposed late in 2019 that 20 MHz and possibly 30 MHz of the 5.9 GHz band be allocated to C-V2X. In November 2020, this proposal was accepted, and the upper 30 MHz (5.895–5.925 GHz) were allocated to C-V2X.
Modes
C-V2X has the following modes:
Device-to-network: communication using conventional cellular links for vehicle-to-network (V2N) applications such as cloud services in end-to-end solutions
Device-to-device: direct communication without the use of network scheduling for vehicle-to-vehicle (V2V), vehicle-to-infrastructure (V2I), and vehicle-to-pedestrian (V2P) applications such as vulnerable road user protection and to |
https://en.wikipedia.org/wiki/Windjammers%202 | Windjammers 2 is a 2022 sports video game developed and published by Dotemu. It is the sequel to the 1994 Neo Geo game Windjammers, co-produced by Data East and SNK. Windjammers 2 was released for Nintendo Switch, PlayStation 4, Stadia, Windows, and Xbox One on January 20, 2022. It received generally positive reviews from critics, who praised the visuals, new content and gameplay mechanics.
Gameplay
Windjammers 2 is a sports game played from a top-down perspective, in which players must try to throw a frisbee into their opponent's goal while protecting their own. Players can earn 3 or 5 points by landing the frisbee into their opponent's goal in the yellow or red zones respectively, or can try to land the frisbee on the floor of their opponent's side to earn 2 points. Players win a set by achieving a certain number points, and win the match by winning the most sets. In the game, players select from 11 playable characters; this includes all six returning characters from the original Windjammers, along with Jao Raposa of Brazil, Max Hurricane of Canada, Sammy Ho of China, Sophie De Lys of France, and the secret character Disc Man. Two additional characters, Anna Szalinski of Poland and the cyborg Jamma GX03, were added as part of a free update, bringing the total to 13. Each character has their own attributes. For instance, some characters have more steady control than others at the cost of speed. There are EX Moves, which are special powers can be that activated for gameplay advantages. Players can compete on 10 different courts, including all six courts from Windjammers, which feature different goal zones and gameplay properties. Both single-player and local multiplayer modes are featured. The game includes an "Arcade Mode", where multiple matches are played through championships. Windjammers 2 launched with cross-platform play between the Windows and Xbox One versions, later expanded to all systems following an update in October 2023.
Development
Dotemu, the ga |
https://en.wikipedia.org/wiki/Reference%20ecosystem | A reference ecosystem, also known as an ecological reference, is a "community of organisms able to act as a model or benchmark for restoration." Reference ecosystems usually include remnant natural areas which have not been degraded by human activities such as agriculture, logging, development, fire suppression, or non-native species invasion. Reference ecosystems are ideally complete with natural flora, fauna, abiotic elements, and ecological functions, processes, and successional states. Multiple reference ecosystems may be pieced together to form the model upon which an ecological restoration project may be based.
References
Ecological restoration
Conservation biology
Ecology terminology
Habitats
Ecosystems |
https://en.wikipedia.org/wiki/Remnant%20natural%20area | A remnant natural area, also known as remnant habitat, is an ecological community containing native flora and fauna that has not been significantly disturbed by destructive activities such as agriculture, logging, pollution, development, fire suppression, or non-native species invasion. The more disturbed an area has been, the less characteristic it becomes of remnant habitat. Remnant areas are also described as "biologically intact" or "ecologically intact."
Remnant natural areas are often used as reference ecosystems in ecological restoration projects.
Ecology
A remnant natural area can be described in terms of its natural quality or biological integrity, which is the extent to which it has the internal biodiversity and abiotic elements to replicate itself over time. Another definition of biological integrity is "the capability of supporting and maintaining a balanced, integrated, adaptive community of organisms having a species composition, diversity, and functional organization comparable to that of the natural habitat of the region." Abiotic elements determining the quality of a natural area may include factors such as hydrologic connectivity or fire. In areas that have been dredged, drained, or dammed, the altered hydrology can destroy a remnant natural area. Similarly, too much or too little fire can degrade or destroy a remnant natural area.
Remnant natural areas are characterized by the presence of "conservative" plants and animals—organisms that are restricted to or highly characteristic of areas that have not been disturbed by humans. Tools to measure aspects of natural areas quality in remnant areas include Floristic Quality Assessment and the Macroinvertebrate Community Index.
Examples
In the upper Midwestern United States, remnant natural areas date prior to European settlement, going back to the end of the Wisconsinian Glaciation approximately 15,000 years ago. Diverse remnant plant community examples in that region include tallgrass prairie, beec |
https://en.wikipedia.org/wiki/Sky%20Q | Sky Q is a subscription-based television and entertainment service operated by British satellite television provider Sky, as a part of its operations in Austria and Germany, Ireland, Italy and in the UK. The name also refers to the Sky Q set-top box.
Sky Q launched in 2016, replacing the previous Sky+ and Sky+ HD services. Sky Q has been referred to as a "multimedia platform" that combines conventional television with on-demand and catch-up services, as well as third-party services. It includes a PVR set top box, a multiroom set top box, a dedicated broadband-connected "hub", and applications for mobile and desktop devices. As of April 2018, Sky Q was in 2.5 million homes in the UK, Ireland and Italy. In July 2018, Sky reported that there were 3.6 million Sky Q customers.
LaunchOne
Sky Q was first announced by Sky UK in November 2015, and was released in the UK in February 2016.
Sky did not roll out Sky Q in Germany, Austria and Italy immediately, but released a modified version of the Sky Q set top box by Autumn 2016, named Sky+ Pro in Germany and Austria, and My Sky in Italy. Like Sky Q, the box is capable of UHD resolution and has a built-in Wi-Fi router, but it omits significant Sky Q features. Sky Italia later launched Sky Q in Italy in November 2017, and Sky Deutschland did so in Germany and Austria in May 2018. In contrast to the UK, Ireland and Italy (especially where Sky Italia launched Sky Q separately from My Sky), existing customers in Germany and Austria could receive Sky Q through a free software update on existing Sky+ Pro receivers.
Hardware
The Sky Q "Silver" set top box (called "Platinum" in Italy) has a 2 terabyte hard disk and 12 satellite tuners, allowing up to six live TV channels to be recorded while watching a seventh. The box is capable of receiving and displaying 4K resolution "ultra-high-definition" (UHD) broadcasts, which were started by Sky in the UK in August 2016.
The standard Sky Q box has 1 terabyte of storage and 8 tuners, sup |
https://en.wikipedia.org/wiki/No-code%20development%20platform | No-code development platforms (NCDPs) allow creating application software through graphical user interfaces and configuration instead of traditional computer programming. No-code development platforms are closely related to low-code development platforms as both are designed to expedite the application development process. However, unlike low-code, no-code development platforms require no code writing at all, generally offering prebuilt templates that businesses can build apps with. These platforms have both increased in popularity as companies deal with the parallel trends of an increasingly mobile workforce and a limited supply of competent software developers.
No-code development platforms are closely related to visual programming languages.
Use
NCDPs are used to meet the needs of companies that are seeking to digitize processes through cloud-based mobile applications. No-code tools are often designed with line of business users in mind as opposed to traditional IT. This shift in focus is meant to help accelerate the development cycle by bypassing traditional IT development constraints of time, money, and scarce software development human capital resources to allow teams to align their business strategy with a rapid development process. NCDPs also often leverage enterprise-scale APIs and web service catalogs, open data sets, and tested and proven template galleries, to help integrate existing business systems while adding a practical layer of user functionality.
The transition from traditional enterprise software to a lean development methodology is also changing the role of traditional IT leaders and departments. Whereas IT once provided not only approval of new technology but procurement and development of new tools, IT's role is now increasingly one of governance over line of business who develop niche tools for their work stream.
The potential benefits of utilizing a NCDP include:
Access - Gartner predicted in 2014 that by 2018, over half of all B2E (bus |
https://en.wikipedia.org/wiki/Turing%20%28microarchitecture%29 | Turing is the codename for a graphics processing unit (GPU) microarchitecture developed by Nvidia. It is named after the prominent mathematician and computer scientist Alan Turing. The architecture was first introduced in August 2018 at SIGGRAPH 2018 in the workstation-oriented Quadro RTX cards, and one week later at Gamescom in consumer GeForce RTX 20 series graphics cards. Building on the preliminary work of its HPC-exclusive predecessor, the Turing architecture introduces the first consumer products capable of real-time ray tracing, a longstanding goal of the computer graphics industry. Key elements include dedicated artificial intelligence processors ("Tensor cores") and dedicated ray tracing processors ("RT cores"). Turing leverages DXR, OptiX, and Vulkan for access to ray-tracing. In February 2019, Nvidia released the GeForce 16 series of GPUs, which utilizes the new Turing design but lacks the RT and Tensor cores.
Turing is manufactured using TSMC's 12 nm FinFET semiconductor fabrication process. The high-end TU102 GPU includes 18.6billion transistors fabricated using this process. Turing also uses GDDR6 memory from Samsung Electronics, and previously Micron Technology.
Details
The Turing microarchitecture combines multiple types of specialized processor core, and enables an implementation of limited real-time ray tracing. This is accelerated by the use of new RT (ray-tracing) cores, which are designed to process quadtrees and spherical hierarchies, and speed up collision tests with individual triangles.
Features in Turing:
CUDA cores (SM, Streaming Multiprocessor)
Compute Capability 7.5
traditional rasterized shaders and compute
concurrent execution of integer and floating point operations (inherited from Volta)
Ray-tracing (RT) cores
bounding volume hierarchy acceleration
shadows, ambient occlusion, lighting, reflections
Tensor (AI) cores
artificial intelligence
large matrix operations
Deep Learning Super Sampling (DLSS)
Memory controller w |
https://en.wikipedia.org/wiki/Spyros%20Magliveras | Spyros Simos Magliveras (born 6 September 1938 in Athens) is a Greek-born American mathematician and computer scientist.
Biography
Magliveras graduated from the University of Florida with a bachelor's degree in electrical engineering in 1961 and a master's degree in mathematics in 1963. He was from 1963 to 1964 an instructor of mathematics at Florida Presbyterian College and from 1964 to 1968 a teaching fellow in mathematics at the University of Michigan, as well as from 1965 to 1968 a programming analyst and a systems analyst at the University of Michigan Institute for Social Research. He received his PhD in mathematics from the University of Birmingham, UK in 1970 with thesis advisor Donald Livingstone and thesis The subgroup structure of the Higman-Sims simple group.
At the State University of New York at Oswego, he was from 1970 to 1973 an assistant professor and from 1973 to 1978 an associate professor. From 1978 to 2000 he was a professor of mathematics and computer science at the University of Nebraska-Lincoln, retiring as professor emeritus in 2000. Since 2000 he has been a professor at Florida Atlantic University (FAU). He was the director of FAU's Center for Cryptology and Information Security from 2003 to 2013, and since 2013 he has been the center's associate director.
He has been a visiting professor at the University of Birmingham (1984/85), at the University of Waterloo (1999), at the Sapienza University of Rome (two months in 2000), and at the University of Western Australia (two months in 2000).
Magliveras does research on combinatorial designs, permutation groups, finite geometries, encryption of data (cryptography), and data security. In 2001 he received the Euler Medal. He is a co-author of the 2007 book Secure group communications over data networks.
Magliveras is married since 1961 and has two children.
References
External links
Homepage at Florida Atlantic University
20th-century American mathematicians
21st-century American mathemat |
https://en.wikipedia.org/wiki/James%20William%20Peter%20Hirschfeld | James William Peter Hirschfeld (born 1940) is an Australian mathematician, resident in the United Kingdom, specializing in combinatorial geometry and the geometry of finite fields. He is an emeritus professor and Tutorial Fellow at the University of Sussex.
Hirschfeld received his doctorate in 1966 from the University of Edinburgh with thesis advisor William Leonard Edge and thesis The geometry of cubic surfaces, and Grace's extension of the double-six, over finite fields.
To pursue further studies in finite geometry Hirschfeld went to University of Perugia and University of Rome with support from the Royal Society and Accademia nazionale dei Lincei. He edited Beniamino Segre's 100-page monograph "Introduction to Galois Geometries" (1967).
In 1979 Hirschfeld published the first of a trilogy on Galois geometry, pegged at a level depending only on "the group theory and linear algebra taught in a first degree course, as well as a little projective geometry, and a very little algebraic geometry." When q is a prime power then there is a finite field GF(q) with q elements called a Galois field. A vector space over GF(q) of n + 1 dimensions produces an n-dimensional Galois geometry PG(n,q) with its subspaces: one-dimensional subspaces are the points of the Galois geometry and two-dimensional subspaces are the lines. Non-singular linear transformations of the vector space provide motions of PG(n,q). The first book (1979) covered PG(1,q) and PG(2,q). The second book addressed PG(3,q) and the third PG(n,q). Chapters are numbered sequentially through the trilogy: 14 in the first book, 15 to 21 in the second, and 22 to 27 in the third. Finite geometry has contributed to coding theory, such as algebraic geometry codes, so the field is supported by computer science. In the preface of the 1991 text Hirschfeld summarizes the status of Galois geometry, mentioning maximum distance separable code, mathematics journals publishing finite geometry, and conferences on combinatorics fea |
https://en.wikipedia.org/wiki/Flag%20bundle | In algebraic geometry, the flag bundle of a flag
of vector bundles on an algebraic scheme X is the algebraic scheme over X:
such that is a flag of vector spaces such that is a vector subspace of of dimension i.
If X is a point, then a flag bundle is a flag variety and if the length of the flag is one, then it is the Grassmann bundle; hence, a flag bundle is a common generalization of these two notions.
Construction
A flag bundle can be constructed inductively.
References
Expo. VI, § 4. of
Algebraic geometry |
https://en.wikipedia.org/wiki/Paessler%20PRTG | PRTG (Paessler Router Traffic Grapher until version 7) is an agentless network monitoring software from Paessler AG. Several software versions are combined under the umbrella term Paessler PRTG. It is designed to monitor and classify system conditions like bandwidth usage or uptime and collect statistics from miscellaneous hosts such as switches, routers, servers, and other devices and applications.
The first version of PRTG was released on 29 May 2003 by the German company Paessler GmbH (now: Paessler AG), which was founded by Dirk Paessler in 2001.
Products of the Paessler PRTG family
The monitoring software Paessler PRTG is available in three versions. In addition to the classic standalone solution PRTG Network Monitor, Paessler sells PRTG Enterprise Monitor for large and distributed networks and PRTG Hosted Monitor as a SaaS-version.
PRTG Network Monitor
PRTG Network Monitor is the classic on-premises monitoring solution, which is hosted on a server in the user's network. For the installation of the core server, a computer with the Windows Server operating system is required.
PRTG Enterprise Monitor
Since 2020, Paessler has offered PRTG Enterprise Monitor, a specialized monitoring solution for large IT environments. In addition to a particularly high performance for distributed locations, PRTG Enterprise Monitor also includes the ITOps Board, which provides a centralized service-oriented overview. It can be used to map business processes, consolidate dashboards from multiple servers, and monitor SLA performance and availability, among other features.
PRTG Hosted Monitor
In 2017, a cloud-hosted version of PRTG was released. PRTG Hosted Monitor offers largely the same range of functions as the standard tool. The license is billed monthly and is based solely on the number of sensors. In contrast to PRTG Network Monitor and PRTG Enterprise Monitor, PRTG Hosted Monitor can also be used in networks without a Windows server, since it is hosted in the cloud and |
https://en.wikipedia.org/wiki/Ragulator-Rag%20complex | The Ragulator-Rag complex is a regulator of lysosomal signalling and trafficking in eukaryotic cells, which plays an important role in regulating cell metabolism and growth in response to nutrient availability in the cell. The Ragulator-Rag Complex is composed of five LAMTOR subunits, which work to regulate MAPK and mTOR complex 1. The LAMTOR subunits form a complex with Rag GTPase and v-ATPase, which sits on the cell’s lysosomes and detects the availability of amino acids. If the Ragulator complex receives signals for low amino acid count, it will start the process of catabolizing the cell. If there is an abundance of amino acids available to the cell, the Ragulator complex will signal that the cell can continue to grow.
Ragulator proteins come in two different forms: Rag A/Rag B and Rag C/Rag D. These interact to form heterodimers with one another.
History
mTORC1 is a complex within the lysosome membrane that initiates growth when promoted by a stimulus, such as growth factors. A GTPase is a key component in cell signaling, and there were, in 2010, four RAG complexes discovered within the lysosomes of cells. In 2008, it was thought that these RAG complexes would slow down autophagy and activate cell growth by interacting with mTORC1. However, in 2010, the Ragulator was discovered. Researchers determined that the function of this Ragulator was to interact with the RAG A, B, C, and D complexes to promote cell growth. This discovery also led to the first use of the term “Rag-Ragulator” complex, because of the interaction between these two.
The amino acid level, cell growth, and other important factors are influenced by the mTOR Complex 1 pathway. On the lysosomal surface, the amino acids signal the activation of the four Rag proteins (RagA, RagB, RagC, and RagD) to translocate mTORC1 to the site of activation.
A 2014 study noted that AMPK (AMP-activated protein kinase) and mTOR play important roles in managing different metabolic programs. It was also found that |
https://en.wikipedia.org/wiki/The%20monkey%20and%20the%20coconuts | The monkey and the coconuts is a mathematical puzzle in the field of Diophantine analysis that originated in a magazine fictional short story involving five sailors and a monkey on a desert island who divide up a pile of coconuts; the problem is to find the number of coconuts in the original pile (fractional coconuts not allowed). The problem is notorious for its confounding difficulty to unsophisticated puzzle solvers, though with the proper mathematical approach, the solution is trivial. The problem has become a staple in recreational mathematics collections.
General description
The problem can be expressed as:
There is a pile of coconuts, owned by five men. One man divides the pile into five equal piles, giving the one left over coconut to a passing monkey, and takes away his own share. The second man then repeats the procedure, dividing the remaining pile into five and taking away his share, as do the third, fourth, and fifth, each of them finding one coconut left over when dividing the pile by five, and giving it to a monkey. Finally, the group divide the remaining coconuts into five equal piles: this time no coconuts are left over.
How many coconuts were there in the original pile?
The monkey and the coconuts is the best known representative of a class of puzzle problems requiring integer solutions structured as recursive division or fractionating of some discretely divisible quantity, with or without remainders, and a final division into some number of equal parts, possibly with a remainder. The problem is so well known that the entire class is often referred to broadly as "monkey and coconut type problems", though most are not closely related to the problem.
Another example: "I have a whole number of pounds of cement, I know not how many, but after addition of a ninth and an eleventh, it was partitioned into 3 sacks, each with a whole number of pounds. How many pounds of cement did I have?"
Problems ask for either the initial or terminal quantity. |
https://en.wikipedia.org/wiki/UKM%20Medical%20Molecular%20Biology%20Institute | The UKM Medical Molecular Biology Institute, usually referred to as UMBI, is a biomedicine and cancer research institute located in Bandar Tun Razak, Kuala Lumpur, Malaysia. The institute is one of research institute in National University of Malaysia (UKM). UMBI was established in 2003. The institute has been recognized as a Center for Excellence in Higher Education (HICoE) in 2009 by the Prime Minister of Malaysia.
History
The UKM Medical Molecular Biology Institute (UMBI) was founded as one of the Centre of Excellence in UKM after the approval from the National University of Malaysia senate meeting. UMBI was officially established in July 2003 with the operating budget allocated to this new institute of RM 25 thousand. Professor Datuk Dr. A Rahman A Jamal has been appointed as a founding director of UMBI since 2003 until his tenure ends in 2017.
Director
Professor Datuk Dr A Rahman A Jamal 2003 - 2017
Professor Dr Shamsul Azhar Shah 2018 - 2019
Dr Nor Azian Abdul Murad 2019 - current
References
External links
Official website of UKM Medical Molecular Biology Institute
Biotechnology
Genetics or genomics research institutions
National University of Malaysia
Organisations based in Malaysia
Research institutes in Malaysia |
https://en.wikipedia.org/wiki/World%20War%20Z%20%282019%20video%20game%29 | World War Z is a third-person shooter video game developed and published by Saber Interactive. It was released for Microsoft Windows, PlayStation 4 and Xbox One on 16 April 2019, and a Nintendo Switch version was released on 2 November 2021. It was also released for Google Stadia on 5 April 2022. Ports for PlayStation 5 and Xbox Series X/S released on 24 January 2023. Loosely based on the 2006 novel of the same name and set in the same universe as the 2013 film adaptation, the game follows groups of four survivors of a zombie apocalypse in the cities of New York, Jerusalem, Moscow, Tokyo, Marseille, Rome and Kamchatka.
Gameplay
The game is a co-operative third-person shooter in which four players fight against massive hordes of zombies in seven locations, including New York, Jerusalem, Moscow, Tokyo, Marseille, Rome and Kamchatka.
Players can choose from seven classes: the Gunslinger (specializes in range), the Hellraiser (specializes in explosives), the Fixer (engineer), the Medic (healer), the Slasher (specializes in melee), the Exterminator (specializes in crowd control), and the Dronemaster (specializes in offensive/defensive support drones). New perks can be unlocked for each class as players continue progressing in the game.
The game can support up to 1,000 enemies appearing on-screen simultaneously, and they can climb onto each other to reach players on a higher level. Players can collect different items in the battlefield, but their locations are procedurally generated. In addition to fighting zombies, players also need to complete different objectives, such as escorting survivors, in each location.
Each location, or episode as it is known in-game, is divided into 3-5 individual levels. After completing a level, players receive "supplies" based on a resulting defeat or victory. Supplies can be used to upgrade weapons and unlock new attachments. Aforementioned perks can also be bought for specific classes using supplies.
The game features five competiti |
https://en.wikipedia.org/wiki/Phantasie | Phantasie is the first video game in the Phantasie series.
Gameplay
Based on the Isle of Gelnor, Phantasie allows a group of six characters to adventure the countryside and try to defeat the evil Black Knights and their sorcerer leader, Nikademus. Players could choose to be one of six character classes (Thief, Fighter, Ranger, Monk, Priest, and Wizard) and could also choose between the races of Human, Dwarf, Halfling, Elf, or Gnome. By selecting "Random" one could also choose from ogre, troll, pixie, gnoll, orc, lizard man, minotaur, and other races.
The game was notable for taking advantage of a broad mix of styles for the game: a town window which allowed purchasing in various shops, a top-down style dungeon crawl view, a top-down world map, and a separate combat window. Each character class had unique fighting styles and options and all characters could choose their strategy for a particular round in the turn-based combat segments. After a combat, experience was awarded, but the players would have to return to town to purchase their levels if they qualified.
Reception
With more than 50,000 copies sold in North America, Phantasie was very successful for SSI. It was the company's best-selling Commodore game as of late 1987. Game reviewers Hartley and Pattie Lesser in 1987 complimented the Atari ST version of Phantasie in their "The Role of Computers" column in Dragon #120 (1987), recommending that Atari ST owners should "consider Phantasie as a game well-worth their attention". ANALOG Computing in 1988 called Phantasie and its sequel the best fantasy role-playing games for the Atari 8-bit. In 1991 and 1993 Computer Gaming Worlds Scorpia called Phantasie "a surprisingly good little game, with many interesting features".
Reviews
Casus Belli #30 (Jan 1986)
Jeux & Stratégie #35
Games #70
Legacy
Phantasie I, Phantasie III, and Questron II were later re-released together, and reviewed in 1994 in Dragon #203 by Sandy Petersen in the "Eye of the Monitor" column. Pe |
https://en.wikipedia.org/wiki/Equal%20Earth%20projection | The Equal Earth map projection is an equal-area pseudocylindrical projection for world maps, invented by Bojan Šavrič, Bernhard Jenny, and Tom Patterson in 2018. It is inspired by the widely used Robinson projection, but unlike the Robinson projection, retains the relative size of areas. The projection equations are simple to implement and fast to evaluate.
The features of the Equal Earth projection include:
The curved sides of the projection suggest the spherical form of Earth.
Straight parallels make it easy to compare how far north or south places are from the equator.
Meridians are evenly spaced along any line of latitude.
Software for implementing the projection is easy to write and executes efficiently.
According to the creators, the projection was created in response to the decision of the Boston public schools to adopt the Gall-Peters projection for world maps in March 2017, to accurately show the relative sizes of equatorial and non-equatorial regions. The decision generated controversy in the world of cartography due to this projection’s extreme distortion in the polar regions. At that time Šavrič, Jenny, and Patterson sought alternative map projections of equal areas for world maps, but could not find any that met their aesthetic criteria. Therefore, they created a new projection that had more visual appeal compared to existing projections of equal areas.
As with the Natural Earth projection (2012) by Tom Patterson, a visual method was used to choose the parameters of the projection. A combination of Putniņš P4ʹ and Eckert IV projections was used as the basis.
Formulation
The projection is formulated as the equations
where
and refers to latitude and to longitude.
Use
The first known thematic map published using the Equal Earth projection is a map of the global mean temperature anomaly for July 2018, produced by the NASA’s Goddard Institute for Space Studies.
References
External links
Map projections |
https://en.wikipedia.org/wiki/OS/7 | OS/7 is a discontinued operating system from Sperry Univac for its 90/60 and 90/70 computer systems. The system was first announced in November 1971 for Univac's 9700 system and was originally scheduled for delivery in March 1973. However, the delivery slipped by nearly a year, which impacted the 9700 marketing effort. It was first demonstrated by Univac on the new 90/60 system in October 1973. The official release was then planned for January 1974. OS/7 was abruptly discontinued in 1975 in favor of VS/9, Univac's name for RCA's VMOS operating system.
"OS/7 is a multi-tasking, multi-programming system that utilizes a roll-in, roll-out capability to keep the CPU optimally busy."
References
Discontinued operating systems
UNIVAC mainframe computers |
https://en.wikipedia.org/wiki/Measurable%20acting%20group | In mathematics, a measurable acting group is a special group that acts on some space in a way that is compatible with structures of measure theory. Measurable acting groups are found in the intersection of measure theory and group theory, two sub-disciplines of mathematics. Measurable acting groups are the basis for the study of invariant measures in abstract settings, most famously the Haar measure, and the study of stationary random measures.
Definition
Let be a measurable group, where denotes the -algebra on and the group law. Let further be a measurable space and let be the product -algebra of the -algebras and .
Let act on with group action
If is a measurable function from to , then it is called a measurable group action. In this case, the group is said to act measurably on .
Example: Measurable groups as measurable acting groups
One special case of measurable acting groups are measurable groups themselves. If , and the group action is the group law, then a measurable group is a group , acting measurably on .
References
Group theory
Measure theory |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.