source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Short%20integer%20solution%20problem | Short integer solution (SIS) and ring-SIS problems are two average-case problems that are used in lattice-based cryptography constructions. Lattice-based cryptography began in 1996 from a seminal work by Miklós Ajtai who presented a family of one-way functions based on SIS problem. He showed that it is secure in an average case if the shortest vector problem (where for some constant ) is hard in a worst-case scenario.
Average case problems are the problems that are hard to be solved for some randomly selected instances. For cryptography applications, worst case complexity is not sufficient, and we need to guarantee cryptographic construction are hard based on average case complexity.
Lattices
A full rank lattice is a set of integer linear combinations of linearly independent vectors , named basis:
where is a matrix having basis vectors in its columns.
Remark: Given two bases for lattice , there exist unimodular matrices such that .
Ideal lattice
Definition: Rotational shift operator on is denoted by , and is defined as:
Cyclic lattices
Micciancio introduced cyclic lattices in his work in generalizing the compact knapsack problem to arbitrary rings. A cyclic lattice is a lattice that is closed under rotational shift operator. Formally, cyclic lattices are defined as follows:
Definition: A lattice is cyclic if .
Examples:
itself is a cyclic lattice.
Lattices corresponding to any ideal in the quotient polynomial ring are cyclic:
consider the quotient polynomial ring , and let be some polynomial in , i.e. where for .
Define the embedding coefficient -module isomorphism as:
Let be an ideal. The lattice corresponding to ideal , denoted by , is a sublattice of , and is defined as
Theorem: is cyclic if and only if corresponds to some ideal in the quotient polynomial ring .
proof:
We have:
Let be an arbitrary element in . Then, define . But since is an ideal, we have . Then, . But, . Hence, is cyclic.
Let be a cyclic lattic |
https://en.wikipedia.org/wiki/Nuclear%20organization | Nuclear organization refers to the spatial distribution of chromatin within a cell nucleus. There are many different levels and scales of nuclear organisation. Chromatin is a higher order structure of DNA.
At the smallest scale, DNA is packaged into units called nucleosomes. The quantity and organisation of these nucleosomes can affect the accessibility of local chromatin. This has a knock-on effect on the expression of nearby genes, additionally determining whether or not they can be regulated by transcription factors.
At slightly larger scales, DNA looping can physically bring together DNA elements that would otherwise be separated by large distances. These interactions allow regulatory signals to cross over large genomic distances—for example, from enhancers to promoters.
In contrast, on a large scale, the arrangement of chromosomes can determine their properties. Chromosomes are organised into two compartments labelled A ("active") and B ("inactive"), each with distinct properties. Moreover, entire chromosomes segregate into distinct regions called chromosome territories.
Importance
Each human cell contains around two metres of DNA, which must be tightly folded to fit inside the cell nucleus. However, in order for the cell to function, proteins must be able to access the sequence information contained within the DNA, in spite of its tightly-packed nature. Hence, the cell has a number of mechanisms in place to control how DNA is organized.
Moreover, nuclear organization can play a role in establishing cell identity. Cells within an organism have near identical nucleic acid sequences, but often exhibit different phenotypes. One way in which this individuality occurs is through changes in genome architecture, which can alter the expression of different sets of genes. These alterations can have a downstream effect on cellular functions such as cell cycle facilitation, DNA replication, nuclear transport, and alteration of nuclear structure. Controlled changes in |
https://en.wikipedia.org/wiki/Steve%20Simpson%20%28mathematician%29 | Stephen George Simpson is an American mathematician whose research concerns the foundations of mathematics, including work in mathematical logic, recursion theory, and Ramsey theory. He is known for his extensive development of the field of reverse mathematics founded by Harvey Friedman, in which the goal is to determine which axioms are needed to prove certain mathematical theorems. He has also argued for the benefits of finitistic mathematical systems, such as primitive recursive arithmetic, which do not include actual infinity.
A conference in honor of Simpson's 70th birthday was organized in May 2016.
Education
Simpson graduated in 1966 from Lehigh University with a B.A. (summa cum laude) and M.A. in mathematics. He earned a Ph.D. from the Massachusetts Institute of Technology in 1971, with a dissertation entitled Admissible Ordinals and Recursion Theory and supervised by Gerald Sacks.
Career
After short-term positions at Yale University, the University of California, Berkeley, and the University of Oxford, Simpson became an assistant professor at the Pennsylvania State University in 1975. At Penn State, he was Raymond N. Shibley professor from 1987 to 1992.
In 2016, his wife, computer scientist Padma Raghavan, moved from Penn State to Vanderbilt University to become vice provost for research, and Simpson followed her, becoming a research professor at Vanderbilt.
Selected publications
.
.
.
.
. 2nd ed., 2009, .
References
External links
Home page at PSU
Google scholar profile
Year of birth missing (living people)
Living people
20th-century American mathematicians
Lehigh University alumni
Massachusetts Institute of Technology School of Science alumni
Pennsylvania State University faculty
Vanderbilt University faculty
21st-century American mathematicians |
https://en.wikipedia.org/wiki/Turris%20Omnia | Turris Omnia started as a crowdfunded open-source SOHO network router developed by the CZ.NIC association.
On 31 January 2016 the Turris Omnia was presented at FOSDEM 2016.
Routers from campaign were delivered in 2016. After that, routers started to be sold through various resellers including Alza.cz, Amazon and various local resellers.
Design
The Turris Omnia is designed to provide its owner with freedom in use. As such it uses open-source software. In addition, the creators published the electrical schematics.
It also incorporates several security measures. It features automated software updates, so software vulnerabilities can be addressed quickly, a unique feature among SOHO routers. It also enables DNSSEC by default and also allows people to easily participate in distributed adaptive firewall which tries to automatically identify attackers by collecting data from numerous sources.
Apart from that, the router yields a sufficient performance that it can handle gigabit traffic and double as home server, NAS and print server.
Funding
Funding for the Turris Omnia initially funded via a crowdfunding campaign at Indiegogo with a target of US$100 000 by 12 January 2016. As the deadline passed, the funding had reached US$857 000.
At the end of campaign, the funding had reached 1 223 230 US$.
Since then, router is sold in retail via various resellers.
Specifications
It is powered by a 1.6 GHz dual-core Marvell Armada 385 ARM CPU. The base model now has 2 GB RAM and 8 GB flash storage, a real-time clock with battery backup, a SFP module and a hardware cryptographically secure pseudorandom number generator. Via Mini PCI Express it supports Wi-Fi in the form of 3×3 MIMO 802.11ac and the older 2×2 MIMO 802.11b/g/n.
Its connectivity consists of:
1 WAN and 5 LAN gigabit ports
2 USB 3.0 ports
2 Mini PCI Express
1 mSATA / mini PCI Express
1 SIM card slot
Initially the devices shipped with 1 GB RAM by default with a 2 GB upgrade available, however 2 GB is now the |
https://en.wikipedia.org/wiki/Alexander%20Black%20%28photographer%29 | Alexander Black (1859–1940) was an American author, photographer, newspaper man, and the inventor of the pre-cinema “Picture Play” which debuted in 1894.
Early life
Alexander Black was born in New York City in 1859, the eldest child of Peter Black and Sarah MacCrae, both born in Scotland. After a grammar school education and teaching himself printmaking, became a reporter at the Brooklyn Eagle. In 1878 at the age 19 he toured Europe for three months keeping a detailed sketchbook.
Career
Black's career began as a newspaper man in Brooklyn and stenographer for Brooklyn courts, working at the Brooklyn Daily Eagle starting in 1870, editor of the Brooklyn Times (1885–1905), New York World (1905–1910), Frank Seaman, Inc. (1910–1913), Newspaper Feature Service (1913–1926), and as art editor for King Features Syndicate (1926–1935), alongside freelance writing and photography. During this time he also became the first president of the department of photography at the Brooklyn Institute of Arts and Sciences in 1886. His first book was published in 1886 titled Photography Indoors and Out, intended to be a manual for amateur photographers.
On the lyceum circuit, Black presented a magic lantern show of candid photography called "Life through a Detective Camera" (alternately titled "Ourselves as Others See Us") in 1889. Inspired by audience responses to these lectures, as well as emerging work by Eadward Muybridge capturing the effect of motion in photography, Black began to develop a plan to bring fiction to life through dissolving slides.
Over the summer of 1894, he wrote and photographed his first "Picture Play" titled Miss Jerry at Carbon Studio at 5 West 16th Street, New York. The finished work debuted before a live audience on October 9, 1894 at Carbon Studio, featuring a "slow movie" composed of over one hundred glass slide photographs of posed motion, accompanied by a feature-length script.
The Picture Play (See Miss Jerry)
“Primarily my purpose was to illustrate |
https://en.wikipedia.org/wiki/History%20of%20the%20compass | The compass is a magnetometer used for navigation and orientation that shows direction in regards to the geographic cardinal points. The structure of a compass consists of the compass rose, which displays the four main directions on it: East (E), South (S), West (W) and North (N). The angle increases in the clockwise position. North corresponds to 0°, so east is 90°, south is 180° and west is 270°.
The history of the compass started more than 2000 years ago during the Han dynasty (202 BC – 220 AD). The first compasses were made of lodestone, a naturally magnetized stone of iron, in Han dynasty China. It was called the "South Pointing Fish" and was used for land navigation by the mid-11th century during the Song dynasty (960–1279 AD). Shen Kuo provided the first explicit description of a magnetized needle in 1088 and Zhu Yu mentioned its use in maritime navigation in the text Pingzhou Table Talks, dated 1111–1117. Later compasses were made of iron needles, magnetized by striking them with a lodestone. Magnetized needles and compasses were first described in medieval Europe by the English theologian Alexander Neckam (1157–1217 AD). The first usage of a compass in Western Europe was recorded in around 1190 and in the Islamic world 1232. Dry compasses begin appearing around 1269 in Medieval Europe and 1300 in the Medieval Islamic world. This was replaced in the early 20th century by the liquid-filled magnetic compass.
Navigation prior to the compass
Before the introduction of the compass, geographical position and direction at sea were primarily determined by the sighting of landmarks, supplemented with the observation of the position of celestial bodies. Other techniques included sampling mud from the seafloor (China), analyzing the flight path of birds, and observing wind, sea debris, and sea state (Polynesia and elsewhere). Objects that have been understood as having been used for navigation by measuring the angles between celestial objects, were discovered in th |
https://en.wikipedia.org/wiki/Developer%20relations | Developer relations, abbreviated as DevRel, is an umbrella term covering the strategies and tactics for building and nurturing a community of mutually beneficial relationships between organizations and developers (e.g., software developers) as the primary users, and often influencers on purchases, of a product.
Developer Relations is a form of Platform Evangelism and the activities involved are sometimes referred to as a Developer Program or DevRel Program. A DevRel program may comprise a framework built around some or all of the following aspects:
Developer Marketing: Outreach and engagement activities to create awareness and convert developers to use a product.
Developer Education: Product documentation and education resources to aid learning and build affinity with a product and community.
Developer Experience (DX): Resources like a developer portal, product, and documentation, to activate the developer with the least friction.
Developer Success: Activities to nurture and retain developers as they build and scale with a product.
Community: Nourishes a community to maintain a sustainable program.
The impacts and goals of DevRel programs include:
Increased revenue and funding
User growth and retention
Product innovation and improvements
Customer satisfaction and support deflection
Strong technical recruiting pipeline
Brand recognition and awareness
Other goals of DevRel initiatives can include:
Product Building: An organization relies on a community of developers to build their technology (e.g., open source).
Product-market Fit: The product's success depends on understanding developers' needs and desires.
Developer Enablement: Supporting developers' use of the product (e.g., by providing education, tools, and infrastructure).
Developer Perception: To overcome developer perceptions that may be preventing success of a product.
Hiring/Recruiting: To attract potential developers for recruitment.
History and roots
Apple is considered to have crea |
https://en.wikipedia.org/wiki/Ourboox | Ourboox is a free online platform for creating and sharing ebooks that incorporate text, images, videos, puzzles, maps and quizzes.
The Ourboox platform enables users to add text in any language that is compatible with html5, to add artwork in JPEG, PNG, or GIF formats, and to embed various media content from other websites, e.g. YouTube, Vimeo, SoundCloud and others.
Each e-book is identified by its own URL, and can be edited by the author even after it is published. The content on Ourboox is not protected by digital rights management (DRM), and can thus be readily indexed and searched by various search engines.
A feature of Ourboox is the use of a page-flipping script, which emulates printed books. This feature is suited for either direction of reading – right-to-left and left-to-right.
Ourboox has gained popularly among teachers and students, and currently has over 16000 books in 24 languages and 94 genres as of February 2017. It was established by Mel Rosenberg and Ran Shternin, and was launched in 2014.
References
External links
Ourboox website
Book formats
Electronic publishing
Web fiction |
https://en.wikipedia.org/wiki/Real%20element | In group theory, a discipline within modern algebra, an element of a group is called a real element of if it belongs to the same conjugacy class as its inverse , that is, if there is a in with , where is defined as . An element of a group is called strongly real if there is an involution with .
An element of a group is real if and only if for all representations of , the trace of the corresponding matrix is a real number. In other words, an element of a group is real if and only if is a real number for all characters of .
A group with every element real is called an ambivalent group. Every ambivalent group has a real character table. The symmetric group of any degree is ambivalent.
Properties
A group with real elements other than the identity element necessarily is of even order.
For a real element of a group , the number of group elements with is equal to , where is the centralizer of ,
.
Every involution is strongly real. Furthermore, every element that is the product of two involutions is strongly real. Conversely, every strongly real element is the product of two involutions.
If and is real in and is odd, then is strongly real in .
Extended centralizer
The extended centralizer of an element of a group is defined as
making the extended centralizer of an element equal to the normalizer of the set
The extended centralizer of an element of a group is always a subgroup of . For involutions or non-real elements, centralizer and extended centralizer are equal. For a real element of a group that is not an involution,
See also
Brauer–Fowler theorem
Notes
References
Group theory |
https://en.wikipedia.org/wiki/NCP%20Engineering | NCP engineering is a Nuremberg-based company producing software for remote access, industrial internet of things security and information security. NCP's products use virtual private network (VPN) and other technologies like encryption, personal firewalls and electronic certificates in a public key infrastructure (PKI) to secure data communication.
NCP has made its IPsec VPN client compatible with the Windows 10, Windows 11, iOS, macOS, Linux and Android operating systems.
Name
NCP is the abbreviation of "Network Communications Products". The supplement "engineering" describes that the company produces software for secure communications and remote access.
History
NCP engineering was founded in Nuremberg, Germany in 1986. The company produces software for secure data communication through the Internet, networks via 4G/5G and wireless LANs. At the core of NCP's business is provisioning secure communication connections between stationary and mobile end-devices as well as affiliate and branch networks to a company's headquarters.
In 2007, NCP partnered with WatchGuard Technologies.
In January 2010, NCP established a North American affiliate, NCP engineering, Inc.
In February 2010, NCP engineering was awarded US Patent 8811397 B2 for a "System and method for data communication between a user terminal and a gateway via a network node".
NCP engineering has been involved in the ESUKOM project for the development of a real-time security solution that protects corporate networks using integrated security solutions based on a unified metadata format since 2010.
As a SIMU project partner (security information and event management for small SMEs), NCP engineering is focused on optimizing IT security in corporate networks.
After many years of working together, in 2017 NCP engineering and Juniper Networks have intensified their collaboration in a technology partnership.
Juniper Networks and NCP engineering began a partnership in 2011 and intensified their collaborati |
https://en.wikipedia.org/wiki/List%20of%20information%20system%20character%20sets | This list provides an inventory of character coding standards mainly before modern standards like ISO/IEC 646 etc. Some of these standards have been deeply involved in historic events that still have consequences. One notable example of this is the ITA2 coding used during World War II (1939–1945). The nature of these standards is not as common knowledge like it is for ASCII or EBCDIC or their slang names. While 8-bit is the de facto standard as of 2016, in the past 5-bit and 6-bit were more prevalent or their multiple.
See also
ANSEL
SBCS (single-byte character set)
DBCS (double-byte character set)
TBCS (triple-byte character set)
ITU T.61
DEC Radix-50
Cork encoding
Prosigns for Morse code
Telegraph code
TV Typewriter
SI 960 (7-bit Hebrew ISO/IEC 646)
Figure space (typographic unit equal to the size of a single typographic figure)
Six-bit character code
List of binary codes
References
External links
circuitousroot.com: Codes that Don't Count
Character sets
Presentation layer protocols |
https://en.wikipedia.org/wiki/Garden%20waste%20dumping | Garden waste, or green waste dumping is the act of discarding or depositing garden waste somewhere it does not belong.
Garden waste is the accumulated plant matter from gardening activities which involve cutting or removing vegetation, i.e. cutting the lawn, weed removal, hedge trimming or pruning consisting of lawn clippings. leaf matter, wood and soil.
The composition and volume of garden waste can vary from season to season and location to location. A study in Aarhus, Denmark, found that on average, garden waste generation per person ranged between 122 kg to 155 kg per year.
Garden waste may be used to create compost or mulch, which can be used as a soil conditioner, adding valuable nutrients and building humus. The creation of compost requires a balance between, nitrogen, carbon, moisture and oxygen. Without the ideal balance, plant matter may take a long time to break down, drawing nitrogen from other sources, reducing nitrogen availability to existing vegetation which requires it for growth.
The risk of dumping garden waste is that it may contain seeds and plant parts that may grow (propagules), as well as increase fire fuel loads, disrupt visual amenity, accrue economic costs associated with the removal of waste as well as costs associated with the mitigation of associated impacts such as weed control, forest fire.
Cause
There are strong links between weed invasion of natural areas and the proximity and density of housing. The size and duration of the community have a direct relation to the density of weed infestation. Of the various means in which migration of exotic species from gardens take place, such as vegetative dispersal of runners, wind born and fallen seed, garden waste dumping can play a significant role. The results of one North German study found that of the problematic population of Fallopia, app. 29% originated from garden waste. Of a population of Heracleum mantegazzianum, 18% was found by Schepker to be generated by garden waste (as |
https://en.wikipedia.org/wiki/Qualified%20electronic%20signature | A qualified electronic signature is an electronic signature that is compliant with EU Regulation No 910/2014 (eIDAS Regulation) for electronic transactions within the internal European market. It enables to verify the authorship of a declaration in electronic data exchange over long periods of time. Qualified electronic signatures can be considered as a digital equivalent to handwritten signatures.
Description
The purpose of eIDAS was to create a set of standards to ensure that electronic signatures could be used in a secure manner while conducting business online or while conducting official business across borders between EU member states. The qualified electronic signature is one such standard that has been outlined under eIDAS.
A qualified electronic signature is an advanced electronic signature with a qualified digital certificate that has been created by a qualified signature creation device (QSCD). For an electronic signature to be considered as a qualified electronic signature, it must meet three main requirements: First, the signatory must be linked and uniquely identified to the signature. The second point is that data used to create the signature must be under the sole control of the signatory. And last it must have the ability to identify if the data that accompanies the signature has been tampered with since the signing of the message.
It is important to note that creating a qualified electronic signature is more than merely adding a qualified certificate to an advanced electronic signature. The signature must also be created using a qualified signature creation device (QSCD). This device is responsible for qualifying digital signatures by using specific hardware and software that ensures that only the signatory has control of their private key. In addition, a qualified trust service provider manages the signature creation data that is produced. The signature creation data must remain unique, confidential and protected from forgery.
Qualified electr |
https://en.wikipedia.org/wiki/Mind-controlled%20wheelchair | A mind-controlled wheelchair is a mind-machine interfacing device that uses thought (neural impulses) to command the motorised wheelchair's motion. The first such device to reach production was designed by Diwakar Vaish, Head of Robotics and Research at A-SET Training & Research Institutes. The wheelchair is of great importance to patients with locked-in syndrome (LIS), in which a patient is aware but cannot move or communicate verbally due to complete paralysis of nearly all voluntary muscles in the body except the eyes. Such wheelchairs can also be used in case of muscular dystrophy, a disease that weakens the musculoskeletal system and hampers locomotion (walking or moving).
History
The technology behind brain or mind control goes back to at least 2002, when researchers implanted electrodes into the brains of macaque monkeys, which enabled them to control a cursor on a computer screen. Similar techniques were able to control robotic arms and simple joysticks. In 2009, researchers at the University of South Florida developed a wheelchair-mounted robotic arm that captured the user's brain waves and converted them into robotic movements. The Brain-Computer Interface (BCI), which captures P-300 brain wave responses and converts them to actions, was developed by USF psychology professor Emanuel Donchin and colleagues. The P-300 brain signal serves a virtual "finger" for patients who cannot move, such as those with locked-in syndrome or those with Lou Gehrig's Disease (ALS).
Technology
Operation
A mind-controlled wheelchair functions using a brain–computer interface: an electroencephalogram (EEG) worn on the user's forehead detects neural impulses that reach the scalp allowing the micro-controller on board to detect the user's thought process, interpret it, and control the wheelchair's movement.
Functionality
The A-SET wheelchair comes standard with many different types of sensors, like temperature sensors, sound sensors and an array of distance sensors which |
https://en.wikipedia.org/wiki/Facebook%20onion%20address | The Facebook onion address located at facebookwkhpilnemxj7asaniu7vnjjbiltxjqhye3mhbshg7kx5tfyd.onion (formerly facebookcorewwwi.onion) is a site that allows access to Facebook through the Tor protocol, using its .onion top-level domain.
Purported benefits
Prior to the release of an official .onion domain, accessing Facebook through Tor would sometimes lead to error messages and inability to access the website. ProPublica explicitly referenced the existence of Facebook's .onion site when they started their own onion service.
The site also makes it easier for Facebook to differentiate between accounts that have been caught up in a botnet and those that legitimately access Facebook through Tor. As of its 2014 release, the site was still in early stages, with much work remaining to polish the code for Tor access. It has been speculated that other companies will follow suit and release their own Tor-accessible sites.
History
In October 2014, Facebook announced that users could connect to the website through a Tor onion service using the privacy-protecting Tor browser and encrypted using HTTPS. Announcing the feature, Alec Muffett said "Facebook's onion address provides a way to access Facebook through Tor without losing the cryptographic protections provided by the Tor cloud. ... it provides end-to-end communication, from your browser directly into a Facebook datacentre." The network address it used at the time – facebookcorewwwi.onion – is a backronym that stands for Facebook's Core WWW Infrastructure.
In April 2016, it had been used by over 1 million people monthly, up from 525,000 in 2015. Google does not operate sites through Tor, and Facebook has been applauded for allowing such access, which makes it available in countries that actively try to block Facebook.
In May 2021 it updated to an onion version 3 address at facebookwkhpilnemxj7asaniu7vnjjbiltxjqhye3mhbshg7kx5tfyd.onion. This was due to the Tor Project's planned July 2021 deprecation of v2 addresses du |
https://en.wikipedia.org/wiki/Incident%20Object%20Description%20Exchange%20Format | Used for computer security, IODEF (Incident Object Description Exchange Format) is a data format which is used to describe computer security information for the purpose of exchange between Computer Security Incident Response Teams (CSIRTs).
IODEF messages are organized in a human-readable way, and not a machine format. Details of the format are described in RFC 5070 and updated in RFC 6685. Version 2 of the format is defined in RFC 7970, which supersedes the previous version. This RFC presents an implementation of the data model in XML as well as the associated DTD. Further implementation guidance for IODEF v2 is defined in RFC 8274.
One of the main characteristics of IODEF is its compatibility with the IDMEF Intrusion Detection Message Exchange Format developed for intrusion detection systems. For this reason, IODEF is heavily based on IDMEF and provides backward compatibility with it.
Format
IODEF is an object-oriented structured format, composed of 47 classes in the first version. The IODEF and IDMEF formats having a lot in common: the field structure is similar to the IDMEF one and it is an extensible format: in addition to the usual Additional Data Class, which allow adding any information relevant to the IODEF message, most enumerations are provided with an "ext" field. This field is used when none of the proposed choices are fitting.
Here is a list of the main fields:
IncidentID : One. An incident identification number assigned to this incident by the CSIRT who creates the IODEF document.
AlternativeID : Zero or one. The incidents ID numbers used by other CSIRTs to refer to the incident described in the document.
RelatedActivity : Zero or one. The ID numbers of the incidents linked to the one described in this document.
DetectTime : Zero or one. Time at which the incident was detected for the first time.
StartTime : Zero or one. Time at which the incident started.
EndTime : Zero or one. Time at which the incident ended.
ReportTime : One. Time at |
https://en.wikipedia.org/wiki/List%20of%20haplotype%20estimation%20and%20genotype%20imputation%20software | This is a list of notable software for haplotype estimation and genotype imputation.
Alphabetical order:
AlphaImpute
Beagle
cnF2freq
DAGPHASE
Eagle
fastPHASE
FILLIN (part of TASSEL)
FImpute
findhap
FSFHap (part of TASSEL)
HAPI-UR
IMPUTE2
LDMIP
LinkImpute
LinkImputeR
MACH
PHASE
PlantImpute
SHAPEIT2
SHAPEIT3
SHAPEIT4
SimWalk2
SNPHAP
STITCH
WhatsHap
HapCUT2
Hap10
H-PoP
References
Computational biology
Genetics databases
Haplo
Lists of software |
https://en.wikipedia.org/wiki/Parallel%20%28operator%29 | The parallel operator (pronounced "parallel", following the parallel lines notation from geometry; also known as reduced sum, parallel sum or parallel addition) is a mathematical function which is used as a shorthand in electrical engineering, but is also used in kinetics, fluid mechanics and financial mathematics. The name parallel comes from the use of the operator computing the combined resistance of resistors in parallel.
Overview
The parallel operator represents the reciprocal value of a sum of reciprocal values (sometimes also referred to as the "reciprocal formula" or "harmonic sum") and is defined by:
where , , and are elements of the extended complex numbers
The operator gives half of the harmonic mean of two numbers a and b.
As a special case, for any number :
Further, for all distinct numbers
with representing the absolute value of , and meaning the minimum (least element) among and .
If and are distinct positive real numbers then
The concept has been extended from a scalar operation to matrices and further generalized.
Notation
The operator was originally introduced as reduced sum by Sundaram Seshu in 1956, studied as operator ∗ by Kent E. Erickson in 1959, and popularized by Richard James Duffin and William Niles Anderson, Jr. as parallel addition or parallel sum operator : in mathematics and network theory since 1966. While some authors continue to use this symbol up to the present, for example, Sujit Kumar Mitra used ∙ as a symbol in 1970. In applied electronics, a ∥ sign became more common as the operator's symbol around 1974. This was often written as doubled vertical line () available in most character sets (sometimes italicized as //), but now can be represented using Unicode character U+2225 ( ∥ ) for "parallel to". In LaTeX and related markup languages, the macros \| and \parallel are often used (and rarely \smallparallel is used) to denote the operator's symbol.
Properties
Let represent the extended complex plane excludin |
https://en.wikipedia.org/wiki/Networked%20Help%20Desk | Networked Help Desk is an open standard initiative to provide a common API for sharing customer support tickets between separate instances of issue tracking, bug tracking, customer relationship management (CRM) and project management systems to improve customer service and reduce vendor lock-in. The initiative was created by Zendesk in June 2011 in collaboration with eight other founding member organizations including Atlassian, New Relic, OTRS, Pivotal Tracker, ServiceNow and SugarCRM. The first integration, between Zendesk and Atlassian's issue tracking product, Jira, was announced at the 2011 Atlassian Summit. By August 2011, 34 member companies had joined the initiative. A year after launching, over 50 organizations had joined. Within Zendesk instances this feature is branded as ticket sharing.
Basis
Support tools are generally built around a common paradigm that begins with a customer making a request or an incident report, these create a ticket. Each ticket has a progress status and is updated with annotations and attachments. These annotations and attachments may be visible to the customer (public), or only visible to analysts (private). Customers are notified of progress made on their ticket until it is complete. If the people necessary to complete a ticket are using separate support tools, additional overhead is introduced in maintaining the relevant information in the ticket in each tool while notifying the customer of progress made by each group in completing their ticket. For example, if a customer support issue is caused by a software bug and reported to a help desk using one system, and then the fix is documented by the developers in another, and analyzed in a customer relationship management tool, keeping the records in each system up-to-date and notifying the customer manually using a swivel chair approach is unnecessarily time-consuming and error-prone. If information is not transferred correctly, a customer may have to re-explain their problem e |
https://en.wikipedia.org/wiki/Apache%20Apex | Apache Apex is a YARN-native platform that unifies stream and batch processing. It processes big data-in-motion in a way that is scalable, performant, fault-tolerant, stateful, secure, distributed, and easily operable.
Apache Apex was named a top-level project by The Apache Software Foundation on April 25, 2016. As of September 2019, it is no longer actively developed.
Overview
Apache Apex is developed under the Apache License 2.0. The project was driven by the San Jose, California-based start-up company DataTorrent.
There are two parts of Apache Apex: Apex Core and Apex Malhar. Apex Core is the platform or framework for building distributed applications on Hadoop. The core Apex platform is supplemented by Malhar, a library of connector and logic functions, enabling rapid application development. These input and output operators provide templates to sources and sinks such as Alluxio, S3, HDFS, NFS, FTP, Kafka, ActiveMQ, RabbitMQ, JMS, Cassandra, MongoDB, Redis, HBase, CouchDB, generic JDBC, and other database connectors.
History
DataTorrent has developed the platform since 2012 and then decided to open source the core that became Apache Apex. It entered incubation in August 2015 and became Apache Software Foundation top level project within 8 months. DataTorrent itself shut down in May 2018.
As of September 2019, Apache Apex is no longer being developed.
Apex Big Data World
Apex Big Data World
is a conference about Apache Apex. The first conference of Apex Big Data World took place in 2017. They were held in Pune, India and Mountain View, California, USA.
References
External links
Apache Software Foundation projects
Free software programmed in Java (programming language)
Apache Software Foundation
Software using the Apache license
Free system software
Distributed stream processing |
https://en.wikipedia.org/wiki/History%20of%20PDF | The Portable Document Format (PDF) was created by Adobe Systems, introduced at the Windows and OS/2 Conference in January 1993 and remained a proprietary format until it was released as an open standard in 2008. Since then, it is under the control of International Organization for Standardization (ISO) Committee of volunteer industry experts.
PDF was developed to share documents, including text formatting and inline images, among computer users of disparate platforms who may not have access to mutually-compatible application software. It was created by a research and development team called Camelot, led by Adobe's co-founder John Warnock. PDF was one among a number of competing formats such as DjVu, Envoy, Common Ground Digital Paper, Farallon Replica and even Adobe's own PostScript format. In those early years before the rise of the World Wide Web and HTML documents, PDF was popular mainly in desktop publishing workflows.
PDF's adoption in the early days of the format's history was slow. Indeed, the Adobe Board of Directors attempted to cancel the development of the format, as they could see little demand for it. Adobe Acrobat, Adobe's suite for reading and creating PDF files, was not freely available; early versions of PDF had no support for external hyperlinks, reducing its usefulness on the Internet; the larger size of a PDF document compared to plain text required longer download times over the slower modems common at the time; and rendering PDF files was slow on the less powerful machines of the day.
Adobe distributed its Adobe Reader (now Acrobat Reader) program free of charge from version 2.0 onwards, and continued supporting the original PDF, which eventually became the de facto standard for fixed-format electronic documents.
In 2008 Adobe Systems' PDF Reference 1.7 became ISO 32000:1:2008. Thereafter, further development of PDF (including PDF 2.0) is conducted by ISO's TC 171 SC 2 WG 8 with the participation of Adobe Systems and other subject matter ex |
https://en.wikipedia.org/wiki/Kengo%20Hirachi | Kengo Hirachi (平地 健吾 Hirachi Kengo, born 30 November 1964) is a Japanese mathematician, specializing in CR geometry and mathematical analysis.
Hirachi received from Osaka University his B.S. in 1987, his M.S. in 1989, and his Dr.Sci., advised by Gen Komatsu, in 1994 with dissertation The second variation of the Bergman kernel for ellipsoids. He was a research assistant from 1989 to 1996 and a lecturer from 1996 to 2000 at Osaka University. He was an associate professor from 2000 to 2010 and a full professor from 2010 to the present at the University of Tokyo. He was a visiting professor at the Mathematical Sciences Research Institute from October 1995 to September 1996, at the Erwin Schrödinger Institute for Mathematical Physics from March 2004 to April 2004, at Princeton University from October 2004 to July 2005, and at the Institute for Advanced Study from January 2009 to April 2009.
Awards and honors
Takebe Senior Prize (1999) of the Mathematical Society of Japan
Geometry Prize (2003) of the Mathematical Society of Japan
Stefan Bergman Prize (2006)
Inoue Prize for Science (2012)
Invited lecture at ICM, Seoul 2014
References
External links
Kengo Hirachi -- Bibliography, U. of Tokyo website
ICM2014 VideoSeries IL8.3 : Kengo Hirachi on Aug14Thu - YouTube
1964 births
Living people
20th-century Japanese mathematicians
21st-century Japanese mathematicians
Osaka University alumni
Academic staff of the University of Tokyo
Complex analysts
Mathematical analysts
PDE theorists |
https://en.wikipedia.org/wiki/AIX%20Toolbox%20for%20Linux%20Applications | The AIX Toolbox for Linux Applications is a collection of GNU tools for IBM AIX. These tools are available for installation using Red Hat's RPM format.
Licensing
Each of these packages includes its own licensing information and while IBM has made the code available to AIX users, the code is provided as is and has not been thoroughly tested. The Toolbox is meant to provide a core set of some of the most common development tools and libraries along with the more popular GNU packages.
References
External links
AIX Toolbox for Open Source Software - Overview
Programming tools
Free compilers and interpreters
Free software programmed in C
Free software programmed in C++
System administration
Red Hat
UNIX System V
IBM operating systems
Power ISA operating systems
PowerPC operating systems |
https://en.wikipedia.org/wiki/BIZMAC | The RCA BIZMAC was a vacuum tube computer manufactured by RCA from 1956 to 1962. Although RCA was noted for their pioneering work in transistors, RCA decided to build a vacuum tube computer instead of a transistorized computer. It was the largest vacuum tube computer of its time in 1956, occupying of floor space with up to 30,000 tubes, 70,000 diodes, and 35,000 magnetic cores. It weighed about .
History
In 1949, the Mutual Assistance Program (MAP)—later known as the Military Assistance Program—was started by the United States to provide military assistance and supplies to foreign countries needing to rebuild their military defenses after World War II.
In 1951, RCA was awarded a $4.5 million military contract to build a data processing machine to support the logistics necessary for the MAP. The result was the BIZMAC computer system.
The first BIZMAC machine was installed at the Ordnance Tank-Automotive Command (OTAC) in Detroit, Michigan in 1956. Eventually, BIZMAC computer systems were also installed at Higbee Department Stores, Travelers Insurance Company, and New York Life Insurance Company.
The huge BIZMAC system was very quickly made obsolete by faster and more reliable computer systems, including IBM's 705 computer as well as RCA's own transistorized 501 computer. The BIZMAC was taken offline from the OTAC in 1962. Only about six BIZMAC computers were actually made.
Features
A unique feature of the BIZMAC was the use of hundreds of permanently mounted tape drives. This meant that tape data could be accessed immediately without constant mounting and dismounting individual tapes.
Engineers
One of the original engineers of the BIZMAC was Arnold Spielberg, the father of film director and producer Steven Spielberg. Spielberg designed and patented an electronic library system used for searching data stored on magnetic tapes.
See also
List of vacuum tube computers
History of computing hardware
References
External links
BIZMAC Computer History A |
https://en.wikipedia.org/wiki/Multipath%20mitigation | Multipath mitigation is a term typically used in Code Division Multiple Access (CDMA) communications and in GNSS navigation to describe the methods that try to compensate for or cancel the effects of the Non Line Of Sight (NLOS) propagation. The multipath effect occurs when a signal is received not only through a Line of Sight (LOS) path, but also through one or several NLOS paths.
The multipath, if not addressed or compensated, can significantly reduce the performance of the communication and navigation receivers. Various multipath mitigation methods can be used to estimate and remove the undesired NLOS components.
Chip manufactures of CDMA and GNSS receivers, such as Qualcomm, Leica, NovAtel, Septentrio, etc. typically have multipath mitigation algorithms supported by their chipsets. One of the first works in the field of GPS multipath mitigation is in
References
M. Z. H. Bhuiyan, J. Zhang, E.S. Lohan, W. Wang, and S. Sand, “Analysis of multipath mitigation techniques with land mobile satellite channel model” in Radioengineering journal, ISSN 1210-2512, vol. 21(4), Dec 2012, pp. 1067-1078 [Bhuiyan2012]
B. J. H. van den Brekel and D. J. R. van Nee, "GPS multipath mitigation by antenna movements," in Electronics Letters, vol. 28, no. 25, pp. 2286-2288, 3 Dec. 1992. (Brekel1992)
Radio technology |
https://en.wikipedia.org/wiki/Evaporative%20light%20scattering%20detector | An evaporative light scattering detector (ELSD) is a destructive chromatography detector, used in conjunction with high-performance liquid chromatography (HPLC), Ultra high-performance liquid chromatography (UHPLC), Purification liquid chromatography such as flash or preparative chromatography (using a splitter), countercurrent or centrifugal partition chromatography and Supercritical Fluid chromatography (SFC). It is commonly used for analysis of compounds that do not absorb UV-VIS radiation significanly, such as sugars, antiviral drugs, antibiotics, fatty acids, lipids, oils, phospholipids, polymers, surfactants, terpenoids and triglycerides.
ELSDs works by nebulizing the column's effluents into a fine aerosol mist, which then passes through a heated drift tube, where the solvent evaporates. This is the reason why it can be easily used in gradient method of LC and SFC The remaining non-volatile analyte particles are carried further by a carrier gas to a light scattering cell, where a beam of light illuminates them and they scatter it. The scattered light proceeds to a photodiode which converts it to a signal, which is proportional to the mass of the analyte particles. This is the reason why it is considered as a sort of "universal detector" as it is able to detect all compound which are less volatile than the mobile phase, i.e. non volatile and semi-volatile compounds.
ELSD is related to the charged aerosol detector (CAD) , in which the aerosol is charged, and like the CAD, it falls under the category of destructive detectors.
Principles of operation
ELSDs analyze solutes eluting out of the chromatographic column, both in LC and SFC. As the eluent exits the column's outlet into the detector inlet, it is mixed with an inert carrier gas (usually nitrogen) and forced through a nebulizer, which separates the liquid into fine aerosolized droplets. These droplets then pass into a heated drift tube, where the mobile phase solvent is evaporated off. As the mobile p |
https://en.wikipedia.org/wiki/EconStor | EconStor is a disciplinary repository for Economics and Business Studies which offers research literature in Open Access and makes it findable in various portals and search engines. The service is operated by the ZBW – Leibniz Information Centre for Economics.
The majority of the publications originates from German institutions in economic research and is provided in accordance with usage agreements. Individual researchers can also submit their scholarly papers to EconStor.
EconStor maintains a list of influential journals publishing literature in economics. According to latest criteria toll access journals and open access journals can only be included in EconStor collections/archives on condition that they are indexed in Scopus or SSCI and DOAJ as well. EconStor also feed its data to other databases and portals like EconBiz, Google & Google Scholar, BASE — Bielefeld Academic Search Engine, WorldCat, and OpenAIRE. Report publishers and journals publishing quality research are archived with EconStor e.g., Journal of Choice Modelling, International Journal of Management, Economics and Social Sciences, and Weekly Report - DIW Berlin.
Publications include mostly working papers, discussion papers and conference proceedings, but also articles in journals and theses.
The most important professional association for economists in Germany, the Verein für Socialpolitik (German Economic Association), has been using EconStor since 2010 to publish conference papers submitted for its Annual Meeting online.
One of the most important online dissemination channels for EconStor documents is the database RePEc, where EconStor is also one of the largest content providers.
EconStor counts among the largest repositories in its discipline and in Germany with more than 212,000 full-texts.
External links
EconStor website
See also
Open access in Germany
References
Servers (computing)
Open-access archives
Economics libraries |
https://en.wikipedia.org/wiki/Continuous%20configuration%20automation | Continuous configuration automation (CCA) is the methodology or process of automating the deployment and configuration of settings and software for both physical and virtual data center equipment.
Overview
Continuous configuration automation is marketed for data center and application configuration management. CCA tools use a programmable framework for configuration and orchestration through coding, planning, and incrementally adopting policies.
Relationship to DevOps
CCA tools are used for what is called DevOps, and are often included as part of a DevOps toolchain. CCA grew out of a push to develop more reliable software faster. Gartner describes CCA as “Embodying lean, agile and collaborative concepts core to DevOps initiatives, CCA tools bring a newly found level of precision, efficiency and flexibility to the challenges of infrastructure and application configuration management.”
Tools
CCA tools support administrators and developers to automate the configuration and Orchestration of physical and virtual infrastructure in a systematic way that give visibility to state of infrastructure within an enterprise. Generally thought of as an extension of infrastructure as code (IaC) frameworks. CCA tools include Ansible, Chef software, Otter, Puppet (software), Rudder (software) and SaltStack. Each tool has a different method of interacting with the system some are agent-based, push or pull, through an interactive UI. Similar to adopting any DevOps tools, there are barriers to bring on CCA tools and factors that hinder and accelerate adoption.
Notable CCA tools include:
Evaluation factors
Evaluations of CCA tools may consider the following:
Skills, training, and cost required to implement and maintain tool
Content and support of the Platform and Infrastructure – tool specified for Windows or Linux etc.
Delivery method and likening flexibility – important for scalability
Method of interacting with managing system
Support and training availability and cost
Incor |
https://en.wikipedia.org/wiki/Marconi%20Transistorised%20Automatic%20Computer | The Marconi Transistorized Automatic Computer was the first all-transistor computer built by Britain's Marconi Company. It was designed and manufactured from around 1959.
The computer employed germanium transistors which by this time were sufficiently reliable in room temperatures kept below about 23 degrees C. The type S3301 was a 500 kHz clocked, 20-bit word machine with two Mullard core memory stores providing 4k of 20-bit data. The internal CPU logic was synchronised to even and odd clock signals and special signals generated via microinstruction diode boards. The memory logic had slow and fast loops to speed the transfer of sequential data bursts. A facility was provided to microstep through instructions to help with fault-finding. Processor status bits were provided, with machine instructions being decoded from 6 bits in the current address memory word. Double word data had the MSB designated a sign bit, coded as binary fractions (-1 to +1), for the square root, multiply and divide instructions. The instruction set had the usual functions based on three registers named A, B and D (C was the current address in memory register, also called M). An additional instruction assisted with checksum calculation for data transferred to and from main data stores (viz. Sperry Rand magnetic drums).
Applications included marking up radar screens with aircraft information and providing data processing for operators in a nuclear power station. Apart from transistor failure, other common faults included power supply capacitors 'drying out' resulting in excess ripple, and poor connections on the input/output highway. Paper tape peripherals had their own poor reliability, influenced to some degree of operator usage.
Surviving computers (ex power station) are on display at the National Museum of Computing (located in Bletchley Park) and Jim Austin's collection near the University of York. The National Museum system is operational. Copies of original manuals and documentation ar |
https://en.wikipedia.org/wiki/Hydrogen%20isotope%20biogeochemistry | Hydrogen isotope biogeochemistry is the scientific study of biological, geological, and chemical processes in the environment using the distribution and relative abundance of hydrogen isotopes. There are two stable isotopes of hydrogen, protium 1H and deuterium 2H, which vary in relative abundance on the order of hundreds of permil. The ratio between these two species can be considered the hydrogen isotopic fingerprint of a substance. Understanding isotopic fingerprints and the sources of fractionation that lead to variation between them can be applied to address a diverse array of questions ranging from ecology and hydrology to geochemistry and paleoclimate reconstructions. Since specialized techniques are required to measure natural hydrogen isotope abundance ratios, the field of hydrogen isotope biogeochemistry provides uniquely specialized tools to more traditional fields like ecology and geochemistry.
History of hydrogen isotopes
Earliest work
The study of hydrogen stable isotopes began with the discovery of deuterium by chemist Harold Urey of the famous Urey and Miller experiment. Even though the neutron was not realized until 1932, Urey began searching for "heavy hydrogen" in 1931. Urey and his colleague George Murphy calculated the redshift of heavy hydrogen from the Balmer series and observed very faint lines on a spectrographic study. To intensify the spectroscopic lines for publishable data, Murphy and Urey paired with Ferdinand Brickwedde and distilled a more concentrated pool of heavy hydrogen, known today as deuterium. This work on hydrogen isotopes won Urey the 1934 Nobel Prize in Chemistry.
Also in 1934, scientists Ernest Rutherford, Mark Oliphant, and Paul Harteck, produced the radioactive isotope tritium by hitting deuterium with high energy nuclei. The deuterium used in the experiment was a generous gift of heavy water from the Berkeley physicist Gilbert N Lewis. Bombarding deuterium produced two previously undetected isotopes, helium-3 and hyd |
https://en.wikipedia.org/wiki/Behrend%20function | In algebraic geometry, the Behrend function of a scheme X, introduced by Kai Behrend, is a constructible function
such that if X is a quasi-projective proper moduli scheme carrying a symmetric obstruction theory, then the weighted Euler characteristic
is the degree of the virtual fundamental class
of X, which is an element of the zeroth Chow group of X. Modulo some solvable technical difficulties (e.g., what is the Chow group of a stack?), the definition extends to moduli stacks such as the moduli stack of stable sheaves (the Donaldson–Thomas theory) or that of stable maps (the Gromov–Witten theory).
References
.
Geometry |
https://en.wikipedia.org/wiki/Merodiploid | A merodiploid is a partially diploid bacterium, which has its own chromosome complement and a chromosome fragment introduced by conjugation, transformation or transduction. It can also be defined as an essentially haploid organism that carries a second copy of a part of its genome. The term is derived from the Greek, meros = part, and was originally used to describe both unstable partial diploidy, such as that which occurs briefly in recipients after mating with an Hfr strain (1), and the stable state, exemplified by F-prime strains (see Hfr'S And F-Primes). Over time the usage has tended to confine the term to descriptions of stable genetic states. Merodiploidy refers to the partial duplication of chromosomes in a haploid organism.
References
External links
Bacteria
Classical genetics |
https://en.wikipedia.org/wiki/WebUSB | WebUSB is a JavaScript application programming interface (API) specification for securely providing access to USB devices from web applications.
It was published by the Web Platform Incubator Community Group. As of July 2021, it is in Draft Community status, and is supported by Google Chrome, Microsoft Edge, QQ, Opera, and Samsung Internet.
Introduction
A Universal Serial Bus, or a USB is an industry standard communication protocol used to communicate data across connectors, and cables from computers to peripheral devices and/or other computers. WebUSB is a set of API calls that enable access to these hardware devices from web pages. WebUSB is developed by the World Wide Web Consortium (W3C). The WebUSB API provides a safe, and developer familiar means of communication to edges devices from web pages. The WebUSB API integrates into existing USB libraries and shortens the development cycle for integrating new devices into the web environment by not needing to wait for browser support for these devices.
Early versions of WebUSB came out around as an alternative to Flash, Chrome Serial, and other custom approaches to connecting browsers to hardware. WebUSB aims to solve the four goals of any interface being; fast to make, cross platform, look good, accessibility.
Application to Internet of Things (IoT) architecture
WebUSB API's are able to bridge hardware protocols to internet protocols, enabling the creating of uniform gateways linking edge devices to a centralised networks.
The explosion in computing ability over the last few decades has led to an increase in edge devices. Devices such as lights, thermometers, HVAC, motors are increasingly integrated into centralised internet control servers. These devices have evolved from isolated and previously non-integrated development environments. Consequently, they lack the uniform and consistent communication protocol necessary to develop robust networks. The WebUSB's API framework standardises disparate protocols |
https://en.wikipedia.org/wiki/Epi-convergence | In mathematical analysis, epi-convergence is a type of convergence for real-valued and extended real-valued functions.
Epi-convergence is important because it is the appropriate notion of convergence with which to approximate minimization problems in the field of mathematical optimization. The symmetric notion of hypo-convergence is appropriate for maximization problems. Mosco convergence is a generalization of epi-convergence to infinite dimensional spaces.
Definition
Let be a metric space, and a real-valued function for each natural number . We say that the sequence epi-converges to a function if for each
Extended real-valued extension
The following extension allows epi-convergence to be applied to a sequence of functions with non-constant domain.
Denote by the extended real numbers. Let be a function for each . The sequence epi-converges to if for each
In fact, epi-convergence coincides with the -convergence in first countable spaces.
Hypo-convergence
Epi-convergence is the appropriate topology with which to approximate minimization problems. For maximization problems one uses the symmetric notion of hypo-convergence. hypo-converges to if
and
Relationship to minimization problems
Assume we have a difficult minimization problem
where and . We can attempt to approximate this problem by a sequence of easier problems
for functions and sets .
Epi-convergence provides an answer to the question: In what sense should the approximations converge to the original problem in order to guarantee that approximate solutions converge to a solution of the original?
We can embed these optimization problems into the epi-convergence framework by defining extended real-valued functions
So that the problems and are equivalent to the original and approximate problems, respectively.
If epi-converges to , then . Furthermore, if is a limit point of minimizers of , then is a minimizer of . In this sense,
Epi-convergence is the we |
https://en.wikipedia.org/wiki/Proteolysis%20targeting%20chimera | A proteolysis targeting chimera (PROTAC) is a heterobifunctional molecule composed of two active domains and a linker, capable of removing specific unwanted proteins. Rather than acting as a conventional enzyme inhibitor, a PROTAC works by inducing selective intracellular proteolysis. PROTACs consist of two covalently linked protein-binding molecules: one capable of engaging an E3 ubiquitin ligase, and another that binds to a target protein meant for degradation. Recruitment of the E3 ligase to the target protein results in ubiquitination and subsequent degradation of the target protein via the proteasome. Because PROTACs need only to bind their targets with high selectivity (rather than inhibit the target protein's enzymatic activity), there are currently many efforts to retool previously ineffective inhibitor molecules as PROTACs for next-generation drugs.
Initially described by Kathleen Sakamoto, Craig Crews and Ray Deshaies in 2001, the PROTAC technology has been applied by a number of drug discovery labs using various E3 ligases, including pVHL, CRBN, Mdm2, beta-TrCP1, DCAF15, DCAF16, RNF114, and c-IAP1. Yale University licensed the PROTAC technology to Arvinas in 2013–14.
In 2019, Arvinas put two PROTACs into clinical trials: ARV-110, an androgen receptor degrader, and ARV-471, an estrogen receptor degrader.
Mechanism of action
PROTACs achieve degradation through "hijacking" the cell's ubiquitin–proteasome system (UPS) by bringing together the target protein and an E3 ligase.
First, the E1 ligase activates and conjugates the ubiquitin to the E2 ligase. The E2 ligase then forms a complex with the E3 ligase. The E3 ligase targets proteins and covalently attaches the ubiquitin to the protein of interest. Eventually, after a ubiquitin chain is formed, the protein is recognized and degraded by the 26S proteasome. PROTACs take advantage of this cellular system by putting the protein of interest in close proximity to the E3 ligase to catalyze degradation.
Unli |
https://en.wikipedia.org/wiki/Chow%20group%20of%20a%20stack | In algebraic geometry, the Chow group of a stack is a generalization of the Chow group of a variety or scheme to stacks. For a quotient stack , the Chow group of X is the same as the G-equivariant Chow group of Y.
A key difference from the theory of Chow groups of a variety is that a cycle is allowed to carry non-trivial automorphisms and consequently intersection-theoretic operations must take this into account. For example, the degree of a 0-cycle on a stack need not be an integer but is a rational number (due to non-trivial stabilizers).
Definitions
develops the basic theory (mostly over Q) for the Chow group of a (separated) Deligne–Mumford stack. There, the Chow group is defined exactly as in the classical case: it is the free abelian group generated by integral closed substacks modulo rational equivalence.
If a stack X can be written as the quotient stack for some quasi-projective variety Y with a linearized action of a linear algebraic group G, then the Chow group of X is defined as the G-equivariant Chow group of Y. This approach is introduced and developed by Dan Edidin and William A. Graham, as well as Burt Totaro. Later Andrew Kresch (1999) extended the theory to a stack admitting a stratification by quotient stacks.
For higher Chow groups (precursor of motivic homologies) of algebraic stacks, see Roy Joshua's Intersection Theory on Stacks:I and II.
Examples
The calculations depend on definitions. Thus, here, we proceed somehow axiomatically. Specifically, we assume: given an algebraic stack X locally of finite type over a base field k,
(homotopy-invariance) if E is a rank-n vector bundle on X, then .
for each integral substack Z of dimension < p, , a corollary of a localization sequence.
These properties are valid if X is Deligne–Mumford and are expected to hold for any other reasonable theory.
We take X to be the classifying stack , the stack of principal G-bundles for a smooth linear algebraic group G. By definition, it is the quotient stac |
https://en.wikipedia.org/wiki/Span%20%28engineering%29 | In engineering, span is the distance between two intermediate supports for a structure, e.g. a beam or a bridge.
A span can be closed by a solid beam or by a rope. The first kind is used for bridges, the second one for power lines, overhead telecommunication lines, some type of antennas or for aerial tramways.
Span is a significant factor in finding the strength and size of a beam as it determines the maximum bending moment and deflection. The maximum bending moment and deflection in the pictured beam is found using:
where
= Uniformly distributed load
= Length of the beam between two supports (span)
= Modulus of elasticity
= Area moment of inertia
The maximum bending moment and deflection occur midway between the two supports. From this it follows that if the span is doubled, the maximum moment (and with it the stress) will quadruple, and deflection will increase by a factor of sixteen.
See also
List of spans — longest spans of ropes used as power lines, antennas or aerial tramways.
List of longest suspension bridge spans
List of longest cantilever bridge spans
References
Architectural elements
Structural engineering
Bridge components |
https://en.wikipedia.org/wiki/Navigation%20%28journal%29 | Navigation is an open access academic journal about navigation published by the Institute of Navigation in cooperation with HighWire Press.
Its editor-in-chief is Richard B. Langley;
its 2021 impact factor is 2.1.
The Journal Citation Reports categorizes the journal under aerospace engineering, remote sensing, and telecommunications.
The journal publishes original, peer-reviewed papers in an open access (OA) environment on all areas related to the art, science, and engineering of positioning, navigation and timing (PNT) covering land (including indoor use), sea, air, and space applications. PNT technologies of interest encompass navigation satellite systems (both global and regional); inertial navigation, electro-optical systems including LiDAR and imaging sensors; and radio-frequency ranging and timing systems, including those using signals of opportunity from communication systems and other non-traditional PNT sources. Papers about PNT algorithms and methods, such as for error characterization and mitigation, integrity analysis, PNT signal processing, and multi-sensor integration are welcome. The journal also accepts papers on non-traditional applications of PNT systems, including remote sensing of the Earth’s surface or atmosphere, as well as selected historical and survey articles.
References
Navigation
Aerospace engineering journals
Remote sensing journals
Wiley (publisher) academic journals
Academic journals associated with learned and professional societies of the United States |
https://en.wikipedia.org/wiki/Yield%20%28multithreading%29 | In computer science, yield is an action that occurs in a computer program during multithreading, of forcing a processor to relinquish control of the current running thread, and sending it to the end of the running queue, of the same scheduling priority.
Examples
Different programming languages implement yielding in various ways.
pthread_yield() in the language C, a low level implementation, provided by POSIX Threads
std::this_thread::yield() in the language C++, introduced in C++11.
The Yield method is provided in various object-oriented programming languages with multithreading support, such as C# and Java. OOP languages generally provide class abstractions for thread objects.
yield in Kotlin
In coroutines
Coroutines are a fine-grained concurrency primitive, which may be required to yield explicitly. They may enable specifying another function to take control. Coroutines that explicitly yield allow cooperative multitasking.
See also
Coroutines
Java (software platform)
Common Language Runtime
Java virtual machine
Actor model
References
Operating system technology
Concurrent computing
Threads (computing)
Java platform
Computing platforms
Compiler optimizations
Software optimization
Method (computer programming) |
https://en.wikipedia.org/wiki/KUKA%20Robot%20Language | The KUKA Robot Language, also known as KRL, is a proprietary programming language similar to Pascal and used to control KUKA robots.
Features
Any KRL code consists of two different files with the same name: a permanent data file, with the extension .dat, and a movement command file, with the extension .src.
KRL has four basic data types:
User can also create custom data types using enumeration. Enumeration and basic data types can be used to create arrays and structures.
Motion commands support several types of structures as data formats:
FRAME {X 10, Y 0, Z 500, A 0, B 0, C 0}
POS {X 10, Y 0, Z 500, A 0, B 0, C 0, S 6, T 21}
E3POS {X 10, Y 0, Z 500, A 0, B 0, C 0, S 6, T 21, E1 0, E2 0, E3 0}
E6POS {X 10, Y 0, Z 500, A 0, B 0, C 0, S 6, T 21, E1 0, E2 0, E3 0, E4 0, E5 0, E6 0}
AXIS {A1 0, A2 -90, A3 90, A4 0, A5 0, A6 0}
etc.
Robot joints are A1-A6.
External axis joints are E1-E6.
Frame value is sufficient to specify TCP location and orientation. But to also determine unique robot arm pose, additional info is required - S and T or
Status and Turn. They are collection of flags stored as integer.
See also
RAPID
References
Sources
External links
KRL Reference Guide. Release 4.1
Robotics at KUKA
Robot programming languages |
https://en.wikipedia.org/wiki/Dwork%20conjecture | In mathematics, the Dwork unit root zeta function, named after Bernard Dwork, is the L-function attached to the p-adic Galois representation arising from the p-adic etale cohomology of an algebraic variety defined over a global function field of characteristic p. The Dwork conjecture (1973) states that his unit root zeta function is p-adic meromorphic everywhere. This conjecture was proved
by Wan (2000).
References.
Zeta and L-functions
Conjectures that have been proved |
https://en.wikipedia.org/wiki/Sorter%20%28logistics%29 | In logistics, a sorter is a system which performs sortation of products (goods, luggage, mail, etc.) according to their destinations.
A common type of sorter is a conveyor-based system. While they may be based on other conveyor systems, usually sorters are unique types of conveyors.
Sortation is the process of identifying items on a conveyor system and diverting them to specific destinations. Sorters are applied to different applications depending upon the product and the requested rate.
Common elements of sorters
A feeder system whose sole purpose to feed the products into the sorter in proper orientation and with proper spacing, so that the sorter could operate correctly.
Another common element are receptacles which receive the products as they leave the sorter towards a proper destination. Receptacles may be as simple as chutes, or gravity conveyors, or powered conveyors.
Sorter types
There is a number of typical sorter designs.
Cross belt sorter
Paddle sorter
Pop-up transfer sorter
Lineshaft pop-up wheel sorter
Pop-up steerable roller sorter
Pusher or puller sorter
Parcel Singulator
Line Sorter
Shoe sorter
Slide tray sorter
Split tray sorter (bomb-bay sorter)
Tilt tray sorter
References
Logistics
Industrial machinery |
https://en.wikipedia.org/wiki/Cross%20belt%20sorter | In logistics, a cross belt sorter is type of conveyor-based sortation system. It consists of a chain of independently operated short conveyor belts mounted transversely along the main track.
Types of cross belt sorters
There are a variety of different cross-belt sorters — each industry and each cross-belt sorter manufacturer can have unique products. Nevertheless, the standard two are horizontal cross-belt sorters and vertical cross-belt sorters. In both cases, current generations employ linear induction motor technology — this means they are simpler to operate, maintain, and endure less mechanical wear over time.
Horizontal cross-belt sorter. It is a device that sorts objects into bins, shelves, or stations according to the shape and size of the object. The machine consists of two large belts that move in opposite directions, with one belt at right angle to the other. Objects are sorted as they slide across these belts.
Vertical cross-belt sorter. It is a machine that sorts items of different sizes and shapes. It has two belts, one on top of the other, that move in opposite directions. The bottom belt moves forward while the top belt moves back. As items are inserted into the machine, they are carried by the belt to specific openings where they are sorted by size or shape.
References
Logistics
Industrial machinery |
https://en.wikipedia.org/wiki/Distributed%20tree%20search | Distributed tree search (DTS) algorithm is a class of algorithms for searching values in an efficient and distributed manner. Their purpose is to iterate through a tree by working along multiple branches in parallel and merging the results of each branch into one common solution, in order to minimize time spent searching for a value in a tree-like data structure.
The original paper was written in 1988 by Chris Ferguson and Richard E. Korf, from the University of California's Computer Science Department. They used multiple other chess AIs to develop this wider range algorithm.
Overview
The Distributed Tree Search Algorithm (also known as Korf–Ferguson algorithm) was created to solve the following problem: "Given a tree with non-uniform branching factor and depth, search it in parallel with an arbitrary number of processors as fast as possible."
The top-level part of this algorithm is general and does not use a particular existing type of tree-search, but it can be easily specialized to fit any type of non-distributed tree-search.
DTS consists of using multiple processes, each with a node and a set of processors attached, with the goal of searching the sub-tree below the said node. Each process then divides itself into multiple coordinated sub-processes which recursively divide themselves again until an optimal way to search the tree has been found based on the number of processors available to each process. Once a process finishes, DTS dynamically reassigns the processors to other processes as to keep the efficiency to a maximum through good load-balancing, especially in irregular trees.
Once a process finishes searching, it recursively sends and merges a resulting signal to its parent-process, until all the different sub-answers have been merged and the entire problem has been solved.
Applications
DTS is only applicable under two major conditions: the data structure to search through is a tree, and the algorithm can make use of at least one computation unit |
https://en.wikipedia.org/wiki/Biological%20rules | A biological rule or biological law is a generalized law, principle, or rule of thumb formulated to describe patterns observed in living organisms. Biological rules and laws are often developed as succinct, broadly applicable ways to explain complex phenomena or salient observations about the ecology and biogeographical distributions of plant and animal species around the world, though they have been proposed for or extended to all types of organisms. Many of these regularities of ecology and biogeography are named after the biologists who first described them.
From the birth of their science, biologists have sought to explain apparent regularities in observational data. In his biology, Aristotle inferred rules governing differences between live-bearing tetrapods (in modern terms, terrestrial placental mammals). Among his rules were that brood size decreases with adult body mass, while lifespan increases with gestation period and with body mass, and fecundity decreases with lifespan. Thus, for example, elephants have smaller and fewer broods than mice, but longer lifespan and gestation. Rules like these concisely organized the sum of knowledge obtained by early scientific measurements of the natural world, and could be used as models to predict future observations. Among the earliest biological rules in modern times are those of Karl Ernst von Baer (from 1828 onwards) on embryonic development, and of Constantin Wilhelm Lambert Gloger on animal pigmentation, in 1833.
There is some scepticism among biogeographers about the usefulness of general rules. For example, J.C. Briggs, in his 1987 book Biogeography and Plate Tectonics, comments that while Willi Hennig's rules on cladistics "have generally been helpful", his progression rule is "suspect".
List of biological rules
Allen's rule states that the body shapes and proportions of endotherms vary by climatic temperature by either minimizing exposed surface area to minimize heat loss in cold climates or maximizing ex |
https://en.wikipedia.org/wiki/Carlitz%E2%80%93Wan%20conjecture | In mathematics, the Carlitz–Wan conjecture classifies the possible degrees of exceptional polynomials over a finite field Fq of q elements. A polynomial f(x) in Fq[x] of degree d is called exceptional over Fq if every irreducible factor (differing from x − y) or (f(x) − f(y))/(x − y)) over Fq becomes reducible over the algebraic closure of Fq. If q > d4, then f(x) is exceptional if and only if f(x) is a permutation polynomial over Fq.
The Carlitz–Wan conjecture states that there are no exceptional polynomials of degree d over Fq if gcd(d, q − 1) > 1.
In the special case that q is odd and d is even, this conjecture was proposed by Leonard Carlitz (1966) and proved by Fried, Guralnick, and Saxl (1993). The general form of the Carlitz–Wan conjecture was proposed by Daqing Wan (1993) and later proved by Hendrik Lenstra (1995)
References
Conjectures that have been proved
Polynomials |
https://en.wikipedia.org/wiki/The%20Torist | The Torist was a literary journal first released in late 2015, published on the Tor anonymity network. It features short stories, essays and poetry. One of the reasons for publishing on Tor was to return to the idea of rummaging through antiquarian shops – "It gets back to the time when you had to find The Evergreen Review in the stacks at the vintage bookstore" – and the zine can only be accessed through Tor, a dark web site. Its founders are the pseudonymous G.M.H., named after the reclusive 19th-century poet Gerard Manley Hopkins, and Prof. Robert W. Gehl, who is a communication professor focusing on new media at the University of Utah. The two met on the dark-net social network Galaxy, and started collaborating in 2014, taking two years to produce the first issue of the journal. Submissions are made through the anonymous and open-source GlobaLeaks platform — intended for whistleblowing. The founders hope this anonymity can bolster creativity among submissions, and wish to show that anonymity online isn't only for illicit activities.
Entries in the first issue were all named, including acclaimed poet Alissa Quart as well as other authors such as: Vance Osterhout, Linda Kronman, Andreas Zingerle, Nathanel Bassett, Peter Conlin, and JM Porup.
The entries have also gravitated towards issues concerning the modern internet, such as: prolific advertising, surveillance, censorship, and Edward Snowden. entries are being accepted for the second edition of the magazine/journal, on a non-paid basis, but now allowing also anonymous entries. All content in The Torist is published under a Creative Commons license.
As of July 2021, The Torist is offline, due to the shutdown of Tor's Version 2 Onion Services and the fact that The Torist has never moved to Onion Services Version 3. It is likely that The Torist was taken offline before that date.
References
External links
Tumblr blog
Literary magazines published in the United States
Online magazines published in the Unite |
https://en.wikipedia.org/wiki/DeepArt | DeepArt or DeepArt.io was a website that allowed users to create artistic images by using an algorithm to redraw one image using the stylistic elements of another image. with "A Neural Algorithm of Artistic Style" a Neural Style Transfer algorithm that was developed by several of its creators to separate style elements from a piece of art. The tool allows users to create imitation works of art using the style of various artists. The neural algorithm is used by the Deep Art website to create a representation of an image provided by the user by using the 'style' of another image provided by the user. A similar program, Prisma, is an iOS and Android app that was based on the open source programming that underlies DeepArt.
See also
Computational creativity
References
External links
Website
Algorithmic art
Deep learning software applications
Android (operating system) software
IOS software
2015 software |
https://en.wikipedia.org/wiki/Heart%20of%20Europe%20Bio-Crystallography%20Meeting | The Heart of Europe Bio-Crystallography Meeting (short HEC-Meeting) is an annual academic conference on structural biology, in particular protein crystallography. Researchers from universities, other research institutions and industry from Austria, Czech Republic, Germany and Poland meet to present and discuss current topics of their research. The talks are predominantly given by PhD students (doctoral students). An exception is the invited HEC lecture, which is held by a renowned scientist of the research field. The format of the HEC meeting has been adopted from the eleven years older Rhine-Knee Regional Meeting on Structural Biology.
History of the HEC-Meeting
The HEC-Meeting dates back to an initiative in the year 1998 of Manfred Weiss and Rolf Hilgenfeld, who were researchers at the Institute for Molecular Biotechnology (IMB) in Jena and intended to establish a meeting format similar to the Rhine-Knee Regional Meeting on Structural Biology in the New Länder. Both conferences are regional meetings of German scientists together with scientific research groups of the neighbouring countries. Nine groups from Germany (the new states and West-Berlin), Poland and Czech Republic participated in the first HEC-Meeting from 8 to 10 October 1998. Later also groups from Austria and the Old Federal States participated. Due to the Covid-19 pandemic, no meeting was organized in 2020 and HEC-23 took place as an online meeting.
Former HEC-Meetings:
References
External links
Website of HEC-16 at the Attersee, Austria
Website of HEC-17 in Berlin-Schmöckwitz, Germany
Website of HEC-18 in Kutná Hora, Czech Republic
Academic conferences
Structural biology |
https://en.wikipedia.org/wiki/Quotient%20automaton | In computer science, in particular in formal language theory, a quotient automaton can be obtained from a given nondeterministic finite automaton by joining some of its states. The quotient recognizes a superset of the given automaton; in some cases, handled by the Myhill–Nerode theorem, both languages are equal.
Formal definition
A (nondeterministic) finite automaton is a quintuple A = ⟨Σ, S, s0, δ, Sf⟩, where:
Σ is the input alphabet (a finite, non-empty set of symbols),
S is a finite, non-empty set of states,
s0 is the initial state, an element of S,
δ is the state-transition relation: δ ⊆ S × Σ × S, and
Sf is the set of final states, a (possibly empty) subset of S.
A string a1...an ∈ Σ* is recognized by A if there exist states s1, ..., sn ∈ S such that ⟨si-1,ai,si⟩ ∈ δ for i=1,...,n, and sn ∈ Sf. The set of all strings recognized by A is called the language recognized by A; it is denoted as L(A).
For an equivalence relation ≈ on the set S of A’s states, the quotient automaton A/≈ = ⟨Σ, S/≈, [s0], δ/≈, Sf/≈⟩ is defined by
the input alphabet Σ being the same as that of A,
the state set S/≈ being the set of all equivalence classes of states from S,
the start state [s0] being the equivalence class of A’s start state,
the state-transition relation δ/≈ being defined by δ/≈([s],a,[t]) if δ(s,a,t) for some s ∈ [s] and t ∈ [t], and
the set of final states Sf/≈ being the set of all equivalence classes of final states from Sf.
The process of computing A/≈ is also called factoring A by ≈.
Example
For example, the automaton A shown in the first row of the table is formally defined by
ΣA = {0,1},
SA = {a,b,c,d},
s = a,
δA = { ⟨a,1,b⟩, ⟨b,0,c⟩, ⟨c,0,d⟩ }, and
S = { b,c,d }.
It recognizes the finite set of strings { 1, 10, 100 }; this set can also be denoted by the regular expression "1+10+100".
The relation (≈) = { ⟨a,a⟩, ⟨a,b⟩, ⟨b,a⟩, ⟨b,b⟩, ⟨c,c⟩, ⟨c,d⟩, ⟨d,c⟩, ⟨d,d⟩ }, more briefly denoted as a≈b,c≈d, is an equivalence relation on the set {a,b,c,d} o |
https://en.wikipedia.org/wiki/Transparent%20wood%20composite | Transparent wood composites are novel wood materials which have up to 90% transparency. Some have better mechanical properties than wood itself. They were made for the first time in 1992. These materials are significantly more biodegradable than glass and plastics. Transparent wood is also shatterproof.
History
A research group led by Professor Lars Berglund from Swedish KTH University along with a University of Maryland research group led by Professor Liangbing Hu have developed a method to remove the color and some chemicals from small blocks of wood, followed by adding polymers, such as poly(methyl methacrylate) (PMMA) and epoxy, at the cellular level, thereby rendering them transparent.
As soon as released in between 2015 and 2016, see-through wood had a large press reaction, with articles in ScienceDaily, Wired, The Wall Street Journal, and The New York Times.
Actually those research groups rediscovered a work from Siegfried Fink, a German Researcher, from as early as 1992: with a process very similar to Berglund's and Hu's, the German Researcher turned wood transparent to reveal specific cavities of the wood structure for analytical purpose.
In 2021 researchers reported a way to manufacture transparent wood lighter and stronger than glass that requires substantially smaller amounts of chemicals and energy than methods used before. The thin wood produced with "solar-assisted chemical brushing" is claimed to be lighter and about 50 times stronger than wood treated with previous processes.
Process
In its natural state, wood is not a transparent material because of its scattering and absorption of light. The tannish color in wood is due to its chemical polymer composition of cellulose, hemicellulose, and lignin. The wood's lignin is mostly responsible for the wood's distinctive color. Consequently, the amount of lignin determines the levels of visibility in the wood, around 80–95%. To make wood a visible and transparent material, both absorption and scatter |
https://en.wikipedia.org/wiki/AirDine | AirDine was a supper club mobile app based on the sharing economy principles where individuals stand as both supplier and customer, similar to Airbnb in the short time rental market.
AirDine discontinued their service after 31 October 2017.
Operations
AirDine is an online marketplace for home dining that connects users that likes to cook (often professional chef or homecooks) with users looking for a fun dining experience. Users are categorized as "Hosts" and "Guests," both of whom must register with AirDine using a variety of means.
Profiles include details such as user reviews and shared social connections to build a reputation and trust among users of the marketplace. Other elements of the AirDine profile include user recommendations and a private messaging system.
Corporate information
Business model
AirDine is a peer-to-peer home dining market place that connects hosts and guests via its app. AirDine enables transactions between these two entities by charging a 'service fee' without directly hosting any dinners by itself. This new business model disrupt traditional industries by creating new sources of supply and rely on curation for developing quality and self-attainment of maturity from the vendors, or the people operating on behalf of vendors. Security and safety of the host are not vetted by AirDine and are completely left to users to choose based on published reviews. Unlike traditional restaurants, AirDine scales not by scaling inventory and sales but by increasing the hosts and guests and matching them with each other.
See also
Online platforms for collaborative consumption
Filip Johansen
References
Online services
Swedish companies established in 2016
Business models
Sharing economy
Decentralization
Supper clubs
Internet properties disestablished in 2017
Internet properties established in 2016
2016 establishments in Sweden
2017 disestablishments in Sweden |
https://en.wikipedia.org/wiki/Read-once%20function | In mathematics, a read-once function is a special type of Boolean function that can be described by a Boolean expression in which each variable appears only once.
More precisely, the expression is required to use only the operations of logical conjunction, logical disjunction, and negation. By applying De Morgan's laws, such an expression can be transformed into one in which negation is used only on individual variables (still with each variable appearing only once). By replacing each negated variable with a new positive variable representing its negation, such a function can be transformed into an equivalent positive read-once Boolean function, represented by a read-once expression without negations.
Examples
For example, for three variables , , and , the expressions
, and
are all read-once (as are the other functions obtained by permuting the variables in these expressions). However, the Boolean median operation, given by the expression
is not read-once: this formula has more than one copy of each variable, and there is no equivalent formula that uses each variable only once.
Characterization
The disjunctive normal form of a (positive) read-once function is not generally itself read-once. Nevertheless, it carries important information about the function. In particular, if one forms a co-occurrence graph in which the vertices represent variables, and edges connect pairs of variables that both occur in the same clause of the conjunctive normal form, then the co-occurrence graph of a read-once function is necessarily a cograph. More precisely, a positive Boolean function is read-once if and only if its co-occurrence graph is a cograph, and in addition every maximal clique of the co-occurrence graph forms one of the conjunctions (prime implicants) of the disjunctive normal form. That is, when interpreted as a function on sets of vertices of its co-occurrence graph, a read-once function is true for sets of vertices that contain a maximal clique, and false otherwi |
https://en.wikipedia.org/wiki/David%20Silver%20%28computer%20scientist%29 | David Silver (born 1976) is a principal research scientist at Google DeepMind and a professor at University College London. He has led research on reinforcement learning with AlphaGo, AlphaZero and co-lead on AlphaStar.
Education
He studied at Christ's College, Cambridge, graduating in 1997 with the Addison-Wesley award, and having befriended Demis Hassabis whilst at Cambridge. Silver returned to academia in 2004 at the University of Alberta to study for a PhD on reinforcement learning, where he co-introduced the algorithms used in the first master-level 9×9 Go programs and graduated in 2009. His version of program MoGo (co-authored with Sylvain Gelly) was one of the strongest Go programs as of 2009.
Career and research
After graduating from university, Silver co-founded the video games company Elixir Studios, where he was CTO and lead programmer, receiving several awards for technology and innovation.
Silver was awarded a Royal Society University Research Fellowship in 2011, and subsequently became a lecturer at University College London. His lectures on Reinforcement Learning are available on YouTube. Silver consulted for Google DeepMind from its inception, joining full-time in 2013.
His recent work has focused on combining reinforcement learning with deep learning, including a program that learns to play Atari games directly from pixels. Silver led the AlphaGo project, culminating in the first program to defeat a top professional player in the full-size game of Go. AlphaGo subsequently received an honorary 9 Dan Professional Certification; and won the Cannes Lion award for innovation. He then led development of AlphaZero, which used the same AI to learn to play Go from scratch (learning only by playing itself and not from human games) before learning to play chess and shogi in the same way, to higher levels than any other computer program.
Silver is among the most published members of staff at Google DeepMind, with over 130,000 citations and has an h-ind |
https://en.wikipedia.org/wiki/Spaun%20%28Semantic%20Pointer%20Architecture%20Unified%20Network%29 | Spaun ("Semantic Pointer Architecture Unified Network") is a cognitive architecture pioneered by Chris Eliasmith of the University of Waterloo Centre for Theoretical Neuroscience. It consists of 2.5 million simulated neurons organized into subsystems that resemble specific brain regions, such as the prefrontal cortex, basal ganglia, and thalamus. It can recognize numbers, remember them, figure out numeric sequences, and even write them down with a robotic arm. It is implemented using Nengo.
References
External links
Spaun version 2.0 source code
Cognitive architecture |
https://en.wikipedia.org/wiki/Limbitless%20Solutions | Limbitless Solutions is a 501(c)(3) non-profit organization founded in the United States that uses additive manufacturing (3D printing) to create accessible, yet affordable personalized bionics and prosthetic partial arms for children with limb deltas The organization says their bionic arms are manufactured for under $400, 1% of the standard production cost. Headquartered on the University of Central Florida campus in Orlando, Florida, the organization was founded by a team of engineering students, led by CEO and Executive Director Albert Manero.
History
The idea of Limbitless Solutions came to life in 2014 after a team of engineering students at the University of Central Florida led an initiative to provide bionic 3D printed limbs to children. In their free time, the students took advantage of a donated Stratasys Dimension 3D printer in the engineering manufacturing lab on campus to create an affordable prosthetic that displayed their ideas of art and engineering all into one. Their method was the first of its kind and minimized the cost and time of traditional prosthetic manufacturing processes like CNC milling. The first 3D printed arm the students created was run with off-the-shelf servos and batteries which are activated by the electromyography muscle energy on the child's limb. Most prosthetic arms are mechanical, which presents a challenge for children without elbows because they have to open and close their mechanical prosthetic by bending their elbow. That led the Limbitless team to come up with the idea for an electronic arm with a muscle sensor that allows the child to open and close their prosthetic hand by flexing their biceps.
Production
Before creating the bionic arm, the child is measured carefully to ensure that the length, width, and size of their new 3D prosthetic is as similar to their residual arm as possible. The model of the arm is then appropriately scaled and adjusted using Fusion 360 before being printed, assembled, and fitted. Electr |
https://en.wikipedia.org/wiki/Internet%20Day | Internet Day is an event celebrated in Mexico, Peru, Chile, Paraguay, Argentina, Spain, Colombia, Uruguay, Ecuador, Bolivia, Venezuela, and other parts of the world on May 17, promoted by the Association of Internet Users. It was celebrated for the first time on October 29, 2005. Shortly afterwards, at the World Summit on the Information Society celebrated in Tunisia in November 2005, it was decided to propose to the UN the designation of May 17 as the World-wide Day of the Information Society, which resulted in Internet Day being celebrated on that day.
See also
Digital divide
Digital rights
Right to Internet access
References
External links
World-wide day of Internet
International observances
Internet culture
May observances |
https://en.wikipedia.org/wiki/Google%20Allo | Google Allo was an instant messaging mobile app by Google for the Android and iOS mobile operating systems, with a web client available on Google Chrome, Mozilla Firefox, and Opera. It closed on March 12, 2019.
The app used phone numbers as identifiers, allowing users to exchange messages, files, voice notes, and images. It included a virtual assistant that generated automatic reply suggestions and an optional encrypted mode known as incognito mode. Users could also resize messages and add doodles and stickers on images before sending them.
Before launch, Google touted strong privacy in the app, with particular emphasis on messages stored "transiently and in non-identifiable form". However, at launch, privacy was significantly rolled back, with Google keeping logs of messages indefinitely (or until the user deletes messages) in an effort to improve the app's "smart reply" feature.
History
Allo was announced at Google's developer conference on May 18, 2016. At the time, Google said that it would release Allo in summer 2016, and they launched it on September 21, 2016. During the unveiling of Google's Pixel smartphone in October 2016, it announced that Allo would be pre-installed on the Pixel phones, along with its sister app, Google Duo. In February 2017, a tweet by Google's Vice President of Communications Nick Fox showed a screenshot of Allo running as a web app, along with the words: "Still in early development, but coming to a desktop near you..." A further tweet from Fox in May stated that the web client was "a month or two from public release."
In August, Google Allo for web went live for Android users using Google Chrome, while Firefox, Opera and iOS support was rolled out in October.
In April 2018, it was reported that Google would be "pausing" development of Allo. Anil Sabharwal, the new head of the communications group at Google, stated that its employees would work primarily on its implementation of the carrier-based Rich Communication Services (RCS) U |
https://en.wikipedia.org/wiki/Google%20Duo | Google Duo is a deprecated proprietary voice over IP (VoIP) and videotelephony service developed by Google, available for Android, IOS and web browsers. It let users make and receive one-to-one and group audio and video calls with other Duo users in high definition, using end-to-end encryption by default. Duo could be used either with a phone number or a Google account, allowing users to call someone from their contact list.
Google Duo was announced at Google's developer conference on May 18, 2016, and began its worldwide release on August 16, 2016. Google announced in 2022 that the service would be merged into Google Meet, and it was shut down by the end of the year.
History
In December 2016, Google Duo replaced Hangouts within the suite of Google apps device manufacturers must install in order to gain access to the Google Play, with Hangouts instead becoming optional.
In August 2020, it was reported that Google was planning to eventually merge Google Duo with the business-oriented Google Meet. In December 2021 this objective had been dropped, but Duo continued to be available and updated. In June 2022, Google reversed course and announced that Duo and Meet would, in fact, be merged. The merger began in August, with the Duo mobile app renamed to Meet and the original Meet app renamed "Meet Original" and scheduled to be phased out. Google had said the Duo web app would redirected to the Google Meet web app, but as of April 2023, video calling and meetings are still separate on the web at duo.google.com and meet.google.com.
Technologies
Google Duo was optimized for low-bandwidth mobile networks through WebRTC and uses QUIC over UDP. Optimization was further achieved through the degradation of video quality through monitoring network quality. For packet loss concealment, Duo used Google DeepMind.
In February 2021, Google announced a new very low-bitrate codec for speech compression called "Lyra" that could operate with network speeds as low as 3kbps that avoid |
https://en.wikipedia.org/wiki/Peripolesis | Peripolesis is the process in which a cell attaches itself to another cell. This is differentiated from emperipolesis, which is when one cell is engulfed by another.
Peripolesis is thought to be a physiological mechanism involved in regulating some processes of immune response. It was observed between lymphocytes and macrophages following skin grafts between subjects, and after immune challenge with antigens. Peripolesis was also observed in lung alveoli, where the peripolesed macrophages were not injured, but the cell membrane did appear to be temporarily altered. In patients with active sarcoidosis, which is characterized by lymphocyte-macrophage cooperation, lymphocyte peripolesis appeared to occur in clusters and could last for minutes to hours. The lymphocytes could be seen moving around a macrophage while maintaining contact.
References
Cellular processes
Immune system process |
https://en.wikipedia.org/wiki/Polygon%2C%20SPE | Polygon () is a Russian research and production enterprise engaged in the development, production and servicing of electronic and telecommunications equipment. The company produces switches, routers, converters, gateways for the needs of mobile operators, industrial companies, departmental bodies, public authorities and other customers.
The company is a backbone enterprise in the Republic of Bashkortostan and is actively involved in the import substitution program. Polygon products satisfy the provisions of the decree of the Ministry of Industry and Trade of the Russian Federation No. 1399 from June 3, 2015 "On confirmation of the assignment and telecommunications equipment, produced in the territory of the Russian Federation, the telecommunication equipment of Russian origin status".
History
1941 - Organization of the plant "Ufimkabel" on the basis of the evacuated enterprises.
1985 - Creation of the Ufa Center of Scientific and Technical Creativity of Youth (STCY).
1988 - Creation of Polygon, SPE.
1992 - Victory in the tender of BETO corporation to manufacture fiber-optic linear path for the compounds stations MT-20 and its outstations.
1996 - The transition to the active use of programmable logic integrated circuits (FPGAs) as the basis of the device architecture.
2006 - The development of the first domestic switch.
2013 - Expert council of ANO "Agency of strategic projects for the promotion of new initiatives" ASI approved business project "Development of domestic production of telecommunication equipment", initiated by Polygon, SPE.
Products
Switches and Ethernet equipment
Industrial switches with IP30 protection level and higher
FTTx equipment
TDMoIP gateways
Optical modems and multiplexers E1 / Ethernet
Redundancy equipment
Bridges Ethernet over E1
Converters RS-232 and RS-485 - Ethernet
E1 access devices
Primary activities
Full cycle of development, production and implementation of telecommunications equipment
Creation of special |
https://en.wikipedia.org/wiki/Bioremediation%20of%20radioactive%20waste | Bioremediation of radioactive waste or bioremediation of radionuclides is an application of bioremediation based on the use of biological agents bacteria, plants and fungi (natural or genetically modified) to catalyze chemical reactions that allow the decontamination of sites affected by radionuclides. These radioactive particles are by-products generated as a result of activities related to nuclear energy and constitute a pollution and a radiotoxicity problem (with serious health and ecological consequences) due to its unstable nature of ionizing radiation emissions.
The techniques of bioremediation of environmental areas as soil, water and sediments contaminated by radionuclides are diverse and currently being set up as an ecological and economic alternative to traditional procedures. Physico-chemical conventional strategies are based on the extraction of waste by excavating and drilling, with a subsequent long-range transport for their final confinement. These works and transport have often unacceptable estimated costs of operation that could exceed a trillion dollars in the US and 50 million pounds in the UK.
The species involved in these processes have the ability to influence the properties of radionuclides such as solubility, bioavailability and mobility to accelerate its stabilization. Its action is largely influenced by electron donors and acceptors, nutrient medium, complexation of radioactive particles with the material and environmental factors. These are measures that can be performed on the source of contamination (in situ) or in controlled and limited facilities in order to follow the biological process more accurately and combine it with other systems (ex situ).
Areas contaminated by radioactivity
Typology of radionuclides and polluting waste
The presence of radioactive waste in the environment may cause long-term effects due to the activity and half-life of the radionuclides, leading their impact to grow with time. These particles exist in vari |
https://en.wikipedia.org/wiki/Gregorio%20%28software%29 | Gregorio is a free and open-source scorewriter computer program especially for Gregorian chant in square notation. Gregorio was adopted by many abbeys and large projects.
Architecture
Gregorio is not a completely independent program, but consists mainly of three components: The gabc syntax for writing Gregorian scores, a TeX package named GregorioTeX, which is responsible for the graphical output and a converter tool between those two. As such, Gregorio is included in TeX Live 2016.
Characteristics
Gregorio is written especially for Gregorian chant in square notation and does not cover modern European musical notation. Similar to LilyPond it does not provide a graphical user interface. The notation is done via simple text input. It follows the gabc-syntax, which is defined by the Gregorio Project for this purpose. The gregorio command line tool converts this gabc-file to a GregorioTeX file, which has to be included in a common TeX file. Such a file is necessary for a graphical output, e.g., in the PDF-format.
History
The Gregorio project started in 2006 at TELECOM Bretagne, a graduate engineering school in France. It was at first a student project lasting six months. When the project was done, Élie Roux decided to continue the project on his own and to develop it under GNU General Public License.
At first, the goal of the project was just to provide the Benedictine Abbey Sainte Madeleine in Le Barroux a graphical interface for the usage of a Gregorian font. Due to license issues, the project decided later to make and use its own font. At the end of 2006, a new developer, Olivier Berten, joined the project and created its OpusTeX component. OpusTeX was a LaTeX package with a similar goal like Gregorio but is now unmaintained and deprecated. During a three-month internship, starting in April 2008, at the Monastero di San Benedetto, in Norcia (Italy), Gregorio made considerable progress and its own output named GregorioTeX started to be usable.
In following yea |
https://en.wikipedia.org/wiki/UNTV%20Transmitter | The UNTV Transmitter is a communication tower owned by Breakthrough and Milestones Productions International, Inc. located at Emerald Hills, Sumulong Highway, Antipolo, Rizal, Republic of the Philippines. It serves as the new transmitter facility for flagship stations DWAO-TV (UNTV News and Rescue) and DWNU, with broadcast licenses owned by the stations founder Progressive Broadcasting Corporation.
History
In July 2013, BMPI Chairman and CEO Daniel Razon announced the network's plan of upgrading its facilities, in preparation for its transition from analog to the Japanese ISDB-T digital system. The construction of the new transmitter began in early 2013, completed before the end of the year and became fully operational in January 2014. Upon the launch, the tower replaced its old transmitter under a lease agreement at Crestview Subdivision in Antipolo, Rizal since 2001. In July 2014, when BMPI took over the management of PBC's 107.5, DWNU also shifted its transmitter to the UNTV Tower.
Features
Transmitter
UNTV acquired its new analog and digital broadcast equipment from Digital Multimedia Technologies (DMT) System Engineering Solutions (SyES). SyES has been in the manufacturing industry for over 30 years with headquarters in Lissone, Italy. The tower uses highly efficient SyES complete antenna system (COEL brand) to produce a wide coverage of UHF analog and digital TV reception in Metro Manila, Bulacan, Pampanga, Laguna, Batangas, Cavite and Rizal. with a 30,000-watt TPO in UHF 37 (analog) and up to a maximum of 10,000-watt TPO in UHF 38 (digital). It serves as the originating transmitter for its relay stations in the provinces.
On October 2, 2014, UNTV began its simulcast test broadcast on UHF channel 38 (617.143 MHz) with two standard definition (SD) channels, one high-definition (HD) channel and one 1seg channel. UNTV's low-powered DTV test broadcast can be received in Metro Manila and nearby provinces using ISDB-T set top boxes, LED TV sets and mobile dev |
https://en.wikipedia.org/wiki/Genotyping%20by%20sequencing | In the field of genetic sequencing, genotyping by sequencing, also called GBS, is a method to discover single nucleotide polymorphisms (SNP) in order to perform genotyping studies, such as genome-wide association studies (GWAS). GBS uses restriction enzymes to reduce genome complexity and genotype multiple DNA samples. After digestion, PCR is performed to increase fragments pool and then GBS libraries are sequenced using next generation sequencing technologies, usually resulting in about 100bp single-end reads. It is relatively inexpensive and has been used in plant breeding. Although GBS presents an approach similar to restriction-site-associated DNA sequencing (RAD-seq) method, they differ in some substantial ways.
Methods
GBS is a robust, simple, and affordable procedure for SNP discovery and mapping. Overall, this approach reduces genome complexity with restriction enzymes (REs) in high-diversity, large genomes species for efficient high-throughput, highly multiplexed sequencing. By using appropriate REs, repetitive regions of genomes can be avoided and lower copy regions can be targeted, which reduces alignments problems in genetically highly diverse species. The method was first described by Elshire et al. (2011). In summary, high molecular weight DNAs are extracted and digested using a specific RE previously defined by cutting frequently in the major repetitive fraction of the genome. ApeKI is the most used RE. Barcode adapters are then ligated to sticky ends and PCR amplification is performed. Next-generation sequencing technology is performed resulting in about 100 bp single-end reads. Raw sequence data are filtered and aligned to a reference genome using usually Burrows–Wheeler alignment tool (BWA) or Bowtie 2. The next step is to identify SNPs from aligned tags and score all discovered SNPs for various coverage, depth and genotypic statistics. Once a large-scale, species-wide SNP production has been run, it is possible to quickly call known SNPs in new |
https://en.wikipedia.org/wiki/Gregory%20coefficients | Gregory coefficients , also known as reciprocal logarithmic numbers, Bernoulli numbers of the second kind, or Cauchy numbers of the first kind, are the rational numbers
that occur in the Maclaurin series expansion of the reciprocal logarithm
Gregory coefficients are alternating for and decreasing in absolute value. These numbers are named after James Gregory who introduced them in 1670 in the numerical integration context. They were subsequently rediscovered by many mathematicians and often appear in works of modern authors, who do not always recognize them.
Numerical values
Computation and representations
The simplest way to compute Gregory coefficients is to use the recurrence formula
with . Gregory coefficients may be also computed explicitly via the following differential
or the integral
which can proved by integrating between 0 and 1 with respect to , once directly and the second time using the binomial series expansion first.
It implies the finite summation formula
where are the signed Stirling numbers of the first kind.
and Schröder's integral formula
Bounds and asymptotic behavior
The Gregory coefficients satisfy the bounds
given by Johan Steffensen. These bounds were later improved by various authors. The best known bounds for them were given by Blagouchine. In particular,
Asymptotically, at large index , these numbers behave as
More accurate description of at large may be found in works of Van Veen, Davis, Coffey, Nemes and Blagouchine.
Series with Gregory coefficients
Series involving Gregory coefficients may be often calculated in a closed-form. Basic series with these numbers include
where is Euler's constant. These results are very old, and their history may be traced back to the works of Gregorio Fontana and Lorenzo Mascheroni. More complicated series with the Gregory coefficients were calculated by various authors. Kowalenko, Alabdulmohsin and some other authors calculated
Alabdulmohsin also gives these identities |
https://en.wikipedia.org/wiki/Ambio%204 |
Introduction
Ambio 4 was quadrophonic sound technology commercialised in the early 1970s that could reproduce the ambience or sound information of a room as well as play stereo. Ambiophony was an extension of stereo reproduction to enhance the sense of realism and it could be used with nearly all stereo programme materials.
The technology was included in receivers, amplifiers and music centres from manufacturers including Philips, Ferguson Electronics and Bang and Olufsen alongside mono and stereo playback. The electronics behind Ambiophony was based on, or similar to, the Hafler circuit.
References
Audio electronics |
https://en.wikipedia.org/wiki/S1C6x | The S1C6x series is a microcontroller families introduced by Epson. It is a 4-bit architecture. This Series includes S1C60 and S1C63 families. S1C60 is low end low power version. S1C63 is high end version. This family is used in many applications as it contains specialized peripherals such as LCD driver, dot-matrix driver, FSK demodulator, R/F converter ... etc.
Technical description
The S1C6x series is a CISC Harvard architecture with 12-bit instructions with an 8.192 word instruction space. It uses a 4-bit word for either a binary format or as a BCD digit and has 16 memory mapped registers in register window together with two accumulators, two 12-bit pointers and a stack pointer for use in subroutines.
Most of the instructions operate on either two registers or a register and an immediate value, but the S1C6X series also has some memory-memory and memory-immediate instructions.
References
Microcontrollers
Epson |
https://en.wikipedia.org/wiki/Rolling%20release | Rolling release, also known as rolling update or continuous delivery, is a concept in software development of frequently delivering updates to applications. This is in contrast to a standard or point release development model which uses software versions that must be reinstalled over the previous version. An example of this difference would be the multiple versions of Ubuntu Linux versus the single and constantly updated version of Arch Linux.
Rolling release
Rolling release development models are one of many types of software release life cycles. Although a rolling release model can be used in the development of any piece or collection of software, it is often seen in use by Linux distributions, notable examples being for instance GNU Guix System, Arch Linux, Gentoo Linux, openSUSE Tumbleweed, PCLinuxOS, Solus, SparkyLinux and Void Linux. Some modern Distributed SQL databases such as YugabyteDB can also support this feature.
A rolling release is typically implemented using small and frequent updates. However, simply having updates does not automatically mean that a piece of software is using a rolling release cycle; for this, the philosophy of developers must be to work with one code branch, versus discrete versions. When the rolling release is employed as the development model, software updates are typically delivered to users by a package manager on the user's personal computer, accessing through the internet a remote software repository (often via a download mirror) stored on an internet file server.
See also
Continuous delivery
References
Software distribution
Software release
Rolling Release Linux distributions |
https://en.wikipedia.org/wiki/Signal%20Protocol | The Signal Protocol (formerly known as the TextSecure Protocol) is a non-federated cryptographic protocol that provides end-to-end encryption for voice and instant messaging conversations. The protocol was developed by Open Whisper Systems in 2013 and was first introduced in the open-source TextSecure app, which later became Signal. Several closed-source applications have implemented the protocol, such as WhatsApp, which is said to encrypt the conversations of "more than a billion people worldwide" or Google who provides end-to-end encryption by default to all RCS-based conversations between users of their Messages app for one-to-one conversations. Facebook Messenger also say they offer the protocol for optional Secret Conversations, as does Skype for its Private Conversations.
The protocol combines the Double Ratchet algorithm, prekeys, and a triple Elliptic-curve Diffie–Hellman (3-DH) handshake, and uses Curve25519, AES-256, and HMAC-SHA256 as primitives.
History
The development of the Signal Protocol was started by Trevor Perrin and Moxie Marlinspike (Open Whisper Systems) in 2013. The first version of the protocol, TextSecure v1, was based on Off-the-Record Messaging (OTR).
On 24 February 2014, Open Whisper Systems introduced TextSecure v2, which migrated to the Axolotl Ratchet. The design of the Axolotl Ratchet is based on the ephemeral key exchange that was introduced by OTR and combines it with a symmetric-key ratchet modeled after the Silent Circle Instant Messaging Protocol (SCIMP). It brought about support for asynchronous communication ("offline messages") as its major new feature, as well as better resilience with distorted order of messages and simpler support for conversations with multiple participants. The Axolotl Ratchet was named after the critically endangered aquatic salamander Axolotl, which has extraordinary self-healing capabilities. The developers refer to the algorithm as self-healing because it automatically disables an attacker from acc |
https://en.wikipedia.org/wiki/Distribution%20on%20a%20linear%20algebraic%20group | In algebraic geometry, given a linear algebraic group G over a field k, a distribution on it is a linear functional satisfying some support condition. A convolution of distributions is again a distribution and thus they form the Hopf algebra on G, denoted by Dist(G), which contains the Lie algebra Lie(G) associated to G. Over a field of characteristic zero, Cartier's theorem says that Dist(G) is isomorphic to the universal enveloping algebra of the Lie algebra of G and thus the construction gives no new information. In the positive characteristic case, the algebra can be used as a substitute for the Lie group–Lie algebra correspondence and its variant for algebraic groups in the characteristic zero ; for example, this approach taken in .
Construction
The Lie algebra of a linear algebraic group
Let k be an algebraically closed field and G a linear algebraic group (that is, affine algebraic group) over k. By definition, Lie(G) is the Lie algebra of all derivations of k[G] that commute with the left action of G. As in the Lie group case, it can be identified with the tangent space to G at the identity element.
Enveloping algebra
There is the following general construction for a Hopf algebra. Let A be a Hopf algebra. The finite dual of A is the space of linear functionals on A with kernels containing left ideals of finite codimensions. Concretely, it can be viewed as the space of matrix coefficients.
The adjoint group of a Lie algebra
Distributions on an algebraic group
Definition
Let X = Spec A be an affine scheme over a field k and let Ix be the kernel of the restriction map , the residue field of x. By definition, a distribution f supported at x'' is a k-linear functional on A such that for some n. (Note: the definition is still valid if k is an arbitrary ring.)
Now, if G is an algebraic group over k, we let Dist(G) be the set of all distributions on G supported at the identity element (often just called distributions on G). If f, g are in it, we define t |
https://en.wikipedia.org/wiki/Robert%20William%20Genese | Robert William Genese (1848, Dublin – 1928) was an Irish mathematician whose career was spent in Wales.
Early life and education
Genese was born on Westland Row a street on the south side of Dublin on 8 May 1848. From St John's College of the University of Cambridge, Genese received in 1871 his bachelor's degree (with rank eighth Wrangler in the Tripos) and in 1874 his master's degree.
Professional life
Following an unsuccessful application for the Chair of Mathematics at Aberystwyth in 1872, he taught at the Training College in Carmarthen. He finally secured the professorship at Aberystwyth in 1879, and held it until 1919. Along the way his title became Professor of Mathematics and Astronomy.
Genese introduced into the United Kingdom the ideas of Hermann Grassmann (advancing the use of vector analysis). In his 1941 book The calculus of extensions, Henry Forder published numerous examples in vector analysis taken from Genese's posthumous notes. (Genese's notes were left to the Mathematical Association and then given in 1929 to Forder by E. H. Neville.)
Genese was an Invited Speaker of the ICM in 1904 in Heidelberg with talk On some useful theorems in the continued multiplication of a regressive product in real four-point space and in 1908 in Rome with talk The method of reciprocal polars applied to forces in space.
Selected publications
"Suggestions for the Practical Treatment of the Standard Cubic Equation, and a Contribution to the Theory of Substitution." The Mathematical Gazette 9, no. 129 (1917): 65–69.
"On the Theory of the Plane Complex with Simple Geometrical and Kinematical Illustrations." The Mathematical Gazette 11, no. 164 (1923): 293–301.
"A Simple Exposition of Grassmann's Methods." The Mathematical Gazette 13, no. 189 (1927): 373–391.
References
External links
biographical details, Ceredigion County Council
1848 births
1928 deaths
19th-century Irish mathematicians
20th-century Irish mathematicians
Alumni of St John's College, Cambridge
Mat |
https://en.wikipedia.org/wiki/Syllable%20%28computing%29 | In computing, a syllable is a name for a platform-dependent unit of information storage. Depending on the target hardware, various bit widths (and sometimes internal groupings) are associated with it. Commonly used in the 1960s and 1970s, the term has mostly fallen into disuse in favour of terms like byte or word.
Examples:
3-bit syllables: some experimental CISC designs
8-bit syllables: English Electric KDF9 (represented as syllabic octals and also called slob-octals or slobs in this context) and Burroughs large systems (see also: Burroughs B6x00-7x00 instruction set)
12-bit syllables: NCR computers such as the NCR 315 (also called slabs in this context) and Burroughs large systems
13-bit syllables: Saturn Launch Vehicle Digital Computer (LVDC) and Gemini Spacecraft On-Board Computer (OBC)
See also
Byte
Catena (computing)
Instruction syllable
Nibble
Opcode
Opstring
Parcel (computing)
Syllable (in linguistics)
Word (computer architecture)
References
Computing terminology
Data unit
Units of information |
https://en.wikipedia.org/wiki/Necrophage | Necrophages are organisms that obtain nutrients by consuming decomposing dead animal biomass, such as the muscle and soft tissue of carcasses and corpses. The term derives from Greek , meaning 'dead', and , meaning 'to eat.' Mainly, necrophages are species within the phylum Arthropoda; however, other animals, such as gastropods and Accipitrimorphae birds have been noted to engage in necrophagy.
Necrophages play a critical role in the study of forensic entomology, as certain Arthropoda, such as Diptera larvae, engage in myiasis and colonization of the human body.
Invertebrates
Diptera
Members of the order Diptera, such as Nematocera, Calliphoridae, Sacrophagidae, and Muscidae, as well as semi-aquatic Diptera larvae, such as Simuliidae and Chironomidae, are the most common necrophages within the Animalia kingdom. Diptera species play a critical role in forensic entomology, as they tend to colonize the human body during the early floating phase of decomposition. The flies utilize the submerged corpse as a source of food as well as an attachment site. Notably, Diptera do not specifically colonize and feed on human carcasses. Diptera species, such as Musca domestica and Chloroprocta idioidea have been observed feeding on the carcasses of other mammalian carcasses, including the Mona monkey, the European rabbit, and the Giant cane rat, as well as fish carrion. The carcass' appeal is characterized by the putridness of the odour it emits; thus, the olfactory system of Diptera species plays a role in their food selectivity. In addition, the diversity and abundance of Diptera species vary both spatially and temporally. Necrophagous Diptera, such as Calliphora vicina, tend to be concentrated in urban areas and rare in more rural areas. However, some researchers oppose this notion and claim anthropogenic impacts are negligible regarding species richness. Temporally, the necrophagous Diptera are observed in higher abundances in the summer season than the winter season. The p |
https://en.wikipedia.org/wiki/Thanatophage | Thanatophages, are organisms that obtain nutrients by consuming decomposing dead plant biomass.
Ecology
In food webs, thanatophages generally play the roles of decomposers.
The eating of wood, whether live or dead, is known as xylophagy. The activity of animals feeding only on dead wood is called sapro-xylophagy and those animals, sapro-xylophagous.
Saprophytes
Saprophyte (-phyte meaning "plant") is a botanical term that is no longer in popular use, as such plants have been discovered to actually be parasitic on fungi. There are no real saprotrophic organisms that are embryophytes, and fungi and bacteria are no longer placed in the plant kingdom. Plants that were once considered saprophytes, such as non-photosynthetic orchids and monotropes, are now known to be parasites on fungi. These species are now termed myco-heterotrophs.
See also
Necrophage
Detritivore
Decomposer
Saprotrophic nutrition
Consumer-resource systems
References
Eating behaviors
Mycology
Soil biology |
https://en.wikipedia.org/wiki/Plant%E2%80%93soil%20feedback | Plant–soil feedback is a process where plants alter the biotic and abiotic qualities of soil they grow in, which then alters the ability of plants to grow in that soil in the future.
Negative plant–soil feedback occurs when plants are less able to grow in soil that was previously occupied by a member of the same species, and positive plant–soil feedback occurs when plants are more able to grow in soil that was previously occupied by a member of the same species. Although it was originally assumed that negative plant–soil feedback was caused by plants depleting the soil of nutrients, recent work has suggested that a major cause of plant–soil feedback is a buildup of soil-borne pathogens. Mutualism and allelopathy are also thought to cause plant–soil feedback. Studies have shown that, on average, plant–soil feedback tends to be negative; however, there have been many notable exceptions, such as many invasive species.
Negative plant–soil feedback is thought to be an important factor in helping plants to coexist. If a plant is over-abundant, then soil pathogens and other negative factors will become common, hurting its growth. Similarly, if a plant becomes overly rare, then so too will its soil pathogens and other negative factors, helping its growth. This negative feedback will help populations to stay in the community. Negative plant–soil feedback has been called a particular case of the Janzen–Connell hypothesis.
Measuring plant–soil feedback
Plant–soil feedback is best measured using Bever's interaction coefficient, Is. This value quantifies how much each plant's growth is limited by its own soil community compared to how much it limits others. It is for two-species comparisons. To measure this quantity, one must measure the growth of two plants, both in soil conditioned by members of their own species (Gx(home) for species x), and in soil conditioned by members of the other species (Gx(away) for plant species x). Then, the interaction coefficient is c |
https://en.wikipedia.org/wiki/Apache%20Mynewt | Apache Mynewt is a modular real-time operating system for connected Internet of things (IoT) devices that must operate for long times under power, memory, and storage constraints. It is free and open-source software incubating under the Apache Software Foundation, with source code distributed under the Apache License 2.0, a permissive license that is conducive to commercial adoption of open-source software.
Overview
Apache Mynewt is a real-time operating system with a rich set of libraries intended to make prototyping, deploying, and managing 32-bit microcontroller based IoT devices easy. It is highly composable, to allow building embedded system applications (e.g., locks, medical devices, industrial IoT) across different types of microcontrollers. The name Mynewt is wordplay on the English word minute, meaning very small: the kernel is only 6 KB in size.
The OS is designed for connectivity, and comes with a full implementation of the Bluetooth low energy 4.2 stack. With the addition of BLE (supporting all Bluetooth 4.2 compliant security features except privacy) and various utilities such as the default file system, console, shell, logs, stats, etc., the image size is approximately 96 KB for the Nordic nRF51822 Bluetooth SoC. This size metric excludes the boot loader image.
Core features
The core operating system supports:[3]
Preemptive multithreading
Tickless priority based scheduling
Programmable timers
System time
Semaphores
Mutexes
Event queues
Memory management (allocation): dynamic (heap) and pool
Multi-stage software watchdog timer
Memory or data buffers, to hold packet data as it moves up and down the networking protocol stack
Other features and utilities include:
Hardware abstraction layer with support for CPU time, analog-to-digital converter (ADC), digital-to-analog converter (DAC), general-purpose input/output (GPIO), Inter-Integrated Circuit (I2C), pulse-width modulation (PWM), serial port, Serial Peripheral Interface Bus (SPI), univer |
https://en.wikipedia.org/wiki/Trapiche | A trapiche is a mill made of wooden rollers used to extract juice from fruit, originally olives, and since the Middle Ages, sugar cane as well. By extension the word is also sometimes applied to the location of the mill, whether the workshop or the entire plantation.
Etymology
The word has its origin in the Latin trapetum that means oil mill. From the Sicilian language trappitu the term, crossing the Mozarab Valencia, with its typical change of termination to «-ig» via the Catalan language (trapig -Gandía, 1536-, trapitz de canyamel -Mallorca, 1466-) has arrived to the other languages of the Iberian peninsula as trapiche. In the documents of the Duke of Gandía from the beginning of the fifteen century, one can see the term «trapig de canyamel», as a synecdoche to indicate the whole village engenho.Hug de Cardona editat per Frederic Aparisi Romero, III: Col·lecció diplomàtica (1407-1482) Fonts Històriques Valencianes, València, Universitat de València, 2011, pàgina 1058 ss., According to Herrera: "..es de notar que antiguamente no auuia azucar,ſino en Valencia" ("note that in the old days there was no sugar except in Valencia").
Valencian Country
To the start of the 15th century, Oliva's Count mattered of Sicily the method of caring of the cane and the technical to extract the «sugar» with the aid of sicilians mestres sucrer. A true Galceran of Vic, gentleman of Xeresa built the first trapiche in Gandia. The 1433 count already four and to the end of the century fourteen. To the senyoria of the Monastery of Valldigna saw grow the revenue of his trapiche of 40% between 1434 and 1502. Temptatiues To enter the new culture to Castelló were less successful. The culture of cane was the fact especially of the small nobility and of the bourgeoisie, as the farmers were not very motivated to change lands of orchard in industrial «culture». The companies sucreres go to have to take in lease lands or increase proprietary bourgeoisie to happen to the culture of cane.
To the |
https://en.wikipedia.org/wiki/Simple%20clinical%20colitis%20activity%20index | The Simple Clinical Colitis Activity Index (SCCAI) is a diagnostic tool and questionnaire used to assess the severity of symptoms in people who suffer from ulcerative colitis. It was created in 1998 and is still used to assess the severity of symptoms. It is also used for research purposes to determine the efficacy of various treatments aimed at relieving symptoms. The calculated score ranges from 0 to 19, where active disease is a score of 5 or higher.
The score is determined by asking the person with colitis questions regarding:
Bowel frequency at day/night
Urgency of defecation
Blood in stool
General health
Extracolonic manifestations
References
Abdominal pain
Autoimmune diseases
Colitis
Conditions diagnosed by stool test
Inflammations
Noninfective enteritis and colitis
Medical lists |
https://en.wikipedia.org/wiki/Static%20Media | 7Hops.com Inc., doing business as Static Media, is an American internet company established in 2012 based in Indianapolis. It operates ZergNet, a content recommendation business that promotes paid content across their network of brands.
ZergNet
Established around 2011, ZergNet has been compared to Outbrain, Adblade, Taboola and similar companies, and the fact that the site itself has become popular with some end users invited a comparison to BuzzFeed. Zergnet aims to distinguish itself from its competitors by focusing on high quality, less spammy offerings.
The company's investors include Mark Cuban and Greycroft Partners.
Owned or associated websites
Static Media owns and promotes entertainment websites:
Looper – film, television, and video game news and reviews
Nicki Swift – celebrity gossip
Mashed – food discussion
The List – women's lifestyle
/Film – film news and reviews
Foodie – food news and cooking tips
Food Republic – food news, recipes, tips, and reviews
Explore – travel news and tips
Glam – beauty, fashion, wellness, and women's lifestyle
Grunge – history, entertainment, science, and sports
SlashGear – personal technology and digital lifestyle trends
Health Digest – health news
House Digest – home improvement, DIY, and tips
Tasting Table – food and recipes
SVG – video game news and discussion
House Digest – home and decor news
Women.com – women's lifestyle
Wrestling Inc – pro wrestling and combat sports
Money Digest – finance
Company history
As of July 2023, all of Static Media's brands had over 170 million site visitors per month, with an additional 20 million subscribers on YouTube, 15 million followers on Facebook, and 8 million subscribers on Snapchat. The majority of those siteviews come from its film sites, Looper and /Film, which have a combined 54 million site visitors a month. Both sites' critics' reviews also appear on Rotten Tomatoes.
Looper was the first site acquired by Static Media, in 2015. Mashed, Nicki Swift, |
https://en.wikipedia.org/wiki/Metal%E2%80%93nitride%E2%80%93oxide%E2%80%93semiconductor%20transistor | The metal–nitride–oxide–semiconductor or metal–nitride–oxide–silicon (MNOS) transistor is a type of MOSFET (metal–oxide–semiconductor field-effect transistor) in which the oxide layer is replaced by a double layer of nitride and oxide. It is an alternative and supplement to the existing standard MOS technology, wherein the insulation employed is a nitride-oxide layer. It is used in non-volatile computer memory.
History
The original MOSFET (metal–oxide–semiconductor field-effect transistor, or MOS transistor) was invented by Egyptian engineer Mohamed M. Atalla and Korean engineer Dawon Kahng at Bell Labs in 1959, and demonstrated in 1960. Kahng went on to invent the floating-gate MOSFET with Simon Min Sze at Bell Labs, and they proposed its use as a floating-gate (FG) memory cell, in 1967. This was the first form of non-volatile memory based on the injection and storage of charges in a floating-gate MOSFET, which later became the basis for EPROM (erasable PROM), EEPROM (electrically erasable PROM) and flash memory technologies.
In late 1967, a Sperry research team led by H.A. Richard Wegener invented the metal–nitride–oxide–semiconductor (MNOS) transistor, a type of MOSFET in which the oxide layer is replaced by a double layer of nitride and oxide. Nitride was used as a trapping layer instead of a floating gate, but its use was limited as it was considered inferior to a floating gate.
Charge trap (CT) memory was introduced with MNOS devices in the late 1960s. It had a device structure and operating principles similar to floating-gate (FG) memory, but the main difference is that the charges are stored in a conducting material (typically a doped polysilicon layer) in FG memory, whereas CT memory stored charges in localized traps within a dielectric layer (typically made of silicon nitride).
See also
Field-effect transistor
MISFET
MOSFET
SONOS
References
Transistor types
Field-effect transistors
MOSFETs |
https://en.wikipedia.org/wiki/Mary%20MacArthur | Mary MacArthur (January 20, 1904 – April 26, 1959) was a Canadian scientist who performed research on the principles of the successful dehydration and freezing of fresh foods.
She performed this research while employed by the federal government of Canada's Department of Agriculture at the Central Experimental Farm in Ottawa, Ontario.
In 1952 she was the first woman to be named as Fellow of the Agricultural Institute of Canada (FAIC) for her contributions to Canadian agriculture.
Biography
Mary MacArthur was born in Glasgow, Scotland. She came to Canada as a child and her family settled in Pugwash, Nova Scotia. She became interested in botany at an early age.
She obtained a B.Sc. with Honors from Acadia University, Nova Scotia, in 1933, after attending a botany course at the Marine Biological Laboratory in Woods Hole, Massachusetts the prior year. She then earned an M.A. at Radcliffe College (affiliated with Harvard University) in 1934 and received her PhD from Harvard in 1937.
Career
After graduation, MacArthur was an assistant professor of botany at a woman's college in Elmira, New York, from 1937 to 1938.
In 1938 she accepted a position as an agricultural scientist, Horticulture Division, at the Central Experimental Farm in Ottawa, Ontario, Canada.
Her early specialty was plant histology and cytology.
MacArthur became well known for her leadership of Canadian research into dehydration, which included fundamental research on methods for determining the inactivation of enzymes in plant tissues prior to dehydration.
She had a large dehydration tunnel built in Ottawa, Ontario in 1942, in which she conducted more than 2000 experiments during the last four years of World War II. She is credited with identifying that vegetables needed blanching to inactivate enzymes before dehydration. She worked jointly with scientists at Kentville, Nova Scotia, who provided her with the dehydrated vegetables for further analysis in Ottawa, Ontario. This was an important activity |
https://en.wikipedia.org/wiki/Benjamin%20Abram%20Bernstein | Benjamin Abram Bernstein (20 May 1881, Pasvalys, Lithuania – 25 September 1964, Berkeley, California) was an American mathematician, specializing in mathematical logic.
Biography
With his Jewish family, Bernstein immigrated as a child to the United States. After completing public primary education in 1897 in Baltimore, he completed in 1902 his secondary education at Baltimore City College, and then received in 1905 his A.B. degree from Johns Hopkins University. After completing two years of graduate study at Johns Hopkins University, he became in 1907 an instructor and continuing graduate student in mathematics at the University of California, Berkeley. There he received in 1913, with supervisor Mellen W. Haskell, his Ph.D. At Berkeley, Bernstein became in 1918 an assistant professor, in 1923 an associate professor, and in 1928 a full professor of mathematics, retiring in 1951 as professor emeritus.
He was an Invited Speaker at the ICM in 1924 in Toronto. He was elected in 1931 a fellow of the American Association for the Advancement of Science. His doctoral students include Robert Levit and J.C.C. McKinsey.
In June 1920 in New York City, Professor Bernstein married Rose Davidson; her brother was the sculptor Jo Davidson. Bernstein was predeceased by his wife and upon his death was survived by a daughter and a granddaughter.
Selected publications
with A. O. Leuschner:
Errata for 1924 Trans. Amer. Math. Soc. vol. 26, pages 171–175: published Trans. Amer. Math. Soc. 27 (1925) 600.
"On the Serial Relations in Boolean Algebras" Bulletin of the American Mathematical Society 32(5) 523,4 1926
with Nemo Debely:
with Alfred L. Foster:
References
External links
Guide to the Benjamin Abram Bernstein papers, 1901–1963, Online Archive of California
1881 births
1964 deaths
Mathematical logicians
20th-century American mathematicians
Baltimore City College alumni
Johns Hopkins University alumni
UC Berkeley College of Letters and Science alumni
University of Californi |
https://en.wikipedia.org/wiki/Wilhelm%20Tranow | Wilhelm Tranow (born 1891) was a German cryptanalyst, who before and during World War II worked in the monitoring service of the German Navy and was responsible for breaking a number of encrypted radio communication systems, particularly the Naval Cypher, which was used by the British Admiralty for encrypting operational signals and the Naval Code for encrypting administrative signals. Tranow was considered one of the most important cryptanalysts of B-service. He was described as being experienced and energetic. Little was known about his personal life, when and where he was born, or where he died.
The American historian David Kahn underscored the war-historical significance of this cryptography and cryptanalysis success of Tranow, citing an anonymous source:
If one man in German intelligence ever held the keys to victory in World War II, it was Wilhelm Tranow.
Life
Wilhelm Tranow initially worked as a radio technician aboard the battleship Pommern. In 1914, he received a coded message, while on watch, from the cruiser Breslau which he forwarded to fleet command, who reported they could not read it. Tranow, who was interested in codes and cryptology, broke the encipherment on the coded messages and forwarded the broken message back to fleet HQ. Showing a lack of urgency and understanding, Fleet HQ issued Tranow a stern warning to keep away from secret matters, instead of trying to improve the code.
During the latter part of World War I, Tranow was placed in the naval (Imperial German Navy) intercept and code-breaking organization (German: Nachrichten-Abteilung) (German Naval Intelligence Service) at Neumünster. There he participated in solving (cryptography) the British Navy 3-letter code.
With the loss of the war and the Treaty of Versailles, the code-breaking unit at Neumünster was shut down. On 28 April 1919, a new agency was created in Berlin, with eight former cryptographers, Tranow being one of them.
In late 1919, Tranow reconstructed Britain's enormous |
https://en.wikipedia.org/wiki/Autonomy%20Cube | The Autonomy Cube was an art project run by American artists and technologists Trevor Paglen and Jacob Appelbaum which places relays for the anonymous communication network Tor in traditional art museums. Both have previously created art pieces that straddle the border between art and technology,. The cube is in line with much of Paglen's and Appelbaum's earlier pieces in targeting the field of surveillance and government snooping. The sculptures consist of 1.25 ft blocks of acrylic Lucite containing Wifi-routers based upon two open source hardware Novena-motherboards.
Overview
The first sculpture was installed in Oldenburg, Germany in 2014 and acts as both a Tor exit-relay and Wifi-hub for visitors of the museum. Any user who connects to the museum open Wifi called Autonomy Cube is directed through the Tor-network for all their activity. This effectively anonymizes and hides the traffic from many forms of surveillance and interception. In January 2016, four installations had been made in New York, London and Frankfurt, beyond the one in Oldenburg. More sculptures are planned, with three coming during May 2016, one at Altman Siegel Gallery in San Francisco. Institutions that have shown the cube in limited exhibitions include Metro Pictures Gallery on Manhattan which exhibited Paglen's work, Whitechapel Gallery in London as part of the Electronic Superhighway (2016–1966) exhibition and the Smithsonian American Art Museum in Trevor Paglen: Sites Unseen.
The willingness of museums to host these installations was a surprise says Paglen, who hopes the relays can play a potentially important role in the Tor network. Omar Kholeif at Whitechapel Gallery has commented on the idea that "when we enter civic institutions we expect them to have Wi-Fi, [and] we just hand over our data", and how the Cubes bring this agreement forth to discussion.
Inspiration for the Cube came from a 1962 art project by Hans Haacke called Condensation Cube. It similarly consisted of a plexigla |
https://en.wikipedia.org/wiki/Bright%20Computing | Bright Computing, Inc. is a developer of software for deploying and managing high-performance (HPC) clusters, Kubernetes clusters, and OpenStack private clouds in on-premises data centers as well as in the public cloud.
History
Bright Computing was founded by Matthijs van Leeuwen in 2009, who spun the company out of ClusterVision, which he had co-founded with Alex Ninaber and Arijan Sauer. Alex and Matthijs had worked together at UK’s Compusys, which was one of the first companies to commercially build HPC clusters. They left Compusys in 2002 to start ClusterVision in the Netherlands, after determining there was a growing market for building and managing supercomputer clusters using off-the-shelf hardware components and open source software, tied together with their own customized scripts. ClusterVision also provided delivery and installation support services for HPC clusters at universities and government entities.
In 2004, Martijn de Vries joined ClusterVision and began development of cluster management software. The software was made available to customers in 2008, under the name ClusterVisionOS v4.
In 2009, Bright Computing was spun out of ClusterVision. ClusterVisionOS was renamed Bright Cluster Manager, and van Leeuwen was named Bright Computing’s CEO.
In February 2016, Bright appointed Bill Wagner as chief executive officer. Matthijs van Leeuwen became chief strategy officer, and then left the company and board of directors in 2018.
In January 2022 Bright was acquired by Nvidia.
Customers
Early customers included Boeing, Sandia National Laboratories, Virginia Tech, Hewlett Packard, NSA, and Drexel University. Many early customers were introduced through resellers, including SICORP, Cray, Dell, and Advanced HPC.
As of 2019, the company has more than 700 customers, including more than fifty Fortune 500 Companies.
Products and services
Bright Cluster Manager for HPC lets customers deploy and manage complete clusters. It provides management for the h |
https://en.wikipedia.org/wiki/Wealthsimple | Wealthsimple Inc. is a Canadian online investment management service. The firm was founded in September 2014 by Michael Katchen, Brett Huneycutt and Rudy Adler and is based in Toronto. As of November 2021, the firm holds over C$15 billion in assets under management. It is primarily owned by Power Corporation indirectly at 42.5% through investments made through their holdings in Power Financial, IGM Financial and Portag3.
History
Pre-founding
Prior to founding Wealthsimple, Michael Katchen worked for 1000Memories, a Silicon Valley-based startup. After Ancestry.com bought 1000Memories in 2012, Katchen developed a spreadsheet with tips to help his colleagues set up investment portfolios. Interest in the spreadsheet helped inspire the idea for Wealthsimple. In 2014, he returned to Toronto to launch the company.
2015 acquisition of Canadian ShareOwner Investments Inc.
In December 2015, Wealthsimple merged with Canadian ShareOwner Investments Inc., a Canadian order-execution only broker-dealer. Through the acquisition, Wealthsimple became an owner of one of Canada's 14 discount brokerages (2015) alongside other owners of discount brokerages including Bank of Montreal and Royal Bank of Canada. The acquisition of Canadian ShareOwner Investment Inc. resulted in the assets under management comprising across 10,000 customer accounts.
2016–present: focus on product offerings
In 2015, Product Hunt Toronto honoured Wealthsimple with its first-ever Product of the Year Award. In 2016, the 20th Annual Webby Awards named Wealthsimple its Best Financial Services/Banking website.
In March 2016, Wealthsimple began offering clients access to socially responsible investment funds.
In May 2016, the firm announced a partnership with Mint, thus allowing clients to sync their Wealthsimple investment account to Mint's budgeting software. Also, that month, Wealthsimple launched Wealthsimple for Advisors, an automated platform for financial advisors. The service is intended for advisors w |
https://en.wikipedia.org/wiki/Adobe%20Museum%20of%20Digital%20Media | The Adobe Museum of Digital Media was a virtual museum dedicated to digital art that launched on October 6, 2010. It also provided information on the relationship between digital media and society and was created and sponsored as a marketing exercise by Adobe Systems and produced in partnership with Spin+ and Unit 9.
The museum's exhibitions included a video exhibit by Tony Oursler and a project by Mariko Mori.
As of 2016, the museum is no longer accessible online.
References
External links
Defunct art museums and galleries in California
Museum of Digital Media
Digital art
Virtual museums
Art museums established in 2010
2010 establishments in California |
https://en.wikipedia.org/wiki/Pipelayer%20%28vehicle%29 | A pipelayer or sideboom is a type of a construction vehicle used to lay pipes.
External links
CAT pipelayers
Engineering vehicles |
https://en.wikipedia.org/wiki/Nominal%20power | Nominal power is a power capacity in engineering.
Radio broadcasting
Nominal power is a measurement of a mediumwave radio station's output used in the United States.
Photovoltaic devices
Nominal power is the nameplate capacity of photovoltaic (PV) devices, such as solar cells, panels and systems, and is determined by measuring the electric current and voltage in a circuit, while varying the resistance under precisely defined conditions.
See also
Power rating
Real versus nominal value
References
Electrical engineering |
https://en.wikipedia.org/wiki/Cryoconservation%20of%20animal%20genetic%20resources | Cryoconservation of animal genetic resources is a strategy wherein samples of animal genetic materials are preserved cryogenically.
Animal genetic resources, as defined by the Food and Agriculture Organization of the United Nations, are "those animal species that are used, or may be used, for the production of food and agriculture, and the populations within each of them. These populations within each species can be classified as wild and feral populations, landraces and primary populations, standardised breeds, selected lines, varieties, strains and any conserved genetic material; all of which are currently categorized as Breeds." Genetic materials that are typically cryogenically preserved include sperm, oocytes, embryos and somatic cells. Cryogenic facilities are called gene banks and can vary greatly in size usually according to the economic resources available. They must be able to facilitate germplasm collection, processing, and long term storage, all in a hygienic and organized manner. Gene banks must maintain a precise database and make information and genetic resources accessible to properly facilitate cryoconservation. Cryoconservation is an ex situ conservation strategy that often coexists alongside in situ conservation to protect and preserve livestock genetics.
Cryoconservation of livestock genetic resources is primarily done in order to preserve the genetics of populations of interest, such as indigenous breeds, also known as local or minor breeds. Material may be stored because individuals shared specific genes and phenotypes that may be of value or have potential value for researchers or breeders. Therefore, one of the main goals remains preserving the gene pool of local breeds that may be threatened. Indigenous livestock genetics are commonly threatened by factors such as globalization, modernization, changes in production systems, inappropriate introduction of major breeds, genetic drift, inbreeding, crossbreeding, climate change, natural disas |
https://en.wikipedia.org/wiki/Self-buckling | A column can buckle due to its own weight with no other direct forces acting on it, in a failure mode called self-buckling. In conventional column buckling problems, the self-weight is often neglected since it is assumed to be small when compared to the applied axial loads. However, when this assumption is not valid, it is important to take the self-buckling into account.
Elastic buckling of a "heavy" column i.e., column buckling under its own weight, was first investigated by Greenhill at 1881. He found that a free-standing, vertical column, with density , Young's modulus , and cross-sectional area , will buckle under its own weight if its height exceeds a certain critical value:
where is the acceleration due to gravity, is the second moment of area of the beam cross section.
One interesting example for the use of the equation was suggested by Greenhill in his paper. He estimated the maximal height of a pine tree, and found it cannot grow over 300-ft tall. This length sets the maximum height for trees on earth if we assume the trees to be prismatic and the branches are neglected.
Mathematical derivation
Suppose a uniform column fixed in a vertical direction at its lowest point, and carried to a height , in which the vertical position becomes unstable and flexure begins. There is a body force per unit length , where is the cross-sectional area of the column, is the acceleration due to gravity and is its mass density.
The column is slightly curved under its own weight, so the curve describes the deflection of the beam in the direction at some position . Looking at any point on the column, we can write the moment equilibrium:
where the right-hand side of the equation is the moment of the weight of BP about P.
According to Euler–Bernoulli beam theory:
Where is the Young's modulus of elasticity of the substance, is the second moment of area.
Therefore, the differential equation of the central line of BP is:
Differentiating with respect to x |
https://en.wikipedia.org/wiki/Soft%20robotics | Soft robotics is a subfield of robotics that concerns the design, control, and fabrication of robots composed of compliant materials, instead of rigid links.
In contrast to rigid-bodied robots built from metals, ceramics and hard plastics, the compliance of soft robots can improve their safety when working in close contact with humans.
Types and designs
The goal of soft robotics is the design and construction of robots with physically flexible bodies and electronics. Sometimes softness is limited to part of the machine. For example, rigid-bodied robotic arms can employ soft end effectors to gently grab and manipulate delicate or irregularly shaped objects. Most rigid-bodied mobile robots also strategically employ soft components, such as foot pads to absorb shock or springy joints to store/release elastic energy. However, the field of soft robotics generally leans toward machines that are predominately or entirely soft. Robots with entirely soft bodies have tremendous potential. For one their flexibility allows them to squeeze into places rigid bodies cannot, which could prove useful in disaster relief scenarios. Soft robots are also safer for human interaction and for internal deployment inside a human body.
Nature is often a source of inspiration for soft robot design given that animals themselves are mostly composed of soft components and they appear to exploit their softness for efficient movement in complex environments almost everywhere on Earth. Thus, soft robots are often designed to look like familiar creatures, especially entirely soft organisms like octopuses. However, it is extremely difficult to manually design and control soft robots given their low mechanical impedance. The very thing that makes soft robots beneficial—their flexibility and compliance—makes them difficult to control. The mathematics developed over the past centuries for designing rigid bodies generally fail to extend to soft robots. Thus, soft robots are commonly designed in part |
https://en.wikipedia.org/wiki/CESMM3 | The Civil Engineering Standard Method of Measurement (commonly known as CESMM3) sets out a procedure for the preparation of a bill of quantities for civil engineering works, for pricing and for expression and measurement of quantities of work.
CESMM3 includes 26 main clauses of work:
References
Engineering-related lists |
https://en.wikipedia.org/wiki/Boolean%20Pythagorean%20triples%20problem | The Boolean Pythagorean triples problem is a problem from Ramsey theory about whether the positive integers can be colored red and blue so that no Pythagorean triples consist of all red or all blue members. The Boolean Pythagorean triples problem was solved by Marijn Heule, Oliver Kullmann and Victor W. Marek in May 2016 through a computer-assisted proof.
Statement
The problem asks if it is possible to color each of the positive integers either red or blue, so that no Pythagorean triple of integers a, b, c, satisfying are all the same color.
For example, in the Pythagorean triple 3, 4 and 5 (), if 3 and 4 are colored red, then 5 must be colored blue.
Solution
Marijn Heule, Oliver Kullmann and Victor W. Marek showed that such a coloring is only possible up to the number 7824. The actual statement of the theorem proved is
There are possible coloring combinations for the numbers up to 7825. These possible colorings were logically and algorithmically narrowed down to around a trillion (still highly complex) cases, and those, expressed as Boolean satisfiability problems, were examined using a SAT solver. Creating the proof took about 4 CPU-years of computation over a period of two days on the Stampede supercomputer at the Texas Advanced Computing Center and generated a 200 terabyte propositional proof, which was compressed to 68 gigabytes.
The paper describing the proof was published in the SAT 2016 conference, where it won the best paper award. The figure below shows a possible family of colorings for the set {1,...,7824} with no monochromatic Pythagorean triple, and the white squares can be colored either red or blue while still satisfying this condition.
Prize
In the 1980s Ronald Graham offered a $100 prize for the solution of the problem, which has now been awarded to Marijn Heule.
Generalizations
As of 2018, the problem is still open for more than 2 colors, that is, if there exists a k-coloring (k ≥ 3) of the positive integers such that no Pythagorean trip |
https://en.wikipedia.org/wiki/Degeneration%20%28algebraic%20geometry%29 | In algebraic geometry, a degeneration (or specialization) is the act of taking a limit of a family of varieties. Precisely, given a morphism
of a variety (or a scheme) to a curve C with origin 0 (e.g., affine or projective line), the fibers
form a family of varieties over C. Then the fiber may be thought of as the limit of as . One then says the family degenerates to the special fiber . The limiting process behaves nicely when is a flat morphism and, in that case, the degeneration is called a flat degeneration. Many authors assume degenerations to be flat.
When the family is trivial away from a special fiber; i.e., is independent of up to (coherent) isomorphisms, is called a general fiber.
Degenerations of curves
In the study of moduli of curves, the important point is to understand the boundaries of the moduli, which amounts to understand degenerations of curves.
Stability of invariants
Ruled-ness specializes. Precisely, Matsusaka'a theorem says
Let X be a normal irreducible projective scheme over a discrete valuation ring. If the generic fiber is ruled, then each irreducible component of the special fiber is also ruled.
Infinitesimal deformations
Let D = k[ε] be the ring of dual numbers over a field k and Y a scheme of finite type over k. Given a closed subscheme X of Y, by definition, an embedded first-order infinitesimal deformation of X is a closed subscheme X of Y ×Spec(k) Spec(D) such that the projection X → Spec D is flat and has X as the special fiber.
If Y = Spec A and X = Spec(A/I) are affine, then an embedded infinitesimal deformation amounts to an ideal I of A[ε] such that A[ε]/ I is flat over D and the image of I in A = A[ε]/ε is I.
In general, given a pointed scheme (S, 0) and a scheme X, a morphism of schemes : X → S is called the deformation of a scheme X if it is flat and the fiber of it over the distinguished point 0 of S is X. Thus, the above notion is a special case when S = Spec D and there is some choice of embedding.
See |
https://en.wikipedia.org/wiki/LED%20wallpaper | LED wallpaper is the integration of light-emitting diodes into flat substrates suitable to be applied to walls for interior decoration purposes.
The experimentation on the combination of light sources and wall covering surfaces has been largely fostered by the progressive miniaturisation of low-voltage lighting technology, such as LEDs and OLEDs, suitable to be incorporated into low-thickness materials to be applied onto interior walls.
The new possibilities offered by these developments have prompted some designers and companies to research and develop proprietary LED wallpaper technologies, some of which are currently available for commercial purchase. Other solutions mainly exist as prototypes or are in the process of being further refined.
The first use of the term LED wallpaper is found in the book Wallpaper by Lachlan Blackley, describing the work of textile designer Maria Yaschuk, who designed a flexible solution to incorporate LEDs into digitally printed wall covering material in 2004. This definition is currently used by companies such as Meystyle and designer Ingo Maurer in relation to LED wall covering materials included in their catalogues. Other similar concepts are light-emitting wallpaper used by Lomox and luminous textile used by Philips.
Meystyle
Meystyle claim to have been the first company to integrate light-emitting diodes into wallpaper so that it can be hung like a traditional wall covering. Maria Yaschuk, co-founder of the company together with sister Ekaterina Yaschuk, presented the first prototype of LED wallpaper as part of her graduation project for the MA degree in Textile Futures at CSM in 2004. The concept was successively developed with her sister Ekaterina into a series of designs exhibited in 2007 under the name Wire Geometrics at the National Glass Centre in Sunderland. The same year Maria and Ekaterina went on to commercialise their product under the company name Meystyle LED Wallpaper & Fabric.
Meystyle uses digital printing |
https://en.wikipedia.org/wiki/Bilinski%20dodecahedron | In geometry, the Bilinski dodecahedron is a convex polyhedron with twelve congruent golden rhombus faces. It has the same topology but a different geometry than the face-transitive rhombic dodecahedron. It is a parallelohedron.
History
This shape appears in a 1752 book by John Lodge Cowley, labeled as the dodecarhombus. It is named after Stanko Bilinski, who rediscovered it in 1960. Bilinski himself called it the rhombic dodecahedron of the second kind. Bilinski's discovery corrected a 75-year-old omission in Evgraf Fedorov's classification of convex polyhedra with congruent rhombic faces.
Definition and properties
Definition
The Bilinski dodecahedron is formed by gluing together twelve congruent golden rhombi. These are rhombi whose diagonals are in the golden ratio:
The graph of the resulting polyhedron is isomorphic to the graph of the rhombic dodecahedron, but the faces are oriented differently: one pair of opposite rhombi has their long and short diagonals reversed, relatively to the orientation of the corresponding rhombi in the rhombic dodecahedron.
Symmetry
Because of its reversal, the Bilinski dodecahedron has a lower order of symmetry; its symmetry group is that of a rectangular cuboid: of order 8. This is a subgroup of octahedral symmetry; its elements are: three 2-fold symmetry axes, three symmetry planes (which are also the axial planes of this solid), and a center of inversion symmetry. The rotation group of the Bilinski dodecahedron is of order 4.
Vertices
Like the rhombic dodecahedron, the Bilinski dodecahedron has eight vertices of degree 3 and six of degree 4. It has two apices on the vertical axis, and four vertices on each axial plane. But due to the reversal, its non-apical vertices form two squares (red and green) and one rectangle (blue), and its fourteen vertices in all are of four different kinds:
two degree-4 apices surrounded by four acute face angles (vertical-axis vertices, black in first figure);
four degree-4 vertices surrounde |
https://en.wikipedia.org/wiki/Algebra%20extension | In abstract algebra, an algebra extension is the ring-theoretic equivalent of a group extension.
Precisely, a ring extension of a ring R by an abelian group I is a pair (E, ) consisting of a ring E and a ring homomorphism that fits into the short exact sequence of abelian groups:
Note I is then isomorphic to a two-sided ideal of E. Given a commutative ring A, an A-extension or an extension of an A-algebra is defined in the same way by replacing "ring" with "algebra over A" and "abelian groups" with "A-modules".
An extension is said to be trivial or to split if splits; i.e., admits a section that is a ring homomorphism. (see ).
A morphism between extensions of R by I, over say A, is an algebra homomorphism E → E that induces the identities on I and R. By the five lemma, such a morphism is necessarily an isomorphism, and so two extensions are equivalent if there is a morphism between them.
Example: trivial extension
Let R be a commutative ring and M an R-module. Let E = R ⊕ M be the direct sum of abelian groups. Define the multiplication on E by
Note that identifying (a, x) with a + εx where ε squares to zero and expanding out (a + εx)(b + εy) yields the above formula; in particular we see that E is a ring. It is sometimes called the algebra of dual numbers. Alternatively, E can be defined as where is the symmetric algebra of M. We then have the short exact sequence
where p is the projection. Hence, E is an extension of R by M. It is trivial since is a section (note this section is a ring homomorphism since is the multiplicative identity of E). Conversely, every trivial extension E of R by I is isomorphic to if . Indeed, identifying as a subring of E using a section, we have via .
One interesting feature of this construction is that the module M becomes an ideal of some new ring. In his book Local Rings, Nagata calls this process the principle of idealization.
Square-zero extension
Especially in deformation theory, it is common to consider an ex |
https://en.wikipedia.org/wiki/Ion%20channel%20hypothesis%20of%20Alzheimer%27s%20disease | The ion channel hypothesis of Alzheimer’s disease (AD), also known as the channel hypothesis or the amyloid beta ion channel hypothesis, is a more recent variant of the amyloid hypothesis of AD, which identifies amyloid beta (Aβ) as the underlying cause of neurotoxicity seen in AD. While the traditional formulation of the amyloid hypothesis pinpoints insoluble, fibrillar aggregates of Aβ as the basis of disruption of calcium ion homeostasis and subsequent apoptosis in AD, the ion channel hypothesis in 1993 introduced the possibility of an ion-channel-forming oligomer of soluble, non-fibrillar Aβ as the cytotoxic species allowing unregulated calcium influx into neurons in AD.
The ion channel hypothesis is broadly supported as an explanation for the calcium ion influx that disrupts calcium ion homeostasis and induces apoptosis in neurons. Because the extracellular deposition of Aβ fibrils in senile plaques is not sufficient to predict risk or onset of AD, and clinical trials of drugs that target the Aβ fibrillization process have largely failed, the ion channel hypothesis provides novel molecular targets for continued development of AD therapies and for better understanding of the mechanism underlying onset and progression of AD.
History
The ion channel hypothesis was first proposed by Arispe and colleagues in 1993 upon discovery that Aβ could form unregulated cation-selective ion channels when incorporated into planar lipid bilayers. Further research showed that a particular fragment of Aβ, Aβ (25-35), spontaneously inserts into planar lipid bilayers to form weakly selective ion channels and that membrane insertion occurs non-specifically, irreversibly, and with a broad range of oligomer conformations. Though more recent studies have found that Aβ channels can be blocked by small molecules, the broad variety of Aβ ion channel conformations and chemistries make it difficult to design a channel blocker specific to Aβ without compromising other ion channels in the ce |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.