source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Manifold%20hypothesis | The manifold hypothesis posits that many high-dimensional data sets that occur in the real world actually lie along low-dimensional latent manifolds inside that high-dimensional space. As a consequence of the manifold hypothesis, many data sets that appear to initially require many variables to describe, can actually be described by a comparatively small number of variables, likened to the local coordinate system of the underlying manifold. It is suggested that this principle underpins the effectiveness of machine learning algorithms in describing high-dimensional data sets by considering a few common features.
The manifold hypothesis is related to the effectiveness of nonlinear dimensionality reduction techniques in machine learning. Many techniques of dimensional reduction make the assumption that data lies along a low-dimensional submanifold, such as manifold sculpting, manifold alignment, and manifold regularization.
The major implications of this hypothesis is that
Machine learning models only have to fit relatively simple, low-dimensional, highly structured subspaces within their potential input space (latent manifolds).
Within one of these manifolds, it’s always possible to interpolate between two inputs, that is to say, morph one into another via a continuous path along which all points fall on the manifold.
The ability to interpolate between samples is the key to generalization in deep learning.
The information geometry of statistical manifolds
An empirically-motivated approach to the manifold hypothesis focuses on its correspondence with an effective theory for manifold learning under the assumption that robust machine learning requires encoding the dataset of interest using methods for data compression. This perspective gradually emerged using the tools of information geometry thanks to the coordinated effort of scientists working on the efficient coding hypothesis, predictive coding and variational Bayesian methods.
The argument for reasoning |
https://en.wikipedia.org/wiki/Origamics | Origamics: Mathematical Explorations Through Paper Folding is a book on the mathematics of paper folding by , a Japanese retired biology professor. It was edited and translated into English by Josefina C. Fonacier and Masami Isoda, based on material published in several Japanese-language books by Haga, and published in 2008 by World Scientific. The title is a portmanteau of "origami" and "mathematics", coined in the 1990s by Haga to describe the type of paper-folding mathematical exploration that would later be described in this book.
Topics
Although much of its content involves folding square sheets of origami paper, the book focuses on mathematical explorations developing from folding and unfolding paper rather than on the traditional use of origami to create paper figures and artworks. It is divided into ten chapters, exploring concepts in paper folding that are "so simple that they could be discovered by middle- or high-school students".
The book begins with the exploration of a single fold of a corner of a square to a midpoint of an opposite edge, and its analysis involving the geometry of the 3–4–5 right triangle. Later explorations (sometimes presented with colorful stories of knights and princesses as motivation) concern folding one or more corners of the square to other points on the square, similar folds on paper with the shape of a silver rectangle (such as A4 letter paper), the interactions of the fold lines produced in this way, and the use of these folds to obtain subdivisions of the interval into different numbers of parts.
Audience and reception
The book is primarily aimed at secondary-school mathematics teachers, and reviewer Gertraud Ehrig suggests that this book would be particularly helpful for them in providing inspiration for activities for their students.
Although the many activities discussed throughout the book are suitable for discovery learning by students, it also includes more technical material proving the mathematical insights fou |
https://en.wikipedia.org/wiki/Enigma%20%28DVB%29 | Enigma2, the second generation of Enigma software, is an application used in Linux-based Digital Video Broadcasting (DVB-S, DVB-C, DVB-T) receivers or TV set-top boxes and Internet Protocol television receivers. It creates a graphical user interface to control the said devices using a remote control and provides features such as tuning available satellite transponders, cable channels and terrestrial television transmitters (according to available tuners) or accessing material via Internet Protocol television (IPTV), watching a TV program or listening to radio, time shifting, Digital video recorder, streaming media programs to other devices (personal computer, mobile phone), etc. Other features are available through plugins – for example Electronic program guide (EPG), Hybrid Broadcast Broadband TV (HbbTV), access to TV archives and movie databases, playback of multimedia files, viewing photos, etc.
The name Enigma2 is often used to refer to the whole Linux distribution designed for TV receivers containing the Enigma2 application. Sometimes the distribution is called Linux E2 or E2 Linux, but usually it is named after the specific distro or development team – OpenATV, OpenPLi, OpenViX, EGAMI, OpenEight, Black Hole, OpenDroid, PurE2, etc. The distribution was originally developed for Dreambox receivers, but after 2010 a number of manufacturers of similar equipment appeared, such as Formuler, GigaBlue, Octagon, Opticum, Unibox, Vu+, Zgemma, etc.
The devices
Devices designed for Enigma2 (i.e. satellite receivers, set-top boxes and IPTV receivers, often simply called boxes) are equipped with one or more DVB-S, DVB-C and DVB-T tuner(s) (unless they are pure IPTV receivers), a Remote control receiver and an Ethernet and/or Wi-Fi network adapter. To receive coded/scrambled programs the box may be equipped with one or more slots for decoding cards. The operating system is usually stored on internal flash memory, whereas to record programs or to play multimedia files a la |
https://en.wikipedia.org/wiki/Phylogenetic%20signal | Phylogenetic signal is an evolutionary and ecological term, that describes the tendency or the pattern of related biological species to resemble each other more than any other species that is randomly picked from the same phylogenetic tree.
Characteristics
Phylogenetic signal is usually described as the tendency of related biological species to resemble each other more than any other species that is randomly picked from the same phylogenetic tree. In other words, phylogenetic signal can be defined as the statistical dependence among species' trait values that is a consequence of their phylogenetic relationships. The traits (e.g. morphological, ecological, life-history or behavioural traits) are inherited characteristics – meaning the trait values are usually alike within closely related species, while trait values of distantly related biological species do not resemble each other to a such great degree. It is often said that traits that are more similar in closely related taxa than in distant relatives exhibit greater phylogenetic signal. On the other hand, some traits are a consequence of convergent evolution and appear more similar in distantly related taxa than in relatives. Such traits show lower phylogenetic signal.
Phylogenetic signal is a measure, closely related with an evolutionary process and development of taxa. It is thought that high rate of evolution leads to low phylogenetic signal and vice versa (hence, high phylogenetic signal is usually a consequence of either low rate of evolution either stabilizing type of selection). Similarly high value of phylogenetic signal results in an existence of similar traits between closely related biological species, while increasing evolutionary distance between related species leads to decrease in similarity. With a help of phylogenetic signal we can quantify to what degree closely related biological taxa share similar traits.
On the other hand, some authors advise against such interpretations (the ones based on |
https://en.wikipedia.org/wiki/Beyond%20Infinity%20%28mathematics%20book%29 | Beyond Infinity : An Expedition to the Outer Limits of Mathematics is a popular mathematics book by Eugenia Cheng centered on concepts of infinity. It was published by Basic Books and (with a slightly different title) by Profile Books in 2017, and in a paperback edition in 2018. It was shortlisted for the 2017 Royal Society Insight Investment Science Book Prize.
Topics
The book is divided into two parts, with the first exploring notions leading to concepts of actual infinity, concrete but infinite mathematical values. After an exploration of number systems, this part discusses set theory, cardinal numbers, and ordinal numbers, transfinite arithmetic, and the existence of different infinite sizes of sets. Topics used to illustrate these concepts include Hilbert's paradox of the Grand Hotel, Cantor's diagonal argument, and the unprovability of the continuum hypothesis.
The second part concerns mathematics related to the idea of potential infinity, the assignment of finite values to the results of infinite processes including growth rates, limits, and infinite series. This part also discusses Zeno's paradoxes, Dedekind cuts, the dimensions of spaces, and the possibility of spaces of infinite dimensions, with a mention of higher category theory, Cheng's research specialty.
The mathematics is frequently lightened and made accessible with personal experiences and stories, involving such subjects as the Loch Ness Monster, puff pastry, boating, dance contests, shoes, "Legos, the iPod Shuffle, snorkeling, Battenberg cakes and Winnie-the-Pooh".
Audience and reception
The Royal Society judges called Beyond Infinity "a very engaging introduction to a forbidding subject". Similarly, reviewer Anne Haworth calls it "engaging and readable", and Wall Street Journal reviewer Sam Kean writes that its "chatty tone keeps things fresh". It is aimed at a popular audience, not assumed to have a significant background in mathematics, including "the young or those brimming with curiosi |
https://en.wikipedia.org/wiki/Association%20for%20Materials%20Protection%20and%20Performance | The Association for Materials Protection and Performance (AMPP), is a professional association focused on the protection of assets and performance of materials. AMPP was created when NACE International and SSPC the Society for Protective Coatings merged in 2021. AMPP is active in more than 130 countries and has more than 40,000 members. AMPP is headquartered in the U.S. with offices in Houston, Texas and Pittsburgh, Pennsylvania. Additional offices are located in the U.K., China, Malaysia, Brazil, and Saudi Arabia with a training center in Dubai.
Publications
Materials Performance magazine
CoatingsPro magazine
CORROSION journal
technical and reference books
podcasts and webcasts
Standards
Both the legacy NACE and SSPC organizations were ANSI-accredited standards developers, which AMPP plans to continue. The merged standards program includes 25 standing standards committees that develop technical standards for industries including cathodic protection, coatings, defense, highways and bridges, rail, maritime, oil and gas, power and utilities, research and testing, tanks and pipelines, and water and wastewater.
Professional Training and Certifications
AMPP offers individual training and certification programs. Many are merged programs that originated as competing programs under the former NACE and SSPC organizations. Other programs are still being administered under the legacy NACE or SSPC frameworks until the merger is complete.
Contractor Accreditation
AMPP administers accreditation programs for contractors working in the protective coatings and linings industries. "QP" stands for "Qualification Procedure", a reference to the technical standard that underlies each program.
QP 1, Field Application to Complex Industrial and Marine Structures
QP 2, Field Removal of Hazardous Coatings
QP 3, Shop Painting (QP 3 is a joint standard also used by AISC for their sophisticated paint endorsement.)
QP 5, Coating and Lining Inspection Companies
QP 6, Metallizing
QP 7, Paintin |
https://en.wikipedia.org/wiki/Fair%20division%20among%20groups | Fair division among groups (or families) is a class of fair division problems, in which the resources are allocated among groups of agents, rather than among individual agents. After the division, all members in each group consume the same share, but they may have different preferences; therefore, different members in the same group might disagree on whether the allocation is fair or not. Some examples of group fair division settings are:
Several siblings inherited some houses from their parents and have to divide them. Each sibling has a family, whose members may have different opinions regarding which house is better.
A partnership is dissolved, and its assets should be divided among the partners. The partners are firms; each firm has several stockholders, who might disagree regarding which asset is more important.
The university management wants to allocate some meeting-rooms among its departments. In each department there are several faculty members, with differing opinions about which rooms are better.
Two neighboring countries want to divide a disputed region among them. The citizens in each country differ on which parts of the region are more important. This is a common obstacle to resolving international disputes.
The "group of agents" may also represent different conflicting preferences of a single person. As observed in behavioral economics, people often change their preferences according to different frames of mind or different moods. Such people can be represented as a group of agents, each of whom has a different preference.
In all the above examples, the groups are fixed in advance. In some settings, the groups can be determined ad-hoc, that is, people can be grouped based on their preferences. An example of such a setting is:
Some 30 people want to use the local basketball court. Each game involves 10 players with different preferences regarding which time is better. It is required to partition the time of day into 3 parts and partition the pla |
https://en.wikipedia.org/wiki/DashO%20%28software%29 | DashO is a code obfuscator, compactor, optimizer, watermarker and encryptor for Java, Kotlin and Android applications. It aims to achieve little or no performance loss even as the code complexity increases.
DashO can also statically analyze the code to find unused types, methods, and fields, and delete them, thereby making the application smaller. DashO can delete used methods that are not needed in published applications, such as debugging and logging calls.
See also
Dotfuscator - a code obfuscator for .NET.
ProGuard (software) - a code obfuscator for Java.
References
Software obfuscation
Java development tools
Android (operating system) development software |
https://en.wikipedia.org/wiki/Soviet%20computing%20technology%20smuggling | Soviet computing technology smuggling, both attempted and actual, was a response to CoCom (Coordinating Committee for Multilateral Export Controls) restrictions on technology transfer.
History
Mainframe successes
Initially the Soviet Union focused on mainframe computing technology, particularly the IBM 360 and 370. Between 1967 and 1972 much effort went into reverse engineering what they "acquired." Their first IBM-like machine was based on a 360/40 smuggled in via Poland. The second Soviet-built machine was from a 370/145. Their focus subsequently shifted to super-minicomputers. Failure in 1983 to import a VAX-11/782 did not stop their efforts. "Reverse-engineered and copied Apple IIe parts" brought microcomputers to the Soviet Union; it also brought computer viruses too. IBM PC compatible computers were also smuggled in.
Production of Iron curtain mainframes, at one point, was estimated to be 180 per year.
VAX failures
The failure of the Soviets to acquire a VAX-11/782, a dual-processor variation of the VAX-11/780, the original VAX, unraveled much of their smuggling system. U. S. Secretary of Defense Caspar Weinberger made a public display of the system, about which The Washington Post headlined "Seized Computer Put on Display" in later 1983. The computer had been exported from the United States to South Africa, from which it was to clandestinely be reshipped; it was seized "moments before its scheduled shipment to the Soviet Union." Weinberger stated at a news conference that the VAX was intended for assisting production of "vastly more accurate . . . and more destructive weapons."
Like the 360/40, the smuggling process involved multiple shipments. The 360 had been disassembled and placed in a large number of suitcases. A smaller number of "huge containers of parts" held the 782. The latter's route involved transhipping, some more than half via Sweden, others via West Germany. A U.S. official describe potential "military uses, including the operation of a mi |
https://en.wikipedia.org/wiki/Finding%20Ellipses | Finding Ellipses: What Blaschke Products, Poncelet’s Theorem, and the Numerical Range Know about Each Other is a mathematics book on "some surprising connections among complex analysis, geometry, and linear algebra", and on the connected ways that ellipses can arise from other subjects of study in all three of these fields. It was written by Ulrich Daepp, Pamela Gorkin, Andrew Shaffer, and Karl Voss, and published in 2019 by the American Mathematical Society and Mathematical Association of America as volume 34 of the Carus Mathematical Monographs, a series of books aimed at presenting technical topics in mathematics to a wide audience.
Topics
Finding Ellipses studies a connection between Blaschke products, Poncelet's closure theorem, and the numerical range of matrices.
A Blaschke product is a rational function that maps the unit disk in the complex plane to itself, and maps some given points within the disk to the origin. In the main case considered by the book, there are three distinct given points , , and , and their Blaschke product has the formula
For this function, each point on the unit circle has three preimages, also on the unit circle. These triples of preimages form triangles inscribed in the unit circle, and (it turns out) they all circumscribe an ellipse with foci at and . Thus, they form an infinite system of polygons inscribed in and circumscribing two conics, which is exactly the kind of system that Poncelet's theorem describes. This theorem states that, whenever one polygon is inscribed in a conic and circumscribes another conic, it is part of an infinite family of polygons of the same type, one through each point of either conic. The family of triangles constructed from the Blaschke product is one of these infinite families of Poncelet's theorem.
The third part of the connection surveyed by the book is the numerical range of a matrix, a region within which the eigenvalues of the matrix can be found. In the case of a complex matrix, the numeri |
https://en.wikipedia.org/wiki/Warazan | was a system of record-keeping using knotted straw at the time of the Ryūkyū Kingdom. In the dialect of the Sakishima Islands it was known as barasan and on Okinawa Island as warazani or warazai. Formerly used in particular in relation to the "head tax", it is still to be found in connection with the annual , to record the amount of miki or sacred sake dedicated.
See also
Kaidā glyphs
Naha Tug-of-war
Quipu
References
Ryukyu Kingdom
Japanese writing system
Knots
Mathematical notation
Recording
Proto-writing
ja:結縄#沖縄 |
https://en.wikipedia.org/wiki/Bridge%20strike | Bridge strike or tunnel strike (also known as bridge bashing) is a type of accidents in which vehicles are collided with the underside of bridge, overpass or tunnel structures. This involves over-height vehicles, or low vertical clearance bridges, overpasses or tunnels. These accidents occur frequently and are a major issue worldwide. In waterways, the term bridge strike is used for water vessel and bridge collisions including bridge span and support structure collisions.
Impacts
In United Kingdom, railway bridge strikes (called "bridge bashing") happen on an average of once every four and half hours with total of 1789 times in 2019. Several bridges being hit over 20 times in a single year. The total cost borne by the state was around £23 million. In Beijing,
China, 20% of all bridge damages are caused by bridge strikes. Texas Department of Transportation estimated in 2013 that an average cost to repair a bridge strike is $180,000 USD.
Even without damages to the bridges, the strikes can result in significant damages to the vehicles. There are many examples of buses that have their roofs got completely cut off by bridge strikes, such as strikes in Birkenhead in 2014, Long Island in 2018, and Glasgow in 2023. Local communities also incur costs related to strikes without bridge damages. These include economic impacts due to road closures, and police response and cleanup costs. From 2021 to 2022, Network Rail lost £12 million in train delay and cancellation fees.
The severity of damage to bridges caused by strikes can vary depending on the type of impact and the differences in damage resistance among bridges. Some of them are not structural damages and only minor repairs are required. Some major structural damages require extensive repairs, for example, an overpass strike in Nashville in 2018 caused a structural beam to be twisted, resulting in repair cost of nearly one million US dollars. Repairs of structural damages can be long and complicated process. In order t |
https://en.wikipedia.org/wiki/The%20Flying%20Luna%20Clipper | is a 1987 Japanese computer-animated art film/demo directed by Ikko Ono and produced by Sony. The film was animated entirely using 8-bit MSX computers and was released on Video8, Betamax, VHS, and LaserDisc in Japan. It was mostly unknown until a copy was found in a Japanese thrift store and uploaded to YouTube in December 2015 by journalist Matt Hawkins.
Plot
The film depicts a group of anthropomorphic fruits and other creatures who win a contest for a ticket on the first flight of a newly found Martin M-130 flying boat named the Flying Luna Clipper. Departing from Honolulu, they embark on a journey across the Pacific Ocean and watch short films on a 200-inch screen during the trip.
Background
Ikko Ono is a graphic designer who worked as the cover artist for from 1986. He also had his own column called Ikko's Gallery about using the computer as a tool for illustration. Many of the illustrations he created for the magazine depict characters seen the film. Later he had another column called Ikko's Theatre about short films which served as the basis for The Flying Luna Clipper. It was first announced in the May 1987 issue of the magazine to celebrate the fifth anniversary of the publication, and according to the same magazine, was released via home video on 1 October of that year, and was featured again in Ikko's Theatre the following month.
Legacy
A revived run of MSX Magazine was published between 2002 and 2005. A special limited edition of the magazine published a series of 12 artworks in December 2003 by Ohno featuring characters from the film entitled "The Flying Luna Clipper 2004", followed by a calendar featuring the art for that year. However, a sequel was never created. The film remained obscure until December 2015 when a LaserDisc copy was uploaded online by Matt Hawkins, after which it steadily grew in popularity. In 2019, Hawkins screened it theatrically at the Wonderville arcade in New York City, doing so again a year later in 2020.
In December 2 |
https://en.wikipedia.org/wiki/Global%20Species%20List%20Working%20Group | The Global Species List Working Group (GSLWG) is a non-profit organization and non-governmental organization, founded in 2020, developed under the umbrella of the IUBS with the aim of creating a governance system that imbues global taxon lists with a legitimacy and authority respected by both taxonomists and the users of taxonomy. The organization was developed in response to several publications that demonstrated the need for stability in the names of species. The founding meeting was held in Charles Darwin University in Darwin, Australia in January 2020.
The initial impetus for the group arose from an opinion piece published in the journal Nature by Stephen Garnett and Les Christidis. This piece aroused backlash within the taxonomic community with fears of unnecessary governance being proposed on the science of taxonomy. In a response with 184 authors led by Scott Thomson and Richard Pyle discussion followed. Efforts to reconcile the differences of opinion was made and four authors of these two pieces came to a consensus in the formulation of a new approach to the stabilization of species nomenclature.
Objectives
The primary objective of the GSLWG is to create a governance system that gives global taxon lists a legitimacy and authority respected by both taxonomists and the users of taxonomy. This objective is being pursued through the promotion of 10 principles for creating species lists:
. The species list must be based on science and free from nontaxonomic considerations and interference.
. Governance of the species list must aim for community support and use.
. All decisions about list composition must be transparent.
. The governance of validated lists of species is separate from the governance of the naming of species.
. Governance of lists of accepted species must not strain academic freedom.
. The set of criteria considered sufficient to recognize species boundaries may appropriately vary between different taxonomic groups but should be consistent when |
https://en.wikipedia.org/wiki/Ensifer%20numidicus | Ensifer numidicus is a nitrogen fixing symbiont of Fabaceae. gram-negative, aerobic, non-spore forming, rod-shaped bacterium of the family Rhizobiaceae. First described in 2010; more biovars have since been isolated and described with ORS 1407 considered the representative organism. Most examples have been found in arid and infra-arid regions of Tunisia.
Host plants
Biovars has been shown to induce nodule formation in a wide variety of symbiosis competent plant species including Medicago Sativa(cultivated alfalfa), Lotus creticus, Syrian mesquite(Prosopis farcta), Lens culinaris Medikus ssp(lentils) as well as Cicer arietinum(chickpea) and Argyrolobium uniflorum.
Associated Biovars
Argyrolobium uniflorum: ORS 1407
cultivated alfalfa (Medicago sativa) :ORS 1407
Lotus creticus: PT26, ORS 1410
Cultivated lentils(Lens culinaris): ORS 1444
Cicer arietinum(chickpea):LBi2
Syrian mesquite(Prosopis farcta):PN14
Known relationships between cultivars
This phylogeny is based on a constrained analysis of the 16S ribosomal RNA
Genome
16s RNA analysis has found Ensifer numidicus to be closely related to Ensifer medicae and Ensifer garamanticus. Analogous genes between closely related species suggests high levels of horizontal gene transfer between closely related species. Laboratory inoculation has shown Ensifer numidicus engages in indeterminate nodulation with host plants in at least some circumstances.
Growth conditions
E. numidicus has been found to grow on yeast-mannitol medium at 28C with an upper limit of 40C. Laboratory cultivated strains have found metabolism of at least 13 substrates including dulcitol, D-lyxose, 1-O-methyl a-D-glucopyranoside, 3-O-methyl-D-glucopyranose, D-gluconate, L-histidine, succinate, fumarate, ethanolamine, DL-b-hydroxybutyrate, L-aspartate, L-alanine and propionate. Sensitivity has been found to salt concentrations greater than 4%. Due to similarities to other Ensifer species, it cannot be described by growth conditions alone |
https://en.wikipedia.org/wiki/Book%20of%20the%20Zodiac | The Book of the Zodiac () is a Mandaean text. It covers Mandaean astrology in great detail. The book is used to obtain a Mandaean's baptismal name (malwasha). It is also an important source on Mandaean numerology.
Manuscripts and translations
An English translation of the text, based on Manuscript 31 of the Drower Collection (DC 31), was published by E. S. Drower in 1949. The manuscript is a kurasa, or unbound manuscript consisting of loose sheets.
Buckley has also located a privately held copy of the Book of the Zodiac dating from 1919, which belonged to Lamea Abbas Amara in San Diego.
There is also a manuscript of the Book of the Zodiac from 1789 CE that is currently held at the Bibliothèque National in Paris, which was used by Drower and may have also been used by Nicolas Siouffi.
Contents
Drower's manuscript (DC 31) consists of 289 pages in Mandaic. There are 20 individual books or sections, which are:
Book 1: The Book of the Signs of the Zodiac for Men
Book 2: The Book of the Signs of the Zodiac for Women
Book 3: The Book of Stars
Book 4: lists of astrological terms and calculations
Book 5: The Book of the Moon
Book 6: charms against evil spirits
Book 7: charms against evil spirits
Book 8: The Days of the Month
Book 9: illnesses
Book 10: astrological information
Book 11: selecting days for certain activities
Book 12: The Opening of a Door
Book 13: predictions
Book 14: predictions
Book 15: predictions
Book 16: predictions
Book 17: geographical regions governed by the planets and zodiac signs
Book 18: predictions
Book 19: transits of Saturn, halos of the sun, meteors and comets, and rainfall
Book 20: meteorology
There is also an appendix (labeled as Part II in Drower's text) that discusses omens, predictions, remedies, eclipses, and other topics.
See also
Ginza Rabba
Mandaean Book of John
References
External links
Code Sabéen 25 from Wikimedia Commons
Sfar Mulwasha (Mandaic text from the Mandaean Network)
Sfar Mulwasha (Mandaic text from the Mandaean Net |
https://en.wikipedia.org/wiki/Buchholz%20hydra | In mathematics, especially mathematical logic, graph theory and number theory, the Buchholz hydra game is a type of hydra game, which is a single-player game based on the idea of chopping pieces off of a mathematical tree. The hydra game can be used to generate a rapidly growing function, , which eventually dominates all recursive functions that are provably total in "", and the termination of all hydra games is not provably total in .
Rules
The game is played on a hydra, a finite, rooted connected tree , with the following properties:
The root of has a special label, usually denoted .
Any other node of has a label .
All nodes directly above the root of have a label .
If the player decides to remove the top node of , the hydra will then choose an arbitrary , where is a current turn number, and then transform itself into a new hydra as follows. Let represent the parent of , and let represent the part of the hydra which remains after has been removed. The definition of depends on the label of :
If the label of is 0 and is the root of , then = .
If the label of is 0 but is not the root of , copies of and all its children are made, and edges between them and 's parent are added. This new tree is .
If the label of is for some , then the first node below is labelled as . is then the subtree obtained by starting with and replacing the label of with and with 0. is then obtained by taking and replacing with . In this case, the value of does not matter.
If the label of is , is obtained by replacing the label of with .
If is the rightmost head of , is written. A series of moves is called a strategy, and a strategy is called a winning strategy if, after a finite amount of moves, the hydra reduces to its root. It has been proven that this always terminates, even though the hydra can get taller by massive amounts.
Hydra theorem
Buchholz's paper in 1987 showed that the canonical correspondence between a hydra and an infinitary well |
https://en.wikipedia.org/wiki/Toronto%20Declaration | The Toronto Declaration: Protecting the Rights to Equality and Non-Discrimination in Machine Learning Systems is a declaration that advocates responsible practices for machine learning practitioners and governing bodies. It is a joint statement issued by groups including Amnesty International and Access Now, with other notable signatories including Human Rights Watch and The Wikimedia Foundation. It was published at RightsCon on May 16, 2018.
The Declaration focuses on concerns of algorithmic bias and the potential for discrimination that arises from the use of machine learning and artificial intelligence in applications that may affect people's lives, "from policing, to welfare systems, to healthcare provision, to platforms for online discourse." A secondary concern of the document is the potential for violations of information privacy.
The goal of the Declaration is to outline "tangible and actionable standards for states and the private sector." The Declaration calls for tangible solutions, such as reparations for the victims of algorithmic discrimination.
Contents
The Toronto Declaration consists of 59 articles, broken into six sections, concerning international human rights law, duties of states, responsibilities of private sector actors, and the right to an effective remedy.
Preamble
The document begins by asking the question, "In a world of machine learning systems, who will bear accountability for harming human rights?" It argues that all practitioners, whether in the public or private sector, should be aware of the risks to human rights and approach their work with human rights in mind – conscious of the existing international laws, standards, and principles. The document defines human rights to include "the right to privacy and data protection, the right to freedom of expression and association, to participation in cultural life, equality before the law, and access to effective remedy"; but it states that the Declaration is most concerned with equali |
https://en.wikipedia.org/wiki/Extension%20complexity | In convex geometry and polyhedral combinatorics, the extension complexity of a convex polytope is the smallest number of facets among convex polytopes that have as a projection. In this context, is called an extended formulation of ; it may have much higher dimension than .
The extension complexity depends on the precise shape of , not just on its combinatorial structure. For instance, regular polygons with sides have extension complexity (expressed using big O notation), but some other convex -gons have extension complexity at least proportional to .
If a polytope describing the feasible solutions to a combinatorial optimization problem has low extension complexity, this could potentially be used to devise efficient algorithms for the problem, using linear programming on its extended formulation. For this reason, researchers have studied the extension complexity of the polytopes arising in this way. For instance, it is known that the matching polytope has exponential extension complexity. On the other hand, the independence polytope of regular matroids has polynomial extension complexity.
The notion of extension complexity has also been generalized from linear programming to semidefinite programming, by considering projections of spectrahedra in place of projections of polytopes.
References
Polyhedral combinatorics |
https://en.wikipedia.org/wiki/Framework%20Computer | Framework Computer, Inc. is an American laptop manufacturer. The company positions itself as a proponent of the electronics right to repair movement, and their laptops are designed to be easy to disassemble, with replaceable parts. In November 2021, Time magazine listed the Framework Laptop on their list of the 100 Best Inventions of 2021. In March 2022, Fast Company listed the Framework Laptop on their list of the Most Innovative Companies of 2022. In October 2023, Time magazine listed the Framework Laptop 16 on their list of the 200 Best Inventions of 2023.
History
In January 2020, the company was founded by Nirav Patel, who was the original Head of Hardware at Oculus. In the first half of 2021, the company was funded with a $9 million seed round. YouTuber Linus Sebastian invested $225,000 in the company in September after having previously commended the 11th Gen Intel Framework Laptop 13. In January 2022, the company raised an additional $18 million of financing in a series A round, led by Spark Capital.
Products
Framework Laptop 13
In July 2021, Framework began fulfillment of their first product, the Framework Laptop (retroactively the Framework Laptop 13), with an 11th Gen Intel Core i5 or i7 chip to the US and Canada. In December 2021, Framework opened pre-orders to the UK, Germany and France. In February 2022, pre-ordering became available for Ireland, Austria and The Netherlands. The Framework Laptop received a 10 out of 10 in iFixit's repairability score. The standard Framework Laptop ships as a fully assembled laptop, while the Framework Laptop DIY Edition ships with the RAM, storage, operating system, and in 11th Gen, the WiFi module uninstalled. All of these modules can be ordered with the DIY edition for an additional fee, or left out and purchased separately.
In May 2022, the company launched their second generation Framework Laptop with a 12th Gen Intel Core i5 or i7 chip that ships with an upgraded back panel, alongside their 12 Gen Upgrade K |
https://en.wikipedia.org/wiki/Ol%20Onal | The Ol Onal is an alphabetic writing system for the Bhumij language. Ol Onal script was created between 1981 and 1992 by Ol Guru Mahendra Nath Sardar. Ol Onal script is used to write the Bhumij language in some parts of West Bengal, Jharkhand, Orissa, and Assam.
History
The Ol Onal script was created in between 1981 and 1992 by Mahendra Nath Sardar for the Bhumij language.
The Bhumij community had no written language, and knowledge was transmitted orally from one generation to another. Later researchers started to use Devanagari, Bengali, and Odia scripts to document the Bhumij language. However, Bhumijs did not have their own script. Sardar's invention of the Ol Onal script enriched the cultural identity of the tribal Bhumij community. He wrote many text books in the Ol Onal script.
Language
Bhumij is the language of the Munda subfamily of the Austroasiatic languages, related to Ho, Mundari and Santali, spoken mainly in the Indian states Jharkhand, Odisha and West Bengal. It is spoken by around 100,000 people in India.
See also
Bhumij
Bhumij language
References
External links
The Ol Onal Alphabet at Omniglot
Proposal to encode the Ol Onal script
Alphabets
Munda scripts
Constructed scripts
Writing systems
Writing systems of Asia
Bhumij language
Bhumij
Writing systems introduced in the 1980s |
https://en.wikipedia.org/wiki/Session%20type | In type theory, session types are used to ensure correctness in concurrent programs. They guarantee that messages sent and received between concurrent programs are in the expected order and of the expected type. Session type systems have been adapted for both channel and actor systems.
Session types are used to ensure desirable properties in concurrent and distributed systems, i.e. absence of communication errors or deadlocks, and protocol conformance.
Binary versus Multiparty Session Types
Interaction between two processes can be checked using binary session types, while interactions between more than two processes can be checked using multiparty session types. In multiparty session types interactions between all participants are described using a global type, which is then projected into local types that describe communication from the local view of each participant. Importantly,the global type encodes the sequencing information of the communication, which would be lost if we were to use binary session types to encode the same communication.
Formal definition of binary Session Types
Binary session types can be described using send operations (), receive operations (), branches (), selections (), recursion () and termination ().
For example, represents a session type which first sends a boolean (), then receives an integer () before finally terminating ().
Implementations
Session types have been adapted for several existing programming languages, including:
lchannels (Scala)
Effpi (Scala)
STMonitor (Scala)
EnsembleS
Session-types (Rust)
sesh (Rust)
Session Actors (Python)
Monitored Session Erlang (Erlang)
FuSe (OCaml)
session-ocaml (OCaml)
Priority Sesh (Haskell)
Java Typestate Checker (Java)
References
Concurrency (computer science)
Type theory
Type systems |
https://en.wikipedia.org/wiki/Frobenius%20characteristic%20map | In mathematics, especially representation theory and combinatorics, a Frobenius characteristic map is an isometric isomorphism between the ring of characters of symmetric groups and the ring of symmetric functions. It builds a bridge between representation theory of the symmetric groups and algebraic combinatorics. This map makes it possible to study representation problems with help of symmetric functions and vice versa. This map is named after German mathematician Ferdinand Georg Frobenius.
Definition
The ring of characters
Let be the -module generated by all irreducible characters of over . In particular and therefore . The ring of characters is defined to be the direct sumwith the following multiplication to make a graded commutative ring. Given and , the product is defined to bewith the understanding that is embedded into and denotes the induced character.
Frobenius characteristic map
For , the value of the Frobenius characteristic map at , which is also called the Frobenius image of , is defined to be the polynomial
Remarks
Here, is the partition of integers determined by . For example, when and , corresponds to the partition . Conversely, a partition of (written as ) determines a conjugacy class in . For example, given , is a conjugacy class. Hence by abuse of notation can be used to denote the value of on the conjugacy class determined by . Note this always makes sense because is a class function.
Let be a partition of , then is the product of power sum symmetric polynomials determined by of variables. For example, given , a partition of ,
Finally, is defined to be , where is the cardinality of the conjugacy class . For example, when , . The second definition of can therefore be justified directly:
Properties
Inner product and isometry
Hall inner product
The inner product on the ring of symmetric functions is the Hall inner product. It is required that . Here, is a monomial symmetric function and is a product of co |
https://en.wikipedia.org/wiki/Geotextile%20tube | A geotextile tube is a large, tube-shaped bag made of porous, weather-resistant geotextile and filled with a sand slurry, to form an artificial coastal structure such as a breakwaters, dune or levee. Geotextile tubes are a component of the living shorelines approach to coastal management. they are aligned with the shoreline to weaken wave energy and protect against coastal erosion. The tubes facilitate oyster reef development and create areas to dispose of new dredge material. Geotextile tubes are also installed for land reclamation and temporarily installed during the dewatering phase of a dredging operation.
If a geotextile tube is exposed to the elements, it can be vulnerable to bursting.
Notable installations
Grand Isle, Louisiana ("Burrito Levee")
See also
Breakwater (structure)
Cellular confinement
Groyne
References
Geosynthetics
Coastal engineering |
https://en.wikipedia.org/wiki/Biohybrid%20microswimmer | A biohybrid microswimmer can be defined as a microswimmer that consist of both biological and artificial constituents, for instance, one or several living microorganisms attached to one or various synthetic parts.
In recent years nanoscopic and mesoscopic objects have been designed to collectively move through direct inspiration from nature or by harnessing its existing tools. Small mesoscopic to nanoscopic systems typically operate at low Reynolds numbers (Re ≪ 1), and understanding their motion becomes challenging. For locomotion to occur, the symmetry of the system must be broken.
In addition, collective motion requires a coupling mechanism between the entities that make up the collective. To develop mesoscopic to nanoscopic entities capable of swarming behaviour, it has been hypothesised that the entities are characterised by broken symmetry with a well-defined morphology, and are powered with some material capable of harvesting energy. If the harvested energy results in a field surrounding the object, then this field can couple with the field of a neighbouring object and bring some coordination to the collective behaviour. Such robotic swarms have been categorised by an online expert panel as among the 10 great unresolved group challenges in the area of robotics. Although investigation of their underlying mechanism of action is still in its infancy, various systems have been developed that are capable of undergoing controlled and uncontrolled swarming motion by harvesting energy (e.g., light, thermal, etc.).
Over the past decade, biohybrid microrobots, in which living mobile microorganisms are physically integrated with untethered artificial structures, have gained growing interest to enable the active locomotion and cargo delivery to a target destination. In addition to the motility, the intrinsic capabilities of sensing and eliciting an appropriate response to artificial and environmental changes make cell-based biohybrid microrobots appealing for transpo |
https://en.wikipedia.org/wiki/Eternity%20%28group%29 | IITERNITI (; formerly: ETERNITY) is a South Korean virtual idol group formed by Pulse9. The group debuted on March 22, 2021, with the single "I'm Real". The group consists of 11 members: Seoa, Sujin, Minji, Zae-in, Hyejin, Dain, Chorong, Jiwoo, Yeoreum, Sarang and Yejin. They are created with artificial intelligence technology, Deep Real.
History
On March 22, 2021, Eternity released their debut single "I'm Real", sung by Hyejin, Seoa, Yeoreum, Sujin and Minji.
On August 25 and 26, Pulse9 released the teasers of sixth member, Dain's solo debut single "No Filter", and released the song on August 27.
On September 19, 2023, it was confirmed that Eternity has rebranded to IITERNITI through IITERNITI's official Dicord message.
Members
Yeoreum (여름) - leader, vocalist
Minji (민지) - rapper, dancer
Hyejin (혜진) - rapper
Seoa (서아)
Sujin (수진) - vocalist
Dain (다인)
Chorong (초롱)
Zae-In (제인) - rapper
Jiwoo (지우)
Sarang (사랑)
Yejin (예진)
Discography
Singles
See also
Aespa
References
External links
Eternity Official Website (Korean)
Julie Yoonnyung Lee and Amelia Hemphill, K-pop: the rise of the virtual girl bands, BBC News, 12 December 2022
2021 establishments in South Korea
K-pop music groups
Musical groups established in 2021
South Korean girl groups
Virtual influencers
Fictional characters invented for recorded music
Fictional characters introduced in 2021
Fictional singers
Artificial intelligence art |
https://en.wikipedia.org/wiki/Cellebrite%20UFED | The UFED (Universal Forensics Extraction Device) is a product series of the Israeli company Cellebrite, which is used for the extraction and analysis of data from mobile devices by law enforcement agencies.
Products
Cellebrite sells various products in the UFED series:
UFED Physical Analyzer
UFED Logical Analyzer
UFED Phone Detective
UFED Cloud Analyzer
Features
On the UFED Touch, it is possible to select extraction of data and choose from a wide list of vendors. After the data extraction is done, it is possible to analyze the data in the Physical Analyzer application.
The Cellebrite UFED Physical Analyzer supports the following features:
Extract device keys which can be used to decrypt raw disk images, as well as keychain items.
Revealing device passwords, although this is not available for all locked devices
Passcode recovery attacks
Analysis and decoding of application data
Generating reports in various formats such as PDF and HTML
Dump the raw filesystem for analyzing it in other applications
History
In 2019, Cellebrite announced a new version of the UFED, called the UFED Premium. The company claimed that it can unlock iOS devices including those running iOS 12.3 and Android phones such as the Galaxy S9.
Resale
Cellebrite does not allow the resale of their products. The original list price of the product is around US$6000, but they have been sold on eBay for around US$100. Some devices that were resold still contained data about criminal investigations.
Security
In 2021, Moxie Marlinspike, creator of the encrypted messaging app Signal, released a blog post on the app's website detailing a number of vulnerabilities in Cellebrite's UFED and Physical Analyzer software that allowed for arbitrary code execution on Windows computers running the software. One exploit he detailed involved the UFED scanning a specially formatted file which could then be used to execute arbitrary code on the computer running the UFED. Marlinspike wrote that the cod |
https://en.wikipedia.org/wiki/Channel%20in%20a%20box | Channel in a box is the name given to an all-in-one playout device for broadcast television. Commonly based on a standard PC, it includes the ability to store content immediately required, add graphics, and deliver it to a transmission chain. Thus it provides an integrated, software playout platform.
History
A television channel's output consists of programs, commercials, trailers, promos and public service information. This is delivered in a seamless, continuous stream, cutting between sources at frame accuracy, known as channel playout.
Since the late 1980s there has been a move to automate playout, with commercial products reaching the market in the 1990s. The first broadcasters to move to automated playout are generally considered to be the UK's Channel 4 and its Welsh equivalent, S4C.
These systems used traditional broadcast hardware, including switches, graphics devices and robotic tape players, under the control of a hybrid computer network including PCs for monitoring and control, and special real-time processors to trigger events.
Robotic tape players were replaced by video servers. While digital disk recorders were around from the mid-90s.
As Moore's law continued to increase the processing power of standard computers, so developers looked to move all standard playout functionality to a single device, which rapidly became known as a channel in a box.
Production and philosophy
The relatively compact size of the broadcast industry and the specialised nature of video and audio processing has meant that, for most of the history of television, delivering the performance required has demanded unique hardware. Because the development costs of this technology are amortised over a small number of unit sales, prices are inevitably high.
As IT hardware has improved in performance, so broadcast vendors have moved more processing onto standard platforms. The development of open standards like the SMPTE ST 2110 family has meant that video systems and complete s |
https://en.wikipedia.org/wiki/Coin%20folder | Coin folders are used as a coin storage method to protect coins from the elements.
History
Protection for coins was historically only available to affluent collectors who stored their coins in custom cabinets. The first attempt at creating an album or folder like structure for coins came in 1929, when The Beistle Company began marketing coin albums. These albums were made of heavy cardstock covered in paper on both sides, with cellophane to hold the coins in place, each page was hole-punched on the side to fit into a binder. Prohibitive costs meant that these were only available to confirmed collectors at the time. This changed when J.K. Post in collaboration with The Whitman Company invented the inexpensive coin board in 1934. Coin boards were a huge success as they offered collectors of all types a way to store their coins inexpensively.
The modern day coin folder's invention is disputed by two major rivals. One take has that the folders were invented by R.S. Yeoman of The Whitman Company just before World War II. Yeoman took the old penny board design and simply folded over the portions to create a book (or folder). The other take contends that the folders were devised and first sold by the Daniel Stamp Company (DANSCO) of Los Angeles in 1939 or early 1940. In either case, this rivalry continues to the present day as both companies have made "high quality" folders for collectors since the 1940s.
Creating a book for the coins offers some protection for the coins, and made storage easier as the folders are small in comparison to the former boards. Coin folders have since become available to collectors worldwide with folders made specifically to fit the coins circulating in their respective countries.
Major coin folder brands
Daniel Stamp Company (DANSCO)
Littleton Coin Company
Warmen's
Whitman Publishing
H.E. Harris (Imprint of Whitman)
References
Coin collecting
Numismatics
Computer storage systems |
https://en.wikipedia.org/wiki/Chemiluminescent%20immunoassay | Chemiluminescent immunoassay (CLIA) is a type of immunoassay employing chemiluminescence.
See also
Enzyme-linked immunosorbent assay (ELISA)
References
Immunologic tests |
https://en.wikipedia.org/wiki/Paidy | Paidy is a Japanese deferred online payment service (called Buy now, pay later) for online shops.
Corporate history
Established in March 2008 under the trade name of Exchange Corporation Co., Ltd., the main business was the social lending service "AQUSH". After launching the online payment service "Paidy" in October 2014, gradually shifted the focus of the business to "Paidy", and the social lending business closed new recruitment in June 2018.
On September 7, 2021, PayPal Holdings Inc announced that it would acquire it for US$2.7 billion (about 300 billion yen). The Paidy brand will remain after the acquisition, and will still be managed by the original team.
Service overview
Paidy has partnered with an online shopping site to offer users a "deferred payment service" that can be used without a credit card.
Payments made using Paidy will be combined into one (if used on multiple sites), and the billed amount will be notified to the registered mobile phone by the 3rd of the following month by email and SMS. The user pays the billed amount by bank transfer or convenience store payment by the 10th. (A remittance fee will be charged depending on the payment method. Also, automatic debit by direct debit is possible.) A service called "Paidy Plus" was launched in April 2020, which implements identity verification and usage limit setting functions. Currently available at over 700,000 stores including Amazon and Qoo10.
Paidy is unusual among the world's buy-now-pay-later providers because it allows Japanese consumers to purchase items online and pay them off each month in person at local convenience stores.
References
Online payments
Financial services companies of Japan
Announced mergers and acquisitions |
https://en.wikipedia.org/wiki/Thermal%20laser%20epitaxy | Thermal laser epitaxy (TLE) is a physical vapor deposition technique that utilizes irradiation from continuous-wave lasers to heat sources locally for growing films on a substrate. This technique can be performed under ultra-high vacuum pressure or in the presence of a background atmosphere, such as ozone, to deposit oxide films.
TLE operates at power densities between 104 – 106 W/cm2, which results in evaporation or sublimation of the source material, with no plasma or high-energy particle species being produced. Despite operating at comparatively low power densities, TLE is capable of depositing many materials with low vapor pressures, including refractory metals, a process that is challenging to perform with molecular beam epitaxy.
Physical process
TLE uses continuous-wave lasers (typically with a wavelength of around 1000 nm) located outside the vacuum chamber to heat sources of material in order to generate a flux of vapor via evaporation or sublimation. Owing to the localized nature of the heat induced by the laser, a portion of the source may be transformed into a liquid state while the rest remains solid, such that the source acts as its own crucible. The strong absorption of light causes the laser-induced heat to be highly localized via the small diameter of the laser beam, which can also have the effect of confining the heat to the axis of the source. The resulting absorption corresponds to a typical photon penetration depth on the order of 2 nm due to the high absorption coefficients of α ~ 105 cm−1 of many materials. Heat loss via conduction and radiation further localizes the high-temperature region close to the irradiated surface of the source. The localized character of the heating enables many materials to be grown by TLE from freestanding sources without a crucible. Owing to the direct transfer of energy from the laser to the source, TLE is more efficient than other evaporation techniques such as evaporation and molecular beam epitaxy, which t |
https://en.wikipedia.org/wiki/Java%20Debug%20Wire%20Protocol | In computing, the Java Debug Wire Protocol (JDWP) is a communication protocol which is part of the Java Platform Debugger Architecture. It is used for communication between a debugger and the Java Virtual Machine, which it debugs. It allows to debug processes on a different computer. It can work over a network socket or through shared memory.
The protocol is implemented in the software library libjdwp. It can be activated using the -Xrunjdwp parameter of Java.
Metasploit includes a module for JDWP. It can exploit it using various scripts, which have functions such as injecting a Java class that executes a shell command, returns operating system details or injects an arbitrary class.
References
External links
Java Debug Wire Protocol - Java SE Documentation
Hacking the Java Debug Wire Protocol by IOActive
Patent US20110138359A1 - Modified implementation of java debug wire protocol
JDWP Misconfiguration in Container Images and K8s
Debugging
Communications protocols
Java (programming language) |
https://en.wikipedia.org/wiki/Sharp%20PC-7000 | The Sharp PC-7000 is a luggable portable computer released by Sharp Electronics in 1985. The PC-7000 was Sharp's second entry into the IBM PC-compatible portable computer market, their first being the PC-5000.
The PC-7000 eschewed the PC-5000's clamshell design, battery operation, and lighter weight— for the PC-7000 versus the PC-5000's . The compromise was an LCD display with electroluminescent backlighting, as well as an increased display line count—25 for the PC-7000 versus the PC-5000's eight. Sharp also replaced the predecessor's Intel 8088 processor with an 8086 running at a user-switchable 7.37 MHz and bumped the stock memory from 128 to 320 KB. These improvements led to higher performance and near-true IBM PC compatibility, in turn leading to a wider range of software that could be used with the computer.
Sharp released the PC-7000 in October 1985 to high praise. It spawned a series of luggable computers featuring improvements to the original PC-7000's hardware. Sharp sold hundreds of thousands of units under this series—including the original—over the years, before discontinuing it in 1990.
Specifications
Construction
The Sharp PC-7000's case sports the luggable form factor for portable computers; journalists compared it to a portable radio, a toaster, and a lunchbox. Its keyboard detaches from the display and serves as protection of the latter. The computer's case measures and weighs almost . The computer's chassis was fabricated from steel and provides much of the weight.
The PC-7000's dimensions, when closed, were compliant with the contemporaneously revised restrictions on carry-on luggage set by the Federal Aviation Administration. The same was true even with the computer's optional printer attached. To further assist travelers, Sharp offered a carrying case through mail order.
Components
On the right side of the Sharp PC-7000 are two half-height, 5.25-inch floppy disk drives, mounted vertically and with shock absorption. These drives were man |
https://en.wikipedia.org/wiki/Bioserenity | BioSerenity is medtech company created in 2014 that develops ambulatory medical devices to help diagnose and monitor patients with chronic diseases such as epilepsy. The medical devices are composed of medical sensors, smart clothing, a smartphone app for Patient Reported Outcome, a web platform to perform data analysis through Medical Artificial Intelligence for detection of digital biomarkers. The company initially focused on Neurology, a domain in which it reported contributing to the diagnosis of 30 000 patients per year. It now also operates in Sleep Disorders and Cardiology. BioSerenity reported it provides pharmaceutical companies with solutions for companion diagnostics.
Company history
BioSerenity was founded in 2014, by Pierre-Yves Frouin. The company was initially hosted in the ICM Institute (Institut du Cerveau et de la Moëlle épinière), in Paris, France.
Fund Raising
June 8, 2015 : The company raises a $4 million seed round with Kurma Partners and IdInvest Partners
September 20, 2017 : The company raises a $17 million series A round with LBO France, IdInvest Partners and BPI France
June 18, 2019 : The company raises a $70 million series B round with Dassault Systèmes, IdInvest Partners, LBO France et BPI France
Acquisitions
In 2019, BioSerenity announces the acquisition of the American Company SleepMed and working with over 200 Hospitals.
In 2020, Bioserenity is one of the five French manufacturers (Savoy, BB Distrib, Celluloses de Brocéliande, Chargeurs) working on the production of sanitary equipment including FFP2 masks at request of the French government.
In 2021, the Neuronaute would be used by approximately 30,000 patients per year.
Awards
BioSerenity is one of the Disrupt 100
BioSerenity joins the Next40
BioSerenity selected by Microsoft and AstraZeneca in their initiative AI Factory for Health
BioSerenity accelerated at Stanford's University StartX program
References
External links
FDA Clearance Neuronaute
FDA Clearance C |
https://en.wikipedia.org/wiki/Kleptopharmacophagy | Kleptopharmacophagy is a term used for describing the ecological relationship between two different organisms, where the first is stealing the second's chemical compounds and consuming them. This scientific term was proposed by Australian, Singaporean, and American biologists in September 2021 in an article that was published in the journal Ecology by the Ecological Society of America. The phenomenon was first noticed in milkweed butterflies that were attacking caterpillars and drinking their internal liquid, proposedly to obtain toxic alkaloids used for defense, as well as for mating purposes.
Characteristics
Kleptopharmacophagy is a generic term and a scientific neologism, that is used to describe the phenomenon of chemical theft between living organisms. This special type of behavior is something new for researchers, as it does not match the traditional descriptions of biological interaction. Kleptopharmacophagy cannot be defined simply with a use of classical ecological relationships and their descriptions, such as predation, parasitism and mutualism. Besides being an interspecific interaction, kleptopharmacophagy can also be seen as a cannibalizing act (hence an intraspecific act), with adults attacking larvae of their own species.
In butterflies
Kleptopharmacophagy has only been reported for butterflies in the subfamily Danainae, more commonly known as the milkweed butterflies. The phenomenon was first described in butterflies that were observed scratching and feeding on live larvae of other milkweed butterflies. The initial discovery was made in year 2019 in forests of North Sulawesi, in Indonesia, when two researchers noticed that milkweed butterflies of different species, well-known for their toxicity and bright warning colours (aposematism), were interacting with the larval stages of other butterflies. The adult insects were attacking and harassing the caterpillars by scratching at them with tarsal claws on their legs. The butterflies then imbibed the |
https://en.wikipedia.org/wiki/Solana%20%28blockchain%20platform%29 | Solana is a blockchain platform which uses a proof-of-stake mechanism to provide smart contract functionality. Its native cryptocurrency is SOL.
Solana was launched in 2020 by Solana Labs, which was founded by Anatoly Yakovenko and Raj Gokal in 2018. The blockchain has experienced several major outages, was subjected to a hack, and a class action lawsuit was filed against the platform.
Solana's total market cap was in January 2022. However, by the end of 2022, this had fallen to around $3 billion following the bankruptcy of FTX. Following the general rise of the cryptocurrency market in 2023, its market cap rose to $7 billion.
Characteristics
According to the company's white paper, Solana runs on a proof of stake model. The New York Times and Financial Times described the coin as an alternative to Ethereum.
History
Solana was first opened to the public in March 2020, with its first block being created on 16 March 2020. The Solana blockchain was designed to support smart contracts and decentralized apps in particular. Large numbers of simultaneous transactions have contributed to several outages of the Solana blockchain.
In June 2021, Solana Labs sold $314 million worth of its native cryptocurrency, SOL, to a group of funds led by Andreessen Horowitz and Polychain Capital.
On 1 July 2022, a class action lawsuit was filed against Solana. The lawsuit accused Solana of selling unregistered securities tokens in the form of Solana from 24 March 2020, onward and that Solana deliberately misled investors concerning the total circulating supply of SOL tokens. According to the lawsuit, Anatoly Yakovenko, the founder of Solana Labs, lent a market maker more than 11.3 million tokens in April 2020 and failed to disclose this information to the public. The lawsuit claimed that Solana stated it would reduce the supply by this amount, but it only burned 3.3 million tokens.
On 3 August, 2022, 9,231 Solana wallets were hacked and four Solana wallet addresses stole approxima |
https://en.wikipedia.org/wiki/Photobacterium%20marinum | Photobacterium marinum is a gram-negative, oxidase and catalase positive, motile bacteria of the genus Photobacterium. Photobacterium marinum are commonly found in marine environment. S.I. Paul et al. (2021) isolated, characterized and identified Photobacterium marinum from marine sponges of the Saint Martin's Island Area of the Bay of Bengal, Bangladesh.
Biochemical characteristics of Photobacterium marinum
Colony, morphological, physiological, and biochemical characteristics of Photobacterium marinum are shown in the Table below.
Note: + = Positive; – =Negative; V =Variable (+/–)
References
Vibrionales
Undescribed species |
https://en.wikipedia.org/wiki/EXL%20100 | The EXL 100 is a computer released in 1984 by the French brand Exelvision, based on the TMS 7020 microprocessor from Texas Instruments. This was an uncommon design choice (at the time almost all home computers either used 6502 or Z80 microprocessors) but justified by the fact that the engineering team behind the machine (Jacques Palpacuer, Victor Zebrouck and Christian Petiot) came from Texas instruments.
It was part of the government Computing for All plan and 9000 units were used in schools.
The design is unusual compared with similar machines of the time, as it had a separate central processing unit. Two keyboards are available: one with rubber keys and another with a more standard touch. Keyboard and joystick were not connected to the central unit by a cable but by infrared link, and are battery powered. Many extensions were available: modem, floppy disk drive and a 16 KB CMOS RAM powered by an integrated lithium battery.
Its TMS 5220 sound processor was capable of French speech synthesis, another unusual feature.
The machine came with a BASIC version on cartridge named ExelBasic.
Specifications
Release price: 3,190 French Francs
CPU: TMS 7020 at 4.9 Mhz
Graphics chip: TMS 3556 (40 x 25 character text mode, 320 x 250 pixel graphics mode, 8 colors)
Sound: TMS 5220 (with speech synthesis in French)
Storage: cartridge port, cassettes, optional floppy disk drive
Memory: 34KB RAM (2KB RAM + 32KB Shared VRAM), 4 to 32KB ROM
Variants: A version with an integrated V23 modem named Exeltel was released in 1986
References
Lists of computer hardware
Computer companies of France |
https://en.wikipedia.org/wiki/Science%20Fiction%20Awards%20Database | The (SFADB) is an index of science fiction, fantasy, and horror awards compiled by Mark R. Kelly and published by the Locus Science Fiction Foundation. Known formerly as the Locus Index to SF Awards, it has been cited as an invaluable science fiction resource, and is often more up-to-date than the awards' own websites (according to The Encyclopedia of Science Fiction).
History
The Locus Index to Science Fiction Awards was established in 2000 by Mark R. Kelly, the founder of Locus Online. The Cornell University Library has described it as a comprehensive listing of science fiction awards, including "reader polls, fan awards, inactive awards, academic awards, award statistics, and more". Despite the title, the index has always covered fantasy and horror in addition to science fiction. In 2012, coincident with Kelly's retirement as an aerospace software engineer, the website received a redesign and expansion, and was renamed the Science Fiction Awards Database (SFADB).
Reception
The index has received praise from authors and editors of speculative fiction, including Jo Walton and Gardner Dozois. Walton has said that her book An Informal History of the Hugos would not have been possible without the existence of the index. The Orion Publishing Group called it "extraordinary, and to our mind, criminally under-appreciated", and cited it as a primary source for Gollancz's SF Masterworks and SF Gateway series of books.
Writing in The Encyclopedia of Science Fiction, Peter Nicholls and David Langford called the index invaluable, and noted that it was often more up-to-date than the awards' official websites. Locus Online, which hosted the index, received the 2002 Hugo Award for Best Website.
Contents
The SFADB compiles over 100 literary awards for science fiction, fantasy, and horror, from 1951 to date. It includes both nominees and winners, with a separate page for each person and award. Awards are displayed as three groups: Major Career Awards, Major Awards and Ot |
https://en.wikipedia.org/wiki/Independence%20Theory%20in%20Combinatorics | Independence Theory in Combinatorics: An Introductory Account with Applications to Graphs and Transversals is an undergraduate-level mathematics textbook on the theory of matroids. It was written by Victor Bryant and Hazel Perfect, and published in 1980 by Chapman & Hall.
Topics
A major theme of Independence Theory in Combinatorics is the unifying nature of abstraction, and in particular the way that matroid theory can unify the concept of independence coming from different areas of mathematics. It has five chapters, the first of which provides basic definitions in graph theory, combinatorics, and linear algebra, and the second of which defines and introduces matroids, called in this book "independence spaces". As the name would suggest, these are defined primarily through their independent sets, but equivalences with definitions using circuits, matroid rank, and submodular set function are also presented, as are sums, minors, truncations, and duals of matroids.
Chapter three concerns graphic matroids, the matroids of spanning trees in graphs, and the greedy algorithm for minimum spanning trees. Chapter four includes material on transversal matroids, which can be described in terms of matchings of bipartite graphs, and includes additional material on matching theory and related topics including Hall's marriage theorem, Menger's theorem (an equivalence between minimum cuts and maximum sets disjoint paths in graphs), Latin squares, and gammoids. The final chapter concerns matroid representations using linear independence in vector spaces, labeled as an appendix and presented with fewer proofs.
Many exercises are included, of varied difficulty, with hints and solutions.
Audience and reception
The level of the text is appropriate for courses for advanced undergraduates or master's students, with only basic linear algebra as a prerequisite, and covers its material at a more accessible and general level than other texts on matroid theory. Although disagreeing with the |
https://en.wikipedia.org/wiki/Automated%20decision-making | Automated decision-making (ADM) involves the use of data, machines and algorithms to make decisions in a range of contexts, including public administration, business, health, education, law, employment, transport, media and entertainment, with varying degrees of human oversight or intervention. ADM involves large-scale data from a range of sources, such as databases, text, social media, sensors, images or speech, that is processed using various technologies including computer software, algorithms, machine learning, natural language processing, artificial intelligence, augmented intelligence and robotics. The increasing use of automated decision-making systems (ADMS) across a range of contexts presents many benefits and challenges to human society requiring consideration of the technical, legal, ethical, societal, educational, economic and health consequences.
Overview
There are different definitions of ADM based on the level of automation involved. Some definitions suggests ADM involves decisions made through purely technological means without human input, such as the EU's General Data Protection Regulation (Article 22). However, ADM technologies and applications can take many forms ranging from decision-support systems that make recommendations for human decision-makers to act on, sometimes known as augmented intelligence or 'shared decision-making', to fully automated decision-making processes that make decisions on behalf of individuals or organizations without human involvement. Models used in automated decision-making systems can be as simple as checklists and decision trees through to artificial intelligence and deep neural networks (DNN).
Since the 1950s computers have gone from being able to do basic processing to having the capacity to undertake complex, ambiguous and highly skilled tasks such as image and speech recognition, gameplay, scientific and medical analysis and inferencing across multiple data sources. ADM is now being increasingly deployed acr |
https://en.wikipedia.org/wiki/Glossary%20of%20engineering%3A%20M%E2%80%93Z | This glossary of engineering terms is a list of definitions about the major concepts of engineering. Please see the bottom of the page for glossaries of specific fields of engineering.
M
N
O
P
Q
R
S
T
U
V
W
X-Z
See also
Engineering
National Council of Examiners for Engineering and Surveying
Fundamentals of Engineering Examination
Principles and Practice of Engineering Examination
Graduate Aptitude Test in Engineering
Glossary of aerospace engineering
Glossary of civil engineering
Glossary of electrical and electronics engineering
Glossary of mechanical engineering
Glossary of structural engineering
Glossary of architecture
Glossary of areas of mathematics
Glossary of artificial intelligence
Glossary of astronomy
Glossary of biology
Glossary of calculus
Glossary of chemistry
Glossary of ecology
Glossary of economics
Glossary of physics
Glossary of probability and statistics
Notes
References
Sources
.
Engineering
Engineering disciplines
engineering
Safety
Engineering
Wikipedia glossaries using description lists |
https://en.wikipedia.org/wiki/UEFITool | UEFITool is a software program for reading and modifying EEPROM images that contain an UEFI firmware. Features include the ability to view the flash regions and to extract and import them.
References
External links
UEFITool GitHub repository
Unified Extensible Firmware Interface
Free software programmed in C++ |
https://en.wikipedia.org/wiki/Optimal%20apportionment | Optimal apportionment is an approach to apportionment that is based on mathematical optimization.
In a problem of apportionment, there is a resource to allocate, denoted by . For example, it can be an integer representing the number of seats in a house of representatives. The resource should be allocated between some agents. For example, these can be federal states or political parties. The agents have different entitlements, denoted by a vector of fractions with a sum of 1. For example, ti can be the fraction of votes won by party i. The goal is to find allocation - a vector with .
The ideal share for agent i is his/her quota, defined as . If it is possible to give each agent his/her quota, then the allocation is maximally fair. However, exact fairness is usually unattainable, since the quotas are not integers and the allocations must be integers. There are various approaches to cope with this difficulty (see mathematics of apportionment). The optimization-based approach aims to attain, for eacn instance, an allocation that is "as fair as possible" for this instance. An allocation is "fair" if for all agents i, that is, each agent's allocation is exactly proportional to his/her entitlement. in this case, we say that the "unfairness" of the allocation is 0. If this equality must be violated, one can define a measure of "total unfairness", and try to minimize it.
Minimizing the sum of unfairness levels
The most natural measure is the sum of unfairness levels for individual agents, as in the utilitarian rule:
One can minimize the sum of differences , or the sum of squares . Both minimization problems are solved by Hamilton's method.
One can weight the elements in the sum by the population, or equivalently by the quota, and try to minimize . This leads to Webster's method.
One can minimize the sum of differences of ratios , or the sum of squares . These objectives yield two different methods.
One can weight the elements in the sum by the allocations, |
https://en.wikipedia.org/wiki/Oxygen%20cascade | In respiratory physiology, the oxygen cascade describes the flow of oxygen from air to mitochondria, where it is consumed in aerobic respiration to release energy. Oxygen flows from areas with high partial pressure of oxygen (PO2, also known as oxygen tension) to areas of lower PO2.
Air is typically around 21% oxygen, and at sea level, the PO2 of air is typically around 159 mmHg. Humidity dilutes the concentration of oxygen in air. As air is inhaled into the lungs, it mixes with water and exhaust gasses including CO2, further diluting the oxygen concentration and lowering the PO2. As oxygen continues to flow down the concentration gradient from areas of higher concentration to areas of lower concentration, it must pass through barriers such as the alveoli walls, capillary walls, capillary blood plasma, red blood cell membrane, interstitial space, other cell membranes, and cell cytoplasm. The partial pressure of oxygen drops across each barrier.
Table
Table 1 gives the example of a typical oxygen cascade for skeletal muscle of a healthy, adult male at rest who is breathing air at atmospheric pressure at sea level. Actual values in a person may vary widely due to ambient conditions, health status, tissue type, and metabolic demands.
See also
Alveolar–arterial gradient
Alveolar gas equation
Blood gas tension
References
Respiratory physiology
Cell biology |
https://en.wikipedia.org/wiki/Js13kGames | js13kGames (also referenced as JS13K) is a game jam competition, focused on creating browser games that are no larger than 13 kilobytes when compressed using ZIP.
Participants are not permitted to use external services or libraries, and all assets must also fit within the size limit.
Games are programmed in JavaScript and HTML5.
The competition has a different theme each year and participants have the freedom to interpret it however they like.
Winners receive prizes consisting of money, digital rewards, T-shirts, and promotional items.
History
JS13K was founded in 2012 and is run by Andrzej Mazur.
It is held from 13 August to 13 September annually.
Since 2017 there are categories that allow for certain frameworks to not count towards the size limit.
JS13k introduced a web monetization category in 2019 in partnership with Coil, which continued through 2020 funded partially by Grant for the Web.
Several well known game designers have participated in JS13K including Markus "Notch" Persson (creator of Minecraft) and Ricardo "Mrdoob" Cabello (creator of Three.js).
Some games created for the competition have later been released commercially on Steam including 2016 winner Evil Glitch. Others have been mentioned across the internet in various articles around the event itself.
In 2015, JS13K started to expand, including a panel of judges for each of their events. There are a few judges that have been featured in every single event, including Dann Sullivan of Pocket Gamer, Game Developer Christer Kaitilla, and Games Journalist Jupiter Hadley.
Results
References
External links
Game jams
Programming contests
Video game development competitions
Recurring events established in 2012 |
https://en.wikipedia.org/wiki/HyCOM | The Hybrid Coordinate Ocean Model (HyCOM) is an open-source ocean general circulation modeling system. HyCOM is a primitive equation type of ocean general circulation model. The vertical levels of this modeling system are slightly different than other models, because the vertical coordinates remain isopycnic in the open stratified ocean, smoothly transitioning to z-level coordinates in the weakly stratified upper-ocean mixed layer, to terrain-following sigma coordinates in shallow water regions, and back to z-level coordinates in very shallow water. Therefore, the setup is a “hybrid” between z-level and terrain-following vertical levels. HyCOM outputs are provided online for the global ocean at a spatial resolution of 0.08 degrees (approximately 9 km) from 2003 to present. HyCOM uses netCDF data format for model outputs.
Applications
HyCOM model experiments are used to study the interactions between the ocean and atmosphere, including short-term and long-term processes. This modeling system has also been used to create forecasting tools. For example, HyCOM has been used to:
Assimilate data and provide operational oceanographic forecasting for the United States Navy
Determine the ideal way to parametrize how the sun heats the upper ocean (solar radiation and heat flux) in darker waters like the Black Sea
Study mesoscale variability in sea surface height and temperature in the Gulf of Mexico
Simulate drifting patterns of loggerhead sea turtles of the North American east coast
Predict the extent of Arctic sea ice for naval operations
See also
Climate model
Computational geophysics
General circulation model (GCM)
Ocean general circulation model (OGCM)
Oceanography
List of ocean circulation models
Physical oceanography
ROMS
Sigma coordinate system
References
External links
https://www.hycom.org/
Physical oceanography
Oceanography
Earth system sciences
Computational science
Geophysics
Numerical climate and weather models |
https://en.wikipedia.org/wiki/Machine%20learning%20in%20earth%20sciences | Applications of machine learning in earth sciences include geological mapping, gas leakage detection and geological features identification. Machine learning (ML) is a type of artificial intelligence (AI) that enables computer systems to classify, cluster, identify and analyze vast and complex sets of data while eliminating the need for explicit instructions and programming. Earth science is the study of the origin, evolution, and future of the planet Earth. The Earth system can be subdivided into four major components including the solid earth, atmosphere, hydrosphere and biosphere.
A variety of algorithms may be applied depending on the nature of the earth science exploration. Some algorithms may perform significantly better than others for particular objectives. For example, convolutional neural networks (CNN) are good at interpreting images, artificial neural networks (ANN) perform well in soil classification but more computationally expensive to train than support-vector machine (SVM) learning. The application of machine learning has been popular in recent decades, as the development of other technologies such as unmanned aerial vehicles (UAVs), ultra-high resolution remote sensing technology and high-performance computing units lead to the availability of large high-quality datasets and more advanced algorithms.
Significance
Complexity of earth science
Problems in earth science are often complex. It is difficult to apply well-known and described mathematical models to the natural environment, therefore machine learning is commonly a better alternative for such non-linear problems. Ecological data are commonly non-linear and consist of higher-order interactions, and together with missing data, traditional statistics may underperform as unrealistic assumptions such as linearity are applied to the model. A number of researchers found that machine learning outperforms traditional statistical models in earth science, such as in characterizing forest canopy stru |
https://en.wikipedia.org/wiki/Zenith%20Eazy%20PC | The Eazy PC (stylized as eaZy pc) is an all-in-one IBM PC compatible computer manufactured by Zenith Data Systems (ZDS) starting in 1987. This small-form-factor XT-compatible system has some distinctive features, such as using an NEC V40 CPU. The Eazy PC was designed to be a simple, cost-effective computer for the home. This was a departure for ZDS, who had historically avoided the retail consumer market to focus on customers such as businesses, universities, and government agencies.
Specifications
Construction and components
The Eazy PC is an all-in-one system: the CRT monitor and its tilt/swivel base are permanently attached to the base unit and cannot be upgraded. The monitor also houses the computer's power supply. The screen measures diagonally. It generates only a gray scale display, using a warm white phosphor. The graphics chip supports CGA video with a maximum resolution of 640 by 200 pixels which is double-scanned to 400 vertical pixel resolution, providing crisp characters in text mode.
The lower case holding the mainboard measures in width, depth, and height respectively. The single or dual 3.5-inch floppy drives are accessed from the computer's right side. The included detached keyboard plugs into a 5-pin DIN connector on the left side.
On the rear of the system unit are a DE-09M port for a serial mouse, a DB-25F parallel port, and a proprietary "option" port that is a 64-pin two row pin header for external modules. The mouse port is a serial port with functions unnecessary for mouse operation disabled.
The CPU in the Eazy PC is an NEC V40 microprocessor running at a clock speed of 7.16 MHz, but able to be slowed to the 4.77 MHz speed of a standard XT. Like the NEC V20, the V40 is object-code compatible with the Intel 8088, but the V40 includes some integrated peripherals that would otherwise require additional circuitry on the mainboard. Base system memory is 512 KB of RAM. The BIOS used was both designed and supplied by Vadem.
The mainboard |
https://en.wikipedia.org/wiki/Forbes%20Log | The Forbes Log is an instrument for measuring the speed and distance traveled by ships, notably those of the Royal Navy. They were introduced commercially by Elliott Brothers in 1909 and were fitted to all capital ships by 1912, generally to aid the use of the dumaresq as well as battle reporting.
History
Elliott Brothers licensed the concept and began production in 1909. It was a standard fit to all capital ships by 1912. The company also licensed the device to Anschütz in 1911, in exchange for a license of Anschütz's gyrocompass technology. The Anschütz compass proved less accurate and less reliable than models introduced in 1913 by Sperry Gyroscope, and the Anschütz models produced by Elliot were replaced with Sperrys.
Initial tests of the Forbes Log in 1912 demonstrated it was not entirely accurate, which added to a larger set of problems being encountered by the Navy's new gunlaying instruments. These issues were eventually solved, and the Forbes Log remained a standard solution well into World War II, by which time they were found on almost all British and allied ships, including submarines.
One of the remote outputs of the Forbes Log was placed in the gunnery control rooms where they were initially used to set the dumaresq and range clocks by their respective operators; in the post World War I-era, the system was often automated, eliminating the need for an operator to do this.
Description
The measuring system of the Forbes Log consists of an L-shaped tube that projects through the hull with the bottom portion of the L facing forward. The ship's forward motion forces water into the tube where it spins a propeller and then exits through a second pipe facing aft. The propeller is connected to a small generator, whose electrical signal is then sent to the Log itself. This consists of a voltmeter pointer indicating the instantaneous speed, and an odometer-like system recording elapsed distance.
The advantage to the Forbes Log is that the signal can be amplif |
https://en.wikipedia.org/wiki/Vaccine%20passports%20during%20the%20COVID-19%20pandemic | A vaccine passport or proof of vaccination is an immunity passport employed as a credential in countries and jurisdictions as part of efforts to control the COVID-19 pandemic via vaccination. A vaccine passport is typically issued by a government or health authority, and usually consists of a digital or printed record. Some credentials may include a scannable QR code, which can also be provisioned via mobile app. It may or may not use a COVID-19 vaccine card as a basis of authentication.
The use of vaccine passports is based on the general presumption that a vaccinated individual would be less likely to transmit SARS-CoV-2 to others, and less likely to experience a severe outcome (hospitalization or death) if they were to be infected, thus making it relatively safer for them to congregate. A vaccine passport is typically coordinated with policies enforced by individual businesses, or enforceable public health orders, that require patrons to present proof of vaccination for COVID-19 as a condition of entry or service.
Government-mandated use of vaccine passports typically applies to discretionary public spaces and events (such as indoor restaurants, bars, or large-scale in-person events, such as concerts and sports), and not essential businesses, such as retail stores or health care. In France, Italy, Ireland, and Canada, vaccine uptake increased after various levels of governments announced plans to introduce vaccine passports. An intention by some jurisdictions is to prevent future lockdowns and restrictions.
Vaccine passports are controversial and have raised scientific, ethical and legal concerns. Critics have also argued that vaccine passports violate civil liberties via coercion. In the United States, there is no vaccine passport at a federal level, and some US states have preemptively banned vaccine passports in certain public and private sector contexts, citing discrimination and privacy concerns. England initially decided against mandating vaccine passpo |
https://en.wikipedia.org/wiki/Selectivity%20%28circuit%20breakers%29 | Selectivity, also known as circuit breaker discrimination, is the coordination of overcurrent protection devices so that a fault in the installation is cleared by the protection device located immediately upstream of the fault. The purpose of selectivity is to minimize the impact of a failure on the network. Faults in an installation are, for example, overload and short circuit.
There are four ways in which selectivity is achieved:
Current selectivity: different breaking capacities
Time selectivity: time delay before tripping of a breaker
Energy based selectivity: analysis of the current waves
Zone selective interlocking: communication between the breakers, forwarding a time delay instruction
References
Electrical engineering
Electrical safety |
https://en.wikipedia.org/wiki/Let%27s%20Count%20Goats%21 | Let's Count Goats! is a 2010 children's picture book by Mem Fox and illustrated by Jan Thomas. It is a counting book with the narrator inviting the reader to count goats that appear in the pictures as they engage in humanlike behaviour.
Reception
In a review of Let's Count Goats!, School Library Journal wrote "Fox and Thomas draw viewers in through catchy phrases and amusing pictures of goats that appear in a variety of shapes, sizes, and numbers", and called it "a clever counting lesson".
Let's Count Goats! has also been reviewed by Kirkus Reviews, Publishers Weekly, Booklist, Horn Book Guides, and Magpies.
References
External links
Library holdings of Let's Count Goats!
Australian picture books
2010 children's books
Picture books by Mem Fox
Mathematics fiction books
Children's books about goats |
https://en.wikipedia.org/wiki/Rathjen%27s%20psi%20function | In mathematics, Rathjen's psi function is an ordinal collapsing function developed by Michael Rathjen. It collapses weakly Mahlo cardinals to generate large countable ordinals. A weakly Mahlo cardinal is a cardinal such that the set of regular cardinals below is closed under (i.e. all normal functions closed in are closed under some regular ordinal ). Rathjen uses this to diagonalise over the weakly inaccessible hierarchy.
It admits an associated ordinal notation whose limit (i.e. ordinal type) is , which is strictly greater than both and the limit of countable ordinals expressed by Rathjen's . , which is called the "Small Rathjen ordinal" is the proof-theoretic ordinal of , Kripke–Platek set theory augmented by the axiom schema "for any -formula satisfying , there exists an addmissible set satisfying ". It is equal to in Rathjen's function.
Definition
Restrict and to uncountable regular cardinals ; for a function let denote the domain of ; let denote , and let denote the enumeration of . Lastly, an ordinal is said to be to be strongly critical if .
For and :
If for some , define using the unique . Otherwise if for some , then define using the unique , where is a set of strongly critical ordinals explicitly defined in the original source.
For :
Explanation
Restrict to uncountable regular cardinals.
is a unique increasing function such that the range of is exactly .
is the closure of , i.e. , where denotes the class of non-zero limit ordinals.
Rathjen originally defined the function in more complicated a way in order to create an ordinal notation associated to it. Therefore, it is not certain whether the simplified OCF above yields an ordinal notation or not. The original functions used in Rathjen's original OCF are also not so easy to understand, and differ from the functions defined above.
Rathjen's and the simplification provided above are not the same OCF. This is partially because the former is k |
https://en.wikipedia.org/wiki/Virosphere | Virosphere (virus diversity, virus world, global virosphere) was coined to refer to all those places in which viruses are found or which are affected by viruses. However, more recently virosphere has also been used to refer to the pool of viruses that occurs in all hosts and all environments, as well as viruses associated with specific types of hosts (prokaryotic virosphere, archaeal virosphere, Invertebrate virosphere), type of genome (RNA virosphere, dsDNA virosphere) or ecological niche (marine virosphere).
Viral genome diversity
The scope of viral genome diversity is enormous compared to cellular life. Cellular life including all known organisms have double stranded DNA genome. Whereas viruses have one of at least 7 different types of genetic information, namely dsDNA, ssDNA, dsRNA, ssRNA+, ssRNA-, ssRNA-RT, dsDNA-RT. Each type of genetic information has its specific manner of mRNA synthesis. Baltimore classification is a system providing overview on these mechanisms for each type of genome. Moreover, in contrast to cellular organisms, viruses don't have universally conserved sequences in their genomes to be compared by.
Viral genome size varies approximately 1000 fold. Smallest viruses may consist of only from 1–2 kb genome coding for 1 or 2 genes and it is enough for them to successfully evolve and travel through space and time by infecting and replicating (make copies of their own) in its host. Two most basic viral genes are replicase gene and capsid protein gene, as soon as virus has them it represents a biological entity able to evolve and reproduce in cellular life forms. Some viruses may have only replicase gene and use capsid gene of other e.g. endogenous virus. Most viral genomes are 10-100kb, whereas bacteriophages tend to have larger genomes carrying parts of genome translation machinery genes from their host. In contrast, RNA viruses have smaller genomes, with maximum 35kb by coronavirus. RNA genomes have higher mutation rate, that is why thei |
https://en.wikipedia.org/wiki/Jean-Joseph%20Kapeller | Jean-Joseph Kapeller (24 July 1706 – 29 November 1790) was a French painter, architect and geometer. Born in Marseille he was influenced by Jean-Baptiste de La Rose and Joseph Vernet, mainly producing landscapes and seascapes such as his 1756 masterwork Embarcation of the Expeditionary Corps for Minorca at the Port of Marseille under the command of the Duke of Richelieu. He and his contemporary Charles François Lacroix de Marseille produced seascapes which marked a step-change in the appreciation of seascapes in Provence in the second half of the 18th century.
Kapeller and Michel-François Dandré-Bardon co-founded Marseille's Académie de peinture et de sculpture, with Kapeller becoming its director-rector in 1771 and giving classes in drawing and gemotery there which were attended by his main pupil Henry d'Arles. Kapeller was also a major figure in freemasonry in the city, becoming grand master of the Chevaliers de l'Orient lodge. He also became rector of the third order Franciscans at the Récollets in 1745 and a member of a chapel of penitents. Famous in Marseille in his own time, he seems to have never become much known outside Provence and most of his works are now lost, though some now hang in public collections in Toulon and Marseille.
Life
Early life
His father Jean-Georges had been born in Meilen, Zurich and married Marie-Anne Daignan in Marseille on 11 January 1701, the year before Jean-Joseph's birth. Jean-Georges was also a painter and seems to have been highly regarded by contemporary art critics, who referred to "the ardour of his zeal for everything which concerned the school, artists and matters of art". Jean-Georges died before 1723, possibly during the bout of plague which affected Marseille in 1723, according to Joseph Billioud.
Jean-Joseph Kapeller married Anne-Marie Mouren on 24 January 1723 in the collegiate church of Saint-Martin. The couple had two children, Marie-Eugénie (called "widow Mullard" in Jean-Joseph's will of 1778) and Pierre-Paul |
https://en.wikipedia.org/wiki/Doris%20Davis%20Centini | Doris Davis Centini (October 7, 1931 – May 13, 2001) was a food scientist and home economist who led Stouffer's Food's home economics department. She served as manager of research and development at Stouffer's during development of the Stouffer's portions of the Apollo 11 space crew's meals eaten in quarantine on their return from space. She applied her home economics background in helping to develop Stouffer’s freeze-dried method. One of her aides in that department was food scientist Julie Stewart.
Centini was born Doris Nelle Davis on October 7, 1931, in Blountsville, Alabama.
Centini graduated from the Women's College of the University of North Carolina in 1953.
References
See also
Sara Thompson (food scientist)
Julie Stewart (food scientist)
Food scientists
Women food scientists
American food scientists
University of North Carolina at Greensboro alumni
1931 births
2001 deaths |
https://en.wikipedia.org/wiki/Julie%20Stewart%20%28food%20scientist%29 | Julie Stewart was a food scientist. She began working at Stouffer's Food's in 1957, first starting in the shipping department and then moving into food development. She was an aide to Doris Davis Centini at Stouffer's Food's during development of the Stouffer's portions of the Apollo 11 space crew's meals eaten in quarantine on their return from space in 1969. Her responsibilities included designing recipes, and NASA selected one of her recipes, Salisbury Stroganoff, for inclusion in the Apollo 11 crew's menu.
References
See also
Sara Thompson (food scientist)
Doris Davis Centini
Year of birth missing
Possibly living people
Food scientists
Women food scientists
American food scientists
20th-century African-American scientists |
https://en.wikipedia.org/wiki/Sara%20Thompson%20%28food%20scientist%29 | Sara Thompson was a food scientist. She was the quality control supervisor at Stouffer's Food's and worked with Doris Davis Centini during development of the Stouffer's portions of the Apollo 11 space crew's meals eaten in quarantine on their return from space.
References
See also
Doris Davis Centini
Julie Stewart (food scientist)
Food scientists
Women food scientists
American food scientists
Year of birth missing
Year of death missing |
https://en.wikipedia.org/wiki/Lenglart%27s%20inequality | In the mathematical theory of probability, Lenglart's inequality was proved by Èrik Lenglart in 1977. Later slight modifications are also called Lenglart's inequality.
Statement
Let be a non-negative right-continuous -adapted process and let be a non-negative right-continuous non-decreasing predictable process such that for any bounded stopping time . Then
References
Citations
General sources
Stochastic differential equations
Articles containing proofs
Probabilistic inequalities |
https://en.wikipedia.org/wiki/Balanced%20lethal%20systems | In evolutionary biology, a balanced lethal system is a situation where recessive lethal alleles are present on two homologous chromosomes. Each of the chromosomes in such a pair carries a different lethal allele, which is compensated for by the functioning allele on the other chromosome. Since both these lethal alleles end up in the gametes in the same frequency as the functioning alleles, half of the offspring, the homozygotes, receive two copies of a lethal allele and therefore die during development. In such systems, only the heterozygotes survive.
Balanced lethal systems appear to pose a challenge to evolutionary theory, since a system so wasteful should be rapidly eliminated through natural selection and recombination. Instead, it has become fixed in various species all over the tree of life.
Mechanism
The exact mechanism behind balanced lethal systems remains unknown. Prior to the availability of efficient DNA sequencing methods, it was already known that the lethality in such a system was caused by homozygosity of a certain chromosome pair.
One theory is that, in the case of the Triturus genus, the balanced lethal system is a remnant of an ancient sex-determination system. One of the chromosomes of the pair that contains the system is longer than the other, which is also the case for the actual sex chromosomes. In this theory, deleterious mutations accumulated on the non-recombining part of the Y-chromosome (Muller’s ratchet). Then, two distinct Y-chromosomes, both with different lethal mutations, co-segregated in a population. Since sex-determination in many cold-blooded vertebrates is potentially dependent on temperature, a shift away from chromosomal sex determination occurred. This system favoured the sex reversal of females, which eventually led to the loss of the original X-chromosome. A mutation on another chromosome later restored the even sex ratio, and gave rise to a new male-heterogametic system. A major restriction for this theory is that it c |
https://en.wikipedia.org/wiki/Stochastic%20Gronwall%20inequality | Stochastic Gronwall inequality is a generalization of Gronwall's inequality and has been used for proving the well-posedness of path-dependent stochastic differential equations with local monotonicity and coercivity assumption with respect to supremum norm.
Statement
Let be a non-negative right-continuous -adapted process. Assume that is a deterministic non-decreasing càdlàg function with and let
be a non-decreasing and càdlàg adapted process starting from . Further, let be an - local martingale with and càdlàg paths.
Assume that for all ,
where .
and define . Then the following estimates hold for and :
If and is predictable, then ;
If and has no negative jumps, then ;
If then ;
Proof
It has been proven by Lenglart's inequality.
References
Stochastic differential equations
Articles containing proofs
Probabilistic inequalities |
https://en.wikipedia.org/wiki/Raytheon%20704 | The Raytheon 704 is a 16-bit minicomputer introduced by Raytheon in 1970. The basic machine contained 4 kwords (8 kB) of memory and a simple arithmetic logic unit (ALU) running at 1 MHz. It was normally operated with a Teletype Model 33 acting as a computer terminal. It sold for "less than $10,000" ().
A key feature of the design was the ability to expand the central processing unit (CPU) using plug-in cards. Options included a hardware multiply/divide unit, an 8-level vectored interrupt controller, a DMA controller, among others. Memory could also be added using the same cards, allowing up to 32 kW in total. Memory was based on an 18-bit word, not 16-bit, with the extra bits for use with an optional parity check card.
Another unique feature was that general input/output expansion was external, using a daisy chained cable system known as DIO. This allowed devices like lab equipment and low-speed storage like tape drives to be added without requiring an internal card to support it; the device was added simply by connecting it to the nearest free DIO port on the computer or any other DIO device.
The 704 does not appear to have seen widespread use, although passing mentions can be found in many documents and it had a presence in scientific circles. One example is displaying weather radar data for the United States Air Force. It is historically notable as the first computer to be used to run play-by-mail games, when Flying Buffalo Inc purchased one in 1970.
History
When it was launched, the 704 was a competitive machine compared to recently-released systems. The PDP-8/I, of 1968, cost $12,800 for a similar 4 kWord machine, but used smaller 12-bit words and thus had 6 kB of memory compared to the 704's 16-bit words where the same 4 kWord memory was 8 kB. The 704 was also faster, running at 1 MHz rather than the PDP-8's 600 kHz. Another machine aimed more squarely at the 704's instrumentation market was the HP 2116A, another 16-bit design that listed at $22,000.
In s |
https://en.wikipedia.org/wiki/Nest%20protection%20hypothesis | The nest protection hypothesis (NPH) is one of multiple hypotheses that seek to explain the behaviour of birds repeatedly introducing green, often aromatic, plant material into the nest after its completion and throughout the incubation and nestling periods. The hypothesis suggests that this behaviour is an evolutionary strategy to ward off or kill ectoparasites that would otherwise cause higher nestling mortality through blood loss and the spread of pathogens. The aromatic species of greenery are often collected from trees and long-living shrubs containing strong aromatic compounds which are expected to either disrupt olfaction in host seeking parasites or kill harmful parasites and pathogens.
In more recent reviews on NPH, the name of the hypothesis has been critiqued for its inaccuracy, suggesting chick-protection hypothesis as a more suitable alternative, since protection is being conveyed, not to the nest, but to the chicks instead.
Supporting evidence
Species that reuse their nest annually are expected to benefit more from using ectoparasite-repellent greenery by warding off overwintering larvae which pose a greater threat to nestlings in spring. This was proven in a study performed on a variety of North American and European Falconiformes which found that species that made use of greenery were more often species that reuse their nests.
A subsequent study analysed the effectiveness of different plant species, found in and around European starling nests, at inhibiting bacterial growth in a nutrient medium and found that the plant species preferred by starlings were those with high bacterial inhibitory effectiveness. Furthermore, the behaviour was typically seen more in cavity nesters than in open-cup nesters which are expected to benefit more from sterilising their nest. This study, while providing evidence for NPH, stresses the use of greenery as a fumigant instead of an olfactory disruptor.
Another study on blue tits found that the collection of greenery |
https://en.wikipedia.org/wiki/Ecological%20evolutionary%20developmental%20biology | Ecological evolutionary developmental biology (eco-evo-devo) is a field of biology combining ecology, developmental biology and evolutionary biology to examine their relationship. The concept is closely tied to multiple biological mechanisms. The effects of eco-evo-devo can be a result of developmental plasticity, the result of symbiotic relationships or epigenetically inherited. The overlap between developmental plasticity and symbioses rooted in evolutionary concepts defines ecological evolutionary developmental biology. Host- microorganisms interactions during development characterize symbiotic relationships, whilst the spectrum of phenotypes rooted in canalization with response to environmental cues highlights plasticity. Developmental plasticity that is controlled by environmental temperature may put certain species at risk as a result of climate change.
Phenotypic plasticity
Phenotypic or developmental plasticity is the alteration of development through environmental factors. These factors can induce multiple types of variants. An example of discrete variants are the seasonal polyphenisms Bicyclus butterflies. The temperature during the pupa stage determines the phenotype in the adult stage of the butterfly.
A form of meristic variation is the number of segments in Strigamia maritima centipedes. These animals live along the Northern coast of the United Kingdom. The number of leg-bearing segments in these centipedes was lower than in southern populations. Once again, this is a result of differences in temperature. In both these examples, the temperature altered the ontogeny of the organisms.
Epigenetic inheritance
Epigenetic inheritance is the inheritance of epigenetic marks on the DNA induced by environmental factors. These marks alter gene expression patterns, which can be transmitted to the next generation. This means that environmental cues can influence the development of the organism’s offspring. This is similar to the evolution theory of Lamarck. He |
https://en.wikipedia.org/wiki/The%20Apportionment%20of%20Human%20Diversity | "The Apportionment of Human Diversity" is a 1972 paper on racial categorisation by American evolutionary biologist Richard Lewontin. In it, Lewontin presented an analysis of genetic diversity amongst people from different conventionally-defined races. His main finding, that there is more genetic variation within these populations than between them, is considered a landmark in the study of human genetic variation and contributed to the abandonment of race as a scientific concept.
Background
By the 1960s, anthropologists such as Frank B. Livingstone had concluded that "there are no races, there are only clines" – smooth gradients of genetic variation in a species across its geographic range. Lewontin's mentor Theodosius Dobzhansky challenged this, arguing that there are human discrete populations that can be distinguished by differences in the frequency of genetic traits, which he called races. At that time the debate was largely semantic, stemming from their different ideas about what race is and how it would be manifested in humans genetics. The evidence that was available to Livingstone and Dobzhansky was mostly limited to qualitative observations of phenotypes thought to express genetic variation (e.g. skin colour). This changed over the course of the 1960s, as new techniques began to produce direct evidence for genetic variation in humans at a molecular level. By 1972, when Dobzhansky invited Lewontin to contribute to his edited volume of Evolutionary Biology, Lewontin felt that there was sufficient data to look at the problem anew, from a "firm quantitative basis":
Lewontin had been interested in using quantitative methods to assess taxonomic categories for some time before 1972. Over a decade earlier, palaeontologist George Gaylord Simpson had invited him to co-author a second edition of his textbook Quantitative Zoology (1960), and Lewontin added a chapter on the analysis of variance. In it, he illustrated how this approach could be used distinguish geograp |
https://en.wikipedia.org/wiki/Microsoft%20Entra%20ID | Microsoft Entra ID (formerly Microsoft Azure Active Directory or Azure AD) is a cloud-based identity and access management (IAM) solution. It is a directory and identity management service that operates in the cloud and offers authentication and authorization services to various Microsoft services like Microsoft 365, Dynamics 365, Azure, and cloud-based applications. Entra ID provides users with single sign-on experience, regardless of whether their applications are cloud-based or on-premises.
Entra ID offers many authentication methods, including password-based, multi-factor, smart card, and certificate-based authentication. It also includes several security features, such as Conditional Access policies, risk-based authentication, and identity protection.
On July 11, 2023, Microsoft announced the renaming of Azure AD to Microsoft Entra ID to improve consistency with other Microsoft cloud products. This decision received a largely negative response from the security community. The name change took place on July 15, 2023.
Service Limits and Restrictions
See also
Azure AD Connect
Active Directory
References
Further reading
External links
Active Directory
Directory services
Microsoft cloud services |
https://en.wikipedia.org/wiki/List%20of%20Annual%20Scientific%20Meetings%20of%20the%20Human%20Genetics%20Society%20of%20Australasia |
References
Genetics
Genetics organizations
Organizations established in 1977 |
https://en.wikipedia.org/wiki/Fiber%20photometry | Fiber photometry is a calcium imaging technique that captures 'bulk' or population-level calcium (Ca2+) activity from specific cell-types within a brain region or functional network in order to study neural circuits Population-level calcium activity can be correlated with behavioral tasks, such as spatial learning, memory recall and goal-directed behaviors. The technique involves the surgical implantation of fiber optics into the brains of living animals. The benefits to researchers are that optical fibers are simpler to implant, less invasive and less expensive than other calcium methods, and there is less weight and stress on the animal, as compared to miniscopes. It also allows for imaging of multiple interacting brain regions and integration with other neuroscience techniques. The limitations of fiber photometry are low cellular and spatial resolution, and the fact that animals must be securely tethered to a rigid fiber bundle, which may impact the naturalistic behavior of smaller mammals such as mice.
Technical description
Fiber photometry relies on the expression of genetically encoded calcium indicators (GECIs), like GCaMP or RCaMP, which can be targeted to specific cells using cell-specific promoters like Ca2+/calmodulin-dependent protein kinase II (CaMKII) and human synapsin (hSyn) that confer excitatory neuronal and pan-neuronal expression, respectively. These promoters can be used to target various neuronal subtypes as well as non-neuronal cells that exhibit calcium dynamics, such as astrocytes, using the glial fibrillary acidic protein (GFAP) promoter. In both neurons and astrocytes, cellular activity in the form of action potentials, exocytosis of neurotransmitters, changes in synaptic plasticity and gene transcription is coupled to an influx of Ca2+ ions.
These activity-dependent changes in intracellular calcium levels can be monitored by introducing GECIs to the cell. Following this influx of ions, GECIs fluoresce upon Ca2+ binding and the change in |
https://en.wikipedia.org/wiki/List%20of%20HGSA%20Orations | The HGSA Oration was established in 1990 in order to honour a pre-eminent member of the Human Genetics Society of Australasia (HGSA). It is a lecture given by a senior member of the HGSA who has contributed significantly to the profession over many years. The oration is given annually at the Annual Scientific Meeting of the HGSA.
References
Genetics
Genetics organizations
Organizations established in 1977 |
https://en.wikipedia.org/wiki/Jake%20Elwes | Jake Elwes is a British media artist. Their practice is the exploration of artificial intelligence (AI), queer theory and technical biases. They are known for using AI to create art in mediums such as video, performance and installation. Their work on queering technology addresses issues caused by the normative biases of artificial intelligence.
Education and early life
Elwes (pronounced "El-wez") was born in London to Anneke and Luke Elwes a British contemporary artist and painter.
They studied at the Slade School of Fine Art from 2013 to 2017, where they began using computer code as a medium.
In 2016 they attended the School of Machines, Making & Make-Believe in Berlin with artist and educator Gene Kogan.
Elwes was introduced to drag performance by Dr Joe Parslow who holds a Phd in drag performance; drag performance has since become instrumental to Elwes' work.
Career
Elwes' work with artificial intelligence is cited as a hopeful strategy to make AI more playful and diverse. They were a 2021 finalist for the Lumen Prize, and received the Honorary Mention of the 2022 Prix Ars Electronica in the Interactive Art + category. They have exhibited in museums and galleries in Europe and Asia including Gazelli Art House, Arebyte gallery, ZKM, the Onassis Foundation, Zabludowicz Foundation, AIIIII Art Center, Today Art Museum, and the Victoria and Albert Museum.
Installations projecting conversations between two neural networks
Elwes has created works based on the conversations between two neural networks including Closed Loop from 2017 and Auto-Encoded Buddha from 2016. In Auto-Encoded Buddha, a computer struggles with the notion of Buddha's philosophy. This is Elwes' tribute to Nam June Paik's TV Buddha (1974).
The Zizi Project - a deepfake drag cabaret
The Zizi Project is a series of works that explore the interaction of drag and A.I. Currently, Zizi is made up of three projects.
Zizi - Queering the Dataset (2019)
Knowing that facial recognition technology s |
https://en.wikipedia.org/wiki/BB%20Tecnologia%20e%20Servi%C3%A7os | BB Tecnologia e Serviços (BBTS), formerly Cobra Tecnologia, is a Brazilian information technology company that currently belongs to the Banco do Brasil conglomerate.
Background
In 1961, students from the Instituto Tecnológico de Aeronáutica create the first computer project in national territory, which was called “Zezinho”.
Other universities begin to develop their own projects: Unicamp, with support from the Brazilian Navy, launches the "Projeto Cisne Branco". At the University of São Paulo, the Patinho Feio (in English: Ugly Little Duck) is developed. The name was a joke, because if the priority of the Military Government was the “Cisne Branco” (in English: White Swan), the USP project was the ugly duckling of the story. The fact is that the "Patinho Feio" was ready sooner.
Around the same time, the Navy buys six English frigates. The weapon systems of these modern warships were all computer-controlled. Mastering the technology became a matter of national security. The creators of the “Ugly Little Duck” were then hired by the Navy to develop a new computer, named G10.
History
1974-1976: Beginnings
Cobra (in Portuguese: Computadores e Sistemas Brasileiros) was created on July 18, 1974, in Rio de Janeiro, with the goal of developing genuinely national technology. The first computer factory would be the result of the union of the Navy, the BNDS, and the British factory Ferranti. The company's team was initially formed by professionals who came from the PUC-RJ, from USP, and from the SERPRO.
In the beginning, the company manufacturer the Cobra-700 was a licensed version of the Argus-700.
1977-1989: Expansion and success
During late 1970s, more than half of the domestic computer market was already made up of products developed and manufactured in Brazil. Cobra stimulated the creation of several other companies, becoming the cornerstone of the computer sector in the country. In the same year they started importing their products to Argentina and Uruguay.
In |
https://en.wikipedia.org/wiki/List%20of%20presidents%20of%20the%20Human%20Genetics%20Society%20of%20Australasia | This list of presidents of the Human Genetics Society of Australasia (HGSA) includes all presidents since the society's creation in 1977.
Presidents
References
Genetics societies
Human Genetics Society of Australasia
Lists of presidents of organizations
Organizations established in 1977 |
https://en.wikipedia.org/wiki/Grant%20Robert%20Sutherland | Grant Robert Sutherland (born 2 June 1945) is a retired Australian human geneticist and celebrated cytogeneticist. He was the Director, Department of Cytogenetics and Molecular Genetics, Adelaide Women's and Children's Hospital for 27 years (1975-2002), then became the Foundation Research Fellow there until 2007. He is an Emeritus Professor in the Departments of Paediatrics and Genetics at the University of Adelaide.
He developed methods to allow the reliable observation of fragile sites on chromosomes. These studies culminated in the recognition of fragile X syndrome as the most common familial form of intellectual impairment, allowing carriers to be identified and improving prenatal diagnosis. Clinically, his book on genetic counselling for chromosome abnormalities has become the standard work in this area. He is a past President of the Human Genetics Society of Australasia and of the Human Genome Organisation.
Early life and education
Sutherland was born in Bairnsdale, Victoria, on 2 June 1945.
His father had served as a soldier in World War II and qualified for the soldier settlement farm scheme, so when Grant was 12 the family moved to a dairy farm at Numurkah. As a teenager he bred budgerigars, which he credits for starting his interest in genetics.
After completing at Numurkah High School, he left home and moved to Melbourne.
He studied at the University of Melbourne, graduating in 1967 with a BSc major in genetics and a sub-major in zoology.
During vacations he worked at the CSIRO as a technician, in the team that was developing a vaccine for contagious bovine pleuropneumonia.
Still at the University of Melbourne, he went on to graduate with a MSc in 1971. He undertook his doctoral studies at the University of Edinburgh, graduating with a PhD in 1974 and a DSc in 1984, presenting the thesis Studies in human genetics and cytogenetics.
Career
After graduating with his BSc in 1967, Sutherland starting work as a cytogeneticist in the Chromosome Laborato |
https://en.wikipedia.org/wiki/Constrained%20equal%20awards | Constrained equal awards (CEA), also called constrained equal gains, is a division rule for solving bankruptcy problems. According to this rule, each claimant should receive an equal amount, except that no claimant should receive more than his/her claim. In the context of taxation, it is known as leveling tax.
Formal definition
There is a certain amount of money to divide, denoted by (=Estate or Endowment). There are n claimants. Each claimant i has a claim denoted by . Usually, , that is, the estate is insufficient to satisfy all the claims.
The CEA rule says that each claimant i should receive , where r is a constant chosen such that . The rule can also be described algorithmically as follows:
Initially, all agents are active, and all agents get 0.
While there are remaining units of the estate:
The next estate unit is divided equally among all active agents.
Each agent whose total allocation equals its claim becomes inactive.
Examples
Examples with two claimants:
; here . In general, when all claims are at least , each claimant receives exactly .
; here .
Examples with three claimants:
; here .
; here .
; here .
; here .
; here .
Usage
In the Jewish law, if several creditors have claims to the same bankrupt debtor, all of which have the same precedence (e.g. all loans have the same date), then the debtor's assets are divided according to CEA.
Characterizations
The CEA rule has several characterizations. It is the only rule satisfying the following sets of axioms:
Equal treatment of equals, invariance under truncation of claims, and composition up;
Conditional full compensation, and composition down;
Conditional full compensation, and claims-monotonicity.
Dual rule
The constrained equal losses (CEL) rule is the dual of the CEA rule, that is: for each problem , we have .
References
Bankruptcy theory |
https://en.wikipedia.org/wiki/Constrained%20equal%20losses | Constrained equal losses (CEL) is a division rule for solving bankruptcy problems. According to this rule, each claimant should lose an equal amount from his or her claim, except that no claimant should receive a negative amount. In the context of taxation, it is known as poll tax.
Formal definition
There is a certain amount of money to divide, denoted by (=Estate or Endowment). There are n claimants. Each claimant i has a claim denoted by . Usually, , that is, the estate is insufficient to satisfy all the claims.
The CEL rule says that each claimant i should receive , where r is a constant chosen such that . The rule can also be described algorithmically as follows:
Initially, all agents are active, and each agent gets his full claim.
While the total allocation is larger than the estate:
Remove one unit equally from all active agents.
Each agent whose total allocation drops to zero becomes inactive.
Examples
Examples with two claimants:
; here .
; here too.
; here .
Examples with three claimants:
; here .
; here .
; here .
Usage
In the Jewish law, if several bidders participate in an auction and then revoke their bids simultaneously, they have to compensate the seller for the loss. The loss is divided among the bidders according to the CEL rule.
Characterizations
The CEL rule has several characterizations. It is the only rule satisfying the following sets of axioms:
Equal treatment of equals, minimal rights first, and composition down;
Conditional null compensation, and composition up;
Conditional null compensation, and the dual of claims-monotonicity.
Dual rule
The constrained equal awards (CEA) rule is the dual of the CEL rule, that is: for each problem , we have .
References
Bankruptcy theory |
https://en.wikipedia.org/wiki/Proportional%20rule%20%28bankruptcy%29 | The proportional rule is a division rule for solving bankruptcy problems. According to this rule, each claimant should receive an amount proportional to their claim. In the context of taxation, it corresponds to a proportional tax.
Formal definition
There is a certain amount of money to divide, denoted by (=Estate or Endowment). There are n claimants. Each claimant i has a claim denoted by . Usually, , that is, the estate is insufficient to satisfy all the claims.
The proportional rule says that each claimant i should receive , where r is a constant chosen such that . In other words, each agent gets .
Examples
Examples with two claimants:
. That is: if the estate is worth 100 and the claims are 60 and 90, then , so the first claimant gets 40 and the second claimant gets 60.
, and similarly .
Examples with three claimants:
.
.
.
Characterizations
The proportional rule has several characterizations. It is the only rule satisfying the following sets of axioms:
Self-duality and composition-up;
Self-duality and composition-down;
No advantageous transfer;
Resource linearity;
No advantageous merging and no advantageous splitting.
Truncated-proportional rule
There is a variant called truncated-claims proportional rule, in which each claim larger than E is truncated to E, and then the proportional rule is activated. That is, it equals , where . The results are the same for the two-claimant problems above, but for the three-claimant problems we get:
, since all claims are truncated to 100;
, since the claims vector is truncated to (100,200,200).
, since here the claims are not truncated.
Adjusted-proportional rule
The adjusted proportional rule first gives, to each agent i, their minimal right, which is the amount not claimed by the other agents. Formally, . Note that implies .
Then, it revises the claim of agent i to , and the estate to . Note that that .
Finally, it activates the truncated-claims proportional rule, that is, it returns , where |
https://en.wikipedia.org/wiki/Personal%20Information%20Protection%20Law%20of%20the%20People%27s%20Republic%20of%20China | The Personal Information Protection Law of the People's Republic of China (Chinese: 中华人民共和国个人信息保护法; pinyin: Zhōnghuá rénmín gònghéguó gèrén xìnxī bǎohù fǎ) referred to as the Personal Information Protection Law or ("PIPL") protecting personal information rights and interests, standardize personal information handling activities, and promote the rational use of personal information. It also addresses the transfer of personal data outside of China.
The PIPL was adopted on August 20, 2021, and is effective November 1, 2021. It is related to, and builds on top of both China's Cybersecurity Law ("CSL") and China's Data Security Law ("DSL").
A reference English version was published on December 29, 2021.
History
On August 20, 2021, the Standing Committee of the 13th National People's Congress passed the Private Information Protection Law or ("PIPL"). The law, which took effect on November 1, 2021, applies to the activities of handling the personal information of natural persons within the borders of the China.
In comparison to countries in the West, China has developed its privacy laws over time at a slower pace. In recent years, though, China has more actively developed regulations, as the nation is considered a “global cyberforce.” China’s policies differ from Western nations, in that their perception of privacy is different due to historical and cultural reasons.
Provisions
Scope
The PIPL generally covers all organizations operating in China processing personal information.
Long Arm Jurisdiction
Some provisions also include Long Arm Jurisdiction over data collection and processes of organizations outside of China. These apply when:
The purpose is to provide products or services to natural persons inside the borders;
Analyzing or assessing activities of natural persons inside the borders;
Other circumstances provided in laws or administrative regulations.
This presumably applies to offshore or multi-national companies with Chinese customers in China, for |
https://en.wikipedia.org/wiki/Mage%20Knight%20Board%20Game | Mage Knight Board Game is a cooperative board game for 1 to 4 players designed by Vlaada Chvátil and released in November 2011. It is based on the related collectable miniatures game, Mage Knight. It has been rated as one of the top single player board games.
Gameplay
In the Mage Knight Board Game a player controls one of four Mage Knights, exploring the Mage Knight universe and fighting against powerful enemies. Players choose between a number of scenarios to play with each scenario having a particular objective to meet, such as conquering cities, controlling land areas, investigating mysteries, etc.. Players create the gameboard using tiles as described within the scenario documentation.
Each character has a 16 cards deck used for actions and movement. Players start with drawing 5 cards from the deck and as characters level up, more cards are drawn. The map is slowly revealed as players move on the board. Enemies are placed on the map as the board is revealed. The game time is tracked using rounds utilizing a Day/Night mechanic. When a players deck is empty at the start of their turn, the round will end and advance to the next Day/Night cycle. The game continues until a predetermined number of game days have elapsed, at which point the game ends. If the objective has been met, as described within the scenario, the players win. If the objective has not been met, the players lose.
Characters
Arythea: The Blood Cultist
Goldyx: The Winged Green Lizard
Norowas: An Elven Leader
Tovak Wyrmstalker: A Knight
Braevelar: A Druid (Shades of Tezla Expansion)
Wolfhawk A Solitary Warrior (Lost Legion Expansion)
Krang: A trollish chieftain/shaman (Krang Character Expansion)
Expansions and Re-releases
Three distinct expansions released for Mage Knight:
Mage Knight Board Game: The Lost Legion was released in December 2012.
Mage Knight Board Game: Krang Character was released in 2013
Mage Knight Board Game: Shades of Tezla was released in July 2015
Mage Knight B |
https://en.wikipedia.org/wiki/Jordan%E2%80%93P%C3%B3lya%20number | In mathematics, the Jordan–Pólya numbers are the numbers that can be obtained by multiplying together one or more factorials, not required to be distinct from each other. For instance, is a Jordan–Pólya number because Every tree has a number of symmetries that is a Jordan–Pólya number, and every Jordan–Pólya number arises in this way as the order of an automorphism group of a tree. These numbers are named after Camille Jordan and George Pólya, who both wrote about them in the context of symmetries of trees.
These numbers grow more quickly than polynomials but more slowly than exponentials. As well as in the symmetries of trees, they arise as the numbers of transitive orientations of comparability graphs and in the problem of finding factorials that can be represented as products of smaller factorials.
Sequence and growth rate
The sequence of Jordan–Pólya numbers begins:
They form the smallest multiplicatively closed set containing all of the factorials.
The th Jordan–Pólya number grows more quickly than any polynomial of , but more slowly than any exponential function of . More precisely, for every , and every sufficiently large (depending on ), the number of Jordan–Pólya numbers up to obeys the inequalities
Factorials that are products of smaller factorials
Every Jordan–Pólya number , except 2, has the property that its factorial can be written as a product of smaller factorials. This can be done simply by expanding and then replacing in this product by its representation as a product of factorials. It is conjectured, but unproven, that the only numbers whose factorial equals a product of smaller factorials are the Jordan–Pólya numbers (except 2) and the two exceptional numbers 9 and 10, for which and . The only other known representation of a factorial as a product of smaller factorials, not obtained by replacing in the product expansion of , is , but as is itself a Jordan–Pólya number, it also has the representation .
References
Integer sequen |
https://en.wikipedia.org/wiki/Institute%20of%20Evolutionary%20Biology | The Institute of Evolutionary Biology (In Spanish Instituto de Biología Evolutiva IBE (CSIC-UPF) is a joint research center of Pompeu Fabra University (UPF) and the Spanish National Research Council (CSIC) founded in 2008. IBE is the only research center in Catalonia and the rest of Spain that is entirely dedicated to evolutionary biology and natural resources.
The research carried out by IBE focuses on the study of the processes and mechanisms for the generation and maintenance of biodiversity and its conservation. This is one of the most important scientific challenges of the 21st century, as evidenced by new global initiatives to sequence the genomes of all known species and discover the remaining 80 percent of currently unknown species, including the Earth BioGenome Project. To meet this global challenge requires the methods and concepts of evolutionary biology; and in particular, the understanding of the bases of the differences between organisms, both between species and within them, and how these differences produce new functions and interactions, which will determine the basic mechanisms of life and place biodiversity in a robust evolutionary framework. To this end, IBE research uses the new tools available, experimental and computational, to understand the basic functioning of life, discover the mechanisms for generating biological innovations and preserve biodiversity and promote its management in a sustainable way.
In July 2008, Dr. Xavier Bellés was appointed director of the IBE. In February 2017 he was succeeded in office by Dr. Tomàs Marquès-Bonet as director of the center. Since May 2020, the IBE has been headed by Dr. Salvador Carranza.
Academics
The scientific activity of IBE is organized in 5 interrelated research programs:
Animal Biodiversity and Evolution
Comparative and Computational Genomics
Functional Genomics and Evolution
Population Genetics
Complex Systems
Campus
IBE employs more than one hundred and thirty people, distributed |
https://en.wikipedia.org/wiki/Fibbinary%20number | In mathematics, the fibbinary numbers are the numbers whose binary representation does not contain two consecutive ones. That is, they are sums of distinct and non-consecutive powers of two.
Relation to binary and Fibonacci numbers
The fibbinary numbers were given their name by Marc LeBrun, because they combine certain properties of binary numbers and Fibonacci numbers:
The number of fibbinary numbers less than any given power of two is a Fibonacci number. For instance, there are 13 fibbinary numbers less than 32, the numbers 0, 1, 2, 4, 5, 8, 9, 10, 16, 17, 18, 20, and 21.
The condition of having no two consecutive ones, used in binary to define the fibbinary numbers, is the same condition used in the Zeckendorf representation of any number as a sum of non-consecutive Fibonacci numbers.
The th fibbinary number (counting 0 as the 0th number) can be calculated by expressing in its Zeckendorf representation, and re-interpreting the resulting binary sequence as the binary representation of a number. For instance, the Zeckendorf representation of 19 is 101001 (where the 1's mark the positions of the Fibonacci numbers used in the expansion ), the binary sequence 101001, interpreted as a binary number, represents , and the 19th fibbinary number is 41.
The th fibbinary number (again, counting 0 as 0th) is even or odd if and only if the th value in the Fibonacci word is 0 or 1, respectively.
Properties
Because the property of having no two consecutive ones defines a regular language, the binary representations of fibbinary numbers can be recognized by a finite automaton, which means that the fibbinary numbers form a 2-automatic set.
The fibbinary numbers include the Moser–de Bruijn sequence, sums of distinct powers of four. Just as the fibbinary numbers can be formed by reinterpreting Zeckendorff representations as binary, the Moser–de Bruijn sequence can be formed by reinterpreting binary representations as quaternary.
A number is a fibbinary number if and only i |
https://en.wikipedia.org/wiki/Nick%20Mathewson | Nick Mathewson is an American computer scientist and co-founder of The Tor Project. He, along with Roger Dingledine, began working on onion routing shortly after they graduated from Massachusetts Institute of Technology (MIT) in the early 2000s. He is also known by his pseudonym nickm. Mathewson and Dingledine were the focus of increased media attention after the leak of NSA's highly classified documents by Edward Snowden, and the subsequent public disclosure of the operation of XKeyscore, which targeted one of The Tor Project's onion servers along with Mixminion remailer which are both run at MIT.
Education
Mathewson graduated from MIT in 2002, earning a Bachelor of Science degree in Computer Science. He later earned a Master of Engineering in Computer Science and Linguistics from MIT.
Works
The Tor Project
Tor was developed by Mathewson, along with his two colleagues, under a contract from the United States Naval Research Laboratory. Mathewson is also lead developer responsible for the security, design, maintenance of the Tor protocol, along with sending out security patches.
libevent
He is also the primary maintainer for libevent, an event notification library used by some prominent applications like Google Chrome, Transmission and also Tor.
Honors
Mathewson, along with the other two developers of the Tor Project (Roger Dingledine and Paul Syverson), were recognized in 2012, by Foreign Policy magazine as #78 in their list of the top 100 global thinkers of the year.
Selected publications
References
Massachusetts Institute of Technology alumni
American computer scientists
Year of birth missing (living people)
Living people
Tor (anonymity network)
Free software programmers |
https://en.wikipedia.org/wiki/Contested%20garment%20rule | The contested garment (CG) rule, also called concede-and-divide, is a division rule for solving problems of conflicting claims (also called "bankruptcy problems"). The idea is that, if one claimant's claim is less than 100% of the estate to divide, then he effectively concedes the unclaimed estate to the other claimant. Therefore, we first give to each claimant, the amount conceded to him/her by the other claimant. The remaining amount is then divided equally among the two claimants.
The CG rule first appeared in the Mishnah, exemplified by a case of conflict over a garment, hence the name. In the Mishnah, it was described only for two-people problems. But in 1985, Robert Aumann and Michael Maschler have proved that, in every bankruptcy problem, there is a unique division that is consistent with the CG rule for each pair of claimants. They call the rule, that selects this unique division, the CG-consistent rule (it is also called the Talmud rule).
Problem description
There is a divisible resource, denoted by (=Estate or Endowment). There are n people who claim this resource or parts of it; they are called claimants. The amount claimed by each claimant i is denoted by . Usually, , that is, the estate is insufficient to satisfy all the claims. The goal is to allocate to each claimant an amount such that .
Two claimants
With two claimants, the CG rule works in the following way.
Truncate each claim to the estate (since one is not allowed to claim more than the entire estate). That is, set for each claimant i.
Allocate to claimant 1 an amount that is, the amount not claimed by 2.
Allocate to claimant 2 an amount that is, the amount not claimed by 1.
The remainder is ; divide it equally among the claimants.
Summing the amounts given to each claimant, we can write the following formula:For example:
If and , then both claimants get 1/2, that is, .
If and and . then claimant 1 gets 3/4 and claimant 2 gets 1/4, that is, .
These two examples are first |
https://en.wikipedia.org/wiki/Strategic%20bankruptcy%20problem | A strategic bankruptcy problem is a variant of a bankruptcy problem (also called claims problem) in which claimants may act strategically, that is, they may manipulate their claims or their behavior. There are various kinds of strategic bankruptcy problems, differing in the assumptions about the possible ways in which claimants may manipulate.
Definitions
There is a divisible resource, denoted by (=Estate or Endowment). There are n people who claim this resource or parts of it; they are called claimants. The amount claimed by each claimant i is denoted by . Usually, , that is, the estate is insufficient to satisfy all the claims. The goal is to allocate to each claimant an amount such that .
Unit-selection game
O'Neill describes the following game.
The estate is divided to small units (for example, if all claims are integers, then the estate can be divided into E units of size 1).
Each claimant i chooses some units.
Each unit is divided equally among all agents who claim it.
Naturally, the agents would try to choose units such that the overlap between different agents is minimal. This game has a Nash equilibrium. In any Nash equilibrium, there is some integer k such that each unit is claimed by either k or k+1 claimants. When there are two claimants, there is a unique equilibrium payoff vector, and it is identical to the one returned by the contested garment rule.
Rule-proposal games
Chun's game
Chun describes the following game.
Each claimant proposes a division rule.
The proposed rule must satisfy the property of order-preservation (a claimant with a higher claim must have weakly-higher gain and weakly-higher loss).
All proposed rules are applied to the problem; each claimant's claim is replaced with the maximum amount awarded to him by a proposed rule.
The process repeats with the revised claims.
The process converges. Moreover, it has a unique Nash equilibrium, in which the payoffs are equal to the ones prescribed by the constrained equal |
https://en.wikipedia.org/wiki/Frances%20Haugen | Frances Haugen (born 1983 or 1984) is an American product manager, data engineer and scientist, and whistleblower. She disclosed tens of thousands of Facebook's internal documents to the Securities and Exchange Commission and The Wall Street Journal in 2021.
Haugen has also testified before the United States Senate Commerce Committee's Sub-Committee on Consumer Protection, Product Safety, and Data Security, the Parliament of the United Kingdom, and the European Parliament. In 2023, her memoir, The Power of One: How I Found the Strength to Tell the Truth and Why I Blew the Whistle on Facebook, was published by Little, Brown & Company.
Early life and education
Haugen was raised in Iowa City, Iowa, where she attended Horn Elementary and Northwest Junior High School, and graduated from Iowa City West High School in 2002. Her father was a doctor, and her mother became an Episcopalian priest after an academic career.
Haugen studied electrical and computer engineering in the founding class at the Franklin W. Olin College of Engineering and graduated in 2006. She later earned a Master of Business Administration from Harvard Business School in 2011.
Career
In 2006, after graduating from college, Haugen was hired by Google, and worked on Google Ads, Google Book Search, on a class action litigation settlement related to Google's publication of copyrighted book content, as well as on Google+. At Google, Haugen co-authored a patent for a method of adjusting the ranking of search results. During her career at Google, she completed her MBA; her tuition was paid by Google. While at Google, she was a technical co-founder of the desktop dating app Secret Agent Cupid, precursor to the mobile app Hinge.
In 2015, she began work as a data product manager at Yelp to improve search using image recognition, and after a year, moved to Pinterest.
In 2019, Haugen joined Facebook, after a person close to her became radicalized online; she "felt compelled to take an active role in creati |
https://en.wikipedia.org/wiki/T7%20expression%20system | The T7 expression system is used in the field of microbiology to clone recombinant DNA using strains of E. coli. It is the most popular system for expressing recombinant proteins in E. coli.
By 2021, this system had been described in over 220,000 research publications.
Development
The sequencing and annotating of the genome of the T7 bacteriophage took place in the 1980s at the U.S. Department of Energy's Brookhaven National Laboratory, under the senior biophysicist F. William Studier. Soon, the lab was able to clone the T7 RNA polymerase and use it, along with the powerful T7 promoter, to transcribe copious amounts of almost any gene. The development of the T7 expression system has been considered the most successful biotechnology developed at the Brookhaven National Laboratory, being licensed by over 900 companies which has generated over $55 million for the lab.
Mechanism
An expression vector, most commonly the pET expression vector, is engineered to integrate two essential components: a T7 promoter and a gene of interest downstream of the promoter and under its control. The expression vector is transformed into one of several relevant strains of E. coli, most frequently BL21(DE3). The E. coli cell also has its own chromosome, which possesses a gene that is expressed to produce T7 RNA polymerase. (This polymerase originates from the T7 phage, a bacteriophage virus which infects E. coli bacterial cells and is capable of integrating its DNA into the host DNA, as well as overriding its cellular machinery to produce more copies of itself.) T7 RNA polymerase is responsible for beginning transcription at the T7 promoter of the transformed vector. The T7 gene is itself under the control of a lac promoter. Normally, both the lac promoter and the T7 promoter are repressed in the E. coli cell by the Lac repressor. In order to initiate transcription, an inducer must bind to the lac repressor and prevent it from inhibiting the gene expression of the T7 gene. Once this |
https://en.wikipedia.org/wiki/Proof%20of%20identity%20%28blockchain%20consensus%29 | Proof of identity (PoID) is a consensus protocol for permission-less blockchains, in which each uniquely identified individual receives one equal unit of voting power and associated rewards (minting token). The protocol is based on biometric identification, humanity identification parties and additional verification parties.
The proof of identity supersedes the approach of proof of work and proof of stake which distribute voting power and rewards to participants according to their investment in some activity or resource and introduces the opportunity to create a universal basic income (UBI) for individuals.
The proof of identity solves the problem with the proof of personhood in which individuals are requested to attend recurrent pseudonymous parties and creates a network that is permanently secured and censorship resilient.
Background
Currently used proofs of investment
In a permission-less network, some kind of proof is required to prevent Sybil attacks, i.e., the event in which an attacker gains control over the transactions of the network by creating multiple users generated with a malicious script.
The most common methods to prevent Sybil attacks are proofs of investment (proof of work, proof of stake) that require participants of the network to invest in some activity or resource as evidence of genuine involvement in the chain.
The growing criticism over this approach is that voting power and rewards are not distributed equally among individuals but instead, big holders/corporations benefit the most from the network.
Proof of investment blockchains are thus prone to the formation of oligarchies and marginally appeal to small investors/holders who receive minimal rewards. In the case of proof of work, there are additional sustainability concerns over the amount of electrical energy wasted as proof.
The idea of having a "unique identity system" as a consensus protocol for cryptocurrencies, which would give each human user one and only one anti-Sybil pa |
https://en.wikipedia.org/wiki/IBM%20PCradio | The PCradio was a notebook computer released by International Business Machines (IBM) in late 1991. Designed primarily for mobile workers such as service technicians, salespersons and public safety workers, the PCradio featured a ruggedized build with no internal hard disk drive and was optioned with either a cellular or ARDIS RF modem, in addition to a standard landline modem.
Components
The internals of the PCradio were encased in a slate-gray, hardened plastic case, which IBM said was resistant to heat, moisture, impact and certain chemicals. Its port doors, connectors, and keyboard were designed to be water-resistant through the use of gaskets, seals, and O-rings. It featured a monochrome LCD capable of rendering graphics in CGA mode and text at 80 columns by 25 lines. The laptop was powered by either a nickel–cadmium battery or a wall or car power adapter.
To keep the PCradio ruggedized, IBM offered SRAM modules of various capacities up to 2 MB for file storage, in lieu of a mechanical hard disk drive. Special versions of Siega System's One-Button Mail, an e-mail client, Traveling Software's Battery Watch, a battery management application, and LapLink, a file transfer program, were developed with drivers to support the PCradio's special hardware. The latter, renamed to Notebook Manager, came bundled with the PCradio as a ROM module. Owing to its ruggedized nature, the PCradio could operate between 32 degrees and 132 degrees Fahrenheit. A thermal printer which accepted paper 3-1/8 inches in diameter was optional.
The cellular model was capable of sending and receiving faxes, at a rate of 9.6 KB per second—twice that of its cellular data speed of 4.8 KB per second. Meanwhile the landline model was capable of sending but not receiving faxes, and the ARDIS model could not receive faxes whatsoever. The cellular model could also be used for voice communications with the optional handset.
Development
The PCradio project was helmed by Robert A. Lundy, a director an |
https://en.wikipedia.org/wiki/Bacon%E2%80%93Shor%20code | The Bacon–Shor code is a subsystem error correcting code. In a subsystem code, information is encoded in a subsystem of a Hilbert space. Subsystem codes lend to simplified error correcting procedures unlike codes which encode information in the subspace of a Hilbert space. This simplicity led to the first claim of fault tolerant circuit demonstration on a quantum computer. It is named after Dave Bacon and Peter Shor.
Given the stabilizer generators of Shor's code: , 4 stabilizers can be removed from this generator by recognizing gauge symmetries in the code to get: . Error correction is now simplified because 4 stabilizers are needed to measure errors instead of 8. A gauge group can be created from the stabilizer generators:. Given that the Bacon–Shor code is defined on a square lattice where the qubits are placed on the vertices; laying the qubits on a grid in a way that corresponds to the gauge group shows how only 2 qubit nearest-neighbor measurements are needed to infer the error syndromes. The simplicity of deducing the syndromes reduces the overheard for fault tolerant error correction.
ZZ ZZ
q0---q1--q2
XX| XX| |XX
| ZZ| ZZ|
q6--q7--q8
XX| XX| |XX
| | |
q3--q4--q5
ZZ ZZ
See also
Five-qubit error correcting code
References
Quantum computing |
https://en.wikipedia.org/wiki/Microsoft%20Whiteboard | Microsoft Whiteboard is a free multi-platform application, as well as an online service and a feature in Microsoft Teams, which simulates a virtual whiteboard and enables real-time collaboration between users.
Overview and features
Microsoft Whiteboard allows users to draw on a virtual whiteboard using input methods such as a stylus pen or a mouse and keyboard, and write down notes, draw connections between shareable ideas and interact in real time. Microsoft Whiteboard is available to download on the following platforms and devices:
Microsoft Windows (on Windows 10 or above)
Android
Apple iOS
Surface Hub devices
It is also available on the web and as a feature in Microsoft Teams.
Microsoft Whiteboard allows users with Microsoft accounts to view, edit and share whiteboards using the provided tools and options. The feature set includes tools for drawing, shapes and media. Drawing in Microsoft Whiteboard is called inking. It works both on mobile devices and computers. The inking toolbar has customizable pencils, as well as a ruler, a highlighter, an eraser and an object selector. Whiteboard can recognize shapes drawn by hand and straighten them. Holding the Shift key on a computer while inking draws straight lines.
Microsoft Whiteboard has keyboard shortcuts for some functions.
Additional features include inserting sticky notes, text boxes, stickers, as well as images. Grid lines and colors are adjustable. There are different templates, which can be inserted into the whiteboard. Users can also share their reactions. A feature limited to boards created in Microsoft Teams, is the ability to make them read-only; other participants from the meeting cannot edit them.
Reviews
PC Magazine rated Microsoft Whiteboard a 3.5 out of 5, praising the app's free availability and plentiful templates. It compared it to other, paid whiteboarding solutions, and concludes that Microsoft offers the best free one. Some of the cons, described by PCMag, include the inability to |
https://en.wikipedia.org/wiki/Mary%20Klicka | Mary Victoria Richardson Klicka (April 30, 1921 – August 26, 2007) was a Canadian-American registered dietitian and food technologist for the United States Army. She designed MREs and provisions for astronauts in the Mercury, Gemini, and Apollo programs. In 1970, she received the Distinguished Civilian Service Award from the Department of Defense.
Early life and education
Mary Victoria Richardson was born in Winnipeg, Manitoba, the daughter of William Henry Richardson and Clara Myrtle Ferguson Richardson. Her father, a civil engineer, was from England, and her mother was born in North Dakota; the family moved to Kelso, Washington when she was a girl. She earned a bachelor's degree in dietetics from the University of Washington in 1944, and a master's degree in business administration from the University of Chicago in 1947.
Career
Klicka served an internship at Michael Reese Hospital. She was a food technologist working for the United States Army beginning in 1951. She designed rations and their packaging for special contexts, including MREs and food for the Mercury, Gemini, and Apollo manned space missions, at the Army's Food Engineering Laboratory in Natick, Massachusetts. In 1958, she was assigned to the United Nations to work on rations issues of the UN's Emergency Force in Gaza. Her research was published in Aerospace Medicine, Military Medicine, Journal of Food Science, Life Sciences and Space Research, Cereal Science Today, School Lunch Journal, and Journal of the American Dietetic Association.
In 1966 Klicka was decorated for Meritorious Civilian Service. In 1968 she was decorated for Exceptional Civilian Service. In 1969 she received the Woman of Achievement Award from the Massachusetts Federation of Business and Professional Women's Clubs. In 1970, she received the Distinguished Civilian Service Award from the Department of Defense. She was nominated twice for the Federal Woman's Award, in 1965 and 1968. In 1996, she was inducted into the Army Soldier |
https://en.wikipedia.org/wiki/Ovarian%20culture | Ovarian culture is an in-vitro process that allows for the investigation of the development, toxicology and pathology of the ovary. This technique can also be used to study possible applications of fertility treatments e.g. isolating oocytes from primordial ovarian follicles that could be used for fertilisation.
Culture methods using mouse ovarian tissue
There are several culture systems which can be employed to investigate ovarian and follicular growth and development.
Whole ovarian culture
The culture of intact ovaries supports the formation and development of primordial follicles. Ovaries are dissected from neonatal mouse pups and placed into ovarian culture medium containing Bovine Serum Albumen (BSA) dissolved in α-Minimal Essential Media (αMEM). The cultures are maintained in a 37°C, 5% CO2 incubator and then the ovaries are frozen or fixed to facilitate further study.
Follicle culture
Individual
This method of culturing supports the growth of individual follicles from late pre-antral to pre-ovulatory stage. This system allows follicle growth and hormone production to be studied. The ovaries of young mice (19–23 days) are removed and halved, and follicles are identified under a microscope. Late pre-antral follicles are identified as having a diameter of 180-200 µm and containing 2-3 layers of granulosa cells. Follicles are manually dissected and then examined for suitability to culture. Follicles are chosen for culture only if they are healthy (diameter of 190 ± 10 µm; translucent; without dark atretic areas; intact basal lamina.) Wells containing follicle culture medium (α-Minimal Essential Media, recombinant human follicle stimulating hormone, ascorbic acid and adult female mouse serum) is overlaid with sterilised silicon oil, which prevents medium evaporation. A follicle is placed at the bottom of each well and maintained in a 37°C, 5% CO2 incubator, being moved into a well containing fresh medium for up to 6 days. If growth measurements are being ta |
https://en.wikipedia.org/wiki/AstroPay | AstroPay is a global wallet that provides users with a way to pay, send, and receive money. AstroPay's app offers online payments, virtual and physical debit cards, peer-to-peer money transfers, and more.
The app offers more than 200 payment methods including Banco do Brasil, Caixa, Bradesco, Boleto, PhonePe, Airtel, Google Pay, Visa and Mastercard.
History
AstroPay launched in the Brazilian market in 2009, and since then, it has expanded its services to other countries in Latin America, Asia, Africa, and the UK.
As of 2023, features of the digital wallet include loyalty programmes, debit cards and crypto offerings.
Brand endorsements, partnerships
AstroPay sponsored Burnley Football Club for the 2018–19 Premier League season. In 2021, the app renewed its sponsorship deal with Burnley FC ahead of the 2021–22 Premier League season and also became the official payment service partner for the club.
In August 2021, the company entered into a partnership with Wolverhampton Wanderers for the 2021-22 Premier League season, and the following year, became the team's shirt sponsor.
In September 2021, the company entered a sponsorship deal with Newcastle United Football Club in the English Premier League. AstroPay made arrangements to ensure that branding and logo would be visible on the pitch-side LED advertising during Premier League matches.
In June 2022, the company renewed it's partnership with Wolverhampton Wanderers for the 2022-23 Premier League season and launched its Wolves debit card in February 2023.
References
Online payments
Financial services companies established in 2009
Mobile applications |
https://en.wikipedia.org/wiki/List%20of%20Mersenne%20primes%20and%20perfect%20numbers | Mersenne primes and perfect numbers are two deeply interlinked types of natural numbers in number theory. Mersenne primes, named after the friar Marin Mersenne, are prime numbers that can be expressed as for some positive integer . For example, is a Mersenne prime as it is a prime number and is expressible as . The numbers corresponding to Mersenne primes must themselves be prime, although not all primes lead to Mersenne primes—for example, . Meanwhile, perfect numbers are natural numbers that equal the sum of their positive proper divisors, which are divisors excluding the number itself. So, is a perfect number because the proper divisors of are , and , and .
There is a one-to-one correspondence between the Mersenne primes and the even perfect numbers. This is due to the Euclid–Euler theorem, partially proved by Euclid and completed by Leonhard Euler: even numbers are perfect if and only if they can be expressed in the form , where is a Mersenne prime. In other words, all numbers that fit that expression are perfect, while all even perfect numbers fit that form. For instance, in the case of , is prime, and is perfect.
It is currently an open problem as to whether there are an infinite number of Mersenne primes and even perfect numbers. The frequency of Mersenne primes is the subject of the Lenstra–Pomerance–Wagstaff conjecture, which states that the expected number of Mersenne primes less than some given is , where is Euler's number, is Euler's constant, and is the natural logarithm. It is also not known if any odd perfect numbers exist; various conditions on possible odd perfect numbers have been proven, including a lower bound of .
The following is a list of all currently known Mersenne primes and perfect numbers, along with their corresponding exponents . , there are 51 known Mersenne primes (and therefore perfect numbers), the largest 17 of which have been discovered by the distributed computing project Great Internet Mersenne Prime Search, or G |
https://en.wikipedia.org/wiki/List%20of%20organisms%20named%20after%20famous%20people%20%28born%201900%E2%80%931949%29 | In biological nomenclature, organisms often receive scientific names that honor a person. A taxon (e.g., species or genus; plural: taxa) named in honor of another entity is an eponymous taxon, and names specifically honoring a person or persons are known as patronyms. Scientific names are generally formally published in peer-reviewed journal articles or larger monographs along with descriptions of the named taxa and ways to distinguish them from other taxa. Following rules of Latin grammar, species or subspecies names derived from a man's name often end in -i or -ii if named for an individual, and -orum if named for a group of men or mixed-sex group, such as a family. Similarly, those named for a woman often end in -ae, or -arum for two or more women.
This list is part of the List of organisms named after famous people, and includes organisms named after famous individuals born between 1 January 1900 and 31 December 1949. It also includes ensembles (including bands and comedy troupes) in which at least one member was born within those dates; but excludes companies, institutions, ethnic groups or nationalities, and populated places. It does not include organisms named for fictional entities, for biologists, paleontologists or other natural scientists, nor for associates or family members of researchers who are not otherwise notable; exceptions are made, however, for natural scientists who are much more famous for other aspects of their lives, such as, for example, Japanese emperors Hirohito and Akihito.
Sir David Attenborough was formerly included in this section of the list as one of these exceptions, since despite his formal training as a natural scientist, he is more widely known to the public as a documentary filmmaker. However, due to the high number of taxa named after him (over 50 as of 2022), he has been removed; his patronyms can be found in the List of things named after David Attenborough and his works.
Organisms named after famous people born earlier c |
https://en.wikipedia.org/wiki/Gulf%20Business |
Gulf Business is a weekly magazine published from Dubai, United Arab Emirates, and focusing on Middle East business news, especially in GCC countries. It was launched in 1996. It is published in Motivate Media Group.
The magazine has reported on a rival magazine, Arabian Business. It has also reported on the Dubai, Sharjah, Ajman (DSA) conurbation of emirates. The magazine is quoted in books.
The magazine uses social media, including Twitter (as "GulfBusiness") since 2009.
Gulf Business Awards
The magazine organizes the annual Gulf Business Awards.
See also
Arabian Business
References
External links
Official website
1996 establishments in the United Arab Emirates
Magazines established in 1996
Business magazines published in the United Arab Emirates
English-language magazines
Online magazines
Monthly magazines
Mass media in Dubai |
https://en.wikipedia.org/wiki/VEGA%20Microprocessors | VEGA Microprocessors are a portfolio of indigenous processors developed by C-DAC. The portfolio includes several 32-bit/64-bit Single/Multi-core Superscalar In-order/Out-of-Order high performance processors based on the RISC-V ISA. Also features India's first indigenous 64-bit, superscalar, Out-of-order processor which is the main highlight of this portfolio.
The Centre for Development of Advanced Computing (C-DAC) is an autonomous Scientific Society, operating under the Ministry of Electronics and Information Technology (MeitY), Govt. of India. The Microprocessor Development Programme (MDP) was initiated and funded by MeitY with the mission objective to design and develop indigenously, a family of Microprocessors, related IPs and the complete ecosystem to enable fully indigenous product development that meets various requirements in the strategic, industrial and commercial sectors.
As part of the project C-DAC has successfully developed the VEGA series of microprocessors in soft IP form, which include32-bit Single-core (In-order), 64-bit Single-core (In-order & Out-of-order), 64-bit Dual-core (Out-of-order), and 64-bit Quad-core (Out-of-order). These high-performance processors are based on the open-source RISC-V Instruction Set Architecture. The tape out of some of these processor chips have also been planned.
Vega processors are used in “Swadeshi Microprocessor Challenge- Innovate Solutions for #Atmanirbhar Bharat”.
Processor Variants
There are many variants for VEGA microprocessors, including:
VEGA ET1031
VEGA ET1031 is a compact and efficient 32-bit, 3-stage in-order processor based on RISC-V Instruction Set Architecture. This microprocessor can be used as an effective work horse in low power IoT applications. It is based on RISC-V (RV32IM) Instruction Set Architecture and contains a high-performance multiply/divide unit, configurable AXI4 or AHB external interface, optional MPU (Memory Protection Unit), Platform Level Interrupt Controller and advanced In |
https://en.wikipedia.org/wiki/Alice%20Chancellor | Alice Percilla Chancellor (September 2, 1912 – June 22, 1985) was an American electronics engineer, recipient of the 1970 Outstanding Handicapped Federal Employee of the Year award.
Early life and education
Chancellor was born in Kentland, Indiana, the daughter of James Robert Chancellor and Laura Maria Lowman Chancellor. Her father was a farmer. She had a childhood accident and subsequent infection that, in adulthood, made her blind in one eye, and required both her legs to be amputated in separate surgeries (1962 and 1964). In 1956, she resigned her civil service job to pursue a degree in engineering, which she completed at the University of Arizona.
Career
Chancellor, who used a wheelchair, worked as a stenographer and typist as a young woman, in private industry, for an Indiana draft board during World War II, and after 1952 in the Federal Civil Service. In 1962, after her college degree was completed, she was an electronics engineer for the United States Army in Arizona, at the Electronic Proving Ground at Fort Huachuca. She was named the Department of the Army's 1970 Handicapped Employee, and won the 1970 Outstanding Handicapped Federal Employee of the Year award, which was presented to her at a March 1971 ceremony by Pat Nixon.
Chancellor also received two Department of the Army Meritorious Civilian Service Awards. She was a member of the Institute of Electrical and Electronics Engineers, and active in the Arizona chapter of the Armed Forces Communications Electronic Association.
Personal life
Chancellor lived alone in her own house, and drove an adapted car. She enjoyed sewing clothes, for herself and for charity. In 1969, she donated 50 handmade Easter dresses to a nearby Indian reservation. She also made wardrobes for students at the Papago Indian School. She died in 1985, in Sierra Vista, Arizona, aged 72 years.
References
1912 births
1985 deaths
People from Kentland, Indiana
American women engineers
Electronics engineers
University of Arizona a |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.