source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Low-power%20FSM%20synthesis | Finite state machines (FSMs) are widely used to implement control logic in various applications such as microprocessors, digital transmission, digital filters and digital signal processing. Even for designs containing a good number of datapath elements, the controller occupies a sizeable portion. As the devices are mostly portable and hand-held, reducing power dissipation has emerged as the primary concern of today's VLSI designers. While the datapath elements can be shut down when they are not being used, controllers are always active. As a result, the controller consumes a good amount of system power. Thus, power-efficient synthesis of FSM has come up as a very important problem domain, attracting a lot of research. The synthesis method must be able to reduce both dynamic power and leakage power consumed by the circuit.
FSM synthesis
An FSM can be defined as a quintuplet that consists of a set of primary inputs, a set of primary outputs, a set of states, a next-state function and an output function. The next-state function maps the present-state and the primary inputs to a next-state; the output function maps the primary inputs and present-state onto the primary outputs. Any deterministic sequential function can be represented by the use of this model. A FSM can be separated into two parts viz., combinational circuit and memory.
The optimal synthesis of finite-state machines is an important step in digital design. The three basic steps involved in the FSM synthesis are:
State minimization: the number of states is reduced by recognizing the equivalent states that are present in the FSM and merging them. When state minimization is possible, it is deemed that the resulting FSM will be easier to build
State encoding: The complexity of the combinational logic depends on the assignment of codes to each of the states in the FSM. This is also referred to as state assignment. A good state assignment reduces the cost of implementation significantly. There are many encod |
https://en.wikipedia.org/wiki/Nexus%20for%20Exoplanet%20System%20Science | The Nexus for Exoplanet System Science (NExSS) initiative is a National Aeronautics and Space Administration (NASA) virtual institute designed to foster interdisciplinary collaboration in the search for life on exoplanets. Led by the Ames Research Center, the NASA Exoplanet Science Institute, and the Goddard Institute for Space Studies, NExSS will help organize the search for life on exoplanets from participating research teams and acquire new knowledge about exoplanets and extrasolar planetary systems.
History
In 1995, astronomers using ground-based observatories discovered 51 Pegasi b, the first exoplanet orbiting a Sun-like star. NASA launched the Kepler space telescope in 2009 to search for Earth-size exoplanets. By 2015, they had confirmed more than a thousand exoplanets, while several thousand additional candidates awaited confirmation.
To help coordinate efforts to sift through and understand the data, NASA needed a way for researchers to collaborate across disciplines. The success of the Virtual Planetary Laboratory research network at the University of Washington led Mary A. Voytek, director of the NASA Astrobiology Program, to model its structure and create the Nexus for Exoplanet System Science (NExSS) initiative. Leaders from three NASA research centers will run the program: Natalie Batalha of NASA's Ames Research Center, Dawn Gelino of the NASA Exoplanet Science Institute, and Anthony Del Genio of NASA's Goddard Institute for Space Studies.
Research
Functioning as a virtual institute, NExSS is currently composed of sixteen interdisciplinary science teams from ten universities, three NASA centers and two research institutes, who will work together to search for habitable exoplanets that can support life. The US teams were initially selected from a total of about 200 proposals; however, the coalition is expected to expand nationally and internationally as the project gets underway. Teams will also work with amateur citizen scientists who will have |
https://en.wikipedia.org/wiki/The%20Algorithm%20Auction | The Algorithm Auction is the world's first auction of computer algorithms. Created by Ruse Laboratories, the initial auction featured seven lots and was held at the Cooper Hewitt, Smithsonian Design Museum on March 27, 2015.
Five lots were physical representations of famous code or algorithms, including a signed, handwritten copy of the original Hello, World! C program by its creator Brian Kernighan on dot-matrix printer paper, a printed copy of 5,000 lines of Assembly code comprising the earliest known version of Turtle Graphics, signed by its creator Hal Abelson, a necktie containing the six-line qrpff algorithm capable of decrypting content on a commercially produced DVD video disc, and a pair of drawings representing OkCupid's original Compatibility Calculation algorithm, signed by the company founders. The qrpff lot sold for $2,500.
Two other lots were “living algorithms,” including a set of JavaScript tools for building applications that are accessible to the visually impaired and the other is for a program that converts lines of software code into music. Winning bidders received, along with artifacts related to the algorithms, a full intellectual property license to use, modify, or open-source the code. All lots were sold, with Hello World receiving the most bids.
Exhibited alongside the auction lots were a facsimile of the Plimpton 322 tablet on loan from Columbia University, and Nigella, an art-world facing computer virus named after Nigella Lawson and created by cypherpunk and hacktivist Richard Jones.
Sebastian Chan, Director of Digital & Emerging Media at the Cooper–Hewitt, attended the event remotely from Milan, Italy via a Beam Pro telepresence robot.
Effects
Following the auction, the Museum of Modern Art held a salon titled The Way of the Algorithm highlighting algorithms as "a ubiquitous and indispensable component of our lives."
References
Algorithms
2015 in computing
Contexts for auctions |
https://en.wikipedia.org/wiki/LibreCMC | LibreCMC is a Linux-libre distribution for computers with minimal resources, such as the Ben NanoNote, ath9k-based Wi-Fi routers, and other hardware with emphasis on free software. Based on OpenWrt, the project's goal is to aim for compliance with the GNU Free System Distribution Guidelines (GNU FSDG) and ensure that the project continues to meet these requirements set forth by the Free Software Foundation (FSF). LibreCMC does not support ac (Wi-Fi 5) or ax (Wi-Fi 6) due to a lack of free chipsets.
As of 2020, releases do not utilize codenames anymore. The acronym "CMC" in the libreCMC name stands for "Concurrent Machine Cluster".
History
On April 23, 2014, libreCMC's first public release is mentioned in a Trisquel Linux forum. On September 4, 2014, the Free Software Foundation (FSF) added libreCMC to its list of endorsed distributions. Shortly afterwards, on September 12, 2014, the FSF awarded their Respects Your Freedom (RYF) Certification to a new router pre-installed with libreCMC.
On May 2, 2015, libreCMC merged with the LibreWRT project. LibreWRT, initially developed as a case study, was listed by the website prism-break.org as one of the alternatives to proprietary firmware, but today the website lists libreCMC.
On March 10, 2016, the FSF awarded their RYF certification to a new router pre-installed with libreCMC.
On March 29, 2017, libreCMC began its first release based upon the LEDE (Linux Embedded Development Environment) 17.01 codebase.
On January 3, 2020, libreCMC began its first release based upon the OpenWrt 19.07 codebase.
Release history
Source
List of supported hardware
LibreCMC supports the following devices:
Buffalo (Melco subsidiary)
WZR-HP-G300NH
WHR-HP-G300NH
Netgear
WNDR3800: v1.x
TP-Link
TL-MR3020: v1
TL-WR741ND: v1 - v2, v4.20 - v4.27
TL-WR841ND: v5.x, v8.x, v9.x, v10.x, v11.x, v12.x
TL-WR842ND: v1, v2
TL-WR1043ND: v1.x, v2.x, v3.x, v4.x, v5.x
ThinkPenguin
TPE-NWIFIROUTER2
TPE-R1100
TPE-R1200
TPE-R1300
TPE-R140 |
https://en.wikipedia.org/wiki/Call%20signs%20in%20South%20America | Call signs in South America are used for a variety of purposes, including identifying radio and TV stations. Argentina and Brazil both have broadcast call signs systems. Some stations still broadcast their call signs a few times a day, but this practice is becoming very rare. Call signs were first assigned to South American countries in 1913, and the call sign blocks were expanded to include amateur radio in 1947.
In 1995, Brazil, Argentina, Peru, Uruguay and Venezuela signed up to the International Amateur Radio Permit agreement requiring governments to mutually recognize amateur radio licenses issued to citizens of other participating countries. Canada and the United States are also party to the agreement.
Argentina
Argentinian broadcast call signs consist of two (or, more recently, three) letters followed by multiple numbers. The second letter, as used in television call signs from the 1960s, traditionally indicated the region; LS call signs were given to stations in Buenos Aires, LT in the northeastern region, LU in the southern region, LV in the central region and LW in the northwestern region. (LR was used for some radio stations, especially in Buenos Aires; the earliest radio stations in the Argentine capital had call signs of LR plus one digit.) Most TV stations had call signs with higher two-digit numbers. The five main stations in the Buenos Aires area had call signs from LS 82 to LS 86, while stations in Rosario, Santa Fe had call signs LT 83 and LT 85.
Amateur radio call signs are used to uniquely identify 37,000 licensed amateur operators in Argentina. Call signs are regulated internationally by the ITU as well as nationally by the Comisión Nacional de Comunicaciones of the Argentine government. Foreign amateurs can obtain permission to operate in the country from can contact the Radio Club Argentino.
Since 2000 or earlier, call signs beginning with LR and a third letter, as well as have been assigned,
LRA exclusively assigned to Radio Nacional, |
https://en.wikipedia.org/wiki/Call%20signs%20in%20Oceania | Call signs in Oceania are currently voluntary in Australia radio and TV station, and were previously compulsory in New Zealand. In both countries, stations like 2GB and Newstalk ZB continue to use parts of the call signs in their branding.
The International Telecommunication Union has assigned countries in the Oceania the following call sign blocks for all radio communication, broadcasting or transmission:
History
The conference held in 1927 assigned call prefixes mainly to colonial powers. The only modern Oceanic nation mentioned was an Anglo-French condominium lasting from 1906 until 1980, when the New Hebrides gained their independence as Vanuatu. New Hebrides was assigned YHA–YHZ.
The 1947 Atlantic City ITU Conference reallocated call sign blocks some developing island nations. This time New Hebrides was assigned YJA–YJZ. All other islands were assigned call prefixes according to their colonial or protectorate status.
Since 1947 and the various independence movements, new call signs were assigned by the ITU or a new host country. This is particularly true of Japanese territories occupied by the United States following WWII.
Melanesia
Micronesia
Polynesia
While not directly related to call signs, the International Telecommunication Union (ITU) further has divided all countries assigned amateur radio prefixes into three regions; countries and territories in Oceania are located in ITU Region 3. They cover CQ Zones 27, 28, 31, 32 and 12.
Deleted or changed entities
These are the deleted or changed DXCC entities in Oceania since World War II:
Amateur radio call signs
Amateur radio or ham radio call signs are unique identifiers for more than 2,500 licensed operators in the western Pacific. Call signs are regulated internationally by the ITU as well as nationally by island national entities, some of which are independent countries and others are under colonial administration. For the purposes of this article, Australia, its dependencies and New Zea |
https://en.wikipedia.org/wiki/HackerRank | HackerRank is a technology company that focuses on competitive programming challenges for both consumers and businesses. Developers compete by writing programs according to provided specifications. HackerRank's programming challenges can be solved in a variety of programming languages (including Java, C++, PHP, Python, SQL, and JavaScript) and span multiple computer science domains.
HackerRank categorizes most of their programming challenges into a number of core computer science domains, including database management, mathematics, and artificial intelligence.
When a programmer submits a solution to a programming challenge, their submission is scored on the accuracy of their output. Programmers are then ranked globally on the HackerRank leaderboard and earn badges based on their accomplishments, which is intended to drive competition among users. In addition to individual coding challenges, HackerRank also hosts contests (often referred to by HackerRank as "CodeSprints") where users compete on the same programming challenges during a set period of time and are then ranked at the conclusion of the event. HackerRank is part of the growing gamification trend within competitive computer programming. The consumer side of their website is free for coders to use.
History
HackerRank was founded as InterviewStreet Inc. by two NIT Trichy alumni, Vivek Ravisankar and Hari Karunanidhi. HackerRank is a Y Combinator-backed company, and was the first Indian company accepted into Y Combinator. They also participated in TechCrunch Disrupt in 2012, and currently have venture capital backing from Khosla Ventures and Battery Ventures.
Funding
In July 2015, HackerRank received $7.5 million funding from Japanese firm Recruit Holdings’ HR technology fund. On February 13, 2018 HackerRank announced it had raised $30 million in Series C funding, led by JMI Equity.
Acquisition
In December 2019, HackerRank acquired Mimir, a cloud-based service that provides tools for teaching computer |
https://en.wikipedia.org/wiki/Call%20signs%20in%20Canada | Call signs in Canada are official identifiers issued to the country's radio and television stations. Assignments for broadcasting stations are made by the Canadian Radio-television and Telecommunications Commission (CRTC), while amateur stations receive their call signs from Innovation, Science and Economic Development Canada (previously Industry Canada). Conventional radio and television broadcasting stations assignments are generally three, four or five letters long (not including the "–FM", "–TV", or "–DT" suffix) and almost exclusively use "C" call signs; with a few exceptions noted below, the "V" calls are restricted to specialized uses such as amateur radio.
Call sign prefixes are coordinated internationally by the International Telecommunication Union (ITU), and Canada has been assigned CF–CK, VA–VG, VO, VX-VY and XJ–XO. "CB" series calls are officially assigned to Chile by the ITU, but Canada makes de facto use of this series for stations belonging to, but not exclusively broadcasting programs from, the Canadian Broadcasting Corporation (CBC).
Special broadcast undertakings such as Internet radio, cable FM, carrier current or closed circuit stations may sometimes be known by unofficial identifiers such as "CSCR". These are not governed by the Canadian media regulation system, and may be letter sequences that would not be permissible for a conventional broadcast station.
Three-letter call signs are only permitted to CBC Radio stations or to commercial stations which received their three-letter call sign before the current rules were adopted.
Assignments
The International Telecommunication Union has assigned Canada the following call sign blocks:
Broadcasting stations
Most broadcasting stations have four-letter call signs (not including the "–FM", "–TV", or "–DT" suffix). Three-letter call signs are only permitted to CBC Radio stations or to commercial stations which received their three-letter call sign before the current rules were adopted. Five-letter |
https://en.wikipedia.org/wiki/Call%20signs%20in%20the%20United%20States | Call signs in the United States are identifiers assigned to radio and television stations, which are issued by the Federal Communications Commission (FCC) and, in the case of most government stations, the National Telecommunications and Information Administration (NTIA). They consist of from 3 to 9 letters and digits, with their composition determined by a station's service category. By international agreement, all call signs starting with the letters K, N and W, as well as AAA-ALZ, are reserved exclusively for use in the United States.
AM, FM, TV and shortwave broadcasting stations can request their own call letters, as long as they are unique. The FCC policy covering broadcasting stations limits them to call signs that start with a "K" or a "W", with "K" call signs generally reserved for stations west of the Mississippi River, and "W" limited to stations east of the river. Amateur stations can receive call signs starting with all of the letters "A", "K", "N" and "W". Formerly, prefixes beginning with "A" were exclusively assigned to U.S. Army stations and prefixes beginning with "N" to U.S. Navy stations.
Broadcasting stations
Although most transmitters regulated by the Federal Communications Commission (FCC) are issued call signs for their official identification, the general public is most familiar with the ones used by radio and TV broadcasting stations. However, there is a wide variety in how much emphasis stations give to their call signs; for some it is the primary way they establish public identity, while others largely ignore their call signs, considering a moniker or slogan to be more easily remembered by listeners (and those filling in diaries for the Nielsen Audio ratings measurement). In the United States, the only time broadcasting stations are required to mention their call signs is during station identification announcements, made at a "natural break in programming" as close to the beginning of each hour as possible.
Television stations have the |
https://en.wikipedia.org/wiki/UNETix | uNETix is an early implementation of UNIX for IBM PC systems. It was not a "true" UNIX, but was written from scratch for the PC without using any code from System V.
Overview
uNETix only supported a single user. However, it maintained closer compatibility with standard versions of UNIX than early versions of QNX. uNETix' multiple windows capability was possibly the first implementation of windowing in a Unix-like operating system. Up to 10 windows were supported, which could each run independent tasks and could have individual foreground and background colors set with a special color command.
Published by Lantech Systems, Inc, uNETix had a list price in 1984 of 130 USD, but was discounted and advertised at 99 USD ( USD today). The minimum RAM requirement was 256 kB, but a machine would only be able to support single-tasking; multitasking required 512 kB. It had an emulation environment for MS-DOS that could run DOS 1.1 programs in one window while UNIX programs ran in other windows. Its major weaknesses were slow speed and lack of hard disk support. uNETix came with a full assembly language programming environment, and a C compiler was optional. Lantech claimed that the C compiler was the first available for the x86 architecture.
See also
Xenix
UNIX System V
AT&T UNIX PC
References
Computing platforms
Discontinued operating systems
Unix variants
Lightweight Unix-like systems |
https://en.wikipedia.org/wiki/List%20of%20microbiota%20species%20of%20the%20lower%20reproductive%20tract%20of%20women | This is the list of healthy vaginal microbiota (VMB), which is defined as the group of species and genera that generally are found to have lack of symptoms, absence of various infections, and result in good pregnancy outcomes. VMB is dominated mainly by Lactobacillus species. This is the list of organisms that are found in the lower reproductive tract of sexually mature women who are not immunocompromised. A partial description of pathogens that can be found in the lower and upper reproductive tract of women can be found in the article sexually transmitted disease. The organisms listed below are capable of causing illness if for some reason there is a change in vaginal pH or a change in the ratio of one organism to another. For example, Candida is a normal inhabitant of a healthy reproductive tract but an overgrowth of this organism can cause candidiasis.
Normal microbiota
This is the list of the normal flora that are found in the lower reproductive tract of sexually mature women who exhibit no symptoms of illness and who are not immunocompromised. Lactobacilli predominate. These organisms protect against infection. Vaginal microbiota composition may have a genetic component.
Anaerobes
Aerobes
These bacteria may be detected as transients or are marginally discernable with PCR techniques. They are also opportunistic pathogens and their overgrowth is considered an infection though symptoms and signs may be absent.
While the vaginal microbiota is populated predominantly by Lactobacillus spp. in 71% of women, 29% of asymptomatic, healthy women possess a microbiota essentially lacking in Lactobacillus and instead the following groups have been isolated from this population. This microbiota is affiliated with ethnicity:
Yeast
Candida albicans and other spp.
Microbiota changes
Pre-pubescent girls, women in menarche, and postmenopausal women have lower populations of Lactobacillus spp. in proportion to the other species. Hormone replacement therapy in postmenopaus |
https://en.wikipedia.org/wiki/List%20of%20functional%20connectivity%20software | Functional connectivity software is used to study functional properties of the connectome using functional Magnetic Resonance Imaging (fMRI) data in the resting state and during tasks. To access many of these software applications visit the NIH funded Neuroimaging Informatics Tools and Resources Clearinghouse (NITRC) site.
See also
List of neuroimaging software
Functional connectivity
Neuroimaging
References
Neuroimaging software
Lists of software |
https://en.wikipedia.org/wiki/Normal%20homomorphism | In algebra, a normal homomorphism is a ring homomorphism that is flat and is such that for every field extension L of the residue field of any prime ideal , is a normal ring.
References
Ring theory
Morphisms |
https://en.wikipedia.org/wiki/Macaulay%20representation%20of%20an%20integer | Given positive integers and , the -th Macaulay representation of is an expression for as a sum of binomial coefficients:
Here, is a uniquely determined, strictly increasing sequence of nonnegative integers known as the Macaulay coefficients. For any two positive integers and , is less than if and only if the sequence of Macaulay coefficients for comes before the sequence of Macaulay coefficients for in lexicographic order.
Macaulay coefficients are also known as the combinatorial number system.
References
Factorial and binomial topics |
https://en.wikipedia.org/wiki/Zenith%20Flash-matic | The Zenith Flash-Matic was the first wireless remote control, invented by Eugene Polley in 1955. It had only one button that was used to power on and off, channel up, channel down, and mute. The Flash-matic's phototechnology was a significant innovation in television and allowed for wireless signal transfer previously exclusive to radio.
Design and production
Earlier remotes could turn sets on/off and change channels, but were connected to the TV with a cable. The Flash-matic came in response to consumer complaints about the inconvenience of these cables running from the transmitter to the TV monitor. Earlier remotes served as the central control system for transmitting complex signals to the receiving monitor. The Flash-matic instead placed the complexity in the receiver as opposed to the transmitter. It used a directional beam of light to control a television outfitted with four photo cells in the corners of the screen. The light signal would activate one of the four control functions, which turned the picture and sound on or off, and turned the channel tuner dial clockwise or counter-clockwise. The bottom receptors received the signal to mute and power on/off, and the upper cells received signals to channel up/down. In order for the light beam to be received by the monitor, the remote control had to be directed towards one of the four photocells. The system responded to full-spectrum light so it could be activated or interfered with by other light sources including indoor light bulbs and the sun. Despite these defects, the Flash-matic remained in high demand. In September 1955, Zenith apologized for its inability to meet the consumer demand. The Flash-matic was soon replaced by better control systems. The "Zenith Space Command" remote control went into production in 1956 with aims to improve upon the Flash-matic's design.
Advertisement Campaign
The Flash-matic was marketed as an interactive technology and tuning device for the television. Muting was the first |
https://en.wikipedia.org/wiki/Call%20signs%20in%20Antarctica | Call signs in Antarctica include a three letter region code and a series of numbers and letters.
Assignments for telecommunications
Assignments for amateur radio
Amateur radio or ham radio call signs are unique identifiers for licensed operators in Antarctica. Call signs are regulated internationally by the ITU as well as nationally by governing bodies within each country who may have nationals operating in Antarctica. Call signs may also be issued by a local Antarctic authority (i.e. base commander) who chooses from a block reserved by their national body for that purpose. The Antarctic Treaty signed on December 1, 1959 (and entered into force on June 23, 1961), established the legal framework for the management of Antarctica, including allocation of amateur call signs.
The International Telecommunication Union does not assign call letter blocks to Antarctica since there is no single government there which can send delegates to ITU conferences. However, some individual countries reserve Antarctic prefixes or call letters from within their own call letter blocks as per this table. In some cases the assignment of call letters is made locally at an Antarctic base and the relevant national body is notified.
Reciprocal agreements
Although Antarctica is considered international by treaty, amateur radio operators in Antarctica are often subject to the reciprocal licensing requirements pertaining to the country under which the camp is flagged.
Special Events
The Worldwide Antarctic Program keeps a list of special event call signs issued from various countries at various times. TM4IPY was issued in 2007 by France to celebrate the International Polar Year as was IA0IPY, IA8IPY, IA7IPY & IP7IPY by Italy, GB4IPY by the United Kingdom, VY0ICE/VE2 in Canada, LZ07IPY in Argentina, EV5IPY in Belarus, CQ4IPY in Portugal, SN0IPY in Poland, YE2IPY in Indonesia, S50IPY in Slovenia, 5D0IPY in Morocco, and others. These callsigns were used by amateurs in their home countrie |
https://en.wikipedia.org/wiki/Call%20signs%20in%20Barbados | Call signs in Barbados include a three letter country code, and a series of letters and numbers.
The International Telecommunication Union has assigned Barbados the following call sign blocks for all radio communication, broadcasting or transmission:
Call sign assignments for amateur radio
Amateur radio call signs are unique identifiers for the 315 licensed operators in Barbados. The call signs are regulated internationally by the ITU as well as nationally by the Telecommunications Unit in the Ministry of Energy and Public Utilities.
The Telecommunications Unit issues call signs in the 8P series for amateur use. Barbadian nationals are identified by the prefix “8P6”, non-nationals are identified by the prefix “8P9”.
Call signs are assigned on a sequential basis and normally amateurs are not allowed to select one even if available. However, the form in which Barbadians apply for call signs allow for a choice of two-letters from AA to ZZ, to form an 8P6xx, 2x2 call sign.
While not directly related to call signs, the International Telecommunication Union (ITU) further has divided all countries assigned amateur radio prefixes into three regions; Barbados is located in ITU Region 2, ITU Zone 11 and CQ Zone 08.
Special regulations regarding station identification
The Telecommunications Regulations indicate that call sign must be sent, and if in morse code not more than 20 words per minute speed.
Special call signs
Barbadian policy allows for 1x1 call signs for special events, although this probably refers to what is (in effect) a 2x1 call sign of 8P6x, where 'x' is a single letter. The 8P5 prefix is also used, as has the 8P2 prefix.
The Amateur Radio Society of Barbados is assigned 8P55AW as 2010 is the 55th Anniversary of the Society.
References
Further reading
https://books.google.com/books?id=Ux9fZj6izuEC&q=RAdio+Barbados+ZNX&pg=PA88
External links
Telecommunications Unit , Division of Ministry of Energy and Telecommunications, in the Prime Min |
https://en.wikipedia.org/wiki/Call%20signs%20in%20the%20United%20Kingdom | Call signs in United Kingdom include a three letter country code, and a series of letters and numbers.
Call signs are regulated internationally by the ITU as well as nationally in the UK by the Office of Communications (Ofcom). It regulates amateur radio in the country as an independent regulator and competition authority for the UK communications industries, with responsibilities across television, radio, telecommunications and wireless communications services. It assigns call signs, issues amateur radio licences, allots frequency spectrum, and monitors the radio waves. Ofcom is no longer responsible for setting and conducting amateur radio exams, which are now run by the Radio Society of Great Britain on their behalf.
The Radio Society of Great Britain (RSGB) is the United Kingdom's recognised national society for amateur radio operators. The society's former patron was Prince Philip, Duke of Edinburgh, and it represents the interests of the UK's licensed radio amateurs.
Call sign blocks for telecommunication
The International Telecommunication Union has assigned Great Britain the following call sign blocks for all radio communication, broadcasting or transmission:
While not directly related to call signs, the International Telecommunication Union (ITU) further has divided all countries assigned amateur radio prefixes into three regions; Great Britain is located in ITU Region 1.
Assignments
These are callsigns of BBC Regional transmitters in the years prior to World War II.
Call sign assignments for amateur radio
Amateur radio or ham radio call signs are unique identifiers for the 75,000 licensed operators. Ofcom allots the individual call signs to the amateurs it licences. Call signs are the property of Ofcom even when assigned.
Callsigns in the G9 series are commercial licences, issued for experimental purposes and these may not be used on the amateur bands (except in the case of a contest callsign).
Regional two-letter prefixes are assigned according |
https://en.wikipedia.org/wiki/Herv%C3%A9%20Moulin | Hervé Moulin (born 1950 in Paris) is a French mathematician who is the Donald J. Robertson Chair of Economics at the Adam Smith Business School at the University of Glasgow. He is known for his research contributions in mathematical economics, in particular in the fields of mechanism design, social choice, game theory and fair division. He has written five books and over 100 peer-reviewed articles.
Moulin was the George A. Peterkin Professor of Economics at Rice University (from 1999 to 2013):, the James B. Duke Professor of Economics at Duke University (from
1989 to 1999), the University Distinguished Professor at Virginia Tech (from
1987 to 1989), and Academic Supervisor at Higher School of Economics in St. Petersburg, Russia (from
2015 to 2022). He is a fellow of the Econometric Society since 1983, and the president of the Game Theory Society for the term 2016 - 2018. He also served as president of the Society for Social Choice and Welfare for the period of 1998 to 1999. He became a Fellow of the Royal Society of Edinburgh in 2015.
Moulin's research has been supported in part by seven grants from the US National Science Foundation. He collaborates as an adviser with the fair division website Spliddit, created by Ariel Procaccia. On the occasion of his 65th birthday, the Paris School of Economics and the Aix-Marseille University organised a conference in his honor, with Peyton Young, William Thomson, Salvador Barbera, and Moulin himself among the speakers.
Biography
Moulin obtained his undergraduate degree from the École Normale Supérieure in Paris in 1971 and his doctoral degree in Mathematics at the University of Paris-IX in 1975 with a thesis on zero-sum games, which was published in French at the Mémoires de la Société Mathématique de France and in English in the Journal of Mathematical Analysis and its Applications.
On 1979, he published a seminal paper in Econometrica introducing the notion of dominance solvable games. Dominance solvability is a so |
https://en.wikipedia.org/wiki/Stream%20%28abstract%20data%20type%29 | In type theory and functional programming, a stream is a potentially infinite analog of a list, given by the coinductive definition:
data Stream α = Nil | Cons α (Stream α)
Generating and computing with streams requires lazy evaluation, either implicitly in a lazily evaluated language or by creating and forcing thunks in an eager language. In total languages they must be defined as codata and can be iterated over using (guarded) corecursion.
See also
Coinduction
References
Type theory
Functional programming
Functional data structures |
https://en.wikipedia.org/wiki/Atari%20Sierra | Sierra was the code name for a 16-bit/32-bit personal computer designed by the Sunnyvale Research Lab (SRL) of Atari, Inc. starting around 1983. The design was one of several new 16-bit computer systems proposing to use a new chipset from Atari Corporate Research.
The graphics portion consisted of a two chip system called "Silver and Gold", Gold generated the video output while Silver was a sprite processor that fed data to Gold. The chipset was collectively known as Rainbow, and the system is sometimes referred to by this name. The audio portion of the chipset consisted of a powerful sound synthesizer known as AMY. The CPU had not been chosen, but the Motorola 68000, National Semiconductor 32016 and Intel 286 were being considered. Several proposed operating systems were considered including VisiCorps Visi On and Atari's own internal OS code-named "Snowcap".
Sierra was bogged down since its inception through a committee process that never could come to a consensus on the design specifications. A second project, Atari Gaza, ran in parallel, designing an upscale workstation machine running either BSD Unix or CP/M-68k. Atari management concluded they had no way to sell into the business market, redirecting Gaza engineers to a new low-cost machine based on the Amiga chipset, "Mickey". All of these systems were still incomplete when the company was purchased by Jack Tramiel in July 1984 and the majority of the staff was laid off. Only the synthesizer caught the interest of Tramel Technology lead engineer Shiraz Shivji and the rest of the projects disappeared.
History
Earlier 8-bit designs
Atari's earlier consoles and computers generally used an off-the-shelf 8-bit central processor with custom chips to improve performance and capabilities. With most designs of the era, graphics, sound and similar tasks would normally be handled by the main CPU, and converted to output using relatively simple analog-to-digital converters. Offloading these duties to the custom chips |
https://en.wikipedia.org/wiki/Swiss%20Network%20Operators%20Group | The Swiss Network Operators Group (SwiNOG) is a Swiss counterpart to NANOG. Like NANOG, SwiNOG operates a mailing list for operators of Swiss data networks, including ISPs.
Events
Twice a year the community gathers in Bern, the capitol of Switzerland for a social gathering containing technical presentations and of course direct interaction between the people in the community. Usually these talks are very technical and can contain various topics related to the work of network operators like out-of-band management. Of course there are also more high-level presentations like the one about SDN and NFV. Usually some months before the event, someone from the SwiNOG-Core-Team sends out a CfP.
On a monthly basis, Steven Glogger is also organizing the SwiNOG Beer Events. In the past there where already more than 100 events, taken place in the city of Zurich, a social gathering where people talk about technology, their employer and sometimes also about customers but mainly to exchange information to each other in an offline mode.
History
See also
Internet network operators' group
References
External links
SwiNOG Federation a non-profit organisation representing Swiss SME Internet access and service providers.
Internet in Switzerland
Internet Network Operators' Groups
Electronic_mailing_lists
Computer_networking
History_of_the_Internet
Information technology organisations based in Switzerland |
https://en.wikipedia.org/wiki/List%20of%20finite-dimensional%20Nichols%20algebras | In mathematics, a Nichols algebra is a Hopf algebra in a braided category assigned to an object V in this category (e.g. a braided vector space). The Nichols algebra is a quotient of the tensor algebra of V enjoying a certain universal property and is typically infinite-dimensional. Nichols algebras appear naturally in any pointed Hopf algebra and enabled their classification in important cases. The most well known examples for Nichols algebras are the Borel parts of the infinite-dimensional quantum groups when q is no root of unity, and the first examples of finite-dimensional Nichols algebras are the Borel parts of the Frobenius–Lusztig kernel (small quantum group) when q is a root of unity.
The following article lists all known finite-dimensional Nichols algebras where is a Yetter–Drinfel'd module over a finite group , where the group is generated by the support of . For more details on Nichols algebras see Nichols algebra.
There are two major cases:
abelian, which implies is diagonally braided .
nonabelian.
The rank is the number of irreducible summands in the semisimple Yetter–Drinfel'd module .
The irreducible summands are each associated to a conjugacy class and an irreducible representation of the centralizer .
To any Nichols algebra there is by attached
a generalized root system and a Weyl groupoid. These are classified in.
In particular several Dynkin diagrams (for inequivalent types of Weyl chambers). Each Dynkin diagram has one vertex per irreducible and edges depending on their braided commutators in the Nichols algebra.
The Hilbert series of the graded algebra is given. An observation is that it factorizes in each case into polynomials . We only give the Hilbert series and dimension of the Nichols algebra in characteristic .
Note that a Nichols algebra only depends on the braided vector space and can therefore be realized over many different groups. Sometimes there are two or three Nichols algebras with different and non |
https://en.wikipedia.org/wiki/Spoofing%20%28finance%29 | Spoofing is a disruptive algorithmic trading activity employed by traders to outpace other market participants and to manipulate markets. Spoofers feign interest in trading futures, stocks and other products in financial markets creating an illusion of the demand and supply of the traded asset. In an order driven market, spoofers post a relatively large number of limit orders on one side of the limit order book to make other market participants believe that there is pressure to sell (limit orders are posted on the offer side of the book) or to buy (limit orders are posted on the bid side of the book) the asset.
Spoofing may cause prices to change because the market interprets the one-sided pressure in the limit order book as a shift in the balance of the number of investors who wish to purchase or sell the asset, which causes prices to increase (more buyers than sellers) or prices to decline (more sellers than buyers). Spoofers bid or offer with intent to cancel before the orders are filled. The flurry of activity around the buy or sell orders is intended to attract other traders to induce a particular market reaction. Spoofing can be a factor in the rise and fall of the price of shares and can be very profitable to the spoofer who can time buying and selling based on this manipulation.
Under the 2010 Dodd–Frank Act spoofing is defined as "the illegal practice of bidding or offering with intent to cancel before execution." Spoofing can be used with layering algorithms and front-running, activities which are also illegal.
High-frequency trading, the primary form of algorithmic trading used in financial markets is very profitable as it deals in high volumes of transactions. The five-year delay in arresting the lone spoofer, Navinder Singh Sarao, accused of exacerbating the 2010 Flash Crash—one of the most turbulent periods in the history of financial markets—has placed the self-regulatory bodies such as the Commodity Futures Trading Commission (CFTC) and Chicago Me |
https://en.wikipedia.org/wiki/Supertransitive%20class | In set theory, a supertransitive class is a transitive class which includes as a subset the power set of each of its elements.
Formally, let A be a transitive class. Then A is supertransitive if and only if
Here P(x) denotes the power set of x.
See also
Rank (set theory)
References
Set theory |
https://en.wikipedia.org/wiki/Double%20tee | A double tee or double-T beam is a load-bearing structure that resembles two T-beams connected to each other side by side. The strong bond of the flange (horizontal section) and the two webs (vertical members, also known as stems) creates a structure that is capable of withstanding high loads while having a long span. The typical sizes of double tees are up to for flange width, up to for web depth, and up to or more for span length. Double tees are pre-manufactured from prestressed concrete which allows construction time to be shortened.
History
The developments of double tee were started in the 1950s by two independent initiatives, one by Leap Associates founded by Harry Edwards in Florida, and the other by Prestressed Concrete of Colorado. They designed the wings to expand the structural channel in order to cover more area at a lower cost. In 1951, Harry Edwards and Paul Zia designed a wide prestressed double tee section. Non-prestressed double tees were constructed in Miami in 1952 followed by prestressed double tees in 1953. Separately, engineers of Prestressed Concrete of Colorado developed and constructed the first prestressed double tee which was wide called "twin tee" in late 1952. The early twin tee spans were between and . Those double tee spans were first used for the first time to build a cold storage building for Beatrice Foods in Denver.
The early double tee spans of had grown to quickly. The Precast/Prestressed Concrete Institute (PCI) published the double tee load capacity calculation (load tables) for the first time in the PCI Design Handbook in 1971. The load tables use the code to identify double tee span type by using the width in feet, followed by "DT", followed by depth in inches, for example, 4DT14 is for wide, deep double tees. In its first publication there were seven double tee types from 4DT14 to 10DT32. The list included 8DT24 that were proven to be the most popular double tee type used for spans for several decades. Currentl |
https://en.wikipedia.org/wiki/Dinesh%20Singh%20%28academic%29 | Professor Dinesh Singh, chancellor K.R. Mangalam University is an Indian professor of mathematics. He served as the 21st Vice-Chancellor of the University of Delhi, is a distinguished fellow of Hackspace at Imperial College London, and has been an adjunct professor of Mathematics at the University of Houston. For his services to the nation he was conferred with the Padma Shri which is the fourth highest civilian award awarded by the Republic of India.
Early life and background
Dinesh Singh earned his B.sc.(Hons. – Maths) in 1975 and M.A. (Maths) in 1977 from St. Stephen's College, followed by M.Phil (Maths) in 1978 from the University of Delhi. He did a PhD in Math from Imperial College London in 1981. He holds numerous honorary doctorates some of them being awarded by University of Edinburgh, National Institute of Technology, Kurukshetra, University College Cork, Ireland, and University of Houston.
Career
Singh started his career as Lecturer at St. Stephen's College, University of Delhi in 1981. Thereafter he joined the Department of Mathematics, University of Delhi in 1987. He was Head of the Department of Mathematics at the University of Delhi from December, 2004 to September, 2005. He served the University of Delhi as a Director, South Campus from 2005-2010. He officiated briefly as Pro Vice Chancellor, University of Delhi, before being appointed Vice Chancellor on 29 October 2010. His area of specialization includes Functional analysis, Operator Theory, and Harmonic analysis. He is an adjunct professor at the University of Houston and has also taught at the Indian Institute of Technology Delhi, Indian Statistical Institute, Delhi. He is a recipient of Padma Shri, the fourth highest civilian honor awarded by the Republic of India. He is noted for being instrumental in setting up of Cluster Innovation Centre at University of Delhi , an inter-disciplinary, first of its kind research center particularly promoting undergraduate research. He also populariz |
https://en.wikipedia.org/wiki/Endless%20Forms%20Most%20Beautiful%20%28song%29 | "Endless Forms Most Beautiful" is a song by Finnish symphonic metal band Nightwish. It is the second single from their eighth album "Endless Forms Most Beautiful". The song was announced on April 17, 2015, alongside its release date and cover, and was eventually released on May 8, 2015 together with a lyric video.
According to band's bass player Marko Hietala, Endless Forms Most Beautiful was chosen for a single because the band wanted a heavier song for a single after Élan and it has a "simple structure, killer chorus and goes well for a video purpose." Keyboardist and songwriter Tuomas Holopainen commented that the song was heavily inspired by Richard Dawkins' book The Ancestor's Tale.
Track listing
CD version
Vinyl version
Personnel
Nightwish
Floor Jansen – lead vocals
Marko Hietala – bass, vocals
Emppu Vuorinen – guitars
Tuomas Holopainen – keyboards, piano
Troy Donockley – uilleann pipes, tin whistle, backing vocals
Additional musicians
Kai Hahto – drums
Pip Williams – orchestral arrangements
James Shearman – Conductor
Metro Voices – choir
References
2015 songs
Songs written by Tuomas Holopainen
Nuclear Blast Records singles
Nightwish songs
Evolution in popular culture
Richard Dawkins |
https://en.wikipedia.org/wiki/Profinite%20integer | In mathematics, a profinite integer is an element of the ring (sometimes pronounced as zee-hat or zed-hat)
where the inverse limit
indicates the profinite completion of , the index runs over all prime numbers, and is the ring of p-adic integers. This group is important because of its relation to Galois theory, étale homotopy theory, and the ring of adeles. In addition, it provides a basic tractable example of a profinite group.
Construction
The profinite integers can be constructed as the set of sequences of residues represented as
such that .
Pointwise addition and multiplication make it a commutative ring.
The ring of integers embeds into the ring of profinite integers by the canonical injection:
where
It is canonical since it satisfies the universal property of profinite groups that, given any profinite group and any group homomorphism , there exists a unique continuous group homomorphism with .
Using Factorial number system
Every integer has a unique representation in the factorial number system as
where for every , and only finitely many of are nonzero.
Its factorial number representation can be written as .
In the same way, a profinite integer can be uniquely represented in the factorial number system as an infinite string , where each is an integer satisfying .
The digits determine the value of the profinite integer mod . More specifically, there is a ring homomorphism sending
The difference of a profinite integer from an integer is that the "finitely many nonzero digits" condition is dropped, allowing for its factorial number representation to have infinitely many nonzero digits.
Using the Chinese Remainder theorem
Another way to understand the construction of the profinite integers is by using the Chinese remainder theorem. Recall that for an integer with prime factorization
of non-repeating primes, there is a ring isomorphism
from the theorem. Moreover, any surjection
will just be a map on the underlying decompositions |
https://en.wikipedia.org/wiki/MLS%20Soccer%20Sunday | MLS Soccer Sunday is a presentation of Major League Soccer produced independently by ESPN and Fox Sports. Sunday afternoons are primarily aired on ABC and Fox while Sunday evenings primarily on ESPN, ESPN2, and Fox Sports 1. Spanish-language simulcasts are broadcast on ESPN Deportes and Fox Deportes.
As part of the current broadcast agreement between Major League Soccer and its network partners, ESPN Networks and Fox Sports each contracted to broadcast 34 weekly matches in an assigned broadcast window. In addition to the weekly broadcast window, each broadcast group gained the right to transmit their broadcasts on their respective digital broadcast service.
Additionally, ESPN Networks was granted the right to develop an over-the-top content (OTT) service consisting of all out-of-market broadcasts of any MLS match not part of the MLS Soccer Sunday broadcasts nor those of Viernes de Fútbol, the Friday evening presentation of MLS on the networks of Univision. Although the service was intended to begin with the 2015 MLS season in the first year of the new agreement, ESPN decided it could not logistically offer the service that year and MLS continued to offer its MLS Live digital service as it had previous seasons.
On ESPN/ABC
MLS Soccer Sunday is telecast primarily on ESPN or ESPN2 in the 5 p.m. Eastern Time Zone broadcast window or ABC in the 3 p.m. Eastern Time Zone broadcast window. Most matches are simulcast live on ESPN Deportes. The first broadcast on March 8, 2015, was the home opener of Orlando City SC and fellow expansion side New York City FC. The match, which ended in a 1–1 tie, was broadcast from the Citrus Bowl in Orlando, Florida before a crowd of 62,510 spectators.
English-language and Spanish-language feeds are carried on ESPN3.
On Fox
MLS Soccer Sunday is telecast primarily on FS1 and Fox Deportes in the 7 pm Eastern Time Zone broadcast window. The first broadcast on March 8, 2015, was the first match of a doubleheader featuring Sporting Kansas |
https://en.wikipedia.org/wiki/FMN-binding%20fluorescent%20protein | A FMN-binding fluorescent protein (FbFP), also known as a LOV-based fluorescent protein, is a small, oxygen-independent fluorescent protein that binds flavin mononucleotide (FMN) as a chromophore.
They were developed from blue-light receptors (so called LOV-domains) found in plants and various bacteria. They complement the GFP-derivatives and –homologues and are particularly characterized by their independence of molecular oxygen and their small size. FbFPs absorb blue light and emit light in the cyan-green spectral range.
Development
LOV-domains are a sub-class of PAS domains and were first identified in plants as part of Phototropin, which plays an essential role in the plant's growth towards light. They noncovalently bind Flavin mononucleotide (FMN) as coenzyme. Due to the bound FMN LOV-domains exhibit an intrinsic fluorescence, which is however very weak. Upon illumination with blue light, LOV-domains undergo a photocyle, during which a covalent bond is formed between a conserved cysteine-residue and the FMN. This causes a conformational change in the protein that is necessary for signal propagation and also leads to the loss of fluorescence. The covalent bond is energetically unfavorable and is cleaved with a protein specific time constant ranging from seconds to hours.
In order to make better use of the fluorescence properties of these proteins, the natural photocycle of these LOV-domains was abolished by exchanging the conserved cysteine against an alanine on a genetic level.
Thus, upon blue light irradiation, the protein remains in the fluorescent state and also exhibits a brighter fluorescence.
The first FbFPs that were generated in this fashion were subsequently further optimized using different methods of mutagenesis. Especially the brightness but also the photostability of the proteins were enhanced and their spectral characteristics altered.
Spectral characteristics
Typically FbFPs have an excitation maximum at a wavelength of approximately 450 |
https://en.wikipedia.org/wiki/Operation%20reduction%20for%20low%20power | Operation Reduction for Low Power is an ASIC program transformation technique used to reduce the power consumed by a specific application. A program transformation is any operation that changes the computational structure such as nature and type of computational models, their interconnections, sequencing of operations keeping the input output behavior intact. We basically use Operation reduction to reduce the number of operations to be done to perform a task which reduces the hardware required and in turn power consumption. For example, in a given Application specific IC reducing the number of independent additions required automatically reduces the adders required and also the power consumed.
Operation substitution
Operation Substitution is one of the operation reduction techniques where certain costly operations are substituted by relatively cheaper operations which reduce power consumption. Some typical examples of operation substitution techniques are given as follows:
Multiplication by Adds/Subtracts: The multiplication of two numbers if costly compared to addition of two numbers therefore substituting it with addition is profitable. For example, to calculate y = x2 + Ax + B we can calculate x2, Ax, and add both of them to B which has 2 multiplications, 3 additions or we can convert it into y = x(x+A) + B where we can calculate x+A multiply it with x and add B where we have 1 multiplication and 2 additions, both approaches have same critical path length but 2nd one has lesser multiplications which saves power.
Computation of Sine/cosine/tan: Computing trigonometric functions might also turn out to be quite costly where as substituting them with lesser order Taylor expansion makes them less power consuming but we may lose on approximation grounds which is a trade-off one should keep in mind.
Multiply-add by MAC: Multiply–accumulate operation is a common step that computes the product of two numbers and adds that product to an accumulator. The hardware used fo |
https://en.wikipedia.org/wiki/Average%20memory%20access%20time | In computer science, Average Memory Access Time (AMAT) is a common metric to analyze computer memory system performance.
Metric
AMAT uses hit time, miss penalty, and miss rate to measure memory performance. It accounts for the fact that hits and misses affect memory system performance differently. In addition, AMAT can be extended recursively to multiple layers of the memory hierarchy. It focuses on how locality and cache misses affect overall performance and allows for a quick analysis of different cache design techniques. A tacit assumption of AMAT is that a data access is either a hit or a miss, meaning the memory only supports sequential accesses and cannot have multiple accesses occurring simultaneously. Recently AMAT has been extended to consider concurrent data access. A model, called Concurrent-AMAT (C-AMAT), is introduced for more accurate analysis of current memory systems. More information on C-AMAT can be found in the external links section.
AMAT's three parameters hit time (or hit latency), miss rate, and miss penalty provide a quick analysis of memory systems. Hit latency (H) is the time to hit in the cache. Miss rate (MR) is the frequency of cache misses, while average miss penalty (AMP) is the cost of a cache miss in terms of time. Concretely it can be defined as follows.
It can also be defined recursively as,
where
In this manner, this recursive definition can be extended throughout all layers of the memory hierarchy.
References
External links
An overview of Concurrent Average Memory Access Time (C-AMAT)
Computer memory
Cache (computing) |
https://en.wikipedia.org/wiki/TERRA%20%28biology%29 | TERRA in biology is an abbreviation for "TElomeric Repeat-containing RNA". TERRA is RNA that is transcribed from telomeres — the repeating 6-nucleotide sequences that cap the ends of chromosomes. TERRA functions with shelterin to inhibit telomere lengthening by enzyme telomerase.
TERRAs are essential for telomere length and maintenance. At least four factors contribute to telomere maintenance: telomerase, shelterin, TERRA and the CST Complex.
TERRA can also regulate telomere length by increasing euchromatin formation. On the other hand, nonsense-mediated decay factor enrichment at telomeres may exist to prevent TERRA inhibition of telomerase. TERRA levels vary during the cell cycle, decreasing during S phase, and increasing in the transition from G2 phase to G1 phase.
References
Chromosomes
Molecular biology
Repetitive DNA sequences
Telomeres |
https://en.wikipedia.org/wiki/Robert%20Schimke | Robert Tod Schimke (October 25, 1932 – September 6, 2014) was an American biochemist and cancer researcher.
He was born in Spokane, Washington, the son of a dentist and a homemaker.
Schimke obtained an undergraduate degree from Stanford University in 1954, and an MD degree in 1958.
From 1958 to 1960 he performed internship and residency training at Massachusetts General Hospital.
From 1960 to 1966 he served in the Public Health Service at the National Institutes of Health, where he worked on the way dietary changes affect the enzymes controlling the urea cycle in rats.
In 1966 he returned to Stanford, where from 1969 to 1972 he was on the board of the faculty of pharmacology, and from 1978 to 1982 he was chairman of the department of biology.
At Stanford he examined the effects of steroid hormones on the synthesis of certain proteins, leading to new techniques in genetic engineering. In 1977, he (and doctoral student Fred Alt) discovered the phenomenon of gene amplification in mammalian cells. This discovery had great importance for cancer research, for example, in understanding the genetic instability of cancer cells and the mechanisms by which cancer cells can resist chemotherapy. The mechanism also found applications in biotechnology, for example in the production of proteins, including erythropoietin, of which he helped to develop a commercial version.
Later he studied regulatory mechanisms in the cells, including the regulation of apoptosis. He was a research professor of the American Cancer Society and later professor emeritus at Stanford.
In 1985, he received the Alfred P. Sloan, Jr. Prize for Cancer Research. He was a member of the National Academy of Sciences, the Institute of Medicine, and the American Academy of Arts and Sciences. He was president of the American Society for Biochemistry and Molecular Biology.
In 1995, Schimke was injured when a car struck the bicycle he was riding. He recovered, but needed to use a wheelchair for the rest of his |
https://en.wikipedia.org/wiki/Democratic%20confederalism | Democratic confederalism (), also known as Kurdish communalism or Apoism, is a political concept theorized by Kurdistan Workers Party (PKK) leader Abdullah Öcalan about a system of democratic self-organization with the features of a confederation based on the principles of autonomy, direct democracy, political ecology, feminism, multiculturalism, self-defense, self-governance and elements of a cooperative economy. Influenced by social ecology, libertarian municipalism, Middle Eastern history and general state theory, Öcalan presents the concept as a political solution to Kurdish national aspirations, as well as other fundamental problems in countries in the region deeply rooted in class society, and as a route to freedom and democratization for people around the world.
Although the liberation struggle of the PKK was originally guided by the prospect of creating a Kurdish nation state on a Marxist–Leninist basis, Öcalan became disillusioned with the nation-state model and state socialism. Influenced by ideas from Western thinkers such as the libertarian municipalist and former anarchist Murray Bookchin, Öcalan reformulated the political objectives of the Kurdish liberation movement, abandoning the old statist and centralizing socialist project for a radical and renewed proposal for a form of libertarian socialism that no longer aims at building an independent state separate from Turkey, but at establishing an autonomous, democratic and decentralized entity based on the ideas of democratic confederalism.
Theory
Rejecting both the authoritarianism and bureaucracism of state socialism and the predation of capitalism, seen by Öcalan as most responsible for the economic inequalities, sexism and environmental destruction in the world, democratic confederalism defends a "type of organization or administration can be called non-state political administration or stateless democracy", which would provide the framework for the autonomous organization of "every community, co |
https://en.wikipedia.org/wiki/Eftilagimod%20alpha | Eftilagimod alpha (INN; development code IMP321 or efti) is a large-molecule cancer drug being developed by the clinical-stage biotechnology company Immutep. Efti is a soluble version of the immune checkpoint molecule LAG-3. It is an APC Activator used to increase an immune response to tumors, and is administered by subcutaneous injection. Efti has three intended clinical settings:
as adjuvant to cancer vaccines (in a low, effective dose of ~250 µg)
as first-line 'chemo-immunotherapy,' that is, combined with standard chemotherapy (e.g. paclitaxel)
in combination immunotherapy with PD-1 treatments (e.g. pembrolizumab)
Eftilagimod alpha is in Phase II clinical testing. Currently, the main indications for the drug are metastatic breast cancer, non-small cell lung cancer (NSCLC), and head and neck squamous cell carcinoma (HNSCC).
Background
Eftilagimod alpha ("efti" in short) is a soluble LAG-3 fusion protein that activates antigen-presenting cells. It is a 160 kDa protein consisting of the four extracellular domains of LAG-3 fused to the Fc region of an IgG1(LAG-3Ig). Efti binds preferentially to a subset of MHC class II molecules that are enriched in lipid rafts and/or composed of stable peptide-MHC II (pMHCII) complexes. On T cells, membrane-anchored LAG-3 is an inhibitory receptor downregulating T-cell receptor (TCR) signaling. Efti – as a soluble LAG-3 protein – is an MHC class II agonist and therefore a dendritic-cell activator, causing increased antigen presentation to cytotoxic (CD8+) T cells. In the absence of antigen presentation via MHC class II molecules, efti reactivates dormant antigen-experienced memory T cells, allowing them to recognize their antigen targets at the tumor site.
History
Soluble LAG-3 was first established as a dendritic-cell activator in the late 1990s. Frédéric Triebel, who discovered LAG-3 in 1990, worked through the 1990s at his laboratory at the Institut Gustave Roussy, in collaboration with INSERM and Merck Serono, to elucida |
https://en.wikipedia.org/wiki/Bureau%20van%20Dijk | Bureau van Dijk is a major publisher of business information, and specialises in private company data combined with software for searching and analysing companies. It is a Moody's Analytics company. Orbis is Bureau van Dijk's flagship company database.
On 15 May 2017 it was announced that Moody's entered into a definitive agreement to acquire Bureau van Dijk, which completed in August 2017.
Overview
Bureau van Dijk's product range combines data from regulatory and other sources, including 160 information providers, with software to allow users to manipulate data for a range of research needs and applications. Unlike other providers of content, Bureau van Dijk reveals their sources and shows the source data – allowing users to create their own analytics and predictive analysis based on underlying primary data and reporting.
The majority of staff focus on sales, marketing and customer support in offices in: Amsterdam, Beijing, Bratislava, Brussels, Buenos Aires, Chicago, Copenhagen, Dubai, Frankfurt, Geneva, Hong Kong, Johannesburg, Lisbon, London, Madrid, Manchester, Mexico City, Milan, Moscow, New York, Paris, Rome, San Francisco, São Paulo, Seoul, Shanghai, Singapore, Stockholm, Sydney, Tokyo, Vienna, Washington D.C. and Zurich.
Bureau van Dijk's research team collects both global M&A data and intelligence around corporate ownership structures, and is based in Manchester, Brussels and Singapore. It also has a team of journalists writing news stories on deals and market rumours.
Product management and software development are based in the Geneva and Brussels offices. The company has over 5,000 clients including banks, insurance companies, financial and consulting organisations, governments and research institutes. Bureau van Dijk claims to offer the most powerful comparable resource of information on private companies in the world. The company brand statement is "The Business of Certainty". The company regularly blogs content and white papers, offering free |
https://en.wikipedia.org/wiki/Nonrecursive%20filter | In mathematics, a nonrecursive filter only uses input values like x[n − 1], unlike recursive filter where it uses previous output values like y[n − 1].
In signal processing, non-recursive digital filters are often known as Finite Impulse Response (FIR) filters, as a non-recursive digital filter has a finite number of coefficients in the impulse response h[n].
Examples:
Non-recursive filter: y[n] = 0.5x[n − 1] + 0.5x[n]
Recursive filter: y[n] = 0.5y[n − 1] + 0.5x[n]
An important property of non-recursive filters is, that they will always be stable. This is not always the case for recursive filters.
Recursion |
https://en.wikipedia.org/wiki/NEC%20HYDRAstor | NEC HYDRAstor is a disk-based grid storage system with data deduplication for backups and archiving, developed by NEC Corporation. A HYDRAstor storage system can be composed of multiple nodes, starting from one up to 100+ nodes. Each node contains standard hardware including disk drives, CPU, memory and network interfaces and is integrated with the HYDRAstor software into a single storage pool. HYDRAstor software incorporates multiple features of distributed storage systems: content-addressable storage, global data deduplication, variable block size, Rabin fingerprinting, erasure codes, data encryption and load balancing.
History
HYDRAstor project was started in 2002 by Cezary Dubnicki and Cristian Ungureanu in NEC Research in Princeton, NJ. Prototype version was implemented and evaluated in 2004. After another 3 years of development, first version of HYDRAstor was brought to the market in US and Japan. Subsequent version with improved software and hardware were released in following years, with latest version, HS8-5000, providing 72TB raw storage per node, up to 11.88PB of raw capacity in its maximum configuration.
Main features
HYDRAstor can be scaled from single node to 165 nodes in a multi-rack grid appliance. Capacity and bandwidth can be scaled independently by using different types of nodes:
storage nodes – adding capacity
hybrid nodes – adding both capacity and performance
HYDRAstor supports online expansion, with automatic data migration and with no downtime. In standard configuration, HYDRAstor provides resiliency to up to 3 concurrent disk or node failures. Failures are automatically detected and data reconstruction is automatically performed, which means that if time between failures is enough to reconstruct data, system can withstand any number of them.
References
Backup software
Backup |
https://en.wikipedia.org/wiki/List%20of%20amateur%20radio%20repeater%20sites | This is a list of repeater sites for amateur radio in Germany.
It includes towers (e.g. CN Tower and Bremen TV tower), hills, mountains and other locations.
List
See also
Deutscher Amateur-Radio-Club
References
Amateur radio
Repeater sites
Broadcast transmitters
Radio in Germany |
https://en.wikipedia.org/wiki/Continuous%20or%20discrete%20variable | In mathematics and statistics, a quantitative variable may be continuous or discrete if they are typically obtained by measuring or counting, respectively. If it can take on two particular real values such that it can also take on all real values between them (even values that are arbitrarily close together), the variable is continuous in that interval. If it can take on a value such that there is a non-infinitesimal gap on each side of it containing no values that the variable can take on, then it is discrete around that value. In some contexts a variable can be discrete in some ranges of the number line and continuous in others.
Continuous variable
A continuous variable is a variable whose value is obtained by measuring, i.e., one which can take on an uncountable set of values.
For example, a variable over a non-empty range of the real numbers is continuous, if it can take on any value in that range. The reason is that any range of real numbers between and with is uncountable.
Methods of calculus are often used in problems in which the variables are continuous, for example in continuous optimization problems.
In statistical theory, the probability distributions of continuous variables can be expressed in terms of probability density functions.
In continuous-time dynamics, the variable time is treated as continuous, and the equation describing the evolution of some variable over time is a differential equation. The instantaneous rate of change is a well-defined concept.
Discrete variable
In contrast, a variable is a discrete variable if and only if there exists a one-to-one correspondence between this variable and , the set of natural numbers. In other words; a discrete variable over a particular interval of real values is one for which, for any value in the range that the variable is permitted to take on, there is a positive minimum distance to the nearest other permissible value. The number of permitted values is either finite or countably infinite. |
https://en.wikipedia.org/wiki/Tanpopo%20mission | The Tanpopo mission is an orbital astrobiology experiment investigating the potential interplanetary transfer of life, organic compounds, and possible terrestrial particles in the low Earth orbit. The purpose is to assess the panspermia hypothesis and the possibility of natural interplanetary transport of microbial life as well as prebiotic organic compounds.
The collection and exposure phase took place from May 2015 through February 2018 utilizing the Exposed Facility located on the exterior of Kibo, the Japanese Experimental Module of the International Space Station. The mission, designed and performed by Japan, used ultra-low density silica gel (aerogel) to collect cosmic dust by, which is being analyzed for amino acid-related compounds and microorganisms following their return to Earth. The last samples were retrieved in February 2018 and analyses are ongoing. The principal investigator is Akihiko Yamagishi, who heads a team of researchers from 26 universities and institutions in Japan, including JAXA.
Mission
The capture and exposure experiments in the Tanpopo mission were designed to confirm the hypothesis that extraterrestrial organic compounds played important roles in the generation of the first terrestrial life, as well as examination of the hypothesis of panspermia. If the Tanpopo mission can detect microbes at the higher altitude of low Earth orbit (400 km), it will support the possible interplanetary migration of terrestrial life. The mission was named after the plant dandelion (Tanpopo) because the plant's seeds evoke the image of seeds of lifeforms spreading out through space.
The Tanpopo mission exposures took place at the Exposed Facility located on the exterior of the Kibo module of the ISS from May 2015 through February 2018. It collected cosmic dust and exposed dehydrated microorganisms outside the International Space Station while orbiting above the Earth. These experiments will test some aspects of panspermia, a hypothesis for an exogenesi |
https://en.wikipedia.org/wiki/Dinosaur%20erotica | Dinosaur erotica, part of the larger genre of monster erotica, is a subgenre of erotic literature that involves sexual encounters between humans and non-avian dinosaurs. Works include titles such as Taken by the T-Rex, Ravished by Triceratops and A Billionaire Dinosaur Forced Me Gay. Despite being called by some in the media "the Kardashian of erotica," the genre's titles have generated sales and media interest.
Themes
Works of dinosaur erotica tend to be self-published short stories and often focus on common themes such as prehistoric female hunters who save their tribes from threatening (male) dinosaurs by having sex with them. According to Professor Clarissa Smith of the University of Sunderland, who co-edits the journal Porn Studies, dinosaur erotica is essentially an appeal to sexual fantasies: "The idea of having sex with [a dinosaur] is outside the realms of possibility. It's a bit like 'magic', where all rules become suspended, and for that reason it may well allow ... for kinds of imaginative risk-taking impossible in more standard couplings."
Authors and works
Noted authors of dinosaur erotica include Christie Sims, Alara Branwen, Pippa Pout, Chuck Tingle and Hunter Fox (all pseudonyms). The genre was pioneered by Sims and Branwen, who were at Texas A&M University together when they came up with the idea. Sims' author biography claims that "while my outward tastes are relatively simple, my inner thoughts are filled with lusty thoughts of big, strong, powerful monsters having their way with beautiful maidens".
Her co-author Alara Branwen describes their source of inspiration in rather more mundane terms. She was working in a supermarket to help pay her bills when a co-worker mentioned how people were publishing fiction online and suggested that she should try writing erotica. After researching what sold well, she decided to experiment with the subgenre of monster erotica. Her first story, Doing the Dragon (involving a dragon having sex with a human girl |
https://en.wikipedia.org/wiki/History%20of%20Modern%20Biomedicine%20Research%20Group | The History of Modern Biomedicine Research Group (HoMBRG) is an academic organisation specialising in recording and publishing the oral history of twentieth and twenty-first century biomedicine. It was established in 1990 as the Wellcome Trust's History of Twentieth Century Medicine Group, and reconstituted in October 2010 as part of the School of History at Queen Mary University of London.
History
The project originated as The Wellcome Trust's History of Twentieth Century Medicine Group, and later functioned as the Academic Unit of the Wellcome Institute for the History of Medicine. It was originally established at the Royal College of Physicians in 1990 and comprised Sir Christopher Booth (the Harveian Librarian) and Professor Tilli Tansey. Its purpose was to devise ways of stimulating historians, scientists & clinicians to discuss, preserve and write the history of recent biomedicine. The Group's activities were originally overseen by a Programme Committee, which included professional historians of medicine, practising scientists and clinicians. From 2000 to 2010 it was a constituent part of the Wellcome Trust Centre for the History of Medicine at University College London. In October 2010 it moved to the School of History, Queen Mary's University, London. In 2011 the Group received a Strategic Award from the Wellcome Trust to embark upon a new project, "Makers of Modern Biomedicine".
Outputs
An archive of oral and written history, plus videoed interviews, has been compiled by the HoMBRG and consists of three projects: Witness Seminars, Today's Neuroscience, Tomorrow's History and SAD at 30. All material and documentation related to the project is deposited with the Wellcome Library. The resultant publications are open access, and made freely available online via the HoMBRG website, a partnership with the Medical Heritage Library, and iTunes.
The topics covered by the archive fall broadly into five themes: clinical genetics, neuroscience, global health |
https://en.wikipedia.org/wiki/Emolument.com | Emolument is a crowdsourced salary comparison website created in 2012 by Thomas Drewry, Olivier Beau de Loménie and Alice Leguay. It allows its contributors to compare their salary to aggregated entries of other Emolument users, in order to help them negotiate a salary raise, evaluate an offer of employment or change locations.
As of September 2017, Emolument.com had gathered 130,000 entries, each of them automatically and manually verified in order to preserve the accuracy of the data, according to the website.
While Emolument.com is opened to all industries, it is mostly used by Finance, Consultancy and Tech professionals and therefore is often used as a source by newspapers for studies on Banks, Tech firms, or Consultancy companies.
Emolument.com also regularly publishes league tables of best paying universities.
In July 2015, Emolument announced it had raised £1.4 million in funding from 10 angel investors, enabling it to pursue an aggressive user acquisition strategy targeted at financial, technology and professional services globally to further establish Emolument.com, as the leading user-generated remuneration data platform in these sectors.
References
External links
Emolument Website
Online databases
Companies based in the City of Westminster
British companies established in 2012 |
https://en.wikipedia.org/wiki/Cortical%20modem | A cortical modem is a type of brain machine interface that specifically injects images directly into the visual cortex by way of a direct neural interface (DNI) chip. The true breakthrough goal lies in the information transfer speed. Both computers and the human brain can transfer information at incredible speeds, and the real bottleneck in the field of brain-computer interaction is the lack of data transfer speeds between the two.
See also
Windows Holographic
Transhumanist
References
Human–computer interaction
User interface techniques
Virtual reality
DARPA projects |
https://en.wikipedia.org/wiki/Cross-buy | Cross-buy is a feature of some digital distribution systems available across multiple device platforms, where users who purchase a license to a specific piece of software are able to use the versions of the software for different device classes at no additional charge.
The term is associated mainly with digital distribution in video games, where cross-buy can span between a video game console and handheld game console, or between a console and a personal computer.
Examples
Sony Interactive Entertainment introduced cross-buy on PlayStation gaming platforms in August 2012: users who purchased select PlayStation 3 titles would be able to obtain ports for the portable PlayStation Vita console at no additional charge. The initiative was later extended to include PlayStation 4 and PlayStation 5.
Microsoft unveiled a similar scheme Xbox Play Anywhere in 2016, which is applicable to digital purchases of games on Microsoft Store across Windows 10, Xbox One, and Xbox Series X/S attached to the same account. This also includes synchronization of content, such as saves and achievements between all platforms. This arrangement is primarily used on first-party titles, but Resident Evil 7: Biohazard became the first third-party title to support Play Anywhere.
Oculus has a similar concept of cross-buy for Virtual Reality (VR) experiences bought on the Oculus PC VR platform for the Rift and Rift S headsets. PC VR Experiences which have subsequently appeared for the mobile virtual reality headsets Quest and Quest 2 can be made available to Quest/Quest 2 consumers without having to be bought a second time; however, the decision to support cross-buy lies with the game developers.
See also
Digital Copy, a similar concept for films.
References
Online content distribution |
https://en.wikipedia.org/wiki/Lastline | Lastline, Inc. is an American cyber security company and breach detection platform provider based in Redwood City, California. The company offers network-based security breach detection and other security services that combat malware used by advanced persistent threat (APT) groups for businesses, government organizations and other security service providers. Lastline has offices in North America, Europe, and Asia.
History
Lastline was founded in 2011 by University of California, Santa Barbara and Northeastern University researchers Engin Kirda, Christopher Kruegel and Giovanni Vigna. In 2014, WatchGuard Technologies, Inc. joined the Lastline Defense Program to combat advanced malware targeting businesses by providing primary functionality for APT blocking, available on their unified threat management (UTM) and next generation firewall (NGFW) products. WatchGuard utilizes Lastline's next generation cloud-based sandbox, powered by full-system emulation, which inspects objects for unknown malware crafted to evade detection.
Lastline was featured at the 2014 RSA Conference in San Francisco. That same year, Giovanni Vigna, CTO at Lastline, appeared at the Cyber Security Expo in a keynote presentation that analyzed evasive malware techniques.
Juniper Networks began integrating with Lastline to expand the capability of its Spotlight Secure platform in 2014. In February 2015, Lastline announced a partnership and technology integration with Carbon Black in an effort to facilitate automated and comprehensive end-to-end endpoint and network security for email, web, files and mobile applications.
Funding
In 2013, Lastline raised $10 million in funding led by venture capital firms Redpoint Ventures and E.ventures, now known as Headline Redpoint Ventures led the Series B round with a $9 million investment, while existing investor E.ventures provided the remainder.
In 2014, Lastline raised $10 million from new investors Dell Ventures and Presidio Ventures, as well as existin |
https://en.wikipedia.org/wiki/Donald%20A.%20S.%20Fraser | Donald Alexander Stuart Fraser (April 29, 1925–December 21, 2020) was a Canadian statistician, and Professor Emeritus at the University of Toronto. In 2012 he was appointed an Officer of the Order of Canada for his influence in the advancement of the statistical sciences in Canada. In 1961 he was elected as a Fellow of the American Statistical Association. In 1985, he was awarded the first Gold Medal of the Statistical Society of Canada. In 2014 he was chosen as a fellow of the American Mathematical Society "for contributions to the theory and foundations of statistics, as well as for leadership and influence on the advancement of the statistical sciences."
Early life
Donald Fraser was born in Toronto, and raised in Stratford, Ontario. He attended St. Andrew's College in Aurora from 1939 to 1942, and the University of Toronto from 1942 to 1947, completing a bachelor's degree in mathematics, physics and chemistry. While at the University of Toronto he distinguished himself in the sciences, and especially in mathematics. He was a member of the first place team and a Putnam fellow in the William Lowell Putnam Mathematical Competition in 1946.
References
External links
Personal webpage at the University of Toronto
Official webpage at the Department of Statistics, University of Toronto
1925 births
2020 deaths
Canadian statisticians
Fellows of the American Mathematical Society
Fellows of the American Statistical Association
Putnam Fellows
Academic staff of the University of Toronto
University of Toronto alumni
Mathematical statisticians
Princeton University alumni |
https://en.wikipedia.org/wiki/Weyl%27s%20tile%20argument | In philosophy, Weyl's tile argument, introduced by Hermann Weyl in 1949, is an argument against the notion that physical space is "discrete", as if composed of a number of finite sized units or tiles. The argument purports to show a distance function approximating Pythagoras' theorem on a discrete space cannot be defined and, since the Pythagorean theorem has been confirmed to be approximately true in nature, physical space is not discrete. Academic debate on the topic continues, with counterarguments proposed in the literature.
The argument
The tile argument appears in Weyl's 1949 book Philosophy of Mathematics and Natural Sciences, where he writes:
A demonstration of Weyl's argument proceeds by constructing a square tiling of the plane representing a discrete space. A discretized triangle, units tall and units long, can be constructed on the tiling. The hypotenuse of the resulting triangle will be tiles long. However, by the Pythagorean theorem, a corresponding triangle in a continuous space—a triangle whose height and length are —will have a hypotenuse measuring units long. To show that the former result does not converge to the latter for arbitrary values of , one can examine the percent difference between the two results: Since cancels out, the two results never converge, even in the limit of large . The argument can be constructed for more general triangles, but, in each case, the result is the same. Thus, a discrete space does not even approximate the Pythagorean theorem.
Responses
In response, Kris McDaniel has argued the Weyl tile argument depends on accepting a "size thesis" which posits that the distance between two points is given by the number of tiles between the two points. However, as McDaniel points out, the size thesis is not accepted for continuous spaces. Thus, we might have reason not to accept the size thesis for discrete spaces.
See also
Digital physics
Discrete calculus
Taxicab metric
Causal sets
Poisson point process
Natura |
https://en.wikipedia.org/wiki/Snatcher%20%28video%20game%29 | Snatcher is a cyberpunk graphic adventure game developed and published by Konami. It was written and designed by Hideo Kojima and first released in 1988 for the PC-8801 and MSX2 in Japan. Snatcher is set in a future East Asian metropolis where humanoid robots dubbed "Snatchers" have been discovered killing humans and replacing them in society. The game follows Gillian Seed, an amnesiac who joins an anti-Snatcher agency in search of his past. Gameplay takes place primarily through a menu-based interface through which the player can choose to examine items, search rooms, speak to characters, explore a semi-open world, and perform other actions.
Kojima wanted Snatcher to have a cinematic feel, so the setting and story are heavily influenced by science fiction films, like Blade Runner, Akira, The Terminator, and Invasion of the Body Snatchers. Development on the PC versions took more than twice as long as the average game of the time, even after Kojima was asked to trim more than half his initial story. The game was released to positive reviews, but poor sales. It garnered a cult following, and was remade as a role-playing game called SD Snatcher for the MSX2 in 1990. This was followed by a remake of the original adventure game using CD-ROM technology, released for the PC Engine Super CD-ROM² System in 1992.
Looking to provide a more interactive experience to gamers in the West, Konami developed a Sega CD version of Snatcher specifically for North America and Europe in 1994. Although it was a commercial failure, the Sega CD version received mostly positive reviews for its cinematic presentation and mature themes uncommon in games at the time. Snatcher has been retrospectively acclaimed as both one of the best adventure and cyberpunk games of all time, and identified as a foundation for the themes Kojima explored later in the Metal Gear series. The game was a significant inspiration on Goichi Suda, who worked with Kojima to produce a radio drama prequel, Sdatcher. Snat |
https://en.wikipedia.org/wiki/Gudkov%27s%20conjecture | In real algebraic geometry, Gudkov's conjecture, also called Gudkov’s congruence, (named after Dmitry Gudkov) was a conjecture, and is now a theorem, which states that an M-curve of even degree obeys the congruence
where is the number of positive ovals and the number of negative ovals of the M-curve. (Here, the term M-curve stands for "maximal curve"; it means a smooth algebraic curve over the reals whose genus is , where is the number of maximal components of the curve.)
The theorem was proved by the combined works of Vladimir Arnold and Vladimir Rokhlin.
See also
Hilbert's sixteenth problem
Tropical geometry
References
Conjectures that have been proved
Theorems in algebraic geometry
Real algebraic geometry |
https://en.wikipedia.org/wiki/Almgren%E2%80%93Pitts%20min-max%20theory | In mathematics, the Almgren–Pitts min-max theory (named after Frederick J. Almgren, Jr. and his student Jon T. Pitts) is an analogue of Morse theory for hypersurfaces.
The theory started with the efforts for generalizing George David Birkhoff's method for the construction of simple closed geodesics on the sphere, to allow the construction of embedded minimal surfaces in arbitrary 3-manifolds.
It has played roles in the solutions to a number of conjectures in geometry and topology found by Almgren and Pitts themselves and also by other mathematicians, such as Mikhail Gromov, Richard Schoen, Shing-Tung Yau, Fernando Codá Marques, André Neves, Ian Agol, among others.
Description and basic concepts
The theory allows the construction of embedded minimal hypersurfaces through variational methods.
In his PhD thesis Almgren proved that the m-th homotopy group of the space of flat k-dimensional cycles on a closed Riemannian manifold is isomorphic to the (m+k)-th dimensional homology group of M. This result is a generalization of the Dold–Thom theorem, which can be thought of as the k=0 case of Almgren's theorem. Existence of non-trivial homotopy classes in the space of cycles suggests the possibility of constructing minimal submanifolds as saddle points of the volume function, like in the Morse theory. In his subsequent work Almgren used these ideas to prove that for every k=1,...,n-1 a closed n-dimensional Riemannian manifold contains a stationary integral k-dimensional varifold, a generalization of minimal submanifold that may have singularities. Allard showed that such generalized minimal submanifolds are regular on an open and dense subset.
In the 1980s Almgren's student Jon Pitts was able to greatly improve the regularity theory of minimal submanifolds obtained by Almgren in the case of codimension 1. He showed that when the dimension n of the manifold is between 3 and 6 the minimal hypersurface obtained using Almgren's min-max method is smooth. A key new idea in |
https://en.wikipedia.org/wiki/Sonic%20Pi | Sonic Pi is a live coding environment based on Ruby, originally designed to support both computing and music lessons in schools, developed by Sam Aaron in the University of Cambridge Computer Laboratory in collaboration with Raspberry Pi Foundation.
Uses
Thanks to its use of the SuperCollider synthesis engine and accurate timing model, it is also used for live coding and other forms of algorithmic music performance and production, including at algoraves. Its research and development has been supported by Nesta, via the Sonic PI: Live & Coding project.
See also
Pure Data
Algorithmic composition
List of MIDI editors and sequencers
List of music software
Further reading
References
External links
Digital art
Computer programming
Live coding
Algorave
Free music software
Electronic music software
Free audio software
Free software programmed in Ruby
Audio programming languages
Software synthesizers
Raspberry Pi
University of Cambridge Computer Laboratory |
https://en.wikipedia.org/wiki/Alexandra%20Cardenas | Alexandra Cardenas (born 1976) is a Colombian composer and improviser now based in Berlin, who has followed a path from Western classical composition to improvisation and live electronics. Her recent work has included live coding performance, including performances at the forefront of the Algorave scene, she also co-organised a live coding community in Mexico City. At the 2014 Kurukshetra Festival Cardenas was a keynote speaker and hosted a music live coding workshop, the first of its kind in India. Cardenas has been invited to talk about and perform live coding at events such as the Berlin based Transmediale festival and the Ableton sponsored Loop symposium, and held residencies including at Tokyo Wonder Site in Japan and Centre for the Arts in Mexico City.
She has been featured in videos by governmental broadcast agencies..
References
External links
http://cargocollective.com/tiemposdelruido - official webpage
Live coding
1976 births
Living people
Algorave |
https://en.wikipedia.org/wiki/Coagulation%20%28water%20treatment%29 | In water treatment, coagulation and flocculation involve the addition of compounds that promote the clumping of fine floc into larger floc so that they can be more easily separated from the water. Coagulation is a chemical process that involves neutralization of charge whereas flocculation is a physical process and does not involve neutralization of charge. The coagulation-flocculation process can be used as a preliminary or intermediary step between other water or wastewater treatment processes like filtration and sedimentation. Iron and aluminium salts are the most widely used coagulants but salts of other metals such as titanium and zirconium have been found to be highly effective as well.
Factors
Coagulation is affected by the type of coagulant used, its dose and mass; pH and initial turbidity of the water that is being treated; and properties of the pollutants present. The effectiveness of the coagulation process is also affected by pretreatments like oxidation.
Mechanism
In a colloidal suspension, particles will settle very slowly or not at all because the colloidal particles carry surface electrical charges that mutually repel each other. This surface charge is most commonly evaluated in terms of zeta potential, the electrical potential at the slipping plane. To induce coagulation, a coagulant (typically a metallic salt) with the opposite charge is added to the water to overcome the repulsive charge and "destabilize" the suspension. For example, the colloidal particles are negatively charged and alum is added as a coagulant to create positively charged ions. Once the repulsive charges have been neutralized (since opposite charges attract), van der Waals force will cause the particles to cling together (agglomerate) and form micro floc.
Determining coagulant dose
Jar test
The dose of the coagulant to be used can be determined via the jar test. The jar test involves exposing same volume samples of the water to be treated to different doses of the coagul |
https://en.wikipedia.org/wiki/Git-annex | git-annex is a distributed file synchronization system written in Haskell. It aims to solve the problem of sharing and synchronizing collections of large files independent from a commercial service or even a central server.
History
The development of git-annex began in 2010. In 2012-13 the development was funded through a Kickstarter campaign. The main development of this campaign was the git-annex assistant, a component that runs in the background to automate the synchronization of repositories.
The next crowd funding campaign for 2013-14 was organized over a self-hosted platform.
Design
git-annex uses Git to index files but does not store them in the Git history. Instead, a symbolic link representing and linking to the probably large file is committed. git-annex manages a content-addressable storage for the files under its control. A separate Git branch logs the location of every file. Thus users can clone a git-annex repository and then decide for every file whether to make it locally available.
Availability
git-annex packages are available for a variety of operating systems, including:
Debian
Ubuntu
Fedora
FreeBSD
Arch Linux
NixOS
Guix
Gentoo
OpenBSD
Android
macOS (via Homebrew)
Windows
References
External links
2010 software
Free version control software
Free software programmed in Haskell
Self-hosting software
Distributed version control systems
Git (software) |
https://en.wikipedia.org/wiki/Power%2C%20root-power%2C%20and%20field%20quantities | A power quantity is a power or a quantity directly proportional to power, e.g., energy density, acoustic intensity, and luminous intensity. Energy quantities may also be labelled as power quantities in this context.
A root-power quantity is a quantity such as voltage, current, sound pressure, electric field strength, speed, or charge density, the square of which, in linear systems, is proportional to power. The term root-power quantity refers to the square root that relates these quantities to power. The term was introduced in ; it replaces and deprecates the term field quantity.
Implications
It is essential to know which category a measurement belongs to when using decibels (dB) for comparing the levels of such quantities. A change of one bel in the level corresponds to a 10× change in power, so when comparing power quantities x and y, the difference is defined to be 10×log10(y/x) decibel. With root-power quantities, however the difference is defined as 20×log10(y/x) dB.
In the analysis of signals and systems using sinusoids, field quantities and root-power quantities may be complex-valued, as in the propagation constant.
"Root-power quantity" vs. "field quantity"
In justifying the deprecation of the term "field quantity" and instead using "root-power quantity" in the context of levels, ISO 80000 draws attention to the conflicting use of the former term to mean a quantity that depends on the position, which in physics is called a field. Such a field is often called a field quantity in the literature, but is called a field here for clarity. Several types of field (such as the electromagnetic field) meet the definition of a root-power quantity, whereas others (such as the Poynting vector and temperature) do not. Conversely, not every root-power quantity is a field (such as the voltage on a loudspeaker).
See also
Level (logarithmic quantity)
Fresnel reflection field and power equations
Sound level, defined for each of several quantities associated with |
https://en.wikipedia.org/wiki/G-spectrum | In algebraic topology, a G-spectrum is a spectrum with an action of a (finite) group.
Let X be a spectrum with an action of a finite group G. The important notion is that of the homotopy fixed point set . There is always
a map from the fixed point spectrum to a homotopy fixed point spectrum (because, by definition, is the mapping spectrum .)
Example: acts on the complex K-theory KU by taking the conjugate bundle of a complex vector bundle. Then , the real K-theory.
The cofiber of is called the Tate spectrum of X.
G-Galois extension in the sense of Rognes
This notion is due to J. Rognes . Let A be an E∞-ring with an action of a finite group G and B = AhG its invariant subring. Then B → A (the map of B-algebras in E∞-sense) is said to be a G-Galois extension if the natural map
(which generalizes in the classical setup) is an equivalence. The extension is faithful if the Bousfield classes of A, B over B are equivalent.
Example: KO → KU is a ./2-Galois extension.
See also
Segal conjecture
References
External links
Algebraic topology
Homotopy theory |
https://en.wikipedia.org/wiki/Bitmovin | Bitmovin is a multimedia technology company which provides services that transcode digital video and audio to streaming formats using cloud computing, and streaming media players. Founded in 2013, the Austrian company contributes to MPEG-DASH, an open standard that allows streaming video to be played in HTML5 video and Flash players.
History
Bitmovin was founded in 2013 after research and standardization in the area of MPEG-DASH at the University of Klagenfurt. In 2014 the company secured an investment round with the venture capital fond Speedinvest and Constantia Industries. In 2014, the company was part of the top 100 companies in online media. Bitmovin is the author of the MPEG-DASH reference software libdash and contributes to the standardization at MPEG, DASH-IF, IETF, etc.
In 2015, Bitmovin participated in the YCombinator program.
Products
The company provides the cloud-based transcoding service bitcodin, which increases the efficiency of transcoding by using Cloud computing, and also enables transcoding of ultra-high definition video.
The company also created the HTML5 and Flash-based Web player bitdash which can be used in Web Browsers on desktop computers and smartphones. This player supports the streaming and playback of MPEG-DASH or Apple's HTTP Live Streaming, using either the HTML5 Media Source Extensions or Flash, depending on the platform. DRM is enabled through the usage of the HTML5 Encrypted Media Extensions as well as Flash. It is compatible to tools such as x264 or MP4Box.
Usage
Live or on-demand transcoding of video or audio streaming to HLS, progressive and DASH
Web-based players for streaming for HLS, progressive and DASH content in HTML5 or Flash
Streaming of DRM protected content in HTML5
References
Streaming software
Streaming media systems
Media servers
Internet properties established in 2013 |
https://en.wikipedia.org/wiki/Privacy%20engineering | Privacy engineering is an emerging field of engineering which aims to provide methodologies, tools, and techniques to ensure systems provide acceptable levels of privacy.
In the US, an acceptable level of privacy is defined in terms of compliance to the functional and non-functional requirements set out through a privacy policy, which is a contractual artifact displaying the data controlling entities compliance to legislation such as Fair Information Practices, health record security regulation and other privacy laws. In the EU, however, the General Data Protection Regulation (GDPR) sets the requirements that need to be fulfilled. In the rest of the world, the requirements change depending on local implementations of privacy and data protection laws.
Definition and scope
The definition of privacy engineering given by National Institute of Standards and Technology (NIST) is:
While privacy has been developing as a legal domain, privacy engineering has only really come to the fore in recent years as the necessity of implementing said privacy laws in information systems has become a definite requirement to the deployment of such information systems. For example, IPEN outlines their position in this respect as:
Privacy engineering involves aspects such as process management, security, ontology and software engineering. The actual application of these derives from necessary legal compliances, privacy policies and 'manifestos' such as Privacy-by-Design.
Towards the more implementation levels, privacy engineering employs privacy enhancing technologies to enable anonymisation and de-identification of data. Privacy engineering requires suitable security engineering practices to be deployed, and some privacy aspects can be implemented using security techniques. A privacy impact assessment is another tool within this context and its use does not imply that privacy engineering is being practiced.
One area of concern is the proper definition and application of terms such |
https://en.wikipedia.org/wiki/Extempore%20%28software%29 | Extempore is a live coding environment focused on real-time audiovisual software development. It is designed to accommodate the demands of cyber-physical computing. Extempore consists of two integrated languages, Scheme (with extensions) and Extempore Language. It uses the LLVM cross-language compiler to achieve performant digital signal processing and related low-level features, on-the-fly.
Relationship to Impromptu
Extempore shares the use of Scheme syntax, real-time audiovisual emphasis and lead developer Andrew Sorensen with the older and related project Impromptu.
It runs under both Linux and Mac OS X. The bindings to Apple libraries are absent, but the environment can interface with dynamic libraries.
References
External links
Digital art
Computer programming
Dynamically typed programming languages
Audio programming languages
Music software plugin architectures
Free music software
Electronic music software
Free audio software
Software synthesizers
MacOS multimedia software
Multimedia software for Linux
2011 software
Array programming languages
Live coding
Algorave |
https://en.wikipedia.org/wiki/Descent%20along%20torsors | In mathematics, given a G-torsor X → Y and a stack F, the descent along torsors says there is a canonical equivalence between F(Y), the category of Y-points and F(X)G, the category of G-equivariant X-points. It is a basic example of descent, since it says the "equivariant data" (which is an additional data) allows one to "descend" from X to Y.
When G is the Galois group of a finite Galois extension L/K, for the G-torsor , this generalizes classical Galois descent (cf. field of definition).
For example, one can take F to be the stack of quasi-coherent sheaves (in an appropriate topology). Then F(X)G consists of equivariant sheaves on X; thus, the descent in this case says that to give an equivariant sheaf on X is to give a sheaf on the quotient X/G.
Notes
References
External links
Stack of Tannakian categories? Galois descent?
Algebraic geometry
Topology |
https://en.wikipedia.org/wiki/RingID | ringID is a proprietary social networking platform designed and developed by Ring Inc. located in Montreal, Quebec, Canada. ringID allows users to communicate for free using their individual ID globally over the internet. It was initially released in July 2015.
It has been called a Ponzi scheme and criticized for not allowing users to cash out. In September 2021, an embezzlement case was filed in Bangladesh against 25 people, including two founders of the company. One founder was arrested for embezzling funds.
History
ringID was initially released in July 2015 by Ring Inc.,
with video calling features added in 2016. More features were added with the goal of providing a single platform to cater to all social networking needs.
Features
ringID was conceptualized as an all-in-one social networking platform. The platform can be used for live broadcasting, voice and video calls, messaging, and content sharing.
Users can delete messages from both their device and the receiver's. They can also send instant messages to recipients which are deleted automatically once the predefined time is over.
Criticism and complaints
The Business Standard has accused RingID of being a Ponzi scheme because it pays users for bringing in more users and for watching advertisements. In September 2021, The Business Standard reported that users were not able to cash out, which it characterized as embezzlement. In total 21.2 million taka were allegedly embezzled. A case was filed against 25 people, including RingID owners, under the Digital Security Act and the Multi-Level Marketing Control Act.
Two company founders were arrested in December 2016 in connection with an unpaid fees case filed by the Bangladesh Telecommunication Regulatory Commission. The two moved to Canada while out on bail.
In October 2021, one founder was remanded in jail by a Dhaka Metropolitan Magistrate, after his arrest on charges of misappropriating Tk200 crore in three months by luring people to ringID's investment |
https://en.wikipedia.org/wiki/Bousfield%20class | In algebraic topology, the Bousfield class of, say, a spectrum X is the set of all (say) spectra Y whose smash product with X is zero: . Two objects are Bousfield equivalent if their Bousfield classes are the same.
The notion applies to module spectra and in that case one usually qualifies a ring spectrum over which the smash product is taken.
See also
Bousfield localization
External links
Ncatlab.org
References
Topology |
https://en.wikipedia.org/wiki/Faithfully%20flat%20descent | Faithfully flat descent is a technique from algebraic geometry, allowing one to draw conclusions about objects on the target of a faithfully flat morphism. Such morphisms, that are flat and surjective, are common, one example coming from an open cover.
In practice, from an affine point of view, this technique allows one to prove some statement about a ring or scheme after faithfully flat base change.
"Vanilla" faithfully flat descent is generally false; instead, faithfully flat descent is valid under some finiteness conditions (e.g., quasi-compact or locally of finite presentation).
A faithfully flat descent is a special case of Beck's monadicity theorem.
Idea
Given a faithfully flat ring homomorphism , the faithfully flat descent is, roughy, the statement that to give a module or an algebra over A is to give a module or an algebra over together with the so-called descent datum (or data). That is to say one can descend the objects (or even statements) on to provided some additional data.
For example, given some elements generating the unit ideal of A, is faithfully flat over . Geometrically, is an open cover of and so descending a module from to would mean gluing modules on to get a module on A; the descend datum in this case amounts to the gluing data; i.e., how are identified on overlaps .
Affine case
Let be a faithfully flat ring homomorphism. Given an -module , we get the -module and because is faithfully flat, we have the inclusion . Moreover, we have the isomorphism of -modules that is induced by the isomorphism and that satisfies the cocycle condition:
where are given as:
with . Note the isomorphisms are determined only by and do not involve
Now, the most basic form of faithfully flat descent says that the above construction can be reversed; i.e., given a -module and a -module isomorphism such that , an invariant submodule:
is such that .
Here is the precise definition of descent datum. Given a ring homomorphism , we writ |
https://en.wikipedia.org/wiki/YaDICs | YaDICs is a program written to perform digital image correlation on 2D and 3D tomographic images. The program was designed to be both modular, by its plugin strategy and efficient, by it multithreading strategy. It incorporates different transformations (Global, Elastic, Local), optimizing strategy (Gauss-Newton, Steepest descent), Global and/or local shape functions (Rigid-body motions, homogeneous dilatations, flexural and Brazilian test models)...
Theoretical background
Context
In solid mechanics, digital image correlation is a tool that allows to identify the displacement field to register a reference image (called herein fixed image) to images during an experiment (mobile image). For example, it is possible to observe the face of a specimen with a painted speckle on it in order to determine its displacement fields during a tensile test. Before the appearance of such methods, researchers usually used strain gauges to measure the mechanical state of the material but strain gauges only measure the strain on a point and don't allow to understand material with an heterogeneous behavior. One can obtain a full in plane strain tensor by derivation of the displacement fields. Many methods are based upon the optical flow.
In fluid mechanics a similar method is used, called Particle Image Velocimetry (PIV); the algorithms are similar to those of DIC but it is impossible to ensure that the optical flow is conserved so a vast majority of the software used the normalized cross correlation metric.
In mechanics the displacement or velocity fields are the only concern, registering images is just a side effect. There is another process called image registration using the same algorithms (on monomodal images) but where the goal is to register images and thereby identifying the displacement field is just a side effect.
YaDICs uses the general principle of image registration with a particular attention to the displacement fields basis.
Image registration principle
YaDICs ca |
https://en.wikipedia.org/wiki/Djairo%20Guedes%20de%20Figueiredo | Djairo Guedes de Figueiredo (academic signature: D. G. De Figueiredo, born on 2 April 1934, in Limoeiro do Norte) is a Brazilian mathematician noted for his researches on differential equations, elliptic operators, and calculus of variations. He is considered the greatest analyst from Brazil. He was the president of the Brazilian Mathematical Society from 1977 to 1979.
Figueiredo is a well-known figure among mathematicians in analysis and differential equations and among Brazilian students in physics, engineering and mathematics. He has received many Brazilian national and international prizes, both for his research in pure mathematics and also for his popular mathematics textbooks (about analysis and differential equations) and expository writing papers. In 1995 he received the National Order of Scientific Merit and in 2004 the title of "Doctor Honoris Causa" from the Federal University of Paraíba. In 2009 he became a member of the National Academy of Science of Buenos Aires. In 2011 he became the first Brazilian to receive a gold medal from the Telesio-Galilei Academy of Sciences from Great Britain "
for his great contribution to Mathematics, especially to the theory of elliptical partial differential equations".
He was a Ph.D. student of Louis Nirenberg at New York University, and is currently a titular professor at UNICAMP, a position he earned in 1989.
He is a recipient of Brazil's National Order of Scientific Merit in mathematics (1995). Since 1969 he has been a member of the Brazilian Academy of Sciences.
Selected papers
D. G. de Figueiredo, P. L. Lions, R. D. Nussbaum. "A priori estimates and existence of positive solutions of semilinear elliptic equations", Journal de Mathématiques Pures et Appliquées, 61, 1982, pp. 41–63.
D. G. de Figueiredo, P. L. Felmer . "On superquadratic elliptic systems", Transactions of the American Mathematical Society, v. 343, n. 1, 1994, pp. 99–116.
P. Clément, D. G. de Figueiredo . "Positive solutions of semilinear elliptic |
https://en.wikipedia.org/wiki/Jonesia | Jonesia is a genus of Actinomycetota.
References
Micrococcales
Soil biology
Bacteria genera |
https://en.wikipedia.org/wiki/Radeon%20400%20series | The Radeon 400 series is a series of graphics processors developed by AMD. These cards were the first to feature the Polaris GPUs, using the new 14 nm FinFET manufacturing process, developed by Samsung Electronics and licensed to GlobalFoundries. The Polaris family initially included two new chips in the Graphics Core Next (GCN) family (Polaris 11 and Polaris 12). Polaris implements the 4th generation of the Graphics Core Next instruction set, and shares commonalities with the previous GCN microarchitectures.
Naming
The RX prefix is used for cards that offer over 1.5 teraflops of performance and 80 GB/s of memory throughput (with memory compression), and achieve at least 60 FPS at 1080p in popular games such as Dota 2 and League of Legends. Otherwise, it will be omitted. Like previous generations, the first numeral in the number refers to the generation (4 in this case) and the second numeral in the number refers to the tier of the card, of which there are six. Tier 4, the weakest tier in the 400 series, will lack the RX prefix and feature a 64-bit memory bus. Tiers 5 and 6 will have both RX prefixed and non-RX prefixed cards, indicating that while they will both feature a 128-bit memory bus and be targeted at 1080p gaming, the latter will fall short 1.5 teraflops of performance. Tiers 7 and 8 will each have a 256-bit memory bus and will be marketed as 1440p cards. The highest tier, tier 9, will feature a memory bus greater than 256-bit and shall be aimed at 4K gaming. Finally, the third numeral will indicate whether the card is in its first or second revision with either a 0 or 5, respectively. Therefore, for example, the RX 460 indicates that it has at least 1.5 teraflops of performance, 100 GB/s of memory throughput, has a 128-bit memory bus and will be able to achieve 60 FPS in the previously mentioned games at 1080p.
OpenCL (API)
OpenCL allows use of GPUs for highly parallel numeric computation accelerates many scientific software packages against CPU up |
https://en.wikipedia.org/wiki/Triposo | Triposo was a social travel site and mobile app that uses algorithms for journey planners.
The mobile appshowed the user recommendations on where to go depending on information they had given to the app. This included Facebook details. The app worked without internet connection; it downloaded information before departure.
History
Triposo was created in 2011 by ex-Google Dutch brothers Richard Osinga and Douwe Osinga with the help of Jon Tirsen. During development, Triposo received $3.5 million in a Series A round. By 2015, the app had been downloaded 10 million times.
Triposo was acquired by Musement in October 2017.
The Triposo app was no longer available for new users by 2021. It was shut down completely on March 1, 2023 and all personal data was permanently deleted.
References
Transport companies established in 2011
Internet properties established in 2011
Dutch travel websites
Social networking services |
https://en.wikipedia.org/wiki/Co-opetition%20%28book%29 | Co-opetition: A Revolution Mindset that Combines Competition and Cooperation is a non-fiction book on coopetition (co-operative competition), business strategy, and game theory by Adam M. Brandenburger and Barry J. Nalebuff. The book was initially published by Crown Business on May 1, 1996. As of 2015, the book is still available in its 9th printing.
Overview
Coopetition or co-opetition is a neologism coined to describe the concept of cooperation between competitors. Coopetition is a portmanteau of cooperation and competition.
The text discusses at length the notion of coopetition, a business strategy gained from game theory to demonstrate when it is better for competitors to work together rather than to go up against one another in contest. The authors use many examples to show the simultaneous interplay between competition and cooperation. Their research added to previous industry analysis such as Michael Porter’s five forces model, which focused almost entirely on competition between businesses.
Review
—Review by Strategy+Business
See also
Complementors
Competitive altruism
Frenemy
Negarchy
Six forces model
Thinking Strategically: The Competitive Edge in Business, Politics, and Everyday Life also co-authored by Barry Nalebuff
References
External links
Official website
Review of Barry J. Nalebuff and Adam N. Brandenburger, Co-opetition 1. Revolutionary Mindset that Redefines Competition and Co-operation 2. The Game Theory Strategy that's Changing the Game of Business
1996 non-fiction books
Books about game theory
Popular science books
American non-fiction books
Business books |
https://en.wikipedia.org/wiki/Amphidinium%20carterae | Amphidinium carterae is a species of dinoflagellates. It was first described by Edward M. Hulburt in 1957, and was named in honour of the British phycologist Nellie Carter-Montford. The type locality is Great Pond, Barnstable County, Massachusetts, USA. Some strains of this species are considered as toxic (against fungi, for example).
Distribution
Amphidinium carterae is known from both sides of the North Atlantic Ocean, the Bay of Fundy, the Gulf of Mexico, the Baltic Sea, the North Sea and the Mediterranean Sea. It also occurs in Brazil and New Zealand. It is found in shallow waters in coastal bays and estuaries.
Ecology
Amphidinium carterae is a species that sometimes causes algal blooms. In laboratory, the presence of a lysate of an A. carterae strain affects the embryonic development of sea urchins.
Use in research
Amphidinium carterae is a photosynthetic organism and can be cultured in the laboratory under suitable conditions of temperature and light. It is a peridinin-containing dinoflagellate, and has been used as a model organism for research. It has a highly unusual chloroplast genome with genes mounted on many small minicircle elements, and an unusual pattern of RNA metabolism.
References
Species described in 1957
Gymnodiniales
Symbiosis |
https://en.wikipedia.org/wiki/Faceware%20Technologies | Faceware Technologies is a facial animation and motion capture development company in America. The company was established under Image Metrics and became its own company at the beginning of 2012.
Faceware produces software used to capture an actor's performance and transfer it onto an animated character, as well as the hardware needed to capture the performances. The software line includes Faceware Analyzer, Faceware Retargeter, and Faceware Live.
Faceware software is used by film studios and video game developers including Rockstar Games, Bungie, Cloud Imperium Games, and 2K in games such as Grand Theft Auto V, Destiny, Star Citizen, and Halo: Reach.
Through its application in the video game industry, Faceware won the Develop Award while it was still part of Image Metrics for Technical Innovation in 2008. It won the Develop Award again for Creative Contribution: Visuals in 2014. Faceware received Best of Show recognition at the Game Developers Conference 2011 in San Francisco as well as Computer Graphics World's Silver Edge Award at SIGGRAPH 2014 and 2016. Faceware won the XDS Gary Award in 2016 for its contributions to the Faceware-EA presentation at the 2016 XDS Summit.
History
Image Metrics, founded in 2000, is a provider of facial animation and motion capture technology within the video game and entertainment industries. In 2008, Image Metrics offered a beta version of its facial animation technology to visual effects and film studios. The technology captured an actor's performance on video, analyzed it, and mapped it onto a CG model. The release of the beta allowed studios to incorporate facial animation technology into internal pipelines rather than going to the Image Metrics studio as they had in the past. The first studio to beta test Image Metric's software in 2009 was the visual effects studio Double Negative out of London.
In 2010, Image Metrics launched the facial animation technology platform Faceware. Faceware focused on increasing creative contr |
https://en.wikipedia.org/wiki/Enrique%20Pujals | Enrique Ramiro Pujals is a Brazilian mathematician known for his contributions to the understanding of dynamical systems. Since fall of 2018, he has been a professor at the Graduate Center at the City University of New York.
Education
After earning an undergraduate degree in mathematics at the University of Buenos Aires in 1992, he became a Ph.D. student at the Instituto Nacional de Matemática Pura e Aplicada, where he was a student of Jacob Palis, completing his Ph.D. in 1996. He was a Guggenheim Fellow in 2000. Before moving to CUNY in 2018, he was a faculty member at IMPA since 2003.
Awards
He was an invited speaker at the International Congress of Mathematicians in Beijing 2002. Won the ICTP Ramanujan Prize (2008), UMALCA Prize in Mathematics (2004), TWAS Prize in Mathematics (2009), is a member of the Brazilian Academy of Sciences and receive the Brazilian National Order of Scientific Merit in 2013.
Selected publications
Pujals, E. R. ; Sambarino, M. "Homoclinic tangencies and hyperbolicity for surface diffeomorphisms". Annals of Mathematics, Princeton, v. 151, n. 3, pp. 961–1023, 2000.
Pujals, E. R. ; Sambarino, M. "On the dynamics of dominated splitting", Annals of Mathematics, Princeton, (169) (2009), 675–740.
Bonatti, C. ; Diaz, L. ; Pujals, E. R. "A C1-generic dichotomy for diffeomorphisms: Weak forms of hyperbolicity or infinitely many sinks or sources". Annals of Mathematics, Princeton, v. 158, pp. 355–418, 2003.
Morales, C.; Pacifico, M.J.; Pujals, E. R. Robust transitive singular sets for $3-flows are partially hyperbolic attractors or repellers, Annals of Mathematics, Princeton. 160, no 2, (2004), 375–432
S. Crovisier, E.R. Pujals, Essential hyperbolicity and homoclinic bifurcations: a dichotomy phenomenon/mechanism for diffeomorphisms, Inventiones Mathematicae, (2015) Volume 201, Issue 2, 385–517.
L. Diaz, E.R. Pujals, R. Ures, Partial hyperbolicity and robust transitivity, Acta Mathematica 183, no. 1 (1999), 1–43
References
Argentine mathematic |
https://en.wikipedia.org/wiki/FedRAMP | The Federal Risk and Authorization Management Program (FedRAMP) is a United States federal government-wide compliance program that provides a standardized approach to security assessment, authorization, and continuous monitoring for cloud products and services.
In 2011, the Office of Management and Budget (OMB) released a memorandum establishing FedRAMP "to provide a cost-effective, risk-based approach for the adoption and use of cloud services to Executive departments and agencies." The General Services Administration (GSA) established the FedRAMP Program Management Office (PMO) in June 2012. The FedRAMP PMO mission is to promote the adoption of secure cloud services across the federal government by providing a standardized approach to security and risk assessment. Per the OMB memorandum, any cloud services that hold federal data must be FedRAMP authorized. FedRAMP prescribes the security requirements and processes that cloud service providers must follow in order for the government to use their service.
There are two ways to authorize a cloud service through FedRAMP: a Joint Authorization Board (JAB) provisional authorization (P-ATO), and through individual agencies.
Before the introduction of FedRAMP, individual federal agencies managed their own assessment methodologies following guidance set by the Federal Information Security Management Act of 2002.
FedRAMP provides accreditation for cloud services for the various cloud offering models which are Infrastructure as a Service (IaaS), Platform as a Service (PaaS), and Software as a Service, (SaaS).
Governance and applicable laws
FedRAMP is governed by different Executive Branch entities that collaborate to develop, manage, and operate the program. These entities include:
The Office of Management and Budget (OMB): The governing body that issued the FedRAMP policy memo, which defines the key requirements and capabilities of the program
The Joint Authorization Board (JAB): The primary governance and decision-m |
https://en.wikipedia.org/wiki/Digital5 | Digital5 is the online programming division of TV5 Network Inc. and currently headed by Chot Reyes, who also served as the chief of Sports5.
It produces content (also partnering with some productions) that will can be viewed on the network's online portals. Digital5's content include lifestyle, travel, news, business, sports, comedy, etc. It also managed the news portal, InterAksyon.com, together with News5. Digital5 also produced shows for GG Network, the first online network catered for electronic gamers.
Digital5 Programs
These are the programs produced by Digital5 (past, ongoing and upcoming) with its description
D5.studio
Aside from original programs, online re-runs of past and present TV5 shows are also uploaded in the website. Whenever possible, select Digital5 Programs are brought to TV5 as catch-up episodes (with short length online videos of the shows being combined for television and rearranged with playout to/from commercial breaks).
Baon Fix (Host: Patti Grandidge / Description: Quick Tips on Making a "Baon")
Bloom (Hosts: Mika Martinez, Maggie Wilson / Genre: Women Magazine)
Clash of Class (Description: Battle and Comparison)
Good Times with Mo: The Podcast (Hosts: Mo Twister and various co-hosts / Genre: Talk show on love & sex)
Jinrilationships: A Survival Guide to the Dating Life (Host: Jinri Park / Genre: Romantic-comedy)
Like A Bossing (Host: Anthony Pangilinan / Description: Magazine show about Entrepreneurs)
Kwentong Barbero (Mang Ponso / Genre: Typical comedy)
Phenoms (Starring: Kiefer Ravena and Alyssa Valdez / Genre: Reality)
Spinnr Sessions (Genre: Live Music Sessions from various music artists)
Tanods (Starring: Martin Escudero, Jun Sabayton, Bea Benedicto, Jinri Park / Genre: Sitcom)
Forever Sucks (Starring: Jasmine Curtis-Smith, JC Santos, Ian Batherson / Genre: Drama)
Rock U (Genre: Animated series)
Bolero Rap Battles (Genre: Rap Battle League)
News5.com.ph
Kontrabando/Duty, Devotion and Service (Hosts: Ramon Bautista, Lourd de Ve |
https://en.wikipedia.org/wiki/Thinking%20Strategically | Thinking Strategically: The Competitive Edge in Business, Politics, and Everyday Life is a non-fiction book by Indian-American economist Avinash Dixit and Barry Nalebuff, a professor of economics and management at Yale School of Management. The text was initially published by W. W. Norton & Company on February 1, 1991.
Overview
The book discusses issues of strategic behaviour, decision making, and game theory. The authors present the main concepts, such as backward induction, auction theory, Nash equilibrium, noncooperative bargaining, to a general audience. Each concept is illustrated by examples from common life, business, sports, politics, etc.—as applying game theory to real life may be the best way of crystallizing the best options available.
Reception
—Review by Financial Times
See also
1984 Orange Bowl
Co-Opetition: A Revolution Mindset that Combines Competition and Cooperation also co-authored by Barry Nalebuff
Coordination game
Tragedy of the commons
Thinking, Fast and Slow
References
External links
Excerpt from the book
1991 non-fiction books
Game theory
Popular science books
American non-fiction books
Business books
W. W. Norton & Company books |
https://en.wikipedia.org/wiki/Data%20lake | A data lake is a system or repository of data stored in its natural/raw format, usually object blobs or files. A data lake is usually a single store of data including raw copies of source system data, sensor data, social data etc., and transformed data used for tasks such as reporting, visualization, advanced analytics and machine learning. A data lake can include structured data from relational databases (rows and columns), semi-structured data (CSV, logs, XML, JSON), unstructured data (emails, documents, PDFs) and binary data (images, audio, video). A data lake can be established "on premises" (within an organization's data centers) or "in the cloud" (using cloud services from vendors such as Amazon, Microsoft, Oracle Cloud, or Google).
Background
James Dixon, then chief technology officer at Pentaho, coined the term by 2011 to contrast it with data mart, which is a smaller repository of interesting attributes derived from raw data. In promoting data lakes, he argued that data marts have several inherent problems, such as information siloing. PricewaterhouseCoopers (PwC) said that data lakes could "put an end to data silos". In their study on data lakes they noted that enterprises were "starting to extract and place data for analytics into a single, Hadoop-based repository."
Examples
Many companies use cloud storage services such as Google Cloud Storage and Amazon S3 or a distributed file system such as Apache Hadoop distributed file system (HDFS). There is a gradual academic interest in the concept of data lakes. For example, Personal DataLake at Cardiff University is a new type of data lake which aims at managing big data of individual users by providing a single point of collecting, organizing, and sharing personal data.
An earlier data lake (Hadoop 1.0) had limited capabilities with its batch-oriented processing (Map Reduce) and was the only processing paradigm associated with it. Interacting with the data lake meant one had to have expertise in Java |
https://en.wikipedia.org/wiki/Perfect%20complex | In algebra, a perfect complex of modules over a commutative ring A is an object in the derived category of A-modules that is quasi-isomorphic to a bounded complex of finite projective A-modules. A perfect module is a module that is perfect when it is viewed as a complex concentrated at degree zero. For example, if A is Noetherian, a module over A is perfect if and only if it is finitely generated and of finite projective dimension.
Other characterizations
Perfect complexes are precisely the compact objects in the unbounded derived category of A-modules. They are also precisely the dualizable objects in this category.
A compact object in the ∞-category of (say right) module spectra over a ring spectrum is often called perfect; see also module spectrum.
Pseudo-coherent sheaf
When the structure sheaf is not coherent, working with coherent sheaves has awkwardness (namely the kernel of a finite presentation can fail to be coherent). Because of this, SGA 6 Expo I introduces the notion of a pseudo-coherent sheaf.
By definition, given a ringed space , an -module is called pseudo-coherent if for every integer , locally, there is a free presentation of finite type of length n; i.e.,
.
A complex F of -modules is called pseudo-coherent if, for every integer n, there is locally a quasi-isomorphism where L has degree bounded above and consists of finite free modules in degree . If the complex consists only of the zero-th degree term, then it is pseudo-coherent if and only if it is so as a module.
Roughly speaking, a pseudo-coherent complex may be thought of as a limit of perfect complexes.
See also
Hilbert–Burch theorem
elliptic complex (related notion; discussed at SGA 6 Exposé II, Appendix II.)
References
Further reading
https://mathoverflow.net/questions/354214/determinantal-identities-for-perfect-complexes
An alternative definition of pseudo-coherent complex
External links
http://stacks.math.columbia.edu/tag/0656
http://ncatlab.org/nlab/show/perfect+module |
https://en.wikipedia.org/wiki/Saygus | Saygus is
an American developer of smartphones headquartered in South Jordan, Utah. It was founded by Chad Sayers.
Saygus purportedly developed two smartphone devices: VPhone and V², neither of which were ever released.
On April 20, 2021, the United States Department of Justice filed a lawsuit in the District of Utah alleging $10 Million in Securities fraud.
History
Saygus' VPhone, featuring a 3.5 inch touchscreen and slide-out keyboard, was first revealed in 2009, but did not go to market. The VPhone was presented at the 2010 Consumer Electronics Show, winning the Best of Innovations Award in the Wireless Handsets category.
The second device developed by Saygus was named V² (later referred to as V'- but still called the V Squared). The V² smartphone was announced at CES 2015 and was reported to ship in the first quarter of 2015. The device could be pre-ordered directly from Saygus during January 2015.
In June 2015 a crowdfunding campaign was launched for the Saygus V² with the company citing manufacturing issues in delivering the finished product to pre-order customers. In August 2017 it was reported that no devices had been delivered to customers.
Events
Saygus at CeBIT 2015 presents V² smartphone
Saygus presents V² at CES 2015
Saygus presents V² at MWC 2015
Saygus presents last hardware update of V² at Los Angeles Saygus VIP Penthouse Lounge near E3
References
Mobile phone manufacturers
Companies based in Utah
Smartphones
Vaporware |
https://en.wikipedia.org/wiki/RTX%20%28operating%20system%29 | RTX / RTX64 are real-time operating system (RTOS) by the firm IntervalZero. They are software extensions that convert Microsoft Windows operating system into a RTOS. It was the first Windows real-time solution on the market.
Overview
RTX and RTX64 real-time software extensions to Windows combine the familiar user experience of Microsoft Windows (rich GUI, available drivers and software, ...) and the direct control of embedded hardware by providing hard real-time determinism and symmetric multiprocessing (SMP) abilities.
The RTX / RTX64 extensions have followed the Windows architecture since Windows NT 3.5. Generally, RTX supports 32-bit Windows; RTX64 supports 64-bit Windows.
The systems are used in different markets such as industrial automation, testbed and simulation, digital audio, digital video, aerospace military, medical devices, electrical grid, electricity generation, and other uses.
Technical details
Hardware abstraction layer extensionRTX / RTX64 relies on a Windows hardware abstraction layer (HAL) extension to initialize the RTX-dedicated processors and to provide the real-time subsystem (RTSS) with high resolution timers (up to 1 microsecond). It also provides an interrupt isolation mechanism.
Symmetric multiprocessingLike Windows, RTX / RTX64 is based on a symmetric multiprocessing (SMP) architecture. Depending on the real-time needs, users can choose the number of processors to dedicate to RTX / RTX64 to run real-time processes. RTX can use up to 31 dedicated processors; RTX64 can use up to 63. Users can then scale real-time applications between the RTX / RTX64 dedicated processors.
Interrupt managementRTX / RTX64 supports both line based and Message Signaled Interrupts (MSI/MSI-X). Interrupt service thread (IST) latencies are under 10 microseconds.
Memory managementThe deterministic memory pool allocated for RTX / RTX64 is taken from the system non-paged pool memory. For example, under Windows 7, the amount of non-paged pool is: for 32- |
https://en.wikipedia.org/wiki/Risk%20Assessment%20under%20the%20Sanitary%20and%20Phytosanitary%20Agreement | The Agreement on the Application of Sanitary and Phytosanitary Measures (the "SPS Agreement") governs rules for food safety and animal and plant health standards. The SPS Agreement permits countries to implement measures provided that they are based on science, are applied only to the extent necessary to protect human, animal and plant life or health and do not arbitrarily or unjustifiably discriminate between countries where identical or similar conditions prevail.
Description
A critical feature of the SPS Agreement is that Sanitary and Phytosanitary measures (“SPS measures”) must be based on a ‘risk assessment’. Article 2.2 of the SPS Agreement requires SPS measures to be maintained with sufficient scientific evidence. Furthermore, SPS measures must be based on appropriate assessments of the risks to human, animal or plant life or health. The risk assessment must, but is not limited to, consider: scientific evidence, relevant processes and production methods, relevant inspection, sampling and testing methods, prevalence of specific diseases or pests, existence of pest or disease free areas, relevant ecological and environmental conditions, and quarantine or other treatment. Exceptionally, Members may adopt provisional measures (not based on a risk assessment) when the relevant scientific evidence is insufficient.
Risk assessment is defined in para4 of Annex A to the SPS agreement: The evaluation of the likelihood of entry, establishment or spread of a pest or disease within the territory of an importing Member according to the sanitary or phytosanitary measures which might be applied, and of the associated potential biological and economic consequences; or the evaluation of the potential for adverse effects on human or animal health arising from the presence of additives, contaminants, toxins or disease-causing organisms in food, beverages or feedstuffs.
Risk assessment represents a quantitative or qualitative estimate of the possible "harmful effect of the in |
https://en.wikipedia.org/wiki/List%20of%20debuggers | This is a list of debuggers: computer programs that are used to test and debug other programs.
Debuggers
Advanced Debugger — The standard UNIX debugger
Allinea DDT — graphical debugger for debugging multithreaded and multiprocess applications on Linux platforms
AQtime — profiler and memory/resource debugger for Windows
ARM Development Studio 5 (DS-5)
CA/EZTEST — was a CICS interactive test/debug software package
CodeView — was a debugger for the DOS platform
dbx — a proprietary source-level debugger for Pascal/Fortran/C/C++ on UNIX platforms
DEBUG — the built-in debugger of DOS and Microsoft Windows
Dragonfly (Opera) — JavaScript and HTML DOM debugger
Dr. Memory — a DynamoRIO-based memory debugger
Dynamic debugging technique (DDT), and its octal counterpart Octal Debugging Technique
FusionDebug — interactive debugger for Adobe ColdFusion, Railo, and Lucee CFML Engines
FusionReactor — interactive IDE style debugger which includes various extensions/controls for allowing debugging of Java in production environments
GNU Debugger
Parasoft Insure++ — a multi-platform memory debugger
Intel Debugger
Interactive Disassembler (IDA Pro)
Java Platform Debugger Architecture
Jinx — a whole-system debugger for heisenbugs. It works transparently as a device driver.
JSwat — open-source Java debugger
LLDB
MacsBug — a debugger for the classic Mac OS
Memcheck — a Valgrind-based memory debugger
Modular Debugger — a C/C++ source level debugger for Solaris and derivates
OllyDbg — a disassembly-based debugger for Windows (GUI)
Omniscient Debugger — Forward and backward debugger for Java
Rational Purify (IBM) — multi-platform memory debugger
sdb — a symbolic debugger for C programs for ancient UNIX platforms
SIMMON (Simulation Monitor)
SoftICE — kernel mode debugger for Windows
SEGGER Ozone — debugger and performance analyser for embedded systems
TRACE32 — in-circuit debugger for embedded systems
Turbo Debugger — Pascal/C/assembly debugger for DOS
Undo LiveRecorder — C, C++, Go, Rust, Ja |
https://en.wikipedia.org/wiki/Microbiome%20in%20the%20Drosophila%20gut | The microbiota are the sum of all symbiotic microorganisms (mutualistic, commensal or pathogenic) living on or in an organism. The fruit fly Drosophila melanogaster is a model organism and known as one of the most investigated organisms worldwide. The microbiota in flies is less complex than that found in humans. It still has an influence on the fitness of the fly, and it affects different life-history characteristics such as lifespan (life expectancy), resistance against pathogens (immunity) and metabolic processes (digestion). Considering the comprehensive toolkit available for research in Drosophila, analysis of its microbiome could enhance our understanding of similar processes in other types of host-microbiota interactions, including those involving humans. Microbiota plays key roles in the intestinal immune and metabolic responses via their fermentation product (short chain fatty acid), acetate.
Microbial composition
Drosophila melanogaster possesses a comparatively simple gut microbiota, consisting of only few bacterial species, mainly from two bacterial taxonomic groups: Bacillota and Pseudomonadota. The most common species belong to the families Lactobacillaceae (abundance of approx. 30%, members of the Bacillota) and Acetobacteraceae (approx. 55%, members of the Proteobacteria). Other less common bacterial species are from the families Leuconostocaceae, Enterococceae, and Enterobacteriaceae (all with an abundance in between 2–4%). The most common species include Lactobacillus plantarum, Lactobacillus brevis, Acetobacter pomorum and Enterococcus faecalis, while other species such as Acetobacter aceti, Acetobacter tropicalis and Acetobacter pasteurianus are also often found.
The particular species of the host fly has a central influence on the composition and quality of the gut microbiota, even if flies are raised under similar conditions. Nevertheless, the host's diet and nutritional environment also shape the exact composition of the microbiota. For ins |
https://en.wikipedia.org/wiki/Schleiden%20Medal | The Schleiden Medal is an award given by the Academy of Sciences Leopoldina, the National Academy of Germany, to honour outstanding achievements in the field of cellular biology. The award is named after botanist Matthias Jakob Schleiden.
Recipients
1955 : Emil Heitz
1958 : Albert Frey-Wyssling
1961 : Jean Brachet (co-recipient)
1973 : Irene Manton & Torbjörn Caspersson
1975 : Wilhelm Bernhard
1977 : Ernst Wohlfarth-Bottermann
1980 : Karl Lennert
1983 : Berta Scharrer
1985 : George Emil Palade
1987 : Zdeněk Lojda
1989 : A. G. Everson Pearse
1991 : Peter Sitte
1993 : Gottfried Schatz
1995 : Philipp U. Heitz
1998 : Avram Hershko
1999 : Walter Neupert
2001 : Kai Simons
2003 : Ari Helenius
2005 : Wolfgang Baumeister
2007 : Alexander Varshavsky
2009 : Thomas Cremer
2011 : Tom Rapoport
2013 : Ingrid Grummt
2015 : Johannes Buchner
2017 : Anthony A. Hyman
2019 : Elena Conti
2021 : Nikolaus Pfanner
See also
List of biology awards
References
Biology awards
Awards established in 1955
1955 establishments in Germany
German National Academy of Sciences Leopoldina
German science and technology awards
Scientific research awards |
https://en.wikipedia.org/wiki/JSON%20Web%20Token | JSON Web Token (JWT, pronounced , same as the word "jot") is a proposed Internet standard for creating data with optional signature and/or optional encryption whose payload holds JSON that asserts some number of claims. The tokens are signed either using a private secret or a public/private key.
For example, a server could generate a token that has the claim "logged in as administrator" and provide that to a client. The client could then use that token to prove that it is logged in as admin. The tokens can be signed by one party's private key (usually the server's) so that any party can subsequently verify whether or not the token is legitimate. If the other party, by some suitable and trustworthy means, is in possession of the corresponding public key, they too are able to verify the token's legitimacy. The tokens are designed to be compact, URL-safe, and usable especially in a web-browser single-sign-on (SSO) context. JWT claims can typically be used to pass identity of authenticated users between an identity provider and a service provider, or any other type of claims as required by business processes.
JWT relies on other JSON-based standards: JSON Web Signature and JSON Web Encryption.
Structure
Header
Identifies which algorithm is used to generate the signature HS256 indicates that this token is signed using HMAC-SHA256.
Typical cryptographic algorithms used are HMAC with SHA-256 (HS256) and RSA signature with SHA-256 (RS256). JWA (JSON Web Algorithms) RFC 7518 introduces many more for both authentication and encryption.
{
"alg": "HS256",
"typ": "JWT"
}
Payload
Contains a set of claims. The JWT specification defines seven Registered Claim Names, which are the standard fields commonly included in tokens. Custom claims are usually also included, depending on the purpose of the token.
This example has the standard Issued At Time claim (iat) and a custom claim (loggedInAs).
{
"loggedInAs": "admin",
"iat": 1422779638
}
Signature
Securely validates the tok |
https://en.wikipedia.org/wiki/List%20of%20countries%20by%20integrated%20circuit%20exports | The following is a list of countries by integrated circuit exports. Data is for 2019, in millions of United States dollars, as reported by International Trade Centre. Currently the top twenty countries are listed.
See also
List of flat panel display manufacturers
List of integrated circuit manufacturers
List of solid-state drive manufacturers
List of system on a chip suppliers
References
Integrated circuit
Integrated circuits |
https://en.wikipedia.org/wiki/Master%20Password%20%28algorithm%29 | Master Password is a type of algorithm first implemented by Maarten Billemont for creating unique passwords in a reproducible manner. It differs from traditional password managers in that the passwords are not stored on disk or in the cloud, but are regenerated every time from information entered by the user: Their name, a master password, and a unique identifier for the service the password is intended for (usually the URL).
By not storing the passwords anywhere, this approach makes it harder for attackers to steal or intercept them. It also removes the need for synchronization between devices, backups of potential password databases and risks of data breach. This is sometimes called sync-less password management.
Algorithm
Billemont's implementation involves the following parameters:
name: The username, used as a salt. The user's full name is chosen as it provides a sufficiently high level of entropy while being unlikely to be forgotten.
master_password: The secret for generating the master key.
site_name: A unique name for the service the password is intended for. Usually the bare domain name.
counter: An integer that can be incremented when the service requests a new password. By default, it is 1.
password_type: The password type defines the length and the constitution of the resulting password, see below.
Master key generation
In Billemont's implementation, the master key is a global 64-byte secret key generated from the user's secret master password and salted by their full name. The salt is used to avoid attacks based on rainbow tables. The scrypt algorithm, an intentionally slow key derivation function, is used for generating the master key to make a brute-force attack infeasible.
salt = "com.lyndir.masterpassword" + length(name) + name
master_key = scrypt(master_password, salt, 32768, 8, 2, 64)
Template seed generation
The template seed is a site-specific secret in binary form, generated from the master key, the site name and the counter using |
https://en.wikipedia.org/wiki/PC-1%20%28computer%29 | The Parametron Computer 1 (PC-1) was a binary, single-address computer developed at Professor Hidetosi Takahasi's Laboratory at the Department of Physics, University of Tokyo, and was one of the first general purpose computers that used parametron components and dual frequency magnetic-core memory. Construction started in September 1957 and was completed on March 26, 1958. The PC-1 was used at Takahasi's Laboratory for research related both to hardware and software and the researchers in the Faculty of Science also used it for scientific computing. The PC-1 was retired in May 1964.
The arithmetic and control circuits of the PC–1 consisted of 4200 parametrons. Binary numbers were coded using the two's complement representation; a short number was coded using 18 bits and a long one using 36. The single-address instructions were 18 bits long and there were about 20 of them. The memory consisted of 512 short words. The clock frequency was 15 kHz. One addition or subtraction required 4 clock cycles; one multiplication 26 cycles for a short multiplier, or 44 cycles for a long multiplier. Division consumed 161 cycles and a store operation 8. The power consumption was 3 kW and the floor area required was 8 square meters. The input was done using a photoelectric paper tape reader; the output was provided by a teletype.
References
Notes
Further reading
"TOSEC: University of Tokyo PC-1 (2012-04-23)" PC-1 Simulator. Internet Archive. Retrieved 13 August 2021.
Early computers
One-of-a-kind computers |
https://en.wikipedia.org/wiki/Pearcey%20integral | In mathematics, the Pearcey integral is defined as
The Pearcey integral is a class of canonical diffraction integrals, often used in wave propagation and optical diffraction problems The first numerical evaluation of this integral was performed by Trevor Pearcey using the quadrature formula.
In optics, the Pearcey integral can be used to model diffraction effects at a cusp caustic, which corresponds to the boundary between two regions of geometric optics: on one side, each point is contained in three light rays; on the other side, each point is contained in one light ray.
References
Special functions |
https://en.wikipedia.org/wiki/Yap%20%28company%29 | Yap Speech Cloud was a multimodal speech recognition system developed by American technology company Yap Inc. It offered a fully cloud-based speech-to-text transcription platform that was used by customers such as Microsoft.
The Company was a contestant at the inaugural TechCrunch conference and was subsequently acquired by Amazon in September 2011 to help develop products such as Alexa Voice Service, Echo, and Fire TV.
See also
List of speech recognition software
References
2006 establishments in North Carolina
Amazon (company)
Amazon (company) acquisitions
American companies established in 2006
Companies based in Charlotte, North Carolina
Software companies established in 2006
Multimodal interaction
Software companies based in North Carolina
Speech recognition
Technology companies disestablished in 2011
Technology companies established in 2006
Defunct technology companies of the United States
Defunct telecommunications companies of the United States
Defunct software companies of the United States |
https://en.wikipedia.org/wiki/Rod%20Holt | Frederick Rodney Holt (born 1934) is an American computer engineer and political activist. He is Apple employee #5, and developed the unique power supply for the 1977 Apple II. Actor Ron Eldard portrayed him in the 2013 film, Jobs.
Background
Holt was born in 1934 to a psychiatry resident father and artist and teacher mother. He became interested in electronics by the age of 14 and taught ham radio courses for Wellesley High School by the age of 16.
In 1952, after graduating from high school, Holt married his high school girlfriend Joanne. He also joined Ohio State University as a math major. He and Joanne had two children, Christine and Cheryl, during this period. Holt later stated that while at OSU, he also "became entranced with motorcycles and opened up my own motorcycle shop. That adventure failed within a year, however, and I then worked in the electronics industry to support my family. I continued to race bikes intermittently for the next twenty years." By 1958, when he was a grad student at OSU, he also became a political activist. He would later become involved in OSU's Free Speech Movement, served as editor of the Free Speech Press, and reconfigured himself as a socialist.
After graduate school, he became an electrical engineer with the Hickok Electrical Instrument company in Cleveland, Ohio, and later joined Atari as an Analog Engineer.
Apple Computer
During the early development of the Apple II, Apple Inc.'s co-founder, Steve Jobs asked his former boss, Atari's Al Alcorn for help with the power supply. Alcorn redirected Jobs to Holt, who saw himself as "a second-string quarterback" at Atari. He was initially "skeptical of Jobs and of Apple" (Swaine and Freiberger note that Holt "had trouble understanding the West Coast culture that shaped Apple's Founders"), telling Jobs that his rate was $200 per day. Jobs, however, replied that "we can afford you" and Holt joined the Apple II team in part responding to Alcorn's request to "help the kids out." Ho |
https://en.wikipedia.org/wiki/Carl%20Sagan%20Institute | The Carl Sagan Institute: Pale Blue Dot and Beyond was founded in 2014 at Cornell University in Ithaca, New York to further the search for habitable planets and moons in and outside the Solar System. It is focused on the characterization of exoplanets and the instruments to search for signs of life in the universe. The founder and current director of the institute is astronomer Lisa Kaltenegger.
The institute, inaugurated in 2014 and renamed on 9 May 2015, collaborates with international institutions on fields such as astrophysics, engineering, earth and atmospheric science, geology and biology with the goal of taking an interdisciplinary approach to the search for life elsewhere in the universe and of the origin of life on Earth.
Carl Sagan was a faculty member at Cornell University beginning in 1968. He was the David Duncan Professor of Astronomy and Space Sciences and director of the Laboratory for Planetary Studies there until his death in 1996.
Research
The main goal of the Carl Sagan Institute is to model atmospheric spectral signatures including biosignatures of known and hypothetical planets and moons to explore whether they could be habitable and how they could be detected. Their research focuses on exoplanets and moons orbiting in the habitable zone around their host stars. The atmospheric characterization of such worlds would allow researchers to potentially detect the first habitable exoplanet. A team member has already produced a "color catalog" that could help scientists look for signs of life on exoplanets.
Bioreflectance spectra catalog
Team scientists used 137 different microorganism species, including extremophiles that were isolated from Earth's most extreme environments, and cataloged how each life form uniquely reflects sunlight in the visible and near-infrared to the short-wavelength infrared (0.35–2.5 µm) portions of the electromagnetic spectrum. This database of individual 'reflection fingerprints' (spectrum) might be used by astronome |
https://en.wikipedia.org/wiki/Message%20authentication | In information security, message authentication or data origin authentication is a property that a message has not been modified while in transit (data integrity) and that the receiving party can verify the source of the message. Message authentication does not necessarily include the property of non-repudiation.
Message authentication is typically achieved by using message authentication codes (MACs), authenticated encryption (AE), or digital signatures. The message authentication code, also known as digital authenticator, is used as an integrity check based on a secret key shared by two parties to authenticate information transmitted between them. It is based on using a cryptographic hash or symmetric encryption algorithm. The authentication key is only shared by exactly two parties (e.g. communicating devices), and the authentication will fail in the existence of a third party possessing the key since the algorithm will no longer be able to detect forgeries (i.e. to be able to validate the unique source of the message). In addition, the key must also be randomly generated to avoid its recovery through brute-force searches and related-key attacks designed to identify it from the messages transiting the medium.
Some cryptographers distinguish between "message authentication without secrecy" systems – which allow the intended receiver to verify the source of the message, but they don't bother hiding the plaintext contents of the message – from authenticated encryption systems. Some cryptographers have researched subliminal channel systems that send messages that appear to use a "message authentication without secrecy" system, but in fact also transmit a secret message.
Data origin authentication and non-repudiation have been also studied in the framework of quantum cryptography.
See also
Data integrity
Authentication
Deniable authentication
References
Error detection and correction
Theory of cryptography |
https://en.wikipedia.org/wiki/Ordered%20set%20operators | In mathematical notation, ordered set operators indicate whether an object precedes or succeeds another. These relationship operators are denoted by the unicode symbols U+227A-F, along with symbols located unicode blocks U+228x through U+22Ex.
Examples
The relationship x precedes y is written x ≺ y. The relation x precedes or is equal to y is written x ≼ y.
The relationship x succeeds (or follows) y is written x ≻ y. The relation x succeeds or is equal to y is written x ≽ y.
Use in political science
In Political science and Decision theory, order relations are typically used in the context of an agent's choice, for example the preferences of a voter over several political candidates.
x ≺ y means that the voter prefers candidate y over candidate x.
x ∼ y means the voter is indifferent between candidates x and y.
x ≲ y means the voter is indifferent or prefers candidate y.
References
See also
Order theory
Partially ordered set
Directional symbols
Polynomial-time reduction
Wolfram Mathworld: precedes and succeeds
Mathematical symbols |
https://en.wikipedia.org/wiki/VAX%20Unit%20of%20Performance | The VAX Unit of Performance, or VUP for short, is an obsolete measurement of computer performance used by Digital Equipment Corporation (DEC). 1 VUP was equivalent to the performance of a VAX 11/780 completing a given task.
Other VAX machines and later workstation designs were compared in performance terms by defining system speed in VUPs, for instance, the VAXft Model 310 ran at 3.8 VUPs, meaning it ran roughly 3.8 times as fast as the 11/780.
The term was used largely within the DEC and its community, and fell from use as more standard ratings like SPEC became more widely used. This was especially true with the introduction of DEC workstations running Unix, in which case the VUP was of little use comparing the platforms to competition systems.
References
Benchmarks (computing) |
https://en.wikipedia.org/wiki/Zen%20%28first%20generation%29 | Zen is the codename for the first iteration in a family of computer processor microarchitectures of the same name from AMD. It was first used with their Ryzen series of CPUs in February 2017. The first Zen-based preview system was demonstrated at E3 2016, and first substantially detailed at an event hosted a block away from the Intel Developer Forum 2016. The first Zen-based CPUs, codenamed "Summit Ridge", reached the market in early March 2017, Zen-derived Epyc server processors launched in June 2017 and Zen-based APUs arrived in November 2017.
Zen is a clean sheet design that differs from AMD's previous long-standing Bulldozer architecture. Zen-based processors use a 14 nm FinFET process, are reportedly more energy efficient, and can execute significantly more instructions per cycle. SMT has been introduced, allowing each core to run two threads. The cache system has also been redesigned, making the L1 cache write-back. Zen processors use three different sockets: desktop and mobile Ryzen chips use the AM4 socket, bringing DDR4 support; the high-end desktop Zen-based Threadripper chips support quad-channel DDR4 RAM and offer 64 PCIe 3.0 lanes (vs 24 lanes), using the TR4 socket; and Epyc server processors offer 128 PCI 3.0 lanes and octa-channel DDR4 using the SP3 socket.
Zen is based on a SoC design. The memory controller and the PCIe, SATA, and USB controllers are incorporated into the same chip(s) as the processor cores. This has advantages in bandwidth and power, at the expense of chip complexity and die area. This SoC design allows the Zen microarchitecture to scale from laptops and small-form factor mini PCs to high-end desktops and servers.
By 2020, 260 million Zen cores have already been shipped by AMD.
Design
According to AMD, the main focus of Zen is on increasing per-core performance.
New or improved features include:
The L1 cache has been changed from write-through to write-back, allowing for lower latency and higher bandwidth.
SMT (simultaneou |
https://en.wikipedia.org/wiki/Digital%20transaction%20management | Digital transaction management (DTM) is a category of cloud services designed to digitally manage document-based transactions. DTM removes the friction
inherent in transactions that involve people, documents, and data to create faster, easier, more convenient, and secure processes. DTM goes beyond content and document management to include e-signatures, authentication and non-repudiation; enabling co-browsing between the customer and the business ; document transfer and certification; secure archiving that goes beyond records management; and a variety of meta-processes around managing electronic transactions and the documents associated with them.
DTM standards are proposed and managed by the xDTM Standard Association
Aragon Research has estimated that "by YE 2016, 70% of large enterprises will have a DTM initiative underway or fully implemented."
References
Cloud computing |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.