source
stringlengths 31
203
| text
stringlengths 28
2k
|
|---|---|
https://en.wikipedia.org/wiki/Symantec%20Workspace%20Virtualization
|
Symantec Workspace Virtualization (abbreviated as SWV) is an application virtualization solution for Microsoft Windows by Symantec, now known as Symantec Endpoint Virtualization Suite (SEVS).
Originally pioneered by Altiris and based on technology acquired from FSLogic and named Software Virtualization Solution, SWV allows applications and data to be put into virtual layers (application layers and data layers) instead of being installed to the base file system and Registry. This is achieved through the use of a filter driver and layering technology Altiris acquired from FSLogic. By placing applications and data into managed layers called Virtual Software Packages (VSP's), SWV allows on-the-fly activation, deactivation, or resetting of applications, to avoid conflicts between applications, and to remove them cleanly without altering the base Windows installation.
Altiris was acquired by Symantec Corporation in 2007, who are the makers of Norton AntiVirus, amongst other things. SWV is available on a trial basis, but must be purchased to enable the full features. SWV is free for private use.
In 2008, Symantec acquired AppStream to incorporate the streaming of virtual applications. According to a quote from DABCC.com, this will "deliver virtualized, on-demand application delivery and management".
Previous names for SWV are the before-mentioned SVS and Software Virtualization Professional.
See also
Citrix XenApp
App-V
VMware ThinApp
References
External links
Altiris Software Virtualization Website
Symantec Website
SVS4All User Website
'Dutch SVS enthousiasts Dutch community of SVS adepts.
'German SVS/SWV site with SVS package downloads
Virtualization software
|
https://en.wikipedia.org/wiki/CDJ
|
A CDJ is a specialized digital music player for DJing. Originally designed to play music from compact discs, many CDJs can play digital music files stored on USB flash drives or SD cards. In typical use, at least two CDJs are plugged into a DJ mixer. CDJs have jog wheels and pitch faders that allow manipulation of the digital music similar to a vinyl record on a DJ turntable. Many have additional features such as loops and beat analysis that are not present on turntables. Additionally, some can function as DJ controllers to control the playback of digital files in DJ software running on a laptop instead of playing the files on the CDJ.
Many pro audio companies such as Gemini, Denon DJ, Numark, Stanton, and Vestax produced DJ quality CD players. In 1993 Denon DJ was the first to implement a 2-piece rackmounted dual-deck variable-pitch CD player with a jog wheel and instant cue button for DJs. It quickly became the industry standard and was widely adopted in most clubs and mobile DJs throughout the 90s up until 2004 when Pioneer made an impact with the CDJ-1000. Pioneer DJ CDJs have since become widely regarded as the industry standard.
The Pioneer CDJ-400, CDJ-800, CDJ-850K, CDJ-1000, CDJ-900, CDJ-2000 and the latest model CDJ-3000 have a vinyl emulation mode that allows the operator to manipulate music on a CD as if it were on a turntable. Models released prior to the CDJ-1000 lacked this feature. Pioneer CDJs released after the CDJ-400 can play from USB sticks as well as CDs. Pioneer integrated its software rekordbox with the CDJs to prepare music with cue points, accurate BPM, and search/playlist functions. For unknown reasons, the Pioneer CDJ-300 is left out of most popular accounts on CDJs.
1990s
CDJ-500
The CDJ-500 (known as the Mark 1 once the second version was released) was recognized by Pioneer DJ as their first CDJ CD player, released in 1994. However, there was a Pioneer CDJ-300 that was released in 1994 as a budget model for the CDJ-500.
The CDJ-50
|
https://en.wikipedia.org/wiki/Impulse%20noise%20%28acoustics%29
|
Impulse noise is a category of (acoustic) noise that includes unwanted, almost instantaneous (thus impulse-like) sharp sounds (like clicks and pops)—typically caused by electromagnetic interference, scratches on disks, gunfire, explosions, and synchronization issues in digital audio. High levels of such a noise (200+ decibels) may damage internal organs, while 180 decibels are enough to damage human ears.
An impulse noise filter can enhance the quality of noisy signals to achieve robustness in pattern recognition and adaptive control systems. A classic filter used to remove impulse noise is the median filter, at the expense of signal degradation. Thus it's quite common to get better performing impulse noise filters with model-based systems, which are programmed with the time and frequency properties of the noise to remove only impulse obliterated samples.
See also
Audio synchronizer
Crackling noise
Record restoration
Gaussian noise
References
Noise (electronics)
Acoustics
Sound
|
https://en.wikipedia.org/wiki/Privilege%20revocation%20%28computing%29
|
Privilege revocation is the act of an entity giving up some, or all of, the privileges they possess, or some authority taking those (privileged) rights away.
Information theory
Honoring the Principle of least privilege at a granularity provided by the base system such as sandboxing of (to that point successful) attacks to an unprivileged user account helps in reliability of computing services provided by the system. As the chances of restarting such a process are better, and other services on the same machine aren't affected (or at least probably not as much as in the alternative case: i.e. a privileged process gone haywire instead).
Computer security
In computing security privilege revocation is a measure taken by a program to protect the system against misuse of itself.
Privilege revocation is a variant of privilege separation whereby the program terminates the privileged part immediately after it has served its purpose. If a program doesn't revoke privileges, it risks the escalation of privileges.
Revocation of privileges is a technique of defensive programming.
References
Protection Profile for Privilege-Directed Content Authoriszor Ltd, Ref: Auth_CC/PP/DES/01, Issue 1.3, 22 December 2000
LOMAC: Low Water-Mark Integrity Protection for COTS Environments by Timothy Fraser
Information theory
Computer security procedures
|
https://en.wikipedia.org/wiki/Keith%20Diefendorff
|
Keith Diefendorff is a computer architect and veteran in the microprocessor industry.
Diefendorff is one of the persons that has led the industry in developing RISC processors, both for embedded systems and superscalar high performance systems. He is one of the main designers of the PowerPC family of processors.
Background
Keith Diefendorff started at Texas Instruments, designing integrated circuits processors and systems. Later Diefendorff joined Motorola and was the chief architect of a second-generation implementation of the 88000 instruction set architecture, the 88110. The 88110 was not a commercial success, and when Motorola shifted focus to creating a new RISC architecture with IBM, Diefendorff was assigned as chief architect for the PowerPC.
After his work at Motorola Diefendorrf moved to NexGen as director of technical x86-strategy. Diefendorff joined AMD when NexGen was acquired by AMD.
From AMD Diefendorrf then moved to Apple as architect for the AltiVec media extensions developed for the PowerPC processors used by Apple.
Keith Diefendorff has been working in the embedded processor space. First at the embedded processor IP-core company ARC International. After ARC Diefendorrf moved to MIPS Technologies.
Diefendorrf has also worked as processor analyst, and editor in chief (1998–2001) for the industry magazine Microprocessor Report.
References
External links
https://www.linkedin.com/pub/keith-diefendorff/41/bab/227
Year of birth missing (living people)
Living people
Computer architects
|
https://en.wikipedia.org/wiki/Archie%27s%20law
|
In petrophysics, Archie's law relates the in-situ electrical conductivity (C) of a porous rock to its porosity () and fluid saturation () of the pores:
Here, denotes the porosity, the electrical conductivity of the fluid saturated rock, represents the electrical conductivity of the aqueous solution (fluid or liquid phase), is the water saturation, or more generally the fluid saturation, of the pores, is the cementation exponent of the rock (usually in the range 1.8–2.0 for sandstones), is the saturation exponent (usually close to 2) and is the tortuosity factor.
Reformulated for the electrical resistivity (R), the inverse of the electrical conductivity , the equation reads
with for the total fluid saturated rock resistivity, and for the resistivity of the fluid itself (w meaning water or an aqueous solution containing dissolved salts with ions bearing electricity in solution).
The factor
is also called the formation factor, where (index standing for total) is the resistivity of the rock saturated with the fluid and is the resistivity of the fluid (index standing for water) inside the porosity of the rock. The porosity being saturated with the fluid (often water, ), .
In case the fluid filling the porosity is a mixture of water and hydrocarbon (petroleum, oil, gas), a resistivity index () can be defined:
Where is the resistivity of the rock saturated in water only.
It is a purely empirical law attempting to describe ion flow (mostly sodium and chloride) in clean, consolidated sands, with varying intergranular porosity. Electrical conduction is only performed by ions dissolved in aqueous solution. So, electrical conduction is considered to be absent in the rock grains of the solid phase or in organic fluids other than water (oil, hydrocarbon, gas).
Archie's law is named after Gus Archie (1907–1978) who developed this empirical quantitative relationship between porosity, electrical conductivity, and fluid saturation of rocks. Archie's law
|
https://en.wikipedia.org/wiki/Ns%20%28simulator%29
|
ns (from network simulator) is a name for a series of discrete event network simulators, specifically ns-1, ns-2, and ns-3. All are discrete-event computer network simulators, primarily used in research and teaching.
History
ns-1
The first version of ns, known as ns-1, was developed at Lawrence Berkeley National Laboratory (LBNL) in the 1995-97 timeframe by Steve McCanne, Sally Floyd, Kevin Fall, and other contributors. This was known as the LBNL Network Simulator, and derived in 1989 from an earlier simulator known as REAL by S. Keshav.
ns-2
Ns-2 began as a revision of ns-1. From 1997 to 2000, ns development was supported by DARPA through the VINT project at LBL, Xerox PARC, UC Berkeley, and USC/ISI. In 2000, ns-2 development was supported through DARPA with SAMAN and through NSF with CONSER, both at USC/ISI, in collaboration with other researchers including ACIRI.
Features of NS2
1. It is a discrete event simulator for networking research.
2. It provides substantial support to simulate bunch of protocols like TCP, FTP, UDP, https and DSR.
3. It simulates wired and wireless network.
4. It is primarily Unix based.
5. Uses TCL as its scripting languages.
6. Otcl: Object oriented support
7. Tclcl: C++ and otcl linkage
8. Discrete event schedule
Ns-2 incorporates substantial contributions from third parties, including wireless code from the UCB Daedelus and CMU Monarch projects and Sun Microsystems.
ns-3
In 2003, a team led by Tom Henderson, George Riley, Sally Floyd, and Sumit Roy, applied for and received funding from the U.S. National Science Foundation (NSF) to build a replacement for ns-2, called ns-3. This team collaborated with the Planete project of INRIA at Sophia Antipolis, with Mathieu Lacage as the software lead, and formed a new open source project.
In the process of developing ns-3, it was decided to completely abandon backward-compatibility with ns-2. The new simulator would be written from scratch, using the C++ programming language
|
https://en.wikipedia.org/wiki/Lemur%20%28input%20device%29
|
The Lemur was a highly customizable multi-touch device from French company JazzMutant founded by Yoann Gantch, Pascal Joguet, Guillaume Largillier and Julien Olivier in 2002, which served as a controller for musical devices such as synthesizers and mixing consoles, as well as for other media applications such as video performances. As an audio tool, the Lemur's role was equivalent to that of a MIDI controller in a MIDI studio setup, except that the Lemur used the Open Sound Control (OSC) protocol, a high-speed networking replacement for MIDI. The controller was especially well-suited for use with Reaktor and Max/MSP, tools for building custom software synthesizers.
Creating an interface
The Lemur came with its own proprietary software called the JazzEditor to create interfaces. Users could build interfaces using a selection of 15 different objects (including fader, knobs, pads, sliders...), group them as modules and arrange them using as many pages as needed. Each object could then receive any MIDI or OSC attribute. A particularity of the Lemur was the ability to modify the physical behavior of each object (for instance adding or removing friction on faders).
The internal memory of the Lemur enabled the storage of many interfaces, each one controlling a specific software for instance.
Discontinuation
JazzMutant discontinued production of the Lemur in 2010, citing competition from more mainstream multi-touch capable computers and tablets. The multi-touch interface was recreated as an iOS, macOS and Android app by the software company Liine (founded by Richie Hawtin).
In September 2022, Liine announced the discontinuation of the Lemur app.
Users
The Lemur had been used by several famous artists.
Alexander Hacke
Richie Hawtin
Matthew Herbert
Kraftwerk
Modeselektor
Emilie Simon
Daft Punk
See also
Haptic technology
References
Experimental musical instruments
Music hardware
|
https://en.wikipedia.org/wiki/GPU%20cluster
|
A GPU cluster is a computer cluster in which each node is equipped with a Graphics Processing Unit (GPU). By harnessing the computational power of modern GPUs via General-Purpose Computing on Graphics Processing Units (GPGPU), very fast calculations can be performed with a GPU cluster.
Hardware (GPU)
The hardware classification of GPU clusters fall into two categories:
Heterogeneous and Homogeneous.
Heterogeneous
Hardware from both of the major IHV's can be used (AMD and nVidia). Even if different models of the same GPU are used (e.g. 8800GT mixed with 8800GTX) the GPU cluster is considered heterogeneous.
Homogeneous
Every single GPU is of the same hardware class, make, and model. (i.e. a homogeneous cluster comprising 100 8800GTs, all with the same amount of memory)
Classifying a GPU cluster according to the above semantics largely directs software development on the cluster, as different GPUs have different capabilities that can be utilized.
Hardware (Other)
Interconnect
In addition to the computer nodes and their respective GPUs, a fast enough interconnect is needed in order to shuttle data amongst the nodes. The type of interconnect largely depends on the number of nodes present. Some examples of interconnects include Gigabit Ethernet and InfiniBand.
Vendors
NVIDIA provides a list of dedicated Tesla Preferred Partners (TPP) with the capability of building and delivering a fully configured GPU cluster using the Tesla 20-series GPGPUs. AMAX Information Technologies, Dell, Hewlett-Packard and Silicon Graphics are some of the few companies that provide a complete line of GPU clusters and systems.
Software
The software components that are required to make many GPU-equipped machines act as one include:
Operating System
GPU driver for the each type of GPU present in each cluster node.
Clustering API (such as the Message Passing Interface, MPI).
VirtualCL (VCL) cluster platform is a wrapper for OpenCL™ that allows most unmodified applications to transp
|
https://en.wikipedia.org/wiki/Line-in%20recording
|
Line-in recording is a term often used by manufacturers of sound equipment to refer to the capability of a device to record line level audio feeds. Microphone and instrument inputs, by contrast, are designed for devices which require further amplification to be at line-level.
The common 3.5 mm line-in connector has the left channel on the tip and right channel in the middle. The port is used to connect with other devices. Line-in is most commonly used for instruments.
References
Audio engineering
|
https://en.wikipedia.org/wiki/Schottky%20group
|
In mathematics, a Schottky group is a special sort of Kleinian group, first studied by .
Definition
Fix some point p on the Riemann sphere. Each Jordan curve not passing through p divides the Riemann sphere into two pieces, and we call the piece containing p the "exterior" of the curve, and the other piece its "interior". Suppose there are 2g disjoint Jordan curves A1, B1,..., Ag, Bg in the Riemann sphere with disjoint interiors. If there are Möbius transformations Ti taking the outside of Ai onto the inside of Bi, then the group generated by these transformations is a Kleinian group. A Schottky group is any Kleinian group that can be constructed like this.
Properties
By work of , a finitely generated Kleinian group is Schottky if and only if it is finitely generated, free, has nonempty domain of discontinuity, and all non-trivial elements are loxodromic.
A fundamental domain for the action of a Schottky group G on its regular points Ω(G) in the Riemann sphere is given by the exterior of the Jordan curves defining it. The corresponding quotient space Ω(G)/G is given by joining up the Jordan curves in pairs, so is a compact Riemann surface of genus g. This is the boundary of the 3-manifold given by taking the quotient (H∪Ω(G))/G of 3-dimensional hyperbolic H space plus the regular set Ω(G) by the Schottky group G, which is a handlebody of genus g. Conversely any compact Riemann surface of genus g can be obtained from some Schottky group of genus g.
Classical and non-classical Schottky groups
A Schottky group is called classical if all the disjoint Jordan curves corresponding to some set of generators can be chosen to be circles. gave an indirect and non-constructive proof of the existence of non-classical Schottky groups, and gave an explicit example of one. It has been shown by that all finitely generated classical Schottky groups have limit sets of Hausdorff dimension bounded above strictly by a universal constant less than 2. Conversely, has proved
|
https://en.wikipedia.org/wiki/Bedlam%20cube
|
The Bedlam cube is a solid dissection puzzle invented by British puzzle expert Bruce Bedlam.
Design
The puzzle consists of thirteen polycubic pieces: twelve pentacubes and one tetracube. The objective is to assemble these pieces into a 4 x 4 x 4 cube. There are 19,186 distinct ways of doing so, up to rotations and reflections.
The Bedlam cube is one unit per side larger than the 3 x 3 x 3 Soma cube, and is much more difficult to solve.
History
Two of the BBC's 'Dragons' from Dragons' Den, Rachel Elnaugh and Theo Paphitis, were to invest in the Bedlam cube during the 2005 series. They offered £100,000 for a 30% share of equity in Bedlam Puzzles. Danny Bamping (the entrepreneur behind Bedlam cube) finally chose a bank loan instead of their investment, as seen in the relevant "Where Are They Now" episode of Dragons' Den.
Records
According to Guinness World Records, the official world record for assembling the Bedlam Cube is 11.03 seconds by Danny Bamping on 9 November 2006. The blindfolded record is 27.21 seconds by Aleksandr Iljasov on 25 February 2008.
See also
Slothouber–Graatsma puzzle
Conway puzzle
Polycube
Soma cube
References
External links
The Official Site of Bedlam Puzzles (as was, 2011: last valid archive copy)
Bedlam Cube solver
All 19,186 Bedlam Cube Solutions
Bedlam Cube Demonstration Software
Tiling puzzles
Mechanical puzzle cubes
|
https://en.wikipedia.org/wiki/Holding%20period%20return
|
In finance, holding period return (HPR) is the return on an asset or portfolio over the whole period during which it was held. It is one of the simplest and most important measures of investment performance.
HPR is the change in value of an investment, asset or portfolio over a particular period. It is the entire gain or loss, which is the sum income and capital gains, divided by the value at the beginning of the period.
HPR = (End Value - Initial Value) / Initial Value
where the End Value includes income, such as dividends, earned on the investment:
where is the value at the start of the holding period and is the total value at the end of the holding period.
Annualizing the holding period return
Over multiple years
To annualize a holding period return means to find the equivalent rate of return per year. Assuming income and capital gains and losses are reinvested, i.e. retained in the portfolio, then:
t being the length of the holding period, measured in years. For example, if you have held the item for half a year, t would equal 1/2, so 1/t would equal 2. (However, investment performance professionals generally advise against quoting annualized return over a holding period of less than a year).
From quarterly holding period returns
To calculate an annual HPR from four quarterly HPRs, it is necessary to know whether income is reinvested within each quarter or not.
If HPR1 through HPR4 are the holding period returns for four consecutive periods, assuming that income is reinvested, the annual HPR obeys the relation:
To the right is an example of a stock investment of one share purchased at the beginning of the year for $100. Assume dividends are not reinvested.
At the end of the first quarter the stock price is $98. The stock share bought for $100 can only be sold for $98, which is the value of the investment at the end of the first quarter. This is less than the purchase price, so the investment has suffered a capital loss. The first quarter holding per
|
https://en.wikipedia.org/wiki/Subclade
|
In genetics, a subclade is a subgroup of a haplogroup.
Naming convention
Although human mitochondrial DNA (mtDNA) and Y chromosome DNA (Y-DNA) haplogroups and subclades are named in a similar manner, their names belong to completely separate systems.
mtDNA
mtDNA haplogroups are defined by the presence of a series of single-nucleotide polymorphism (SNP) markers in the hypervariable regions and the coding region of mitochondrial DNA. They are named with the capital letters A through Z, with further subclades named using numbers and lower case letters.
Y-DNA
Y-DNA haplogroups are defined by the presence of a series of SNP markers on the Y chromosome. Subclades are defined by a terminal SNP, the SNP furthest down in the Y chromosome phylogenetic tree.
Human Y-DNA
The Y Chromosome Consortium (YCC) developed a system of naming major human Y-DNA haplogroups with the capital letters A through T, with further subclades named using numbers and lower case letters (YCC longhand nomenclature). YCC shorthand nomenclature names Y-DNA haplogroups and their subclades with the first letter of the major Y-DNA haplogroup followed by a dash and the name of the defining terminal SNP. Y-DNA haplogroup nomenclature is changing over time to accommodate the increasing number of SNPs being discovered and tested, and the resulting expansion of the Y chromosome phylogenetic tree. This change in nomenclature has resulted in inconsistent nomenclature being used in different sources. This inconsistency, and increasingly cumbersome longhand nomenclature, has prompted a move towards using the simpler shorthand nomenclature.
See also
Clade
Cladistics
Haplotype
References
Genetics
Genetic genealogy
|
https://en.wikipedia.org/wiki/IC%20programming
|
IC programming is the process of transferring a computer program into an integrated computer circuit. Older types of IC including PROMs and EPROMs and some early programmable logic was typically programmed through parallel busses that used many of the device's pins and basically required inserting the device in a separate programmer.
Modern ICs are typically programmed in circuit though a serial protocol (sometimes JTAG sometimes something manufacturer specific). Some (particularly FPGAs) even load the data serially from a separate flash or prom chip on every startup.
Notes
Embedded systems
|
https://en.wikipedia.org/wiki/Schwartz%E2%80%93Bruhat%20function
|
In mathematics, a Schwartz–Bruhat function, named after Laurent Schwartz and François Bruhat, is a complex valued function on a locally compact abelian group, such as the adeles, that generalizes a Schwartz function on a real vector space. A tempered distribution is defined as a continuous linear functional on the space of Schwartz–Bruhat functions.
Definitions
On a real vector space , the Schwartz–Bruhat functions are just the usual Schwartz functions (all derivatives rapidly decreasing) and form the space .
On a torus, the Schwartz–Bruhat functions are the smooth functions.
On a sum of copies of the integers, the Schwartz–Bruhat functions are the rapidly decreasing functions.
On an elementary group (i.e., an abelian locally compact group that is a product of copies of the reals, the integers, the circle group, and finite groups), the Schwartz–Bruhat functions are the smooth functions all of whose derivatives are rapidly decreasing.
On a general locally compact abelian group , let be a compactly generated subgroup, and a compact subgroup of such that is elementary. Then the pullback of a Schwartz–Bruhat function on is a Schwartz–Bruhat function on , and all Schwartz–Bruhat functions on are obtained like this for suitable and . (The space of Schwartz–Bruhat functions on is endowed with the inductive limit topology.)
On a non-archimedean local field , a Schwartz–Bruhat function is a locally constant function of compact support.
In particular, on the ring of adeles over a global field , the Schwartz–Bruhat functions are finite linear combinations of the products over each place of , where each is a Schwartz–Bruhat function on a local field and is the characteristic function on the ring of integers for all but finitely many . (For the archimedean places of , the are just the usual Schwartz functions on , while for the non-archimedean places the are the Schwartz–Bruhat functions of non-archimedean local fields.)
The space of Schwartz–Bruhat function
|
https://en.wikipedia.org/wiki/Terrestrial%20animal
|
Terrestrial animals are animals that live predominantly or entirely on land (e.g. cats, chickens, ants, spiders), as compared with aquatic animals, which live predominantly or entirely in the water (e.g. fish, lobsters, octopuses), and amphibians, which rely on aquatic and terrestrial habitats (e.g. frogs and newts). Some groups of insects are terrestrial, such as ants, butterflies, earwigs, cockroaches, grasshoppers and many others, while other groups are partially aquatic, such as mosquitoes and dragonflies, which pass their larval stages in water.
Terrestrial classes
The term "terrestrial" is typically applied to species that live primarily on the ground, in contrast to arboreal species, which live primarily in trees.
There are other less common terms that apply to specific groups of terrestrial animals:
Saxicolous creatures are rock dwelling. "Saxicolous" is derived from the Latin word saxum, meaning a rock.
Arenicolous creatures live in the sand.
Troglofauna predominantly live in caves.
Taxonomy
Terrestrial invasion is one of the most important events in the history of life. Terrestrial lineages evolved in several animal phyla, among which arthropods, vertebrates and mollusks are representatives of more successful groups of terrestrial animals.
Terrestrial animals do not form a unified clade; rather, they share only the fact that they live on land. The transition from an aquatic to terrestrial life by various groups of animals has occurred independently and successfully many times. Most terrestrial lineages originated under a mild or tropical climate during the Paleozoic and Mesozoic, whereas few animals became fully terrestrial during the Cenozoic.
If internal parasites are excluded, free living species in terrestrial environments are represented by the following eleven phyla:
Gastrotrichs (hairy-backs) live in transient terrestrial water and go dormant during desiccation
Rotifers (wheel animals) live in transient terrestrial water and go dormant durin
|
https://en.wikipedia.org/wiki/Reservoir%20engineering
|
Reservoir engineering is a branch of petroleum engineering that applies scientific principles to the fluid flow through a porous medium during the development and production of oil and gas reservoirs so as to obtain a high economic recovery. The working tools of the reservoir engineer are subsurface geology, applied mathematics, and the basic laws of physics and chemistry governing the behavior of liquid and vapor phases of crude oil, natural gas, and water in reservoir rock. Of particular interest to reservoir engineers is generating accurate reserves estimates for use in financial reporting to the SEC and other regulatory bodies. Other job responsibilities include numerical reservoir modeling, production forecasting, well testing, well drilling and workover planning, economic modeling, and PVT analysis of reservoir fluids. Reservoir engineers also play a central role in field development planning, recommending appropriate and cost-effective reservoir depletion schemes such as waterflooding or gas injection to maximize hydrocarbon recovery. Due to legislative changes in many hydrocarbon-producing countries, they are also involved in the design and implementation of carbon sequestration projects in order to minimise the emission of greenhouse gases.
Types
Reservoir engineers often specialize in two areas:
Surveillance engineering, i.e. monitoring of existing fields and optimization of production and injection rates. Surveillance engineers typically use analytical and empirical techniques to perform their work, including decline curve analysis, material balance modeling, and inflow/outflow analysis.
Dynamic modeling, i.e. the conduct of reservoir simulation studies to determine optimal development plans for oil and gas reservoirs. Also, reservoir engineers perform and integrate well tests into their data for reservoirs in geothermal drilling.
The dynamic model combines the static model, pressure- and saturation-dependent properties, well locations and geometrie
|
https://en.wikipedia.org/wiki/Cytomics
|
Cytomics is the study of cell biology (cytology) and biochemistry in cellular systems at the single cell level. It combines all the bioinformatic knowledge to attempt to understand the molecular architecture and functionality of the cell system (Cytome). Much of this is achieved by using molecular and microscopic techniques that allow the various components of a cell to be visualised as they interact in vivo.
Cytome
Cytomes are the cellular systems, subsystems, and functional components of the
body. The cytome is the collection of the complex and dynamic cellular processes (structure and function) underlying physiological processes. It describes the structural and functional heterogeneity of the cellular diversity of an organism.
Human Cytome Project
The Human Cytome Project is aimed at the study of the biological system structure and function of an organism at the cytome level.
See also
Flow cytometry
Genomics
Omics
Proteomics
Lipidomics
List of omics topics in biology
Metabolomics
References
Further reading
Bernas T., Gregori G., Asem E. K., Robinson J. P., Integrating cytomics and proteomics, Mol Cell Proteomics. 2006 Jan;5(1):2-13.
Herrera G., Diaz L., Martinez-Romero A., Gomes A., Villamon E., Callaghan R. C., O'connor J. E., Cytomics: A multiparametric, dynamic approach to cell research, Toxicol In Vitro. 2006 Jul 22.
Kriete A., Cytomics in the realm of systems biology, Cytometry A. 2005 Nov;68(1):19-20.
Murphy R. F., Cytomics and location proteomics: automated interpretation of subcellular patterns in fluorescence microscope images, Cytometry A. 2005 Sep;67(1):1-3.
Schubert W., Cytomics in characterizing toponomes: towards the biological code of the cell, Cytometry A. 2006 Apr;69(4):209-11.
Van Osta P., Ver Donck K., Bols L., Geysen J., Cytomics and drug discovery., Cytometry A. 2006 Mar;69(3):117-8.
Cell biology
|
https://en.wikipedia.org/wiki/DragonflyTV
|
DragonflyTV is an Emmy Award-winning science education television series produced by Twin Cities Public Television. The show aired on PBS Kids and PBS Kids Go! from January 19, 2002, to December 20, 2008. It was aimed at ages 9–12. Seasons 1–4 were co-hosted by Michael Brandon Battle and Mariko Nakasone. Seasons 5–7 were hosted by Eric Artell and were produced in partnership with science museums. DragonflyTV was created in collaboration with Project Dragonfly at Miami University, which founded Dragonfly magazine, the first national magazine to feature children's investigations, experiments, and discoveries. DragonflyTV pioneered a "real kids, real science" approach to children's science television and led to the development of the SciGirls television series. DragonflyTV and SciGirls were funded in part by the National Science Foundation to provide a national forum for children's scientific investigations. Reruns of DragonflyTV aired on select PBS stations until 2010, and later in off-network cable syndication to allow commercial stations to meet federal E/I mandates.
Episodes
Season 1 (2002)
Season 2 (2003)
Teams of DFTV's kid scientists demonstrate different approaches to investigations – experimental, engineering, and observational.
Season 3 (2004)
Season 4 (2005)
Season 5 (2006)
Season 6 (2007)
Season 7 (2008)
References
External links
Twin Cities Public Television
2002 American television series debuts
2008 American television series endings
2000s American children's television series
2000s American reality television series
American children's education television series
American children's reality television series
English-language television shows
PBS Kids shows
PBS original programming
Mathematics education television series
Science education television series
Television series about children
|
https://en.wikipedia.org/wiki/Almen%20strip
|
An Almen strip is a thin strip of SAE 1070 steel used to quantify the intensity of a shot peening process.
Developed and patented by John O. Almen, the strip was originally supported by 2 knife edges; later improvements see it being supported on 4 small balls. The strip is placed in the chamber in place of the item to be shot peened, usually near to an area of the item where the result is deemed critical, sometimes located by a special fixture. Compressive stress introduced by the peening operation causes the strip to deform into an arch, which is measured using a gauge.
Almen strips are classified into 3 types: 'A', 'N', and 'C'. They differ in their thickness, while they have the same width and length.
Almen strip of "A" type is predominantly used for shot peening with cast shot or cut wire shot.
"N" type strips are used usually for glass bead peen and ceramic bead peen.
"C" type almen strips are used more rarely and are thicker than the other types.
Although similar, the specification for Almen strip dimensions of the same type slightly vary from one company/organization to another. The Almen strips are made from plain carbon steel SAE 1070 and have hardness about 45 HRC.
This test is widely used and the requirements for check are specified in standards.
The most rigid requirements are applicable for Almen strips and checking devices (Almen gauges) used in the aerospace industry. The generic requirements can be found in SAE specifications.
Another operation to gauge the intensity of a shot peening process is the use of an Almen round, developed by R. Bosshard.
External links
Shot Peening Universe FAQ
Industrial Metal Finishing, Inc. Glossary Comprehensive glossary of Metal Finishing terms and process descriptions, including Almen Strip
Peening Accessories GmbH: Comprehensive information about peening, including Almen strips
About Almen strips
Certified Almen Strip Supplier https://pgmetalcomp.com/capabilities
Shot peening
Measurement
|
https://en.wikipedia.org/wiki/Tap%20converter
|
The tap converter is a variation on the cycloconverter, invented in 1981 by New York City electrical engineer Melvin Sandler and significantly functionally enhanced in 1982 through 1984 by graduate students Mariusz Wrzesniewski, Bruce David Wilner, and Eddie Fung. Whereas the cycloconverter switches among a variety of staggered input phases to piece together an extremely jagged output signal, the tap converter synthesizes a much smoother signal by switching among a variety of (obviously synchronized) transformer output taps.
Tap positions
Both linear spacing and power-of-two-style Vernier spacing can be employed in establishing the tap positions, e.g., a four-tap transformer can provide taps at 0.25, 0.5, 0.75, 1.0 (linear) or 0.0625, 0.125, 0.25, and 0.5 (Vernier). (The limitations of the Vernier—in this case, that the maximum obtainable amplitude is 0.9375—are less discernible as more taps are added.)
Scott transformer
By employing a Scott transformer input connection, in order to provide a quadrature phase, an even smoother output waveform can be obtained.
Prototypes
Prototypes of the device were constructed and field-tested under a variety of conditions—nominally as a variable-speed constant-frequency (VSCF) power source for military aircraft—and ornate computer models were constructed for exploring more ornery considerations, such as flux leakage, hysteresis, and practical thyristor characteristics. All of this work was performed at New York's Cooper Union for the Advancement of Science and Art.
Applications
As of 2007, the tap converter remains uncommercialized but is used in several military applications due to the minimal output harmonics.
See also
Constant speed drive
Electric motor
Variable-frequency drive
References
Electronic circuits
Electric power conversion
Electrical engineering
|
https://en.wikipedia.org/wiki/C-Bus%20%28protocol%29
|
C-Bus is a communications protocol based on a seven layer OSI model for home and building automation that can handle cable lengths up to 1000 metres using Cat-5 cable. It is used in Australia, New Zealand, Asia, the Middle East, Russia, United States, South Africa, the UK and other parts of Europe including Greece and Romania. C-Bus was created by Clipsal Australia's Clipsal Integrated Systems division (now part of Schneider Electric) for use with its brand of home automation and building lighting control system. C-Bus has been briefly available in the United States but Schneider Electric has now discontinued sales in the United States.
C-Bus is used in the control of domotics, or home automation systems, as well as commercial building lighting control systems.
Unlike the more common X10 protocol which uses a signal imposed upon the AC power line, C-Bus uses a dedicated low-voltage cable or two-way wireless network to carry command and control signals. This improves the reliability of command transmission and makes C-Bus far more suitable for large, commercial applications than X10.
C-Bus System
The C-Bus System can be used to control lighting and other electrical systems and products automatically or via remote control and can also be interfaced to a home security system, AV products or other electrical items. The C-Bus system is available in a wired version and a wireless version, with a gateway available to allow messages to be sent between wired and wireless networks.
The wired C-Bus system uses a standard category 5 UTP (Unshielded Twisted Pair) cable as its network communications cable and does not require end of line termination. Clipsal manufactures a specific category 5 cable for use within electrical distribution panels. This cable has a pink outer sheath which is rated to ensure adequate electrical isolation between the mains voltages found in distribution panels and the extra low voltage C-Bus. Outside of distribution panels standard category 5
|
https://en.wikipedia.org/wiki/Passive%20radiator%20%28speaker%29
|
A speaker enclosure using a passive radiator (PR) usually contains an "active loudspeaker" (or main driver), and a passive radiator (also known as a "drone cone"). The active loudspeaker is a normal driver, and the passive radiator is of similar construction, but without a voice coil and magnet assembly. It is not attached to a voice coil or wired to an electrical circuit or power amplifier. Small and Hurlburt have published the results of research into the analysis and design of passive-radiator loudspeaker systems. The passive-radiator principle was identified as being particularly useful in compact systems where vent realization is difficult or impossible, but it can also be applied satisfactorily to larger systems.
In the same way as a ported loudspeaker, a passive radiator system uses the sound pressure otherwise trapped in the enclosure to excite a resonance that makes it easier for the speaker system to create the deepest pitches (e.g., basslines). The passive radiator resonates at a frequency determined by its mass and the springiness (compliance) of the air in the enclosure. It is tuned to the specific enclosure by varying its mass (e.g., by adding weight to the cone). Internal air pressure produced by movements of the active driver cone moves the passive radiator cone. This resonance simultaneously reduces the amount that the woofer has to move.
Design considerations
Passive radiators are used instead of a reflex port for several reasons. In small-volume enclosures tuned to low frequencies, the length of the required port becomes very large. They are also used to reduce or eliminate the objectionable noises of port turbulence and compressive flow caused by high-velocity airflow in small ports. In addition, ports have pipe resonances that can produce undesirable effects on the frequency response. To a first-order approximation, the passive radiator works identically to a port.
Passive radiators are tuned by mass variations (Mmp), changing the way that t
|
https://en.wikipedia.org/wiki/Ramanujan%27s%20sum
|
In number theory, Ramanujan's sum, usually denoted cq(n), is a function of two positive integer variables q and n defined by the formula
where (a, q) = 1 means that a only takes on values coprime to q.
Srinivasa Ramanujan mentioned the sums in a 1918 paper. In addition to the expansions discussed in this article, Ramanujan's sums are used in the proof of Vinogradov's theorem that every sufficiently large odd number is the sum of three primes.
Notation
For integers a and b, is read "a divides b" and means that there is an integer c such that Similarly, is read "a does not divide b". The summation symbol
means that d goes through all the positive divisors of m, e.g.
is the greatest common divisor,
is Euler's totient function,
is the Möbius function, and
is the Riemann zeta function.
Formulas for cq(n)
Trigonometry
These formulas come from the definition, Euler's formula and elementary trigonometric identities.
and so on (, , , ,.., ,...). cq(n) is always an integer.
Kluyver
Let Then is a root of the equation . Each of its powers,
is also a root. Therefore, since there are q of them, they are all of the roots. The numbers where 1 ≤ n ≤ q are called the q-th roots of unity. is called a primitive q-th root of unity because the smallest value of n that makes is q. The other primitive q-th roots of unity are the numbers where (a, q) = 1. Therefore, there are φ(q) primitive q-th roots of unity.
Thus, the Ramanujan sum cq(n) is the sum of the n-th powers of the primitive q-th roots of unity.
It is a fact that the powers of are precisely the primitive roots for all the divisors of q.
Example. Let q = 12. Then
and are the primitive twelfth roots of unity,
and are the primitive sixth roots of unity,
and are the primitive fourth roots of unity,
and are the primitive third roots of unity,
is the primitive second root of unity, and
is the primitive first root of unity.
Therefore, if
is the sum of the n-th powers of all the roots
|
https://en.wikipedia.org/wiki/Vesicular%20transport%20adaptor%20protein
|
Vesicular transport adaptor proteins are proteins involved in forming complexes that function in the trafficking of molecules from one subcellular location to another. These complexes concentrate the correct cargo molecules in vesicles that bud or extrude off of one organelle and travel to another location, where the cargo is delivered. While some of the details of how these adaptor proteins achieve their trafficking specificity has been worked out, there is still much to be learned.
There are several human disorders associated with defects in components of these complexes including Alzheimer's and Parkinson's diseases.
The proteins
Most of the adaptor proteins are heterotetramers. In the AP complexes, there are two large proteins (~100 kD) and two smaller proteins. One of the large proteins is termed β (beta), with β1 in the AP-1 complex, β2 in the AP-2 complex, and so on. The other large protein has different designations in the different complexes. In AP-1 it is named γ (gamma), AP-2 has α (alpha), AP-3 has δ (delta), AP-4 has ε (epsilon) and AP-5 has ζ (zeta). The two smaller proteins are a medium subunit named μ (mu ~50 kD) and a small subunit σ (sigma ~20 kD), and named 1 through 5 corresponding to the 5 AP complexes. Components of COPI (cop one) a coatomer, and TSET (T-set) a membrane trafficking complex have similar heterotetramers of the AP complexes.
Retromer is not closely related, has been reviewed, and its proteins will not be described here. GGAs (Golgi-localising, Gamma-adaptin ear domain homology, ARF-binding proteins) are a group of related proteins (three in humans) that act as monomeric clathrin adaptor proteins in various important membrane vesicle traffickings, but are not similar to any of the AP complexes and will not be discussed in detail in this article. Stonins (not shown in the lead figure) are also monomers similar in some regards to GGA and will also not be discussed in detail in this article.
PTBs are protein domains that include
|
https://en.wikipedia.org/wiki/881%20%28number%29
|
881 (eight hundred [and] eighty-one) is the natural number following 880 and preceding 882.
881 is:
a prime number
a Paid Toll Free telephone number prefix in the USA
the Port of Los Angeles Long Wharf, California State Historic Landmark #881
In astronomy, NGC 881 is an Sc type galaxy in the constellation Cetus.
A bilingual play on words when text chatting in Mandarin Chinese or bilingually Mandarin Chinese and English. "881" is pronounced ba ba yi in Mandarin, and thus puns on "bye-bye." Probably an elaboration of the similar pun on "88" (ba-ba). See 88 (number).
The international telephone dialing code for the Global Mobile Satellite System
A musical comedy-drama film.
References
Integers
|
https://en.wikipedia.org/wiki/Launch%20Vehicle%20Digital%20Computer
|
The Launch Vehicle Digital Computer (LVDC) was a computer that provided the autopilot for the Saturn V rocket from launch to Earth orbit insertion. Designed and manufactured by IBM's Electronics Systems Center in Owego, New York, it was one of the major components of the Instrument Unit, fitted to the S-IVB stage of the Saturn V and Saturn IB rockets. The LVDC also supported pre- and post-launch checkout of the Saturn hardware. It was used in conjunction with the Launch Vehicle Data Adaptor (LVDA) which performed signal conditioning from the sensor inputs to the computer from the launch vehicle.
Hardware
The LVDC was capable of executing 12190 instructions per second. For comparison, as of 2022, researchers at the University of California created a chip capable of running at 1.78 trillion instructions per second, 146 million times faster.
Its master clock ran at 2.048 MHz, but operations were performed bit-serially, with 4 cycles required to process each bit, 14 bits per instruction phase, and 3 phases per instruction, for a basic instruction cycle time of 82 μs (168 clock cycles) for a simple add. A few instructions (such as multiply or divide) took several multiples of the basic instruction cycle to execute.
Memory was in the form of 13-bit syllables, each with a 14th parity bit. Instructions were one syllable in size, while data words were two syllables (26 bits). Main memory was random access magnetic core, in the form of 4,096-word memory modules. Up to 8 modules provided a maximum of 32,768 words of memory. Ultrasonic delay lines provided temporary storage.
For reliability, the LVDC used triple-redundant logic and a voting system. The computer included three identical logic systems. Each logic system was split into a seven-stage pipeline. At each stage in the pipeline, a voting system would take a majority vote on the results, with the most popular result being passed on to the next stage in all pipelines. This meant that, for each of the seven stages,
|
https://en.wikipedia.org/wiki/SimGear
|
SimGear is a group of libraries, which provide capabilities useful for simulations, visualizations, and even games building.
SimGear is a relatively new project, and while quite a bit of code has been written in conjunction with the FlightGear project, the final interface and arrangements are still evolving.
All the SimGear code is designed to be portable across a wide variety of platforms and compilers. Originally, it has been developed in support of the FlightGear project, but as development moved forward, it has become useful for other types of applications as well.
SimGear is free software, licensed under the terms of the GNU LGPL.
External links
official website
Documentation
Computer libraries
Free simulation software
Video game development software
|
https://en.wikipedia.org/wiki/Perfboard
|
Perfboard is a material for prototyping electronic circuits. It is a thin, rigid sheet with holes pre-drilled at standard intervals across a grid, usually a square grid of spacing. These holes are ringed by round or square copper pads, though bare boards are also available. Inexpensive perfboard may have pads on only one side of the board, while better quality perfboard can have pads on both sides (plate-through holes). Since each pad is electrically isolated, the builder makes all connections with either wire wrap or miniature point to point wiring techniques. Discrete components are soldered to the prototype board such as resistors, capacitors, and integrated circuits. The substrate is typically made of paper laminated with phenolic resin (such as FR-2) or a fiberglass-reinforced epoxy laminate (FR-4).
Connections
The grid system accommodates integrated circuits in DIP packages and many other types of through-hole components. Perfboard is not designed for prototyping surface mount devices.
Before building a circuit on perfboard, the locations of the components and connections are typically planned in detail on paper or with software tools. Small scale prototypes, however, are often built ad hoc, using an oversized perfboard.
Software for PCB layout can often be used to generate perfboard layouts as well. In this case, the designer positions the components so all leads fall on intersections of a grid. When routing the connections more than 2 copper layers can be used, as multiple overlaps are not a problem for insulated wires.
Once the layout is finalized, the components are soldered in their designated locations, paying attention to orientation of polarized parts such as electrolytic capacitors, diodes, and integrated circuits. Next, electrical connections are made as called for in the layout.
One school of thought advocates making as many connections as possible without adding extra wire. This is done by bending the existing leads on resistors, capaci
|
https://en.wikipedia.org/wiki/Howard%20Johnson%20%28electrical%20engineer%29
|
Howard Johnson is an electrical engineer, known for his consulting work and commonly referenced books on the topic of signal integrity, especially for high speed electronic circuit design. He served as the chief technical editor for Fast Ethernet and Gigabit Ethernet standardisation, and was recognized by the IEEE as an "Outstanding Contributor" to the IEEE P802.3z Gigabit Task Force.
Johnson earned his Bachelor of Science in Electrical Engineering (1978), Masters of Electrical Engineering (1979), and PhD (1982) from Rice University. His dissertation was titled The design of DFT algorithms.
Area of contribution
Johnson has significantly raised awareness of analog effects at work in high speed digital electronic systems.
In modern digital systems, it is common for digital designs to be subject to analog effects, even if they operate at a relatively low clock frequency. Circuits operating at lower clock rates can behave as high speed digital systems if there is sufficient high frequency content in the signal edges (when transitioning between digital logic levels) relative to the distance traveled across a printed circuit board. As a result of improvements in semiconductor process, faster edge rates of even "low technology" electronic components can be sufficient to make the system effectively high speed and thus subject to havoc caused by unanticipated analog effects.
A good example is his illustration of the matrix of rising edges that result from different combinations of skin-effect and dielectric loss which illustrates PCB design problems one encounters at microwave frequencies.
Johnson was also active in the development of two Institute of Electrical and Electronics Engineers (IEEE) standards that govern Ethernet, IEEE 802.3 Fast Ethernet and IEEE 802.3 Gigabit Ethernet.
Books and publications
Johnson has written three books:
High-Speed Digital Design: A Handbook of Black Magic (1993),
Fast Ethernet: Dawn of a New Network (1995),
High-Speed Signal
|
https://en.wikipedia.org/wiki/Optiarc
|
Optiarc is a brand of optical disc drives and solid-state drives. It is owned by a US-based Vinpower Digital, Inc.
Initially Optiarc was established on April 3, 2006 as a joint venture between Sony (55% shares) and NEC (45% shares). The company, named Sony NEC Optiarc, focused on manufacturing optical disk drives primarily for the OEM desktop and notebook PC markets.
On September 11, 2008, it was announced that Sony would take over NEC's 45% share, making Optiarc a wholly owned subsidiary of Sony, to be called Sony Optiarc. This took effect on December 5, 2008
In March 2013, Sony closed its Optiarc optical disc drive division, laying off about 400 employees globally.
In 2017, an American company, Vinpower Digital, whose main business is manufacturing optical disc and other media duplicators for the commercial market, acquired the rights to the Optiarc brand and product line. The brand PioData is also owned by Vinpower Digital.
Products
Products were both DVD+/-R(W) and BD-ROM drives. Among other things, Sony Optiarc supplied the Blu-ray drives for the Sony PlayStation 3. The naming scheme for the drives is as follows: DDU stands for DVD-ROM, AD stands for DVD-RW, BR for BD-ROM and BC for BD Combo. A combo drive is a drive that only supports the newer format in reading and the predecessor in writing. The three digits that follow indicate the generation, the design (5.25" or slimline) and the speed class. The digit after that the equipment variant and the appended letter the interface. An AD-7243S is a 5.25" DVD-RW Drive with 24x speed when writing to DVD-R and DVD+R blanks. It also supports Labelflash. For Lightscribe, a "1" would be in the fourth position. The "S" indicates SATA. An “A” stands for PATA. However, the last Optiarc drives were no longer available with this legacy interface.
See also
Similar joint ventures
Hitachi-LG Data Storage
Toshiba Samsung Storage Technology Corporation
References
External links
Companies established in 2006
Compute
|
https://en.wikipedia.org/wiki/Nallatech
|
Nallatech is a computer hardware and software firm based in Camarillo, California, United States.
The company specializes in field-programmable gate array (FPGA) integrated circuit technology applied in computing. As of 2007 the company's primary markets include defense and high-performance computing. Nallatech was acquired by Interconnect Systems, Inc. in 2008,
which in turn was bought by Molex in 2016.
Background
The company was founded by Allan Cantle ('Nalla' comes from 'Allan' spelled backwards) in 1993 and was backed by over £4 million of equity finance provided by Scottish Equity Partners and 3i. Cantle was the CEO for the firm, later moving into president and CTO roles.
In 2005 Nallatech announced a Scottish group known as the FPGA High Performance Computing Alliance, to work on a supercomputer.
Nallatech's direct sales team operates in two main geographic areas, one in the US and one in UK covering UK, Europe and rest of the world. The team in the USA (Nallatech, Inc.) sales office in Eldersburg, Maryland and headquartered in Camarillo, California.
Nallatech is a member of the OpenPOWER Foundation.
Products
Nallatech was promoted for commercial off-the-shelf (COTS) FPGA technology applied in computing. According to David R. Martinez, Robert A. Bond, and M. Michael Vai, Nallatech systems are "based on a modular design concept in which the designer chooses the number of FPGAs, amount and type of memory, and other expansion cards to include in a system."
Nallatech is also known for its motherboards with PCI cards which provide a "high throughput connection over which a host PC can provide and receive data and monitor system performance."
On June 17, 2015, it released the 385A FPGA Accelerator Card, which includes the Altera Arria 10 / 1150 FPGA, PCI-Express form factor and works with most major servers, including IBM, HP and Dell.
In March 2011 the company announced a miniaturization service for their FPGAs.
In 2012, Nallatech has partnered with Al
|
https://en.wikipedia.org/wiki/Party%20line%20%28telephony%29
|
A party line (multiparty line, shared service line, party wire) is a local loop telephone circuit that is shared by multiple telephone service subscribers.
Party line systems were widely used to provide telephone service, starting with the first commercial switchboards in 1878. A majority of Bell System subscribers in the mid-20th century in the United States and Canada were served by party lines, which had a discount over individual service. During wartime shortages, these were often the only available lines.
British users similarly benefited from the party line discount. Farmers in rural Australia and South Africa used party lines, where a single line spanned miles from the nearest town to one property and on to the next.
History
Telephone companies offered party lines beginning in the late 1800s, although subscribers in all but the most rural areas may have had the option to upgrade to individual line service at an additional monthly charge. The service was common in sparsely populated areas where subscribers were spread across large distances. An example is Australia where these were operated by the Government Postmaster General's Department. In rural areas in the early 20th century, additional subscribers and telephones, often numbering several dozen, were frequently connected to the single loop available.
Party lines provided no privacy in communication. They were frequently used as a source of entertainment and gossip, as well as a means of quickly alerting entire neighbourhoods of emergencies such as fires, becoming a cultural fixture of rural areas for many decades.
The rapid growth of telephone service demand, especially after WWII, resulted in many party line installations in the middle of the 20th century in the United States. This often led to traffic congestion in the telephone network, as the line to a destination telephone was often busy. Nearly three-quarters of Pennsylvania residential service in 1943 was party line, with users encouraged
|
https://en.wikipedia.org/wiki/Claude%20Berge
|
Claude Jacques Berge (5 June 1926 – 30 June 2002) was a French mathematician, recognized as one of the modern founders of combinatorics and graph theory.
Biography and professional history
Claude Berge's parents were André Berge and Geneviève Fourcade. André Berge (1902–1995) was a physician and psychoanalyst who, in addition to his professional work, had published several novels. He was the son of the René Berge, a mining engineer, and Antoinette Faure. Félix François Faure (1841–1899) was Antoinette Faure's father; he was President of France from 1895 to 1899. André Berge married Geneviève in 1924, and Claude was the second of their six children. His five siblings were Nicole (the eldest), Antoine, Philippe, Edith, and Patrick. Claude attended the near Verneuil-sur-Avre, about west of Paris. This famous private school, founded by the sociologist Edmond Demolins in 1899, attracted students from all over France to its innovative educational program. At this stage in his life, Claude was unsure about the topic in which he should specialize. He said in later life:
"I wasn't quite sure that I wanted to do mathematics. There was often a greater urge to study literature."
His love of literature and other non-mathematical subjects never left him and we shall discuss below how they played a large role in his life. However, he decided to study mathematics at the University of Paris. After the award of his first degree, he continued to undertake research for his doctorate, advised by André Lichnerowicz. He began publishing mathematics papers in 1950. In that year two of his papers appeared, the short paper Sur l'isovalence et la régularité des transformateurs and the major, 30-page paper Sur un nouveau calcul symbolique et ses applications. The symbolic calculus which he discussed in this major paper is a combination of generating functions and Laplace transforms. He then applied this symbolic calculus to combinatorial analysis, Bernoulli numbers, difference equations,
|
https://en.wikipedia.org/wiki/Sensitivity%20index
|
The sensitivity index or discriminability index or detectability index is a dimensionless statistic used in signal detection theory. A higher index indicates that the signal can be more readily detected.
Definition
The discriminability index is the separation between the means of two distributions (typically the signal and the noise distributions), in units of the standard deviation.
Equal variances/covariances
For two univariate distributions and with the same standard deviation, it is denoted by ('dee-prime'):
.
In higher dimensions, i.e. with two multivariate distributions with the same variance-covariance matrix , (whose symmetric square-root, the standard deviation matrix, is ), this generalizes to the Mahalanobis distance between the two distributions:
,
where is the 1d slice of the sd along the unit vector through the means, i.e. the equals the along the 1d slice through the means.
For two bivariate distributions with equal variance-covariance, this is given by:
,
where is the correlation coefficient, and here and , i.e. including the signs of the mean differences instead of the absolute.
is also estimated as .
Unequal variances/covariances
When the two distributions have different standard deviations (or in general dimensions, different covariance matrices), there exist several contending indices, all of which reduce to for equal variance/covariance.
Bayes discriminability index
This is the maximum (Bayes-optimal) discriminability index for two distributions, based on the amount of their overlap, i.e. the optimal (Bayes) error of classification by an ideal observer, or its complement, the optimal accuracy :
,
where is the inverse cumulative distribution function of the standard normal. The Bayes discriminability between univariate or multivariate normal distributions can be numerically computed (Matlab code), and may also be used as an approximation when the distributions are close to normal.
is a positive-definite statistical d
|
https://en.wikipedia.org/wiki/SoftEther%20Corporation
|
SoftEther Corporation is a Japanese software company. It was founded as an industry-academia-government venture in April 2004 by University of Tsukuba students, with the goal to develop the software of the same name, SoftEther VPN. The name indicated that a software emulates an Ethernet.
Related software
SoftEther
The VPN software called SoftEther (SoftEther 1.0) was written by Daiyu Nobori, who became the Representative Director and Chairman of the new company. In 2003, the software's development was adopted as one of the projects of the Exploratory Youth program, sponsored by Information Technology Promotion Agency, Japan. "In addition to being highly evaluated by the project manager, there were 1 million downloads in three months after making it available at the website."
The first SoftEther sales version was released in August 2004 called SoftEther CA, by Mitsubishi Materials Corporation, Japan.
PacketiX VPN
The second version of the software, released in December 2005, the name of the software was changed to PacketiX VPN 2.0 from SoftEther 2.0. In 2006, PacketiX VPN 2.0 won the "Software of the Year" award from the Information-Technology Promotion Agency.
In 2010 March, PacketiX VPN 3.0 was released by Softether Corporation. Some functions were added to new version (as examples: support IPv6, 802.1Q VLAN, TLS 1.0). This version is compatible with PacketiX VPN 2.0.
In 2013 July, PacketiX VPN 4.0 was released by SoftEther Corporation. In this version, some existent protocols support was added.
UT-VPN
In 2010 June, UT-VPN was released by SoftEther Corporation and University of Tsukuba. UT-VPN is an open source VPN software. UT-VPN has compatible as PacketiX VPN products of SoftEther Corporation.
UT-VPN developed based on PacketiX VPN 3.0, but some functions was deleted. For example, the RADIUS client is supported by PacketiX VPN Server, but it is not supported by UT-VPN Server.
SoftEther VPN
In 2013 July, SoftEther VPN was released by SoftEther VPN Proje
|
https://en.wikipedia.org/wiki/Row%20equivalence
|
In linear algebra, two matrices are row equivalent if one can be changed to the other by a sequence of elementary row operations. Alternatively, two m × n matrices are row equivalent if and only if they have the same row space. The concept is most commonly applied to matrices that represent systems of linear equations, in which case two matrices of the same size are row equivalent if and only if the corresponding homogeneous systems have the same set of solutions, or equivalently the matrices have the same null space.
Because elementary row operations are reversible, row equivalence is an equivalence relation. It is commonly denoted by a tilde (~).
There is a similar notion of column equivalence, defined by elementary column operations; two matrices are column equivalent if and only if their transpose matrices are row equivalent. Two rectangular matrices that can be converted into one another allowing both elementary row and column operations are called simply equivalent.
Elementary row operations
An elementary row operation is any one of the following moves:
Swap: Swap two rows of a matrix.
Scale: Multiply a row of a matrix by a nonzero constant.
Pivot: Add a multiple of one row of a matrix to another row.
Two matrices A and B are row equivalent if it is possible to transform A into B by a sequence of elementary row operations.
Row space
The row space of a matrix is the set of all possible linear combinations of its row vectors. If the rows of the matrix represent a system of linear equations, then the row space consists of all linear equations that can be deduced algebraically from those in the system. Two m × n matrices are row equivalent if and only if they have the same row space.
For example, the matrices
are row equivalent, the row space being all vectors of the form . The corresponding systems of homogeneous equations convey the same information:
In particular, both of these systems imply every equation of the form
Equivalence of the defin
|
https://en.wikipedia.org/wiki/Elementary%20matrix
|
In mathematics, an elementary matrix is a matrix which differs from the identity matrix by one single elementary row operation. The elementary matrices generate the general linear group when is a field. Left multiplication (pre-multiplication) by an elementary matrix represents elementary row operations, while right multiplication (post-multiplication) represents elementary column operations.
Elementary row operations are used in Gaussian elimination to reduce a matrix to row echelon form. They are also used in Gauss–Jordan elimination to further reduce the matrix to reduced row echelon form.
Elementary row operations
There are three types of elementary matrices, which correspond to three types of row operations (respectively, column operations):
Row switching A row within the matrix can be switched with another row.
Row multiplication Each element in a row can be multiplied by a non-zero constant. It is also known as scaling a row.
Row addition A row can be replaced by the sum of that row and a multiple of another row.
If is an elementary matrix, as described below, to apply the elementary row operation to a matrix , one multiplies by the elementary matrix on the left, . The elementary matrix for any row operation is obtained by executing the operation on the identity matrix. This fact can be understood as an instance of the Yoneda lemma applied to the category of matrices.
Row-switching transformations
The first type of row operation on a matrix switches all matrix elements on row with their counterparts on a different row . The corresponding elementary matrix is obtained by swapping row and row of the identity matrix.
So is the matrix produced by exchanging row and row of .
Coefficient wise, the matrix is defined by :
Properties
The inverse of this matrix is itself:
Since the determinant of the identity matrix is unity, It follows that for any square matrix (of the correct size), we have
For theoretical considerations, the r
|
https://en.wikipedia.org/wiki/Sub-loop%20unbundling
|
In the telephony business, sub-loop unbundling (SLU) is a type of unbundled access whereby a sub-section of the local loop is unbundled. In practice this often means the competitor placing a small street cabinet with a DSLAM, next to a telco local copper aggregation cabinet or serving area interface and using a 'tie cable' to connect to the last part of the local loop into customers' homes. Lyddington in Rutland was the first example of SLU in the UK when local provider Rutland Telecom unbundled the cabinet to offer VDSL broadband.
Advantages
The short range brings superior bit-rate performance, compared to normal local loop unbundling (LLU). The local loop can be accessed using shared metallic path or full metallic path facilities. In the latter, which was first deployed in the UK in the village of Lyddington by Rutland Telecom, the telco loses remote access to the part of the local loop between the cabinet and the customer's premises unless the SLU Operator allows IP-level access via their DSLAM.
The street cabinet is connected to a point of presence on the national network using long-range wireless or fibre. Where fibre is used, the technology is often referred to as fibre to the cabinet (FTTC)
Where VDSL or VDSL2 is used to deliver a service, competing SLU operators at the same site must adhere to tie cable length limitations to prevent interference. Other restrictions are in force to prevent interference with ADSL or ADSL2+ frequencies on the local loop from the serving exchange. In the UK the incumbent telco aggregation cabinets are known as Primary Connection Points (PCPs) and each one is assigned a CAL (Cabinet Assigned Loss) value based on its distance from the serving exchange.
Telecommunications economics
Local loop
|
https://en.wikipedia.org/wiki/Genealogical%20numbering%20systems
|
Several genealogical numbering systems have been widely adopted for presenting family trees and pedigree charts in text format.
Ascending numbering systems
Ahnentafel
Ahnentafel, also known as the Eytzinger Method, Sosa Method, and Sosa-Stradonitz Method, allows for the numbering of ancestors beginning with a descendant. This system allows one to derive an ancestor's number without compiling the complete list, and allows one to derive an ancestor's relationship based on their number. The number of a person's father is twice their own number, and the number of a person's mother is twice their own, plus one. For instance, if John Smith is 10, his father is 20, and his mother is 21.
In order to readily have the generation stated for a certain person, the Ahnentafel numbering may be preceded by the generation. This method's usefulness becomes apparent when applied further back in the generations: e.g. 08-146, is a male preceding the subject by 7 (8-1) generations. This ancestor was the father of a woman (146/2=73) (in the genealogical line of the subject), who was the mother of a man (73/2=36.5), further down the line the father of a man (36/2=18), father of a woman (18/2=9), mother of a man (9/2=4.5), father of the subject's father (4/2=2). Hence, 08-146 is the subject's father's father's mother's father's father's mother's father.
The atree or Binary Ahnentafel method is based on the same numbering of nodes, but first converts the numbers to binary notation and then converts each 0 to M (for Male) and each 1 to F (for Female). The first character of each code (shown as X in the table below) is M if the subject is male and F if the subject is female. For example 5 becomes 101 and then FMF (or MMF if the subject is male). An advantage of this system is easier understanding of the genealogical path.
The first 15 codes in each system, identifying individuals in four generations, are as follows:
Surname methods
Genealogical writers sometimes choose to present ancest
|
https://en.wikipedia.org/wiki/Elasticity%20of%20a%20function
|
In mathematics, the elasticity or point elasticity of a positive differentiable function f of a positive variable (positive input, positive output) at point a is defined as
or equivalently
It is thus the ratio of the relative (percentage) change in the function's output with respect to the relative change in its input , for infinitesimal changes from a point . Equivalently, it is the ratio of the infinitesimal change of the logarithm of a function with respect to the infinitesimal change of the logarithm of the argument. Generalisations to multi-input-multi-output cases also exist in the literature.
The elasticity of a function is a constant if and only if the function has the form for a constant .
The elasticity at a point is the limit of the arc elasticity between two points as the separation between those two points approaches zero.
The concept of elasticity is widely used in economics and Metabolic Control Analysis; see elasticity (economics) and Elasticity coefficient respectively for details.
Rules
Rules for finding the elasticity of products and quotients are simpler than those for derivatives. Let f, g be differentiable. Then
The derivative can be expressed in terms of elasticity as
Let a and b be constants. Then
,
.
Estimating point elasticities
In economics, the price elasticity of demand refers to the elasticity of a demand function Q(P), and can be expressed as (dQ/dP)/(Q(P)/P) or the ratio of the value of the marginal function (dQ/dP) to the value of the average function (Q(P)/P). This relationship provides an easy way of determining whether a demand curve is elastic or inelastic at a particular point. First, suppose one follows the usual convention in mathematics of plotting the independent variable (P) horizontally and the dependent variable (Q) vertically. Then the slope of a line tangent to the curve at that point is the value of the marginal function at that point. The slope of a ray drawn from the origin through the point is the
|
https://en.wikipedia.org/wiki/Charlieplexing
|
Charlieplexing (also known as tristate multiplexing, reduced pin-count LED multiplexing, complementary LED drive and crossplexing) is a technique for driving a multiplexed display, keypad or touchscreen, in which relatively few I/O wires from a microcontroller are woven in a diagonally-intersecting pattern to access a large number of I/O entities (e.g. LEDs for output or switches or micro-capacitors for input).
Charlieplexing can be used in displays and resistive or projected capacitance keypads and touchscreens, using a simple array (shown). The diagram shows that eight inputs creates 16 intersections when used in an x/y array, but 28 intersections when used in a Charlieplexed array. When functioning as an LED display or mechanical keypad, the use of reversed pairs of LEDs or standard diodes at the intersections doubles the 8 input matrix size from 28 to 56.
The method uses the tri-state logic capabilities of microcontrollers in order to gain efficiency over traditional multiplexing.
Although it is more efficient in its use of I/O, a small amount of address manipulation is required when trying to fit Charlieplexing into a standard x/y array (as described later in this article).
There are no problems if a diagonal array is used. The diagram shows a six I/O Charlieplexed array that is scalable to any size without difficulty.
Other issues that affect standard multiplexing but are exacerbated by Charlieplexing are:
a) consideration of current requirements and the forward voltages of the LEDs.
b) a requirement to cycle through the in-use LEDs rapidly so that the persistence of the human eye perceives the display to be lit as a whole. Multiplexing can generally be seen by a strobing effect and skewing if the eye's focal point is moved past the display rapidly.
Charlieplexing simulator
To see how I/O states affect LEDS in various sizes and arrangements of a Charlieplex matrix, go to https://malcolmbinstead.github.io/charlieplexing/. In a real life situation, ho
|
https://en.wikipedia.org/wiki/Microtek
|
Microtek International Inc. () is a Taiwan-based multinational manufacturer of digital imaging products and other consumer electronics. It produces imaging equipment for medical, biological and industrial fields. It occupies 20 percent of the global imaging market and holds 450 patents worldwide.
It is known for its scanner brands ScanMaker and ArtixScan. The company launched the world's first halftone optical film scanner in 1984, the world's first desktop halftone scanner in 1986, and the world's first color scanner in 1989. It has subsidiaries in Shanghai, Tokyo, Singapore and Rotterdam. It expanded its product lines into the manufacturing of LCD monitors, LCD projectors and digital cameras.
History
1980-1985: Founding and incorporation
In 1979, the Taiwanese government launched the Hsinchu Science and Industrial Park (HSIP) as a vision of Shu Shien-Siu to emulate Silicon Valley and to lure back overseas Taiwanese with their experience and knowledge in engineering and technology fields. Initially there were 14 companies, the first was Wang Computer (王氏電腦), by 2010 only six of the original pioneers remained: United Microelectronics Corporation (聯電), Microtek International, Inc. (全友), Quartz Frequency Technology (頻率), Tecom (東訊), Sino-American Silicon Products Inc. (中美矽晶) and Flow Asia Corporation (福祿遠東).
Microtek (Microelectronics Technology) was co-founded in HSIP in 1980 by five Californian Taiwanese, three were colleagues who had worked at Xerox Bobo Wang (王渤渤), Robert Hsieh (謝志鴻), Carter Tseng (曾憲章) and two were colleagues from the University of Southern California, Benny Hsu (許正勳) and Hu Chung-hsing (胡忠信). They decided to set up root after Hsu was invited by HSIP Manager Dr. Irving Ho (何宜慈). In September 1983, the Allied Association for Science Parks Industries (台灣科學園區同業公會 abbr. 竹科) was established and Hsu was elected to be its first Chairman.
Microtek first entered the industry in 1983, when scanners were little more than expensive tools for hobbyis
|
https://en.wikipedia.org/wiki/Hardware%20bug
|
A hardware bug is a defect in the design, manufacture, or operation of computer hardware that causes incorrect operation. It is the counterpart of software bugs which refer to flaws in the code which operates computers, and is the original context in which "bug" was used to refer to such flaws. Intermediate between hardware and software are microcode and firmware which may also have such defects. In common usage, a bug is subtly different from a "glitch" which may be more transient than fundamental, and somewhat different from a "quirk" which may be considered useful or intrinsic. Errata (corrections to the documentation) may be published by the manufacturer to reflect such unintended operation, and "errata" is sometimes used as a term for the flaws themselves.
History
The Middle English word bugge is the basis for the terms "bugbear" and "bugaboo" as terms used for a monster.
The term "bug" to describe defects has been a part of engineering jargon since the 1870s and predates electronic computers and computer software; it may have originally been used in hardware engineering to describe mechanical malfunctions. For instance, Thomas Edison wrote the following words in a letter to an associate in 1878:
Baffle Ball, the first mechanical pinball game, was advertised as being "free of bugs" in 1931. Problems with military gear during World War II were referred to as bugs (or glitches). In the 1940 film, Flight Command, a defect in a piece of direction-finding gear is called a "bug". In a book published in 1942, Louise Dickinson Rich, speaking of a powered ice cutting machine, said, "Ice sawing was suspended until the creator could be brought in to take the bugs out of his darling."
Isaac Asimov used the term "bug" to relate to issues with a robot in his short story "Catch That Rabbit", published in 1944.
The term "bug" was used in an account by computer pioneer Grace Hopper, who publicized the cause of a malfunction in an early electromechanical computer. A typic
|
https://en.wikipedia.org/wiki/Electronic%20discovery
|
Electronic discovery (also ediscovery or e-discovery) refers to discovery in legal proceedings such as litigation, government investigations, or Freedom of Information Act requests, where the information sought is in electronic format (often referred to as electronically stored information or ESI). Electronic discovery is subject to rules of civil procedure and agreed-upon processes, often involving review for privilege and relevance before data are turned over to the requesting party.
Electronic information is considered different from paper information because of its intangible form, volume, transience and persistence. Electronic information is usually accompanied by metadata that is not found in paper documents and that can play an important part as evidence (e.g. the date and time a document was written could be useful in a copyright case). The preservation of metadata from electronic documents creates special challenges to prevent spoliation.
In the United States, at the federal level, electronic discovery is governed by common law, case law and specific statutes, but primarily by the Federal Rules of Civil Procedure (FRCP), including amendments effective December 1, 2006, and December 1, 2015. In addition, state law and regulatory agencies increasingly also address issues relating to electronic discovery. In England and Wales, Part 31 of the Civil Procedure Rules and Practice Direction 31B on Disclosure of Electronic Documents apply. Other jurisdictions around the world also have rules relating to electronic discovery.
Stages of process
The Electronic Discovery Reference Model (EDRM) is an ubiquitous diagram that represents a conceptual view of these stages involved in the ediscovery process.
Identification
The identification phase is when potentially responsive documents are identified for further analysis and review. In the United States, in Zubulake v. UBS Warburg, Hon. Shira Scheindlin ruled that failure to issue a written legal hold notice whenever li
|
https://en.wikipedia.org/wiki/Toxic%20food%20environment
|
A food environment is the "physical presence of food that affects a person’s diet, a person’s proximity to food store locations, the distribution of food stores, food service, and any physical entity by which food may be obtained, or a connected system that allows access to food".
The term toxic food environment was coined by Kelly D. Brownell in his book, Food Fight: The Inside Story of the Food Industry which describes American culture at the end of the 20th century as one that fosters and promotes obesity and unprecedented food consumption. In the United States, the food environment the citizens are encompassed in makes it far too hard to choose healthy foods, and all too easy to choose unhealthy foods. Some call this food environment "'toxic' because of the way it corrodes healthy lifestyles and promotes obesity".
Brownell was a Yale professor and director of the Rudd Center for Food Policy and Obesity at Yale. He is now director of the World Food Policy Center of the Sanford School of Public Policy at Duke University. He uses the term “toxic” to describe unparalleled exposure to high-calorie, high-fat, heavily marketed, inexpensive, and readily accessible foods. The toxic environment is the result of ubiquity of unhealthy, processed foods, an increasingly sedentary lifestyle in which individuals spend more time watching TV and using computers than they spend exercising, the explosion of fast food restaurants, the enormous growth of portion sizes, the power of food advertising and marketing, and the junk food industry’s takeover of schools by selling unhealthy items in vending machines, cafeterias, and through school fundraisers.
A main contributor to the notion of a toxic food environment is the marketing of it. Finding an advertisement that promotes “toxic” is not a difficult task. The Federal Trade Commission found, in 2008, that the food industry spent almost $10 billion per year on marketing food and beverages, including $1.6 billion toward children.
|
https://en.wikipedia.org/wiki/Poset%20topology
|
In mathematics, the poset topology associated to a poset (S, ≤) is the Alexandrov topology (open sets are upper sets) on the poset of finite chains of (S, ≤), ordered by inclusion.
Let V be a set of vertices. An abstract simplicial complex Δ is a set of finite sets of vertices, known as faces , such that
Given a simplicial complex Δ as above, we define a (point set) topology on Δ by declaring a subset be closed if and only if Γ is a simplicial complex, i.e.
This is the Alexandrov topology on the poset of faces of Δ.
The order complex associated to a poset (S, ≤) has the set S as vertices, and the finite chains of (S, ≤) as faces. The poset topology associated to a poset (S, ≤) is then the Alexandrov topology on the order complex associated to (S, ≤).
See also
Topological combinatorics
References
Poset Topology: Tools and Applications Michelle L. Wachs, lecture notes IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004)
General topology
Order theory
|
https://en.wikipedia.org/wiki/Critical%20security%20parameter
|
In cryptography, a critical security parameter (CSP) is information that is either user or system defined and is used to operate a cryptography module in processing encryption functions including cryptographic keys and authentication data, such as passwords, the disclosure or modification of which can compromise the security of a cryptographic module or the security of the information protected by the module.
References
Cryptography
|
https://en.wikipedia.org/wiki/Core%20Multiplexing%20Technology
|
Core Multiplexing Technology is a term that appeared in some BIOSes.
Details
A subset of traditional applications are often difficult to parallelize and make use of additional CPU hardware available on the platform, restraining applications to use only one CPU. Core Multiplexing Technology would allow for a process to be split into multiple threads at compilation time and execution time by the introduction of speculative multithreading.
Much in the same way a branch predictor allows for a processor to speculate on the outcome of a branch operation without actually performing the operation, speculative multithreading allows for the processor to speculate deeper, executing entire branches of code on an additional core. Most of the implementation is done in software, with the compiler rearranging code to take better use of a multithreaded platform, which allows Simultaneous multithreading (SMT) and Multicore systems (or a combination of the two) to take advantage of the technology. But, because the data dependencies of speculative multithreading, and the necessity to manage inter-thread dependent data, hardware implementation must be taken into consideration.
Core Multiplexing Technology is thought to leverage Intel's Advanced Smart Cache technology of the upcoming Core 2 chips, which allows two cores to share a single L2 cache, and actively resize the cache between the two processors if one is idle, by allowing the two cores to share data to manage inter-thread dependent data.
See also
3Server
Apulet
BINAC
External Resources
Intel Research on Speculative Multithreading
Coverage of Core Multiplexing Technology BIOS Option
BIOS
|
https://en.wikipedia.org/wiki/Chemical%20computer
|
A chemical computer, also called a reaction-diffusion computer, Belousov–Zhabotinsky (BZ) computer, or gooware computer, is an unconventional computer based on a semi-solid chemical "soup" where data are represented by varying concentrations of chemicals. The computations are performed by naturally occurring chemical reactions.
Background
Originally chemical reactions were seen as a simple move towards a stable equilibrium which was not very promising for computation. This was changed by a discovery made by Boris Belousov, a Soviet scientist, in the 1950s. He created a chemical reaction between different salts and acids that swing back and forth between being yellow and clear because the concentration of the different components changes up and down in a cyclic way. At the time this was considered impossible because it seemed to go against the second law of thermodynamics, which says that in a closed system the entropy will only increase over time, causing the components in the mixture to distribute themselves until equilibrium is gained and making any changes in the concentration impossible. But modern theoretical analyses shows sufficiently complicated reactions can indeed comprise wave phenomena without breaking the laws of nature. (A convincing directly visible demonstration was achieved by Anatol Zhabotinsky with the Belousov–Zhabotinsky reaction showing spiraling colored waves.)
The wave properties of the BZ reaction means it can move information in the same way as all other waves. This still leaves the need for computation, performed by conventional microchips using the binary code transmitting and changing ones and zeros through a complicated system of logic gates. To perform any conceivable computation it is sufficient to have NAND gates. (A NAND gate has two bits input. Its output is 0 if both bits are 1, otherwise it's 1). In the chemical computer version logic gates are implemented by concentration waves blocking or amplifying each other in different wa
|
https://en.wikipedia.org/wiki/ODVA%20%28company%29
|
ODVA, Inc. (formerly Open DeviceNet Vendors Association, Inc.) was founded in 1995 and is a global trade and standard development organization whose members are suppliers of devices for industrial automation applications. To qualify for membership in ODVA, applicants must be an entity that makes and sells products using ODVA technologies.
ODVA technologies include the Common Industrial Protocol or "CIP" - ODVA's media-independent, object-oriented protocol - along with ODVA's network adaptations of CIP - EtherNet/IP, DeviceNet, ControlNet, and CompoNet. ODVA has more than 15 technical working groups, overseen by its Technical Review Board, which develop and enhance ODVA's implementation specifications for its technologies. These specifications define how a product shall be designed in accordance with the specifications. ODVA maintains a conformance testing practice to validate that products designed using ODVA technologies comply with the specifications and interoperate in multivendor systems. ODVA also provides other services to its members to promote the adoption of ODVA technologies by industry.
ODVA is a US 501(c)6 corporation incorporated in the state of Wisconsin. Its headquarters are in Ann Arbor, Michigan U.S. It also has conformance test service providers in North America, China, Germany, and Japan.
References
External links
ODVA.org
Computer network organizations
|
https://en.wikipedia.org/wiki/Ax%E2%80%93Kochen%20theorem
|
The Ax–Kochen theorem, named for James Ax and Simon B. Kochen, states that for each positive integer d there is a finite set Yd of prime numbers, such that if p is any prime not in Yd then every homogeneous polynomial of degree d over the p-adic numbers in at least d2 + 1 variables has a nontrivial zero.
The proof of the theorem
The proof of the theorem makes extensive use of methods from mathematical logic, such as model theory.
One first proves Serge Lang's theorem, stating that the analogous theorem is true for the field Fp((t)) of formal Laurent series over a finite field Fp with . In other words, every homogeneous polynomial of degree d with more than d2 variables has a non-trivial zero (so Fp((t)) is a C2 field).
Then one shows that if two Henselian valued fields have equivalent valuation groups and residue fields, and the residue fields have characteristic 0, then they are elementarily equivalent (which means that a first order sentence is true for one if and only if it is true for the other).
Next one applies this to two fields, one given by an ultraproduct over all primes of the fields Fp((t)) and the other given by an ultraproduct over all primes of the p-adic fields Qp.
Both residue fields are given by an ultraproduct over the fields Fp, so are isomorphic and have characteristic 0, and both value groups are the same, so the ultraproducts are elementarily equivalent. (Taking ultraproducts is used to force the residue field to have characteristic 0; the residue fields of Fp((t))
and Qp both have non-zero characteristic p.)
The elementary equivalence of these ultraproducts implies that for any sentence in the language of valued fields, there is a finite set Y of exceptional primes, such that for any p not in this set the sentence is true for Fp((t)) if and only if it is true for the field of p-adic numbers. Applying this to the sentence stating that every non-constant homogeneous polynomial of degree d in at least d2+1 variables represents 0, and usin
|
https://en.wikipedia.org/wiki/Google%20Account
|
A Google Account is a user account that is required for access, authentication and authorization to certain online Google services. It is also often used as single sign-on for third party services.
Usage
A Google Account is required for Gmail, Google Hangouts, Google Meet and Blogger. Some Google products do not require an account, including Google Search, YouTube, Google Books, Google Finance and Google Maps. However, an account is needed for uploading videos to YouTube and for making edits in Google Maps.
YouTube and Blogger maintain separate accounts for users who registered with the services before the Google acquisition. However, effective April 2011 YouTube users are required to link to a separate Google Account if they wish to continue to log into that service.
Google Account users may create a publicly accessible Google profile, to configure their presentation on Google products to other Google users. A Google profile can be linked to a user's profiles on various social-networking and image-hosting sites, as well as user blogs.
Third-party service providers may implement service authentication for Google Account holders via the Google Account mechanism.
Security
While creating a Google account, users are asked to provide a recovery email address to allow them to reset their password if they have forgotten it, or if their account is hacked. In some countries, such as the United States, the United Kingdom and India, Google may also require one-time use of a mobile phone number to send an account validation code by SMS text messaging or voice message when creating a new account.
Google also offers a two-step verification option—for additional security against hacking—that requests a validation code each time the user logs into their Google account. The code is either generated by an application ("Google Authenticator" or other similar apps) or received from Google as an SMS text message, a voice message, or an email to another account. Trusted devices c
|
https://en.wikipedia.org/wiki/CYP17A1
|
Cytochrome P450 17A1 (steroid 17α-monooxygenase, 17α-hydroxylase, 17-alpha-hydroxylase, 17,20-lyase, 17,20-desmolase) is an enzyme of the hydroxylase type that in humans is encoded by the CYP17A1 gene on chromosome 10. It is ubiquitously expressed in many tissues and cell types, including the zona reticularis and zona fasciculata (but not zona glomerulosa) of the adrenal cortex as well as gonadal tissues. It has both 17α-hydroxylase and 17,20-lyase activities, and is a key enzyme in the steroidogenic pathway that produces progestins, mineralocorticoids, glucocorticoids, androgens, and estrogens. More specifically, the enzyme acts upon pregnenolone and progesterone to add a hydroxyl (-OH) group at carbon 17 position (C17) of the steroid D ring (the 17α-hydroxylase activity, ), or acts upon 17α-hydroxyprogesterone and 17α-hydroxypregnenolone to split the side-chain off the steroid nucleus (the 17,20-lyase activity, ).
Structure
Gene
The CYP17A1 gene resides on chromosome 10 at the band 10q24.3 and contains 8 exons. The cDNA of this gene spans a length of 1527 bp. This gene encodes a member of the cytochrome P450 superfamily of enzymes. The cytochrome P450 proteins are generally regarded as monooxygenases that catalyze many reactions involved in drug metabolism and synthesis of cholesterol, steroids, and other lipids, including the remarkable carbon-carbon bond scission catalyzed by this enzyme.
The CYP17A1 gene may also contain variants associated with increased risk of coronary artery disease.
Protein
CYP17A1 is a 57.4 kDa protein that belongs to the cytochrome P450 family. The protein encoded by its cDNA is composed of 508 amino acid residues. As an enzyme, CYP17A1 possesses an active site that associates with a heme prosthetic group to catalyze biosynthetic reactions. Based on its known structures while bound to two steroidal inhibitors, abiraterone and galeterone, CYP17A1 possesses the canonical cytochrome P450 fold present in other complex P450 enzymes that p
|
https://en.wikipedia.org/wiki/Evolution%20of%20ageing
|
Enquiry into the evolution of ageing, or aging, aims to explain why a detrimental process such as ageing would evolve, and why there is so much variability in the lifespans of organisms. The classical theories of evolution (mutation accumulation, antagonistic pleiotropy, and disposable soma) suggest that environmental factors, such as predation, accidents, disease, and/or starvation, ensure that most organisms living in natural settings will not live until old age, and so there will be very little pressure to conserve genetic changes that increase longevity. Natural selection will instead strongly favor genes which ensure early maturation and rapid reproduction, and the selection for genetic traits which promote molecular and cellular self-maintenance will decline with age for most organisms.
Theories and hypotheses
The beginning
August Weismann was responsible for interpreting and formalizing the mechanisms of Darwinian evolution in a modern theoretical framework. In 1889, he theorized that ageing was part of life's program to make room for the next generation in order to sustain the turnover that is necessary for evolution. The idea that the ageing characteristic was selected (an adaptation) because of its deleterious effect was largely discounted for much of the 20th century, but a theoretical model suggests that altruistic ageing could evolve if there is little migration among populations. Weismann later abandoned his theory and after some time followed up with his "programmed death" theory.
Natural selection is a process that allows organisms to better adapt to the environment, it is the survival of the fittest which are predicted to produce more offsprings. Natural selection acts on life history traits in order to optimize reproductive success and lifetime fitness. Fitness in this context refers to how likely an organism is to survive and reproduce. It is based on the environment and is also relative to other individuals in the population. Examples of lif
|
https://en.wikipedia.org/wiki/Society%20of%20Tribologists%20and%20Lubrication%20Engineers
|
The Society of Tribologists and Lubrication Engineers (STLE) is an American non-profit technical society for the tribology and lubrication engineering sectors worldwide. Its offices are in Park Ridge, Illinois.
Established in 1944 as the American Society of Lubrication Engineers (ASLE), the STLE is now one of the world's largest associations solely dedicated to the advancement of the field of tribology. The STLE currently has over 13,000 members.
An official STLE journal, Tribology Transactions, is published by Taylor and Francis and the society is also affiliated with Tribology Letters, published by Springer. The STLE also publish a monthly magazine, Tribology and Lubrication Technology.
References
Engineering societies based in the United States
Mechanical engineering organizations
International professional associations
Non-profit organizations based in Chicago
Tribology
|
https://en.wikipedia.org/wiki/Instruction%20unit
|
The instruction unit (I-unit or IU), also called, e.g., instruction fetch unit (IFU), instruction issue unit (IIU), instruction sequencing unit (ISU), in a central processing unit (CPU) is responsible for organizing program instructions to be fetched from memory, and executed, in an appropriate order, and for forwarding them to an execution unit (E-unit or EU). The I-unit may also do, e.g., address resolution, pre-fetching, prior to forwarding an instruction. It is a part of the control unit, which in turn is part of the CPU.
In the simplest style of computer architecture, the instruction cycle is very rigid, and runs exactly as specified by the programmer. In the instruction fetch part of the cycle, the value of the instruction pointer (IP) register is the address of the next instruction to be fetched. This value is placed on the address bus and sent to the memory unit; the memory unit returns the instruction at that address, and it is latched into the instruction register (IR); and the value of the IP is incremented or over-written by a new value (in the case of a jump or branch instruction), ready for the next instruction cycle.
This becomes a lot more complicated, though, once performance-enhancing features are added, such as instruction pipelining, out-of-order execution, and even just the introduction of a simple instruction cache.
See also
Branch prediction and the branch prediction buffer
Branch target predictor and the branch target buffer
Branch delay slot
Instruction scheduling
Instruction selection
Data dependency or data hazard
Scoreboarding
Very long instruction word (VLIW)
Superscalar processor
Opcode
Analysis of Instruction parallelism, Instruction frequencies, Instruction mix
Instruction path length or Instruction count
References
Central processing unit
|
https://en.wikipedia.org/wiki/Tetraspanin
|
Tetraspanins are a family of membrane proteins found in all multicellular eukaryotes also referred to as the transmembrane 4 superfamily (TM4SF) proteins. These proteins have four transmembrane alpha-helices and two extracellular domains, one short (called the small extracellular domain or loop, SED/SEL or EC1) and one longer, typically 100 amino acid residues (the large extracellular domain/loop, LED/LEL or EC2). Although several protein families have four transmembrane alpha-helices, tetraspanins are defined by conserved amino acid sequences including four or more cysteine residues in the EC2 domain, with two in a highly conserved 'CCG' motif. Tetraspanins are often thought to act as scaffolding proteins, anchoring multiple proteins to one area of the cell membrane.
Tetraspanins are highly conserved between species. Some tetraspanins can have N-linked glycosylations on the long extracellular loop (LEL, EC2) and palmitoylations at a CXXC motif in their transmembrane region.
There are 34 tetraspanins in mammals, 33 of which have also been identified in humans. Tetraspanins display numerous properties that indicate their physiological importance in cell adhesion, motility, activation, and proliferation, as well as their contribution to pathological conditions such as metastasis or viral infection.
A role for tetraspanins in platelets was demonstrated by the bleeding phenotypes of CD151- and TSSC6-deficient mice, which exhibit impaired "outside-in" signalling through αIIbβ3, the major platelet integrin. it is hypothesized that tetraspanins interact with and regulate other platelet receptors.
List of human tetraspanins
See also
List of human clusters of differentiation
Relevance to parasite vaccines
The schistosome worms make two tetraspanins: TSP-1 and TSP-2. TSP-2 antibodies are found in some people who seem to have immunity to schistosome infection (Schistosomiasis).
References
External links
InterPro on Tetraspanins
Integral membrane proteins
Protein dom
|
https://en.wikipedia.org/wiki/Soft-body%20dynamics
|
Soft-body dynamics is a field of computer graphics that focuses on visually realistic physical simulations of the motion and properties of deformable objects (or soft bodies). The applications are mostly in video games and films. Unlike in simulation of rigid bodies, the shape of soft bodies can change, meaning that the relative distance of two points on the object is not fixed. While the relative distances of points are not fixed, the body is expected to retain its shape to some degree (unlike a fluid). The scope of soft body dynamics is quite broad, including simulation of soft organic materials such as muscle, fat, hair and vegetation, as well as other deformable materials such as clothing and fabric. Generally, these methods only provide visually plausible emulations rather than accurate scientific/engineering simulations, though there is some crossover with scientific methods, particularly in the case of finite element simulations. Several physics engines currently provide software for soft-body simulation.
Deformable solids
The simulation of volumetric solid soft bodies can be realised by using a variety of approaches.
Spring/mass models
In this approach, the body is modeled as a set of point masses (nodes) connected by ideal weightless elastic springs obeying some variant of Hooke's law. The nodes may either derive from the edges of a two-dimensional polygonal mesh representation of the surface of the object, or from a three-dimensional network of nodes and edges modeling the internal structure of the object (or even a one-dimensional system of links, if for example a rope or hair strand is being simulated). Additional springs between nodes can be added, or the force law of the springs modified, to achieve desired effects. Applying Newton's second law to the point masses including the forces applied by the springs and any external forces (due to contact, gravity, air resistance, wind, and so on) gives a system of differential equations for the motion of
|
https://en.wikipedia.org/wiki/Sextic%20equation
|
In algebra, a sextic (or hexic) polynomial is a polynomial of degree six.
A sextic equation is a polynomial equation of degree six—that is, an equation whose left hand side is a sextic polynomial and whose right hand side is zero. More precisely, it has the form:
where and the coefficients may be integers, rational numbers, real numbers, complex numbers or, more generally, members of any field.
A sextic function is a function defined by a sextic polynomial. Because they have an even degree, sextic functions appear similar to quartic functions when graphed, except they may possess an additional local maximum and local minimum each. The derivative of a sextic function is a quintic function.
Since a sextic function is defined by a polynomial with even degree, it has the same infinite limit when the argument goes to positive or negative infinity. If the leading coefficient is positive, then the function increases to positive infinity at both sides and thus the function has a global minimum. Likewise, if is negative, the sextic function decreases to negative infinity and has a global maximum.
Solvable sextics
Some sixth degree equations, such as , can be solved by factorizing into radicals, but other sextics cannot. Évariste Galois developed techniques for determining whether a given equation could be solved by radicals which gave rise to the field of Galois theory.
It follows from Galois theory that a sextic equation is solvable in terms of radicals if and only if its Galois group is contained either in the group of order 48 which stabilizes a partition of the set of the roots into three subsets of two roots or in the group of order 72 which stabilizes a partition of the set of the roots into two subsets of three roots.
There are formulas to test either case, and, if the equation is solvable, compute the roots in term of radicals.
The general sextic equation can be solved by the two-variable Kampé de Fériet function. A more restricted class of sextics can be
|
https://en.wikipedia.org/wiki/Index%20of%20topics%20related%20to%20life%20extension
|
Following is a list of topics related to life extension:
A
ACE inhibitor
Actuarial escape velocity
Adenosine triphosphate (ATP)
Advanced Cell Technology Corporation
Aerobic exercise
Age-adjusted life expectancy
Ageless
Age-Related Eye Disease Study
Age-Related Macular Degeneration
Aging
Aging and memory
Aging-associated diseases
Aging brain
Aging population
Alcor Life Extension Foundation
Alternative medicine
American Aging Association
American Academy of Anti-Aging Medicine (A4M)
Amyloid
Amyloid plaque
Amyotrophic lateral sclerosis (ALS), e.g., Lou Gehrig's disease
Antagonistic Pleiotropy
Antioxidant
Polyphenol antioxidant
Antisense therapy
Apoptosis
Atherosclerosis
ATP (adenosine triphosphate)
Autoimmune disease
B
Biodemography
Biodemography of human longevity
Bioethics
Biological clock
Biogerontology
Biological immortality
Biomarkers of aging
Biotechnology
Brain–computer interface
C
Caloric restriction mimetic
Caloric restriction
CR Society International
Cell replacement therapy
Cholinergic
Clone
Cloning
Human cloning
Therapeutic cloning
Club of Rome
Cockayne's syndrome
Cognitive enhancement
Compensation law of mortality
Complementary and alternative medicine
Cross-link
Cyborg
Cynthia Kenyon
Cryobiology
Cryonics
Cryopreservation
Cryoprotectant
D
Daily values
de Grey, Dr. Aubrey
De Grey Technology Review controversy
Demopoulos M.D., Harry B.
Dendrite
DHT (dihydrotestosterone)
Dietary supplement
Dietary Supplement Health and Education Act of 1994
Dihydrotestosterone (DHT)
DNA (Deoxyribonucleic acid)
Mitochondrial DNA
DNA damage theory of aging
DNA repair
Dolly the sheep
Dopaminergic
Drexler, K. Eric
E
Ending Aging, a 2007 book which describes Aubrey de Grey's biomedical proposal for defeating aging (i.e. SENS).
Endocrine system
Engineered negligible senescence
Engines of creation
Error catastrophe
Eugenics
Eugeroic
Evolution of ageing
Exercise
Aerobic exercise
Existential r
|
https://en.wikipedia.org/wiki/Apache%20Hadoop
|
Apache Hadoop () is a collection of open-source software utilities that facilitates using a network of many computers to solve problems involving massive amounts of data and computation. It provides a software framework for distributed storage and processing of big data using the MapReduce programming model. Hadoop was originally designed for computer clusters built from commodity hardware, which is still the common use. It has since also found use on clusters of higher-end hardware. All the modules in Hadoop are designed with a fundamental assumption that hardware failures are common occurrences and should be automatically handled by the framework.
The core of Apache Hadoop consists of a storage part, known as Hadoop Distributed File System (HDFS), and a processing part which is a MapReduce programming model. Hadoop splits files into large blocks and distributes them across nodes in a cluster. It then transfers packaged code into nodes to process the data in parallel. This approach takes advantage of data locality, where nodes manipulate the data they have access to. This allows the dataset to be processed faster and more efficiently than it would be in a more conventional supercomputer architecture that relies on a parallel file system where computation and data are distributed via high-speed networking.
The base Apache Hadoop framework is composed of the following modules:
Hadoop Common – contains libraries and utilities needed by other Hadoop modules;
Hadoop Distributed File System (HDFS) – a distributed file-system that stores data on commodity machines, providing very high aggregate bandwidth across the cluster;
Hadoop YARN – (introduced in 2012) is a platform responsible for managing computing resources in clusters and using them for scheduling users' applications;
Hadoop MapReduce – an implementation of the MapReduce programming model for large-scale data processing.
Hadoop Ozone – (introduced in 2020) An object store for Hadoop
The term Hadoop is o
|
https://en.wikipedia.org/wiki/Protocol-based%20intrusion%20detection%20system
|
A protocol-based intrusion detection system (PIDS) is an intrusion detection system which is typically installed on a web server, and is used in the monitoring and analysis of the protocol in use by the computing system. A PIDS will monitor the dynamic behavior and state of the protocol and will typically consist of a system or agent that would typically sit at the front end of a server, monitoring and analyzing the communication between a connected device and the system it is protecting.
A typical use for a PIDS would be at the front end of a web server monitoring the HTTP (or HTTPS) stream. Because it understands the HTTP relative to the web server/system it is trying to protect it can offer greater protection than less in-depth techniques such as filtering by IP address or port number alone, however this greater protection comes at the cost of increased computing on the web server.
Where HTTPS is in use then this system would need to reside in the "shim" or interface between where HTTPS is un-encrypted and immediately prior to it entering the Web presentation layer.
Monitoring dynamic behavior
At a basic level a PIDS would look for, and enforce, the correct use of the protocol.
At a more advanced level the PIDS can learn or be taught acceptable constructs of the protocol, and thus better detect anomalous behavior.
See also
Application protocol-based intrusion detection system (APIDS)
Host-based intrusion detection system (HIDS)
Intrusion detection system (IDS)
Network intrusion detection system (NIDS)
Tripwire (software) – a pioneering HIDS
Trusted Computing Group
Trusted platform module
Intrusion detection systems
Web server management software
es:PIDS
ko:호스트 기반 침입 탐지 시스템
it:Protocol intrusion detection system
|
https://en.wikipedia.org/wiki/Crooks%20fluctuation%20theorem
|
The Crooks fluctuation theorem (CFT), sometimes known as the Crooks equation, is an equation in statistical mechanics that relates the work done on a system during a non-equilibrium transformation to the free energy difference between the final and the initial state of the transformation. During the non-equilibrium transformation the system is at constant volume and in contact with a heat reservoir. The CFT is named after the chemist Gavin E. Crooks (then at University of California, Berkeley) who discovered it in 1998.
The most general statement of the CFT relates the probability of a space-time trajectory to the time-reversal of the trajectory . The theorem says if the dynamics of the system satisfies microscopic reversibility, then the forward time trajectory is exponentially more likely than the reverse, given that it produces entropy,
If one defines a generic reaction coordinate of the system as a function of the Cartesian coordinates of the constituent particles ( e.g. , a distance between two particles), one can characterize every point along the reaction coordinate path by a parameter , such that and correspond to two ensembles of microstates for which the reaction coordinate is constrained to different values. A dynamical process where is externally driven from zero to one, according to an arbitrary time scheduling, will be referred as forward transformation , while the time reversal path will be indicated as backward transformation. Given these definitions, the CFT sets a relation between the following five quantities:
, i.e. the joint probability of taking a microstate from the canonical ensemble corresponding to and of performing the forward transformation to the microstate corresponding to ;
, i.e. the joint probability of taking the microstate from the canonical ensemble corresponding to and of performing the backward transformation to the microstate corresponding to ;
, where is the Boltzmann constant and the temperature of
|
https://en.wikipedia.org/wiki/Application%20protocol-based%20intrusion%20detection%20system
|
An application protocol-based intrusion detection system (APIDS) is an intrusion detection system that focuses its monitoring and analysis on a specific application protocol or protocols in use by the computing system.
Overview
An APIDS will monitor the dynamic behavior and state of the protocol and will typically consist of a system or agent that would typically sit between a process, or group of servers, monitoring and analyzing the application protocol between two connected devices.
A typical place for an APIDS would be between a web server and the database management system, monitoring the SQL protocol specific to the middleware/business logic as it interacts with the database.
Monitoring dynamic behavior
At a basic level an APIDS would look for, and enforce, the correct (legal) use of the protocol.
However at a more advanced level the APIDS can learn, be taught or even reduce what is often an infinite protocol set, to an acceptable understanding of the subset of that application protocol that is used by the application being monitored/protected.
Thus, an APIDS, correctly configured, will allow an application to be "fingerprinted", thus should that application be subverted or changed, so will the fingerprint change.
See also
Intrusion detection system (IDS)
Web application firewall (WAF)
Intrusion detection systems
es:APIDS
ko:호스트 기반 침입 탐지 시스템
|
https://en.wikipedia.org/wiki/Compressed%20file%20library
|
A compressed file library (CFL) is designed to work as a virtual file system for programs, especially for video games. By compressing various game resources into one file, it is able to lower the number of file accesses. The resources can also be encrypted in the CFL.
CFL is used by X-Forge, the multi-platform wireless 3D game engine developed by Fathammer Ltd. It is also used by IMVU for its 3D character models and accessories.
See also
Doom WAD, a similar file system
References
External links
.CFL file at FILExt.com
Public domain resources including Compressed File Library
Video game development
Public-domain software with source code
|
https://en.wikipedia.org/wiki/Attack%20surface
|
The attack surface of a software environment is the sum of the different points (for "attack vectors") where an unauthorized user (the "attacker") can try to enter data to, extract data, control a device or critical software in an environment. Keeping the attack surface as small as possible is a basic security measure.
Elements of an attack surface
Worldwide digital change has accelerated the size, scope, and composition of an organization's attack surface. The size of an attack surface may fluctuate over time, adding and subtracting assets and digital systems (e.g. websites, hosts, cloud and mobile apps, etc.). Attack surface sizes can change rapidly as well. Digital assets eschew the physical requirements of traditional network devices, servers, data centers, and on-premise networks. This leads to attack surfaces changing rapidly, based on the organization's needs and the availability of digital services to accomplish it.
Attack surface scope also varies from organization to organization. With the rise of digital supply chains, interdependencies, and globalization, an organization's attack surface has a broader scope of concern (viz. vectors for cyberattacks). Lastly, the composition of an organization's attack surface consists of small entities linked together in digital relationships and connections to the rest of the internet and organizational infrastructure, including the scope of third-parties, digital supply chain, and even adversary-threat infrastructure.
An attack surface composition can range widely between various organizations, yet often identify many of the same elements, including:
Autonomous System Numbers (ASNs)
IP Address and IP Blocks
Domains and Sub-Domains (direct and third-parties)
SSL Certificates and Attribution
WHOIS Records, Contacts, and History
Host and Host Pair Services and Relationship
Internet Ports and Services
NetFlow
Web Frameworks (PHP, Apache, Java, etc.)
Web Server Services (email, database, applications)
Pub
|
https://en.wikipedia.org/wiki/Open%20Archival%20Information%20System
|
An Open Archival Information System (or OAIS) is an archive, consisting of an organization of people and systems, that has accepted the responsibility to preserve information and make it available for a Designated Community. The OAIS model can be applied to various archives, e.g., open access, closed, restricted, "dark", or proprietary.
The term OAIS also refers, by extension, to the ISO OAIS Reference Model for an OAIS. This reference model is defined by recommendation CCSDS 650.0-B-2 of the Consultative Committee for Space Data Systems; this text is identical to = 57284 ISO 14721:2012. The CCSDS's purview is space agencies, but the OAIS model it developed has proved useful to other organizations and institutions with digital archiving needs. OAIS, known as ISO 14721:2003, is widely accepted and utilized by various organizations and disciplines, both national and international, and was designed to ensure preservation. The OAIS standard, published in 2005, is considered the optimum standard to create and maintain a digital repository over a long period of time.
The information being maintained has been deemed to need "long term preservation", even if the OAIS itself is not permanent. "Long term" is long enough to be concerned with the impacts of changing technologies, including support for new media and data formats, or with a changing user community. "Long term" may extend indefinitely. The OAIS defines a long period of time as any length of time that might be impacted by changing technologies and the changing of "Designated Community," e.g., any group of consumers capable of understanding the information. This length of time can be indefinite. The archive defines the community and that definition is not fixed.
The "O" in OAIS represents the "open way the standard was developed", and does not represent "open access", or the usage of the term open in the Open Definition or Open Archives Initiative. The "I" in OAIS represents "information", meaning data th
|
https://en.wikipedia.org/wiki/Unicode%20symbol
|
In computing, a Unicode symbol is a Unicode character which is not part of a script used to write a natural language, but is nonetheless available for use as part of a text.
Many of the symbols are drawn from existing character sets or ISO/IEC or other national and international standards. The Unicode Standard states that "The universe of symbols is rich and open-ended," but that in order to be considered, a symbol must have a "demonstrated need or strong desire to exchange in plain text." This makes the issue of what symbols to encode and how symbols should be encoded more complicated than the issues surrounding writing systems. Unicode focuses on symbols that make sense in a one-dimensional plain-text context. For example, the typical two-dimensional arrangement of electronic diagram symbols justifies their exclusion. (Box-drawing characters are a partial exception, for legacy purposes, and a number of electronic diagram symbols are indeed encoded in Unicode's Miscellaneous Technical block.) For adequate treatment in plain text, symbols must also be displayable in a monochromatic setting. Even with these limitations monochromatic, one-dimensional and standards-based the domain of potential Unicode symbols is extensive. (However, emojis ideograms, graphic symbols that were admitted into Unicode, allow colors although the colors are not standardized.)
Symbol block list
There are , including the following symbol blocks:
Alphanumeric variants (based on Latin characters in Unicode)
Currency Symbols (U+20A0–U+20CF)
General Punctuation (U+2000–U+206F)
Letterlike Symbols (U+2100–U+214F)
Number Forms (U+2150–U+218F)
Phonetic symbols (including IPA) (various blocks)
Superscripts and Subscripts (U+2070–U+209F)
Enclosed variants
Enclosed Alphanumeric Supplement (1F100–1F1FF)
Enclosed Alphanumerics (U+2460–U+24FF)
Enclosed Ideographic Supplement (1F200–1F2FF)
Arrows
Arrows (U+2190–U+21FF)
Dingbats arrows (U+2794–U+27BF)
Miscellaneous Symbols and Arrows (U+2B
|
https://en.wikipedia.org/wiki/Mathematical%20operators%20and%20symbols%20in%20Unicode
|
The Unicode Standard encodes almost all standard characters used in mathematics.
Unicode Technical Report #25 provides comprehensive information about the character repertoire, their properties, and guidelines for implementation.
Mathematical operators and symbols are in multiple Unicode blocks. Some of these blocks are dedicated to, or primarily contain, mathematical characters while others are a mix of mathematical and non-mathematical characters. This article covers all Unicode characters with a derived property of "Math".
Dedicated blocks
Mathematical Operators block
The Mathematical Operators block (U+2200–U+22FF) contains characters for mathematical, logical, and set notation.
Supplemental Mathematical Operators block
The Supplemental Mathematical Operators block (U+2A00–U+2AFF) contains various mathematical symbols, including N-ary operators, summations and integrals, intersections and unions, logical and relational operators, and subset/superset relations.
Mathematical Alphanumeric Symbols block
The Mathematical Alphanumeric Symbols block (U+1D400–U+1D7FF) contains Latin and Greek letters and decimal digits that enable mathematicians to denote different notions with different letter styles. The reserved code points (the "holes") in the alphabetic ranges up to U+1D551 duplicate characters in the Letterlike Symbols block.
Letterlike Symbols block
The Letterlike Symbols block (U+2100–U+214F) includes variables. Most alphabetic math symbols are in the Mathematical Alphanumeric Symbols block shown above.
The math subset of this block is U+2102, U+2107, U+210A–U+2113, U+2115, U+2118–U+211D, U+2124, U+2128–U+2129, U+212C–U+212D, U+212F–U+2131, U+2133–U+2138, U+213C–U+2149, and U+214B.
Miscellaneous Mathematical Symbols-A block
The Miscellaneous Mathematical Symbols-A block (U+27C0–U+27EF) contains characters for mathematical, logical, and database notation.
Miscellaneous Mathematical Symbols-B block
The Miscellaneous Mathematical Symbols-B block (
|
https://en.wikipedia.org/wiki/Human%20artificial%20chromosome
|
A human artificial chromosome (HAC) is a microchromosome that can act as a new chromosome in a population of human cells. That is, instead of 46 chromosomes, the cell could have 47 with the 47th being very small, roughly 6–10megabases (Mb) in size instead of 50–250Mb for natural chromosomes, and able to carry new genes introduced by human researchers. Ideally, researchers could integrate different genes that perform a variety of functions, including disease defense.
Alternative methods of creating transgenes, such as utilizing yeast artificial chromosomes and bacterial artificial chromosomes, lead to unpredictable problems. The genetic material introduced by these vectors not only leads to different expression levels, but the inserts also disrupt the original genome. HACs differ in this regard, as they are entirely separate chromosomes. This separation from existing genetic material assumes that no insertional mutants would arise. This stability and accuracy makes HACs preferable to other methods such as viral vectors, YACs, and BACs. HACs allow for delivery of more DNA (including promoters and copy-number variation) than is possible with viral vectors.
Yeast artificial chromosomes and bacterial artificial chromosomes were created before human artificial chromosomes, which were first developed in 1997. HACs are useful in expression studies as gene transfer vectors, as a tool for elucidating human chromosome function, and as a method for actively annotating the human genome.
History
HACs were first constructed de novo in 1997 by adding alpha-satellite DNA to telomeric and genomic DNA in human HT1080 cells. This resulted in an entirely new microchromosome that contained DNA of interest, as well as elements allowing it to be structurally and mitotically stable, such as telomeric and centromeric sequences. Due to the difficulty of de novo HAC formation, this method has largely been abandoned.
Construction methods
There are currently two accepted models for the crea
|
https://en.wikipedia.org/wiki/Twinkle%20%28software%29
|
Twinkle is a free and open-source application for voice communications over Voice over IP (VoIP) protocol.
Architecture
It is designed for Linux operating systems and uses the Qt toolkit for its graphical user interface. For call signaling it employs the Session Initiation Protocol (SIP). It also features direct IP-to-IP calls. Media streams are transmitted via the Real-time Transport Protocol (RTP) which may be encrypted with the Secure Real-time Transport Protocol (SRTP) and the ZRTP security protocols.
Since version 1.3.2 (September 2008), Twinkle supports message exchange and a buddy-list feature for presence notification, showing the online-status of predefined communications partners (provider-support needed).
Supported audio formats
G.711 A-law: 64 kbit/s payload, 8 kHz sampling rate
G.711 μ-law: 64 kbit/s payload, 8 kHz sampling rate
G.726: 16, 24, 32 or 40 kbit/s payload, 8 kHz sampling rate
GSM: 13 kbit/s payload, 8 kHz sampling rate
G.729: 8 kbit/s payload, 8 kHz sampling rate
iLBC: 13.3 or 15.2 kbit/s payload, 8 kHz sampling rate
Speex narrow band: 15.2 kbit/s payload, 8 kHz sampling rate
Speex wide band: 28 kbit/s payload, 16 kHz sampling rate
Speex ultra wide band: 36 kbit/s payload, 32 kHz sampling rate
See also
Comparison of VoIP software
List of SIP software
List of free and open-source software packages
Opportunistic encryption
References
Free VoIP software
Cryptographic software
Internet privacy software
Secure communication
Software that uses Qt
KDE software
|
https://en.wikipedia.org/wiki/Subcellular%20localization
|
The cells of eukaryotic organisms are elaborately subdivided into functionally-distinct membrane-bound compartments. Some major constituents of eukaryotic cells are: extracellular space, plasma membrane, cytoplasm, nucleus, mitochondria, Golgi apparatus, endoplasmic reticulum (ER), peroxisome, vacuoles, cytoskeleton, nucleoplasm, nucleolus, nuclear matrix and ribosomes.
Bacteria also have subcellular localizations that can be separated when the cell is fractionated. The most common localizations referred to include the cytoplasm, the cytoplasmic membrane (also referred to as the inner membrane in Gram-negative bacteria), the cell wall (which is usually thicker in Gram-positive bacteria) and the extracellular environment. The cytoplasm, the cytoplasmic membrane and the cell wall are subcellular localizations, whereas the extracellular environment is clearly not. Most Gram-negative bacteria also contain an outer membrane and periplasmic space. Unlike eukaryotes, most bacteria contain no membrane-bound organelles, however there are some exceptions (i.e. magnetosomes).
Protein Subcellular Location Databases
The experimentally determined subcellular locations of proteins can be found in UniProtKB, Compartments, and in a few more specialized resources, such as the lactic acid bacterial secretome database.
There are also several subcellular location databases with computational predictions, such as the fungal secretome and subcellular proteome knowledgebase - version 2 (FunSecKB2), the plant secretome and subcellular proteome knowledgebase (PlantSecKB), MetazSecKB for protein subcellular locations of human and animals, and ProtSecKB for protein subcellular locations of all protists.
See also
Protein targeting
Protein subcellular localization prediction.
References
Cell biology
|
https://en.wikipedia.org/wiki/List%20of%20macronutrients
|
This list is a categorization of the most common food components based on their macronutrients. Macronutrients can refer to the chemical substances that humans consume in the largest quantities (See Nutrient)
Macronutrients that provide energy
There are three principal classes of macronutrients: carbohydrate, protein, and fat. Macronutrients are defined as a class of chemical compounds which humans consume in relatively large quantities compared to vitamins and minerals, and which provide humans with energy. Fat has a food energy content of and proteins and carbohydrates .
Water makes up a large proportion of the total mass ingested as part of a normal diet, but it does not provide any nutritional value. Ethanol provides calories, but there is no requirement for ethanol as an essential nutrient.
Carbohydrates
Glucose
Sucrose
Ribose
Amylose (a major component of starch)
Amylopectin
Maltose
Galactose
Fructose
Lactose
Protein
Essential and non-essential amino acids
Alanine
Arginine
Aspartic acid (aspartate)
Asparagine
Cysteine
Glutamic acid (glutamate)
Glutamine
Glycine
Histidine
Isoleucine
Leucine
Lysine
Methionine
Phenylalanine
Proline
Serine
Threonine
Tryptophan
Tyrosine
Valine
Fats
Saturated (i.e., stable) fatty acids
Acetic acid (C2)
Propionic acid (C3)
Butyric acid (C4)
Valeric acid (C5)
Caproic acid (C6)
Caprylic acid (C8)
Capric acid (C10)
Lauric acid (C12)
Myristic acid (C14)
Pentadecanoic acid (C15)
Palmitic acid (C16)
Margaric acid (C17)
Stearic acid (C18)
Arachidic acid (C20)
Behenic acid (C22)
Lignoceric acid (C24)
Cerotic acid (C26)
Monounsaturated (i.e., semi-stable) fatty acids
Myristoleic acid
Oleic acid
Eicosenoic acids
Erucic acid
Nervonic acid
Polyunsaturated (i.e., unstable) fatty acids
Linoleic acid (LA) - an essential fatty acid
α-Linolenic acid (ALA) - an essential fatty acid
Stearidonic acid (SDA)
Gamma-Linolenic acid (GLA)
Arachidonic acid (AA)
Eicosatetraenoic acid (ETA)
Timnodonic ac
|
https://en.wikipedia.org/wiki/List%20of%20micronutrients
|
Micronutrients are nutrients such as vitamins and minerals required by organisms in varying quantities throughout life to orchestrate a range of physiological functions to maintain health.
The following is a list of micronutrients.
Minerals
Calcium
Sulfur
Phosphorus
Magnesium
Sodium
Potassium
Iron
Zinc
Trace elements
Boron
Copper
Chromium (disputed, as the European Union does not recognize chromium as an essential nutrient)
Selenium
Manganese
Molybdenum
Cobalt (as a component of vitamin B12)
Fluorine
Iodine
Vitamins
Vitamin B complex
Vitamin B1 (thiamin)
Vitamin B2 (riboflavin)
Vitamin B3 (niacin)
Vitamin B5 (pantothenic acid)
Vitamin B6 group:
Pyridoxine
Pyridoxal-5-Phosphate
Pyridoxamine
Vitamin B7 (biotin)
Vitamin B9 (folate)
Vitamin B12 (cobalamin)
Choline
Vitamin A (e.g. retinol (see also - provitamin A carotenoids))
Vitamin C (Ascorbic acid)
Vitamin D
Ergocalciferol
Cholecalciferol
Vitamin E (tocopherols and tocotrienols)
Vitamin K
Vitamin K1 (phylloquinone)
Vitamin K2 (menaquinone)
Vitamin K3 (menadione)
Carotenoids (not accepted as essential nutrients)
Alpha carotene
Beta carotene
Cryptoxanthin
Lutein
Lycopene
Zeaxanthin
See also
List of macronutrients
List of phytochemicals in food
Nutrient
Nutrition
References
Micronutrients
|
https://en.wikipedia.org/wiki/Extracellular%20space
|
Extracellular space refers to the part of a multicellular organism outside the cells, usually taken to be outside the plasma membranes, and occupied by fluid. This is distinguished from intracellular space, which is inside the cells.
The composition of the extracellular space includes metabolites, ions, proteins, and many other substances that might affect cellular function. For example, neurotransmitters "jump" from cell to cell to facilitate the transmission of an electric current in the nervous system. Hormones also act by travelling the extracellular space towards cell receptors.
In cell biology, molecular biology and related fields, the word extracellular (or sometimes extracellular space) means "outside the cell". This space is usually taken to be outside the plasma membranes, and occupied by fluid (see extracellular matrix). The term is used in contrast to intracellular (inside the cell).
According to the Gene Ontology, the extracellular space is a cellular component defined as: "That part of a multicellular organism outside the cells proper, usually taken to be outside the plasma membranes, and occupied by fluid. For multicellular organisms, the extracellular space refers to everything outside a cell, but still within the organism (excluding the extracellular matrix). Gene products from a multi-cellular organism that are secreted from a cell into the interstitial fluid or blood can therefore be annotated to this term".
The composition of the extracellular space includes metabolites, ions, various proteins and non-protein substances (e.g. DNA, RNA, lipids, microbial products etc.), and particles such as extracellular vesicles that might affect cellular function. For example, hormones, growth factors, cytokines and chemokines act by travelling the extracellular space towards biochemical receptors on cells. Other proteins that are active outside the cell are various enzymes, including digestive enzymes (Trypsin, Pepsin), extracellular proteinases (Matrix me
|
https://en.wikipedia.org/wiki/PBIST
|
Programmable Built-In Self-Test (PBIST) is a memory DFT feature that incorporates all the required test systems into the chip itself. The test systems implemented on-chip are as follows:
algorithmic address generator
algorithmic data generator
program storage unit
loop control mechanisms
PBIST was originally adopted by large memory chips that have high pin counts and operate at high frequencies, thereby exceeding the capability of production testers.
The purpose of PBIST is to avoid developing and buying more sophisticated and very expensive testers. The interface between PBIST, which is internal to the processor, and the external tester environment is through
the standard JTAG TAP controller pins. Algorithms and controls are fed into the chip through the TAP controller's Test Data Input (TDI) pin. The final result of the PBIST test is read out through the Test Data Output (TDO) pin.
PBIST supports the entire algorithmic memory testing requirements imposed by the production testing methodology. In order to support all of the required test algorithms, PBIST must have the capability to store the required programs locally in the device. It must also be able to perform different address generation schemes, different test data pattern generation, looping schemes, and data comparisons.
Work on most of programmable memory BIST approaches concerns the programmability of the memory test algorithm. The programmable memory BIST proposed has several advantages:
• It enables programming both test algorithms and test data.
• It implements test algorithm programmability at low cost, by extracting the different levels of hierarchy of the test algorithm and associating a hardware bloc to each of them, resulting on low cost hardware
• It enables low-cost implementation of full-data programmability by adapting the transparent memory test approach in a manner that uses the memory under test for programming the test data.
Part of the Built-in self-test.
Electronic design aut
|
https://en.wikipedia.org/wiki/PikeOS
|
PikeOS is a commercial, hard real-time operating system (RTOS) that offers a separation kernel based hypervisor with multiple logical partition types for many other operating systems (OS), each called a GuestOS, and applications. It enables users to build certifiable smart devices for the Internet of things (IoT) according to the high quality, safety and security standards of different industries. For safety and security, critical real-time applications on controller-based systems without memory management unit (MMU) but with memory protection unit (MPU) PikeOS for MPU is available.
Overview
PikeOS was introduced in 2005 and combines a real-time operating system (RTOS) with a virtualization platform and Eclipse-based integrated development environment (IDE) for embedded systems. It is a commercial clone of L4 microkernel family. PikeOS has been developed for safety and security-critical applications with certification needs in the fields of aerospace, defense, automotive, transport, industrial automation, medical, network infrastructures, and consumer electronics. The PikeOS separation kernel (v5.1.3) is certified against Common Criteria at EAL5+.
A key feature of PikeOS is an ability to safely execute applications with different safety and security levels concurrently on the same computing platform. This is done by strict spatial and temporal segregation of these applications via software partitions. A software partition can be seen as a container with pre-allocated privileges that can have access to memory, central processing unit (CPU) time, input/output (I/O), and a predefined list of OS services. With PikeOS, the term application refers to an executable linked against the PikeOS application programming interface (API) library and running as a process inside a partition. The nature of the PikeOS application programming interface (API) allows applications to range from simple control loops up to full paravirtualized guest operating systems like Linux or hardwar
|
https://en.wikipedia.org/wiki/Office%20of%20the%20Chief%20Actuary
|
The Office of the Chief Actuary is a government agency that has responsibility for actuarial estimates regarding social welfare programs. In Canada, the Office of the Chief Actuary works with the Canada Pension Plan and the Old Age Security Program. In the United States, the Social Security Administration has an Office of the Chief Actuary that deals with Social Security, and the Centers for Medicare and Medicaid Services have an Office of the Actuary that deals with Medicare and Medicaid. A similar agency in the United Kingdom is called the Government Actuary's Department (GAD).
United States
Social Security Administration
In the U.S., the Office of the Chief Actuary at the Social Security Administration plans and directs a program of actuarial estimates and analyses relating to SSA-administered retirement, survivors and disability insurance programs and to proposed changes in those programs. It evaluates operations of the Federal Old-Age and Survivors Insurance Trust Fund and the Federal Disability Insurance Trust Fund, conducts studies of program financing, performs actuarial and demographic research on social insurance and related program issues, and projects future workloads.
In addition, the office is charged with conducting cost analyses relating to the Supplemental Security Income (SSI) program, a general-revenue financed, means-tested program for low-income aged, blind and disabled people. The Office provides technical and consultative services to the Commissioner, to the board of trustees of the Social Security Trust Funds, and its staff appears before Congressional Committees to provide expert testimony on the actuarial aspects of Social Security issues.
, the Chief Actuary of the Social Security Administration is Stephen Goss.
References
External links
Office of the Chief Actuary, Canada
Office of the Chief Actuary, Social Security Administration, U.S.
Office of the Actuary, Centers for Medicare and Medicaid Services, U.S.
Actuarial science
Medic
|
https://en.wikipedia.org/wiki/CDC%20Kronos
|
Kronos is an operating system with time-sharing capabilities, written by Control Data Corporation in 1971. Kronos ran on the 60-bit CDC 6000 series mainframe computers and their successors. CDC replaced Kronos with the NOS operating system in the late 1970s, which were succeeded by the NOS/VE operating system in the mid-1980s.
The MACE operating system and APEX were forerunners to KRONOS. It was written by Control Data systems programmer Greg Mansfield, Dave Cahlander, Bob Tate and three others.
See also
CDC SCOPE
References
KRONOS
Discontinued operating systems
Time-sharing operating systems
|
https://en.wikipedia.org/wiki/Degree%20of%20a%20polynomial
|
In mathematics, the degree of a polynomial is the highest of the degrees of the polynomial's monomials (individual terms) with non-zero coefficients. The degree of a term is the sum of the exponents of the variables that appear in it, and thus is a non-negative integer. For a univariate polynomial, the degree of the polynomial is simply the highest exponent occurring in the polynomial. The term order has been used as a synonym of degree but, nowadays, may refer to several other concepts (see Order of a polynomial (disambiguation)).
For example, the polynomial which can also be written as has three terms. The first term has a degree of 5 (the sum of the powers 2 and 3), the second term has a degree of 1, and the last term has a degree of 0. Therefore, the polynomial has a degree of 5, which is the highest degree of any term.
To determine the degree of a polynomial that is not in standard form, such as , one can put it in standard form by expanding the products (by distributivity) and combining the like terms; for example, is of degree 1, even though each summand has degree 2. However, this is not needed when the polynomial is written as a product of polynomials in standard form, because the degree of a product is the sum of the degrees of the factors.
Names of polynomials by degree
The following names are assigned to polynomials according to their degree:
Special case – zero (see , below)
Degree 0 – non-zero constant
Degree 1 – linear
Degree 2 – quadratic
Degree 3 – cubic
Degree 4 – quartic (or, if all terms have even degree, biquadratic)
Degree 5 – quintic
Degree 6 – sextic (or, less commonly, hexic)
Degree 7 – septic (or, less commonly, heptic)
Degree 8 – octic
Degree 9 – nonic
Degree 10 – decic
Names for degree above three are based on Latin ordinal numbers, and end in -ic. This should be distinguished from the names used for the number of variables, the arity, which are based on Latin distributive numbers, and end in -ary. For example, a degre
|
https://en.wikipedia.org/wiki/277%20%28number%29
|
277 (two hundred [and] seventy-seven) is the natural number following 276 and preceding 278.
Mathematical properties
277 is the 59th prime number, and is a regular prime.
It is the smallest prime p such that the sum of the inverses of the primes up to p is greater than two.
Since 59 is itself prime, 277 is a super-prime. 59 is also a super-prime (it is the 17th prime), as is 17 (the 7th prime). However, 7 is the fourth prime number, and 4 is not prime. Thus, 277 is a super-super-super-prime but not a super-super-super-super-prime. It is the largest prime factor of the Euclid number 510511 = 2 × 3 × 5 × 7 × 11 × 13 × 17 + 1.
As a member of the lazy caterer's sequence, 277 counts the maximum number of pieces obtained by slicing a pancake with 23 straight cuts.
277 is also a Perrin number, and as such counts the number of maximal independent sets in an icosagon. There are 277 ways to tile a 3 × 8 rectangle with integer-sided squares, and 277 degree-7 monic polynomials with integer coefficients and all roots in the unit disk.
On an infinite chessboard, there are 277 squares that a knight can reach from a given starting position in exactly six moves.
277 appears as the numerator of the fifth term of the Taylor series for the secant function:
Since no number added to the sum of its digits generates 277, it is a self number. The next prime self number is not reached until 367.
References
Integers
ca:Nombre 270#Nombres del 271 al 279
|
https://en.wikipedia.org/wiki/Drago%20Kolar
|
Professor Drago Kolar (1932–2000) was a head of the Ceramics Department at the Jozef Stefan Institute (Ljubljana, Slovenia) from 1965 until 1997.
Kolar was one of the world leading scientists in the field of ceramic materials. His main scientific interest was in sintering mechanisms and microstructure development in ceramics, high-temperature phase equilibria and functional ceramics.
He published, together with his co-workers, over 200 publications in international periodicals, over 200 publications in the proceedings of international conferences and co-authored nine patents. Besides his research activities he taught at the University of Ljubljana. He supervised 36 doctoral theses, 54 master's theses and 146 B.Sc. theses.
Among his honours and awards the most distinguished are: "Ambassador of Science of the Republic of Slovenia" (1995), "Honorary Diploma of the International Institute for the Science of Sintering" (1979), "Niobium Medal of the Max-Planck Institute" (1987), "Two Particle Man" recognition, German Powder Met. Soc. (1997).
The IJS magazine No. 79 (February 2000) was dedicated to Kolar (see articles in English by Guenter Petzow from MPI Stuttgart and by J.P. Guha from IJS).
Awards and honours
Boris Kidrič Award for Highest Scientific Achievements (1982)
Boris Kidrič Fund Award for Scientific Achievements (1972)
Boris Kidrič Fund Awards for Innovations and Patents (1974, 1977, 1978 (2x), 1980, 1985, 1986, 1990)
Ambassador of Science of Republic of Slovenia (1995)
Iskra Award (1979)
Fellow of the American Ceramic Society (1989)
Member of Academia Europaea (London) (1989)
Member of Academy of Ceramics (Faenza) (1989)
Titular Member of IUPAC Commission for High Temperature and Solid State Chemistry (1994)
Member of Sigma Xi Society (1983)
Honorary Diploma of the International Institute for Science of Sintering (1979)
Recognition of the Serbian Chemical Society (1973)
Recognition of Yugoslavian ETAN Society (1979)
Special Recognition of Isk
|
https://en.wikipedia.org/wiki/List%20of%20wireless%20community%20networks%20by%20region
|
Megasurf wireless internet os covering the area.
Africa
DRC
Mesh Bukavu
Pamoja Net
Ghana
Akwapim Community Wireless Network
Somalia
Abaarso
South Africa
Rural Telehealth
Orange Farm:
Zenzeleni:
Home of Compassion
Tanzania
Sengerema Wireless Community Network
Kenya
TunapandaNET Community Network
Tunisia
Mesh SAYADA
Asia
Nepal Wireless Networking Project
Middle East
Oceania
Australia
Air Stream Wireless
Melbourne Wireless
TasWireless, Tasmania
Europe
Austria
FunkFeuer
Belgium
Bulgaria
Croatia
Cyprus
Czechia
Denmark
Estonia
Finland
France
Clermont Sans Fil
Germany
Freifunk
Greece
Athens Wireless Metropolitan Network
Wireless Thessaloniki
Sarantaporo.gr Wireless Community Network
Hungary
Ireland
CRCWN Cavan Rural Community Wireless Network. Free Wi-Fi and Fixed Wireless Internet.
(www.crcwn.online)
Italy
ninux
Progetto Neco
Latvia
Lithuania
Luxembourg
Malta
Netherlands
Wireless Leiden
Poland
Hyperboria PL (hyperboria.net.pl)
Portugal
Wirelesspt
Romania
Slovakia
Slovenia
wlan slovenija
Spain
guifi.net
Sweden
Pjodd
United Kingdom
Southampton Open Wireless Network
Americas
North America
Canada
Nova Scotia
Chebucto Community Network, Halifax Regional Municipality
Ontario
Toronto Mesh
Wireless Toronto
Wireless Nomad, Ontario and Toronto
Québec
Île Sans Fil, Montreal
ZAP Sherbrooke, Sherbrooke
Cuba
SNET (abbreviation of "Street Network"), nationwide underground community network
United States
Arizona
Tucson Mesh, Tucson
California
People's Open Network, Oakland
Illinois
Champaign-Urbana Community Wireless Network
Minnesota
Minneapolis wireless internet network
New York
NYC Mesh
Red Hook Wi-Fi
Oregon
Personal Telco, Portland, OR
Vermont
Newport Wireless Mesh, Newport City, Vermont
Washington
Seattle Wireless
West Virginia
West Virginia Broadband
South America
Argentina
Altermundi
Brazil
Coolab
See also
Computer network
Metropolitan area network
Wireless community ne
|
https://en.wikipedia.org/wiki/Not%20Just%20Another%20Bogus%20List
|
Not Just Another Bogus List (NJABL) was a DNS blacklist.
NJABL maintained a list of known and potential spam sources (open mail relays, open proxies, open form to mail HTTP gateways, dynamic IP pools, and direct spammers) for the purpose of being able to tag or refuse e-mail and thereby block spam from certain sources. NJABL automatically retests only listed open relays every 90 days.
The Open Proxy IPs portion (only) of NJABL data was used in Spamhaus XBL list
NJABL's dynamic IP list originally came from Dynablock but was maintained independently since Dynablock stopped updating December 2003. The SORBS dynamic IP list is also a development from Dynablock, but is more aggressively inclusive than NJABL's version.
As of March 1, 2013, NJABL is in the process of being shut down. The DNSBL zones have been emptied. After "the Internet" has had some time to remove NJABL from server configs, the NS's will be pointed off into unallocated space (192.0.2.0/24 TEST-NET-1) to hopefully make the shutdown obvious to those who were slower to notice.
As of April 29, the above-mentioned pointing of the DNSBL NS's into 192.0.2.0/24 has been done.
As of Jan 02/2019, the domain name njabl.org was set to expire and dns servers were switched to tucows autorenew servers which would cause any lookups by servers still not having removed the configuration to have rejections.
References
External links
Computer security procedures
Spamming
|
https://en.wikipedia.org/wiki/Composite%20Blocking%20List
|
In computer networking, the Composite Blocking List (CBL) is a DNS-based Blackhole List of suspected E-mail spam sending computer infections.
Overview
The CBL takes its source data from very large spamtraps/mail infrastructures, and only lists IPs exhibiting characteristics such as:
Open proxies of various sorts (HTTP, socks, AnalogX, wingate etc.)
Worms/viruses/botnets that do their own direct mail transmission, or are otherwise participating in a botnet.
Trojan horse or "stealth" spamware.
The CBL attempts to avoid listing real mail servers, but certain misconfigurations of mail servers can make the system appear infected (for example, servers that send HELO with 'localhost' or a similar incorrect domain.)
Entries automatically expire after a period of time.
The CBL does not provide public access to gathered evidence.
CBL data are used in Spamhaus XBL list.
See also
Comparison of DNS blacklists
CBL Index — estimate of outgoing spam reputation
External links
The CBL
CBL lookup and removal page
Computer security procedures
Spamming
|
https://en.wikipedia.org/wiki/International%20Software%20Testing%20Qualifications%20Board
|
The International Software Testing Qualifications Board (ISTQB) is a software testing certification board that operates internationally. Founded in Edinburgh in November 2002, the ISTQB is a non-profit association legally registered in Belgium.
ISTQB Certified Tester is a standardized qualification for software testers and the certification is offered by the ISTQB. The qualifications are based on a syllabus, and there is a hierarchy of qualifications and guidelines for accreditation and examination. More than 1 million ISTQB exams have been delivered and over 721,000 certifications issued; the ISTQB consists of 67 member boards worldwide representing more than 100 countries as of April 2021.
Product portfolio
Current ISTQB product portfolio follows a matrix approach characterized by
Levels, that identify progressively increasing learning objectives
Foundation
Advanced
Expert
Streams, that identify clusters of certification modules:
Core
Agile
Specialist
ISTQB streams focus on:
Core – these modules correspond to the “historical” ISTQB certifications and so they:
Cover software testing topic in a breadth-first, broad, horizontal way,
Are valid for any technology/ methodology/ application domain
Allow for a common understanding
Agile – these modules address testing practices specifically for the Agile SDLC
Specialist – these modules are new in the ISTQB product portfolio and address specific topics in a vertical way:
They can address specific quality characteristics (e.g.: Usability; Security; Performance; etc.)
They can address technologies that involve specific test approaches (e.g.: model based testing; mobile testing; etc.)
They can also be related to specific test activities (e.g.: test automation; test metrics management; etc.)
Pre-conditions
Pre-conditions relate to certification exams and provide a natural progression through the ISTQB Scheme which helps people pick the right certificate and informs them about what they need to know.
The
|
https://en.wikipedia.org/wiki/Virus%20hoax
|
A computer virus hoax is a message warning the recipients of a non-existent computer virus threat. The message is usually a chain e-mail that tells the recipients to forward it to everyone they know, but it can also be in the form of a pop-up window.
Identification
Most hoaxes are sensational in nature and easily identified by the fact that they indicate that the virus will do nearly impossible things, like blow up the recipient's computer and set it on fire, or less sensationally, delete everything on the user's computer. They often include fake announcements claimed to originate from reputable computer organizations together with mainstream news media. These bogus sources are quoted in order to give the hoax more credibility. Typically, the warnings use emotive language, stress the urgent nature of the threat and encourage readers to forward the message to other people as soon as possible.
Virus hoaxes are usually harmless and accomplish nothing more than annoying people who identify it as a hoax and wasting the time of people who forward the message. Nevertheless, a number of hoaxes have warned users that vital system files are viruses and encourage the user to delete the file, possibly damaging the system. Examples of this type include the jdbgmgr.exe virus hoax and the SULFNBK.EXE hoax.
Some consider virus hoaxes and other chain e-mails to be a computer worm in and of themselves. They replicate by social engineering—exploiting users' concern, ignorance, and disinclination to investigate before acting.
Hoaxes are distinct from computer pranks, which are harmless programs that perform unwanted and annoying actions on a computer, such as randomly moving the mouse, turning the screen display upside down, etc.
Action
Anti-virus specialists agree that recipients should delete virus hoaxes when they receive them, instead of forwarding them.
McAfee says:
F-Secure recommends:
Comparison
Telephone scam
A telephone scam, commonly operated from call centres based
|
https://en.wikipedia.org/wiki/Pendulum%20%28mechanics%29
|
A pendulum is a body suspended from a fixed support so that it swings freely back and forth under the influence of gravity. When a pendulum is displaced sideways from its resting, equilibrium position, it is subject to a restoring force due to gravity that will accelerate it back toward the equilibrium position. When released, the restoring force acting on the pendulum's mass causes it to oscillate about the equilibrium position, swinging it back and forth. The mathematics of pendulums are in general quite complicated. Simplifying assumptions can be made, which in the case of a simple pendulum allow the equations of motion to be solved analytically for small-angle oscillations.
Simple gravity pendulum
A simple gravity pendulum is an idealized mathematical model of a real pendulum. This is a weight (or bob) on the end of a massless cord suspended from a pivot, without friction. Since in this model there is no frictional energy loss, when given an initial displacement it will swing back and forth at a constant amplitude. The model is based on these assumptions:
The rod or cord on which the bob swings is massless, inextensible and always remains taut.
The bob is a point mass.
Motion occurs only in two dimensions, i.e. the bob does not trace an ellipse but an arc.
The motion does not lose energy to friction or air resistance.
The gravitational field is uniform.
The support does not move.
The differential equation which represents the motion of a simple pendulum is
where is the magnitude of the gravitational field, is the length of the rod or cord, and is the angle from the vertical to the pendulum.
Small-angle approximation
The differential equation given above is not easily solved, and there is no solution that can be written in terms of elementary functions. However, adding a restriction to the size of the oscillation's amplitude gives a form whose solution can be easily obtained. If it is assumed that the angle is much less than 1 radian (often cite
|
https://en.wikipedia.org/wiki/Waffle%20%28BBS%20software%29
|
Waffle is a bulletin-board system created by Tom Dell for the Dark Side of the Moon BBS which ran under DOS and later UNIX. The software was unique among DOS BBS software in many ways, including the fact that all of the configuration files were in readable text files, and that it fully supported Usenet and UUCP on the DOS platform.
A Usenet news group named comp.bbs.waffle was created for discussion of the Waffle BBS System.
Waffle was first released in 1989. The last version seems to be v1.65. There was a beta version of 1.66 on the main site, but it was never released.
It was possible to link Waffle (under DOS) to Fidonet and WWIV using external gateway utilities.
References
External links
comp.bbs.waffle FAQ
More history
Pyffle BBS - a Waffle clone written in Python that runs on modern systems (last update in 2011)
Bulletin board system software
Network protocols
Usenet
|
https://en.wikipedia.org/wiki/Landscape%20epidemiology
|
Landscape epidemiology draws some of its roots from the field of landscape ecology. Just as the discipline of landscape ecology is concerned with analyzing both pattern and process in ecosystems across time and space, landscape epidemiology can be used to analyze both risk patterns and environmental risk factors. This field emerges from the theory that most vectors, hosts and pathogens are commonly tied to the landscape as environmental determinants control their distribution and abundance. In 1966, Evgeniy Pavlovsky introduced the concept of natural nidality or focality, defined by the idea that microscale disease foci are determined by the entire ecosystem. With the recent availability of new computing technologies such as geographic information systems, remote sensing, statistical methods including spatial statistics and theories of landscape ecology, the concept of landscape epidemiology has been applied analytically to a variety of disease systems, including malaria, hantavirus, Lyme disease and Chagas' disease.
See also
Tele-epidemiology
References
Epidemiology
Landscape ecology
Biogeography
Environmental health
Veterinary medicine
|
https://en.wikipedia.org/wiki/Secure%20Network
|
Secure Network is a small offensive security and security research company focusing on Information Security based in Milano, Italy. Besides having notability in Italy, it received international exposure with a research project on Bluetooth security (co-sponsored by F-Secure) codenamed BlueBag, which has been also selected for the Black Hat Briefings conference 2006 in Las Vegas.
In 2009, it also organized SEaCURE.IT, the first international technical security conference ever held in Italy.
Secure Network also offers internet security compliance consulting to private companies.
References
Companies of Italy
Data security
Companies based in Milan
|
https://en.wikipedia.org/wiki/Curing%20salt
|
Curing salt is used in meat processing to generate a pinkish shade and to extend shelf life. It is both a color agent and a means to facilitate food preservation as it prevents or slows spoilage by bacteria or fungus. Curing salts are generally a mixture of sodium chloride (table salt) and sodium nitrite, and are used for pickling meats as part of the process to make sausage or cured meat such as ham, bacon, pastrami, corned beef, etc. Though it has been suggested that the reason for using nitrite-containing curing salt is to prevent botulism, a 2018 study by the British Meat Producers Association determined that legally permitted levels of nitrite have no effect on the growth of the Clostridium botulinum bacteria that causes botulism, in line with the UK's Advisory Committee on the Microbiological Safety of Food opinion that nitrites are not required to prevent C. botulinum growth and extend shelf life. (see also Sodium Nitrite: Inhibition of microbial growth).
Many curing salts also contain red dye that makes them pink to prevent them from being confused with common table salt. Thus curing salt is sometimes referred to as "pink salt". Curing salts are not to be confused with Himalayan pink salt, a halite which is 97–99% sodium chloride (table salt) with trace elements that give it a pink color.
Types
There are many types of curing salts often specific to a country or region.
Prague Powder #1
One of the most common curing salts. It is also called Insta Cure #1 or Pink curing salt #1. It contains 6.25% sodium nitrite and 93.75% table salt. It is recommended for meats that require short cures and will be cooked and eaten relatively quickly. Sodium nitrite provides the characteristic flavor and color associated with curing.
Prague Powder #2
Also called Pink curing salt #2. It contains 6.25% sodium nitrite, 4% sodium nitrate, and 89.75% table salt. The sodium nitrate found in Prague powder #2 gradually breaks down over time into sodium nitrite, and by the time a
|
https://en.wikipedia.org/wiki/Taxonomic%20sequence
|
Taxonomic sequence (also known as systematic, phyletic or taxonomic order) is a sequence followed in listing of taxa which aids ease of use and roughly reflects the evolutionary relationships among the taxa. Taxonomic sequences can exist for taxa within any rank, that is, a list of families, genera, species can each have a sequence.
Early biologists used the concept of "age" or "primitiveness" of the groups in question to derive an order of arrangement, with "older" or more "primitive" groups being listed first and more recent or "advanced" ones last. A modern understanding of evolutionary biology has brought about a more robust framework for the taxonomic ordering of lists. A list may be seen as a rough one-dimensional representation of a phylogenetic tree. Taxonomic sequences are essentially heuristic devices that help in arrangements of linear systems such as books and information retrieval systems. Since phylogenetic relationships are complex and non-linear, there is no unique way to define the sequence, although they generally have the more basal listed first with species that cluster in a tight group included next to each other.
The organization of field guides and taxonomic monographs may either follow or prescribe the taxonomic sequence; changes in these sequences are often introduced by new publications.
References
Bibliography
Sequence
|
https://en.wikipedia.org/wiki/Regular%20number
|
Regular numbers are numbers that evenly divide powers of 60 (or, equivalently, powers of 30). Equivalently, they are the numbers whose only prime divisors are 2, 3, and 5. As an example, 602 = 3600 = 48 × 75, so as divisors of a power of 60 both 48 and 75 are regular.
These numbers arise in several areas of mathematics and its applications, and have different names coming from their different areas of study.
In number theory, these numbers are called 5-smooth, because they can be characterized as having only 2, 3, or 5 as their prime factors. This is a specific case of the more general -smooth numbers, the numbers that have no prime factor greater
In the study of Babylonian mathematics, the divisors of powers of 60 are called regular numbers or regular sexagesimal numbers, and are of great importance in this area because of the sexagesimal (base 60) number system that the Babylonians used for writing their numbers, and that was central to Babylonian mathematics.
In music theory, regular numbers occur in the ratios of tones in five-limit just intonation. In connection with music theory and related theories of architecture, these numbers have been called the harmonic whole numbers.
In computer science, regular numbers are often called Hamming numbers, after Richard Hamming, who proposed the problem of finding computer algorithms for generating these numbers in ascending order. This problem has been used as a test case for functional programming.
Number theory
Formally, a regular number is an integer of the form , for nonnegative integers , , and . Such a number is a divisor of . The regular numbers are also called 5-smooth, indicating that their greatest prime factor is at most 5. More generally, a -smooth number is a number whose greatest prime factor is at
The first few regular numbers are
Several other sequences at the On-Line Encyclopedia of Integer Sequences have definitions involving 5-smooth numbers.
Although the regular numbers appear dense withi
|
https://en.wikipedia.org/wiki/Divisor%20summatory%20function
|
In number theory, the divisor summatory function is a function that is a sum over the divisor function. It frequently occurs in the study of the asymptotic behaviour of the Riemann zeta function. The various studies of the behaviour of the divisor function are sometimes called divisor problems.
Definition
The divisor summatory function is defined as
where
is the divisor function. The divisor function counts the number of ways that the integer n can be written as a product of two integers. More generally, one defines
where dk(n) counts the number of ways that n can be written as a product of k numbers. This quantity can be visualized as the count of the number of lattice points fenced off by a hyperbolic surface in k dimensions. Thus, for k=2, D(x) = D2(x) counts the number of points on a square lattice bounded on the left by the vertical-axis, on the bottom by the horizontal-axis, and to the upper-right by the hyperbola jk = x. Roughly, this shape may be envisioned as a hyperbolic simplex. This allows us to provide an alternative expression for D(x), and a simple way to compute it in time:
, where
If the hyperbola in this context is replaced by a circle then determining the value of the resulting function is known as the Gauss circle problem.
Sequence of D(n):
0, 1, 3, 5, 8, 10, 14, 16, 20, 23, 27, 29, 35, 37, 41, 45, 50, 52, 58, 60, 66, 70, 74, 76, 84, 87, 91, 95, 101, 103, 111, ...
Dirichlet's divisor problem
Finding a closed form for this summed expression seems to be beyond the techniques available, but it is possible to give approximations. The leading behavior of the series is given by
where is the Euler–Mascheroni constant, and the error term is
Here, denotes Big-O notation. This estimate can be proven using the Dirichlet hyperbola method, and was first established by Dirichlet in 1849. The Dirichlet divisor problem, precisely stated, is to improve this error bound by finding the smallest value of for which
holds true for all . As of today,
|
https://en.wikipedia.org/wiki/D-Grid
|
The D-Grid Initiative (German Grid Initiative) was a government project to fund computer infrastructure for education and research (e-Science) in Germany. It uses the term grid computing.
D-Grid started September 1, 2005 with six community projects and an integration project (DGI) as well as several partner projects.
Integration project
The D-Grid integration project intended to integrate community projects. The D-Grid integration project acted as a service provider for the science community in Germany. The project office is located at the Institute for Scientific Computing (IWR) at Forschungszentrum Karlsruhe. The resources to ensure a sustainable Grid infrastructure are provided by four work packages:
D-Grid Base-Software: The major task of this work package is to provide several different middleware packages. These are the Globus Toolkit, UNICORE, LCG/gLite, GridSphere and the Grid Application Toolkit (GAT). The community projects linked together in the D-Grid integration project are supported during the installation, operation and if needed and possible the customisation of the Base-Software.
Deployment and operation of the D-Grid infrastructure: Work package 2 builds up a Core-D-Grid. It was used as a prototype to test the operational functionality of the system. This work package also deals with monitoring, accounting and billing.
Networks and Security: The network infrastructure in D-Grid is based on the DFN Wissenschaftsnetz X-WiN. Work package 3 will provide extensions to the existing network infrastructure according to the needs of Grid middleware used in D-Grid. Further tasks are to build an AA-Infrastructure in D-Grid, develop firewall concepts for Grid environments and set up Grid specific CERT services.
D-Grid project office: The work package is responsible for the integration of community projects into one common D-Grid platform. Work package 4 also deals with sustainability.
Communities
Six community projects participated in the D-Grid In
|
https://en.wikipedia.org/wiki/AX%20architecture
|
AX (Architecture eXtended) was a Japanese computing initiative starting in around 1986 to allow PCs to handle double-byte (DBCS) Japanese text via special hardware chips, whilst allowing compatibility with software written for foreign IBM PCs.
History
The idea was conceived by Kazuhiko Nishi before he resigned his position as vice president of Microsoft. Microsoft Japan took over the project, and in July 1987 the Preparatory Committee of the AX Consortium started developing its specification.
The AX Consortium officially started in October 1987, including ASCII Corporation, Sony, Hitachi, Sharp, Oki, Casio, Canon, Kyocera, Sanyo, Mitsubishi Electric, etc., but notably excluding Toshiba and Fujitsu (who were hence the 'opposition').
At that time, NEC PC-9801 was the dominant PC architecture in the Japanese PC market because IBM PC/AT and its clone PCs could not display Japanese text. However, NEC did not tolerate PC-9801 compatible machines and was fighting court battles with Epson which was the only PC-9801 compatible machine vendor. Therefore, other vendors desperately needed a standard specification for Japanese capable PCs.
Eventually two standards were developed: JEGA and AX-VGA.
Due to less available software and its higher cost compared to the PC-9801 series, AX failed and was not able to break into the market in Japan. The Nikkei Personal Computing journal reported in 1989 that only 18 out of 36,165 PCs used in 937 companies were AX machines, and 90% of companies had no plan to purchase the AX machine.
In 1990, IBM Japan unveiled DOS/V which enabled IBM PC/AT and its clones to display Japanese text without any additional hardware using a standard VGA card. Soon after, AX disappeared and the decline of NEC PC-9801 began.
AX architecture machines
Several companies released AX computers:
Oki Electric Industry if386AX30 / 50 series
Casio Computer AX-8000D / 8000L
Canon Axi DX-20 / 20P / 10 / 10P
Kyocera AX386 model A
Sanyo Electric MCB-17 /18 se
|
https://en.wikipedia.org/wiki/National%20Centre%20for%20Food%20Manufacturing
|
The National Centre for Food Manufacturing (NCFM) is the food science campus of the University of Lincoln, situated on Park Road at Holbeach in the south of the county of Lincolnshire. It offers part-time apprenticeships and distance learning degrees for individuals working in the food industry.
Apprenticeships, Degree and Foundation Courses
The National Centre for Food Manufacturing offers part time distance learning options to achieve Foundation and BSc (Honours) Food Manufacture degrees and higher degrees through research together with all levels of apprenticeships including Higher Apprenticeships (which includes a Foundation Degree). The Foundation and Undergraduate degrees cover areas including Food and Drink Operations and Manufacturing Management - Food Science and Technology – and Food Supply Chain Management. The Centre also offers part time Masters and PhDs - often progressed by food sector employees and focused on specific Food Manufacturing Industry Challenges.
The Higher and Degree Apprenticeships include the CMDA (Chartered Manager Degree Apprenticeship), Departmental Manager, Laboratory Scientist and Professional Technical degrees.
The Centre provides support to apprentices for Functional Skills development in maths and English as required by their relevant apprenticeship standard and offers employers a complete skills development programme for its employees.
NCFM has apprenticeship partnerships with 250 UK food businesses including Addo Food Group, Bakkavor, Bidfood, Dalehead Foods, Summers Butchery Services, Greencore Group, Tulip, Dovecote Park, Fresttime, Finlays, JDM Food Group, Kerry, Nestle, Worldwide Fruit, University Academy Holbeach, Produce World Group, J.O. Sims Ltd, Greenvale AP, FreshLinc, Ripe Now and Lincolshire Field Products.
Research
NCFM advances food manufacturing and related food supply chain research initiatives via a wide range of industry and academic partnerships. The areas of core research include Robotics and Automatio
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.