source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Laura%20DeMarco | Laura Grace DeMarco is a professor of mathematics at Harvard University, whose research concerns dynamical systems and complex analysis.
Career
DeMarco received her Ph.D. from Harvard University in 2002 under the supervision of Curtis T. McMullen. She held an NSF Postdoctoral Fellowship and was an L. E. Dickson Instructor at the University of Chicago from September 2002 to August 2005. She was also an assistant professor at the University of Chicago, and then she moved to the University of Illinois at Chicago, where she was tenured and promoted to professor. She moved to Northwestern University in 2014, and was promoted to Henry S. Noyes Professor of Mathematics in 2019, before she moved to Harvard University in 2020.
DeMarco is an organizer of GROW (Graduate Research Opportunities for Women) undergraduate conference.
Awards and honors
In 2013, DeMarco became a fellow of the American Mathematical Society in the inaugural class of fellows. In 2017, she received the AMS Ruth Lyttle Satter Prize in Mathematics in Mathematics for her contributions to complex dynamics, potential theory, and the emerging field of arithmetic dynamics. In 2020, DeMarco was elected a member of the National Academy of Sciences.
She was an invited speaker at the 2018 International Congress of Mathematicians, speaking in the section on Dynamical Systems and Ordinary Differential Equations. She is the 2023 AWM-AMS Emmy Noether Lecturer in recognition of her "fundamental and influential contributions to complex dynamics, arithmetic dynamics, and arithmetic geometry."
Her work with Holly Krieger and Hexi Ye, "Uniform Manin–Mumford for a family of genus 2 curves", published in the Annals of Mathematics, won the 2020 Alexanderson Award of the American Institute of Mathematics.
Further reading
References
Year of birth missing (living people)
Living people
Women mathematicians
Dynamical systems theorists
Fellows of the American Mathematical Society
Harvard University alumni
American women ma |
https://en.wikipedia.org/wiki/WebLOAD | WebLOAD is load testing tool, performance testing, stress test web applications. This web and mobile load testing and analysis tool is from RadView Software. Load testing tool WebLOAD combines performance, scalability, and integrity as a single process for the verification of web and mobile applications. It can simulate hundreds of thousands of concurrent users making it possible to test large loads and report bottlenecks, constraints, and weak points within an application.
Using its multi-protocol support, WebLOAD simulates traffic of hundreds of thousands of users and provides analysis data on how the application behaves under load. WebLOAD monitors and incorporates statistics from the various components of the system under test: servers, application server, database, network, load-balancer, firewall, etc., and can also monitor the End User Experience and Service Level Agreement (SLA) compliance in production environments.
History
WebLOAD was first launched in August 1997. Since its launch, RadView has released more than 20 versions of WebLOAD.
Features
WebLOAD's features include:
IDE An integrated development environment for visually recording, editing & debugging load test scripts. WebLOAD's proxy-based recorder records HTTP activity. Test are generated in JavaScript and can be enhanced and edited using various tools in the IDE.
Correlation Automatic correlation of dynamic values such as Session IDs, enables a script to be executed dynamically with multiple virtual clients.
Load Generation WebLOAD generates load from on-premises machines or from the cloud.
Analytics A set of predefined analysis reports provides performance data, helping users identify bottlenecks. Reports and analysis data can also be viewed remotely via a customizable Web Dashboard.
PMM Collects server-side statistics during test runs, providing users with additional data for root-cause analysis.
Web Dashboard Analyzing performance test results from any browser or Mobile device.
S |
https://en.wikipedia.org/wiki/LM358 | The LM358 is a low-power dual operational amplifier integrated circuit, originally introduced by National Semiconductor.
It supports an operating voltage of +3 to +32 volts (single power supply) or ±1.5 to ±16 volts (dual power supplies).
Input voltage can range from −0.3 to +32 volts with single power supply. Small negative input voltages below ground are acceptable because the bipolar junction transistors at the input stage are configured such that their base-emitter junction voltage provides just enough voltage differential between the collector and base for the transistors to function.
References
Further reading
The LM358 is now an industry-standard part manufactured by multiple companies, all of which publish datasheets:
Diodes Incorporated: datasheet, webpage
Fairchild Semiconductor: datasheet, webpage
ON Semiconductor: datasheet, webpage
ST Microelectronics: datasheet, webpage
Texas Instruments: datasheet, webpage
National Semiconductor: datasheet, supporting materials for MIT course 6.115.
Linear integrated circuits |
https://en.wikipedia.org/wiki/Swatantra%202014 | Swatantra 2014 (from the Indic word Swatantra meaning 'independent', or 'free' as in 'free will') was the fifth international free software conference organized by the International Centre for Free and Open Source Software (ICFOSS), an autonomous organization set up by the Government of Kerala, India for the propagation of FOSS. It was held in Thiruvananthapuram, Kerala, India during 18–20 December 2014. Among supporting organizations of the conference were the Free Software Foundation of India, Centre for Internet and Society (India), Software Freedom Law Center (India) and Swathantra Malayalam Computing.
Objective
According to Satish Babu, Director, ICFOSS, free software is capable of offering a freedom-enhancing, robust and reliable alternative, with additional economic advantages, compared to proprietary software, and therefore that free software could find application in the public and private sector organizations in the field of, inter alia, education, arts, and culture.
Event
The theme of the event was "Free Software for a Free World". Over 200 delegates attended the conference. The inaugural speech was delivered by Richard Stallman, founder of the free software movement who was of the view that this software should enable access without compromising the security of one's identity. He also told that cameras installed on streets was a threat to the privacy of the public.
Other than Stallman, notable personalities like Smári McCarthy and Nina Paley attended the event.
Prof. Rahul De of IIM Bangalore, a speaker at the event, reported during his presentation that over could be saved in India, if free software was used for ICT in Education in the 320,000 schools across the country.
Sessions
The following parallel sessions were held:
Indian Language Computing
Wikipedia/Wikimedia activities
Computational Biology & Sciences
Free Culture
Freedom on the Cloud
Free Mobile Platforms
Education & Spoken Tutorials
Surveillance, security and privacy & Inte |
https://en.wikipedia.org/wiki/List%20of%20ecoregions%20with%20high%20endemism | This list is for ecoregions with high endemism. According to the World Wide Fund for Nature, the following ecoregions have the highest percentage of endemic plants.
Ecoregions
Fynbos (South Africa)
Hawaiian tropical dry forests (United States)
Hawaiian tropical rainforests (United States)
Kwongan heathlands (Australia)
Madagascar dry deciduous forests (Madagascar)
Madagascar lowland forests (Madagascar)
New Caledonia dry forests (New Caledonia)
New Caledonia rain forests (New Caledonia)
Sierra Madre de Oaxaca pine-oak forests (Mexico)
Sierra Madre del Sur pine-oak forests (Mexico)
Luzon montane rainforests (Philippines)
Luzon rainforests (Philippines)
Luzon tropical pine forests (Philippines)
Mindanao montane rain forests (Philippines)
Mindanao-Eastern Visayas rain forests (Philippines)
Palawan rain forests (Philippines)
See also
Centre of endemism
Endemism in the Hawaiian Islands
References
Botany
Ecology
Endemism |
https://en.wikipedia.org/wiki/Valve%20exerciser | A valve exerciser is a device that operates a valve periodically in order to prevent it from becoming so stiff that it no longer works. Valves that are left in a static position for a long time may corrode, or become blocked with mineral deposits. Electronic valve exercisers can provide information on the health of a valve by monitoring the required operating torque.
References
Piping
Plumbing |
https://en.wikipedia.org/wiki/List%20of%20schools%20for%20quantitative%20psychology | This is a nonexhaustive list of schools that offer degrees in quantitative psychology or related fields such as psychometrics or research methodology. Programs are typically offered in departments of psychology, educational psychology, or human development. Various organizations, including the American Psychological Association's Division 5, the Canadian Psychological Association, the National Council for Measurement in Education, and the Society of Multivariate Experimental Psychology have compiled lists of programs.
Graduate degree programs
Structure
Records are listed alphabetically by university in descending order. Within a given university, records are sorted by degree (doctorate, then master's). Inclusion criteria are described on the talk page.
University section
University – The university listed is the primary institution/organization which grants the degree. The link provided links to the Wikipedia page for the university.
Department – The department listed is the primary department which grants the degree. The link provided links to the department's website.
Program section
Terminal degree – This is the final degree granted to the student within that degree track. Many doctoral programs in the US have joint MA/Ph.D programs. Those degrees are listed within the same record under the final degree granted (e.g., Doctorate of Philosophy). The link provided directs to the description of the degree.
Program – This is the name of the degree program. The link typically directs to the degree requirements. Many times the Terminal Degree page and the Program page are the same.
Specialty – This subsection identifies various tracks within a degree program. Not all programs have this level of specialty. If applicable, the link directs to the primary page detailing the specialization requirements.
Faculty – This section lists the tenured/tenure-track faculty currently listed on the program's website with a primary appointment. Emeritus professors are exclud |
https://en.wikipedia.org/wiki/Stanko%20Bilinski | Stanko Bilinski (22 April 1909 in Našice – 6 April 1998 in Zagreb) was a Croatian mathematician and academician. He was a professor at the University of Zagreb and a fellow of the Croatian Academy of Sciences and Arts.
In 1960, he discovered a rhombic dodecahedron of the second kind, the Bilinski dodecahedron. Like the standard rhombic dodecahedron, this convex polyhedron has 12 congruent rhombus sides, but they are differently shaped and arranged. Bilinski's discovery corrected a 75-year-old omission in Evgraf Fedorov's classification of convex polyhedra with congruent rhombic faces.
References
Further reading
1909 births
1998 deaths
Croatian mathematicians
Academic staff of the University of Zagreb
Members of the Croatian Academy of Sciences and Arts
20th-century Croatian mathematicians
People from Našice
Geometers |
https://en.wikipedia.org/wiki/List%20of%20largest%20reservoirs%20in%20Wyoming | The following is a list of the fourteen reservoirs, in the United States state of Wyoming, that contain at least when at full capacity. In addition to in-stream reservoirs, the list includes enhanced natural lakes, notably Jackson Lake. With five of the fourteen largest reservoirs in the state, the North Platte River is the most dammed river in the state, and provides much of the state's water storage.
These reservoirs provide of storage. (Some of this storage capacity, or of the water held in it, is allocated otherwise than for normal use within the state.)
List
See also
List of dams and reservoirs in Wyoming
List of largest reservoirs in the United States
List of rivers in Wyoming
List of lakes in Wyoming
Notes
References
Reservoirs in Wyoming
Colorado River Storage Project
United States Bureau of Reclamation dams |
https://en.wikipedia.org/wiki/List%20of%20music%20archivists | This is a list of music archivists.
Music archivists
Santiago Álvarez
Alan Leeds
Alan Lomax
David Marks
Todd Matshikiza
Eleanor Mlotek
Einojuhani Rautavaara
Arthur Warren Darley
Tiny Tim
See also
List of sound archives
List of archivists
Music archivists |
https://en.wikipedia.org/wiki/Green%20engineering | Green engineering not
the design of products and processes by applying financially and technologically feasible principles to achieve one or more of the following goals: (1) decrease in the amount of pollution that is generated by a construction or operation of a facility, (2) minimization of human population exposure to potential hazards (including reducing toxicity), (3) improved uses of matter and energy throughout the life cycle of the product and processes, and (4) maintaining economic efficiency and viability. Green engineering can an overarching framework for all design disciplines.
History
The concept of green engineering began between 1966 and 1970 during the Organization for Economic Cooperation and Development under the name: "The Ten Ecological Commandments for Earth Citizens". The idea was expressed visually as the following cycle starting with the first commandment and ending with the tenth:
Respect the laws of nature
Learn as responsible earth citizens from the wisdom of nature
Do not reduce plurality richness, abundance of living species
Do not pollute
Face earth-responsibility every day for our children and our children's children
Follow the principle of nature precaution/sustainability in all economic activities!
Act as you speak!
Prefer small clever and intelligent problem solutions, including rational and emotional intelligence factors
Information about environmental damage belongs to mankind - not (only) to privilieged big business
Listen carefully [to] what your own body tells you about [the] impact of your very personal social and natural environment upon your wellbeing
The idea was then presented by Peter Menke-Glückert at the United Nations Educational, Scientific, and Cultural Conference at Paris in 1968. These principles are similar to the Principles of Green Engineering in that each individual has an intrinsic responsibility to uphold these values. The Ten Ecological Commandments for Earth Citizens is thought by Dr. Płotka |
https://en.wikipedia.org/wiki/Unum%20%28number%20format%29 | Unums (universal numbers) are a family of number formats and arithmetic for implementing real numbers on a computer, proposed by John L. Gustafson in 2015. They are designed as an alternative to the ubiquitous IEEE 754 floating-point standard. The latest version is known as posits.
Type I Unum
The first version of unums, formally known as Type I unum, was introduced in Gustafson's book The End of Error as a superset of the IEEE-754 floating-point format. The defining features of the Type I unum format are:
a variable-width storage format for both the significand and exponent, and
a u-bit, which determines whether the unum corresponds to an exact number (u = 0), or an interval between consecutive exact unums (u = 1). In this way, the unums cover the entire extended real number line [−∞,+∞].
For computation with the format, Gustafson proposed using interval arithmetic with a pair of unums, what he called a ubound, providing the guarantee that the resulting interval contains the exact solution.
William M. Kahan and Gustafson debated unums at the Arith23 conference.
Type II Unum
Type II Unums were introduced in 2016 as a redesign of Unums that broke IEEE-754 compatibility.
Posit (Type III Unum)
In February 2017, Gustafson officially introduced Type III unums, posits for fixed floating-point-like values and valids for interval arithmetic. In March 2021, a standard was ratified and published by the Posit Working Group.
Posits are a hardware-friendly version of unum where difficulties faced in the original type I unum due to its variable size are resolved. Compared to IEEE 754 floats of similar size, posits offer a bigger dynamic range and more fraction bits for values with magnitude near 1 (but fewer fraction bits for very large or very small values), and Gustafson claims that they offer better accuracy. Studies confirm that for some applications, posits with quire out-perform floats in accuracy. Posits have superior accuracy in the range near one, where most |
https://en.wikipedia.org/wiki/Ioana%20Dumitriu | Ioana Dumitriu (born July 6, 1976) is a Romanian-American mathematician who works as a professor of mathematics at the University of California, San Diego. Her research interests include the theory of random matrices, numerical analysis, scientific computing, and game theory.
Life
Dumitriu is the daughter of two Romanian electrical engineering professors from Bucharest. Early in her life she was identified as having mathematical talent, and at age 11 won a national mathematics contest. She entered mathematics training camps in preparation for participation on the Romanian team at the International Mathematical Olympiad, although her highest level of participation in the olympiad was the national semifinal.
As a 19-year-old freshman at NYU, Dumitriu already was taking graduate-level classes in mathematics. She graduated summa cum laude from NYU in 1999 with a B.A. in mathematics and a minor in computer science. She earned her Ph.D. in 2003 from the Massachusetts Institute of Technology under the supervision of Alan Edelman, with a thesis on Eigenvalue statistics for beta-ensembles. After postdoctoral research as a Miller Research Fellow at the University of California, Berkeley, she joined the faculty of the University of Washington in 2006, moving to UC San Diego in 2019.
Awards and honors
Dumitriu won the Alice T. Schafer prize for excellence in mathematics by an undergraduate woman in 1996. Also in 1996, as a sophomore at New York University, Dumitriu became the first woman to become a Putnam Fellow, meaning that she earned one of the top five scores at the William Lowell Putnam Mathematical Competition. In 1995, 1996, and 1997 she won the Elizabeth Lowell Putnam Award that is given to the top woman in the contest, a record that was not matched until ten years later when Alison Miller also won the same award in three consecutive years.
She won the Leslie Fox Prize for Numerical Analysis (given to a young numerical analysis researcher who excels both mathemati |
https://en.wikipedia.org/wiki/Ricardo%20Ma%C3%B1%C3%A9 | Ricardo Mañé Ramirez (Montevideo, 14 January 1948 – Montevideo, 9 March 1995) was a Uruguayan mathematician, known for his contributions to dynamical systems and ergodic theory. He was a doctoral student of Jacob Palis at IMPA.
He was an invited speaker at the International Congresses of Mathematicians of 1983 and 1994 and is a recipient of the 1994 TWAS Prize.
Selected publications
"Expansive diffeomorphisms", Proceedings of the Symposium on Dynamical Systems (University of Warwick, 1974) Lecture Notes in Mathematics Vol. 468 pp. 162–174, Springer-Verlag, 1975.
"Persistent manifolds are normally hyperbolic", Transactions of the American Mathematical Society, Vol. 246, (Dec., 1978), pp. 261–283.
"On the dimension of the compact invariant sets of certain non-linear maps", Springer, Lectures Notes in Mathematics Vol. 898 (1981) 230–242.
"An ergodic closing lemma", Annals of Mathematics Second Series, Vol. 116, No. 3 (Nov., 1982), pp. 503–540.
with P. Sad. and D. Sullivan: "On the dynamics of rational maps", Annales Scientifiques l'École Normale Supérieure, Vol. 16, Issue 2, pp. 193–217, 1983.
"A proof of the C1 stability conjecture", Publications Mathématiques de l'IHÉS, Vol. 66, pp. 161–210, 1987
"On the topological entropy of geodesic flows". Journal of Differential Geometry, Vol. 45 (1997), no. 1, pp. 74–93.
Ergodic Theory and Differentiable Dynamics (1987, translated from Portuguese into English by Silvio Levy)
Selected Works, Springer, 2017
References
1948 births
1995 deaths
20th-century Uruguayan mathematicians
Members of the Brazilian Academy of Sciences
Dynamical systems theorists
Instituto Nacional de Matemática Pura e Aplicada alumni
Instituto Nacional de Matemática Pura e Aplicada researchers
TWAS laureates |
https://en.wikipedia.org/wiki/Spherical%20neutron%20polarimetry | Spherical neutron polarimetry (SNP) is a form of neutron polarimetry that measures the polarization of neutrons both before and after scattering. It uses controlled magnetic fields to manipulate the spin of the neutrons, which are then separated by the Meissner effect, allowing polarization to be measured.
References
Neutron-related techniques
Polarization (waves) |
https://en.wikipedia.org/wiki/Appendix%20H | Appendix H is the name of an infamous appendix in Pentium Processor Family Developer's Manual, Volume 3. This appendix contained reference to documentation only available under a legally binding NDA.
This NDAed documentation described various new features introduced in the Pentium processor, notably Virtual Mode Extensions (VME) and 4 MB paging. VME added an additional feature to the existing virtual 8086 mode (which was introduced with the 80386 processor), and included optimized handling and delivery of interrupts to and from virtual machines by reducing the number of traps required. VME should not be confused with the later Intel VT virtualization technology aiming at full virtualization of the CPU, rather than just the 8086 mode.
The appendix was referenced by the official chapters in the documentation, provoking irritation among the public who was not allowed to access the detailed descriptions. This started a movement with observers trying to reverse-engineer the information in various ways. Notably, Robert Collins (writing in Dr. Dobb's Journal) and Christian Ludloff (owner of the sandpile.org website) played a major role in this. From the Pentium Pro, the information in Appendix H was moved to the main documentation chapters, making the features publicly documented.
See also
Virtual 8086 Mode Enhancements (VME)
VME (CONFIG.SYS directive) (in OS/2)
QEMM
References
X86 architecture |
https://en.wikipedia.org/wiki/Orientation%20of%20a%20vector%20bundle | In mathematics, an orientation of a real vector bundle is a generalization of an orientation of a vector space; thus, given a real vector bundle π: E →B, an orientation of E means: for each fiber Ex, there is an orientation of the vector space Ex and one demands that each trivialization map (which is a bundle map)
is fiberwise orientation-preserving, where Rn is given the standard orientation. In more concise terms, this says that the structure group of the frame bundle of E, which is the real general linear group GLn(R), can be reduced to the subgroup consisting of those with positive determinant.
If E is a real vector bundle of rank n, then a choice of metric on E amounts to a reduction of the structure group to the orthogonal group O(n). In that situation, an orientation of E amounts to a reduction from O(n) to the special orthogonal group SO(n).
A vector bundle together with an orientation is called an oriented bundle. A vector bundle that can be given an orientation is called an orientable vector bundle.
The basic invariant of an oriented bundle is the Euler class. The multiplication (that is, cup product) by the Euler class of an oriented bundle gives rise to a Gysin sequence.
Examples
A complex vector bundle is oriented in a canonical way.
The notion of an orientation of a vector bundle generalizes an orientation of a differentiable manifold: an orientation of a differentiable manifold is an orientation of its tangent bundle. In particular, a differentiable manifold is orientable if and only if its tangent bundle is orientable as a vector bundle. (note: as a manifold, a tangent bundle is always orientable.)
Operations
To give an orientation to a real vector bundle E of rank n is to give an orientation to the (real) determinant bundle of E. Similarly, to give an orientation to E is to give an orientation to the unit sphere bundle of E.
Just as a real vector bundle is classified by the real infinite Grassmannian, oriented bundles are classified by th |
https://en.wikipedia.org/wiki/Cobordism%20ring | In mathematics, the oriented cobordism ring is a ring where elements are oriented cobordism classes of manifolds, the multiplication is given by the Cartesian product of manifolds and the addition is given as the disjoint union of manifolds. The ring is graded by dimensions of manifolds and is denoted by
where consists of oriented cobordism classes of manifolds of dimension n. One can also define an unoriented cobordism ring, denoted by . If O is replaced U, then one gets the complex cobordism ring, oriented or unoriented.
In general, one writes for the cobordism ring of manifolds with structure B.
A theorem of Thom says:
where MO is the Thom spectrum.
Notes
References
External links
bordism ring in nLab
The unoriented cobordism ring, a blog post by Akhil Mathew
Algebraic topology |
https://en.wikipedia.org/wiki/Classical%20nucleation%20theory | Classical nucleation theory (CNT) is the most common theoretical model used to quantitatively study the kinetics of nucleation.
Nucleation is the first step in the spontaneous formation of a new thermodynamic phase or a new structure, starting from a state of metastability. The kinetics of formation of the new phase is frequently dominated by nucleation, such that the time to nucleate determines how long it will take for the new phase to appear. The time to nucleate can vary by orders of magnitude, from negligible to exceedingly large, far beyond reach of experimental timescales. One of the key achievements of classical nucleation theory is to explain and quantify this immense variation.
Description
The central result of classical nucleation theory is a prediction for the rate of nucleation , in units of (number of events)/(volume·time). For instance, a rate in a supersaturated vapor would correspond to an average of 1000 droplets nucleating in a volume of 1 cubic meter in 1 second.
The CNT prediction for is
where
is the free energy cost of the nucleus at the top of the nucleation barrier, and is the average thermal energy with the absolute temperature and the Boltzmann constant.
is the number of nucleation sites.
is the rate at which molecules attach to the nucleus.
is the Zeldovich factor, (named after Yakov Zeldovich) which gives the probability that a nucleus at the top of the barrier will go on to form the new phase, rather than dissolve.
This expression for the rate can be thought of as a product of two factors: the first, , is the number of nucleation sites multiplied by the probability that a nucleus of critical size has grown around it. It can be interpreted as the average, instantaneous number of nuclei at the top of the nucleation barrier. Free energies and probabilities are closely related by definition. The probability of a nucleus forming at a site is proportional to . So if is large and positive the probability of forming a nucleus is |
https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%20majority%20vote%20algorithm | The Boyer–Moore majority vote algorithm is an algorithm for finding the majority of a sequence of elements using linear time and a constant number of words of memory. It is named after Robert S. Boyer and J Strother Moore, who published it in 1981, and is a prototypical example of a streaming algorithm.
In its simplest form, the algorithm finds a majority element, if there is one: that is, an element that occurs repeatedly for more than half of the elements of the input.
A version of the algorithm that makes a second pass through the data can be used to verify that the element found in the first pass really is a majority.
If a second pass is not performed and there is no majority the algorithm will not detect that no majority exists. In the case that no strict majority exists, the returned element can be arbitrary; it is not guaranteed to be the element that occurs most often (the mode of the sequence).
It is not possible for a streaming algorithm to find the most frequent element in less than linear space, for sequences whose number of repetitions can be small.
Description
The algorithm maintains in its local variables a sequence element and a counter, with the counter initially zero.
It then processes the elements of the sequence, one at a time.
When processing an element , if the counter is zero, the algorithm stores as its remembered sequence element and sets the counter to one.
Otherwise, it compares to the stored element and either increments the counter (if they are equal) or decrements the counter (otherwise).
At the end of this process, if the sequence has a majority, it will be the element stored by the algorithm.
This can be expressed in pseudocode as the following steps:
Initialize an element and a counter with
For each element of the input sequence:
If , then assign and
else if , then assign
else assign
Return
Even when the input sequence has no majority, the algorithm will report one of the sequence elements as its result.
However, it i |
https://en.wikipedia.org/wiki/Interatomic%20potential | Interatomic potentials are mathematical functions to calculate the potential energy of a system of atoms with given positions in space. Interatomic potentials are widely used as the physical basis of molecular mechanics and molecular dynamics simulations in computational chemistry, computational physics and computational materials science to explain and predict materials properties. Examples of quantitative properties and qualitative phenomena that are explored with interatomic potentials include lattice parameters, surface energies, interfacial energies, adsorption, cohesion, thermal expansion, and elastic and plastic material behavior, as well as chemical reactions.
Functional form
Interatomic potentials can be written as a series expansion of
functional terms that depend on the position of one, two, three, etc.
atoms at a time. Then the total potential of the system can
be written as
Here is the one-body term, the two-body term, the
three body term, the number of atoms in the system,
the position of atom , etc. , and are indices
that loop over atom positions.
Note that in case the pair potential is given per atom pair, in the two-body
term the potential should be multiplied by 1/2 as otherwise each bond is counted
twice, and similarly the three-body term by 1/6. Alternatively,
the summation of the pair term can be restricted to cases
and similarly for the three-body term , if
the potential form is such that it is symmetric with respect to exchange
of the and indices (this may not be the case for potentials
for multielemental systems).
The one-body term is only meaningful if the atoms are in an external
field (e.g. an electric field). In the absence of external fields,
the potential should not depend on the absolute position of
atoms, but only on the relative positions. This means
that the functional form can be rewritten as a function
of interatomic distances
and angles between the bonds
(vectors to neighbours) .
Then, in the absence of externa |
https://en.wikipedia.org/wiki/Coding%20Technologies | Coding Technologies AB was a Swedish technology company that pioneered the use of spectral band replication in Advanced Audio Coding. It is a major provider of audio compression technologies for digital broadcasting.
Background
The company was founded in Stockholm, Sweden, in 1997 by Lars Liljeryd. A German subsidiary was formed in 2000 as Coding Technologies GmbH (later renamed Dolby Germany GmbH) with support from the research organization Fraunhofer IIS. The company also had offices in the United States and China.
Coding Technologies was acquired by Dolby Laboratories in 2007 for $250 million in cash. Since then it was renamed to Dolby International AB.
Technologies
Coding Technologies’ MPEG-2 AAC-derived codec, called aacPlus, was published in 2001 and submitted to the MPEG for standardization. The codec would become the MPEG-4 High-Efficiency AAC (HE-AAC) profile in 2003. XM Satellite Radio used aacPlus for its streams. aacPlus with Parametric stereo, called enhanced aacPlus, would become MPEG-4 HE-AACv2. The technology was adopted by Qualcomm in 2004, allowing it to be integrated into wireless handsets.
Lars Liljeryd, Kristofer Kjörling, and Martin Dietz received the IEEE Masaru Ibuka Consumer Electronics Award in 2013 for their work at Coding Technologies, developing and marketing SBR-based audio coding.
External links
Coding Technologies website (expired)
References
Companies established in 1997
Technology companies of Sweden
Digital audio |
https://en.wikipedia.org/wiki/Performance%20gap | A performance gap is a disparity that is found between the energy use predicted and carbon emissions in the design stage of buildings and the energy use of those buildings in operation. Research in the UK suggests that actual carbon emissions from new homes can be 2.5 times the design estimates, on average. For non-domestic buildings, the gap is even higher - actual carbon emissions as much as 3.8 times the design estimates, on average.
There are established tools for reducing the performance gap, by reviewing project objectives, outline and detailed design drawings, design calculations, implementation of designs on site, and post-occupancy evaluation. NEF's Assured Performance Process (APP) is one such tool, which is being used extensively on different sites that form part of East Hampshire's Whitehill and Bordon new town development, one of the largest regeneration projects anywhere in the UK, with high ambitions for both environmental performance and health.
Classification of factors that contribute to the performance gap
The performance gap is produced mainly due to uncertainties. Uncertainties are found in any “real-world” system, and buildings are no exception. As early as 1978, Gero and Dudnik wrote a paper presenting a methodology to solve the problem of designing subsystems (HVAC) subjected to uncertain demands. After that, other authors have shown an interest in the uncertainties that are present in building design; Ramallo-González classified uncertainties in building design/construction in three different groups:
Environmental. Uncertainty in weather prediction under changing climate; and uncertain weather data information due to the use of synthetic weather data files: (1) use of synthetic years that do not represent a real year, and (2) use of a synthetic year that has not been generated from recorded data in the exact location of the project but in the closest weather station.
Workmanship and quality of building elements. Differences between the d |
https://en.wikipedia.org/wiki/Digital%20Communications%20Associates | Digital Communication Associates, Inc. (DCA), was a company in the computer and telecommunications industry, located in Alpharetta, Georgia, United States.
Overview
Digital Communications Associates was founded by John Alderman, who led the company until 1981, when he was replaced by Bertil Nordin. In February 1983, DCA went public, raising 24 million USD. Later, Garry Betty (1957-2007) was CEO of DCA, until he left for Earthlink in November 1996.
Together with Intel, DCA had designed the DCA/Intel Communicating Applications Specification (CAS). It defines a standard, high-level programming interface for data communications applications. The DCX format is the standard file format for storing FAX images in CAS. DCA was in the market of producing T-1 multiplexers. In 1995, DCA of Alpharetta, Georgia, was acquired by Attachmate of Bellevue, Washington.
Acquisitions
In 1981, under the leadership of Bertil Nordin, DCA acquired Technical Analysis Corporation (TAC), the makers of the IRMA Board which enabled PCs to function as 3270 terminals to an IBM mainframe host.
In September 1986, DCA bought Cohesive Networks.
In 1986, DCA acquired Microstuf, makers of the Crosstalk Communications package together with their flagship product, the terminal emulation program Crosstalk Mk.4.
In 1991, DCA acquired Cincinnati-based InterComputer Communications Corporation (ICC), makers of the INFOConnect line of terminal emulation and file-transfer products (focused on the Unisys ecosystem), OpenMind (collaboration) and RLN (remote lan node)
In 1992, DCA acquired Westborough-based Avatar Technologies, makers of the Mac Mainframe hardware and software 3270 emulators, for $8 million.
References
1972 establishments in Georgia (U.S. state)
1995 disestablishments in Georgia (U.S. state)
American companies established in 1972
American companies disestablished in 1995
Companies based in Fulton County, Georgia
Computer companies established in 1972
Computer companies disestablished in 199 |
https://en.wikipedia.org/wiki/Viroinformatics | Viroinformatics is an amalgamation of virology with bioinformatics, involving the application of information and communication technology in various aspects of viral research.
Currently there are more than 100 web servers and databases harboring knowledge regarding different viruses as well as distinct applications concerning diversity analysis, viral recombination, RNAi studies, drug design, protein–protein interaction, structural analysis etc.
References
External links
Viral bioinformatics
VBRC
ViPR
ViralZone
Viral bioinformatics: introduction
Viral genomics and bioinformatics
Bioinformatics
Computational biology
Virology
Computational fields of study |
https://en.wikipedia.org/wiki/Non%20linear%20piezoelectric%20effects%20in%20polar%20semiconductors | Non linear piezoelectric effects in polar semiconductors are the manifestation that the strain induced piezoelectric polarization depends not just on the product of the first order piezoelectric coefficients times the strain tensor components but also on the product of the second order (or higher) piezoelectric coefficients times products of the strain tensor components. The idea was put forward for zincblende GaAs and InAs semiconductors since 2006, and then extended to all commonly used wurtzite and zincblende semiconductors. Given the difficulty of finding direct experimental evidence for the existence of these effects, there are different schools of thought on how one can calculate reliably all the piezoelectric coefficients.
On the other hand, there is widespread agreement on the fact that non linear effects are rather large and comparable to the linear terms (first order). Indirect experimental evidence of the existence of these effects has been reported in the literature in relation to GaN and InN semiconductor optoelectronic devices.
History
Non linear piezoelectric effects in polar semiconductors were first reported in 2006 by G.Bester et al. and by M.A. Migliorato et al., in relation to zincblende GaAs and InAs. Different methods were used in the seminal papers and while the influence of second (and third) order piezoelectric coefficients was generally recognized as being comparable to first order, fully ab initio and what is currently known as Harrison's model, appeared to predict slightly different results, particularly for the magnitude of the first order coefficients.
Formalism
While first order piezoelectric coefficients are of the form eij, the second and third order coefficients are in the form of a higher rank tensor, expressed as eijk and eijkl. The piezoelectric polarization would then be expressed in terms of products of the piezoelectric coefficients and strain components, products of two strain components, and products of three strain compon |
https://en.wikipedia.org/wiki/International%20Conference%20on%20Composite%20Materials | International Conference on Composite Materials (ICCM) is an international scientific conference devoted to all aspects of composite materials. The list of topics includes manufacturing, mechanics, fracture and damage, fatigue, design of components and structures, impact behavior, experimental methods.
History
The conference was initiated by the Metallurgical Society of AIME. The first conference was held in 1975 simultaneously in Geneva and Boston and was rather small. The second conference, ICCM-2, held in 1978 in Toronto, Canada, gathered around 300 delegates. Official welcome was given by Frank Thurston, Director of the National Aeronautical Establishment, Ottawa; the key address was given by Alan Lovelace from NASA.
List of events
References
External links
ICCM-23
ICCM-20
ICCM-19
Academic conferences |
https://en.wikipedia.org/wiki/Taster%20%28genetics%29 | A taster is a person, by means of a human genotype, who is able to taste phenylthiocarbamide (PTC) and its derivative 6-n-propylthiouracil (PROP). PTC tastes bitter to many people (tasters) but is tasteless to others (non-tasters).
About 70% of Caucasians from North America and Western Europe are tasters. The other 30% are non-tasters. Worldwide, fewer Black and Asian persons are non-tasters, and about 50% of indigenous persons from India are non-tasters.
See also
PTC tasting
Notes
Further reading
Urea cycle
Sensors
Classical genetics |
https://en.wikipedia.org/wiki/EMBO%20Gold%20Medal | The EMBO Gold Medal is an annual award of the European Molecular Biology Organization (EMBO) given to young scientists for outstanding contributions to the life sciences in Europe. Laureates receive a medal and €10,000 and are invited to receive the award and present their research at the annual EMBO Meeting and to write a review published in The EMBO Journal. Medallists can only be nominated by EMBO Members.
EMBO Gold Medallists
Previous EMBO Gold Medal awardees include
2023 Julia Mahamid, DE
2022 Prisca Liberali, CH
2021 Andrea Ablasser, CH
2020 , BE, and Markus Ralser, DE
2019 M. Madan Babu, UK, and Paola Picotti, CH
2018 , CH, and Melina Schuh, DE
2017 Maya Schuldiner, IL
2016 , CH, and Ben Lehner, ES
2015 Sarah Teichmann, UK, and Ido Amit, IL
2014 Sophie G. Martin, CH
2013 , NL
2012 , BE
2011 Simon Boulton, UK
2010 , UK
2009 Olivier Voinnet, FR (revoked in January 2016)
2008 James Briscoe, UK
2007 Jan Löwe, UK
2006 Frank Uhlmann, UK
2005 Dario Alessi, UK
2004 María Blasco, ES
2003 Anthony Hyman, DE
2002 Amanda Fisher, UK
2001 , UK
2000 , DE and , UK
1999 Konrad Basler, CH
1998 , IT
1997 Dirk Görlich, DE
1996 Enrico Coen, UK
1995 Richard Treisman, UK
1994 Paolo Sassone-Corsi, IT
1993 Jim Smith, UK
1992 Carl-Henrik Heldin, SE
1991 , FR
1990 Erwin Wagner, AT
1989 Hugh Pelham, UK
1988 Antonio Lanzavecchia, IT
1987 Barbara Pearse, UK
1986 John Tooze, DE
See also
List of biology awards
References
Awards established in 1986
Biology awards
European Molecular Biology Organization
European science and technology awards |
https://en.wikipedia.org/wiki/Steve%20Punter | Steve Punter (born 1958 in Toronto, Ontario) is a Toronto-based programmer and media personality.
Punter is noted for his work with Commodore microcomputers. He created WordPro, the first major word processor for the Commodore PET and Commodore 64 computers. He is also the designer of the Punter binary file transfer protocols which bear his name. He wrote the PunterNet networked BBS program in the late 1980s.
In the 1980s Punter designed and operated the bulletin board system (BBS) for the Toronto PET Users Group. He was an occasional speaker at the World of Commodore expos, and is featured in the film BBS: The Documentary.
He is an expert on cell phones and cell phone network coverage, in which capacity he has made occasional network TV appearances since the early 2000s.
See also
Punter protocol
References
External links
Steve Punter at the Personal Computer Museum
1958 births
Commodore people
Computer programmers
Living people
People from Toronto |
https://en.wikipedia.org/wiki/OpenStructures | OpenStructures is an open source modular construction model based on a shared geometrical grid, called the OS grid. It was conceived by designer Thomas Lommée, and first demonstrated at the Z33, a house for contemporary art. According to Lommee, the OpenStructures project explores the possibility of a modular system where "everyone designs for everyone." OpenStructures is developing a database where anyone can share designs which are in turn available for download by the public. Each component design in the OS system will feature previously designed OS parts that were used to create it. In addition, each part will feature component designs that can be made from it.
The OpenStructures model includes large and small scale manufacturers as well as craftsmen. They are invited to create their own designs according to the OS standard for sale on the market, which can in turn be fixed or disassembled at their end of life and made into new products.
Grid
The OpenStructures grid is built around a square of 4 x 4 cm and is scalable. The squares can be further subdivided or put together to form larger squares, without losing inter-compatibility. The image shows nine complete squares of each 4x4 cm put together.
Designers use the OS grid to determine dimensions, assembly points, and interconnecting diameters. This allows parts that were not originally from the same design to be used together in a new design.
Scales
OpenStructures works at several scales, and analogies are made to biological systems including (from smallest to biggest):
Parts, like body tissues.
Components, like organs, formed by the functional grouping together of multiple tissues. An example is a motor.
Structures, like a group of related organs in an organ system. Here, different components are composed with frames and joints, such as a bicycle.
Superstructures, like organisms, can be understood as the whole hierarchical assembly of different structures that together function as a stable whole w |
https://en.wikipedia.org/wiki/USU%20%28operating%20system%29 | USU linux (Bulgarian: УСУ; Учи Свободен с Убунту) is Bulgarian open source desktop operating system built around the KDE desktop environment and based on the popular free Linux distribution, Ubuntu.
About USU
Usu can be downloaded in three flavours, Desktop, Mini and Netbook, each one with its own features and target audience. All of them can be downloaded for free, as Live CD/DVD ISO images, supporting 32-bit and 64-bit processors. The default language is Bulgarian, but in installation it can be easy changed with F2 key.
Features
USU Desktop is created to be used as a learning tool, this edition of USU includes a very long list of educational apps, like as Celestia space simulator, MuseScore music score typesetter, Blender 3D rendering software, Kalgebra mathematical calculator, and much more.
System Requirements
USU haves this approximate system requirements:
processor with working frequency ~900 MHz
minimum 384 MB RAM (512 MB if using as live CD without SWAP)
~7 GB free space on hard disk (only in installation choice)
DVD reader
monitor, with minimum resolution 640х480, for normal work - 800х600 and up.
video card, that can show at least 16 bit colors and resolution 640х480 (recommended - 800х600 and up)
Pictures
Usu 9.1
USU 8.1
USU 7
USU 6
USU 5
References
External links
Review in video by the famous Adams family from Australia(OsFirstTimer)
Debian-based distributions
IA-32 Linux distributions
Operating system distributions bootable from read-only media
PowerPC operating systems
X86-64 Linux distributions
Linux distributions |
https://en.wikipedia.org/wiki/Cool%20warehouse | A cool warehouse or cold storage warehouse is a warehouse where perishable goods are stored and refrigerated. Products stored can be, amongst other things, food, especially meat, other agricultural products, pharmaceutical drugs, other chemicals and blood.
See also
Cool store
2800 Polar Way
References
External links
Warehouses
Cooling technology
Food preservation |
https://en.wikipedia.org/wiki/Ana%20Caraiani | Ana Caraiani (born 1985) is a Romanian-American mathematician, who is a Royal Society University Research Fellow and Hausdorff Chair at the University of Bonn. Her research interests include algebraic number theory and the Langlands program.
Education
She was born in Bucharest and studied at Mihai Viteazul High School. In 2001, Caraiani became the first Romanian female competitor in 15 years at the International Mathematical Olympiad, where she won a silver medal. In the following two years, she won two gold medals.
After graduating high school in 2003, she pursued her studies in the United States. As an undergraduate student at Princeton University, Caraiani was a two-time Putnam Fellow (the only female competitor at the William Lowell Putnam Mathematical Competition to win more than once) and Elizabeth Lowell Putnam Award winner. Caraiani graduated summa cum laude from Princeton in 2007, with an undergraduate thesis on Galois representations supervised by Andrew Wiles.
Caraiani did her graduate studies at Harvard University under the supervision of Wiles' student Richard Taylor, earning her Ph.D. in 2012 with a dissertation concerning local-global compatibility in the Langlands correspondence.
Career
After spending a year as an L.E. Dickson Instructor at the University of Chicago, she returned to Princeton and the Institute for Advanced Study as a Veblen Instructor and NSF Postdoctoral Fellow. In 2016, she moved to the Hausdorff Center for Mathematics as a Bonn Junior Fellow. She moved to Imperial College London in 2017 as a Royal Society University Research Fellow and Senior Lecturer. In 2019, she became a Royal Society University Research Fellow and Reader at Imperial College London. As of 2021, Caraiani is a full professor at Imperial College London. She rejoined the University of Bonn in 2022 as Hausdorff Chair.
Research
Caraiani's research work includes the papers "Patching and the p-adic local Langlands correspondence" (2016), "On the generic part of th |
https://en.wikipedia.org/wiki/Cotangent%20sheaf | In algebraic geometry, given a morphism f: X → S of schemes, the cotangent sheaf on X is the sheaf of -modules that represents (or classifies) S-derivations in the sense: for any -modules F, there is an isomorphism
that depends naturally on F. In other words, the cotangent sheaf is characterized by the universal property: there is the differential such that any S-derivation factors as with some .
In the case X and S are affine schemes, the above definition means that is the module of Kähler differentials. The standard way to construct a cotangent sheaf (e.g., Hartshorne, Ch II. § 8) is through a diagonal morphism (which amounts to gluing modules of Kähler differentials on affine charts to get the globally-defined cotangent sheaf.) The dual module of the cotangent sheaf on a scheme X is called the tangent sheaf on X and is sometimes denoted by .
There are two important exact sequences:
If S →T is a morphism of schemes, then
If Z is a closed subscheme of X with ideal sheaf I, then
The cotangent sheaf is closely related to smoothness of a variety or scheme. For example, an algebraic variety is smooth of dimension n if and only if ΩX is a locally free sheaf of rank n.
Construction through a diagonal morphism
Let be a morphism of schemes as in the introduction and Δ: X → X ×S X the diagonal morphism. Then the image of Δ is locally closed; i.e., closed in some open subset W of X ×S X (the image is closed if and only if f is separated). Let I be the ideal sheaf of Δ(X) in W. One then puts:
and checks this sheaf of modules satisfies the required universal property of a cotangent sheaf (Hartshorne, Ch II. Remark 8.9.2). The construction shows in particular that the cotangent sheaf is quasi-coherent. It is coherent if S is Noetherian and f is of finite type.
The above definition means that the cotangent sheaf on X is the restriction to X of the conormal sheaf to the diagonal embedding of X over S.
Relation to a tautological line bundle
The cotangent sheaf o |
https://en.wikipedia.org/wiki/Dual%20module | In mathematics, the dual module of a left (respectively right) module M over a ring R is the set of module homomorphisms from M to R with the pointwise right (respectively left) module structure. The dual module is typically denoted M∗ or .
If the base ring R is a field, then a dual module is a dual vector space.
Every module has a canonical homomorphism to the dual of its dual (called the double dual). A reflexive module is one for which the canonical homomorphism is an isomorphism. A torsionless module is one for which the canonical homomorphism is injective.
Example: If is a finite commutative group scheme represented by a Hopf algebra A over a commutative ring k, then the Cartier dual is the Spec of the dual k-module of A.
References
Module theory |
https://en.wikipedia.org/wiki/Electrostatic%20plotter | An electrostatic plotter is a type of plotter that draws images on paper with an electrostatic process. They are most frequently used for Computer-Aided Engineering (CAE), producing raster images via either a Liquid Toner or a Dry Toner model.
Liquid Toner models use toner that is positively charged and thus becomes attracted to paper's negative charge. This occurs after the toner particles pass through a line of electrodes in the form of tiny wires, or nibs. The spacing of the wires controls the resolution of the plotter; for example, 100 or 400 wires to the inch. Dry Toner models use a process similar to xerography in photocopiers. Unlike a laser printer or photocopier, there is no transfer drum used in most electrostatic plotters; the imaging paper is directly exposed to the charging electrode array.
Electrostatic plotters can print in black and white or in color. Some models handle paper sizes up to six feet wide. Newer versions are large-format laser printers and focus light onto a charged drum using lasers or LEDs. The image quality produced by some electrostatic plotters was lower than that of contemporary pen plotters, but the increased speed and economy made them useful. Unlike a pen plotter, the plot time of a rasterized electrostatic plotter was independent of the level of detail of the image. Modern electrostatic color plotters are found in the short run graphics industry, printing on a variety of paper or plastic film surfaces.
Electrostatic plotters were known in the early days of computer graphics; by 1967, several manufacturers commercially supplied electrostatic plotters.
References
Non-impact printing
Plotters |
https://en.wikipedia.org/wiki/NetCentrics | NetCentrics Corporation, based in Herndon, Virginia, is a contractor to the US federal government, Department of Homeland Security and Federal Civilian Agencies. NetCentrics provides enterprise IT, cloud and cybersecurity services to government and private industry.
Company headquarters are located inside the Dulles Technology Corridor of NoVA. The workforce is a combination of on-site and off-site employees. Many employees are remote workers from the greater National Capital Region and Washington, D.C. Most employees have security clearances (Secret, Top Secret, etc.), depending on role.
History
NetCentrics was founded in 1995 by Bob Dixon and Bob Dougherty, the company's first CEO. The company name derived from being one of the first "netcentric" government contractors at the time. An early contract with the U.S. Army at the Pentagon resulted in employee presence there on 9/11. No employees were harmed. Later, three NetCentrics employees were recognized for their efforts to restore digital communications immediately after the attack.
In October 2021 the company was acquired by Cerberus Capital Management.
Leadership
Kenneth Cushing became chief executive officer in October 2021.
In January 2020, Lawrence O'Connor was named president, replacing the previous CEO. He was named NetCentrics CEO in July, 2021.
Contract vehicles
NetCentrics provides services to the federal government through contract vehicle awards. Contract vehicles are competitively bid and typically last several years.
Current contract vehicles include:
DISA Encore III
FTC Information Technology Support Service (ITSS) Blank Purchase Agreement (BPA) (FTC ITSS BPA)
GSA Schedule 70
GSA Schedule 70 - HAC SIN (cybersecurity)
SeaPort Next Generation (SeaPort NxG)
Partnerships, mentorships and joint ventures
NetCentrics established a Mentor-Protégé with Broadleaf, a Native Hawaiian Organization (NHO)-owned small business, in 2017. This SBA 8(a) program gives Broadleaf access to NetCentrics' |
https://en.wikipedia.org/wiki/Rekha%20R.%20Thomas | Rekha Rachel Thomas is a mathematician and operations researcher. She works as a professor of mathematics at the University of Washington, and was the Robert R. and Elaine F. Phelps Professor there from 2008 until 2012. Her research interests include mathematical optimization and computational algebra.
Thomas earned a PhD in operations research from Cornell University in 1994, supervised by Bernd Sturmfels; her dissertation concerned Gröbner bases and integer programming. Prior to joining the University of Washington in 2000, she did postdoctoral studies at Yale University and the Zuse Institute Berlin, and held a faculty position at Texas A&M University beginning in 1995.
Thomas is the author of the textbook Lectures in Geometric Combinatorics (Student Mathematical Library, 33, American Mathematical Society, 2006). She was a plenary speaker at the 21st International Symposium on Mathematical Programming in 2012.
In 2013 she became one of the inaugural fellows of the American Mathematical Society.
References
External links
Year of birth missing (living people)
Living people
20th-century American mathematicians
21st-century American mathematicians
American women mathematicians
Cornell University alumni
University of Texas at Austin faculty
University of Washington faculty
Fellows of the American Mathematical Society
20th-century women mathematicians
21st-century women mathematicians
Combinatorialists
Operations researchers
20th-century American women
21st-century American women
American academics of Indian descent |
https://en.wikipedia.org/wiki/Progress%20in%20Nuclear%20Energy | Progress in Nuclear Energy is a monthly peer-reviewed scientific journal covering research on nuclear energy and nuclear science. It was established in 1977 and is published by Elsevier.
The current editors-in-chief are Yousry Azmy (North Carolina State University), Simon Middleburgh (Bangor University), and Guanghui Su (Xi'an Jiaotong University).
Abstracting and indexing
The journal is abstracted and indexed in:
Chemical Abstracts Service
Science Citation Index Expanded
Current Contents/Engineering, Computing & Technology
Scopus
According to the Journal Citation Reports, the journal has a 2021 impact factor of 2.461.
References
External links
Energy and fuel journals
Elsevier academic journals
English-language journals
Monthly journals
Academic journals established in 1977 |
https://en.wikipedia.org/wiki/Reuse%20of%20human%20excreta | Reuse of human excreta is the safe, beneficial use of treated human excreta after applying suitable treatment steps and risk management approaches that are customized for the intended reuse application. Beneficial uses of the treated excreta may focus on using the plant-available nutrients (mainly nitrogen, phosphorus and potassium) that are contained in the treated excreta. They may also make use of the organic matter and energy contained in the excreta. To a lesser extent, reuse of the excreta's water content might also take place, although this is better known as water reclamation from municipal wastewater. The intended reuse applications for the nutrient content may include: soil conditioner or fertilizer in agriculture or horticultural activities. Other reuse applications, which focus more on the organic matter content of the excreta, include use as a fuel source or as an energy source in the form of biogas.
There is a large and growing number of treatment options to make excreta safe and manageable for the intended reuse option. Some options include: Urine diversion and dehydration of feces (urine-diverting dry toilets), composting (composting toilets or external composting processes), sewage sludge treatment technologies and a range of fecal sludge treatment processes. They all achieve various degrees of pathogen removal and reduction in water content for easier handling. Pathogens of concern are enteric bacteria, virus, protozoa, and helminth eggs in feces. As the helminth eggs are the pathogens that are the most difficult to destroy with treatment processes, they are commonly used as an indicator organism in reuse schemes. Other health risks and environmental pollution aspects that need to be considered include spreading micropollutants, pharmaceutical residues and nitrate in the environment which could cause groundwater pollution and thus potentially affect drinking water quality.
There are several "human excreta derived fertilizers" which vary in their |
https://en.wikipedia.org/wiki/The%20Great%20Mathematical%20Problems | The Great Mathematical Problems is a 2013 book by Ian Stewart. It discusses fourteen mathematical problems and is written for laypersons. The book has received positive reviews.
Content
Stewart describes important open or recently closed problems in mathematics:
Reception
Kirkus Reviews said Stewart "succeed[ed] in illuminating many but not all of some very difficult ideas", and that the book "will enchant math enthusiasts as well as general readers who pay close attention". Robert Schaefer from the New York Journal of Books described "The Great Mathematical Problems" as "both entertaining and accessible", although later noted that "in the end chapters ... explanations of the conjectures get more complicated".
Fred Bortz gave the book a positive review in The Dallas Morning News, commenting "few authors are better at understanding their readers than the prolific mathematics writer Ian Stewart" and saying that "anyone who has always loved math for its own sake or for the way it provides new perspectives on important real-world phenomena will find hours of brain-teasing and mind-challenging delight in the British professor’s survey of recently answered or still open mathematical questions".
Notes
References
Books by Ian Stewart (mathematician)
Books about mathematics
2013 non-fiction books
Profile Books books |
https://en.wikipedia.org/wiki/NE612 | The NE612 is an integrated circuit for processing of signals, such as in the transmission of radio signals. It comprises an oscillator and a mixer.
It can handle signal frequencies up to 500 MHz and local oscillator frequencies up to 200 MHz. The
mixer is a “Gilbert cell” multiplier configuration which provides both a gain of 14 dB and a noise figure of at 45 MHz. The IC belongs to a family of the following ICs: NE602, SA602, NE612 and SA612. It is widely used in amateur radio applications, e.g. in the commercial Elecraft products, and others.
References
Linear integrated circuits
Electronic oscillators |
https://en.wikipedia.org/wiki/Suffix%20tree%20clustering | Suffix Tree Clustering, often abbreviated as STC is an approach for clustering that uses suffix trees. A suffix tree cluster keeps track of all n-grams of any given length to be inserted into a set word string, while simultaneously allowing differing strings to be inserted incrementally in a linear order. This has the advantage of ensuring that a large number of clusters can be handled sequentially. However, a potential disadvantage may be that it also increases the number of possible documents that need to be looked through when handling large sets of data. Suffix tree clusters can either be decompositional or agglomerative in nature, depending on the type of data being handled.
References
Cluster computing
Trees (data structures) |
https://en.wikipedia.org/wiki/Michelle%20L.%20Wachs | Michelle Lynn Wachs is an American mathematician who specializes in algebraic combinatorics and works as a professor of mathematics at the University of Miami.
Contributions
Wachs and her advisor Adriano Garsia are the namesakes of the Garsia–Wachs algorithm for optimal binary search trees, which they published in 1977.
She is also known for her research on shellings for simplicial complexes, partially ordered sets, and Coxeter groups, and on random permutation statistics and set partition statistics.
Education
Wachs earned her doctorate in 1977 from the University of California, San Diego, under the supervision of Adriano Garsia. Her dissertation was Discrete Variational Techniques in Finite Mathematics.
Recognition
In 2012 Wachs became one of the inaugural fellows of the American Mathematical Society. In 2013 she and her husband, mathematician Gregory Galloway (the chair of the mathematics department at Miami) were recognized as Simons Fellows. A conference in her honor was held in January 2015 at the University of Miami.
Selected publications
References
Year of birth missing (living people)
Living people
20th-century American mathematicians
21st-century American mathematicians
American women mathematicians
Combinatorialists
University of California, San Diego alumni
University of Miami faculty
Fellows of the American Mathematical Society
20th-century women mathematicians
21st-century women mathematicians
20th-century American women
21st-century American women |
https://en.wikipedia.org/wiki/In-house%20software | In-house software is computer software for business use within an organization. In-house software can be developed by the organization itself or by someone else, or it could be acquired. In-house software however may later become available for commercial use upon sole discretion of the developing organization. The need to develop such software may arise depending on many circumstances which may be non-availability of the software in the market, potentiality or ability of the corporation to develop such software or to customize a software based on the corporate organization's need.
References
Software by type |
https://en.wikipedia.org/wiki/Hewlett%20Packard%20Enterprise | The Hewlett Packard Enterprise Company (HPE) is an American multinational information technology company based in Spring, Texas, United States.
HPE was founded on November 1, 2015, in Palo Alto, California, as part of the splitting of the Hewlett-Packard company. It is a business-focused organization which works in servers, storage, networking, containerization software and consulting and support.
The split was structured so that the former Hewlett-Packard Company would change its name to HP Inc. and spin off Hewlett Packard Enterprise as a newly created company. HP Inc. retained the old HP's personal computer and printing business, as well as its stock-price history and original NYSE ticker symbol for Hewlett-Packard; Enterprise trades under its own ticker symbol: HPE. At the time of the spin-off, HPE's revenue was slightly less than that of HP Inc.
In 2017, HPE spun off its Enterprise Services business and merged it with Computer Sciences Corporation to become DXC Technology. Also in 2017, it spun off its software business segment and merged it with Micro Focus.
HPE was ranked No. 107 in the 2018 Fortune 500 list of the largest United States corporations by total revenue.
Naming
The full name for the company is "Hewlett Packard Enterprise Company", which drops the hyphen that previously existed between the "Hewlett" and "Packard" of the former Hewlett-Packard Company. The company is commonly referred to as "Hewlett Packard Enterprise" or by its initials "HPE".
The company has also been referred to as "HP Enterprise" by some media outlets and has even been incorrectly referred to as "HP Enterprises".
History
In May 2016, the company announced it would sell its enterprise services division to one of its competitors, Computer Sciences Corporation in a deal valued at . The merger of HPE Enterprise Services with CSC, to form a new company DXC Technology, was completed on March 10, 2017. Approximately 100,000 current HPE employees were affected. More than 30,00 |
https://en.wikipedia.org/wiki/Kurzsignale | The Short Signal Code, also known as the Short Signal Book (), was a short code system used by the Kriegsmarine (German Navy) during World War II to minimize the transmission duration of messages.
Description
The transmission of radio messages had the potential risks of revealing the submarine's presence and direction; if decoded the content was also revealed. Submarines need to provide information, mostly in standard form (position of convoy to attack and of submarine, weather information), to their bases. Initially Morse code transmissions could be used. To inhibit detection, the duration of messages needed to be minimised; for this, Kurzsignale short-coding was used. To prevent interception, messages needed to be encrypted by the Enigma machine. To shorten transmission even further, the message could be sent by a fast machine instead of a human radio operator. For example, the Kurier system – not implemented in time – decreased the time to send a Morse dot from around 50 milliseconds for a human to 1 millisecond.
Short Signal book
The Kurzsignale code was intended to shorten transmission time to below the time required to get a directional fix. It was not primarily intended to hide signal contents; protection was intended to be achieved by encoding with the Enigma machine. A copy of the Kurzsignale code book was captured from on 9 May 1941. In August 1941, Dönitz began addressing U-boats by the names of their commanders, instead of boat numbers. The method of defining U-boat meeting points in the Short Signal Book was regarded as compromised, so a method was defined by B-Dienst cryptanalysts to disguise their positions on the Kriegsmarine German Naval Grid System (German:Gradnetzmeldeverfahren) was introduced and used until the end of the war
Radio direction finding
Aware of the danger presented by radio direction finding (RDF), the Kriegsmarine developed various systems to speed up broadcast. The Kurzsignale code system condensed messages into short codes c |
https://en.wikipedia.org/wiki/Journal%20of%20Ethnobiology | The Journal of Ethnobiology is a quarterly peer-reviewed academic journal covering ethnobiology. It was established in 1981 as the biannual official journal of the Society of Ethnobiology; publication frequency increased to triannually in 2014 and to quarterly in 2016. The editor-in-chief is Robert Quinlan. According to the Journal Citation Reports, the journal has a 2020 impact factor of 1.391.
References
External links
Academic journals established in 1981
English-language journals
Quarterly journals
Ethnobiology
Anthropology journals |
https://en.wikipedia.org/wiki/Alberta%20Biodiversity%20Monitoring%20Institute | Alberta Biodiversity Monitoring Institute (ABMI) is an agency that monitors and reports on biodiversity status throughout the province of Alberta, Canada, that is funded equally by the government of Alberta and the oil and gas industry. The Alberta Biodiversity Monitoring Institute is based in Edmonton, Alberta. According to Alberta Innovates-Technology Futures (AITF), a key partner in the ABMI, the ABMI, which acts as "an early warning system by monitoring the cumulative effects of biodiversity change in regions throughout Alberta" is "the largest project of its kind ever attempted in Canada." Collaborating agencies include the government-industry research agency Alberta Innovates-Technology Futures, the University of Alberta, University of Calgary and the Royal Alberta Museum. Along with the Alberta Forest Management Planning Standard, the ABMI are key components to implementing resource planning based on ecosystem management principles. Alberta Environment and Parks consults the Alberta Biodiversity Monitoring Agency's reports in monitoring and preservation of species, setting benchmarks for biodiversity for land use plans. If industry contributes to the endangerment of a species that falls below these benchmarks, the Government of Alberta can order remedial action.
Location
The ABMI Science Centres are located at the University of Alberta, Alberta Innovates and the University of Calgary. Their Processing Centre is at the Royal Alberta Museum and their Information and Application Centre is at the University of Alberta. The ABMI Monitoring Centre is located at Alberta Innovates Technology Futures offices in Vegreville. Dan Farr has been Director at the Application Centre since April 2010.
History
Since the 1990s it was recognized that Alberta needed a comprehensive provincial biodiversity monitoring program but at that time the province did not have the capacity to conduct such a program.
Phase 1 (1998-2002) of what was then called Alberta Biodiversity Monito |
https://en.wikipedia.org/wiki/Leapfrog%20filter | A leapfrog filter is a type of active circuit electronic filter that simulates a passive electronic ladder filter. Other names for this type of filter are active-ladder or multiple feedback filter. The arrangement of feedback loops in the signal flow-graph of the simulated ladder filter inspired the name leapfrog filter, which was coined by Girling and Good. The leapfrog filter maintains the low component sensitivity of the passive ladder filter that it simulates.
Synthesis
The definition and synthesis of leapfrog filters is described by Temes & LaPatra, Sedra & Brackett, Chen and Wait, Huelsman & Korn.
Synthesis of leapfrog filters typically includes the following steps:
Determine a prototype passive ladder filter that has the desired frequency response. Usually a doubly terminated prototype is used.
Write the equations relating element current to voltage across the element in a form suitable for expression as a signal-flow graph.
Draw the signal-flow graph. The nodes of the signal-flow graph will include both voltages and currents. The branch gains will include impedances and admittances.
Convert all nodes of the signal-flow graph to voltages and all impedances to dimensionless transmittances. This is accomplished by dividing all impedance elements by , an arbitrary resistance and multiplying all admittance elements by . This scaling does not change the frequency response.
Manipulate the signal-flow graph so that the gains feeding each summing node have the same signs. This is done as an implementation convenience. At the completion of this step, typically, all the feedback gains in the signal-flow graph will be +1 and the signs of the gain blocks in the forward path will alternate. As a result, some of the nodes, including the main output, may have a 180° phase inversion. This is usually of no consequence.
The gain blocks are implemented with active filters and interconnected as indicated by the signal-flow graph. Often, state variable filter |
https://en.wikipedia.org/wiki/List%20of%20largest%20reservoirs%20in%20Colorado | This is a list of the largest reservoirs in the state of Colorado. All thirty-eight reservoirs that contain greater than are included in the list. Most of the larger reservoirs in the state are owned by the United States Bureau of Reclamation and, to a lesser extent, the Corps of Engineers. Additionally, a number of these reservoirs are owned by private companies for flood control and irrigation purposes. The largest reservoir entirely contained in Colorado is Blue Mesa Reservoir, with a capacity of . The total storage of the reservoirs on this list is , although not all is allocated for use by Colorado.
Reservoirs
List
See also
List of dams and reservoirs in Colorado
List of largest reservoirs in the United States
List of rivers of Colorado
Bibliography of Colorado
Geography of Colorado
History of Colorado
Index of Colorado-related articles
List of Colorado-related lists
Outline of Colorado
Notes
References
External links
Colorado River Storage Project
Colorado geography-related lists |
https://en.wikipedia.org/wiki/Sensor%20network%20query%20processor | A sensor network query processor (SNQP), also called a sensorDB, is a user-friendly interface for programming and running applications which translates instructions from declarative programming language with high-level instructions to low-level instructions understood by the operating system. The basic idea of SNQP is the addition of a layer modeling the WSN as a distributed database searchable by a query language similar to SQL.
TinyDB
TinyDB is a query processing system for extracting information from a network of TinyOS sensors. Unlike existing solutions for data processing in TinyOS, TinyDB does not require embedded C code for sensors. Instead, TinyDB provides a simple, SQL-like interface to specify the data desired, along with additional parameters, as the rate at which data should be refreshed— much like a traditional database. Given a query specifying data interests, TinyDB collects that data from motes in the environment, filters it, aggregates it, and routes it to a PC. TinyDB does this via power-efficient in-network processing algorithms.
QLowpan
QLowpan is a sensor network queries processor for resource-constrained sensor devices. In order to guarantee interoperability between the different platforms, QLowpan is based on RPL/6LoWPAN protocol. It is the first sensor network queries processor which is compatible with 6lowpan protocol.
References
External links
TinyDB official website
Interfaces
Wireless sensor network |
https://en.wikipedia.org/wiki/Association%20of%20Swedish%20Engineering%20Industries | The Association of Swedish Engineering Industries () is a Swedish trade organization representing employers of multinational engineering and industrial manufacturing companies. The member companies operate in a range of sectors that include telecommunications, fabricated metal products, electronics, machinery and equipment, office machinery and apparatus, power industry, instrument technology, optics, motor cars and transport equipments.
The association’s main objective is to assist the employers of its member companies with various industry policies and labor law guidelines, collective agreement negotiations with labor unions as well as regular publication of economic policy and trend analysis reports. The association also maintains an established task force to promote initiatives in technological innovation, research collaboration between universities and companies as well as design thinking that ultimately can enhance the global competitiveness of Sweden’s industrial sector. The association has 4,000 member companies with over 300,000 employees.
History
In July 1896, as a result of the rapid industrial clustering and labor unionization, an industrial worker association (Swedish: Sveriges Verkstadsförening) was founded in Gothenburg, the home of world headquarters for several Swedish multinational engineering companies including, Electrolux, Saab Group, Volvo Group as well as SKF. The purpose of Verkstadsförening was to promote healthy employer-employee relations through collaboration with labor unions and to design bilateral employment agreements providing equal and yet competitive employment conditions to manufacturing employees.
Verkstadsförening subsequently expanded through several regional organizations across the country, which by 1917 together became members of the Swedish Employer's Association (Swedish: Svenska Arbetsgivareföreningen (SAF)). The pivotal change however took place in 1992 when the Workshop Association merged with the Mechanic Federatio |
https://en.wikipedia.org/wiki/Gunther%20Schmidt | Gunther Schmidt (born 1939, Rüdersdorf) is a German mathematician who works also in informatics.
Life
Schmidt began studying Mathematics in 1957 at Göttingen University. His academic teachers were in particular Kurt Reidemeister, Wilhelm Klingenberg and Karl Stein. In 1960 he transferred to Ludwig-Maximilians-Universität München where he studied functions of several complex variables with Karl Stein. Schmidt wrote a thesis on analytic continuation of such functions.
In 1962 Schmidt began work at TU München with students of Robert Sauer, in the beginning in labs and tutorials, later in mentoring and administration. Schmidt's interests turned toward programming when he collaborated with Hans Langmaack on rewriting and the braid group in 1969. Friedrich L. Bauer and Klaus Samelson were establishing software engineering at the university and Schmidt joined their group in 1974. In 1977 he submitted his Habilitation "Programs as partial graphs".
He became a professor in 1980. Shortly after that, he was appointed to hold the chair of the late Klaus Samelson for one and a half years. From 1988 until his retirement in 2004, he held a professorship at the Faculty for Computer Science of the Universität der Bundeswehr München. He was a classroom instructor for beginners courses as well as special courses in mathematical logic, semantics of programming languages, construction of compilers, and algorithmic languages. Working with Thomas Strohlein, he authored a textbook on relations and graphs, published in German in 1989 and English in 1993 and again in 2012.
In 2001 he became involved in a large project (17 nations) with the European Cooperation in Science and Technology: Schmidt was chairman of project COST 274 TARSKI (Theory and Application of Relational Structures as Knowledge Instruments).
In 2014 a festschrift was organized to celebrate his 75th year.
The calculus of relations had a relatively low profile among mathematical topics in the twentieth century, but Schm |
https://en.wikipedia.org/wiki/LED%20filament | A LED filament light bulb is a LED lamp which is designed to resemble a traditional incandescent light bulb with visible filaments for aesthetic and light distribution purposes, but with the high efficiency of light-emitting diodes (LEDs). It produces its light using LED filaments, which are series-connected strings of diodes that resemble in appearance the filaments of incandescent light bulbs. They are direct replacements for conventional clear (or frosted) incandescent bulbs, as they are made with the same envelope shapes, the same bases that fit the same sockets, and work at the same supply voltage. They may be used for their appearance, similar when lit to a clear incandescent bulb, or for their wide angle of light distribution, typically 300°. They are also more efficient than many other LED lamps.
History
A LED filament type design light bulb was produced by Ushio Lighting in 2008, intended to mimic the appearance of a standard light bulb. Contemporary bulbs typically used a single large LED or matrix of LEDs attached to one large heatsink. As a consequence, these bulbs typically produced a beam only 180 degrees wide. By about 2015, LED filament bulbs had been introduced by several manufacturers. These designs used several LED filament light emitters, similar in appearance when lit to the filament of a clear, standard incandescent bulb, and very similar in detail to the multiple filaments of the early Edison incandescent bulbs.
LED filament bulbs were patented by Ushio and Sanyo in 2008. Panasonic described a flat arrangement with modules similar to filaments in 2013. Two other independent patent applications were filed in 2014 but were never granted. The early filed patents included a heat drain under the LEDs. At that time, luminous efficacy of LEDs was under 100 lm/W. By the late 2010s, this had risen to near 160 lm/W.
Design
The LED filament consists of multiple series-connected LEDs on a transparent substrate, referred to as chip-on-glass (COG). Thes |
https://en.wikipedia.org/wiki/Eoxin | Eoxins are proposed to be a family of proinflammatory eicosanoids (signaling compounds that regulate inflammatory and immune responses). They are produced by human eosinophils (a class of white blood cells), mast cells, the L1236 Reed–Sternberg cell line derived from Hodgkin's lymphoma, and certain other tissues. These cells produce the eoxins by initially metabolizing arachidonic acid, an omega-6 (ω-6) fatty acid, via any enzyme possessing 15-lipoxygenase activity. The product of this initial metabolic step, 15(S)-hydroperoxyeicosatetraenoic acid, is then converted to a series of eoxins by the same enzymes that metabolize the 5-lipoxygenase product of arachidonic acid metabolism, i.e. 5-Hydroperoxy-eicosatetraenoic acid to a series of leukotrienes. That is, the eoxins are 14,15-disubstituted analogs of the 5,6-disubstituted leukotrienes.
A closely related set of 15-lipoxygenase metabolites are derived from anandamide (i.e. arachidonic acid containing ethanolamine esterified to its carboxy residue). These eoxin-like metabolites, termed eoxamides, are also formed by L1235 Reed-Sternberg cells and proposed to play a role in Hodgkins disease.
Eoxins have been suggested to contribute to inflammation in airway allergies and the development and/or progression of certain types of cancer, particularly Hodgkin's lymphoma (a cancer originating from white blood cells), prostate cancer, and colon carcinoma.
History and name
The eoxins are 14,15-analogs of LTA4, LTC4, LTD4, and LTE4. Because the leukotrienes and 14,15-leukotrienes have very similar names, the 14,15-leukotrienes were renamed "eoxins" to avoid the confusion that might arise from referring to both group as "leukotrienes". The eoxins derive their name from eosinophils, the cell type where they were originally discovered in abundance.
Types
As indicated in the following Biochemistry section, there are 4 types of chemically distinct eoxins that are made serially from the 15-lipoxygenase metabolite of arachidonic |
https://en.wikipedia.org/wiki/Formula%20Sun%20Grand%20Prix | The Formula Sun Grand Prix (FSGP) is an annual solar-car race that takes place on closed-loop race tracks. In the race, teams from colleges and universities throughout North America design, build, test, and race solar-powered vehicles.
Every two years the race serves as a qualifier for the American Solar Challenge road race.
Format and organization
Rules
The race consists of three days of freely driving laps around the race track.
The team with the most total laps driven wins.
The total area of all solar cells and related reflectors, etc., must not exceed six-square meters.
The solar array may be reoriented toward the sun for charging batteries for specified time periods before and after race hours.
Strict specifications and engineering scrutiny process is provided for vehicle configuration, safety requirements, and other standards.
Previous races have divided teams into "open" and "stock" classes based on levels of solar cell and battery technologies.
History
Formula Sun Grand Prix is governed by the Innovators Educational Foundation, and was started in summer 2000 at Heartland Park race track in Topeka, Kansas, in conjunction with a solar-bike race.
It has served as a qualifying race for the biennial American Solar Challenge road race.
The race was held there every year through 2005 until the 2007 American Solar Challenge was canceled due to funding issues. It resumed in 2009 and has been held every year since then at a few different venues.
2000
The inaugural race was held at Heartland Park Topeka race track in Topeka, Kansas. It was won by Rose-Hulman Institute of Technology's Solar Phantom V. The stock class was won by the University of Missouri-Rolla's Solar Miner II.
2001
FSGP 2001 served as a qualifier for the 2001 American Solar Challenge and was the only year when multiple events were held.
The first event was again held at Heartland Park Topeka and the Rose-Hulman again took first place overall with Solar Phantom VI, while the stock class |
https://en.wikipedia.org/wiki/VBox%20Home%20TV%20Gateway | VBox Home TV gateway is a network-enabled live TV tuner and PVR HDTV set-top-box produced by VBox Communications Ltd.
The VBox Home TV Gateway is also known as:
V@Home TV Gateway PVR
V@Home TV Gateway
VHome TV Gateway
VBox TV Gateway
XTi
History
VBox Communication was established in 2001 and received strategic investment from Optibase (now part of Vitec).
On Jan 9, 2002 VBox Communications acquired from BroadLogic (now part of Broadcom) its Satellite Express and DTV product lines, adding DVB core functionality to VBox's IP.
VBox TV Gateway technology was first used in its XLV Professional product line unveiled at the Satellite 2006 Show in Washington, D.C., targeting the hospitality, digital signage and enterprise markets.
The VBox Home TV Gateway is based on VBox's 6th generation XLV Professional product line. It debuted at the Mobile World Congress ShowStoppers event in Barcelona, Spain on February 23, 2014 and was first reviewed by CNET UK.
Overview
VBox Home TV Gateway is a network TV tuner and digital video recorder providing both front and back ends, capable of recording and streaming multiple channels to multiple devices at the same time. Unlike standard set-top boxes it does not have an HDMI or other video or audio outputs that directly connect a television, instead its multiple DVB tuners receives the live TV RF signal from satellite, cable TV or terrestrial antenna and streams the decoded video over a local area network to any UPnP-enabled player such as a smart phone, tablet computer, smart TV, computer, or game console.
Technical specifications
Supported DVB standards
Supported content
All VBox Home TV Gateway devices support free-to-air (FTA) content, models that end with CI also support encrypted pay TV content with single or dual Conditional-access module (CAM) Common Interface (CI) slots; there is no support for CI+ CAMs.
Supported recordings
Recording of live or scheduled TV program is available from any of the free VBox apps, the rec |
https://en.wikipedia.org/wiki/Rosiwal%20scale | The Rosiwal scale is a hardness scale in mineralogy, with its name given in memory of the Austrian geologist August Karl Rosiwal. The Rosiwal scale attempts to give more quantitative values of scratch hardness, unlike the Mohs scale which is a qualitative measurement with relative values.
The Rosiwal method (also called the Delesse-Rosiwal method) is a method of petrographic analysis and is performed by scratching a polished surface under a known load using a scratch-tip with a known geometry. The hardness is calculated by finding the volume of removed material, but this measurement can be difficult and must sample a large enough number of grain in order to have statistical significance.
Rosiwal scale values
Measures the scratch hardness of a mineral expressed on a quantitative scale. These measurements must be performed in a laboratory, since the surfaces must be flat and smooth. The base value of the Rosiwal scale is defined as corundum set to 1000 (unitless).
See also
Hardness
August Karl Rosiwal
Friedrich Mohs
References
Bibliography
The Great Encyclopedia of minerals 451 photographs, 520 pages 20'5 x 29'2 cm. Original: Artia, Prague 1986 Catalan version: Editorial Susaeta SA 1989, (printed in Czechoslovakia)
Accurate mineralogy. De Lapparent, A .: 1965 Paris
Minerals and study how to Them. Dana L. Hurlbut, S .: New York 1949
Schöne und seltene Mineral. Hofmann and F. Karpinski, J .: 1980 Leipzig
CORDUANT, William S. "The Hardness of Minerals and Rocks". Lapidary Digest c. 1990.
External links
hardness minerals
Geotopo XXI:Description of program content
hardness and toughness
Glossary of technical mining
Materials science
Mineralogy
Hardness tests |
https://en.wikipedia.org/wiki/Strategic%20pluralism | Strategic pluralism (also known as the dual-mating strategy) is a theory in evolutionary psychology regarding human mating strategies that suggests women have evolved to evaluate men in two categories: whether they are reliable long term providers, and whether they contain high quality genes. The theory of strategic pluralism was proposed by Steven Gangestad and Jeffry Simpson, two professors of psychology at the University of New Mexico and Texas A&M University, respectively.
Experiments and studies
Although strategic pluralism is believed to occur for both animals and humans, the majority of experiments have been performed with humans. One experiment concluded that between short term and long-term relationships, males and females prioritized different things. It was shown that both preferred physical attractiveness for short term mates. However, for long term, females preferred males with traits that indicated that they could be better caretakers, whereas the males did not change their priorities.
The experimenters determined using the following setup: subjects were given an overall 'budget' and asked to assign points to different traits. For long-term mates, women gave more points to social and kindness traits, agreeing with results found in other studies suggesting that females prefer long term mates who would provide resources and emotional security for them as opposed to physically attractive mates. The females also prefer males who can offer them more financial security as this would help them raise their offspring.
Females have also chosen males who have more feminine appearances because of a (hypothesized) inverse relationship between a male's facial attractiveness and effort willing to spend in raising offspring. That is, more attractive males often put in less work as a caretaker while less attractive males will put in more work. On average, there is a wider amount of variability in male characteristics than in females. This suggests there are enough |
https://en.wikipedia.org/wiki/Auticon | Auticon (stylized "auticon") is an international information technology consulting firm that exclusively employs adults on the autism spectrum as Information technology (IT) consultants. Auticon identifies as a social enterprise.
Services mainly focus on IT quality management, including transformation, migration, data analytics, data analysis, security and deep web analysis, as well as compliance and reporting.
Auticon is based in Berlin and currently employs more than 200 members of staff, around 150 of whom are on the autism spectrum. Auticon has offices in the United Kingdom, United States, Germany, France, Switzerland, Canada, Australia, and Italy.
History
Dirk Müller-Remus, who has a son on the autism spectrum, launched Auticon in 2011 with an investment of the Munich-based Ananda Social Venture Fund. The launch was inspired by the Belgian company Passwerk. Auticon's concept to employ people on the autism spectrum as ICT consultants has since been acknowledged internationally. The Auticon model was presented at the G8 Social Impact Investment Forum, held in London on 6 June 2013, in front of 150 leaders in social impact investment.
In 2018, Auticon acquired MindSpark, a company in Santa Monica, California, founded in 2013 by Gray Benoist, whose two sons are also on the autism spectrum.
Awards
2013: IQ Award
2014: BITKOM Innovator's Pitch
2015: Deutsche Bank, Land der Ideen
2015: New Work Award
2015: Sonderpreis, Deutscher Gründerpreis
2017: Social Enterprise UK Awards, One to Watch Award
2019: Milestone Autism Resources "Visionary Employer Award"
2020: Fast Company World Changing Ideas
See also
Specialisterne
References
Autism-related organizations
Software testing
Social enterprises
Companies based in Berlin
ICT service providers
German companies established in 2011 |
https://en.wikipedia.org/wiki/Zero-symmetric%20graph | In the mathematical field of graph theory, a zero-symmetric graph is a connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other. Such a graph is a vertex-transitive graph but cannot be an edge-transitive graph: the number of symmetries equals the number of vertices, too few to take every edge to every other edge.
The name for this class of graphs was coined by R. M. Foster in a 1966 letter to H. S. M. Coxeter. In the context of group theory, zero-symmetric graphs are also called graphical regular representations of their symmetry groups.
Examples
The smallest zero-symmetric graph is a nonplanar graph with 18 vertices. Its LCF notation is [5,−5]9.
Among planar graphs, the truncated cuboctahedral and truncated icosidodecahedral graphs are also zero-symmetric.
These examples are all bipartite graphs. However, there exist larger examples of zero-symmetric graphs that are not bipartite.
These examples also have three different symmetry classes (orbits) of edges. However, there exist zero-symmetric graphs with only two orbits of edges.
The smallest such graph has 20 vertices, with LCF notation [6,6,-6,-6]5.
Properties
Every finite zero-symmetric graph is a Cayley graph, a property that does not always hold for cubic vertex-transitive graphs more generally and that helps in the solution of combinatorial enumeration tasks concerning zero-symmetric graphs. There are 97687 zero-symmetric graphs on up to 1280 vertices. These graphs form 89% of the cubic Cayley graphs and 88% of all connected vertex-transitive cubic graphs on the same number of vertices.
All known finite connected zero-symmetric graphs contain a Hamiltonian cycle, but it is unknown whether every finite connected zero-symmetric graph is necessarily Hamiltonian. This is a special case of the Lovász conjecture that (with five known exceptions, none of which is zero-symmetric) every finite connected vertex-tr |
https://en.wikipedia.org/wiki/Archimedean%20graph | In the mathematical field of graph theory, an Archimedean graph is a graph that forms the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, and all of them are regular, polyhedral (and therefore by necessity also 3-vertex-connected planar graphs), and also Hamiltonian graphs.
Along with the 13, the set of infinite prism graphs and antiprism graphs can also be considered Archimedean graphs.
See also
Platonic graph
Wheel graph
References
Read, R. C. and Wilson, R. J. An Atlas of Graphs, Oxford, England: Oxford University Press, 2004 reprint, Chapter 6 special graphs pp. 261, 267–269.
External links
Regular graphs
Planar graphs |
https://en.wikipedia.org/wiki/Series%2030%2B | Series 30+ (abbreviated as S30+) is a software platform and application user interface used for Nokia-branded mobile devices. The platform was introduced by Nokia in September 2013, first appearing on the Nokia 108, and has been the main Nokia feature phone operating system after the end of the Series 30 and Series 40 platforms in 2014. Despite the similar name and user interface, S30+ is technically completely different and unrelated to S30.
Many S30+ devices only support MAUI Runtime Environment, and application file (.vxp) developed by MediaTek, but some later devices have included support for J2ME applications. Even for models that don't support Java J2ME applications, some are still capable of running something. Some S30+ models also come with an online shop that would allow downloading new apps and games.
Some newer phone models with "Series 30+" platform are said to be based on RTOS.
List of devices
The following feature phones use the Series 30+ platform and are all available as both single and Dual SIM models.
Made by Nokia
Nokia 108 released in 2013 is a Series 30+ based device with support for camera, video and Bluetooth technology.
Nokia 220 was released in 2014 with 2.4-inch display and having Nokia Xpress browser and GPRS data connection (2.5G).
Nokia 225, released in 2014, is similar to the 220 but has a larger 2.8-inch display.
Made by Microsoft
Nokia 130 is a smaller device with a 1.8-inch display, also released in 2014.
Nokia 215 was announced in January 2015. Like the 220, the 215 has a 2.4-inch display, has GPRS – EDGE connectivity and only has a VGA camera.
Nokia 105 (2015) is a device announced in June 2015, it notably had increased storage and could store over 2.000 contacts and last 35 days on standby, and is advertised as a backup telephone for smartphone users.
Nokia 222 is a device announced in August 2015. The differentiation from its predecessors is that it comes with Skype's GroupMe application preinstalled, supports J2ME app |
https://en.wikipedia.org/wiki/Multi-model%20database | In the field of database design, a multi-model database is a database management system designed to support multiple data models against a single, integrated backend. In contrast, most database management systems are organized around a single data model that determines how data can be organized, stored, and manipulated. Document, graph, relational, and key–value models are examples of data models that may be supported by a multi-model database.
Background
The relational data model became popular after its publication by Edgar F. Codd in 1970. Due to increasing requirements for horizontal scalability and fault tolerance, NoSQL databases became prominent after 2009. NoSQL databases use a variety of data models, with document, graph, and key–value models being popular.
A multi-model database is a database that can store, index and query data in more than one model. For some time, databases have primarily supported only one model, such as: relational database, document-oriented database, graph database or triplestore. A database that combines many of these is multi-model.
For some time, it was all but forgotten (or considered irrelevant) that there were any other database models besides relational. The relational model and notion of third normal form were the default standard for all data storage. However, prior to the dominance of relational data modeling, from about 1980 to 2005, the hierarchical database model was commonly used. Since 2000 or 2010, many NoSQL models that are non-relational, including documents, triples, key–value stores and graphs are popular. Arguably, geospatial data, temporal data, and text data are also separate models, though indexed, queryable text data is generally termed a "search engine" rather than a database.
The first time the word "multi-model" has been associated to the databases was on May 30, 2012 in Cologne, Germany, during the Luca Garulli's key note "NoSQL Adoption – What’s the Next Step?". Luca Garulli envisioned the evolutio |
https://en.wikipedia.org/wiki/Black%20and%20burst | Black and burst, also known as bi-level sync and black burst, is an analogue signal used in broadcasting. It is a composite video signal with a black picture. It is a reference signal used to synchronise video equipment, in order to have them output video signals with the same timing. This allows seamless switching between two video signals.
Black and burst can also be used to synchronise colour phase and provides timing accuracy in the order of tens of nanoseconds which is necessary to perform e.g. analogue video mixing.
Black and burst exists for various colour TV standards, such as PAL, NTSC and SECAM. Because the black and burst signal is a normal video signal, it is transportable via normal video cables and through video distribution equipment.
History
Before colour TV existed, the reference signal was also a black video signal. Inaccuracies meant the video picture would be shifted.
With the introduction of colour, the reference had to be much more accurate. In every composite video signal a reference burst is present in the horizontal sync portion, so all equipment in the chain will be synchronised roughly 16000 times per second. This regular synchronisation is necessary because the colour information is transmitted via quadrature amplitude modulation on the high-frequency colour signal. Incorrect synchronisation means the phase will be off, and consequently the colour will be incorrect. Creating broadcast television usually involves mixing video signals. When doing this in an analogue way, it is essential that all signals have the same colour phase, which was achieved by synchronising all cameras with a black and burst signal. Because of cable length differences, every camera required a (often only slightly) different timing. This could be tuned at the reference source, and/or at the camera.
Black and burst is being replaced by tri-level sync, but as of 2020 it is still quite common. Because the signal chains are now digital, which allows buffering, |
https://en.wikipedia.org/wiki/Localizing%20subcategory | In mathematics, Serre and localizing subcategories form important classes of subcategories of an abelian category. Localizing subcategories are certain Serre subcategories. They are strongly linked to the notion of a quotient category.
Serre subcategories
Let be an abelian category. A non-empty full subcategory is called a Serre subcategory (or also a dense subcategory), if for every short exact sequence in the object is in if and only if the objects
and belong to . In words: is closed under subobjects, quotient objects
and extensions.
Each Serre subcategory of is itself an abelian category, and the inclusion functor is exact. The importance of this notion stems from the fact that kernels of exact functors between abelian categories are Serre subcategories, and that one can build (for locally small ) the quotient category (in the sense of Gabriel, Grothendieck, Serre) , which has the same objects as , is abelian, and comes with an exact functor (called the quotient functor) whose kernel is .
Localizing subcategories
Let be locally small. The Serre subcategory is called localizing if the quotient functor
has a
right adjoint
. Since then , as a left adjoint, preserves colimits, each localizing subcategory is closed under colimits. The functor (or sometimes ) is also called the localization functor, and the section functor. The section functor is left-exact and fully faithful.
If the abelian category is moreover
cocomplete and has injective hulls (e.g. if it is a Grothendieck category), then a Serre
subcategory is localizing if and only if
is closed under arbitrary coproducts (a.k.a.
direct sums). Hence the notion of a localizing subcategory is
equivalent to the notion of a hereditary torsion class.
If is a Grothendieck category and a localizing subcategory, then and the quotient category
are again Grothendieck categories.
The Gabriel-Popescu theorem implies that every Grothendieck category is the quotient category of a module categor |
https://en.wikipedia.org/wiki/Giraud%20subcategory | In mathematics, Giraud subcategories form an important class of subcategories of Grothendieck categories. They are named after Jean Giraud.
Definition
Let be a Grothendieck category. A full subcategory is called reflective, if the inclusion functor has a left adjoint. If this left adjoint of also preserves
kernels, then is called a Giraud subcategory.
Properties
Let be Giraud in the Grothendieck category and the inclusion functor.
is again a Grothendieck category.
An object in is injective if and only if is injective in .
The left adjoint of is exact.
Let be a localizing subcategory of and be the associated quotient category. The section functor is fully faithful and induces an equivalence between and the Giraud subcategory given by the -closed objects in .
See also
Localizing subcategory
References
Bo Stenström; 1975; Rings of quotients. Springer.
Category theory
Homological algebra |
https://en.wikipedia.org/wiki/High-entropy%20alloy | High-entropy alloys (HEAs) are alloys that are formed by mixing equal or relatively large proportions of (usually) five or more elements. Prior to the synthesis of these substances, typical metal alloys comprised one or two major components with smaller amounts of other elements. For example, additional elements can be added to iron to improve its properties, thereby creating an iron-based alloy, but typically in fairly low proportions, such as the proportions of carbon, manganese, and others in various steels. Hence, high-entropy alloys are a novel class of materials. The term "high-entropy alloys" was coined by Taiwanese scientist Jien-Wei Yeh because the entropy increase of mixing is substantially higher when there is a larger number of elements in the mix, and their proportions are more nearly equal. Some alternative names, such as multi-component alloys, compositionally complex alloys and multi-principal-element alloys are also suggested by other researchers.
These alloys are currently the focus of significant attention in materials science and engineering because they have potentially desirable properties.
Furthermore, research indicates that some HEAs have considerably better strength-to-weight ratios, with a higher degree of fracture resistance, tensile strength, and corrosion and oxidation resistance than conventional alloys. Although HEAs have been studied since the 1980s, research substantially accelerated in the 2010s.
Development
Although HEAs were considered from a theoretical standpoint as early as 1981 and 1996, and throughout the 1980s, in 1995 Taiwanese scientist Jien-Wei Yeh came up with his idea for ways of actually creating high-entropy alloys, while driving through the Hsinchu, Taiwan, countryside. Soon after, he decided to begin creating these special alloys in his lab, being in the only region researching these alloys for over a decade. Most countries in Europe, the United States, and other parts of the world lagged behind in the developme |
https://en.wikipedia.org/wiki/Number%20theoretic%20Hilbert%20transform | The number theoretic Hilbert transform is an extension of the discrete Hilbert transform to integers modulo a prime . The transformation operator is a circulant matrix.
The number theoretic transform is meaningful in the ring , when the modulus is not prime, provided a principal root of order n exists.
The NHT matrix, where , has the form
The rows are the cyclic permutations of the first row, or the columns may be seen as the cyclic permutations of the first column. The NHT is its own inverse: where I is the identity matrix.
The number theoretic Hilbert transform can be used to generate sets of orthogonal discrete sequences that have applications in signal processing, wireless systems, and cryptography. Other ways to generate constrained orthogonal sequences also exist.
References
See also
Number theoretic transform
Signal processing |
https://en.wikipedia.org/wiki/Bitium | Bitium was a developer of the cloud service Bitium, which provided single sign-on and identity management for software as a service (SaaS) cloud-based applications before its merger into Google Cloud. Bitium allowed end users to access all of their cloud software accounts using a single set of login credentials. The product could integrate with cloud apps using SAML for enhanced security.
Bitium also allowed companies to extend their existing directory structured to cloud apps. Bitium could integrate with Active Directory, LDAP, HRIS, Google Apps and other on-premises directories to allow for centralized user access and control.
Bitium was backed by venture capital firm Polaris Partners and was an early graduate of the Amplify.LA accelerator. The corporate office was located in a building which was the former studio of artist Richard Diebenkorn. Bitium had been featured at CIO.com.
Acquisition
On September 26, 2017, Google Cloud announced that it acquired Bitium, a step towards better management of enterprise-grade cloud customer services across an organization, through integration of features like setting security levels and access policies for applications. At the end of September 2018, Bitium announced that it would close down all accounts for customers outside the United States, Canada and Mexico at the end of 2018.
Bitium was fully merged with Google Cloud and ceased to exist in 2019. However, some of its technology is still used by Google.
See also
List of single sign-on implementations
References
External links
Polaris Partners
Cloud applications
Identity management
Access control software
Google Cloud
2017 mergers and acquisitions
Computer access control
Google acquisitions |
https://en.wikipedia.org/wiki/Sunrayce%2095 | Sunrayce 95 was an intercollegiate solar car race on June 20–29, 1995. The event was won by the Massachusetts Institute of Technology, with the University of Minnesota finishing less than 20 minutes behind them. It was the 3rd American national championship solar car race held.
Route
Day 1: Tue, June 20: Start in Indianapolis, Indiana; finish in Terre Haute, IN.
Day 2: Wed, June 21: Start in Terre Haute, IN, must reach Effingham, Illinois checkpoint, finish in Godfrey, IL.
Day 3: Thu, June 22: Start in Godfrey, IL, must reach Louisiana, Missouri checkpoint, finish in Fulton, MO.
Day 4: Fri, June 23: Start in Fulton, MO, must reach California, MO checkpoint, finish in Lee's Summit, MO.
Rest Day: Sat, June 24: Lee's Summit, MO.
Day 5: Sun, June 25: Start in Lee's Summit, MO, must reach Topeka, Kansas checkpoint, finish in Manhattan, KS.
Day 6: Mon, June 26: Start in Manhattan, KS, must reach Glasco, KS checkpoint, finish in Smith Center, KS.
Day 7: Tue, June 27: Start in Smith Center, KS, must reach Oberlin, KS checkpoint, finish in St. Francis, KS.
Day 8: Wed, June 28: Tue, June 27: Start in St. Francis, KS, must reach Anton, Colorado checkpoint, finish in Aurora, CO.
Day 9: Thu, June 29: Start in Aurora, CO, finish in Golden, CO.
Results
Notes
References
1995 in American motorsport
Solar car races |
https://en.wikipedia.org/wiki/Sunrayce%2097 | Sunrayce 97 was an intercollegiate solar car race on June 19–28, 1997. The event was won by Cal State LA, with the Massachusetts Institute of Technology finishing less than 20 minutes behind them. It was the 4th American national championship solar car race held.
Route
Day 1: Thu, June 19: Start in Indianapolis, Indiana; finish in Terre Haute, IN.
Day 2: Fri, June 20: Start in Terre Haute, IN, must reach Effingham, Illinois checkpoint, finish in Godfrey, IL.
Day 3: Sat, June 21: Start in Godfrey, IL, must reach Louisiana, Missouri checkpoint, finish in Fulton, MO.
Day 4: Sun, June 22: Start in Fulton, MO, must reach California, MO checkpoint, finish in Lee's Summit, MO.
Rest Day: Mon, June 23: Lee's Summit, MO.
Day 5: Tue, June 24: Start in Lee's Summit, MO, must reach Topeka, Kansas checkpoint, finish in Manhattan, KS.
Day 6: Wed, June 25: Start in Manhattan, KS, must reach Glasco, KS checkpoint, finish in Smith Center, KS.
Day 7: Thu, June 26: Start in Smith Center, KS, must reach Oberlin, KS checkpoint, finish in St. Francis, KS.
Day 8: Fri, June 27: Tue, June 27: Start in St. Francis, KS, must reach Anton, Colorado checkpoint, finish in Limon, CO.
Day 9: Sat, June 28: Start in Limon, CO, finish in Colorado Springs, CO.
Results
Not qualifying but ran the first leg of the race in their own was Middle Tennessee State University.
References
1997 in American motorsport
Solar car races |
https://en.wikipedia.org/wiki/North%20American%20Solar%20Challenge%202005 | The 2005 North American Solar Challenge (NASC) was an intercollegiate solar car race on July 17–27, 2005. The event was won by the University of Michigan, with the University of Minnesota finishing less than 12 minutes behind them, in what was both the longest and most closely contested race in the history of the event. The race was notable for being the first solar car race to cross an international border. It was the 8th American national championship solar car race held.
Route
Day 1: Sun, July 17: Start in Austin, Texas; finish in Weatherford, TX.
Day 2: Mon, July 18: Start in Weatherford, TX.
Day 3: Tue, July 19: Must reach Broken Arrow, Oklahoma checkpoint.
Day 4: Wed, July 20: Must reach Topeka, Kansas checkpoint; must reach Omaha, Nebraska checkpoint.
Day 5: Thu, July 21: Must reach Sioux Falls, South Dakota checkpoint.
Day 6: Fri, July 22: Must reach Fargo, North Dakota checkpoint.
Day 7: Sat, July 23: Finish in Winnipeg, Manitoba.
Day 8: Sun, July 24: Start in Winnipeg, MB; must reach Brandon, MB checkpoint.
Day 9: Mon, July 25: Must reach Regina, Saskatchewan checkpoint;
Day 10: Tue, July 26: Finish in Medicine Hat, Alberta.
Day 11: Wed, July 27: Start in Medicine Hat, AB; Finish in Calgary, AB.
Results
References
Solar car races |
https://en.wikipedia.org/wiki/North%20American%20Solar%20Challenge%202008 | The 2008 North American Solar Challenge (NASC) was an intercollegiate solar car race on July 13–22, 2008. The event was won by the University of Michigan. It was the 9th American national championship solar car race held.
Route
Day 1: Sun, July 13: Start in Plano, Texas; must reach McAlester, Oklahoma checkpoint.
Day 2: Mon, July 14: Finish in Neosho, Missouri.
Day 3: Tue, July 15: Start in Neosho, MO; must reach Topeka, Kansas checkpoint.
Day 4: Wed, July 16: Must reach Omaha, Nebraska checkpoint.
Day 5: Thu, July 17: Finish in Sioux Falls, South Dakota.
Day 6: Fri, July 18: Start in Sioux Falls, SD; must reach Fargo, North Dakota checkpoint.
Day 7: Sat, July 19: Finish in Winnipeg, Manitoba.
Day 8: Sun, July 20: Start in Winnipeg, MB; must reach Brandon, MB checkpoint.
Day 9: Mon, July 21: Must reach Regina, Saskatchewan checkpoint; finish in Medicine Hat, Alberta.
Day 10: Tue, July 22: Start in Medicine Hat, AB; Finish in Calgary, AB.
Results
References
Solar car races |
https://en.wikipedia.org/wiki/List%20of%20forests%20in%20India | The following table is a non-exhaustive list of forests found in India.
See also
Lists of forests
Communal forests of India
Protected areas of India
Reserved forests and protected forests of India
Tropical rainforests of India
List of countries by forest area
Sacred groves of India
Forests in Odisha
References
India
Forests in India |
https://en.wikipedia.org/wiki/Topological%20monoid | In topology, a branch of mathematics, a topological monoid is a monoid object in the category of topological spaces. In other words, it is a monoid with a topology with respect to which the monoid's binary operation is continuous. Every topological group is a topological monoid.
See also
H-space
References
External links
topological monoid from symmetric monoidal category
Topological spaces
Algebraic topology |
https://en.wikipedia.org/wiki/Frederick%20Arthur%20Bagg | Frederick Arthur Bagg (1871 - March 1, 1932) was the engineer who surveyed the route for the New York State Canal System. He was the chief engineer for the Johnstown, Fonda, and Gloverville Railroad.
Biography
He was born in 1871 in Providence, Rhode Island. He attended the Rensselaer Polytechnic Institute. He was married to Edith Cress.
He surveyed the route for the New York State Canal System. He was the chief engineer for the Johnstown, Fonda, and Gloverville Railroad.
He then worked for the New York Central Railroad till his death on March 1, 1932, in Millburn, New Jersey. He died of heart disease.
References
Rensselaer Polytechnic Institute alumni
1871 births
1932 deaths
People from Providence, Rhode Island
19th-century American engineers
American canal engineers
American railway civil engineers
20th-century American engineers |
https://en.wikipedia.org/wiki/Procurement%20G6 | The Procurement G6 is an informal group of six national central purchasing bodies. It is also known as the Multilateral Meeting on Government Procurement (MMGP).
Members
Members of the Procurement G6 are:
: Public Services and Procurement Canada
: ChileCompra
: Consip
: Public Procurement Service
: Crown Commercial Service
: General Services Administration
Scope
Each country shares experiences about:
e–procurement systems
challenges, opportunities and actions for small and medium enterprises (SME)
their qualification systems for enterprises
instruments and indicators for the performance measuring of the Central Purchasing Bodies and their impact on the economic system, on the public sector and on the enterprises
actions to minimize the corruption risk
the green procurement scenarios
Past meetings of the Procurement G6 have included:
June 15–16, 2009 — San Antonio,
June 10–12, 2010 – Rome,
September 24–26, 2013 — Seoul,
May 24–25, 2016 – Rome,
October 10–11, 2018 — Vancouver
See also
Agreement on Government Procurement
Auction
E–procurement
Expediting
Global sourcing
Group purchasing organization
Purchasing
Strategic sourcing
Notes and references
External links
Consip
CC – Direcciòn ChileCompra
GSA – General Services Administration
OGC – Office of Government Commerce
PPS – Public Procurement Service
PWGSC – Public Works and Government Services Canada
Systems engineering
Public eProcurement |
https://en.wikipedia.org/wiki/Worst-case%20distance | In fabrication the yield Y=(number of good samples)/(total number of samples) is one of the most important measures. Also in the design phase engineers already try to maximize the yield by using simulation techniques and statistical models. Often the data follows the well-known bell-shaped normal distribution, and for such distributions there is a simple direct relationship between the design margin (to a given specification limit) and the yield. If we express the specification margin in terms of standard deviation sigma, we can immediately calculate yield Y according to this specification. The concept of worst-case distance (WCD) extends this simple idea for applying it to more complex problems (like having non-normal distributions, multiple specs, etc.).
The WCD is a metric originally applied in electronic design for yield optimization and design centering, nowadays also applied as a metric for quantifying electronic system and device robustness.
For yield optimization in electronic circuit design the WCD relates the following yield influencing factors to each other:
Statistical distribution of design parameters usually based on the used technology process
Operating range of operating conditions the design will work in
Performance specification for performance parameters
Although the strict mathematical formalism may be complex, in a simple interpretation the WCD is the maximum of all possible (i.e. being within the specification limits)
performance variances divided by the distance to the performance specification, given that the performance variances are evaluated under the space spanned by the operating range range.
Note: This interpretation is valid for normal (Gaussian) distributed variables and performances, luckily the "specification-margin" of a design is almost intuitively related to the yield, e.g. if we have a larger "safety margin" in our design to the limit(s) we are more on the safe side and the production will contain less fail samples. |
https://en.wikipedia.org/wiki/Amari%20distance | The Amari distance, also known as Amari index and Amari metric is a similarity measure between two invertible matrices, useful for checking for convergence in independent component analysis algorithms and for comparing solutions. It is named after Japanese information theorist Shun'ichi Amari and was originally introduced as a performance index for blind source separation.
For two invertible matrices , it is defined as:
It is non-negative and cancels if and only if is a scale and permutation matrix, i.e. the product of a diagonal matrix and a permutation matrix. The Amari distance is invariant to permutation and scaling of the columns of and .
References
Signal estimation |
https://en.wikipedia.org/wiki/Lanthanide%20probes | Lanthanide probes are a non-invasive analytical tool commonly used for biological and chemical applications. Lanthanides are metal ions which have their 4f energy level filled and generally refer to elements cerium to lutetium in the periodic table. The fluorescence of lanthanide salts is weak because the energy absorption of the metallic ion is low; hence chelated complexes of lanthanides are most commonly used. The term chelate derives from the Greek word for “claw,” and is applied to name ligands, which attach to a metal ion with two or more donor atoms through dative bonds. The fluorescence is most intense when the metal ion has the oxidation state of 3+. Not all lanthanide metals can be used and the most common are: Sm(III), Eu(III), Tb(III), and Dy(III).
History
It has been known since the early 1930s that the salts of certain lanthanides are fluorescent. The reaction of lanthanide salts with nucleic acids was discussed in a number of publications during the 1930s and the 1940s where lanthanum-containing reagents were employed for the fixation of nucleic acid structures. In 1942 complexes of europium, terbium, and samarium were discovered to exhibit unusual luminescence properties when excited by UV light. However, the first staining of biological cells with lanthanides occurred twenty years later when bacterial smears of E. coli were treated with aqueous solutions of a europium complex, which under mercury lamp illumination appeared as bright red spots. Attention to lanthanide probes increased greatly in the mid-1970s when Finnish researchers proposed Eu(III), Sm(III), Tb(III), and Dy(III) polyaminocarboxylates as luminescent sensors in time-resolved luminescent (TRL) immunoassays. Optimization of analytical methods from the 1970s onward for lanthanide chelates and time-resolved luminescence microscopy (TRLM) resulted in the use of lanthanide probes in many scientific, medical and commercial fields.
Techniques
There are two main assaying techniques: heter |
https://en.wikipedia.org/wiki/Flow%20graph%20%28mathematics%29 | A flow graph is a form of digraph associated with a set of linear algebraic or differential equations:
"A signal flow graph is a network of nodes (or points) interconnected by directed branches, representing a set of linear algebraic equations. The nodes in a flow graph are used to represent the variables, or parameters, and the connecting branches represent the coefficients relating these variables to one another. The flow graph is associated with a number of simple rules which enable every possible solution [related to the equations] to be obtained."
Although this definition uses the terms "signal-flow graph" and "flow graph" interchangeably, the term "signal-flow graph" is most often used to designate the Mason signal-flow graph, Mason being the originator of this terminology in his work on electrical networks. Likewise, some authors use the term "flow graph" to refer strictly to the Coates flow graph. According to Henley & Williams:
"The nomenclature is far from standardized, and...no standardization can be expected in the foreseeable future."
A designation "flow graph" that includes both the Mason graph and the Coates graph, and a variety of other forms of such graphs appears useful, and agrees with Abrahams and Coverley's and with Henley and Williams' approach.
A directed network – also known as a flow network – is a particular type of flow graph. A network is a graph with real numbers associated with each of its edges, and if the graph is a digraph, the result is a directed network. A flow graph is more general than a directed network, in that the edges may be associated with gains, branch gains or transmittances, or even functions of the Laplace operator s, in which case they are called transfer functions.
There is a close relationship between graphs and matrices and between digraphs and matrices. "The algebraic theory of matrices can be brought to bear on graph theory to obtain results elegantly", and conversely, graph-theoretic approaches based upon fl |
https://en.wikipedia.org/wiki/AVT%20Statistical%20filtering%20algorithm | AVT Statistical filtering algorithm is an approach to improving quality of raw data collected from various sources. It is most effective in cases when there is inband noise present. In those cases AVT is better at filtering data then, band-pass filter or any digital filtering based on variation of.
Conventional filtering is useful when signal/data has different frequency than noise and signal/data is separated/filtered by frequency discrimination of noise. Frequency discrimination filtering is done using Low Pass, High Pass and Band Pass filtering which refers to relative frequency filtering criteria target for such configuration. Those filters are created using passive and active components and sometimes are implemented using software algorithms based on Fast Fourier transform (FFT).
AVT filtering is implemented in software and its inner working is based on statistical analysis of raw data.
When signal frequency/(useful data distribution frequency) coincides with noise frequency/(noisy data distribution frequency) we have inband noise. In this situations frequency discrimination filtering does not work since the noise and useful signal are indistinguishable and where AVT excels. To achieve filtering in such conditions there are several methods/algorithms available which are briefly described below.
Averaging algorithm
Collect n samples of data
Calculate average value of collected data
Present/record result as actual data
Median algorithm
Collect n samples of data
Sort the data in ascending or descending order. Note that order does not matter
Select the data that happen to be in n/2 position and present/record it as final result representing data sample
AVT algorithm
AVT algorithm stands for Antonyan Vardan Transform and its implementation explained below.
Collect n samples of data
Calculate the standard deviation and average value
Drop any data that is greater or less than average ± one standard deviation
Calculate average value of remaining d |
https://en.wikipedia.org/wiki/A%20Matter%20of%20Faith | A Matter of Faith is a 2014 American Christian drama film directed by Rich Christiano and starring Harry Anderson (in his final role), Jordan Trovillion, Jay Pickett, and Clarence Gilyard. The film was shot in the Summer of 2013 in Michigan, and was released into theaters on October 17, 2014 by Five & Two Pictures. The film follows a Christian student (played by Trovillion) and her father (Pickett) who are challenged by a biology professor (Anderson) who teaches evolution.
Plot
In 2013 Michigan, Rachel Whitaker has been raised as an evangelical Christian by her loving parents, and is celebrating a going-away party with her friends and family, as she is all set to go to college. However, after she begins to be influenced by her biology professor, Dr. Kaman, who is an atheist, she begins to question her own Christian faith, and in particular the biblical story in Genesis about creationism. Dr. Kaman teaches his students the scientifically proven theory of evolution, rather than the biblical concept of creationism, and his charisma, intelligence, and light-hearted approach to the topic of evolution makes him popular with the students.
Dr. Kaman teaches that all complex life forms evolved from simpler life forms over millions of years, and that the Biblical theory of creationism is not a probable alternative. Rachel's father Stephen is concerned by the change in his daughter's personality and beliefs, and goes to confront the arrogant professor in his office, finding himself challenged to a debate on religion much to the embarrassment of his daughter. As he prepares, Stephen is approached by a sympathetic student, Evan, who tells him to go see a former biology professor named Professor Portland, who was fired several years ago at Kaman's behest for teaching creationism to his students and for arguing to them that the theory of evolution was untrue and made-up by man. Professor Portland initially refuses efforts to "get him back in the game" and angrily tells Stephen |
https://en.wikipedia.org/wiki/Prism%20graph | In the mathematical field of graph theory, a prism graph is a graph that has one of the prisms as its skeleton.
Examples
The individual graphs may be named after the associated solid:
Triangular prism graph – 6 vertices, 9 edges
Cubical graph – 8 vertices, 12 edges
Pentagonal prism graph – 10 vertices, 15 edges
Hexagonal prism graph – 12 vertices, 18 edges
Heptagonal prism graph – 14 vertices, 21 edges
Octagonal prism graph – 16 vertices, 24 edges
...
Although geometrically the star polygons also form the faces of a different sequence of (self-intersecting and non-convex) prismatic polyhedra, the graphs of these star prisms are isomorphic to the prism graphs, and do not form a separate sequence of graphs.
Construction
Prism graphs are examples of generalized Petersen graphs, with parameters GP(n,1).
They may also be constructed as the Cartesian product of a cycle graph with a single edge.
As with many vertex-transitive graphs, the prism graphs may also be constructed as Cayley graphs. The order-n dihedral group is the group of symmetries of a regular n-gon in the plane; it acts on the n-gon by rotations and reflections. It can be generated by two elements, a rotation by an angle of 2/n and a single reflection, and its Cayley graph with this generating set is the prism graph. Abstractly, the group has the presentation (where r is a rotation and f is a reflection or flip) and the Cayley graph has r and f (or r, r−1, and f) as its generators.
The n-gonal prism graphs with odd values of n may be constructed as circulant graphs .
However, this construction does not work for even values of n.
Properties
The graph of an n-gonal prism has 2n vertices and 3n edges. They are regular, cubic graphs.
Since the prism has symmetries taking each vertex to each other vertex, the prism graphs are vertex-transitive graphs.
As polyhedral graphs, they are also 3-vertex-connected planar graphs. Every prism graph has a Hamiltonian cycle.
Among all biconnected cubic graphs |
https://en.wikipedia.org/wiki/Antiprism%20graph | In the mathematical field of graph theory, an antiprism graph is a graph that has one of the antiprisms as its skeleton. An -sided antiprism has vertices and edges. They are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, and planar graphs), and also Hamiltonian graphs.
Examples
The first graph in the sequence, the octahedral graph, has 6 vertices and 12 edges. Later graphs in the sequence may be named after the type of antiprism they correspond to:
Octahedral graph – 6 vertices, 12 edges
square antiprismatic graph – 8 vertices, 16 edges
Pentagonal antiprismatic graph – 10 vertices, 20 edges
Hexagonal antiprismatic graph – 12 vertices, 24 edges
Heptagonal antiprismatic graph – 14 vertices, 28 edges
Octagonal antiprismatic graph – 16 vertices, 32 edges
...
Although geometrically the star polygons also form the faces of a different sequence of (self-intersecting) antiprisms, the star antiprisms, they do not form a different sequence of graphs.
Related graphs
An antiprism graph is a special case of a circulant graph, Ci2n(2,1).
Other infinite sequences of polyhedral graph formed in a similar way from polyhedra with regular-polygon bases include the prism graphs (graphs of prisms) and wheel graphs (graphs of pyramids). Other vertex-transitive polyhedral graphs include the Archimedean graphs.
References
External links
Graph families
Regular graphs
Planar graphs |
https://en.wikipedia.org/wiki/Enterprise%20Storage%20OS | Enterprise Storage OS, also known as ESOS, is a Linux distribution that serves as a block-level storage server in a storage area network (SAN). ESOS is composed of open-source software projects that are required for a Linux distribution and several proprietary build and install time options. The SCST project is the core component of ESOS; it provides the back-end storage functionality.
Platform
ESOS is a niche Linux distribution. ESOS is intended to run on a USB flash drive, or some other type of removable media such as Secure Digital, CompactFlash, etc. ESOS is a memory resident operating system: At boot, a tmpfs file system is initialized as the root file system and the USB flash drive image is copied onto this file system. Configuration files and logs are periodically written to a USB flash drive (persistent storage) or by user intervention when configuration changes occur.
Interface
ESOS utilizes a text-based user interface (TUI) for system management, network configuration, and storage provisioning functions. The TUI used in ESOS is written in C; the ncurses and CDK libraries are used.
Front-end connectivity
ESOS supports connectivity on several different front-end storage area network technologies. These core functions are supported by SCST and third-party target drivers that vendors have developed for SCST:
Fibre Channel: QLogic HBAs are natively supported, and Emulex OneConnect FC HBAs can be supported by a build time option (requiring the Emulex OCS SDK)
InfiniBand: Mellanox, QLogic, and Chelsio IB HCAs, among others, are supported
Fibre Channel over Ethernet (FCoE): A software target implementation supports NICs with DCB/DCBX capabilities, or build time options exist for supporting Emulex OneConnect FCoE CNAs (requires the Emulex OCS SDK) and Chelsio Uwire FCoE CNAs.
iSCSI: Will work over any IP communication method supported by ESOS (Ethernet, IPoIB).
Back-end storage
Open-source software projects and commodity computing server hardware are us |
https://en.wikipedia.org/wiki/Web%20Application%20Messaging%20Protocol | WAMP is a WebSocket subprotocol registered at IANA, specified to offer routed RPC and PubSub. Its design goal is to provide an open standard for soft, real-time message exchange between application components and ease the creation of loosely coupled architectures based on microservices. Because of this, it is a suitable enterprise service bus (ESB), fit for developing responsive web applications or coordinating multiple connected IoT devices.
Characteristics
Structure
WAMP requires a reliable, ordered, full-duplex message channel as a transport layer, and by default uses Websocket. However, implementations can use other transports matching these characteristics and communicate with WAMP over e.g. raw sockets, Unix sockets, or HTTP long poll.
Message serialization assumes integers, strings and ordered sequence types are available, and defaults to JSON as the most common format offering these. Implementations often provide MessagePack as a faster alternative to JSON at the cost of an additional dependency.
Workflow
WAMP is architectured around client–client communications with a central software, the router, dispatching messages between them. The typical data exchange workflow is:
Clients connect to the router using a transport, establishing a session.
The router identifies the clients and gives them permissions for the current session.
Clients send messages to the router which dispatches them to the proper targets using the attached URIs.
The clients send these messages using the two high-level primitives that are RPC and PUB/SUB, doing four core interactions:
register: a client exposes a procedure to be called remotely.
call: a client asks the router to get the result of an exposed procedure from another client.
subscribe: a client notifies its interest in a topic.
publish: a client publishes information about this topic.
This can have subtle variations depending on the underlying transport. However, implementation details are hidden to the end-user |
https://en.wikipedia.org/wiki/Otto%20Warburg%20Medal | The Otto Warburg Medal is awarded annually by the German Society for Biochemistry and Molecular Biology (German: Gesellschaft für Biochemie und Molekularbiologie or GBM) to honour scientists who have contributed important work in the field of biological chemistry. It is named after Otto Warburg, a renowned German physiologist and Nobel Prize laureate. It was first awarded on his 80th birthday on 8 October 1963.
Up to 2013, nine Warburg Medal recipients have also been awarded the Nobel Prize.
Medallists
Source: GBM
See also
List of biochemistry awards
List of biology awards
List of awards named after people
References
Biology awards
German awards
Awards established in 1963
Biochemistry awards |
https://en.wikipedia.org/wiki/Integrated%20Water%20Flow%20Model | Integrated Water Flow Model (IWFM) is a computer program for simulating water flow through the integrated land surface, surface water and groundwater flow systems. It is a rewrite of the abandoned software IGSM, which was found to have several programing errors. The IWFM programs and source code are freely available. IWFM is written in Fortran, and can be compiled and run on Microsoft Windows, Linux and Unix operating systems. The IWFM source code is released under the GNU General Public License.
Groundwater flow is simulated using the finite element method. Surface water flow can be simulated as a simple one-dimensional flow-through network or with the kinematic wave method. IWFM input data sets incorporate a time stamp, allowing users to run a model for a specified time period without editing the input files.
One of the most useful features of IWFM is the internal calculation of water demands for each land use type. IWFM simulates four land use classes: agricultural, urban, native vegetation, and riparian vegetation. Land use areas are delineated as a time series, with corresponding evapotranspiration rates and water management parameters. Each time step, the land use process applies precipitation, calculates infiltration and runoff, calculates water demands, and determines what portion of the demands are not met by soil moisture. For agricultural and urban land use classes, IWFM then applies surface water and groundwater at specified rates, and optionally adjusts surface water and groundwater to exactly meet water demands. This automatic adjustment feature is especially useful for calculating unmeasured flow components (such as groundwater withdrawals) or for simulating proposed future scenarios such as studying the impacts of potential climate change.
In IWFM, the land surface, surface water and groundwater flow domains are simulated as separate processes, compiled into individual dynamic link libraries. The processes are linked by water flow terms, maintain |
https://en.wikipedia.org/wiki/Cross-sector%20biodiversity%20initiative | The Cross-Sector Biodiversity Initiative (CSBI)] is a partnership between IPIECA - the global oil and gas industry association for environmental and social issues, the International Council on Mining and Metals (ICMM) and the Equator Principles Association to develop and share good practices related to management of biodiversity and ecosystem services in the extractive industries.
The initiative supports the broader goals of innovative and transparent application of the mitigation hierarchy in relation to biodiversity and ecosystem services, as defined in the International Finance Corporation (IFC) Performance Standard 6: Biodiversity Conservation and Sustainable Management of Living Natural Resources (2012).
CSBI Charter and Governance
The vision and mission of the initiative are presented in its Charter developed and released by the 3 partner associations in 2013. CSBI is run by its member associations and volunteers from member companies and multilateral financing institutions, with the support of a part-time coordinator.
CBSI’s Leading Practice Tools
Between 2013 and 2015, CSBI released to the public three tools related to applying the mitigation hierarchy for biodiversity management, available for free on CSBI's website:
The Tool for Aligning Timelines for Project Execution, Biodiversity Management and Financing
Good Practices for the Collection of Biodiversity Baseline Data
The Cross-Sector Guide for Implementing the Mitigation Hierarchy
One-page summaries are available in English, French, Spanish, Italian, Japanese and Russian. Further translations are pending.
References
External links
Official CSBI website
Cross-Sector Guide for Implementing the Mitigation Hierarchy (on The Biodiversity Consultancy's website)
Biodiversity |
https://en.wikipedia.org/wiki/LXLE%20Linux | LXLE is a Linux distribution based upon the most recent Ubuntu/Lubuntu LTS release, using the LXDE desktop environment. LXLE is a lightweight distro, with a focus on visual aesthetics, that works well on both old and new hardware.
Reception
In a January 2014 review in Full Circle Magazine, Gabriele Tettamanzi noted that LXLE has some minor localization issues but otherwise described it as a nice "light and fast" desktop "rich" with software and "stable".
Jesse Smith reviewed LXLE 12.04.3 for DistroWatch Weekly:
Jesse Smith also reviewed LXDE 14.04, concluding, "Generally speaking, I enjoyed my time with LXLE. The distribution got off to a good start with a smooth installation process and the project features clear documentation and release notes, letting people know exactly what to expect from the distribution. I like the LXDE desktop as I feel it does an excellent job of balancing user friendliness, performance and features."
In reviewing LXLE 18.04.3, Marius Nestor of Softpedia said, "LXLE features unique Expose, Aero Snap, and Quick Launch apps, random or interval wallpaper changers, theme consistency throughout the system, as well as numerous other tweaks and additions you won't find in other distros. The system is very fast and boots in less than one minute, and it's perfect to revive that old PC."
The current version LXLE Focal is based on Ubuntu 20.04.4 LTS with LXDE.
Releases
References
External links
Linux distributions
Operating system distributions bootable from read-only media
Ubuntu derivatives |
https://en.wikipedia.org/wiki/Lightbot | Lightbot is an educational video game for learning software programming concepts, developed by Danny Yaroslavski. Lightbot has been played 7 million times, and is highly rated on iTunes and Google Play store. Lightbot is available as an online Flash game, and an application for Android and iOS mobile phones. Lightbot has been built with Flash and OpenFL.
The goal of Lightbot is to command a little robot to navigate a maze and turn on lights. Players arrange symbols on the screen to command the robot to walk, turn, jump, switch on a light and so on. The maze and the list of symbols become more complicated as the lessons progress. While using such commands, players learn programming concepts like loops, procedures and more, without entering code in any programming language.
References
See also
Colobot
2008 video games
Android (operating system) games
Browser games
Flash games
IOS games
Maze games
Programming games
Video games about robots
Video games developed in the United States |
https://en.wikipedia.org/wiki/Nanoscale%20secondary%20ion%20mass%20spectrometry | NanoSIMS (nanoscale secondary ion mass spectrometry) is an analytical instrument manufactured by CAMECA which operates on the principle of secondary ion mass spectrometry. The NanoSIMS is used to acquire nanoscale resolution measurements of the elemental and isotopic composition of a sample. The NanoSIMS is able to create nanoscale maps of elemental or isotopic distribution, parallel acquisition of up to seven masses, isotopic identification, high mass resolution, subparts-per-million sensitivity with spatial resolution down to 50 nm.
The original design of the NanoSIMS instrument was conceived by Georges Slodzian at the University of Paris Sud in France and at the Office National d'Etudes et de Recherches Aérospatiales. There are currently around 50 NanoSIMS instruments worldwide.
How it works
The NanoSIMS uses an ion source to produce a primary beam of ions. These primary ions erode the sample surface and produce atomic collisions, some of these collisions result in the release of secondary ion particles. These ions are transmitted through a mass spectrometer, where the masses are measured and identified. The primary ion beam is rastered across the sample surface and a ‘map’ of the element and isotope distribution is created by counting the number of ions that originated from each pixel with at best a 50 nanometer (nm) resolution, 10-50 times greater than conventional SIMS. This is achieved by positioning the primary probe in close proximity to the sample using a coaxial lens assembly. The primary ion beam impacts the sample surface at 90°, with the secondary ions extracted back through the same lens assembly. This allows for the isotopic composition of individual cells to be distinguished at parts per million (ppm) or parts per billion (ppb) range. The main drawback of this set up is that the primary and secondary ion beams must be of opposite polarity which can limit which elements can be detected simultaneously.
NanoSIMS can detect minute mass differences |
https://en.wikipedia.org/wiki/Active%20Network%20Management | In electricity distribution circuits, Active Network Management (ANM) describes control systems that manage generation and load for specific purposes. This is usually done to keep system parameters (voltage, power, phase balance, reactive power and frequency) within predetermined limits. ANM generally refers to automated systems.
Details
Real-time or near-real-time measurements are used with a model of the system to determine the control signals that need to be sent to users and generators. These will be requests to adjust power or other parameters. Other equipment can also be included in an ANM system that balances phases, pushes or pulls reactive power or switches circuits to achieve the desired results. The results of the requested changes are monitored and fed back into the data model.
Predictive and forecasting methods may be used to prepare the network for anticipated conditions. This may include delaying load from being connected if an increase in power generation (say from wind turbines, solar power, or tidal generators) is expected in the near future. It may also include bringing on load ahead of schedule (say water pumping or energy storage) ahead of anticipated uncontrollable load—especially domestic or industrial use.
Some systems may include an element of human intervention. This is particularly important for large and complex systems where an accurate, predictive model is impossible to produce. Anticipating human behavior is best done by humans rather than by machines and national grid companies ultimately rely on a team of experienced experts to balance the system.
One purpose of an ANM system can be to allow additional generating capacity to be attached to the existing electrical grid whilst allowing the generators to be shut off if the capacity of the infrastructure might be overloaded under certain conditions; while permitting the generators to be used more effectively if the grid is later "reinforced".
Examples
The ANM system on the Orkney i |
https://en.wikipedia.org/wiki/Adversarial%20machine%20learning | Adversarial machine learning is the study of the attacks on machine learning algorithms, and of the defenses against such attacks. A survey from May 2020 exposes the fact that practitioners report a dire need for better protecting machine learning systems in industrial applications.
Most machine learning techniques are mostly designed to work on specific problem sets, under the assumption that the training and test data are generated from the same statistical distribution (IID). However, this assumption is often dangerously violated in practical high-stake applications, where users may intentionally supply fabricated data that violates the statistical assumption.
Some of the most common attacks in adversarial machine learning include evasion attacks, data poisoning attacks, Byzantine attacks and model extraction.
History
At the MIT Spam Conference in January 2004, John Graham-Cumming showed that a machine learning spam filter could be used to defeat another machine learning spam filter by automatically learning which words to add to a spam email to get the email classified as not spam.
In 2004, Nilesh Dalvi and others noted that linear classifiers used in spam filters could be defeated by simple "evasion attacks" as spammers inserted "good words" into their spam emails. (Around 2007, some spammers added random noise to fuzz words within "image spam" in order to defeat OCR-based filters.) In 2006, Marco Barreno and others published "Can Machine Learning Be Secure?", outlining a broad taxonomy of attacks. As late as 2013 many researchers continued to hope that non-linear classifiers (such as support vector machines and neural networks) might be robust to adversaries, until Battista Biggio and others demonstrated the first gradient-based attacks on such machine-learning models (2012–2013). In 2012, deep neural networks began to dominate computer vision problems; starting in 2014, Christian Szegedy and others demonstrated that deep neural networks could be fooled b |
https://en.wikipedia.org/wiki/PIC%20instruction%20listings | The PIC instruction set refers to the set of instructions that Microchip Technology PIC or dsPIC microcontroller supports. The instructions are usually programmed into the Flash memory of the processor, and automatically executed by the microcontroller on startup.
PICmicro chips have a Harvard architecture and instruction words have unusual sizes. Originally, 12-bit instructions included 5 address bits to specify the memory operand, and 9-bit branch destinations. Later revisions added opcode bits, allowing additional address bits.
In the instruction set tables that follow, register numbers are referred to as "f", while constants are referred to as "k". Bit numbers (0–7) are selected by "b". The "d" bit selects the destination: 0 indicates W, while 1 indicates that the result is written back to source register f. The C and Z status flags may be set based on the result; otherwise they are unmodified. Add and subtract (but not rotate) instructions that set C also set the DC (digit carry) flag, the carry from bit 3 to bit 4, which is useful for BCD arithmetic.
Architecture
Memory operands are also referred to as "registers". Most are simply general-purpose storage (RAM), while some locations are reserved for special function registers. Except for a single accumulator (called W), almost all other registers are memory-mapped, even registers like the program counter and ALU status register. (The other exceptions, which are not memory-mapped, are the return address stack, and the tri-state registers used to configure the GPIO pins.)
The instruction set does not contain conditional branch instructions. Instead, it contains conditional skip instructions which cause the following instruction to be ignored. A conditional skip followed by an unconditional branch performs a conditional branch. The skip instructions test any bit of any register. The ALU status register is one possibility.
Memory operands are specified by absolute address; the location is fixed at |
https://en.wikipedia.org/wiki/CodeChef | CodeChef is an online educational and competitive programming platform. CodeChef started as an educational initiative in 2009 by Directi, an Indian software company. In 2020, it was purchased by Unacademy.
After failing to reach profitability, Unacademy said it would retain a 30% stake in CodeChef while returning the remaining equity to the company's founding team to grow further.
Along with monthly coding contests, CodeChef has initiatives for schools, colleges and women in competitive programming. It hosted the India regionals of the ICPC for college students, as well as for the International Olympiad in Informatics (IOI), for school students in India.
Most parts of CodeChef are available without charge, but the more advanced features require a monthly subscription. CodeChef competes with similar Ed-Tech companies like LeetCode, HackerRank, SPOJ, PrepInsta Prime, Topcoder, GeeksforGeeks, etc.
History
In 2010, Directi launched Code-Chef to help programmers improve their problem-solving skills through active participation in programming contests. The goal was to strengthen problem-solving skills by fostering friendly competition and community engagement. In July, the organization launched the "Go for Gold" initiative, enabling Indian teams to excel at the world finals of the International Collegiate Programming Contest (formerly known as ACM-ICPC).
In July 2013, Directi launched the "Code-Chef for Schools" program to encourage school students to participate in programming. The initiative hopes to enable Indian students to excel at the International Olympiad in Informatics (IOI). The competition requires contestants to show necessary IT skills such as problem analysis, algorithm and data structure design, programming, and testing.
In November 2017, the first Code-Chef Certification exam was conducted. By 2018, the organization launched CodeChef for Business to target technology enterprises.
In 2020, its ownership was changed from Directi to Unacademy.
Referen |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.