source stringlengths 31 203 | text stringlengths 28 2k |
|---|---|
https://en.wikipedia.org/wiki/%C3%89tale%20spectrum | In algebraic geometry, a branch of mathematics, the étale spectrum of a commutative ring or an E∞-ring, denoted by Specét or Spét, is an analog of the prime spectrum Spec of a commutative ring that is obtained by replacing Zariski topology with étale topology. The precise definition depends on one's formalism. But the idea of the definition itself is simple. The usual prime spectrum Spec enjoys the relation: for a scheme (S, OS) and a commutative ring A,
where Hom on the left is for morphisms of schemes and Hom on the right ring homomorphisms. This is to say Spec is the right adjoint to the global section functor . So, roughly, one can (and typically does) simply define the étale spectrum Spét to be the right adjoint to the global section functor on the category of "spaces" with étale topology.
Over a field of characteristic zero, K. Behrend constructs the étale spectrum of a graded algebra called a perfect resolving algebra. He then defines a differential graded scheme (a type of a derived scheme) as one that is étale-locally such an étale spectrum.
The notion makes sense in the usual algebraic geometry but appears more frequently in the context of derived algebraic geometry.
Notes
References
Algebraic geometry |
https://en.wikipedia.org/wiki/Pi%20Day%20Die%20Day | Pi Day Die Day is a 2016 horror comedy produced by One Stoplight Productions and Cullen Park Productions that revolves around a group of detectives seeking to thwart the plans of a killer at a local high school on Pi Day. It was directed by Michael E. Cullen II and written by Lindsey LaForest and stars Ari Lehman. Shot on location in Ohio, a fundraising campaign was started on Indiegogo to help supplement the film's budget. The film had its official premiere on March 12, 2016, gathering mixed reviews, and was also released on home media.
Plot
A killer is on the loose at a respectable high school in Euclid Falls, and the principal and a group of detectives must enlist the help of a mathematics teacher to discover the killer's identity and thwart his diabolical plans.
Production
Pie Day Die Day was directed by Michael E. Cullen II, and most of the filming took place in Haskins, Ohio; the film was written by co-producer Lindsey LaForest, who described it as a "slashomedy" (slasher-cum-comedy). Actor Colton Tapp, who stars in the film, also expressed that the film "pays homage to the big teen slashers". The entire cast comprises "local talent" including Tapp and Ari Lehman (Friday the 13th), as well as comedian Steve Sabo, who made a cameo appearance. One Stoplight Productions and Cullen Productions also received an additional $3,970 in funds through the crowdfunding website Indiegogo.
Reception
Pie Day Die Day had a limited release in the United States on March 12, 2016. It premiered at the Cle-Zel Theatre in Bowling Green, and was screened at the Maumee Indoor Theatre two days later on Pi Day. It is also available on DVD. The film was given 2.5 out of 5 stars by Matt Boiselle of Dread Central, who writes that "the schizophrenic mix of both practical and CGI effects" overwhelm the "entertaining" aspects of the film. "Reverend Leviathan", writing for the web magazine DarkestMagazine Goth, gave the film a positive review, lauding in particular the "tongue-in-cheek hum |
https://en.wikipedia.org/wiki/Morphism%20of%20algebraic%20stacks | In algebraic geometry, given algebraic stacks over a base category C, a morphism of algebraic stacks is a functor such that .
More generally, one can also consider a morphism between prestacks; (a stackification would be an example.)
Types
One particular important example is a presentation of a stack, which is widely used in the study of stacks.
An algebraic stack X is said to be smooth of dimension n - j if there is a smooth presentation of relative dimension j for some smooth scheme U of dimension n. For example, if denotes the moduli stack of rank-n vector bundles, then there is a presentation given by the trivial bundle over .
A quasi-affine morphism between algebraic stacks is a morphism that factorizes as a quasi-compact open immersion followed by an affine morphism.
Notes
References
Stacks Project, Ch, 83, Morphisms of algebraic stacks
Algebraic geometry |
https://en.wikipedia.org/wiki/Esso%20Research%20Centre | The Esso Research Centre was a research centre in Oxfordshire.
History
The site was Esso's main European technical centre for fuels and lubricants. The site was extended in 1957. Operations ceased in the early 2000s.
Structure
The site had the staff of Esso Research, with around 500 scientists and engineers.
Function
It conducted research into chemistry.
Location
It was situated on the western side of the A4130 (the original A34 trunk route) on Milton Hill, above Steventon, Oxfordshire. On disposal the site was split in two, between the headquarters of Infineum and the Milton Hill Business and Technology Centre. By 2018 the site had been cleared.
External links
Photos of pump/water tower in 2018 and 2013.
References
Engineering research institutes
Earth science research institutes
History of the petroleum industry in the United Kingdom
Petroleum organizations
Research institutes in Oxfordshire
Vale of White Horse
Energy research institutes
2000s disestablishments in England
ExxonMobil buildings and structures |
https://en.wikipedia.org/wiki/James%20B.%20Saxe | James Benjamin Saxe is an American computer scientist who has worked for many years at the DEC Systems Research Center and its successors, the Compaq Systems Research Center and the Systems Research Center of HP Labs.
Saxe is known for his highly-cited publications on
automated theorem proving,
circuit complexity,
retiming in synchronous circuit design,
computer networks,
and static program analysis.
His work on program analysis from PLDI 2002 won the Most Influential PLDI Paper Award for 2012.
In addition, he is one of the authors of the master theorem for divide-and-conquer recurrences.
While a high school student, Saxe won the United States of America Mathematical Olympiad.
In 1974, as a student at Union College, Saxe took part in the William Lowell Putnam Mathematical Competition; his place in the top five scores earned him a Putnam Fellowship.
He graduated from Union College in 1976,,
and earned his Ph.D. in 1985 from Carnegie Mellon University, under the supervision of Jon Bentley.
Selected publications
References
Year of birth missing (living people)
Living people
American computer scientists
Union College (New York) alumni
Carnegie Mellon University alumni
Putnam Fellows
Scientists from New York (state) |
https://en.wikipedia.org/wiki/Jacobi%20transform | In mathematics, Jacobi transform is an integral transform named after the mathematician Carl Gustav Jacob Jacobi, which uses Jacobi polynomials as kernels of the transform
.
The Jacobi transform of a function is
The inverse Jacobi transform is given by
Some Jacobi transform pairs
References
Integral transforms
Mathematical physics |
https://en.wikipedia.org/wiki/Laguerre%20transform | In mathematics, Laguerre transform is an integral transform named after the mathematician Edmond Laguerre, which uses generalized Laguerre polynomials as kernels of the transform.
The Laguerre transform of a function is
The inverse Laguerre transform is given by
Some Laguerre transform pairs
References
Integral transforms
Mathematical physics |
https://en.wikipedia.org/wiki/Lawbot | Lawbots are a broad class of customer-facing legal AI applications that are used to automate specific legal tasks, such as document automation and legal research. The terms robot lawyer and lawyer bot are used as synonyms to lawbot. A robot lawyer or a robo-lawyer refers to a legal AI application that can perform tasks that are typically done by paralegals or young associates at law firms. However, there is some debate on the correctness of the term. Some commentators say that legal AI is technically speaking neither a lawyer nor a robot and should not be referred to as such. Other commentators believe that the term can be misleading and note that the robot lawyer of the future won't be one all-encompassing application but a collection of specialized bots for various tasks.
Lawbots use various artificial intelligence techniques or other intelligent systems to limit humans' direct ongoing involvement in certain steps of a legal matter. The user interfaces on lawbots vary from smart searches and step-by-step forms to chatbots. Consumer and enterprise-facing lawbot solutions often do not require direct supervision from a legal professional. Depending on the task, some client-facing solutions used at law firms operate under an attorney supervision.
Levels of autonomy
Following levels of autonomy (LoA) are suggested for automated AI legal reasoning:
Level 0 (LoA0): No Automation for AI Legal Reasoning
Level 1 (LoA1): Simple Assistance Automation for AI Legal Reasoning
Level 2 (LoA2): Advanced Assistance Automation for AI Legal Reasoning
Level 3 (LoA3): Semi-Autonomous Automation for AI Legal Reasoning
Level 4 (LoA4): Domain Autonomous for AI Legal Reasoning
Level 5 (LoA5): Fully Autonomous for AI Legal Reasoning
Level 6 (LoA6): Superhuman Autonomous for AI Legal Reasoning
Examples
Some legal AI solutions are developed and marketed directly to the customers or consumers, whereas other applications are tools for the attorneys at law firms. There are already hundreds of |
https://en.wikipedia.org/wiki/DEC%20Special%20Graphics | DEC Special Graphics is a 7-bit character set developed by Digital Equipment Corporation. This was used very often to draw boxes on the VT100 video terminal and the many emulators, and used by bulletin board software. The designation escape sequence (hexadecimal ) switched the codes for lower-case ASCII letters to draw this set, and the sequence (hexadecimal ) switched back. IBM calls it Code page 1090.
Character set
See also
Box-drawing character
DEC Multinational Character Set (MCS)
DEC National Replacement Character Set (NRCS)
DEC Technical Character Set
DEC VT100
Footnotes
References
External links
Video of real VT100 and animation made with DEC Special Graphics
Character sets
Digital Equipment Corporation |
https://en.wikipedia.org/wiki/Good%20spanning%20tree | In the mathematical field of graph theory, a good spanning tree of an embedded planar graph is a rooted spanning tree of whose non-tree edges satisfy the following conditions.
there is no non-tree edge where and lie on a path from the root of to a leaf,
the edges incident to a vertex can be divided by three sets and , where,
is a set of non-tree edges, they terminate in red zone
is a set of tree edges, they are children of
is a set of non-tree edges, they terminate in green zone
Formal definition
Let be a plane graph. Let be a rooted spanning tree of . Let be the path in from the root to a vertex . The path divides the children of , , except , into two groups; the left group and the right group . A child of is in group and denoted by if the edge appears before the edge in clockwise ordering of the edges incident to when the ordering is started from the edge . Similarly, a child of is in the group and denoted by if the edge appears after the edge in clockwise order of the edges incident to when the ordering is started from the edge . The tree is called a good spanning tree of if every vertex of satisfies the following two conditions with respect to .
[Cond1] does not have a non-tree edge , ; and
[Cond2] the edges of incident to the vertex excluding can be partitioned into three disjoint (possibly empty) sets and satisfying the following conditions (a)-(c)
(a) Each of and is a set of consecutive non-tree edges and is a set of consecutive tree edges.
(b) Edges of set , and appear clockwise in this order from the edge .
(c) For each edge , is contained in , , and for each edge , is contained in , .
Applications
In monotone drawing of graphs, in 2-visibility representation of graphs.
Finding good spanning tree
Every planar graph has an embedding such that contains a good spanning tree. A good spanning tree and a suitable embedding can be found from in linear-time. Not all embeddings of con |
https://en.wikipedia.org/wiki/ISO-IR-68 | The APL Character Set for Workspace Interchange, registered for use with ISO/IEC 2022 as ISO-IR-68, is a character set developed by the APL Working Group of the Canadian Standards Association. IBM calls it Code page 371. It is one of several APL code pages used for the syntax and symbols used by the APL programming language.
Character set
Composite characters
The encoding intends that certain of the above characters should be able to be represented at the same character position to produce additional symbols required for APL as composite characters, such as the following:
References
Character sets
APL programming language family |
https://en.wikipedia.org/wiki/List%20of%20Bangladeshi%20engineers | This is a list of notable Bangladeshi Engineers.
F
Fazlur Rahman Khan
I
Iqbal Mahmud
J
Jamilur Reza Choudhury
K
Khondkar Siddique-e-Rabbani
M
Muhammad M. Hussain
M. Rezwan Khan
Mahmudur Rahman
Muhammad Shahid Sarwar
S
Sunny Sanwar
Md Sanwar Hossain
R
Riaz Mahmud
engineers |
https://en.wikipedia.org/wiki/Proper%20reference%20frame%20%28flat%20spacetime%29 | A proper reference frame in the theory of relativity is a particular form of accelerated reference frame, that is, a reference frame in which an accelerated observer can be considered as being at rest. It can describe phenomena in curved spacetime, as well as in "flat" Minkowski spacetime in which the spacetime curvature caused by the energy–momentum tensor can be disregarded. Since this article considers only flat spacetime—and uses the definition that special relativity is the theory of flat spacetime while general relativity is a theory of gravitation in terms of curved spacetime—it is consequently concerned with accelerated frames in special relativity. (For the representation of accelerations in inertial frames, see the article Acceleration (special relativity), where concepts such as three-acceleration, four-acceleration, proper acceleration, hyperbolic motion etc. are defined and related to each other.)
A fundamental property of such a frame is the employment of the proper time of the accelerated observer as the time of the frame itself. This is connected with the clock hypothesis (which is experimentally confirmed), according to which the proper time of an accelerated clock is unaffected by acceleration, thus the measured time dilation of the clock only depends on its momentary relative velocity. The related proper reference frames are constructed using concepts like comoving orthonormal tetrads, which can be formulated in terms of spacetime Frenet–Serret formulas, or alternatively using Fermi–Walker transport as a standard of non-rotation. If the coordinates are related to Fermi–Walker transport, the term Fermi coordinates is sometimes used, or proper coordinates in the general case when rotations are also involved. A special class of accelerated observers follow worldlines whose three curvatures are constant. These motions belong to the class of Born rigid motions, i.e., the motions at which the mutual distance of constituents of an accelerated body or co |
https://en.wikipedia.org/wiki/Amstrad%20CP/M%20Plus%20character%20set | The Amstrad CP/M Plus character set (alternatively known as PCW character set or ZX Spectrum +3 character set) is any of a group of 8-bit character sets introduced by Amstrad/Locomotive Software for use in conjunction with their adaptation of Digital Research's CP/M Plus on various Amstrad CPC / Schneider CPC and Amstrad PCW / Schneider Joyce machines. The character set was also used on the Amstrad ZX Spectrum +3 version of CP/M.
At least on the ZX Spectrum +3 it existed in eight language-specific variants (based on ISO/IEC 646) depending on the selected locale of the system: USA (default), France, Germany, UK, Denmark, Sweden, Italy and Spain.
Another slight variant of the character set was used by LocoScript.
Character set
Language variants
In languages 1 to 7, certain characters in the range 0..127 are swapped with characters in the range 128..255 of the character set, as shown in the following table:
See also
Amstrad CPC character set
ZX Spectrum character set
ISO/IEC 646 (similar, but not identical set of 7-bit character sets)
Box-drawing character
References
Further reading
http://www.cpcwiki.eu/index.php/Amstrad/Schneider_Printer_Character_Sets
http://www.cpcwiki.eu/index.php/Keyboard_Versions#Character_Set_ROMs
Character sets
CP/M technology
ZX Spectrum |
https://en.wikipedia.org/wiki/DEC%20Technical%20Character%20Set | DEC Technical (TCS) is a 7-bit character set developed by Digital Equipment Corporation.
Character set
Characters from 31 to 37 are intended to assemble a 3x5 uppercase sigma.
See also
DEC Multinational Character Set (MCS)
DEC National Replacement Character Set (NRCS)
DEC Special Graphics
Symbol (typeface) § Encoding
References
Further reading
Character sets
Digital Equipment Corporation |
https://en.wikipedia.org/wiki/ISO%202033 | The ISO 2033:1983 standard ("Coding of machine readable characters (MICR and OCR)") defines character sets for use with Optical Character Recognition or Magnetic Ink Character Recognition systems. The Japanese standard JIS X 9010:1984 ("Coding of machine readable characters (OCR and MICR)", originally designated JIS C 6229-1984) is closely related.
Character set for OCR-A
The version of the encoding for the OCR-A font registered with the ISO-IR registry as ISO-IR-91 is the Japanese (JIS X 9010 / JIS C 6229) version, which differs from the encoding defined by ISO 2033 only in the addition of a Yen sign at 5C.
Character set for OCR-B
The version of the G0 set for the OCR-B font registered with the ISO-IR registry as ISO-IR-92 is the Japanese (JIS X 9010 / JIS C 6229) version, which differs from the encoding defined by ISO 2033 only in being based on JIS-Roman (with a dollar sign at 0x24 and a Yen sign at 0x5C) rather than on the ISO 646 IRV (with a backslash at 0x5C and, at the time, a universal currency sign (¤) at 0x24). Besides those code points, it differs from ASCII only in omitting the backtick (`) and tilde (~). An additional supplementary set registered as ISO-IR-93 assigns the pound sign (£), universal currency sign (¤) and section sign (§) to their ISO-8859-1 codepoints, and the backslash to the ISO-8859-1 codepoint for the Yen sign.
Character set for JIS X 9008 (JIS C 6257)
JIS X 9010 (JIS C 6229) also defines character sets for the JIS X 9008:1981 (formerly JIS C 6257-1981) "hand-printed" OCR font. These include subsets of the JIS X 0201 Roman set (registered as ISO-IR-94 and omitting the backtick (`), lowercase letters, curly braces ({, }) and overline (‾)), and kana set (registered as ISO-IR-96 and omitting the East Asian style comma (､) and full stop (｡), the interpunct (･) and the small kana), in addition to a set (registered as ISO-IR-95) containing only the backslash, which is assigned to the same code point as in ISO-IR-93.
The JIS C 6527 fon |
https://en.wikipedia.org/wiki/Wirelesspt | Wirelesspt is a non-commercial open grassroots initiative to support free computer networks that is not dependent of central infrastructure, corporation or entity which is done by the ordinary citizen provide free, open and democratic access to the highways of information technologies helping people and organizations implementing wireless networks that will benefit their communities.
The project also invests in investigating free, open source, digital, information and telecommunication technologies as well as to promote, educate and supply technological information to teach and educate its surrounding social environment about the importance of online privacy and security.
WirelessPT is also part of an international movement for wireless community networks in Europe. The Project counts with local communities and was started in the community of Moitas Venda in Portugal.
Goals
The main goal of WirelessPT is to build a large scale free wireless Wi-Fi network that is decentralized and owned by those who run it and to support local communication. The project is governed by its own agreement which was inspired in the Pico peering Agreement where participants agree upon a network that is free from discrimination and upholds net neutrality. Among other communities like guifi.net and freifunk, WirelessPT has and shares similarities.
Among several goals the project includes:
Development of mesh networks for communities built by the ordinary citizen
Foster free access to communication technologies
Establish wireless connectivity with other communities and regions
Sharing and developing technological communication resources with and for their communities
Promote, educate and provide technical information on wireless networks to communities environment about the importance of online privacy, security and democracy.
Technology
Like many other free community-driven networks, Wirelesspt uses mesh technology to bring up ad hoc networks by interconnecting multiple Wireles |
https://en.wikipedia.org/wiki/Nested%20sequent%20calculus | In structural proof theory, the nested sequent calculus is a reformulation of the sequent calculus to allow deep inference.
References
Proof theory
Logical calculi |
https://en.wikipedia.org/wiki/Ugeoji | In Korean cuisine, ugeoji () is outer leaves or stems of cabbage, radish, and other greens, which are removed while trimming the vegetables.
Ugeoji is often used in soups and stews, including haejang-guk (hangover soup).
Gallery
See also
Siraegi – dried radish greens
References
Food ingredients
Korean cuisine |
https://en.wikipedia.org/wiki/Microsoft%20Stream | Microsoft Stream is a corporate video-sharing service which was released on June 20, 2017 that replaced the existing Office 365 Video.
In 2021 Microsoft announced Stream would be re-platformed onto SharePoint and fully integrated into Office 365. Several new capabilities were announced and introduced during 2021 and 2022. These include new Stream web and mobile apps, integration of videos into Microsoft Search, automatic transcription in multiple languages, viewer analytics and video chapters.
See also
Microsoft mobile services
MSN Soapbox
Bing Videos
References
Microsoft Office-related software
Video
Collaborative software
2017 software
Android (operating system) software |
https://en.wikipedia.org/wiki/Fractional%20Laplacian | In mathematics, the fractional Laplacian is an operator, which generalizes the notion of Laplacian spatial derivatives to fractional powers.
Definition
For , the fractional Laplacian of order s can be defined on functions as a Fourier multiplier given by the formula
where the Fourier transform of a function is given by
More concretely, the fractional Laplacian can be written as a singular integral operator defined by
where . These two definitions, along with several other definitions, are equivalent.
Some authors prefer to adopt the convention of defining the fractional Laplacian of order s as (as defined above), where now , so that the notion of order matches that of a (pseudo-)differential operator.
See also
Fractional calculus
Nonlocal operator
Riemann-Liouville integral
References
External links
"Fractional Laplacian". Nonlocal Equations Wiki, Department of Mathematics, The University of Texas at Austin.
Fractional calculus |
https://en.wikipedia.org/wiki/Thomas%20Fantet%20de%20Lagny | Thomas Fantet de Lagny (7 November 1660 – 11 April 1734) was a French mathematician, well known for his contributions to computational mathematics, and for calculating π to 112 correct decimal places.
Biography
Thomas Fantet de Lagny was son of Pierre Fantet, a royal official in Grenoble, and Jeanne d'Azy, the daughter of a physician from Montpellier.
He entered a Jesuit College in Lyon, where he became passionate about mathematics, as he studied some mathematical texts such as Euclid by Georges Fournier and an algebra text by Jacques Pelletier du Mans. Then he studied three years in the Faculty of Law in Toulouse.
In 1686, he went to Paris and became a mathematics tutor to the Noailles family. He collaborated with de l'Hospital under the name of de Lagny, and at that time he started publishing his first mathematical papers.
He came back to Lyon when, on 11 December 1695, he was named an associate of the Académie Royale des Sciences. Then, in 1697, he became professor of hydrography at Rochefort for 16 years.
De Lagny returned to Paris in 1714, and became a librarian at the Bibliothèque du roi, and a deputy director of the Banque Générale between 1716 and 1718. On 7 July 1719, he was awarded a pension by the Académie Royale des Sciences, finally earning his living from science. In 1723, he became a pensionnaire at the academy, replacing Pierre Varignon who died in 1722, but had to retire in 1733.
De Lagny died on 11 April 1734. While he was dying, someone asked him: "What is the square of 12?" and he answered immediately: "144."
Computing π
In 1719, de Lagny calculated π to 127 decimal places, using Gregory's series for arctangent, but only 112 decimals were correct. This remained the record until 1789, when Jurij Vega calculated 126 correct digits of π.
Bibliography
Méthode nouvelle infiniment générale et infiniment abrégée pour l’extraction des racines quarrées, cubiques... (Paris, 1691)
Méthodes nouvelles et abrégées pour l’extraction et l’approximat |
https://en.wikipedia.org/wiki/Ruby%20syntax | The syntax of the Ruby programming language is broadly similar to that of Perl and Python. Class and method definitions are signaled by keywords, whereas code blocks can be defined by either keywords or braces. In contrast to Perl, variables are not obligatorily prefixed with a sigil. When used, the sigil changes the semantics of scope of the variable. For practical purposes there is no distinction between expressions and statements. Line breaks are significant and taken as the end of a statement; a semicolon may be equivalently used. Unlike Python, indentation is not significant.
One of the differences from Python and Perl is that Ruby keeps all of its instance variables completely private to the class and only exposes them through accessor methods (attr_writer, attr_reader, etc.). Unlike the "getter" and "setter" methods of other languages like C++ or Java, accessor methods in Ruby can be created with a single line of code via metaprogramming; however, accessor methods can also be created in the traditional fashion of C++ and Java. As invocation of these methods does not require the use of parentheses, it is trivial to change an instance variable into a full function without modifying a single line of calling code or having to do any refactoring achieving similar functionality to C# and VB.NET property members.
Python's property descriptors are similar, but come with a trade-off in the development process. If one begins in Python by using a publicly exposed instance variable, and later changes the implementation to use a private instance variable exposed through a property descriptor, code internal to the class may need to be adjusted to use the private variable rather than the public property. Ruby's design forces all instance variables to be private, but also provides a simple way to declare set and get methods. This is in keeping with the idea that in Ruby one never directly accesses the internal members of a class from outside the class; rather, one passes a |
https://en.wikipedia.org/wiki/SQL%20syntax | The syntax of the SQL programming language is defined and maintained by ISO/IEC SC 32 as part of ISO/IEC 9075. This standard is not freely available. Despite the existence of the standard, SQL code is not completely portable among different database systems without adjustments.
Language elements
The SQL language is subdivided into several language elements, including:
Keywords are words that are defined in the SQL language. They are either reserved (e.g. , and ), or non-reserved (e.g. , and ). List of SQL reserved words.
Identifiers are names on database objects, like tables, columns and schemas. An identifier may not be equal to a reserved keyword, unless it is a delimited identifier. Delimited identifiers means identifiers enclosed in double quotation marks. They can contain characters normally not supported in SQL identifiers, and they can be identical to a reserved word, e.g. a column named is specified as .
In MySQL, double quotes are string literal delimiters by default instead. Enabling the SQL mode enforces the SQL standard behavior. These can also be used regardless of this mode through backticks: .
Clauses, which are constituent components of statements and queries. (In some cases, these are optional.)
Expressions, which can produce either scalar values, or tables consisting of columns and rows of data
Predicates, which specify conditions that can be evaluated to SQL three-valued logic (3VL) (true/false/unknown) or Boolean truth values and are used to limit the effects of statements and queries, or to change program flow.
Queries, which retrieve the data based on specific criteria. This is an important element of SQL.
Statements, which may have a persistent effect on schemata and data, or may control transactions, program flow, connections, sessions, or diagnostics.
SQL statements also include the semicolon (";") statement terminator. Though not required on every platform, it is defined as a standard part of the SQL grammar.
Insignificant |
https://en.wikipedia.org/wiki/Sega%20Forever | Sega Forever is a service from the Japanese video game developer Sega for re-releasing past games from the company on modern platforms. The service was launched for Android and iOS devices on June 22, 2017. By 2020, the service included over 30 games.
Background
Sega Forever is a service by Sega to re-release their previously developed video games on Android and iOS-based platforms. Games included on the service are free to play, although they display with advertisements that can be permanently disabled per-game by purchasing them. Game types vary between releases—while some are direct ports, others are emulated versions of the originals. While Sega stated that mobile devices were the initial focus for the service, they also stated it may also expand to other platforms in the future, such as PC and video game consoles. Similar to Nintendo's strategy of using mobile games and apps to attract attention to their console games, Sega hopes to release games to not only to promote their console games, but also to monitor game usage and use it as a metric to determine which franchises to make new games with in the future as well. The end-goal is to eventually create a service similar to Netflix for their games.
Games
The initial wave of games were from Sega's Genesis/Mega Drive console, with the service later adding games from the Dreamcast, Sega CD, and arcade. During the testing phases of the system, Sega Saturn and Dreamcast games did not perform satisfactorily, though Sega has on-going R&D efforts working on improving them in hopes of future release. Games such as Panzer Dragoon have been considered for the service, but could not be successfully emulated in the testing phase, meaning that such a release would hypothetically require a lengthy porting process instead. Sega is also open to releasing games that had not previously had English localizations, such as the Yuji Naka-designed game, Girl's Garden.
Games have new features added, such as leaderboards and cloud sa |
https://en.wikipedia.org/wiki/Hyperparameter%20optimization | In machine learning, hyperparameter optimization or tuning is the problem of choosing a set of optimal hyperparameters for a learning algorithm. A hyperparameter is a parameter whose value is used to control the learning process. By contrast, the values of other parameters (typically node weights) are learned.
The same kind of machine learning model can require different constraints, weights or learning rates to generalize different data patterns. These measures are called hyperparameters, and have to be tuned so that the model can optimally solve the machine learning problem. Hyperparameter optimization finds a tuple of hyperparameters that yields an optimal model which minimizes a predefined loss function on given independent data. The objective function takes a tuple of hyperparameters and returns the associated loss. Cross-validation is often used to estimate this generalization performance, and therefore choose the set of values for hyperparameters that maximize it.
Approaches
Grid search
The traditional way of performing hyperparameter optimization has been grid search, or a parameter sweep, which is simply an exhaustive searching through a manually specified subset of the hyperparameter space of a learning algorithm. A grid search algorithm must be guided by some performance metric, typically measured by cross-validation on the training set
or evaluation on a hold-out validation set.
Since the parameter space of a machine learner may include real-valued or unbounded value spaces for certain parameters, manually set bounds and discretization may be necessary before applying grid search.
For example, a typical soft-margin SVM classifier equipped with an RBF kernel has at least two hyperparameters that need to be tuned for good performance on unseen data: a regularization constant C and a kernel hyperparameter γ. Both parameters are continuous, so to perform grid search, one selects a finite set of "reasonable" values for each, say
Grid search then train |
https://en.wikipedia.org/wiki/ISO/IEC%2010367 | ISO/IEC 10367:1991 is a standard developed by ISO/IEC JTC 1/SC 2, defining graphical character sets for use in character encodings implementing levels 2 and 3 of ISO/IEC 4873 (as opposed to ISO/IEC 8859, which defines character encodings at level 1 of ISO/IEC 4873).
Relationship to ISO/IEC 8859
The parts of ISO/IEC 8859 define complete encodings at level 1 of ISO/IEC 4873 (i.e., as stateless extended ASCII single-byte encodings, reserving the C1 area), and do not allow for use of multiple parts together. For use at levels 2 and 3 of ISO/IEC 4873 (i.e., with shift codes for additional graphical character sets), ISO/IEC 8859 stipulates that equivalent sets from ISO/IEC 10367 should be used instead.
ISO/IEC 10367:1991 includes ASCII, as well as sets matching the G1 sets used for the right-hand sides (non-ASCII parts) of ISO/IEC 6937 (ITU T.51) and of ISO/IEC 8859 parts 1 through 9 (i.e., those parts that existed as of 1991, when it was published), a set of additional Roman characters supplementing some of those parts, and a set of box drawing characters (shown below).
Supplementary G3 Latin set
ISO/IEC 10367 includes the ISO-IR-154 graphical set, which is intended to supplement Latin alphabets number 1, 2 and 5 (i.e., ISO-8859-1, ISO-8859-2 and ISO-8859-9). Specifically, it is intended for use as a G3 set in a profile of ISO/IEC 4873 in which the G1 and G2 sets include the right hand side of ISO-8859-2, and also that of either ISO-8859-1 or ISO-8859-9. These configurations represent the entire ISO/IEC 6937 repertoire (ITU T.51 Annex A) without non-spacing codes.
For instance, the letter Ĉ would be encoded under ISO/IEC 4873 level 2 as 0x8F 0x23 if this set is included.
Highlighted characters also appear in ISO-8859-1 or ISO-8859-9. Under the current edition of ISO/IEC 4873 / ECMA-43 (though not earlier editions), characters must be used from the lowest-numbered working set they appear in, hence those characters are not used from this G3 set when the respective |
https://en.wikipedia.org/wiki/List%20of%20Kiosk%20software | This is a list of Kiosk software. The list includes kiosk-exclusive software as well as Mobile Device Management software with kiosk features.
General information
References
Kiosks
Mobile device management
Windows security software
Kiosk |
https://en.wikipedia.org/wiki/Fort%20de%20Montessuy | The Fort de Montessuy is a fort in the first belt of fortifications in Lyon, located in the neighborhood of Montessuy in Caluire-et-Cuire, Rhône, France.
History
Built in 1831, it was linked to Fort de Caluire, its less imposing twin, by an enclosure aligned with île Barbe, protecting Lyon and particularly Croix-Rousse from invaders coming up the road from the Dombes.
From the north bank of the Rhône, it defended the river and the Fort des Brotteaux.
North was considered dangerous, so a large ravelin was built before the fort in this direction, as well as a lunette further out.
When the Germans were leaving Caluire-et-Cuire on 24 August 1944, two children, Jean Turba (1930 - 1944) and Bernadette Choux (1931 - 1944) watched their departure through field-glasses from the fort de Montessuy; soldiers still posted across the Rhône fired on them with machine guns, killing them both. A street in Montessuy was named after the children (allée Turba-et-Choux). On the wall of the école d'Application Jean-Jaurès de Caluire (a public grade school on the place Jules-Ferry opened on October 1, 1933), a plaque commemorates Jean Turba and two 1944 other victims of the Nazis, also former students at the school.
Current use
The fort still exists in Caluire-et-Cuire, dans le quartier Montessuy, and has been owned by the municipality since 1972. Its moats have been covered over by fill dirt from the excavations for the construction of the new buildings now at the heart of the Montessuy neighborhood. Vegetation is slowly invading the fort. The tops of a few scarps remain visible, emerging from the ground, as well as a ''dame'', a column of stone that prevented attackers from walking along the top of the enclosure.
It isn't possible to visit the fort, but a few nonprofits have taken up residence in the only surviving building, the barracks, such as AS Caluire - Tir à l'arme de poing or AS Pétanque Caluire. The exterior of the fort has been transformed into green space; there is |
https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Tetali%20theorem | In additive number theory, an area of mathematics, the Erdős–Tetali theorem is an existence theorem concerning economical additive bases of every order. More specifically, it states that for every fixed integer , there exists a subset of the natural numbers satisfying
where denotes the number of ways that a natural number n can be expressed as the sum of h elements of B.
The theorem is named after Paul Erdős and Prasad V. Tetali, who published it in 1990.
Motivation
The original motivation for this result is attributed to a problem posed by S. Sidon in 1932 on economical bases. An additive basis is called economical (or sometimes thin) when it is an additive basis of order h and
for every . In other words, these are additive bases that use as few numbers as possible to represent a given n, and yet represent every natural number. Related concepts include -sequences and the Erdős–Turán conjecture on additive bases.
Sidon's question was whether an economical basis of order 2 exists. A positive answer was given by P. Erdős in 1956, settling the case of the theorem. Although the general version was believed to be true, no complete proof appeared in the literature before the paper by Erdős and Tetali.
Ideas in the proof
The proof is an instance of the probabilistic method, and can be divided into three main steps. First, one starts by defining a random sequence by
where is some large real constant, is a fixed integer and n is sufficiently large so that the above formula is well-defined. A detailed discussion on the probability space associated with this type of construction may be found on Halberstam & Roth (1983). Secondly, one then shows that the expected value of the random variable has the order of log. That is,
Finally, one shows that almost surely concentrates around its mean. More explicitly:
This is the critical step of the proof. Originally it was dealt with by means of Janson's inequality, a type of concentration inequality for multivariate p |
https://en.wikipedia.org/wiki/European%20Young%20Engineers | The European Young Engineers (EYE) is a European non-profit organisation, listed in the register of Engineering associations of the World Federation of Engineering Associations.
History
Young members of the European engineers’ organisations created a pan-European platform and founded the European Young Engineers (EYE) in 1994. During the following years several engineering associations in Europe were invited to join.
EYE became an organisation consisting of more than 23 associations and representing approximately more than 250.000 young engineers in Europe. EYE started to offer its member organisations and their students and young engineers the access to a Europe-wide network by linking the engineering associations.
EYE offers a member-hosted conference. Between these events, the community stays in contact via their website.
In 2007 the European Young Engineers signed a Memorandum of Cooperation with FEANI.
List of member organisations
References
Engineering societies
International scientific organizations based in Europe
Organisations based in Brussels
Organizations established in 1994
Youth science |
https://en.wikipedia.org/wiki/2006%20Soviet%20war%20documents%20declassification | In 2006, the Russian Ministry of Defence declassified about a hundred pages of archived documents concerning Soviet preparedness for the German invasion on 22 June 1941 at the Eastern Front of World War II. On 22 June 2017 the Ministry published them online on a subdomain of its official website, stating that they had never been published before. The documents from the early 1950s were authored by Soviet military commanders of various ranks at the request of a fact-finding panel. The online publication was made on the 76th anniversary of Operation Barbarossa.
Background
The documents coming from the Central Archive of the Russian Ministry of Defence were written mostly by seven Soviet military commanders (Pyotr Sobennikov, Pavel Abramidze, Mikhail Zashibalov, Nikolai Ivanov, Ivan Bagramian, Boris Fomin and Kuzma Derevyanko) at the request of the fact-finding panel of the Military History Department of the General Staff of the Soviet Army. Headed by Colonel General Alexander Pokrovsky, the panel was formed in 1952 and put five questions about the preparedness of the Baltic, Kiev and Belorussian military districts. The questions concerned the receipt of the border defence plan by the Soviet troops, the deployment of covering forces on the state border, the receipt of the order on combat readiness, the reason why the majority of Soviet artillery units were in training camps and the preparedness of the unit staffs for troops management. The questions were addressed to persons who on the eve of Operation Barbarossa held high-ranking military positions, down to division and corps commanders. At that time, Sobennikov was the commander of the 8th Army of the Baltic Military District staff. Abramidze was the commander of the 72nd Rifle Division of the 26th Army. Zashibalov was the commander of the 86th Rifle Division of the 10th Army. Ivanov was the chief of staff of the Kiev Military District's 6th Army. Bagramian was the chief of operations staff of the Kiev Military Dis |
https://en.wikipedia.org/wiki/Facebook%20Stories | Facebook Stories are short user-generated photo or video collections that can be uploaded to the user's Facebook. Facebook Stories were created on March 28, 2017. They are considered a second news feed for the social media website. It is focused around Facebook's in-app camera which allows users to add fun filters and Snapchat-like lenses to their content as well as add visual geolocation tags to their photos and videos. The content is able to be posted publicly on the Facebook app for only 24 hours or can be sent as a direct message to a Facebook friend.
"As people mostly post photos and videos, Stories is the way they’re going to want to do it," says Facebook Camera product manager Connor Hayes, noting Facebook's shift away from text status updates after ten years as its primary sharing option. "Obviously we’ve seen this doing very well in other apps. Snapchat has really pioneered this," explained Hayes. Facebook has seen much success through other applications like Snapchat and Instagram, especially since Facebook bought Instagram for $1 billion in 2012.
History
After the many failed attempts of trying to incorporate Snapchat-like features on Facebook, (date=January 2018) the company decided to test run Messenger Day. In 2016, Facebook created a feature called Messenger Day, which allowed users to post videos and pictures with filters for 24 hours only. This project was only used in Poland because of the unpopularity of Snapchat in that region. Users are able to add texts and colorful graphics. However, this was only a test for Facebook to be later turned into a feature on Facebook's app.
Facebook's introduction of the Story function may have been in response to the wider success of Instagram Story advertising over the advertising on Facebook Wall; Instagram Story ads were found to be more successful than Facebook Wall advertising in all demographics aside from non-millennial men.
Popularity and criticism
, Facebook Stories is much less popular among socia |
https://en.wikipedia.org/wiki/IGap | iGap is a free Iranian instant messaging application for smart phones and personal computers. iGap allows users to interact with each other and exchange information through text, image, video, audio and other types of messages. iGap also supports P2P-based voice calls over the internet.
iGap is developed for Android, iOS and Windows.
Open-source Clients
iGap has published the source code of its Android and iOS client on GitHub. However, back-end source code is proprietary software.
Response
Supreme leader of Iran Ali Khamenei referred to this messenger on his personal website. and
Mohammad-Javad Azari Jahromi as the ICT Minister of Iran has joined this messaging application in September 2017 in order to support local social networking.
Earlier, the Minister has claimed to support local Messengers when he was deputy of the ICT Minister.
External links
iGap in App Store
iGap in Google Play
References
2015 software
Communication software
Cross-platform software
Instant messaging clients
IOS software
Secure communication
Free security software
Free instant messaging clients
Free and open-source Android software
2015 establishments in Iran
Communications in Iran |
https://en.wikipedia.org/wiki/GESTIS%20Substance%20Database | GESTIS Substance Database is a freely accessible online information system on chemical compounds. It is maintained by the Institut für Arbeitsschutz der Deutschen Gesetzlichen Unfallversicherung (IFA, Institute for Occupational Safety and Health of the German Social Accident Insurance). Information on occupational medicine and first aid is compiled by Henning Heberer and his team (TOXICHEM, Leuna).
The database contains information for the safe handling of hazardous substances and other chemical substances at work:
toxicology/ecotoxicology
important physical and chemical properties
application and handling
health effects
protective measures and such in case of danger (incl. first aid)
special regulations e.g. GHS classification and labelling according to CLP Regulation (pictograms, H phrases, P phrases).
The available information relates to about 9,400 substances. Data are updated immediately after publication of new official regulations or after the issue of new scientific results.
A mobile version of the GESTIS Substance Database, suitable for smartphones and tablets, is also available.
References
Literature
External links
GESTIS Substance Database
Online databases
Occupational safety and health |
https://en.wikipedia.org/wiki/KOI8-T | KOI8-T is an 8-bit single-byte extended ASCII character encoding adapting KOI8 to cover the Tajik Cyrillic alphabet. It was introduced by Michael Davis as an interim solution for representing Tajiki Cyrillic text in an interchangeable manner appropriate for use on the web, in an attempt to bridge the gap between existing non-interoperable font-specific encodings and the eventual wide adoption of Unicode. It is used by the GNU C Library as its default encoding for Tajik.
The Cyrillic letters that are also used in Russian are encoded according to the KOI8-R layout, making the encoding a KOI8-B superset, whereas the punctuation mostly follows the layout in Windows-1251 and Windows-1252 as applicable.
Character set
See also
Mac OS Turkic Cyrillic, encodes Tajik amongst other languages.
References
Character sets |
https://en.wikipedia.org/wiki/OMS%20encoding | OMS (aka TeX math symbol) is a 7-bit TeX encoding developed by Donald E. Knuth. It encodes mathematical symbols with variable sizes like for capital Pi notation, brackets, braces and radicals.
Character set
See also
OML encoding
OT1 encoding
References
Character sets |
https://en.wikipedia.org/wiki/DNA-OS | DNA-OS is a French-made operating system to supersede MutekA, an obsolete operating system, while still providing POSIX thread API. As said on the SoCLib website, "It is a kernel-mode lightweight operating system for Multiprocessor System on a Chip. It is built on top of a thin HAL to ease porting on new platforms and processor architecture. DNA/OS does not support virtual memory."
DNA-OS is a layered microkernel operating system, written in C99, released under the GNU GPLv3 license.
Target hardware / software
ARM7, ARM9, Cortex A8/A9
MIPS
Micro Blaze
SparcV8
NiOS
OS flavours
SMP (Symmetric multiprocessing)
DS (Distributed Scheduling)
Associated libraries
Native POSIX Threads
Newlibc
References
Lightweight Unix-like systems
Microkernels |
https://en.wikipedia.org/wiki/OML%20encoding | OML (aka TeX math italic) is a 7-bit TeX encoding developed by Donald E. Knuth. It encodes italic Latin and Greek letters for mathematical formulas and various symbols.
Character set
See also
OMS encoding
OT1 encoding
References
Character sets |
https://en.wikipedia.org/wiki/Euler%E2%80%93Boole%20summation | Euler–Boole summation is a method for summing alternating series based on Euler's polynomials, which are defined by
The concept is named after Leonhard Euler and George Boole.
The periodic Euler functions are
The Euler–Boole formula to sum alternating series is
where and is the kth derivative.
References
Jonathan M. Borwein, Neil J. Calkin, Dante Manna: "Euler–Boole Summation Revisited", The American Mathematical Monthly, Vol. 116, No. 5 (May, 2009), pp. 387–412,
Nico M. Temme: Special Functions: An Introduction to the Classical Functions of Mathematical Physics, Wiley, 2011, , pp. 17–18
Mathematical series
Summability methods |
https://en.wikipedia.org/wiki/31%20great%20circles%20of%20the%20spherical%20icosahedron | In geometry, the 31 great circles of the spherical icosahedron is an arrangement of 31 great circles in icosahedral symmetry. It was first identified by Buckminster Fuller and is used in construction of geodesic domes.
Construction
The 31 great circles can be seen in 3 sets: 15, 10, and 6, each representing edges of a polyhedron projected onto a sphere. Fifteen great circles represent the edges of a disdyakis triacontahedron, the dual of a truncated icosidodecahedron. Six more great circles represent the edges of an icosidodecahedron, and the last ten great circles come from the edges of the uniform star dodecadodecahedron, making pentagrams with vertices at the edge centers of the icosahedron.
There are 62 points of intersection, positioned at the 12 vertices, and center of the 30 edges, and 20 faces of a regular icosahedron.
Images
The 31 great circles are shown here in 3 directions, with 5-fold, 3-fold, and 2-fold symmetry. There are 4 types of right spherical triangles by the intersected great circles, seen by color in the right image.
See also
25 great circles of the spherical octahedron
References
R. Buckminster Fuller, Synergetics: Explorations in the Geometry of Thinking, 1982, pp 183–185.
Edward Popko, Divided Spheres: Geodesics and the Orderly Subdivision of the Sphere, 2012, pp 22–25.
Geodesic domes
Polyhedra
Circles |
https://en.wikipedia.org/wiki/ISO%205426 | ISO 5426 ("Extension of the Latin alphabet coded character set for bibliographic information interchange") is a character set developed by ISO, similar to ISO/IEC 6937. It was first published in 1983.
Character set
ISO 5426-2
ISO 5426-2 ("Latin characters used in minor European languages and obsolete typography") is a second part to ISO 5426, published in 1996. It specifies a set of 70 characters, some of which do not exist in Unicode. Michael Everson proposed the missing characters in Unicode 3.0, but some were postponed for further study. Later, new evidence was found, and more was encoded. P with belt is probably an error for P with flourish.
� Not in Unicode
References
Character sets
5426 |
https://en.wikipedia.org/wiki/Information%20officer | Information officer is the title of the role defined in South Africa's Protection of Personal Information Act (POPIA) to the person responsible for encouraging responsible persons to comply with the principles and conditions for the lawful processing of personal information and assisting data subjects make requests and lodge complaints. The title information officer is synonymous with that of data protection officer established in the General Data Protection Regulation (GDPR). The data protection officer is not the same as that of chief privacy officer in the United States.
The term information officer is not a standard term in EU and USA as it might be confused with chief information officer role.
An information officer’s responsibilities (similar to those of a data protection officer) include:
The encouragement of compliance, by a public or private body, with the principles and conditions for the lawful processing of personal information.
Dealing with requests made to the body by a data subject.
Working with the relevant regulator or supervisory authority.
References
External links
Official South African Government Gazette
General Data Protection Regulation, final version dated 27 April 2016
co. za
Information officer services
Information officer for POPI and PAIA
The role of the information officer
Privacy law
Information privacy
Data laws |
https://en.wikipedia.org/wiki/Electrical%20safety%20standards | Electrical safety is a system of organizational measures and technical means to prevent harmful and dangerous effects on workers from electric current, arcing, electromagnetic fields and static electricity.
History
The electrical safety develops with the technical progress. In 1989 OSHA promulgated a much-needed regulation in the General Industry Regulations. Several standards are defined for control of hazardous energy, or lockout/tagout. In 1995 OSHA was successful in promulgation of regulations for utility.
In 1994 were established Electrical Safety Foundation International non-profit organization dedicated exclusively to promoting electrical safety at home and in the workplace.
Standard 29 CFR 1910.269 – for electric power generation, transmission, and distribution, contained comprehensive regulations and addressed control of hazardous energy sources for power plant locations
Standards are compared with those of IEEE and National Fire Protection Association.
Lightning and earthing protection
Lightning and Earthing protection systems are essential for the protection of humans, structures, protecting buildings from mechanical destruction caused by lightning effects and the associated risk of fire, Transmission lines, and electrical equipment from electric shock and Overcurrent.
Earthing protection systems
TT system
TN system
IT system
Lightning protection systems
lightning rod (simple rod or with triggering system)
lightning rod with taut wires.
lightning conductor with meshed cage (Faraday cage)
Physiological effects of electricity
Electrical shocks on humans can lead to permanent disabilities or death. Size, frequency and duration of the electrical current affect the damage. The effects from electric shock can be: stopping the heart beating properly, preventing the person from breathing, causing muscle spasms. The skin features also affect the consequences of electric shock.
Indirect contact – can be avoided by automatic disconnection for TT syst |
https://en.wikipedia.org/wiki/Banach%20lattice | In the mathematical disciplines of in functional analysis and order theory, a Banach lattice is a complete normed vector space with a lattice order, such that for all , the implication holds, where the absolute value is defined as
Examples and constructions
Banach lattices are extremely common in functional analysis, and "every known example [in 1948] of a Banach space [was] also a vector lattice." In particular:
, together with its absolute value as a norm, is a Banach lattice.
Let be a topological space, a Banach lattice and the space of continuous bounded functions from to with norm Then is a Banach lattice under the pointwise partial order:
Examples of non-lattice Banach spaces are now known; James' space is one such.
Properties
The continuous dual space of a Banach lattice is equal to its order dual.
Every Banach lattice admits a continuous approximation to the identity.
Abstract (L)-spaces
A Banach lattice satisfying the additional condition is called an abstract (L)-space. Such spaces, under the assumption of separability, are isomorphic to closed sublattices of . The classical mean ergodic theorem and Poincaré recurrence generalize to abstract (L)-spaces.
See also
Footnotes
Bibliography
Functional analysis
Order theory |
https://en.wikipedia.org/wiki/Sound%20recognition | Sound recognition is a technology, which is based on both traditional pattern recognition theories and audio signal analysis methods. Sound recognition technologies contain preliminary data processing, feature extraction and classification algorithms. Sound recognition can classify feature vectors. Feature vectors are created as a result of preliminary data processing and linear predictive coding.
Sound recognition technologies are used for:
Music recognition
Speech recognition
Automatic alarm detection and identification for surveillance, monitoring systems, based on the acoustic environment
Assistance to disabled or elderly people affected in their hearing capabilities
Identifying species of animals such as fish and mammals, e.g. in acoustical oceanography
Security
In monitoring and security, an important contribution to alarm detection and alarm verification can be supplied, using sound recognition techniques. In particular, these methods could be helpful for intrusion detection in places like offices, stores, private homes or for the supervision of public premises exposed to person aggression. In all these cases, a recognition system can report about a danger or distress event. It could further identify sounds like glass break, doorbells, smoke detector alarms, red alerts, human screams, baby cries and others. Sometimes, the alarm is triggered by other detectors (e.g. temperature or video-based) and the sound recognizer would be associated with these other modalities, to verify the alarm, with the purpose of decreasing the global false alarm detection rate.
Assistance
Solutions based on a sound recognition technology can offer assistance to disabled and elderly people affected in hearing capabilities, helping them to keep or recover some independence in their daily occupations.
Companies
There are only a handful of companies who are working on sound recognition technology:
AbiliSense (Generic sound recognition technology for a wide variety of use ca |
https://en.wikipedia.org/wiki/Bronchus-associated%20lymphoid%20tissue | Bronchus-associated lymphoid tissue (BALT) is a tertiary lymphoid structure. It is a part of mucosa-associated lymphoid tissue (MALT), and it consists of lymphoid follicles in the lungs and bronchus. BALT is an effective priming site of the mucosal and systemic immune responses.
Structure
BALT is similar in most mammal species, but it differs in its maintenance and inducibility. While it is normal component of lungs and bronchus in rabbits or pigs, in mice or humans it appears only after infection or inflammation. In mice and humans it is thus called inducible BALT (iBALT). BALT and iBALT are structurally and functionally very similar, so in this article only BALT is used for both structures.
BALT is found along the bifurcations of the upper bronchi directly beneath the epithelium and generally lying between an artery and a bronchus. It is also in perivascular, peribronchial and even interstitial areas in the lower airways of the lung. To call it BALT it has to be structured accumulation of lymphocytes and other immune cells. There are lymphoid follicles with apparent germinal centres with most B-cells surrounded by T-cell area. In interfollicular T-cell area, there are many dendritic cells presenting antigen to T-cells and in germinal centres, there are follicular dendritic cells. There are CD4+ Th lymphocytes in germinal centres and interfollicular area and CD8+ T cells mainly in interfollicular area. High endothelial venules (HEVs) are also present in BALT in T/B-cell interface, allowing for the recruitment of naive T cells. These HEV are the only entry site for lymphocytes to migrate into the BALT and leave by efferent lymphatic vessels. In some species, M cells have been described in epithelium above BALT similar to M cells in the dome epithelium of Peyer’s patches, although the dome epithelium is not typical for BALT.
For formation of BALT in mice is necessary inteleukin-17 and VCAM-1, PNAd and LFA-1 and it is lymphotoxin-α independent whereas the develop |
https://en.wikipedia.org/wiki/Eyes%20of%20Things | Eyes of Things (EoT) is the name of a project funded by the European Union’s Horizon 2020 Research and Innovation Programme under grant agreement number 643924. The purpose of the project, which is funded under the Smart Cyber-physical systems topic, is to develop a generic hardware-software platform for embedded, efficient (i.e. battery-operated, wearable, mobile), computer vision, including deep learning inference.
On November 29, 2018, the European Space Agency announced that it was testing the suitability of the device for space applications in advance of a flight in a Cubesat.
Motivation
EoT is based on the following tenets:
Future embedded systems will have more intelligence and cognitive functionality. Vision is paramount to such intelligent capacity
Unlike other sensors, vision requires intensive processing. Power consumption must be optimized if vision is to be used in mobile and wearable applications
Cloud processing of edge-captured images is not sustainable. The sheer amount of visual data generated cannot be transferred to the cloud. Bandwidth is not sufficient and cloud servers cannot cope with it.
Partners
VISILAB group at University of Castilla–La Mancha (Coordinator)
Movidius
Awaiba
Thales Security Solutions & Systems
DFKI
Fluxguide
Evercam
nVISO
Awards
2019 Electronic Component and Systems Innovation Award by the European Commission
2018 HiPEAC Tech Transfer Award
2018 EC Innovation Radar - highlighting excellent innovations Award
2018 Internet of Things (IoT) Technology Research Award Pilot by Google
2016 Semifinalist "THE VISION SHOW STARTUP COMPETITION", Global Association for Vision Information, Boston US
See also
Wearable camera
Computer vision
Internet of Things
Embedded systems
Edge computing
References
Computer vision |
https://en.wikipedia.org/wiki/Forts%20of%20Metz | The forts of Metz are two fortified belts around the city of Metz in Lorraine. Built according to the design and theory of Raymond Adolphe Séré de Rivières at the end of the Second Empire—and later Hans von Biehler while Metz was under German control—they earned the city the reputation of premier stronghold of the German reich. These fortifications were particularly thorough given the city's strategic position between France and Germany. The detached forts and fortified groups of the Metz area were spared in World War I, but showed their full defensive potential in the Battle of Metz at the end of World War II.
Context
Before the invention of rifled artillery, the place de Metz was considered untakeable. In the 19th century, improvements in artillery forced French engineers to conceive a new defensive system around the stronghold of Metz, the first fortified belt. For this work marshal Adolphe Niel allocated a sum of twelve million gold francs, used for four detached advance forts, Saint-Quentin and Plappeville to the west, and the Fort de Saint-Julien and Fort de Queuleu to the east. This measure, conceived by colonel Séré de Rivières, was incomplete when war broke out in 1870.
After the Treaty of Frankfurt, the defenses of Metz were completed by German military engineers, who added seven more forts between 1871 et 1898. These forts, designed by Hans von Biehler, made up the first fortified belt of Metz. The purpose of this first belt was to hold attackers at a distance and keep them away, thus protecting the city from direct enemy fire. The forts could also assist troop maneuvers outside the fort by providing supporting fire.
Because of advances in artillery technology, between 1899 and 1916 the first belt was reinforced by a second, composed of nine fortification groups. Based on new concepts of defense, such as dispersion and dissimulation, the fortification groups were intended to constitute an uncrossable barrier to any attacking French forces. The fortif |
https://en.wikipedia.org/wiki/Gregory%20L.%20Verdine | Gregory L. Verdine (born June 10, 1959) is an American chemical biologist, biotech entrepreneur, venture capitalist and university professor. He is a founder of the field of chemical biology, which deals with the application of chemical techniques to biological systems. His work has focused on mechanisms of DNA repair and cell penetrability.
Verdine is the co-inventor with Christian Schafmeister of stapled peptides, a new class of drugs that combines the versatile binding properties of monoclonal antibodies with the cell-penetrating ability of small molecules. Verdine coined the term "drugging the undruggable" to describe the unique capabilities of stapled peptides. A close analog of a stapled peptide drug invented in the Verdine Lab, ALRN-6924, is a first-in-class dual MDM2/MDMX inhibitor currently in Phase II clinical development by Aileron Therapeutics, which he co-founded in 2005. FogPharma, founded in 2016, aims to further develop stapled peptide technology for therapeutic use.
He has founded numerous other drug discovery companies, including six that are listed on the NASDAQ. His companies have succeeded in developing two FDA-approved drugs, Romidepsin and Paritaprevir, which are, respectively, an anticancer agent used in cutaneous T-cell lymphoma (CTCL) and other peripheral T-cell lymphomas (PTCLs), and an acylsulfonamide inhibitor that is used to treat chronic Hepatitis C.
Education and Training
Verdine received a Bachelor of Science in Chemistry from Saint Joseph's University and a PhD in Chemistry from Columbia University, working under Koji Nakanishi and Maria Tomasz. He held an NIH postdoctoral fellowship in molecular biology at MIT and Harvard Medical School, and joined the faculty of Harvard University in 1988.
Academic career
Over the course of his academic career at Harvard University and the Harvard Medical School, Verdine has elucidated the molecular mechanism of epigenetic DNA methylation and pathways by which certain genotoxic forms of DNA da |
https://en.wikipedia.org/wiki/Braarudosphaera%20bigelowii | Braarudosphaera bigelowii is a coastal coccolithophore in the fossil record going back 100 million years. The family Braarudosphaeraceae are single-celled coastal phytoplanktonic algae with calcareous scales with five-fold symmetry, called pentaliths. With 12 sides, it has a regular dodecahedral structure, approximately 10 micrometers across.
The genus name of Braarudosphaera is in honour of Trygve Braarud (1903–1985), who was a Norwegian botanist. He specialized in marine biology, and was affiliated with the University of Oslo.
References
Haptophyte species |
https://en.wikipedia.org/wiki/Holborn%209100 | The Holborn 9100 was a personal computer introduced in 1981 by a small Dutch company called Holborn, designed by H.A. Polak. Very few of these devices were sold with Holborn going into bankruptcy on the 27 April 1983.
The 9100 base module is a server, and 9120 is a terminal.
Peripherals
30MB Hard Disk drive
Light pen
References
External links
"history of computer design", inexhibit
"Holborn 9100", old-computers.com
"Holborn Computers", zigbeedomotica.nl
Word processors |
https://en.wikipedia.org/wiki/Model-based%20enterprise | Model-based enterprise (MBE) is a term used in manufacturing, to describe a strategy where an annotated digital three-dimensional (3D) model of a product serves as the authoritative information source for all activities in that product's lifecycle.
A key advantage of MBE is that it replaces digital drawings. In MBE, a single 3D model contains all the information typically found on in an entire set of engineering drawings, including geometry, topology, dimensions, tolerances, materials, finishes, and weld call-outs.
MBE was originally championed by the aerospace and defense industries, with the automotive industry following. It has been adopted by many manufacturers around the world, in a wide range of industries. Significant benefits for manufacturers include reduced time to market and savings in production costs from improved tool design and fabrication, fewer overall assembly hours, less rework, streamlined development and better collaboration on engineering changes.
There are two prerequisites to implementing MBE: The first is the creation of annotated 3D models, known as a Model-based definitions (MBD). This requires the use of a CAD system capable of creating precise solid models, with product and manufacturing information (PMI), a form of 3D annotation which may include dimensions, GD&T, notes, surface finish, and material specifications. (The mechanical CAD systems used in aerospace, defense, and automotive industries generally have these capabilities.) The second prerequisite is transforming MBDs into a form where they can be used in downstream lifecycle activities. As a rule, CAD models are stored in proprietary data formats, so they must be translated to a suitable MBD-compatible standard format, such as 3D PDF, JT, STEP AP 242, or ANSI QIF
The core MBE tenet is that models are used to drive all aspects of the product lifecycle and that data is created once and reused by all downstream data consumers. Data reusability requires computer interpretability |
https://en.wikipedia.org/wiki/Pinball%20FX%203 | Pinball FX 3 is a pinball simulator video game developed and published by Zen Studios and is the sequel to Pinball FX 2. It was released for Microsoft Windows, Xbox One, PlayStation 4 in September 2017 and then released for the Nintendo Switch in December 2017. A followup called Pinball FX was released in February 16, 2023.
Gameplay
Pinball FX 3 allows players to play one of several simulated pinball tables, and includes online scoreboard support for informal competition with other players. The game is aimed to provide a more engaging multiplayer experience than previous titles; the game will provide support for asynchronous competitive multiplayer options, and tournament-style play. There will be shared leaderboards and multiplayer options among platforms, although PlayStation 4 players can only compete with users playing through Steam on Windows due to Sony's initial decision to prohibit cross-platform play between its PlayStation 4 and other consoles.
Development
Zen's prior games have been split across consoles. The Pinball FX games typically have been released on Microsoft platforms, while the Zen Pinball games were released on non-Microsoft platforms. Pinball FX 3 will be the first game in the series to target both Microsoft and non-Microsoft platforms, and Zen intends that any future titles in the series will do so as well. Zen has stated that a "majority" of the previous downloadable content pinball tables that a player has purchased for either Pinball FX 2 or Zen Pinball 2 will be available in Pinball FX 3 at no cost; Zen cited issues with licensing that prevents some tables from being brought to the new version. Zen Studios has affirmed that more than fifty tables will carry over, with only about half a dozen that will not.
Pinball FX 3 launched with three new tables based on movie properties from Universal Pictures that includes E.T. the Extra-Terrestrial, Back to the Future, and Jaws. Additional tables are in development with new intellectual prope |
https://en.wikipedia.org/wiki/Muller%E2%80%93Schupp%20theorem | In mathematics, the Muller–Schupp theorem states that a finitely generated group G has context-free word problem if and only if G is virtually free. The theorem was proved by David Muller and Paul Schupp in 1983.
Word problem for groups
Let G be a finitely generated group with a finite marked generating set X, that is a set X together with the map such that the subset generates G. Let be the group alphabet and let be the free monoid on that is is the set of all words (including the empty word) over the alphabet .
The map extends to a surjective monoid homomorphism, still denoted by , .
The word problem of G with respect to X is defined as
where is the identity element of G.
That is, if G is given by a presentation with X finite, then consists of all words over the alphabet that are equal to in G.
Virtually free groups
A group G is said to be virtually free if there exists a subgroup of finite index H in G such that H is isomorphic to a free group. If G is a finitely generated virtually free group and H is a free subgroup of finite index in G then H itself is finitely generated, so that H is free of finite rank.
The trivial group is viewed as the free group of rank 0, and thus all finite groups are virtually free.
A basic result in Bass–Serre theory says that a finitely generated group G is virtually free if and only if G splits as the fundamental group of a finite graph of finite groups.
Precise statement of the Muller–Schupp theorem
The modern formulation of the Muller–Schupp theorem is as follows:
Let G be a finitely generated group with a finite marked generating set X. Then G is virtually free if and only if is a context-free language.
Sketch of the proof
The exposition in this section follows the original 1983 proof of Muller and Schupp.
Suppose G is a finitely generated group with a finite generating set X such that the word problem is a context-free language. One first observes that for every finitely generated subgroup H of G |
https://en.wikipedia.org/wiki/Fiber%20network%20mechanics | Fiber network mechanics is a subject within physics and mechanics that deals with the deformation of networks made by the connection of slender fibers,. Fiber networks are used to model the mechanics of fibrous materials such as biopolymer networks and paper products. Depending on the mechanical behavior of individual filaments, the networks may be composed of mechanical elements such as Hookean springs, Euler-Bernoulli beams, and worm-like chains. The field of fiber network mechanics is closely related to the mechanical analysis of frame structures, granular materials, critical phenomena, and lattice dynamics.
References
Biophysics
Solid mechanics |
https://en.wikipedia.org/wiki/Tree%20transducer | In theoretical computer science and formal language theory, a tree transducer (TT) is an abstract machine taking as input a tree, and generating output – generally other trees, but models producing words or other structures exist. Roughly speaking, tree transducers extend tree automata in the same way that word transducers extend word automata.
Manipulating tree structures instead of words enable TT to model syntax-directed transformations of formal or natural languages. However, TT are not as well-behaved as their word counterparts in terms of algorithmic complexity, closure properties, etcetera. In particular, most of the main classes are not closed under composition.
The main classes of tree transducers are:
Top-Down Tree Transducers (TOP)
A TOP T is a tuple (Q, Σ, Γ, I, δ) such that:
Q is a finite set, the set of states;
Σ is a finite ranked alphabet, called the input alphabet;
Γ is a finite ranked alphabet, called the output alphabet;
I is a subset of Q, the set of initial states; and
is a set of rules of the form , where f is a symbol of Σ, n is the arity of f, q is a state, and u is a tree on Γ and , such pairs being nullary.
Examples of rules and intuitions on semantics
For instance,
is a rule – one customarily writes instead of the pair – and its intuitive semantics is that, under the action of q, a tree with f at the root and three children is transformed into
where, recursively, and are replaced, respectively, with the application of on the first child and
with the application of on the third.
Semantics as term rewriting
The semantics of each state of the transducer T, and of T itself, is a binary relation between input trees (on Σ) and output trees (on Γ).
A way of defining the semantics formally is to see as a term rewriting system, provided that in the right-hand sides the calls are written in the form , where states q are unary symbols. Then the semantics of a state q is given by
The semantics of T is then defined as t |
https://en.wikipedia.org/wiki/Trait%C3%A9%20de%20m%C3%A9canique%20c%C3%A9leste | Traité de mécanique céleste () is a five-volume treatise on celestial mechanics written by Pierre-Simon Laplace and published from 1798 to 1825 with a second edition in 1829. In 1842, the government of Louis Philippe gave a grant of 40,000 francs for a 7-volume national edition of the Oeuvres de Laplace (1843–1847); the Traité de mécanique céleste with its four supplements occupies the first 5 volumes.
Tome I. (1798)
Livre I. Des lois générales de l'équilibre et du mouvement
Chap. I. De l'équilibre et de la composition des forces qui agissent sur un point matériel
Chap. II. Du mouvement d'un point matériel
Chap. III. De l'équilibre d'un système de corps
Chap. IV. De l'équilibre des fluides
Chap. V. Principes généraux du mouvement d'un système de corps
Chap. VI. Des lois du mouvement d'un système de corps, dans toutes les relations mathématiquement possibles entre la force et la vitesse
Chat. VII. Des mouvemens d'un corps solide de figure quelconque
Chap. VIII. Du mouvement des fluides
Livre II. De la loi pesanteur universelle, et du mouvement des centres de gravité des corps célestes
Tome II. (1798)
Livre III. De la figure des corps céleste
Livre IV. Des oscillations de la mer et de l'atmosphère
Livre V. Des mouvemens des corps célestes, autour de leurs propre centres de gravité
Tome III. (1802)
Livre VI. Théorie particulières des mouvemens célestes
Livre VII. Théorie de la lune
Tome IV. (1805)
Livre VIII. Théorie des satellites de Jupiter, de Saturne et d'Uranus
Livre IX. Théorie des comètes
Livre X. Sur différens points relatifs au système du monde
Tome V. (1825)
Livre XI. De la figure et de la rotation de la terre
Livre XII. De l'attraction et de la répulsion des sphères, et des lois de l'equilibre et du mouvement des fluides élastiques
Livre XIII. Des oscillations des fluides qui recouvrent les planètes
Livre XIV. Des mouvemens des corps célestes autour de leurs centres de gravité
Livre XV. Du mouvement des planètes et des comètes
Li |
https://en.wikipedia.org/wiki/Ranked%20alphabet | In theoretical computer science and formal language theory, a ranked alphabet is a pair of an ordinary alphabet F and a function Arity: F→. Each letter in F has its arity so it can be used to build terms. Nullary elements (of zero arity) are also called constants. Terms built with unary symbols and constants can be considered as strings. Higher arities lead to proper trees.
For instance, in the term
,
a,b,c are constants, g is unary, and f is ternary.
Contrariwise,
cannot be a valid term, as the symbol f appears once as binary, and once as unary, which is illicit, as Arity must be a function.
References
Trees (data structures)
Automata (computation)
Formal languages
Theoretical computer science |
https://en.wikipedia.org/wiki/Load%20path%20analysis | Load path analysis is a technique of mechanical and structural engineering used to determine the path of maximum stress in a non-uniform load-bearing member in response to an applied load. Load path analysis can be used to minimize the material needed in the load-bearing member to support the design load.
Load path analysis may be performed using the concept of a load transfer index, U*. In a structure, the main portion of the load is transferred through the stiffest route. The U* index represents the internal stiffness of every point within the structure. Consequently, the line connecting the highest U* values is the main load path. In other words, the main load path is the ridge line of the U* distribution (contour) This method of analysis has been verified in physical experimentation.
Load path calculation using U* index
In a structure, the main portion of the load is transferred through the stiffest route. The U* index represents the internal stiffness of every point within the structure. Consequently, the line connecting the highest U* values is the main load path. In other words, the main load path is the ridge line of the U* distribution (contour). The U* index theory has been validated through two different physical experiments.
Since the U* index predicts the load paths based on the structural stiffness, it is not affected by the stress concentration problems. The load transfer analysis using the U* index is a new design paradigm for vehicle structural design. It has been applied in design analysis and optimization by automotive manufacturers like Honda and Nissan.
In the image to the right, a structural member with a central hole is placed under load bearing stress. Figure (a) shows the U* distribution and the resultant load paths while figure (b) is the von Mises Stress distribution. As can be seen from figure (b), higher stresses can be observed at the vicinity of the hole. However, it is unreasonable to conclude the main load passes that area wi |
https://en.wikipedia.org/wiki/Unique%20homomorphic%20extension%20theorem | The unique homomorphic extension theorem is a result in mathematical logic which formalizes the intuition that the truth or falsity of a statement can be deduced from the truth values of its parts.
The lemma
Let A be a non-empty set, X a subset of A, F a set of functions in A, and the inductive closure of X under F.
Let be B any non-empty set and let G be the set of functions on B, such that there is a function in G that maps with each function f of arity n in F the following function in G (G cannot be a bijection).
From this lemma we can now build the concept of unique homomorphic extension.
The theorem
If is a free set generated by X and F, for each function there is a single function such that:
For each function f of arity n > 0, for each
Consequence
The identities seen in (1) e (2) show that is an homomorphism, specifically named the unique homomorphic extension of . To prove the theorem, two requirements must be met: to prove that the extension () exists and is unique (assuring the lack of bijections).
Proof of the theorem
We must define a sequence of functions inductively, satisfying conditions (1) and (2) restricted to . For this, we define , and given then shall have the following graph:
First we must be certain the graph actually has functionality, since is a free set, from the lemma we have when , so we only have to determine the functionality for the left side of the union. Knowing that the elements of G are functions(again, as defined by the lemma), the only instance where and for some is possible is if we have for some and for some generators and in .
Since and are disjoint when this implies and . Being all in , we must have .
Then we have with , displaying functionality.
Before moving further we must make use of a new lemma that determines the rules for partial functions, it may be written as:
(3)Be a sequence of partial functions such that . Then, is a partial function.
Using (3), is a partial fu |
https://en.wikipedia.org/wiki/Ackermann%27s%20formula | In control theory, Ackermann's formula is a control system design method for solving the pole allocation problem for invariant-time systems by Jürgen Ackermann. One of the primary problems in control system design is the creation of controllers that will change the dynamics of a system by changing the eigenvalues of the matrix representing the dynamics of the closed-loop system. This is equivalent to changing the poles of the associated transfer function in the case that there is no cancellation of poles and zeros.
State feedback control
Consider a linear continuous-time invariant system with a state-space representation
where x is the state vector, u is the input vector, and A, B and C are matrices of compatible dimensions that represent the dynamics of the system. An input-output description of this system is given by the transfer function
Since the denominator of the right equation is given by the characteristic polynomial of A, the poles of G are eigenvalues of A (note that the converse is not necessarily true, since there may be cancellations between terms of the numerator and the denominator). If the system is unstable, or has a slow response or any other characteristic that does not specify the design criteria, it could be advantageous to make changes to it. The matrices A, B and C, however, may represent physical parameters of a system that cannot be altered. Thus, one approach to this problem might be to create a feedback loop with a gain K that will feed the state variable x into the input u.
If the system is controllable, there is always an input such that any state can be transferred to any other state . With that in mind, a feedback loop can be added to the system with the control input , such that the new dynamics of the system will be
In this new realization, the poles will be dependent on the characteristic polynomial of , that is
Ackermann's formula
Computing the characteristic polynomial and choosing a suitable feedback matrix can b |
https://en.wikipedia.org/wiki/VoIP%20vulnerabilities | VoIP vulnerabilities are weaknesses in the VoIP protocol or its implementations that expose users to privacy violations and other problems. VoIP is a group of technologies that enable voice calls online. VoIP contains similar vulnerabilities to those of other internet use.
Risks are not usually mentioned to potential customers. VoIP provides no specific protections against fraud and illicit practices.
Vulnerabilities
Eavesdropping
Unencrypted connections are vulnerable to security breaches. Hackers/trackers can eavesdrop on conversations and extract valuable data.
Network attacks
Attacks on the user network or internet provider can disrupt or destroy the connection. Since VoIP requires an internet connection, direct attacks on the internet connection, or provider, can be effective. Such attacks target office telephony. Mobile applications that do not rely on an internet connection to make calls are immune to such attacks.
Default security settings
VoIP phones are smart devices that need to be configured. In some cases, Chinese manufacturers are using default passwords that lead to vulnerabilities.
VOIP over Wi-Fi
While VoIP is relatively secure, it still needs a source of internet, which is often a Wi-Fi network, making VoIP subject to Wi-Fi vulnerabilities
Exploits
Spam
VoIP is subject to spam called SPIT (Spam over Internet Telephony). Using the extensions provided by VoIP PBX capabilities, the spammer can harass their target from different numbers. The process can be automated and can fill the target's voice mail with notifications. The spammer can make calls often enough to block the target from getting important calls.
Phishing
VoIP users can change their Caller ID (a.k.a. Caller ID spoofing), allowing a caller to pose as a relative or colleague in order to extract information, money or benefits from the target.
See also
Comparison of VoIP software
INVITE of Death
List of VoIP companies
Mobile communications over IP - Mobile VoIP
Voice over WLA |
https://en.wikipedia.org/wiki/ARIB%20STD%20B24%20character%20set | Volume 1 of the Association of Radio Industries and Businesses (ARIB) STD-B24 standard for Broadcast Markup Language specifies, amongst other details, a character encoding for use in Japanese-language broadcasting. It was introduced on . The latest revision is version 6.3 as of .
It includes a number of not found in the base standards (JIS X 0208 and JIS X 0201). It was the source standard for many symbol characters which were added to Unicode, including portions of the Miscellaneous Symbols, Enclosed Alphanumeric Supplement and Enclosed Ideographic Supplement blocks. Its contributions partially overlap the Unicode emoji, but were added a year earlier, in Unicode 5.2.
Fascicle 1 of the ARIB STD-B62 standard, published in 2014, defines Unicode mappings for a selection of the B24 extended characters (excluding, for example, those duplicated by JIS X 0213), as well as a few extended Kanji. It also includes a mapping of utilised characters outside the Basic Multilingual Plane to the BMP's private use area.
Sets and codes
The ARIB STD B24 standard defines multiple character sets and a method of switching between them. These include a Kanji set (an extension of JIS X 0208), an Alphanumeric set, a Hiragana set, Katakana sets of two distinct layouts and four mosaic sets. The sets are selected using ISO 2022 mechanisms for 94-sets, using the following codes (proportional sets use the same layout as the corresponding non-proportional ones):
Code charts
Kanji (double-byte) set
This is a double-byte character set extending JIS X 0208.
Lead byte
The encoding bytes correspond to the row or cell number plus 0x20, or 32 in decimal (see below). Hence, the code set starting with 0x21 has a row number of 1, and its cell 1 has a continuation byte of 0x21 (or 33), and so forth. Most of the code corresponds to JIS X 0208.
Character sets 0x21-0x74 (row numbers 1-84: punctuation, alphabets, numbers, Kana, Kanji)
Character set 0x7A (row number 90, traffic symbols)
Characters 9 |
https://en.wikipedia.org/wiki/Frink%20%28programming%20language%29 | Frink is a computer programming language. It is, according to creator of the language, "designed to make physical calculations simple, to help ensure that answers come out right, and to make a tool that's really useful in the real world. It tracks units of measure (feet, meters, kilograms, watts, etc.) through all calculations, allowing you to mix units of measure transparently, and helps you easily verify that your answers make sense."
Features
units of measure for variables
Interval arithmetic
Anonymous functions
Name
Frink was named after Professor Frink, recurring character in the animated television series The Simpsons.
References
External links
Frink examples at Rosetta Code
Cross-platform software
Scripting languages
Numerical programming languages
JVM programming languages
Programming languages supporting units of measure
Programming languages created in 2001 |
https://en.wikipedia.org/wiki/25%20great%20circles%20of%20the%20spherical%20octahedron | In geometry, the 25 great circles of the spherical octahedron is an arrangement of 25 great circles in octahedral symmetry. It was first identified by Buckminster Fuller and is used in construction of geodesic domes.
Construction
The 25 great circles can be seen in 3 sets: 12, 9, and 4, each representing edges of a polyhedron projected onto a sphere. Nine great circles represent the edges of a disdyakis dodecahedron, the dual of a truncated cuboctahedron. Four more great circles represent the edges of a cuboctahedron, and the last twelve great circles connect edge-centers of the octahedron to centers of other triangles.
See also
31 great circles of the spherical icosahedron
References
Edward Popko, Divided Spheres: Geodesics and the Orderly Subdivision of the Sphere, 2012, pp 21–22.
Vector Equilibrium and its Transformation Pathways
Geodesic domes
Polyhedra
Circles |
https://en.wikipedia.org/wiki/June%20Huh | June Huh (full name: June E Huh, ; born 1983) is an American mathematician who is currently a professor at Princeton University. Previously, he was a professor at Stanford University. He was awarded the Fields Medal in 2022 and a MacArthur Fellowship in 2022. He has been noted for the linkages that he has found between algebraic geometry and combinatorics.
Early life and education
Huh was born in Stanford, California while his parents were completing graduate school at Stanford University. He was raised in South Korea, where his family returned when he was approximately two years old. His father was a professor of statistics at Korea University, while his mother was a professor of Russian language at Seoul National University. Poor scores on elementary school tests convinced him that he lacked the innate aptitude to excel in mathematics. He dropped out of high school to focus on writing poetry after becoming bored and exhausted by the routine of constantly studying during his youth. Due to the academic setbacks he endured throughout his childhood and adolescent years that eventually culminated into a subsequent career breakthrough into mathematics which also resulted him in netting the coveted Fields Medal. Huh has been described as a late bloomer, both in terms of his career phenomena and with respect to his academic and professional development. Huh matriculated at Seoul National University in 2002, but found himself initially unsettled. He pinned his initial career aspirations on becoming a science journalist and decided to major in physics and astronomy, but compiled a poor attendance record and had to repeat several courses that he initially failed at.
Early in his studies he was mentored by Japanese Fields medalist mathematician Heisuke Hironaka, who went to Seoul National University as a visiting professor. Having failed several courses, Huh took an algebraic geometry course under Hironaka in his sixth year which focused on singularity theory and was based |
https://en.wikipedia.org/wiki/Eric%20Katz | Eric Katz is a mathematician working in combinatorial algebraic geometry and arithmetic geometry. He is currently an associate professor in the Department of Mathematics at The Ohio State University.
In joint work with Karim Adiprasito and June Huh, he resolved the Heron–Rota–Welsh conjecture on the log-concavity of the characteristic polynomial of matroids. With Joseph Rabinoff and David Zureick-Brown, he has given bounds on rational and torsion points on curves.
Education
Katz went to Beachwood High School, in Beachwood, Ohio, a suburb of Cleveland. After earning a B.S. in Mathematics from The Ohio State University in 1999, he pursued graduate studies at Stanford University, obtaining his Ph.D. in 2004 with a thesis written under the direction of Yakov Eliashberg and Ravi Vakil.
References
Year of birth missing (living people)
1970s births
Living people
Ohio State University faculty
Academic staff of the University of Waterloo
Stanford University alumni
Academics from Cleveland
Mathematicians from Ohio
Algebraic geometers
Combinatorialists
20th-century American mathematicians
21st-century American mathematicians
Ohio State University College of Arts and Sciences alumni |
https://en.wikipedia.org/wiki/Junior%20Solar%20Sprint | Junior Solar Sprint (JSS) is a competitive program for 5th- to 8th-grade students to create a small solar-powered vehicle. JSS competitions are sponsored by the Army Educational Outreach Program (AEOP), and administered by the Technology Student Association (TSA). Objectives of JSS are to create the fastest, most interesting, or best crafted vehicle. Skills in science, technology, engineering, and mathematics (STEM) are fostered when designing and constructing the vehicles, as well as principles of alternative fuels, engineering design, and aerodynamics.
History
Junior Solar Sprint was created in the 1980s by the National Renewable Energy Laboratory (NREL) to teach younger children about the importance and challenges of using renewable energy. The project also teaches students how the engineering process is applied, and how solar panels, transmission, and aerodynamics can be used in practice.
Since 2001, the AEOP has funded JSS events. TSA began hosting competitions in 2011, and it became a middle school-level event in 2014. In association with TSA, Pitsco Education has sold recommended materials for the project.
Competition
Since Junior Solar Sprint became a TSA event, the rules for creating the vehicle have been defined in the TSA rulebook. At the conference, the total cost of creating each car must be less than US$50. The team must also document their process in a notebook.
During the time trials section, each car is raced three times down a lane long, on a hard surface like a tennis court. To keep the vehicle pointed straight ahead, a guide wire is run across every lane attached by an eyelet. When the cars are racing, they must remain attached to the wire with no external control. During the race, no modifications are allowed, though anyone may watch.
The fastest time of the three trials is used for qualification to the semifinal round. In the next stage, a single- or double-elimination tournament, cars are raced against each other at the same time, unt |
https://en.wikipedia.org/wiki/Active%20power%20filter | Active power filters (APF) are filters, which can perform the job of harmonic elimination. Active power filters can be used to filter out harmonics in the power system which are significantly below the switching frequency of the filter. The active power filters are used to filter out both higher and lower order harmonics in the power system.
The main difference between active power filters and passive power filters is that APFs mitigate harmonics by injecting active power with the same frequency but with reverse phase to cancel that harmonic, where passive power filters use combinations of resistors (R), inductors (L) and capacitors (C) and does not require an external power source or active components such as transistors. This difference, make it possible for APFs to mitigate a wide range of harmonics.
See also
Static synchronous series compensator
Power conditioner
Active filter
Line filter
References
Filters
Power engineering |
https://en.wikipedia.org/wiki/Lin%20Li%20%28engineer%29 | Lin Li, FREng, CEng, FIET, FLIA, FCIRP (), is a professor of laser engineering at the University of Manchester.
Early life
Li earned his BSc in control engineering from Dalian University of Technology in 1982 and his PhD in laser engineering from Imperial College, London in 1989.
Career
Li worked as a postdoctoral research associate in high power laser engineering at the University of Liverpool from 1988 to 1994. He joined UMIST in 1994, where he established the first high-power laser processing research laboratory and its associated research group. He became a full professor in 2000. He invented the microsphere super-resolution optical nanoscope with a 50 nm resolution and has 47 patents in the field of laser processing and photonic science. His current research relates to the use of graphene in welding.
He is a fellow of the Royal Academy of Engineering, the Institute of Engineering and Technology, the Laser Institute of America, the International Academy for Production Engineering, and a Chartered Engineer.
In 2017 it was announced that the LIG Nanowise, a spin-off company from the University of Manchester chaired by Li, had invented new microscopy techniques that can quadruple the resolution of optical microscopes.
Awards
His awards include:
Arthur Charles Main Award from the Institute of Mechanical Engineers in 2001 for work in laser based nuclear decommissioning technology
Sir Frank Whittle Medal from the Royal Academy of Engineering in 2013 for achievements in engineering innovations in manufacturing
Wolfson Research Merit Award of the Royal Society for his research into laser nano-fabrication and nano-imaging, 2014.
Researcher of the Year in Engineering and Physical Sciences at The University of Manchester in 2014.
References
External links
University of Manchester Staff Profile
ResearchGate Profile
Academics of the University of Manchester
Dalian University of Technology alumni
Alumni of Imperial College London
Academics of the University of Manc |
https://en.wikipedia.org/wiki/Neutrophil%20swarming | Neutrophil swarming is a type of coordinated neutrophil movement that acts in response to acute tissue inflammation or infection. The term comes from the swarming characteristics of insects that are similar to the behavior of neutrophils in response to an infection. These processes have mostly been studied in tissues of mice and studies of mouse ear tissue has proved to be very effective at observing neutrophil movement. Neutrophil swarming typically aggregates at surface layers of tissue so the thin nature of the mouse ear tissue makes for a good model to study this process. Additionally, zebrafish larvae have been used for the study of neutrophil movement mainly because of their translucence during the first few days of their development. With transgenic lines that fluorescently label zebrafish neutrophils, the cells can be tracked by epifluorescence or confocal microscopy during the course of an inflammatory response. Through this method, specific subpopulations of neutrophils can be tracked and their origin and fate during the induction and resolution of inflammation is observed. Another advantage for using zebrafish to study neutrophil swarming is that adaptive immunity for this organism does not develop until around 4 weeks of age. This allows for the study of neutrophil movement and other host immune responses independent of adaptive immune responses.
Variations
A study of the lymph nodes of mice that were infected by injection of parasites into their earflaps revealed two types of neutrophil swarming: transient and persistent swarms. Transient swarms are characterized by groups of 10-150 neutrophils forming multiple small cell clusters within 10-40 minutes that quickly dispersed. Persistent swarms showed clusters of more than 300 neutrophils and recruitment lasted for more than 40 minutes. For both the transient and persistent swarms, the formed neutrophil clusters appeared to be competing with each other with the larger clusters attracting neutrophils fro |
https://en.wikipedia.org/wiki/Glasser%27s%20master%20theorem | In integral calculus, Glasser's master theorem explains how a certain broad class of substitutions can simplify certain integrals over the whole interval from to It is applicable in cases where the integrals must be construed as Cauchy principal values, and a fortiori it is applicable when the integral converges absolutely. It is named after M. L. Glasser, who introduced it in 1983.
A special case: the Cauchy–Schlömilch transformation
A special case called the Cauchy–Schlömilch substitution or Cauchy–Schlömilch transformation was known to Cauchy in the early 19th century. It states that if
then
where PV denotes the Cauchy principal value.
The master theorem
If , , and are real numbers and
then
Examples
References
External links
Integral calculus |
https://en.wikipedia.org/wiki/Kingmax | Kingmax is a Taiwan-based corporate group and manufacturer of RAM modules and memory cards. The principal company of the group is Kingmax Semiconductor Inc. was established in 1989, headquartered in Zhubei City, Hsinchu County, Taiwan, and the group manufactures and offers computer hardware and electronics products all over the world.
Overview
Originally, in 1989, Kingmax Semiconductor Inc. was established. The Group has several manufacturing facilities in Taiwan, China, and Hong Kong. The group manufactures and offers flash memory products (SD cards, USB flash drives and Solid state drives), Hard disk drives, DRAM, Card readers, USB adapters, and other electronics products all over the world. The business type and scope is same as ADATA, Silicon Power and Transcend Information, these are also the companies in Taiwan. In 2011, Kingmax was known that introduced the first 64GB microSD card in the world. In 2015, Kingpak Technology Inc. was merged into International Branding Marketing Inc. (English name is still Kingpak Technology Inc). And then, it was the first company of the group that changed status from private to public listed on the Taiwan OTC Market (6238.TWO). In 2017, Kingmax was also known that AirQ Check, the portable air quality checker for checking PM2.5 etc., received Taiwan Excellence Award.
In the aspect of business-to-business, as the supplier of computer hardware, Kingmax has contributed to offer the various products to major computer companies. The group has offered TinyBGA to IBM, hp, Sun Microsystems, Compaq, Dell, NEC, Acer, Asus
, CMOS image sensor to ON Semiconductor, etc. However, the group has been offered flash memory and DRAM by Lexar (Micron Technology) and Elixir (Nanya Technology).
Group Companies
Kingmax Semiconductor Inc. (勝創科技股份有限公司)
Kingmax Digital Inc. (協泰國際股份有限公司)
Kingpak Technology Inc. (勝麗國際股份有限公司)
See also
List of companies of Taiwan
References
External links
Official Website
Computer companies established in 1989
Compu |
https://en.wikipedia.org/wiki/Virtual%20machine%20introspection | In computing, virtual machine introspection (VMI) is a technique "for monitoring the runtime state of a system-level virtual machine (VM)", which is helpful for debugging or forensic analysis.
The term introspection in application to the virtual machines was introduced by Garfinkel and Rosenblum. They invented an approach for "protecting a security application from attack by malicious software" and called it VMI. Now VMI is a common term for different virtual machine forensics and analysis methods. VMI-based approaches are widely used for security applications, software debugging, and systems management.
VMI tools may be located inside or outside the virtual machine and act by tracking the events (interrupts, memory writes, and so on) or sending the requests to the virtual machine. Virtual machine monitor usually provides low-level information like raw bytes of the memory. Converting this low-level view into something meaningful for the user is known as the semantic gap problem. Solving this problem requires analysis and understanding of the systems being monitored.
VMI within the virtual machine
Programs running inside VM may provide information about other processes. This information may be sent through network interface or some virtual devices like serial port.
The examples of in vivo introspection programs are WinDbg or GDB servers that interact with the remote debugger.
The drawback of this approach is that it requires functioning OS within the VM. If OS hangs or isn't loaded yet, the introspection agent couldn't work.
VMI outside the virtual machine
VMI tools may be implemented within the virtual machine monitor or as a separate programs that capture information (e.g., contents of the memory) from the virtual machine monitor.
Then this data has to be interpreted to understand the processes in the system. One of the popular tools for such interpretation is Volatility framework. This framework contains profiles for many popular operating systems and ma |
https://en.wikipedia.org/wiki/Quantum%20supremacy | In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem. The term was coined by John Preskill in 2012, but the concept dates back to Yuri Manin's 1980 and Richard Feynman's 1981 proposals of quantum computing.
Conceptually, quantum supremacy involves both the engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task.
Examples of proposals to demonstrate quantum supremacy include the boson sampling proposal of Aaronson and Arkhipov, D-Wave's specialized frustrated cluster loop problems, and sampling the output of random quantum circuits. The output distributions that are obtained by making measurements in boson sampling or quantum random circuit sampling are flat, but structured in a way so that one cannot classically efficiently sample from a distribution that is close to the distribution generated by the quantum experiment. For this conclusion to be valid, only very mild assumptions in the theory of computational complexity have to be invoked. In this sense, quantum random sampling schemes can have the potential to show quantum supremacy.
A notable property of quantum supremacy is that it can be feasibly achieved by near-term quantum computers, since it does not require a quantum computer to perform any useful task or use high-quality quantum error correction, both of which are long-term goals. Consequently, researchers view quantum supremacy as primarily a scientific goal, with relatively little immediate bearing on the future commercial viability of quantum computing. Due to unpredictable possible improvements in classical computers and algorithms, |
https://en.wikipedia.org/wiki/Methyl%20isobutyrate | Methyl isobutyrate is an organic compound with the formula CH3O2CCH(CH3)2. This colorless liquid, the methyl ester of isobutyric acid, is used as a solvent.
References
Methyl esters
Isobutyrate esters
Perfume ingredients
Flavors |
https://en.wikipedia.org/wiki/Stronger%20uncertainty%20relations | Heisenberg's uncertainty relation is one of the fundamental results in quantum mechanics. Later Robertson proved the uncertainty relation for two general non-commuting observables, which was strengthened by Schrödinger. However, the conventional uncertainty relation like the Robertson-Schrödinger relation cannot give a non-trivial bound for the product of variances of two incompatible observables because the lower bound in the uncertainty inequalities can be null and hence trivial even for observables that are incompatible on the state of the system. The Heisenberg–Robertson–Schrödinger uncertainty relation was proved at the dawn of quantum formalism and is ever-present in the teaching and research on quantum mechanics. After about 85 years of existence of the uncertainty relation this problem was solved recently by Lorenzo Maccone and Arun K. Pati.
The standard uncertainty relations are expressed in terms of the product of variances of the measurement results of the observables and , and the product can be null even when one of the two variances is different from zero. However, the stronger uncertainty relations due to Maccone and Pati provide different uncertainty relations, based on the sum of variances that are guaranteed to be nontrivial whenever the observables are incompatible on the state of the quantum system. (Earlier works on uncertainty relations formulated as the sum of variances include, e.g., He et al., and Ref. due to Huang.)
The Maccone–Pati uncertainty relations
The Heisenberg–Robertson or Schrödinger uncertainty relations do not fully capture the incompatibility of observables in a given quantum state. The stronger uncertainty relations give non-trivial bounds on the sum of the variances for two incompatible observables. For two non-commuting observables and the first stronger uncertainty relation is given by
where , , is a vector that is orthogonal to the state of the system, i.e., and
one should choose the sign of so that this i |
https://en.wikipedia.org/wiki/J%C3%B3nsson%20term | In universal algebra, within mathematics, a majority term, sometimes called a Jónsson term, is a term t with exactly three free variables that satisfies the equations t(x, x, y) = t(x, y, x) = t(y, x, x) = x.
For example, for lattices, the term (x ∧ y) ∨ (y ∧ z) ∨ (z ∧ x) is a Jónsson term.
Sequences of Jónsson term
In general, Jónsson terms, more formally, a sequence of Jónsson terms, is a sequence of ternary terms satisfying certain related identities. One of the earliest Maltsev condition, a variety is congruence distributive if and only if it has a sequence of Jónsson terms.
The case of a majority term is given by the special case n=2 of a sequence of Jónsson terms.
Jónsson terms are named after the Icelandic mathematician Bjarni Jónsson.
References
Universal algebra |
https://en.wikipedia.org/wiki/Methyl%20pivalate | Methyl pivalate is an organic compound with the formula CH3O2CC(CH3)3. It is a colorless liquid, the methyl ester of pivalic acid. The ester is well known for being resistant to hydrolysis to the parent acid. Hydrolysis can be effected with a solution of trimethylsilyl iodide in hot acetonitrile followed by aqueous workup.
References
Flavors
Methyl esters
Perfume ingredients
Pivalate esters |
https://en.wikipedia.org/wiki/Princeton%20%28electronics%20company%29 | is a Japanese company headquartered in Tokyo, Japan, that offers computer hardware and electronics products.
Overview
Originally, in 1995, Princeton Technology Ltd. was established.
The company is basically fabless company, designing the products, ordering them to the manufactures in Taiwan and China etc.. The company offers flash memory products (SD cards, USB flash drives), DRAM, LCD, LED display, Hard disk drives, NAS and other electronics products. Princeton products are sold mostly in Japanese domestic market, but we can find several products at some online shopping, Amazon.com etc.. The business type and scope is same as Green House, Elecom and Buffalo, these are also the companies in Japan. In 2014, the company name was changed from Princeton Technology Ltd. to Princeton Ltd..
In the aspect of business-to-business, as the supplier of computer hardware, Princeton has contributed to offer the various flash memory and DRAM products to major electronics companies in Japan, such as Sony, Panasonic and Toshiba etc..
Princeton is also known that the company has been the official agency of Cisco, Polycom, Edgewater networks, Proware Technology and Drobo etc., and has introduced several cloud collaboration systems and SAN systems in Japan. The company has presented IT solution for education systems by installing Cisco and Edgewater networks cloud collaboration products, and as another example, SAN systems by installing Princeton, Proware Technology and Drobo NAS products.
See also
List of companies of Japan
References
External links
Official Website
Computer companies established in 1995
Computer hardware companies
Computer memory companies
Computer peripheral companies
Computer storage companies
Electronics companies of Japan
Japanese brands
Japanese companies established in 1995 |
https://en.wikipedia.org/wiki/Fluorochromasia | Fluorochromasia (Greek flōr χρῶμα- Pronunciation: flｕ̇r·ō·krə′mā·zhə), is a cellular phenomenon characterized by immediate appearance of bright green fluorescence inside viable cells upon exposure to certain membrane-permeable fluorogenic substrates such as fluorescein diacetate, fluorescein dibutyrate and fluorescein dipropionate.
The phenomenon is widely used to measure cellular viability of many different species including animals, plants, and microorganisms. Moreover, fluorochromasia has been observed within organs, embryos, and zebrafish. Fluorochromasia has many applications including histocompatibility testing, measurement of cytotoxic antibodies, in vitro chemo sensitivity testing of tumors, and fluorochrome intercellular translocation. It has been applied with plants, bacteria, mammalian oocytes, mouse embryos, and human tumor cells.
History
In 1966, Rotman and Papermaster accidentally discovered fluorochromasia while studying intracellular enzymes using fluorogenic substrates. They studied its mode of action and presented a molecular model in which intracellular retention of fluorescein depends on the integrity of the cell membrane. Non- polar molecules of fluorescein-esters, such as fluorescein diacetate, readily enter the cell and are hydrolyzed
by non-specific esterases producing fluorescein, as the polar compound. In viable cells, the intracellular fluorescein is unable to readily pass through the intact membrane (i.e., it leaks slowly), accumulating in the cytoplasm of the cell. Their model is illustrated in Figure 1.
References
Cell biology |
https://en.wikipedia.org/wiki/PayU | PayU is a Netherlands-based payment service provider to online merchants. The company was founded in 2002, and is headquartered in Hoofddorp. It allows online businesses to accept and process payments through payment methods that can be integrated with web and mobile applications. As of 2018, the service is available in 17 countries. The firm is owned by the Naspers Group, which also owns a stake in one of its sister companies, Tencent.
History
PayU is the result of multiple payment gateways in various regions of the world that have been acquired and brought into the PayU group. In 2014, all online payments companies that were part of Naspers started operating under the PayU brand.
In 2022, it fired about 150 employees, approximately 6% of its workforce.
In 2023, PayU sold its global payments business, other than those in its core markets of India, Southeast Asia and Turkey, to Rapyd for $610 million.
Investment and acquisitions
Acquired Zooz, an Israeli startup that provides an API to merchants.
Acquired Indian payments services provider Citrus Pay in September 2016 for $130M.
Investment of €110M in German fintech company Kreditech, which provides machine-learning based underwriting.
PayU led a funding round of $115M in Seattle-based Remitly, a remittance company.
Series A investment of $3.7M in ZestMoney, a provider of consumer finance for online purchases.
Invested $5.3M in Indian fintech startup PaySense in May 2017
Investment of R$60M in online credit platform Creditas (ex-BankFacil)
2011, acquired Romanian online payments company GECAD ePayments
2019, acquired US-based digital financial security firm Wibmo for $70M
2019, acquired Turkish digital payments company Iyzico for $165M
2020, acquired Indian fintech startup PaySense for $185M
Operations
Europe
In November 2006, PayU SA was established and the Polish firm Platnosci.pl was merged into the group. The company also has a partnership with Iwoca to make financing for SME firms easier. In 2010, the c |
https://en.wikipedia.org/wiki/Infer%20Static%20Analyzer | Infer, sometimes referred to as "Facebook Infer", is a static code analysis tool developed by an engineering team at Facebook along with open-source contributors. It provides support for Java, C, C++, and Objective-C, and
is deployed at Facebook in the analysis of its Android and iOS apps (including those for WhatsApp, Instagram, Messenger and the main Facebook app).
History
Infer has its roots in academic research on Separation Logic, a theory for the formal verification of software. Work on automatic program verification based on Separation Logic led to a succession of academic tools, including Smallfoot and SpaceInvader. Building on the academic work, Cristiano Calcagno, Dino Distefano and Peter O'Hearn, three researchers at University College London and Queen Mary University of London, co-founded the verification startup Monoidics in 2009, and Monoidics developed the first version of Infer. Monoidics was acquired by Facebook in 2013, and in 2015 the code of Infer was open-sourced.
As of 2013 when Infer was open-sourced it was claimed that hundreds of bugs per month identified by Infer were fixed by Facebook's developers before reaching production. By 2015 this had increased to over 1000 bugs per month.
Spotify, Uber, Mozilla, Sky, and Marks and Spencer are among the reported users of Infer.
Technology
Infer performs checks for null pointer exceptions, resource leaks, annotation reachability, missing lock guards, and concurrency race conditions in Android and Java code. It checks for null pointer problems, memory leaks, coding conventions and unavailable API's in C, C++ and Objective C.
Infer uses a technique called bi-abduction to perform a compositional program analysis that interprets program procedures independently of their callers. It is claimed that this enables Infer to scale to large codebases and to run quickly on code-changes in an incremental fashion, while still performing an inter-procedural analysis that reasons across procedure boundaries. |
https://en.wikipedia.org/wiki/Alaxala%20Networks | , commonly known as its brand Alaxala, is a Japanese company headquartered in Kawasaki, Kanagawa, Japan, that offers networking hardware products.
Overview
In 2004, Alaxala Networks Corp. was originally established, as the merger between Hitachi and NEC networking hardware divisions. The name of Alaxala was derived from "ALL Access for eXpert and Latent Association", and more that "Ala" in Latin means "Wing", and "X" means "networking eXchange", so the company intended the two "Ala" (Hitachi and NEC) connected and collaborated by "X" tightly.
The company is basically fabless company, designing the products, mostly ordering to manufacture them to Hitachi enterprise servers division factory in Hadano, Kanagawa, Japan. The company offers networking hardware products, network router and network switch etc. Alaxala products are sold and installed mostly in Japanese domestic market and for enterprises, but we can find several products at some online shopping, Amazon.com etc.. The business type and scope is same as Allied Telesis, that is also the company in Japan. And they are collaborated for producing networking hardware sold in both brands.
Alaxala official agencies are Hitachi, NEC, Itochu Techno-Solutions, Net One Systems, and Alaxala has contributed to offer the various networking hardware products to major communication companies in Japan, such as NTT, KDDI and Softbank etc..
On August 24, 2012, Alaxala was known that Tokyo Stock Exchange (TSE) announced that TSE core system outage happened due to the software bugs on Alaxala networking hardware.
Alaxala also sponsors IT professional certifications for Alaxala products, like Cisco and Oracle etc..
See also
List of companies of Japan
List of networking hardware vendors
References
External links
Official website
Companies based in Kanagawa Prefecture
Computer companies established in 2004
Electronics companies of Japan
Networking hardware companies
Japanese brands
Japanese companies established in 2004 |
https://en.wikipedia.org/wiki/Corega | was a Japanese company established in 1996, and now is one brand (division) of Allied Telesis K.K., that offers networking hardware products.
Overview
Originally, in 1996, Corega Inc. was established by Allied Telesis K.K., headquartered in Yokohama, Kanagawa Japan, for offering networking hardware products for consumer market and small business.
The company (division) is basically fabless, designing the products, ordering them to the manufactures in Japan, Taiwan and China etc., as Allied Telesis does.
The company (division) offers networking hardware products, network router, network switch and wireless router.
Corega products are sold and installed mostly in Japanese domestic market, but we can find several products at some online shopping, Amazon.com etc..
The business type and scope are same as Green House, Elecom, and Buffalo, these are mostly consumer market and small business companies in Japan.
In 2009, Allied Telesis K.K. acquired Corega Inc, then it started as one brand (division) in Allied Telesis K.K., as Allied Telesis group restructure.
See also
List of companies of Japan
List of networking hardware vendors
References
External links
Official Website
Computer companies established in 1996
Electronics companies of Japan
Networking hardware companies
Japanese brands
Japanese companies established in 1996 |
https://en.wikipedia.org/wiki/Sarantaporo.gr | Sarantaporo.gr is a non-profit wireless network community founded in 2013 in Elassona Municipality in Greece. The network helps locals organize cooperative work to deploy and operate the wireless network infrastructure, organized as a commons.
The WCN participated in the CONFINE, the netCommons and the MAZI research projects. A documentary presents the networks in the Sarantaporo area.
References
Community networks
Wireless community networks
Wireless network organizations |
https://en.wikipedia.org/wiki/Boolean%20algebra | In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values true and false, usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. Second, Boolean algebra uses logical operators such as conjunction (and) denoted as , disjunction (or) denoted as , and the negation (not) denoted as . Elementary algebra, on the other hand, uses arithmetic operators such as addition, multiplication, subtraction, and division. Boolean algebra is therefore a formal way of describing logical operations, in the same way that elementary algebra describes numerical operations.
Boolean algebra was introduced by George Boole in his first book The Mathematical Analysis of Logic (1847), and set forth more fully in his An Investigation of the Laws of Thought (1854).
According to Huntington, the term "Boolean algebra" was first suggested by Henry M. Sheffer in 1913, although Charles Sanders Peirce gave the title "A Boolian Algebra with One Constant" to the first chapter of his "The Simplest Mathematics" in 1880. Boolean algebra has been fundamental in the development of digital electronics, and is provided for in all modern programming languages. It is also used in set theory and statistics.
History
A precursor of Boolean algebra was Gottfried Wilhelm Leibniz's algebra of concepts. The usage of binary in relation to the I Ching was central to Leibniz's characteristica universalis. It eventually created the foundations of algebra of concepts. Leibniz's algebra of concepts is deductively equivalent to the Boolean algebra of sets.
Boole's algebra predated the modern developments in abstract algebra and mathematical logic; it is however seen as connected to the origins of both fields. In an abstract setting, Boolean algebra was perfected in the late 19th century by Jevons, Schröder, Huntington and others, until it reached the modern conce |
https://en.wikipedia.org/wiki/Young%27s%20inequality%20for%20products | In mathematics, Young's inequality for products is a mathematical inequality about the product of two numbers. The inequality is named after William Henry Young and should not be confused with Young's convolution inequality.
Young's inequality for products can be used to prove Hölder's inequality. It is also widely used to estimate the norm of nonlinear terms in PDE theory, since it allows one to estimate a product of two terms by a sum of the same terms raised to a power and scaled.
Standard version for conjugate Hölder exponents
The standard form of the inequality is the following:
It can be used to prove Hölder's inequality.
This form of Young's inequality can also be proved via Jensen's inequality.
Young's inequality may equivalently be written as
Where this is just the concavity of the logarithm function.
Equality holds if and only if or
This also follows from the weighted AM-GM inequality.
Generalizations
Elementary case
An elementary case of Young's inequality is the inequality with exponent
which also gives rise to the so-called Young's inequality with (valid for every ), sometimes called the Peter–Paul inequality.
This name refers to the fact that tighter control of the second term is achieved at the cost of losing some control of the first term – one must "rob Peter to pay Paul"
Proof: Young's inequality with exponent is the special case However, it has a more elementary proof.
Start by observing that the square of every real number is zero or positive. Therefore, for every pair of real numbers and we can write:
Work out the square of the right hand side:
Add to both sides:
Divide both sides by 2 and we have Young's inequality with exponent
Young's inequality with follows by substituting and as below into Young's inequality with exponent
Matricial generalization
T. Ando proved a generalization of Young's inequality for complex matrices ordered
by Loewner ordering. It states that for any pair of complex matrices of ord |
https://en.wikipedia.org/wiki/Chevalley%20restriction%20theorem | In the mathematical theory of Lie groups, the Chevalley restriction theorem describes functions on a Lie algebra which are invariant under the action of a Lie group in terms of functions on a Cartan subalgebra.
Statement
Chevalley's theorem requires the following notation:
Chevalley's theorem asserts that the restriction of polynomial functions induces an isomorphism
.
Proofs
gives a proof using properties of representations of highest weight. give a proof of Chevalley's theorem exploiting the geometric properties of the map .
References
Lie groups
Lie algebras
Representation theory
Algebraic geometry |
https://en.wikipedia.org/wiki/International%20Academy%20for%20Production%20Engineering | The International Academy for Production Engineering (CIRP) is a professional body for research into production engineering. CIRP comes from the French acronym of College International pour la Recherche en Productique (CIRP).
CIRP was founded in 1951 as the International Institution for Production Engineering Research.
CIRP uses different platforms for scientific exchange. One of this is "CIRP Global Web Conference on Production Engineering Research" born in 2011.
The CSI of Naples University, Ing Fabrizio Pietrafesa provided technical support for multimedial contents
in 2014.
References
Further reading
Remmerswaal, Joost L. (Ed.) (1991) Forty years of CIRP : the history of the International Institution for Production Engineering Research, 1951-1991. International Academy for Production Engineering.
External links
https://www.cirp.net/
Organizations based in Paris
1951 establishments in France
Engineering organizations
Learned societies of France |
https://en.wikipedia.org/wiki/List%20of%20nonlinear%20ordinary%20differential%20equations | See also List of nonlinear partial differential equations and List of linear ordinary differential equations.
A–F
{|class="wikitable" style="background: white; color: black; text-align: left"
|-style="background: #eee"
!Name
!Order
!Equation
!Applications
|-
|Abel's differential equation of the first kind
|1
|
|Mathematics
|-
|Abel's differential equation of the second kind
|1
|
|Mathematics
|-
|Bellman's equation or Emden-Fowler's equation
|2
|
|Mathematics
|-
|Bernoulli equation
|1
|
|Mathematics
|-
|Besant-Rayleigh-Plesset equation
|2
|
|Fluid dynamics
|-
|Blasius equation
|3
|
|Blasius boundary layer
|-
|Chandrasekhar equation
|2
|
|Astrophysics
|-
|Chandrasekhar's white dwarf equation
|2
|
|Astrophysics
|-
|Chrystal's equation
|1
|
|Mathematics
|-
|Clairaut's equation
|1
|
|Mathematics
|-
|D'Alembert's equation
|1
|
|Mathematics
|-
|Darboux equation
|1
|
|Mathematics
|-
|De Boer-Ludford equation
|2
|
|Plasma physics
|-
|Duffing equation
|2
|
|Oscillators
|-
|Emden equation
|2
|
|Astrophysics
|-
|Euler's differential equation
|1
|
|Mathematics
|-
|Falkner–Skan equation
|3
|
|Falkner–Skan boundary layer
|}
G–K
{|class="wikitable" style="background: white; color: black; text-align: left"
|-style="background: #eee"
!Name
!Order
!Equation
!Applications
|-
|Ivey's equation
|2
|
|
|-
|Jacobi's differential equation
|1
|
|Mathematics
|-
|Kidder equation
|2
|
|Flow through porous medium
|-
|Krogdahl equation
|2
|
|Stellar pulsation
|}
L–Q
{|class="wikitable" style="background: white; color: black; text-align: left"
|-style="background: #eee"
!Name
!Order
!Equation
!Applications
|-
|Lane–Emden equation
|2
|
|Astrophysics
|-
|Langmuir equation
|2
|
|Environmental Engineering
|-
|Langmuir-Blodgett equation
|2
|
|
|-
|Langmuir-Boguslavski equation
|2
|
|
|-
|Liñán's equation
|2
|
|Combustion
|-
|Painlevé I transcendent
|2
|
|Mathematics
|-
|Painlevé II transcendent
|2
|
|Mathematics
|-
|Painlevé III transcendent
|2
|
|Mathematics
|-
|Painlevé |
https://en.wikipedia.org/wiki/Newton%27s%20minimal%20resistance%20problem | Newton's minimal resistance problem is a problem of finding a solid of revolution which experiences a minimum resistance when it moves through a homogeneous fluid with constant velocity in the direction of the axis of revolution, named after Isaac Newton, who studied the problem in 1685 and published it in 1687 in his Principia Mathematica. This is the first example of a problem solved in what is now called the calculus of variations, appearing a decade before the brachistochrone problem. Newton published the solution in Principia Mathematica without his derivation and David Gregory was the first person who approached Newton and persuaded him to write an analysis for him. Then the derivation was shared with his students and peers by Gregory.
According to I Bernard Cohen, in his Guide to Newton’s Principia, "The key to Newton’s reasoning was found in the 1880s, when the earl of Portsmouth gave his family’s vast collection of Newton’s scientific and mathematical papers to Cambridge University. Among Newton’s manuscripts they found the draft text of a letter, … in which Newton elaborated his mathematical argument. [This]
was never fully understood, however, until the publication of the major manuscript documents by D. T. Whiteside [1974], whose analytical and historical commentary has enabled students of Newton not only to follow fully Newton’s path to discovery and proof, but also Newton’s later (1694) recomputation of the surface of least resistance".
Even though Newton's model for the fluid was wrong as per our current understanding, the fluid he had considered finds its application in hypersonic flow theory as a limiting case.
Definition
In Proposition 34 of Book 2 of the Principia, Newton wrote, "If in a rare medium, consisting of equal particles freely disposed at equal distances from each other, a globe and a cylinder described on equal diameter move with equal velocities in the direction of the axis of the cylinder, the resistance of the globe will be but h |
https://en.wikipedia.org/wiki/ISO-IR-153 | ISO-IR-153 (ST SEV 358-88) is an 8-bit character set that covers the Russian and Bulgarian alphabets. Unlike the KOI encodings, this encoding lists the Cyrillic letters in their correct traditional order. This has become the basis for ISO/IEC 8859-5 and the Cyrillic Unicode block.
Standards and Naming
The name ISO-IR-153 refers to this set's number in the ISO-IR registry, and marks it as a set which may be used within ISO/IEC 2022.
ISO-IR-153 is a subset of ISO/IEC 8859-5 (synchronised with ECMA-113 since 1988). The ISO-IR-153 documentation cites ST SEV 358-88 as the source standard. While it also cites the earlier GOST 19768-74 (which defines KOI-8 and was conformed to by the first version of ECMA-113, i.e. ISO-IR-111), it does not follow the KOI-8 layout (rather using a close modification of the letter layout from the Main code page) so this appears to be in error. The ISO-IR-153 encoding was intended to replace GOST 19768-74, and is sometimes referred to as GOST-19768-87. This confusion has led to a common misconception that ISO-8859-5 was defined in or based on GOST 19768-74.
Notwithstanding the extents of their accuracy, the IANA lists , and as labels which may be used for the ISO-IR-153 encoding on the Internet, with reference to RFC 1345, which assigns it those labels.
GOST R 34.303-92 includes the ISO-IR-153 code page and dubs it KOI-8 V1 (in addition to using KOI-8 N1 and KOI-8 N2 for two Alternative code page/Code page 866 variants).
Character set
The following table shows the ISO-IR-153 encoding. Each character is shown with its equivalent Unicode code point.
The encoding closely resembles the letter subset of the Cyrillic part of the Main code page, apart from the relocation of the uppercase Ё from 0xF0 to 0xA1. ISO-8859-5 is a superset.
See also
ISO-IR-111
References
Character sets |
https://en.wikipedia.org/wiki/Limit%20and%20colimit%20of%20presheaves | In category theory, a branch of mathematics, a limit or a colimit of presheaves on a category C is a limit or colimit in the functor category .
The category admits small limits and small colimits. Explicitly, if is a functor from a small category I and U is an object in C, then is computed pointwise:
The same is true for small limits. Concretely this means that, for example, a fiber product exists and is computed pointwise.
When C is small, by the Yoneda lemma, one can view C as the full subcategory of . If is a functor, if is a functor from a small category I and if the colimit in is representable; i.e., isomorphic to an object in C, then, in D,
(in particular the colimit on the right exists in D.)
The density theorem states that every presheaf is a colimit of representable presheaves.
Notes
References
Category theory
Sheaf theory |
https://en.wikipedia.org/wiki/Ky%20Fan%20inequality%20%28game%20theory%29 | In mathematics, there are different results that share the common name of the Ky Fan inequality. The Ky Fan inequality presented here is used in game theory to investigate the existence of an equilibrium.
Another Ky Fan inequality is an inequality involving the geometric mean and arithmetic mean of two sets of real numbers of the unit interval.
Statement
Suppose that is a convex compact subset of a Hilbert space and that is a function from to satisfying
is lower semicontinuous for every and
is concave for every .
Then there exists such that
References
Game theory |
https://en.wikipedia.org/wiki/KOI8-F | KOI8-F or KOI8 Unified is an 8-bit character set. It was designed by Peter Cassetta of Fingertip Software (now defunct) as an attempt to support all the encoded letters from both KOI8-E (ISO-IR-111) and KOI8-RU (and hence also, KOI8-U and KOI8-R), along with some of the pseudographics from KOI8-R, with some additional punctuation in the remaining space, sourced partly from Windows-1251. This encoding was only used in the software of that company.
Character set
The following table shows the KOI8-F encoding. Each character is shown with its equivalent Unicode code point. Differences from ISO-IR-111 are boxed; other relevant encodings which are matched, if any, are noted in footnotes.
See also
KOI character encodings
References
Character sets |
https://en.wikipedia.org/wiki/Derived%20tensor%20product | In algebra, given a differential graded algebra A over a commutative ring R, the derived tensor product functor is
where and are the categories of right A-modules and left A-modules and D refers to the homotopy category (i.e., derived category). By definition, it is the left derived functor of the tensor product functor .
Derived tensor product in derived ring theory
If R is an ordinary ring and M, N right and left modules over it, then, regarding them as discrete spectra, one can form the smash product of them:
whose i-th homotopy is the i-th Tor:
.
It is called the derived tensor product of M and N. In particular, is the usual tensor product of modules M and N over R.
Geometrically, the derived tensor product corresponds to the intersection product (of derived schemes).
Example: Let R be a simplicial commutative ring, Q(R) → R be a cofibrant replacement, and be the module of Kähler differentials. Then
is an R-module called the cotangent complex of R. It is functorial in R: each R → S gives rise to . Then, for each R → S, there is the cofiber sequence of S-modules
The cofiber is called the relative cotangent complex.
See also
derived scheme (derived tensor product gives a derived version of a scheme-theoretic intersection.)
Notes
References
Lurie, J., Spectral Algebraic Geometry (under construction)
Lecture 4 of Part II of Moerdijk-Toen, Simplicial Methods for Operads and Algebraic Geometry
Ch. 2.2. of Toen-Vezzosi's HAG II
Algebraic geometry |
https://en.wikipedia.org/wiki/Active%20Shipbuilding%20Experts%27%20Federation | The Active Shipbuilding Experts' Federation is an international non-governmental organization. Its purpose is to contribute sound development of international maritime transportation and further enhancement of the world maritime safety, marine environment protection and maritime security, through communication and cooperation among the shipbuilding industry on technical agenda especially in International Maritime Organization. The federation's activities cover matters in relation to building new ships as well as repair conversions, offshore units.
Members
The Active Shipbuilding Experts' Federation has 10 members. which are constructing more than 90% of global share of new ship deliveries. Members are national shipbuilders' associations or a major shipbuilder in the absence of an association.
China Association of the National Shipbuilding Industry (CANSI)
Shipyard Association of India (SAI)
Indonesia Shipbuilding and Offshore Industry Association
The Shipbuilders' Association of Japan ()
Korea Offshore & Shipbuilding Association ()
Association of Marine Industries of Malaysia ()
Colombo Dockyard PLC (Sri Lanka)
Thai Shipbuilding and Repairing Association ()
Turkish Shipbuilders' Association ()
Shipbuilding Industry Corporation (in Vietnam)
Notes and references
External links
Active Shipbuilding Experts' Federation
Marine engineering organizations
Organizations based in Seoul |
https://en.wikipedia.org/wiki/Factorization%20homology | In algebraic topology and category theory, factorization homology is a variant of topological chiral homology, motivated by an application to topological quantum field theory and cobordism hypothesis in particular. It was introduced by David Ayala, John Francis, and Nick Rozenblyum.
References
External links
Homological algebra |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.