source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/Help%20Crafter | Help Crafter is a Macintosh-based help authoring tool published by US-based company Putercraft LLC. It outputs a native Mac help bundle to be included in Mac applications.
The latest release is version 2.0. It is available from the Apple App Store.
Description
Help Crafter is a help authoring tool for Macintosh desktop applications. It allows users to create individual pages using its text editor, and organize pages in a tree structure. Each page can contain keywords and an abstract that allows users to find content anywhere in the Apple Help Viewer system application.
See also
List of help authoring tools
User assistance
External links
Technical communication
Technical communication tools
Online help |
https://en.wikipedia.org/wiki/Demiregular%20tiling | In geometry, the demiregular tilings are a set of Euclidean tessellations made from 2 or more regular polygon faces. Different authors have listed different sets of tilings. A more systematic approach looking at symmetry orbits are the 2-uniform tilings of which there are 20. Some of the demiregular ones are actually 3-uniform tilings.
20 2-uniform tilings
Grünbaum and Shephard enumerated the full list of 20 2-uniform tilings in Tilings and Patterns, 1987:
Ghyka's list (1946)
Ghyka lists 10 of them with 2 or 3 vertex types, calling them semiregular polymorph partitions.
Steinhaus's list (1969)
Steinhaus gives 5 examples of non-homogeneous tessellations of regular polygons beyond the 11 regular and semiregular ones. (All of them have 2 types of vertices, while one is 3-uniform.)
Critchlow's list (1970)
Critchlow identifies 14 demi-regular tessellations, with 7 being 2-uniform, and 7 being 3-uniform.
He codes letter names for the vertex types, with superscripts to distinguish face orders. He recognizes A, B, C, D, F, and J can't be a part of continuous coverings of the whole plane.
References
Ghyka, M. The Geometry of Art and Life, (1946), 2nd edition, New York: Dover, 1977.
Keith Critchlow, Order in Space: A design source book, 1970, pp. 62–67
pp. 35–43
Steinhaus, H. Mathematical Snapshots 3rd ed, (1969), Oxford University Press, and (1999) New York: Dover
p. 65
In Search of Demiregular Tilings, Helmer Aslaksen
External links
n-uniform tilings Brian Galebach
Tessellation
Semiregular tilings |
https://en.wikipedia.org/wiki/Geekbench | Geekbench is a proprietary and freemium cross-platform utility for benchmarking the central processing unit (CPU) and graphics processing unit (GPU) of computers, laptops, tablets, and phones.
History
Geekbench began as a benchmark for Mac OS X and Windows, and is now a cross-platform benchmark that supports macOS, Windows, Linux, Android and iOS.
In version 4, Geekbench started measuring GPU performance in areas such as image processing and computer vision.
In version 5, Geekbench dropped support for x86-32.
In version 6, the current version, Geekbench includes CPU and GPU Compute benchmarks.
Usage
It uses a scoring system that separates single-core and multi-core performance, and workloads designed to simulate real-world scenarios. The software benchmark is available for macOS, Windows, Linux, Android and iOS. Free users are required to upload test results online in order to run the benchmark.
In 2013, the usefulness of the scores from earlier versions of Geekbench (up to version 3) was heavily disputed by Linus Torvalds in an online forum. Linus's concerns that Geekbench combined disparate benchmarks into a single score were addressed in Geekbench 4 by splitting integer, floating point, and crypto into sub-scores. Linus regarded this changes as improvements in an informal review.
References
External links
Benchmarks (computing) |
https://en.wikipedia.org/wiki/Functional%20database%20model | The functional database model is used to support analytics applications such as financial planning and performance management. The functional database model, or the functional model for short, is different from but complementary to the relational model. The functional model is also distinct from other similarly named concepts, including the DAPLEX functional database model and functional language databases.
The functional model is part of the online analytical processing (OLAP) category since it comprises multidimensional hierarchical consolidation. But it goes beyond OLAP by requiring a spreadsheet-like cell orientation, where cells can be input or calculated as functions of other cells. Also as in spreadsheets, it supports interactive calculations where the values of all dependent cells are automatically up to date whenever the value of a cell is changed.
Overview
Analytics, especially forward looking or prospective analytics requires interactive modeling, "what if", and experimentation of the kind that most business analysts do with spreadsheets. This interaction with the data is enabled by the spreadsheet’s cell orientation and its ability to let users define cells calculated as a function of other cells.
The relational database model has no such concepts and is thus very limited in the business performance modeling and interactivity it can support. Accordingly, relational-based analytics is almost exclusively restricted to historical data, which is static. This misses most of the strategic benefits of analytics, which come from interactively constructing views of the future.
The functional model is based on multidimensional arrays, or "cubes", of cells that, as in a spreadsheet, can be either externally input, or calculated in terms of other cells. Such cubes are constructed using dimensions which correspond to hierarchically organized sets of real entities such as products, geographies, time, etc. A cube can be seen as a function over the cartesian product |
https://en.wikipedia.org/wiki/Oil%20content%20meter | An oil content meter (OCM) is an integral part of all oily water separator (OWS) systems. Oil content meters are also sometimes referred to as oil content monitors, bilge alarms, or bilge monitors.
OCM technology
The OCM continuously monitors how much oil is in the water that is pumped out the discharge line of the OWS system. The OCM will not allow the oil concentration of the exiting water to be above the Marpol standard of 15 ppm. This standard was first adopted in 1977 with Resolution A.393(X) which was published by IMO. These standards were updated various but the most current resolution is MEPC 108(49). The oil content meter will sound an alarm if the liquid leaving the system has an unsatisfactory amount of oil in the mixture. If it is still above that standard, then the bilge water will be reentered into the system until it meets the required criteria. The OCM uses light beams to determine how oily the water in the system is. The system will then gauge the oil concentration based on a light intensity meter. Modern oil content meters also have a data logging system that can store oil concentration measurements for more than 18 months.
If the OCM determines that there is far too much of a type of oil, the OCM may be fouled and needs to be flushed out. Running clean water through the OCM sensor cell is one way it can be cleaned. Also scrubbing the sensor area with a bottle brush is another effective method. The new MEPC 107(49) regulations have set out stringent actions that require the OCM to be tamper proof and also the OCM needs to have an alarm that sounds whenever the OCM is being cleaned. When the alarm goes off, the OCM functionality will be checked by crew members.
An OCM is a small part of what is called the oil discharge monitoring and control system. The first part is the oil content meter. The second is a flow meter which measures the flow rate of the water at the discharge pipe. Third, is a computing unit which calculates how much oil |
https://en.wikipedia.org/wiki/Evolution%20of%20a%20random%20network | Evolution of a random network is a dynamical process, usually leading to emergence of giant component accompanied with striking consequences on the network topology. To quantify this process, there is a need of inspection on how the size of the largest connected cluster within the network, , varies with the average degree . Networks change their topology as they evolve, undergoing phase transitions. Phase transitions are generally known from physics, where it occurs as matter changes state according to its thermal energy level, or when ferromagnetic properties emerge in some materials as they are cooling down. Such phase transitions take place in matter because it is a network of particles, and as such, rules of network phase transition directly apply to it. Phase transitions in networks happen as links are added to a network, meaning that having N nodes, in each time increment, a link is placed between a randomly chosen pair of them. The transformation from a set of disconnected nodes to a fully connected network is called the evolution of a network.
If we begin with a network having N totally disconnected nodes (number of links is zero), and start adding links between randomly selected pairs of nodes, the evolution of the network begins. For some time we will just create pairs of nodes. After a while some of these pairs will connect, forming little trees. As we continue adding more links to the network, there comes a point when a giant component emerges in the network as some of these isolated trees connect to each other. This is called the critical point. In our natural example, this point corresponds to temperatures where materials change their state. Further adding nodes to the system, the giant component becomes even larger, as more and more nodes get a link to another node which is already part of the giant component. The other special moment in this transition is when the network becomes fully connected, that is, when all nodes belong to the one giant compo |
https://en.wikipedia.org/wiki/Xulvi-Brunet%E2%80%93Sokolov%20algorithm | Xulvi-Brunet and Sokolov's algorithm generates networks with chosen degree correlations. This method is based on link rewiring, in which the desired degree is governed by parameter ρ. By varying this single parameter it is possible to generate networks from random (when ρ = 0) to perfectly assortative or disassortative (when ρ = 1). This algorithm allows to keep network's degree distribution unchanged when changing the value of ρ.
Assortative model
In assortative networks, well-connected nodes are likely to be connected to other highly connected nodes. Social networks are examples of assortative networks. This means that an assortative network has the property that almost all nodes with the same degree are linked only between themselves.
The Xulvi-Brunet–Sokolov algorithm for this type of networks is the following.
In a given network, two links connecting four different nodes are chosen randomly. These nodes are ordered by their degrees. Then, with probability ρ, the links are randomly rewired in such a way that one link connects the two nodes with the smaller degrees and the other connects the two nodes with the larger degrees. If one or both of these links already existed in the network, the step is discarded and is repeated again. Thus, there will be no self-connected nodes or multiple links connecting the same two nodes. Different degrees of assortativity of a network can be achieved by changing the parameter ρ.
Assortative networks are characterized by highly connected groups of nodes with similar degree. As assortativity grows, the average path length and clustering coefficient increase.
Disassortative model
In disassortative networks, highly connected nodes tend to connect to less-well-connected nodes with larger probability than in uncorrelated networks. Examples of such networks include biological networks.
The Xulvi-Brunet and Sokolov's algorithm for this type of networks is similar to the one for assortative networks with one minor change. As bef |
https://en.wikipedia.org/wiki/Metocean | In offshore and coastal engineering, metocean refers to the syllabic abbreviation of meteorology and (physical) oceanography.
Metocean study
In various stages of an offshore or coastal engineering project a metocean study will be undertaken. This, in order to estimate the environmental conditions of direct influence on the choices to be made during the project phase at hand, and to arrive at an effective and efficient solution for the problems/goals stated. In later phases of a project, more detailed and thorough metocean studies may be needed, depending on whether there is an expected additional gain with respect to the successful and efficient completion of the project.
Metocean conditions
Metocean conditions refer to the combined wind, wave and climate (etc.) conditions as found on a certain location. They are most often presented as statistics, including seasonal variations, scatter tables, wind roses and probability of exceedance. The metocean conditions may include, depending on the project and its location, statistics on:
Meteorology
wind speed, direction, gustiness, wind rose and wind spectrum
air temperature
humidity
occurrence and strength of typhoons, hurricanes and (other) cyclones
Physical oceanography
water level fluctuations
historical, expected and seasonal sea level changes
storm surges
tides
tsunamis
seiches
wind waves – wind seas and swells – characterised by statistics like: significant wave heights and periods, propagation directions and (directional) spectra
bathymetry
salinity, temperature and other constituents
stratification, density-driven currents and internal waves
ice occurrence, extent, thickness, strength and seabed gouging
Metocean data
The metocean conditions are preferably based on metocean data, which can come from measuring instruments deployed in or near the project area, global (re-analysis) models and remote sensing (often by satellites). For estimating probabilities of exceedance – for relevant physical |
https://en.wikipedia.org/wiki/Electric%20motorsport | Electric motorsport is a category of motor sport that consists of the racing of electric powered vehicles for competition, either in all-electric series, or in open-series against vehicles with different powertrains. Very early in the history of automobiles, electric cars held several performance records over internal combustion engine cars, such as land speed records, but fell behind in performance during the first decade of the 20th century.
With the renaissance of electric vehicles during the early 21st century, notable electric-only racing series have been developed, for both cars and motorcycles, including for example, the FIA Formula E World Championship. In other racing events, electric vehicles are competing alongside combustion engine vehicles, for example in the Isle of Man TT and the Pikes Peak International Hill Climb, and in some cases winning outright.
History
Background and early powertrains
Early mechanically powered vehicles used steam power, a technology first developed for static applications (notably, Thomas Newcomen 1712 and James Watt 1765) (see History of the steam engine). Steam for vehicle traction was taken up both for road vehicles and for rail by Richard Trevithick who creating the Puffing devil for transporting passengers by road in 1801, and later rail transport, initially for coal (1804) and then for people (Trevethick 1808, George Stephenson 1824 onwards). By the 1830s steam began to be more widely adopted for transportation, with steam carriages for road (e.g. the 1827 Goldsworthy Gurney Steam bus) and for rail, although the latter quickly became more established for medium and longer distance travel. Mechanically powered road vehicles were largely limited to utilitarian vehicles such as traction engines during this period (especially 1850s onwards, see History of steam road vehicles).
During the 1860s diverse small experiments with personal transportation and different powertrains blossomed, with steam buggies (e.g. Henry Tay |
https://en.wikipedia.org/wiki/Lactoscope | The lactoscope is an instrument for estimating the amount of cream in milk, based on its relative opacity. The higher the opacity, the greater the amount of cream present. Credit for the development of this instrument is given to Alfred Donné in 1843. The instrument was also used to measure the fat content of milk, but it gave inaccurate results.
References
See also
Lactometer
Measuring instruments |
https://en.wikipedia.org/wiki/Lancichinetti%E2%80%93Fortunato%E2%80%93Radicchi%20benchmark | Lancichinetti–Fortunato–Radicchi benchmark is an algorithm that generates benchmark networks (artificial networks that resemble real-world networks). They have a priori known communities and are used to compare different community detection methods. The advantage of the benchmark over other methods is that it accounts for the heterogeneity in the distributions of node degrees and of community sizes.
The algorithm
The node degrees and the community sizes are distributed according to a power law, with different exponents. The benchmark assumes that both the degree and the community size have power law distributions with different exponents, and , respectively. is the number of nodes and the average degree is . There is a mixing parameter , which is the average fraction of neighboring nodes of a node that do not belong to any community that the benchmark node belongs to. This parameter controls the fraction of edges that are between communities. Thus, it reflects the amount of noise in the network. At the extremes, when all links are within community links, if all links are between nodes belonging to different communities.
One can generate the benchmark network using the following steps.
Step 1: Generate a network with nodes following a power law distribution with exponent and choose extremes of the distribution and to get desired average degree is .
Step 2: fraction of links of every node is with nodes of the same community, while fraction is with the other nodes.
Step 3: Generate community sizes from a power law distribution with exponent . The sum of all sizes must be equal to . The minimal and maximal community sizes and must satisfy the definition of community so that every non-isolated node is in at least in one community:
Step 4: Initially, no nodes are assigned to communities. Then, each node is randomly assigned to a community. As long as the number of neighboring nodes within the community does not exceed the community size a new node |
https://en.wikipedia.org/wiki/Yair%20Minsky | Yair Nathan Minsky (born in 1962) is an Israeli-American mathematician whose research concerns three-dimensional topology, differential geometry, group theory and holomorphic dynamics. He is a professor at Yale University. He is known for having proved Thurston's ending lamination conjecture and as a student of curve complex geometry.
Biography
Minsky obtained his Ph.D. from Princeton University in 1989 under the supervision of William Paul Thurston, with the thesis Harmonic Maps and Hyperbolic Geometry.
His Ph.D. students include Jason Behrstock, Erica Klarreich, Hossein Namazi and Kasra Rafi.
Honors and awards
He received a Sloan Fellowship in 1995.
He was a speaker at the ICM (Madrid) 2006.
He was named to the 2021 class of fellows of the American Mathematical Society "for contributions to hyperbolic 3-manifolds, low-dimensional topology, geometric group theory and Teichmuller theory". He was elected to the American Academy of Arts and Sciences in 2023.
Selected invited talks
Coxeter lectures (Fields Institute) 2006
Mallat Lectures (Technion) 2008
Selected publications
with Howard Masur: "Geometry of the complex of curves I: Hyperbolicity", Inventiones mathematicae, 138 (1), 103–149.
with Howard Masur: "Geometry of the complex of curves II: Hierarchical structure", Geometric and Functional Analysis, 10 (4), 902–974.
"The classification of Kleinian surface groups, I: Models and bounds", Annals of Mathematics, 171 (2010), 1–107.
with Jeffrey Brock, and Richard Canary: "The classification of Kleinian surface groups, II: The ending lamination conjecture", Annals of Mathematics, 176 (2012), 1–149.
with Jason Behrstock: "Dimension and rank for mapping class groups", Annals of Mathematics (2) 167 (2008), no. 3, 1055–1077.
"The classification of punctured-torus groups", Annals of Mathematics, 149 (1999), 559–626.
"On rigidity, limit sets, and end invariants of hyperbolic 3-manifolds", Journal of the American Mathematical Society, 7 (3), 539–588.
See also
Ending |
https://en.wikipedia.org/wiki/Out%20to%20Innovate | Out to Innovate, previously the National Organization of Gay and Lesbian Scientists and Technical Professionals (NOGLSTP), is a professional society for professionals in science, technology, mathematics, and engineering. Each year, Out to Innovate gives the Walt Westman Award to members who helped make significant contributions to the association's mission.
History
The organization was organized along the lines of earlier organizations of gay scientists in Los Angeles and the Research Triangle area of North Carolina, and arose out of a session at the 1980 American Association for the Advancement of Science (AAAS) meeting. It was formally organized in 1983 and incorporated in California in 1991. The foundation of the organization was in response to issues such as gay scientists not being able to get visas to immigrate to the United States or security clearances to work in government laboratories, the lack of research on LGBT health issues, and loss of productivity due to the stress of stigmatization. Much of the organization's early work related to increasing the visibility of LGBT scientists and opposing homophobia. In the 1990s, it focused on encouraging corporations to adopt nondiscrimination policies and assisted in a 1995 Government Accounting Office report that recommended that LGBT status should not be considered a vulnerability to blackmail in security clearance investigations. In the 2000s and 2010s, awards for LGBT scientists, engineers, and STEM educators were established.
Programs and partnerships
Out to Innovate supports regional groups and caucuses who choose to affiliate with Out to Innovate. Out to Innovate affiliates and partners with other national STEM organizations, including AAAS. Out to Innovate also organizes a mentoring network, a scholarship program for students, and a biannual career summit.
Out Astronaut Project
In July 2019, Out to Innovate partnered with the Out Astronaut Project, a nonprofit initiative aimed at sending the firs |
https://en.wikipedia.org/wiki/Commit%20%28version%20control%29 | In version control systems, a commit is an operation which sends the latest changes of the source code to the repository, making these changes part of the head revision of the repository. Unlike commits in data management, commits in version control systems are kept in the repository indefinitely. Thus, when other users do an update or a checkout from the repository, they will receive the latest committed version, unless they specify that they wish to retrieve a previous version of the source code in the repository. Version control systems allow rolling back to previous versions easily. In this context, a commit within a version control system is protected as it is easily rolled back, even after the commit has been applied.
Usage
Git
To commit a change in git on the command line, assuming git is installed, the following command is run:
git commit -m 'commit message'
This is also assuming that the files within the current directory have been staged as such:
git add .
The above command adds all of the files in the working directory to be staged for the git commit. After the commit has been applied, the last step is to push the commit to the given software repository, in the case below named origin, to the branch master:
git push origin master
Also, a shortcut to add all the unstaged files and make a commit at the same time is:
git commit -a -m 'commit message'
Mercurial (hg)
To commit a change in Mercurial on the command line, assuming hg is installed, the following command is used:
hg commit --message 'Commit Message'
This is also assuming that the files within the current directory have been staged as such:
hg add
The above command adds all of the files in the working directory to be staged for the Mercurial commit. After the commit has been applied, the last step is to push the commit to the given software repository, to the default branch:
hg push
See also
Commit (data management)
References
Version control systems |
https://en.wikipedia.org/wiki/List%20of%20mathematical%20artists | [[File:San Romano Battle (Paolo Uccello, London) 01.jpg|thumb|350px|Broken lances lying along perspective lines in Paolo Uccello's The Battle of San Romano, 1438]]
This is a list of artists who actively explored mathematics in their artworks. Art forms practised by these artists include painting, sculpture, architecture, textiles and origami.
Some artists such as Piero della Francesca and Luca Pacioli went so far as to write books on mathematics in art. Della Francesca wrote books on solid geometry and the emerging field of perspective, including De Prospectiva Pingendi (On Perspective for Painting), Trattato d’Abaco (Abacus Treatise), and De corporibus regularibus (Regular Solids),Piero della Francesca, Trattato d'Abaco, ed. G. Arrighi, Pisa (1970). while Pacioli wrote De divina proportione (On Divine Proportion)'', with illustrations by Leonardo da Vinci, at the end of the fifteenth century.
Merely making accepted use of some aspect of mathematics such as perspective does not qualify an artist for admission to this list.
The term "fine art" is used conventionally to cover the output of artists who produce a combination of paintings, drawings and sculptures.
List
References
External links
Saint Louis University: List of mathematical artists, by field
Artists
Lists of artists |
https://en.wikipedia.org/wiki/Santa%20Margherita%20Lines | The Santa Margherita Lines (), also known as the Firenzuola Lines (), are a line of fortifications in Cospicua, Malta. They were built in the 17th and 18th centuries to protect the land front defences of the cities of Birgu and Senglea. A second line of fortifications, known as the Cottonera Lines, was later built around the Santa Margherita Lines, while the city of Cospicua was founded in the 18th century within the Santa Margherita and Cottonera Lines.
The Santa Margherita Lines have been on Malta's tentative list of UNESCO World Heritage Sites since 1998, as part of the Knights' Fortifications around the Harbours of Malta.
The lines, also known as Santa Margherita Enceinte, were built to the designs of the Dominican Cardinal Fra Vincenzo Maculano da Firenzuola.
History
The foundation stone of the Santa Margherita Lines was laid on 30 December 1638 by Grand Master Giovanni Paolo Lascaris. The lines were designed by Vincenzo Maculano da Firenzuola, and were meant to protect the land fronts of Birgu and Senglea, and also to prevent a flanking attack on the capital Valletta. The lines were built on Santa Margherita Hill, known colloquially as il-Mandra, possibly on the ruins of an ancient Greek temple or an earlier castle. The hill is featured in the account of the Great Siege of 1565 by arquebusier Francesco Balbi di Corregio, who mentioned that a belvedere existed on it.
The engineer of the Grand Duke of Tuscany, Marquis di S. Angelo, has proceeded for the construction project in the building of the lines.
When the three central bastions were completed in 1645, construction work stopped due to a lack of funds. The lines remained unfinished for many years, and they became known as Fort Santa Margarita or Fort Margarita. In the 1670s, the Cottonera Lines were built around the still unfinished Santa Margherita Lines, but construction of the new fortifications was suspended in 1680 with the death of Grand Master Cotoner.
Construction of both the Santa Margherita |
https://en.wikipedia.org/wiki/Lai-Sang%20Young | Lai-Sang Lily Young (, born 1952) is a Hong Kong-born American mathematician who holds the Henry & Lucy Moses Professorship of Science and is a professor of mathematics and neural science at the Courant Institute of Mathematical Sciences of
New York University. Her research interests include dynamical systems, ergodic theory, chaos theory, probability theory, statistical mechanics, and neuroscience. She is particularly known for introducing the method of Markov returns in 1998, which she used to prove exponential correlation delay in Sinai billiards and other hyperbolic dynamical systems.
Education and career
Although born and raised in Hong Kong, Young came to the US for her education, earning a bachelor's degree from the University of Wisconsin–Madison in 1973. She moved to the University of California, Berkeley for her graduate studies, earning a master's degree in 1976 and completing her doctorate in 1978, under the supervision of Rufus Bowen. She taught at Northwestern University from 1979 to 1980, Michigan State University from 1980 to 1986, the University of Arizona from 1987 to 1990, and the University of California, Los Angeles from 1991 to 1999. She has been the Moses Professor at NYU since 1999.
Awards and honors
Young became a Sloan Fellow in 1985, and a Guggenheim Fellow in 1997.
In 1993, Young was given the Ruth Lyttle Satter Prize in Mathematics of the American Mathematical Society "for her leading role in the investigation of the statistical (or ergodic) properties of dynamical systems". This is a biennial award for outstanding research contributions by a female mathematician.
In 2004, she was elected as a fellow of the American Academy of Arts and Sciences.
Young was an invited speaker at the International Congress of Mathematicians in 1994, and an invited plenary speaker at the 2018 International Congress of Mathematicians.
In 2005, she presented the Noether Lecture of the Association for Women in Mathematics; her talk was entitled "From Limit |
https://en.wikipedia.org/wiki/Uniform%20tiling%20symmetry%20mutations | In geometry, a symmetry mutation is a mapping of fundamental domains between two symmetry groups. They are compactly expressed in orbifold notation. These mutations can occur from spherical tilings to Euclidean tilings to hyperbolic tilings. Hyperbolic tilings can also be divided between compact, paracompact and divergent cases.
The uniform tilings are the simplest application of these mutations, although more complex patterns can be expressed within a fundamental domain.
This article expressed progressive sequences of uniform tilings within symmetry families.
Mutations of orbifolds
Orbifolds with the same structure can be mutated between different symmetry classes, including across curvature domains from spherical, to Euclidean to hyperbolic. This table shows mutation classes. This table is not complete for possible hyperbolic orbifolds.
*n22 symmetry
Regular tilings
Prism tilings
Antiprism tilings
*n32 symmetry
Regular tilings
Truncated tilings
Quasiregular tilings
Expanded tilings
Omnitruncated tilings
Snub tilings
*n42 symmetry
Regular tilings
Quasiregular tilings
Truncated tilings
Expanded tilings
Omnitruncated tilings
Snub tilings
*n52 symmetry
Regular tilings
*n62 symmetry
Regular tilings
*n82 symmetry
Regular tilings
References
Sources
John H. Conway, Heidi Burgiel, Chaim Goodman-Strass, The Symmetries of Things 2008,
From hyperbolic 2-space to Euclidean 3-space: Tilings and patterns via topology Stephen Hyde
Polyhedra
Euclidean tilings
Hyperbolic tilings |
https://en.wikipedia.org/wiki/Defense%20line | A defense line or fortification line is a geographically-recognizable line of troops and armament, fortified and set up to protect a high-value location or defend territory.
A defense line may be based on natural difficult terrain features, such as rivers or marshes, mountain ranges, or coastlines; temporary field fortification works such as trenches; and/or more permanent fortifications such as fortresses and bunkers.
List of defense lines
Some notable defense lines include:
Historical
Great Wall of China, China
Sassanian defense lines
Great Wall of Gorgan, Persia
Derbent Walls
Defence lines of the Netherlands
Median Wall (before 401 BC)
Limes Germanicus, Germany
Hadrian's Wall, United Kingdom (122)
Antonine Wall, United Kingdom (142)
Offa's Dyke, Wales (early 5th century)
The Pale, Ireland (late 12th century)
Serpent's Wall, Ukraine
Western Russian fortresses, Russia
Civil War Defenses of Washington, United States
Victoria Lines, Malta (1875)
Hindenburg Line, France (1916)
Maginot Line, France (1929)
Schuster Line, Luxembourg
Metaxas Line, Greece (1936-1941)
Mannerheim Line, Finland (1939–1940)
K-W Line, Belgium (1939)
Siegfried Line, Germany
Gothic Line, Italy
Winter Line (Gustav, Bernhardt and Hitler Lines), Italy
Panther–Wotan line, Russia (1943)
Pusan Perimeter, South Korea (1950)
McNamara Line, South Vietnam (1966)
Bar Lev Line, Sinai Peninsula (1973)
Modern
Russia–Ukraine barrier, Ukraine
Wagner Line, Ukraine
Muhamalai FDL, Sri Lanka
Nagarcoil FDL, Sri Lanka
Notes
References |
https://en.wikipedia.org/wiki/ESITH | The School of Textile and Clothing industries (ESITH) is a Moroccan engineering school, established in 1996, that focuses on textiles and clothing. It was created in collaboration with ENSAIT and ENSISA, as a result of a public private partnership designed to grow a key sector in the Moroccan economy. The partnership was successful and has been used as a model for other schools.
ESITH is the only engineering school in Morocco that provides a comprehensive program in textile engineering with internships for students at the Canadian Group CTT. Edith offers three programs in industrial engineering: product management, supply chain, and logistics, and textile and clothing
References
Universities and colleges in Morocco
1996 establishments in Morocco
Educational institutions established in 1996
Textile engineering
20th-century architecture in Morocco |
https://en.wikipedia.org/wiki/Fim%20switch | The fim switch in Escherichia coli is the mechanism by which the fim gene cluster, encoding Type I Pili, is transcriptionally controlled.
These pili are virulence factors involved in adhesion, especially important in uropathogenic Escherichia coli. The gene undergoes phase variation mediated via two recombinases and is a model example of site specific inversion.
Structure and mechanism of phase variation
The operon consists of the promoter region fim S, the main constituent fim A, its gene product forming a rod like structure and fim H, coding for an adhesin at the tip, to name just a few important elements. The fim S region is flanked by 9bp repeats that are mirror images of each other. These mirror images serve as substrates for two ATP-dependent recombinases, fim B and fim E. These recombinases can invert the orientation of the fim S region and only one orientation allows for 3' to 5' transcription.
fim B "flips" the promoter region both ways, from the "on" position to the "off" position and vice versa, whereas fim E can only facilitate recombination from "on" to "off". This equilibrium, shifted towards maintaining the "off" position, due to higher fim E activity, serves as a mode of expressing pili only when adhesion is needed. Another level of transcriptional control in E. coli is mediated by the sensitivity of the recombinases to pH and osmolarity, further ensuring appropriate expression levels of type-I pili, given the stark differences in osmolarity inside and outside an animal's body. Type-I pili are expressed by many species of Enterobacteriaceae. The transcriptional control can differ widely between species, in Salmonella typhimurium, for example much influence is exerted by a leucine-responsive regulatory protein and there is no fim S element.
References
Genetics
Escherichia coli
Gene expression
Virulence factors |
https://en.wikipedia.org/wiki/Cosmos%20%28category%20theory%29 | In the area of mathematics known as category theory, a cosmos is a symmetric closed monoidal category that is complete and cocomplete. Enriched category theory is often considered over a cosmos.
References
Category theory |
https://en.wikipedia.org/wiki/Speculative%20evolution | Speculative evolution is a subgenre of science fiction and an artistic movement focused on hypothetical scenarios in the evolution of life, and a significant form of fictional biology. It is also known as speculative biology and it is referred to as speculative zoology in regards to hypothetical animals. Works incorporating speculative evolution may have entirely conceptual species that evolve on a planet other than Earth, or they may be an alternate history focused on an alternate evolution of terrestrial life. Speculative evolution is often considered hard science fiction because of its strong connection to and basis in science, particularly biology.
Speculative evolution is a long-standing trope within science fiction, often recognized as beginning as such with H. G. Wells's 1895 novel The Time Machine, which featured several imaginary future creatures. Although small-scale speculative faunas were a hallmark of science fiction throughout the 20th century, ideas were only rarely well-developed, with some exceptions such as Stanley Weinbaum's Planetary series, Edgar Rice Burroughs's Barsoom, a fictional rendition of Mars and its ecosystem published through novels from 1912 to 1941, and Gerolf Steiner's Rhinogradentia, a fictional order of mammals created in 1957.
The modern speculative evolution movement is generally agreed to have begun with the publication of Dougal Dixon's 1981 book After Man, which explored a fully realized future Earth with a complete ecosystem of over a hundred hypothetical animals. The success of After Man spawned several "sequels" by Dixon, focusing on different alternate and future scenarios. Dixon's work, like most similar works that came after them, were created with real biological principles in mind and were aimed at exploring real life processes, such as evolution and climate change, through the use of fictional examples.
Speculative evolution's possible use as an educational and scientific tool has been noted and discussed through |
https://en.wikipedia.org/wiki/EIDORS | EIDORS is an open-source software tool box written mainly in MATLAB/GNU Octave designed primarily for image reconstruction from electrical impedance tomography (EIT) data, in a biomedical, industrial or geophysical setting. The name was originally an acronym for Electrical Impedance Tomography and Diffuse Optical Reconstruction Software. While the name reflects the original intention to cover image reconstruction of data from the mathematically similar near infra red diffuse optical imaging, to date there has been little development in that area.
The project was launched in 1999 with a Matlab code for 2D EIT reconstruction which had its origin in the PhD thesis of Marko Vauhkonen and the work of his supervisor Jari Kaipio at the University of Kuopio. While Kuopio also developed a three dimensional EIT code this was not released as open-source. Instead the three dimensional version of EIDORS was developed from work done at UMIST (now University of Manchester) by Nick Polydorides and William Lionheart.
Methods and models
The forward models in EIDORS use the finite element method and this requires mesh generation for sometimes irregular objects (such as human bodies), and the meshing needs to reflect the electrodes used to drive and measure current in EIT. For this purpose an interface was developed to the Netgen Mesh Generator.
History
As the project grew there was a desire to incorporate forward modelling and reconstruction code from a variety of groups and Andy Adler and Lionheart developed a more extensible software system. The most recent version is 3.10, released in Dec, 2019.
The EIDORS project also includes a repository of EIT data distributed under open-source licenses.
Applications
EIDORS has been extensively used in biomedical applications of EIT, including lung imaging, measuring cardiac output. It has been used for investigation of imaging electrical activity in the brain, and monitoring conductivity changes during radio-frequency ablation. Outsi |
https://en.wikipedia.org/wiki/Ciklum | Ciklum is an international software development and IT outsourcing company founded in Denmark in 2002. It is headquartered in London, United Kingdom.
The company has software development centers and branch offices in the United Kingdom, United States, United Arab Emirates, Spain, Switzerland, Denmark, Israel, Poland, Ukraine, and Pakistan.
Social responsibility and educational initiatives
In 2011, Ciklum partnered together with other companies in order to create BIONIC Hill Innovation Park - a Ukrainian innovation park constructed similarly to the Silicon Valley.
In September 2012, Ciklum co-launched BIONIC University, the first Ukrainian intercorporate IT university working on the premises of National University of Kyiv-Mohyla Academy. The University prepares IT specialists of a new formation, who were globally competitive yet aiming at professional fulfillment in Ukraine.
In April 2014, Ciklum, together with other IT companies operating in Ukraine, initiated the launch of Brain Basket Foundation to fund free trainings for those who wish to study programming. This initiative is aimed at developing Ukraine's $2 billion IT Industry towards a goal of generating $10 billion in annual revenue and creating 100,000 jobs by 2020. Ciklum has pledged $100,000 to the program.
In January 2018, Ciklum supported the first-ever Ukraine House in Davos during the 2018 World Economic Forum.
Clients and services
Ciklum provides services including custom development, quality engineering, data & analytics, Robotic Process Automation, Product development and Consulting.
Ciklum provides teams, project-based services, and peak resources on a short-term basis. Ciklum key clients are eToro, Just Eat, Betsson, and TUI.
History
Ciklum was founded in 2002 by Danish native Torben Majgaard who chaired the Board by 2019, in Kyiv, Ukraine. Since then, the company has grown to over 3,500 employees.
In 2009, Ciklum buys main business activities from Mondo's bankruptcy.
In 2011, Ciklum ac |
https://en.wikipedia.org/wiki/Pappus%27s%20area%20theorem | Pappus's area theorem describes the relationship between the areas of three parallelograms attached to three sides of an arbitrary triangle. The theorem, which can also be thought of as a generalization of the Pythagorean theorem, is named after the Greek mathematician Pappus of Alexandria (4th century AD), who discovered it.
Theorem
Given an arbitrary triangle with two arbitrary parallelograms attached to two of its sides the theorem tells how to construct a parallelogram over the third side, such that the area of the third parallelogram equals the sum of the areas of the other two parallelograms.
Let ABC be the arbitrary triangle and ABDE and ACFG the two arbitrary parallelograms attached to the triangle sides AB and AC. The extended parallelogram sides DE and FG intersect at H. The line segment AH now "becomes" the side of the third parallelogram BCML attached to the triangle side BC, i.e., one constructs line segments BL and CM over BC, such that BL and CM are a parallel and equal in length to AH. The following identity then holds for the areas (denoted by A) of the parallelograms:
The theorem generalizes the Pythagorean theorem twofold. Firstly it works for arbitrary triangles rather than only for right angled ones and secondly it uses parallelograms rather than squares. For squares on two sides of an arbitrary triangle it yields a parallelogram of equal area over the third side and if the two sides are the legs of a right angle the parallelogram over the third side will be square as well. For a right-angled triangle, two parallelograms attached to the legs of the right angle yield a rectangle of equal area on the third side and again if the two parallelograms are squares then the rectangle on the third side will be a square as well.
Proof
Due to having the same base length and height the parallelograms ABDE and ABUH have the same area, the same argument applying to the parallelograms ACFG and ACVH, ABUH and BLQR, ACVH and RCMQ. This already yields the de |
https://en.wikipedia.org/wiki/Human%20Resource%20Machine | Human Resource Machine is a visual programming-based puzzle video game developed by Tomorrow Corporation. The game was released for Microsoft Windows, OS X and Wii U in 2015, being additionally released for Linux in March 2016, for iOS in June 2016, for Android in December 2016 and for the Nintendo Switch in March 2017. Human Resource Machine uses the concept of a corporate office worker assigned to perform tasks that involve moving objects between an inbox, an outbox, and to and from storage areas as a metaphor for assembly language concepts. The player works through some forty puzzles in constructing a program to complete a specific task.
A sequel, 7 Billion Humans, was released on August 23, 2018.
Gameplay
The game includes approximately 40 programming puzzles, each considered one "year" of the player's avatar tenure in a corporate structure. In each puzzle, the player creates a list of instructions from rudimentary commands to control the movements of their avatar on an overhead view of an office; the office includes two conveyor belts, one an inbox that sends in either an integer or a single alphabetic character represented as a small box, the other an outbox to receive these. The office floor typically also includes a number of marked number spaces that can hold one box each. For each puzzle, the player is told of a specific task, such as adding two numbers as they come in on the inbox, or sorting a zero-terminated string of characters, delivering these results in the proper order to the outbox.
The player uses simple commands to create a list of instructions to perform the given task. Such commands include picking up the first item at the inbox, placing the item the avatar is currently carrying at the outbox, copying the carried item to a marked square, performing addition or subtraction of the carried item with the item at the marked square, and making decisions based on the value of the carried item such as if it is zero or negative. As such, these mimi |
https://en.wikipedia.org/wiki/Inserter%20category | In category theory, a branch of mathematics, the inserter category is a variation of the comma category where the two functors are required to have the same domain category.
Definition
If C and D are two categories and F and G are two functors from C to D, the inserter category Ins(F, G) is the category whose objects are pairs (X, f) where X is an object of C and f is a morphism in D from F(X) to G(X) and whose morphisms from (X, f) to (Y, g) are morphisms h in C from X to Y such that .
Properties
If C and D are locally presentable, F and G are functors from C to D, and either F is cocontinuous or G is continuous; then the inserter category Ins(F, G) is also locally presentable.
References
Category theory |
https://en.wikipedia.org/wiki/U.2 | U.2 (pronounced 'u-dot-2'), formerly known as SFF-8639, is a computer interface standard for connecting solid-state drives (SSDs) to a computer. It covers the physical connector, electrical characteristics, and communication protocols.
It was developed for the enterprise market and designed to be used with new PCI Express drives along with SAS and SATA drives. It uses up to four PCI Express lanes and two SATA lanes.
History
The Enterprise SSD form factor was developed by the SSD Form Factor Working Group (SFFWG). The specification was released on December 20, 2011, as a mechanism for providing PCI Express connections to SSDs for the enterprise market. Goals included being usable in existing 2.5" and 3.5" mechanical enclosures, to be hot swappable and to allow legacy SAS and SATA drives to be mixed using the same connector family.
In June 2015, the SFFWG announced that the connector was being renamed to U.2.
Connector
The U.2 connector is mechanically identical to the SATA Express device plug, but provides four PCI Express lanes through a different usage of available pins.
U.2 devices may be connected to an M.2 port using an adapter.
Availability
In November 2015, Intel introduced the 750 series SSD which is available in both PCI Express and U.2 variants.
Since then, U.2 has achieved a high level of support from the major storage vendors and storage appliance suppliers.
U.2 compared with M.2
U.2 allows hot-swap, whereas M.2 does not.
U.2 can use 3.3V or 12V for power, while M.2 only supports 3.3V.
As implemented
While the U.2 standard does not imply a form factor of the device that uses it, in practice U.2 is used only on 2.5" SSDs. 2.5" drives are physically larger than M.2 drives and thus typically have larger capacities.
See also
EDSFF – U.2 successor
M.2
U.3 (SFF-TA-1001)
References
Computer buses
Computer connectors
Serial ATA
Peripheral Component Interconnect
SCSI
Computer storage buses
SATA Express |
https://en.wikipedia.org/wiki/Vine%20copula | A vine is a graphical tool for labeling constraints in high-dimensional probability distributions. A regular vine is a special case for which all constraints are two-dimensional or conditional two-dimensional. Regular vines generalize trees, and are themselves specializations of Cantor tree.
Combined with bivariate copulas, regular vines have proven to be a flexible tool in high-dimensional dependence modeling. Copulas
are multivariate distributions with uniform univariate margins. Representing a joint distribution as univariate margins plus copulas allows the separation of the problems of estimating univariate distributions from the problems of estimating dependence. This is handy in as much as univariate distributions in many cases can be adequately estimated from data, whereas dependence information is roughly unknown, involving summary indicators and judgment.
Although the number of parametric multivariate copula families with flexible dependence is limited, there are many parametric families of bivariate copulas. Regular vines owe their increasing popularity to the fact that they leverage from bivariate copulas and enable extensions to arbitrary dimensions. Sampling theory and estimation theory for regular vines are well developed
and model inference has left the post
. Regular vines have proven useful in other problems such as (constrained) sampling of correlation matrices, building non-parametric continuous Bayesian networks.
For example, in finance, vine copulas have been shown to effectively model tail risk in portfolio optimization applications.
Historical origins
The first regular vine, avant la lettre, was introduced by Harry Joe.
The motive was to extend parametric bivariate extreme value copula families to higher dimensions. To this end he introduced what would later be called the D-vine. Joe
was interested in a class of n-variate distributions with given one dimensional margins, and n(n − 1) dependence parameters, whereby n − 1 parameters cor |
https://en.wikipedia.org/wiki/Friedman%27s%20SSCG%20function | In mathematics, a simple subcubic graph (SSCG) is a finite simple graph in which each vertex has a degree of at most three. Suppose we have a sequence of simple subcubic graphs G1, G2, ... such that each graph Gi has at most i + k vertices (for some integer k) and for no i < j is Gi homeomorphically embeddable into (i.e. is a graph minor of) Gj.
The Robertson–Seymour theorem proves that subcubic graphs (simple or not) are well-founded by homeomorphic embeddability, implying such a sequence cannot be infinite. So, for each value of k, there is a sequence with maximal length. The function SSCG(k) denotes that length for simple subcubic graphs. The function SCG(k) denotes that length for (general) subcubic graphs.
The SCG sequence begins SCG(0) = 6, but then explodes to a value equivalent to fε2*2 in the fast-growing hierarchy.
The SSCG sequence begins slower than SCG, SSCG(0) = 2, SSCG(1) = 5, but then grows rapidly. SSCG(2) = 3 × 2(3 × 295) − 8 ≈ 3.241704 × 1035775080127201286522908640065. Its first and last 20 digits are 32417042291246009846...34057047399148290040. SSCG(3) is much larger than both TREE(3) and TREETREE(3)(3), that is, the TREE function nested TREE(3) times with 3 at the bottom.
Adam P. Goucher claims there is no qualitative difference between the asymptotic growth rates of SSCG and SCG. He writes "It's clear that SCG(n) ≥ SSCG(n), but I can also prove SSCG(4n + 3) ≥ SCG(n)."
See also
Goodstein's theorem
Paris–Harrington theorem
Kanamori–McAloon theorem
Notes
References
Mathematical logic
Theorems in discrete mathematics
Order theory
Wellfoundedness
Graph theory |
https://en.wikipedia.org/wiki/CG%20artist | CG artists (also known as computer graphics artists) create 2D and 3D art, usually for cinema, advertising or animation movies. A CG artist's work usually revolves around finding balance between artistic sensibilities and technical limitations while working within a development team.
In a game development context, CG artists work closely with game directors, art directors, animators, game designers and level designers. CG artists (typically, technical artists) will also work with game programmers to ensure that the 3D models and assets created by the art team function as desired inside a game engine.
CG artists are typically skilled at creating both 2D and 3D digital art, and often specialize in one or more subsets of content creation such as: hard surface modeling, organic modelling, concept art painting, architectural rendering, animation, and/or visual effects. If the CG artist is a technical artist, they will usually also have programming skills such as shader and script writing, character rigging, and/or skill in languages such as Python, MEL, C++, or C#.
CG artists often begin their career with a degree from an animation school, an arts discipline, or in computer science.
References
Computer occupations
Product development
Video game design
Video game development |
https://en.wikipedia.org/wiki/QA%20%26%20UX%20Manager | A QA & UX Manager work with both Quality Assurance (QA) and User Experience (UX) in relation to video game and software development. QA & UX Manager can work independently or in co-operation with other QA & UX Managers, like in larger QA & UX teams with other QA & UX Managers and game testers. In the larger QA & UX teams, there is usually a lead QA & UX Group Manager that works as the daily leader of this team of QA & UX Managers and game testers. QA & UX Manager also usually work very close with the project managers and the QA Programmer as part of video game development.
QA & UX Managers work and tasks
In terms of work assignments that QA & UX Managers do, this can include planning and management, technical testing, User Experience, metrics and communication. In terms of planning and management done by the QA & UX Manager, this may include making test plans, test cycles and test cases for a video game as well as being responsible for the overall testing and recruiting of game testers in a video game development. In terms of technical testing that the QA & UX Managers do, this can be very alternating and can be everything from testing correctness and regression to check an optimization in a video game. In terms of User Experience that the QA & UX Manager work with, this is particularly centered around making interviews and doing monitoring in relation to User Experience of a video game by the player. In terms of Metrics that the QA & UX Manager work with, this task mainly is about collecting and analyze data an about game and gamer activity in relation to a particular game. In terms of the communication characterized parts of the work the QA & UX Manager do, this is often done in relation with meetings with the development team and where the QA & UX Manager pass on his or her knowledge and data to the development team.
References
Computer occupations
Development
Product development
Video game design
Video game development |
https://en.wikipedia.org/wiki/SQLf | SQLf is a SQL extended with fuzzy set theory application for expressing flexible (fuzzy) queries to traditional (or ″Regular″) Relational Databases. Among the known extensions proposed to SQL, at the present time, this is the most complete, because it allows the use of diverse fuzzy elements in all the constructions of the language SQL.
SQLf is the only known proposal of flexible query system allowing linguistic quantification over set of rows in queries, achieved through the extension of SQL nesting and partitioning structures with fuzzy quantifiers. It also allows the use of quantifiers to qualify the quantity of search criteria satisfied by single rows. Several mechanisms are proposed for query evaluation, the most important being the one based on the derivation principle. This consists in deriving classic queries that produce, given a threshold t, a t-cut of the result of the fuzzy query, so that the additional processing cost of using a fuzzy language is diminished.
Basic block
The fundamental querying structure of SQLf is the multi-relational block. The conception of this structure is based on the three basic operations of the relational algebra: projection, cartesian product and selection, and the application of fuzzy sets’ concepts. The result of a SQLf query is a fuzzy set of rows that is a fuzzy relation instead of a regular relation.
A basic block in SQLf consists of a SELECT clause, a FROM clause and an optional WHERE clause. The semantic of this query structure is:
The SELECT clause corresponds to the projection. It specifies the relations’ attributes (or attribute expressions) that will be selected. The resulting table is a fuzzy set and it is given in decreasing ordered of satisfaction degree.
The SELECT clause specifies also a calibration that is intended to restrict the set of rows retrieved. There are two kinds of calibrations: quantitative and qualitative. In quantitative calibration the user specifies the number of results to be retrieved, |
https://en.wikipedia.org/wiki/Ky%20Fan%20lemma | In mathematics, Ky Fan's lemma (KFL) is a combinatorial lemma about labellings of triangulations. It is a generalization of Tucker's lemma. It was proved by Ky Fan in 1952.
Definitions
KFL uses the following concepts.
: the closed n-dimensional ball.
: its boundary sphere.
T: a triangulation of .
T is called boundary antipodally symmetric if the subset of simplices of T which are in provides a triangulation of where if σ is a simplex then so is −σ.
L: a labeling of the vertices of T, which assigns to each vertex a non-zero integer: .
L is called boundary odd if for every vertex , .
An edge of T is called a complementary edge of L if the labels of its two endpoints have the same size and opposite signs, e.g. {−2, +2}.
An n-dimensional simplex of T is called an alternating simplex of T if its labels have different sizes with alternating signs, e.g.{−1, +2, −3} or {+3, −5, +7}.
Statement
Let T be a boundary-antipodally-symmetric triangulation of and L a boundary-odd labeling of T.
If L has no complementary edge, then L has an odd number of n-dimensional alternating simplices.
Corollary: Tucker's lemma
By definition, an n-dimensional alternating simplex must have labels with n + 1 different sizes.
This means that, if the labeling L uses only n different sizes (i.e. ), it cannot have an n-dimensional alternating simplex.
Hence, by KFL, L must have a complementary edge.
Proof
KFL can be proved constructively based on a path-based algorithm. The algorithm it starts at a certain point or edge of the triangulation, then goes from simplex to simplex according to prescribed rules, until it is not possible to proceed any more. It can be proved that the path must end in an alternating simplex.
The proof is by induction on n.
The basis is . In this case, is the interval and its boundary is the set . The labeling L is boundary-odd, so . Without loss of generality, assume that and . Start at −1 and go right. At some edge e, the labeling must change from |
https://en.wikipedia.org/wiki/Zassenhaus%20algorithm | In mathematics, the Zassenhaus algorithm
is a method to calculate a basis for the intersection and sum of two subspaces of a vector space.
It is named after Hans Zassenhaus, but no publication of this algorithm by him is known. It is used in computer algebra systems.
Algorithm
Input
Let be a vector space and , two finite-dimensional subspaces of with the following spanning sets:
and
Finally, let be linearly independent vectors so that and can be written as
and
Output
The algorithm computes the base of the sum and a base of the intersection .
Algorithm
The algorithm creates the following block matrix of size :
Using elementary row operations, this matrix is transformed to the row echelon form. Then, it has the following shape:
Here, stands for arbitrary numbers, and the vectors
for every and for every are nonzero.
Then with
is a basis of
and with
is a basis of .
Proof of correctness
First, we define to be the projection to the first component.
Let
Then and
.
Also, is the kernel of , the projection restricted to .
Therefore, .
The Zassenhaus algorithm calculates a basis of . In the first columns of this matrix, there is a basis of .
The rows of the form (with ) are obviously in . Because the matrix is in row echelon form, they are also linearly independent.
All rows which are different from zero ( and ) are a basis of , so there are such s. Therefore, the s form a basis of .
Example
Consider the two subspaces and of the vector space .
Using the standard basis, we create the following matrix of dimension :
Using elementary row operations, we transform this matrix into the following matrix:
(Some entries have been replaced by "" because they are irrelevant to the result.)
Therefore
is a basis of , and
is a basis of .
See also
Gröbner basis
References
External links
Algorithms
Linear algebra |
https://en.wikipedia.org/wiki/Fiksu | Fiksu is a provider of mobile marketing technology that helps app and brand marketers reach their target audiences on mobile and CTV. The company's mobile-first platform targets users through social and video networks, real-time bidding (RTB) exchanges, traditional mobile ad networks, and mobile web. Device-level data collections are from the actions mobile app users take, including launches, registrations and purchases.
History
Fiksu, which means "smart" in Finnish, was founded in 2008 by Micah Adler as 'Fluent Mobile', a news-aggregating mobile app. In early 2011, faced with mounting marketing costs, Fluent developed a set of algorithmic tools for lowering the cost of mobile app user acquisition. The company pivoted its focus to become a mobile marketing technology provider, using that technology to help others market their apps and acquire loyal app users.
Fiksu reached annual revenues of more than $100 million in 2014.
Fiksu is headquartered in Boston, Massachusetts. The company also has key offices in San Francisco, California; Northampton, Massachusetts; and London.
Indexes
The Fiksu Indexes were introduced in July 2011 to provide insight into industry trends related to app downloads and the costs associated with acquiring new users. They include the App Store Competitive Index, which shows data about the top 200 free iPhone apps downloaded, and the Cost Per Loyal User Index, which shows how much marketers are spending to generate each loyal app customer, as defined by the company as someone who opens the app three times. In March 2014, Fiksu introduced two new indexes that measure costs on both iOS and Android – the Cost per Install Index and the Cost per App Launch Index.
FreeMyApps
Fiksu launched FreeMyApps in December 2011. The solution was originally aimed at helping developers, and marketers of paid iOS apps drive mobile app downloads. The platform, which launched an Android version in December 2012, later shifted to a model that rewarded i |
https://en.wikipedia.org/wiki/Angles%20between%20flats | The concept of angles between lines (in the plane or in space), between two planes (dihedral angle) or between a line and a plane can be generalized to arbitrary dimensions. This generalization was first discussed by Camille Jordan. For any pair of flats in a Euclidean space of arbitrary dimension one can define a set of mutual angles which are invariant under isometric transformation of the Euclidean space. If the flats do not intersect, their shortest distance is one more invariant. These angles are called canonical or principal. The concept of angles can be generalized to pairs of flats in a finite-dimensional inner product space over the complex numbers.
Jordan's definition
Let and be flats of dimensions and in the -dimensional Euclidean space . By definition, a translation of or does not alter their mutual angles. If and do not intersect, they will do so upon any translation of which maps some point in to some point in . It can therefore be assumed without loss of generality that and intersect.
Jordan shows that Cartesian coordinates in can then be defined such that and are described, respectively, by the sets of equations
and
with . Jordan calls these coordinates canonical. By definition, the angles are the angles between and .
The non-negative integers are constrained by
For these equations to determine the five non-negative integers completely, besides the dimensions and and the number of angles , the non-negative integer must be given. This is the number of coordinates , whose corresponding axes are those lying entirely within both and . The integer is thus the dimension of . The set of angles may be supplemented with angles to indicate that has that dimension.
Jordan's proof applies essentially unaltered when is replaced with the -dimensional inner product space over the complex numbers. (For angles between subspaces, the generalization to is discussed by Galántai and Hegedũs in term |
https://en.wikipedia.org/wiki/EN%2012566 | EN 12566 - Small wastewater treatment systems for up to 50 PT refers to a set of European standards which specify the general requirements for packaged and/or site assembled wastewater treatment plants used for domestic wastewater treatment for up to 50 PT (population total). The standards consist of the following parts:
EN 12566-1: "Part 1: Prefabricated septic tanks" specifies the requirements and test methods for prefabricated septic tank units;
EN 12566-2: "Part 2: Soil infiltration systems" is a code of practice defining design parameters, construction details, installation, and component requirements for in-situ constructed soil infiltration systems and does not specify any treatment requirements;
EN 12566-3: "Part 3: Packaged and/or site assembled domestic wastewater treatment plants" specifies the requirements and test methods used to evaluate packaged wastewater treatment plants which are required to treat sewage to a predetermined standard;
EN 12566-4: "Part 4: Septic tanks assembled in situ from prefabricated kits" is an execution standard specifying pipe sizes, loads, watertightness, marking, and evaluation of conformity for septic tanks assembled in situ from prefabricated kits and ancillary equipment;
EN 12566-5: "Part 5: Pretreated Effluent Filtration systems" is a code of practise giving design parameters, construction details, installation, and component requirements for filtration systems receiving domestic wastewater from septic tanks;
EN 12566-6: "Part 6: Prefabricated treatment units for septic tank effluent" specifies requirements, test methods, and evaluation of conformity for prefabricated secondary treatment units used for the treatment of effluent from septic tanks;
EN 12566-7: "Part 7: Prefabricated tertiary treatment units" specifies requirements, test methods, and evaluation of conformity for a packaged and/or site assembled tertiary treatment unit.
See also
List of EN standards
European Committee for Standardization
External links |
https://en.wikipedia.org/wiki/Local%20case-control%20sampling | In machine learning, local case-control sampling is an algorithm used to reduce the complexity of training a logistic regression classifier. The algorithm reduces the training complexity by selecting a small subsample of the original dataset for training. It assumes the availability of a (unreliable) pilot estimation of the parameters. It then performs a single pass over the entire dataset using the pilot estimation to identify the most "surprising" samples. In practice, the pilot may come from prior knowledge or training using a subsample of the dataset. The algorithm is most effective when the underlying dataset is imbalanced. It exploits the structures of conditional imbalanced datasets more efficiently than alternative methods, such as case control sampling and weighted case control sampling.
Imbalanced datasets
In classification, a dataset is a set of N data points , where is a feature vector, is a label. Intuitively, a dataset is imbalanced when certain important statistical patterns are rare. The lack of observations of certain patterns does not always imply their irrelevance. For example, in medical studies of rare diseases, the small number of infected patients (cases) conveys the most valuable information for diagnosis and treatments.
Formally, an imbalanced dataset exhibits one or more of the following properties:
Marginal Imbalance. A dataset is marginally imbalanced if one class is rare compared to the other class. In other words, .
Conditional Imbalance. A dataset is conditionally imbalanced when it is easy to predict the correct labels in most cases. For example, if , the dataset is conditionally imbalanced if and .
Algorithm outline
In logistic regression, given the model , the prediction is made according to . The local-case control sampling algorithm assumes the availability of a pilot model . Given the pilot model, the algorithm performs a single pass over the entire dataset to select the subset of samples to include in training the l |
https://en.wikipedia.org/wiki/Inferring%20horizontal%20gene%20transfer | Horizontal or lateral gene transfer (HGT or LGT) is the transmission of portions of genomic DNA between organisms through a process decoupled from vertical inheritance. In the presence of HGT events, different fragments of the genome are the result of different evolutionary histories. This can therefore complicate investigations of the evolutionary relatedness of lineages and species. Also, as HGT can bring into genomes radically different genotypes from distant lineages, or even new genes bearing new functions, it is a major source of phenotypic innovation and a mechanism of niche adaptation. For example, of particular relevance to human health is the lateral transfer of antibiotic resistance and pathogenicity determinants, leading to the emergence of pathogenic lineages.
Inferring horizontal gene transfer through computational identification of HGT events relies upon the investigation of sequence composition or evolutionary history of genes. Sequence composition-based ("parametric") methods search for deviations from the genomic average whereas evolutionary history-based ("phylogenetic") approaches identify genes whose evolutionary history significantly differs from that of the host species. The evaluation and benchmarking of HGT inference methods typically rely upon simulated genomes, for which the true history is known. On real data, different methods tend to infer different HGT events, and as a result it can be difficult to ascertain all but simple and clear-cut HGT events.
Overview
Horizontal gene transfer was first observed in 1928, in Frederick Griffith's experiment: showing that virulence was able to pass from virulent to non-virulent strains of Streptococcus pneumoniae, Griffith demonstrated that genetic information can be horizontally transferred between bacteria via a mechanism known as transformation. Similar observations in the 1940s and 1950s showed evidence that conjugation and transduction are additional mechanisms of horizontal gene transfer.
To |
https://en.wikipedia.org/wiki/Device-to-device | Device-to-Device (D2D) communication in cellular networks is defined as direct communication between two mobile users without traversing the Base Station (BS) or core network. D2D communication is generally non-transparent to the cellular network and it can occur on the cellular frequencies (i.e., inband) or unlicensed spectrum (i.e., outband).
In a traditional cellular network, all communications must go through the BS even if communicating parties are in range for proximity-based D2D communication. Communication through BS suits conventional low data rate mobile services such as voice call and text messaging in which users are seldom close enough for direct communication. However, mobile users in today's cellular networks use high data rate services (e.g., video sharing, gaming, proximity-aware social networking) in which they could potentially be in range for direct communications (i.e., D2D). Hence, D2D communications in such scenarios can greatly increase the spectral efficiency of the network. The advantages of D2D communications go beyond spectral efficiency; they can potentially improve throughput, energy efficiency, delay, and fairness.
Data delivery in non-cooperative D2D communication
Existing data delivery protocols in D2D communications mainly assume that mobile nodes willingly participate in data delivery, share their resources with each other, and follow the rules of underlying networking protocols. Nevertheless, rational nodes in real-world scenarios have strategic interactions and may act selfishly for various reasons (such as resource limitations, the lack of interest in data, or social preferences).
For example, if a node has limited battery resources or the cost of the network bandwidth delivered by mobile network operators is high, it would not willingly relay data for others until appropriate incentives are provided. Meanwhile, malicious nodes may attack the network in different ways to disturb the normal operation of the data transmissio |
https://en.wikipedia.org/wiki/How%20to%20Bake%20Pi | How to Bake Pi is a popular mathematics book by Eugenia Cheng published in 2015. Each chapter of the book begins with a recipe for a dessert, to illustrate the methods and principles of mathematics and how they relate to one another. The book is an explanation of the foundations and architecture of category theory, a branch of mathematics that formalizes mathematical structure and its concepts.
References
2015 non-fiction books
Popular mathematics books
Basic Books books |
https://en.wikipedia.org/wiki/Online%20shaming | Online shaming is a form of public shaming in which targets are publicly humiliated on the internet, via social media platforms (e.g. Twitter or Facebook), or more localized media (e.g. email groups). As online shaming frequently involves exposing private information on the Internet, the ethics of public humiliation has been a source of debate over internet privacy and media ethics. Online shaming takes many forms, including call-outs, cancellation (cancel culture), doxing, negative reviews, and revenge porn.
Description
Online shaming is a form of public shaming in which internet users are harassed, mocked, or bullied by other internet users online. This shaming may involve commenting directly to or about the shamed; the sharing of private messages; or the posting of private photos. Those being shamed are perceived to have committed a social transgression, and other internet users then use public exposure to shame the offender.
People have been shamed online for a variety of reasons, usually consisting of some form of social transgression such as posting offensive comments, posting offensive images or memes, online gossip, or lying. Those who are shamed online have not necessarily committed any social transgression, however. Online shaming may be used to get revenge (for example, in the form of revenge pornography), stalk, blackmail, or to threaten other internet users.
Privacy violation is a major issue in online shaming. Those being shamed may be denied the right to privacy and be subject to defamation. David Furlow, chairman of the Media, Privacy and Defamation Committee of the American Bar Association, has identified the potential privacy concerns raised by websites facilitating the distribution of information that is not part of the public record (documents filed with a government agency) and has said that such websites "just [give] a forum to people whose statements may not reflect truth."
Types
Call-outs and cancellation
Cancel culture or call-out cu |
https://en.wikipedia.org/wiki/World%20Solar%20Challenge%202013 | The 2013 World Solar Challenge was one of a biennial series of solar-powered car races, covering through the Australian Outback, from Darwin, Northern Territory to Adelaide, South Australia.
In all, 37 teams competed of which 16 completed the course. There were three classes: Cruiser, Challenge and Adventure. The Cruiser class was won by Eindhoven University of Technology of the Netherlands; the Challenge class by Nuon Solar Team of the Netherlands; and the Adventure class by the Australian Aurora team.
Results tables
Cruiser class
Challenger class
Adventure class
References
WSC 2013 Cruiser class results
WSC 2013 Challenger class results
WSC 2013 Adventure class results
Solar car races
Scientific organisations based in Australia
Science competitions
Photovoltaics
Recurring sporting events established in 1987 |
https://en.wikipedia.org/wiki/Energy%20Policy%20Institute%20of%20Australia | The Energy Policy Institute of Australia is an apolitical, not-for-profit energy policy body. It was created as the Energy Alliance of Australia in 1999 to collaborate with the Australian Government on the development of energy export markets. The Institute advocates technology neutrality as a core principle of energy policy. The Institute adopted the name Energy Policy Institute of Australia in 2011.
For ten years from 2008, the Institute convened an annual forum called the Energy State of the Nation but this has been superseded by more frequent events as policy issues have arisen. The Institute is governed by a board of directors who represent a diverse mix of corporate entities with interests in Australia's energy sector.
History
The Institute was established in 1999 as the Energy Alliance of Australia, in consultation with the Australian Government's Department of Resources, Energy and Tourism. It was designed as a vehicle for Australia's energy sector to liaise with the Asia Pacific Energy Cooperation (APEC) organisation. The Energy Alliance of Australia initiated the establishment of APGAS in 2005 as a forum for APEC Member States' energy policymakers, industry regulators, oil and gas suppliers and consumers, traders and pipeline and ship owners and operators. After three years APGAS closed, having fulfilled its purpose of accelerating cross-border gas trade.
Philosophy
The Institute aims to foster an attractive and secure energy investment climate in Australia, and promote an industry which is internationally competitive. It supports free markets and a "resilient" energy supply system, supported by integrated government policy. The Institute accepts "that the world must transition to a low-carbon society as quickly as it can afford to do so."
Activity
The Institute conducts research into policy, technology, economics, trade and investment relevant to the energy sector. The research is disseminated through the publication of policy papers, presentatio |
https://en.wikipedia.org/wiki/Nucleosome%20repeat%20length | The nucleosome repeat length, (NRL) is the average distance between the centers of neighboring nucleosomes. NRL is an important physical chromatin property that determines its biological function. NRL can be determined genome-wide for the chromatin in a given cell type and state, or locally for a large enough genomic region containing several nucleosomes.
In chromatin, neighbouring nucleosomes are separated by the linker DNA and in many cases also by the linker histone H1 as well as non-histone proteins. Since the size of the nucleosome is typically fixed (146-147 base pairs), NRL is mostly determined by the size of the linker region between nucleosomes. Alternatively, partial DNA unwrapping from the histone octamer or partial disassembly of the histone octamer can decrease the effective nucleosome size and thus affect NRL.
Past studies going back to 1970s showed that, in general, NRL is different for different species and even for different cell types of the same organism. In addition, recent publications reported NRL variations for different genomic regions of the same cell type.
Recent works have compared the NRL around yeast transcription start sites (TSSs) in vivo and that for the reconstituted chromatin on the same DNA sequences in vitro. It was shown that ordered nucleosome positioning arises only in the presence of ATP-dependent chromatin remodeling. Furthermore, it was reported that the NRL determined around yeast TSSs is an invariant value universal for a given wild type yeast strain, although it can change when one of chromatin remodelers is missing. In general, NRL depends on the DNA sequence, concentrations of histones and non-histone proteins, as well as long-range interactions between nucleosomes. NRL determines geometric properties of the nucleosome array, and therefore the higher-order packing of the DNA into the chromatin fiber, which might affect gene expression.
References
Molecular biology
Molecular genetics
DNA
Epigenetics
Nuclear substruc |
https://en.wikipedia.org/wiki/Myogenic%20tone | Myogenic tone is a state of muscle tone in living creatures that originates from the muscle itself rather than from the autonomic nervous system or from hormone processes. It may be contrasted with neurogenic tone, which is created by actions of the autonomic nervous system.
References
Physiology
Musculoskeletal system |
https://en.wikipedia.org/wiki/World%20Solar%20Challenge%202011 | The 2011 World Solar Challenge was a race from Darwin, Northern Territory to Adelaide, South Australia in Australia. 37 vehicles were entered in the race, and the event was won by a car from Tokai University, Tokyo, Japan.
Results:
References
Solar car races
Scientific organisations based in Australia
Science competitions
Photovoltaics
Recurring sporting events established in 1987 |
https://en.wikipedia.org/wiki/World%20Solar%20Challenge%202009 | The 2009 World Solar Challenge was one of a biennial series of solar-powered car races, covering through the Australian Outback, from Darwin, Northern Territory to Adelaide, South Australia.
In the Challenge class 24 teams started, of which eight completed the course, and the winner was Tokai University of Japan. In the Adventure class seven teams started and two completed the course, the winner being Osaka Sangyo University also of Japan.
Challenge class
Adventure class
Note
References
WSC 2009 results
External links
WSC website
Solar car races
Scientific organisations based in Australia
Science competitions
Photovoltaics
Recurring sporting events established in 1987 |
https://en.wikipedia.org/wiki/World%20Solar%20Challenge%202007 | The 2007 World Solar Challenge was one of a biennial series of solar-powered car races, covering through the Australian Outback, from Darwin, Northern Territory to Adelaide, South Australia.
In the Challenge class 19 teams started, of which 10 completed the course, and the winner was a Nuna car built by Nuon of the Netherlands. In the Adventure class 18 teams started and eight completed the course, the winner being Ashiya University of Japan.
Challenge class
Adventure class
References
WSC 2007 results
Solar car races
Scientific organisations based in Australia
Science competitions
Photovoltaics
Recurring sporting events established in 1987 |
https://en.wikipedia.org/wiki/World%20Solar%20Challenge%202005 | The 2005 World Solar Challenge was one of a biennial series of solar-powered car races, covering about through the Australian Outback, from Darwin, Northern Territory to Adelaide, South Australia.
Three teams completed the course out of 12 that started. The winner was a Nuna car built by Nuon of the Netherlands.
Results
References
WSC history page
Solar car races
Scientific organisations based in Australia
Science competitions
Photovoltaics
Recurring sporting events established in 1987 |
https://en.wikipedia.org/wiki/World%20Solar%20Challenge%202003 | The 2003 World Solar Challenge was one of a biennial series of solar-powered car races, covering about through the Australian Outback, from Darwin, Northern Territory to Adelaide, South Australia.
Ten teams completed the course. The winner was a Nuna car built by Nuon of the Netherlands.
Results
References
Bridgestone World Solar Challenge: Honour Roll
ZDP Site
Solar car races
Scientific organisations based in Australia
Science competitions
Photovoltaics
Recurring sporting events established in 1987 |
https://en.wikipedia.org/wiki/World%20Solar%20Challenge%202001 | The 2001 World Solar Challenge was one of a biennial series of solar-powered car races, covering about through the Australian Outback, from Darwin, Northern Territory to Adelaide, South Australia. The winner was a Nuna "Alpha Centauri" car built by Nuon of the Netherlands.
Results
References
Solar car races
Scientific organisations based in Australia
Science competitions
Photovoltaics
Recurring sporting events established in 1987 |
https://en.wikipedia.org/wiki/Deployment%20environment | In software deployment, an environment or tier is a computer system or set of systems in which a computer program or software component is deployed and executed. In simple cases, such as developing and immediately executing a program on the same machine, there may be a single environment, but in industrial use, the development environment (where changes are originally made) and production environment (what end users use) are separated, often with several stages in between. This structured release management process allows phased deployment (rollout), testing, and rollback in case of problems.
Environments may vary significantly in size: the development environment is typically an individual developer's workstation, while the production environment may be a network of many geographically distributed machines in data centers, or virtual machines in cloud computing. Code, data, and configuration may be deployed in parallel, and need not connect to the corresponding tier—for example, pre-production code might connect to a production database.
Architectures
Deployment architectures vary significantly, but, broadly, the tiers are bookended by starting at development (DEV) and ending at production (PROD). A common 4-tier architecture is development, testing, model, production (DEV, TEST, MODL, PROD), with software being deployed to each in order. Other common environments include Quality Control (QC), for acceptance testing; sandbox or experimental (EXP), for experiments that are not intended to proceed to production; and Disaster Recovery, to provide an immediate fallback in case of problems with production. Another common architecture is development, testing, acceptance and production (DTAP).
This language is particularly suited for server programs, where servers run in a remote data center; for code that runs on an end user's device, such as applications (apps) or clients, one can refer to the user environment (USER) or local environment (LOCAL) instead.
Exact de |
https://en.wikipedia.org/wiki/Canal%20lining | Canal lining is the process of reducing seepage loss of irrigation water by adding an impermeable layer to the edges of the trench. Seepage can result in losses of 30 to 50 percent of irrigation water from canals, so adding lining can make irrigation systems more efficient. Canal linings are also used to prevent weed growth, which can spread throughout an irrigation system and reduce water flow. Lining a canal can also prevent waterlogging around low-lying areas of the canal.
By making a canal less permeable, the water velocity increases resulting in a greater overall discharge. Increased velocity also reduces the amount of evaporation and silting that occurs, making the canal more efficient. The oldest known paved canal was discovered in 1995 near the pyramids of Giza, and is estimated to be around 4,500 years old.
Canal lining types
Concrete
Concrete canal lining is often used due to its high structural strength and longevity. Concrete used for canal lining is typically non-reinforced, as a way to reduce cost. A common method for constructing concrete lining is the use of slip forms, which are drawn down the length of the canal as the concrete is poured. Hand laying of concrete or prefabricated sections are also used when only a short distance needs to be covered. Certain additives, such as kankar lime and surkhi, are sometimes included in the concrete mixture to improve water retention.
Prior to constructing concrete linings, it is common practice to ensure the sub-grade layer of soil is adequately consolidated. If expansive clay is located on the site of a canal, a layer of this clay is removed and replaced with sand or gravel before the concrete lining is constructed. This removal minimizes the risk of ground swelling, which can cause cracking in the concrete. In order to prevent cracking during the curing process, water is sprinkled on the concrete or a damp cover is placed over the lining. Another preventative measure against cracking, includes adding |
https://en.wikipedia.org/wiki/Heteromorphosis | Heteromorphosis (//, //) ( – other; morphe – form) refers to situations where an organ or tissue is different from the expected, either because of (embryonic) development anomalies, or after reparative regeneration following a trauma. The difference include an abnormal location, or an abnormal shape. It should not be confused with homeosis, which means big change in tissue structure of an organ. Heteromorphosis is an example of the imperfection of some manifestations of the regenerative capacity.
Jacques Loeb offered this term in 1892, then he was in experiments of distortion of polarity of hydroids.
Many organisms from protozoans to the chordate may have heteromorphosis examples, but it is easier to find in lower forms of animals:
Earthworm: distortion of polarity: replacement of removed tail with head end
Actinia: development of a cut into a second mouth
Decapods: the replacement of removed eyes with antennae
See also
Epimorphosis
References
Developmental biology |
https://en.wikipedia.org/wiki/Nitroplus%20Blasterz%3A%20Heroines%20Infinite%20Duel | is a fighting game developed by Examu's Team Arcana and published by Nitroplus. The game crosses over heroines from various visual novels and games released by Nitroplus, as well as those from manga and anime series that Nitroplus writers have been involved with. The game was released in arcades on April 30, 2015 and was released on PlayStation 3 and PlayStation 4 in collaboration with Marvelous Entertainment's Marvelous Inc. on December 10, 2015. Marvelous USA published the game in North America on February 2, 2016. It was later released on Windows on December 8, 2016. The game originates from the doujin game Nitro+ Royale: Heroines Duel, which is stated as its predecessor.
Gameplay
The game uses five buttons; light attack, medium attack, heavy attack, escape action, and heavy action. The escape action button can be used to perform evasive maneuvers and guards while heavy actions can be used to push an opponent back. Players can perform Infinite Blasts, which can interrupt an opponent's attack, Variable Rushes, which allows for surprise combos, and Lethal Blazes, which serve as the game's super combo attacks. Players can also choose two support characters which they can summon to assist them.
Characters
There are 32 characters which are split up into playable characters and support characters. Super Sonico was initially a support character, but was later also made playable, as of console release. An original character, who is a dark palette swap and final boss version of Al Azif, Al Azif Ex Mortis is the non-playable final boss of the game, created by Mugen Yoguruma, act as a copy of the Necronomicon, crafted from the fragments of the Al Azifs from the infinite universes in which Demonbane failed. At the end of the story mode, Ex Mortis is defeated and absorbed by Al Azif, who gains all of Ex Mortis' memories, as well as the completion of her soul.
Playable characters
Support characters
Other characters
Saki Tsuzura (Arcana Heart)
Mirai (Senran Kagura)
G |
https://en.wikipedia.org/wiki/Dimensions%20CM | Dimensions CM is a software change and configuration management product developed by Micro Focus. It includes revision control, change, build and release management capabilities.
Since 2014 (v14.1) Dimensions CM includes PulseUno module providing Code review and Continuous integration capabilities. Starting with the version 14.5.2 (2020) it can also serve as a binary repository manager.
History
Previous product names:
PCMS Dimensions (SQL Software)
PVCS Dimensions (Merant, Intersolv)
See also
List of revision control software
Comparison of revision control software
References
Proprietary version control systems
Configuration management
Programming tools
Micro Focus International |
https://en.wikipedia.org/wiki/Cyclic%20cover | In algebraic topology and algebraic geometry, a cyclic cover or cyclic covering is a covering space for which the set of covering transformations forms a cyclic group. As with cyclic groups, there may be both finite and infinite cyclic covers.
Cyclic covers have proven useful in the descriptions of knot topology and the algebraic geometry of Calabi–Yau manifolds.
In classical algebraic geometry, cyclic covers are a tool used to create new objects from existing ones through, for example, a field extension by a root element. The powers of the root element form a cyclic group and provide the basis for a cyclic cover. A line bundle over a complex projective variety with torsion index may induce a cyclic Galois covering with cyclic group of order .
References
Further reading
Algebraic geometry
Algebraic topology |
https://en.wikipedia.org/wiki/Construction%20of%20California%20High-Speed%20Rail | The construction of the California High-Speed Rail system is an undertaking by the California High-Speed Rail Authority. The project is expected to span about and will be completed in two phases:
Phase 1 (totaling about ) runs from the metropolitan area of the San Francisco Bay Area in northern California to the metropolitan area of Greater Los Angeles in southern California. It has been under construction in the San Joaquin Valley since 2015, and in "bookend" investments in the two metropolitan areas, and will take an as-yet unknown number of years to complete.
Phase 2 extends the system north to Sacramento, and south through the Inland Empire to San Diego.
Funding for all of the Phase 1 construction has not been secured yet, and Phase 2 is only in the preliminary planning stage.
Due to financial constraints, the Authority is implementing an Interim Initial Operating Segment (IOS) in the San Joaquin Valley (improving on existing Amtrak service). This will be a financially self-sustaining system. The next goal of the Authority is to extend the system west and north to San Francisco.
Current construction status
In the Central Valley major construction projects are underway. Three separate construction packages total 119 miles of guideway and 93 structures. As of May 2023, 50 miles of guideway are complete, and 40 are underway; 42 structures are complete, and 28 are underway.
Construction Package 1 (CP 1) comprises from Avenue 17 north of Madera to East American Avenue south of Fresno. It includes 12 grade separations, two viaducts, one tunnel, a major river crossing over the San Joaquin River, and the realignment of State Route 99. The contractor is the joint venture of Tutor-Perini/Zachry/Parsons. The design-build contract was signed August 16, 2013. As of July 2023, construction is forecast for completion by the end of 2025.
Construction Package 2-3 (CP 2-3) comprises from East American Avenue south of Fresno to north of the Tulare / Kern County border. |
https://en.wikipedia.org/wiki/Sea%20of%20Thieves | Sea of Thieves is a 2018 action-adventure game developed by Rare and published by Microsoft Studios. The game was released in March 2018 for Windows and Xbox One; it was one of the earliest first-party games released for Xbox Game Pass subscribers. The player assumes the role of a pirate who completes voyages from different trading companies. The multiplayer game sees players explore an open world via a pirate ship from a first-person perspective. Groups of players encounter each other regularly during their adventures, sometimes forming alliances, and sometimes going head-to-head.
Sea of Thieves was conceived in 2014. Rare was inspired by players of PC games such as Eve Online (2003), DayZ (2018), and Rust (2018) who used the game tools to create their own stories. Rare explored different settings, such as vampires and dinosaurs, before settling on a pirate theme inspired by the Pirates of the Caribbean films and The Goonies (1985). The game features a progression system that only unlocks cosmetic items as the development team wanted to encourage both casual and experienced players to play together. Rare departed from its reputation for secrecy during Sea of Thieves development, inviting fans to test the game's early builds.
Sea of Thieves received mixed reviews upon launch; critics praised the ship combat, multiplayer, visuals, and physics, but criticized the progression, gameplay, and lack of content. Rare envisioned Sea of Thieves as a "game as a service" and has released numerous content updates after the initial release, which has improved its overall reception. Some of the latest updates include Season 8 releasing a new on-demand player versus player naval battle featuring the noble Guardians of Fortune and the opposing faction of the Servants of the Flame.
Sea of Thieves was a commercial success and became Microsoft's most successful original intellectual property of the eighth generation, attracting more than 30 million players by June 2022. An enhanced |
https://en.wikipedia.org/wiki/%C3%89rudit | Érudit () is a Quebec non-profit publishing platform. Founded in 1998, it publishes research in the humanities and social sciences, as well as select physical and natural science journals. The organization is a consortium of Université de Montréal, Université Laval, and Université du Québec à Montréal. Érudit is the largest provider of Canadian French and bilingual research publications. Over 90% of the content on Érudit is offered in open access; for some journals, the most recent two or three years of issues are restricted, and by subscription only.
References
External links
Web portals
Publishing companies of Canada
Internet properties established in 1998
1998 establishments in Quebec
Academic publishing
Bilingualism
Academic journal online publishing platforms
Open access publishers |
https://en.wikipedia.org/wiki/Ferranti%20MRT | The Ferranti Market Research Terminal (MRT) was, arguably, the world’s first application-specific handheld computer. It was designed specifically for the market research sector as a means to augment the regular clipboard schemes that, at the time, were common-place, in social and market research. Despite having an appearance of a calculator built into a clipboard, the reality was that the unit contained a sophisticated form of programmable data-logger that, in response to an interviewer reading questions to the interviewee, had answers digitally recorded (for later uploading and analysis) via pressing appropriate keys on the unit. The unit contained a bespoke operating system to support field based market research. The Ferranti Market Research Terminal (MRT) is also of historical significance to the computing industry since it marked the last original computer design from Ferranti, a long established business (started 1882) that had risen to fame through a collaboration Manchester University to produce the "Mark 1", the world’s first commercial computer and later with Cambridge University producing the "Atlas" and "Titan" computers which, at their peak, held around 25% of the computing market.
History
Ferranti Plc produced two versions that were labelled the MRT-100 and MRT-200 and based on an original 1978 prototype called the Questronic which had been designed at Sheffield University as part of a collaboration between the Department of Electronics and Electrical Engineering and the Department of Geography. While it is difficult to imagine the context of this product development in the late seventies, it is useful to remember that the IBM PC (which has brought the Windows desktops and laptops that are now commonplace) was only introduced on 12 August 1981. If one ignores calculators, then handheld computers appeared in July 1980 with, perhaps, the first being the Tandy Pocket Computer (Radio Shack TRS-80 Pocket Computer). Later in the same year, Matsushita (n |
https://en.wikipedia.org/wiki/Briggs%E2%80%93Bers%20criterion | In stability theory, the Briggs–Bers criterion is a criterion for determining whether the trivial solution to a linear partial differential equation with constant coefficients is stable, convectively unstable or absolutely unstable. This is often useful in applied mathematics, especially in fluid dynamics, because linear PDEs often govern small perturbations to a system, and we are interested in whether such perturbations grow or decay. The Briggs–Bers criterion is named after R. J. Briggs and A. Bers.
Suppose that the PDE is of the form , where is a function of space and time( and ). The partial differential operator has constant coefficients, which do not depend on and . Then a suitable ansatz for is the normal mode solution
Making this ansatz is equivalent to considering the problem in Fourier space – the solution may be decomposed into its Fourier components in space and time. Making this ansatz, the equation becomes
or, more simply,
This is a dispersion relation between and , and tells us how each Fourier component evolves in time. In general, the dispersion relation may be very complicated, and there may be multiple which satisfy the relation for a given value of , or vice versa. The solutions to the dispersion relation may be complex-valued.
Now, an initial condition can be written as a superposition of Fourier modes of the form . In practice, the initial condition will have components of all frequencies. Each of these components evolves according to the dispersion relation, and therefore the solution at a later time may be obtained by Fourier inversion. In the simple case where is first-order in time, the dispersion relation determines a unique value of for each given value of , and so
where
is the Fourier transform of the initial condition. In the more general case, the Fourier inversion must be performed by contour integration in the complex and planes.
While it may not be possible to evaluate the integrals explicitly, asymptotic prope |
https://en.wikipedia.org/wiki/List%20of%20backward-compatible%20games%20for%20Xbox%20One%20and%20Series%20X/S | The Xbox One gaming console has received updates from Microsoft since its launch in 2013 that enable it to play select games from its two predecessor consoles, Xbox and Xbox 360. On June 15, 2015, backward compatibility with supported Xbox 360 games became available to eligible Xbox Preview program users with a beta update to the Xbox One system software. The dashboard update containing backward compatibility was released publicly on November 12, 2015. On October 24, 2017, another such update added games from the original Xbox library. The Xbox Series X/S was released in 2020 and was confirmed to be backwards compatible with the same list of games as the Xbox One at launch. On November 15, 2021, a "final addition" of 76 titles was published as part of the 20th anniversary of the launch of the original Xbox console. This is the following list of all backward compatible games on Xbox One and Xbox Series X/S under this functionality.
History
At its launch in November 2013, the Xbox One did not have native backward compatibility with original Xbox or Xbox 360 games. Xbox Live director of programming Larry "Major Nelson" Hryb suggested users could use the HDMI-in port on the console to pass an Xbox 360 or any other device with HDMI output through Xbox One. Senior project management and planning director Albert Penello explained that Microsoft was considering a cloud gaming platform to enable backward compatibility, but he felt it would be "problematic" due to varying internet connection qualities.
Xbox 360
During Microsoft's E3 2015 press conference on June 15, 2015, Microsoft announced plans to introduce Xbox 360 backward compatibility on the Xbox One at no additional cost. Supported Xbox 360 games will run within an emulator and have access to certain Xbox One features, such as recording and broadcasting gameplay. Games do not run directly from discs. A repackaged form of the game is downloaded automatically when a supported game is inserted, while digitally-purchase |
https://en.wikipedia.org/wiki/List%20of%20online%20marketplaces | This is a non-exhaustive list of online marketplaces.
References
Marketplaces
online marketplaces |
https://en.wikipedia.org/wiki/Dreams%20%28video%20game%29 | Dreams is a game creation system video game developed by Media Molecule and published by Sony Interactive Entertainment for the PlayStation 4 in February 2020. Players can create and play user-generated content in the forms of games, audiovisual experiences and game assets, which can be shared or remixed to be used in other players' creations.
Dreams includes several games developed by Media Molecule using the game itself, including Art's Dream, Ancient Dangers: A Bat's Tale, A Long Climb Ago, several virtual reality mini-games, and Tren.
On 11 April 2023, Media Molecule announced on their website that they would end live service support for Dreams in September 2023, in favour of an unannounced new project. Online server support will continue, as will bug fixing, in-game curation, official streams, and community engagement and promotion. The game will remain available for sale after this date.
Gameplay
In Dreams, players control an "imp", which is used to interact with the game's world and interface like a mouse cursor, create new items and characters, and manipulate objects by grabbing and pulling them. Players can move the imp with one of two control schemes: moving and rotating the DualShock 4 or PlayStation Move controllers, or using the left and right analog sticks. The imp is customizable, and can possess characters featured in a dream, allowing players to take direct control of these characters.
Dreams consists of six main sections: DreamSurfing, DreamShaping, Highlights, Profile, Community Jam, and Homespace. It also features a game made in Dreams by Media Molecule known as Art's Dream.
DreamSurfing
DreamSurfing can be thought of as the traditional "play" section where a player can browse "Dreams" that have been made and published to the "Dreamiverse" by other players, or as the game calls them, "Dreamers". These Dreams can be for example games to play, audiovisual experiences, and showcases of Elements such as sculptures and art to view and music to |
https://en.wikipedia.org/wiki/Corradino%20Lines | The Corradino Lines () are a line of fortification on the Corradino Heights in Paola, Malta. They were built between 1871 and 1880 by the British. Today, the lines are partly intact and they lie in an industrial area.
History
Corradino () is a large headland within the Grand Harbour, overlooking Senglea and Floriana. Corradino is on high ground compared to the surrounding area, and therefore was of great strategic importance. The site's importance was seen in the Great Siege of Malta in 1565, when Ottomans mounted cannons on high ground to bombard the Order of Saint John in Senglea and Birgu. Over 200 years later, new batteries were built on Corradino, this time by Maltese insurgents to bombard the French during the blockade of 1798–1800.
Although the Order of Saint John built extensive fortifications around most of the Grand Harbour area, Corradino was not fortified. A proposal to build a bastioned enceinte was made in the 1670s following the fall of Candia, but this was never built due to a lack of funds. The only military building on the headland was a polverista at Ras Ħanżir, which Pinto built in 1756.
Malta was eventually taken over by the British, and the island became the Royal Navy's main base in the Mediterranean. In the 1860s, it was decided that the Malta Dockyard be expanded into French Creek, the inlet between Senglea and Corradino. In the following years, the necessity to fortify Corradino was highlighted, since if an enemy took over the headland, the dockyard could be easily attacked.
The Corradino Lines were therefore built by the Royal Engineers between 1871 and 1880, at a total cost of £17634. Part of the megalithic temple of Kordin II was destroyed to make way for the new line of fortification in 1871. The defensive line consisted of a V-shaped polygonal-style trace surrounded by a ditch, stretching all the way from the Cottonera Lines to the Ras Ħanżir polverista. The lines were also meant to protect the polverista, which was modified by the |
https://en.wikipedia.org/wiki/Single-root%20input/output%20virtualization | In virtualization, single root input/output virtualization (SR-IOV) is a specification that allows the isolation of PCI Express resources for manageability and performance reasons.
Details
A single physical PCI Express bus can be shared in a virtual environment using the SR-IOV specification. The SR-IOV offers different virtual functions to different virtual components (e.g. network adapter) on a physical server machine. SR-IOV uses physical and virtual functions to control or configure PCIe devices. Physical functions have the ability to move data in and out of the device while virtual functions are lightweight PCIe functions that support data flowing but also have a restricted set of configuration resources. The virtual or physical functions available to the hypervisor or guest operating system depend on the PCIe device.
The SR-IOV allows different virtual machines (VMs) in a virtual environment to share a single PCI Express hardware interface. In contrast, MR-IOV allows I/O PCI Express to share resources among different VMs on different physical machines.
InfiniBand
A major field of application for SR-IOV is within the high-performance computing (HPC) field. The use of high-performance InfiniBand networking cards is growing within the HPC sector, and there is early research into the use of SR-IOV to allow for the use of InfiniBand within virtual machines such as Xen.
See also
I/O virtualization
References
Hardware virtualization
Computer networking
Peripheral Component Interconnect |
https://en.wikipedia.org/wiki/Identity-based%20conditional%20proxy%20re-encryption | Identity-based conditional proxy re-encryption (IBCPRE) is a type of proxy re-encryption (PRE) scheme in the identity-based public key cryptographic setting. An IBCPRE scheme is a natural extension of proxy re-encryption on two aspects. The first aspect is to extend the proxy re-encryption notion to the identity-based public key cryptographic setting. The second aspect is to extend the feature set of proxy re-encryption to support conditional proxy re-encryption. By conditional proxy re-encryption, a proxy can use an IBCPRE scheme to re-encrypt a ciphertext but the ciphertext would only be well-formed for decryption if a condition applied onto the ciphertext together with the re-encryption key is satisfied. This allows fine-grained proxy re-encryption and can be useful for applications such as secure sharing over encrypted cloud data storage.
Introduction
A public-key encryption scheme allows anyone who has the public key of a receiver to encrypt messages to the receiver using the public key in such a way that only the corresponding private key known only to the receiver can decrypt and recover the messages. The public key of a user, therefore, can be published for allowing everyone to use it for encrypting messages to the user while the private key of the user has to be kept secret for the decryption purpose. Both the public key and the corresponding private key of the user are generated by the user in general.
Under the identity-based cryptographic setting, the public key of the user can be an arbitrary string of bits, provided that the string can uniquely identify the user in the system. The unique string, for example, can be an email address, a phone number, and a staff ID (if used only internally within an organization). However, the corresponding private key is no longer generated by the user. From the public key, which is a unique binary string, there is a key generation center (KGC), which generates and issues the private key to the user. The KGC has a p |
https://en.wikipedia.org/wiki/Walter%20O%27Brien%20%28Scorpion%29 | Walter O'Brien is the fictional lead character in the American drama television series, Scorpion. The character is inspired by the Irish businessman and information technologist of the same name. The character, played by actor Elyes Gabel, follows a loose trajectory of Walter O'Brien's real-life exploits that thwart terrorism and disasters in each episode of the series.
Character origin and casting
Walter O'Brien approached Scorpion executive producer Scooter Braun with the idea of making a show about him in order to attract more genius employees to his company. Actor Elyes Gabel stars as Walter O'Brien in the Scorpion television series.
Characterization
Recurring protagonist Walter O'Brien is a genius with a 197 IQ. Agent Cabe Gallo was the person who brought him from Ireland to America after O'Brien hacked into NASA computers to get a set of blueprints for his wall.
Walter O'Brien and a team of outcasts that he befriends and works with are recruited by federal agent Cabe Gallo of the U.S. Department of Homeland Security to form Scorpion, said to be the last line of defense against complex, high-tech threats around the globe. The team includes O'Brien and his friends Sylvester Dodd, a "human calculator" dealing in statistics; Happy Quinn, a "mechanical prodigy"; and Toby Curtis, a "world-class shrink" (a Harvard-trained behaviorist). Paige Dineen is a former waitress whose intuitive interaction with people translates the real world to the team, and they, in exchange, translate her young mentally gifted son, Ralph, to her.
Personality
O'Brien is often described as the stereotypical computer "nerd". He is usually characterized as extremely intelligent, socially inept, and rigidly logical. He regularly displays a lack of emotional intelligence and empathy, preferring to use logic and reasoning to “fix” the world around him. His beyond genius-level IQ allows him to solve problems that other people could not, but it also diminishes his ability to relate and empat |
https://en.wikipedia.org/wiki/Oral%20food%20challenge | An oral food challenge is a method for determining if a person has a specific food allergy. It involves giving increasing amounts of a food and watching to see if an allergic reaction occurs. They are potentially dangerous.
References
Food allergies
Medical tests |
https://en.wikipedia.org/wiki/WebAssembly | WebAssembly (sometimes abbreviated Wasm) defines a portable binary-code format and a corresponding text format for executable programs as well as software interfaces for facilitating interactions between such programs and their host environment.
The main goal of WebAssembly is to enable high-performance applications on web pages, "but it does not make any Web-specific assumptions or provide Web-specific features, so it can be employed in other environments as well." It is an open standard and aims to support any language on any operating system, and in practice all of the most popular languages already have at least some level of support.
Announced in and first released in , WebAssembly became a World Wide Web Consortium recommendation on 5 December 2019 and it received the Programming Languages Software Award from ACM SIGPLAN in 2021. The World Wide Web Consortium (W3C) maintains the standard with contributions from Mozilla, Microsoft, Google, Apple, Fastly, Intel, and Red Hat.
History
WebAssembly is named to evoke the concept of assembly language, a term which dates to the 1950s. The name suggests bringing assembly-like programming to the Web, where it will be executed client-side by the website-user's computer via the user's web browser. To accomplish this, WebAssembly must be much more hardware-independent than a true assembly language.
WebAssembly was first announced in 2015, and the first demonstration was executing Unity's Angry Bots in Firefox, Google Chrome, and Microsoft Edge. The precursor technologies were asm.js from Mozilla and Google Native Client, and the initial implementation was based on the feature set of asm.js. The asm.js technology already provides near-native code execution speeds and can be considered a viable alternative for browsers that don't support WebAssembly or have it disabled for security reasons.
In March 2017, the design of the minimum viable product (MVP) was declared to be finished and the preview phase ended. In late Se |
https://en.wikipedia.org/wiki/Pyramid%20of%20doom%20%28programming%29 | In computer programming, the pyramid of doom is a common problem that arises when a program uses many levels of nested indentation to control access to a function. It is commonly seen when checking for null pointers or handling callbacks. Two examples of the term are related to a particular programming style in JavaScript, and the nesting of if statements that occurs in object-oriented programming languages when one of the objects may be a null pointer.
Examples
Most modern object-oriented programming languages use a coding style known as dot notation that allows multiple method calls to be written in a single line of code, each call separated by a period. For instance:
theWidth = windows("Main").views(5).size().width();
This code contains four different instructions; it first looks in the collection of windows for a window with the name "Main", then looks in that window's views collection for the 5th subview within it, then calls the size method to return a structure with the view's dimensions, and finally calls the width method on that structure to produce a result that is assigned to a variable name theWidth.
The problem with this approach is that the code assumes that all of these values exist. While it is reasonable to expect that a window will have a size and that size will have a width, it is not at all reasonable to assume that a window named "Main" will exist, nor that it has five subviews. If either of those assumptions is wrong, one of the methods will be invoked on null, producing a null pointer error.
To avoid this error, the programmer has to check every method call to ensure it returns a value. A safer version of the same code would be:
if windows.contains("Main") {
if windows("Main").views.contains(5) {
theWidth = windows("Main").views(5).size().width();
//more code that works with theWidth
}
}
If the programmer wishes to use that value based on whether or not it exists and is valid, the functional code inside the if st |
https://en.wikipedia.org/wiki/Level%20structure%20%28algebraic%20geometry%29 | In algebraic geometry, a level structure on a space X is an extra structure attached to X that shrinks or eliminates the automorphism group of X, by demanding automorphisms to preserve the level structure; attaching a level structure is often phrased as rigidifying the geometry of X.
In applications, a level structure is used in the construction of moduli spaces; a moduli space is often constructed as a quotient. The presence of automorphisms poses a difficulty to forming a quotient; thus introducing level structures helps overcome this difficulty.
There is no single definition of a level structure; rather, depending on the space X, one introduces the notion of a level structure. The classic one is that on an elliptic curve (see #Example: an abelian scheme). There is a level structure attached to a formal group called a Drinfeld level structure, introduced in .
Level structures on elliptic curves
Classically, level structures on elliptic curves are given by a lattice containing the defining lattice of the variety. From the moduli theory of elliptic curves, all such lattices can be described as the lattice for in the upper-half plane. Then, the lattice generated by gives a lattice which contains all -torsion points on the elliptic curve denoted . In fact, given such a lattice is invariant under the action on , wherehence it gives a point in called the moduli space of level N structures of elliptic curves , which is a modular curve. In fact, this moduli space contains slightly more information: the Weil pairinggives a point in the -th roots of unity, hence in .
Example: an abelian scheme
Let be an abelian scheme whose geometric fibers have dimension g.
Let n be a positive integer that is prime to the residue field of each s in S. For n ≥ 2, a level n-structure is a set of sections such that
for each geometric point , form a basis for the group of points of order n in ,
is the identity section, where is the multiplication by n.
See also: modular cu |
https://en.wikipedia.org/wiki/Vectra%20AI | Vectra AI, Inc. is a cybersecurity company specializing in AI applied to network detection and response (NDR) solutions. Established in 2012, Vectra AI now operates in 113 countries from its headquarters in San Jose, California.
History
Vectra AI, formerly known as TraceVector, was founded in 2008 by a group of 4 cybersecurity professionals. Its mission was to offer security professionals an automated intrusion detection system that could address the escalating and sophisticated cyber-attacks which had increased dramatically in recent years.
In March 2015, Vectra launched the S-series sensor, announced record bookings growth of nearly 400 percent in 2015 over 2014 and expanded its business into EMEA.
Product
Vectra AI employs artificial intelligence techniques, including supervised (pre-trained), unsupervised machine learning and deep learning techniques, to detect and respond to in-progress cyberattacks in real time.
The product's algorithms continuously learn the behavioral norms of devices, user accounts, ports and protocols to identify signs of compromise across enterprise infrastructure. Threats are automatically triaged, scored and correlated to compromised hosts, and attack behaviors are correlated across hosts to provide the “narrative” of developing attacks. These threats are prioritized, while alerting and remediation actions are taken with other security technologies.
Investors
Vectra AI has secured investments from a diverse group of investors, including Khosla Ventures, IA Ventures, Accel Partners, Atlantic Bridge, Wipro Ventures, AME Cloud Ventures, Intel Capital, DAG Ventures, Ireland Strategic Investment Fund, Junos Innovation Fund (Juniper), Nissho Electronics, Silver Lake, TCV, and Blackstone.
Funding
Vectra AI raised a total of $350 million in funding and is considered a Unicorn with its $1.2 billion valuation.
References
Further reading
Companies based in San Jose, California
American companies established in 2012
Computer sec |
https://en.wikipedia.org/wiki/Sagol | Sagol (), or beef leg bone, is an ingredient in Korean cuisine. Sagol is often boiled to make a broth, called sagol-yuksu (), or beef leg bone broth, for Korean soups such as gomguk (beef bone soup), galbi-tang (short rib soup), tteokguk (sliced rice cake soup), kal-guksu (noodle soup), or gukbap (soup with rice).
Sagol is rich in the protein collagen and in minerals such as calcium. In traditional Korean culture, it is believed to reinvigorate the body. However, no scientific evidence supports this claim. In the summer, sagol-yuksu (broth) is served to pregnant or breastfeeding mothers and the sick. In the winter, it is served with rice as a warm and nutritious meal.
Etymology
The anglicized translation of the word Sagol roughly translates to Four Bones. 'Sa' meaning four and 'Gol' meaning bone. Together, they refer to the thigh and shin bones of a cow or bull. The term is primarily used in cooking.
Anatomy
Cattle have eight sagol bones. Sagol uses the thigh and shin bones from a cow's four legs. Sagol can be classified by breed (hanu, beef cattle, dairy cattle, imported, etc.), sex (cow, bull, steer, etc.), or grade. High-grade sagol from hanu beef with a dense ivory and white bone cross-section is typically preferred. A sagol consists of one diaphysis part and two epiphysis parts. The Epiphysis parts have an outer layer of compact bone and an inner layer of spongy bone. The diaphysis contains periostea outside and marrow inside.
See also
Beef shank
Ham hock
Long bone
Oxtail
References
Food ingredients
Korean cuisine
Beef |
https://en.wikipedia.org/wiki/Fan-out%20%28software%29 | Fan-out has multiple meanings in software engineering.
Message-oriented middleware
In message-oriented middleware solutions, fan-out is a messaging pattern used to model an information exchange that implies the delivery (or spreading) of a message to one or multiple destinations possibly in parallel, and not halting the process that executes the messaging to wait for any response to that message.
Software design and quality assurance
In software construction, the fan-out of a class or method is the number of other classes used by that class or the number of other methods called by that method.
Additionally, fan-out has impact on the quality of a software.
See also
Middleware
Coupling (computer programming)
Software quality
Software metric
References
Middleware |
https://en.wikipedia.org/wiki/Avast%20SecureLine%20VPN | Avast SecureLine VPN is a VPN service developed by Czech cybersecurity software company Avast. It is available for Android, Microsoft Windows, macOS and iOS operating systems.
The VPN can be set to automatically turn on when the user connects to a public Wi-Fi.
Functionality
Similar to other VPNs, SecureLine works by making the user appear in a different place via changing the user's IP address, bypassing internet censorship for the country the user is in or Wi-Fi the user is using. The VPN can be set to automatically turn on when the user connects to a public Wi-Fi.
Security features of Avast SecureLine VPN include: 256-bit Advanced Encryption Standard, single shared IP, DNS leak protection, kill switch, and Smart Connection Rules.
Server locations
Avast has egress servers in more than 60 cities world-wide. Servers in eight cities support P2P connections for protocols like BitTorrent and further servers are dedicated to users of streaming services.
See also
Comparison of virtual private network services
Information privacy
Internet privacy
References
External links
SecureLine VPN
Android (operating system) software
iOS software
MacOS software
Proprietary software
Virtual private network services
Windows software
Gen Digital software |
https://en.wikipedia.org/wiki/XARA | XARA is an acronym for "Unauthorized Cross-App Resource Access", which describes a category of zero-day vulnerabilities in computer software systems.
Initial Disclosure
An academic research paper entitled "Unauthorized Cross-App Resource Access on MAC OS X and iOS". was published on 26 May 2015 by a team of researchers from Indiana University, Tsinghua University, Peking University, Chinese Academy of Sciences, and Georgia Institute of Technology. The paper was widely released to the public on 16 June 2015
and commented on by both mainstream and technical media outlets.
The paper identifies a number of separate categories of zero day threats to applications and stored passwords which can potentially be exploited by malware on iOS devices and OS X. The paper also discloses the existence of similar vulnerabilities on Android devices.
Response by Vendors
On 19 June 2015, Apple Computer responded to the press that they had implemented countermeasures to exclude malware containing the XARA exploit from their iOS App Store.
Attack Vectors
In XARA each attack vector violates the principles of a computer security sandbox.
Untrusted partners using shared resources such file system, keychain.
Inter-process communication without verification of partner.
Weak security policies of system installer allow other applications to be designated as shared resource bundles.
Known systems with problems
iOS from Apple Computer
OS X from Apple Computer
Android from Google
See also
Targeted attacks
Access Control
Software-defined protection
Sandbox (computer security)
Vector (malware)
References
Computer network security
Types of malware |
https://en.wikipedia.org/wiki/Array%20factor | An array is simply a group of objects, and the array factor is a measure of how much a specific characteristic changes because of the grouping. This phenomenon is observed when antennas are grouped together. The radiation (or reception) pattern of the antenna group is considerably different from that of a single antenna. This is due to the constructive and destructive interference properties of radio waves. A well designed antenna array, allows the broadcast power to be directed to where it is needed most.
These antenna arrays are typically one dimensional, as seen on collinear dipole arrays, or two dimensional as on military phased arrays.
In order to simplify the mathematics, a number of assumptions are typically made:
1. all radiators are equal in every respect
2. all radiators are uniformly spaced
3. the signal phase shift between radiators is constant.
The array factor is the complex-valued far-field radiation pattern obtained for an array of isotropic radiators located at coordinates , as determined by:
where are the complex-valued excitation coefficients, and is the direction unit vector. The array factor is defined in the transmitting mode, with the time convention . A corresponding expression can be derived for the receiving mode, where a negative sign appears in the exponential factors, as derived in reference.
References
See also
Array antenna
Radar
Antennas
Signal processing |
https://en.wikipedia.org/wiki/Dualizing%20sheaf | In algebraic geometry, the dualizing sheaf on a proper scheme X of dimension n over a field k is a coherent sheaf together with a linear functional
that induces a natural isomorphism of vector spaces
for each coherent sheaf F on X (the superscript * refers to a dual vector space). The linear functional is called a trace morphism.
A pair , if it is exists, is unique up to a natural isomorphism. In fact, in the language of category theory, is an object representing the contravariant functor from the category of coherent sheaves on X to the category of k-vector spaces.
For a normal projective variety X, the dualizing sheaf exists and it is in fact the canonical sheaf: where is a canonical divisor. More generally, the dualizing sheaf exists for any projective scheme.
There is the following variant of Serre's duality theorem: for a projective scheme X of pure dimension n and a Cohen–Macaulay sheaf F on X such that is of pure dimension n, there is a natural isomorphism
.
In particular, if X itself is a Cohen–Macaulay scheme, then the above duality holds for any locally free sheaf.
Relative dualizing sheaf
Given a proper finitely presented morphism of schemes , defines the relative dualizing sheaf or as the sheaf such that for each open subset and a quasi-coherent sheaf on , there is a canonical isomorphism
,
which is functorial in and commutes with open restrictions.
Example:
If is a local complete intersection morphism between schemes of finite type over a field, then (by definition) each point of has an open neighborhood and a factorization , a regular embedding of codimension followed by a smooth morphism of relative dimension . Then
where is the sheaf of relative Kähler differentials and is the normal bundle to .
Examples
Dualizing sheaf of a nodal curve
For a smooth curve C, its dualizing sheaf can be given by the canonical sheaf .
For a nodal curve C with a node p, we may consider the normalization with two points x, y identified. L |
https://en.wikipedia.org/wiki/Minds%20%28social%20network%29 | Minds is an open-source and distributed social network. Users can earn money or cryptocurrency for using Minds, and tokens can be used to boost their posts or crowdfund other users. Minds has been described as more privacy-focused than mainstream social media networks. Writers in The New York Times, Engadget, and Vice have noted the volume of far-right users and content on the platform, following a trend across social media. Minds describes itself as focused on free speech, and minimally moderates the content on its platform. Its founders have said that they do not remove extremist content from the site out of a desire to deradicalize those who post it through civil discourse.
History
Minds was co-founded in 2011 by Bill Ottman and John Ottman as an alternative to social networks such as Facebook, which the founders believed abused their users via "spying, data mining, algorithm manipulation, and no revenue sharing". Other cofounders were Mark Harding, Ian Crossland, and Jack Ottman. Minds launched to the public in June 2015.
A Facebook page affiliated with the hacktivist group Anonymous encouraged its followers to support Minds in 2015, and called for developers to contribute to the service's open source codebase.
In 2018, over 150,000 Vietnamese users joined Minds after fearing that Facebook would comply with a new law requiring them to remove political dissent and release user data to the Vietnamese government. Beginning in May 2020, over 250,000 Thai users joined Minds after growing concerns about privacy on Twitter, which had been widely used for political activism. This led Minds to add Thai language support to its mobile apps, and upgrade its servers to handle the influx of traffic.
In October 2019, United States President Donald Trump invited Minds to a social media summit hosted at the White House. In January 2021, after YouTube and Facebook removed tens of thousands of Trump supporters and alleged white supremacists from their platforms in the wake of |
https://en.wikipedia.org/wiki/Guest%20Host%20Displays | Guest Host Displays, Dichroic Displays, Polymer Dispersed Displays
Guest host displays are similar to more common liquid crystal displays, but also include polymers, inorganic particles, or dichroic dye within the liquid crystal matrix.
In dichroic dye displays, as the birefringence of the host liquid crystals change from planar to perpendicular orientation, the guest dyes also change orientation, from absorbing / planar orientation, to non-absorbing / perpendicular orientation.
Unlike common TN (Twisted Nematic) or STN (Super Twisted Nematic) liquid crystal displays, guest host displays are typically driven direct, and are not usually multiplex driven.
In addition, guest host displays usually require higher operating voltages than TN or STN displays. For example, the polymer dispersed liquid crystal display (also called a P.D.L.C. display), is usually operated at voltages from 4.5 V to 24 V to as high as 100 V. Similarly, dichroic dye containing guest host displays, require voltages from 4.5 V to 10 V and higher.
However, the P.D.L.C. display and many dichroic dye containing guest host displays, such as the White-Taylor Phase Change display, do not require polarizers, which is a significant advantage over TN or STN displays. Lacking polarizers these displays commonly have lower contrast than TN or STN displays, But are often sunlight readable, and usually have no backlight, and hence no backlight glare.
Polarizer free displays enable low cost devices, since the polarizer is one of the more expensive components comprising the common liquid crystal display.
Lacking polarizers, the guest host display substrates can be manufactured from low cost birefringent plastic films. And the plastic film substrates enable additional economies such as continuous R2R manufacturing (Roll to Roll manufacturing) of the displays, with its inherent economies over batch manufacturing processes.
Continuous manufacturing of displays is described in U.S. Patents 4,228,574, 4,924, |
https://en.wikipedia.org/wiki/TunnelBear | TunnelBear is a public VPN service based in Toronto, Canada. It was created by Daniel Kaldor and Ryan Dochuk in 2011. In March 2018, TunnelBear was acquired by McAfee.
History
Early history
TunnelBear was founded in 2011 by Ryan Dochuk and Daniel Kaldor, and is headquartered in Toronto, Canada.
2018 McAfee acquisition
In 2018, TunnelBear was acquired by cybersecurity company McAfee and subsequently fell under U.S. jurisdiction. McAfee intended to combine its own VPN service with TunnelBear's technologies. At the time of the acquisition, TunnelBear was set to continue using its own brand for products.
Anti-censorship efforts
During the 2014 Venezuelan Protests, TunnelBear offered free service to users connecting from Venezuela. In response to government censorship in countries like Venezuela—including Iran, Turkey and Uganda—TunnelBear has offered free or unlimited data to users within such countries.
Features
A freeware TunnelBear client is available on Android, Windows, macOS and iOS. It also has browser extensions for Google Chrome and Opera. Alternatively, Linux distros can be configured to use TunnelBear.
Like other public VPN services, TunnelBear has the ability to bypass content blocking in most countries.
All TunnelBear clients use AES-256 encryption with the exception of the client for iOS 8 and earlier, which uses AES-128. When connected, the user's actual IP address will not be visible to the websites visited. Instead, the websites and/or computers would be able to see the spoofed IP address provided by the service.
TunnelBear was among the first consumer VPNs to conduct and publicly release the results of an independent security audit. They record when their users connect to the service and publish annual reports on the number of times law enforcement has requested user information.
Reception
Scott Gilbertson of Wired praised TunnelBear's “cute bear animations”, saying that they make the service more approachable, and described the provider as |
https://en.wikipedia.org/wiki/Castellated%20beam | A castellated beam is a beam style where an I-beam is subjected to a longitudinal cut along its web following a specific pattern.
The purpose is to divide and reassemble the beam with a deeper web by taking advantage of the cutting pattern.
References
See also
Cellular beam
Open web steel joist
Structural engineering |
https://en.wikipedia.org/wiki/HP%20Inc. | HP Inc. is an American multinational information technology company headquartered in Palo Alto, California, that develops personal computers (PCs), printers and related supplies, as well as 3D printing solutions. It was formed on November 1, 2015, as the legal successor of the original Hewlett-Packard after the company's enterprise product and business services divisions were spun off as a new publicly traded company, Hewlett Packard Enterprise.
HP is listed on the New York Stock Exchange and is a constituent of the S&P 500 Index. It is the world's 2nd largest personal computer vendor by unit sales as of January 2021, after Lenovo. In the 2023 Fortune 500 list, HP is ranked 63rd largest United States corporation by total revenue.
History
Hewlett-Packard was founded in 1939 by Bill Hewlett and David Packard, who both graduated with degrees in electrical engineering from Stanford University in 1935. The company started off in the HP Garage in Palo Alto, California. On November 1, 2015, Hewlett-Packard was split into two companies. Its personal computer and printer businesses became HP Inc., while its enterprise business became Hewlett Packard Enterprise. The split was structured so that Hewlett-Packard changed its name to HP Inc. and spun off Hewlett-Packard-Packard Enterprise as a new publicly traded company. HP Inc. retains Hewlett-Packard's pre-2015 stock price history and its former stock ticker symbol, HPQ, while Hewlett Packard Enterprise trades under its own symbol, HPE.
As HP Inc.
In May 2016, HP introduced a new PC gaming sub-brand known as Omen (reusing trademarks associated with VoodooPC), including gaming laptops and desktops (with the latter offering options such as CPU water cooling and Nvidia's GTX 1080 graphics, and promoted as VR-ready), and other accessories (such as monitors) designed to cater to the market.
In November 2017, HP acquired Samsung Electronics' printer division for $1.05 billion.
In February 2021, HP announced its acquisition o |
https://en.wikipedia.org/wiki/Optimistic%20knowledge%20gradient | In statistics The optimistic knowledge gradient is a approximation policy proposed by Xi Chen, Qihang Lin and Dengyong Zhou in 2013. This policy is created to solve the challenge of computationally intractable of large size of optimal computing budget allocation problem in binary/multi-class crowd labeling where each label from the crowd has a certain cost.
Motivation
The optimal computing budget allocation problem is formulated as a Bayesian Markov decision process(MDP) and is solved by using the dynamic programming (DP) algorithm where the Optimistic knowledge gradient policy is used to solve the computationally intractable of the dynamic programming (DP) algorithm.
Consider a budget allocation issue in crowdsourcing. The particular crowdsourcing problem we considering is crowd labeling. Crowd labeling is a large amount of labeling tasks which are hard to solve by machine, turn out to easy to solve by human beings, then we just outsourced to an unidentified group of random people in a distributed environment.
Methodology
We want to finish this labeling tasks rely on the power of the crowd hopefully. For example, suppose we want to identify a picture according to the people in a picture is adult or not, this is a Bernoulli labeling problem, and all of us can do in one or two seconds, this is an easy task for human being. However, if we have tens of thousands picture like this, then this is no longer the easy task any more. That's why we need to rely on crowdsourcing framework to make this fast. Crowdsourcing framework of this consists of two steps. Step one, we just dynamically acquire from the crowd for items. On the other sides, this is dynamic procedure. We don't just send out this picture to everyone and we focus every response, instead, we do this in quantity. We are going to decide which picture we send it in the next, and which worker we are going to hire in the crowd in the next. According to his or her historical labeling results. And each picture can |
https://en.wikipedia.org/wiki/List%20of%20online%20database%20creator%20apps | This list of online database creator apps lists notable web apps where end users with minimal database administration expertise can create online databases to share with team members.
Users need not have the coding skills to manage the solution stack themselves, because the web app already provides this predefined functionality. Such online database creator apps serve the gap between IT professionals (who can manage such a stack themselves) and people who would not create databases at all anyway. In other words, they provide a low-code way of doing database administration. As the concept of low-code development in general continues to evolve, some of the brands that began as online database creator apps are evolving into low-code development platforms for both the databases and the custom apps that use them.
References
Web applications
Online databases |
https://en.wikipedia.org/wiki/Spark%20%28XMPP%20client%29 | Spark is an open-source instant messaging program (based on XMPP protocol) that allows users to communicate in real time. It can be integrated with the Openfire server to provide additional features such as controlling the various Spark functionalities from a central management console, or integrating with a proprietary customer support service known as Fastpath which allows its users to interact with the platform using the Spark client. Being a cross-platform application, Spark can run on various systems. Installers for Windows, macOS and Linux are available on the official website.
History
Previously known as Jive Communicator, Spark was designed by Jive Software with a lightweight graphical design and simplistic user interface for business usage. Later, it was open-sourced and donated to the Ignite Realtime community, along with Openfire, for further improvement and development.
Features
Spark is based on a popular open-source Smack API library, also developed by Ignite Realtime. It has a tabbed interface for managing conversations, a quick and full history, and a search feature inside the contacts window which is designed for organizations with many units and employees. Other features include shortcuts to access recent and favorite contacts, and Spark supports ad hoc and regular group chats. Spark supports SSL/TLS encryption, and additionally provides an option to use Off-the-Record Messaging for end-to-end encryption. Though it is designed to work with XMPP servers, it can also integrate with Kraken IM Gateway plugin for Openfire, and provide an option to connect with many other IM networks.
The software’s user interface is intended to be lightweight with skins, tabbed conversations and plugin support. It contains single sign-on and file transfer capability, as well as privacy list.
See also
Extensible Messaging and Presence Protocol
References
External links
Official website
GitHub repository
Java platform software
Instant messaging
Free software |
https://en.wikipedia.org/wiki/Cirquent%20calculus | Cirquent calculus is a proof calculus that manipulates graph-style constructs termed cirquents, as opposed to the traditional tree-style objects such as formulas or sequents. Cirquents come in a variety of forms, but they all share one main characteristic feature, making them different from the more traditional objects of syntactic manipulation. This feature is the ability to explicitly account for possible sharing of subcomponents between different components. For instance, it is possible to write an expression where two subexpressions F and E, while neither one is a subexpression of the other, still have a common occurrence of a subexpression G (as opposed to having two different occurrences of G, one in F and one in E).
Overview
The approach was introduced by G. Japaridze in as an alternative proof theory capable of "taming" various nontrivial fragments of his computability logic, which had otherwise resisted all axiomatization attempts within the traditional proof-theoretic frameworks. The origin of the term “cirquent” is CIRcuit+seQUENT, as the simplest form of cirquents, while resembling circuits rather than formulas, can be thought of as collections of one-sided sequents (for instance, sequents of a given level of a Gentzen-style proof tree) where some sequents may have shared elements.
The basic version of cirquent calculus was accompanied with an "abstract resource semantics" and the claim that the latter was an adequate formalization of the resource philosophy traditionally associated with linear logic. Based on that claim and the fact that the semantics induced a logic properly stronger than (affine) linear logic, Japaridze argued that linear logic was incomplete as a logic of resources. Furthermore, he argued that not only the deductive power but also the expressive power of linear logic was weak, for it, unlike cirquent calculus, failed to capture the ubiquitous phenomenon of resource sharing.
The resource philosophy of cirquent calculus sees t |
https://en.wikipedia.org/wiki/Automatic%20Certificate%20Management%20Environment | The Automatic Certificate Management Environment (ACME) protocol is a communications protocol for automating interactions between certificate authorities and their users' servers, allowing the automated deployment of public key infrastructure at very low cost. It was designed by the Internet Security Research Group (ISRG) for their Let's Encrypt service.
The protocol, based on passing JSON-formatted messages over HTTPS, has been published as an Internet Standard in by its own chartered IETF working group.
Client implementations
The ISRG provides free and open-source reference implementations for ACME: certbot is a Python-based implementation of server certificate management software using the ACME protocol, and boulder is a certificate authority implementation, written in Go.
Since 2015 a large variety of client options have appeared for all operating systems.
API versions
API version 1
API v1 specification was published on April 12, 2016. It supports issuing certificates for fully-qualified domain names, such as example.com or cluster.example.com, but not wildcards like *.example.com. Let's Encrypt turned off API v1 support on 1 June 2021.
API version 2
API v2 was released March 13, 2018 after being pushed back several times. ACME v2 is not backwards compatible with v1. Version 2 supports wildcard domains, such as *.example.com, allowing for many subdomains to have trusted TLS, e.g. https://cluster01.example.com, https://cluster02.example.com, https://example.com, on private networks under a single domain using a single shared "wildcard" certificate. A major new requirement in v2 is that requests for wildcard certificates require the modification of a Domain Name Service TXT record, verifying control over the domain.
Changes to ACME v2 protocol since v1 include:
The authorization/issuance flow has changed.
JWS request authorization has changed.
The "resource" field of JWS request bodies is replaced by a new JWS header: "url".
Directory endpoint/res |
https://en.wikipedia.org/wiki/PyAOP%20reagent | PyAOP ((7-Azabenzotriazol-1-yloxy)tripyrrolidinophosphonium hexafluorophosphate) is a coupling reagent used in solid phase peptide synthesis. It is a derivative of the HOAt family of coupling reagents. It is preferred over HATU, because it does not side react at the N-terminus of the peptide. Compared to the HOBt derivates, PyAOP (and HOAt in general) are more reactive due to the additional nitrogen.
See also
HOAt reagent
HOBt reagent
BOP reagent
PyBOP
References
Hexafluorophosphates
Peptide coupling reagents
Triazolopyridines
Reagents for biochemistry
Quaternary phosphonium compounds
Organophosphorus compounds |
https://en.wikipedia.org/wiki/BigCommerce | BigCommerce is a NASDAQ-listed ecommerce platform that provides software as a service services to retailers. The company's platform includes online store creation, search engine optimization, hosting, and marketing and security from small to Enterprise sized businesses.
History
BigCommerce was founded in Sydney, Australia in 2009 by Australians Eddie Machaalani and Mitchell Harper, who met in an online chatroom in 2003. One year after meeting, Machaalani and Harper launched their first company, Interspire, which evolved into BigCommerce. The company opened its first United States office in Austin, Texas in 2009.
The company raised $15 million in Series A funding from General Catalyst in July 2011.
In 2014, the company expanded its presence on the West Coast, opening a San Francisco office and hiring personnel from PayPal and Amazon. In 2015, BigCommerce acquired Zing, a checkout and inventory software startup.
Brent Bellm, the former HomeAway COO who led HomeAway through its IPO, replaced Machaalani and Harper as CEO in 2015.
BigCommerce partnered with Amazon in 2016 to provide its retailers with the capability to sync inventory across both channels.
In 2019, the company opened its ecommerce platforms to legally-operating U.S.-based CBD and hemp merchants.
In July 2020, BigCommerce filed for IPO. The company went public on August 5, 2020.
Services
BigCommerce provides software to businesses that helps them set up and manage online and mobile stores, handle payments and currency conversions.
As of June 2020, BigCommerce served 60,000 online stores in 120 countries.
See also
Comparison of shopping cart software
References
External links
Web applications
Online retailers of the United States
Internet properties established in 2009
Online services
Companies listed on the Nasdaq |
https://en.wikipedia.org/wiki/Eigenoperator | In mathematics, an eigenoperator, A, of a matrix H is a linear operator such that
where is a corresponding scalar called an eigenvalue.
References
Linear algebra
Matrix theory |
https://en.wikipedia.org/wiki/Low-level%20design | Low-level design (LLD) is a component-level design process that follows a step-by-step refinement process. This process can be used for designing data structures, required software architecture, source code and ultimately, performance algorithms. Overall, the data organization may be defined during requirement analysis and then refined during data design work. Post-build, each component is specified in detail.
The LLD phase is the stage where the actual software components are designed.
During the detailed phase the logical and functional design is done and the design of application structure is developed during the high-level design phase.
Design phase
A design is the order of a system that connects individual components. Often, it can interact with other systems. Design is important to achieve high reliability, low cost, and good maintain-ability.
We can distinguish two types of program design phases:
Architectural or high-level design
Detailed or low-level design
Structured flow charts and HIPO diagrams typify the class of software design tools and these provide a high-level overview of a program. The advantages of such a design tool are that it yields a design specification understandable to non-programmers and provides a good pictorial display of the module dependencies.
A disadvantage is that it may be difficult for software developers to go from a graphic-oriented representation of software design to implementation. Therefore, it is necessary to provide little insight into the algorithmic structure describing procedural steps to facilitate the early stages of software development, generally using Program Design Languages (PDLs).
Purpose
The goal of LLD or a low-level design document (LLDD) is to give the internal logical design of the actual program code. Low-level design is created based on the high-level design. LLD describes the class diagrams with the methods and relations between classes and program specs. It describes the modules so that the |
https://en.wikipedia.org/wiki/Spatiotemporal%20pattern | Spatiotemporal patterns are patterns that occur in a wide range of natural phenoma and are characterized by a spatial and temporal patterning. The general rules of pattern formation hold. In contrast to "static", pure spatial patterns, the full complexity of spatiotemporal patterns can only be recognized over time. Any kind of traveling wave is a good example of a spatiotemporal pattern. Besides the shape and amplitude of the wave (spatial part), its time-varying position (and possibly shape) in space is an essential part of the entire pattern.
The distinction between spatial and spatio-temporal patterns in nature is not clear-cut because a static, invariable pattern will never occur in the strict sense. Even rock formations will slowly change on a time-scale of tens of millions of years, therefore the distinction lies in the time scale of change in relation to human experience. Already the snapshot state of a dune will usually be taken as an example of a purely spatial pattern although this is clearly not the case. It is thus apt to say that spatiotemporal patterns in nature are the rule rather than the exception.
Physics
Many hydrodynamical systems show s.t. pattern formation:
Rayleigh–Bénard convection
Taylor–Couette flow
Liquid crystal instabilities
Chemistry
Any type of reaction–diffusion system that produces spatial patterns will also, due to the time-dependency of both reactions and diffusion, produce spatiotemporal patterns.
Biology
Neurobiology
Neural networks, both artificial and natural, produce a virtually unbounded variety of s.t. patterns, both in sensory perception, learning, thinking and reasoning as well as in spontaneous activity. It has for example been demonstrated that spiral waves, signatures of many excitable systems can occur in neocortical preparations.
Communication
All communication, language, relies on spatiotemporal encoding of information, producing and transmitting sound variations or any type of signal i.e. single building blo |
https://en.wikipedia.org/wiki/Terrorpods | Terrorpods is a 1987 shooting game with simple business simulation by Psygnosis. Originally developed for the Amiga and Atari ST, it was later ported to the Commodore 64, ZX Spectrum, Amstrad CPC and MSX.
The game casts the player as an industrial spy in a science fiction future, assigned to halt an evil Empire's production of fearsome war machines called Terrorpods. To win the game, the player must manage colonies with specialised industries to produce a Terrorpod of their own, while fighting off enemy forces like in a traditional shooting game.
The appearance of the Terrorpods was conceived from a rejected design by Psygnosis cover artist Roger Dean for the Martian fighters in Jeff Wayne's Musical Version of The War of the Worlds.
Gameplay
The player views the action in Terrorpods from the cockpit of his DSV (Defence Strategy Vehicle), which consumes fuel as it travels around the game world, a crater on the planet Colian. In the crater are ten mining colonies, which the player must defend and trade minerals with. The enemy forces comprise destructible Terrorpods and Spoilers roaming the world, and an indestructible mothership that hovers overhead and periodically shoots at the player.
The player's prime objective is to use the DSV to trade resources between the ten colonies, building up their mineral resources so they can each build one part of a Terrorpod. There are five minerals: fuel, "detonite", "quanza", "zenite" and "aluma". The former four are used for fuel and weapons, and the latter is required to build Terrorpod parts. Colonies tend to specialize in the production of a single mineral, which the player can buy and then sell for a profit at a colony where that resource is scarce. To contact a colony for trading, the player must dispatch his "trading drover" vehicle or drive there in the DSV. The drover is useful because, unlike the DSV, it does not consume fuel when traveling.
Spoilers steal minerals from the colonies, and can be shot down with a pha |
https://en.wikipedia.org/wiki/Monster%20Hunter%20Generations | Monster Hunter Generations is an action role-playing game developed and published by Capcom for the Nintendo 3DS. Announced in May 2015, the game was released in Japan as Monster Hunter X in November 2015 and internationally in July 2016. Like other titles in the Monster Hunter series, players undertake quests that involve hunting large dangerous creatures, either solo or in multiplayer. Major additions in this installment include special attacks, new combat styles, and the ability to play as Felynes who have traditionally only appeared as a companion to the player. Although it retains the core gameplay of previous mainline entries, Monster Hunter Generations is considered a spinoff title according to the developers. An expanded version of the game, titled Monster Hunter XX, was announced in October 2016, and was released exclusively in Japan in March 2017. An HD port of the expanded rerelease for the Nintendo Switch, titled Monster Hunter Generations Ultimate, was released in Japan in August 2017 followed by a worldwide release in August 2018. The game has sold more than units worldwide, .
Gameplay
Monster Hunter Generations features gameplay similar to past titles in the series. The player assumes the role of a hunter who embarks on quests to hunt dangerous creatures. A hunter's abilities are determined by the type of armor and weapons that they wear on a quest, as the hunter otherwise has no intrinsic attributes that affect gameplay. All fourteen weapon types from Monster Hunter 4 Ultimate, ranging from swords, hammers, bows, guns, and lances, are included in Monster Hunter Generations, in addition to the new Prowler mode which allows the player to take the role of a Felyne, a sentient cat-like species. Each weapon has different sets of moves and abilities that can be employed while in the field. Armors grant defensive bonuses to physical and elemental damage and can boost specific skills and attack types through base attributes and the addition of special de |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.