omniomni/omni-engineering huggingface dataset:
Logic for Computable Functions. Logic for Computable Functions (LCF) is an interactive automated theorem prover developed at Stanford and Edinburgh by Robin Milner and collaborators in early 1970s, based on the theoretical foundation of logic of computable functions previously proposed by Dana Scott. Work on the LCF system introduced the general-purpose programming language ML to allow users to write theorem-proving tactics, supporting algebraic data types, parametric polymorphism, abstract data types, and exceptions.

Basic idea 

Theorems in the system are terms of a special "theorem" abstract data type. The general mechanism of abstract data types of ML ensures that theorems are derived using only the inference rules given by the operations of the theorem abstract type. Users can write arbitrarily complex ML programs to compute theorems; the validity of theorems does not depend on the complexity of such programs, but follows from the soundness of the abstract data type implementation and the correctness of the ML compiler.

Advantages 

The LCF approach provides similar trustworthiness to systems that generate explicit proof certificates but without the need to store proof objects in memory. The Theorem data type can be easily implemented to optionally store proof objects, depending on the system's run-time configuration, so it generalizes the basic proof-generation approach. The design decision to use a general-purpose programming language for developing theorems means that, depending on the complexity of programs written, it is possible to use the same language to write step-by-step proofs, decision procedures, or theorem provers.

Disadvantages

Trusted computing base 

The implementation of the underlying ML compiler adds to the trusted computing base. Work on CakeML resulted in a formally verified ML compiler, alleviating some of these concerns.

Efficiency and complexity of proof procedures 

Theorem proving often benefits from decision procedures and theorem proving algorithms, whose correctness has been extensively analyzed. A straightforward way of implementing these procedures in an LCF approach requires such procedures to always derive outcomes from the axioms, lemmas, and inference rules of the system, as opposed to directly computing the outcome. A potentially more efficient approach is to use reflection to prove that a function operating on formulas always gives correct result.

Influences 

Among subsequent implementations is Cambridge LCF. Later systems simplified the logic to use total instead of partial functions, leading to HOL, HOL Light, and the Isabelle proof assistant that supports various logics. As of 2019, the Isabelle proof assistant still contains an implementation of an LCF logic, Isabelle/LCF.

Notes

References 

 
 
 
 
 

Logic in computer science
Proof assistants
ACL2. ACL2 (A Computational Logic for Applicative Common Lisp) is a software system consisting of a programming language, an extensible theory in a first-order logic, and an automated theorem prover. ACL2 is designed to support automated reasoning in inductive logical theories, mostly for software and hardware verification. The input language and implementation of ACL2 are written in Common Lisp. ACL2 is free and open-source software.

Overview
The ACL2 programming language is an applicative (side-effect free) variant of Common Lisp.  ACL2 is untyped. All ACL2 functions are total — that is, every function maps each object in the ACL2 universe to another object in its universe.

ACL2's base theory axiomatizes the semantics of its programming language and its built-in functions.  User definitions in the programming language that satisfy a definitional principle extend the theory in a way that maintains the theory's logical consistency.

The core of ACL2's theorem prover is based on term rewriting, and this core is extensible in that user-discovered theorems can be used as ad hoc proof techniques for subsequent conjectures.

ACL2 is intended to be an "industrial strength" version of the Boyer–Moore theorem prover, NQTHM.  Toward this goal, ACL2 has many features to support clean engineering of interesting mathematical and computational theories.  ACL2 also derives efficiency from being built on Common Lisp; for example, the same specification that is the basis for inductive verification can be compiled and run natively.

In 2005, the authors of the Boyer-Moore family of provers, which includes ACL2, received the ACM Software System Award "for pioneering and engineering a most effective theorem prover (...) as a formal methods tool for verifying safety-critical hardware and software."

Proofs

ACL2 has had numerous industrial applications. In 1995, J Strother Moore, Matt Kaufmann and Tom Lynch used ACL2 to prove the correctness of the floating point division operation of the AMD K5 microprocessor in the wake of the Pentium FDIV bug.

Industrial users of ACL2 include AMD, Arm, Centaur Technology, IBM, Intel, Oracle, and Collins Aerospace.

See also
List of proof assistants

References

External links
ACL2 website
ACL2s - ACL2 Sedan - An Eclipse-based interface developed by Peter Dillinger and Pete Manolios that includes powerful features to provide users with more automation and support for specifying conjectures and proving theorems with ACL2.

Lisp (programming language)
Common Lisp (programming language) software
Proof assistants
Free theorem provers
Lisp programming language family
Software using the BSD license
Computer telephony integration. Computer telephony integration, also called computer–telephone integration or CTI, is a common name for any technology that allows interactions on a telephone and a computer to be coordinated. The term is predominantly used to describe desktop-based interaction for helping users be more efficient, though it can also refer to server-based functionality such as automatic call routing.

See also
 Automatic number identification (ANI)
 Automatic call distributor
 Dialed Number Identification Service (DNIS)
 PhoneValet Message Center
 Predictive dialer
 Screen pop
 Telephony Application Programming Interface (TAPI)
 Telephony Server Application Programming Interface (TSAPI)
 Computer-supported telecommunications applications (CSTA)
 Multi-Vendor Integration Protocol

References

External links
 User Agent CSTA (uaCSTA) - TR/87 - ECMA International

 
Telephone service enhanced features
CTI. CTI may stand for:

Companies and organizations
 CTI Consultants, engineering consulting firm in Richmond, Virginia
 CTI Electronics Corporation, a manufacturer of industrial computer peripherals
 CTI Móvil, a Latin American mobile network operator
 CTI Records, a jazz record label
 CTI Renato Archer, a Brazilian research center
 Chung T'ien Television, CTi TV,  a cable television network in Taiwan
 City Telecom (Hong Kong), telecommunications provider
 Garda Counter-Terrorism International, a section of the Irish national police
 Connectivity Technologies, Inc., an American wire and cable company

Schools
 CTI Education Group higher education institution, South Africa
 Central Training Institute Jabalpur, India
 Curtiss-Wright Technical Institute, trade school for aircraft maintenance training
 DePaul University School of Computer Science, Telecommunications and Information Systems

Other
 Cyber threat intelligence, Cyber threat intelligence
 Canberra Tennis International, Australian tennis tournament
 Comparative Tracking Index, for measuring the electrical breakdown (tracking) properties of insulating material
 Computer telephony integration, technology allowing computers and telephones to be integrated or coordinated
 Cuito Cuanavale Airport, an Angolan airport, IATA code
 Cryptologic technician interpretive, a US Navy cryptologic technician rating
 Ivory Coast, ITU code
 Conquer the Island, a computer game mode where areas on a gamemap must be conquered
Mechanical wave. In physics, a mechanical wave is a wave that is an oscillation of matter, and therefore transfers energy through a material medium. 
(Vacuum is, from classical perspective, a non-material medium, where electromagnetic waves propagate.) 

While waves can move over long distances, the movement of the medium of transmission—the material—is limited. Therefore, the oscillating material does not move far from its initial equilibrium position. Mechanical waves can be produced only in media which possess elasticity and inertia. There are three types of mechanical waves: transverse waves, longitudinal waves, and surface waves. Some of the most common examples of mechanical waves are water waves, sound waves, and seismic waves.

Like all waves, mechanical waves transport energy. This energy propagates in the same direction as the wave. A wave requires an initial energy input; once this initial energy is added, the wave travels through the medium until all its energy is transferred. In contrast, electromagnetic waves require no medium, but can still travel through one.

Transverse wave

A transverse wave is the form of a wave in which particles of medium vibrate about their mean position perpendicular to the direction of the motion of the wave.

To see an example, move an end of a Slinky (whose other end is fixed) to the left-and-right of the Slinky, as opposed to to-and-fro. Light also has properties of a transverse wave, although it is an electromagnetic wave.

Longitudinal wave

Longitudinal waves cause the medium to vibrate parallel to the direction of the wave. It consists of multiple compressions and rarefactions. The rarefaction is the farthest distance apart in the longitudinal wave and the compression is the closest distance together. The speed of the longitudinal wave is increased in higher index of refraction, due to the closer proximity of the atoms in the medium that is being compressed. Sound is  a longitudinal wave.

Surface waves

This type of wave travels along the surface or interface between two media. An example of a surface wave would be waves in a pool, or in an ocean, lake, or any other type of water body. There are two types of surface waves, namely Rayleigh waves and Love waves.

Rayleigh waves, also known as ground roll, are waves that travel as ripples with motion similar to those of waves on the surface of water. Such waves are much slower than body waves, at roughly 90% of the velocity of  for a typical homogeneous elastic medium. Rayleigh waves have energy losses only in two dimensions and are hence more destructive in earthquakes than conventional bulk waves, such as P-waves and S-waves, which lose energy in all three directions.

A Love wave is a surface wave having horizontal waves that are shear or transverse to the direction of propagation. They usually travel slightly faster than Rayleigh waves, at about 90% of the body wave velocity, and have the largest amplitude.

Examples
Seismic waves
Sound waves
Wind waves on seas and lakes
Vibration

See also
Acoustics
Ultrasound
Underwater acoustics

References

Waves
Mechanics
T. O. Engset. Tore Olaus Engset  (May 8, 1865  – October, 1943 in Oslo) was a Norwegian mathematician and engineer who did pioneering work in the field of telephone traffic queuing theory.

Tore Olaus Engset was born at Stranda in Møre og Romsdal, Norway.  After he graduated school at the age of 18, Engset was admitted to the telegraph school in Stavanger in 1883. He received his certificate in a year and took employment. In his spare time he continued his studies, graduating in 1892 but continuing his university studies. Engset received an M.Sc. in physics and mathematics in 1894 at University of Oslo, after which he worked at Televerket as office worker, traffic analyst and from 1921 to 1922 and 1930–35 director general.

He developed the Engset formula in 1915, before the breakthroughs of A. K. Erlang from 1917.  His 1915 manuscript "Om beregningen av vælgere i et automatisk telefonsystem" (1915) was not, however, published until 1918. That work was translated to German as "Die Wahrscheinlichkeitsrechnung zur Bestimmung der Wählerzahl in automatischen Fernsprechämtern", in Elektrotechnische Zeitschrift, Heft 31, 1918. An English translation appeared in Arne Myskja, "On the Calculation of Switches in an Automatic Telephone System" in Telektronikk, 94(2):99-142, 1998.

He also published a work on nuclear physics (1927): "Die Bahnen und die Lichtstrahlung der Wasserstoffelektronen. Ergänzende Betrachtungen über Bahnformen und Strahlungsfrequenzen" (3 parts) in Annalen der Physik, 82 (1927) 1017; 83 (1927) 903; 84 (1927) 880.

References

Bibliography
Arne Myskja: T. Engset in New Light. The 14th Nordic Teletraffic Seminar (NTS-14), Lyngby, Denmark, August 18–20, 1998.
Arne Myskja: The Engset Report of 1915. Summary and Comments. Telektronikk, vol. 94, no. 2, pp. 143–153, 1998.
Arne Myskja, Ola Espvik: Tore Olaus Engset - The man behind the formula. Tapir Academic Press, Trondheim, Norway, 2002. .

1865 births
1943 deaths
People from Stranda
University of Oslo alumni
Norwegian mathematicians
Norwegian engineers
Queueing theorists
Anaerobic. Anaerobic means "living, active, occurring, or existing in the absence of free oxygen", as opposed to aerobic which means "living, active, or occurring only in the presence of oxygen." Anaerobic may also refer to:

Anaerobic adhesive, a bonding agent that does not cure in the presence of air
Anaerobic respiration, respiration in the absence of oxygen, using some other molecule as the final electron acceptor
Anaerobic organism, any organism whose redox metabolism does not depend on free oxygen
Anammox, anaerobic ammonium oxidation, a globally important microbial process of the nitrogen cycle
Anaerobic filter, an anaerobic digester with a tank containing a filter medium where anaerobic microbes can establish themselves
Anaerobic digestion, the use of anaerobic bacteria to break down waste, with biogas as a byproduct
Anaerobic clarigester, an anaerobic digester that treats dilute biodegradable feedstocks and allows different retention times for solids and liquids 
Anaerobic contact process, an anaerobic digester with a set of reactors in series
Hypoxia (environmental) (anaerobic environment), an environment with little or no available oxygen
Anaerobic lagoon, used to dispose of animal waste, particularly that of cows and pigs
Anaerobic exercise, exercise intense enough to cause lactate to form, used in non-endurance sports

See also
Aerobic (disambiguation)
Oxygen-free (disambiguation)
A300 (disambiguation). The Airbus A300 is a wide-body airliner.

A300 or A.300 may also refer to:
 A300 road, a main road in Great Britain
 Acorn Archimedes A300, a British home computer
 Aero A.300, a 1938 Czechoslovakian bomber aircraft
 Ansaldo A.300, a 1919 Italian general-purpose biplane aircraft
 Midland Highway (Victoria), a highway in Victoria, Australia bears the designation A300 for most of its route
 RFA Oakol (A300), a British fleet auxiliary vessel
 Weishi A300, a version of Chinese 300 mm rocket artillery
 AMD A300 platform, a system on a chip solution for AMD Ryzen processors
 А-300-538, a proposed Russian civilian ekranoplan
Plesiochronous system. In telecommunications, a plesiochronous system is one where different parts of the system are almost, but not quite, perfectly synchronised. According to ITU-T standards, a pair of signals are plesiochronous if their significant instants occur at nominally the same rate, with any variation in rate being constrained within specified limits. A sender and receiver operate plesiosynchronously if they operate at the same nominal clock frequency but may have a slight clock frequency mismatch, which leads to a drifting phase. The mismatch between the two systems' clocks is known as the plesiochronous difference.

In general, plesiochronous systems behave similarly to synchronous systems, except they must employ some means in order to cope with "sync slips", which will happen at intervals due to the plesiochronous nature of the system. The most common example of a plesiochronous system design is the plesiochronous digital hierarchy networking standard.

The asynchronous serial communication protocol is asynchronous on the byte level, but plesiochronous on the bit level. The receiver detects the start of a byte by detecting a transition that may occur at a random time after the preceding byte. The indefinite wait and lack of external synchronization signals makes byte detection asynchronous. Then the receiver samples at predefined intervals to determine the values of the bits in the byte; this is plesiochronous since it depends on the transmitter to transmit at roughly the same rate the receiver expects, without coordination of the rate while the bits are being transmitted.

The modern tendency in systems engineering is towards using systems that are either fundamentally asynchronous (such as Ethernet), or fundamentally synchronous (such as synchronous optical networking), and layering these where necessary, rather than using a mixture between the two in a single technology.

The term plesiochronous comes from the Greek πλησίος plesios ("near") and χρόνος chrónos ("time").

See also
 Buffer (telecommunication)
 Clock drift
 Isochronous timing
 Jitter
 Mesochronous network
 Synchronization in telecommunications

References

Network architecture
Synchronization
Asynchrony. Asynchrony is any dynamic far from synchronization. If and as parts of an asynchronous system become more synchronized, those parts or even the whole system can be said to be in sync.

Asynchrony or asynchronous may refer to:

Electronics and computing
 Asynchrony (computer programming), the occurrence of events independent of the main program flow, and ways to deal with such events
 Async/await
 Asynchronous system, a system having no global clock, instead operating under distributed control
 Asynchronous circuit, a sequential digital logic circuit not governed by a clock circuit or signal
 Asynchronous communication, transmission of data without the use of an external clock signal
 Asynchronous cellular automaton, a mathematical model of discrete cells which update their state independently
 Asynchronous operation, a sequence of operations executed out of time coincidence with any event
 Asynchronous I/O, an Input and Output operations that allow a program to continue executing other tasks without waiting for data to be transferred.

Other uses
 Asynchrony (game theory), when players in games update their strategies at different time intervals
 Asynchronous learning, an educational method in which the teacher and student are separated in time
 Asynchronous motor, a type of electric motor
 Asynchronous multiplayer, a form of multiplayer gameplay in video games
 Asynchronous muscles, muscles in which there is no one-to-one relationship between stimulation and contraction
 Collaborative editing or asynchronous editing, the practice of groups producing works together through individual contributions

See also
 async (album), 2017 album by Japanese musician and composer Ryuichi Sakamoto
Jean Stas. Jean Servais Stas (21 August 1813 – 13 December 1891) was a Belgian analytical chemist who accurately measured the atomic weight of carbon.

Life and work 

Stas was born in Leuven and trained initially as a physician. He later switched to chemistry and worked at the École Polytechnique in Paris under the direction of Jean-Baptiste Dumas. Stas and Dumas established the atomic weight of carbon by weighing a sample of the pure material, burning it in pure oxygen, and then weighing the carbon dioxide produced.

In 1840, Stas was appointed professor at the Royal Military School in Brussels. He acquired international fame by determining the atomic weights of the elements more accurately than had ever been done before, using an atomic mass of 16 for oxygen as his standard. His results disproved the hypothesis of the English physicist William Prout that all atomic weights must be integer multiples of that of hydrogen. These careful, accurate atomic weight measurements of Stas helped lay the foundation for the periodic system of elements of Dmitri Mendeleev and others.

Following the pioneering work of Lavoisier and his statement of the conservation of mass, the prolonged and exhaustive experiments of Stas supported the strict accuracy of this law in chemical reactions, even though they were carried out with other intentions. His research  indicated that in certain reactions the loss or gain could not have been more than from 2 to 4 parts in 100,000. The difference in the accuracy aimed at and attained by Lavoisier on the one hand, and by Morley and Stas on the other, is enormous.

In 1850, Stas gave the evidence that the Belgian Count Hippolyte Visart de Bocarmé killed his brother-in-law by poisoning him with nicotine.

Stas retired in 1869 because of problems with his voice caused by a throat ailment. He became commissioner of the mint, but resigned in 1872 because he disagreed with the government's monetary policy. Jean Stas died in Brussels and was buried at Leuven.

Honors and awards 

 Foreign Member, Royal Society of London (1879)
 Davy Medal (1885)
 

On May 5, 1891 an event was held recognizing the 50th anniversary of Jean Servais Stas' membership in the Royal Academy of Belgium. Various presenters spoke about his significant scientific contributions. He was presented with a medal in his honor sculpted by Belgian engraver Alphonse Michaux and with an album containing accolades authored by scientific societies from around the world.

Selected writings

 
 
 
 Stas, Jean Servais (1865). Nouvelles recherches sur les lois des proportions chimiques : sur les poids atomiques et leurs rapports mutuels. Brussels: Bruxelles. M. Hayez

See also 
 Theodore William Richards
 Law of reciprocal proportions
 Mass spectrometry
 Toxicology

Further reading 
 
 - translated into English by Ralph Oesper

References 

1813 births
1891 deaths
Belgian chemists
Scientists from Leuven
Foreign members of the Royal Society
Foreign associates of the National Academy of Sciences
Belgian toxicologists
Academic staff of the Royal Military Academy (Belgium)