source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Asymmetric%20numeral%20systems | Asymmetric numeral systems (ANS) is a family of entropy encoding methods introduced by Jarosław (Jarek) Duda from Jagiellonian University, used in data compression since 2014 due to improved performance compared to previous methods. ANS combines the compression ratio of arithmetic coding (which uses a nearly accurate probability distribution), with a processing cost similar to that of Huffman coding. In the tabled ANS (tANS) variant, this is achieved by constructing a finite-state machine to operate on a large alphabet without using multiplication.
Among others, ANS is used in the Facebook Zstandard compressor (also used e.g. in Linux kernel, Android operating system, was published as RFC 8478 for MIME and HTTP), Apple LZFSE compressor, Google Draco 3D compressor (used e.g. in Pixar Universal Scene Description format) and PIK image compressor, CRAM DNA compressor from SAMtools utilities,
Dropbox DivANS compressor, Microsoft DirectStorage BCPack texture compressor, and JPEG XL image compressor.
The basic idea is to encode information into a single natural number . In the standard binary number system, we can add a bit of information to by appending at the end of , which gives us . For an entropy coder, this is optimal if . ANS generalizes this process for arbitrary sets of symbols with an accompanying probability distribution . In ANS, if the information from is appended to to result in , then . Equivalently, , where is the number of bits of information stored in the number , and is the number of bits contained in the symbol .
For the encoding rule, the set of natural numbers is split into disjoint subsets corresponding to different symbols like into even and odd numbers, but with densities corresponding to the probability distribution of the symbols to encode. Then to add information from symbol into the information already stored in the current number , we go to number being the position of the -th appearance from the -th subset.
There are alternativ |
https://en.wikipedia.org/wiki/Korovkin%20approximation | In mathematics the Korovkin approximation is a convergence statement in which the approximation of a function is given by a certain sequence of functions. In practice a continuous function can be approximated by polynomials. With Korovkin approximations one comes a convergence for the whole approximation with examination of the convergence of the process at a finite number of functions. The Korovkin approximation is named after Pavel Korovkin.
References
Computational mathematics
Functional analysis |
https://en.wikipedia.org/wiki/Onshape | Onshape is a computer-aided design (CAD) software system, delivered over the Internet via a software as a service (SAAS) model. It makes extensive use of cloud computing, with compute-intensive processing and rendering performed on Internet-based servers, and users are able to interact with the system via a web browser or the iOS and Android apps. As a SAAS system, Onshape upgrades are released directly to the web interface, and the software does not require maintenance work from the user.
Onshape allows teams to collaborate on a single shared design, the same way multiple writers can work together editing a shared document via cloud services. It is primarily focused on mechanical CAD (MCAD) and is used for product and machinery design across many industries, including consumer electronics, mechanical machinery, medical devices, 3D printing, machine parts, and industrial equipment.
Company history
Onshape was developed by a company with the same name. Founded in 2012, Onshape was based in Cambridge, Massachusetts (USA), with offices in Singapore and Pune, India. Its leadership team includes several engineers and executives who originated from SolidWorks, a popular 3D CAD program that runs on Microsoft Windows. Onshape’s co-founders include two former SolidWorks CEOs, Jon Hirschtick and John McEleney.
In November 2012, former SolidWorks CEOs Jon Hirschtick and John McEleney led six co-founders launching Belmont Technology, a placeholder name that was later changed to Onshape. The company’s first round of funding was $9 million from North Bridge Venture Partners and Commonwealth Capital.
In March 2015, Onshape released the public beta version of its cloud CAD software, after pre-production testing with more than a thousand CAD professionals in 52 countries. Included in the beta launch was Onshape for iPhone.
In August 2015, the company released its Onshape for Android app.
In December 2015, Onshape launched its full commercial release. The company also launch |
https://en.wikipedia.org/wiki/Shadertoy | Shadertoy.com is an online community and tool for creating and sharing shaders through WebGL, used for both learning and teaching 3D computer graphics in a web browser.
Overview
Shadertoy.com is an online community and platform for computer graphics professionals, academics and enthusiasts who share, learn and experiment with rendering techniques and procedural art through GLSL code. There are more than 52 thousand public contributions as of mid-2021 coming from thousands of users. WebGL allows Shadertoy to access the compute power of the GPU to generate procedural art, animation, models, lighting, state based logic and sound.
History
Shadertoy.com was created by Pol Jeremias and Inigo Quilez in January 2013 and came online in February the same year.
The roots of the effort are in Inigo's "Shadertoy" section in his computer graphics educational website. With the arrival of the initial WebGL implementation by Mozilla's Firefox in 2009, Quilez created the first online live coding environment and curated repository of procedural shaders. This content was donated by 18 authors from the Demoscene and showcased advanced real-time and interactive animations never seen in the Web before, such as raymarched metaballs, fractals and tunnel effects.
After having worked together in several real-time rendering projects together for years, in December 2012 Quilez and Pol decided to create a new Shadertoy site that would follow the tradition of the original Shadertoy page with its demoscene flavored resource and size constrained real-time graphics content, but would add social and community features and embrace an open-source attitude.
The page came out with the live editor, real-time playback, browsing and searching capabilities, tagging and commenting features. Content wise, Shadertoy provided a fixed and limited set of textures for its users to utilize in creative ways. Over the years Shadertoy added extra features, such as webcam and microphone input support, video, mu |
https://en.wikipedia.org/wiki/Mean%20value%20problem | In mathematics, the mean value problem was posed by Stephen Smale in 1981. This problem is still open in full generality. The problem asks:
For a given complex polynomial of degree and a complex number , is there a critical point of such that
It was proved for . For a polynomial of degree the constant has to be at least from the example , therefore no bound better than can exist.
Partial results
The conjecture is known to hold in special cases; for other cases, the bound on could be improved depending on the degree , although no absolute bound is known that holds for all .
In 1989, Tischler has shown that the conjecture is true for the optimal bound if has only real roots, or if all roots of have the same norm. In 2007, Conte et al. proved that , slightly improving on the bound for fixed . In the same year, Crane has shown that for .
Considering the reverse inequality, Dubinin and Sugawa have proven that (under the same conditions as above) there exists a critical point such that . The problem of optimizing this lower bound is known as the dual mean value problem.
See also
List of unsolved problems in mathematics
Notes
A.The constraint on the degree is used but not explicitly stated in Smale (1981); it is made explicit for example in Conte (2007). The constraint is necessary. Without it, the conjecture would be false: The polynomial f(z) = z does not have any critical points.
References
1981 introductions
Complex numbers
Unsolved problems in mathematics
Conjectures |
https://en.wikipedia.org/wiki/PCem | PCem (short for PC Emulator) is an IBM PC emulator for Windows and Linux that specializes in running old operating systems and software that are designed for IBM PC compatibles. Originally developed as an IBM PC XT emulator, it later added support for other IBM PC compatible computers as well.
A fork known as 86Box is also available, which includes a number of added features, such as support for SCSI and additional boards.
On 14 June 2021, lead developer Sarah Walker announced her departure from the project. A new maintainer, Michael Manley, was appointed on 18 December 2021. During the interim period with no maintainer, the project's forums were closed.
Features
Hardware
PCem is capable of emulating Intel processors (and its respective clones, including AMD, IDT and Cyrix) from Intel 8088 through the Pentium Tillamook MMX/Mobile MMX processors from 1997 until 1999. A recompiler has been added in v10.1, being mandatory for P5 Pentium and Cyrix processors and optional for i486 processors and IDT WinChip processors. Yet a rather fast processor is needed for full emulation speed (such as an Intel Core i5 at 4 GHz). However, the current developer of PCem has a main concern that the recompiler is not fast enough to emulate the Intel Pentium Pro/Pentium II processors yet.
PCem emulates various IBM PC compatible systems/motherboards from 1981 until 1996, this includes almost all IBM PC models (including the IBM PS/1 model 2121 and the IBM PS/2 model 2011), some American Megatrends BIOS clones (from 1989 until 1994), Award BIOS systems (Award 286 clone, Award SiS 496/497 and Award 430VX PCI), and Intel Premiere/PCI and Intel Advanced/EV motherboards. However, unofficial builds of PCem (PCem-X and PCem-unofficial) also supports IBM PC compatible systems/motherboards (from 1996 until 2000) that supports Intel Pentium Pro/Pentium II processors. PCem simulates the BIOS cache, which relies on the processor rather than on system memory.
PCem can emulate different graphic m |
https://en.wikipedia.org/wiki/Growtopia | Growtopia, commonly referred to as GT, is a massively multiplayer online sandbox video game where players can chat, farm, add friends, trade, build worlds, and engage in player versus player combat. The game was initially released on Android in November 2012, and has been released for iOS, Microsoft Windows, and OS X since then. In 2019, it was released on Nintendo Switch, PlayStation 4 and Xbox One. The servers for the console versions were shut down on July 30, 2020.
On February 28, 2017, a Ubisoft acquirement of Growtopia was announced and was completed during Ubisoft's 2016-17 fourth quarter, with the original developers being design and general advisors to the game's continued development. Growtopia utilizes the freemium model.
Gameplay
Gameplay
Growtopia is a 2D massively multiplayer online sandbox video game based around the idea that most of the in-game items can be grown from seeds of trees. The game has no end goals or 100% completion, however, there is an achievement system and quests to complete from non-player characters.
When a new player joins, they are sent to a private world called Tutorial, which teaches them the basics of the game by giving them quests through an item called the Growpedia. The player starts out with two basic tools: a fist for punching and breaking blocks and a wrench for editing block properties, adding players and trading items. Once they have finished the tutorial, they are sent to a world called Start so that they can learn more about the game.
Players can visit other people's worlds or create their own. When a player creates a new world, the world will be procedurally generated. Players can visit other player's world's and be given access if the owner gives them access.
The maximum amount of players in a world is 65 to 100, but the maximum may be changed to improve server performance.
Worlds in Growtopia have the same size, with the exception of some worlds created by the original developers (such as the world Tiny). |
https://en.wikipedia.org/wiki/Louise%20Hay%20Award | The Louise Hay Award is a mathematics award planned in 1990 and first issued in 1991 by the Association for Women in Mathematics in recognition of contributions as a math educator.
The award was created in honor of Louise Hay.
Recipients
The following women have been honored with the Hay Award:
See also
List of mathematics awards
References
Awards of the Mathematical Association of America
Awards and prizes of the Association for Women in Mathematics
Mathematics education awards
1990 establishments in the United States
Awards established in 1990 |
https://en.wikipedia.org/wiki/Ramsay%20grease | Ramsay grease is a vacuum grease, used as a lubrication and a sealant of ground glass joints and cocks on laboratory glassware, e.g. burettes. It is usable to about 10−2 mbar (about 1 Pa) and about 30 °C. Its vapor pressure at 20 °C is about 10−4 mbar (0.01 Pa). It is named after Sir William Ramsay.
Different grades exist (e.g. thick or viscous, soft). The viscous one is used for standard stopcocks and ground joints. The soft grade is for large stopcocks and ground joints, desiccators, and for lower temperature use. Ramsay grease consists of paraffin wax, petroleum jelly, and crude natural rubber, in ratio 1:3:7 to 1:8:16. Due to the rubber content it has less tendency to flow.
One recipe for a grease usable up to 25 °C consists of 6 parts of petroleum jelly, 1 part of paraffin wax, and 6 parts of Pará rubber.
The dropping point of Leybold-brand Ramsay grease is 56 °C; its maximum service temperature is 25-30 °C. Its vapor pressure at 25 °C is 10−7 torr (0.013 mPa), at 38 °C it is 10−4 torr (13 mPa).
An equivalent of Ramsay grease can be made by cooking lanolin with natural rubber extracted from golf balls.
References
Greases
Vacuum systems
Lubricants |
https://en.wikipedia.org/wiki/Free%20Software%20Users%20Group%2C%20Thiruvananthapuram | The origins of the Free software community in Thiruvananthapuram can be traced back to the group of TeX users around the University of Kerala in early 1980s. The community then later named themselves Thiruvananthapuram LUG (Indian Linux Users Group), GNU/Linux Users Group, Thiruvananthapuram and then ultimately Free Software Users Group, Thiruvananthapuram. The community has worked with the government in helping with key Free software initiatives in the government and also in promoting and supporting Free software among the general public. The community has also been instrumental in creating an IT policy favorable to Free software in the state of Kerala.
Main Activities
Free software install fests
One of the organized activities of the community was to organize GNU/Linux install fests in and around the city. These were usually organized in educational institutions or public places where the general public could bring their computers to get a GNU/Linux distribution installed on them. As GNU/Linux distributions became more and more easy to be installed and configured the community has stopped organizing these.
Developer camps
The group has also worked with SMC in organizing developer camps in Thiruvananthapuram and outside. During developer camps developers are given hands-on experience in working with Free software tools and primarily around localization initiatives which SMC is involved with.
Software / Hardware Freedom Day
The Free software community in Thiruvananthapuram has also been involved in organizing Software Freedom Day celebrations and Hardware Freedom Day celebrations in the city.
Free software release parties
The community has also organized release parties to celebrate the release of the different Free software like Ubuntu, Firefox etc.
Key Initiatives
Free software install fest at Technopark
One of the first large-scale events organized by the community was a week long Free Software Install Fest at Technopark, Thiruvananthapuram organized |
https://en.wikipedia.org/wiki/Cellular%20agriculture | Cellular agriculture focuses on the production of agricultural products from cell cultures using a combination of biotechnology, tissue engineering, molecular biology, and synthetic biology to create and design new methods of producing proteins, fats, and tissues that would otherwise come from traditional agriculture. Most of the industry is focused on animal products such as meat, milk, and eggs, produced in cell culture rather than raising and slaughtering farmed livestock which is associated with substantial global problems of detrimental environmental impacts (e.g. of meat production), animal welfare, food security and human health. Cellular agriculture is a field of the biobased economy. The most well known cellular agriculture concept is cultured meat.
History
Although cellular agriculture is a nascent scientific discipline, cellular agriculture products were first commercialized in the early 20th century with insulin and rennet.
On March 24, 1990, the FDA approved a bacterium that had been genetically engineered to produce rennet, making it the first genetically engineered product for food. Rennet is a mixture of enzymes that turns milk into curds and whey in cheese making. Traditionally, rennet is extracted from the inner lining of the fourth stomach of calves. Today, cheese making processes use rennet enzymes from genetically engineered bacteria, fungi, or yeasts because they are unadulterated, more consistent, and less expensive than animal-derived rennet.
In 2004, Jason Matheny founded New Harvest, whose mission is to "accelerate breakthroughs in cellular agriculture". New Harvest is the only organization focused exclusively on advancing the field of cellular agriculture and provided the first PhD funding specifically for cellular agriculture, at Tufts University.
By 2014, IndieBio, a synthetic biology accelerator in San Francisco, has incubated several cellular agriculture startups, hosting Muufri (making milk from cell culture, now Perfect Day Fo |
https://en.wikipedia.org/wiki/Google%20Cloud%20Datastore | Google Cloud Datastore (Cloud Datastore) is a highly scalable, fully managed NoSQL database service offered by Google on the Google Cloud Platform. Cloud Datastore is built upon Google's Bigtable and Megastore technology. Google Cloud Datastore allows the user to create databases either in Native or Datastore Mode. Native Mode is designed for mobile and web apps, while Datastore Mode is designed for new server projects.
History
Originally released as a feature in Google App Engine in 2008, Cloud Datastore was announced as a standalone product in 2013 during Google I/O. In 2018 at the Google Cloud Next conference, the second-generation Firestore database was opened to general availability, with a backward-compatibility mode. Google provides a path for automatically upgrading a legacy Datastore database to Firestore in Datastore mode.
GQL
Google Cloud Datastore database has a SQL-like syntax called "GQL" (Google Query Language). GQL does not support the Join statement. Instead, one-to-many and many-to-many relationships can be accomplished using ReferenceProperty(). This shared-nothing approach allows disks to fail without the system failing. Switching from a relational database to Cloud Datastore requires a paradigm shift for developers when modeling their data.
See also
Azure Cosmos DB
Amazon DynamoDB
Oracle Cloud NoSQL DB
References
External links
Official website
Google Cloud Platform site
Cloud Datastore
Cloud storage |
https://en.wikipedia.org/wiki/Clarke%27s%20generalized%20Jacobian | In mathematics, Clarke's generalized Jacobian is a generalization of the Jacobian matrix of a smooth function to non-smooth functions. It was introduced by .
References
Mathematical optimization |
https://en.wikipedia.org/wiki/CopperheadOS | CopperheadOS is a mobile operating system for smartphones, based on the Android mobile platform. It adds privacy and security features to the official releases of the Android Open Source Project by Google. CopperheadOS is developed by Copperhead, a Canadian information security company. It is licensed under Creative Commons BY-NC-SA 4.0, although its source code is not available for public download.
CopperheadOS supports smartphones in the Google Pixel product line; other devices are not targeted in order to preserve the resources of the development team. It has several security features not found in stock Android, such as a hardened version of the Linux kernel, and the ability to use separate passwords for unlocking the device and for encryption. Rather than use the Google Play Store found on most Android devices, CopperheadOS ships with the F-Droid store in order to reduce the risk of users installing malicious apps.
Development of CopperheadOS began in 2014, and the operating system had an initial alpha release in August 2015. This was followed by a beta release in February 2016, followed by several other releases targeting the Google Nexus and Pixel phones. The project was initially released under the GNU General Public License, with the project's source code publicly available on GitHub. In October 2016 the license was changed to Creative Commons Attribution-NonCommercial-ShareAlike (BY-NC-SA), and as of June 2020 access to the source code was restricted to members of Copperhead's partner network.
History
Project inception and initial releases
The CopperheadOS project was started in 2014 by Copperhead, an information security company based in Toronto, Canada. The company was founded in the same year by James Donaldson, the CEO, and Daniel Micay, the CTO and lead developer, and initially served clients in the Canadian legal and intelligence industries. During this work, the founders noticed an absence of secure, open-source operating systems for mobile dev |
https://en.wikipedia.org/wiki/Mivar-based%20approach | The Mivar-based approach is a mathematical tool for designing artificial intelligence (AI) systems. Mivar (Multidimensional Informational Variable Adaptive Reality) was developed by combining production and Petri nets. The Mivar-based approach was developed for semantic analysis and adequate representation of humanitarian epistemological and axiological principles in the process of developing artificial intelligence. The Mivar-based approach incorporates computer science, informatics and discrete mathematics, databases, expert systems, graph theory, matrices and inference systems. The Mivar-based approach involves two technologies:
Information accumulation is a method of creating global evolutionary data-and-rules bases with variable structure. It works on the basis of adaptive, discrete, mivar-oriented information space, unified data and rules representation, based on three main concepts: “object, property, relation”. Information accumulation is designed to store any information with possible evolutionary structure and without limitations concerning the amount of information and forms of its presentation.
Data processing is a method of creating a logical inference system or automated algorithm construction from modules, services or procedures on the basis of a trained mivar network of rules with linear computational complexity. Mivar data processing includes logical inference, computational procedures and services.
Mivar networks allow us to develop cause-effect dependencies (“If-then”) and create an automated, trained, logical reasoning system.
Representatives of Russian association for artificial intelligence (RAAI) – for example, V. I. Gorodecki, doctor of technical science, professor at SPIIRAS and V. N. Vagin, doctor of technical science, professor at MPEI declared that the term is incorrect and suggested that the author should use standard terminology.
History
While working in the Russian Ministry of Defense, O. O. Varlamov started developing the theory |
https://en.wikipedia.org/wiki/Qualified%20digital%20certificate | In the context of Regulation (EU) No 910/2014 (eIDAS), a qualified digital certificate is a public key certificate issued by a trust service provider which has government-issued qualifications. The certificate is designed to ensure the authenticity and data integrity of an electronic signature and its accompanying message and/or attached data.
Description
eIDAS defines several tiers of electronic signatures that can be used in conducting public sector and private transactions within and across the borders of EU member states. A qualified digital certificate, in addition to other specific services provided by a qualified trust service provider, is required to elevate the status of an electronic signature to that of being considered a qualified electronic signature. Using cryptography, the digital certificate, also known as a public key certificate, contains information to link it to its owner and the digital signature of the trust entity that verifies the authenticity of the content that has been signed.
According to eIDAS, to be considered a qualified digital certificate, the certificate must meet the requirements provided in Annex I of Regulation (EU) No 910/2014, including, but not limited to:
Identification that the certificate is a qualified certificate for electronic signature
Identification of the qualified trust service provider who issued the qualified certificate, including such information
Corresponding electronic signature validation data and electronic signature creation data
Indication of the certificate's period of validity
Unique certificate identity code of the trust service provider
Qualified trust service provider's advanced electronic signature or electronic seal
Vision
The need for non-repudiation and authentication of electronic signatures was originally addressed in the Electronic Signatures Directive 1999/93/EC to help facilitate secure transactions, specifically those that occur across the borders of EU Member states. The eIDAS Regul |
https://en.wikipedia.org/wiki/Candle%20Cove | Candle Cove is an online creepypasta horror story written by web cartoonist and author Kris Straub. The story centers on a fictional television series, titled Candle Cove, that could only be viewed by a small group of people, predominantly children, who later recall the disturbing show on a web forum. Straub has stated that he was inspired to write the creepypasta after reading an article by the satirical news outlet The Onion, titled Area 36-Year-Old Still Has Occasional Lidsville Nightmare.
Straub's story quickly became popular, inspiring numerous YouTube videos and fan fictions. In 2015, Straub self-published Candle Cove in a collection of short stories entitled Candle Cove and Other Stories. The Verge commented that Candle Cove differed from other creepypastas in that while most creepypasta have an "anonymous folkloric quality", Candle Cove's originated from a known source and author.
The story was adapted for the first season of the Syfy anthology series Channel Zero, which aired in 2016. Additionally, Straub began the spin-off YouTube series Local 58, centered around strange broadcasts from the fictitious public access television channel where Candle Cove originally aired.
Synopsis
The story is told via a thread on a forum called the "NetNostalgia Forums", where a group of users discuss an unusual low-budget children's television show, Candle Cove, that they all remember watching on Channel 58 when they were children in the early 1970s. The show is about a young girl named Janice, who imagines herself to be friends with pirates. The pirate characters are said to be portrayed by string marionettes.
As the users continue to reminisce they begin to recall more disturbing details about the show, such as a character known as the "Skin-Taker", a skeleton pirate who wears clothing made out of children's skin, and an episode that consisted entirely of the puppets flailing and screaming while Janice cries. The story ends with a user stating that he recently asked h |
https://en.wikipedia.org/wiki/Yarovaya%20law | The Yarovaya law (in Russian: Закон Яровой, transliteration: Zakon Jarovoy), also Yarovaya package/bag, is a set of two Russian federal bills, 374-FZ and 375-FZ, passed in 2016. The bills amend previous counter-terrorism laws and separate laws which regulate additional counter-terror and public safety measures. The public names the law after the last name of one of its creators—Irina Yarovaya.
The amendments included an expansion of authority for law enforcement agencies, new requirements for data collection and mandatory decoding in the telecommunications industry, as well as the increased regulation of evangelism, including a ban on the performance of "missionary activities" in non-religious settings.
Legislative history
In April 2016 Irina Yarovaya, together with Aleksei Pushkov, and Nadezhda Gerasimova and senator Victor Ozerov introduced a project of legislation that would toughen penalties for extremism and terrorism. On 13 May 2016, the law passed after the first reading. Prior to that, it had received support from the prime minister's cabinet. On 7 July it was signed by the President of Russia, Vladimir Putin.
Most of the act's amendments came into effect on 20 July 2016. Amendments that require telecom operators to store recordings of phone conversations, text messages and users' internet traffic up to 6 months were announced to come into force on July 1, 2018. However, senator Anton Belyakov has submitted a proposal to move the regulations' effective date to 2023, because of the extreme amount of data storage technology needed to meet the requirements.
Content
Penal provisions
The amendments of the Yarovaya law include lengthening of prison terms for a number of criminal activities, introduction of new reasons to deny entry or departure to and from Russia, and the introduction of criminal liability for failure to report to law enforcement authorities that someone else "has been planning, is perpetrating, or has perpetrated" terrorist activity.
Surv |
https://en.wikipedia.org/wiki/Acsensorize | Acsensorize (v.t.), pronounced as ac-sensor-ize, is the act of adding a multitude of dissimilar sensors, generally of a variety of sensing modalities, to an existing system that may or may not already have sensors;
acsensorizing (pres. part.);
acsensorized (pass. part.);
acsensorization (n.) is the process of acsensorizing.
It was first used by researchers at General Motors Global Research and Development, and was published in. The word was motivated by accessorize. Acsensorizing plays a significant role in big data research and machine learning.
See also
Sensorization
References
Sensors |
https://en.wikipedia.org/wiki/Per%20meg | Per meg equals 0.001 permil or 0.0001 percent or parts per million ppm. The unit is typically used in isotope analysis by multiplying an isotope ratio in delta annotation, for example δ18O, by 1000000.
This annotation is typically used in studies of atmospheric trace gases, where a high precision is needed for a significant interpretation of results.
References
Fractions (mathematics)
Environmental isotopes
Geochemistry |
https://en.wikipedia.org/wiki/Mks%20vir | mks_vir (formerly: MkS_Vir) is a Polish antivirus program, created by Marek Sell in 1987.
The original reason for creation of this software was that the solutions existing on the market these times did not satisfy the author's needs. The first versions for DOS were distributed on floppy disks by Apexim, the company in which Marek Sell worked. The updates were issued monthly and sent by mail. Initially, the software delivered to the users was personalized – the main screen contained the serial number and the data of the license owner. Despite that, the program was often used without license and its popularity can be confirmed by appearing Trojan horses, impersonating program updates, which were not issued yet. Later, together with the full version of the software, demo versions were issued, which allowed to use the program for a week. For educational reasons, the program contained descriptions of operation of some viruses (including demonstrations of their graphical and sound effects) and, from the 3.99 version, a lexicon of the viruses popular in Poland. In 1996, it became the winner of the third edition of the Teraz Polska contest.
In 1996, the MKS company, founded by Marek Sell, became the developer of the program. A website of the program and a BBS were created. The company continued the development of the program after the death of the author in 2004. Versions for Microsoft Windows and Unix were created. An online scanner, based on the ActiveX technology, became available on the software website.
After the bankruptcy of the MKS company, in 2011, the property receiver sold the rights to the mks_vir trademark to the ArcaBit company, set up a few years earlier by the former MKS employees. It reactivated the mks_vir product as a free antivirus application.
Officially, the ArcaBit company resigned from the distribution and the support for the software on 2014, March 1. Although they released a brand new version during May 2018.
Some of the program versions:
3.1 |
https://en.wikipedia.org/wiki/The%20Mines%20Rescue%20Rules%2C%201985 | The Mines Rescue Rules, 1985 came into force with effect from 2 April 1985 in India, replacing the previous Coal Mines Rescue Rules-1959, to provide for rescue of work persons in the event of explosion, fire etc. in the Mines.
These rules apply to coal and metalliferous underground mines to provide for the establishment of rescue stations and conduct of rescue work. In case of explosion or fire, an inrush of water or influx of gases, services of specially trained men with special rescue apparatuses are required.
Salient Features
Chapter I - Preliminary
Chapter II - Rescue Stations and Rescue Rooms
Chapter III - Duties and Responsibilities of Superintendents etc.
Chapter IV - Organisation and Equipment in Mines
Chapter V - Conduct of Rescue Work
Chapter VI – Miscellaneous
References
See also
Coal Mines Regulation Act 1908
Quecreek Mine rescue
Mine-rescue-training(MSHA)
Coal mining law
Mine safety
Occupational safety and health organizations
Safety engineering
Indian legislation
Mining in India |
https://en.wikipedia.org/wiki/Bonded%20seal | In mechanical engineering, a bonded seal is a type of washer used to provide a seal around a screw or bolt. Originally made by Dowty Group, they are also known as Dowty seals or Dowty washers. Now widely manufactured, they are available in a range of standard sizes and materials
A bonded seal consists of an outer annular ring of a hard material, typically steel, and an inner annular ring of an elastomeric material that acts as a gasket. It is the compression of the elastomeric part between the faces of the parts on either side of the bonded seal that provides the sealing action. The elastomeric material, typically nitrile rubber, is bonded by heat and pressure to the outer ring, which holds it in place. This structure increases resistance to bursting, increasing the pressure rating of the seal. Because the bonded seal itself acts to retain the gasket material, there is no need for the parts to be sealed to be shaped to retain the gasket. This results in simplified machining and greater ease of use as compared to some other seals, such as O-rings. Some designs come with an additional flap of rubber on the internal diameter to locate the bonded seal at the centre of the hole; these are called self-centring bonded washers.
References
Seals (mechanical) |
https://en.wikipedia.org/wiki/BetterHelp | BetterHelp is a mental health platform that provides online mental health services directly to clients. The online counseling and therapy services are provided through web-based interaction as well as phone and text communication. BetterHelp was founded in 2013 by Alon Matas and Danny Bragonier, and acquired by Teladoc, Inc. in 2015. BetterHelp maintained its brand name post acquisition and continues to provide online counseling services to consumers.
History
BetterHelp was founded by Alon Matas in 2013, after he faced personal challenges finding professional counseling services that accommodated his schedule. With the mission of helping all those facing similar challenges in gaining access to professional counseling, Matas partnered with co-founder Danny Bragonier to develop BetterHelp's web-based counseling portal and therapist directory. Revenue had reached a projected $60 million by 2018.
Services
The "room" is open 24/7 and can be accessed from any Internet-connected device from any physical location.
Acquisition
In 2015, BetterHelp was acquired by Teladoc, Inc., a telehealth company that uses telephone and videoconferencing technology to provide on-demand remote therapy. Teladoc acquired BetterHelp for $3.5 million in cash and a $1.0 million promissory note, with an agreement to make annual payments to the sellers equal to 15% of the total net revenue generated by the BetterHelp business for each of the next three years.
Controversies
In October 2018, BetterHelp gained attention from media personalities after concerns were raised about alleged use of unfair pricing, bad experiences with the app, paid reviews from actors, and terms of service that allegedly did not correspond with ads promoted by professional YouTubers. CEO Alon Matas issued a statement responding to the allegations. YouTube content creators such as PewDiePie and Boogie2988 have spoken out on this issue.
BetterHelp has received backlash for supposedly sharing its customers' personal |
https://en.wikipedia.org/wiki/Well-known%20URI | A well-known URI is a Uniform Resource Identifier for URL path prefixes that start with /.well-known/. They are implemented in webservers so that requests to the servers for well-known services or information are available at URLs consistent well-known locations across servers.
Description
Well-known URIs are Uniform Resource Identifiers defined by the IETF in RFC 8615. They are URL path prefixes that start with /.well-known/. This implementation is in response to the common expectation for web-based protocols to require certain services or information be available at URLs consistent across servers, regardless of the way URL paths are organized on a particular host. The URIs are implemented in webservers so that requests to the servers for well-known services or information are available at URLs consistently in well-known locations across servers.
The IETF has defined a simple way for web servers to hold metadata that any user agent (e.g., web browser) can request. The metadata is useful for various tasks, including directing a web user to use a mobile app instead of the website or indicating the different ways that the site can be secured. The well-known locations are used by web servers to share metadata with user agents; sometimes these are files and sometimes these are requests for information from the web server software itself. The way to declare the different metadata requests that can be provided is standardized by the IETF so that other developers know how to find and use this information.
Use
The path well-known URI begins with the characters /.well-known/, and whose scheme is "HTTP", "HTTPS", or another scheme that has explicitly been specified to use well-known URIs. As an example, if an application hosts the service "example", the corresponding well-known URIs on https://www.example.com/ would start with https://www.example.com/.well-known/example.
Information shared by a web site as a well-known service is expected to meet a specific standard. S |
https://en.wikipedia.org/wiki/Loss%20development%20factor | Loss development factors or LDFs are used in insurance pricing and reserving to adjust claims to their projected ultimate level. Insurance claims, especially in long-tailed lines such as liability insurance, are often not paid out immediately. Claims adjusters set initial case reserves for claims; however, it is often impossible to predict immediately what the final amount of an insurance claim will be, due to uncertainty around defense costs, settlement amounts, and trial outcomes (in addition to several other factors). Loss development factors are used by actuaries, underwriters, and other insurance professionals to "develop" claim amounts to their estimated final value. Ultimate loss amounts are necessary for determining an insurance company's carried reserves. They are also useful for determining adequate insurance premiums, when loss experience is used as a rating factor
Loss development factors are used in all triangular methods of loss reserving, such as the chain-ladder method.
See also
Incurred but not reported
References
Further reading
Actuarial science |
https://en.wikipedia.org/wiki/Evan%20O%27Neill%20Kane%20%28physicist%29 | Evan O'Neill Kane (December 23, 1924 – March 23, 2006), known as E. O. Kane in his publications, was an American physicist who established some of the basic understanding of the theory of semiconductors that are now used in consumer and other electronics. He was one of the main developers of the k·p perturbation theory which is used to calculate band structures.
Ancestry
Kane's great, great uncle, Elisha Kent Kane, was an arctic explorer, writing books in the 1850s about his journeys. His great grandfather, Thomas Leiper Kane, who founded the town of Kane, Pennsylvania, was an American Civil War General. He also helped with the Underground Railroad and successfully urged the Buchanan Administration not to go to war with the Mormons in Salt Lake City. Kane's grandfather, also named Evan O'Neill Kane, was a doctor who was so enamoured of the idea of local anesthesia that he surgically removed his own appendix to show its effectiveness.
Life
Evan O'Neill Kane was born on December 23, 1924 in Kane, Pennsylvania. His father, Thomas Leiper Kane, died in 1933 of spinal meningitis, which was preceded by scarlet fever. He later moved with his mother and siblings to Daytona Beach, Florida, where he stayed through high school.
Career
Kane was an undergraduate at Princeton University, and interrupted his education to serve in the army during World War II. He graduated from Princeton University in 1948, and went directly to Cornell University to study towards his PhD in physics, which was awarded in 1953 on an experimental project related to vacuum tube technology. Kane then joined the General Electric Research Laboratory in Schenectady, New York. There he began contributing to the theoretical underpinnings of the then-new field of semiconductor research. He published widely in scientific journals. Perhaps his best known paper was published in 1956 on a technique to calculate the structure of solids. This technique is referred to as the k·p method for band structure calcu |
https://en.wikipedia.org/wiki/Fuchsia%20%28operating%20system%29 | Fuchsia is an open-source capability-based operating system developed by Google. In contrast to Google's Linux-based operating systems such as ChromeOS and Android, Fuchsia is based on a custom kernel named Zircon. It publicly debuted as a self-hosted git repository in August 2016 without any official corporate announcement. After years of development, its official product launch was in 2021 on the first-generation Google Nest Hub, replacing its original Linux-based Cast OS.
Etymology
Fuchsia is named for the color fuchsia, which is a combination of pink and purple. The name is a reference to two operating systems projects within Apple which influenced team members of the Fuchsia project: Taligent (code named "Pink") and iOS (code named "Purple"). The color-based naming scheme derives from the colors of index cards which Apple employees used to organize their ideas.
The name of the color fuchsia is derived from the Fuchsia plant species, which is derived from the name of botanist Leonhart Fuchs.
History
In August 2016, media outlets reported on a mysterious source code repository published on GitHub, revealing that Google was developing a new operating system named Fuchsia. No official announcement was made, but inspection of the code suggested its capability to run on various devices, including "dash infotainment" systems for cars, embedded devices like traffic lights, digital watches, smartphones, tablets, and PCs. Its architecture differs entirely from the Linux-based Android and ChromeOS due in part to its unique Zircon kernel, formerly named Magenta.
In May 2017, Ars Technica wrote about Fuchsia's new user interface, an upgrade from its command-line interface at its first reveal in August. A developer wrote that Fuchsia "isn't a toy thing, it's not a 20% Project, it's not a dumping ground of a dead thing that we don't care about anymore". Though users could test Fuchsia, nothing "works", because "it's all a bunch of placeholder interfaces that don't do anyt |
https://en.wikipedia.org/wiki/EMBO%20Membership | Membership of the European Molecular Biology Organization (EMBO) is an award granted by the European Molecular Biology Organization (EMBO) in recognition of "research excellence and the outstanding achievements made by a life scientist".
, 88 EMBO Members and Associate Members have been awarded Nobel Prizes in either Physiology or Medicine, Chemistry or Physics. See :Category:Members of the European Molecular Biology Organization for examples of EMBO members.
Nomination and election of new members
Elections for membership are held annually with candidates for membership being nominated and elected exclusively by existing EMBO members, membership cannot be applied for directly. Three types of membership exist:
EMBO Member, for scientists living (or who have lived) in a European Molecular Biology Conference (EMBC) Member State
EMBO Associate Member, for scientists living outside of the EMBC Member States
EMBO Young Investigator
See also
List of biology awards
References
Biology awards
European Molecular Biology Organization
Molecular biology |
https://en.wikipedia.org/wiki/Traffic%20model | A traffic model is a mathematical model of real-world traffic, usually, but not restricted to, road traffic. Traffic modeling draws heavily on theoretical foundations like network theory and certain theories from physics like the kinematic wave model. The interesting quantity being modeled and measured is the traffic flow, i.e. the throughput of mobile units (e.g. vehicles) per time and transportation medium capacity (e.g. road or lane width). Models can teach researchers and engineers how to ensure an optimal flow with a minimum number of traffic jams.
Traffic models often are the basis of a traffic simulation.
Types
Microscopic traffic flow model Traffic flow is assumed to depend on individual mobile units, i.e. cars, which are explicitly modeled
Macroscopic traffic flow model Only the mass action or the statistical properties of a large number of units is analyzed
Examples
Biham–Middleton–Levine traffic model
Traffic generation model
History of network traffic models
Traffic mix
Intelligent driver model
Network traffic
Three-phase traffic theory
Two-fluid model
See also
Braess's paradox
Gridlock
Mobility model
Network traffic
Network traffic simulation
Traffic bottleneck
Traffic flow
Traffic wave
Queueing theory
Traffic equations
References
External links
http://math.mit.edu/projects/traffic/
Traffic flow
Mathematical modeling |
https://en.wikipedia.org/wiki/Valencell | Valencell is a US-based biometric technology company that develops biometric sensor technology for wearables and hearables, and provides its patent-protected technology to consumer electronics manufacturers in various industries. Valencell's PerformTek technology enables wearables and hearables to continuously measure biometrics such as heart rate, blood oxygen levels, blood pressure, heart rate variability, respiration rate, VO2 and other parameters for health and fitness assessment. The technology can be integrated into products designed by consumer electronics manufacturers, mobile device and accessory makers, medical device, sports and fitness, and hearing aid companies. Valencell has more than 60 patents granted, plus more than 100 patents pending. More than 35 companies utilize Valencell's technology and intellectual property, which has been commercialized in wearable devices made by companies including Bose, Suunto, LG, Jabra, Samsung, and Sony.
History
Valencell was co-founded by a team of scientists and engineers - President Dr. Steven LeBoeuf, VP Engineering Dr. Jesse Tucker and VP Product Management Dr. Mike Aumer, and has been augmented further with R&D talent since the company was formed in 2006. Since inception, the company has won more than $3 million in government grants and has raised more than $35 million in venture funding from investor firms such as WSJ Joshua Fund, GII Tech, and TDF Ventures. In June 2018, Valencell raised $10.5M from Sonion and existing investors.
Biometrics lab
In September 2014, Valencell opened the Valencell Biometrics Lab, an exercise science lab designed to test biometric wearables and hearables in their intended use cases. The Biometrics Lab tests more than 400 different devices from various manufacturers each year and analyzes over one million biometric data points on a monthly basis. Volunteers test wearable devices in 25 distinctive testing protocols ranging from hard intervals to easy lifestyle efforts.
Reference |
https://en.wikipedia.org/wiki/Garden%20of%20Archimedes | The Garden of Archimedes (Italian: Il Giardino Di Archimede) is a museum for mathematics in Florence, Italy. It was founded on March 26, 2004 and opened its doors to the public on April 14 of that year. The mission of the museum is to enhance public understanding and perception of mathematics, to bring mathematics out of the shadows and into the limelight. It has been compared to the National Museum of Mathematics in New York City, the only museum in North America devoted to mathematics.
History
The Garden of Archimedes was set up in 2004 by a consortium of government and educational agencies. Current members of the consortium include: the Scuola Normale Superiore di Pisa, the University of Florence, the University of Pisa, the University of Siena, the Italian Mathematical Union, the Istituto Nazionale di Alta Matematica Francesco Severi, the Consortium for the Promotion of Culture of Research and Studies at the University of Avellino. The Consortium is based in Florence, at the Department of Mathematics "Ulisse Dini". The President of the consortium is the mathematician Enrico Giusti.
One initiative of the Garden of Archimedes is to create a history of Mathematics on CD-ROM and distribute it along with related supporting texts.
Sections
Inspired by museums such at The Exploratorium in San Francisco the Garden of Archimedes is packed with hands-on exhibits and is popular with both adults and children. The museum is divided into different sections or exhibitions, corresponding to different ways of discovering mathematics:
Beyond compasses: the geometry of curves explores the mathematics concealed in everyday objects. Pythagoras and his theorem focuses on puzzles and play inspired by the seminal theorem. A bridge over the Mediterranean is a historical exhibition focusing on Leonardo Fibonacci and his Liber Abaci with emphasis on how mathematics from the Islamic world was reintroduced to Medieval Europe. Helping Nature: from Galileo's Mechanics to everyday life |
https://en.wikipedia.org/wiki/Ixi%20lang | Ixi lang is a programming language for live coding musical expression. It is taught at diverse levels of musical education and used in Algorave performances. Like many other live coding languages, such TidalCycles, ixi lang is a domain-specific language that embraces simplicity and constraints in design.
In 2015, ixi lang was presented at the Loop summit, organised by the music software manufacturer Ableton, where it gained critical acclaim as an alternative way of making music in the studio as well as in live performance. Mark Smith, of techno-duo Garland writes about the language: "By entering the name of a sound, drawing your own bars and typing notes with numbers, you can make simple beats and melodies almost immediately. If you memorise a few different command lines a broad range of modulations and structural changes becomes possible. Whatever simple information you entered beforehand becomes hugely pliable – and you can do all this to your own uploaded bank of samples. Given that just about anyone can get up and running with a few minutes, those who are willing to put their time into live coding software like ixi lang can reach highly intuitive and fluid levels of improvised composition".
Ixi lang is used internationally, for example by members of the Quase-Linema Lab collective in Brazil, Belisha Beacon, Section 9 and Deerful in the UK, or by the Paris-based Sougata Bhattacharya. Ixi Lang is referenced in various live coding literature and has influenced other live coding systems such as Gibber, EarSketch, WulfCode and Sonic Pi.
References
External links
Computer music software
Electronic music
Experimental music
Computer music
Computer programming
Live coding
Algorave |
https://en.wikipedia.org/wiki/Mary%20Jackson%20%28engineer%29 | Mary Jackson (; April 9, 1921 – February 11, 2005) was an American mathematician and aerospace engineer at the National Advisory Committee for Aeronautics (NACA), which in 1958 was succeeded by the National Aeronautics and Space Administration (NASA). She worked at Langley Research Center in Hampton, Virginia, for most of her career. She started as a computer at the segregated West Area Computing division in 1951. In 1958, after taking engineering classes, she became NASA's first black female engineer.
After 34 years at NASA, Jackson had earned the most senior engineering title available. She realized she could not earn further promotions without becoming a supervisor. She accepted a demotion to become a manager of both the Federal Women's Program, in the NASA Office of Equal Opportunity Programs and of the Affirmative Action Program. In this role, she worked to influence the hiring and promotion of women in NASA's science, engineering, and mathematics careers.
Jackson's story features in the 2016 non-fiction book Hidden Figures: The American Dream and the Untold Story of the Black Women Who Helped Win the Space Race. She is one of the three protagonists in Hidden Figures, the film adaptation released the same year.
In 2019, Jackson was posthumously awarded the Congressional Gold Medal. In 2021, the Washington, D.C. headquarters of NASA was renamed the Mary W. Jackson NASA Headquarters.
Biography
Mary Jackson was born on April 9, 1921, to Ella Winston (née Scott) and Frank Winston. She grew up in Hampton, Virginia, where she graduated from high school with highest honors. Jackson earned bachelor's degrees in mathematics and physical science from Hampton University in 1942. She was initiated into the Gamma Theta chapter of Alpha Kappa Alpha sorority at Hampton.
Jackson served for more than 30 years as a Girl Scout leader. In the 1970s she helped African American children in her community create a miniature wind tunnel for testing airplanes.
Jackson was marrie |
https://en.wikipedia.org/wiki/CM%20%28commerce%29 | CM.com (formerly called CM Telecom) is a Mobile service company based in the Netherlands. The company was formed in 1999, and provides software for direct messaging, VoIP messaging, ecommerce payments and digital identification.
In recent years, CM has acquired a number of messaging and media startups. CM.com was the main sponsor of football club NAC Breda from 2015 to 2020.
History
CM.com was established in February 1999 by Jeroen van Glabbeek and Gilbert Gooijer In its first year, it became known as ClubMessage B.V. The main product of the company at the time Group text, used by the event organisers to distribute information to clubbers and event participants. The software has been primarily used throughout the Benelux by leading nightlife venues to promote their DJ nights and events.s.
In the first year of the society it was known as ClubMessage B.V. The main product of the company at the time Group Text, used by the event organisers to distribute information to clubbers and event participants. The software was predominantly used across the Benelux by large nightlife venues to promote their nights and DJ events.
As the company grew, they began to operate in other event sectors, such as music festivals. During the next couple of years, the company focused on the expansion of its SMS messaging service, and created and patented the software MailText. In recent years, CM has diversified into the mobile payments market, with the launch of CM Payments Worldwide.
In September 2013, CM.com acquired Dutch mobile app developer OneSixty Mobile B.V. with offices in 's-Hertogenbosch and London, enabling its initial physical presence in the UK.
In early 2015 it was announced that the company would be opening offices in both Paris and London. During the same year, CM received coverage on The Next Web for their growing innovations in media messaging. Their solution for managing push message campaigns, where companies or app developers can measure and drive interaction wi |
https://en.wikipedia.org/wiki/Society%20of%20Chemical%20Industry%20%28America%20Section%29 | The Society of Chemical Industry (America Section) or SCI America is an independent learned society inspired by the creation of the Society of Chemical Industry (SCI) in London in 1881. Originally known as the New York Section, it was formed in 1894 and officially renamed the America Section in 1919. The main activity of the America Section is the awarding of several prizes in chemistry: the Perkin Medal, the Chemical Industry Medal and the Gordon E. Moore Medal. The America Section also works with the American Chemical Society (ACS) and others to support scholars in chemistry and chemical engineering.
History
The creation of the Society of Chemical Industry (SCI) in London in 1881 led to the eventual formation of a number of satellite groups. A number of informal meetings were held in 1894, with the goal of organizing a New York section of the Society of Chemical Industry. On May 2, 1894, analytical chemist Arthur McGeorge met with seven other members of London's Society of Chemical Industry who were active in New York. At a second meeting, with Alfred H. Mason as chairman and McGeorge as secretary, it was decided to invite all New York-based members of the London society to an organizational meeting. At this third meeting, at the College of Pharmacy, 36 members of the Society of Chemical Industry signed a petition requesting the London organization to form a New York section, the first section to be created overseas. Their proposal was enthusiastically received by London president E. C. C. Stanford, who wrote "We are pleased to add the stars and stripes to our highly respectable old colours."
The first official meeting of the new New York Section was held in November 1894. The new section had a membership of 350 members, about one-tenth of the entire organization. The London group's president Thomas Tyrer and foreign secretary Ludwig Mond attended the October 1895 fall meeting in New York, which was rescheduled so that they could participate.
In contrast to th |
https://en.wikipedia.org/wiki/Newcastle%20Connection | The Newcastle Connection (or UNIX United) was a software subsystem from the early 1980s that could be added to each of a set of interconnected UNIX-like systems to build a distributed system. The latter would be functionally indistinguishable, at both user- and system-level, from a conventional UNIX system. It became a forerunner of Sun Microsystems' Network File System (NFS). The name derives from the research group at Newcastle University, under Brian Randell, which developed it.
The term "UNIX United" describes the scheme of combining the overall filesystems of the participating UNIX machines; "Newcastle Connection" describes the underlying communication layer which enables this. A UNIX United system constructed with the Newcastle Connection is functionally indistinguishable from a centralised UNIX system at the system-call level.
In essence, the concept of the "parent directory" was re-interpreted at the root of the filesystem, where it originally had no significant meaning, to mean "this directory is on a remote machine", similar to subsequent "Super-root (Unix)" usage.
UNIX United
As a reminder, a typical single UNIX directory tree might resemble:
/
home
brian (current directory '.')
a
b
UNIX United acts as an extra level above the / root. If the example machine is named "unix1", an overall UNIX United scheme with an additional second machine, "unix2", would look like:
/..
unix1
home
brian (the current directory '.')
a
b
unix2
home
brian
b
c
If we wish to copy file a from "unix1" to "unix2" to sit alongside files b and c, example equivalent commands might be:
cp /home/brian/a /../unix2/home/brian/a
cp a /../unix2/home/brian/a
( cd /../unix2/home/brian ; cp /../unix1/home/brian/a a )
Internals
It required no changes to the UNIX kernel. Rather, it ran in user-space, using a modified version of the C standard library of its day which was capable of recognising these new semantics. To a first approximation this was to reco |
https://en.wikipedia.org/wiki/Patchwork%20%28software%29 | Patchwork is a free, web-based patch tracking system designed to facilitate the contribution and management of contributions to an open-source project. It is intended to make the patch management process easier for both the project's contributors and maintainers.
Patches that have been sent to a mailing list are 'caught' by the system, and appear on a web page. Any comments posted that reference the patch are appended to the patch page too. The project's maintainer can then scan through the list of patches, marking each with a certain state, such as Accepted, Rejected or Under Review. Old patches can be sent to the archive or deleted.
Currently, Patchwork is being used for a number of open-source projects, mostly subsystems of the Linux kernel and FFmpeg. Although Patchwork has been developed with the kernel workflow in mind, the aim is to be flexible enough to suit the majority of community projects.
History
Patchwork was developed by Jeremy Kerr for use with the Linux PPC64 mailing list. The ozlabs.org deployment was later expanded to cover additional projects and functionality.
Design
Originally written in Perl, it is now written in Python, using the Django web framework. Recent versions of Patchwork use Bootstrap for the front-end UI.
See also
List of tools for code review
References
External links
Patchwork-FDO, a freedesktop fork.
Patchwork mailing list
Patchwork documentation
Ubuntu Patchwork Handbook
Software review
Free software programmed in Python |
https://en.wikipedia.org/wiki/List%20of%20big%20data%20companies | This is an alphabetical list of notable IT companies using the marketing term big data:
Alpine Data Labs, an analytics interface working with Apache Hadoop and big data
Azure Data Lake is a highly scalable data storage and analytics service. The service is hosted in Azure, Microsoft's public cloud
Big Data Partnership, a professional services company based in London
Big Data Scoring, a cloud-based service that lets consumer lenders improve loan quality and acceptance rates through the use of big data
BigPanda, a technology company headquartered in Mountain View, California
Bright Computing, developer of software for deploying and managing high-performance (HPC) clusters, big data clusters, and OpenStack in data centers and in the cloud
Clarivate Analytics, a global company that owns and operates a collection of subscription-based services focused largely on analytics
Cloudera, an American-based software company that provides Apache Hadoop-based software, support and services, and training to business customers
Compuverde, an IT company with a focus on big data storage
CVidya, a provider of big data analytics products for communications and digital service providers
Cybatar Cloud, a cloud-based system for managing, assigning, tracking and monitoring on-demand goods and service delivery tasks and agents.
Databricks, a company founded by the creators of Apache Spark
Dataiku, a French computer software company
DataStax
Domo
Fluentd
Greenplum
Groundhog Technologies
Hack/reduce
Hazelcast
Hortonworks
HPCC Systems
IBM
Imply Corporation
MapR
MarkLogic
Medio
Medopad
NetApp
Oracle Cloud Platform
Palantir Technologies
Pentaho, a data integration and business analytics company with an enterprise-class, open source-based platform for big data deployments
Pitney Bowes
Platfora
Qumulo
Rocket Fuel Inc.
SAP SE, offers the SAP Data Hub to connect data bases and other products through acquisition of Altiscale
SalesforceIQ
Sense Networks
Shan |
https://en.wikipedia.org/wiki/Gary%20Yost | Gary Yost (born 1959) is an American filmmaker and software designer, best known for leading the team that created Autodesk 3ds Max.
Antic Software
Yost created the Antic Software publishing unit for Antic Magazine in 1984 after Jack Tramiel bought Atari Computer from Warner Communications and shut down the Atari Program Exchange.
Yost met Tom Hudson at the Fall 1985 Comdex trade show and they began planning a suite of 3D animation tools for the Atari ST line of microcomputers, which became the Cyber Studio suite of animation products, beginning with CAD-3D 1.0, released autumn 1986. Stereo CAD-3D 2.0, released in late 1987, was built on an open-architecture framework and incorporated support for creating stereoscopic animations using the Tektronix “StereoTek” liquid crystal shutter 3D display. The StereoTek display was the first low-cost mass-market 3D display for microcomputers.
The Yost Group, Autodesk and beyond
In 1988 Yost left Antic Software to form “The Yost Group” when Autodesk offered him a software licensing agreement to create a suite of affordable animation tools for the IBM PC, beginning with Autodesk 3D Studio and Autodesk Animator, which was a 2D cel animation tool written by Jim Kent for The Yost Group. An obscure fact about Yost in 1988 is that, along with Computer Graphics pioneer Jim Blinn, he played percussion on the Todd Rundgren album "Nearly Human," which was recorded at Fantasy Studios in Berkeley, California.
Working with Tom Hudson, Jack Powell, Dan Silva, Rolf Berteig and Gus Grubba, Yost led the team that created Autodesk 3D Studio versions 1-4 for the MS-DOS platform. Don Brittain, former VP of Research for Wavefront Technologies, was brought into the Yost Group to help create the re-designed 3D animation program called Autodesk 3ds Max, based on the Microsoft Windows NT platform and it was first shown at the Association for Computing Machinery’s SIGGRAPH conference in Los Angeles in 1995 before its 1996 release.
Yost and his e |
https://en.wikipedia.org/wiki/Canadian%20Northern%20Corridor | The Canadian Northern Corridor is a concept for a multi-modal (road, rail, pipeline, electrical transmission and communication) transportation corridor through Canada's North and Near-North. The Canadian Northern Corridor (CNC) would be a multi-use corridor infrastructure megaproject spanning Canada's east-west mid-latitude with several northern spurs, approximately 7,000-10,000 km long and costing roughly $100-150 billion. The concept is being studied jointly by academics at the University of Calgary School of Public Policy and CIRANO.
On June 21, 2017, The Standing Senate Committee on Banking, Trade and Commerce released a report entitled NATIONAL CORRIDOR ENHANCING AND FACILITATING COMMERCE AND INTERNAL TRADE that was a major endorsement of the NC concept. In a press release issued simultaneously, the Committee called the NC concept a visionary project that could unlock extraordinary economic potential.
Research
In May 2016, the University of Calgary School of Public policy and CIRANO published a paper examining the potential for a Transportation Corridor (the Canadian Northern Corridor™) which would encompass an established right of way for transportation infrastructure based on local consultation and the negotiation of appropriate land usage rights. The initial paper also outlined the range of issues that required detailed study to determine the Corridor's viability. Additional scholarly work on the subject, coordinated by the University of Calgary, School of Public Policy, is intended to follow from this initial paper. They believe that by 2025 they can present this paper to the government of Canada.
Corridor
While no specific geographic path for the Canadian Northern Corridor has been formalized, the Corridor concept has been described as follows:
"In initial concept, the Northern Corridor would be approximately 7000 km in length. It would largely follow the boreal forest in the northern part of the west, with a spur along the Mackenzie Valley, and then s |
https://en.wikipedia.org/wiki/M.%20Gweneth%20Humphreys%20Award | The M. Gweneth Humphreys Award or Humphreys Award is a mathematics award established by the Association for Women in Mathematics in recognition of mathematics educators who have exhibited outstanding mentorship. The award is named for Mabel Gweneth Humphreys (1911-2006) who earned her Ph.D. at age 23 from the University of Chicago in 1935.
She taught mathematics to women for her entire career, first at Mount St. Scholastica College, then for several years at Sophie Newcomb College, and finally for over thirty years at Randolph Macon Woman's College. This award, funded by contributions from her former students and colleagues at Randolph-Macon Woman's College, recognizes her commitment to and her influence on undergraduate students of mathematics.
Recipients
The following mathematicians have been honored with the Humphreys Award:
See also
List of mathematics awards
References
Awards and prizes of the Association for Women in Mathematics
Awards established in 2011
Mathematics education awards |
https://en.wikipedia.org/wiki/Dell%20Technologies | Dell Technologies Inc. is an American multinational technology company headquartered in Round Rock, Texas. It was formed as a result of the September 2016 merger of Dell and EMC Corporation (which later became Dell EMC).
Dell's products include personal computers, servers, televisions, computer software, computer security and network security, as well as information security services. Dell ranked 35th on the 2018 Fortune 500 rankings of the largest United States corporations by total revenue.
Current operations
Approximately 50% of the company's revenue is derived in the United States.
Dell operates under two divisions:
Dell Client Solutions Group (48% of fiscal 2019 revenues) – produces desktop PCs, notebooks, tablets, and peripherals, such as monitors, printers, and projectors under the Dell brand name
Dell EMC Infrastructure Solutions Group (41% of fiscal 2019 revenues) – servers, storage, and networking
Dell divested its ownership in Boomi, VMware (80%) and Pivotal Software, but owns other businesses such as Secureworks, Virtustream.
History
On October 12, 2015, Dell announced its intent to acquire EMC Corporation, an enterprise software and storage company, in a $67 billion transaction. It was labeled the "highest-valued tech acquisition in history". In addition to Michael Dell, Singapore's Temasek Holdings and Silver Lake Partners were major Dell shareholders that supported the transaction.
On September 7, 2016, Dell Inc. completed the merger with EMC Corp., which involved the issuance of $45.9 billion in debt and $4.4 billion common stock.
The Dell Services, Dell Software Group, and the Dell EMC Enterprise Content Divisions were sold shortly thereafter for proceeds of $7.0 billion, which was used to repay debt. In October 2017, It was reported that Dell would invest $1 billion in IoT research and development.
Dell Inc. had returned to private ownership in 2013, claiming that it faced bleak prospects and would need several years out of the public ey |
https://en.wikipedia.org/wiki/Eulerian%20coherent%20structure | In applied mathematics, objective Eulerian coherent structures (OECSs) are the instantaneously most influential surfaces or curves that exert a major influence on nearby trajectories in a dynamical system over short time-scales, and are the short-time limit of Lagrangian coherent structures (LCSs). Such influence can be of different types, but OECSs invariably create a short-term coherent trajectory pattern for which they serve as a theoretical centerpiece. While LCSs are intrinsically tied to a specific finite time interval, OECSs can be computed at any time instant regardless of the multiple and generally unknown time scales of the system.
In observations of tracer patterns in nature, one readily identifies short-term variability in material structures such as emerging and dissolving coherent features. However, it is often the underlying structure creating these features that is of interest. While individual tracer trajectories forming coherent patterns are generally sensitive with respect to changes in their initial conditions and the system parameters, OECSs are robust and reveal the instantaneous time-varying skeleton of complex dynamical systems. Despite OECSs are defined for general dynamical systems, their role in creating coherent patterns is perhaps most readily observable in fluid flows. Therefore, OECSs are suitable in a number of applications ranging from flow control to environmental assessment such as now-casting or short-term forecasting of pattern evolution, where quick operational decisions need to be made. Examples include floating debris, oil spills, surface drifters, and control of unsteady flow separation.
References
Dynamical systems
Fluid dynamics |
https://en.wikipedia.org/wiki/B-H%20analyzer | A B-H Analyzer is an instrument that measures the AC magnetic characteristics of soft magnetic materials. It measures residual flux density BR and coercive force HC. It has applications in manufacturing magnetic-related products such as hard disks and magnetic tape, and in analysis of cast irons.
See also
B field and H field
Magnetic hysteresis
Saturation (magnetic)
References
External links
Photograph of the SY-8218, a common B-H Analyzer
Magnetism
Measuring instruments
Laboratory equipment
Scientific equipment |
https://en.wikipedia.org/wiki/Peter%20Novopashenny | Peter Novopashenny (, Pyotr Alexeyevich Nowopashenny; ) (* 18 March 1881 in Russia ; † October 1950 near Orsha in Belarus) was before and during the World War I, a Russian Marine Officer and who worked as a cryptanalyst during World War II for the German Wehrmacht (OKW/Chi) cipher bureau, working on the Russian desk, deciphering enciphered Soviet communications.
A glacier in Novaya Zemlya, part of the Nordenskiöld Glacier Group, was named after him.
Life
After having attended the Naval Cadet School in 1902, Peter Novopashenny served as a naval officer on several Russian warships, firstly on the monitor Admiral Greig (Russian: Адмирал Грейг) in 1903 and a year later on the battleship Sevastopol. In the Russo-Japanese War (1904-1905), he participated in the battle with the Japanese fleet in part. He fell into Japanese captivity, from which he was dismissed, however, after a short time. Thereafter he served on other ships as the gunboat Sivuch . In 1910 he graduated from the Nikolaev Naval Academy in St. Petersburg. Later, from 1913 to 1915, he commanded the icebreaker Vaygach () during the Arctic Ocean Hydrographic Expedition.
From 1915 during World War I, Novopashenny commanded the modern Novik class destroyer Desna (Russian: Десна). In 1916 he became commander of the destroyer "Constantine" (Russian: Константин). For his services before and during the war, he was awarded the Imperial Russian Order of Saint Anna (Russian: Орденъ Святой Анны) for service (4th stage on 5 May 1904, 3rd stage on 12 August 1907, 2nd stage 12 November 1915). After the October Revolution, he served briefly in the Soviet Navy, and took in April 1918 under the Centrobalt in the negotiations between the German Navy and the Baltic Fleet in Helsinki in part that in Hangö Agreement culminated.
Shortly thereafter, he made a break with his Soviet expectant home and went into exile, first travelling to London and then in 1921 to Germany. In the spring of the same year, Peter Novopashenny becam |
https://en.wikipedia.org/wiki/LDAP%20Admin | LDAP Admin is a free, open-source LDAP directory management tool licensed under the GNU General Public License. Small and compact, LDAP Admin is also highly configurable through the use of the template extensions. In addition to common browsing and editing functions, LDAP Admin provides a directory management functionality by supporting a number of application-specific LDAP objects such as Posix and Samba groups and accounts, Postfix objects and a number of Active Directory objects. It also provides an XML-based template engine which extends the application in a seamless way allowing it to support virtually unlimited number of user defined objects.
Features
Some of the key features include:
Browsing and editing of LDAP directories
Recursive operations on directory trees (copy, move and delete)
Modify operations on datasets
Password management
Management of Posix Groups and Accounts
Management of Samba Groups and Accounts
Postfix MTA Support
Template support
Offline browsing and editing of LDIF files
As of version 1.3 the templates support for JavaScript and VBScript was introduced providing for a dynamic templates.
Limitations
LDAP Admin runs on the Windows operating systems only. By using the Wine software, it is apparently possible to run the application on a Linux and Mac OS X operating systems. There is also a Linux port (still Beta) of LdapAdmin.
See also
List of LDAP software
References
External links
Products introduced in 2003
Directory services
Free software
Free software programmed in Delphi
Pascal (programming language) software |
https://en.wikipedia.org/wiki/Certifying%20algorithm | In theoretical computer science, a certifying algorithm is an algorithm that outputs, together with a solution to the problem it solves, a proof that the solution is correct. A certifying algorithm is said to be efficient if the combined runtime of the algorithm and a proof checker is slower by at most a constant factor than the best known non-certifying algorithm for the same problem.
The proof produced by a certifying algorithm should be in some sense simpler than the algorithm itself, for otherwise any algorithm could be considered certifying (with its output verified by running the same algorithm again). Sometimes this is formalized by requiring that a verification of the proof take less time than the original algorithm, while for other problems (in particular those for which the solution can be found in linear time) simplicity of the output proof is considered in a less formal sense. For instance, the validity of the output proof may be more apparent to human users than the correctness of the algorithm, or a checker for the proof may be more amenable to formal verification.
Implementations of certifying algorithms that also include a checker for the proof generated by the algorithm may be considered to be more reliable than non-certifying algorithms. For, whenever the algorithm is run, one of three things happens: it produces a correct output (the desired case), it detects a bug in the algorithm or its implication (undesired, but generally preferable to continuing without detecting the bug), or both the algorithm and the checker are faulty in a way that masks the bug and prevents it from being detected (undesired, but unlikely as it depends on the existence of two independent bugs).
Examples
Many examples of problems with checkable algorithms come from graph theory.
For instance, a classical algorithm for testing whether a graph is bipartite would simply output a Boolean value: true if the graph is bipartite, false otherwise. In contrast, a certifying algori |
https://en.wikipedia.org/wiki/Community%20respiration | Community respiration (CR) refers to the total amount of carbon-dioxide that is produced by individuals organisms in a given
community, originating from the cellular respiration of organic material. CR is an important ecological index as it dictates the amount
of production for the higher trophic levels and influence biogeochemical cycles.
CR is often used as a proxy for the biological activity of the microbial community.
Overview
The process of cellular respiration is foundational to the ecological index, community respiration (CR). Cellular respiration can be used to explain relationships between heterotrophic organisms and the autotrophic ones they consume. The process of cellular respiration consists of a series of metabolic reactions using biological material produced by autotrophic organisms, such as oxygen () and glucose (C6H12O6) to turn its chemical energy into adenosine triphosphate (ATP) which can then be used in other metabolic reactions to power the organism, creating carbon dioxide () and water () as a by-product.The overall process of cellular respiration can be summarized with, C6H12O6 + 6O2 → 6CO2 + 6H2O + ATP.
The ATP created during cellular respiration is absolutely necessary for a living being to function as it is the 'Energy currency" of the cell and none of the other metabolic functions could be sustained without it. The process of cellular respiration is an essential component of the Carbon Cycle, which tracks the recycling of carbon through the earth and atmosphere in various compounds such as: CO2 ,H2CO3, HCO3- ,C6H12O6 , CH4 to name a few.
The concentration of carbon dioxide in a given area can act as a proxy indicator for metabolic metabolic function of an individual, or individuals in that area. Since the process of cellular respiration consumes oxygen and produces carbon dioxide the amount of carbon dioxide can be used to infer the amount of oxygen used in the environment specifically for metabolic requirements. Since cellular respi |
https://en.wikipedia.org/wiki/Hilscher%20netx%20network%20controller | The netX network controller family (based on ASICs), developed by Hilscher Gesellschaft für Systemautomation mbH, is a solution for implementing all proven Fieldbus and Real-Time Ethernet systems. It was the first Multi-Protocol ASIC which combines Real-Time-Ethernet and Fieldbus System in one solution. The Multiprotocol functionality is done over a flexible cpu sub system called XC. Through exchanging some microcode the XC is able to realize beside others a PROFINET IRT Switch, EtherCAT Slave, Ethernet Powerlink HUB, PROFIBUS, CAN bus, CC-Link Industrial Networks Interface.
The Hilscher netX family
Multiplex Matrix IOs (MMIO)
The Multiplex Matrix is a set of PINs which could be configured freely with peripheral functions. Options are CAN, UART, SPI, I2C, GPIOs**, PIOs and SYNC Trigger.
GPIOs
The GPIOs from Hilscher are able to generate Interrupts, could count level or flags, or could be connected to a timer unit to auto generate a PWM. The Resolution of the PWM is normally 10ns. In some netX ASICS is a dedicated Motion unit with a resolution if 1ns is available.
References
External links
Hilscher homepage
ASICS
Industrial automation
Computer networks
Industrial Ethernet
Industrial computing
CAN bus |
https://en.wikipedia.org/wiki/Phycotechnology | Phycotechnology refers to the technological applications of algae, both microalgae and macroalgae.
Uses
Sewage reclamation
Currently micro-algae are being exploited for environmental protection as the species of Chlorella, Chlamydomonas, and Scenedesmus carry out selective uptake, accumulation and biodegradation of pollutants and thus help in remediation. They are used in biological reclamation of sewage since they can immobilize heavy metals from aquatic systems.
Insecticide
Microalgae can be used as biocontrol agents like 'Insect' a commercial bio-insecticide sold in USA, prepared from the dead biomass of diatom frustules.
Fuel creation
Algae are an excellent feed stock for green fuel as they are used for the production of biodiesel, bioethanol, biogasoline, biomethanol, biobutanol, and recently biohydrogen.
Healthcare
Microalgae are of significant use in healthcare. Chlorellin from the green microalga Chlorella is an effective antibiotic against Gram positive and Gram-negative bacteria.
Other uses
Algae is extremely useful in various fields. An example for natural phycotechnology is the converting of atmospheric nitrogen into bioaccessible nitrogenous compounds by diazotrophic cyanobacteria (blue-green algae). Species of cyanobacteria like Nostoc, Arthrospira (Spirulina) and Aphanizomenon are used as food and feed due to their easy digestibility and nutrient content. Species of Dunaliella provide products like glycerol, carotenoids, and proteins. Algal-produced proteins can be biofactories for the production of therapeutic substances.
References
Algae
Biotechnology
Agricultural technology
Algaculture |
https://en.wikipedia.org/wiki/Pydio | Pydio Cells, previously known as just Pydio and formerly known as AjaXplorer, is an open-source file-sharing and synchronisation software that runs on the user's own server or in the cloud.
Presentation
The project was created by musician Charles Du Jeu (current CEO and CTO) in 2007 under the name AjaXplorer. The name was changed in 2013 and became Pydio (an acronym for Put Your Data in Orbit). In May 2018, Pydio switched from PHP to Go with the release of Pydio Cells. The PHP version reached end-of-life state on 31 December 2019.
Pydio Cells runs on any server supporting a recent Go version. Windows/Linux/macOS on the Intel architecture are directly supported; a fully functional working ARM implementation is under active development.
Pydio Cells has been developed from scratch using the Go programming language; release 4.0.0 introduced code refactoring to fully support the Go modular structure as well as grid computing. Nevertheless, the web-based interface of Cells is very similar to the one from Pydio 8 (in PHP), and it successfully replicates most of its features, while adding a few more. There is also a new synchronisation client (also written in Go). The PHP version has been phased out as the company's focus is moving to Pydio Cells, with community feedback on the new features. According to the company, the switch to the new environment was made "to overcome inherent PHP limitations and provide you with a future-proof and modern solution for collaborating on documents".
From a technical point of view, Pydio differs from solutions such as Google Drive or Dropbox. Pydio is not based on a public cloud; instead, the software connects to the user's existing storage (such as SAN / Local FS, SAMBA / CIFS, (s)FTP, NFS, S3-compatible cloud storage, Azure Blob Storage, Google Cloud Storage) as well as to the existing user directories (LDAP / AD, OAuth2 / OIDC SSO, SAML / Azure ADFS SSO, RADIUS, Shibboleth...), which allows companies to keep their data inside their |
https://en.wikipedia.org/wiki/Zenji%20%28video%20game%29 | Zenji is a puzzle game designed by Matthew Hubbard and published by Activision in 1984. It was released for the Atari 5200, Atari 8-bit family, ColecoVision, Commodore 64, MSX, and ZX Spectrum. Hubbard previously wrote Dolphin for the Atari 2600.
Gameplay
Zenji is a maze-based game, wherein the player controls a "disembodied, Mandarin-style head". The challenge is to connect a series of randomly rotated maze-segments in an attempt to align them with a glowing artifact, known as "the source", which acts as each maze's focal point. The player moves to each segment of the maze and attempts to rotate that portion so that the source's green light can shine into that region, signifying a correct alignment. If all portions of the maze are connected successfully before the end of a timer, the player is awarded points, and moves on to the next stage. Successive mazes introduce greater complexity and hazards to the player's survival.
Reception
In the conclusion of the review for the Commodore 64 edition of Zenji, the author in Compute! Gazette stated, "Although final understanding of the source remains elusive, Zenji is an undeniably enjoyable game". Of note, the last paragraph of the review also stated that, "Zenji appears to be a multiplayer game...up to 8 acolytes at a time...There's no documentation concerning this, however."
Gregg Williams reviewed the game for Computer Gaming World, and stated that "If you like geometric puzzles and games like Othello, you should like Zenji. It is a potential classic and gives exceptional value for the money."
Computer and Video Games rated the ColecoVision version 90% in 1989.
References
External links
Activision games
Atari 5200 games
Atari 8-bit family games
ColecoVision games
Commodore 64 games
MSX games
Puzzle video games
ZX Spectrum games
1984 video games
Video games developed in the United States |
https://en.wikipedia.org/wiki/Object%20point | Object points are an approach used in software development effort estimation under some models such as COCOMO II.
Object points are a way of estimating effort size, similar to Source Lines Of Code (SLOC) or Function Points. They are not necessarily related to objects in Object-oriented programming, the objects referred to include screens, reports, and modules of the language. The number of raw objects and complexity of each are estimated and a weighted total Object-Point count is then computed and used to base estimates of the effort needed.
See also
COCOMO (Constructive Cost Model)
Comparison of development estimation software
Function point
Software development effort estimation
Software Sizing
Source lines of code
Use Case Points
References
Software development |
https://en.wikipedia.org/wiki/Dynamic%20Graphics%20Project | The Dynamic Graphics Project (commonly referred to as dgp) is an interdisciplinary research laboratory at the University of Toronto devoted to projects involving Computer Graphics, Computer Vision, Human Computer Interaction, and Visualization. The lab began as the computer graphics research group of Computer Science Professor in 1967. Mezei invited Bill Buxton, a pioneer of human–computer interaction to join. In 1972, Ronald Baecker, another HCI pioneer joined dgp, establishing dgp as the first Canadian university group focused on computer graphics and human-computer interaction. According to csrankings.org, for the combined subfields of computer graphics, HCI, and visualization the dgp is the number one research institution in the world.
Since then, dgp has hosted many well known faculty and students in computer graphics, computer vision and HCI (e.g., Alain Fournier, Bill Reeves, Jos Stam, Demetri Terzopoulos, Marilyn Tremaine). dgp also occasionally hosts artists in residence (e.g., Oscar-winner Chris Landreth). Many past and current researchers at Autodesk (and before that Alias Wavefront) graduated after working at dgp. dgp is located in the St. George Campus of University of Toronto in the Bahen Centre for Information Technology. dgp researchers regularly publish at ACM SIGGRAPH, ACM SIGCHI and ICCV.
dgp hosts the Toronto User Experience (TUX) Speaker Series and the Sanders Series Lectures.
Notable alumni
Bill Buxton (MS 1978)
James McCrae (PhD 2013)
Dimitris Metaxas (PhD 1992)
Bill Reeves (MS 1976, Ph.D. 1980)
Jos Stam (MS 1991, Ph.D. 1995)
References
Computer graphics
Computer vision
Human–computer interaction
University of Toronto |
https://en.wikipedia.org/wiki/Quaject | In computer science, a quaject is an object-like data structure containing both data and code (or pointers to code), exposed as an interface in the form of callentries, and can accept a list of callentries to other quajects for callbacks and callouts. They were developed by Alexia Massalin in 1989 for the Synthesis kernel, and named for the Qua! Machine, a unique hardware platform built by Massalin. The origin of the term 'qua' is unclear; Massalin claims humorously that it is a sound made by koalas.
The main purpose of quajects is to provide an abstraction to manage self-modifying code, by allowing runtime code optimizing on a per-object basis. While the original Synthesis kernel required quajects to be written in hand-developed assembly language, this was done to avoid developing a complex compiler; Massalin noted that just-in-time compilation (JIT) for a high-level programming language that permits runtime code generation, as in Lisp or Smalltalk, can also apply this approach, though she also asserted that the complexity of such a compiler was likely to be prohibitive.
Quajects differ from more conventional objects in two key ways: first, they always use a form of the dependency injection pattern to manage both interfaces to other quajects, and continuations out of the quaject; the list of callentry references for this is part of quaject creation, and may be updated during the quaject's lifetime. Second, and more critically, a given quaject's set of methods can be unique to the specific quaject; methods for a type or class of quajects are stored as one or more templates, rather than as fixed code. While shared methods can be accessed through a common table of pointers, individual quajects can also have methods that are generated specifically to tailor the performance for that quaject's behavior.
References
Operating system technology |
https://en.wikipedia.org/wiki/FarmBot | FarmBot is an open source precision agriculture CNC farming project consisting of a Cartesian coordinate robot farming machine, software and documentation including a farming data repository. The project aims to "Create an open and accessible technology aiding everyone to grow food and to grow food for everyone."
History
The FarmBot project was started in 2011 by American Rory Aronson whilst studying mechanical engineering at California Polytechnic State University. Aronson attended an elective course in organic agriculture where he learned about a tractor that used machine vision to detect and cover weeds which removed the need for herbicides or manual labour, the tractor cost over US$1 million.
In March 2014 Aronson began working on the project full-time funded by a grant from the Shuttleworth Foundation. Firmware developer Tim Evers and software developer Rick Carlino later joined the project as core developers. Rory Aronson created the company Farmbot.io to provide hardware kits and software services and to serve as a funding source to maintain the open source community.
In 2014 and 2015, FarmBot was entered into the Hackaday Prize, where it became a finalist in 2015. After nine design iterations, the Farmbot Genesis began preorders in July 2016 as the first commercially available version of FarmBot.
Farmbot Genesis
Capabilities
The FarmBot Genesis is able to plant over 30 different crops within the same area at the same time and is able to operate indoors, outdoors and in covered areas. It can perform almost all processes prior to harvesting including sowing, mechanical weed control and watering while accounting for factors such as age of the plant and local weather conditions.
FarmBot Genesis is controlled through a web based interface allowing remote access from any location on most internet enabled devices. It uses an online crop database called OpenFarm to create an optimal planting plan based on the size of the adult crop.
Components
The Farmb |
https://en.wikipedia.org/wiki/DxOMark | DXOMARK is a commercial website described as "an independent benchmark that scientifically assesses smartphones, lenses and cameras". Founded in 2008, DxOMark was originally owned by DxO Labs, a French engineering and consulting company, which is headquartered in Boulogne-Billancourt, Paris, France. DXOMARK Image Labs was separated from DxO Labs in September 2017, and was later re-branded to DXOMARK in 2019. DXOMARK is now a wholly independent privately-owned company.
DXOMARK scores are used in many independent news publications and specialist media sites.
DXOMARK rating systems
The score(s) awarded by DXOMARK are based upon a comprehensive and highly-documented, but commercially secret methodology. An overall 'headline' (v) score is awarded, but that is based upon an aggregated overview of a number of other very specific and detailed test attributes, although the actual weighting of those individual attributes is unknown. DXOMARK themselves stress that "the overall score is not a weighted sum of the sub-scores. It is a proprietary and confidential mapping of sub-scores into a combined score". DXOMARK also highlight that they consult directly with the equipment manufacturers, with the objective of helping them make better cameras.
In respect of specific score figures, it is not clear what headroom or ceiling level is available to the DXOMARK scoring system. Some early high performers might have suggested an upper limit of 100 points, yet later high performers are awarded scores in excess of 100. It is also important to note that the DXOMARK score is not based on any averages.
Camera sensor rating
The DXOMARK Sensor Score measures several important image quality metrics of the RAW image captured by the camera's sensor. The overall score is a confidential combination of three sub-scores:
Colour depth, measured in bits, called a Portrait score;
Dynamic range, measured in stops of dynamic range, called a Landscape score;
Low-light performance, measured in an |
https://en.wikipedia.org/wiki/CBOR | Concise Binary Object Representation (CBOR) is a binary data serialization format loosely based on JSON authored by C. Bormann. Like JSON it allows the transmission of data objects that contain name–value pairs, but in a more concise manner. This increases processing and transfer speeds at the cost of human readability. It is defined in IETF .
Amongst other uses, it is the recommended data serialization layer for the CoAP Internet of Things protocol suite and the data format on which COSE messages are based. It is also used in the Client-to-Authenticator Protocol (CTAP) within the scope of the FIDO2 project.
CBOR was inspired by MessagePack, which was developed and promoted by Sadayuki Furuhashi. CBOR extended MessagePack, particularly by allowing to distinguish text strings from byte strings, which was implemented in 2013 in MessagePack.
Specification of the CBOR encoding
CBOR encoded data is seen as a stream of data items. Each data item consists of a header byte containing a 3-bit type and 5-bit short count. This is followed by an optional extended count (if the short count is in the range 24–27), and an optional payload.
For types 0, 1, and 7, there is no payload; the count is the value. For types 2 (byte string) and 3 (text string), the count is the length of the payload. For types 4 (array) and 5 (map), the count is the number of items (pairs) in the payload. For type 6 (tag), the payload is a single item and the count is a numeric tag number which describes the enclosed item.
Major type and count handling in each data item
Each data item's behaviour is defined by the major type and count.
The major type is used for selecting the main behaviour or type of each data item.
The 5-bit short count field encodes counts 0–23 directly. Short counts of 24–27 indicate the count value is in a following 8, 16, 32 or 64-bit extended count field. Values 28–30 are not assigned and must not be used.
Types are divided into "atomic" types 0–1 and 6–7, for which |
https://en.wikipedia.org/wiki/Reflective%20crack | A reflective crack is a type of failure in asphalt pavement, one of the most popular road surface types. Asphalt pavement is impacted by traffic and thermal loading. Due to loading, cracks can appear on pavement surface that can reduce the Pavement Condition Index (PCI) dramatically.
The pavement can be maintained by overlay. Cracks under the overlay can cause stress concentration at the bottom of the overlay. Due to the repeated stress concentration, a crack starts in the overlay that has a similar shape to the crack in the old pavement. This crack is called a "reflective crack".
Reflective cracking can be categorized as one of the distresses in asphalt pavement. It can affect the general performance and durability of the pavement. A reflective crack can also open a way for water to enter the pavement's body and increase the deterioration rate. Reflective cracks can also happen in overlays placed on joints or cracks in composite pavements such as concrete pavements. Another type of road infrastructure, dynamic inductive charging infrastructure, was found to increase the occurrence of reflective cracks in road surfaces.
See also
Asphalt concrete degradation and restoration
References
Civil engineering
Pavement engineering |
https://en.wikipedia.org/wiki/Classic%20Adventure | Classic Adventure, also known as Adventure 1, is a fantasy text-based video game released by Abersoft in 1982. It was originally released as Adventure 1 on the ZX Spectrum in 1982 before being changed to Classic Adventure in 1984-1985 and re-released on more platforms.
Classic Adventure is a remake of the 1976 text adventure game Colossal Cave Adventure.
Gameplay
As a text based game it starts with the opening "You are standing at the end of a road before a small brick building. Around you is a forest. A small stream flows out of the building and down a gully". From here it is up to the player to decide how to explore the caves in the game. There are obstacles that must be overcome and treasure to bring back to the house.
References
1982 video games
BBC Micro and Acorn Electron games
Commodore 16 and Plus/4 games
Commodore 64 games
MSX games
Video games developed in the United States
ZX81 games
ZX Spectrum games |
https://en.wikipedia.org/wiki/Algorithmic%20paradigm | An algorithmic paradigm or algorithm design paradigm is a generic model or framework which underlies the design of a class of algorithms. An algorithmic paradigm is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.
List of well-known paradigms
General
Backtracking
Branch and bound
Brute-force search
Divide and conquer
Dynamic programming
Greedy algorithm
Recursion
Prune and search
Parameterized complexity
Kernelization
Iterative compression
Computational geometry
Sweep line algorithms
Rotating calipers
Randomized incremental construction
References
Algorithms |
https://en.wikipedia.org/wiki/Astrodatabank | Astrodatabank is a wiki website containing a collection of astrological data. The freely accessible database features the birth details and associated birth charts of public figures and mundane events. The collection was started by astrologer, Lois Rodden in 1979. Astrodatabank is currently owned and maintained by the Swiss company Astrodienst and is published in English.
History
In 1979, Lois Rodden started publishing birth data with her book, Profiles of Women. Eventually this led onto the formation of Astrodatabank. Mark McDonough developed the Astrodatabank database work using the astrology birth data collected by Lois Rodden over 40 years of research. Six months before Lois Rodden died, Lois named Pat Taglilatelo as her successor. The data collection of another lifelong collector, Edwin Charles Steinbrecher, was integrated into the database during the next two years.
In July 2005, McDonough gave Richard Smoot ownership of the company. Astrodatabank was later bought by the Swiss company Astrodienst AG, of Alois Treindl, in 2008, and converted into a wiki project and made freely accessible to all.
Astrodatabank as a wiki was released on 12 March 2009, with 72,271 pages, in English. The names Astrodatabank, Astro-Databank, AstroDatabank, and ADB refer to the one and same project Astrodatabank.
Application and Usage
The contents and data of the wiki have been recommended for the purpose of research related to astrological studies. The project has been referred to by the National Council for Geocosmic Research for astrological research and has been recommended by Astrological Association of Great Britain as a large collection of verified astrological charts and a useful resource for scientific research.
Researchers have imported Astrodatabank birth chart data into the Statistical Package for the Social Sciences (SPSS) for analysis. They claim that Astrodatabank sets the standards for rigorous astrological methodology and meet social scientific research d |
https://en.wikipedia.org/wiki/Pseudoalleles | Pseudoallelism is a state in which two genes with similar functions are located so close to one another on a chromosome that they are genetically linked. This means that the two genes (pseudoalleles) are nearly always inherited together. Since the two genes have related functions, they may appear to act as a single gene. In rare cases, the two linked pseudoalleles can be separated, or recombined. One hypothesis is that pseudoalleles are formed as a result of gene duplication events, and the duplicated genes can undergo gene evolution to develop new functions.
Characteristic of pseudoalleles:
These are closely linked allele within which crossing over occur.
They affect the same character.
Example:
Red eye colour of Drosophila has different mutants like white and apricot. They affect pigmentation i.e., affect the same character. So, they are allelic. They can undergo recombination, i.e., they are nonallelic.
References
Genetics |
https://en.wikipedia.org/wiki/Immuno-psychiatry | Immuno-psychiatry, according to Pariante, is a discipline that studies the connection between the brain and the immune system. It differs from psychoneuroimmunology by postulating that behaviors and emotions are governed by peripheral immune mechanisms. Depression, for instance, is seen as malfunctioning of the immune system.
History
History Tying The Immune System to Psychosis
Since the late 1800’s scientists and physicians have noticed a possible link between the immune system and psychiatric disorders. In 1876 Alexandar Rosenblum, and later in the 1880s Dr. Julius Wagner-Jauregg, observe patients with neurosyphilis, syphilis that had spread to the nervous system, have decreased symptoms of psychosis after contracting malaria. Then from the 1920s, Karl Menninger notices how many patients recovering or recovered from influenza have psychosis similar to that seen in patients with schizophrenia. Moritz Tramer then reports how schizophrenia is associated with a child being born in the winter or spring months (when influenza is most commonly contracted). Later in 1980s, much research is conducted associating increased rates of schizophrenia in patients with a history of prenatal, postnatal infection, and especially childhood central nervous system infections.
History: Tying Inflammatory States to Changes in Mood
William Osler in the 1890s observed that when animals are sick, they became sleepy, depressed, less active, and generally with a lower appetite. Then in the 1890s, investigation into the similarity in these animal “sick behavior” and persons with depression led to more and more studies showing elevated levels of pro-inflammatory cytokines among persons with depression. Many of these early studies in sickness behavior showed significant differences in the many pro-inflammatory cytokines reviving interest into the role that the immune system played in psychiatric disorders.
Modern immuno-psychiatry model
Modern immuno-psychiatry theory now focuses on |
https://en.wikipedia.org/wiki/Adian%E2%80%93Rabin%20theorem | In the mathematical subject of group theory, the Adian–Rabin theorem is a result that states that most "reasonable" properties of finitely presentable groups are algorithmically undecidable. The theorem is due to Sergei Adian (1955) and, independently, Michael O. Rabin (1958).
Markov property
A Markov property P of finitely presentable groups is one for which:
P is an abstract property, that is, P is preserved under group isomorphism.
There exists a finitely presentable group with property P.
There exists a finitely presentable group that cannot be embedded as a subgroup in any finitely presentable group with property P.
For example, being a finite group is a Markov property: We can take to be the trivial group and we can take to be the infinite cyclic group .
Precise statement of the Adian–Rabin theorem
In modern sources, the Adian–Rabin theorem is usually stated as follows:
Let P be a Markov property of finitely presentable groups. Then there does not exist an algorithm that, given a finite presentation , decides whether or not the group defined by this presentation has property P.
The word 'algorithm' here is used in the sense of recursion theory. More formally, the conclusion of Adian–Rabin theorem means that set of all finite presentations
(where is a fixed countably infinite alphabet, and is a finite set of relations in these generators and their inverses)
defining groups with property P, is not a recursive set.
Historical notes
The statement of the Adian–Rabin theorem generalizes a similar earlier result for semigroups by Andrey Markov, Jr., proved by analogous methods. It was also in the semigroup context that Markov introduced the above notion that that group theorists came to call the Markov property of finitely presented groups. This Markov, a prominent Soviet logician, is not to be confused with his father, the famous Russian probabilist Andrey Markov after whom Markov chains and Markov processes are named.
According to Don Collins, |
https://en.wikipedia.org/wiki/Infinitesimal%20cohomology | In mathematics, infinitesimal cohomology is a cohomology theory for algebraic varieties introduced by . In characteristic 0 it is essentially the same as crystalline cohomology. In nonzero characteristic p showed that it is closely related to etale cohomology with mod p coefficients, a theory known to have undesirable properties.
References
.
.
Algebraic geometry
Cohomology theories |
https://en.wikipedia.org/wiki/Walter%20Fricke | Walter Ernst Fricke (1April 191521March 1988) was a distinguished German professor of theoretical astronomy at the University of Heidelberg. He was a mathematician and cryptanalyst during World War II at the Wehrmacht signals intelligence agency, Inspectorate 7/VI from 1941 to 1942 (which would later become the General der Nachrichtenaufklärung. In 1942 he was transferred to the OKW/Chi Section IIb. His specialty was the production of codes and ciphers, and the security studies of Army systems. After the war he was director of the Astronomical Calculation Institute (German: Astronomisches Rechen-Institut) in Heidelberg, Germany.
Life
Walter Fricke was born in Leimbach-Mansfeld near Merseburg, Germany. His father was a carpenter who worked as a miner in the copper-schist mines at Mansfeld. Walter Fricke attended a high school Stephaneum in Aschersleben and passed the final examination (Abitur) in 1934. After high school, he enrolled as a student at Frederick William University in East Berlin, studying astronomy, mathematics and physics. His teachers there included Paul ten Bruggencate and August Kopff in astronomy, Erhard Schmidt in mathematics and Max von Laue in physics.
In 1935, he published his first astronomy papers. These were critiques of Edwin Hubble's studies made at Mount Wilson Observatory on the distribution of spiral nebulae. In 1939, while resident at the Göttingen Observatory, he received his doctorate with a thesis titled Influence of a resisting agent in the dynamics of dense stellar systems (Einfluß eines widerstehenden Mittels in der Dynamik dichter Sternsysteme). He obtained a scholarship to the University of Edinburgh in Scotland, which was arranged with the help of British theoretical cosmologist Dr George C. McVittie, which was due to start on 1 October 1939 but had to be cancelled because of the start of World War II in September 1939. On 1 May 1940 he started work at Hamburg Observatory, and later in that year was drafted into the Signal C |
https://en.wikipedia.org/wiki/Data%20augmentation | Data augmentation is a technique in machine learning used to reduce overfitting when training a machine learning model, by training models on several slightly-modified copies of existing data.
Synthetic oversampling techniques for traditional machine learning
Data augmentation for image classification
When convolutional neural networks grew larger in mid-1990s, there often was not enough available data to train them, especially considering that some part of the overall dataset should be spared for later testing. It was proposed to perturb existing data with affine transformations to create new examples with the same labels, which were complemented by so-called elastic distortions in 2003, and the technique was widely used as of 2010s.
Data augmentation for signal processing
Residual or block bootstrap can be used for time series augmentation.
Biological signals
Synthetic data augmentation is of paramount importance for machine learning classification, particularly for biological data, which tend to be high dimensional and scarce. The applications of robotic control and augmentation in disabled and able-bodied subjects still rely mainly on subject-specific analyses. Data scarcity is notable in signal processing problems such as for Parkinson's Disease Electromyography signals, which are difficult to source - Zanini, et al. noted that it is possible to use a generative adversarial network (in particular, a DCGAN) to perform style transfer in order to generate synthetic electromyographic signals that corresponded to those exhibited by sufferers of Parkinson's Disease.
The approaches are also important in electroencephalography (brainwaves). Wang, et al. explored the idea of using deep convolutional neural networks for EEG-Based Emotion Recognition, results show that emotion recognition was improved when data augmentation was used.
A common approach is to generate synthetic signals by re-arranging components of real data. Lotte proposed a method of "Artificial |
https://en.wikipedia.org/wiki/Semantic%20triple | A semantic triple, or RDF triple or simply triple, is the atomic data entity in the Resource Description Framework (RDF) data model. As its name indicates, a triple is a sequence of three entities that codifies a statement about semantic data in the form of subject–predicate–object expressions (e.g., "Bob is 35", or "Bob knows John").
Subject, predicate and object
This format enables knowledge to be represented in a machine-readable way. Particularly, every part of an RDF triple is individually addressable via unique URIs—for example, the statement "Bob knows John" might be represented in RDF as:
http://example.name#BobSmith12 http://xmlns.com/foaf/0.1/knows http://example.name#JohnDoe34.
Given this precise representation, semantic data can be unambiguously queried and reasoned about.
The components of a triple, such as the statement "The sky has the color blue", consist of a subject ("the sky"), a predicate ("has the color"), and an object ("blue"). This is similar to the classical notation of an entity–attribute–value model within object-oriented design, where this example would be expressed as an entity (sky), an attribute (color) and a value (blue).
From this basic structure, triples can be composed into more complex models, by using triples as objects or subjects of other triples—for example, Mike → said → (triples → can be → objects).
Given their particular, consistent structure, a collection of triples is often stored in purpose-built databases called triplestores.
Difference to relational databases
A relational database is the classical form for information storage, working with different tables, which consist of rows. The query language SQL is able to retrieve information from such a database. In contrast, RDF triple storage works with logical predicates. No tables nor rows are needed, but the information is stored in a text file. A RDF-triple storage can be converted into an SQL database and the other way around. If the knowledge is highly unstruc |
https://en.wikipedia.org/wiki/Pierre%20Hemmer%20%28entrepreneur%29 | Pierre Hemmer, born on in Fribourg and died on in Mons (Var), was a business leader and executive of the Swiss Confederation, active in particular in the field of the Internet. In 1995, he was, with his firm M&Cnet, the only public service provider in the Canton of Fribourg and many other parts of Switzerland.
He spoke widely at conferences and in the media on the projected impact on society, health, education, economics, management, transport, and communication from the advent of new information and communications technology.
Biography
Pierre Hemmer was an electronics and computer ETS engineer. In 1975, he worked for Brown, Boveri & Cie. From 1976 to 1979, he was employed by Landis+Gyr (Zug, Switzerland and California, US) then from 1979 to 1988 by Falma-Control Buser AG, as technical director and project manager.
From 1988 to 1990, going independent, he participated in the creation of the CIM Centre of Western Switzerland (CCSO). He became technical director.
On 3 January 1995 Pierre Hemmer founded MC Management et Communications SA (M&Cnet)., a company resulting from the privatization of the telecommunications and information management activities of the Swiss CIM Action Program This company provides internet access to the general public, mainly in the Canton of Fribourg and in neighboring regions.
After joining the American group Via Net.Works (today Interoute) in October 1999, in 2001, MC Management and Communications SA became Via Net.Works Switzerland SA and extended its coverage.
In 2001, Pierre Hemmer founded the firm hemmer.ch SA in Fribourg; he managed it until 2005.
Engaged in May 2006 by the Federal Chancellery as Head of Development, and then from April 2008 by the State Secretariat for Economic Affairs as Head of eGovernment Services Development, Pierre Hemmer was responsible for initiating a first harmonization of Internet-based government services to all cantons and communes of Switzerland.
Projects and initiatives
In December 1991, H |
https://en.wikipedia.org/wiki/Illinois%20Solar%20Decathlon | Illinois Solar Decathlon (ISD) is an interdisciplinary organization based in the Champaign-Urbana, IL and is the official Solar Decathlon team for the University of Illinois at Urbana-Champaign. It is also closely affiliated with the Illinois School of Architecture.
History and mission
Illinois Solar Decathlon was formed in 2007 after the university's involvement in three past Solar Decathlon competitions. Starting in 2002, the US Department of Energy sponsors a biannual competition where twenty universities from around the world design and construct an innovative and efficient net-zero home. They are transported to a central location and over the course of a week the homes are judged in ten different criteria including energy balance, architecture, communications, and market appeal to name a few. With ISD's increasing involvement in the Solar Decathlon's competition, Europe began having their own Solar Decathlon competitions in 2007, with China joining in a few years later in 2013.
The RSO works to recruit future team members, maintain sponsor relations, and help maintain the three past homes that are near campus. ISD also aims to educate the campus and community about the importance of sustainable energy efficient homes and hope to provide a strong foundation for future Illinois Decathlon teams. ISD has focused on interdisciplinary teamwork and collaboration, with students in architecture, engineering and like disciplines working together on various projects. ISD is constantly searching for new members and there are many opportunities for involvement including working on past homes, marketing efforts, or even being part of the next design team.
Projects - Solar Decathlon competitions
The Solar Decathlon competitions are intended to be a “research goal of reducing the cost of solar-powered homes and advancing solar technology,” according to the Solar Decathlon 2007 (SD07). Illinois Solar Decathlon began its involvement with the Solar Decathlon competitions |
https://en.wikipedia.org/wiki/MSZ96 | MSZ96 is a quantum key distribution protocol which allows a cryptographic key bit to be encoded using four nonorthogonal quantum states described by non-commuting quadrature phase amplitudes of a weak optical field, without photon polarization (BB84 protocol) or entangled photons (E91 protocol). It is named after Yi Mu, Jessica Seberry; Yuliang Zheng.
See also
List of quantum key distribution protocols
References
Quantum cryptography |
https://en.wikipedia.org/wiki/Melbourne%20International%20Games%20Week | Melbourne International Games Week is the largest game professional and consumer communication and networking platform in Asia Pacific, hosted by Creative Victoria. It comprises a confluence of events for three areas of interest, business, consumer and industry.
MIGW 2015 had over 60,000 attendees participating in game developer conferences and consumer shows across the city, including Game Connect Asia Pacific, Unite Melbourne, PAX Australia, Freeplay Independent Games Festival's Parallels showcase, the Women in Games Lunch, Australian Game Developers’ Awards, ACMI Family Day, VR and Serious Games Festival and the Education in Games Summit.
2016's MIGW events were held in close proximity in a number of venues, including the Australian Centre for the Moving Image and the Melbourne Convention and Exhibition Centre. More than 65,000 people attended in 2017.
The 2018 MIGW programme also includes a number of new events, including the first Melbourne Queer Games Festival focusing on games with LGBT content, an e-sports conference, and the new High Score Conference exploring the relationship between games and music.
With the advent of COVID 19, MIGW changed to an online format in 2020-21, featuring interactive events from ACMI, Gamer Cirls and MIGW at the Table, a 12-hour TTRPG gaming and streaming event.
References
External links
Melbourne International Games Week
In the Name of Games #MIGW17
Video game industry
Events in Melbourne
Video gaming in Australia
Observances in Australia
Week-long observances |
https://en.wikipedia.org/wiki/Commission%20Directive%2091/71/EEC | Directive 91/71/EEC is an EU directive passed by the European Commission in 1991 regarding the level of sweeteners, flavourings and additives used in foods by states within the European Union and banning foods that did not comply. The directive was repealed in 2011.
Regulations
The directive required that all foodstuffs containing colouring, additives or flavouring, within member states in the EU had to be identified clearly on the packaging. The directive was an attempt to harmonise the identification of sweeteners and prohibit additives within certain foods. The directive would come into force in 1994, when all foods that did not conform would be banned from sale in the EU.
Prawn cocktail crisps
One particular Euromyth about the directive was that it would lead to a ban of prawn cocktail-flavoured crisps in the United Kingdom. The source of the myth was a proposal by EU Commissioner Martin Bangemann to ban artificial sweeteners in crisps, thus leading to news reports that the EU wanted to ban prawn cocktail crisps altogether. As a result, Bangemann was called "The sour kraut who wants to ban our crisps" in the British media, and journalists followed him in Luxembourg and offered him prawn cocktail crisps.
The potential ban was later proven to be as a result of a mistake on the part of the British civil service, which forgot to include specifically-flavoured crisps when they compiled a list of the nation's food items that were to be exempt from the directive. When the food industry pointed out the omission, the mistake was rectified.
The story was parodied in The Thin Blue Line sitcom in which a French EU Commissioner states, "You [British] insist on eating prawn cocktail crisps, despite the fact we have told you not to". It was also cited by Boris Johnson during the United Kingdom's referendum on the British membership in the European Union campaign in 2016.
References
European Commission
European Union directives
European Union food law
Food additives |
https://en.wikipedia.org/wiki/Objective%20vision | Objective Vision (Object Oriented Visionary) is a project mainly aimed at real-time computer vision and simulation vision of living creatures. it has three sections contain of an open-source library of programming functions for using inside the projects, Virtual laboratory for scholars to check the application of functions directly and by command-line code for external and instant access, and the research section consists of paperwork and libraries to expand the scientific prove of works.
Background
The process has been used in the OVC libraries is as same as what's happening when living see a picture, and it's designed to give the researchers to experience the brain's visual cortex most close simulation for picture perception. The OVC was designed to work as a simulated visual cortex that has a critical job in processing and classify the objects to make it easier to work with pictures and graphical perception and processing. The human brain is much more aware of how it solves complex problems such as playing chess or solving algebra equations, which is why computer programmers have had so much success building machines that emulate this type of activity. but when the whole process is still a riddle that how the entities visionary system works. The project was simulated the visionary system by how it starts to convert the signals to image(actually the edges and colors) and then recognizing the shapes to find a relation between brain's information and image. The Objective Visionary system actually is concentrating on the separable sections, this separation gives the application visionary system the excellence processing result, because with this method the system do not waste much time on processing non significant sections and signals. this operation in the Objective Vision project called objective processing and because the O.V. mission is focused on human visionary simulation, so the developer refers with Objective Vision.
History
Objective-Vision is a Human ( |
https://en.wikipedia.org/wiki/The%20Turing%20Test%20%28video%20game%29 | The Turing Test is a first-person puzzle video game developed by Bulkhead Interactive and published by Square Enix Collective. The game was released for Microsoft Windows and Xbox One in August 2016, for PlayStation 4 in January 2017, for Nintendo Switch in February 2020, and for Stadia in May 2020.
Gameplay
The Turing Test is a puzzle video game with gameplay experienced from a first-person perspective. The player assumes the role of Ava Turing, an International Space Agency (ISA) engineer working at a research station located on Europa, one of Jupiter's moons.
The puzzles involve distributing power through a special tool that can collect and fire power spheres into special receptacles to unlock doors or activate other machinery in the game. As the player progresses, additional elements are introduced, including the ability to observe scenes and activate certain objects via the station's monitoring cameras, and control mobile robots that can be used to explore levels.
Plot
In the far future, engineer Ava Turing is one of several members of a research team sent via the International Space Agency (ISA) to excavate Jupiter's moon Europa. While Ava remains in cryogenic slumber, the other team members are woken and travel to the moon to set up their base and begin conducting their studies, with Ava scheduled to wake once the base is completed. Sometime later, Ava is awoken by the Technical Operations Machine (T.O.M.), an artificial intelligence that monitors the project. T.O.M. tells Ava that her crewmates are in danger and she needs to go down there to help them out. She sets out in a lander and enters the base on Europa. T.O.M. sees that the base's internal configuration has changed from their records, whereby to progress further into the complex, Ava must complete various tests, designed as puzzles (T.O.M. can't solve the rooms, since it is a machine and lacks the creativity of problem solving).
As Ava gets deeper in the complex, T.O.M. determines some of the tea |
https://en.wikipedia.org/wiki/OpenWebRTC | OpenWebRTC (OWR) is a free software stack that implements the WebRTC standard, a set of protocols and application programming interfaces defined by the World Wide Web Consortium (W3C) and the Internet Engineering Task Force (IETF). It is an alternative to the reference implementation that is based on software from Global IP Solutions (GIPS).
It is published under the terms of the Simplified (2-clause) BSD license and officially supports iOS, Linux, OS X, and Android operating systems. It is meant to also work outside web browsers, e.g. to power native mobile apps.
It is mostly written in C and based largely on the multimedia framework GStreamer and a number of other, smaller external libraries. It officially supports both VP8 and H.264 as video formats. For H.264 it uses OpenH264 to which Cisco pays the patent licensing bills.
Development of OpenWebRTC started at Ericsson Research under the lead of Stefan Ålund. They released it as free software in September 2014, together with the proof-of-concept web browser "Bowser" that is based on the stack. Among other things, this initial version didn't support data channels yet and was said to still be less mature than Google's reference implementation.
References
External links
Software using the BSD license
Web development
Web standards |
https://en.wikipedia.org/wiki/Unnatural%20Selection%20%28video%20game%29 | Unnatural Selection is a 1993 game for DOS by Maxis.
Gameplay
In the game, the player breeds mutant animals to fight battles. The game has two phases, the first is the breeding phase in which the player uses various objects and methods (food, drugs, radiation) etc. to breed the animals which will fight future battles. The second is the battle phase in which the animals are deployed on the battlefield in order to combat those of a rogue scientist.
Reception
A 1994 Computer Gaming World survey of strategic space games set in the year 2000 and later gave the game three-plus stars out of five, stating that it was "A different concept, almost carried off with success".
References
1993 video games
Artificial life
Biological simulation video games
DOS games
DOS-only games
Maxis Sim games
Video games about evolution
Video games developed in the United States
Video games set on fictional islands
Video games scored by Howard Drossin |
https://en.wikipedia.org/wiki/Menger%20space | In mathematics, a Menger space is a topological space that satisfies a certain basic selection principle that generalizes σ-compactness. A Menger space is a space in which for every sequence of open covers of the space there are finite sets such that the family covers the space.
History
In 1924, Karl Menger
introduced the following basis property for metric spaces:
Every basis of the topology contains a countable family of sets with vanishing
diameters that covers the space. Soon thereafter,
Witold Hurewicz
observed that Menger's basis property can be reformulated to the above form using sequences of open covers.
Menger's conjecture
Menger conjectured that in ZFC every Menger metric space is σ-compact.
A. W. Miller and D. H. Fremlin
proved that Menger's conjecture is false, by showing that there is,
in ZFC, a set of real numbers that is Menger but not σ-compact.
The Fremlin-Miller proof was dichotomic, and the set witnessing the failure
of the conjecture heavily depends on whether a certain (undecidable) axiom
holds or not.
Bartoszyński and Tsaban
gave a uniform ZFC example of a Menger subset of the real line that is not σ-compact.
Combinatorial characterization
For subsets of the real line, the Menger property can be characterized using continuous functions into the Baire space .
For functions , write if for all but finitely many natural numbers . A subset of is dominating if for each function there is a function such that . Hurewicz proved that a subset of the real line is Menger iff every continuous image of that space into the Baire space is not dominating. In particular, every subset of the real line of cardinality less than the dominating number is Menger.
The cardinality of Bartoszyński and Tsaban's counter-example to Menger's conjecture is
.
Properties
Every compact, and even σ-compact, space is Menger.
Every Menger space is a Lindelöf space
Continuous image of a Menger space is Menger
The Menger property is closed under |
https://en.wikipedia.org/wiki/Approximate%20group | In mathematics, an approximate group is a subset of a group which behaves like a subgroup "up to a constant error", in a precise quantitative sense (so the term approximate subgroup may be more correct). For example, it is required that the set of products of elements in the subset be not much bigger than the subset itself (while for a subgroup it is required that they be equal). The notion was introduced in the 2010s but can be traced to older sources in additive combinatorics.
Formal definition
Let be a group and ; for two subsets we denote by the set of all products . A non-empty subset is a -approximate subgroup of if:
It is symmetric, that is if then ;
There exists a subset of cardinality such that .
It is immediately verified that a 1-approximate subgroup is the same thing as a genuine subgroup. Of course this definition is only interesting when is small compared to (in particular, any subset is a -approximate subgroup). In applications it is often used with being fixed and going to infinity.
Examples of approximate subgroups which are not groups are given by symmetric intervals and more generally arithmetic progressions in the integers. Indeed, for all the subset is a 2-approximate subgroup: the set is contained in the union of the two translates and of . A generalised arithmetic progression in is a subset in of the form , and it is a -approximate subgroup.
A more general example is given by balls in the word metric in finitely generated nilpotent groups.
Classification of approximate subgroups
Approximate subgroups of the integer group were completely classified by Imre Z. Ruzsa and Freiman. The result is stated as follows:
For any there are such that for any -approximate subgroup there exists a generalised arithmetic progression generated by at most integers and containing at least elements, such that .
The constants can be estimated sharply. In particular is contained in at most translates of : this means that ap |
https://en.wikipedia.org/wiki/Increased%20limit%20factor | Increased limit factors or ILFs are multiplicative factors that are applied to premiums for "basic" limits of coverage to determine premiums for higher limits of coverage. They are commonly used in casualty insurance pricing.
Overview
Often, limited data is available to determine appropriate charges for high limits of insurance. In order to price policies with high limits of insurance adequately, actuaries may first determine a "basic limit" premium and then apply increased limits factors. The basic limit is a lower limit of liability under which there is a more credible amount of data.
For example, basic limit loss costs or rates may be calculated for many territories and classes of business. At a relatively low limit of liability, such as $100,000, there may be a high volume of data that can be used to derive those rates. For higher limits, there may be a credible volume of data at the countrywide level but not much data available for individual territories or classes. Increased limit factors can be derived at the countrywide level (or some other broad grouping) and then applied to the basic limit rates to arrive at rates for higher limits of liability.
Formula
An increased limit factor (ILF) at limit L relative to basic limit B can be defined as
where ALAE is the allocated loss adjustment expense provision, ULAE is the unallocated loss adjustment expense provision, and RL is the risk load provision.
An indemnity-only ILF can be expressed as
Often, frequency is assumed to be independent of the policy limit, in which case the formula can be simplified to
The expected severity at each limit is often referred to as "limited average severity," or LAS.
Examples
In the United States, many insurers use ILFs published by the Insurance Services Office, a division of Verisk.
References
Further reading
External links
</ref>
Actuarial science |
https://en.wikipedia.org/wiki/TI-DNOS |
Distributed Network Operating System (DNOS)
The Distributed Network Operating System (DNOS) is a general purpose,
multitasking operating system designed to operate with the Texas Instruments
990/10, 990/10A and 990/12 minicomputers.
DNOS includes a sophisticated file management package which provides support
for key indexed files, sequential files, and relative record files.
DNOS is a multiterminal system that is capable of making each of several users
appear to have exclusive control of the system.
DNOS supports output spooling and program accessible accounting data.
Job level and task level operations enable more efficient use of system
resources.
In addition to multiterminal applications, DNOS provides support for advanced
program development.
Users communicate with DNOS by entering commands at a terminal or by providing
a file of commands.
The System Command Interpreter (SCI) processes those commands and directs the
operating system to initiate the action specified by a command.
A text editor allows the user to enter source programs or data into the system.
A Macro Assembler is provided for assembly language programs.
Several high level languages, including Fortran, COBOL, BASIC, RPG II, and
Pascal, are supported.
A link editor and extended debugging facilities are also provided.
A variety of utility programs and productivity tools support access to and
management of information contained in a data base, design of specific forms
on the screen of a video display terminal (VDT), and word processing.
The system supports a wide range of user environments.
DNOS can support as few as one or two terminals, thus allowing the user of a
smaller System to perform tasks efficiently and yet inexpensively.
Larger configurations with a wide variety of peripherals are also supported.
The maximum configuration size varies with the user's environment.
Almost every minicomputer system requirement or application need can be met
with DNOS.
DNOS provides the base for a variety |
https://en.wikipedia.org/wiki/Great%20Elephant%20Census | The Great Elephant Census—the largest wildlife survey in history—was an African-wide census designed to provide accurate data about the number and distribution of African elephants by using standardized aerial surveys of hundreds of thousands of square miles or terrain in Africa.
The census was completed and published in the online journal PeerJ on 31 August 2016 at a cost of US$7 million.
History
Scientists believe that there were as many as 20 million African elephants two centuries ago. By 1979, only 600,000 elephants remained on the continent.
A pan-African elephant census has not been conducted since the 1970s. The idea of a modern census was devised by Elephants Without Borders and supported, both financially and logistically, by Paul G. Allen. It was also supported by other organizations and individuals, including African Parks, Frankfurt Zoological Society, Wildlife Conservation Society, The Nature Conservancy, IUCN African Elephant Specialist Group, Howard Frederick, Mike Norton-Griffith, Kevin Dunham, Chris Touless, and Curtice Griffin with the report released in September 2016.
Mike Chase, the founder of Elephants Without Borders, was the lead scientist of the census. Chase lead a group of 90 scientists and 286 crew in 18 African countries for over two years to collect the data. During this time the team flew a distance of over , equivalent to flying to the moon and a quarter of the way back, in over 10,000 hours of collecting data. The area covered represents 93% of the elephants known range.
Forest Elephants which live in central and western Africa were excluded from the survey.
Report
The final report was released on 31 August 2016 in Honolulu at the IUCN World Conservation Congress. Data collected showed a 30 percent decline in the population of African savanna elephant in 15 of the 18 countries surveyed. The reduction occurred between 2007 and 2014, representing a loss of approximately 144,000 elephants.
The total population of Africa's savan |
https://en.wikipedia.org/wiki/Token%20Binding | Token Binding is a proposed standard for a Transport Layer Security (TLS) extension that aims to increase TLS security by using cryptographic certificates on both ends of the TLS connection. Current practice often depends on bearer tokens, which may be lost or stolen. Bearer tokens are also vulnerable to man-in-the-middle attacks or replay attacks. In contrast, bound tokens are established by a user agent that generates a private-public key pair per target server, providing the public key to the server, and thereafter proving possession of the corresponding private key on every TLS connection to the server.
Token Binding is an evolution of the Transport Layer Security Channel ID (previously known as Transport Layer Security – Origin Bound Certificates (TLS-OBC)) extension.
Industry participation is widespread with standards contributors including Microsoft, Google, PayPal, Ping Identity, and Yubico. Browser support remains limited, however. Only Microsoft Edge has support for token binding.
IETF standards
The following group of IETF RFCs and Internet Drafts comprise a set of interrelated specifications for implementing different aspects of the Token Binding standard.
The Token Binding Protocol Version 1.0. Allows client/server applications to create long-lived, uniquely identifiable TLS bindings spanning multiple TLS sessions and connections. Applications are then enabled to cryptographically bind security tokens to the TLS layer, preventing token export and replay attacks. To protect privacy, the Token Binding identifiers are only conveyed over TLS and can be reset by the user at any time.
Transport Layer Security (TLS) Extension for Token Binding Protocol Negotiation. Extension for the negotiation of Token Binding protocol version and key parameters.
Token Binding over HTTP. A collection of mechanisms that allow HTTP servers to cryptographically bind security tokens (such as cookies and OAuth tokens) to TLS connections.
Token Binding for Transport Laye |
https://en.wikipedia.org/wiki/Premature%20thelarche | Premature thelarche (PT) is a medical condition, characterised by isolated breast development in female infants. It occurs in females younger than 8 years, with the highest occurrence before the age of 2. PT is rare, occurring in 2.2-4.7% of females aged 0 to 2 years old. The exact cause of the condition is still unknown, but it has been linked to a variety of genetic, dietary and physiological factors.
PT is a form of Incomplete Precocious Puberty (IPP). IPP is the presence of a secondary sex characteristic in an infant, without a change in their sex hormone levels. Central Precocious Puberty (CPP) is a more severe condition than IPP. CPP is the presentation of secondary sex characteristics, with a change in sex hormones due to alteration of the hypothalamic-pituitary-gonadal (HPG) axis.
CPP is an aggressive endocrine disorder with harmful developmental consequences for the patient. At the presentation of PT, diagnostics are used to ensure it is not early stage CPP. CPP can be differentiated from PT through biochemical testing, ultrasounds and ongoing observation. There is no treatment for PT but regular observation is important to ensure it does not progress to CPP. CPP diagnosis is important as treatment is necessary.
Symptoms and signs
Premature thelarche is breast hypertrophy before puberty. This form of hypertrophy is an increase in breast tissue. PT occurs in pre-pubescent females, under the age of 8, having a peak occurrence in the first two years of life. The breast development is usually bi-lateral: both breasts show development. In some cases development may be unilateral: one breast develops.
Patterns of PT
There are four patterns of PT development. Most patients have hypertrophy followed by complete loss of the excess breast tissue (51% of cases) or loss of most excess tissue, but some remains until puberty (36% of cases). Less commonly patients have ongoing patterns of thelarche: 9.7% suffer from a cyclic pattern where the size of the breast tiss |
https://en.wikipedia.org/wiki/Strongback%20%28girder%29 | A strongback is a beam or girder which acts as a secondary support member to an existing structure. A strongback in a staircase is usually ordinary two-by dimensional lumber attached to the staircase stringers to stiffen the assembly. In shipbuilding, a strongback, known as a waler is oriented lengthwise along a ship to brace across several frames to keep the frames square and plumb. In formwork strongbacks (typically vertical) reinforce typically horizontal walers to provide additional support against hydrostatic pressure during concrete pours.
Some rockets like the Antares (rocket), the Falcon 9 and the Falcon Heavy use a strongback to restrain the rocket prior to launch. This structure reclines several degrees away from the rocket to clear the launch, either at the moment of launch or in some case a few minutes before.
References
Building materials
Construction |
https://en.wikipedia.org/wiki/Hot%20Rodders%20of%20Tomorrow | Hot Rodders of Tomorrow is an American national competition where high school students tear-down and rebuild an engine in the shortest time possible. The competition is run by a non-profit organization.
The organization has awarded over US$15.5 million in scholarships, including US$4.55 million in 2015.
References
External links
Official website
Mechanical engineering competitions |
https://en.wikipedia.org/wiki/ESP32 | ESP32 is a series of low-cost, low-power system on a chip microcontrollers with integrated Wi-Fi and dual-mode Bluetooth. The ESP32 series employs either a Tensilica Xtensa LX6 microprocessor in both dual-core and single-core variations, Xtensa LX7 dual-core microprocessor or a single-core RISC-V microprocessor and includes built-in antenna switches, RF balun, power amplifier, low-noise receive amplifier, filters, and power-management modules. ESP32 is created and developed by Espressif Systems, a Chinese company based in Shanghai, and is manufactured by TSMC using their 40 nm process. It is a successor to the ESP8266 microcontroller.
Features
Features of the ESP32 include the following:
Processors:
CPU: Xtensa dual-core (or single-core) 32-bit LX6 microprocessor, operating at 160 or 240 MHz and performing at up to 600 DMIPS
Ultra low power (ULP) co-processor
Memory: 520 KiB RAM, 448 KiB ROM
Wireless connectivity:
Wi-Fi: 802.11 b/g/n
Bluetooth: v4.2 BR/EDR and BLE (shares the radio with Wi-Fi)
Peripheral interfaces:
34 × programmable GPIOs
12-bit SAR ADC up to 18 channels
2 × 8-bit DACs
10 × touch sensors (capacitive sensing GPIOs)
4 × SPI
2 × I²S interfaces
2 × I²C interfaces
3 × UART
SD/SDIO/CE-ATA/MMC/eMMC host controller
SDIO/SPI slave controller
Ethernet MAC interface with dedicated DMA and planned IEEE 1588 Precision Time Protocol support
CAN bus 2.0
Infrared remote controller (TX/RX, up to 8 channels)
Pulse counter (capable of full quadrature decoding)
Motor PWM
LED PWM (up to 16 channels)
Ultra low power analog pre-amplifier
Security:
IEEE 802.11 standard security features all supported, including WPA, WPA2, WPA3 (depending on version) and WLAN Authentication and Privacy Infrastructure (WAPI)
Secure boot
Flash encryption
1024-bit OTP, up to 768-bit for customers
Cryptographic hardware acceleration: AES, SHA-2, RSA, elliptic curve cryptography (ECC), random number generator (RNG)
Power management:
Internal low-dropout regul |
https://en.wikipedia.org/wiki/Design%20for%20additive%20manufacturing | Design for additive manufacturing (DfAM or DFAM) is design for manufacturability as applied to additive manufacturing (AM). It is a general type of design methods or tools whereby functional performance and/or other key product life-cycle considerations such as manufacturability, reliability, and cost can be optimized subjected to the capabilities of additive manufacturing technologies.
This concept emerges due to the enormous design freedom provided by AM technologies. To take full advantages of unique capabilities from AM processes, DfAM methods or tools are needed. Typical DfAM methods or tools includes topology optimization, design for multiscale structures (lattice or cellular structures), multi-material design, mass customization, part consolidation, and other design methods which can make use of AM-enabled features.
DfAM is not always separate from broader DFM, as the making of many objects can involve both additive and subtractive steps. Nonetheless, the name "DfAM" has value because it focuses attention on the way that commercializing AM in production roles is not just a matter of figuring out how to switch existing parts from subtractive to additive. Rather, it is about redesigning entire objects (assemblies, subsystems) in view of the newfound availability of advanced AM. That is, it involves redesigning them because their entire earlier design—including even how, why, and at which places they were originally divided into discrete parts—was conceived within the constraints of a world where advanced AM did not yet exist. Thus instead of just modifying an existing part design to allow it to be made additively, full-fledged DfAM involves things like reimagining the overall object such that it has fewer parts or a new set of parts with substantially different boundaries and connections. The object thus may no longer be an assembly at all, or it may be an assembly with many fewer parts. Many examples of such deep-rooted practical impact of DfAM have been eme |
https://en.wikipedia.org/wiki/DNS%20leak | A DNS leak is a security flaw that allows DNS requests to be revealed to ISP DNS servers, despite the use of a VPN service to attempt to conceal them.
Although primarily of concern to VPN users, it is also possible to prevent it for proxy and direct internet users.
Process
The vulnerability allows an ISP, as well as any on-path eavesdroppers, to see what websites a user may be visiting. This is possible because the browser's DNS requests are sent to the ISP DNS server directly, and not sent through the VPN.
This only occurs with certain types of VPNs, e.g. "split-tunnel" VPNs, where traffic can still be sent over the local network interface even when the VPN is active.
Starting with Windows 8, Microsoft has introduced the "Smart Multi-Homed Named Resolution". This altered the way Windows 8 handled DNS requests, by ensuring that a DNS request could travel across all available network interfaces on the computer. While there is general consensus that this new method of domain name resolution accelerated the time required for a DNS look-up to be completed, it also exposed VPN users to DNS leaks when connected to a VPN endpoint, because the computer would no longer use only the DNS servers assigned by the VPN service. Instead, the DNS request would be sent through all available interfaces, thus the DNS traffic would travel out of the VPN tunnel and expose the user's default DNS servers.
Prevention
Websites exist to allow testing to determine whether a DNS leak is occurring. DNS leaks can be addressed in a number of ways:
Encrypting DNS requests with DNS over HTTPS or DNS over TLS, which prevents the requests from being seen by on-path eavesdroppers.
Using a VPN client which sends DNS requests over the VPN. Not all VPN apps will successfully plug DNS leaks, as it was found in a study by the Commonwealth Scientific and Industrial Research Organisation in 2016 when they carried an in-depth research called "An Analysis of the Privacy and Security Risks of Android VP |
https://en.wikipedia.org/wiki/Secure%20cookie | Secure cookies are a type of HTTP cookie that have Secure attribute set, which limits the scope of the cookie to "secure" channels (where "secure" is defined by the user agent, typically web browser). When a cookie has the Secure attribute, the user agent will include the cookie in an HTTP request only if the request is transmitted over a secure channel (typically HTTPS). Although seemingly useful for protecting cookies from active network attackers, the Secure attribute protects only the cookie's confidentiality. An active network attacker can overwrite Secure cookies from an insecure channel, disrupting their integrity. This issue is officially referred to as Weak Integrity. However, some browsers, including Chrome 52 and higher and Firefox 52 and higher, forgo this specification in favor of better security and forbid insecure sites (HTTP) from setting cookies with the Securedirective.
Even with Secure, some sources recommend that sensitive information never be stored in cookies, on the premise that they are inherently insecure and this flag can't offer real protection. Secure attribute is not the only protection mechanism for cookies, there are also HttpOnly and SameSite attributes. The HttpOnly attribute restricts the cookie from being accessed by, for instance, JavaScript, while the SameSite attribute only allows the cookie to be sent to the application if the request originated from the same domain.
Background
An HTTP cookie is a small packet of data that is sent from a web server to a user's web browser. There are two types of cookie:
Persistent cookies - Cookies that store information in the user's browser for a long time.
Non-persistent cookies - Cookies that generally expire when the browser closes.
Cookies could contain sensitive information, such as passwords and credit card numbers, which are sent over an HTTP connection and might be stored in web browsers as plain text. To prevent attackers from stealing this information, cookies can be secured |
https://en.wikipedia.org/wiki/Carefree%20Black%20Girls | Carefree Black Girls is a cultural concept and movement that aims to increase the breadth of "alternative" representations of black women. The origins of this expression can be traced to both Twitter and Tumblr. Zeba Blay was reportedly the first person to use the expression as a hashtag on Twitter in May 2013. Danielle Hawkins soon launched a blog on Tumblr by the same name. In her article for The Root, Diamond Sharp describes "carefree black girls" as an idea that, "[black women] have used to anchor expressions of individuality and whimsy in the face of the heavy stereotypes and painful realities that too often color discussions of their demographic." At Refinery29, Jamala Johns said it was "a way to celebrate all things joyous and eclectic among brown ladies. Cultivated online and driven by social media, it's one telling piece of a much wider development of inspiration assembled by and for black women." Hillary Crosley Coker, a reporter for Jezebel provides specific examples of notable black women embodying the concept. She claims that, "ladies like Chiara de Blasio (with her hippie flower headband), Solange [Knowles] and her eclectic style and Janelle Monae's futurism are their patron saints".
Reception
The "carefree black girl" movement has prompted the development of related concepts and efforts such as "carefree black boys," a term also dubbed by Blay. Another concept that emerged was "carefree black kids" via the hashtag from Another Round host and Late Night with Stephen Colbert writer Heben Nigatu (#carefreeblackkids2k16). In July 2016, Blavity called the photos and videos posted with Nigatu's hashtag "the bright light we needed after this troubling week," which was marked by the state-sponsored killings of Alton Sterling and Philandro Castile.
Criticism
As the "carefree black girl" concept gained favorable recognition, it has also faced criticism. Shamira Ibrahim, reporter for The Root compares the emergence of the "carefree black girl" concept to "bl |
https://en.wikipedia.org/wiki/Black%20Girl%20Magic | Black Girl Magic is an entertainment, broadcast, and apparel brand, with a TV show and podcast of the same name, created in 2014 by Beverly Bond. Bond is an author, celebrity DJ, model and founder of the women's empowerment organization and acclaimed award show Black Girls Rock!®, established in 2006, which celebrates the power, beauty, and brilliance of black women. In 2014, Bond founded and trademarked Black Girl Magic for an apparel line and talk show she developed under BondVision Media, Inc., Bond's production company. Since 2015, Bond featured Black Girl Magic talks at the annual BLACK GIRLS LEAD Summit for teen girls in New York City. In 2018, Bond launched the Black Girl MagicPodcast to elevate the lived experiences of Black women. In 2019 Bond featured Black Girl Magic panels and talks at the inaugural BGR!FEST held at the Kennedy Center in Washington, DC.
History
Origin
In 2014, Bond registered Black Girl Magic as an extension of the BLACK GIRLS ROCK! brand, an apparel line sold in the BLACK GIRLS ROCK! store, and a TV Show Bond developed under her production company BondVision Media. Bond secured social media handles on Facebook and Twitter for Black Girl Magic® by August 2014. In 2016 Bond executive produced the pilot for the Black Girl Magic TV Show directed by Matthew Cherry, hosted Tatyana Ali and Janell Snowden, and with guest appearances by Jay Ellis, Nzingha Stewart, Lalah Hathaway and MC Lyte. In 2018, Bond created the Black Girl Magic Hour Podcast to continue elevating conversations by and for Black women. Black Girl Magic Hour includes a weekly panel of Black women thought leaders across sectors including Michaela Angela Davis, Kierna Mayo, Raqiyah Mays, Janell Snowden, Beverly Bond and other special guests.
Bond credits friend, feminist author, scholar, and former Black Girls Rock! Board Member, Joan_Morgan_%28American_author%29, with using the phrase "Black Girl Magic" and subconsciously planting the term in her head as early as 2000. In 19 |
https://en.wikipedia.org/wiki/Cost-sharing%20mechanism | In economics and mechanism design, a cost-sharing mechanism is a process by which several agents decide on the scope of a public product or service, and how much each agent should pay for it. Cost-sharing is easy when the marginal cost is constant: in this case, each agent who wants the service just pays its marginal cost. Cost-sharing becomes more interesting when the marginal cost is not constant. With increasing marginal costs, the agents impose a negative externality on each other; with decreasing marginal costs, the agents impose a positive externality on each other (see example below). The goal of a cost-sharing mechanism is to divide this externality among the agents.
There are various cost-sharing mechanisms, depending on the type of product/service and the type of cost-function.
Divisible product, increasing marginal costs
In this setting, several agents share a production technology. They have to decide how much to produce and how to share the cost of production.
The technology has increasing marginal cost - the more is produced, the harder it becomes to produce more units (i.e., the cost is a convex function of the demand).
An example cost-function is:
$1 per unit for the first 10 units;
$10 per unit for each additional unit.
So if there are three agents whose demands are 3 and 6 and 10, then the total cost is $100.
Definitions
A cost-sharing problem is defined by the following functions, where i is an agent and Q is a quantity of the product:
Demand(i) = the amount that agent i wants to receive.
Cost(Q) = the cost of producing Q units of the product.
A solution to a cost-sharing problem is defined by a payment for every agent who is served, such that the total payment equals the total cost:
;
where D is the total demand:
Several cost-sharing solutions have been proposed.
Average cost-sharing
In the literature on cost pricing of a regulated monopoly, it is common to assume that each agent should pay its average cost, i.e.:
In the above ex |
https://en.wikipedia.org/wiki/All%20Tomorrows | All Tomorrows: A Billion Year Chronicle of the Myriad Species and Mixed Fortunes of Man is a 2006 work of science fiction and speculative evolution written and illustrated by the Turkish artist C. M. Kosemen under the pen name Nemo Ramjet. It explores a hypothetical future path of human evolution set from the near future to a billion years from the present. Several future human species evolve through natural means and through genetic engineering, conducted by both humans themselves and by a mysterious and superior alien species called the Qu.
Inspired by the science fiction works of Olaf Stapledon and Edward Gibbon's The History of the Decline and Fall of the Roman Empire, Kosemen worked on All Tomorrows from 2003 to the publication of the book as a free PDF file online in 2006. The book has never been physically published, but as per Kosemen himself "had a life of its own" on the internet. Kosemen intends to eventually publish All Tomorrows in physical form, with new text and updated illustrations.
Summary
Centuries following the Terraforming and colonization of Mars, a brief but catastrophic Interplanetary War takes place between Mars and Earth. After both planets make peace with each other, a large-scale colonization initiative is carried out by genetically engineered humans called Star People throughout the galaxy.
Humans then encounter a malevolent and superior alien species called the Qu. The Qu's religion motivates them to remake the universe through genetic engineering. A short war follows in which humanity is defeated. The Qu bioengineer the surviving humans as punishment into a range of exotic forms, many of them unintelligent. After forty million years of domination, the Qu leave the galaxy, leaving the altered humans to evolve on their own. The bioengineered humans range from worm-like humans to insectivores and modular and cell-based species. The book follows the progress of these new humans as they either go extinct or regain sapience in wildly dif |
https://en.wikipedia.org/wiki/Smart%20speaker | A smart speaker is a type of loudspeaker and voice command device with an integrated virtual assistant that offers interactive actions and hands-free activation with the help of one "hot word" (or several "hot words"). Some smart speakers can also act as a smart device that utilizes Wi-Fi, Bluetooth, and other protocol standards to extend usage beyond audio playback, such as to control home automation devices. This can include, but is not limited to, features such as compatibility across a number of services and platforms, peer-to-peer connection through mesh networking, virtual assistants, and others. Each can have its own designated interface and features in-house, usually launched or controlled via application or home automation software. Some smart speakers also include a screen to show the user a visual response.
As of winter 2017, it is estimated by NPR and Edison Research that 39 million Americans (16% of the population over 18) own a smart speaker.
A smart speaker with a touchscreen is known as a smart display. It is a smart Bluetooth device that integrates conversational user interface with display screens to augment voice interaction with images and video. They are powered by one of the common voice assistants and offer controls for smart home devices, feature streaming apps, and web browsers with touch controls for selecting content. The first smart displays were introduced in 2017 by Amazon (Amazon Echo Show, Amazon Echo Spot).
Accuracy
According to a study by Proceedings of the National Academy of Sciences of the United States of America released In March 2020, the six biggest tech development companies, Amazon, Apple, Google, Yandex, IBM and Microsoft, have misidentified more words spoken by "black people" than "white people". The systems tested errors and unreadability, with a 19 and 35 percent discrepancy for the former and a 2 and 20 percent discrepancy for the latter.
The North American Chapter of the Association for Computational Linguistics ( |
https://en.wikipedia.org/wiki/Pseudo-ring | In mathematics, and more specifically in abstract algebra, a pseudo-ring is one of the following variants of a ring:
A rng, i.e., a structure satisfying all the axioms of a ring except for the existence of a multiplicative identity.
A set R with two binary operations + and ⋅ such that is an abelian group with identity 0, and and for all a, b, c in R.
An abelian group equipped with a subgroup B and a multiplication making B a ring and A a B-module.
None of these definitions are equivalent, so it is best to avoid the term "pseudo-ring" or to clarify which meaning is intended.
See also
Semiring – an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse
References
Ring theory
Algebraic structures
Algebras |
https://en.wikipedia.org/wiki/ABC%20Software%20Metric | The ABC software metric was introduced by Jerry Fitzpatrick in 1997 to overcome the drawbacks of the LOC.
The metric defines an ABC score as a triplet of values that represent the size of a set of source code statements. An ABC score is calculated by counting the number of assignments (A), number of branches (B), and number of conditionals (C) in a program. ABC score can be applied to individual methods, functions, classes, modules or files within a program.
ABC score is represented by a 3-D vector < Assignments (A), Branches (B), Conditionals (C) >. It can also be represented as a scalar value, which is the magnitude of the vector < Assignments (A), Branches (B), Conditionals (C) >, and is calculated as follows:
By convention, an ABC magnitude value is rounded to the nearest tenth.
History
The concept of measuring software size was first introduced by Maurice Halstead from Purdue University in 1975. He suggested that every computer program consists mainly of tokens: operators and operands. He concluded that a count of the number of unique operators and operands gives us a measure of the size of the program. However, this was not adopted as a measure of the size of a program.
Lines of code (LOC) was another popular measure of the size of a program. The LOC was not considered an accurate measure of the size of the program because even a program with identical functionality may have different numbers of lines depending on the style of coding.
Another metric called the Function Point (FP) metric was introduced to calculate the number of user input and output transactions. The function point calculations did not give information about both the functionality of the program nor about the routines that were involved in the program.
The ABC metric is intended to overcome the drawbacks of the LOC, FP and token (operation and operand) counts. However, an FP score can also be used to supplement an ABC score.
Though the author contends that the ABC metric measures size |
https://en.wikipedia.org/wiki/Graph%20%28topology%29 | In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph by replacing vertices by points and each edge by a copy of the unit interval , where is identified with the point associated to and with the point associated to . That is, as topological spaces, graphs are exactly the simplicial 1-complexes and also exactly the one-dimensional CW complexes.
Thus, in particular, it bears the quotient topology of the set
under the quotient map used for gluing. Here is the 0-skeleton (consisting of one point for each vertex ), are the closed intervals glued to it, one for each edge , and is the disjoint union.
The topology on this space is called the graph topology.
Subgraphs and trees
A subgraph of a graph is a subspace which is also a graph and whose nodes are all contained in the 0-skeleton of . is a subgraph if and only if it consists of vertices and edges from and is closed.
A subgraph is called a tree if it is contractible as a topological space. This can be shown equivalent to the usual definition of a tree in graph theory, namely a connected graph without cycles.
Properties
The associated topological space of a graph is connected (with respect to the graph topology) if and only if the original graph is connected.
Every connected graph contains at least one maximal tree , that is, a tree that is maximal with respect to the order induced by set inclusion on the subgraphs of which are trees.
If is a graph and a maximal tree, then the fundamental group equals the free group generated by elements , where the correspond bijectively to the edges of ; in fact, is homotopy equivalent to a wedge sum of circles.
Forming the topological space associated to a graph as above amounts to a functor from the category of graphs to the category of topological spaces.
Every covering space projecting to a graph is also a graph.
See also
Graph homology
Topological graph theory
Nielsen–Schreier theorem, whose standa |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.