source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Moving%20bed%20biofilm%20reactor | Moving bed biofilm reactor (MBBR) is a type of wastewater treatment process that was first invented by Professor Hallvard Ødegaard at Norwegian University of Science and Technology in the late 1980s. The process takes place in an aeration tank with plastic carriers that a biofilm can grow on. The compact size and cheap wastewater treatment costs offers many advantages for the system. The main objective of using MBBR being water reuse and nutrient removal or recovery. In theory, wastewater will be no longer considered waste, it can be considered a resource.
Background
Overview
Due to early issues with biofilm reactors, like hydraulic instability and uneven biofilm distribution, moving bed biofilm technology was developed. The MBBR system consists of an aeration tank (similar to an activated sludge tank) with special plastic carriers that provide a surface where a biofilm can grow. There is a wide variety of plastic carriers used in these systems. These carriers vary in surface area and in shape, each offering different advantages and disadvantages. Surface area plays a very important role in biofilm formation. Free-floating carriers allow biofilms to form on the surface, therefore a large internal surface area is crucial for contact with water, air, bacteria, and nutrients. The carriers will be mixed in the tank by the aeration system and thus will have good contact between the substrate in the influent wastewater and the biomass on the carriers. The most preferable material is currently high density polyethylene (HDPE) due to its plasticity, density, and durability.
To achieve higher concentration of biomass in the bioreactors, hybrid MBBR systems have been used where suspended and attached biomass co-exist contributing both to biological processes. Additionally, there are anaerobic MBBRs that have been mainly used for industrial wastewater treatment. A 2019 article described a combination of anaerobic (methanogenic) MBBR with aerobic MBBR that was applied in |
https://en.wikipedia.org/wiki/Wild%20number | Originally, wild numbers are the numbers supposed to belong to a fictional sequence of numbers imagined to exist in the mathematical world of the mathematical fiction The Wild Numbers authored by Philibert Schogt, a Dutch philosopher and mathematician. Even though Schogt has given a definition of the wild number sequence in his novel, it is couched in a deliberately imprecise language that the definition turns out to be no definition at all. However, the author claims that the first few members of the sequence are 11, 67, 2, 4769, 67. Later, inspired by this wild and erratic behaviour of the fictional wild numbers, American mathematician J. C. Lagarias used the terminology to describe a precisely defined sequence of integers which shows somewhat similar wild and erratic behaviour. Lagaria's wild numbers are connected with the Collatz conjecture and the concept of the 3x + 1 semigroup. The original fictional sequence of wild numbers has found a place in the On-Line Encyclopedia of Integer Sequences.
The wild number problem
In the novel The Wild Numbers, The Wild Number Problem is formulated as follows:
Beauregard had defined a number of deceptively simple operations, which, when applied to a whole number, at first resulted in fractions. But if the same steps were repeated often enough, the eventual outcome was once again a whole number. Or, as Beauregard cheerfully observed: “In all numbers lurks a wild number, guaranteed to emerge when you provoke them long enough” . 0 yielded the wild number 11, 1 brought forth 67, 2 itself, 3 suddenly manifested itself as 4769, 4, surprisingly, brought forth 67 again. Beauregard himself had found fifty different wild numbers. The money prize was now awarded to whoever found a new one.
But it has not been specified what those "deceptively simple operations" are. Consequently, there is no way of knowing how those numbers 11, 67, etc. were obtained and no way of finding what the next wild number would be.
History of The Wild Nu |
https://en.wikipedia.org/wiki/Seven%20Solutions | Seven Solutions is a Spanish hardware technology company headquartered in Granada, Spain, that developed the first white rabbit element on The White Rabbit Project which it was the White Rabbit Switch to use the Precision Time Protocol (PTP) in real application as networking. Seven Solutions got involved on it with the design, manufacture, testing and support.
This project was financed by The government of Spain and CERN. Through this project Seven Solution demonstrated a high performance enhanced PTP switch with sub-ns accuracy.
References
Network time-related software
Computer hardware companies
Companies of Andalusia
Granada
Integrated circuits |
https://en.wikipedia.org/wiki/Tardiness%20%28scheduling%29 | In scheduling, tardiness is a measure of a delay in executing certain operations and earliness is a measure of finishing operations before due time. The operations may depend on each other and on the availability of equipment to perform them.
Typical examples include job scheduling in manufacturing and data delivery scheduling in data processing networks.
In manufacturing environment, inventory management considers both tardiness and earliness undesirable. Tardiness involves backlog issues such as customer compensation for delays and loss of goodwill. Earliness incurs expenses for storage of the manufactured items and ties up capital.
Mathematical formulations
In an environment with multiple jobs, let the deadline be and the completion time be of job . Then for job
lateness is ,
earliness is ,
tardiness is .
In scheduling common objective functions are or weighted version of these sums, , where every job comes with a weight . The weight is a representation of job cost, priority, etc.
In a large number of cases the problems of optimizing these functions are NP-hard.
References
Time management
Scheduling (computing)
Schedule (project management)
Theoretical computer science |
https://en.wikipedia.org/wiki/Omni-Path | Omni-Path Architecture (OPA) is a high-performance communication architecture developed by Intel. It aims for low communication latency, low power consumption and a high throughput. It directly competes with InfiniBand. Intel planned to develop technology based on this architecture for exascale computing. The current owner of Omni-Path is Cornelis Networks.
History
Production of Omni-Path products started in 2015 and delivery of these products started in the first quarter of 2016. In November 2015, adapters based on the 2-port "Wolf River" ASIC were announced, using QSFP28 connectors with channel speeds up to 100 Gbit/s. Simultaneously, switches based on the 48-port "Prairie River" ASIC were announced.
First models of that series were available starting in 2015.
In April 2016, implementation of the InfiniBand "verbs" interface for the Omni-Path fabric was discussed.
In October 2016, IBM, Hewlett Packard Enterprise, Dell, Lenovo, Samsung, Seagate Technology, Micron Technology, Western Digital and SK Hynix announced a joint consortium called Gen-Z to develop an open specification and architecture for non-volatile storage and memory products—including Intel's 3D Xpoint technology—which might in part compete against Omni-Path.
Intel offered their Omni-Path products and components via other (hardware) vendors. For example, Dell EMC offered Intel Omni-Path as Dell Networking H-series, following the naming-standard of Dell Networking in 2017.
In July 2019, Intel announced it would not continue development of Omni-Path networks and canceled OPA 200 series (200-Gbps variant of Omni-Path).
In September 2020, Intel announced that the Omni-Path network products and technology would be spun out into a new venture with Cornelis Networks. Intel would continue to maintain support for legacy Omni-Path products, while Cornelis Networks continues the product line, leveraging existing Intel intellectual property related to Omni-Path architecture.
In 2021, Cornelis announced Om |
https://en.wikipedia.org/wiki/PowerDsine | PowerDsine was a semiconductor and systems company, acquired by Microsemi in January 2007 following its IPO in 2004. It was established in 1994. Its initial products were Ringing (telephony) generators, and it also developed xDSL Remote Power Feeding Modules, before inventing Power over Ethernet's (PoE) precursor Power over LAN.
PowerDsine supplied PoE Injectors, PoE Test Equipment and PoE ICs.
References
External links
Official Website
Networking hardware companies
Telecommunications equipment vendors
Electronics companies established in 1994
Technology companies established in 1994
Israeli companies established in 1994
Companies formerly listed on the Nasdaq
Israeli brands
Electronics companies of Israel
Fabless semiconductor companies |
https://en.wikipedia.org/wiki/Nvidia%20Drive | Nvidia Drive is a computer platform by Nvidia, aimed at providing autonomous car and driver assistance functionality powered by deep learning. The platform was introduced at the Consumer Electronics Show (CES) in Las Vegas in January 2015. An enhanced version, the Drive PX 2 was introduced at CES a year later, in January 2016.
The closely platform related software release program at some point in time was branded NVIDIA DRIVE Hyperion along with a revision number helping to match with the generation of hardware it is created for - and also creating ready to order bundles under those term. In former times there were only the terms Nvidia Drive SDK for the developer package and sub-included Nvidia Drive OS for the system software (aka OS) that came with the evaluation platforms or could be downloaded for OS switching and updating later on.
Hardware and Semiconductors
Maxwell based
The first of Nvidia's autonomous chips was announced at CES 2015, based on the Maxwell GPU microarchitecture. The line-up consisted of two platforms:
Drive CX
The Drive CX was based on a single Tegra X1 SoC (System on a Chip) and was marketed as a digital cockpit computer, providing a rich dashboard, navigation and multimedia experience.
Early Nvidia press releases reported that the Drive CX board will be capable of carrying either a Tegra K1 or a Tegra X1.
Drive PX
The first version of Drive PX is based on two Tegra X1 SoCs, and was an initial development platform targeted at (semi-)autonomous driving cars.
Pascal based
Drive PX platforms based on the Pascal GPU microarchitecture were first announced at CES 2016. This time only a new version of Drive PX was announced, but in multiple configurations.
Drive PX 2
The Nvidia Drive PX 2 is based on one or two Tegra X2 SoCs where each SoC contains 2 Denver cores, 4 ARM A57 cores and a GPU from the Pascal generation. There are two real world board configurations:
for AutoCruise: 1× Tegra X2 + 1 Pascal GPU
for AutoChauffeur: 2× Tegra |
https://en.wikipedia.org/wiki/Short%20interspersed%20nuclear%20element | Short interspersed nuclear elements (SINEs) are non-autonomous, non-coding transposable elements (TEs) that are about 100 to 700 base pairs in length. They are a class of retrotransposons, DNA elements that amplify themselves throughout eukaryotic genomes, often through RNA intermediates. SINEs compose about 13% of the mammalian genome.
The internal regions of SINEs originate from tRNA and remain highly conserved, suggesting positive pressure to preserve structure and function of SINEs. While SINEs are present in many species of vertebrates and invertebrates, SINEs are often lineage specific, making them useful markers of divergent evolution between species. Copy number variation and mutations in the SINE sequence make it possible to construct phylogenies based on differences in SINEs between species. SINEs are also implicated in certain types of genetic disease in humans and other eukaryotes.
In essence, short interspersed nuclear elements are genetic parasites which have evolved very early in the history of eukaryotes to utilize protein machinery within the organism as well as to co-opt the machinery from similarly parasitic genomic elements. The simplicity of these elements make them remarkably successful at persisting and amplifying (through retrotransposition) within the genomes of eukaryotes. These "parasites" which have become ubiquitous in genomes can be very deleterious to organisms as discussed below. However, eukaryotes have been able to integrate short-interspersed nuclear elements into different signaling, metabolic and regulatory pathways and SINEs have become a great source of genetic variability. They seem to play a particularly important role in the regulation of gene expression and the creation of RNA genes. This regulation extends to chromatin re-organization and the regulation of genomic architecture. The different lineages, mutations, and activities among eukaryotes make short-interspersed nuclear elements a useful tool in phylogenetic analy |
https://en.wikipedia.org/wiki/MOSDAC | MOSDAC (the Meteorological and Oceanographic Satellite Data Archival Centre) is a data repository for the missions of the Indian Space Research Organisation (ISRO) and Government of India, dealing with meteorology, oceanography and tropical water cycles. Data acquired from missions is disseminated in near real time from Space Applications Centre (SAC), Ahmedabad through the MOSDAC web site. The Indian miniature satellite SCATSAT-1, dedicated to ocean wind observation has its beta version of data disseminated through ftp (https://web.archive.org/web/20170407003751/http://ftp.mosdac.gov.in/).
The web site also hosts weather services including cloud burst and heavy rain alerts, genesis of tropical cyclones in the Indian Ocean along with track and intensity prediction and a three hourly weather forecast for the next seventy two hours. The weather alerts are supported with a decision support system, where collateral information in terms of land use, land cover, DEM, population, administrative boundaries, roads, rivers etc. can be interactively overlaid. The forecast and weather alerts are also accessible over Android devices through a free downloadable WeatherApp.
Satellite data based Meteorology And Oceanography Research and Training (SMART) is an ISRO initiative to support students, academics and researchers across the country to pursue research in the field of Meteorology and Oceanography using satellite data archived at MOSDAC and other related datasets. SMART is managed by MOSDAC Research and Training Division (MRTD), MOSDAC Research Group, SAC. The support includes state-of-the-art computer facilities, research guidance and familiarisation with MOSDAC data.
ISRO is an official data partner of the Committee on Earth Observation Satellites. MOSDAC ensures near real time availability of the SAPHIR data of Meghatropiques mission for the Global Precipitation Measurement (GPM).
References
External links
Official site
Indian Space Research Organisation
Archives i |
https://en.wikipedia.org/wiki/Tricentis | Tricentis is a software testing company founded in 2007 and headquartered in Austin, Texas. It provides software testing automation and software quality assurance products for enterprise software.
History
Tricentis was founded in 2007 by Wolfgang Platz and Franz Fuchsberger, extending their previous consulting business into a software company. The same year, it opened an office in Germany. Tricentis opened further offices in Switzerland in 2008, Benelux in 2009, and London and Sydney in 2010. In 2011, the company entered the US markets and opened offices in New Jersey and Los Altos. By 2018, the company had extended its presence in Asia-Pacific. The company is headquartered in Austin, Texas.
In 2000, Platz developed Tricentis Tosca Explorer, the predecessor to the core component of Tricentis Tosca. By 2006 Tricentis Tosca Commander was developed and launched into the market as the central GUI for the product. The product has since been extended to cover risk-based testing, test design, SAP testing, API testing, service virtualization, exploratory testing, load testing, and test data management in addition to GUI testing.
In 2012, Tricentis raised $9 million in early-stage investment from Viewpoint, now part of Kennet Partners. In 2013, Sandeep Johri became the CEO.
In 2017, Tricentis received $165 million in series B funding from Insight Venture Partners.
In July 2020, Tricentis entered a partnership with SAP, an enterprise software corporation. Under the partnership, the Tricentis continuous testing platform will be the testing platform for the SAP Solution Extensions program and is being integrated into the SAP Application Lifecycle Management (ALM) portfolio. The Tricentis tools use machine learning algorithms to identify potential integration risks between SAP and third-party applications. They are also used to automate end-to-end testing across SAP and associated applications.
In April 2021, Kevin Thompson became the CEO and chairman of the board.
Acquis |
https://en.wikipedia.org/wiki/Pyraminx%20Duo | The Pyraminx Duo (originally known as Rob's Pyraminx) is a tetrahedral twisty puzzle in the style of the Rubik's Cube. It was suggested by Rob Stegmann, invented by Oskar van Deventer, and has now been mass-produced by Meffert's.
Overview
The Pyraminx Duo is a puzzle in the shape of a tetrahedron, divided into 4 corner pieces and 4 face centre pieces. Each corner piece has three colours, while the centre pieces each have a single colour. Each face of the puzzle contains one face centre piece and three corner pieces.
The puzzle can be thought of as twisting around its corner pieces - each twist rotates one corner piece and permutates the three face centre pieces around it. An interesting feature is that the face centre pieces go "underneath" corner pieces during a twist.
The purpose of the puzzle is to scramble the colours, and then restore them to their original configuration of one colour per face.
Mechanically, the puzzle is similar to the Skewb, with all corner pieces of the Skewb visible (although shaped differently) and all centre pieces hidden.
Number of combinations
There are 4 corner pieces. Each corner can be twisted in 3 different orientations, independently of the other corners. Therefore, the corners can be orientated in 34 different ways. They cannot be permutated, therefore there is only one possible corner permutation.
There are 4 face centre pieces. These can be permutated in at most 4! different ways. However, the exact number of these permutations is not yet reached due to two constraints. The first constraint is that only even permutations of the face centers are possible (e.g. it is impossible to have only two face centre pieces swapped); this divides the limit by 2. The second constraint is that all centre permutations are dependent on the orientation of the corner pieces. Some permutations of centres are only possible when the total number of clockwise rotations of corner pieces is divisible by 3; other permutations are only possible w |
https://en.wikipedia.org/wiki/Vehicle-to-device | Vehicle-to-device (V2D) communication is a particular type of vehicular communication system that consists in the exchange of information between a vehicle and any electronic device that may be connected to the vehicle itself.
The ever-increasing tendency of developing mobile applications for our everyday use has ultimately entered also the automotive sector. Vehicle connectivity with mobile apps have the great potential to offer a better driving experience, by providing information regarding the surrounding vehicles and infrastructure and making the interaction between the car and its driver much simpler. The fact that apps may significantly improve driving safety has attracted the attention of car users and caused a rise in the number of new apps developed specifically for the car industry. This trend has such a great influence that now manufacturers are beginning to design cars taking care of their interaction with mobile phones. For example, starting from 2017 Volvo is going to sell keyless cars, thanks to an app that makes it possible to open and start the vehicle remotely.
Another sector that could coherently benefit from this technology is car sharing.
See also
Vehicular communication systems
Vehicle-to-everything (V2X)
Vehicular ad hoc network (V2V)
Vehicle-to-grid (V2G)
Vehicle-to-vehicle (V2V)
References
Advanced driver assistance systems
Driving
Emerging technologies
Vehicle technology
Vehicle telematics
Wireless networking |
https://en.wikipedia.org/wiki/Cyber%20manufacturing | Cyber manufacturing is a concept derived from cyber-physical systems (CPS) that refers to a modern manufacturing system that offers an information-transparent environment to facilitate asset management, provide reconfigurability, and maintain productivity. Compared with conventional experience-based management systems, cyber manufacturing provides an evidence-based environment to keep equipment users aware of networked asset status, and transfer raw data into possible risks and actionable information. Driving technologies include design of cyber-physical systems, combination of engineering domain knowledge and computer sciences, as well as information technologies. Among them, mobile applications for manufacturing is an area of specific interest to industries and academia.
Motivation
The idea of cyber manufacturing originates from the fact that Internet-enabled services have added business value in economic sectors such as retail, music, consumer products, transportation, and healthcare; however, compared to existing Internet-enabled sectors, manufacturing assets are less connected and less accessible in real-time. Besides, current manufacturing enterprises make decisions following a top-down approach: from overall equipment effectiveness to assignment of production requirements, without considering the condition of machines. This usually leads to inconsistency in operation management due to lack of linkage between factories, possible overstock in spare part inventory, as well as unexpected machine downtime. Such situation calls for connectivity between machines as a foundation, and analytics on top of that as a necessity to translate raw data into information that actually facilitates user decision making. Expected functionalities of cyber manufacturing systems include machine connectivity and data acquisition, machine health prognostics, fleet-based asset management, and manufacturing reconfigurability.
Technology
Several technologies are involved in developing |
https://en.wikipedia.org/wiki/Windows%20Subsystem%20for%20Linux | Windows Subsystem for Linux (WSL) is a feature of Windows that allows developers to run a Linux environment without the need for a separate virtual machine or dual booting. There are two versions of WSL: WSL 1 and WSL 2. WSL 1 was first released on August 2, 2016, and acts as a compatibility layer for running Linux binary executables (in ELF format) by implementing Linux system calls on the Windows kernel. It is available on Windows 10, Windows 10 LTSB/LTSC, Windows 11, Windows Server 2016, Windows Server 2019 and Windows Server 2022.
In May 2019, WSL 2 was announced, introducing important changes such as a real Linux kernel, through a subset of Hyper-V features. WSL 2 differs from WSL 1 in that WSL 2 runs inside a managed virtual machine that implements the full Linux kernel. As a result, WSL 2 is compatible with more Linux binaries than WSL 1, as not all syscalls were implemented in WSL 1. Since June 2019, WSL 2 is available to Windows 10 customers through the Windows Insider program, including the Home edition. WSL is not available to all Windows 10 users by default. It can be installed either by joining the Windows Insider program or manual install.
History
Microsoft's first foray into achieving Unix-like compatibility on Windows began with the Microsoft POSIX Subsystem, superseded by Windows Services for UNIX via MKS/Interix, which was eventually deprecated with the release of Windows 8.1. The technology behind Windows Subsystem for Linux originated in the unreleased Project Astoria, which enabled some Android applications to run on Windows 10 Mobile. It was first made available in Windows 10 Insider Preview build 14316.
Whereas Microsoft's previous projects and the third-party Cygwin had focused on creating their own unique Unix-like environments based on the POSIX standard, WSL aims for native Linux compatibility. Instead of wrapping non-native functionality into Win32 system calls as Cygwin did, WSL's initial design (WSL 1) leveraged the NT kernel execu |
https://en.wikipedia.org/wiki/Maryna%20Viazovska | Maryna Sergiivna Viazovska (, ; born 2 December 1984) is a Ukrainian mathematician known for her work in sphere packing. She is a full professor and Chair of Number Theory at the Institute of Mathematics of the École Polytechnique Fédérale de Lausanne in Switzerland. She was awarded the Fields Medal in 2022.
Education and career
Viazovska was born in Kyiv, the oldest of three sisters. Her father was a chemist who worked at the Antonov aircraft factory and her mother an engineer. She attended a specialized secondary school for high-achieving students in science and technology, Kyiv Natural Science Lyceum No. 145. An influential teacher there, Andrii Knyazyuk, had previously worked as a professional research mathematician before becoming a secondary school teacher. Viazovska competed in domestic mathematics Olympiads when she was at high school, placing 13th in a national competition where 12 students were selected to a training camp before a six-member team for the International Mathematical Olympiad was chosen. As a student at Taras Shevchenko National University of Kyiv, she competed at the International Mathematics Competition for University Students in 2002, 2003, 2004, and 2005, and was one of the first-place winners in 2002 and 2005. She co-authored her first research paper in 2005.
Viazovska earned a master's from the University of Kaiserslautern in 2007, PhD from the Institute of Mathematics of the National Academy of Sciences of Ukraine in 2010, and a doctorate (Dr. rer. nat.) from the University of Bonn in 2013. Her doctoral dissertation, Modular Functions and Special Cycles, concerns analytic number theory and was supervised by Don Zagier and Werner Müller.
She was a postdoctoral researcher at the Berlin Mathematical School and the Humboldt University of Berlin and a Minerva Distinguished Visitor at Princeton University. Since January 2018 she has held the Chair of Number Theory as a full professor at the École Polytechnique Fédérale de Lausanne (EPFL) |
https://en.wikipedia.org/wiki/Field%20%28mineral%20deposit%29 | A field is a mineral deposit containing a metal or other valuable resources in a cost-competitive concentration. It is usually used in the context of a mineral deposit from which it is convenient to extract its metallic component. The deposits are exploited by mining in the case of solid mineral deposits (such as iron or coal) and extraction wells in case of fluids (such as oil, gas or brines).
Description
In geology and related fields a deposit is a layer of rock or soil with uniform internal features that distinguish it from adjacent layers. Each layer is generally one of a series of parallel layers which lie one above the other, laid one on the other by natural forces. They may extend for hundreds of thousands of square kilometers of the Earth's surface. The deposits are usually seen as a different color material groups or different structure exposed in cliffs, canyons, caves and river banks. individual agglomerates may vary in thickness from a few millimeters up to a kilometer or more. Each cluster represents a specific type of deposit: flint river, sea sand, coal swamp, sand dunes, lava beds, etc.
It can consist of layers of sediment, usually by marine or differentiations of certain minerals during cooling of magma or during metamorphosis of the previous rock. The mineral deposits are generally oxides, silicates and sulfates or metal not commonly concentrated in the Earth's crust. The deposits must be machined to extract the metals in question from the waste rock and minerals from the reservoir. The deposits are formed by a variety of geological processes. The abundance of a field will result in direct costs associated with the mining of the deposit and the consequent cost of the extracted metal.
Important minerals in ore fields
Argentite: Ag2S
Baryte: BaSO4
Beryl:
Sphalerite: ZnS
Bornite: Cu5FeS4
Cassiterite: SnO2
Chalcocite: Cu2S
Chalcopyrite: CuFeS2
Chromite:
Cinnabar: HgS
Cobaltite:
Coltan:
Galena: PbS
Gold: Au
Hematite: Fe2O3
Ilmen |
https://en.wikipedia.org/wiki/SilverPush | Silverpush is a Singapore based marketing technology provider.
The company was founded in September 2012, by Hitesh Chawla. After starting push notification advertisement in 2013, it launched India's first DSP platform in 2014. The company is backed by IDG Ventures, Palaash Ventures, Fabrice Grinda, K.Ganesh, 500 Startups, M&S Partners and Freak Out Inc, Japan.
Silverpush's in-video context detection platform uses artificial intelligence and computer vision to accurately identify in-video contexts, including logos, faces, objects, actions, and scenes, to enable contextual video ad placements in line with content users are actively engaging with. And its brand safety platform uses in-video context detection to contextually filter out harmful and irrelevant content. Offering brands, a suitable video environment, surpassing traditional measures like keywords blacklist, whitelisted channels and more.
Products
In April 2019, Silverpush introduced Parallels, an ad sync technology that syncs ads with physical events in real-time.
In November 2019, SilverPush launched Mirrors, an artificial intelligence-driven technology that aims to deliver more relevant in-video ads by way of analysing what appears in the content. Mirrors does this using a context detection technology on videos being viewed online.
In May 2020, Silverpush launched Mirrors Safe, an AI-powered brand suitability platform.
Technology
Filed for 10+ patents, for proprietary technology products.
Real-time ad sync across all digital channels.
Near real-time detection – 1 sec detection time.
Innovative video fingerprint matching technology to detect TV ads in real-time.
95%+ accuracy in ad detection.
Funding
In April 2014, Geektime reported that SilverPush had raised $1.5 million in funding to increase global reach.
In February 2019, SilverPush raised $5 million in Series B from FreakOut Holdings.
See also
Air gap (networking)
BadBIOS
Near sound data transfer
SlickLogin
Cross-device tracki |
https://en.wikipedia.org/wiki/Endometrial%20cup | Endometrial cups form during pregnancy in mares and are the source of equine chorionic gonadotropin (eCG) and a placenta-associated structure, which is derived from the fetus. Their purpose is to increase the immunological tolerance of the mare in order to protect the developing foal.
Function
Endometrial cups are unique to animals in the horse family, and so named because of their concave shape. They are a placenta-associated structure, found in the uterine wall of a mare from about 38 to 150 days into a pregnancy. After about 70 days, they begin to regress, and are eventually destroyed by the immune system. They begin to develop at approximately 25 days of pregnancy, deriving from the chorionic girdle. At approximately 36–38 days of pregnancy, the cells that will become the endometrial cup begin to burrow into the endometrial tissue, through the basement membrane, and into the uterine stroma. Their invasion of the uterine stroma begins the cells' maturation process, which takes 2–3 days. Endometrial cups can be circular, U-shaped, or ribbonlike and are pale compared to the rest of the endometrial tissue. They can range in size from 1 cm to 10 cm in diameter at the widest point. They resemble ulcers in form, and when examined under a microscope have large epithelioid decidual-like cells and large nucleoli.
They produce high concentrations of equine chorionic gonadotropin (eCG), also called pregnant mare's serum gonadotropin, in the bloodstream of pregnant mares. eCG is actually an equine luteinizing hormone. Endometrial cups behave somewhat like cells from metastatic tumors, in that they leave the placenta and migrate into the uterus. Their purpose appears to be to work with other placental cells to control the expression of histocompatibility genes so that the developing fetus is not destroyed by the mare's immune system.
Similar types of cells that invade the placenta have been described in humans. The purpose of these cells In both humans and horses is beli |
https://en.wikipedia.org/wiki/Coprophobia | Coprophobia is fear of or aversion to feces or defecation.
In humans, the attitude to feces and defecation has become a cultural taboo.
In the animal world, many herbivorous grazing animals including cows, sheep, horses, and reindeer avoid feces when feeding. Primates also prefer to forage away from feces-contaminated areas. The aversion is believed to be a strategy to avoid infection.
References
Phobias
Excretion
Ethology
Body-related phobias |
https://en.wikipedia.org/wiki/Hybrid-core%20computing | Hybrid-core computing is the technique of extending a commodity instruction set architecture (e.g. x86) with application-specific instructions to accelerate application performance. It is a form of heterogeneous computing wherein asymmetric computational units coexist with a "commodity" processor.
Hybrid-core processing differs from general heterogeneous computing in that the computational units share a common logical address space, and an executable is composed of a single instruction stream—in essence a contemporary coprocessor. The instruction set of a hybrid-core computing system contains instructions that can be dispatched either to the host instruction set or to the application-specific hardware.
Typically, hybrid-core computing is best deployed where the predominance of computational cycles are spent in a few identifiable kernels, as is often seen in high-performance computing applications. Acceleration is especially pronounced when the kernel's logic maps poorly to a sequence of commodity processor instructions, and/or maps well to the application-specific hardware.
Hybrid-core computing is used to accelerate applications beyond what is currently physically possible with off-the-shelf processors, or to lower power & cooling costs in a data center by reducing computational footprint. (i.e., to circumvent obstacles such as the power/density challenges faced with today's commodity processors).
References
Computer architecture |
https://en.wikipedia.org/wiki/Cross-device%20tracking | Cross-device tracking is technology that enables the tracking of users across multiple devices such as smartphones, television sets, smart TVs, and personal computers.
More specifically, cross-device tracking is a technique in which technology companies and advertisers deploy trackers, often in the form of unique identifiers, cookies, or even ultrasonic signals, to generate a profile of users across multiple devices, not simply one. For example, one such form of this tracking uses audio beacons, or inaudible sounds, emitted by one device and recognized through the microphone of the other device.
This form of tracking is used primarily by technology companies and advertisers who use this information to piece together a cohesive profile of the user. These profiles inform and predict the type of advertisements the user receives.
Background
There are many ways in which online tracking has manifested itself. Historically, when companies wanted to track users' online behavior, they simply had users sign in to their website. This is a form of deterministic cross-device tracking, in which the user's devices are associated with their account credentials, such as their email or username. Consequently, while the user is logged in, the company can keep a running history of what sites the user has been to and which ads the user interacted with between computers and mobile devices.
Eventually, cookies were deployed by advertisers, providing each user with a unique identifier in his or her browser so that the user's preferences can be monitored. This unique identifier informs the placement of relevant, targeted ads the user may receive. Cookies were also used by companies to improve the user experience, enabling users to pick up where they left off on websites. However, as users began using multiple devices––up to around five––advertisers became confused as to how to track, manage, and consolidate this data across multiple devices as the cookie-based model suggested that each |
https://en.wikipedia.org/wiki/GoMedia | GoMedia is a British company which supplies a management system which delivers entertainment packages including featuring films to travelers on trains and coaches, including on Eurostar trains. The system also gives real-time travel information. Rather than using a monitor on the seat in front of the passenger, it uses the passenger's own device ("Bring Your Own Device" or BYOD) such as mobiles and tablets. It uses the vehicle's own Wi-Fi rather than the passenger's independent mobile network for on-board infotainment.
Their BEAM management system is the first app of its kind in the UK, and is used across Virgin West Coast and East Coast. The films available include Independence Day: Resurgence, which formed the foundation of Virgin Trains’ BEAM launch at Euston Station, London in late 2016. TV box sets from BBC Worldwide, cartoons, games, digital newspapers and magazines are also offered. The free on-demand entertainment provided includes films, catch-up TV, box sets, cartoons, games, newspapers and magazines. A tracker app also shows the train's exact location. GoMedia has its own encoding and offline DRM service offering.
In 2020, GoMedia got acquired by Icomera UK.
GoMedia launched on the following operators:
2016:
Eurostar Onboard Entertainment
Virgin Trains East and West Coast BEAM
2017:
c2c Vista
Greater Anglia Stream
London Northwestern Railway Loop Wi-Fi
National Express VUER
West Midlands Railways Loop Wi-Fi
2018:
Boltbus
Chiltern Railways Chil.tv
Greyhound Coaches
TransPennine Express Exstream
2019:
Avanti West Coast
Great Western Railway
SBB
South Western Railway SWRStream
2020:
Capitol Corridor
San Joaquin
ZIPAIR
See also
Hybrid Broadcast Broadband TV
List of digital distribution platforms for mobile devices
Over-the-top content
References
Streaming media systems
Information appliances
Film and video technology
Interactive television
Internet broadcasting
Streaming television
Video on demand services
Multimedia
Peerca |
https://en.wikipedia.org/wiki/Commodore%20bus | The Commodore serial IEEE-488 bus (IEC Bus), is Commodore's interface for primarily magnetic disk data storage and printers for Commodore 8-bit home computers: the VIC-20, Commodore 64, Commodore 128, Plus/4, Commodore 16, and Commodore 65.
Description and history
The parallel IEEE-488 interface used on the Commodore PET (1977) computer line was too costly, so a cost reduced version was developed, which consisted of a stripped down, serial version of the IEEE-488 interface, with only a few signals remaining; however, the general protocol layout was kept. Commodore began using this bus with the VIC-20 (1980). Connection to the computer uses a DIN-6 connector (DIN 45322).
Transfer speed
Interface
Protocol description
The bus signals are digital single-ended open collector TTL and active when low. Bus devices have to provide their own power.
Because the bus lines are electrically open collector it works like a long OR gate between all device line drivers. The logical value for ground is true and vice versa. Any device may set a line "true". A line only becomes "false" if all devices signal false.
Transmission begins with the bus talker holding the Clock line true, and the listener(s) holding the Data line true. To begin the talker releases the Clock line to false. When all bus listeners are ready to receive they release the Data line to false. If the talker waits more than 200 µs without the Clock line going true (idle state), listeners have to perform End-or-Identify (EOI).
If the Data line being false (released) isn't acknowledged by the talker within 200 µs, the listener knows that the talker is in the process of EOI that means "this character will be the last one." When the listener detects the 200 µs timeout, it must acknowledge this by pulling the Data line true for at least 60 µs, and then release it. The talker can revert to transmitting again within 60 µs by pulling the Clock line true.
Data is eight bits starting with the least significant bit. |
https://en.wikipedia.org/wiki/Stub-girder%20system | A stub-girder system (or stub girder system) is a model of steel frame structures consisting of beams and decking, originally developed in the early 1970s in part by Joseph Colaco of Ellisor Engineers Inc..
Short lengths of stub girders the same depth as the floor beams are welded to the tops of the main girders to provide a connection to the slab.
References
Iron and steel buildings |
https://en.wikipedia.org/wiki/Top%20trading%20cycle | Top trading cycle (TTC) is an algorithm for trading indivisible items without using money. It was developed by David Gale and published by Herbert Scarf and Lloyd Shapley.
Housing market
The basic TTC algorithm is illustrated by the following house allocation problem. There are students living in the student dormitories. Each student lives in a single house. Each student has a preference relation on the houses, and some students prefer the houses assigned to other students. This may lead to mutually-beneficial exchanges. For example, if student 1 prefers the house allocated to student 2 and vice versa, both of them will benefit by exchanging their houses. The goal is to find a core-stable allocation – a re-allocation of houses to students, such that all mutually-beneficial exchanges have been realized (i.e., no group of students can together improve their situation by exchanging their houses).
The algorithm works as follows.
Ask each agent to indicate his "top" (most preferred) house.
Draw an arrow from each agent to the agent, denoted , who holds the top house of .
Note that there must be at least one cycle in the graph (this might be a cycle of length 1, if some agent currently holds his own top house). Implement the trade indicated by this cycle (i.e., reallocate each house to the agent pointing to it), and remove all the involved agents from the graph.
If there are remaining agents, go back to step 1.
The algorithm must terminate, since in each iteration we remove at least one agent. It can be proved that this algorithm leads to a core-stable allocation.
For example, suppose the agents' preference ordering is as follows (where only the at most 4 top choices are relevant):
In the first iteration, the only top-trading-cycle is {3} (it is a cycle of length 1), so agent 3 keeps his current house and leaves the market.
In the second iteration, agent 1's top house is 2 (since house 3 is unavailable). Similarly, agent 2's top house is 5 and agent 5's top |
https://en.wikipedia.org/wiki/Fixed-point%20logic | In mathematical logic, fixed-point logics are extensions of classical predicate logic that have been introduced to express recursion. Their development has been motivated by descriptive complexity theory and their relationship to database query languages, in particular to Datalog.
Least fixed-point logic was first studied systematically by Yiannis N. Moschovakis in 1974, and it was introduced to computer scientists in 1979, when Alfred Aho and Jeffrey Ullman suggested fixed-point logic as an expressive database query language.
Partial fixed-point logic
For a relational signature X, FO[PFP](X) is the set of formulas formed from X using first-order connectives and predicates, second-order variables as well as a partial fixed point operator used to form formulas of the form , where is a second-order variable, a tuple of first-order variables, a tuple of terms and the lengths of and coincide with the arity of .
Let be an integer, be vectors of variables, be a second-order variable of arity , and let be an FO(PFP,X) function using and as variables. We can iteratively define such that and (meaning with substituted for the second-order variable ). Then, either there is a fixed point, or the list of s is cyclic.
is defined as the value of the fixed point of on if there is a fixed point, else as false. Since s are properties of arity , there are at most values for the s, so with a polynomial-space counter we can check if there is a loop or not.
It has been proven that on ordered finite structures, a property is expressible in FO(PFP,X) if and only if it lies in PSPACE.
Least fixed-point logic
Since the iterated predicates involved in calculating the partial fixed point are not in general monotone, the fixed-point may not always exist.
FO(LFP,X), least fixed-point logic, is the set of formulas in FO(PFP,X) where the partial fixed point is taken only over such formulas that only contain positive occurrences of (that is, occurrences preceded b |
https://en.wikipedia.org/wiki/Multiplicative%20independence | In number theory, two positive integers a and b are said to be multiplicatively independent if their only common integer power is 1. That is, for integers n and m, implies . Two integers which are not multiplicatively independent are said to be multiplicatively dependent.
As examples, 36 and 216 are multiplicatively dependent since , whereas 6 and 12 are multiplicatively independent.
Properties
Being multiplicatively independent admits some other characterizations. a and b are multiplicatively independent if and only if is irrational. This property holds independently of the base of the logarithm.
Let and be the canonical representations of a and b. The integers a and b are multiplicatively dependent if and only if k = l, and for all i and j.
Applications
Büchi arithmetic in base a and b define the same sets if and only if a and b are multiplicatively dependent.
Let a and b be multiplicatively dependent integers, that is, there exists n,m>1 such that . The integers c such that the length of its expansion in base a is at most m are exactly the integers such that the length of their expansion in base b is at most n. It implies that computing the base b expansion of a number, given its base a expansion, can be done by transforming consecutive sequences of m base a digits into consecutive sequence of n base b digits.
References
Number theory |
https://en.wikipedia.org/wiki/Viu%20%28streaming%20service%29 | Viu (pronounced as view) is a Hong Kong-based over-the-top (OTT) video streaming provider from PCCW Media Group's Viu International Ltd. Operated in a dual-revenue model comprising subscriptions and advertising, Viu delivers content in different genres from Asia's top content providers with local language subtitles, as well as original production series under the Viu Original initiative (similar to original programming from other services like Disney+, Amazon Prime Video and Netflix).
Viu is now available in 16 markets across Asia, Africa and the Middle East including Hong Kong, Singapore, Thailand, Philippines, United Arab Emirates, Bahrain, Egypt, Indonesia, Jordan, Kuwait, Malaysia, Oman, Qatar, Saudi Arabia, Myanmar and South Africa. As of December 2022 annual results, Viu had an estimated 66.5 million monthly active users.
History
Viu International Ltd launched the Viu OTT video service in Hong Kong on 26 October 2015.
In January 2016, Viu announced its official launch in Singapore.
In March 2016, Viu announced its official launch in India and Malaysia.
In May 2016, Viu launches in Indonesia.
In November 2016, Viu announced its official launch in the Philippines and has achieved four million users and over 218 million video views.
In February 2017, Viu was available in major Middle East countries including Bahrain, Egypt, Jordan, Kuwait, Oman, Qatar, Saudi Arabia and the United Arab Emirates.
In May 2017, Viu announced its official launch in Thailand and has expanded to 15 markets across Asia and the Middle East countries.
In September 2018, Viu announced its official launch in Myanmar.
In March 2019, Viu announced its official launch in South Africa.
In December 2019, Viu announced its suspension of operations in India without providing a date. On 5 November 2021, Viu stopped its services in India.
In June 2023, PCCW and the Canal+ Group announced a strategic partnership between the two companies, under which Canal+ will invest $300 million, inclu |
https://en.wikipedia.org/wiki/Usability%20of%20web%20authentication%20systems | Usability of web authentication systems refers to the efficiency and user acceptance of online authentication systems. Examples of web authentication systems are passwords, federated identity systems (e.g. Google oAuth 2.0, Facebook connect, Mozilla persona), email-based single sign-on (SSO) systems (e.g. SAW, Hatchet), QR code-based systems (e.g. Snap2Pass, WebTicket) or any other system used to authenticate a user's identity on the web. Even though the usability of web authentication systems should be a key consideration in selecting a system, very few web authentication systems (other than passwords) have been subjected to formal usability studies or analysis.
Usability and users
A web authentication system needs to be as usable as possible whilst not compromising the security that it needs to ensure. The system needs to restrict access by malicious users whilst allowing access to authorised users. If the authentication system does not have sufficient security, malicious users could easily gain access to the system. On the other hand, if the authentication system is too complicated and restrictive, an authorised user would not be able to (or want to) use it. Strong security is achievable in any system, but even the most secure authentication system can be undermined by the users of the system, often referred to as the "weak links" in computer security.
Users tend to inadvertently increase or decrease security of a system. If a system is not usable, security could suffer as users will try to minimize the effort required to provide input for authentication, such as writing down their passwords on paper. A more usable system could prevent this from happening. Users are more likely to oblige to authentication requests from systems that are important (e.g. online banking), as opposed to less important systems (e.g. a forum that the user visits infrequently) where these mechanisms might just be ignored. Users accept the security measures only up to a certain point b |
https://en.wikipedia.org/wiki/Institute%20of%20Industrial%20and%20Systems%20Engineers | The Institute of Industrial and Systems Engineers (IISE), formerly the Institute of Industrial Engineers, is a professional society dedicated solely to the support of the industrial engineering profession and individuals involved with improving quality and productivity.
The institute was founded in 1948 as the American Institute of Industrial Engineers. In 1981, the name was changed to Institute of Industrial Engineers in order to reflect its international membership base. The name was changed again to the present Institute of Industrial and Systems Engineers in 2016 to reflect the changing scope of engineers working with large-scale, integrated systems.
Members include both college students and professionals. IISE holds annual regional and national conferences in the United States. IISE is headquartered in the United States in Peachtree Corners, Georgia, a suburb located northeast of Atlanta.
Student Chapters
A student chapter is a group of industrial engineer students who have the initiative to be leaders among their classmates. Every college or university that offers an Industrial Engineer degree program is eligible to have an IISE student chapter. Students need to send a formal application to the organization and once it is approved, they will be assigned with a chapter number and a formal recognition. Then, a Faculty Advisor and Chapter Officers are elected. They will be the leaders for their department during an academic period, and have the challenge and responsibility to engage their classmates with learning and networking opportunities.
Board of Members
An Officer Slate has to be submitted by each Student Chapter at the beginning of the academic period. The main requirement to be part of the Board is paying for IISE's membership. Additionally, other requirements such as a minimum 3.00/4.00 GPA and extracurricular involvement are asked. Below, the structure for the Board is presented with their main duties:
Student Chapter President: Strategic pla |
https://en.wikipedia.org/wiki/Helmut%20Veith | Helmut Veith (5 February 1971 – 12 March 2016) was an Austrian
computer scientist who worked on the areas of computer-aided
verification, software engineering, computer security, and logic in computer science. He was a Professor of Informatics
at the Vienna University of Technology (TU Wien), Austria.
Education
Veith received his Diplom-Ingenieur in computational logic at TU Wien
in 1994. He received his doctorate in computer science in 1998 under
the supervision of Professor Georg Gottlob on the topic of computational
complexity of logics and database query languages.
Career and research
Veith was a professor at the Faculty of Informatics of TU Wien, and an adjunct professor at Carnegie Mellon University, Pittsburgh.
Previously he was a professor at the Department of Computer Science of TU Darmstadt (2008–2009) and TU Munich (2003–2008), and an associate professor at TU Wien (2001–2003).
He received his habilitation at TU Wien in 2001.
Veith published more than 120 refereed publications in the areas of
computer-aided verification and program analysis, logic in computer
science, software engineering,
computer security, and theoretical computer science. He was a co-editor of the Handbook of Model Checking. In 2014, he was co-chair of the Vienna Summer of Logic 2014, the largest conference on logic and computer science in history.
Veith is best known for his role in the development of
Counterexample-guided Abstraction Refinement (CEGAR), which is a key
ingredient in modern model checkers for software and hardware. His
research applies formal and logical methods to problems in software
technology and engineering, focusing on model checking, software
verification and testing, embedded software and computer security.
Science communication
Veith was a co-founder of the Vienna Center for Logic and Algorithms (together with Stefan Szeider). Veith was member of the organizational board of the largest logic conference in the history – the Vienna Summer of Logic 2014, w |
https://en.wikipedia.org/wiki/Biotechnology%20risk | Biotechnology risk is a form of existential risk from biological sources, such as genetically engineered biological agents. The release of such high-consequence pathogens could be
deliberate (in the form of bioterrorism or biological weapons)
accidental, or
a naturally occurring event.
A chapter on biotechnology and biosecurity was included in Nick Bostrom's 2008 anthology Global Catastrophic Risks, which covered risks including viral agents. Since then, new technologies like CRISPR and gene drives have been introduced.
While the ability to deliberately engineer pathogens has been constrained to high-end labs run by top researchers, the technology to achieve this is rapidly becoming cheaper and more widespread. For example, the diminishing cost of sequencing the human genome (from $10 million to $1,000), the accumulation of large datasets of genetic information, the discovery of gene drives, and the discovery of CRISPR. Biotechnology risk is therefore a credible explanation for the Fermi paradox.
Genetically modified organisms (GMO)
There are several advantages and disadvantages of genetically modified organisms. The disadvantages include many risks, which have been classified into six classes: 1. Health risks, 2. Environmental risks, 3. Threat to biodiversity, 4. Increase in social differences, 5. Scientific concerns, 6. Potential threat to the autonomy and welfare of farmers who wish to produce non-GM products.
1. Health risks
The following are potential health risks related to the consumption of GMOs.
Unexpected gene interactions
The expected outcomes of the transferred gene construct may differ due to gene interactions. It has been hypothesized that genetic modification can potentially cause changes in metabolism, though results are conflicting in animal studies.
Cancer risks
GM crops require lower amounts of pesticide compared to non-GM crops. Because some pesticides' main component is glyphosate, the lower amounts of pesticides needed on GM crops may |
https://en.wikipedia.org/wiki/Strimvelis | Autologous CD34+ enriched cell fraction that contains CD34+ cells transduced with retroviral vector that encodes for the human ADA cDNA sequence, sold under the brand name Strimvelis, is a medication used to treat severe combined immunodeficiency due to adenosine deaminase deficiency (ADA-SCID).
ADA-SCID is a rare inherited condition in which there is a change (mutation) in the gene needed to make an enzyme called adenosine deaminase (ADA). As a result, people lack the ADA enzyme. Because ADA is essential for maintaining healthy lymphocytes (white blood cells that fight off infections), the immune system of people with ADA-SCID does not work properly and without effective treatment they rarely survive more than two years.
Strimvelis is the first ex vivo autologous gene therapy approved by the European Medicines Agency (EMA).
Medical uses
Strimvelis is indicated for the treatment of people with severe combined immunodeficiency due to adenosine deaminase deficiency (ADA-SCID), for whom no suitable human leukocyte antigen (HLA)-matched related stem cell donor is available.
Treatment
The treatment is personalized for each person; hematopoietic stem cell (HSCs) are extracted from the person and purified so that only CD34-expressing cells remain. Those cells are cultured with cytokines and growth factors and then transduced with a gammaretrovirus containing the human adenosine deaminase gene and then reinfused into the person. These cells take root in the person's bone marrow, replicating and creating cells that mature and create normally functioning adenosine deaminase protein, resolving the problem. As of April 2016, the transduced cells had a shelf life of about six hours.
Prior to extraction, the person is treated with granulocyte colony-stimulating factor in order to increase the number of stem cells and improve the harvest; after that but prior to reinfusion, the person is treated with busulfan or melphalan to kill as many of the person's existing HSCs to incr |
https://en.wikipedia.org/wiki/Circuit%20Value%20Problem | The Circuit Value Problem (or Circuit Evaluation Problem) is the computational problem of computing the output of a given Boolean circuit on a given input.
The problem is complete for P under uniform AC reductions. Note that, in terms of time complexity, it can be solved in linear time simply by a topological sort.
The Boolean Formula Value Problem (or Boolean Formula Evaluation Problem) is the special case of the problem when the circuit is a tree. The Boolean Formula Value Problem is complete for NC.
The problem is closely related to the Boolean Satisfiability Problem which is complete for NP and its complement, the Propositional Tautology Problem, which is complete for co-NP.
See also
Circuit satisfiability
Switching lemma
References
Polynomial-time problems
Computational problems
Theoretical computer science |
https://en.wikipedia.org/wiki/Sex%20technology | Sex technology, also called sex-tech or sextech, is technology and technology-driven ventures that are designed to enhance, innovate, or otherwise change human sexuality and/or the human sexual experience. Use of the term was propagated online by Cindy Gallop from MLNP and is associated with an advancement of the Digital Revolution from 2010 and its impact on society and culture. It is often used in conjunction or interchangeably with the term 'teledildonics' referring to the remote connection between Bluetooth enabled sex toys that use haptic feedback to reciprocate or mimic human, sexual interaction. However, teledildonics is far more representative of Bluetooth-enabled sex toys and captures the technological capacities of its time whereas sex-technology is rooted in more modern discourse. As such, the word sex-tech is an umbrella term used to describe multiple technologies spanning from VR porn, health and sexual wellness platform or app-based technology, Bluetooth enabled sex toys, pornography video scripting, remote sex interfaces and sex robots.
While still nascent, sextech has seen a recent boom in mainstream acceptance due to a big push from female-led firms in the space. Notable individuals include Cindy Gallop (Founder and CEO of MLNP), Polly Rodriguez (Co-founder and CEO of Unbound), Alex Fine and Janet Lieberman (Co-founders of Dame Products), Andrea Barrica (Founder and CEO of O.School), Liz Klinger and Anna Lee (Co-founders of Lioness), Kate Moyle (Psychosexual & Relationship Therapist at Pillow Play), Dr. Soumyadip Rakshit and Stephanie Alys (Co-founders of MysteryVibe), Dr. Kate Devlin from Goldsmiths University, Maxine Lynn (sextech attorney, and CEO of Stript Erotic Designs), and journalists including Alix Fox, Nichi Hodgson, Rebecca Newman, Gigi Engle, Bryony Cole, Suzannah Weiss, Joseph Seon Kim, Hallie Lieberman, and GirlOnTheNet.
Sextech entrepreneur Andrea Barrica estimated the market at $30 billion in 2018, with $800 million coming from Ama |
https://en.wikipedia.org/wiki/Horizon%20%28online%20magazine%29 | Horizon is an online-only, open-access magazine covering research and innovation, published in Brussels since 2013 by the European Commission. It covers a wide range of topics, including agriculture, energy, environment, frontier research, health, ICT, industry, policy, science in society, security, social sciences, space and transport.
Horizon publishes three to five articles per week and in English only and normally covers research projects which were funded by the European Union (EU) through its Framework Programmes for Research and Technological Development, such as FP7 and Horizon 2020, and through the European Research Council. Occasionally, Horizon also publishes policy announcements from the European Commission's Directorate-General for Research and Innovation.
Articles from Horizon Magazine can be republished under a license which requires simple attribution. Horizon articles have been shared or re-published, among others, by the European Space Agency, by the University of Oxford, by the Hebrew University of Jerusalem, by the University of Trento and by the Welfare State Futures Coordination Office at Humboldt University of Berlin and by the BBC's The Naked Scientists podcast.
Horizon is produced, on the European Commission's behalf, by ICF Next (previously ICF Mostra), a Brussels-based communications division of ICF.
References
External links
Horizon official website
European Union and science and technology
Magazines established in 2013
Science and technology magazines
Magazines published in Belgium
Magazines published in Brussels
2013 establishments in Belgium
Online magazines |
https://en.wikipedia.org/wiki/G%C3%B6bel%27s%20sequence | In mathematics, Göbel's sequence is a sequence of rational numbers defined by the recurrence relation
with starting value
Göbel's sequence starts with
1, 1, 2, 3, 5, 10, 28, 154, 3520, 1551880, ...
The first non-integral value is x43.
Generalization
Göbel's sequence can be generalized to kth powers by
The least indices at which the k-Göbel sequences assume a non-integral value are
43, 89, 97, 214, 19, 239, 37, 79, 83, 239, ...
References
External links
Göbel's Sequence
Integer sequences
Recurrence relations |
https://en.wikipedia.org/wiki/Nomadix | Nomadix is a Woodland Hills, CA-based developer of network gateway equipment (which includes access gateways and traffic optimizers), used by hotels and other businesses to deliver Internet access to end users.
HistoryNomadix was founded in 1998 by UCLA Computer Science Professor Dr. Leonard Kleinrock, one of the founders of ARPANET, and a graduate student, Joel Short. The name Nomadix came from Kleinrock's studies of nomadic computing, which he described in a 2015 Barron's interview, "nomadic computing...refers to the capability that wherever I go, I should be able to connect seamlessly, and gain as much functionality and services as I was able to gain in my office, my home, my laboratory." Kleinrock served as the company's first CEO and Chairman, and Short served as Chief Technology Officer.
The company's first product, the Nomadix Universal Subscriber Gateway, shipped in September 1999. The gateway was designed to allow visiting computers to connect to the Internet, without needing extra equipment or software on the computer. Built-in payment gateway features managed optional billing and payment functions.
In February 2002, Nomadix announced a technology licensing deal for their Nomadix Service Engine (NSE) software with Agere Systems, now part of Avago Technologies, and at the time the second largest Wi-Fi vendor behind Cisco Systems.
In March 2002, the company announced a customized version of their Universal Subscriber Gateway (USG), designed in a partnership with wireless networking company Boingo Wireless, to allow businesses to set up commercial Wi-Fi hot spots.
In January 2004, the company was awarded the industry's first patent for redirecting a customer's computer to a sign-in page, also known as a "gateway" page.
In July 2004, Nomadix was sued by Carlsbad, CA-based IP3 Networks, a wireless networking competitor, for trade libel, for allegedly telling customers that IP3 was stealing their technology. In February 2006, the case was dismissed.
|
https://en.wikipedia.org/wiki/Interspecies%20hydrogen%20transfer | Interspecies hydrogen transfer (IHT) is a form of interspecies electron transfer. It is a syntrophic process by which H2 is transferred from one organism to another, particularly in the rumen and other anaerobic environments.
IHT was discovered between Methanobacterium bryantii strain M.o.H and an "S" organism in 1967 by Marvin Bryant, Eileen Wolin, Meyer Wolin, and Ralph Wolfe at the University of Illinois. The two form a culture that was mistaken as a species Methanobacillus omelianskii. It was shown in 1973 that this process occurs between Ruminococcus albus and Wolinella succinogenes. A more recent publication describes how the gene expression profiles of these organisms changes when they undergo interspecies hydrogen transfer; of note, a switch to an electron-confurcating hydrogenase occurs in R. albus 7.
This process affects the carbon cycle: methanogens can participate in interspecies hydrogen transfer combining H2 and CO2 to produce CH4. Besides methanogens, acetogens, and sulfate-reducing bacteria can participate in IHT.
References
Biochemistry |
https://en.wikipedia.org/wiki/Mammalian-wide%20interspersed%20repeat | Mammalian-wide interspersed repeats (MIRs) are transposable elements in the genomes of some organisms and belong to the group of Short interspersed nuclear elements (SINEs).
Incidence
MIRs are found in all mammals (including marsupials).
In human
It is estimated that there are around 368,000 MIRs in the human genome.
Structure
The MIR consensus sequence is 260 basepairs long and has an A/T-rich 3' end.
Propagation
Like other Short interspersed nuclear elements (SINEs), MIR elements used the machinery of LINE elements for their propagation in the genome, which took place around 130 million years ago. They cannot retrotranspose anymore since the loss of activity of the required reverse transcriptase.
History of discovery
MIR elements have been first described in human genome 1989-1991
and were first referred as MB1 family repeats (mirror to sequences of mouse B1 repeat). Then this family repeats were found in other mammalian genomes. Then this family was renamed as "Mammalian interspersed repeats" in 1992 Later this family was shown to be common for vertebrate genomes.
References
Mobile genetic elements
Molecular biology |
https://en.wikipedia.org/wiki/List%20of%20self-intersecting%20polygons | Self-intersecting polygons, crossed polygons, or self-crossing polygons are polygons some of whose edges cross each other. They contrast with simple polygons, whose edges never cross.
Some types of self-intersecting polygons are:
the crossed quadrilateral, with four edges
the antiparallelogram, a crossed quadrilateral with alternate edges of equal length
the crossed rectangle, an antiparallelogram whose edges are two opposite sides and the two diagonals of a rectangle, hence having two edges parallel
Star polygons
pentagram, with five edges
Hexagram, with six edges
heptagram, with seven edges
octagram, with eight edges
enneagram or nonagram, with nine edges
decagram, with ten edges
hendecagram, with eleven edges
dodecagram, with twelve edges
icositetragram, with twenty four edges
257-gram, with two hundred and fifty seven edges
See also
Complex polygon
Geometric shapes
Mathematics-related lists |
https://en.wikipedia.org/wiki/Albert%20Fathi | Albert Fathi (born 27 October 1951, in Egypt) is an Egyptian-French mathematician. He specializes in dynamical systems and is currently a professor at the Georgia Institute of Technology.
Fathi attended the Collège des frères Lasalle in Cairo and grew up bilingual in French and Arabic. At age ten, he came as a political refugee to Paris and studied at the École normale supérieure in Saint-Cloud. He received in 1980 his PhD from the University of Paris 11 under Laurence Siebenmann with thesis Transformations et homéomorphismes préservant la mesure. From 1987 to 1992 he was a professor at the University of Florida. Since 1992 he has taught at the École normale supérieure de Lyon (unit of pure and applied mathematics). He has also taught at the École polytechnique.
He has been a visiting professor at the Institute for Advanced Study (1986/87), at the Universidad Complutense de Madrid (Instituto de Matemática Interdisciplinar), in Nanjing, in Cambridge and at MSRI. In 2013 he received the Sophie Germain Prize. He is a member of the Institut Universitaire de France.
At the International Congress of Mathematicians in 2014 in Seoul, Fathi was an Invited Speaker with talk Weak KAM Theory: the connection between Aubry-Mather theory and viscosity solutions of the Hamilton-Jacobi equation.
Selected publications
The Weak KAM Theorem in Lagrangian Dynamics, Cambridge University Press 2012 Preliminayr version of Weak KAM Theorem in Lagrangian Dynamics
with François Laudenbach, Valentin Poénaru: Thurston´s Work on Surfaces, Princeton University Press 2012 (originally published in Travaux de Thurston, Asterisque, tome 65/66, 1979)
editor with Jean-Christophe Yoccoz: Dynamical systems: Michael Herman memorial volume, Cambridge University Press 2006
with Michael Shub, Remi Langevin: Global stability of dynamical systems, Springer Verlag 1987
editor with Yong-Geun Oh, Claude Viterbo: Symplectic topology and measure preserving dynamical systems, AMS 2010 (Summer Conference, S |
https://en.wikipedia.org/wiki/Applicative%20functor | In functional programming, an applicative functor, or an applicative for short, is an intermediate structure between functors and monads. Applicative functors allow for functorial computations to be sequenced (unlike plain functors), but don't allow using results from prior computations in the definition of subsequent ones (unlike monads). Applicative functors are the programming equivalent of lax monoidal functors with tensorial strength in category theory.
Applicative functors were introduced in 2008 by Conor McBride and Ross Paterson in their paper Applicative programming with effects.
Applicative functors first appeared as a library feature in Haskell, but have since spread to other languages as well, including Idris, Agda, OCaml, Scala and F#. Glasgow Haskell, Idris, and F# offer language features designed to ease programming with applicative functors.
In Haskell, applicative functors are implemented in the Applicative type class.
Definition
In Haskell, an applicative is a parameterized type that we think of as being a container for data of the parameter type plus two methods pure and . The pure method for an applicative of parameterized type f has type
pure :: a -> f a
and can be thought of as bringing values into the applicative. The method for an applicative of type f has type
(<*>) :: f (a -> b) -> f a -> f b
and can be thought of as the equivalent of function application inside the applicative.
Alternatively, instead of providing , one may provide a function called liftA2. These two functions may be defined in terms of each other; therefore only one is needed for a minimally complete definition.
Applicatives are also required to satisfy four equational laws:
Identity:
Composition:
Homomorphism:
Interchange:
Every applicative is a functor. To be explicit, given the methods pure and , fmap can be implemented as
fmap g x = pure g <*> x
The commonly-used notation is equivalent to .
Examples
In Haskell, the Maybe type can be made an insta |
https://en.wikipedia.org/wiki/3Com%203c509 | 3Com 3c509 is a line of Ethernet IEEE 802.3 network cards for the ISA, EISA, MCA and PCMCIA computer buses. It was designed by 3Com, and put on the market in 1994.
Features
The 3Com 3c5x9 family of network controllers has various interface combinations of computer bus including ISA, EISA, MCA and PCMCIA. For network connection, 10BASE-2, AUI and 10BASE-T are used.
B = On ISA and PCMCIA adapter numbers indicates that these adapters are part of the second generation of the Parallel Tasking EtherLink III technology.
The DIP-28 (U1) EPROM for network booting may be 8, 16 or 32 kByte size. This means EPROMs of type 64, 128, 256 kbit (2^10) are compatible, like the 27C256.
Boot ROM address is located between 0xC0000 - 0xDE000.
Teardown example, the 3c509B-Combo
The Etherlink III 3C509B-Combo is registered with the FCC ID DF63C509B. The main components on the card is Y1: crystal oscillator 20 MHz, U50: coaxial transceiver interface DP8392, U4: main controller 3Com 9513S (or 9545S etc.), U6: 70 ns CMOS static RAM, U1: DIP-28 27C256 style EPROM for boot code, U3: 1024 bit 5V CMOS Serial EEPROM (configuration).
Label:
Etherlink III
(C) 1994 3C509B-C
ALL RIGHTS RESERVED
ASSY 03-0021-001 REV-A
FCC ID: DF63C509B
Barcode:
EA=0020AFDCC34C
SN=6AHDCC34C
MADE IN U.S.A.
R = Resistor
C = Capacitor
L = Inductance
Q = Transistor
CR = Transistor
FL = Transformer
T = Transformer
U = Integrated circuit
J = Jumper or connector
VR
F
FL70: Pulse transformer
bel9509 A
0556-3873-03
* HIPOTTED
Y1: 20 MHz crystal
20.000M
652DA
U50:
P9512BR
DP8392CN
Coaxial Transceiver Interface
T50: Pulse transformer, pinout: 2x8
VALOR
ST7033
x00: Pulse transformer
VALOR
PT0018
CHINA M
9449 C
U4: Plastic package 33x33 pins
Parallel Tasking TM
3Com
40-0130-002
9513S 22050553
AT&T 40-01302
Another chip with the same function:
40-0130-003
9545S 48324401
AT&T 40-01303
U6: 8192 x 8-bit 70 ns CMOS static RAM
HY 6264A
LJ-70
9509B KOR |
https://en.wikipedia.org/wiki/Deutsches%20Rechtsw%C3%B6rterbuch | The Deutsches Rechtswörterbuch (DRW) or Dictionary of Historical German Legal Terms is a historic legal dictionary developed under the aegis of the Heidelberg Academy of Sciences and Humanities. The research unit took up work in 1897 and until today has completed 93,155 articles, ranging from Aachenfahrt (pilgrimage to Aachen) to selbzwölft (being one of twelve persons). These have been published in 12 consecutive volumes and are also freely accessible online. In course of its research, the DRW also touches upon sources in Old English, of Hanseatic provenance and Pennsylvania German. The research unit will presumably conclude its work in 2036.
Objectives
The DRW aims at covering German legal terminology from the Middle Ages up to the beginning of the 19th century. In this context, legal language is understood as a general historical vocabulary in reference to legal meanings. The research unit wants to outline how legal concepts, convictions and institutions manifested themselves in everyday language. Concomitantly, the DRW does not only contain legal terms, but common phrases bearing relation to legal contexts. Furthermore, the DRW as part of its research lists the legally relevant vocabulary, not only of Modern High German, but of all Western German language varieties. The dictionary cites usage of historical vocabulary from various regions of the West Germanic language area from England to Transylvania, from Lorraine to the Baltic Seas. In order to capture the full lexical diversity of meanings for each word, the dictionary employs techniques of synchronic and diachronic comparative law in addition to purely linguistic and lexicographic approaches, against the backdrop of historical contextualisation.
As Germany’s Federal President Richard von Weizsäcker once wrote:
“The Rechtswörterbuch incorporates language- and culture-historical references beyond purely legal understandings, thus making the work truly cross-disciplinary.”
History
The DRW was initiated i |
https://en.wikipedia.org/wiki/Generative%20adversarial%20network | A generative adversarial network (GAN) is a class of machine learning framework and a prominent framework for approaching generative AI. The concept was initially developed by Ian Goodfellow and his colleagues in June 2014. In a GAN, two neural networks contest with each other in the form of a zero-sum game, where one agent's gain is another agent's loss.
Given a training set, this technique learns to generate new data with the same statistics as the training set. For example, a GAN trained on photographs can generate new photographs that look at least superficially authentic to human observers, having many realistic characteristics. Though originally proposed as a form of generative model for unsupervised learning, GANs have also proved useful for semi-supervised learning, fully supervised learning, and reinforcement learning.
The core idea of a GAN is based on the "indirect" training through the discriminator, another neural network that can tell how "realistic" the input seems, which itself is also being updated dynamically. This means that the generator is not trained to minimize the distance to a specific image, but rather to fool the discriminator. This enables the model to learn in an unsupervised manner.
GANs are similar to mimicry in evolutionary biology, with an evolutionary arms race between both networks.
Definition
Mathematical
The original GAN is defined as the following game:Each probability space defines a GAN game.
There are 2 players: generator and discriminator.
The generator's strategy set is , the set of all probability measures on .
The discriminator's strategy set is the set of Markov kernels , where is the set of probability measures on .
The GAN game is a zero-sum game, with objective function
The generator aims to minimize the objective, and the discriminator aims to maximize the objective.The generator's task is to approach , that is, to match its own output distribution as closely as possible to the reference distribution. T |
https://en.wikipedia.org/wiki/Society%20for%20Biological%20Engineering%20%28UIET%29 | Society for Biological Engineering Students Chapter at UIET, Panjab University (SBE UIET) is professional organisation for Biotechnology students of engineering and sciences running under the department of Biotechnology, University Institute of Engineering and Technology, Panjab University, located in Chandigarh, India. It is the first student chapter in India and was established in September 2009.
Society for Biological Engineering, AIChE
The Society for Biological Engineering (SBE), an American Institute of Chemical Engineers Technological Community, is a professional organization of Biological engineers and scientists in the field of Biotechnology. Its area of working generally focuses on Bioprocessing, Biomedical and Biomolecular engineering.
Working of SBE UIET
SBE UIET offers membership to Biotechnology undergraduates and postgraduates, B.Sc. graduates and postgraduates and research scholars studying in tricity of Chandigarh, Mohali and Panchkula every year. SBE UIET board for a particular year is selected on the basis of several in-person and telephonic interviews.
SBE UIET holds industrial visits twice a session and an education and adventure tour once a session.
Events in 2015-16
SBE UIET conducted several events in 2015-16 and yet to organize many more. Some of them are:
Crime Scene Investigation
BioStreaks
BioCanvas
Pseudo Science
Mobile Quiz 2016
BioConnect 2016
Events in 2016-17
SBE UIET conducted several events in 2016-17 and there are many more yet to organize. Some of them are:
Bio-cAMP 2016: The IPR Cell of Centre for Industry Institute Partnership Programme (CIIPP) of Panjab University (PU) in collaboration with Cell for IPR Promotion & Management (CIPAM), department of Industrial Policy and Promotion, Government of India organized a Special Lecture Series under a National Symposium "Bio-cAMP 2016". The discussions were made on "Current Trends and Future Prospects in Biotechnology".This event was organized by the Biote |
https://en.wikipedia.org/wiki/Sensor%20Media%20Access%20Control | Sensor Media Access Control(S-MAC) is a network protocol for sensor networks. Sensor networks consist of tiny, wirelessly communicating computers (sensor nodes), which are deployed in large numbers in an area to network independently and as long as monitor their surroundings in group work with sensors, to their energy reserves are depleted. A special form of ad hoc network, they make entirely different demands on a network protocol (for example, the Internet) and therefore require network protocols specially build for them (SMAC). Sensor Media Access Control specifies in detail how the nodes of a sensor network exchange data, controls the Media Access Control (MAC) to access the shared communication medium of the network, regulates the structure of the network topology, and provides a method for synchronizing.
Although today primarily of academic interest, S-MAC was a significant step in sensor network research and inspired many subsequent network protocols. It was introduced in 2001 by Wei Ye, John Heidemann and Deborah Estrin of the University of Southern California and was intended to conserve scarce, non-rechargeable energy resources of sensor nodes. The development was supported financially by the US military agency DARPA under the project Sensor Information Technology (Sensit).
See also
Zebra Media Access Control
802.11
handshaking
Load balancer
External links
Sensor-MAC (S-MAC): Medium Access Control for Wireless Sensor Networks
References
Network protocols |
https://en.wikipedia.org/wiki/Steiner%27s%20conic%20problem | In enumerative geometry, Steiner's conic problem is the problem of finding the number of smooth conics tangent to five given conics in the plane in general position. If the problem is considered in the complex projective plane CP2, the correct solution is 3264 (). The problem is named after Jakob Steiner who first posed it and who gave an incorrect solution in 1848.
History
claimed that the number of conics tangent to 5 given conics in general position is 7776 = 65, but later realized this was wrong. The correct number 3264 was found in about 1859 by Ernest de Jonquières who did not publish because of Steiner's reputation, and by using his theory of characteristics, and by Berner in 1865. However these results, like many others in classical intersection theory, do not seem to have been given complete proofs until the work of Fulton and MacPherson in about 1978.
Formulation and solution
The space of (possibly degenerate) conics in the complex projective plane CP2 can be identified with the complex projective space CP5 (since each conic is defined by a homogeneous degree-2 polynomial in three variables, with 6 complex coefficients, and multiplying such a polynomial by a non-zero complex number does not change the conic). Steiner observed that the conics tangent to a given conic form a degree 6 hypersurface in CP5. So the conics tangent to 5 given conics correspond to the intersection points of 5 degree 6 hypersurfaces, and by Bézout's theorem the number of intersection points of 5 generic degree 6 hypersurfaces is 65 = 7776, which was Steiner's incorrect solution. The reason this is wrong is that the five degree 6 hypersurfaces are not in general position and have a common intersection in the Veronese surface, corresponding to the set of double lines in the plane, all of which have double intersection points with the 5 conics. In particular the intersection of these 5 hypersurfaces is not even 0-dimensional but has a 2-dimensional component. So to find the correc |
https://en.wikipedia.org/wiki/SaleCycle | SaleCycle is a UK based global Behavioral Marketing firm. It works with online companies to reconnect with customers they've lost online, providing On-Site Remarketing and Email Remarketing solutions or application forms with dynamic and personalized messages in real-time. SaleCycle also offers segmentation and customization of online shopping experiences for consumers. Key features of its services include real-time reporting and IT service management.
The firm's operations have enabled it to manage specific statistics regarding user behavior through the online shopping process and it has released several market research studies, Infographics, eBooks, articles and educational webinars about eCommerce strategies.
The company was the first business-to-business (B2B) company to collect customer reviews through Reevoo SaleCycle received £11.5m in funding] for further expansion from BGF in June 2018.
Overview
The company was founded in 2010 and is headquartered in Houghton le Spring, UK. It has offices in Paris, Singapore, Brighton and New York, and its founder is CEO Dominic Edmunds.
Content strategy is one of their services.
References
External links
The SaleCycle Academy
Market research companies of the United Kingdom
Online advertising services and affiliate networks
British companies established in 2010 |
https://en.wikipedia.org/wiki/MOF-5 | MOF-5 or IRMOF-1 is a cubic metal–organic framework compound with the formula Zn4O(BDC)3, where BDC2−=1,4-benzodicarboxylate (MOF-5). It was discovered by Omar M. Yaghi. MOF-5 is notable for exhibiting one of the highest surface area to volume ratios among metal–organic frameworks, at 2200 m2/cm3. Additionally, it was the first metal–organic framework studied for hydrogen gas storage.
References
Zinc complexes
Metal-organic frameworks |
https://en.wikipedia.org/wiki/Readability%20%28service%29 | Readability was an Internet-based "read it later" service launched in 2009 by Arc90. It ceased its 'bookmarklet' service on September 10, 2016, and discontinued its API service on December 10, 2016. It was similar to competitors Instapaper and Pocket in that it allows a user to save an article from the web and read it later without the clutter of the original website. It started originally as a bookmarklet to remove clutter from webpages and reformat the main article text in a readable font and layout, but following the popularity of the bookmarklet, it evolved to become a service with an app.
One distinguishing aspect of Readability was that it attempted to set up a subscription model where users of the service paid a monthly fee, a large portion of which would go to the publishers of the content they read in the Readability service. This business model faced two major hurdles: criticism by publishers and issues with Apple's iOS App Store pricing model. In 2011, Readability got a large amount of publicity after Apple rejected their app from the iOS App Store as it used a third-party payment system that circumvented Apple's 30% cut for in-app subscription payments. Readability argued that Apple's taking of a 30% share from their subscription revenues would cut into the money they were giving to publishers.
Money that was collected for publishers who did not sign up to Readability's publisher program would be kept by Readability themselves. This led John Gruber, author of the popular Daring Fireball technology blog, to describe Readability in 2012 as "scumbags" as well as extended discussion among bloggers and journalists as to the ethics of Readability's business model. Gruber later clarified that his primary issue was that Readability told its users that it would distribute 70% of its subscription fee to publishers, when in fact it was only distributing a portion of that 70% to the publishers who had registered, which he described as "misleading at best, and argu |
https://en.wikipedia.org/wiki/Zebra%20Media%20Access%20Control | Zebra Media Access Control (Z-MAC) is a network protocol for wireless sensor networks. It controls how a Media Access Control (MAC) accesses a common communication medium of a network.
Network protocols define specific details, such as how computers in a computer network exchange data. Sensor networks consist of tiny, wirelessly communicating sensor nodes which are deployed in large numbers in an area to network independently. While the sensors monitor their surroundings, their energy reserves are depleted. They constitute a special form of mobile ad-hoc network and make entirely different demands on a network protocol than, for example, the Internet.
Z-MAC was first introduced by Injong Rhee, Ajit Warrier, Mahesh Aia and Jeongki Min from North Carolina State University in 2005. The protocol is relevant to the protocols S-MAC, T-MAC, DSMAC, WiseMAC, μ-MAC and M-MAC.
Protocol structure
Z-MAC combines the two approaches Carrier Sense Multiple Access (CSMA) and Time Division Multiple Access (TDMA) so that the network behaves at low data load as in CSMA and high network traffic as in TDMA.
The protocol begins with a set-up phase, including the following four steps: construction of the network topology, distribution of time slots, exchanging of local time frame and network-wide synchronization. This initialization causes a high load on the network, which is made up for from the perspective of the developer with long service life and efficient data transfer.
Construction of the network topology
After activation, each sensor node transmits every second ping for 30 seconds. Pings are in the network technology brief messages that are sent back immediately from sender to receiver, usually to check connection and line quality. With Z-MAC, the ping contains information on the sending node itself and all the information that has been collected through the direct neighbors of the node. By pinging the environment experienced by a sensor node, the nodes it directly contacts |
https://en.wikipedia.org/wiki/Shedun | Shedun is a family of malware software (also known as Kemoge, Shiftybug and Shuanet) targeting the Android operating system first identified in late 2015 by mobile security company Lookout, affecting roughly 20,000 popular Android applications. Lookout claimed the HummingBad malware was also a part of the Shedun family, however, these claims were refuted.
Avira Protection Labs stated that Shedun family malware is detected to cause approximately 1500-2000 infections per day.
All three variants of the virus are known to share roughly ~80% of the same source code.
In mid 2016, arstechnica reported that approximately 10.000.000 devices would be infected by this malware and that new infections would still be surging.
The malware's primary attack vector is repackaging legitimate Android applications (e.g. Facebook, Twitter, WhatsApp, Candy Crush, Google Now, Snapchat) with adware included. The app which remains functional is then released to a third party app store; once downloaded, the application generates revenue by serving ads (estimated to amount to $2 US per installation), most users cannot get rid of the virus without getting a new device, as the only other way to get rid of the malware is to root affected devices and re-flash a custom ROM.
In addition, Shedun-type malware has been detected pre-installed on 26 different types of Chinese Android-based hardware such as Smartphones and Tablet computers.
Shedun-family malware is known for auto-rooting the Android OS using well-known exploits like ExynosAbuse, Memexploit and Framaroot (causing a potential privilege escalation) and for serving trojanized adware and installing themselves within the system partition of the operating system, so that not even a factory reset can remove the malware from infected devices.
Shedun malware is known for targeting the Android Accessibility Service, as well as for downloading and installing arbitrary applications (usually adware) without permission. It is classified as "agg |
https://en.wikipedia.org/wiki/A%C3%A9rocentre%20%28cluster%29 | Aérocentre is a French cluster of aerospace engineering companies and research centres created in 2009. It is in the region of Centre-Val de Loire in the middle of France.
Overview
There are over 321 companies. About 20,000 people work there in the aviation and space flight industries.
The headquarters of Aérocentre is located at the Châteauroux-Centre "Marcel Dassault" Airport. The chairman of the cluster is Jean-Michel SANCHEZ.
Partners
Agence régionale pour l'innovation
Groupe Banque Populaire
Airemploi
Centre d'études supérieures industrielles of Orléans
Électricité de France
Institut Polytechnique des Sciences Avancées
Sources and references
External links
Website of Aérocentre
Aviation in France
Aerospace engineering organizations
Economy of France
High-technology business districts in France
Buildings and structures in Centre-Val de Loire |
https://en.wikipedia.org/wiki/Manually%20Annotated%20Sub-Corpus | Manually Annotated Sub-Corpus (MASC) is a balanced subset of 500K words of written texts and transcribed speech drawn primarily from the Open American National Corpus (OANC). The OANC is a 15 million word (and growing) corpus of American English produced since 1990, all of which is in the public domain or otherwise free of usage and redistribution restrictions.
All of MASC includes manually validated annotations for logical structure (headings, sections, paragraphs, etc.), sentence boundaries, three different tokenizations with associated part of speech tags, shallow parse (noun and verb chunks), named entities (person, location, organization, date and time), and Penn Treebank syntax. Additional manually produced or validated annotations have been produced by the MASC project for portions of the sub-corpus, including full-text annotation for FrameNet frame elements and a 100K+ sentence corpus with WordNet 3.1 sense tags, of which one-tenth are also annotated for FrameNet frame elements. Annotations of all or portions of the sub-corpus for a wide variety of other linguistic phenomena have been contributed by other projects, including PropBank, TimeBank, MPQA opinion, and several others. Co-reference annotations and clause boundaries of the entire MASC corpus are scheduled to be released by the end of 2016.
WordNet sense annotations for all occurrences of 114 words are also included in the MASC distribution, as well as FrameNet annotations for 50-100 occurrences of each of the 114 words. The sentences with WordNet and FrameNet annotations are also distributed as a part of the MASC Sentence Corpus.
Genres
Unlike most freely available corpora including a wide variety of linguistic annotations, MASC contains a balanced selection of texts from a broad range of genres:
Annotations
At present, MASC includes seventeen different types of linguistic annotation (* = in production; ** currently available in original format only):
All MASC annotations, whether contribute |
https://en.wikipedia.org/wiki/Bluetooth%20Low%20Energy%20beacon | Bluetooth beacons are hardware transmitters — a class of Bluetooth Low Energy (LE) devices that broadcast their identifier to nearby portable electronic devices. The technology enables smartphones, tablets and other devices to perform actions when in close proximity to a beacon.
Bluetooth beacons use Bluetooth Low Energy proximity sensing to transmit a universally unique identifier picked up by a compatible app or operating system. The identifier and several bytes sent with it can be used to determine the device's physical location, track customers, or trigger a location-based action on the device such as a check-in on social media or a push notification.
One application is distributing messages at a specific point of interest, for example a store, a bus stop, a room or a more specific location like a piece of furniture or a vending machine. This is similar to previously used geopush technology based on GPS, but with a much reduced impact on battery life and much extended precision.
Another application is an indoor positioning system, which helps smartphones determine their approximate location or context. With the help of a Bluetooth beacon, a smartphone's software can approximately find its relative location to a Bluetooth beacon in a store. Brick and mortar retail stores use the beacons for mobile commerce, offering customers special deals through mobile marketing, and can enable mobile payments through point of sale systems.
Bluetooth beacons differ from some other location-based technologies as the broadcasting device (beacon) is only a 1-way transmitter to the receiving smartphone or receiving device, and necessitates a specific app installed on the device to interact with the beacons. Thus only the installed app, and not the Bluetooth beacon transmitter, can track users.
Bluetooth beacon transmitters come in a variety of form factors, including small coin cell devices, USB sticks, and generic Bluetooth 4.0 capable USB dongles.
History and development
|
https://en.wikipedia.org/wiki/Patricia%20Mawuli%20Nyekodzi | Patricia Mawuli Nyekodzi (born in 1988) is the first female Ghanaian certified pilot, aircraft engineer, teacher and trainer and the only female qualified to build Rotax Aircraft Engines.
Early life
Mawuli grew up in a mud shack in Mepe, a small rural village in the Volta Region of Ghana. She developed the love for flying after spending years watching planes passing overhead.
At the age of 19, Mawuli went to look for employment at Kpong Airfield but was turned down by the airfield's technical director, Jonathan Porter. He employed her to weed around the school and pull stumps from the runway, when she offered her services for free. Mawuli skilfully cut the trees, showing analytical ability to determine the most efficient means of extraction. Porter recognized the same skill when he asked her to help him with an airplane he was assembling. Mawuli's ability to quickly learn, master the skills and tools used to build an airplane, prompted Porter to give her a paid job as his apprentice and teach her to fly.
Career
Mawuli became Ghana's first female civilian pilot in 2009. She is also the first black African to be certified to build Rotax Aircraft Engines, as well as the first woman in West Africa to be certified to build and maintain Rotax engines.
Porter and Mawuli set up an aviation school, Aviation and Technology Academy Ghana, known as AvTech, in early 2010 where she trained four girls per year. The girls are trained to build and maintain ultralight aircraft, flight instructions, airfield operations, robotics engineering and computers. Putting her own salary into the school, she focuses on educating girls from rural backgrounds who might otherwise not have educational opportunities.
Mawuli became an instructor at the Kpong Airfield where she taught at AvTech. In 2013 she was appointed as the managing director of Operations for Kpong Airfield. Mawuli pilots as a volunteer with Medicine on the Move, an organization that works together with the Aviation Academy t |
https://en.wikipedia.org/wiki/Homologous%20somatic%20pairing | Somatic pairing of homologous chromosomes is similar to pre- and early meiotic pairing (see article: Homologous chromosome#In meiosis), and has been observed in Diptera (Drosophila), and budding yeast, for example (whether it evolved multiple times in metazoans is unclear). Mammals show little pairing apart from in germline cells, taking place at specific loci, and under the control of developmental signalling (understood as a subset of other long-range interchromosomal interactions such as looping, and organisation into chromosomal territories).
While meiotic pairing has been extensively studied, the role of somatic pairing has remained less well understood, and even whether it is mechanistically related to meiotic pairing is unknown.
Early work
The first review of somatic pairing was made by Metz in 1916, citing the first descriptions of pairing made in 1907 and 1908 by N. M. Stevens in germline cells, who noted:
“it may therefore be true that pairing of homologous chromosomes occurs in connection with each mitosis throughout the life history of these insects” (p.215)
Stevens noted the potential for communication and a role in heredity.
While meiotic homologous pairing subsequently became well studied, somatic pairing remained neglected due to what has been described as "limitations in cytological tools for measuring pairing and genetic tools for perturbing pairing dynamics".
Recent findings from high-throughput screening
In 1998 it was determined that homologous pairing in Drosophila occurs through independent initiations (as opposed to a directed, 'processive zippering' motion).
The first RNAi screen (based on DNA FISH) was carried out to identify genes regulating D. melanogaster somatic pairing in 2012, described at the time as providing "an extensive “parts list” of mostly novel factors". These comprised 40 pairing promoting genes and 65 'anti-pairing' genes (of which 2 and 1 were already known, respectively), many of which have human orthologs.
An e |
https://en.wikipedia.org/wiki/Monzo | Monzo Bank Limited () is a British online bank based in London, England. Monzo was one of the earliest of a number of new app-based challenger banks in the UK.
Originally operating through a mobile app and a prepaid debit card, in April 2017 its UK banking licence restrictions were lifted, enabling it to offer a full current account. As of June 2023, Monzo had over 7.4 million customers. Their most recent financial results issued in June 2023, showed an annual net loss of £116.3 million (a decrease from the £119 million lost in the previous year) on revenue of £355.6 million.
History
2015–2017: Early growth
Monzo Bank was founded as Mondo in 2015 by Tom Blomfield, Jonas Huckestein, Jason Bates, Paul Rippon and Gary Dolman. The team originally met whilst working at Starling Bank. In February 2016, Monzo set the record for "quickest crowd-funding campaign in history" when it raised £1 million in 96 seconds via the Crowdcube investment platform.
On 13 June 2016, a company blog post announced that the "Mondo" trademark had been legally challenged by an undisclosed company with a similar name. As a result, a naming suggestion contest was organised and the new name, "Monzo", was registered at Companies House under the legal name "Monzo Bank Ltd" in August 2016.
On 16 May 2017, Monzo announced that over £250 million had been spent through its prepaid card, between 200,000 customers.
2017–present: Scaling up
In April 2017, Monzo was granted its full banking licence by the Prudential Regulation Authority and the Financial Conduct Authority, having previously operated under a restricted banking licence. The full licence allowed Monzo to provide its customers with current accounts, who up until that point were only able to be offered pre-paid debit cards.
Monzo's full current account was launched in October 2017, with its pre-paid card users being asked to move to its new current account. By April 2018, it was reported to have 500,000 current account customers.
In Oc |
https://en.wikipedia.org/wiki/Stefan%20tube | In chemical engineering, a Stefan tube is a device that was devised by Josef Stefan in 1874. It is often used for measuring diffusion coefficients. It comprises a vertical tube, over the top of which a gas flows and at the bottom of which is a pool of volatile liquid that is maintained in a constant-temperature bath. The liquid in the pool evaporates, diffuses through the gas above it in the tube, and is carried away by the gas flow over the tube mouth at the top. One then measures the fall in the level of the liquid in the tube.
The tube conventionally has a narrow diameter, in order to suppress convection.
The way that a Stefan tube is modelled, mathematically, is very similar to how one can model the diffusion of perfume fragrance molecules from (say) a drop of perfume on skin or clothes, evaporating up through the air to a person's nose. There are some differences between the models. However, they turn out to have little effect on results at highly dilute vapour concentrations.
Analysis
In the analysis of the system, various assumptions are made. The liquid, conventionally denoted A, is neither soluble in the gas in the tube, conventionally denoted B, nor reacts with it. The decrease in volume of the liquid A and increase in volume of the gas B over time can be ignored for the purposes of solving the equations that describe the behaviour, and an assumption can be made that the instantaneous flux at any time is the steady state value. There are no radial or circumferential components to the concentration gradients, resulting from convection or turbulence caused by excessively vigorous flow at the upper mouth of the tube, and the diffusion can thus be treated as a simple one-dimensional flow in the vertical direction. The mole fraction of A at the upper mouth of the tube is zero, as a consequence of the gas flow. At the interface between A and B the flux of B is zero (because it is insoluble in A) and the mole fraction is the equilibrium value.
Th |
https://en.wikipedia.org/wiki/DiVincenzo%27s%20criteria | The DiVincenzo criteria are conditions necessary for constructing a quantum computer, conditions proposed in 2000 by the theoretical physicist David P. DiVincenzo, as being those necessary to construct such a computer—a computer first proposed by mathematician Yuri Manin, in 1980, and physicist Richard Feynman, in 1982—as a means to efficiently simulate quantum systems, such as in solving the quantum many-body problem.
There have been many proposals for how to construct a quantum computer, all of which meet with varying degrees of success against the different challenges of constructing quantum devices. Some of these proposals involve using superconducting qubits, trapped ions, liquid and solid state nuclear magnetic resonance, or optical cluster states, all of which show good prospects but also have issues that prevent their practical implementation.
The DiVincenzo criteria consist of seven conditions an experimental setup must satisfy to successfully implement quantum algorithms such as Grover's search algorithm or Shor factorization. The first five conditions regard quantum computation itself. Two additional conditions regard implementing quantum communication, such as that used in quantum key distribution. One can demonstrate that DiVincenzo's criteria are satisfied by a classical computer. Comparing the ability of classical and quantum regimes to satisfy the criteria highlights both the complications that arise in dealing with quantum systems and the source of the quantum speed up.
Statement of the criteria
According to DiVincenzo's criteria, constructing a quantum computer requires that the experimental setup meet seven conditions. The first five are necessary for quantum computation:
A scalable physical system with well-characterized qubit
The ability to initialize the state of the qubits to a simple fiducial state
Long relevant decoherence times
A "universal" set of quantum gates
A qubit-specific measurement capability
The remaining two are necessa |
https://en.wikipedia.org/wiki/International%20Journal%20of%20Food%20and%20Allied%20Sciences | The International Journal of Food and Allied Sciences is a peer-reviewed Food Science and Nutrition journal covering the fields of Food Science and Technology, Food Safety and Microbiology, Pharma Nutrition, Biochemistry and Agricultural Sciences with a focus on food crops. It is the official journal of the Institute of Food Science and Nutrition, Bahauddin Zakariya University Multan Pakistan.
About
The journal only publishes novel, high quality and high impact review papers, original research papers and short communications, in the various disciplines encompassing the science, technology of food and its allied sciences. It has been developed to create a truly international forum for the communication of research in food and allied sciences.
Aim and Scope
The journal solicits papers on topics including functional foods, food allergies and intolerances, diet and disease, malnutrition, public Health and dietary patterns.
References
External links
Institute of Food Science and Nutrition
Academic journals established in 2015
Food science journals
English-language journals
Biannual journals |
https://en.wikipedia.org/wiki/Igor%20Jurisica | Igor Jurisica is a Professor in the departments of Computer Science and Medical Biophysics at the University of Toronto. He is a Tier I Canada Research Chair in Integrative Cancer Informatics, and an associate editor for BMC Bioinformatics, Proteomes, Cancer Informatics, International Journal of Knowledge Discovery in Bioinformatics, and Interdisciplinary Sciences: Computational Life Sciences. In 2014, 2015 and 2016, he is an ISI Highly Cited Researcher.
See also
Computational biology
External links
About Jurisica's publications
References
Living people
Canadian computer scientists
Computational biology
Canadian biologists
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/International%20Society%20for%20Biocuration | The International Society for Biocuration (ISB) is a non-profit organisation that promotes the field of biocuration and was founded in early 2009. It provides a forum for information exchange through meetings and workshops. The society's conference, the International Biocuration Conference, has been held in Pacific Grove, California (2005), San José, CA (2007), Berlin (2009), Tokyo, Japan (2010), Washington, DC (2012), Cambridge, UK (2013), Toronto, Canada (2014), Beijing, China (2015) and Geneva, Switzerland (2016). The meeting in 2017 will be held in Stanford, California.
Database is the official journal of the society and it has published the proceedings of the societies conferences since 2009.
Aims of the society
The aims of the society include:
promoting interactions among biocurators
fostering the professional development of biocurators
promoting best practices
ensuring interoperability
creating and maintaining standards
promoting relationships with journal publishers.
Executive Committee (EC)
The Executive Committee (EC) is composed of nine (9) elected members, each with a 3 year term. EC members can serve a maximum of two terms. Within the EC, there are positions for Chair, Secretary and Treasurer that are in charge of leading the EC and by extension the membership. Elections for the EC are held on an annual basis. The EC promotes the ISB’s activity to members and non-members, and contributes to the decisions that are taken on behalf of the biocuration community. Additional activities include reviewing microgrant submissions, assisting with organization of the annual Biocuration conference, preparing materials for the ISB election, and maintaining the website.
Biocuration Career Awards
The Biocuration Career Award is an award given by the International Society for Biocuration for outstanding contributions for the field of biocuration.
Annual Career Award winners
Biannual ISB Exceptional Contribution to Biocuration Award
See also
Biocurati |
https://en.wikipedia.org/wiki/International%20Molecular%20Exchange%20Consortium | The International Molecular Exchange Consortium (IMEx) is a group of the major public providers of molecular interaction data to provide a single, non-redundant set of molecular interactions. Data is captured using a detailed curation model and made available in the PSI-MI standard formats. Participating databases include DIP, IntAct, the Molecular Interaction Database (MINT), MatrixDB, InnateDB, IID, HPIDB, UCL Cardiovascular Gene Annotation, MBInfo, Molecular Connections and UniProt. The group collates the interaction data and prevents duplicate entries in the various databases. The IMEx consortium also supports and contributes to the development of the HUPO-PSI-MI XML format, which is now widely implemented.
External references
IMEx website
References
Molecular biology |
https://en.wikipedia.org/wiki/The%20Winnower | The Winnower was a publishing platform and journal that offered traditional scholarly publishing tools (Digital Object Identifiers (DOIs), permanent archival, Altmetrics, PDF creation, etc.) to enable rigorous scholastic discussion of topics across all areas of intellectual inquiry, whether in the sciences, humanities, public policy, or otherwise. Between 2014 and 2016, The Winnower published and archived the following:
Student Essays
Conference Proceedings
Peer Reviews
Theses
Grants
Book Reviews
Journal Clubs
How-to's
Lab notes
Scholarly reddit AMAs
Foldscope Images
Blog posts
Original research
Open Letters.
History
The Winnower was founded by Dr. Joshua Nicholson. It went live on May 27, 2014, with a primary focus of publishing scientific research, but expanded its scope to include a diverse set of topics spanning the humanities, social sciences, science policy, and professional commentaries, to name just a few. As of April 2016 it had over 1,000 publications from 4,500+ authors around the world.
In November 2016, it was announced that the publishing platform Authorea had bought The Winnower. New submissions were then stopped, with the site directing authors to Authorea. The site has been largely inactive but archived since 2016. Authorea was in turn purchased by one of the 'big 5' academic publishers, Wiley, in 2018.
Post-publication Peer Review
The Winnower offered post-publication peer review. After submission, the paper was immediately made visible online, and was open for public, non-anonymous reviews by registered members of The Winnower community. Articles could be revised indefinitely until the author chose to "freeze" a final version and purchase a digital object identifier.
See also
Authorea
Scholarly peer review
F1000Research
Journal club
Conference Proceedings
References
Publications established in 2014
Academic journal online publishing platforms |
https://en.wikipedia.org/wiki/Badlock | Badlock () is a security bug disclosed on April 12, 2016 affecting the Security Account Manager (SAM) and Local Security Authority (Domain Policy) (LSAD) remote protocols supported by Windows and Samba servers.
Both SAM and LSAD are layered onto the DCE 1.1 Remote Procedure Call (DCE/RPC) protocol. As implemented in Samba and Windows, the RPC services allowed an attacker to become man in the middle. Although the vulnerability was discovered during the development of Samba, the namegiving SMB protocol itself is not affected.
References
External links
2016 in computing
Internet security
Software bugs |
https://en.wikipedia.org/wiki/NeuroMat | The Research, Innovation, and Dissemination Center for Neuromathematics (RIDC NeuroMat, or simply NeuroMat) is a Brazilian research center established in 2013 at the University of São Paulo that is dedicated to integrating mathematical modeling and theoretical neuroscience. Among the core missions of NeuroMat are the creation of a new mathematical system to understanding neural data and the development of neuroscientific open-source computational tools, keeping an active role under the context of open knowledge, open science and scientific dissemination. The research center is headed by Antonio Galves, from USP's Institute of Mathematics and Statistics, and is funded by the São Paulo Research Foundation (FAPESP). As of 2019, the co-principal investigators are Oswaldo Baffa Filho (USP), Pablo A. Ferrari (USP/UBA), Fernando da Paixão (UNICAMP), Antonio Carlos Roque (USP), Jorge Stolfi (UNICAMP), and Cláudia D. Vargas (UFRJ). Ernst W. Hamburger (USP) was the former director of scientific dissemination. NeuroMat's International Advisory Board consists of David R. Brillinger (UC Berkeley), Leonardo G. Cohen (NIH), Markus Diesmann (Jülich), Francesco Guerra (La Sapienza), Wojciech Szpankowski (Purdue).
Research
NeuroMat has been involved in the development of what has been called the Galves-Löcherbach model, a model with intrinsic stochasticity for biological neural nets, in which the probability of a future spike depends on the evolution of the complete system since the last spike.[1] This model of spiking neurons was developed by mathematicians Antonio Galves and Eva Löcherbach. In the first article on the model, in 2013, they called it a model of a "system with interacting stochastic chains with memory of variable length.
See also
Among the current large-scale international brain initiatives:
Allen Institute – from the USA
AusBrain – from Australia
BRAIN Initiative – from the USA
BRAINN - Brazilian Institute of Neuroscience and Neurotechnology – from Brazil
Brain |
https://en.wikipedia.org/wiki/Dadchelor%20party | A dadchelor party, man shower or baby stag is a baby shower for men. It is a celebration of the birth or expected birth of a child, and the transformation of a man into a father. However, the focus tends to be more on allowing the expectant father to have fun before the arrival of the baby. The party usually consists of gift-giving and drinking as well as other hobbies that the future father enjoys, and may be organised by the father himself or his friends.
History
Earliest mentions of this 21st century concept start in the late 2000s, but the trend emerged more prominently in 2011. In the years before this, baby showers often revolved around mothers-to-be, as they are physically affected by the pregnancy and childbirth.
In recent years, with improving gender equality, men have started to hold baby showers or "dadchelor parties" as their own form of enjoyment and celebration.
Description
The Dadchelor party is a way to celebrate first-time fathers and to provide recognition as they enter parenthood. These parties allow the father-to-be to 'let loose" before the baby is born. They consist of stereotypically masculine activities to celebrate the father-to-be's promotion to fatherhood. These parties can also be viewed as the "one last pre-fatherhood bash." Dadchelor parties can be an extensive celebration, or a simple party.
Gifts
The exchange of gifts at a Dadchelor party is optional but often encouraged. Guests will bring gifts that contribute to their night of bonding, or may even pay for the dad-to-be and his travel expenses. Gifts also are exchanged for alcoholic beverages, for example, "Chuggies for Huggies," where the guests bring diapers in exchange for alcohol.
References
Further reading
Lewis, Michael. Home Game: An Accidental Guide to Fatherhood. Norton 2009.
Mactavish, Scott. The New Dad's Survival Guide: Man-to-Man Advice for First-Time Fathers. Little, Brown And Company 2005.
Ceremonies
Fatherhood
Human pregnancy |
https://en.wikipedia.org/wiki/Snub%20triapeirotrigonal%20tiling | In geometry, the snub triapeirotrigonal tiling is a uniform tiling of the hyperbolic plane with a Schläfli symbol of s{3,∞}.
Related polyhedra and tiling
References
John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008, (Chapter 19, The Hyperbolic Archimedean Tessellations)
See also
Square tiling
Uniform tilings in hyperbolic plane
List of regular polytopes
External links
Hyperbolic and Spherical Tiling Gallery
KaleidoTile 3: Educational software to create spherical, planar and hyperbolic tilings
Hyperbolic Planar Tessellations, Don Hatch
Hyperbolic tilings
Isogonal tilings
Snub tilings
Uniform tilings |
https://en.wikipedia.org/wiki/Indus%20OS | Indus OS is an Indian smartphone application and content discovery platform based on Android, with the aim to brings the users, developers and smartphone brands on a single platform and to create an Indian smartphone ecosystem.
The platform is addressing the low smartphone adoption, content consumption and linguistic challenges of Indian markets. The contextual integration provides India's service & content providers a platform to seamlessly distribute their content & services and engage with India's ever-growing smartphone users.
The company is catering to 10 crore+ users and has partnered with top OEMs like Samsung, Karbonn, Micromax and 9 other Indian OEMS.
The company's app marketplace, Indus App Bazaar is the largest Indian app store. It is powering Samsung's default app store, Galaxy Store since 2019.
About
Indus OS was founded in 2013 by Rakesh Deshmukh, Akash Dongre and Sudhir B; all three are alumni of the Indian Institute of Technology, Bombay.
Hari Padmanabhan, an IIT Kanpur alumni, industry veteran and serial entrepreneur, is a seed investor in the company. The company is funded by various investors such as "Omidyar Network, JSW Ventures, VenturEast, Samsung Ventures & Affle".
Indus OS has offices in Mumbai, Delhi and Singapore and currently has an 84-member team.
First touch OS
Indus OS was initially known as "First Touch OS". In May 2015, Micromax Informatics started shipping the latest version (Unite 3) of its Unite series smartphones with Firstouch OS. The operating system was available in English and 10 Indian languages. A key feature of the operating system was the Swipe-to-translate or Indus Swipe which helped users to translate or transliterate English text in regional languages. The operating system also had its own app marketplace' App Bazaar with over 5,000 applications in regional languages.
In December 2015, Firstouch announced a collaboration with the Government of India's Ministry of Electronics and Information Technology previou |
https://en.wikipedia.org/wiki/Condyle%20of%20humerus | The Condyle of humerus is the distal end of the humerus. It is made up of the capitulum and the trochlea.
References
Anatomy |
https://en.wikipedia.org/wiki/Compute%20kernel | In computing, a compute kernel is a routine compiled for high throughput accelerators (such as graphics processing units (GPUs), digital signal processors (DSPs) or field-programmable gate arrays (FPGAs)), separate from but used by a main program (typically running on a central processing unit). They are sometimes called compute shaders, sharing execution units with vertex shaders and pixel shaders on GPUs, but are not limited to execution on one class of device, or graphics APIs.
Description
Compute kernels roughly correspond to inner loops when implementing algorithms in traditional languages (except there is no implied sequential operation), or to code passed to internal iterators.
They may be specified by a separate programming language such as "OpenCL C" (managed by the OpenCL API), as "compute shaders" written in a shading language (managed by a graphics API such as OpenGL), or embedded directly in application code written in a high level language, as in the case of C++AMP.
Vector processing
This programming paradigm maps well to vector processors: there is an assumption that each invocation of a kernel within a batch is independent, allowing for data parallel execution. However, atomic operations may sometimes be used for synchronization between elements (for interdependent work), in some scenarios. Individual invocations are given indices (in 1 or more dimensions) from which arbitrary addressing of buffer data may be performed (including scatter gather operations), so long as the non-overlapping assumption is respected.
Vulkan API
The Vulkan API provides the intermediate SPIR-V representation to describe both Graphical Shaders, and Compute Kernels, in a language independent and machine independent manner. The intention is to facilitate language evolution and provide a more natural ability to leverage GPU compute capabilities, in line with hardware developments such as Unified Memory Architecture and Heterogeneous System Architecture. This allows c |
https://en.wikipedia.org/wiki/Equation%20xy%20%3D%20yx | In general, exponentiation fails to be commutative. However, the equation has solutions, such as
History
The equation is mentioned in a letter of Bernoulli to Goldbach (29 June 1728). The letter contains a statement that when the only solutions in natural numbers are and although there are infinitely many solutions in rational numbers, such as and .
The reply by Goldbach (31 January 1729) contains a general solution of the equation, obtained by substituting A similar solution was found by Euler.
J. van Hengel pointed out that if are positive integers with , then therefore it is enough to consider possibilities and in order to find solutions in natural numbers.
The problem was discussed in a number of publications. In 1960, the equation was among the questions on the William Lowell Putnam Competition, which prompted Alvin Hausner to extend results to algebraic number fields.
Positive real solutions
Main source:
Explicit form
An infinite set of trivial solutions in positive real numbers is given by Nontrivial solutions can be written explicitly using the Lambert W function. The idea is to write the equation as and try to match and by multiplying and raising both sides by the same value. Then apply the definition of the Lambert W function to isolate the desired variable.
Where in the last step we used the identity .
Here we split the solution into the two branches of the Lambert W function and focus on each interval of interest, applying the identities:
:
:
:
:
Hence the non-trivial solutions are:
Parametric form
Nontrivial solutions can be more easily found by assuming and letting
Then
Raising both sides to the power and dividing by , we get
Then nontrivial solutions in positive real numbers are expressed as the parametric equation
The full solution thus is
Based on the above solution, the derivative is for the pairs on the line and for the other pairs can be found by which straightforward calculus gives as:
for an |
https://en.wikipedia.org/wiki/Tiger%20Lake | Tiger Lake is Intel's codename for the 11th generation Intel Core mobile processors based on the Willow Cove Core microarchitecture, manufactured using Intel's third-generation 10 nm process node known as 10SF ("10 nm SuperFin"). Tiger Lake replaces the Ice Lake family of mobile processors, representing an optimization step in Intel's process–architecture–optimization model.
Tiger Lake processors launched on September 2, 2020, are part of the Tiger Lake-U family and include dual-core and quad-core 9 W (7–15 W) TDP and 15 W (12–28 W) TDP models. They power 2020 "Project Athena" laptops. The quad-core 96 EU die measures 13.6 × 10.7 mm (146.1 mm2), which is 19.2% wider than the 11.4 × 10.7 mm (122.5 mm2) quad-core 64 EU Ice Lake die. The 8-core 32 EU die used in Tiger Lake-H is around 190 mm2. According to Yehuda Nissan and his team, the architecture is named after a lake across Puget Sound, Washington from Seattle. Laptops based on Tiger Lake started to sell in October 2020.
The Tiger Lake-H35 processors were launched on January 11, 2021. These quad-core processors are designed for "ultraportable gaming" laptops with 28-35 W TDP. Intel also announced that the Tiger Lake-H processors with 45 W TDP and up to eight cores will become available in Q1 2021. Intel officially launched the 11th generation Intel Core-H series on May 11, 2021 and announced the 11th generation Intel Core Tiger Lake Refresh series on May 30, 2021.
Features
CPU
Intel Willow Cove CPU cores
Full memory (RAM) encryption
TAGE-like directional branch predictor (with a global history size of 194 taken branches)
Indirect branch tracking and CET shadow stack
Intel Key Locker
GPU
Intel Xe-LP ("Gen12") GPU with up to 96 execution units (50% uplift compared to Ice Lake, up from 64) with some yet to be announced processors using Intel's discrete GPU, DG1
Fixed-function hardware decoding for HEVC 12-bit, 4:2:2/4:4:4; VP9 12-bit 4:4:4 and AV1 8K 10-bit 4:2:0
Support for a single 8K 12-bit HDR displ |
https://en.wikipedia.org/wiki/Victor%20%28symbol%29 | The victor symbol (Spanish: or ) is an emblem that is painted on the walls of some Spanish and Latin American universities to commemorate students who have received the degree of doctorate. The custom dates back to the 14th century, and the symbol has historically been used at older universities in the Spanish-speaking world, such as the University of Salamanca, the University of Alcalá, and the University of Seville in Spain, as well as the National University of San Marcos in Lima, Peru. According to the custom, when a student receives the doctorate, the victor symbol is painted on the walls of the university in red or black paint along with the student's name.
At the end of the Spanish Civil War, the victor sign was appropriated by the nationalists as a symbol of their victory in the war, and it came to be used as a personal emblem for the dictator Francisco Franco. Despite its former use by Franco, it is still used in its original sense at several universities.
The victor symbol takes the shape of the letters V, I, C, T, O, and R arranged in a monogram that varies from symbol to symbol. In some cases, the letter C is omitted. Usually, the name of the student is painted alongside the symbol. The symbol is sometimes used to commemorate a notable person that visited the university or has some special connection with the university.
See also
References
Universities and colleges in Spain
Academia in Spain
University of Salamanca
14th-century introductions
Monograms
Symbols
History of education in Spain
Francisco Franco
Doctoral degrees |
https://en.wikipedia.org/wiki/Fundamental%20theorem%20of%20topos%20theory | In mathematics, The fundamental theorem of topos theory states that the slice of a topos over any one of its objects is itself a topos. Moreover, if there is a morphism in then there is a functor which preserves exponentials and the subobject classifier.
The pullback functor
For any morphism f in there is an associated "pullback functor" which is key in the proof of the theorem. For any other morphism g in which shares the same codomain as f, their product is the diagonal of their pullback square, and the morphism which goes from the domain of to the domain of f is opposite to g in the pullback square, so it is the pullback of g along f, which can be denoted as .
Note that a topos is isomorphic to the slice over its own terminal object, i.e. , so for any object A in there is a morphism and thereby a pullback functor , which is why any slice is also a topos.
For a given slice let denote an object of it, where X is an object of the base category. Then is a functor which maps: . Now apply to . This yields
so this is how the pullback functor maps objects of to . Furthermore, note that any element C of the base topos is isomorphic to , therefore if then and so that is indeed a functor from the base topos to its slice .
Logical interpretation
Consider a pair of ground formulas and whose extensions and (where the underscore here denotes the null context) are objects of the base topos. Then implies if and only if there is a monic from to . If these are the case then, by theorem, the formula is true in the slice , because the terminal object of the slice factors through its extension . In logical terms, this could be expressed as
so that slicing by the extension of would correspond to assuming as a hypothesis. Then the theorem would say that making a logical assumption does not change the rules of topos logic.
See also
Timeline of category theory and related mathematics
Deduction Theorem
References
Topos theory |
https://en.wikipedia.org/wiki/Two-cube%20calendar | A two-cube calendar is a desk calendar consisting of two cubes with faces marked by digits 0 through 9. Each face of each cube is marked with a single digit, and it is possible to arrange the cubes so that any chosen day of the month (from 01, 02, ... through 31) is visible on the two front faces.
A puzzle about the two-cube calendar was described in Gardner's column in Scientific American. In the puzzle discussed in Mathematical Circus (1992), two visible faces of one cube have digits 1 and 2 on them, and three visible faces of another cube have digits 3, 4, 5 on them. The cubes are arranged so that their front faces indicate the 25th day of the current month. The problem is to determine digits hidden on the seven invisible faces.
Gardner wrote he saw a two-cube desk calendar in a store window in New York. According to a letter received by Gardner from John S. Singleton (England), Singleton patented the calendar in 1957, but the patent lapsed in 1965.
A number of variations are manufactured and sold as souvenirs, differing in the appearance and the existence of additional bars or cubes to set the current month and the day of week.
Solution of the problem
Digits 1 and 2 need to be placed on both cubes to allow numbers 11 and 22. That leaves us with 4 sides of each cube (total of 8) for another 8 digits. However, digit 0 needs to be combined with all other digits, so it also needs to be placed on both cubes. That means we need to place remaining 7 digits (from 3 to 9) on the remaining 6 sides of cubes. The solution is possible because digit 6 looks like inverted 9.
Therefore, the solution of the problem is:
If the problem is based on another given set of visible digits, the last three digits of each cube could be shuffled between the cubes.
Three-cube variation for the month abbreviations
A variation with three cubes providing English abbreviations for the twelve months is discussed in a Scientific American column in December 1977. One solution of this varia |
https://en.wikipedia.org/wiki/Synchronous%20coefficient%20of%20drag%20alteration | Synchronous coefficient of drag alteration (SCODA) is a biotechnology method for purifying, separating and/or concentrating bio-molecules. SCODA has the ability to separate molecules whose mobility (or drag) can be altered in sync with a driving field. This technique has been primarily used for concentrating and purifying DNA, where DNA mobility changes with an applied electrophoretic field. Electrophoretic SCODA has also been demonstrated with RNA and proteins.
Theory
As shown below, the SCODA principle applies to any particle driven by a force field in which the particle's mobility is altered in sync with the driving field.
SCODA principle
For explanatory purposes consider an electrophoretic particle moving (driven) in an electric field. Let:
(1)
and
(2)
denote an electric field and the velocity of the particle in such a field. If is constant the time average of .
If is not constant as a function of time and if has a frequency component proportional to the time average of need not be zero.
Consider the following example:
(3)
Substituting (3) in (2) and computing the time average, , we obtain:
(4)
Thus, it is possible to have the particle experience a non-zero time average velocity, in other words, a net electrophoretic drift, even when the time average of the applied electric field is zero.
Creation of focusing field geometry
Consider a particle under a force field that has a velocity parallel to the field direction and a speed proportional to the square of the magnitude of the electric field (any other non-linearity can be employed):
(5)
The effective mobility of the particle (the relationship between small changes in drift velocity with respect to small changes in electric field ) can be expressed in Cartesian coordinates as:
(6)
(7)
Combining (5), (6) and (7) we get:
(8)
(9)
Further consider the field E is applied in a plane and it rotates counter-clockwise at angular frequency , such that the field components are:
(10) |
https://en.wikipedia.org/wiki/Passavant%27s%20ridge | Passavant's ridge is a mucous elevation situated behind the floor of the naso-pharynx.
Anatomy
It is also known as Passavant's pad or palatopharyngeal ridge. The prominence of mucous tissue is formed by the contraction of superior constrictor during swallowing. Palatopharyngeus muscle originates from the upper surface of the palatal aponeurosis by anterior and posterior fascicle, which are separated by the insertion of levator veli palatini. Both fasciculi join laterally to form a single muscle that passes downward and backward under cover of the palatopharyngeal arch. In the pharynx, it joins with the salpingopharyngeus muscles and is inserted. A few fibers of palatopharyngeus muscle sweep backward under cover of the Passavant's ridge and form a U-shaped sling of palatopharyngeal sphincter. When the soft palate is elevated it comes in contact with ridge, the two together closing pharyngeal isthmus between nasopharynx and oropharynx.
References
Anatomy |
https://en.wikipedia.org/wiki/Backdrop%20CMS | Backdrop CMS is an Open source, community-developed, content management system, written in PHP, and licensed under the GNU General Public License. Backdrop CMS was forked from the Drupal CMS in 2013 by two Drupal developers, Nate Lampton (née Nate Haug) and Jen Lampton. Backdrop is very similar to version 7 of the Drupal CMS, maintaining most of the same functionality and features. The project's mission is to "enable people to build highly customized websites affordably, through collaboration and open source software".
History
The Backdrop CMS project was forked about 2 years into the Drupal 8 development cycle. Backdrop therefore retained some features newly included in Drupal version 8, but excluded Symfony, and most of the many new dependencies that were added to Drupal 8. Backdrop's founders and early contributors had concerns over the significant (and at the time controversial) changes coming to Drupal, and expressed concern that maintainers of existing Drupal websites would be unable (or unwilling) to manage these changes, and the cost that comes with them.
Dependencies
Installation of Backdrop requires a web server running PHP 5.6 or higher and a MySQL 5.0.15 database or higher (or equivalent, like MariaDB). All Backdrop versions are being tested on PHP version 5, PHP version 7, and PHP version 8. Backdrop core, and the majority of contributed modules are developed on the GitHub platform.
Development Support
Docker-based local development environments like DDEV and Lando support Backdrop CMS out of the box by providing Backdrop CMS as an installation option. Backdrop is also available as an installation option on the managed hosting platform, Pantheon.
There are upgrade paths available to developers who wish to upgrade Drupal 6 and Drupal 7 sites to Backdrop. Core modules have upgrade paths as do some of the more popular contributed modules. Some may require extra work to upgrade smoothly.
Organization of the Backdrop project
Backdrop is a community |
https://en.wikipedia.org/wiki/List%20of%20linear%20integrated%20circuits | The following is a list of linear integrated circuits. Many were among the first analog integrated circuits commercially produced; some were groundbreaking innovations, and many are still being used.
See also
List of LM-series integrated circuits
References
Electronic design
Electronics lists |
https://en.wikipedia.org/wiki/Sink%20condition | In pharmaceutics, sink condition is a term mostly related to the dissolution testing procedure.
It means using a sheer volume of solvent, usually about 5 to 10 times greater than the volume present in the saturated solution of the targeted chemical (often the API, and sometimes the excipients) contained in the dosage form being tested.
During the dissolution testing, "sink condition" is a mandatory requirement, otherwise when the concentration begins to get too close to the saturation point, even though the total soluble amount still remains constant, the dissolution rate will gradually begin to reduce in significant amounts, enough to corrupt the test results. .
See also
Absorption (pharmacokinetics)
Dissolution testing
Pharmaceutical formulation
Tablet (pharmacy)
Tablet hardness testing
References
Chemical engineering
Pharmaceutical industry
Drug delivery devices
Dosage forms |
https://en.wikipedia.org/wiki/Bayesian%20structural%20time%20series | Bayesian structural time series (BSTS) model is a statistical technique used for feature selection, time series forecasting, nowcasting, inferring causal impact and other applications. The model is designed to work with time series data.
The model has also promising application in the field of analytical marketing. In particular, it can be used in order to assess how much different marketing campaigns have contributed to the change in web search volumes, product sales, brand popularity and other relevant indicators. Difference-in-differences models and interrupted time series designs are alternatives to this approach. "In contrast to classical difference-in-differences schemes, state-space models make it possible to (i) infer the temporal evolution of attributable impact, (ii) incorporate empirical priors on the parameters in a fully Bayesian treatment, and (iii) flexibly accommodate multiple sources of variation, including the time-varying influence of contemporaneous covariates, i.e., synthetic controls."
General model description
The model consists of three main components:
Kalman filter. The technique for time series decomposition. In this step, a researcher can add different state variables: trend, seasonality, regression, and others.
Spike-and-slab method. In this step, the most important regression predictors are selected.
Bayesian model averaging. Combining the results and prediction calculation.
The model could be used to discover the causations with its counterfactual prediction and the observed data.
A possible drawback of the model can be its relatively complicated mathematical underpinning and difficult implementation as a computer program. However, the programming language R has ready-to-use packages for calculating the BSTS model, which do not require strong mathematical background from a researcher.
See also
Bayesian inference using Gibbs sampling
Correlation does not imply causation
Spike-and-slab regression
References
Further reading |
https://en.wikipedia.org/wiki/Social%20cloud%20computing | Social cloud computing, also peer-to-peer social cloud computing, is an area of computer science that generalizes cloud computing to include the sharing, bartering and renting of computing resources across peers whose owners and operators are verified through a social network or reputation system. It expands cloud computing past the confines of formal commercial data centers operated by cloud providers to include anyone interested in participating within the cloud services sharing economy. This in turn leads to more options, greater economies of scale, while bearing additional advantages for hosting data and computing services closer to the edge where they may be needed most.
Research
Peer-to-peer (P2P) computing and networking to enable decentralized cloud computing has been an area of research for sometime. Social cloud computing intersects peer-to-peer cloud computing with social computing to verify peer and peer owner reputation thus providing security and quality of service assurances to users. On demand computing environments may be constructed and altered statically or dynamically across peers on the Internet based on their available resources and verified reputation to provide such assurances.
Applications
Social cloud computing has been highlighted as a potential benefit to large-scale computing, video gaming, and media streaming. The tenets of social cloud computing has been most famously employed in the Berkeley Open Infrastructure for Network Computing (BOINC), making the service the largest computing grid in the world. Another service that uses social cloud computing is Subutai. Subutai allows peer-to-peer sharing of computing resources globally or within a select permissioned network.
Challenges
Many challenges arise when moving from a traditional cloud infrastructure, to a social cloud environment.
Availability of computational resources
In the case of traditional cloud computing, availability on demand is essential for many cloud customers. Soc |
https://en.wikipedia.org/wiki/CodeCombat | CodeCombat is an educational video game for learning software programming concepts and languages. This game is recommended for students ages 9–16. Students learn to type coding languages like JavaScript, Python, HTML and CoffeeScript, as well as learning the fundamentals of computer science. CodeCombat has 11 units - three game development units, two web development units, and six computer science units. The first unit, Computer Science 1, is free to all students and teachers. In 2019, CodeCombat was recognized by the College Board as an endorsed provider of curriculum and professional development for AP Computer Science Principles (AP CSP).
CodeCombat works directly with schools and districts, as well as offering self-paced learners a monthly paid subscription that gives access to additional game content. In order to advance through the game's levels, players must prove their knowledge by writing code. It includes both single-player and multi-player components, and is ideally suited for 4th-12th graders. The game was positively reviewed by PC Magazine, won the 2017 SIIA CODiE award for Best Creativity Tool for Students, and has been named a top pick for learning by Common Sense Education.
In January 2014, CodeCombat made their software open-source, and released a level editor so that users could create their own game content. In August 2019, CodeCombat released its newest game, Ozaria.
Company
CodeCombat was founded in February 2013 by George Saines, Scott Erickson, Matt Lott, and Nick Winter, who had previously developed the language-learning application Skritter. The company is based in San Francisco, California and makes two programming games, Ozaria and CodeCombat, for schools and learners. In 2014, the company received $2 million in seed stage funding from firms such as Y Combinator, Andreessen Horowitz, and Allen & Company. In 2019, the company received $6M in Series A funding, led by Hone Capital. It announced a partnership with the Chinese internet compa |
https://en.wikipedia.org/wiki/Semantic%20folding | Semantic folding theory describes a procedure for encoding the semantics of natural language text in a semantically grounded binary representation. This approach provides a framework for modelling how language data is processed by the neocortex.
Theory
Semantic folding theory draws inspiration from Douglas R. Hofstadter's Analogy as the Core of Cognition which suggests that the brain makes sense of the world by identifying and applying analogies. The theory hypothesises that semantic data must therefore be introduced to the neocortex in such a form as to allow the application of a similarity measure and offers, as a solution, the sparse binary vector employing a two-dimensional topographic semantic space as a distributional reference frame. The theory builds on the computational theory of the human cortex known as hierarchical temporal memory (HTM), and positions itself as a complementary theory for the representation of language semantics.
A particular strength claimed by this approach is that the resulting binary representation enables complex semantic operations to be performed simply and efficiently at the most basic computational level.
Two-dimensional semantic space
Analogous to the structure of the neocortex, Semantic Folding theory posits the implementation of a semantic space as a two-dimensional grid. This grid is populated by context-vectors in such a way as to place similar context-vectors closer to each other, for instance, by using competitive learning principles. This vector space model is presented in the theory as an equivalence to the well known word space model described in the information retrieval literature.
Given a semantic space (implemented as described above) a word-vector can be obtained for any given word by employing the following algorithm:
For each position X in the semantic map (where X represents cartesian coordinates)
if the word Y is contained in the context-vector at position X
then add 1 to the corresponding |
https://en.wikipedia.org/wiki/Heterotopy | Heterotopy is an evolutionary change in the spatial arrangement of an animal's embryonic development, complementary to heterochrony, a change to the rate or timing of a development process. It was first identified by Ernst Haeckel in 1866 and has remained less well studied than heterochrony.
Concept
The concept of heterotopy, bringing evolution about by a change in the spatial arrangement of some process within the embryo, was introduced by the German zoologist Ernst Haeckel in 1866. He gave as an example a change in the positioning of the germ layer which created the gonads. Since then, heterotopy has been studied less than its companion, heterochrony which results in more readily observable phenomena like neoteny. With the arrival of evolutionary developmental biology in the late 20th century, heterotopy has been identified in changes in growth rate; in the distribution of proteins in the embryo; the creation of the vertebrate jaw; the repositioning of the mouth of nematode worms, and of the anus of irregular sea urchins. Heterotopy can create new morphologies in the embryo and hence in the adult, helping to explain how evolution shapes bodies.
In terms of evolutionary developmental biology, heterotopy means the positioning of a developmental process at any level in an embryo, whether at the level of the gene, a circuit of genes, a body structure, or an organ. It often involves homeosis, the evolutionary change of one organ into another. Heterotopy is achieved by the rewiring of an organism's genome, and can accordingly create rapid evolutionary change.
The evolutionary biologist Brian K. Hall argues that heterochrony offers such a simple and readily understood mechanism for reshaping bodies that heterotopy has likely often been overlooked. Since starting or stopping a process earlier or later, or changing its rate, can clearly cause a wide variety of changes in body shape and size (allometry), biologists have in Hall's view often invoked heterochrony to the e |
https://en.wikipedia.org/wiki/MCDRAM | Multi-Channel DRAM or MCDRAM (pronounced em cee dee ram) is a 3D-stacked DRAM that is used in the Intel Xeon Phi processor codenamed Knights Landing. It is a version of Hybrid Memory Cube developed in partnership with Micron Technology, and a competitor to High Bandwidth Memory.
The many cores in the Xeon Phi processors, along with their associated vector processing units, enable them to consume many more gigabytes per second than traditional DRAM DIMMs can supply. The "Multi-channel" part of the MCDRAM full name reflects the cores having many more channels available to access the MCDRAM than processors have to access their attached DIMMs.
This high channel count leads to MCDRAM's high bandwidth, up to 400+ GB/s, although the latencies are similar to a DIMM access.
Its physical placement on the processor imposes some limits on capacity – up to 16 GB at launch, although speculated to go higher in the future.
Programming
The memory can be partitioned at boot time, with some used as cache for more distant DDR, and the remainder mapped into the physical address space.
The application can request pages of virtual memory to be assigned to either the distant DDR directly, to the portion of DDR that is cached by the MCDRAM, or to the portion of the MCDRAM that is not being used as cache. One way to do this is via thememkind API.
When used as cache, the latency of a miss accessing both the MCDRAM and DDR is slightly higher than going directly to DDR, and so applications may need to be tuned
to avoid excessive cache misses.
References
External links
MCDRAM (High Bandwidth Memory) on Knights Landing – Analysis Methods & Tools
An Intro to MCDRAM (High Bandwidth Memory) on Knights Landing
High Bandwidth Memory (HBM): how will it benefit your application?
Micron HMC Webinar July 2017 slides
Computer architecture
Intel
Intel microprocessors
Parallel computing
X86 microprocessors
Computer memory |
https://en.wikipedia.org/wiki/Breit%20frame | In particle physics, the Breit frame (also known as infinite-momentum frame or IMF) is a frame of reference used to describe scattering experiments of the form , that is experiments in which particle A scatters off particle B, possibly producing particles in the process. The frame is defined so that the particle A has its momentum reversed in the scattering process.
Another way of understanding the Breit frame is to look at the elastic scattering . The Breit frame is defined as the frame in which . There are different occasions when Breit frame can be useful, e.g., in measuring the electromagnetic form factor of a hadron, is the scattered hadron; while for deep inelastic scattering process, the elastically scattered parton should be considered as . It is only in the latter case the Breit frame gets related to infinite-momentum frame.
It is named after the American physicist Gregory Breit.
See also
Center-of-momentum frame
Laboratory frame of reference
References
Frames of reference
Kinematics |
https://en.wikipedia.org/wiki/SciCrunch | SciCrunch is a collaboratively edited knowledge base about scientific resources. It is a community portal for researchers and a content management system for data and databases. It is intended to provide a common source of data to the research community and the data about Research Resource Identifiers (RRIDs), which can be used in scientific publications. After starting as a pilot of two journals in 2014, by 2022 over 1,000 journals have been using them and over half a million RRIDs have been quoted in the scientific literature. In some respect, it is for science and scholarly publishing, similar to what Wikidata is for Wikimedia Foundation projects. Hosted by the University of California, San Diego, SciCrunch was also designed to help communities of researchers create their own portals to provide access to resources, databases and tools of relevance to their research areas
Research Resource Identifiers
Research Resource Identifiers (RRID) are globally unique and persistent.
They were introduced and are promoted by the Resource Identification Initiative.
Resources in this context are research resources like reagents, tools or materials.
An example for such a resource would be a cell line used in an experiment or software tool used in a computational analysis.
The Resource Identification Portal (https://scicrunch.org/resources) was created in support of this initiative and is a central service where these identifiers can be searched and created. These identifiers should be fully searchable by data mining unlike supplementary files, and can be updated to new versions as basic methodology changes over time.
Format for RRID citations
The recommendation for citing research resources is shown below for key biological resources:
Antibody: Millipore Cat# MAB377 (Lot) RRID:AB_2298772
Model organism: NXR Cat# 1049, RRID:NXR_1049
Cell line: Coriell Cat# GM03745, RRID:CVCL_1H60
Plasmids: pMD2.G plasmid, RRID:Addgene_12259
BioSamples: female without diabetes, HPAP, Ca |
https://en.wikipedia.org/wiki/Spike-and-slab%20regression | Spike-and-slab regression is a type of Bayesian linear regression in which a particular hierarchical prior distribution for the regression coefficients is chosen such that only a subset of the possible regressors is retained. The technique is particularly useful when the number of possible predictors is larger than the number of observations. The idea of the spike-and-slab model was originally proposed by Mitchell & Beauchamp (1988). The approach was further significantly developed by Madigan & Raftery (1994) and George & McCulloch (1997). A recent and important contribution to this literature is Ishwaran & Rao (2005).
Model description
Suppose we have P possible predictors in some model. Vector γ has a length equal to P and consists of zeros and ones. This vector indicates whether a particular variable is included in the regression or not. If no specific prior information on initial inclusion probabilities of particular variables is available, a Bernoulli prior distribution is a common default choice. Conditional on a predictor being in the regression, we identify a prior distribution for the model coefficient, which corresponds to that variable (β). A common choice on that step is to use a normal prior with a mean equal to zero and a large variance calculated based on (where is a design matrix of explanatory variables of the model).
A draw of γ from its prior distribution is a list of the variables included in the regression. Conditional on this set of selected variables, we take a draw from the prior distribution of the regression coefficients (if γi = 1 then βi ≠ 0 and if γi = 0 then βi = 0). βγ denotes the subset of β for which γi = 1. In the next step, we calculate a posterior probability for both inclusion and coefficients by applying a standard statistical procedure. All steps of the described algorithm are repeated thousands of times using the Markov chain Monte Carlo (MCMC) technique. As a result, we obtain a posterior distribution of γ (variable incl |
https://en.wikipedia.org/wiki/Vision%20processing%20unit | A vision processing unit (VPU) is (as of 2023) an emerging class of microprocessor; it is a specific type of AI accelerator, designed to accelerate machine vision tasks.
Overview
Vision processing units are distinct from video processing units (which are specialised for video encoding and decoding) in their suitability for running machine vision algorithms such as CNN (convolutional neural networks), SIFT (scale-invariant feature transform) and similar.
They may include direct interfaces to take data from cameras (bypassing any off chip buffers), and have a greater emphasis on on-chip dataflow between many parallel execution units with scratchpad memory, like a manycore DSP. But, like video processing units, they may have a focus on low precision fixed point arithmetic for image processing.
Contrast with GPUs
They are distinct from GPUs, which contain specialised hardware for rasterization and texture mapping (for 3D graphics), and whose memory architecture is optimised for manipulating bitmap images in off-chip memory (reading textures, and modifying frame buffers, with random access patterns). VPUs are optimized for performance per watt, while GPUs mainly focus on absolute performance.
Target markets are robotics, the internet of things (IoT), new classes of digital cameras for virtual reality and augmented reality, smart cameras, and integrating machine vision acceleration into smartphones and other mobile devices.
Examples
Movidius Myriad X, which is the third-generation vision processing unit in the Myriad VPU line from Intel Corporation.
Movidius Myriad 2, which finds use in Google Project Tango, Google Clips and DJI drones
Pixel Visual Core (PVC), which is a fully programmable Image, Vision and AI processor for mobile devices
Microsoft HoloLens, which includes an accelerator referred to as a Holographic Processing Unit (complementary to its CPU and GPU), aimed at interpreting camera inputs, to accelerate environment tracking & vision for augmented |
https://en.wikipedia.org/wiki/Ultra%20HD%20Forum | Ultra HD Forum is an organization whose goal is to help solve the real world hurdles in deploying Ultra HD video and thus to help promote UHD deployment. The Ultra HD Forum will help navigate amongst the standards related to high dynamic range (HDR), high frame rate (HFR), next generation audio (NGA), and wide color gamut (WCG). The Ultra HD Forum is an industry organisation that is complementary to the UHD Alliance (that maintains consumer-facing logos), covering different aspects of the UHD ecosystem.
History
On July 21, 2015, the Ultra HD Forum announced that they had over 20 member companies after incorporating as a US-based non-profit a month earlier.
On April 18, 2016, the Ultra HD Forum announced industry guidelines for UHD Phase A content.
The Ultra HD Forum also announced that it had increased to 46 member companies.
On January 5, 2017, the Ultra HD Forum announced that their guidelines had been updated to version 1.2 (including things like immersive audio, BT.2100, etc.) and that additional companies have joined which includes Google.
On September 14, 2017 the guidelines were updated to version 1.4 (including
new definitions of PQ10 and HDR10, a matrix receiver/decoder capability combinations, the receiver/decoders combinations to render different formats, statistical methods of deriving CLL values, "graphics white" level for HLG as recommended by BBC and NHK, etc.)
UHD Phase A
UHD Phase A covers broadcasting services to be launched by end of 2016 or early 2017. The guidelines for UHD Phase A are:
Display resolution of 1080p or 2160p (progressive video only);
Wide color gamut (WCG) – wider than Rec. 709) (Rec. 2020 must be supported);
High dynamic range (HDR) – at least 13 stops (213=8192:1);
Bit depth of 10-bits per sample;
Frame rate of up to 60 fps (integer frame rates preferred);
5.1-channel audio or immersive audio;
Closed captions/subtitles.
UHD Phase A consumer devices should be able to decode the High Efficiency Video Coding (HEVC) |
https://en.wikipedia.org/wiki/Line%20of%20thrust | The line of thrust is the locus of the points, through which forces pass in a retaining wall or an arch. It is the line, along which internal forces flow, , .
In a stone structure, the line of thrust is a theoretical line that through the structure represents the path of the resultants of the compressive forces, . For a structure to be stable, the line of thrust must lie entirely inside the structure, , .
Where important
The line of thrust is important in almost any architecture bearing weight. This includes aircraft, bridges, plus arches; see catenary arch.
An arch won't collapse, when the line of thrust is entirely internal to the arch, .
See also
Damage tolerance
Force lines
Strength of materials
Stress concentration
Structural fracture mechanics
Stress intensity factor
Stress–strain analysis
External links
One largish article, talks about line of thrust
A definition
Another definition
A second reference
A third reference
Mechanics
Construction |
https://en.wikipedia.org/wiki/Mycroft%20%28software%29 | Mycroft is a free and open-source software virtual assistant that uses a natural language user interface. Its code was formerly copyleft, but is now under a permissive license. It is named after a fictional computer from the 1966 science fiction novel The Moon Is a Harsh Mistress.
History
Inspiration for Mycroft came when Ryan Sipes and Joshua Montgomery were visiting a makerspace in Kansas City, MO, where they came across a simple and basic intelligent virtual assistant project. They were interested in the technology, but did not like its inflexibility. Montgomery believes that the burgeoning industry of intelligent personal assistance poses privacy concerns for users, and has promised that Mycroft will protect privacy through its open source machine learning platform.
Mycroft AI, Inc., has won several awards, including the prestigious Techweek's KC Launch competition in 2016. They were part of the Sprint Accelerator 2016 class in Kansas City and joined 500 Startups Batch 20 in February 2017. The company accepted a strategic investment from Jaguar Land Rover during this same time period. The company had raised more than $2.5 million from institutional investors before they opted to offer shares of the company to the public through StartEngine, an equity crowdfunding platform.
In early 2023, Mycroft AI ceased development.
Software
Mycroft voice stack
Mycroft provides free software for most parts of the voice stack.
Wake Word
Mycroft does Wake Word spotting, also called keyword spotting, through its Precise Wake Word engine. Prior to Precise becoming the default Wake Word engine, Mycroft employed PocketSphinx. Instead of being based on phoneme recognition, Precise uses a trained recurrent neural network to distinguish between sounds which are, and which aren't Wake Words.
Speech to text
Mycroft is partnering with Mozilla's Common Voice Project to leverage their DeepSpeech speech to text software.
Intent parsing
Mycroft uses an intent parser called Ad |
https://en.wikipedia.org/wiki/Fair%20division%20of%20a%20single%20homogeneous%20resource | Fair division of a single homogeneous resource is one of the simplest settings in fair division problems. There is a single resource that should be divided between several people. The challenge is that each person derives a different utility from each amount of the resource. Hence, there are several conflicting principles for deciding how the resource should be divided. A primary conflict is between efficiency and equality. Efficiency is represented by the utilitarian rule, which maximizes the sum of utilities; equality is represented by the egalitarian rule, which maximizes the minimum utility.
Setting
In a certain society, there are:
units of some divisible resource.
agents with different "utilities".
The utility of agent is represented by a function ; when agent receives units of resource, he derives from it a utility of .
This setting can have various interpretations. For example:
The resource is wood, the agents are builders, and the utility functions represent their productive power - is the number of buildings that agent can build using units of wood.
The resource is a medication, the agents are patients, and the utility functions represent their chance of recovery - is the probability of agent to recover by getting doses of the medication.
In any case, the society has to decide how to divide the resource among the agents: it has to find a vector such that:
Allocation rules
Envy-free
The Envy-freeness rule says that the resource should be allocated such that no agent envies another agent. In the case of a single homogeneous resource, it always selects the allocation that gives each agent the same amount of the resource, regardless of their utility function:
Utilitarian
The utilitarian rule says that the sum of utilities should be maximized. Therefore, the utilitarian allocation is:
Egalitarian
The egalitarian rule says that the utilities of all agents should be equal. Therefore, we would like to select an allocation that satisfies |
https://en.wikipedia.org/wiki/BacDive | BacDive (the Bacterial Diversity Metadatabase) is a bacterial metadatabase that provides strain-linked information about bacterial and archaeal biodiversity.
Introduction
BacDive is a resource for different kind of metadata like taxonomy, morphology, physiology, environment and molecular-biology.
The majority of data is manually annotated and curated. With the release in December 2022 BacDive offers information for 93,254 strains, including 19,313 type strains.
The database is hosted by the Leibniz Institute DSMZ - German Collection of Microorganisms and Cell Cultures GmbH and is part of de.NBI the German Network for Bioinformatics Infrastructure, as well as Elixir the European Network for Bioinformatics. In December 2022 BacDive was selected by the Global Biodata Coalition as a Global Core Biodata Resource (GCBR). GCBRs are considered critical data resources for the global research endeavour in life sciences and biomedicine.
Content and Features
Database
The December release of the database encompassed over 1000 different data fields, divided into the categories "Name and taxonomic classification", "Morphology", "Culture and growth conditions,"Physiology and metabolism", "Isolation, sampling and environmental information." "Safety information", "Sequence information" and "Strain availability". The database comprised 1,922,166 entries, linked to the according strain and reference.
The data are retrieved from internal descriptions of culture collections, expert-compiled compendia and primary scientific literature like species descriptions.
Data access
Data can be accessed either via a GUI or via the RESTful web service. Using the GUI the user can choose between a simple search for searching strains by name, Culture collection number, NCBI Tax ID or INSDC sequence accession number, or the user can use the advanced search, which enables the search in 130 data fields and gives the opportunity of complex queries by combining several fields. Data can be downloaded i |
https://en.wikipedia.org/wiki/Apache%20Fortress | Apache Fortress is an open source project of the Apache Software Foundation and a subproject of the Apache Directory. It is an authorization system, written in Java, that provides role-based access control, delegated administration and password policy using an LDAP backend.
Standards implemented:
Role-Based Access Control (RBAC) ANSI INCITS 359
Administrative Role-Based Access Control (ARBAC02)
IETF Password Policy (draft)
Unix Users and Groups (RFC2307)
Fortress has four separate components:
Core - A set of security authorization APIs.
Realm - A Web Container plug-in that provides security for the Apache Tomcat container.
Rest - HTTP protocol wrappers of core APIs using Apache CXF.
Web - HTML pages of core APIs using Apache Wicket.
History
Fortress was first contributed in 2011 to the OpenLDAP Foundation and moved to the Apache Directory project in 2014.
Releases
API
Fortress provides security functions via APIs corresponding to the standards implemented. For example, its RBAC API design mimics the functional specifications of ANSI INCITS 359 with function names, entities being the same.
References
External links
Apache Fortress Project Page
py-fortress on PyPI
Fortress
Directory services
Access control |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.