omniomni/omni-engineering huggingface dataset:
Binary Research. Binary Research Ltd was a company founded in Auckland, New Zealand, by Murray Haszard in 1991 after the sale of his previous company, B32 Software.

Binary Research initially considered developing competitors to the file transfer programs Blast and Laplink. The product to compete with Blast was dropped at an early stage, but a program to transfer files over parallel or serial cables was developed and marketed from 1994 to 1996 under several names, including Beam, UniBeam and LinkWiz. This program was available in DOS, Windows 3.x, OS/2 2.0 and SCO Unix versions, and claimed to transfer files more rapidly than Laplink at that time. Later versions of the program could also transfer files using a network cable.

Beam was not a financial success, as Laplink was the dominant product in that marketplace.

Binary Research's next product, arising from the file transfer and parallel port technologies of Beam, was Ghost, first sold in 1996. Ghost pioneered the field of disk cloning software. A network of agents was set up around the world, and a branch of Binary Research Ltd, Binary Research International Inc, was established in Glendale, Milwaukee County, Wisconsin as a sales and support centre.

Ghost was a very successful product, but Binary Research was a small company and was unable to drive the global sales force which Ghost needed. In 1998, Murray Haszard looked for a company which could acquire and develop Ghost further. Symantec expressed an interest, and after a unanimous vote of approval by Binary Research's New Zealand employees, Ghost was purchased by Symantec for US$27.5 million in July 1998. Almost all New Zealand employees of Binary Research became Symantec employees, and Ghost continued to be developed in Auckland for over ten years.

Binary Research Ltd was closed down after the acquisition, but Binary Research International Inc. continues as a reseller of Ghost, and has expanded into other software products. One of the most significant products BRI distributed was the UIU  (Universal Imaging Utility) which facilitates the creation of an image that can be deployed to a vast range of hardware, irrespective of brand, components and drivers.

References

External links 
Binary Research International Inc
Symantec press release

Defunct software companies of New Zealand
Gen Digital acquisitions
SOI. SOI or soi or variation may refer to:

Technology
 Silicon on insulator, in semiconductor manufacturing
 Signal operating instructions
 Service-oriented infrastructure
 Stages of involvement for safety-critical software and hardware, US FAA

Science
 Southern Oscillation Index
 Sphere of influence (astrodynamics)
 Second-order intercept point, a measure of linearity that quantifies second-order distortion generated by nonlinear systems and devices

Soi
 A soi is a side-street branching off a major street in Thailand.
 Soi (surname), a surname
 Soi language, an Iranian language
 Chua Soi Lek (born 1947), Malaysian politician

Other uses
 Sociosexual Orientation Inventory
 School of Infantry
 Severity of illness
 Solomon Islands, UNDP country code
 Sphere of influence,  in politics
 Symphony Orchestra of India
 Stars on Ice, a skating tour
 Statistics of Income of the US Internal Revenue Service
 Shadow of Israphel, a Minecraft series by The Yogscast
 Soi, an error in the Microsoft Sam text to speech voice when saying "soy" or "soi".

See also

 
 
 
 
 Pou-Soi
 Soy (disambiguation)
 SOJ (disambiguation)
 Soja (disambiguation)
 Soya (disambiguation)
 Soia (disambiguation)
North European Aerospace Test range. North European Aerospace Test range (NEAT) in Sweden is Europe's largest overland test range for aerospace systems.

It is a co-operation  by the Swedish Space Corporation and Swedish Defence Materiel Administration.

Its aim is to provide facilities and services for safe aerospace testing in one of the few parts of Europe which has very low population and almost no air-traffic.

Physical attributes
NEAT consists of two ranges in northern Sweden, Esrange Space Center outside Kiruna and Vidsel Test Range, that are combined with a bridging area in-between the two ranges.

Size
The total size of NEAT is 24,000 km2, and the one-way length is 350 km.

Restricted airspace
NEAT has two permanently restricted airspace areas.
 R01 covers Esrange Space Center and is 6,600 km2, GND/UNL altitude.
 R02 covers Vidsel Test Range and is 7,200 km2, GND/UNL altitude.

There is also four additional restricted airspace areas over the bridging area that are only used when needed.
 Over the west part, GND/3500 MSL
 Over the west part, 3500 MSL/FL200
 Over the whole area, 3500 MSL/FL330 in the west part and FL200/FL330 in the east part.
 Over the whole area, FL470/UNL

Suspended and restricted ground space

Restricted ground-space
 Esrange Rocket Impact Area is 5,200 km2.

Suspended ground-space
 Vidsel Test Range is 3,300 km2.

Notes

References

External links 
NEAT home: vidsel test range

Science and technology in Sweden
Military installations of Sweden
Toolchain. A toolchain is a set of software development tools used to build and otherwise develop software. Often, the tools are executed sequentially and form a pipeline such that the output of one tool is the input for the next. Sometimes the term is used for a set of related tools that are not necessarily executed sequentially.

A relatively common and simple toolchain consists of the tools to build for a particular operating system (OS) and CPU architecture; consisting of a compiler, a linker, and a debugger. With a cross-compiler, a toolchain can support cross-platform development.

For building more complex software systems, many other tools may be in the toolchain. For example, for a video game, the toolchain may include tools for preparing sound effects, music, textures, 3-dimensional models and animations, and for combining these resources into the finished product.

See also

References

Programming tools
CPU-bound. In computer science, a task, job or process is said to be CPU-bound (or compute-bound) when the time it takes for it to complete is determined principally by the speed of the central processor. The term can also refer to the condition a computer running such a workload is in, in which its processor utilization is high, perhaps at 100% usage for many seconds or minutes, and interrupts generated by peripherals may be processed slowly or be indefinitely delayed.

As applied to jobs
CPU-bound jobs will spend most of their execution time on actual computation ("number crunching") as opposed to e.g. communicating with and waiting for peripherals such as network or storage devices (which would make them I/O bound instead). Such jobs can often benefit from parallelization techniques such as multithreading if the underlying algorithm is amenable to it, allowing them to distribute their workload among multiple CPU cores and be limited by its multi-core rather than single-core performance.

As applied to computers

The concept of CPU-bounding was developed during early computers, when data paths between computer components were simpler, and it was possible to visually see one component working while another was idle. Example components were CPU, tape drives, hard disks, card-readers, and printers. Computers that predominantly used peripherals were characterized as I/O bound. Establishing that a computer is frequently CPU-bound implies that upgrading the CPU or optimizing code will improve the overall computer performance.

With the advent of multiple buses, parallel processing, multiprogramming, preemptive scheduling, advanced graphics cards, advanced sound cards and generally, more decentralized loads, it became less likely to identify one particular component as always being a bottleneck. It is likely that a computer's bottleneck shifts rapidly between components. Furthermore, in modern computers it is possible to have 100% CPU utilization with minimal impact to another component. Finally, tasks required of modern computers often emphasize quite different components, so that resolving a bottleneck for one task may not affect the performance of another. For these reasons, upgrading a CPU does not always have a dramatic effect. The concept of being CPU-bound is now one of many factors considered in modern computing performance.

See also
 I/O-bound
 Memory-bound

References

External links
 CPU bound description
 Stackoverflow CPU bound terminology

Computer performance
Free energy suppression conspiracy theory. Free energy suppression (or new energy suppression) is a conspiracy theory  that technologically viable, pollution-free, no-cost energy sources are being suppressed by governments, corporations, or advocacy groups. Devices allegedly suppressed include perpetual motion machines, cold fusion generators, torus-based generators, reverse-engineered extraterrestrial technology, anti-gravity propulsion systems, and other generally unproven or physically impossible, low-cost energy sources.

Claims
The alleged suppression (or weakening) is claimed to have occurred since the mid-19th century and allegedly perpetrated by various government agencies, corporate powers, special interest groups, and fraudulent inventors. The special interest groups are usually claimed to be associated with the fossil fuel or nuclear industry, whose business model would be threatened.

Claims of suppression include:
 The claim that the scientific community has controlled and suppressed research into alternative avenues of energy generation via the institutions of peer review and academic pressure.
 The claim that devices exist which are capable of extracting significant and usable power from pre-existing unconventional energy reservoirs, such as the quantum vacuum zero point energy, for little or no cost, but are being suppressed.
 The claim that related patents have been bought up, such as those for 100 mpg carburetors.

Some notable people who have been claimed to be suppressed, harassed, or killed for their research are Stanley Meyer, 
Eugene Mallove, 
and Nikola Tesla. Free energy proponents claim that Tesla developed a system (the Wardenclyffe Tower) that could generate unlimited energy for free. However, his system was only intended to transmit energy for free; the system's energy would still need to be generated through conventional means.

Notable proponents of the conspiracy theory include Gary McKinnon, a Scottish computer hacker who unlawfully accessed computer systems to look for evidence of a secret free energy device.

Followers of the Tartaria conspiracy theory believe an advanced civilization called Tartaria destroyed by a "mud flood" now covered up by the world's governments once had free wireless energy.

See also
Disclosure (ufology)
Gravitational energy
Invention Secrecy Act
List of topics characterized as pseudoscience
Potential cultural impact of extraterrestrial contact

References

Further reading
 

 
Alternative energy economics
Energy development
Interactive computation. In computer science, interactive computation is a mathematical model for computation that involves input/output communication with the external world during computation.

Uses

Among the currently studied mathematical models of computation that attempt to capture interaction are Giorgi Japaridze's hard- and easy-play machines elaborated within the framework of computability logic, Dina Q. Goldin's Persistent Turing Machines (PTMs), and Yuri Gurevich's abstract state machines. Peter Wegner has additionally done a great deal of work on this area of computer science .

See also
Cirquent calculus
Computability logic
Game semantics
Human-based computation
Hypercomputation
Interactive programming
Membrane computing
Quasi-empiricism
RE (complexity)
Super-recursive algorithm

References

Interactive Computation: The New Paradigm . Edited by D. Goldin, S. Smolka and P. Wegner. Springer, 2006.
 D. Goldin, Persistent Turing Machines as a model of interactive computation. Lecture Notes in Computer Science 1762, pp. 116-135.
 D. Goldin, S. Smolka, P. Attie, E. Sonderegger, Turing Machines, Transition Systems, and Interaction. J. Information and Computation 194:2 (2004), pp. 101-128
P. Wegner, Interactive foundations of computing.  Theoretical Computer Science 192 (1998), pp. 315-351.

External links

Abstract State Machines OUT DATED 2009
[https://en.wikipedia.org/wiki/Abstract_state_machine }

Theory of computation
Theoretical computer science
B32 Business Basic. B32 Business Basic was a competitor to Data General Business Basic written by Murray Haszard in 1986. It ran on the Data General Eclipse MV line of computers initially, and was ported to Unix in 1989 and to DOS in 1991.

B32 Software was the company that developed and supported B32 Business Basic, with the original site in Auckland, New Zealand, supplemented by a sales and support centre in Blue Ash, Ohio.

The B32 interpreter was highly compatible with Data General Business Basic (DGBB), but it also enhanced and extended that language in many ways. Like DGBB, B32 could access Data General's INFOS II database and it could use DGBB's lock server or its own improved version. B32 was over twice as fast for number crunching, string manipulation, and disk I/O. Many of the internal restrictions of DGBB were removed. B32 allowed 32,767 line numbers (65,535 in later versions), compared with DGBB's 9,999. B32 allowed more memory for programs, more simultaneous locks, and more files to be open at once. Language enhancements included a high-speed internal sort routine, do-while blocks, and the ability to step backwards through an indexed file. Debugging facilities were also significantly improved over DGBB.

B32 allowed programs to run with full cursor positioning and attribute support on non-Data General terminals, even programs which had Data General control sequences hard-coded into them.

B32 carried out all arithmetic at "quad precision", i.e. 64-bit, and emulated the "triple precision" and "double precision" versions of DGBB at runtime. This avoided the subtle incompatibilities between the two versions of DGBB.

On Unix and DOS, B32 emulated all commonly used system calls of Data General's AOS/VS and RDOS operating systems, including implementing its own symbolic links on SCO Xenix and DOS.

In 1991, a features war between B32 and one of its competitors, Transoft's Universal Business Basic, saw major improvements to the B32 language. B32 added a Bluebird Business Basic emulation mode, made line numbers optional, and added subroutine calls by name with parameter passing.

Transoft had greater financial resources than B32, and more effective marketing. It purchased B32 in 1992. The DOS and Unix versions of B32 were discarded as Universal Business Basic ran on those operating systems, but the Eclipse MV version of B32 continued to be sold while the MV line lasted. Some of the B32 Software staff in Blue Ash moved to Transoft's Atlanta, Georgia office. The New Zealand staff went on to found Binary Research.

References
DG Review article on the acquisition of B32 by Transoft

Data General
BASIC interpreters
Second-generation programming language. The label of second-generation programming language (2GL) is a generational way to categorize assembly languages.  They belong to the low-level programming languages.

The term was coined to provide a distinction from higher level machine independent third-generation programming languages (3GLs) (such as COBOL, C, or JavaScript) and earlier first-generation programming languages (machine code)

Second-generation programming language

Second-generation programming languages have the following properties:
Lines within a program correspond directly to processor commands, essentially acting as a mnemonic device overlaying a first generation programming language.
The code can be read and written by a programmer. To run on a computer it must be converted into a machine readable form, a process called assembly.
The language is specific to a particular processor family and environment.

Second-generation languages are sometimes used for parts of kernels or device drivers, and are sometimes used in video games, graphics programs, and other intensive programs.

In modern programs, second generation assembly languages are rarely used. Programming in second generation languages may yield speed benefits, but several disadvantages have led to its decline:

 Programming is expressed in terms of individual processor instructions, rather than higher level logic.
 Low-level memory and hardware details must be manually managed which is often bug-prone.
 Programs are machine-dependent, so different versions must be written for every target machine architecture.

The vast majority of programs are written in a third-generation programming language or a fourth-generation programming language. Assembly's main advantage, speed, has degraded by the fact that well written C code can often be as fast or even faster than handwritten assembly.

Second generation languages are perhaps most significant in their place in computing history. For a long time, Second generation assembly languages were the only good option for development for many machines, such as the NES or the Commodore 64. Second generation languages represented a massive step away from the tradition of programmers conforming to the needs of a machine, and the first step towards the machine accommodating for the programmer, a phenomenon that would be repeated in all subsequent programming language generations.

References

Programming language classification
Project Ozma. Project UAP Ozma  was a search for extraterrestrial intelligence (SETI) experiment started in 1960 by Cornell University astronomer Frank Drake, at the National Radio Astronomy Observatory, Green Bank at Green Bank, West Virginia. The object of the experiment was to search for signs of life in distant planetary systems through interstellar radio waves.  The program was named after Princess Ozma, ruler of the fictional land of Oz, inspired by L. Frank Baum's supposed communication with Oz by radio to learn of the events in the books taking place after The Emerald City of Oz.  The search was publicized in articles in the popular media of the time, such as Time magazine and was described as the first modern SETI experiment.

Drake used a radio telescope with a diameter of  to examine the stars Tau Ceti and Epsilon Eridani near the 1,420 MHz marker frequency, the equivalent of wavelength of 21 centimeters which corresponds to the energy of a photon emitted from a hydrogen atom during "spin-flip" transition. Both are nearby Sun-like stars that then seemed reasonably likely to have inhabited planets.  A 400 kilohertz band was scanned around the marker frequency, using a single-channel receiver with a bandwidth of 100 hertz. The information was stored on tape for off-line analysis. Some 150 hours of intermittent observation during a four-month period detected no recognizable signals.  A false signal was detected on April 8, 1960, but it was determined to have originated from a high-flying aircraft.

The receiver was tuned to wavelengths near 21 cm, which is the wavelength of radiation emitted naturally by interstellar hydrogen; it was thought that this would be familiar, as a kind of universal standard, to anyone attempting interstellar radio communication.

A second experiment, called Ozma II, was conducted with a larger () telescope at the same observatory by Patrick Palmer and Benjamin Zuckerman, who intermittently monitored 670 nearby stars for about four years (1972–76). They examined a 10 MHz bandwidth with 52 kHz resolution and a 625 kHz bandwidth with 4 kHz resolution.  The spectrometer was centered on the 21 cm hydrogen line in the rest frame of each observed star.

See also
 Ozma problem

References

Further reading
 Drake, F. D. "Project Ozma," Physics Today, 14, 140 (1961).
 Drake, Frank, "Project Ozma: The Search for Extraterrestrial Intelligence," Proceedings of the NRAO Workshop held at the National Radio Astronomy Observatory, Green Bank, West Virginia, Workshop No. 11, May 20-22, Kellermann, K.I., and Seielstad, G.A., eds., p.23 (1985).

1960 in science
1960 in West Virginia
Search for extraterrestrial intelligence
X.21. X.21, also referred to as X21, is an interface specification for differential communications introduced in the mid-1970s by the CCITT, now ITU-T. X.21 was the first digital signaling interface developed. The connector specification is defined by the ISO document 4903.

At the time, most physical layer protocols such as RS-232-C and RS-449 use analog signaling. X.21 was first introduced as a means to provide a digital signaling interface for telecommunications. This includes specifications for DTE/DCE physical interface elements, alignment of call control characters and error checking, elements of the call control phase for circuit switching services, and test loops.

X.21 normally is found on a 15-pin D-sub connector and is capable of running full-duplex data transmissions. The Signal Element Timing, or clock, is provided by the carrier (the telephone company), and is responsible for correct clocking of the data. X.21 was primarily used in Europe and Japan, for example in the Scandinavian DATEX and German  circuit-switched networks during the 1980s.

A variant of X.21 can be found in select legacy applications as “circuit switched X.21”.

Electrical characteristics 
Electrical characteristics for V.10 and V.11 specifies voltage levels. V.10 is for unbalanced circuits, whereas V.11 is for balanced circuits.

With electrical characteristics V.11, it provides synchronous data transmission at rates from 600 bit/s to 10 Mbit/s.

With electrical characteristics V.10, it provides transmission speeds of up to 100Kb/s.

External links 
An X.21 brief Tutorial and overview
X.21 pinout and some explanations

References 
Article based on X.21 at FOLDOC, and X.21 Pinouts, used with permission.

Physical layer protocols
ITU-T recommendations
ITU-T X Series Recommendations
Duricrust. Duricrust is a hard layer on or near the surface of soil. Duricrusts can range in thickness from a few millimeters or centimeters to several meters.

It is a general term (not to be confused with duripan) for a zone of chemical precipitation and hardening formed at or near the surface of sedimentary bodies through pedogenic or non-pedogenic processes. It is typically formed by the accumulation of soluble minerals deposited by mineral-bearing waters that move upward, downward, or laterally by capillary action, commonly assisted in arid settings by evaporation. There are different types of duricrusts, each distinguished by a dominant mineralogy. For example, ferricrete (laterite) is dominated by sesquioxides of iron; alcrete (bauxite) is dominated by sesquioxides of aluminum; silcrete by silica; calcrete (caliche) by calcium carbonate, and gypcrete (gypcrust) by gypsum.

Duricrust is often studied during missions to Mars because it may help prove the planet once had more water. Duricrust was found on Mars at the Viking 2 landing site, and a similar structure, nicknamed "Snow Queen", was found under the Phoenix landing site. Phoenix's duricrust was later confirmed to be water-based.

References

Further reading
 DILL, H.G., WEBER, B. and BOTZ, R. (2013) Metalliferous duricrusts (“orecretes”) - markers of weathering: A mineralogical and climatic-geomorphological approach to supergene Pb-Zn-Cu-Sb-P mineralization on different parent materials.- Neues Jahrbuch für Mineralogie Abhandlungen, 190: 123-195

External links
Description
NASA: The Sands of Mars

Soil
Sedimentary rocks