source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Domain.com | Domain.com is a domain registrar and web hosting company headquartered in Jacksonville, Florida, and is a subsidiary of Newfold Digital.
History
Domain.com's origins existed as part of the Dotster brand founded by George DeCarlo in 1998. A graduate of the University of Portland, DeCarlo launched Dotster as a project of the Columbia Analytical Services before being purchased by Baker Capital in 2004.
In 2005, Dotster introduced a new domain technology which provided relevant search results based on domains or keywords entered by its users. It was awarded the Domain Pioneer Award from Verisign at the "25 Years of .com Gala" in 2010.
In 2011, Dotster and its subsidiaries, My Domain and Netfirms, were acquired by Endurance International Group. Among the domain names owned by Dotster was www.domain.com, which was determined by leadership to be the strongest branding for their attempt to put more emphasis on the domain registration growth. In 2012, Dotster began migrating domain accreditation to Domain.com, LLC, making it the official registrar for the company's domain business.
Services
Domain.com currently powers more than 1.2 million websites worldwide. Although they are known predominantly as domain registrar, the company also offers resources for shared hosting, WordPress hosting, and SSL certificates. They also are responsible for launching the .xyz top-level domain to increase the number of short, brandable URLs available to the public.
References
Web design companies of the United States
Web hosting
Endurance International Group
Companies based in Vancouver, Washington |
https://en.wikipedia.org/wiki/ISO/IEC%204909 | ISO/IEC 4909 is a 2006 international standard produced by the International Organization for Standardization (ISO) and the International Electrotechnical Commission (IEC) for Identification cards — Financial transaction cards — Magnetic stripe data content for track 3. It was reviewed in 2018. The original ISO 4909 standard appeared in 1987. It is one of a number of international bank card standards. The standard is used for credit cards.
The standard has been adopted in many countries, including (for example)
Denmark,
Germany,
India,
Netherlands,
New Zealand,
Norway,
United Kingdom,
etc.
References
2006 introductions
04909
Identity documents
Payment cards
Magnetic devices |
https://en.wikipedia.org/wiki/Meike%20Akveld | Meike Maria Elisabeth Akveld is a Swiss mathematician and textbook author, whose professional interests include knot theory, symplectic geometry, and mathematics education. She is a tenured senior scientist and lecturer in the mathematics and teacher education group in the Department of Mathematics at ETH Zurich. She is also the organizer of the Mathematical Kangaroo competitions in Switzerland, and president of the Association Kangourou sans Frontières, a French-based international society devoted to the popularization of mathematics.
Education
Akveld earned a bachelor's degree from the University of Warwick and took Part III of the Mathematical Tripos at the University of Cambridge. She completed her Ph.D. at ETH Zurich in 2000, with the dissertation Hofer geometry for Lagrangian loops, a Legendrian knot and a travelling wave jointly supervised by Dietmar Salamon and Leonid Polterovich.
Books
Akveld's mathematics books include:
Canonical metrics in Kähler geometry (by Tian Gang, based on notes taken by Akveld, Birkhäuser, 2000)
Knoten in der Mathematik: Ein Spiel mit Schnüren, Bildern und Formeln (Knots in mathematics: A game with strings, pictures and formulas, in German, Orell Füssli, 2007)
Hofer geometry for Lagrangian loops: And a Legendrian Knot and a travelling wave (VDM Verlag, 2008)
Integrieren - do it yourself (in German, with Ursula Eisler and Daniel Zogg, Orell Füssli, 2010)
Knots Unravelled: From String to Mathematics (with Andrew Jobbings, Arbelos, 2011)
Analysis I and Analysis II (in German, with René Sperb, VDF Hochschulverlag, 2012 and 2015)
Knopen in de wiskunde (Knots in mathematics, in Dutch, with Ab van der Roest, Epsilon Uitgaven, 2015)
Mathe mit dem Känguru 5: Die schönsten Aufgaben von 2015 bis 2019 (Math with the kangaroo 5: The most beautiful problems from 2015 to 2019, in German, with Alexander Unger, Monika Noack, and , Hanser Verlag, 2019)
References
External links
Home page
Year of birth missing (living people)
Living p |
https://en.wikipedia.org/wiki/Security%20and%20Privacy%20in%20Computer%20Systems | Security and Privacy in Computer Systems is a paper by Willis Ware that was first presented to the public at the 1967 Spring Joint Computer Conference.
Significance
Ware's presentation was the first public conference session about information security and privacy in respect of computer systems, especially networked or remotely-accessed ones.
The IEEE Annals of the History of Computing said that Ware's 1967 Spring Joint Computer Conference session, together with 1970's Ware report, marked the start of the field of computer security.
External links
References
Computer security |
https://en.wikipedia.org/wiki/Jiuzhang%20%28quantum%20computer%29 | Jiuzhang () is the first photonic quantum computer to claim quantum supremacy. Previously quantum supremacy has been achieved only once in 2019 by Google’s Sycamore, however Google's computer was based on superconducting materials, and not photons.
Jiuzhang was developed by a team from University of Science and Technology of China (USTC) led by Pan Jianwei and Lu Chaoyang. The computer is named after Jiuzhang suanshu, an ancient Chinese mathematical classic.
On 3 December 2020, USTC announced in Science that Jiuzhang successfully performed Gaussian boson sampling in 200 seconds, with a maximum of 76 detected photons. The USTC group estimated that it would take 2.5 billion years for the Sunway TaihuLight supercomputer to perform the same calculation.
Experimental setup
The setup involves a Verdi-pumped Mira 900 Ti:sapphire laser which is split into 13 paths of equal intensity and then shined on 25 PPKTP crystals to produce 25 two-mode squeezed states. Through a hybrid encoding this is equivalent to 50 single-mode squeezed states. The purity is increased from 98% to 99% by 12nm filtering. The 50 single-mode squeezed states are sent into a 100-mode interferometer and sampled by 100 single-photon detectors with an efficiency of 81%.
References
2020 in science
University of Science and Technology of China
Quantum computing
Supercomputing in China |
https://en.wikipedia.org/wiki/Games%2C%20Puzzles%2C%20and%20Computation | Games, Puzzles, and Computation is a book on game complexity, written by Robert Hearn and Erik Demaine, and published in 2009 by A K Peters. It is revised from Hearn's doctoral dissertation, which was supervised by Demaine. The Basic Library List Committee of the Mathematical Association of America has recommended it for inclusion in undergraduate mathematics libraries.
Topics
Games, Puzzles, and Computation concerns the computational complexity theory of solving logic puzzles and making optimal decisions in two-player and multi-player combinatorial games. Its focus is on games and puzzles that have seen real-world play, rather than ones that have been invented for a purely mathematical purpose. In this area it is common for puzzles and games such as sudoku, Rush Hour, reversi, and chess (in generalized forms with arbitrarily large boards) to be computationally difficult: sudoku is NP-complete, Rush Hour and reversi are PSPACE-complete, and chess is EXPTIME-complete. Beyond proving new results along these lines, the book aims to provide a unifying framework for proving such results, through the use of nondeterministic constraint logic, an abstract combinatorial problem that more closely resembles game play than the more classical problems previously used for completeness proofs.
It is divided into three parts. The first part concerns constraint logic, which involving assigning orientations to the edges of an undirected graph so that each vertex has incoming edges with large-enough total weight. The second part of this book applies constraint logic in new proofs of hardness of various real-world games and puzzles, by showing that, in each case, the vertices and edges of a constraint logic instance can be encoded by the moves and pieces of the game. Some of these hardness proofs simplify previously-known proofs; some ten of them are new, including the discovery that optimal play in certain multiplayer games can be an undecidable problem. A third part of the book pr |
https://en.wikipedia.org/wiki/Sabanet | Sabanet, Neda Gostar Saba () is an Iranian ISP, It started in 2003, with PAP license from MICT.In 2020 was one of top 10 Internet and broadband market companies in Iran The company also serves an IP PBX system marketed as Sabatel for coupled wires. It was ranked low as having a low download speed for FTP in 2020.
References
External links
http://www.sabanet.ir/
Privately held companies of Iran
Internet technology companies
Internet service providers of Iran |
https://en.wikipedia.org/wiki/Sheypoor | Sheypoor (; "bugle") is a classified ads platform website and mobile application, headquartered in Tehran, Iran.
Thousands of advertisements are added to the app every day.
See also
Divar (website)
References
External links
Official website
Persian-language websites
E-commerce websites
Mobile software
Android (operating system) software
IOS software
Privately held companies of Iran
Online companies
Online marketplaces of Iran |
https://en.wikipedia.org/wiki/Shucky%20beans | Shucky beans (also called "leather britches") are an American legume dish, made of dried green beans that have been preserved for winter consumption. It is one of the most common side dishes of old-fashioned Appalachian cuisine. The traditional method to prepare the shucky beans is with a needle and thread. The beans are strung on the thread and hung, usually behind a wood stove, until they shrivel giving the appearance of "leather britches". They can be dried other ways as well such as in a greenhouse, on a tin roof or in a hot car. They are stored in a pillowcase or flour sack in a dry area until needed. The dried beans can be simmered for a few hours with fatback to create a winter meal that can be served with cornbread and sliced onion.
References
Edible legumes
Phaseolus
Crops originating from the Americas
Legume dishes
American pork dishes
American cuisine
Appalachian cuisine
Food preservation |
https://en.wikipedia.org/wiki/Abelian%202-group | In mathematics, an Abelian 2-group is a higher dimensional analogue of an Abelian group, in the sense of higher algebra, which were originally introduced by Alexander Grothendieck while studying abstract structures surrounding Abelian varieties and Picard groups. More concretely, they are given by groupoids which have a bifunctor which acts formally like the addition an Abelian group. Namely, the bifunctor has a notion of commutativity, associativity, and an identity structure. Although this seems like a rather lofty and abstract structure, there are several (very concrete) examples of Abelian 2-groups. In fact, some of which provide prototypes for more complex examples of higher algebraic structures, such as Abelian n-groups.
Definition
An Abelian 2-group is a groupoid with a bifunctor and natural transformationswhich satisfy a host of axioms ensuring these transformations behave similarly to commutativity () and associativity for an Abelian group. One of the motivating examples of such a category comes from the Picard category of line bundles on a scheme (see below).
Examples
Picard category
For a scheme or variety , there is an Abelian 2-group whose objects are line bundles and morphisms are given by isomorphisms of line bundles. Notice over a given line bundle since the only automorphisms of a line bundle are given by a non-vanishing function on . The additive structure is given by the tensor product on the line bundles. This makes is more clear why there should be natural transformations instead of equality of functors. For example, we only have an isomorphism of line bundlesbut not direct equality. This isomorphism is independent of the line bundles chosen and are functorial hence they give the natural transformationswitching the components. The associativity similarly follows from the associativity of tensor products of line bundles.
Two term chain complexes
Another source for Picard categories is from two-term chain complexes of Abelian grou |
https://en.wikipedia.org/wiki/GUVI | GUVI (an acronym for Grab Your Vernacular Imprint) is an IIT Madras and IIM Ahmedabad incubated company based in Chennai, India. It was founded by ex-PayPal engineers Arun Prakash, Sridevi Arun Prakash, and SP Balamurugan in 2014. GUVI offers free and paid learning courses on various IT and tech domains in Indian vernacular languages such as Tamil, Telugu, Hindi, Kannada, Bengali, and English.
GUVI's mission is "to make technical education available to all in their native languages". In 2022, Indian Information Technology and Consulting Service giant HCL acquired a majority stake in the vernacular edtech company that provides diverse professional and certificate tech courses to students, graduates, and working professionals who wish to upskill themselves.
History
The founder trio comprising Arun Prakash, Sridevi Arun Prakash, and SP Balamurugan, started GUVI as a volunteering initiative in the form of a YouTube channel back in 2011 while they were working for PayPal. They used to post videos, tutorials, and practice material explaining technical terminologies and concepts in vernacular languages like Tamil, Telugu, and Marathi. The founders’ primary goal was to bring tech closer to the learners not fluent in English.
It all started when GUVI’s CEO and founder, Arun Prakash went to attend an alumni meet at his college where he got the chance to meet and interact with the current batch of students. During the interaction, the students seemed to lack basic technical knowledge. So, Arun started teaching and explaining those tech concepts in the student’s native language. They seemed to grasp the concepts and understand them very well.
This made Arun realize the gaping skill gap in college students because of the high dependency on English for tech education. He then discussed his concern with Sridevi and Balamurugan. Then they decided to put out and teach technical skills to students in vernacular language to bridge the gap in tech education caused by the language |
https://en.wikipedia.org/wiki/Primality%20Testing%20for%20Beginners | Primality Testing for Beginners is an undergraduate-level mathematics book on primality tests, methods for testing whether a given number is a prime number, centered on the AKS primality test, the first method to solve this problem in polynomial time. It was written by Lasse Rempe-Gillen and Rebecca Waldecker, and originally published in German as Primzahltests für Einsteiger: Zahlentheorie, Algorithmik, Kryptographie (Vieweg+Teubner, 2009). It was translated into English as Primality Testing for Beginners and published in 2014 by the American Mathematical Society, as volume 70 of their Student Mathematical Library book series. A second German-language edition was publisher by Springer in 2016.
Topics
Primality Testing for Beginners has six chapters, divided into two parts: four chapters on background material in number theory and computational complexity theory, and three on the AKS primality test.
Chapter 1 includes basic material on number theory, including the fundamental theorem of arithmetic on unique factorization into primes, the binomial theorem, the Euclidean algorithm for greatest common divisors, and the sieve of Eratosthenes for generating the sequence of prime numbers. Chapter 2 begins the study of algorithms and their complexity, including algorithms for basic computations in arithmetic, the notion of computability, polynomial-time algorithms, randomization, and nondeterministic polynomial time. In randomized algorithms, it introduces the distinction between Las Vegas algorithms that always return the correct answer after a random amount of time (such as quicksort) and Monte Carlo algorithms for which there is a small probability of getting a wrong answer (exemplified by algorithms based on the Schwartz–Zippel lemma for polynomial identity testing). Chapter 3 provides additional material in number theory, including the Chinese remainder theorem, Fermat's little theorem, and the Fermat primality test based on it. It also introduces calculation with p |
https://en.wikipedia.org/wiki/Electrified%20reef | An electric reef (also electrified reef) is an artificial reef made from biorock, being limestone that forms rapidly in seawater on a metal structure from dissolved minerals in the presence of a small electric current. The first reefs of this type were created by Wolf Hilbertz and Thomas J. Goreau in the 1980s. By 2011 there were examples in over 20 countries.
History
Artificial reefs have been built since the 1950s using materials including sunken ships, concrete blocks. While artificial reefs have been effective at boosting fish populations and are valuable areas for benthic organisms and other marine life (e.g. sponges) to colonise, they are less viable for coral restoration. due to the slow growth of corals and their susceptibility to environmental changes.
In the 1970s, whilst studying how seashells and reefs grow, Wolf Hilbertz discovered a simple method of creating limestone from minerals dissolved in seawater, which he called biorock. Together with Thomas J. Goreau he realised that this process could be adapted to rapidly create artificial coral reefs during the 1980s. Using the name "Seacrete", the process was publicised in the 1992 futurology book titled The Millennial Project.
With others, Hilbertz and Goreau made expeditions to the Saya de Malha bank in 1997 and 2002 where they grew an artificial island around steel structures anchored to the sea floor using this process. In the Maldives, 80% of the electric reefs survived the 1998 warming which killed 95% of the natural reef corals.
Goreau continued the work after Hilbertz's death in 2007. By 2011 there were electric reef projects installed in over 20 countries. In 2012, both Goreau and Robert K. Trench published works on how the process could generate building materials as well as restore damaged ecosystems.
Construction process
The base of an electrified reef is a welded electrically conductive frame, often made from construction grade rebar or wire mesh which submerged and attached to the seaf |
https://en.wikipedia.org/wiki/LinBi | The LinBi project ran between February 2019 and October 2020 as an EU-funded INEA-CEF project which focused on biodiversity and documentation of the variety of life on Earth. This diversity is preserved in a wide range of formats – books, illustrations, specimen scans, glass plate photographs, sound recordings, herbarium sheets, video and more. LinBi brought together botanists, researchers, the media and the public in a collaborative effort to enhance and support appreciation and use of European biodiversity material. The project has provided 1.3 million items of cultural heritage content to Europeana.
LinBi partners were:
Rundfunk Berlin-Brandenburg (RBB, Germany) public service broadcaster for the German region of Berlin and Brandenburg,
Royal Botanical Garden of Madrid (RJB-CSIC, Spain) part of the Spanish National Research Council (CSIC),
Naturhistorisches Museum Wien (NHM, Austria) which includes departments of anthropology, botany, geology, mineralogy, karst and caves, palaeontology and zoology
Angewandte Informationstechnik Forschungsgesellschaft (AIT, Austria) an Austrian software and research company specialising in information engineering and development of information systems tailored to complex environments in public administration, social/youth welfare and health care,
Agentschap Plantentuin Meise (APM, Belgium), an internationally renowned research institution focussing on plant diversity research and conservation.
Technical Overview
LinBi created a data enrichment platform to link existing items of data with new items, creating ‘enriched’ information objects. These were then processed by the OpenUp! Natural History content aggregator and provided to Europeana. The project has created three virtual exhibitions for Europeana. These exhibitions interlinked existing content with new and external data. The exhibitions focussed on Edible Plants from the Americas (curated by RJB-CSIC), François Crépin and the Study of Wild Roses (curated by Meise) |
https://en.wikipedia.org/wiki/ALC-0159 | ALC-0159 is a PEG/lipid conjugate (i.e. PEGylated lipid), specifically, it is the N,N-dimyristylamide of 2-hydroxyacetic acid, O-pegylated to a PEG chain mass of about 2 kilodaltons (corresponding to about 45-46 ethylene oxide units per molecule of N,N-dimyristyl hydroxyacetamide). It is a non-ionic surfactant by its nature. It has been deployed in the Pfizer-BioNTech SARS-CoV-2 mRNA vaccine (0.05 mg per dose) that contains the active ingredient tozinameran.
See also
Pfizer–BioNTech COVID-19 vaccine nanoparticle ingredients
ALC-0315
1,2-distearoyl-sn-glycero-3-phosphocholine
Cholesterol
Others
Polyethoxylated tallow amine
References
Assessment report, Comirnaty, Common name: COVID-19 mRNA vaccine (nucleoside-modified); Procedure No. EMEA/H/C/005735/0000 - gives structural formula for the compound (p. 24)
Lipids
Pfizer
Products introduced in 2020
Biotechnology |
https://en.wikipedia.org/wiki/Arven%20Pharmaceuticals | Arven Pharmaceuticals is a Turkish pharmaceutical corporation headquartered in Istanbul established as a subsidiary of Toksöz Group in 2013. Arven’s primary focus is development and production of high-technology inhaler and biotechnology products. The company is specialized on difficult to make products. Arven is the first Turkish company developing biosimilars for global markets, including the US and EU.
Arven has obtained a marketing authorization in 2016 for the biosimilar of Filgrastim, marketed under Fraven, which is the first biosimilar drug, developed and manufactured from cell to final product in Turkey.
Additionally, Arven is the first Turkish company to design and develop a patented Dry Powder Inhaler (DPI) device under Arvohaler trademark and globally introduced Cyplos (salmeterol/fluticasone) product inhaled with Arvohaler device.
Some of the ministry of health foundations have visitations to the company for the vaccine manufacturing potential during Covid-19 pandemic period.
History
In 2007 the Toksöz Group launched investments to contribute to the development of biotechnological products and the advancement of the pharmaceutical field in Turkey. A Biotechnology Division was first established in the Sanovel Silivri facility within the same year, and research and development work was initiated to produce Turkey’s first biosimilar product.
In the following years, the Toksöz Group brought together high-technology inhaler and biotechnology products under separate legal entity as“Arven İlaç San ve Tic. A.Ş.” continuing its investments, the group then decided in 2013 to build a dedicated factory for manufacturing of Arvenproducts.
Facilities
Arven Kırklareli factory
As of 2020, Arven employs 200 staff in factory and R&D facility.
The factory was built in the Kırklareli Industrial Zoneclose to the western borders of Turkey and started operations by obtaining a manufacturing license from the Pharmaceutical and Medical Devices Agency of Turkey in 2017 |
https://en.wikipedia.org/wiki/Late-stage%20functionalization | Late-stage functionalization (LSF) is a desired, chemical or biochemical, chemoselective transformation on a complex molecule to provide at least one analog in sufficient quantity and purity for a given purpose without needing the addition of a functional group that exclusively serves to enable said transformation.
Molecular complexity is an intrinsic property of each molecule and frequently determines the synthetic effort to make it. LSF can significantly diminish this synthetic effort, and thus enables access to molecules, which would otherwise not be available or too difficult to access. The requirements for LSF can be met by both C–H functionalization reactions and functional group manipulations. LSF reactions are particularly relevant and often used in the fields of drug discovery and materials chemistry, although no LSF has been implemented in a commercial process.
Chemoselectivity
All LSF reactions are chemoselective but not every chemoselective reaction fulfills the requirements of the definition for LSF. High chemoselectivity is required for a useful LSF with a predictable reaction outcome because complex molecules typically feature several distinct functional groups that need to be tolerated. In this sense, chemoselectivity is sometimes referred to as functional group tolerance. Furthermore, high chemoselectivity avoids often undesired over-functionalization of the valuable substrate, which is used as a limiting reagent in LSF reactions.
Every C–H bond functionalization on a complex molecule classifies as LSF, except when a directing or activating group must be installed in a previous step of the synthesis to accomplish the transformation. For functional group manipulations, the distinction between LSF and functional-group-tolerant reactions is more subtle. For example, peptide bioconjugation reactions make use of the native functionality in amino acid side chains, and thus classify as LSF. In contrast, bioorthogonal 1,3-dipolar cycloadditions (see |
https://en.wikipedia.org/wiki/Variant%20%28biology%29 | In microbiology and virology, the term variant or genetic variant is used to describe a subtype of a microorganism that is genetically distinct from a main strain, but not sufficiently different to be termed a distinct strain. A similar distinction is made in botany between different cultivated varieties of a species of plant, termed cultivars.
Viruses
SARS-CoV-2
It was said in 2013 that "there is no universally accepted definition for the terms 'strain', 'variant', and 'isolate' in the virology community, and most virologists simply copy the usage of terms from others". The lack of precise definition continued in 2020; in the context of the Variant of Concern 202012/01 version of the SARS-CoV-2 virus, the website of the US Centers for Disease Control and Prevention (CDC) states, "For the time being in the context of this variant, the [terms "variant", "strain", and "lineage"] are generally being used interchangeably by the scientific community".
References
External links
Variant (biology) – Biology Online
Microbiology terms
Virology
Microbial population biology
Genetics
Infraspecific virus taxa
Infraspecific bacteria taxa |
https://en.wikipedia.org/wiki/Ozow | Ozow, previously known as i-Pay, is a fintech company based in South Africa.
The company provides a variety of online payment services for South African businesses and consumers.
History
Established in 2014, Ozow has headquarters in Johannesburg and Cape Town, South Africa. It was co-founded by Thomas Pays, Mitchan Adams and Lyle Eckstein. Ozow has developed and currently operates an online automated Electronic Funds Transfer (EFT) payment gateway in South Africa.
Ozow is accessible to all who have an internet banking profile and allows for instant payments across all smart mobile and desktop devices. On March 5, 2020, the company achieved a milestone of R10 billion in transactions processed.
Amid the COVID-19 pandemic the company experienced increased huge demand for their services as large numbers of South Africans turned to online purchases amidst widespread lockdowns.
In November 2020, the company processed R1 billion in transactions in the month, including over Black Friday. The single biggest transaction processed was R500 000.
Investments
Kalon Venture Partners invested in the company during early funding rounds of the business. In June 2019, Ozow raised follow-on funding from Kalon Venture Partners as part of a larger Series A round.
In November 2021, the company announced a $48 million Series B funding round led by Tencent. The investment round also included Endeavor Catalyst and Endeavor Harvest Fund. Notably, Endeavor Catalyst’s investment committee approval was chaired by Reid Hoffman, partner at Greycroft, and co-founder and former executive chairman of LinkedIn.
Services
Ozow offers consumers card-free services whereby they are able to access their accounts using internet banking. Ozow uses a payment gateway to provide customers with payments. No registration is required and all customers need is an internet banking profile. Customers who pay through Ozow only pay the merchant. There are no other fees.
There are no charge backs on payments. |
https://en.wikipedia.org/wiki/Iod%C3%A9OS | iodéOS is an Android-based mobile operating system developed by French company iodé. The operating system is a fork of LineageOS and does not include Google Play Services, instead using MicroG as a free and open-source replacement.
Software
iodéOS is presented as a privacy-oriented LineageOS combined with MicroG and a firewall. From 2020 through November 2022, IodéOS was closed source and included proprietary apps. In November 2022, the company announced it was releasing version 3.3 as "open source" with options for uninstalling default apps. No license terms were specified, but multiple licenses can be found in each repository on GitLab, including "No license. All rights reserved" (proprietary).
Reception
According to Stefan Mey of Heise.de and "Sunny" of tarnkappe.info, iodéOS includes hosts file based ad and tracker blocking. According to "Sunny" of tarnkappe.info, users may install a VPN or an additional adblocker. According to Stefan Mey of heise.de, the operating system comes with F-Droid and Aurora Store app stores pre-installed. Manuel Vonau of AndroidPolice.com said it was "good" that the setup of a pre-installed phone isn't "much more complicated than with any other phone." However, inclusion of the Aurora Store meant the operating system still communicated with Google APIs and breaks Google's Terms of Service, but no warning is given.
In a review of iodeOS in April 2023, pentester Mike Kuketz said "iodéOS has been relatively successful in reducing Google's data collection mania - but not completely." As examples, to speed up location, the system accesses the Google SUPL server, and the included browser uses Google Safe Browsing. Kuketz warned, if you enable microG, more connections to Google will be made. Other criticisms included: Delayed delivery of (security) updates; Older devices do not receive full security updates of proprietary components like bootloader or firmware; and iodéOS does not support Verified Boot on every device. Kuketz concluded, |
https://en.wikipedia.org/wiki/Geometric%20Constructions | Geometric Constructions is a mathematics textbook on constructible numbers, and more generally on using abstract algebra to model the sets of points that can be created through certain types of geometric construction, and using Galois theory to prove limits on the constructions that can be performed. It was written by George E. Martin, and published by Springer-Verlag in 1998 as volume 81 of their Undergraduate Texts in Mathematics book series.
Topics
Geometric Constructions has ten chapters. The first two discuss straightedge and compass constructions, including many of the constructions from Euclid's Elements, and their algebraic model, the constructible numbers. They also include impossibility results for the classical Greek problems of straightedge and compass construction the impossibility of doubling the cube and trisecting the angle are proved algebraically, while the impossibility of squaring the circle and constructing some regular polygons is mentioned but not proved.
The next four chapters study what happens when the use of the compass or straightedge is restricted: by the Mohr–Mascheroni theorem there is no loss in constructibility if one uses only a compass, but a straightedge without a compass has significantly less power, unless an auxiliary circle is provided (the Poncelet–Steiner theorem). These chapters also discuss the restriction of compasses to dividers, tools that can transfer line segments onto equal segments of other lines but cannot be used to find intersections of circles with other curves, or to rusty compasses, compasses that cannot change radius, and they use dividers to construct the Malfatti circles.
The final three chapters go beyond the straightedge and compass to other construction tools. A highly restricted form of construction, the "match-stick geometry" of Thomas Rayner Dawson from the 1930s, uses only unit line segments, which can be placed along each other, intersected, or pivoted around one of their endpoints; despite its l |
https://en.wikipedia.org/wiki/Surface%20magnon%20polariton | Surface magnon-polaritons (SMPs) are a type of quasiparticle in condensed matter physics. They arise from the coupling of incident electromagnetic (EM) radiations to the magnetic dipole polarization in the surface layers of a solid . Magnons are analogous to other forms of polaritons such as, plasmons and phonons but represent an oscillation of the magnetic component of the solid's EM field rather than its electric component or a mechanical oscillation in the solid's atomic structure.
They are sometimes referred to as magnetic surface polaritons (MSPs).
By employing, artificially constructed metamaterials , whose properties mainly stem from their engineered internal fine structures rather than their bulk physical make up, it is possible to more easily achieve useful SMPs. However, they can be found in several natural magnetic materials, including at THz frequencies in antiferromagnetic crystals.
Magnons offer a way to control light-matter interactions at Terahertz frequencies.
References
Quasiparticles
Plasmonics |
https://en.wikipedia.org/wiki/Arthur%20von%20Abramson | Arthur von Abramson (born 3 March 1854) was an Imperial Russian civil engineer.
He was born to a Jewish family in Odessa, and was educated at the city's gymnasium. He studied mathematics at the University of Odessa, but left to take a course in civil engineering at the Zurich Polytechnikum, from which he was graduated in 1876. Returning to Russia in 1879, von Abramson passed the state examination at the Russian Imperial Institute of Roads and Communications, and was appointed one of the directors of the Russian state railway at Kiev. He devised, built, and managed the sewer system of Kiev, and constructed the street-railroad of that city. In 1881 he founded and became editor-in-chief of a technical monthly, Inzhener ('The Engineer'). He was appointed president of the local sewer company and director of the Kiev city railroad.
Publications
Published in English as
References
1854 births
Year of death unknown
ETH Zurich alumni
Civil engineers from the Russian Empire
Editors from the Russian Empire
Odesa Jews
Print editors
Railway civil engineers
People from the Russian Empire in rail transport |
https://en.wikipedia.org/wiki/Playing%20with%20Infinity | Playing with Infinity: Mathematical Explorations and Excursions is a book in popular mathematics by Hungarian mathematician Rózsa Péter, published in German in 1955 and in English in 1961.
Publication history and translations
Playing with Infinity was originally written in 1943 by mathematician Rózsa Péter, based on a series of letters Péter had written to a non-mathematical friend, . Because of World War II, it was not published until 1955, in German, under the title Das Spiel mit dem Unendlichen, by Teubner.
An English translation by Zoltán Pál Dienes was published in 1961 by G. Bell & Sons in England, and by Simon & Schuster in the US. The English version was reprinted in 1976 by Dover Books, The German version was also reprinted, in 1984, by Verlag Harri Deutsch; the book has also been translated into Polish in 1962, and into Russian in 1967. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries.
Topics
Playing with Infinity presents a broad panorama of mathematics for a popular audience. It is divided into three parts, the first of which concerns counting, arithmetic, and connections from numbers to geometry both through visual proofs of results in arithmetic like the sum of finite arithmetic series, and in the other direction through counting problems for geometric objects like the diagonals of polygons. These ideas lead to more advanced topics including Pascal's triangle, the Seven Bridges of Königsberg, the prime number theorem and the sieve of Eratosthenes, and the beginnings of algebra and its use in proving the impossibility of certain straightedge and compass constructions.
The second part begins with the power of inverse operations to construct more powerful systems of numbers: negative numbers from subtraction, and rational numbers from division. Later topics in this part include the countability of the rationals, the irrationality of the square root of 2, expo |
https://en.wikipedia.org/wiki/Half-sider%20budgerigar | A half-sider budgerigar is an unusual congenital condition that causes a budgerigar to display one color on one side of its body and a different color on the other.
This is not a simple genetic mutation, as can be observed in other color and pattern variations in this species. It is a rare example of a tetragametic chimera, which originates when two fertilized embryos merge during a very early stage of development — between the 2-cell and the 64-cell stage. Each half has different DNA, with genetically distinct cells and the resultant bird is in effect two budgerigars fused together to form a single autonomous individual.
The half-sider's coloring is usually divided bilaterally down the center, although, it can differ depending on which stage the twin embryos merged during development. Twin embryos that merged later in development, will result in a budgerigar that has a splotchier distribution of the different cell populations.
In the case of the half-sider budgerigar, both embryos must possess different genetic phenotypes (one yellow-based and one white-based) in order for a visible half-sider to be produced. If both "halves" were the same base, it would still be a tetragametic chimera, but not a half-sider. It is also possible for the half-sider to be male on one side and female on the other (evidenced by a half blue, half brown cere) – an example of a bilateral gynandromorph.
Breeding a half-sider is unlikely to produce more half-siders, even when breeding two half-siders together, as the genetic makeup of the half that contributed the cells that make up the reproductive system is that which would then be perpetuated, assuming that the bird is even fertile in the first place. The chance of producing another half-sider would be the same as for any other budgerigar pairing.
References
Budgerigar colour mutations
Chimerism |
https://en.wikipedia.org/wiki/Topological%20Hochschild%20homology | In mathematics, Topological Hochschild homology is a topological refinement of Hochschild homology which rectifies some technical issues with computations in characteristic . For instance, if we consider the -algebra then but if we consider the ring structure on (as a divided power algebra structure) then there is a significant technical issue: if we set , so , and so on, we have from the resolution of as an algebra over , i.e. This calculation is further elaborated on the Hochschild homology page, but the key point is the pathological behavior of the ring structure on the Hochschild homology of . In contrast, the Topological Hochschild Homology ring has the isomorphism giving a less pathological theory. Moreover, this calculation forms the basis of many other THH calculations, such as for smooth algebras
Construction
Recall that the Eilenberg–MacLane spectrum can be embed ring objects in the derived category of the integers into ring spectrum over the ring spectrum of the stable homotopy group of spheres. This makes it possible to take a commutative ring and constructing a complex analogous to the Hochschild complex using the monoidal product in ring spectra, namely, acts formally like the derived tensor product over the integers. We define the Topological Hochschild complex of (which could be a commutative differential graded algebra, or just a commutative algebra) as the simplicial complex, pg 33-34 called the Bar complexof spectra (note that the arrows are incorrect because of Wikipedia formatting...). Because simplicial objects in spectra have a realization as a spectrum, we form the spectrumwhich has homotopy groups defining the topological Hochschild homology of the ring object .
See also
Revisiting THH(F_p)
Topological cyclic homology of the integers
Homological algebra
Algebraic topology |
https://en.wikipedia.org/wiki/Yerambam | Yerambam () was an ancient Indian mathematical treatise in the Tamil language. It was among the few ancient Tamil works on mathematics such as the work of Kanakkadhigaram and the manuscripts of Kilvaai and Kulimaattru.
The work
Yerambam was one of the works in the corpus of ancient Tamil mathematical works, which includes several other works such as Kilaralaabam, Adhisaram, Kalambagam, Thribuvana Thilagam, Kanidha Rathinam, and Sirukanakku. In addition to these, there were two other works for which the name of the author is known: Kanakku Nool by Kaakkai Paadiniyaar and Kanakkadhigaram by Kaarinaayanar.
Kaarinaayanar cites Yerambam and the six other works in the ancient corpus as the sources of his work Kanakkadhigaram. Yerambam is also explicitly mentioned by name by Parimelalhagar in his commentary on Thirukkural.
According to Devaneya Pavanar, the work is completely lost to modern times.
See also
Tamil literature
References
External links
Yerambam, Tamil Wiktionary entry
Sangam literature
Books about mathematics
Ancient Indian mathematical works |
https://en.wikipedia.org/wiki/Equalized%20odds | Equalized odds, also referred to as conditional procedure accuracy equality and disparate mistreatment, is a measure of fairness in machine learning. A classifier satisfies this definition if the subjects in the protected and unprotected groups have equal true positive rate and equal false positive rate, satisfying the formula:
For example, could be gender, race, or any other characteristics that we want to be free of bias, while would be whether the person is qualified for the degree, and the output would be the school's decision whether to offer the person to study for the degree. In this context, higher university enrollment rates of African Americans compared to whites with similar test scores might be necessary to fulfill the condition of equalized odds, if the "base rate" of differs between the groups.
The concept was originally defined for binary-valued . In 2017, Woodworth et al. generalized the concept further for multiple classes.
See also
Fairness (machine learning)
Color blindness (racial classification)
References
Machine learning
Information ethics
Computing and society
Philosophy of artificial intelligence
Discrimination
Bias |
https://en.wikipedia.org/wiki/Infinity%20cube | An Infinity cube is a kind of mechanical puzzle toy with mathematical principles. Its shape is similar to a 2×2 Rubik's cube. It can be opened and put back together from different directions, thus creating a visually interesting effect.
Construction
The principle of the infinity cube is simple and can be made by hand with simple paper cutting and pasting. First make 8 small cubes, then arrange the small cubes in a 2 by 2 by 2 way, and tape 8 edges together. When combined, there are 28 small squares exposed and 20 small squares hidden inside.
Mathematics
Like the Rubik's Cube, the various states of the Infinity Cube can be represented as a group, but the Infinity Cube has far fewer permutations than the Rubik's Cube.
Rubik's Cube group have permutations and isomorphic to the below groupware are alternating groups and are cyclic groups：
The largest group representation for Infinity Cube only contains 6 elements, and can be represented as:
See also
Paper model
Fidget Cube
15 puzzle
References
External links
Magic Folding Cube - Mathematische-Basteleien
Rubik's Cube
Origami
Novelty items
Mechanical puzzles
Sensory toys |
https://en.wikipedia.org/wiki/Virtual%20currency%20law%20in%20Iran | In 2018, Iran recognized cryptocurrency mining as a legal industry in order to monitor and regulate the mining farms that were already operating. In July 2018, President Hassan Rouhani's administration declared its intention of launching a national cryptocurrency, a news agency affiliated with the Central Bank of Iran outlined multiple features of the national cryptocurrency, stating that it would be backed by the Iran's national currency, the rial. The cryptocurrency could allow Iranians to make international transactions amidst trade embargo. As of December 2020 Iranians traded between $16 and $20 million in 12 different cryptocurrencies each day.
Iran's mining amount of bitcoin is close to $1 billion a year.
Rial Currency
Rial Currency will be the digital currency of the Central Bank of Iran, which is considered as electronic cash and will be the electronic version of common banknotes in Iran. Its value is also attached to the existing traditional paper rial. According to the emphasis of the Central Bank of Iran, Rial Currency, unlike cryptocurrencies such as Bitcoin, cannot be mined and its supply will be regulated by this bank.
Sanctions
The Reuters news agency published a report that the leading crypto exchange Binance had processed $7.8 billion worth of transactions from Iranian firms since 2018 despite US financial sanctions. In this report, the relationship between Binance and Nobitex is discussed. Nobitex has responded to the Reuters claim that the exchange was used to skirt sanctions against Iran in relationship with Binance.
See also
Digital currency
References
Cryptocurrencies
Economy of Iran |
https://en.wikipedia.org/wiki/Internet%20of%20vehicles | Internet of vehicles (IoV) is a network of vehicles equipped with sensors, software, and the technologies that mediate between these with the aim of connecting & exchanging data over the Internet according to agreed standards. IoV evolved from Vehicular Ad Hoc Networks ("VANET", a category of mobile ad hoc network used for communication between vehicles and roadside systems), and is expected to ultimately evolve into an "Internet of autonomous vehicles". It is expected that IoV will be one of the enablers for an autonomous, connected, electric, and shared (ACES) Future Mobility.
Road vehicles as a product category depend upon numerous technology categories from real-time analytics to commodity sensors and embedded systems. For these to operate in symphony the IoV ecosystem is dependent upon modern infrastructure and architectures that distribute computational burden across multiple processing units in a network. In the consumer market, IoV technology is most typically referenced in discussions of smart cities and driverless cars. Many of these architectures depend for their functionality upon open-source software & systems, for instance Subaru whose vehicles' infotainment platform is able to detect a driver's wakefulness and sound an alarm to pull over for a rest.
As with other internets connecting real user/consumer experiences with networks to which those user/consumers have no access or control, concerns abound as to risks inherent in the growth of IoV, especially in the areas of privacy and security, and consequently industry and governmental moves to address these concerns have begun including the development of international standards & methods of real-time analysis. These are receiving attention from organisations including the Linux Foundation’s ELISA (Enabling Linux In Safety Applications), the connected vehicles initiative at the Institute of Electrical and Electronics Engineers (IEEE), and the Connected Car Working Group at the Cellular Telecommunicatio |
https://en.wikipedia.org/wiki/Gemini%20%28protocol%29 | Gemini is an application-layer internet communication protocol for accessing remote documents, similar to the Hypertext Transfer Protocol (HTTP) and Gopher. It comes with a special document format, commonly referred to as "gemtext", which allows linking to other documents. Started by a pseudonymous person known as Solderpunk, the protocol is being finalized collaboratively and , has not been submitted to the IETF organization for standardization.
History
The Gemini project was started in June 2019 by Solderpunk. Additional work has been done by an informal community of users. According to Solderpunk's FAQ, Gemini is not intended to replace Gopher or HTTP, but to co-exist with them. Much of the development happened on the Gemini mailing list until the list disappeared at the end of 2021 due to a hardware issue. The creation of the Usenet newsgroup comp.infosystems.gemini in October 2021 was the first new newsgroup in the Big Eight hierarchy in eight years.
Design
The Gemini specification defines both the Gemini protocol and a native file format for that protocol, analogous to HTML for HTTP, known as "gemtext". The design is inspired by Gopher, but with modernisation such as mandatory use of Transport Layer Security (TLS) for connections and a hypertext format as native content type.
The design is deliberately not easily extensible, in order to meet a project goal of simplicity.
Protocol
Gemini is designed within the framework of the Internet protocol suite and like HTTP/S, Gemini functions as a request–response protocol in the client–server computing model. A Gemini server should listen on TCP port 1965. A Gemini browser, for example, may be the client and an application running on a computer hosting a Gemini site may be the server. The client sends a Gemini request message to the server, and the server sends back a response message. Gemini uses a separate connection to the same server for every resource request.
Gemini mandates the use of TLS with privacy- |
https://en.wikipedia.org/wiki/Wenxian%20Shen | Wenxian Shen is a Chinese-American mathematician known for her work in topological dynamics, almost-periodicity, waves and other spatial patterns in dynamical systems. She is a professor of mathematics at Auburn University.
Education
Shen graduated from Zhejiang Normal University in 1982, and earned a master's degree at Peking University in 1987. She completed a Ph.D. in mathematics at the Georgia Institute of Technology in 1992, with the dissertation Stability and Bifurcation of Traveling Wave Solutions supervised by Shui-Nee Chow.
Book
Shen is the coauthor of two monographs, Almost Automorphic and Almost Periodic Dynamics in Skew-Product Semiflows (with Yingfei Yi, American Mathematical Society, 1998), and Spectral Theory for Random and Nonautonomous Parabolic Equations and Applications (with Janusz Mierczyński, CRC Press, 2008).
References
External links
Year of birth missing (living people)
Living people
20th-century American mathematicians
21st-century American mathematicians
American women mathematicians
Chinese mathematicians
Chinese women mathematicians
Dynamical systems theorists
Zhejiang Normal University alumni
Peking University alumni
Georgia Tech alumni
Auburn University faculty
20th-century American women
21st-century American women |
https://en.wikipedia.org/wiki/Tempo%20Automation | Tempo Automation is an American electronics development and manufacturing company based in San Francisco, California.
History
Tempo was founded in 2013 by Jeff McAlvay, Jesse Koenig, and Shashank Samala. They started manufacturing customer orders through their platform in 2016.
In 2015, the company raised $8 million in Series A venture funding, led by Lux Capital. They raised $20 million in Series B funding in 2018, and an additional $45 million in Series C funding in 2019, with investors including Point72 Ventures, Lockheed Martin, and Uncork Capital, bringing their total raised to $74.6 million.
In 2018, the company opened a new factory in San Francisco to produce printed circuit boards for low-volume manufacturers and prototyping. In 2019, Joy Weiss was named president and chief executive officer, replacing founding CEO Jeff McAlvay, who became Tempo's chief process officer.
In November 2022, the company went public through a SPAC merger with ACE Convergence Acquisition Corp., raising $100 million from White Lion Capital. The company was listed on the Nasdaq stock exchange with ticker TMPO on November 23.
References
External links
Official website
Electronics manufacturing
Printed circuit board manufacturing
Electronics companies established in 2013
Manufacturing companies based in San Francisco |
https://en.wikipedia.org/wiki/PS-2000 | The PS-2000 (ПС-2000, , reconfigurable system) was a Soviet supercomputer built in the 1980s.
History
In the middle of the 1970s, it appeared, in the USSR, that the computing power available to process geophysics data, real-time space probes data, mineral prospecting, weather forecast, etc. was far to be sufficient, and that a new class of supercomputers, hundreds of times more powerful than the existing installed systems, was needed.
The development of ПС-2000 began in 1978, as a joint project between the Institute of Control Problems (IPU) in Moscow and the Impul's Scientific Production Association in Severodonetsk, under the supervision of Il’ya Itenberg and Vladislav Rezanov of Impul's and Iveri Prangishvili of IPU.
The computer entered production in 1981, and was manufactured in various configuration until 1988.
During the 1980s and the 1990s, the Roscosmos mission control computing complex was organized around an Elbrus 2 supercomputer, with a PS-2000 as a front processing supercomputer for telemetry data.
Architecture
The PS-2000 is a SIMD-type supercomputer.
It consists of 8 to 64 processing element (PE), cadenced at 3 MHz , that are connected to each other, under the control of a common command unit (OUU), and connected each to 12 or 48 KB of memory.
Eight processing elements are grouped in a processing device (UO).
Each PE use 24 bits registers, in fixed or floating point format. An addition takes 0.96 µs and a multiplication takes 1.6 µs, allowing theoretic peak performances of 200 MIPS for a full configuration system.
The computer is formed from 3 cabinets types:
Base module : one UO and one OUU
Extension module 1 : one UO (8 PE)
Extension module 2 : two UO (16 PE)
In the simplest configuration, the supercomputer consists of only one cabinet. In the full configuration, with 8 UO, the supercomputer consists of 5 cabinets, organised in a double-Y shape.
References
External links
Russian virtual computer museum
Soviet high-speed computers |
https://en.wikipedia.org/wiki/Numerical%20analytic%20continuation | In many-body physics, the problem of analytic continuation is that of numerically extracting the spectral density of a Green function given its values on the imaginary axis. It is a necessary post-processing step for calculating dynamical properties of physical systems from quantum Monte Carlo simulations, which often compute Green function values only at imaginary-times or Matsubara frequencies.
Mathematically, the problem reduces to solving a Fredholm integral equation of the first kind with an ill-conditioned kernel. As a result, it is an ill-posed inverse problem with no unique solution and where a small noise on the input leads to large errors in the unregularized solution. There are different methods for solving this problem including the maximum entropy method, the average spectrum method and Pade approximation methods.
Examples
A common analytic continuation problem is obtaining the spectral function at real frequencies from the Green function values at Matsubara frequencies by numerically inverting the integral equation
where for fermionic systems or for bosonic ones and is the inverse temperature. This relation is an example of Kramers-Kronig relation.
The spectral function can also be related to the imaginary-time Green function be applying the inverse Fourier transform to the above equation
with . Evaluating the summation over Matsubara frequencies gives the desired relation
where the upper sign is for fermionic systems and the lower sign is for bosonic ones.
Another example of the analytic continuation is calculating the optical conductivity from the current-current correlation function values at Matsubara frequencies. The two are related as following
Software
The Maxent Project: Open source utility for performing analytic continuation using the maximum entropy method.
Spektra: Free online tool for performing analytic continuation using the average spectrum Method.
SpM: Sparse modeling tool for analytic continuation of imaginary- |
https://en.wikipedia.org/wiki/Internet%20challenge | Internet challenges are a popular phenomenon on the Internet, encompassing a wide range of videos in which individuals record themselves performing specific actions or tasks, often daring others to do the same. These challenges have become a significant part of Internet meme culture, with many of them gaining widespread attention and popularity through memes. Notable examples of such challenges include the ALS Ice Bucket challenge, which gained viral status in mid-2014, and the TrashTag Challenge, which became popular in 2019.
The concept of Internet challenges shares similarities with the classic dare games played by children, wherein participants dare each other to undertake actions that are typically unconventional or out of the ordinary. While some challenges have emerged solely within the digital realm, there are instances where challenges or tasks predate the Internet and have resurfaced in a modified form online. The allure of internet challenges can be attributed, in part, to individuals' desire for attention and social validation, particularly among teenagers. Several of these challenges carry inherent risks and can be potentially dangerous.
Controversy has surrounded Internet challenges, primarily due to the harmful nature of certain tasks. Instances like the Cinnamon challenge or the Tide Pod challenge serve as striking examples, where participants have suffered severe injuries or even died. In response to such dangers, platforms like YouTube have disallowed the promotion of these challenges, leading many individuals to turn to alternative platforms like TikTok, where the creation and dissemination of such challenges are not subjected to strict moderation.
Moreover, some challenges have drawn criticism for their rude or disrespectful nature. The Gallon Smashing Internet challenge, for instance, gained notoriety for encouraging participants to purposefully spill or smash gallon containers of liquid in public places, resulting in inconvenience and potent |
https://en.wikipedia.org/wiki/Elementary%20Number%20Theory%2C%20Group%20Theory%20and%20Ramanujan%20Graphs | Elementary Number Theory, Group Theory and Ramanujan Graphs is a book in mathematics whose goal is to make the construction of Ramanujan graphs accessible to undergraduate-level mathematics students. In order to do so, it covers several other significant topics in graph theory, number theory, and group theory. It was written by Giuliana Davidoff, Peter Sarnak, and Alain Valette, and published in 2003 by the Cambridge University Press, as volume 55 of the London Mathematical Society Student Texts book series.
Background
In graph theory, expander graphs are undirected graphs with high connectivity: every small-enough subset of vertices has many edges connecting it to the remaining parts of the graph. Sparse expander graphs have many important applications in computer science, including the development of error correcting codes, the design of sorting networks, and the derandomization of randomized algorithms. For these applications, the graph must be constructed explicitly, rather than merely having its existence proven.
One way to show that a graph is an expander is to study the eigenvalues of its adjacency matrix. For an -regular graph, these are real numbers in the interval , and the largest eigenvalue (corresponding to the all-1s eigenvector) is exactly . The spectral expansion of the graph is defined from the difference between the largest and second-largest eigenvalues, the spectral gap, which controls how quickly a random walk on the graph settles to its stable distribution; this gap can be at most . The Ramanujan graphs are defined as the graphs that are optimal from the point of view of spectral expansion: they are -regular graphs whose spectral gap is exactly .
Although Ramanujan graphs with high degree, such as the complete graphs, are easy to construct, expander graphs of low degree are needed for the applications of these graphs. Several constructions of low-degree Ramanujan graphs are now known, the first of which were by and . Reviewer Jürgen Elstro |
https://en.wikipedia.org/wiki/Movable%20scaffolding%20system | A movable scaffolding system (MSS) is a special-purpose self-launching form used in bridge construction, specifically prestressed concrete bridges with segments or spans that are cast in place. The movable scaffolding system is used to support a form while the concrete is cured; once the segment is complete, the scaffold and forms are moved to the end of the new segment and another segment is poured.
While superficially similar, movable scaffolding systems should not be confused with launching gantry machines, which also are used in segmental bridge construction. Both feature long girders spanning multiple bridge spans which move with and temporarily support the work, but launching gantry machines are used to lift and support precast bridge segments and bridge girders, while movable scaffolding systems are used for cast-in-place construction.
Operation and design
A MSS is generally used instead of a launching gantry to minimize the number of joints, since the cast in place segments typically are longer than precast segments.
Once several bridge piers are complete, support brackets are attached to adjacent piers and the main parallel girders of the MSS are lifted in place to support the scaffold and concrete forms. Jacks are used to raise the girders and forms and the concrete is poured for the segment (or span) after rebar is placed. After the concrete has cured and the tendons have been tensioned, the jacks are lowered and the MSS girders are launched to bridge the next span. This process is repeated until the bridge is complete.
Both overhead (forms suspended from support girder(s) above the bridge deck level) and underslung (forms supported by support girder(s) below bridge deck level) MSS are available.
History
MSS construction was developed in the 1960s in Europe; the first bridge built with a MSS was the in Germany, completed in 1959. The first bridge constructed with a MSS in California was the Long Beach International Gateway in Long Beach that replace |
https://en.wikipedia.org/wiki/Ergodicity%20economics | Ergodicity economics is a research programme aimed at reworking the theoretical foundations of economics in the context of ergodic theory. The project's main goal is to understand how traditional economic theory, framed in terms of the expectation values of ensembles, changes when replacing expectation value averages with time averages. In particular, the programme is interested in understanding the effect of non-ergodic processes in economics, that is processes where the expectation value of an observable does not equal its time average.
Background
The ergodicity economics research programme originated in two papers by Ole Peters in 2011, a theoretical physicist and current external professor at the Santa Fe Institute. The first studied the problem of optimal leverage in finance and how this may be achieved by considering the non-ergodic properties of geometric brownian motion. The second paper applied principles of non-ergodicity to propose a possible solution for the St. Petersburg paradox. More recent work has suggested possible solutions for the equity premium puzzle, the insurance puzzle, gamble-selection, probability weighting, and has provided insights into the dynamics of income inequality.
Coverage in the wider media
In December 2020, Bloomberg news published an article titled "Everything We’ve Learned About Modern Economic Theory Is Wrong" discussing the implications of ergodicity in economics following the publication of a review of the subject in Nature Physics. Morningstar covered the story to discuss the investment case for stock diversification.
In the book Skin in the Game, Nassim Nicholas Taleb suggests that the ergodicity problem requires a rethinking of how economists use probabilities. A summary of the arguments was published by Taleb in a Medium article in August 2017.
In the book The End of Theory, Richard Bookstaber lists non-ergodicity as one of four characteristics of our economy that are part of financial crises, that conventional ec |
https://en.wikipedia.org/wiki/Insecta%20%28board%20game%29 | Insecta is a cooperative board game that was published by Sierra Madre Games and Fat Messiah Games in 1992.
Description
Insecta is a game of insect combat for 2–7 players. Each player designs a mutant insect by choosing various body parts: a head, front legs, rear legs, appendages and a tail. Each different body part has advantages and disadvantages. For example, wings allow flight but can't be used in tunnels. The player must also choose how much Instinct to give their insect (from 1–10), and how much Dexterity (also from 1–10). At the start of the game, Instinct and Desterity must add up to 12.
The resultant insects start life in The Hive. The object of the game is for the players' insects to work as a team to escape from Hive by defeating guardians such as a black widow spider, a praying mantis, or a honey bee.
Components
The game comes with:
a paper hex grid map of the Hive
cardstock sheets of insect parts and enemy insect cards
reference cards
plastic bugs
Publication history
Insecta was designed by Philip Eklund, and published by Sierra Madre Games and Fat Messiah Games in 1992. A second edition was released in 1995, and this was followed by three expansions:
Insecta: Rainforest (1997)
Insecta: Trilobite (1998)
Insecta: Desert Hive (2000)
Reviews
In the September 1996 edition of Dragon (#233), Rick Swan reviewed the second edition and liked it, saying, "Not only does Insecta reward you for dousing your enemies with pheremones, it's the only game I've seen that uses a life-size rubber cockroach as a playing piece."
References
Biology-themed board games
Board games introduced in 1992 |
https://en.wikipedia.org/wiki/Uddanam%20nephropathy | Uddanam nephropathy is a chronic kidney disease (CKD) that is endemic in the Indian region of Uddanam in Andhra Pradesh. Nephropathy on an endemic scale was first reported in Andhra Pradesh in the 1990s. In 2015, over 34,000 cases of kidney disease were recorded in the region, and it was estimated that at least 4,500 people had died from it in the last ten years. Its cause has not been found yet, and according to the WHO, it is "the least understood and the least publicized" nephropathy of unknown origin.
Risk factors
The search for possible causes has yielded some statistically significant relations. A prevalence study published in 2020 has shown that:
Farmers had a 20% higher CKD prevalence than non-farmers,
rice farming was associated with CKD, while coconut, cashew, vegetable and fruit production were not,
there was no association with using pesticides or fertilizers, or cleaning pesticide-contaminated clothing,
the nephropathy was more prevalent in older people, and consumers of alcohol and chewing tobacco.
Gender, hypertension and diabetes were not significantly associated with this disease.
Similar diseases
The Balkan endemic nephropathy was found to be caused by chronic intake of aristolochic acid, while the causes of Mesoamerican nephropathy that occurs in sugar cane cutters, Uddanam nephropathy and the Sri Lankan chronic kidney disease are still not clear despite years of research efforts. A review notes a „striking similarity“ between these diseases; they all occur in a clustered fashion among rural agricultural workers who have to carry out a lot of physical work under hot climatic conditions.
References
Kidney diseases
Ailments of unknown cause |
https://en.wikipedia.org/wiki/List%20of%20plant%20genera%20named%20for%20people%20%28A%E2%80%93C%29 | Since the first printing of Carl Linnaeus's Species Plantarum in 1753, plants have been assigned one epithet or name for their species and one name for their genus, a grouping of related species. Thousands of plants have been named for people, including botanists and their colleagues, plant collectors, horticulturists, explorers, rulers, politicians, clerics, doctors, philosophers and scientists. Even before Linnaeus, botanists such as Joseph Pitton de Tournefort, Charles Plumier and Pier Antonio Micheli were naming plants for people, sometimes in gratitude for the financial support of their patrons.
Early works researching the naming of plant genera include an 1810 glossary by and an etymological dictionary in two editions (1853 and 1856) by Georg Christian Wittstein. Modern works include The Gardener's Botanical by Ross Bayton, Index of Eponymic Plant Names and Encyclopedia of Eponymic Plant Names by Lotte Burkhardt, Plants of the World by Maarten J. M. Christenhusz (lead author), Michael F. Fay and Mark W. Chase, The A to Z of Plant Names by Allan J. Coombes, the four-volume CRC World Dictionary of Plant Names by Umberto Quattrocchi, and Stearn's Dictionary of Plant Names for Gardeners by William T. Stearn; these supply the seed-bearing genera listed in the first column below. Excluded from this list are genus names not accepted (as of January 2021) at Plants of the World Online, which includes updates to Plants of the World (2017).
Key
Ba = listed in Bayton's The Gardener's Botanical
Bt = listed in Burkhardt's Encyclopedia of Eponymic Plant Names
Bu = listed in Burkhardt's Index of Eponymic Plant Names
Ch = listed in Christenhusz's Plants of the World
Co = listed in Coombes's The A to Z of Plant Names
Qu = listed in Quattrocchi's CRC World Dictionary of Plant Names
St = listed in Stearn's Dictionary of Plant Names for Gardeners
In addition, Burkhardt's Index is used as a reference for every row in the table not cited to Stearn.
Genera
See also
List o |
https://en.wikipedia.org/wiki/Mixed-precision%20arithmetic | Mixed-precision arithmetic is a form of floating-point arithmetic that uses numbers with varying widths in a single operation.
Arithmetic
A common usage of mixed-precision arithmetic is for operating on inaccurate numbers with a small width and expanding them to a larger, more accurate representation. For example, two half-precision or bfloat16 (16-bit) floating-point numbers may be multiplied together to result in a more accurate single-precision (32-bit) float. In this way, mixed-precision arithmetic approximates arbitrary-precision arithmetic, albeit with a low number of possible precisions.
Mixed-precision arithmetic is used in the field of machine learning, since gradient descent algorithms can use coarse and efficient half-precision floats for certain tasks, but can be more accurate if they use more precise but slower single-precision floats. Some platforms, including Nvidia, Intel, and AMD CPUs and GPUs, provide mixed-precision arithmetic for this purpose, using coarse floats when possible, but expanding them to higher precision when necessary.
Iterative algorithms (like gradient descent) are good candidates for mixed-precision arithmetic. In an iterative algorithm like square root, a coarse integral guess can be made and refined over many iterations until the error in precision makes it such that the smallest addition or subtraction to the guess is still too coarse to be an acceptable answer. When this happens, the precision can be increased to something more precise, which allows for smaller increments to be used for the approximation.
Supercomputers such as Summit utilize mixed-precision arithmetic to be more efficient with regards to memory and processing time, as well as power consumption.
References
Floating point
Computer arithmetic |
https://en.wikipedia.org/wiki/List%20of%20plant%20genera%20named%20for%20people%20%28D%E2%80%93J%29 | Since the first printing of Carl Linnaeus's Species Plantarum in 1753, plants have been assigned one epithet or name for their species and one name for their genus, a grouping of related species. Thousands of plants have been named for people, including botanists and their colleagues, plant collectors, horticulturists, explorers, rulers, politicians, clerics, doctors, philosophers and scientists. Even before Linnaeus, botanists such as Joseph Pitton de Tournefort, Charles Plumier and Pier Antonio Micheli were naming plants for people, sometimes in gratitude for the financial support of their patrons.
Early works researching the naming of plant genera include an 1810 glossary by and an etymological dictionary in two editions (1853 and 1856) by Georg Christian Wittstein. Modern works include The Gardener's Botanical by Ross Bayton, Index of Eponymic Plant Names and Encyclopedia of Eponymic Plant Names by Lotte Burkhardt, Plants of the World by Maarten J. M. Christenhusz (lead author), Michael F. Fay and Mark W. Chase, The A to Z of Plant Names by Allan J. Coombes, the four-volume CRC World Dictionary of Plant Names by Umberto Quattrocchi, and Stearn's Dictionary of Plant Names for Gardeners by William T. Stearn; these supply the seed-bearing genera listed in the first column below. Excluded from this list are genus names not accepted (as of January 2021) at Plants of the World Online, which includes updates to Plants of the World (2017).
Key
Ba = listed in Bayton's The Gardener's Botanical
Bt = listed in Burkhardt's Encyclopedia of Eponymic Plant Names
Bu = listed in Burkhardt's Index of Eponymic Plant Names
Ch = listed in Christenhusz's Plants of the World
Co = listed in Coombes's The A to Z of Plant Names
Qu = listed in Quattrocchi's CRC World Dictionary of Plant Names
St = listed in Stearn's Dictionary of Plant Names for Gardeners
In addition, Burkhardt's Index is used as a reference for every row in the table, except as noted.
Genera
See also
List of pl |
https://en.wikipedia.org/wiki/List%20of%20plant%20genera%20named%20for%20people%20%28Q%E2%80%93Z%29 | Since the first printing of Carl Linnaeus's Species Plantarum in 1753, plants have been assigned one epithet or name for their species and one name for their genus, a grouping of related species. Thousands of plants have been named for people, including botanists and their colleagues, plant collectors, horticulturists, explorers, rulers, politicians, clerics, doctors, philosophers and scientists. Even before Linnaeus, botanists such as Joseph Pitton de Tournefort, Charles Plumier and Pier Antonio Micheli were naming plants for people, sometimes in gratitude for the financial support of their patrons.
Early works researching the naming of plant genera include an 1810 glossary by and an etymological dictionary in two editions (1853 and 1856) by Georg Christian Wittstein. Modern works include The Gardener's Botanical by Ross Bayton, Index of Eponymic Plant Names and Encyclopedia of Eponymic Plant Names by Lotte Burkhardt, Plants of the World by Maarten J. M. Christenhusz (lead author), Michael F. Fay and Mark W. Chase, The A to Z of Plant Names by Allan J. Coombes, the four-volume CRC World Dictionary of Plant Names by Umberto Quattrocchi, and Stearn's Dictionary of Plant Names for Gardeners by William T. Stearn; these supply the seed-bearing genera listed in the first column below. Excluded from this list are genus names not accepted (as of January 2021) at Plants of the World Online, which includes updates to Plants of the World (2017).
Key
Ba = listed in Bayton's The Gardener's Botanical
Bt = listed in Burkhardt's Encyclopedia of Eponymic Plant Names
Bu = listed in Burkhardt's Index of Eponymic Plant Names
Ch = listed in Christenhusz's Plants of the World
Co = listed in Coombes's The A to Z of Plant Names
Qu = listed in Quattrocchi's CRC World Dictionary of Plant Names
St = listed in Stearn's Dictionary of Plant Names for Gardeners
In addition, Burkhardt's Index is used as a reference for every row in the table.
Genera
See also
List of plant genus names w |
https://en.wikipedia.org/wiki/List%20of%20plant%20genera%20named%20for%20people%20%28K%E2%80%93P%29 | Since the first printing of Carl Linnaeus's Species Plantarum in 1753, plants have been assigned one epithet or name for their species and one name for their genus, a grouping of related species. Thousands of plants have been named for people, including botanists and their colleagues, plant collectors, horticulturists, explorers, rulers, politicians, clerics, doctors, philosophers and scientists. Even before Linnaeus, botanists such as Joseph Pitton de Tournefort, Charles Plumier and Pier Antonio Micheli were naming plants for people, sometimes in gratitude for the financial support of their patrons.
Early works researching the naming of plant genera include an 1810 glossary by and an etymological dictionary in two editions (1853 and 1856) by Georg Christian Wittstein. Modern works include The Gardener's Botanical by Ross Bayton, Index of Eponymic Plant Names and Encyclopedia of Eponymic Plant Names by Lotte Burkhardt, Plants of the World by Maarten J. M. Christenhusz (lead author), Michael F. Fay and Mark W. Chase, The A to Z of Plant Names by Allan J. Coombes, the four-volume CRC World Dictionary of Plant Names by Umberto Quattrocchi, and Stearn's Dictionary of Plant Names for Gardeners by William T. Stearn; these supply the seed-bearing genera listed in the first column below. Excluded from this list are genus names not accepted (as of January 2021) at Plants of the World Online, which includes updates to Plants of the World (2017).
Key
Ba = listed in Bayton's The Gardener's Botanical
Bt = listed in Burkhardt's Encyclopedia of Eponymic Plant Names
Bu = listed in Burkhardt's Index of Eponymic Plant Names
Ch = listed in Christenhusz's Plants of the World
Co = listed in Coombes's The A to Z of Plant Names
Qu = listed in Quattrocchi's CRC World Dictionary of Plant Names
St = listed in Stearn's Dictionary of Plant Names for Gardeners
In addition, Burkhardt's Index is used as a reference for every row in the table, except as noted.
Genera
See also
List of pl |
https://en.wikipedia.org/wiki/Combinatorics%3A%20The%20Rota%20Way | Combinatorics: The Rota Way is a mathematics textbook on algebraic combinatorics, based on the lectures and lecture notes of Gian-Carlo Rota in his courses at the Massachusetts Institute of Technology. It was put into book form by Joseph P. S. Kung and Catherine Yan, two of Rota's students, and published in 2009 by the Cambridge University Press in their Cambridge Mathematical Library book series, listing Kung, Rota, and Yan as its authors (ten years posthumously in the case of Rota). The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries.
Topics
Combinatorics: The Rota Way has six chapters, densely packed with material: each could be "a basis for a course at the Ph.D. level". Chapter 1, "Sets, functions and relations", also includes material on partially ordered sets, lattice orders, entropy (formulated in terms of partitions of a set), and probability. The topics in Chapter 2, "Matching theory", as well as matchings in graphs, include incidence matrices, submodular set functions, independent matchings in matroids, the Birkhoff–von Neumann theorem on the Birkhoff polytope of doubly stochastic matrices, and the Gale–Ryser theorem on row and column sums of (0,1) matrices. Chapter 3 returns to partially ordered sets and lattices, including material on Möbius functions of incidence algebras, Sperner's theorem on antichains in power sets, special classes of lattices, valuation rings, and Dilworth's theorem on partitions into chains.
One of the things Rota became known for, in the 1970s, was the revival of the umbral calculus as a general technique for the formal manipulation of power series and generating functions, and this is the subject of Chapter 4. Other topics in this chapter include Sheffer sequences of polynomials, and the Riemann zeta function and its combinatorial interpretation. Chapter 5 concerns symmetric functions and Rota–Baxter algebras, including symmetric function |
https://en.wikipedia.org/wiki/Lepidiota%20stigma | Lepidiota stigma, also known as sugarcane white grub, is a species of insect native to Southeast Asia. The species is known to attack sugarcane fields in the region.
References
Beetles of Asia
Pests (organism)
Articles with 'species' microformats
Melolonthinae |
https://en.wikipedia.org/wiki/Braids%2C%20Links%2C%20and%20Mapping%20Class%20Groups | Braids, Links, and Mapping Class Groups is a mathematical monograph on braid groups and their applications in low-dimensional topology. It was written by Joan Birman, based on lecture notes by James W. Cannon, and published in 1974 by the Princeton University Press and University of Tokyo Press, as volume 82 of the book series Annals of Mathematics Studies.
Although braid groups had been introduced in 1891 by Adolf Hurwitz and formalized in 1925 by Emil Artin, this was the first book devoted to them. It has been described as a "seminal work", one that "laid the foundations for several new subfields in topology".
Topics
Braids, Links, and Mapping Class Groups is organized into five chapters and an appendix. The first introductory chapter defines braid groups, configuration spaces, and the use of configuration spaces to define braid groups on arbitrary two-dimensional manifolds. It provides a solution to the word problem for braids, the question of determining whether two different-looking braid presentations really describe the same group element. It also describes the braid groups as automorphism groups of free groups and of multiply-punctured disks.
The next three chapters present connections of braid groups to three different areas of mathematics. Chapter 2 concerns applications to knot theory, via Alexander's theorem that every knot or link can be formed by closing off a braid, and provides the first complete proof of the Markov theorem on equivalence of links formed in this way. It also includes material on the conjugacy problem, important in this area because conjugate braids close off to form the same link, and on the "algebraic link problem" (not to be confused with algebraic links) in which one must determine whether two links can be related to each other by finitely many moves of a certain type, equivalent to the homeomorphism of link complements. Chapter 3 concerns representation theory, and includes Fox derivatives and Fox's free differential calculus, |
https://en.wikipedia.org/wiki/Enteractinococcus%20coprophilus | Enteractinococcus coprophilus is a bacterium from the genus of Enteractinococcus which has been isolated from the faeces of the Panthera tigris amoyensis from the Yunnan Wild Animal Park in China.
References
Bacteria described in 2012
Micrococcaceae |
https://en.wikipedia.org/wiki/Track%20%28moving%20medium%29 | A track is a path on a recording medium. There are some variations in nomenclature; for some media a track is a logical (content based) path and for others it is based on the geometry of the medium.
The term is not used for punched cards.
Content-based tracks
The terms session, title or track may be used, depending on the medium.
LP
A track on a long playing record (LP) is a segment of the spiral groove recording a single movement, song or other work.
Usually, unrecorded sections of the groove guide the tone arm between consecutive tracks. However occasionally - for example on some language learning records - the tracks are not connected, and the tone arm must be moved manually to the next track's lead-in groove.
Optical disks
A track, session or title on an audiovideo optical disk is a segment recording a single movement, song or other work.
Geometry-based tracks
On some devices a track is defined based on the geometry of the medium, typically running for the full length or circumference.
Linear
On magnetic cards, magnetic strips and tape, tracks normally run the full length of the medium. Some devices record multiple tracks in parallel either to improve speed or to provide separate channels for, e.g., stereophonic sound.
Punched tape
On Punched tape, also known as paper tape, a track runs the length of the tape and all tracks are recorded in parallel. References to the number of tracks sometimes use the word channel or level. Five level tape is used for Baudot, eight-level for ASCII and twelve level for carriage control tapes.
Magnetic tape reels and cartridges
On analog audio tape, a track runs the length of the tape and typically contains a single channel; stereophonic and quadraphonic recording use multiple tracks.
On digital tape, a track runs the length of the tape; typically all tracks are written and read in parallel.
Magnetic cards and strips
On magnetic cards and magnetic strips used as storage media, a track runs the length of the card |
https://en.wikipedia.org/wiki/European%20Processor%20Initiative | The (EPI) is a European processor project to design and build a new family of European low-power processors for supercomputers, Big Data, automotive, and offering high performance on traditional HPC applications and emerging applications such as on machine learning. It is led by a consortium of European companies and universities. The project is divided in multiple phases funded under Specific Grant Agreements. The first grant agreement is implemented under the European Commission program Horizon 2020 (FPA: 800928) in the December 2018 to November 2021 time span. The second agreement will be implemented afterwards under the EuroHPC Joint Undertaking which issued a call answered to in January 2021 by the same consortium (H2020-JTI-EuroHPC-2020-02 FPA in EPI (phase II)).
The processor is a SoC, of RISC technology, implementing microprocessor cores of ARM architecture and accelerators, specialised in matrix calculations and deep learning for artificial intelligence. The processor is designed to be integrated in an exascale supercomputer, but also to be implemented in cars.
Objectives
The aim of the EPI project is to design and build a high-performance, low-power processor, implementing vector instructions and specific accelerators, such as accelerators for AI, with high-bandwidth memory access. The design will be based on the results obtained through an intensive use of simulation, the development of a complete software stack and the use of advanced semiconductor manufacturing technologies. During the development of the processor, a co-design methodology will be implemented to ensure that the processor is suitable for efficiently running many applications and that it is equipped with the appropriate software development tools. The objective of the EPI is to develop European know-how on the design and construction of processors for high-performance computing, allowing Europe technological sovereignty.
Members
EPI is a non-legal entity, a project organized by 30 inst |
https://en.wikipedia.org/wiki/Sourcetrail | Sourcetrail was a FOSS source code explorer that provided interactive dependency graphs and support for multiple programming languages including C, C++, Java and Python.
History
The project was started by Eberhard Gräther after an internship at Google where he worked on Google Chrome, and noticed that he consumed a lot of time (1 month) to implement a simple feature that he expected to be done in 1–2 hours. This was his motivation to develop a tool that helps in understanding the consequences of source code modifications. The project started as a commercial project in 2016 under the name Coati. In November 2019, Sourcetrail was released as open-source software under version three of the GNU General Public License.
The project was discontinued in 2021.
Concept
Most of a programmer's time is invested in reading the source code. Therefore, Sourcetrail is intended to help the developers to understand the source code and the relationship between different components. Sourcetrail builds a dependency graph after indexing the source code files and provides a graphical overview of the source code.
It is built in an extendable way, so it could be extended to support more programming languages.
See also
Software visualization
References
External links
Visualization software
Static program analysis tools
Software metrics
Infographics
Software maintenance
Software development
Software quality
Source code
Discontinued software |
https://en.wikipedia.org/wiki/Dusting%20attack | A dusting attack pr dust attack is an attack on a cryptocurrency wallet that sends tiny amounts of cryptocurrency (known as "dust") to that wallet in order to uncover the identity of the wallet's owner. Information can then be used to obstruct receiving legitimate payments or phishing scams.
Victims are sent a token to their wallet via an airdrop. When the victim attempts to cash out the token, the sender is able to access the wallet through the smart contract attached to the token.
References
Cryptocurrencies |
https://en.wikipedia.org/wiki/Murray%20Eden | Murray Eden (August 17, 1920 – August 9, 2020), was an American physical chemist and academic. He was a professor in electrical engineering, a lecturer, a visiting professor and adjunct professor at institutions including at the Massachusetts Institute of Technology and the National Institutes of Health.
Eden was a pioneer in the field of biomedical engineering and imaging. He was director of the trans-NIH Biomedical Engineering and NIH's Physical Science Program.
The National Institutes of Health stated that "Dr. Murray Eden elevated the NIH Biomedical Engineering and Physical Science Program."
Eden was born in Brooklyn on August 17, 1920, to Russian-Jewish immigrants. His father was president of the Hebrew Teachers Union, and later, Executive Secretary of the Jewish Education Committee in New York City.
Due to the depression, as well as pre-World War II anti-Semitism, the family experienced economic difficulties during his childhood years.
He graduated at 14 from Townsend Harris High School in Manhattan in 1935, attended City College of New York, 1935–39, graduated in 1939. In 1940 he moved to Washington, D.C., as a chemistry major and in 1951 received his Ph.D. in chemistry from the University of Maryland.
Career
During World War II, , as civil service, alongside then student Dick Feynman and others, he worked in the Princeton facility of the Manhattan Project assisting in producing uranium-235.
Between 1949 and 1953, Murray worked at National Cancer Institute.
Between 1959 and 1979, while working in electrical engineering, he has split his groundbreaking body of work between MIT, Harvard Medical School, the NIH and the World Health Organization. He has made independent innovations in computerized tomography while working on pattern recognition, image processing, handwritten generation & analysis, between the early 1960s-1976.
Murray was one four editors of Information and Control from 1961 until 1966 and sole editor-in-chief of the journal from 1967 un |
https://en.wikipedia.org/wiki/Compressometer | A compressometer is a device used to determine the strain or deformation of a specimen while measuring the compressive strength of concrete specimens, generally a cylinder. It can be used for rock, concrete, soils, and other materials. For concrete, the device usually comprises two steel rings for clamping to the specimen and two gauge length bars attached to the ring. When the compressive load is applied, the strain value is registered from the compressometer. Generally, a data logger is used to record the strain.
The stress strain curve is then used to determine the static Young's modulus of elasticity and Poisson's ratio of concrete. ASTM C469 describes about the instrument.
See also
Extensometer
Strain gauge
References
ASTM International C469 Standard Test Method for Static Modulus of Elasticity and Poisson's Ratio of Concrete in Compression
Materials testing
Test equipment
Measuring instruments |
https://en.wikipedia.org/wiki/Online%20chess | Online chess is chess that is played over the Internet, allowing players to play against each other in real time. This is done through the use of Internet chess servers, which often include a system to pair up individual players based on their rating using an Elo or similar chess rating system. Online chess has existed since the 1970s, but has seen a rapid growth in popularity amidst the COVID-19 pandemic and rise of chess livestreaming.
History
Origins
Online chess has existed in various forms including PLATO and play-by-email since the dawn of the Internet in the 1970s. The first Internet server designed for online chess was the Internet Chess Club (known at the time as ICS), which started operation in 1992. The first chess website, which allowed playing through a graphical interface, was Caissa.com (known at the time as Caissa's Web) which launched in 1995. Since then, a number of chess websites have been developed. These include Chess.com, Lichess, and chess24, which are the largest chess websites as of 2021.
Growth
Online chess saw a spike in growth during the quarantines of the COVID-19 pandemic. This was due to both isolation and the popularity of Netflix miniseries The Queen's Gambit, which was released in October 2020. Chess app downloads on the App Store and Google Play Store rose by 63% after the show debuted. Chess.com saw more than twice as many account registrations in November as it had in previous months, and the number of games played monthly on Lichess doubled as well. There was also a demographic shift in players, with female registration on Chess.com shifting from 22% of new players to 27% of new players. Grandmaster Maurice Ashley said "A boom is taking place in chess like we have never seen maybe since the Bobby Fischer days," attributing the growth to an increased desire to do something constructive during the pandemic. USCF Women's Program Director Jennifer Shahade stated that chess works well on the Internet, since pieces do not need to b |
https://en.wikipedia.org/wiki/Dual%20Steenrod%20algebra | In algebraic topology, through an algebraic operation (dualization), there is an associated commutative algebra from the noncommutative Steenrod algebras called the dual Steenrod algebra. This dual algebra has a number of surprising benefits, such as being commutative and provided technical tools for computing the Adams spectral sequence in many cases (such as pg 61-62) with much ease.
Definition
Recallpg 59 that the Steenrod algebra (also denoted ) is a graded noncommutative Hopf algebra which is cocommutative, meaning its comultiplication is cocommutative. This implies if we take the dual Hopf algebra, denoted , or just , then this gives a graded-commutative algebra which has a noncommutative comultiplication. We can summarize this duality through dualizing a commutative diagram of the Steenrod's Hopf algebra structure:If we dualize we get mapsgiving the main structure maps for the dual Hopf algebra. It turns out there's a nice structure theorem for the dual Hopf algebra, separated by whether the prime is or odd.
Case of p=2
In this case, the dual Steenrod algebra is a graded commutative polynomial algebra where the degree . Then, the coproduct map is given bysendingwhere .
General case of p > 2
For all other prime numbers, the dual Steenrod algebra is slightly more complex and involves a graded-commutative exterior algebra in addition to a graded-commutative polynomial algebra. If we let denote an exterior algebra over with generators and , then the dual Steenrod algebra has the presentationwhereIn addition, it has the comultiplication defined bywhere again .
Rest of Hopf algebra structure in both cases
The rest of the Hopf algebra structures can be described exactly the same in both cases. There is both a unit map and counit map which are both isomorphisms in degree : these come from the original Steenrod algebra. In addition, there is also a conjugation map defined recursively by the equationsIn addition, we will denote as the kernel of the co |
https://en.wikipedia.org/wiki/Clubhouse%20%28app%29 | Clubhouse is a social audio app for iOS and Android where users can communicate in audio chat rooms that accommodate groups of thousands of people.
Clubhouse inspired competitor products from Meta, Twitter through Twitter Spaces, and Spotify through a product called Greenroom.
History
Clubhouse began as a social media startup by founders Paul Davison and Rohan Seth in Fall 2019. Originally designed for podcasts under the name Talkshow, the app was rebranded as "Clubhouse" and officially released for the iOS operating system in March 2020. Clubhouse was valued at $100 million after receiving funding from notable angel investors, including Ryan Hoover (Product Hunt), Balaji Srinivasan (Coinbase), James Beshara (Tilt.com), and several venture capitalists, including a $12 million Series A investment from the venture capital firm, Andreessen Horowitz, in May 2020.
The app gained popularity in the early months of the COVID-19 pandemic and had 600,000 registered users by December 2020. In January 2021, CEO Paul Davison announced that the app's active weekly user base consisted of approximately 2 million individuals. The company announced that it would begin working on an Android version of the app. In that month, the app became widely used in Germany when German podcast hosts Philipp Klöckner and Philipp Gloeckler started an invite-chain over a Telegram group, bringing German influencers, journalists, and politicians to the platform. Clubhouse also raised their Series B at a $1 billion valuation.
On February 1, 2021, Clubhouse had an estimated 3.5 million downloads globally and grew rapidly to 8.1 million downloads by February 15. This significant growth in popularity occurred after celebrities such as Elon Musk and Mark Zuckerberg made appearances on the app. In that month, Clubhouse hired an Android Software Developer. A year after the app's release, the number of weekly active users was greater than 10 million, but the user base declined 21% during three weeks from |
https://en.wikipedia.org/wiki/DALL-E | DALL·E (stylized as DALL·E), DALL·E 2, and DALL·E 3 are text-to-image models developed by OpenAI using deep learning methodologies to generate digital images from natural language descriptions, called "prompts". The original DALL·E was revealed by OpenAI in a blog post in January 5, 2021, and uses a version of GPT-3 modified to generate images. In April 6, 2022, OpenAI announced DALL·E 2, a successor designed to generate more realistic images at higher resolutions that "can combine concepts, attributes, and styles". In September 2023, OpenAI announced their latest image model, DALL·E 3, capable of understanding "significantly more nuance and detail" than previous iterations.
On 20 July 2022, DALL·E 2 entered into a beta phase with invitations sent to 1 million waitlisted individuals; users could generate a certain number of images for free every month and may purchase more. Access had previously been restricted to pre-selected users for a research preview due to concerns about ethics and safety. On 28 September 2022, DALL·E 2 was opened to everyone and the waitlist requirement was removed.
In early November 2022, OpenAI released DALL·E 2 as an API, allowing developers to integrate the model into their own applications. Microsoft unveiled their implementation of DALL·E 2 in their Designer app and Image Creator tool included in Bing and Microsoft Edge. The API operates on a cost per image basis, with prices varying depending on image resolution. Volume discounts are available to companies working with OpenAI’s enterprise team.
DALL·E 3 was released natively into ChatGPT for ChatGPT Plus and ChatGPT Enterprise customers in October 2023, with availability via OpenAI's API and "Labs" platform expected later in the year. Microsoft implemented the model in Bing's Image Creator tool and plans to implement it into their Designer app.
The software's name is a portmanteau of the names of animated robot Pixar character WALL-E and the Spanish surrealist artist Salvador Dalí. |
https://en.wikipedia.org/wiki/Neural%20network%20quantum%20states | Neural Network Quantum States (NQS or NNQS) is a general class of variational quantum states parameterized in terms of an artificial neural network. It was first introduced in 2017 by the physicists Giuseppe Carleo and Matthias Troyer to approximate wave functions of many-body quantum systems.
Given a many-body quantum state comprising degrees of freedom and a choice of associated quantum numbers , then an NQS parameterizes the wave-function amplitudes
where is an artificial neural network of parameters (weights) , input variables () and one complex-valued output corresponding to the wave-function amplitude.
This variational form is used in conjunction with specific stochastic learning approaches to approximate quantum states of interest.
Learning the Ground-State Wave Function
One common application of NQS is to find an approximate representation of the ground state wave function of a given Hamiltonian . The learning procedure in this case consists in finding the best neural-network weights that minimize the variational energy
Since, for a general artificial neural network, computing the expectation value is an exponentially costly operation in , stochastic techniques based, for example, on the Monte Carlo method are used to estimate , analogously to what is done in Variational Monte Carlo, see for example for a review. More specifically, a set of samples , with , is generated such that they are uniformly distributed according to the Born probability density . Then it can be shown that the sample mean of the so-called "local energy" is a statistical estimate of the quantum expectation value , i.e.
Similarly, it can be shown that the gradient of the energy with respect to the network weights is also approximated by a sample mean
where and can be efficiently computed, in deep networks through backpropagation.
The stochastic approximation of the gradients is then used to minimize the energy typically using a stochastic gradient descent approach. |
https://en.wikipedia.org/wiki/Doubly%20triangular%20number | In mathematics, the doubly triangular numbers are the numbers that appear within the sequence of triangular numbers, in positions that are also triangular numbers. That is, if denotes the th triangular number, then the doubly triangular numbers are the numbers of the form .
Sequence and formula
The doubly triangular numbers form the sequence
0, 1, 6, 21, 55, 120, 231, 406, 666, 1035, 1540, 2211, ...
The th doubly triangular number is given by the quartic formula
The sums of row sums of Floyd's triangle give the doubly triangular numbers.
Another way of expressing this fact is that the sum of all of the numbers in the first rows of Floyd's triangle is the th doubly triangular number.
In combinatorial enumeration
Doubly triangular numbers arise naturally as numbers of of objects, including pairs where both objects are the same:
An example from mathematical chemistry is given by the numbers of overlap integrals between Slater-type orbitals.
Another example of this phenomenon from combinatorics is that the doubly-triangular numbers count the number of two-edge undirected multigraphs on labeled vertices. In this setting, an edge is an unordered pair of vertices, and a two-edge graph is an unordered pair of edges. The number of possible edges is a triangular number, and the number of pairs of edges (allowing both edges to connect the same two vertices) is a doubly triangular number.
In the same way, the doubly triangular numbers also count the number of distinct ways of coloring the four corners or the four edges of a square with colors, allowing some colors to be unused and counting two colorings as being the same when they differ from each other only by rotation or reflection of the square. The number of choices of colors for any two opposite features of the square is a triangular number, and a coloring of the whole square combines two of these colorings of pairs of opposite features.
When pairs with both objects the same are excluded, a different sequence ari |
https://en.wikipedia.org/wiki/DEC%20MICA | MICA was the codename of the operating system developed for the DEC PRISM architecture. MICA was designed by a team at Digital Equipment Corporation led by Dave Cutler. MICA's design was driven by Digital's need to provide a migration path to PRISM for Digital's VAX/VMS customers, as well as allowing PRISM systems to compete in the increasingly important Unix market. MICA attempted to address these requirements by implementing VMS and ULTRIX user interfaces on top of a common kernel that could support the system calls (or "system services" in VMS parlance), libraries and utilities needed for both environments.
MICA was cancelled in 1988 along with the PRISM architecture, before either project was complete. MICA is most notable for inspiring the design of Windows NT. When the PRISM architecture evolved into the DEC Alpha architecture, Digital opted to port OSF/1 and VMS to Alpha instead of reusing MICA.
Design goals
The original goal for MICA was that all applications would have full and interchangeable access to both the VMS and ULTRIX interfaces, and that a user could choose to log in to an ULTRIX or VMS environment, and run any MICA application from either environment. However, it proved to be impossible to provide both full ULTRIX and full VMS compatibility to the same application at the same time, and Digital scrapped this plan in favour of having a separate Unix operating system based on OSF/1 (this was variously referred to as PRISM ULTRIX or OZIX). As a result, MICA would have served as a portable implementation of a VMS-like operating system, with compatible implementations of DCL, RMS, Files-11, VAXclusters, and the VAX/VMS RTLs and system services. Proposals were made for reinstating Unix compatibility in MICA on a per-application basis so that a MICA application could be compiled and linked against the VMS interfaces, or the ULTRIX interfaces, but not both simultaneously.
Due to scheduling concerns, the first PRISM systems would have been delivered wi |
https://en.wikipedia.org/wiki/Adams%20resolution | In mathematics, specifically algebraic topology, there is a resolution analogous to free resolutions of spectra yielding a tool for constructing the Adams spectral sequence. Essentially, the idea is to take a connective spectrum of finite type and iteratively resolve with other spectra that are in the homotopy kernel of a map resolving the cohomology classes in using Eilenberg–MacLane spectra.
This construction can be generalized using a spectrum , such as the Brown–Peterson spectrum , or the complex cobordism spectrum , and is used in the construction of the Adams–Novikov spectral sequencepg 49.
Construction
The mod Adams resolution for a spectrum is a certain "chain-complex" of spectra induced from recursively looking at the fibers of maps into generalized Eilenberg–Maclane spectra giving generators for the cohomology of resolved spectrapg 43. By this, we start by considering the mapwhere is an Eilenberg–Maclane spectrum representing the generators of , so it is of the formwhere indexes a basis of , and the map comes from the properties of Eilenberg–Maclane spectra. Then, we can take the homotopy fiber of this map (which acts as a homotopy kernel) to get a space . Note, we now set and . Then, we can form a commutative diagramwhere the horizontal map is the fiber map. Recursively iterating through this construction yields a commutative diagramgiving the collection . This meansis the homotopy fiber of and comes from the universal properties of the homotopy fiber.
Resolution of cohomology of a spectrum
Now, we can use the Adams resolution to construct a free -resolution of the cohomology of a spectrum . From the Adams resolution, there are short exact sequenceswhich can be strung together to form a long exact sequencegiving a free resolution of as an -module.
E*-Adams resolution
Because there are technical difficulties with studying the cohomology ring in generalpg 280, we restrict to the case of considering the homology coalgebra (of co-operatio |
https://en.wikipedia.org/wiki/Imo.im | imo is a proprietary audio/video calling and instant messaging software service. It allows sending music, video, PDFs and other files, along with various free stickers. It supports encrypted group video and voice calls with up to 20 participants. According to its developer, the service possesses over 200 million users and over 50 million messages per day are sent through it.
History
The product was created as a web-based application in 2005 for accessing multiple chat platforms, including Facebook Messenger, Google Talk, Yahoo! Messenger, and Skype chat. It was developed by PageBites, and required one's phone number to verify the users' account. In March 2014, support for all third-party messaging networks ended.
In January 2018, the app reached 500 million installs.
imo.im has implemented end-to-end encryption for its chats and calls, ensuring that the conversations remain private between the sender and receiver.
See also
List of social platforms with at least 100 million active users
References
External links
Mobile applications
Android (operating system) software
IOS software
Windows instant messaging clients
Cross-platform software
Instant messaging clients
Social media
2007 software |
https://en.wikipedia.org/wiki/Adrian%20Constantin | Adrian Constantin (born 22 April 1970) is a Romanian-Austrian mathematician who does research in the field of nonlinear partial differential equations. He is a professor at the University of Vienna and has made groundbreaking contributions to the mathematics of wave propagation. He is listed as an ISI Highly Cited Researcher with more than 160 publications and 11000 citations.
Life and career
Adrian Constantin was born in Timișoara, Romania, where he studied at the Nikolaus Lenau High School. He was later educated at the University of Nice Sophia Antipolis (BSc 1991, MSc 1992) and at New York University (NYU), where he got his PhD in 1996 under Henry McKean with the thesis "The Periodic Problem for the Camassa–Holm equation." He did post-doctoral work at the University of Basel and at the University of Zurich.
After a short period as a lecturer at the University of Newcastle upon Tyne, he became a professor at the University of Lund in 2000, and then was Erasmus Smith's Professor of Mathematics at Trinity College Dublin (TCD) from 2004 to 2008, and was made a fellow in 2005. Since then he has been university professor for partial differential equations at the University of Vienna, and he has also had a chair at King's College London.
Constantin specializes in the role of mathematics in geophysics using nonlinear partial differential equations to mathematically model currents and waves in the oceans and in the atmosphere. These flows and waves play an important role in the El Niño climate phenomenon and in natural disasters such as tsunamis. His approach takes into account the fact that the surface of the earth is curved and the importance of the Coriolis force.
Awards and honors
2000: Highly Cited Researcher with more than 160 publications and 11000 citations
2005: Göran Gustafsson Prize from the Royal Swedish Academy of Sciences
2007: Friedrich Wilhelm Bessel Research Prize from the Alexander von Humboldt Foundation
2009: Fluid Dynamics Research Prize from |
https://en.wikipedia.org/wiki/Convergence%20research | Convergence research aims to solve complex problems employing transdisciplinarity. While academic disciplines are useful for identifying and conveying coherent bodies of knowledge, some problems require collaboration among disciplines, including both enhanced understanding of scientific phenomena as well as resolving social issues. The two defining characteristics of convergence research include: 1) the nature of the problem, and 2) the collaboration among disciplines.
Definition
In 2016, convergence research was identified by the National Science Foundation as one of 10 Big Idea's for future investments. As defined by NSF, convergence research has two primary characteristics, namely:
"Research driven by a specific and compelling problem. Convergence research is generally inspired by the need to address a specific challenge or opportunity, whether it arises from deep scientific questions or pressing societal needs.
Deep integration across disciplines. As experts from different disciplines pursue common research challenges, their knowledge, theories, methods, data, research communities and languages become increasingly intermingled or integrated. New frameworks, paradigms or even disciplines can form sustained interactions across multiple communities."
Examples of convergence research
Biomedicine
Advancing healthcare and promoting wellness to the point of providing personalized medicine will increase health and reduce costs for everyone. While recognizing the potential benefits of personalized medicine, critics cite the importance of maintaining investments in public health as highlighted by the approaches to combat the COVID-19 pandemic.
Cyber-physical systems
The internet of things allows all people, machines, and infrastructure to be monitored, maintained, and operated in real-time, everywhere. Because the United States Government is one of the largest user of "things", cybersecurity is critical to any effective system.
STEMpathy
Jobs that utilize skil |
https://en.wikipedia.org/wiki/H-object | In mathematics, specifically homotopical algebra, an H-object is a categorical generalization of an H-space, which can be defined in any category with a product and an initial object . These are useful constructions because they help export some of the ideas from algebraic topology and homotopy theory into other domains, such as in commutative algebra and algebraic geometry.
Definition
In a category with a product and initial object , an H-object is an object together with an operation called multiplication together with a two sided identity. If we denote , the structure of an H-object implies there are mapswhich have the commutation relations
Examples
Magmas
All magmas with units are secretly H-objects in the category .
H-spaces
Another example of H-objects are H-spaces in the homotopy category of topological spaces .
H-objects in homotopical algebra
In homotopical algebra, one class of H-objects considered were by Quillen while constructing André–Quillen cohomology for commutative rings. For this section, let all algebras be commutative, associative, and unital. If we let be a commutative ring, and let be the undercategory of such algebras over (meaning -algebras), and set be the associatived overcategory of objects in , then an H-object in this category is an algebra of the form where is a -module. These algebras have the addition and multiplication operationsNote that the multiplication map given above gives the H-object structure . Notice that in addition we have the other two structure maps given bygiving the full H-object structure. Interestingly, these objects have the following property:giving an isomorphism between the -derivations of to and morphisms from to the H-object . In fact, this implies is an abelian group object in the category since it gives a contravariant functor with values in Abelian groups.
See also
André–Quillen cohomology
Cotangent complex
H-space
References
Category theory
Homotopical algebra |
https://en.wikipedia.org/wiki/Gap%20surface%20plasmon | A gap surface plasmon (or gap plasmon) is a guided electromagnetic wave which propagates in a transparent medium located between two extremely close metallic regions. Propagating in a gap between metals forces light to propagate partially inside the metallic regions, causing the gap plasmon to slow down.
The velocity of the gap-plasmon can be modulated by changing the thickness of the gap even by a few nanometers.
A gap-plasmon is a guided mode, a solution of Maxwell's equations without source. It is the form under which light propagates inside an extremely thin gap between two metals (having the same nature or not). As a gap plasmon, the electromagnetic wave can propagate up to four to five times slower than in vacuum. Such a guided mode only exists for parallel to the interface magnetic fields (p polarization). The distance between the metallic area has to be typically smaller than 50 nm in order to noticeably slow the guided mode. Actually, the GAP plasmon propagates partially inside the metal : the field of the GAP plasmon penetrates the metal to a depth of typically 25 nm, called the skin depth. A slow guided mode presents a short effective wavelength and so a very large wave vector (noted kx when the wave propagates along an Ox axis). As the thickness of the dielectric region decreases, the gap-plasmon is slowed by the metal and its effective index (as well as its wavevector) increases, while its effective wavelength shrinks.
Devices based on gap-plasmon, such as resonators, present a typical size which is of the order of the effective wavelength. Gap-plasmon resonators have in general a reduced size compared to the wavelength of light in vacuum. Such a miniaturization is particularly sought after in plasmonics.
Applications
Gap plasmon resonators :
They can be obtained by self-assembly of chemically synthesized nanocubes or by lithography. A GAP plasmon resonator is a cavity for the guided mode : the wave is reflected back and forth inside the resona |
https://en.wikipedia.org/wiki/EyeHarp | The EyeHarp is an electronic musical instrument controlled by the player's eye or head movements. It combines eye tracking hardware and specially designed software, which has one component for defining chords and arpeggios, and another to change those definitions and play melodies. People with severely impaired motor function can use this instrument to play music or as an aid to learning or composition.
History
The idea for the EyeHarp was born in 2010 when a friend of musician and computer scientist Zacharias Vamvakousis was involved in a serious motorcycle accident which left him quadriplegic. Vamvakousis noticed a distinct lack of accessible musical instruments for people with disabilities, so began designing the EyeHarp to create opportunities for people with physical disabilities to make music. The development of the EyeHarp started in 2011 in Barcelona under the auspices of Pompeu Fabra University.
In 2019, Vamvakousis founded the EyeHarp association, a non-profit organisation which works to give people with disabilities access to cheap musical education and assistive technology.
See also
Disability in the arts
References
External links
The EyeHarp as covered by ERT, Greece's public broadcaster
The EyeHarp Organisation
The EyeHarp at Pompeu Fabra University
Electronic musical instruments
Electronic
Audio engineering |
https://en.wikipedia.org/wiki/Alexander%E2%80%93Hirschowitz%20theorem | The Alexander–Hirschowitz theorem shows that a specific collection of double points in the will impose independent types of conditions on homogenous polynomials and the hypersurface of with many known lists of exceptions. In which case, the classic polynomial interpolation that is located in several variables can be generalized to points that have larger multiplicities.
References
Mathematical theorems |
https://en.wikipedia.org/wiki/NFL%20on%20Nickelodeon | The NFL on Nickelodeon is the branding used for broadcasts of National Football League (NFL) games that are produced by CBS Sports, and broadcast on the American pay television channel Nickelodeon. In 2021, Nickelodeon hosted a one-time simulcast in coordination with CBS of the Chicago Bears–New Orleans Saints Wild Card game. This marked the first time that a major live sporting event would be broadcast on the channel. Following positive reception from media and fans, Nickelodeon announced that the simulcast would return for a Wild Card game during the 2021–22 NFL playoffs between the San Francisco 49ers and Dallas Cowboys. In May 2022, Nickelodeon announced that the simulcast would return for a Christmas game during the 2022 NFL season between the Denver Broncos and Los Angeles Rams. In May 2023, Nickelodeon announced that the simulcast would return for a second consecutive Christmas game during the 2023 NFL season between the Las Vegas Raiders and Kansas City Chiefs.
In August 2023, CBS announced that it will carry Super Bowl LVIII on Nickelodeon in the same format, marking the first time that a Super Bowl game will feature an alternate broadcast.
Background
In December 2019, Viacom re-merged with CBS Corporation to form ViacomCBS. To capitalize on the re-merger, CBS announced plans to add content from Nickelodeon to its CBS All Access streaming service. Additionally, the National Football League announced that Nickelodeon would air a youth-specific broadcast of an early 2021 Wild Card playoff game that CBS Sports acquired the rights to, marking the first major live sporting event on the channel. The idea for Nickelodeon to televise an NFL game was that of CBS Sports' chairman Sean McManus. McManus brought the idea up to the league, which was looking to reach younger and diverse audiences. While the network has aired sports-related programming in the past (such as its athletics game show Nickelodeon Guts, and its Kids' Choice Sports awards), this marked the fi |
https://en.wikipedia.org/wiki/Maxwell%E2%80%93Fricke%20equation | The Maxwell–Fricke equation relates the resistivity of blood to hematocrit. This relationship has been shown to hold for humans, and a variety on non-human warm-blooded species, including canines.
Equation
The Maxwell–Fricke equation is written as:
where ρ is the resistivity of blood, ρ1 is the resistivity of plasma, ρ2 is the resistivity of blood cells and φ is the hematocrit.
References
Mathematics in medicine |
https://en.wikipedia.org/wiki/Materials%20Project | The Materials Project is an open-access database offering material properties to accelerate the development of technology by predicting how new materials–both real and hypothetical–can be used. The project was established in 2011 with an emphasis on battery research, but includes property calculations for many areas of clean energy systems such as photovoltaics, thermoelectric materials, and catalysts. Most of the known 35,000 molecules and over 130,000 inorganic compounds are included in the database.
Dr. Kristin Persson of Lawrence Berkeley National Laboratory founded and leads the initiative, which uses supercomputers at Berkeley, among other institutions, to run calculations using Density Functional Theory (DFT). Commonly computed values include enthalpy of formation, crystal structure, and band gap. The assembled databases of computed structures and properties is freely available to anyone under a CC 4.0 license and was developed with ease of use in mind. The data have been used to predict new materials that should be synthesizable, and screen existing materials for useful properties.
The project can be traced back to Persson's postdoc research at MIT in 2004, during which she was given access to a supercomputer to do DFT calculations. After joining Berkeley Lab in 2008, Persson received the necessary funding to make the data from her research freely available.
References
Materials science
Internet properties established in 2011
Scientific databases |
https://en.wikipedia.org/wiki/Spatial%20embedding | Spatial embedding is one of feature learning techniques used in spatial analysis where points, lines, polygons or other spatial data types. representing geographic locations are mapped to vectors of real numbers. Conceptually it involves a mathematical embedding from a space with many dimensions per geographic object to a continuous vector space with a much lower dimension.
Such embedding methods allow complex spatial data to be used in neural networks and have been shown to improve performance in spatial analysis tasks
Embedded data types
Geographic data can take many forms: text, images, graphs, trajectories, polygons. Depending on the task, there may be a need to combine multimodal data from different sources. The next section describes examples of different types of data and their uses.
Text
Geolocated posts on social media can be used to acquire a library of documents bound to a given place that can be later transformed to embedded vectors using word embedding techniques.
Image
Satellites and aircraft collect digital spatial data acquired from remotely sensed images which can be used in machine learning. They are sometimes hard to analyse using basic image analysis methods and convolutional neural networks can be used to acquire an embedding of images bound to a given geographical object or a region.
Point
A single point of interest (POI) can be assigned multiple features that can be used in machine learning. These could be demographic, transportation, meteorological, or economic data, for example. When embedding single points, it is common to consider the entire set of available points as nodes in a graph.
Line / multiline
Among other things, motion trajectories are represented as lines (multilines). Individual trajectories are embedded taking into account travel time, distances and also features of points visited along the way. Embedding of trajectories allows to improve performance of such tasks as clustering and also categorization.
Polygon
The |
https://en.wikipedia.org/wiki/Virtual%20influencer | A virtual influencer, at times described as a virtual persona or virtual model, is a computer-generated fictional character that can be used for a variety of marketing-related purposes, but most frequently for social media marketing, in lieu of human "influencers". Most virtual influencers are designed using computer graphics and motion capture technology to resemble real people in realistic situations. Common derivatives of virtual influencers include VTubers, which broadly refer to online entertainers and YouTubers who represent themselves using virtual avatars instead of their physical selves.
History
Virtual influencers are fundamentally synonymous with virtual idols, which originate from Japan's anime and Japanese idol culture that dates back to the 1980s. The first virtual idol created was Lynn Minmay, a fictional singer and main character of the anime television series Super Dimension Fortress Macross (1982) and the animated film adaptation Macross: Do You Remember Love? (1984). Minmay's success led to the production of more Japanese virtual idols, such as EVE from the Japanese cyberpunk anime Megazone 23 (1985), and Sharon Apple in Macross Plus (1994). Virtual idols were not always well received – in 1995, Japanese talent agency Horipro created Kyoko Date, which was inspired by the Macross franchise and dating sim games such as Tokimeki Memorial (1994). Date failed to gain commercial success despite drawing headlines for her debut as a CGI idol, largely due to technical limitations leading to issues such as unnatural movements, an issue also known as the uncanny valley.
Since their inception, many virtual idols created have achieved continual success, with notable names including the Vocaloid singer Hatsune Miku, and the virtual YouTuber Kizuna AI. Technological advancements have also enabled production teams to use artificial intelligence and advanced techniques to customize the personalities and behavior of virtual idols.
Benefits
From a branding pers |
https://en.wikipedia.org/wiki/Shudu%20Gram | Shudu Gram is a computer generated social media personality and model, a "virtual influencer". The character is considered the world's first digital supermodel.
She was created in April 2017 by the fashion photographer Cameron-James Wilson. Her appearance draws largely from the "Princess of South Africa" Barbie doll.
The character has generated controversy as Shudu, depicted as a black woman, was created by a white man.
References
External links
Instagram accounts
Internet culture
Virtual influencers
Fictional characters introduced in 2017 |
https://en.wikipedia.org/wiki/BiP%20%28software%29 | BiP is a freeware instant messaging application developed by Lifecell Ventures Cooperatief U.A., a subsidiary of Turkcell incorporated in the Netherlands. It allows users to send text messages, voice messages and video calling, and it can be downloaded from App Store, Google Play, and Huawei AppGallery. BiP has over 53 million users worldwide, and was first released in 2013.
BiP is a secure, and free communication platform. BiP allows making video and audio call, allow sharing images, videos and location. BiP also include instant translations to 106 languages and exchange rates. President Erdoğan's Communications Office opposed WhatsApp's enforcement of its updated privacy policy and announced that Erdoğan left WhatsApp and opened an account in Telegram and BiP. The Turkish Ministry of National Defense has announced that it will move information groups to BiP for the same reason.
Burak AKINCI is CEO of BiP. The number of download of the app is 80 million globally.
See also
Comparison of instant messaging clients
Comparison of VoIP software
List of most-downloaded Google Play applications
Comparison of user features of messaging platforms
References
Instant messaging clients
Mobile applications
2013 software
Turkish brands
Android (operating system) software
IOS software
Social media
VoIP software
Cross-platform software
Communication software
Software companies of Turkey |
https://en.wikipedia.org/wiki/Toloka | Toloka is a crowdsourcing platform and microtasking project launched by Yandex in 2014 to quickly markup large amounts of data, which are then used for machine learning and improving search algorithms. The proposed tasks are usually simple and do not require any special training from the performer. Most of the tasks are designed to improve algorithms that are used by modern technologies spanning self-driving vehicles, smart web searches, advanced voice assistants and e-commerce. Upon completion of each task the performer receives a reward based on the volume of images, videos, and unstructured text. The service has two app versions – for Android and iOS.
About Toloka
Origin of the platform's name
A toloka used to be a form of mutual assistance among villagers of Russia, Ukraine, Belarus, Estonia, Latvia, and Lithuania. It was organized in villages to perform urgent work requiring a large number of workers, such as harvesting, logging, building houses, etc. Sometimes a toloka was used for community works (building churches, schools, roads, etc.).
Types of tasks and scope of results
Data labeling helps to improve search quality and effectively tune result ranking algorithms of search engine.
Machine learning
To train machine learning algorithm requires labeling of large volumes with positive and negative examples of data. Toloka performers receive tasks to determine the presence or absence of objects defined by a computer in a content item. In tasks of another type, a context of the dialogue is given and a scale is proposed by which it is necessary to assess whether a chatbot's answer in this context is appropriate, interesting, and so on. Another group of tasks in Toloka is translation verification performed by collecting examples of translations from different performers.
Audit and marketing research
Checking the quality of the online store, delivery service, writing reviews about products and services. Such audits allow to control the quality of the servic |
https://en.wikipedia.org/wiki/Picfair | Picfair is an online photography brand and ecommerce platform that helps amateur and professional photographers sell their work through personal online stores and a central marketplace. It was founded in 2013 by former The Guardian and The New York Times journalist Benji Lanyado. It has over 500,000 photographers using the platform.
History
Benji Lanyado quit his job in journalism in order to learn how to code at the General Assembly coding school in London. His first coding project, a streamlined version of Reddit called The Reddit Edit, attracted the attention of Reddit founder Alexis Ohanian. Lanyado pitched the idea of Picfair to Ohanian in a New York City coffee shop and Ohanian went on to invest in the company as part of Picfair's initial seed investment round, which also included Google Ventures partner Tom Hulme and the founders of VoucherCodes.co.uk.
Having built the site himself and launched it in beta in 2013, Lanyado launched Picfair officially in 2014 as an open-to-all marketplace that allowed photographers to upload their images.
By 2016, Picfair had 3 million images on the platform and had developed a curation algorithm that helped high quality images appear at the top of image searches.
The company attracted a further £1.5m in funding in 2017 from The Claverley Group (owners of the Wolverhampton Express & Star), JustPark CEO Anthony Eskinazi and What3Words founder Chris Sheldrick. By then it had 25,000 photographers using the platform.
In 2018, Picfair launched personalised stores in parallel to its central marketplace, giving the 35,000 photographers now using the platform their own stand-alone store to sell digital downloads and prints. This led to a rapid increase in signups to the platform, with its user base growing from 100k photographers to over 500,000 photographers by the end of 2021.
Partnerships and controversy
In 2016, following UK Home Secretary Amber Rudd's suggestion that businesses should declare how many non-UK workers they h |
https://en.wikipedia.org/wiki/Convergence%20space | In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a that satisfies certain properties relating elements of X with the family of filters on X. Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence. Every topological space gives rise to a canonical convergence but there are convergences, known as , that do not arise from any topological space. Examples of convergences that are in general non-topological include convergence in measure and almost everywhere convergence. Many topological properties have generalizations to convergence spaces.
Besides its ability to describe notions of convergence that topologies are unable to, the category of convergence spaces has an important categorical property that the category of topological spaces lacks.
The category of topological spaces is not an exponential category (or equivalently, it is not Cartesian closed) although it is contained in the exponential category of pseudotopological spaces, which is itself a subcategory of the (also exponential) category of convergence spaces.
Definition and notation
Preliminaries and notation
Denote the power set of a set by The or in of a family of subsets is defined as
and similarly the of is
If (resp. ) then is said to be (resp. ) in
For any families and declare that
if and only if for every there exists some such that
or equivalently, if then if and only if The relation defines a preorder on If which by definition means then is said to be and also and is said to be The relation is called . Two families and are called ( ) if and
A is a non-empty subset that is upward closed in closed under finite intersections, and does not have the empty set as an element (i.e. ). A is any family of sets that is equivalent (with respect to subordination) to filter or equivalently, it is |
https://en.wikipedia.org/wiki/Free%20choice%20inference | Free choice is a phenomenon in natural language where a linguistic disjunction appears to receive a logical conjunctive interpretation when it interacts with a modal operator. For example, the following English sentences can be interpreted to mean that the addressee can watch a movie and that they can also play video games, depending on their preference:
You can watch a movie or play video games.
You can watch a movie or you can play video games.
Free choice inferences are a major topic of research in formal semantics and philosophical logic because they are not valid in classical systems of modal logic. If they were valid, then the semantics of natural language would validate the Free Choice Principle.
Free Choice Principle:
This symbolic logic formula above is not valid in classical modal logic: Adding this principle as an axiom to standard modal logics would allow one to conclude from , for any and . This observation is known as the Paradox of Free Choice. To resolve this paradox, some researchers have proposed analyses of free choice within nonclassical frameworks such as dynamic semantics, linear logic, alternative semantics, and inquisitive semantics. Others have proposed ways of deriving free choice inferences as scalar implicatures which arise on the basis of classical lexical entries for disjunction and modality.
Free choice inferences are most widely studied for deontic modals, but also arise with other flavors of modality as well as imperatives, conditionals, and other kinds of operators. Indefinite noun phrases give rise to a similar inference which is also referred to as "free choice" though researchers disagree as to whether it forms a natural class with disjunctive free choice.
See also
Deontic logic
Disjunction
Hans Kamp
Modal logic
Ross's paradox
Simplification of disjunctive antecedents
Sluicing
Notes
Semantics
Deontic logic
Philosophical logic
Mathematical logic
Rules of inference
Formal semantics (natural language) |
https://en.wikipedia.org/wiki/Rolling%20hairpin%20replication | Rolling hairpin replication (RHR) is a unidirectional, strand displacement form of DNA replication used by parvoviruses, a group of viruses that constitute the family Parvoviridae. Parvoviruses have linear, single-stranded DNA (ssDNA) genomes in which the coding portion of the genome is flanked by telomeres at each end that form hairpin loops. During RHR, these hairpin loops repeatedly unfold and refold to change the direction of DNA replication so that replication progresses in a continuous manner back and forth across the genome. RHR is initiated and terminated by an endonuclease encoded by parvoviruses that is variously called NS1 or Rep, and RHR is similar to rolling circle replication, which is used by ssDNA viruses that have circular genomes.
Before RHR begins, a host cell DNA polymerase converts the genome to a duplex form in which the coding portion is double-stranded and connected to the terminal hairpins. From there, messenger RNA (mRNA) that encodes the viral initiator protein is transcribed and translated to synthesize the protein. The initiator protein commences RHR by binding to and nicking the genome in a region adjacent to a hairpin called the origin and establishing a replication fork with its helicase activity. Nicking leads to the hairpin unfolding into a linear, extended form. The telomere is then replicated and both strands of the telomere refold back in on themselves to their original turn-around forms. This repositions the replication fork to switch templates to the other strand and move in the opposite direction. Upon reaching the other end, the same process of unfolding, replication, and refolding occurs.
Parvoviruses vary in whether both hairpins are the same or different. Homotelomeric parvoviruses such as adeno-associated viruses (AAV), i.e. those that have identical or similar telomeres, have both ends replicated by terminal resolution, the previously described process. Heterotelomeric parvoviruses such as minute virus of mice (MVM), i |
https://en.wikipedia.org/wiki/Ellipsoid%20packing | In geometry, ellipsoid packing is the problem of arranging identical ellipsoid throughout three-dimensional space to fill the maximum possible fraction of space.
The currently densest known packing structure for ellipsoid has two candidates,
a simple monoclinic crystal with two ellipsoids of different orientations and
a square-triangle crystal containing 24 ellipsoids in the fundamental cell. The former monoclinic structure can reach a maximum packing fraction around for ellipsoids with maximal aspect ratios larger than . The packing fraction of the square-triangle crystal exceeds that of the monoclinic crystal for specific biaxial ellipsoids, like ellipsoids with ratios of the axes and . Any ellipsoids with aspect ratios larger than one can pack denser than spheres.
See also
Packing problems
Sphere packing
Tetrahedron packing
References
Packing problems |
https://en.wikipedia.org/wiki/Mobile%20driver%27s%20license | A mobile driving licence (also mobile driver's license or mDL) is a mobile app that replaces a physical driver's license. An International Organization for Standardization (ISO) standard for the mobile driving licence (ISO 18013-5) was approved on August 18, 2021 and published on 30 September 2021.
History
The first instance of an electronic driver's license was deployed in Mexico as early as 2007, using the Gemalto smart-card platform. In 2016, the U.S. National Institute of Standards and Technology (NIST) partnered with Gemalto to pilot the "digital driver's license" in Washington D.C., Idaho, Colorado, Maryland and Wyoming.
Colorado was the first state to deploy a production version of a digital license, primarily based on QR codes stored in a digital wallet, which it claims is accepted by police officers throughout the state. After going through the standard process at the state Department of Motor Vehicles, volunteers installed the "DigiDL" app on their phones and then downloaded the license. Volunteers tested the digital driver's license in stores, the Colorado Lottery claim center, and an art fair.
Iceland was the first country in Europe to introduce a digital/mobile driver's licence in July 2020. Icelandic driving licence holders can request a digital version of their licence online by using their electronic ID (Icelandic: rafræn skilríki) and is issued as a .pkpass file loaded into the Wallet app on iPhone or a third-party app on Android. Digital driving licences display the same information as a physical licence, along with a barcode (renewed regularly by the server, acting as verification). Commercial establishments (e.g. for proof of age) can use the island.is app to verify barcodes. The licences are equally valid as official ID, even for voting, however only within Iceland. The implementation does not conform to the ISO 18013-45 standard. As of August 2022, 60% of driver's licences have been issued in digital/mobile form.
In November 2020, Denmark |
https://en.wikipedia.org/wiki/Monogenic%20function | A monogenic function is a complex function with a single finite derivative.
More precisely, a function defined on is called monogenic at , if exists and is finite, with:
Alternatively, it can be defined as the above limit having the same value for all paths. Functions can either have a single derivative (monogenic) or infinitely many derivatives (polygenic), with no intermediate cases. Furthermore, a function which is monogenic , is said to be monogenic on , and if is a domain of , then it is analytic as well (The notion of domains can also be generalized in a manner such that functions which are monogenic over non-connected subsets of , can show a weakened form of analyticity)
References
Mathematical analysis
Functions and mappings |
https://en.wikipedia.org/wiki/Guillotine%20partition | Guillotine partition is the process of partitioning a rectilinear polygon, possibly containing some holes, into rectangles, using only guillotine-cuts. A guillotine-cut (also called an edge-to-edge cut) is a straight bisecting line going from one edge of an existing polygon to the opposite edge, similarly to a paper guillotine.
Guillotine partition is particularly common in designing floorplans in microelectronics. An alternative term for a guillotine-partition in this context is a slicing partition or a slicing floorplan. Guillotine partitions are also the underlying structure of binary space partitions. There are various optimization problems related to guillotine partition, such as: minimizing the number of rectangles or the total length of cuts. These are variants of polygon partitioning problems, where the cuts are constrained to be guillotine cuts.
A related but different problem is guillotine cutting. In that problem, the original sheet is a plain rectangle without holes. The challenge comes from the fact that the dimensions of the small rectangles are fixed in advance. The optimization goals are usually to maximize the area of the produced rectangles or their value, or minimize the waste or the number of required sheets.
Computing a guillotine partition with a smallest edge-length
In the minimum edge-length rectangular-partition problem, the goal is to partition the original rectilinear polygon into rectangles, such that the total edge length is a minimum.
This problem can be solved in time even if the raw polygon has holes. The algorithm uses dynamic programming based on the following observation: there exists a minimum-length guillotine rectangular partition in which every maximal line segment contains a vertex of the boundary. Therefore, in each iteration, there are possible choices for the next guillotine cut, and there are altogether subproblems.
In the special case in which all holes are degenerate (single points), the minimum-length guillotin |
https://en.wikipedia.org/wiki/Counting%20on%20Frameworks | Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures is an undergraduate-level book on the mathematics of structural rigidity. It was written by Jack E. Graver and published in 2001 by the Mathematical Association of America as volume 25 of the Dolciani Mathematical Expositions book series. The Basic Library List Committee of the Mathematical Association of America has recommended its inclusion by undergraduate mathematics libraries.
Topics
The problems considered by Counting on Frameworks primarily concern systems of rigid rods, connected to each other by flexible joints at their ends; the question is whether these connections fix such a framework into a single position, or whether it can flex continuously through multiple positions. Variations of this problem include the simplest way to add rods to a framework to make it rigid, or the resilience of a framework against the failure of one of its rods.
To study this question, Graver has organized Counting on Frameworks into four chapters. The first chapter studies square grids and methods of cross bracing the grid to make it rigid, as a way of introducing the notion of the degrees of freedom of a mechanical system. The second chapter provides an introduction to graph theory, the one-dimensional theory of rigidity through the analysis of the connected components of graphs, and a reformulation of the grid bracing problem in terms of connectivity of an associated bipartite graph. Chapter three concerns two-dimensional rigidity, the concepts of infinitesimal and generic rigidity, the combinatorial and algorithmic aspects of the subject, and the obstacles to extending this theory to three dimensions. A final chapter describes the history of rigidity theory, applications including mechanical linkages, geodesic domes, tensegrity, the rigidity of molecules in chemistry, and even art. It also discusses open problems for research in this area.
Audience and reception
Counting on Frameworks expects its |
https://en.wikipedia.org/wiki/Wimkin | Wimkin is an alt-tech social network that claims to promote free speech. The site describes itself as "100% uncensored social media". Wimkin was launched in August 2020 and was founded by Jason Sheppard.
As of January 2021, Wimkin had 300,000 users.
History
Wimkin launched in August 2020 after being founded by Jason Sheppard.
On January 12, 2021, Apple removed Wimkin from the Apple App Store for hosting violent content, including calls for a civil war and the arrest of then-Vice President Mike Pence. Sheppard stated that Wimkin had removed the violent content after Apple reported it to them. However, Apple claimed that they "continued to find direct threats of violence and calls to incite lawless action" on Wimkin. After Wimkin was removed from the App Store, Wimkin's website was hit with a DDoS attack.
Google subsequently removed Wimkin from the Google Play Store, with a Google spokesperson saying of the ban that, "We don't allow apps that depict or facilitate gratuitous violence or other dangerous activities." In response, Sheppard accused Google of treating Wimkin unfairly, stating in an email that, "We're being treated entirely unfairly and if we aren't reinstated when we've worked tirelessly to comply and become a better platform, we will be seeking legal remedy to at the very least, shed some light into this tyrannical monopoly."
In a message on Wimkin's website following the removals, the company said that "We are working on getting back in both Apple Store and Google Play." Wimkin has since returned to both the App Store and Google Play.
After Parler, another social network, was pulled offline by its host Amazon Web Services on January 11, former users of that site started migrating to Wimkin. In the twelve days following the storming of the United States Capitol, Wimkin claimed that its userbase had grown by 20 percent, amounting to around 55,000 new users.
Users and content
While Wimkin has groups relating to mundane topics, such as pets and t |
https://en.wikipedia.org/wiki/NE5532 | The NE5532, also sold as SA5532, SE5532 and NG5532 (commonly called just 5532) is a dual monolithic, bipolar, internally compensated operational amplifier (op amp) for audio applications introduced by Signetics in 1979. The 5532 and the contemporary TL072 were the first operational amplifiers that outperformed discrete class A circuits in professional audio applications. Due to low noise and very low distortion, the 5532 became the industry standard for professional audio. According to Douglas Self, "there is probably no music on the planet that has not passed through a hundred or more 5532s on its way to the consumer". The performance of the 5532 remained best in class for almost thirty years, until the introduction of the LM4562 in 2007. As of 2021, the 5532 remains in mass production as a generic product.
Unlike many other low-cost op amps, the 5532 exists only in a dual form, available in 8-pin PDIP, SO and SOIC packages. The single 5534, as well as the discontinued uncompensated dual 5533, is not fully compensated and is thus unstable at unity gain; the 5534 has lower noise density than the 5532 but is otherwise similar.
Construction and operation
The 5532 is fully bipolar, with the exception of a sole JFET within a bias generator. Although the manufacturers did not release a first-hand explanation of its operation, the schematic has been public for decades. The signal path consists of two consecutive differential stages, a single-ended common emitter voltage amplification stage, and a class B push-pull output follower with a current-sensing overload protection. There are four internal compensation capacitors. The distortion "signature" (that is, the virtual absence of it) of the 5532 is defined largely by the three nested frequency compensation loops wrapped around the second and the third stages.
Input requirements
The input stage uses npn transistors, thus the input bias currents flow into their bases, and cause negative voltage drop across the groun |
https://en.wikipedia.org/wiki/Celebrating%20America | Celebrating America is a television special which aired as part of the post-inaugural events following the inauguration of Joe Biden on January 20, 2021. Hosted by actor Tom Hanks and produced by Ricky Kirshner, Glenn Weiss, and Stephanie Cutter, the special featured musical performances and speeches from various Americans, including those from President Joe Biden and Vice President Kamala Harris.
The show was nominated in two Primetime Emmy Awards for Outstanding Variety Special (Live) and Outstanding Music Direction.
Description
Traditional inaugural balls, which often gather hundreds of dignitaries to see the president and extend late into the evening, were not held due to restrictions related to the COVID-19 pandemic. A primetime television special, Celebrating America, aired as a substitute in simulcast across most major television networks and other cable and streaming outlets. Hosted by Tom Hanks, the evening event opened with a performance of "Land of Hope and Dreams" by Bruce Springsteen on the steps of the Lincoln Memorial. Hanks then addressed viewers, emphasizing the "promise of our promised land", and introduced four guests, Kareem Abdul-Jabbar, Dolores Huerta, Brayden Harrington, and Kim Ng who, respectively, recited lines from the inaugural addresses of presidents Abraham Lincoln, Franklin D. Roosevelt, John F. Kennedy, and Ronald Reagan, reflecting on their speeches' emphasis of national unity, confidence, patriotism, and peace.
Anthony Gaskin, a Virginia UPS deliveryman, introduced Jon Bon Jovi, who performed an acoustic rendition of "Here Comes the Sun" by The Beatles. Yo-Yo Ma performed a cello solo sampling "Amazing Grace", "Goin' Home" from Dvořák's 9th symphony, and "Simple Gifts". Biden was then introduced by Hanks to the U.S. Navy Band Brass Ensemble's playing of four ruffles and flourishes and "Hail to the Chief"; he spoke inside the Lincoln Memorial and emphasized the importance of "opportunity, liberty, dignity, and respect". Ant Clemo |
https://en.wikipedia.org/wiki/Data%20Science%20and%20Predictive%20Analytics | The first edition of the textbook Data Science and Predictive Analytics: Biomedical and Health Applications using R, authored by Ivo D. Dinov, was published in August 2018 by Springer. The second edition of the book was printed in 2023.
This textbook covers some of the mathematical foundations, computational techniques, and artificial intelligence approaches used in data science research and applications.
Using the statistical computing platform R and a broad range of biomedical case-studies, the 23 chapters of the book first edition provide explicit examples of importing, exporting, processing, modeling, visualizing, and interpreting large, multivariate, incomplete, heterogeneous, longitudinal, and incomplete datasets (big data).
Structure
First edition table of contents
The first edition of the Data Science and Predictive Analytics (DSPA) textbook is divided into the following 23 chapters, each progressively building on the previous content.
Motivation
Foundations of R
Managing Data in R
Data Visualization
Linear Algebra & Matrix Computing
Dimensionality Reduction
Lazy Learning: Classification Using Nearest Neighbors
Probabilistic Learning: Classification Using Naive Bayes
Decision Tree Divide and Conquer Classification
Forecasting Numeric Data Using Regression Models
Black Box Machine-Learning Methods: Neural Networks and Support Vector Machines
Apriori Association Rules Learning
k-Means Clustering
Model Performance Assessment
Improving Model Performance
Specialized Machine Learning Topics
Variable/Feature Selection
Regularized Linear Modeling and Controlled Variable Selection
Big Longitudinal Data Analysis
Natural Language Processing/Text Mining
Prediction and Internal Statistical Cross Validation
Function Optimization
Deep Learning, Neural Networks
Second edition table of contents
The significantly reorganized revised edition of the book (2023) expands and modernizes the presented mathematical principles, computational methods, d |
https://en.wikipedia.org/wiki/List%20of%20laboratory%20biosecurity%20incidents | This list of laboratory biosecurity incidents includes accidental laboratory-acquired infections and laboratory releases of lethal pathogens, containment failures in or during transport of lethal pathogens, and incidents of exposure of lethal pathogens to laboratory personnel, improper disposal of contaminated waste, and/or the escape of laboratory animals. The list is grouped by the year in which the accident or incident occurred and does not include every reported laboratory-acquired infection.
See also
Biological hazard
Biosafety level
Laboratory safety
List of anthrax outbreaks
Select agent
Cambridge Working Group
External Links
A Review of Laboratory-Acquired Infections in the Asia-Pacific: Understanding Risk and the Need for Improved Biosafety for Veterinary and Zoonotic Diseases
Laboratory-Acquired Infection (LAI) Database
Survey of laboratory-acquired infections around the world in biosafety level 3 and 4 laboratories
References
Biosecurity
Biosecurity incidents
Occupational safety and health |
https://en.wikipedia.org/wiki/HDT%20%28data%20format%29 | HDT (Header, Dictionary, Triples) is a data structure and format for serialization which optimizes data compression while still making the media available for web navigation.
The key elements of the format are the header, the dictionary or associative array, and the semantic triple.
Various research projects have piloted use of the format, including with MapReduce, in comparison with CBOR, and increasing computing efficiency.
References
External links
Data serialization formats |
https://en.wikipedia.org/wiki/Incidence%20and%20Symmetry%20in%20Design%20and%20Architecture | Incidence and Symmetry in Design and Architecture is a book on symmetry, graph theory, and their applications in architecture, aimed at architecture students. It was written by Jenny Baglivo and Jack E. Graver and published in 1983 by Cambridge University Press in their Cambridge Urban and Architectural Studies book series. It won an Alpha Sigma Nu Book Award in 1983, and has been recommended for undergraduate mathematics libraries by the Basic Library List Committee of the Mathematical Association of America.
Topics
Incidence and Symmetry in Design and Architecture is divided into two parts of roughly equal length, each divided into four chapters. The first part, "Incidence", is primarily on graph theory. Its topics include the basic definitions of directed graphs and undirected graphs, homeomorphisms of graphs, Dijkstra's algorithm for the shortest path problem, planar graphs, polyhedral graphs, and Euler's polyhedral formula. This theory is applied to the grid bracing problem in structural rigidity, where the authors derive a novel equivalence between stabilizing a square grid by cross bracing and the strong connectivity augmentation of directed bipartite graphs. Other applications include optimal route design for facilities such as roads and power lines, the connectivity of floor plans of buildings, and the arrangement of building corridors to optimize average distance. This part of the book concludes with a treatment of the classification of two-dimensional topological surfaces.
The second part of the book is "Symmetry". Its first chapter includes the basic definitions of group theory and of a Euclidean plane isometry, and the classification of isometries into translations, rotations, reflections, and glide reflections. The second of its chapters concerns the discrete isometry groups in the plane including the frieze groups and wallpaper groups, and the classification of two-dimensional patterns by their symmetries. Another chapter provides some partial gener |
https://en.wikipedia.org/wiki/Lim%20Hyesook | Lim Hye-sook (; born 1963) is a Korean electronics engineering professor at Ewha Womans University served as Minister of Science and ICT under President Moon Jae-in from May 2021 to 2021. Lim was the first woman to lead the country's science ministry.
Education
Lim earned her bachelor’s and master's degrees in engineering from the Department of Control and Instrumentation at Seoul National University and a Ph.D. in Electrical and Computer Engineering from the University of Texas at Austin.
Career
Before joining academia, Lim worked at Samsung-HP joint venture after finishing her undergraduate studies and Bell Labs and Cisco Systems after her doctorate studies.
Lim began her teaching career at Ewha Womans University in 2002 receiving full tenure in 2011. Lim took various roles at the University serving as the head of its Department of Electronics Engineering from 2005 to 2007, the associate dean of its School of Engineering from 2009 to 2011 and the dean of its College of Engineering from 2018 to 2020. Lim also sat as the Associate VP for academic affairs of the University from 2012 to 2014.
In Moon's press conference shortly after his special address marking his fourth year in office, Moon explained the reason for her nomination that increasing women's workforce participation is one of prominent solutions in nurturing much-needed professionals in innovative economy sectors such as semiconductor, AI and digital economy and he expects Lim to set one of precedents for them.
In 2020, Lim was elected chair of the Institute of Electronics and Information Engineers - the first woman in its over-70-year history.
In May 2021, Lim signed the Artemis Accord on behalf of the Ministry and the government officially joining moon exploration project with nine other countries.
Lim was previously Moon's Chairperson of one of the Ministry's child agencies, the National Research Council of Science and Technology, which oversees 25 government-funded research institutes in the f |
https://en.wikipedia.org/wiki/DDoS-Guard | DDoS-Guard is a Russian Internet infrastructure company which provides DDoS protection and web hosting services. Researchers and journalists have alleged that many of DDoS-Guard's clients are engaged in criminal activity, and investigative reporter Brian Krebs reported in January 2021 that a "vast number" of the websites hosted by DDoS-Guard are "phishing sites and domains tied to cybercrime services or forums online". Some of DDoS-Guard's notable clients have included the Palestinian Islamic militant nationalist movement Hamas, American alt-tech social network Parler, and various groups associated with the Russian state.
Company
DDoS-Guard is based in Russia, as are most of its employees. The service has existed since 2011. The company was first registered in July 2014 in Sevastopol, by Evgeny Marchenko and Dmitry Sabitov, two Russians formerly from Ukraine. The company is incorporated in Scotland as Cognitive Cloud LP and in Belize as DDoS-Guard Corp. The company runs traffic filtering nodes on clusters located in Russia, Germany, the Netherlands, and Japan.
A company with the same name, owned by the same men, had previously existed in Ukraine since 2011, though spokespeople for the company have said this was only an early stage company created while the software was being developed. The spokespeople stated that DDoS-Guard has always been based in Russia, in Rostov-on-Don, although Meduza reported that the office in that city didn't open until 2015. Meduza reported that the company apparently relocated to Russia after Ukrainian national security and cyberpolice officers began investigations into the company due to its choice to host Verified, a forum notorious for platforming credit card scammers. DDoS-Guard has denied knowledge of the investigation.
In 2021, a researcher observed the DDoS-Guard appeared to have no physical presence in Belize and had likely incorporated there to gain access to IP addresses normally only allocated to local entities. Of more tha |
https://en.wikipedia.org/wiki/Centre%20national%20de%20ressources%20textuelles%20et%20lexicales | The (CNRTL) () is a French organisation which publishes linguistic data and information online.
History and description
The CNRTL was created by the management of the department Homme et Société and the management of the scientific information of the CNRS, based on the UMR of the (ATILF) of the Nancy 2 University, which developed the (TLFi). This project is incorporated into the European project CLARIN.
The database is expanded with the help of voluntary sources who wish to make viable and release linguistic content and who accept the charter produced by the CNRTL. If necessary, the CNRTL can contribute to the formatting of the information available online. The contributions are eventually validated by the proofreading committee of the CNRTL and the sources, and then published. The goal is to disseminate the largest possible amount of resources, and for the resources to be as reliable as possible.
The version of the site as it was on 1 January 2008 is the second version. The site can receive more than 500 000 visitors per day.
The site has not been updated since 2012.
External links
Official website (in French)
References
2005 establishments in France
University of Lorraine
Online dictionaries
French-language websites
French websites
Online databases
Scientific agencies of the government of France
French National Centre for Scientific Research |
https://en.wikipedia.org/wiki/Peter%20Ben%20Embarek | Peter Karim Ben Embarek is a Danish food scientist and former program manager at World Health Organization (WHO) specializing in food safety and zoonoses.
Early life and education
Ben Embarek graduated with a master of science in food science and technology and a doctorate in food safety from the Royal Veterinary and Agricultural University in Copenhagen.
Career
Peter Ben Embarek joined the World Health Organization at its Geneva headquarters in 2001. He worked at WHO's China Office and advised the Chinese government on food safety and nutrition issues. Between 2014 and 2017, he managed WHO's MERS-CoV virus Task Force and coordinated the investigation into the animal source of the virus. He is the WHO's top expert on zoonotic diseases. In 2020, he was appointed mission head of the 13 member team of the World Health Organization's investigation into the origins of COVID-19.
On 9 February 2021, at the conclusion of his investigation, Ben Embarek said it was "extremely unlikely" that the virus leaked from a lab in Wuhan; Ben Embarak later noted that Chinese officials pressured him to include this phrase in the report. In a Danish documentary aired on August 12, 2021, Ben Embarak stated: "A lab employee infected in the field while collecting samples in a bat cave — such a scenario belongs both as a lab-leak hypothesis and as our first hypothesis of direct infection from bat to human. We’ve seen that hypothesis as a likely hypothesis".
Awards
Ben Embarek is a fellow of the International Academy of Food Science and Technology under the International Union of Food Science and Technology. He is also the recipient of the 2017 Scientific Spirit Award of the Chinese Institute of Food Science and Technology.
Controversies
In 2023, Ben Embarek was fired from WHO for sexual misconduct after allegations received in 2015 and 2017. Ben Embarek said there was still an “ongoing procedure” and that he had challenged the WHO sanction, which was “not final”. He added an incident |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.