source stringlengths 31 227 | text stringlengths 9 2k |
|---|---|
https://en.wikipedia.org/wiki/Algebra | Algebra () () is the study of variables and the rules for manipulating these variables in formulas; it is a unifying thread of almost all of mathematics.
Elementary algebra deals with the manipulation of variables (commonly represented by Roman letters) as if they were numbers and is therefore essential in all applications of mathematics. Abstract algebra is the name given, mostly in education, to the study of algebraic structures such as groups, rings, and fields. Linear algebra, which deals with linear equations and linear mappings, is used for modern presentations of geometry, and has many practical applications (in weather forecasting, for example). There are many areas of mathematics that belong to algebra, some having "algebra" in their name, such as commutative algebra, and some not, such as Galois theory.
The word algebra is not only used for naming an area of mathematics and some subareas; it is also used for naming some sorts of algebraic structures, such as an algebra over a field, commonly called an algebra. Sometimes, the same phrase is used for a subarea and its main algebraic structures; for example, Boolean algebra and a Boolean algebra. A mathematician specialized in algebra is called an algebraist.
Etymology
The word algebra comes from the from the title of the early 9th century book ʿIlm al-jabr wa l-muqābala "The Science of Restoring and Balancing" by the Persian mathematician and astronomer al-Khwarizmi. In his work, the term al-jabr referred to the operation of moving a term from one side of an equation to the other, المقابلة al-muqābala "balancing" referred to adding equal terms to both sides. Shortened to just algeber or algebra in Latin, the word eventually entered the English language during the 15th century, from either Spanish, Italian, or Medieval Latin. It originally referred to the surgical procedure of setting broken or dislocated bones. The mathematical meaning was first recorded in the 16th century.
Different meanings of "a |
https://en.wikipedia.org/wiki/List%20of%20Indian%20state%20flowers | India, officially the Republic of India is a country in South Asia. It is made up of 29 states and 8 union territories.
A list of state flowers of India is given below. See Symbols of Indian states and territories for a complete list of all State characters and seals.
States
Union territories
See also
Indian lotus, the national flower of India
List of Indian state symbols
List of Indian state flags
List of Indian state emblems
List of Indian state mottos
List of Indian state songs
List of Indian state foundation days
List of Indian state animals
List of Indian state birds
List of Indian state trees |
https://en.wikipedia.org/wiki/Radio%20over%20IP | Radio over Internet Protocol, or RoIP, is similar to Voice over IP (VoIP), but augments two-way radio communications rather than telephone calls. From the system point of view, it is essentially VoIP with push-to-talk. To the user it can be implemented like any other radio network.
With RoIP, at least one node of a network is a radio (or a radio with an IP interface device) connected via IP to other nodes in the radio network. The other nodes can be two-way radios, but could also be dispatch consoles either traditional (hardware) or modern (software on a PC), POTS telephones, softphone applications running on a computer such as Skype phone, PDA, smartphone, or some other communications device accessible over IP. RoIP can be deployed over private networks as well as the public Internet.
It is useful in land mobile radio systems used by public safety departments and fleets of utilities spread over a broad geographic area. Like other centralized radio systems such as trunked radio systems, issues of delay or latency and reliance on centralized infrastructure can be impediments to adoption by public safety agencies.
RoIP is not a proprietary or protocol-limited construct but a basic concept that has been implemented in a number of ways. Several systems have been implemented in the amateur radio community such as Galaxy PTT Comms, AllStar Link, BroadNet, IRLP, and EchoLink that have demonstrated the utility of RoIP in a partly or entirely open-source environment.
Many commercial radio systems vendors such as Motorola and Harris have adopted RoIP as part of their system designs.
The motivation to deploy RoIP technology is usually driven by one of three factors: first, the need to span large geographic areas or operate in areas without sufficient coverage from radio towers; second, the desire to provide more reliable, or at least more repairable links in radio systems; and third, to support the use of many base station users, that is, voice communications from station |
https://en.wikipedia.org/wiki/Living%20systems | Living systems are open self-organizing life forms that interact with their environment. These systems are maintained by flows of information, energy and matter. Multiple theories of living systems have been proposed. Such theories attempt to map general principles for how all living systems work.
Context
Some scientists have proposed in the last few decades that a general theory of living systems is required to explain the nature of life. Such a general theory would arise out of the ecological and biological sciences and attempt to map general principles for how all living systems work. Instead of examining phenomena by attempting to break things down into components, a general living systems theory explores phenomena in terms of dynamic patterns of the relationships of organisms with their environment.
Theories
Miller's open systems
James Grier Miller's living systems theory is a general theory about the existence of all living systems, their structure, interaction, behavior and development, intended to formalize the concept of life. According to Miller's 1978 book Living Systems, such a system must contain each of twenty "critical subsystems" defined by their functions. Miller considers living systems as a type of system. Below the level of living systems, he defines space and time, matter and energy, information and entropy, levels of organization, and physical and conceptual factors, and above living systems ecological, planetary and solar systems, galaxies, etc. Miller's central thesis is that the multiple levels of living systems (cells, organs, organisms, groups, organizations, societies, supranational systems) are open systems composed of critical and mutually-dependent subsystems that process inputs, throughputs, and outputs of energy and information. Seppänen (1998) says that Miller applied general systems theory on a broad scale to describe all aspects of living systems. Bailey states that Miller's theory is perhaps the "most integrative" social s |
https://en.wikipedia.org/wiki/Sarnat%20Prize | The Rhoda and Bernard Sarnat International Prize in Mental Health was established in 1992 and is awarded annually by the National Academy of Medicine in the United States to recognize individuals, groups, or organizations for outstanding achievement in improving mental health. It is accompanied by a medal and $20,000.
Recipients
2022: Daniel Geschwind, University of California, Los Angeles
2021: Spero Manson, University of Colorado
2020: Stephen P. Hinshaw, University of California, Berkeley and University of California, San Francisco
2019: Daniel Weinberger, Lieber Institute for Brain Development
2018: Kenneth B. Wells, UCLA David Geffen School of Medicine
2017: Joseph T. Coyle, Harvard Medical School and McLean Hospital, Catherine Lord, Weill Cornell Medical College and Matthew State, University of California, San Francisco
2016: Steven Hyman, Stanley Institute and Robin Murray, King's College, London
2015: Kay Redfield Jamison, Johns Hopkins University School of Medicine and Kenneth S. Kendler, Virginia Institute for Psychiatric and Behavioral Genetics
2014: Vikram Patel, London School of Hygiene and Tropical Medicine
2013: William T. Carpenter, University of Maryland School of Medicine
2012: Huda Akil and Stanley J. Watson, University of Michigan, Ann Arbor
2011: William E. Bunney, University of California, Irvine, School of Medicine
2010: Eric J. Nestler, Friedman Brain Institute/Mount Sinai School of Medicine and Charles P. O'Brien, University of Pennsylvania School of Medicine
2009: David Mechanic, Institute for Health, Health Care Policy, and Aging Research/Rutgers University
2008: Paul R. McHugh, Johns Hopkins Bloomberg School of Public Health
2007: Beatrix Hamburg and David Hamburg, Weill Cornell Medical College
2006: Jack D. Barchas, Weill Cornell Medical College
2005: Floyd E. Bloom, Neurome, Inc
2004: Albert J. Stunkard, University of Pennsylvania
2003: Aaron T. Beck, University of Pennsylvania
2002: David Satcher, Morehouse School of Medicine
2001: Mi |
https://en.wikipedia.org/wiki/Submarine%20Command%20System | SMCS, the Submarine Command System, was first created for the Royal Navy of the United Kingdom's s as a tactical information system and a torpedo weapon control system. Versions have now also been installed on all active Royal Navy submarine classes.
Initial Phase: SMCS for Vanguard class
With the decision in 1983 to build a new class of submarine to carry the Trident missile system, the UK Ministry of Defence (MoD) ran an open competition for the command system. Up to that point all Royal Navy (RN) ships and submarines had command systems built by Ferranti using custom-built electronics and specialised proprietary processors. In a departure from previous practice, which had favoured 'preferred contractor' policies, the competition was won by a new company called Gresham-CAP, leading a consortium of Gresham-Lion (now part of Ultra Electronics plc) and CAP Scientific.
The consortium proposed a novel distributed processing system based on commercial off-the-shelf (COTS) processors, with a modular software architecture largely written in the Ada programming language. Each set of Initial Phase SMCS equipment has multiple computer nodes. At the centre of the system there is an Input/Output Node (which provides interfaces to weapons and sensors) and a Central Services Node (which holds fast numeric processors). Each central node is duplicated to create a fault-tolerant system which is dual modular redundant. The Human-Computer Interface is provided by Multi Function Consoles and some additional terminals. The dual redundant central nodes are linked to each other and to the consoles via a dual redundant fibre optic LAN.
In the Initial Phase equipment fitted to the s most processing is done by Intel 80386 single-board computers, each with its own Ada run-time environment. CAP Scientific created a complex layer of middleware to link the many processors together. At its time SMCS was the largest Ada project so far seen. As a pioneering user of Ada, the SMCS project encount |
https://en.wikipedia.org/wiki/Canstruction | Canstruction is a United States 501(c)(3) nonprofit organization providing canned food to local food banks in cities holding Canstruction competitions. Canstruction is an international charity competition where architects, engineers, contractors and students they mentor, compete to design and build giant structures made entirely from full cans of food. At the close of the competition all of the food is donated to local food banks where the competitions are held. Canstruction was founded in 1992 by Cheri Melillo and has since raised millions of pounds of food for food banks in participating cities across the world. With more than 170 cities and over 30,000 volunteers participating in Canstruction competitions, Canstruction has grown to become one of the largest food drives for food bank donations in the world.
History
In 1992, Cheri Melillo, creator and editor of the New York Chapter's prize-winning publication "SkyLines" and the National Public Relations Chair for the Society for Design Administration (SDA) in New York, instituted the SDA's Lunch-Time Tours and Administrative Round Table Program. During her tenure as the SDA's National Public Relations Chair she developed Canstruction as a way to bring the design and construction community together to compete in friendly competitions while giving back to the community. Cheri served as volunteer President and Executive Director for 17 years before her death in December 2009 of brain cancer. Cheri's work on Canstruction earned her numerous accolades. She was made an Honorary Member of the American institute of Architects for her work in developing, marketing and promoting Canstruction in 2000; in 2009 she accepted "The Creativity of the Mind Award from "The Odyssey of the Mind" as well as a Public Service Award from BOMA (Building Owners and Managers Association) in 2007. In 2009 she was the honoree at the City Harvest Practical Magic Ball in New York City; in earlier years she was honored by The Food Bank of New |
https://en.wikipedia.org/wiki/German%20submarine%20U-505 | U-505 is a German Type IXC submarine built for Germany's Kriegsmarine during World War II. She was captured by the U.S. Navy on 4 June 1944.
In her uniquely unlucky career with the Kriegsmarine, she had the distinction of being the "most heavily damaged U-boat to successfully return to port" in World War II on her fourth patrol, and the only submarine in which a commanding officer killed himself in combat conditions on her tenth patrol, following six botched patrols. She was captured on 4 June 1944 by United States Navy Task Group 22.3 (TG 22.3), one of six U-boats that were captured at sea by Allied forces during World War II. All but one of U-505s crew were rescued by the Navy task group. The submarine was towed to Bermuda in secret and her crew was interned at a US prisoner of war camp, where they were kept in isolation. The Navy classified the capture as top secret and went to great lengths to prevent the Germans from discovering it.
In 1954, U-505 was donated to the Museum of Science and Industry in Chicago, Illinois. She is now one of four German World War II U-boats that survive as museum ships, and just one of two Type IXCs still in existence with .
Design
German Type IXC submarines were slightly larger than the original Type IXBs. U-505 had a displacement of when at the surface and while submerged. The U-boat had a total length of , a pressure hull length of , a beam of , a height of , and a draft of . The submarine was powered by two MAN M 9 V 40/46 supercharged four-stroke, nine-cylinder diesel engines producing a total of for use while surfaced, two Siemens-Schuckert 2 GU 345/34 double-acting electric motors producing a total of for use while submerged. She had two shafts and two propellers. The boat was capable of operating at depths down to .
The submarine had a maximum surface speed of and a maximum submerged speed of . When submerged, the boat could operate for at ; when surfaced, she could travel at . U-505 was fitted with six torpedo t |
https://en.wikipedia.org/wiki/Range%20concatenation%20grammar | Range concatenation grammar (RCG) is a grammar formalism developed by Pierre Boullier in 1998 as an attempt to characterize a number of phenomena of natural language, such as Chinese numbers and German word order scrambling, which are outside the bounds of the mildly context-sensitive languages.
From a theoretical point of view, any language that can be parsed in polynomial time belongs to the subset of RCG called positive range concatenation grammars, and reciprocally.
Though intended as a variant on Groenink's literal movement grammars (LMGs), RCGs treat the grammatical process more as a proof than as a production. Whereas LMGs produce a terminal string from a start predicate, RCGs aim to reduce a start predicate (which predicates of a terminal string) to the empty string, which constitutes a proof of the terminal strings membership in the language.
Description
Formal definition
A Positive Range Concatenation Grammar (PRCG) is a tuple , where:
, and are disjoint finite sets of (respectively) predicate names, terminal symbols and variable names. Each predicate name has an associated arity given by the function .
is the start predicate name and verify .
is a finite set of clauses of the form , where the are predicates of the form with and .
A Negative Range Concatenation Grammar (NRCG) is defined like a PRCG, but with the addition that some predicates occurring in the right-hand side of a clause can have the form . Such predicates are called negative predicates.
A Range Concatenation Grammar is a positive or a negative one. Although PRCGs are technically NRCGs, the terms are used to highlight the absence (PRCG) or presence (NRCG) of negative predicates.
A range in a word is a couple , with , where is the length of . Two ranges and can be concatenated iff , and we then have: .
For a word , with , the dotted notation for ranges is: .
Recognition of strings
Like LMGs, RCG clauses have the general schema , where in an RCG, is either the empty |
https://en.wikipedia.org/wiki/Pairwise%20Algorithm | A Pairwise Algorithm is an algorithmic technique with its origins in Dynamic programming. Pairwise algorithms have several uses including comparing a protein profile (a residue scoring matrix for one or more aligned sequences) against the three translation frames of a DNA strand, allowing frameshifting. The most remarkable feature of PairWise as compared to other Protein-DNA alignment tools is that PairWise allows frameshifting during alignment.
History
One of the earliest applications of PairWise to problems in bioinformatics was by Ewan Birney.
Frameshifting refers to the phenomena where in one DNA strands, there are more than one translation frame. For normal Protein-DNA alignment tools, they first choose one of three frames to translate the DNA into a protein sequence, and then compare it with the given protein. Such alignment is based on the assumption that the DNA translation frame is not interrupted for the whole DNA strand. However, this is not generally true.
The PairWise algorithm is a variant of the Smith–Waterman algorithm best local alignment algorithm. These algorithms all belong to the class known as minimal string edit algorithms. The main differences between PairWise and other alignment algorithm is that, besides normal penalties such as Gap Opening Penalty (GOP), Gap Extension Penalty (GEP) and Match, PairWise introduced two new penalties called Frame Opening Penalty (FOP) and Frame Extension Penalty (FEP), which will be incurred when a frameshift is accepted and extended respectively.
Illustration
Figure 1 illustrates the alignment result when one protein sequence and one DNA sequence was aligned using normal protein-DNA alignment algorithm. The frame used was frame 1 for the DNA sequence. As shown in the picture, there was a gap of 2 amino acids (6 nucleic acids) in the alignment, which results the total low score of -2.
Figure 2 illustrates the aligned result using PairWise. Using the same DNA and protein sequence, and with the penalti |
https://en.wikipedia.org/wiki/Luminous%20energy | In photometry, luminous energy is the perceived energy of light. This is sometimes called the quantity of light. Luminous energy is not the same as radiant energy, the corresponding objective physical quantity. This is because the human eye can only see light in the visible spectrum and has different sensitivities to light of different wavelengths within the spectrum. When adapted for bright conditions (photopic vision), the eye is most sensitive to light at a wavelength of 555 nm. Light with a given amount of radiant energy will have more luminous energy if the wavelength is 555 nm than if the wavelength is longer or shorter. Light whose wavelength is well outside the visible spectrum has a luminous energy of zero, regardless of the amount of radiant energy present.
The SI unit of luminous energy is the lumen second, which is unofficially known as the talbot in honor of William Henry Fox Talbot. In other systems of units, luminous energy may be expressed in basic units of energy.
Explanation
Luminous energy is related to radiant energy by the expression
Here is the wavelength of light, and is the luminosity function, which represents the eye's sensitivity to different wavelengths of light.
Luminous energy is the integrated luminous flux in a given period of time:
See also
Coefficient of utilization
Radiant energy |
https://en.wikipedia.org/wiki/SciEngines%20GmbH | SciEngines GmbH is a privately owned company founded 2007 as a spin-off of the COPACOBANA project by the Universities of Bochum and Kiel, both in Germany. The project intended to create a platform for an affordable Custom hardware attack. COPACOBANA is a massively-parallel reconfigurable computer. It can be utilized to perform a so-called Brute force attack to recover DES encrypted data. It consists of 120 commercially available, reconfigurable integrated circuits (FPGAs). These Xilinx Spartan3-1000 run in parallel, and create a massively parallel system. Since 2007, SciEngines GmbH has enhanced and developed successors of COPACOBANA. Furthermore, the COPACOBANA has become a well known reference platform for cryptanalysis and custom hardware based attacks to symmetric, asymmetric cyphers and stream ciphers. 2008 attacks against A5/1 stream cipher an encryption system been used to encrypt voice streams in GSM have been published as the first known real world attack utilizing off-the-shelf custom hardware.
They introduced in 2008 their RIVYERA S3-5000 enhancing the performance of the computer dramatically via using 128 Spartan-3 5000's. Currently SciEngines RIVYERA holds the record in brute-force breaking DES utilizing 128 Spartan-3 5000 FPGAs. Current systems provide a unique density of up to 256 Spartan-6 FPGAs per single system enabling scientific utilization beyond the field of cryptanalysis, like bioinformatics.
2006 original developers of the COPACOBANA form the company
2007 introduction of the COPACOBANA (Copacobana S3-1000) as a [COTS]
2007 first demonstration of COPACOBANA 5000
2008 they introduced RIVYERA S3-5000, the direct successor of COPACOBANA 5000 and COPACOBANA. The RIVYERA architecture introduced a new high performance optimized bus system and a fully API encapsulated communication framework.
2008 demonstration of the COPACOBANA V4-SX35, a 128 Virtex-4 SX35 FPGA cluster (COPACOBANA shared bus architecture)
2008 introduction of the RIVYERA V4-S |
https://en.wikipedia.org/wiki/VXS | VMEBus Switched Serial, commonly known as VXS, is an ANSI standard (ANSI/VITA 41) that improves the performance of standard parallel VMEbus by enhancing it to support newer switched serial fabrics. The base specification (ANSI 41) defines all common elements of the standard, while "dot"-specifications (ANSI 41.n) define extensions which use specific serial fabrics (such as PCI Express, RapidIO, StarFabric from Dolphin Interconnect Solutions and InfiniBand) or additional functionality. VXS is backward compatible with VMEBus. It is defined by the VME International Trade Association (VITA) working group.
Specification
In common with other similar standards, VXS comprises a ‘base line’ specification, which defines the basic mechanical and electrical elements of VXS, together with a series of ‘dot level’ specifications, one or more of which must be implemented to create a functional module. The specifications are as follows:
See also
VPX |
https://en.wikipedia.org/wiki/Dijkstra%27s%20algorithm | Dijkstra's algorithm ( ) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.
The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree.
For a given source node in the graph, the algorithm finds the shortest path between that node and every other. It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined. For example, if the nodes of the graph represent cities and costs of edge paths represent driving distances between pairs of cities connected by a direct road (for simplicity, ignore red lights, stop signs, toll roads and other obstructions), then Dijkstra's algorithm can be used to find the shortest route between one city and all other cities. A widely used application of shortest path algorithms is network routing protocols, most notably IS-IS (Intermediate System to Intermediate System) and OSPF (Open Shortest Path First). It is also employed as a subroutine in other algorithms such as Johnson's.
The Dijkstra algorithm uses labels that are positive integers or real numbers, which are totally ordered. It can be generalized to use any labels that are partially ordered, provided the subsequent labels (a subsequent label is produced when traversing an edge) are monotonically non-decreasing. This generalization is called the generic Dijkstra shortest-path algorithm.
Dijkstra's algorithm uses a data structure for storing and querying partial solutions sorted by distance from the start. Dijkstra's original algorithm does not use |
https://en.wikipedia.org/wiki/Triticum%20urartu | Triticum urartu, also known as red wild einkorn wheat, and a form of einkorn wheat, is a grass species related to wheat, and native to western Asia. It is a diploid species whose genome is the A genome of the allopolyploid hexaploid bread wheat Triticum aestivum, which has genomes AABBDD. |
https://en.wikipedia.org/wiki/Uncharacterized%20LOC644249%20gene | Uncharacterized LOC644249 gene., also known as RP11-195B21.3, is about 1058 base pairs long and is found in Homo sapiens on chromosome 9q12. More specifically, the sequence is located on Chromosome: 9; NC_000009.11(67977457..67987991 bp). This gene’s protein product is the “coiled-coil domain-containing protein 29” which is 291 amino acids long and may contain a conserved domain in the superfamily, pfam 12001. In particular, this conserved domain contains the domain of unknown function DUF3496 which is about 110 amino acids long, functionally uncharacterized, and found in eukaryotes. Other possible motifs for the protein product exist but the DUF3496 remains the most likely. This protein may play a role as a transmembrane protein.
Gene
Genomic Location
For humans, this gene is located on chromosome 9q12 (67977457..67987991) bp.
Promoter
The promoter is predicted to be about 601 bp in length and is about 100 bp upstream from the transcription start site of the primary transcript .
Transcript
This gene is predicted to have 4 exons, with a very small 3'UTR which is capped with a poly A tail very shortly after the 4th exon.
Protein
The protein product is the coiled-coil domain-containing protein 29, abbreviated CCDC29, is about 291 amino acids in length and contains the DUF3496 motif. Also, this protein is also predicted to have a possible transmembrane site at about 284 - 291 aa.
Isoelectric Point:6.043
Molecular Weight 33.6 kdal
Charge Distribution Analysis
1 0000000000 0--0-000-0 +0-00+0-00 0++0+0+0-- 000-+-0000 +00000+-00
61 0000-0000+ +00000-+0- --++00+--0 000+000-00 +0-00+00-0 +0-0--+000
121 00-+0--000 0-0000-+00 -000+-0000 00++-000+- 0-0+00-0+0 00–000-0-
181 -0+-000000 +000000++0 0+00++0000 00+000-+-0 0+00000000 ++-0-0000-
241 00000000++ 0000000+00 0000000000 +000000000 0000000000 0
Motif
The DUF3496 motif is about 110 aa long and is conserved within eukaryotes. As the name implies, it is currently unknown in |
https://en.wikipedia.org/wiki/Information%20technology%20security%20assessment | Information Technology Security Assessment (IT Security Assessment) is an explicit study to locate IT security vulnerabilities and risks.
Background
In an assessment, the assessor should have the full cooperation of the organization being assessed. The organization grants access to its facilities, provides network access, outlines detailed information about the network, etc. All parties understand that the goal is to study security and identify improvements to secure the systems. An assessment for security is potentially the most useful of all security tests.
Purpose of security assessment
The goal of a security assessment (also known as a security audit, security review, or network assessment), is
to ensure that necessary security controls are integrated into the design and implementation of a project. A properly completed security assessment should provide documentation outlining any security gaps between a project design and approved corporate security policies. Management can address security gaps in three ways:
Management can decide to cancel the project, allocate the necessary resources to correct
the security gaps, or accept the risk based on an informed risk / reward analysis.
Methodology
The following methodology outline is put forward as the effective means in conducting security assessment.
Requirement Study and Situation Analysis
Security policy creation and update
Document Review
Risk Analysis
Vulnerability Scan
Data Analysis
Report & Briefing
Sample report
A security assessment report should include the following information:
Introduction/background information
Executive and Management summary
Assessment scope and objectives
Assumptions and limitations
Methods and assessment tools used
Current environment or system description with network diagrams, if any
Security requirements
Summary of findings and recommendations
The general control review result
The vulnerability test results
Risk assessment results including identified assets, |
https://en.wikipedia.org/wiki/Class%20of%20service | Class of service (COS or CoS) is a parameter used in data and voice protocols to differentiate the types of payloads contained in the packet being transmitted. The objective of such differentiation is generally associated with assigning priorities to the data payload or access levels to the telephone call.
Data services
As related to network technology, COS is a 3-bit field that is present in an Ethernet frame header when 802.1Q VLAN tagging is present. The field specifies a priority value between 0 and 7, more commonly known as CS0 through CS7, that can be used by quality of service (QoS) disciplines to differentiate and shape/police network traffic.
COS operates only on 802.1Q VLAN Ethernet at the data link layer (layer 2), while other QoS mechanisms (such as DiffServ, also known as DSCP) operate at the IP network layer (layer 3) or use a local QoS tagging system that does not modify the actual packet, such as Cisco's "QoS-Group".
Network devices (i.e. routers, switches, etc.) can be configured to use existing COS values on incoming packets from other devices (trust mode), or can rewrite the COS value to something completely different. Most Internet Service Providers do not trust incoming QoS markings from their customers, so COS is generally limited to use within an organization's intranet.
Service providers offering private-line WAN services will typically offer services which can utilize COS/QoS.
Voice services
As related to legacy telephone systems, COS is often used to define the permissions an extension will have on a PBX or Centrex. Certain groups of users may have a need for extended voicemail message retention while another group may need the ability to forward calls to a cell phone, and still others have no need to make calls outside the office. Permissions for a group of extensions can be changed by modifying a COS variable applied to the entire group.
COS is also used on trunks to define if they are full-duplex, incoming only, or outgoing only. |
https://en.wikipedia.org/wiki/Traffic%20shaping | Traffic shaping is a bandwidth management technique used on computer networks which delays some or all datagrams to bring them into compliance with a desired traffic profile. Traffic shaping is used to optimize or guarantee performance, improve latency, or increase usable bandwidth for some kinds of packets by delaying other kinds. It is often confused with traffic policing, the distinct but related practice of packet dropping and packet marking.
The most common type of traffic shaping is application-based traffic shaping. In application-based traffic shaping, fingerprinting tools are first used to identify applications of interest, which are then subject to shaping policies. Some controversial cases of application-based traffic shaping include bandwidth throttling of peer-to-peer file sharing traffic. Many application protocols use encryption to circumvent application-based traffic shaping.
Another type of traffic shaping is route-based traffic shaping. Route-based traffic shaping is conducted based on previous-hop or next-hop information.
Functionality
If a link becomes utilized to the point where there is a significant level of congestion, latency can rise substantially. Traffic shaping can be used to prevent this from occurring and keep latency in check. Traffic shaping provides a means to control the volume of traffic being sent into a network in a specified period (bandwidth throttling), or the maximum rate at which the traffic is sent (rate limiting), or more complex criteria such as generic cell rate algorithm. This control can be accomplished in many ways and for many reasons; however traffic shaping is always achieved by delaying packets.
Traffic shaping is commonly applied at the network edges to control traffic entering the network, but can also be applied by the traffic source (for example, computer or network card) or by an element in the network.
Uses
Traffic shaping is sometimes applied by traffic sources to ensure the traffic they send complies |
https://en.wikipedia.org/wiki/It%27s%20a%20Rainy%20Day | "It's a Rainy Day" is a song by British, Italy based Eurodance artist Ice MC, released in August 1994 as the third single from his third album, Ice'n'Green (1994), on which it appears in two versions, and his eleventh single overall. Written and produced by Robyx, it features vocals by Italian singer Alexia. It became the most successful single of the album, reaching number-one in Italy and number two in both Belgium and Spain. The single was also released with new remixes for the Christmas holidays. Giacomo de Simone directed its accompanying music video.
Chart performance
"It's a Rainy Day" was a big hit on the charts in Europe and remains one of Ice MC's most successful songs, alongside "Think about the Way". It peaked at number-one in Italy, as well as on the European Dance Radio Chart. The single entered the top 10 also in Belgium (2), Finland (9), France (6), the Netherlands (8) and Spain (2), as well as on the Eurochart Hot 100, where it peaked at number six in December 1994. Additionally, "It's a Rainy Day" was a top 20 hit in Austria (13), Germany (14) and Switzerland (15). In the United Kingdom, it peaked at number 73 in its first week on the UK Singles Chart, on April 2, 1995. But on the UK Dance Chart, the song fared better, reaching number 25. Outside Europe, it peaked at number six on the RPM Dance/Urban chart in Canada and number 11 in Israel. The single was awarded with a silver record in France, with a sale of 132,000 units.
Critical reception
A reviewer from Music Week gave "It's a Rainy Day" three out of five, adding that "this dance track has been a hit in a few European countries and uses the familiar formula of diggedy doggedy vocal over a thumping beat." James Hamilton from the Record Mirror Dance Update described it as an "Italian galloper".
Music video
The accompanying music video for "It's a Rainy Day" was directed by Giacomo de Simone. It features Italian singer Alexia and was A-listed on Germany's VIVA in November 1994. Later it was pu |
https://en.wikipedia.org/wiki/Parallel%20Virtual%20Machine | Parallel Virtual Machine (PVM) is a software tool for parallel networking of computers. It is designed to allow a network of heterogeneous Unix and/or Windows machines to be used as a single distributed parallel processor. Thus large computational problems can be solved more cost effectively by using the aggregate power and memory of many computers. The software is very portable; the source code, available free through netlib, has been compiled on everything from laptops to Crays.
PVM enables users to exploit their existing computer hardware to solve much larger problems at less additional cost. PVM has been used as an educational tool to teach parallel programming but has also been used to solve important practical problems. It was developed by the University of Tennessee, Oak Ridge National Laboratory and Emory University. The first version was written at ORNL in 1989, and after being rewritten by University of Tennessee, version 2 was released in March 1991. Version 3 was released in March 1993, and supported fault tolerance and better portability.
PVM was a step towards modern trends in distributed processing and grid computing but has, since the mid-1990s, largely been supplanted by the much more successful MPI standard for message passing on parallel machines. PVM is free software, released under both the BSD License and the GNU General Public License.
Design
PVM is a software system that enables a collection of heterogeneous computers to be used as a coherent and flexible concurrent computational resource, or a "parallel virtual machine".
The individual computers may be shared-memory or local-memory multiprocessors, vector supercomputers, specialized graphics engines, or scalar workstations and PCs, that may be interconnected by a variety of networks, such as Ethernet or FDDI.
PVM consists of a run-time environment and library for message passing, task and resource management, and fault notification. While PVM will not automatically make a commercial |
https://en.wikipedia.org/wiki/Monosodium%20methyl%20arsonate | Monosodium methyl arsenate (MSMA) is an arsenic-based herbicide. It is an organo-arsenate; less toxic than the inorganic form of arsenates. However, the EPA states that all forms of arsenic are a serious risk to human health and the United States' Agency for Toxic Substances and Disease Registry ranked arsenic as number 1 in its 2001 Priority List of Hazardous Substances at Superfund sites.
Arsenic is classified as a Group-A carcinogen. The EPA states that:
Trade names include:
Target 6 Plus
Target 6.6
MSMA 6 Plus
MSMA 6.6 |
https://en.wikipedia.org/wiki/John%20V.%20Breakwell | John Valentine Breakwell (1917 – April 16, 1991) was a noted American control theorist and a Professor of Astronautics at Stanford University. He is remembered for his contributions to the "science and applications of astrodynamics, for discovery of flight-trajectory optimization, and for outstanding academic service." He was elected to the National Academy of Engineering in 1981 and a recipient of the Richard E. Bellman Control Heritage Award in 1983. |
https://en.wikipedia.org/wiki/Atomic%2C%20molecular%2C%20and%20optical%20physics | Atomic, molecular, and optical physics (AMO) is the study of matter–matter and light–matter interactions, at the scale of one or a few atoms and energy scales around several electron volts. The three areas are closely interrelated. AMO theory includes classical, semi-classical and quantum treatments. Typically, the theory and applications of emission, absorption, scattering of electromagnetic radiation (light) from excited atoms and molecules, analysis of spectroscopy, generation of lasers and masers, and the optical properties of matter in general, fall into these categories.
Atomic and molecular physics
Atomic physics is the subfield of AMO that studies atoms as an isolated system of electrons and an atomic nucleus, while molecular physics is the study of the physical properties of molecules. The term atomic physics is often associated with nuclear power and nuclear bombs, due to the synonymous use of atomic and nuclear in standard English. However, physicists distinguish between atomic physics — which deals with the atom as a system consisting of a nucleus and electrons — and nuclear physics, which considers atomic nuclei alone. The important experimental techniques are the various types of spectroscopy. Molecular physics, while closely related to atomic physics, also overlaps greatly with theoretical chemistry, physical chemistry and chemical physics.
Both subfields are primarily concerned with electronic structure and the dynamical processes by which these arrangements change. Generally this work involves using quantum mechanics. For molecular physics, this approach is known as quantum chemistry. One important aspect of molecular physics is that the essential atomic orbital theory in the field of atomic physics expands to the molecular orbital theory. Molecular physics is concerned with atomic processes in molecules, but it is additionally concerned with effects due to the molecular structure. Additionally to the electronic excitation states which are kn |
https://en.wikipedia.org/wiki/OSTree | libostree (previously OSTree) is a system for versioning updates of Linux-based operating systems. It can be considered as "Git for operating system binaries". It operates in userspace, and will work on top of any Linux file system. At its core is a Git-like content-addressed object store with branches (or "refs") to track meaningful file system trees within the store.
Features
OSTree is closely inspired by Git. It operates on commits which refer to filesystem trees. To refer to different commits while maintaining a user-readable name, OSTree provides "references" (analogous to branches in Git), such asexampleos/buildmain/x86_64-runtime.
Files provided by commits are by default immutable, done by mounting the filesystem itself as read-only. OSTree allows for two mutable directories for storing user data: /etc and /var. It provides a mechanism to allow filesystem trees to add configuration files to /etc while also allowing system administrators to edit those files in a persistent manner.
OSTree provides bootloader management for hardware deployments. This enables atomic updates, as OSTree can create deployments and atomically insert them into the boot partition. It also allows for systemwide rollback by selecting old deployments during startup.
Usage
libostree is used by various Linux operating systems and tools:
endless OS through eos-updater.
Flatpak, used to store applications and runtimes and to provide deduplication.
Fedora's immutable spins (Silverblue, Kinoite, and Sericea) through rpm-ostree
Atomic Host
The GNOME continuous project for continuous delivery of GNOME components.
Torizon OS embedded Linux uses libostree with the Uptane Frameworks for OS Updates. |
https://en.wikipedia.org/wiki/Rhodamine%20B | Rhodamine B is a chemical compound and a dye. It is often used as a tracer dye within water to determine the rate and direction of flow and transport. Rhodamine dyes fluoresce and can thus be detected easily and inexpensively with fluorometers.
Rhodamine B is used in biology as a staining fluorescent dye, sometimes in combination with auramine O, as the auramine-rhodamine stain to demonstrate acid-fast organisms, notably Mycobacterium. Rhodamine dyes are also used extensively in biotechnology applications such as fluorescence microscopy, flow cytometry, fluorescence correlation spectroscopy and ELISA.
Other uses
Rhodamine B is often mixed with herbicides to show where they have been used.
It is also being tested for use as a biomarker in oral rabies vaccines for wildlife, such as raccoons, to identify animals that have eaten a vaccine bait. The rhodamine is incorporated into the animal's whiskers and teeth. Rhodamine B is an important hydrophilic xanthene dye well known for its stability and is widely used in the textile industry, leather, paper printing, paint, coloured glass and plastic industries.
Rhodamine B (BV10) is mixed with quinacridone magenta (PR122) to make the bright pink watercolor known as Opera Rose.
Properties
Rhodamine B can exist in equilibrium between two forms: an "open"/fluorescent form and a "closed"/nonfluorescent spirolactone form. The "open" form dominates in acidic condition while the "closed" form is colorless in basic condition.
The fluorescence intensity of rhodamine B will decrease as temperature increases.
The solubility of rhodamine B in water varies by manufacturer, and has been reported as 8 g/L and ~15 g/L, while solubility in alcohol (presumably ethanol) has been reported as 15 g/L. Chlorinated tap water decomposes rhodamine B. Rhodamine B solutions adsorb to plastics and should be kept in glass.
Rhodamine B is tunable around 610 nm when used as a laser dye. Its luminescence quantum yield is 0.65 in basic ethanol, 0.49 |
https://en.wikipedia.org/wiki/Haskins%20Laboratories | Haskins Laboratories, Inc. is an independent 501(c) non-profit corporation, founded in 1935 and located in New Haven, Connecticut, since 1970. Haskins has formal affiliation agreements with both Yale University and the University of Connecticut; it remains fully independent, administratively and financially, of both Yale and UConn. Haskins is a multidisciplinary and international community of researchers that conducts basic research on spoken and written language. A guiding perspective of their research is to view speech and language as emerging from biological processes, including those of adaptation, response to stimuli, and conspecific interaction. Haskins Laboratories has a long history of technological and theoretical innovation, from creating systems of rules for speech synthesis and development of an early working prototype of a reading machine for the blind to developing the landmark concept of phonemic awareness as the critical preparation for learning to read an alphabetic writing system.
Research tools and facilities
Haskins Laboratories is equipped, in-house, with a comprehensive suite of tools and capabilities to advance its mission of research into language and literacy. As of 2014, these included:
Anechoic chamber
Electroencephalography
BioSemi 264 electrode, 24 bit Active Two System
EGI 128 electrode, Geodesic EEG System 300
Electromagnetic articulography (EMMA)
Carstens AG501
NDI WAVE
Eye tracking: HL is equipped with 3 SR Research eye-trackers.
2 Model Eyelink 1000 systems.
1 Model Eyelink 1000plus system.
Magnetic resonance imaging: Haskins has access to MRI scanners through agreements with the University of Connecticut and the Yale School of Medicine. On-site, HL has a Linux computer cluster dedicated to analysis of MRI data.
Motion capture: HL is equipped with a Vicon motion capture system with one Basler high-speed digital camera, six Vicon MX T-20 cameras and a Vicon MX Giganet for synching camera data and connecting cameras to t |
https://en.wikipedia.org/wiki/Hydrogenase%20maturation%20protease%20family | In molecular biology, the hydrogenase maturation protease family is a family of aspartic endopeptidases belonging to MEROPS family A31.
The large subunit of [NiFe]-hydrogenase, as well as other nickel metalloenzymes, is synthesized as a precursor devoid of the metalloenzyme active site. This precursor undergoes a complex post-translational maturation process that requires a number of accessory proteins. At one step of this process, after nickel incorporation, each hydrogenase isoenzyme is processed by proteolytic cleavage at the C-terminal end by the corresponding hydrogenase maturation endopeptidase. For example, Escherichia coli HycI is involved in processing of pre-HycE (the large subunit of hydrogenase 3),; HybD is involved in processing of pre-HybC (the large subunit of hydrogenase 2); and HyaD is assumed to be involved in processing of the large subunit of hydrogenase 1.
The cleavage site is after a His or an Arg, liberating a short peptide. This cleavage occurs only in the presence of nickel, and the endopeptidase probably uses the metal in the large subunit of [NiFe]-hydrogenases as a recognition motif. There is no direct evidence for the active site or substrate-binding site, but there are predictions based on an available structure.
Nomenclature note: the following names are used in different organisms for members of this family: HycI, HybD, HyaD, HoxM, HoxW, HupD, HynC, HupM, VhoD, VhtD. Gene/protein names are sometimes used interchangeably to designate various "hydrogenase cluster" proteins unrelated to each other in various organisms. For example, the following names are used for members of this group, but also for unrelated proteins: HupD is used in Azotobacter chroococcum and Anabaena species to designate an unrelated hydrogenase maturation factor; HydD is used to designate hydrogenase structural genes in Thermococcus litoralis, Pyrococcus abyssi, and other species.
External links
MEROPS family A31 |
https://en.wikipedia.org/wiki/QFF | QFF is an aeronautical code Q code. It is the MSL pressure derived from local meteorological station conditions in accordance with meteorological practice. This is the altimeter setting that is intended to produce correct altitude indication (i.e., no error) on an altimeter at the actual sea level elevation, while QNH is intended to have no error at the station elevation (or, especially when applied within a region with a relatively small range of surface elevations, at the altitudes close to the surface elevation within the region).
Meteorological practice of calculating QFF differs between meteorological organizations around the world. Some examples:
The Australian Bureau of Meteorology method:
QFF is derived from the barometric pressure at the station location by calculating the weight of an imaginary air column, extending from the location to sea level, assuming the temperature and relative humidity at the location are the long term monthly mean, the temperature lapse rate is according to ISA and the relative humidity lapse rate is zero.
QFF is the location value plotted on surface synoptic chart and is closer to reality than QNH, though it is only indirectly used in aviation.
Another method:
The derivation assumes that an isothermal layer at the station temperature extends to the sea level. This is the barometric pressure at the surface reduced to MSL using the observed temperature at the surface (which assumes an isothermal layer from MSL to that surface). QFF accounts for the effect that temperature has on the pressure lapse rate and therefore the resultant calculated pressure.
The range of QFF so far recorded, low pressure to high pressure, is from 856 to 1083 hPa.
See also
Atmospheric pressure
QFE
QNH |
https://en.wikipedia.org/wiki/Isosbestic%20point | In spectroscopy, an isosbestic point is a specific wavelength, wavenumber or frequency at which the total absorbance of a sample does not change during a chemical reaction or a physical change of the sample. The word derives from two Greek words: "iso", meaning "equal", and "sbestos", meaning "extinguishable".
Isosbestic plot
When an isosbestic plot is constructed by the superposition of the absorption spectra of two species (whether by using molar absorptivity for the representation, or by using absorbance and keeping the same molar concentration for both species), the isosbestic point corresponds to a wavelength at which these spectra cross each other.
A pair of substances can have several isosbestic points in their spectra.
When a 1-to-1 (one mole of reactant gives one mole of product) chemical reaction (including equilibria) involves a pair of substances with an isosbestic point, the absorbance of the reaction mixture at this wavelength remains invariant, regardless of the extent of reaction (or the position of the chemical equilibrium). This occurs because the two substances absorb light of that specific wavelength to the same extent, and the analytical concentration remains constant.
For the reaction:
the analytical concentration is the same at any point in the reaction:
.
The absorbance of the reaction mixture (assuming it depends only on X and Y) is:
.
But at the isosbestic point, both molar absorptivities are the same:
.
Hence, the absorbance
does not depend on the extent of reaction (i.e., on the particular concentrations of X and Y)
The requirement for an isosbestic point to occur is that the two species involved are related linearly by stoichiometry, such that the absorbance is invariant at a certain wavelength. Thus, ratios other than 1-to-1 are possible. The presence of an isosbestic point typically indicates that only two species that vary in concentration contribute to the absorption around the isosbestic point. If a third one is parta |
https://en.wikipedia.org/wiki/Acidovorax%20wohlfahrtii | Acidovorax wohlfahrtii is a bacterium from the genus Acidovorax and the family Comamonadaceae. |
https://en.wikipedia.org/wiki/Zeng%20Liansong | Zeng Liansong (; 17 December 1917–19 October 1999) was a Chinese supply chain manager and former secret agent of the Chinese Communist Party. He designed the National Flag of the People's Republic of China and previously served as deputy manager of Shanghai City Daily Necessities Company.
Early life and education
Zeng Liansong was born in Rui'an, Zhejiang. He studied in Rui'an County Primary School (now Rui'an City Experimental Primary School) and Rui'an High School in his youth.
In 1936, Zeng was admitted to the Department of Economics of the National Central University. He later joined the Anti-Japanese and National Salvation Federation at the university and devoted himself to the Chinese Communist Revolution. He joined the Chinese Communist Party (CCP) in May 1938, engaged in underground activities, and served as secretary of the underground student party branch of the CCP at the National Central University.
Career
After his graduation in 1940, he served as an underground worker (secret agent) for the CCP. In 1949, he worked as a secretary at the Shanghai Modern Economic News Agency (上海现代经济通讯社), a secret economic news stronghold and intelligence agency led by the Shanghai Underground Party of the CCP (中国共产党上海地下党). In May 1949, the People's Liberation Army gained control of Shanghai, and Shanghai Modern Economic News Agency completed its historical mission and was disbanded. Soon after, Zeng Liansong saw the solicitation notice for the national flag of the People's Republic of China and devoted himself to the design work.
In mid-August 1949, Zeng Liansong submitted the pattern drawing to the preparatory meeting of the new Chinese People's Political Consultative Conference (CPPCC). It depicted a field of Chinese red with four gold stars around a larger star in the canton. The larger star contained the hammer and sickle symbol of communism. Zeng's design was very similar to the design that the nation adopted, the only difference being the removal of the hamme |
https://en.wikipedia.org/wiki/Cumulative%20accuracy%20profile | A cumulative accuracy profile (CAP) is a concept utilized in data science to visualize discrimination power. The CAP of a model represents the cumulative number of positive outcomes along the y-axis versus the corresponding cumulative number of a classifying parameter along the x-axis. The output is called a CAP curve. The CAP is distinct from the receiver operating characteristic (ROC) curve, which plots the true-positive rate against the false-positive rate.
CAPs are used in robustness evaluations of classification models.
Analyzing a CAP
A cumulative accuracy profile can be used to evaluate a model by comparing the current curve to both the 'perfect' and a randomized curve. A good model will have a CAP between the perfect and random curves; the closer a model is to the perfect CAP, the better is.
The accuracy ratio (AR) is defined as the ratio of the area between the model CAP and random CAP, and the area between the perfect CAP and random CAP. In a successful model, the AR has values between zero and one, and the higher the value is, the stronger the model.
The cumulative number of positive outcomes indicates a model's strength. For a successful model, this value should lie between 50% and 100% of the maximum, with a higher percentage for stronger models. In sporadic cases, the accuracy ratio can be negative. In this case, the model is performing worse than the random CAP.
Applications
The cumulative accuracy profile (CAP) and ROC curve are both commonly used by banks and regulators to analyze the discriminatory ability of rating systems that evaluate credit risks. The CAP is also used by instructional design engineers to assess, retrain and rebuild instructional design models used in constructing courses, and by professors and school authorities for improved decision-making and managing educational resources more efficiently. |
https://en.wikipedia.org/wiki/LRK | Long Range Kinematic (LRK) technology is a sophisticated kinematic method developed by Magellan (formerly Thales) Navigation that optimises the advantages of dual-frequency GPS operation. Other conventional methods use the dual-frequency only during initialisation. LRK makes solving ambiguities during initialisation easy and continuous dual-frequency kinematic operation possible at distances up to 40 kilometres.
Conventional dual-frequency kinematic operation is limited to about 10 kilometres, using a combined observation on GPS L1 and L2 frequencies to produce an initial wide lane solution, ambiguous to around 86 centimetres. During a second phase, the conventional kinematic method uses measurements from the L1 frequency only. This method only allows for kinematic operation as long as the de-correlation of atmospheric errors is compatible with a pure phase single-frequency solution.
Similar to the KART process, LRK is a simple and reliable method that allows any initialisation mode, from a static or fixed reference point, to On The Fly ambiguity resolution, when performing dual-frequency GPS positioning. LRK technology reduces initialisation times to a few seconds by efficiently using L2 measurements in every mode of operation. LRK maintains optimal real-time positioning accuracy to within a centimetre at a range up to 40-50 kilometres, even with a reduced number of visible satellites.
External links
https://web.archive.org/web/20060821080822/http://products.thalesnavigation.com/en/products/aboutgps/rtk.asp
Global Positioning System
Navigation
Navigational equipment |
https://en.wikipedia.org/wiki/Incremental%20learning | In computer science, incremental learning is a method of machine learning in which input data is continuously used to extend the existing model's knowledge i.e. to further train the model. It represents a dynamic technique of supervised learning and unsupervised learning that can be applied when training data becomes available gradually over time or its size is out of system memory limits. Algorithms that can facilitate incremental learning are known as incremental machine learning algorithms.
Many traditional machine learning algorithms inherently support incremental learning.
Other algorithms can be adapted to facilitate incremental learning.
Examples of incremental algorithms include
decision trees
(IDE4,
ID5R and gaenari),
decision rules,
artificial neural networks
(RBF networks,
Learn++,
Fuzzy ARTMAP,
TopoART, and
IGNG) or
the incremental SVM.
The aim of incremental learning is for the learning model to adapt to new data without forgetting its existing knowledge. Some incremental learners have built-in some parameter or assumption that controls the relevancy of old data, while others, called stable incremental machine learning algorithms, learn representations of the training data that are not even partially forgotten over time. Fuzzy ART and TopoART are two examples for this second approach.
Incremental algorithms are frequently applied to data streams or big data, addressing issues in data availability and resource scarcity respectively. Stock trend prediction and user profiling are some examples of data streams where new data becomes continuously available. Applying incremental learning to big data aims to produce faster classification or forecasting times. |
https://en.wikipedia.org/wiki/Activating%20function | The activating function is a mathematical formalism that is used to approximate the influence of an extracellular field on an axon or neurons. It was developed by Frank Rattay and is a useful tool to approximate the influence of functional electrical stimulation (FES) or neuromodulation techniques on target neurons. It points out locations of high hyperpolarization and depolarization caused by the electrical field acting upon the nerve fiber. As a rule of thumb, the activating function is proportional to the second-order spatial derivative of the extracellular potential along the axon.
Equations
In a compartment model of an axon, the activating function of compartment n, , is derived from the driving term of the external potential, or the equivalent injected current
,
where is the membrane capacity, the extracellular voltage outside compartment relative to the ground and the axonal resistance of compartment .
The activating function represents the rate of membrane potential change if the neuron is in resting state before the stimulation. Its physical dimensions are V/s or mV/ms. In other words, it represents the slope of the membrane voltage at the beginning of the stimulation.
Following McNeal's simplifications for long fibers of an ideal internode membrane, with both membrane capacity and conductance assumed to be 0 the differential equation determining the membrane potential for each node is:
,
where is the constant fiber diameter, the node-to-node distance, the node length the axomplasmatic resistivity, the capacity and the ionic currents. From this the activating function follows as:
.
In this case the activating function is proportional to the second order spatial difference of the extracellular potential along the fibers. If and then:
.
Thus is proportional to the second order spatial differential along the fiber.
Interpretation
Positive values of suggest a depolarization of the membrane potential and negative values a hyperpolar |
https://en.wikipedia.org/wiki/Parbuckle%20salvage | Parbuckle salvage, or parbuckling, is the righting of a sunken vessel using rotational leverage. A common operation with smaller watercraft, parbuckling is also employed to right large vessels. In 1943, the was rotated nearly 180 degrees to upright after being sunk in the attack on Pearl Harbor, and the Italian cruise ship Costa Concordia was successfully parbuckled off the west coast of Italy in September 2013, the largest salvage operation of that kind to date.
Mechanical advantage and difficulties
While the mechanical advantage used by a laborer to parbuckle a cask up an incline is 2:1, parbuckling salvage is not so limited. Each of the 21 winches used to roll the Oklahoma used cables that passed through two 17-part tackle assemblies (17:1 advantage). Eight diameter sheaves, eight diameter sheaves, and one diameter sheave comprised just half the mechanical effort.
A major concern during salvage is preventing rotational torque from becoming a transverse force moving the ship sideways. , lost like the Oklahoma in the Pearl Harbor attack, was meant to be recovered by a similar rotation after the Oklahoma. As the Utah was rotated, however, its hull did not catch on the harbor bottom, and the vessel slid toward Ford Island. The Utah recovery effort was abandoned.
Righting of Oklahoma
Oklahoma weighed about . Twenty-one electric winches were installed on Ford Island, anchored in concrete foundations. They operated in unison. Each winch pulled about by a wire operated through a block system which gave an advantage of seventeen, for a total pull of 21×20×17, or . In order to increase the leverage, the wire passed over a wooden strut arrangement (a bent) which stood on the bottom of the ship about high.
Oil had been removed from the ship through the bottom. The ship was lightened by air inside the hull. There was a large amount of weight in the ship which may have been removed prior to righting, but not all could be accessed. About one-third of the ammuni |
https://en.wikipedia.org/wiki/Arabidopsis%20thaliana%20responses%20to%20salinity | As a model organism, the Arabidopsis thaliana response to salinity is studied to aid understanding of other more economically important crops.
High concentration of salt in the soil has negative effects on plants. For example, it reduces the yield that crop plants can produce in 7% of the land. On the other side, some plants show adaptations to changes in soil salinity, in that the plant's exposure to salt initiates certain mechanisms for cell osmotic regulation and causes changes in this plant's water obtaining and loss behaviors. One of such plants is the model plant Arabidopsis thaliana, a member of the family Brassicaceae. Arabidopsis thaliana is native to Eurasia and was introduced to some parts of North America. It grows in rocky, sandy and disturbed terrains. It has been found in many studies that Arabidopsis thaliana showed enhanced Na+ and H+ extrusion from their cells after exposure to high salinity. Part of Arabidopsis’ range might have included high salinity soil and the plant started adapting to that.
Upon high salt exposure, Arabidopsis experiences a negative osmotic pressure gradient between the salty solution and its xylem, and it absorbs Na+ through Na+ permeable transporters. The plant then reduces the impact of high Na+ abundance by improving Na+ efflux from its cells through SOS pathway
Two different paths in the SOS pathway can activate SOS1, a molecule that causes sodium efflux. One path is the SOS2-SOS3, the other is the PLD path. This is shown in figure 1.
SOS2-SOS3 path:
After exposure to high sodium level, calcium level increases in the cytosol. SOS3 can detect elevated calcium by making a calcium-binding protein, a protein that detects high calcium level in the cytosol and binds to it.
SOS3 proteins interact with protein kinases, then get phosphorylated, which builds up the complex SOS2-SOS3 attached to calcium, then activates SOS2
Activation of SOS2 pushes it to the plasma membrane, then activates SOS1. Finally, this causes the ex |
https://en.wikipedia.org/wiki/Opaque%20binary%20blob | Opaque binary blob (OBB) is a term used in network engineering and computer science to refer to a sizeable piece of data, which looks like binary garbage from outside, by entities which do not know what that blob denotes or carries, but make sense to entities which have access permission and access functions to them. It is also a pejorative term for compiled code without the source code made available (see: binary blob).
Use in networks
At least one network protocol, Advanced Message Queuing Protocol, uses the terminology of OBB.
Use in the computer field
Android operating systems, starting with version 2.3 code named Gingerbread, use OBBs to refer in one blob to multiple files, maybe even a file system or whole file system in one file. These OBBs are available through the Storage Manager interface in Android. This is done as a means of abstraction, so multiple applications running on the operating system can more easily access the OBB. For example, if there was a map database (map OBB), multiple applications running on Android 2.3 can access the same maps. This eliminates the need to maintain different map data for different applications with similar functions and features. Many HD games on the Android platform use their own OBB files, to allow storage of large files on the device's external SD card.
Tuxedo middleware also uses OBBs to mention C and C++ arrays, or typed data buffers. This probably (input needed from experts) is the oldest reference to OBBs used in a computer system.
When a vendor distributes software in an object binary form without any mention of its inner workings or code, it is called a 'proprietary OBB' or 'proprietary blob' or just binary blob. This practice is to protect the company's intellectual property, and probably keep a competitive edge (see: proprietary software). This also prevents hackers from improving the system or subverting it. As an example, Nvidia Tegra has such a 'proprietary OBB.'
See also
Binary blob |
https://en.wikipedia.org/wiki/Hypothetical%20protein | In biochemistry, a hypothetical protein is a protein whose existence has been predicted, but for which there is a lack of experimental evidence that it is expressed in vivo. Sequencing of several genomes has resulted in numerous predicted open reading frames to which functions cannot be readily assigned. These proteins, either orphan or conserved hypothetical proteins, make up an estimated 20% to 40% of proteins encoded in each newly sequenced genome. The real evidences for the hypothetical protein functioning in the metabolism of the organism can be predicted by comparing its sequence or structure homology by considering the conserved domain analysis. Even when there is enough evidence that the product of the gene is expressed, by techniques such as microarray and mass spectrometry, it is difficult to assign a function to it given its lack of identity to protein sequences with annotated biochemical function. Nowadays, most protein sequences are inferred from computational analysis of genomic DNA sequence. Hypothetical proteins are created by gene prediction software during genome analysis. When the bioinformatic tool used for the gene identification finds a large open reading frame without a characterised homologue in the protein database, it returns "hypothetical protein" as an annotation remark.
The function of a hypothetical protein can be predicted by domain homology searches with various confidence levels. Conserved domains are available in the hypothetical proteins which need to be compared with the known family domains by which hypothetical protein could be classified into particular protein families even though they have not been in vivo investigated. The function of hypothetical protein could also be predicted by homology modelling, in which hypothetical protein has to align with known protein sequence whose three dimensional structure is known and by modelling method if structure predicted then the capability of hypothetical protein to function could b |
https://en.wikipedia.org/wiki/An%20Essay%20on%20the%20Application%20of%20Mathematical%20Analysis%20to%20the%20Theories%20of%20Electricity%20and%20Magnetism | An Essay on the Application of Mathematical Analysis to the Theories of Electricity and Magnetism is a fundamental publication by George Green in 1828, where he extends previous work of Siméon Denis Poisson on electricity and magnetism. The work in mathematical analysis, notably including what is now universally known as Green's theorem, is of the greatest importance in all branches of mathematical physics. It contains the first exposition of the theory of potential. In physics, Green's theorem is mostly used to solve two-dimensional flow integrals, stating that the sum of fluid outflows at any point inside a volume is equal to the total outflow summed about an enclosing area. In plane geometry, and in particular, area surveying, Green's theorem can be used to determine the area and centroid of plane figures solely by integrating over the perimeter.
It is in this essay that the term 'potential function' first occurs. Herein also his remarkable theorem in pure mathematics, since universally known as Green's theorem, and probably the most important instrument of investigation in the whole range of mathematical physics, made its appearance. We are all now able to understand, in a general way at least, the importance of Green's work, and the progress made since the publication of his essay in 1828. But to fully appreciate his work and subsequent progress one needs to know the outlook for the mathematico-physical sciences as it appeared to Green at this time and to realize his refined sensitiveness in promulgating his discoveries.
Overview
Poisson's electrical and magnetical investigations were generalized and extended in 1828 by George Green. Green's treatment is based on the properties of the function already used by Lagrange, Laplace, and Poisson, which represents the sum of all the electric or magnetic charges in the field, divided by their respective distances from some given point: to this function Green gave the name potential, by which it has always since been |
https://en.wikipedia.org/wiki/Cantor%20function | In mathematics, the Cantor function is an example of a function that is continuous, but not absolutely continuous. It is a notorious counterexample in analysis, because it challenges naive intuitions about continuity, derivative, and measure. Though it is continuous everywhere and has zero derivative almost everywhere, its value still goes from 0 to 1 as its argument reaches from 0 to 1. Thus, in one sense the function seems very much like a constant one which cannot grow, and in another, it does indeed monotonically grow.
It is also called the Cantor ternary function, the Lebesgue function, Lebesgue's singular function, the Cantor–Vitali function, the Devil's staircase, the Cantor staircase function, and the Cantor–Lebesgue function. introduced the Cantor function and mentioned that Scheeffer pointed out that it was a counterexample to an extension of the fundamental theorem of calculus claimed by Harnack. The Cantor function was discussed and popularized by , and .
Definition
To define the Cantor function , let be any number in and obtain by the following steps:
Express in base 3.
If the base-3 representation of contains a 1, replace every digit strictly after the first 1 by 0.
Replace any remaining 2s with 1s.
Interpret the result as a binary number. The result is .
For example:
has the ternary representation 0.02020202... There are no 1s so the next stage is still 0.02020202... This is rewritten as 0.01010101... This is the binary representation of , so .
has the ternary representation 0.01210121... The digits after the first 1 are replaced by 0s to produce 0.01000000... This is not rewritten since it has no 2s. This is the binary representation of , so .
has the ternary representation 0.21102 (or 0.211012222...). The digits after the first 1 are replaced by 0s to produce 0.21. This is rewritten as 0.11. This is the binary representation of , so .
Equivalently, if is the Cantor set on [0,1], then the Cantor function can be defined as
This f |
https://en.wikipedia.org/wiki/Thraustochytrium%20pachydermum | Thraustochytrium pachydermum is a species of heterokont. |
https://en.wikipedia.org/wiki/Netopia | Farallon, later renamed Netopia, was a computer networking company headquartered in Berkeley, and subsequently Emeryville, California, that produced a wide variety of products including bridges, repeaters and switches, and in their later Netopia incarnation, modems, routers, gateways, and Wi-Fi devices. The company also produced the NBBS (Netopia Broadband Server Software) and, as Farallon, Timbuktu remote administration software, as well as the MacRecorder, the first audio capture and manipulation products for the Macintosh (later sold to Macromedia). The company was founded in 1986 and changed its name to Netopia in 1998. Farallon originated several notable technologies, including:
PhoneNet, an implementation of AppleTalk over plain ("Cat-3") telephone wiring or, more commonly, EIA-TIA 568A/B structured cabling systems. Many versions of the product were produced, but the original product was a commercialized version of a kit developed and produced by BMUG, the Berkeley Macintosh Users Group in 1986.
The StarController, a line of LocalTalk and Ethernet bridges and switches released in 1988 which integrated directly with EIA-TIA 568A/B structured cabling systems.
EtherWave, an ADB-powered serial-to-ethernet bridge in a dongle form-factor which looked something like a manta ray. The two external ports were 10BASE-T and the serial pigtail spoke an overclocked 690kbps version of LocalTalk. This served both to allow devices without expansion busses (commonly early Macintosh computers and LaserWriter printers) to connect directly to Ethernet networks, and also to allow the daisy-chaining of multiple devices from a single Ethernet switch or bridge port. Later versions used Apple's "AAUI" version of the Attachment Unit Interface to achieve full 10mbps host connections.
AirDock, a Serial-to-IrDA gateway which allowed devices with LocalTalk ports to communicate on IrDA infrared wireless networks.
Netopia acquired multiple companies in the home networking space inclu |
https://en.wikipedia.org/wiki/International%20Cytokine%20%26%20Interferon%20Society | The International Cytokine & Interferon Society (ICIS) is a non-profit organization composed of researchers of cytokines, interferons and chemokine cell biology, molecular biology, biochemistry, and the use of biological response modifiers clinically. As the premier organization in the field of cytokine biology, it has more than 950 member scientists. Katherine A. Fitzgerald is the current president of the society.
History
Originally founded in 1988 as "The International Cytokine Society" (ICS), after having co-hosted annual meetings with the International Society for Interferon and Cytokine Research (ISICR), the two organizations merged to become the ICIS in 2013.
Journal
The ICIS manages Cytokine, a peer-reviewed scientific journal covering all aspects of cytokine biology. The journal was established in 1989 and is now published by Elsevier.
Milstein award
Each year the society selects a recipient of the Seymour & Vivian Milstein Award for excellence in interferon and cytokine research. |
https://en.wikipedia.org/wiki/Control%20track | A control track is a track that runs along an outside edge of a standard analog videotape (including VHS). The control track encodes a series of pulses, each pulse corresponding to the beginning of each frame. This allows the video tape player to synchronize its scan speed and tape speed to the speed of the recording. Thus, the recorded control track defines the speed of playback (e.g. SP, LP, EP, etc.), and it is also what drives the relative counter clock that most VCRs have.
Significance and use
The control track is used to fine-tune the tape speed during playback, so that the high speed rotating heads remained exactly on their helical tracks rather than somewhere between two adjacent tracks (known as "tracking"). Since good tracking depends on precise distances between the rotating drum and the fixed control/audio head reading the linear tracks, which usually varies by a couple of micrometers between machines due to manufacturing tolerances, most VCRs offer tracking adjustment, either manual or automatic, to correct such mismatches.
The control track is also used to hold index marks, which were normally written at the beginning of each recording session, and can be found using the VCR's index search function: this will fast-wind forward or backward to the nth specified index mark, and resume playback from there. At times, higher-end VCRs provided functions for the user to manually add and remove these marks — so that, for example, they coincide with the actual start of the television program — but this feature later became hard to find.
By the late 1990s, some high-end VCRs offered more sophisticated indexing. For example, Panasonic's Tape Library system assigned an ID number to each cassette, and logged recording information (channel, date, time and optional program title entered by the user) both on the cassette and in the VCR's memory for up to 900 recordings (600 with titles).
Control track damage
A gap in the control track signal of a videotape usua |
https://en.wikipedia.org/wiki/Chrome%20Azurol%20S | Chrome Azurol S is a histological dye used in biomedical research.
Chrome Azural S (CAS) is a common spectrophotometric reagent for detection of certain metals like aluminum which can be toxic in excess and can contribute to people with neurodegenerative disorders. CAS is used to provide quantitative and qualitative information on molecules of interest like aluminum and siderophores. Qualitatively a color change can be observed while also allowing to quantitatively determine concentration of certain ions. |
https://en.wikipedia.org/wiki/Cytoskeleton%20%28journal%29 | Cytoskeleton is a peer-reviewed scientific journal covering cytoskeletal research. The journal publishes original research pertaining to cell motility and cytoskeletons, spanning genetic and cell biological observations, biochemical, biophysical and structural studies, mathematical modeling, and theory. It was established in 1980 as Cell Motility. From 1989 to 2009 it was named Cell Motility and the Cytoskeleton, before obtaining its current name in 2010. The editor-in-chief is Julian Guttman (Simon Fraser University). According to the Journal Citation Reports, the journal has a 2020 impact factor of 2.141, ranking it 169th out of 195 journals in the category "Cell Biology". |
https://en.wikipedia.org/wiki/Mac%20OS%20Celtic | Mac OS Celtic is a character encoding used by Mac OS to represent Welsh text (like ISO 8859-14), replacing 14 of the Mac OS Roman characters with Welsh characters. This character set was developed by Michael Everson and was used for the Irish localizations of Mac OS 6.0.8 and 7.1 and for the Welsh localization of Mac OS 7.1.
Layout
The table below shows the second half of the encoding, the first half (codes 0–127) being ASCII.
Before Mac OS 8.5, the character 0xDB mapped to currency sign (¤), Unicode character U+00A4.
Before Unicode 4.1, the character 0xF0 mapped to ♣ Unicode character U+2663. |
https://en.wikipedia.org/wiki/Mir-71%20microRNA%20precursor%20family | In molecular biology mir-71 microRNA is a short RNA molecule. MicroRNAs function to regulate the expression levels of other genes by several mechanisms.
See also
MicroRNA |
https://en.wikipedia.org/wiki/Unifine%20mill | A Unifine mill is a single one-pass impact milling system which produces ultrafine-milled whole-grain wheat flour that requires no grain pre-treatment and no screening of the flour. Like the grist or stone mills that had dominated the flour industry for centuries, the bran, germ, and endosperm elements of grain are processed into a nutritious whole wheat flour in one step. Consumers had accepted whole wheat products produced by grist or stone mills. The flour produced by these mills was quite coarse as they included the bran and the germ elements of the grain.
As the nutritional value of vitamins, micronutrients, antioxidants, phytonutrients, amino acids, and fiber, were completely or relatively unknown in the late 19th century, removing the bran and the germ with the roller mill, invented at that time, was an attractive idea. With the elimination of the bran and the germ, the resulting "white" flour composed entirely of the endosperm produced an appealing product that research has since proven to be nutritionally deficient: The endosperm contains less than half of the total minerals and B-vitamins of the wheat kernel. Perhaps as significant is the lost total food value since the bran and germ represent 17% of the whole grain, and the process of eliminating the bran and shorts in the roller mill typically yields only 70 to 75% of grain weight as flour product, thus significantly reducing the human food supply as well.
History
Development of the Unifine impact (one pass) milling system began in England in the late 1930s. The goal was to develop a simple, holistic system that would pulverize all the elements of the raw material into a fine powder by impacting a high speed flywheel. It was hoped that the resulting flour, made up of smaller particles, would have baking qualities similar to the white, refined flours produced by the roller mills, yet retaining all of the bran, germ and endosperm of the whole grain.
Following World War II, with England focused on r |
https://en.wikipedia.org/wiki/Direct%20proof | In mathematics and logic, a direct proof is a way of showing the
truth or falsehood of a given statement by a straightforward combination of
established facts, usually axioms, existing lemmas and theorems, without making any further assumptions. In order to directly prove a conditional statement of the form "If p, then q", it suffices to consider the situations in which the statement p is true. Logical deduction is employed to reason from assumptions to conclusion. The type of logic employed is almost invariably first-order logic, employing the quantifiers for all and there exists. Common proof rules used are modus ponens and universal instantiation.
In contrast, an indirect proof may begin with certain hypothetical scenarios and then proceed to eliminate the uncertainties in each of these scenarios until an inescapable conclusion is forced. For example, instead of showing directly p ⇒ q, one proves its contrapositive ~q ⇒ ~p (one assumes ~q and shows that it leads to ~p). Since p ⇒ q and ~q ⇒ ~p are equivalent by the principle of transposition (see law of excluded middle), p ⇒ q is indirectly proved. Proof methods that are not direct include proof by contradiction, including proof by infinite descent. Direct proof methods include proof by exhaustion and proof by induction.
History and etymology
A direct proof is the simplest form of proof there is. The word ‘proof’ comes from the Latin word probare, which means “to test”. The earliest use of proofs was prominent in legal proceedings. A person with authority, such as a nobleman, was said to have probity, which means that the evidence was by his relative authority, which outweighed empirical testimony. In days gone by, mathematics and proof was often intertwined with practical questions – with populations like the Egyptians and the Greeks showing an interest in surveying land. This led to a natural curiosity with regards to geometry and trigonometry – particularly triangles and rectangles. These were the shapes |
https://en.wikipedia.org/wiki/Trypticase%20soy%20agar | Trypticase soy agar or tryptone soya agar (TSA) and Trypticase soy broth or tryptone soya broth (TSB) with agar are growth media for the culturing of bacteria. They are general-purpose, nonselective media providing enough nutrients to allow for a wide variety of microorganisms to grow. They are used for a wide range of applications, including culture storage, enumeration of cells (counting), isolation of pure cultures, or simply general culture.
TSA contains enzymatic digests of casein and soybean meal, which provide amino acids and other nitrogenous substances, making it a nutritious medium for a variety of organisms. Glucose is the energy source. Sodium chloride maintains the osmotic equilibrium, while dipotassium phosphate acts as buffer to maintain pH. Agar extracted from any number of organisms is used as a gelling agent.
The medium may be supplemented with blood to facilitate the growth of more fastidious bacteria or antimicrobial agents to permit the selection of various microbial groups from pure microbiota. As with any media, minor changes may be made to suit specific circumstances. TSA is frequently the base medium of other agar plate types. For example, blood agar plates (BAP) are made by enriching TSA plates with defibrinated sheep blood, and chocolate agar is made through additional cooking of BAP. Nutrient agar is also similar to TSA.
One liter of the agar contains:
15 g tryptone
5 g "soytone" – enzymatic digest of soybean meal
5 g sodium chloride
15 g agar |
https://en.wikipedia.org/wiki/Saturation%20vapor%20curve | In thermodynamics, the saturation vapor curve is the curve separating the two-phase state and the superheated vapor state in the T–s diagram (temperature–entropy diagram).
The saturated liquid curve is the curve separating the subcooled liquid state and the two-phase state in the T–s diagram.
When used in a power cycle, the fluid expansion depends strongly on the nature of this saturation curve:
A "wet" fluid shows a negative saturation vapor curve. If overheating before the expansion is limited, a two-phase state is obtained at the end of the expansion.
An "isentropic" fluid shows a vertical saturation vapor curve. It remains very close to the saturated vapor state after an hypothetical isentropic expansion.
A "dry" fluid shows a positive saturation vapor curve. It is in dry vapor state at the end of the expansion, and strongly overheated.
See also
Phase diagram
Working fluid
Working fluid selection |
https://en.wikipedia.org/wiki/Absolute%20value%20%28algebra%29 | In algebra, an absolute value (also called a valuation, magnitude, or norm, although "norm" usually refers to a specific kind of absolute value on a field) is a function which measures the "size" of elements in a field or integral domain. More precisely, if D is an integral domain, then an absolute value is any mapping |x| from D to the real numbers R satisfying:
It follows from these axioms that |1| = 1 and |-1| = 1. Furthermore, for every positive integer n,
|n| = |1 + 1 + ... + 1 (n times)| = |−1 − 1 − ... − 1 (n times)| ≤ n.
The classical "absolute value" is one in which, for example, |2|=2, but many other functions fulfill the requirements stated above, for instance the square root of the classical absolute value (but not the square thereof).
An absolute value induces a metric (and thus a topology) by
Examples
The standard absolute value on the integers.
The standard absolute value on the complex numbers.
The p-adic absolute value on the rational numbers.
If R is the field of rational functions over a field F and is a fixed irreducible element of R, then the following defines an absolute value on R: for in R define to be , where and
Types of absolute value
The trivial absolute value is the absolute value with |x|=0 when x=0 and |x|=1 otherwise. Every integral domain can carry at least the trivial absolute value. The trivial value is the only possible absolute value on a finite field because any non-zero element can be raised to some power to yield 1.
If an absolute value satisfies the stronger property |x + y| ≤ max(|x|, |y|) for all x and y, then |x| is called an ultrametric or non-Archimedean absolute value, and otherwise an Archimedean absolute value.
Places
If |x|1 and |x|2 are two absolute values on the same integral domain D, then the two absolute values are equivalent if |x|1 < 1 if and only if |x|2 < 1 for all x. If two nontrivial absolute values are equivalent, then for some exponent e we have |x|1e = |x|2 for all x. Raising an absolute |
https://en.wikipedia.org/wiki/Ensemble%20forecasting | Ensemble forecasting is a method used in or within numerical weather prediction. Instead of making a single forecast of the most likely weather, a set (or ensemble) of forecasts is produced. This set of forecasts aims to give an indication of the range of possible future states of the atmosphere. Ensemble forecasting is a form of Monte Carlo analysis. The multiple simulations are conducted to account for the two usual sources of uncertainty in forecast models: (1) the errors introduced by the use of imperfect initial conditions, amplified by the chaotic nature of the evolution equations of the atmosphere, which is often referred to as sensitive dependence on initial conditions; and (2) errors introduced because of imperfections in the model formulation, such as the approximate mathematical methods to solve the equations. Ideally, the verified future atmospheric state should fall within the predicted ensemble spread, and the amount of spread should be related to the uncertainty (error) of the forecast. In general, this approach can be used to make probabilistic forecasts of any dynamical system, and not just for weather prediction.
Instances
Today ensemble predictions are commonly made at most of the major operational weather prediction facilities worldwide, including:
National Centers for Environmental Prediction (NCEP of the US)
European Centre for Medium-Range Weather Forecasts (ECMWF)
United Kingdom Met Office
Météo-France
Environment Canada
Japan Meteorological Agency
Bureau of Meteorology (Australia)
China Meteorological Administration (CMA)
Korea Meteorological Administration
CPTEC (Brazil)
Ministry of Earth Sciences (IMD, IITM & NCMRWF) (India)
Experimental ensemble forecasts are made at a number of universities, such as the University of Washington, and ensemble forecasts in the US are also generated by the US Navy and Air Force. There are various ways of viewing the data such as spaghetti plots, ensemble means or Postage Stamps where a number o |
https://en.wikipedia.org/wiki/Heparin-binding%20EGF-like%20growth%20factor | Heparin-binding EGF-like growth factor (HB-EGF) is a member of the EGF family of proteins that in humans is encoded by the HBEGF gene.
HB-EGF-like growth factor is synthesized as a membrane-anchored mitogenic and chemotactic glycoprotein. An epidermal growth factor produced by monocytes and macrophages, due to an affinity for heparin is termed HB-EGF. It has been shown to play a role in wound healing, cardiac hypertrophy, and heart development and function. First identified in the conditioned media of human macrophage-like cells, HB-EGF is an 87-amino acid glycoprotein that displays highly regulated gene expression. Ectodomain shedding results in the soluble mature form of HB-EGF, which influences the mitogenicity and chemotactic factors for smooth muscle cells and fibroblasts. The transmembrane form of HB-EGF is the unique receptor for diphtheria toxin and functions in juxtacrine signaling in cells. Both forms of HB-EGF participate in normal physiological processes and in pathological processes including tumor progression and metastasis, organ hyperplasia, and atherosclerotic disease. HB-EGF can bind two locations on cell surfaces: heparan sulfate proteoglycans and EGF-receptor effecting cell to cell interactions.
Interactions
Heparin-binding EGF-like growth factor has been shown to interact with NRD1, Zinc finger and BTB domain-containing protein 16 and BAG1.
HB-EGF biological activities with these genes influence cell cycle progression, molecular chaperone regulation, cell survival, cellular functions, adhesion, and mediation of cell migration. The NRD1 gene codes for the protein nardilysin, an HB-EGF modulator. Zinc finger and BTB domain-containing protein 16 and BAG family molecular chaperone regulator function as co-chaperone proteins in processes involving HB-EGF.
Role in cancer
Recent studies indicate significant HB-EGF gene expression elevation in a number of human cancers as well as cancer-derived cell lines. Evidence indicates that HB-EGF plays a s |
https://en.wikipedia.org/wiki/Wake-on-ring | Wake-on-Ring (WOR), sometimes referred to as Wake-on-Modem (WOM), is a specification that allows supported computers and devices to "wake up" or turn on from a sleeping, hibernating or "soft off" state (e.g. ACPI state G1 or G2), and begin operation.
The basic premise is that a special signal is sent over phone lines to the computer through its dial-up modem, telling it to fully power-on and begin operation. Common uses were archive databases and BBSes, although hobbyist use was significant.
Fax machines use a similar system, in which they are mostly idle until receiving an incoming fax signal, which spurs operation.
This style of remote operation has mostly been supplanted by Wake-on-LAN, which is newer but works in much the same way.
See also
ACPI
RS-232 Signals, Ring Indicator
Wake-on-LAN
Additional resources
"Wake on Modem" entry from Smart Computing Encyclopedia
Networking standards
BIOS
Unified Extensible Firmware Interface
Remote control |
https://en.wikipedia.org/wiki/List%20of%20plant%20genera%20named%20for%20people%20%28Q%E2%80%93Z%29 | Since the first printing of Carl Linnaeus's Species Plantarum in 1753, plants have been assigned one epithet or name for their species and one name for their genus, a grouping of related species. Thousands of plants have been named for people, including botanists and their colleagues, plant collectors, horticulturists, explorers, rulers, politicians, clerics, doctors, philosophers and scientists. Even before Linnaeus, botanists such as Joseph Pitton de Tournefort, Charles Plumier and Pier Antonio Micheli were naming plants for people, sometimes in gratitude for the financial support of their patrons.
Early works researching the naming of plant genera include an 1810 glossary by and an etymological dictionary in two editions (1853 and 1856) by Georg Christian Wittstein. Modern works include The Gardener's Botanical by Ross Bayton, Index of Eponymic Plant Names and Encyclopedia of Eponymic Plant Names by Lotte Burkhardt, Plants of the World by Maarten J. M. Christenhusz (lead author), Michael F. Fay and Mark W. Chase, The A to Z of Plant Names by Allan J. Coombes, the four-volume CRC World Dictionary of Plant Names by Umberto Quattrocchi, and Stearn's Dictionary of Plant Names for Gardeners by William T. Stearn; these supply the seed-bearing genera listed in the first column below. Excluded from this list are genus names not accepted (as of January 2021) at Plants of the World Online, which includes updates to Plants of the World (2017).
Key
Ba = listed in Bayton's The Gardener's Botanical
Bt = listed in Burkhardt's Encyclopedia of Eponymic Plant Names
Bu = listed in Burkhardt's Index of Eponymic Plant Names
Ch = listed in Christenhusz's Plants of the World
Co = listed in Coombes's The A to Z of Plant Names
Qu = listed in Quattrocchi's CRC World Dictionary of Plant Names
St = listed in Stearn's Dictionary of Plant Names for Gardeners
In addition, Burkhardt's Index is used as a reference for every row in the table.
Genera
See also
List of plant genus names w |
https://en.wikipedia.org/wiki/Revolute%20joint | A revolute joint (also called pin joint or hinge joint) is a one-degree-of-freedom kinematic pair used frequently in mechanisms and machines. The joint constrains the motion of two bodies to pure rotation along a common axis. The joint does not allow translation, or sliding linear motion, a constraint not shown in the diagram. Almost all assemblies of multiple moving bodies include revolute joints in their designs. Revolute joints are used in numerous applications such as door hinges, mechanisms, and other uni-axial rotation devices.
A revolute joint is usually made by a pin or knuckle joint, through a rotary bearing. It enforces a cylindrical contact area, which makes it a lower kinematic pair, also called a full joint. However, If there is any clearance between the pin and hole (as there must be for motion), so-called surface contact in the pin joint actually becomes line contact.
The contact between the inner and outer cylindrical surfaces is usually assumed to be frictionless. But some use simplified models assume linear viscous damping in the form , where is the friction torque, is the relative angular velocity, and is the friction constant. Some more complex models take stiction and stribeck effect into consideration.
See also
Cylindrical joint
Kinematics
Degrees of freedom (mechanics)
Kinematic pair
Mechanical joint
Prismatic joint |
https://en.wikipedia.org/wiki/Telecommunications%20Management%20Network | The Telecommunications Management Network is a protocol model defined by ITU-T for managing open systems in a communications network. It is part of the ITU-T Recommendation series M.3000 and is based on the OSI management specifications in ITU-T Recommendation series X.700.
TMN provides a framework for achieving interconnectivity and communication across heterogeneous operations system and telecommunication networks. To achieve this, TMN defines a set of interface points for elements which perform the actual communications processing (such as a call processing switch) to be accessed by elements, such as management workstations, to monitor and control them. The standard interface allows elements from different manufacturers to be incorporated into a network under a single management control.
For communication between Operations Systems and NEs (Network Elements), it uses the Common management information protocol (CMIP) or Mediation devices when it uses Q3 interface.
The TMN layered organization is used as fundamental basis for the management software of ISDN, B-ISDN, ATM, SDH/SONET and GSM networks. It is not as commonly used for purely packet-switched data networks.
Modern telecom networks offer automated management functions and are run by operations support system (OSS) software. These manage modern telecom networks and provide the data that is needed in the day-to-day running of a telecom network. OSS software is also responsible for issuing commands to the network infrastructure to activate new service offerings, commence services for new customers, and detect and correct network faults.
Architecture
According to ITU-T M.3010 TMN has 3 architectures:
Physical architecture
Security architecture
Logical layered architecture
Logical layers
The framework identifies four logical layers of network management:
Business management Includes the functions related to business aspects, analyzes trends and quality issues, for example, or to provide a bas |
https://en.wikipedia.org/wiki/Monochord | A monochord, also known as sonometer (see below), is an ancient musical and scientific laboratory instrument, involving one (mono-) string (chord). The term monochord is sometimes used as the class-name for any musical stringed instrument having only one string and a stick shaped body, also known as musical bows. According to the Hornbostel–Sachs system, string bows are bar zithers (311.1) while monochords are traditionally board zithers (314). The "harmonical canon", or monochord is, at its least, "merely a string having a board under it of exactly the same length, upon which may be delineated the points at which the string must be stopped to give certain notes," allowing comparison.
A string is fixed at both ends and stretched over a sound box. One or more movable bridges are then manipulated to demonstrate mathematical relationships among the frequencies produced. "With its single string, movable bridge and graduated rule, the monochord (kanōn [Greek: law]) straddled the gap between notes and numbers, intervals and ratios, sense-perception and mathematical reason." However, "music, mathematics, and astronomy were [also] inexorably linked in the monochord." As a pedagogical tool for demonstrating mathematical relationships between intervals, the monochord remained in use throughout the Middle Ages.
Experimental use
The monochord can be used to illustrate the mathematical properties of musical pitch and to illustrate Mersenne's laws regarding string length and tension: "essentially a tool for measuring musical intervals". For example, when a monochord's string is open it vibrates at a particular frequency and produces a pitch. When the length of the string is halved, and plucked, it produces a pitch an octave higher and the string vibrates at twice the frequency of the original (2:1) . Half of this length will produce a pitch two octaves higher than the original—four times the initial frequency (4:1)—and so on. Standard diatonic Pythagorean tuning (Ptolemy's Di |
https://en.wikipedia.org/wiki/Euclidean%20tilings%20by%20convex%20regular%20polygons | Euclidean plane tilings by convex regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of Kepler in his Harmonices Mundi (Latin: The Harmony of the World, 1619).
Notation of Euclidean tilings
Euclidean tilings are usually named after Cundy & Rollett’s notation. This notation represents (i) the number of vertices, (ii) the number of polygons around each vertex (arranged clockwise) and (iii) the number of sides to each of those polygons. For example: 36; 36; 34.6, tells us there are 3 vertices with 2 different vertex types, so this tiling would be classed as a ‘3-uniform (2-vertex types)’ tiling. Broken down, 36; 36 (both of different transitivity class), or (36)2, tells us that there are 2 vertices (denoted by the superscript 2), each with 6 equilateral 3-sided polygons (triangles). With a final vertex 34.6, 4 more contiguous equilateral triangles and a single regular hexagon.
However, this notation has two main problems related to ambiguous conformation and uniqueness First, when it comes to k-uniform tilings, the notation does not explain the relationships between the vertices. This makes it impossible to generate a covered plane given the notation alone. And second, some tessellations have the same nomenclature, they are very similar but it can be noticed that the relative positions of the hexagons are different. Therefore, the second problem is that this nomenclature is not unique for each tessellation.
In order to solve those problems, GomJau-Hogg’s notation is a slightly modified version of the research and notation presented in 2012, about the generation and nomenclature of tessellations and double-layer grids. Antwerp v3.0, a free online application, allows for the infinite generation of regular polygon tilings through a set of shape placement stages and iterative rotation and reflection operations, obtained directly from the GomJau-Hogg’s notation.
Regular tilings
Following Grünbaum and Sheph |
https://en.wikipedia.org/wiki/Absolute%20zero | Absolute zero is the lowest limit of the thermodynamic temperature scale; a state at which the enthalpy and entropy of a cooled ideal gas reach their minimum value, taken as zero kelvin. The fundamental particles of nature have minimum vibrational motion, retaining only quantum mechanical, zero-point energy-induced particle motion. The theoretical temperature is determined by extrapolating the ideal gas law; by international agreement, absolute zero is taken as −273.15 degrees on the Celsius scale (International System of Units), which equals −459.67 degrees on the Fahrenheit scale (United States customary units or imperial units). The corresponding Kelvin and Rankine temperature scales set their zero points at absolute zero by definition.
It is commonly thought of as the lowest temperature possible, but it is not the lowest enthalpy state possible, because all real substances begin to depart from the ideal gas when cooled as they approach the change of state to liquid, and then to solid; and the sum of the enthalpy of vaporization (gas to liquid) and enthalpy of fusion (liquid to solid) exceeds the ideal gas's change in enthalpy to absolute zero. In the quantum-mechanical description, matter at absolute zero is in its ground state, the point of lowest internal energy.
The laws of thermodynamics indicate that absolute zero cannot be reached using only thermodynamic means, because the temperature of the substance being cooled approaches the temperature of the cooling agent asymptotically. Even a system at absolute zero, if it could somehow be achieved, would still possess quantum mechanical zero-point energy, the energy of its ground state at absolute zero; the kinetic energy of the ground state cannot be removed.
Scientists and technologists routinely achieve temperatures close to absolute zero, where matter exhibits quantum effects such as Bose–Einstein condensate, superconductivity and superfluidity.
Thermodynamics near absolute zero
At temperatures near , n |
https://en.wikipedia.org/wiki/List%20of%20botanists%20by%20author%20abbreviation%20%28I%E2%80%93J%29 |
A–H
To find entries for A–H, use the table of contents above.
I
I.A.Abbott – Isabella Aiona Abbott (1919–2010)
I.A.Pilát – Ignatz Anton Pilát (1820–1870)
I.Baker – Irene Baker (1918–1989)
I.Barua – Iswar Chandra Barua (born 1960)
I.Bjørnstadt (also Nordal) – Inger Nordal (born 1944)
Ickert-Bond – Stefanie M. Ickert-Bond (fl. 2001–2013)
I.C.Martind. – Isaac Comly Martindale (1842–1893)
I.C.Nielsen – Ivan Christian Nielsen (1946–2007)
Ida – Reijiro Ida (fl. 1969)
I.Deg. – Isa Degener (1924–2018)
I.D.Illar. – Irina D. Illarionova (fl. 2008)
Ietsw. – Jaan H. Ietswaart (born 1940)
I.F.Lewis – Ivey Foreman Lewis (1882–1964)
I.G.Stone – Ilma Grace Stone (1913–2001)
I.Gut. – Rosa Ivonne Gutiérrez-Sánchez (fl. 2018)
I.Hagen – Ingebrigt Severin Hagen (1852–1917)
I.I.Abramov – (1912–1990)
Iinuma – Yokusai Iinuma (1782–1865)
I.Keller – Ida Augusta Keller (1866–1932)
Ikonn. – (1931–2005)
Ik.Takah. – Ikuro Takahashi (1892–1981)
Iliff – James Iliff (1923–2014)
Iljin – (1889–1967)
Iljinsk. – Irina Alekseevna Iljinskaja (1921–2011)
I.Löw – Immanuel Löw (1854–1944)
Iltis – Hugh Hellmut Iltis (1925–2016)
Imbach – Emil J. Imbach (1897–1970)
I.M.Haring – Inez M. Haring (1875–1968)
I.M.Johnst. – Ivan Murray Johnston (1898–1960)
Immelman – Kathleen Leonore Immelman (born 1955)
I.M.Oliv. – Inge Magdalene Oliver (1947–2003)
I.M.Turner – Ian Mark Turner (born 1963)
Incarv. – Pierre Nicolas le Chéron (d')Incarville (1706–1757)
Ingold – Cecil Terence Ingold (1905–2010)
Ingram – Collingwood Ingram (1880–1981)
Ingw. – Walter Edward Theodore Ingwersen (1885–1960)
Inocencio – (born 1969)
Inoue – Inoue Hiroshi (1932–1989)
I.O.Cook – Ian O. Cook (fl. 1991)
I.Oliv. – Ian Oliver (born 1954)
I.Piña – Ignacio Piña Luján (fl. 1980)
I.Pop – Ioan Pop (1922–2018)
I.Rácz – István Rácz (born 1952)
Irmsch. – (1887–1968)
Irwin – James Bruce Irwin (1921–2012)
Isaac – Frances Margaret Leighton (later Isaac) (1909–2006) (F.M.Leight. is also used)
I.Sastre |
https://en.wikipedia.org/wiki/Thermotoga%20hypogea | Thermotoga hypogea is a hyperthermophilic organism that is a member of the order Thermotogales. It is thermophilic, xylanolytic, glucose-fermenting, strictly anaerobic and rod-shaped. The type strain of T. hypogea is SEBR 7054 (= DSM 11164). |
https://en.wikipedia.org/wiki/GF%282%29 | (also denoted , or ) is the finite field of two elements (GF is the initialism of Galois field, another name for finite fields). Notations and may be encountered although they can be confused with the notation of -adic integers.
is the field with the smallest possible number of elements, and is unique if the additive identity and the multiplicative identity are denoted respectively and , as usual.
The elements of may be identified with the two possible values of a bit and to the boolean values true and false. It follows that is fundamental and ubiquitous in computer science and its logical foundations.
Definition
GF(2) is the unique field with two elements with its additive and multiplicative identities respectively denoted and .
Its addition is defined as the usual addition of integers but modulo 2 and corresponds to the table below:
If the elements of GF(2) are seen as boolean values, then the addition is the same as that of the logical XOR operation.
Since each element equals its opposite, subtraction is thus the same operation as addition.
The multiplication of GF(2) is again the usual multiplication modulo 2 (see the table below), and on boolean variables corresponds to the logical AND operation.
GF(2) can be identified with the field of the integers modulo , that is, the quotient ring of the ring of integers Z by the ideal 2Z of all even numbers: .
Properties
Because GF(2) is a field, many of the familiar properties of number systems such as the rational numbers and real numbers are retained:
addition has an identity element (0) and an inverse for every element;
multiplication has an identity element (1) and an inverse for every element but 0;
addition and multiplication are commutative and associative;
multiplication is distributive over addition.
Properties that are not familiar from the real numbers include:
every element x of GF(2) satisfies and therefore ; this means that the characteristic of GF(2) is 2;
every element x of GF( |
https://en.wikipedia.org/wiki/Toshiba%20T1000 | The Toshiba T1000 is a discontinued laptop computer manufactured by the Toshiba Corporation in 1987. It has a similar specification to the IBM PC Convertible, with a 4.77 MHz 80C88 processor, 512 KB of RAM, and a monochrome CGA-compatible LCD. Unlike the Convertible, it includes a standard serial port and parallel port, connectors for an external monitor, and a real-time clock.
Unusually for an IBM compatible PC, the T1000 contains a 256 KB ROM with a copy of MS-DOS 2.11. This acts as a small, read-only hard drive. Alternative operating systems can still be loaded from the floppy drive, or (if present) the RAM disk.
Along with the T1200 and earlier T1100, the Toshiba T1000 was one of the early computers to feature a "laptop" form factor and battery-powered operation.
Reception
PC Magazine in 1988 named the Toshiba T1000 an "Editor's Choice" among 12 tested portable computers. One reviewer called it "the first real DOS laptop" and a plausible replacement for his Tandy 200, while another praised its durability after 60,000 miles of traveling and "incredible bargain" $800 street price. BYTE in 1989 listed the T1000 as among the "Excellence" winners of the BYTE Awards, stating that it "takes portability to the limit ... as self-contained as you can get and still have a real computer that can handle real-world workloads." Noting that it was available for as little as $850, the magazine reported that "Many of us are in love with this one." In the same issue, Jerry Pournelle praised it as a "little gem". While acknowledging that it cost more than the TRS-80 Model 100 and NEC PC-8201, he believed that "you get quite a lot for the added weight and price", and reported that "Many writers swear by the T1000. David Drake loves his."
Specification
Software Compatibility
Compatible with software written for the IBM PC/XT using a color graphics adapter (CGA) display
Interfaces
RGB (CGA) color video port
Composite B&W monochrome video port
RS-232-C serial port
Parallel |
https://en.wikipedia.org/wiki/Mycroft%20%28software%29 | Mycroft is a free and open-source software virtual assistant that uses a natural language user interface. Its code was formerly copyleft, but is now under a permissive license. It is named after a fictional computer from the 1966 science fiction novel The Moon Is a Harsh Mistress.
History
Inspiration for Mycroft came when Ryan Sipes and Joshua Montgomery were visiting a makerspace in Kansas City, MO, where they came across a simple and basic intelligent virtual assistant project. They were interested in the technology, but did not like its inflexibility. Montgomery believes that the burgeoning industry of intelligent personal assistance poses privacy concerns for users, and has promised that Mycroft will protect privacy through its open source machine learning platform.
Mycroft AI, Inc., has won several awards, including the prestigious Techweek's KC Launch competition in 2016. They were part of the Sprint Accelerator 2016 class in Kansas City and joined 500 Startups Batch 20 in February 2017. The company accepted a strategic investment from Jaguar Land Rover during this same time period. The company had raised more than $2.5 million from institutional investors before they opted to offer shares of the company to the public through StartEngine, an equity crowdfunding platform.
In early 2023, Mycroft AI ceased development.
Software
Mycroft voice stack
Mycroft provides free software for most parts of the voice stack.
Wake Word
Mycroft does Wake Word spotting, also called keyword spotting, through its Precise Wake Word engine. Prior to Precise becoming the default Wake Word engine, Mycroft employed PocketSphinx. Instead of being based on phoneme recognition, Precise uses a trained recurrent neural network to distinguish between sounds which are, and which aren't Wake Words.
Speech to text
Mycroft is partnering with Mozilla's Common Voice Project to leverage their DeepSpeech speech to text software.
Intent parsing
Mycroft uses an intent parser called Ad |
https://en.wikipedia.org/wiki/BKM%20algorithm | The BKM algorithm is a shift-and-add algorithm for computing elementary functions, first published in 1994 by Jean-Claude Bajard, Sylvanus Kla, and Jean-Michel Muller. BKM is based on computing complex logarithms (L-mode) and exponentials (E-mode) using a method similar to the algorithm Henry Briggs used to compute logarithms. By using a precomputed table of logarithms of negative powers of two, the BKM algorithm computes elementary functions using only integer add, shift, and compare operations.
BKM is similar to CORDIC, but uses a table of logarithms rather than a table of arctangents. On each iteration, a choice of coefficient is made from a set of nine complex numbers, 1, 0, −1, i, −i, 1+i, 1−i, −1+i, −1−i, rather than only −1 or +1 as used by CORDIC. BKM provides a simpler method of computing some elementary functions, and unlike CORDIC, BKM needs no result scaling factor. The convergence rate of BKM is approximately one bit per iteration, like CORDIC, but BKM requires more precomputed table elements for the same precision because the table stores logarithms of complex operands.
As with other algorithms in the shift-and-add class, BKM is particularly well-suited to hardware implementation. The relative performance of software BKM implementation in comparison to other methods such as polynomial or rational approximations will depend on the availability of fast multi-bit shifts (i.e. a barrel shifter) or hardware floating point arithmetic.
Overview
In order to solve the equation
the BKM algorithm takes advantage of a basic property of logarithms
Using Pi notation, this identity generalizes to
Because any number can be represented by a product, this allows us to choose any set of values which multiply to give the value we started with. In computer systems, it's much faster to multiply and divide by multiples of 2, but because not every number is a multiple of 2, using is a better option than a more simple choice of . Since we want to start with large cha |
https://en.wikipedia.org/wiki/Mormyroidea | The Mormyroidea (synonymy: Mormyriformes) are a superfamily (formerly an order) of fresh water fishes endemic to Africa that, together with the families Hiodontidae, Osteoglossidae, Pantodontidae and Notopteridae, represents one of the main groups of living Osteoglossiformes. They stand out for their use of weak electric fields, which they use to orient themselves, reproduce, feed, and communicate.
There is no consensus regarding its superior biological classification as some experts point out that it belongs to the suborder Osteoglossoidei, while others to the Notopteroidei. In either case, the mormyriformes include the gymnarchids and mormyrids and represent the largest superfamily within the order Osteoglossiformes with about two hundred and thirty-three subordinate taxa that are distributed across various watersheds existing throughout tropical Africa south of the Sahara, including the Nile, Turkana, Gambia, and northern South Africa.
These fish have a large brain and an unusual intelligence, they feed on benthic and allochthonous invertebrates, as well as some crustaceans found in marshy and sandy areas of rivers and lakes. Most of its species are sociable, and although their reproductive form is little known, they generally reproduce during the rainy season and their electrical organs transmit signals with the capacity to influence their reproductive and hormonal behavior.
According to the International Union for Conservation of Nature (IUCN), the conservation status of 66.7% of the species is Least Concern and 10.8% is Threatened Species. Furthermore, according to the same institution, the extinction rate of the taxon — at least in the northern region of the African continent — reaches 44.4%, while 55.6% of the individuals are threatened.
Etymology
The term Mormyriformes derives from Greek mormyros, μορμύρος, μόρμυρος, a species of fish that would probably be Lithognathus mormyrus, and from Latin forma, with the same connotation as the English form.
It |
https://en.wikipedia.org/wiki/Aflatoxin | Aflatoxins are various poisonous carcinogens and mutagens that are produced by certain molds, particularly Aspergillus species. The fungi grow in soil, decaying vegetation and various staple foodstuffs and commodities such as hay, sweetcorn, wheat, millet, sorghum, cassava, rice, chili peppers, cottonseed, peanuts, tree nuts, sesame seeds, sunflower seeds, and various spices. In short, the relevant fungi grow on almost any crop or food. When such contaminated food is processed or consumed, the aflatoxins enter the general food supply. They have been found in both pet and human foods, as well as in feedstocks for agricultural animals. Animals fed contaminated food can pass aflatoxin transformation products into eggs, milk products, and meat. For example, contaminated poultry feed is the suspected source of aflatoxin-contaminated chicken meat and eggs in Pakistan.
Children are particularly affected by aflatoxin exposure, which is associated with stunted growth, delayed development, liver damage, and liver cancer. An association between childhood stunting and aflatoxin exposure has been reported in some studies but could not be detected in all. Furthermore, a causal relationship between childhood stunting and aflatoxin exposure has yet to be conclusively shown by epidemiological studies, though such investigations are underway. Adults have a higher tolerance to exposure, but are also at risk. No animal species is immune. Aflatoxins are among the most carcinogenic substances known. After entering the body, aflatoxins may be metabolized by the liver to a reactive epoxide intermediate or hydroxylated to become the less harmful aflatoxin M1.
Aflatoxin poisoning most commonly results from ingestion, but the most toxic aflatoxin compound, B1, can permeate through the skin.
The United States Food and Drug Administration (FDA) action levels for aflatoxin present in food or feed is 20 to 300 ppb. The FDA has had occasion to declare both human and pet food recalls as a preca |
https://en.wikipedia.org/wiki/Library%20of%20Congress%20Living%20Legend | A Library of Congress Living Legend was someone recognized by the Library of Congress for creative contributions to American life. Those honored include artists, writers, activists, film makers, physicians, entertainers, sports figures, and public servants. Librarian of Congress Carla Hayden retired the program in 2018.
List of honorees
Hank Aaron (d. 2021)
Madeleine Albright (d. 2022)
Muhammad Ali (d. 2016)
Mario Andretti
Ernie Banks (d. 2015)
Harry Belafonte (d. 2023)
Tony Bennett (d. 2023)
James H. Billington (d. 2018)
Big Bird (original performer Caroll Spinney d. 2019)
Larry Bird
Herblock (d. 2001)
Judy Blume
Julian Bond (d. 2015)
T. Berry Brazelton (d. 2018)
Gwendolyn Brooks (d. 2000)
Dave Brubeck (d. 2012)
Kobe Bryant (d. 2020)
William F. Buckley, Jr. (d. 2008)
Carol Burnett
Laura Bush
Ben Carson
Benny Carter (d. 2003)
Johnny Cash (d. 2003)
Vinton Cerf
Ray Charles (d. 2004)
Linda Chavez
Julia Child (d. 2004)
Beverly Cleary (d. 2021)
David Copperfield
Bill Cosby
Walter Cronkite (d. 2009)
Merce Cunningham (d. 2009)
Michael DeBakey (d. 2008)
Sylvia Earle
Marian Wright Edelman
Ahmet Ertegun (d. 2006)
Suzanne Farrell
John Kenneth Galbraith (d. 2006)
Andrew Goodpaster (d. 2005)
Stephen Jay Gould (d. 2002)
Katharine Graham (d. 2001)
Archie Green (d. 2009)
Thomas Hampson
Herbie Hancock
Mickey Hart
Al Hirschfeld (d. 2003)
Bob Hope (d. 2003)
Marta Casals Istomin
Glenn R. Jones (d. 2015)
Quincy Jones
Jenette Kahn
Max Kampelman (d. 2013)
George Kennan (d. 2005)
Jackie Joyner Kersee
B.B. King (d. 2015)
Billie Jean King
Jeane Kirkpatrick (d. 2006)
John Kluge (d. 2010)
Ursula K. Le Guin (d. 2018)
Annie Leibovitz
Miguel León-Portilla (d. 2019)
Carl Lewis
John Lewis (d. 2020)
Mario Vargas Llosa
Alan Lomax (d. 2002)
Yo-Yo Ma
Robert McCloskey (d. 2003)
David McCullough (d. 2022)
Mark McGwire
Rita Moreno
Toni Morrison (d. 2019)
Odetta (d. 2008)
Gordon Parks (d. 2006)
Dolly Parton
Katherine Paterson
I |
https://en.wikipedia.org/wiki/Pit%20connection | In algal anatomy, a pit connection is a hole in the septum between two algal cells, and is found only in the red algae − specifically, all orders except the Porphyridiales and haploid Bangiales. They are often stoppered with proteinaceous "pit plugs". By contrast, many fungi (only ascomycetes and basidiomycetes, as most other groups lack septa) contain septal pores − an unrelated phenomenon.
Characteristics
A sieve-like membrane may cover the pit in living algae, but in the majority of algae a plug forms, they likely limit the transfer of metabolites between neighbouring cells.
Formation
Primary pit connections are formed between cells in the same filament, derived from the same parent cell by its division. Such connections are always single, and usually circular; this is a result of their method of formation. The septum is formed as the walls of a filament grow inwards, dividing the cell; this results in a hole in the middle of the tube where the walls don't quite merge. Thus pit connections are visible in the youngest of septa, widening as the septum thickens, until in some cases they may ultimately occupy the entire septum.
Secondary connections, by contrast, occur between unrelated cells, and serve a role in transferring cell contents and nutrients. They may even form between cells of different species, as in the parasite Holmsella. |
https://en.wikipedia.org/wiki/Homological%20integration | In the mathematical fields of differential geometry and geometric measure theory, homological integration or geometric integration is a method for extending the notion of the integral to manifolds. Rather than functions or differential forms, the integral is defined over currents on a manifold.
The theory is "homological" because currents themselves are defined by duality with differential forms. To wit, the space of -currents on a manifold is defined as the dual space, in the sense of distributions, of the space of -forms on . Thus there is a pairing between -currents and -forms , denoted here by
Under this duality pairing, the exterior derivative
goes over to a boundary operator
defined by
for all . This is a homological rather than cohomological construction. |
https://en.wikipedia.org/wiki/Bastion%20host | A bastion host is a special-purpose computer on a network specifically designed and configured to withstand attacks, so named by analogy to the bastion, a military fortification. The computer generally hosts a single application or process, for example, a proxy server or load balancer, and all other services are removed or limited to reduce the threat to the computer. It is hardened in this manner primarily due to its location and purpose, which is either on the outside of a firewall or inside of a demilitarized zone (DMZ) and usually involves access from untrusted networks or computers. These computers are also equipped with special networking interfaces to withstand high-bandwidth attacks through the internet.
Definitions
The term is generally attributed to a 1990 article discussing firewalls by Marcus J. Ranum, who defined a bastion host as "a system identified by the firewall administrator as a critical strong point in the network security. Generally, bastion hosts will have some degree of extra attention paid to their security, may undergo regular audits, and may have modified software".
It has also been described as "any computer that is fully exposed to attack by being on the public side of the DMZ, unprotected by a firewall or filtering router. Firewalls and routers, anything that provides perimeter access control security can be considered bastion hosts. Other types of bastion hosts can include web, mail, DNS, and FTP servers. Due to their exposure, a great deal of effort must be put into designing and configuring bastion hosts to minimize the chances of penetration".
Placement
There are two common network configurations that include bastion hosts and their placement. The first requires two firewalls, with bastion hosts sitting between the first "outside world" firewall, and an inside firewall, in a DMZ. Often, smaller networks do not have multiple firewalls, so if only one firewall exists in a network, bastion hosts are commonly placed outside the fir |
https://en.wikipedia.org/wiki/Angiogenin | Angiogenin (ANG) also known as ribonuclease 5 is a small 123 amino acid protein that in humans is encoded by the ANG gene. Angiogenin is a potent stimulator of new blood vessels through the process of angiogenesis. Ang hydrolyzes cellular RNA, resulting in modulated levels of protein synthesis and interacts with DNA causing a promoter-like increase in the expression of rRNA. Ang is associated with cancer and neurological disease through angiogenesis and through activating gene expression that suppresses apoptosis.
Function
Angiogenin is a key protein implicated in angiogenesis in normal and tumor growth. Angiogenin interacts with endothelial and smooth muscle cells resulting in cell migration, invasion, proliferation and formation of tubular structures. Ang binds to actin of both smooth muscle and endothelial cells to form complexes that activate proteolytic cascades which upregulate the production of proteases and plasmin that degrade the laminin and fibronectin layers of the basement membrane. Degradation of the basement membrane and extracellular matrix allows the endothelial cells to penetrate and migrate into the perivascular tissue. Signal transduction pathways activated by Ang interactions at the cellular membrane of endothelial cells produce extracellular signal-related kinase1/2 (ERK1/2) and protein kinase B/Akt. Activation of these proteins leads to invasion of the basement membrane and cell proliferation associated with further angiogenesis. The most important step in the angiogenesis process is the translocation of Ang to the cell nucleus. Once Ang has been translocated to the nucleus, it enhances rRNA transcription by binding to the CT-rich (CTCTCTCTCTCTCTCTCCCTC) angiogenin binding element (ABE) within the upstream intergenic region of rDNA, which subsequently activates other angiogenic factors that induce angiogenesis.
However, angiogenin is unique among the many proteins that are involved in angiogenesis in that it is also an enzyme with an amino |
https://en.wikipedia.org/wiki/Young%E2%80%93Simpson%20syndrome | Young–Simpson syndrome (YSS) is a rare congenital disorder with symptoms including hypothyroidism, heart defects, facial dysmorphism, cryptorchidism in males, hypotonia, intellectual disability, and postnatal growth retardation.
Other symptoms include transient hypothyroidism, macular degeneration, and torticollis. The condition was discovered in 1987 and the name arose from the individuals who first reported the syndrome. An individual with
YSS has been identified with having symptoms to a similar syndrome known as Ohdo Blepharophimosis syndrome, showing that it is quite difficult to diagnose the correct condition based on the symptoms present. Some doctors therefore consider these syndromes to be the same.
Signs and symptoms
Ohdo syndrome, SBBYSS variant, typically occurs early in life, with most diagnoses occurring at birth or during infancy. Patients with SBBYSS variant of Ohdo syndrome are characterized with hyperthyroidism, heart defects, facial dysmorphism, hypotonia, mental retardation, and postnatal growth retardation.
Skeletal
Underdeveloped patellae (kneecaps) are the most common skeletal symptom associated with the syndrome. Additionally, abnormally long thumbs and great toes as well as dental abnormalities are also common among patients. Joint stiffness involving the hips, knees, and ankles is common which impairs movement among patients. Polydactyly, camptodactyly, clinodactyly, brachydactyly, syndactyly, club feet, and abnormalities of the spine and/or ribs may affect patients with the syndrome.
Facial
Facial signs and symptoms are most distinguishable among patients of this syndrome. Patients with Ohdo syndrome, SBBYS syndrome are characterized to have non-expressive mask-life faces. Additionally, patients may have features such as broad nasal bridges, nose with rounded top, narrowing of the eye opening, and prominent cheeks. Patients with the syndrome may also have abnormalities of the lacrimal glands and may be born with an opening in the |
https://en.wikipedia.org/wiki/William%20Revelle | William Roger Revelle (born c. 1944) is a psychology professor at Northwestern University working in personality psychology. Revelle studies the biological basis of personality and motivation, psychometric theory, the structure of daily mood, and models of attention and memory.
Early life and education
Revelle was raised in La Jolla, California. His father, Roger Revelle, was an early theorist in global warming.
Revelle graduated from Pomona College in 1965, abandoning a mathematics major in favor of psychology. He spent two years in Sarawak, Malaysia, as a volunteer in the Peace Corps before earning his PhD in psychology from the University of Michigan in 1973. He became a member of the Northwestern Faculty in 1973.
Career
Revelle has previously served as the President (2005-2009) of the International Society for the Study of Individual Differences (ISSID), the President (2008-2009) of the Association for Research in Personality (ARP), and the President (1984) of the Society of Multivariate Experimental Psychology (SMEP).
Currently, he is vice-chair of the Governing Board of the Bulletin of the Atomic Scientists, having previously served as Chair (2009-2012). He also serves as the President (2018–present) of the International Society for Intelligence Research (ISIR).
Additionally, he is a Fellow of the American Association for the Advancement of Science (AAAS; 1996–present), the Association for Psychological Science (APS; 1994–present), the American Psychological Association (APA Division 5; 2011–present), and the Society for Personality and Social Psychology (SPSP; 2015–present).
He resides in Evanston, Illinois.
Bibliography
Selected publications
Software |
https://en.wikipedia.org/wiki/Munsk%C3%A4nkarna | Munskänkarna is a Swedish and Finnish wine tasting organization with over 20,000 members. The Swedish word "Munskänk" (corresponding to Mundschenk in German) is synonymous with "cup-bearer". It is used to refer to a single member, with the organisation's name "Munskänkarna" being the plural definite form. The organisation was established in Stockholm in 1958 and has continuously expanded with chapters in other locations, some outside of Sweden. In 2000, the chapters in Finland had become numerous enough to split off to form their own Finnish language organisation, Suomen Munskänkarna. In 2002, a Swedish language organisation in Finland called Svenska Munskänkarna i Finland was also formed. All three organisations are established as non-profit organisations.
As of 2006, the Swedish branch of Munskänkarna had over 19,000 members in 137 chapters, of which 129 in Sweden and 8 in other countries. In Finland there were 13 chapters in the Finnish-speaking organisation and 9 chapters in the Swedish-speaking organisation. Munskänkarna claims to be the world's largest wine tasting organisation.
Activities of Munskänkarna primarily include wine tastings and wine-related courses. The courses are organised much in the same way as those of the Wine & Spirit Education Trust: there are several different levels of progressing difficulty, and both a theoretical and a practical (i.e., blind tasting of wine) test at each level, plus a thesis at the highest level. Munskänkarna in Sweden publishes a magazine (Munskänken) where, among other things, most new wines appearing in the Swedish monopoly wine stores (Systembolaget) are reviewed. |
https://en.wikipedia.org/wiki/Real%20point | In geometry, a real point is a point in the complex projective plane with homogeneous coordinates for which there exists a nonzero complex number such that , , and are all real numbers.
This definition can be widened to a complex projective space of arbitrary finite dimension as follows:
are the homogeneous coordinates of a real point if there exists a nonzero complex number such that the coordinates of
are all real.
A point which is not real is called an imaginary point.
Context
Geometries that are specializations of real projective geometry, such as Euclidean geometry, elliptic geometry or conformal geometry may be complexified, thus embedding the points of the geometry in a complex projective space, but retaining the identity of the original real space as special. Lines, planes etc. are expanded to the lines, etc. of the complex projective space. As with the inclusion of points at infinity and complexification of real polynomials, this allows some theorems to be stated more simply without exceptions and for a more regular algebraic analysis of the geometry.
Viewed in terms of homogeneous coordinates, a real vector space of homogeneous coordinates of the original geometry is complexified. A point of the original geometric space is defined by an equivalence class of homogeneous vectors of the form , where is an nonzero complex value and is a real vector. A point of this form (and hence belongs to the original real space) is called a real point, whereas a point that has been added through the complexification and thus does not have this form is called an imaginary point.
Real subspace
A subspace of a projective space is real if it is spanned by real points.
Every imaginary point belongs to exactly one real line, the line through the point and its complex conjugate. |
https://en.wikipedia.org/wiki/Icosahedral%20number | An icosahedral number is a figurate number that represents an icosahedron. The nth icosahedral number is given by the formula
The first such numbers are 1, 12, 48, 124, 255, 456, 742, 1128, 1629, 2260, 3036, 3972, 5083, … .
History
The first study of icosahedral numbers appears to have been by René Descartes, around 1630, in his De solidorum elementis. Prior to Descartes, figurate numbers had been studied by the ancient Greeks and by Johann Faulhaber, but only for polygonal numbers, pyramidal numbers, and cubes. Descartes introduced the study of figurate numbers based on the Platonic solids and some semiregular polyhedra; his work included the icosahedral numbers. However, De solidorum elementis was lost, and not rediscovered until 1860. In the meantime, icosahedral numbers had been studied again by other mathematicians, including Friedrich Wilhelm Marpurg in 1774, Georg Simon Klügel in 1808, and Sir Frederick Pollock in 1850. |
https://en.wikipedia.org/wiki/Pazend | Pazend () or Pazand (; ) is one of the writing systems used for the Middle Persian language. It was based on the Avestan alphabet, a phonetic alphabet originally used to write Avestan, the language of the Avesta, the primary sacred texts of Zoroastrianism.
Pazend's principal use was for writing the commentaries (Zend) on and/or translations of the Avesta. The word "Pazend" ultimately derives from the Avestan words paiti zainti, which can be translated as either "for commentary purposes" or "according to understanding" (phonetically).
Pazend had the following characteristics, both of which are to be contrasted with Pahlavi, which is one of the other systems used to write Middle Persian:
Pazend was a variant of the Avestan alphabet (Din dabireh), which was a phonetic alphabet. In contrast, Pahlavi script was only an abjad.
Pazend did not have ideograms. In contrast, ideograms were an identifying feature of the Pahlavi system, and these huzvarishn were words borrowed from Semitic languages such as Aramaic that continued to be spelled as in Aramaic (in Pahlavi script) but were pronounced as the corresponding word in Persian.
In combination with its religious purpose, these features constituted a "sanctification" of written Middle Persian. The use of the Avestan alphabet to write Middle Persian required the addition of one symbol to the Avestan alphabet: This character, to represent the phoneme of Middle Persian, had not previously been needed.
Following the fall of the Sassanids, after which Zoroastrianism came to be gradually supplanted by Islam, Pazend lost its purpose and soon ceased to be used for original composition. In the late 11th or early 12th century, Indian Zoroastrians (the Parsis) began translating Avestan or Middle Persian texts into Sanskrit and Gujarati. Some Middle Persian texts were also transcribed into the Avestan alphabet. The latter process, being a form of interpretation, was known as 'pa-zand'. "Pazand texts, transcribed phonetically, re |
https://en.wikipedia.org/wiki/Mbed | Mbed is a development platform and real-time operating system (RTOS) designed for internet-connected devices that utilize 32-bit ARM Cortex-M microcontrollers. These internet-enabled devices are often categorized under the Internet of Things (IoT) umbrella. The Mbed project is a collaborative effort led by Arm Holdings, in partnership with various technology companies and contributors.
Features and Capabilities
Mbed provides a comprehensive environment for developing IoT applications, offering features such as:
Device Management: Capabilities for remotely managing connected devices.
Security: Built-in layers of security protocols to ensure data integrity and safeguard against unauthorized access.
Modular Libraries: A suite of modular software libraries to aid rapid development and deployment.
Ecosystem Compatibility: Designed to be compatible with various sensors, actuators, and cloud services, providing a versatile platform for IoT solutions.
Development Environment
The platform offers a robust development environment that includes:
Mbed OS: The core real-time operating system that offers standardized APIs and supports C/C++ programming languages.
Mbed Studio: An IDE (Integrated Development Environment) that provides debugging tools, code editors, and other resources to facilitate development.
Mbed CLI: Command-line tools for advanced users who prefer a text-based interface.
Collaborative Development
The Mbed project is a collaborative initiative involving Arm Holdings and a wide range of technology partners, including semiconductor manufacturers, cloud service providers, and IoT solution vendors. This collaborative model allows for a rich ecosystem of compatible hardware and software components.
Applications
Mbed is widely used in a variety of IoT applications ranging from smart home automation to industrial IoT systems. Its flexibility and security features make it suitable for diverse deployments, including healthcare, agriculture, and transport |
https://en.wikipedia.org/wiki/Hilbert%E2%80%93Schmidt%20operator | In mathematics, a Hilbert–Schmidt operator, named after David Hilbert and Erhard Schmidt, is a bounded operator that acts on a Hilbert space and has finite Hilbert–Schmidt norm
where is an orthonormal basis. The index set need not be countable. However, the sum on the right must contain at most countably many non-zero terms, to have meaning. This definition is independent of the choice of the orthonormal basis.
In finite-dimensional Euclidean space, the Hilbert–Schmidt norm is identical to the Frobenius norm.
||·|| is well defined
The Hilbert–Schmidt norm does not depend on the choice of orthonormal basis. Indeed, if and are such bases, then
If then As for any bounded operator, Replacing with in the first formula, obtain The independence follows.
Examples
An important class of examples is provided by Hilbert–Schmidt integral operators.
Every bounded operator with a finite-dimensional range (these are called operators of finite rank) is a Hilbert–Schmidt operator.
The identity operator on a Hilbert space is a Hilbert–Schmidt operator if and only if the Hilbert space is finite-dimensional.
Given any and in , define by , which is a continuous linear operator of rank 1 and thus a Hilbert–Schmidt operator;
moreover, for any bounded linear operator on (and into ), .
If is a bounded compact operator with eigenvalues of , where each eigenvalue is repeated as often as its multiplicity, then is Hilbert–Schmidt if and only if , in which case the Hilbert–Schmidt norm of is .
If , where is a measure space, then the integral operator with kernel is a Hilbert–Schmidt operator and .
Space of Hilbert–Schmidt operators
The product of two Hilbert–Schmidt operators has finite trace-class norm; therefore, if A and B are two Hilbert–Schmidt operators, the Hilbert–Schmidt inner product can be defined as
The Hilbert–Schmidt operators form a two-sided *-ideal in the Banach algebra of bounded operators on .
They also form a Hilbert space, denoted |
https://en.wikipedia.org/wiki/%CE%94P | ΔP (Delta P) is a mathematical term symbolizing a change (Δ) in pressure (P).
Uses
Young–Laplace equation
Darcy–Weisbach equation
Given that the head loss hf expresses the pressure loss Δp as the height of a column of fluid,
where ρ is the density of the fluid. The Darcy–Weisbach equation can also be written in terms of pressure loss:
Lung compliance
In general, compliance is defined by the change in volume (ΔV) versus the associated change in pressure (ΔP), or ΔV/ΔP:
During mechanical ventilation, compliance is influenced by three main physiologic factors:
Lung compliance
Chest wall compliance
Airway resistance
Lung compliance is influenced by a variety of primary abnormalities of lung parenchyma, both chronic and acute. Airway resistance is typically increased by bronchospasm and airway secretions. Chest wall compliance can be decreased by fixed abnormalities (e.g. kyphoscoliosis, morbid obesity) or more variable problems driven by patient agitation while intubated.
Calculating compliance on minute volume (VE: ΔV is always defined by tidal volume (VT), but ΔP is different for the measurement of dynamic vs. static compliance.
Dynamic compliance (Cdyn)
where PIP = peak inspiratory pressure (the maximum pressure during inspiration), and PEEP = positive end expiratory pressure. Alterations in airway resistance, lung compliance and chest wall compliance influence Cdyn.
Static compliance (Cstat)
where Pplat = plateau pressure. Pplat is measured at the end of inhalation and prior to exhalation using an inspiratory hold maneuver. During this maneuver, airflow is transiently (~0.5 sec) discontinued, which eliminates the effects of airway resistance. Pplat is never > PIP and is typically < 3-5 cmH2O lower than PIP when airway resistance is normal.
See also
Pressure measurement
Pressure drop
Head loss |
https://en.wikipedia.org/wiki/Archimedean%20ordered%20vector%20space | In mathematics, specifically in order theory, a binary relation on a vector space over the real or complex numbers is called Archimedean if for all whenever there exists some such that for all positive integers then necessarily
An Archimedean (pre)ordered vector space is a (pre)ordered vector space whose order is Archimedean.
A preordered vector space is called almost Archimedean if for all whenever there exists a such that for all positive integers then
Characterizations
A preordered vector space with an order unit is Archimedean preordered if and only if for all non-negative integers implies
Properties
Let be an ordered vector space over the reals that is finite-dimensional. Then the order of is Archimedean if and only if the positive cone of is closed for the unique topology under which is a Hausdorff TVS.
Order unit norm
Suppose is an ordered vector space over the reals with an order unit whose order is Archimedean and let
Then the Minkowski functional of (defined by ) is a norm called the order unit norm.
It satisfies and the closed unit ball determined by is equal to (that is,
Examples
The space of bounded real-valued maps on a set with the pointwise order is Archimedean ordered with an order unit (that is, the function that is identically on ).
The order unit norm on is identical to the usual sup norm:
Examples
Every order complete vector lattice is Archimedean ordered.
A finite-dimensional vector lattice of dimension is Archimedean ordered if and only if it is isomorphic to with its canonical order.
However, a totally ordered vector order of dimension can not be Archimedean ordered.
There exist ordered vector spaces that are almost Archimedean but not Archimedean.
The Euclidean space over the reals with the lexicographic order is Archimedean ordered since for every but
See also |
https://en.wikipedia.org/wiki/National%20Take%20Back%20Initiative | The National Take Back Initiative is a voluntary program in the United States, encouraging the public to return excess or expired drugs. The take back events occur twice annually, in the spring and in the fall. The program is coordinated by the Drug Enforcement Administration (DEA).
Drug take-back programs are a common and environmentally supportive method for avoiding the improper disposal of unused pharmaceuticals. One of the objectives of the program is to avoid disposal of drugs by flushing them to the local sewage system, which causes water pollution. Municipal sewage treatment plants are not designed to treat pharmaceuticals, and the drugs tend to pass through the plant untreated, to the receiving water body.
Background
In 2010, according to the Centers for Disease Control and Prevention, enough pharmaceuticals were prescribed to medicate every American adult around-the-clock for one month. Some of these prescriptions and over the counter drugs decay in the home and are highly susceptible to diversion, misuse, and abuse. Often, more Americans currently abuse prescription drugs than the number of those using cocaine, hallucinogens, heroin, and inhalants combined, according to the 2010 National Survey on Drug Use and Health. Studies show that the majority of teens who abuse prescription drugs obtain them from family or friends for free, including from the home medicine cabinet. Improper disposal methods can pose both safety and environmental hazards.
Legislation and national policy
Four days following the DEA’s first Take-Back Day on September 25, 2010, Congress approved and amendment to the Controlled Substances Act. This action provided the DEA with the option to develop a permanent process for people to safely and conveniently dispose of their prescription drugs. President Barack Obama signed the Secure and Responsible Drug Disposal Act of 2010, and the DEA immediately began installing regulations for a more permanent solution.
The DEA’s Take-Back events |
https://en.wikipedia.org/wiki/Chiral%20magnetic%20effect | Chiral magnetic effect (CME) is the generation of electric current along an external magnetic field induced by chirality imbalance. Fermions are said to be chiral if they keep a definite projection of spin quantum number on momentum. The CME is a macroscopic quantum phenomenon present in systems with charged chiral fermions, such as the quark–gluon plasma, or Dirac and Weyl semimetals. The CME is a consequence of chiral anomaly in quantum field theory; unlike conventional superconductivity or superfluidity, it does not require a spontaneous symmetry breaking. The chiral magnetic current is non-dissipative, because it is topologically protected: the imbalance between the densities of left-handed and right-handed chiral fermions is linked to the topology of fields in gauge theory by the Atiyah-Singer index theorem.
The experimental observation of CME in a Dirac semimetal ZrTe5 was reported in 2014 by a group from Brookhaven National Laboratory and Stony Brook University. The material showed a conductivity increase in the Lorentz force-free configuration of the parallel magnetic and electric fields.
In 2015, the STAR detector at Relativistic Heavy Ion Collider, Brookhaven National Laboratory and ALICE: A Large Ion Collider Experiment at the Large Hadron Collider, CERN presented an experimental evidence for the existence of CME in the quark–gluon plasma.
See also
Euler–Heisenberg Lagrangian
Chiral anomaly |
https://en.wikipedia.org/wiki/Magnetic-core%20memory | Magnetic-core memory was the predominant form of random-access computer memory for 20 years between about 1955 and 1975. Such memory is often just called core memory, or, informally, core.
Core memory uses toroids (rings) of a hard magnetic material (usually a semi-hard ferrite) as transformer cores, where each wire threaded through the core serves as a transformer winding. Two or more wires pass through each core. Magnetic hysteresis allows each of the cores to "remember", or store a state.
Each core stores one bit of information. A core can be magnetized in either the clockwise or counter-clockwise direction. The value of the bit stored in a core is zero or one according to the direction of that core's magnetization. Electric current pulses in some of the wires through a core allow the direction of the magnetization in that core to be set in either direction, thus storing a one or a zero. Another wire through each core, the sense wire, is used to detect whether the core changed state.
The process of reading the core causes the core to be reset to a zero, thus erasing it. This is called destructive readout.
When not being read or written, the cores maintain the last value they had, even if the power is turned off. Therefore, they are a type of non-volatile memory.
Using smaller cores and wires, the memory density of core slowly increased, and by the late 1960s a density of about 32 kilobits per cubic foot (about 0.9 kilobits per litre) was typical. However, reaching this density required extremely careful manufacture, which was almost always carried out by hand in spite of repeated major efforts to automate the process. The cost declined over this period from about $1 per bit to about 1 cent per bit. The introduction of the first semiconductor memory chips in the late 1960s, which initially created static random-access memory (SRAM), began to erode the market for core memory. The first successful dynamic random-access memory (DRAM), the Intel 1103, followed i |
https://en.wikipedia.org/wiki/Binary%20operation | In mathematics, a binary operation or dyadic operation is a rule for combining two elements (called operands) to produce another element. More formally, a binary operation is an operation of arity two.
More specifically, an internal binary operation on a set is a binary operation whose two domains and the codomain are the same set. Examples include the familiar arithmetic operations of addition, subtraction, and multiplication. Other examples are readily found in different areas of mathematics, such as vector addition, matrix multiplication, and conjugation in groups.
An operation of arity two that involves several sets is sometimes also called a binary operation. For example, scalar multiplication of vector spaces takes a scalar and a vector to produce a vector, and scalar product takes two vectors to produce a scalar. Such binary operations may also be called binary functions.
Binary operations are the keystone of most structures that are studied in algebra, in particular in semigroups, monoids, groups, rings, fields, and vector spaces.
Terminology
More precisely, a binary operation on a set is a mapping of the elements of the Cartesian product to :
Because the result of performing the operation on a pair of elements of is again an element of , the operation is called a closed (or internal) binary operation on (or sometimes expressed as having the property of closure).
If is not a function but a partial function, then is called a partial binary operation. For instance, division of real numbers is a partial binary operation, because one can't divide by zero: is undefined for every real number . In both model theory and classical universal algebra, binary operations are required to be defined on all elements of . However, partial algebras generalize universal algebras to allow partial operations.
Sometimes, especially in computer science, the term binary operation is used for any binary function.
Properties and examples
Typical examples of binary |
https://en.wikipedia.org/wiki/Gardner%E2%80%93Salinas%20braille%20codes | The Gardner–Salinas braille codes are a method of encoding mathematical and scientific notation linearly using braille cells for tactile reading by the visually impaired. The most common form of Gardner–Salinas braille is the 8-cell variety, commonly called GS8. There is also a corresponding 6-cell form called GS6.
The codes were developed as a replacement for Nemeth Braille by John A. Gardner, a physicist at Oregon State University, and Norberto Salinas, an Argentinian mathematician.
The Gardner–Salinas braille codes are an example of a compact human-readable markup language. The syntax is based on the LaTeX system for scientific typesetting.
Table of Gardner–Salinas 8-dot (GS8) braille
The set of lower-case letters, the period, comma, semicolon, colon, exclamation mark, apostrophe, and opening and closing double quotes are the same as in Grade-2 English Braille.
Digits
Apart from 0, this is the same as the Antoine notation used in French and Luxembourgish Braille.
Upper-case letters
GS8 upper-case letters are indicated by the same cell as standard English braille (and GS8) lower-case letters, with dot #7 added.
Compare Luxembourgish Braille.
Greek letters
Dot 8 is added to the letter forms of International Greek Braille to derive Greek letters:
Characters differing from English Braille
ASCII symbols and mathematical operators
Text symbols
Math and science symbols
Markup
* Encodes the fraction-slash for the single adjacent digits/letters as numerator and denominator.
* Used for any > 1 digit radicand.
** Used for markup to represent inkprint text.
Typeface indicators
Shape symbols
Set theory |
https://en.wikipedia.org/wiki/IEEE%20Transactions%20on%20Wireless%20Communications | IEEE Transactions on Wireless Communications is a monthly peer-reviewed scientific journal published by the IEEE Communications Society. It covers all areas of wireless communication systems and networks. It was established in 2002 and the editor-in-chief is currently Junshan Zhang (Arizona State University). According to the Journal Citation Reports, the journal has a 2021 impact factor of 7.016. |
https://en.wikipedia.org/wiki/Superior%20ligament%20of%20epididymis | The superior ligament of the epididymis is a strand of fibrous tissue which is covered by a reflection of the tunica vaginalis and connects the upper aspect of the epididymis with the testis.
Sexual anatomy
Ligaments |
https://en.wikipedia.org/wiki/Network%20simplex%20algorithm | In mathematical optimization, the network simplex algorithm is a graph theoretic specialization of the simplex algorithm. The algorithm is usually formulated in terms of a minimum-cost flow problem. The network simplex method works very well in practice, typically 200 to 300 times faster than the simplex method applied to general linear program of same dimensions.
History
For a long time, the existence of a provably efficient network simplex algorithm was one of the major open problems in complexity theory, even though efficient-in-practice versions were available. In 1995 Orlin provided the first polynomial algorithm with runtime of where is maximum cost of any edges. Later Tarjan improved this to using dynamic trees in 1997. Strongly polynomial dual network simplex algorithms for the same problem, but with a higher dependence on the numbers of edges and vertices in the graph, have been known for longer.
Overview
The network simplex method is an adaptation of the bounded variable primal simplex algorithm. The basis is represented as a rooted spanning tree of the underlying network, in which variables are represented by arcs, and the simplex multipliers by node potentials. At each iteration, an entering variable is selected by some pricing strategy, based on the dual multipliers (node potentials), and forms a cycle with the arcs of the tree. The leaving variable is the arc of the cycle with the least augmenting flow. The substitution of entering for leaving arc, and the reconstruction of the tree is called a pivot. When no non-basic arc remains eligible to enter, the optimal solution has been reached.
Applications
The network simplex algorithm can be used to solve many practical problems including,
Transshipment problem
Hitchcock transportation problem
Assignment problem
Chains and antichains in partially ordered sets
System of distinct representatives
Covers and matching in bipartite graphs
Caterer problem |
https://en.wikipedia.org/wiki/Bogdanov%20map | In dynamical systems theory, the Bogdanov map is a chaotic 2D map related to the Bogdanov–Takens bifurcation. It is given by the transformation:
The Bogdanov map is named after Rifkat Bogdanov.
See also
List of chaotic maps |
https://en.wikipedia.org/wiki/Manuel%20Moschopoulos | Manuel Moschopoulos (Latinized as Manuel Moschopulus; ), was a Byzantine commentator and grammarian, who lived during the end of the 13th and the beginning of the 14th century and was an important figure in the Palaiologan Renaissance. Moschopoulos means "little calf," and is probably a nickname.
Life
Moschopoulos was a student of Maximos Planudes and possibly his successor as a head of a school in Constantinople, where he taught throughout his life. A mysterious and ill-documented excursion into politics led to his imprisonment for a while.
Works
His chief work is Erotemata grammaticalia (), in the form of question and answer, based upon an anonymous epitome of grammar, and supplemented by a lexicon of Attic nouns. He was also the author of scholia on the first and second books of the Iliad, on Hesiod, Theocritus, Pindar and other classical and later authors; of riddles, letters, and a treatise on the magic squares. His grammatical treatises formed the foundation of the labors of such promoters of classical studies as Manuel Chrysoloras, Theodorus Gaza, Guarini, and Constantine Lascaris. As an editor, while making many false conjectures, he was responsible for clearing many long-standing errors in the traditional texts. His comments when original, are mainly lexicographical.
Moschopoulos' treatise on magic squares is dedicated to Nicholas Rhabdas, his contemporary mathematician.
Other works include an anti-Latin theological pamphlet. A selection from his works under the title of Manuelis Moschopuli opuscula grammatica was published by F. N. Titze (Leipzig, 1822); see also Karl Krumbacher, Geschichte der byzantinischen Litteratur (1897) and M. Treu, Maximi monachi Planudis epistulae (1890), p. 208. |
https://en.wikipedia.org/wiki/Gordon%20Woods | Gordon Woods (July 14, 1952 – August 20, 2009) was an American veterinary scientist who co-created Idaho Gem, the world's first cloned mule. Idaho Gem was the first clone born in the horse family.
Early life
Woods was raised in northern Idaho. He obtained his bachelor's degree from the University of Idaho. Woods received a doctorate of veterinary medicine from Colorado State University. He later obtained a second doctorate in reproductive biology from the University of Wisconsin–Madison.
Career
Woods first taught veterinary medicine at Cornell University.
Woods founded the Northwest Equine Reproduction Laboratory in Idaho in 1986. He moved to Moscow, Idaho, and he taught at Washington State University in Pullman, WA until he joined the faculty of the University of Idaho in 1988 as an Animal and Veterinary Science Department professor.
Woods, along with colleagues Dr. Dirk Vanderwall of University of Idaho and Dr. Ken White of Utah State University, led a team of scientists in 2003 that cloned Idaho Gem, the world's first cloned mule. The cloning of Idaho Gem was a part of a larger scientific study intended to understand human diseases. Horses, mules, and other equines have lower rates of cancer than humans. Woods, Vanderwall, White and their team hoped that the cloning of mules and other equines would provide an important scientific insight into the different cancer rates between humans and equines. Woods was particularly interested in the role that calcium played in the development of cancer. Horses and mules have less calcium in their cell walls than humans.
Woods' colleague, Dirk Vanderwall, later explained Woods' goals during the Idaho Gem cloning, "That certainly was another primary focus of Gordon's...to use the horse as a model to try to understand age-onset diseases in people. Gordon's hypothesis was that excessive intracellular calcium in human cells could be an underlying factor in age-onset diseases."
Woods departed the University of Idaho in 2007 a |
https://en.wikipedia.org/wiki/Claude%20Ambrose%20Rogers | Claude Ambrose Rogers FRS (1 November 1920 – 5 December 2005) was an English mathematician who worked in analysis and geometry.
Research
Much of his work concerns the Geometry of Numbers, Hausdorff Measures, Analytic Sets, Geometry and Topology of Banach Spaces, Selection Theorems and Finite-dimensional Convex Geometry. In the theory of Banach spaces and summability, he proved the Dvoretzky–Rogers lemma and the Dvoretzky–Rogers theorem, both with Aryeh Dvoretzky. He constructed a counterexample to a conjecture related to the Busemann–Petty problem. In the geometry of numbers, the Rogers bound is a bound for dense packings of spheres.
Awards and honours
Rogers was elected a Fellow of the Royal Society (FRS) in 1959. He won the London Mathematical Society's De Morgan Medal in 1977.
Personal life
Rogers was married to children's writer Joan North. They had two daughters, Jane and Petra. |
https://en.wikipedia.org/wiki/Hybridization%20probe | In molecular biology, a hybridization probe (HP) is a fragment of DNA or RNA of usually 15–10000 nucleotide long which can be radioactively or fluorescently labeled. HP can be used to detect the presence of nucleotide sequences in analyzed RNA or DNA that are complementary to the sequence in the probe. The labeled probe is first denatured (by heating or under alkaline conditions such as exposure to sodium hydroxide) into single stranded DNA (ssDNA) and then hybridized to the target ssDNA (Southern blotting) or RNA (northern blotting) immobilized on a membrane or in situ.
To detect hybridization of the probe to its target sequence, the probe is tagged (or "labeled") with a molecular marker of either radioactive or (more recently) fluorescent molecules. Commonly used markers are 32P (a radioactive isotope of phosphorus incorporated into the phosphodiester bond in the probe DNA), digoxigenin, a non-radioactive, antibody-based marker, biotin or fluorescein. DNA sequences or RNA transcripts that have moderate to high sequence similarity to the probe are then detected by visualizing the hybridized probe via autoradiography or other imaging techniques. Normally, either X-ray pictures are taken of the filter, or the filter is placed under UV light. Detection of sequences with moderate or high similarity depends on how stringent the hybridization conditions were applied—high stringency, such as high hybridization temperature and low salt in hybridization buffers, permits only hybridization between nucleic acid sequences that are highly similar, whereas low stringency, such as lower temperature and high salt, allows hybridization when the sequences are less similar.
Hybridization probes used in DNA microarrays refer to DNA covalently attached to an inert surface, such as coated glass slides or gene chips, to which a mobile cDNA target is hybridized. Depending on the method, the probe may be synthesized using the phosphoramidite method, or it can be generated and labeled |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.