source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Memcached | Memcached (pronounced variously mem-cash-dee or mem-cashed) is a general-purpose distributed memory-caching system. It is often used to speed up dynamic database-driven websites by caching data and objects in RAM to reduce the number of times an external data source (such as a database or API) must be read. Memcached is free and open-source software, licensed under the Revised BSD license. Memcached runs on Unix-like operating systems (Linux and macOS) and on Microsoft Windows. It depends on the libevent library.
Memcached's APIs provide a very large hash table distributed across multiple machines. When the table is full, subsequent inserts cause older data to be purged in least recently used (LRU) order. Applications using Memcached typically layer requests and additions into RAM before falling back on a slower backing store, such as a database.
Memcached has no internal mechanism to track misses which may happen. However, some third party utilities provide this functionality.
Memcached was first developed by Brad Fitzpatrick for his website LiveJournal, on May 22, 2003. It was originally written in Perl, then later rewritten in C by Anatoly Vorobey, then employed by LiveJournal. Memcached is now used by many other systems, including YouTube, Reddit, Facebook, Pinterest, Twitter, Wikipedia, and Method Studios. Google App Engine, Google Cloud Platform, Microsoft Azure, IBM Bluemix and Amazon Web Services also offer a Memcached service through an API.
Software architecture
The system uses a client–server architecture. The servers maintain a key–value associative array; the clients populate this array and query it by key. Keys are up to 250 bytes long and values can be at most 1 megabyte in size.
Clients use client-side libraries to contact the servers which, by default, expose their service at port 11211. Both TCP and UDP are supported. Each client knows all servers; the servers do not communicate with each other. If a client wishes to set or read the value corresponding to a certain key, the client's library first computes a hash of the key to determine which server to use. This gives a simple form of sharding and scalable shared-nothing architecture across the servers. The server computes a second hash of the key to determine where to store or read the corresponding value. The servers keep the values in RAM; if a server runs out of RAM, it discards the oldest values. Therefore, clients must treat Memcached as a transitory cache; they cannot assume that data stored in Memcached is still there when they need it. Other databases, such as MemcacheDB, Couchbase Server, provide persistent storage while maintaining Memcached protocol compatibility.
If all client libraries use the same hashing algorithm to determine servers, then clients can read each other's cached data.
A typical deployment has several servers and many clients. However, it is possible to use Memcached on a single computer, acting simultaneously as client and server. The size o |
https://en.wikipedia.org/wiki/Transmetropolitan | Transmetropolitan is a cyberpunk transhumanist comic book series written by Warren Ellis and co-created and designed by Darick Robertson; it was published by the American company DC Comics in 1997–2002. The series was originally part of the short-lived DC Comics imprint Helix, but upon the end of the book's first year the series was moved to the Vertigo imprint after DC Comics shut down their Helix imprint. Transmetropolitan chronicles the battles of Spider Jerusalem, infamous renegade gonzo journalist of the future.
Spider Jerusalem dedicates himself to fighting the corruption and abuse of power of two successive United States presidents. He and his "filthy assistants" strive to keep their world from turning more dystopian than it already is while dealing with the struggles of fame and power, brought about due to the popularity of Spider via his articles.
The monthly series began in July 1997 and concluded in September 2002. The series was later reprinted in an array of ten trade paperback volumes, and also featured two "specials" (I Hate It Here and Filth of the City) with text pieces written by Spider Jerusalem and illustrated by a wide range of comic artists. These were later collected in trade paperbacks.
Story synopsis
Some time in the future (how long precisely is never specified, but said to be in the 23rd century) Spider Jerusalem, retired writer/journalist and bearded hermit, lives within an isolated, fortified mountain hideaway. Following a call from his irate publisher demanding the last two books per his publishing deal, Jerusalem is forced to descend into the City.
Jerusalem returns to work for his old partner and editor Mitchell Royce, who now edits The Word, the City's largest newspaper. His first story is about an attempted secession by the Transient movement, people who use genetic body modification based on alien DNA to become a completely different species, and are forced to live in the Angels 8 slum district. The leader of the movement, Fred Christ, is paid to incite a riot and provoke the police, who use it as an excuse to clear out Angels 8. However, Jerusalem publishes a story revealing the truth and brutal methods used by the police. Soon, Royce publishes it live all over the city, and the public outcry forces the police to withdraw. Jerusalem is brutally beaten by police on his way home, but defiantly says that he's here to stay.
The first year of the series consists of a set of one-off stories exploring the City, Jerusalem's background, and his often tense relationship with his sidekicks, Yelena Rossini and Channon Yarrow (referred to as his 'filthy assistants'), who as the series progresses become full-time partners in his journalistic battles.
The main storyline of the series, the election and corrupt presidency of Gary Callahan (or "The Smiler"), begins in the series' second year and lasts for the rest of its run. Spider initially considers Callahan the lesser evil compared to the incumbent president ("The Be |
https://en.wikipedia.org/wiki/Swarf%20%28band%29 | Swarf were an English electronic band from Brighton, Sussex, England.
Background
The lineup was Liz Green (vocals and lyrics), Andrew Stock (synths, programming) and Chris Kiefer (synths, programming). The band was formed in 2001 by Green and Stock, with Kiefer joining later.
After a 2004 UK tour with Ultravox veteran John Foxx the band released Art, Science, Exploitation, Swarf's first and only full album to date. Several tracks were produced by Marc Heal of Cubanate.
The band's original following stemmed from the goth and Industrial genres, but the band themselves never followed the scene's usual clichés. More recently, the group have moved away from their original audience and seem to have found a niche in the dance scene, featuring on several trance compilation albums. BBC South have also broadcast a live session.
Discography
Fall (Wasp Factory, 2001)
Art, Science, Exploitation (Cryonica, 2004)
Compilation albums
Working With Children And Animals Vol 2 (Wasp Factory , 2002) – "Drown", "Shadows"
Cryotank Vol 1 (Cryonica, 2003) – "Supine", "Grey (version)", "Subtext (Weirdo Bold Mix)"
Interbreeding: Industrial Cyberlords (BLC Productions) – "Shadows"
"Whirly Waves 3" Whirl-Y-Gig compilation album. "Subtext" (Weirdo mix)
References
External links
Myspace page
British electronic music groups
Musical groups from Brighton and Hove |
https://en.wikipedia.org/wiki/Audio%20editing%20software | Audio editing software is any software or computer program which allows editing and generating audio data. Audio editing software can be implemented completely or partly as a library, as a computer application, as a web application, or as a loadable kernel module. Wave editors are digital audio editors. There are many sources of software available to perform this function. Most can edit music, apply effects and filters, and adjust stereo channels.
A digital audio workstation (DAW) is software-based and typically comprises multiple software suite components, all accessible through a unified graphical user interface. DAWs are used for recording or producing music, sound effects and more.
Music software capabilities
Audio editing software typically offer the following features:
The ability to import and export various audio file formats for editing.
Record audio from one or more inputs and store recordings in the computer's memory as digital audio.
Edit the start time, stop time, and duration of any sound on the audio timeline.
Fade into or out of a clip (e.g. an S-fade out during applause after a performance), or between clips (e.g. crossfading between takes).
Mix multiple sound sources/tracks, combine them at various volume levels and pan from channel to channel to one or more output tracks
Apply simple or advanced effects or filters, including amplification, normalization, limiting, panning, compression, expansion, flanging, reverb, audio noise reduction, and equalization to change the audio.
Playback sound (often after being mixed) that can be sent to one or more outputs, such as speakers, additional processors, or a recording medium
Conversion between different audio file formats, or between different sound quality levels.
Typically these tasks can be performed in a manner that is non-linear. Audio editors may process the audio data non-destructively in real-time, or destructively as an "off-line" process, or a hybrid with some real-time effects and some offline effects.
Plug-ins
Audio plug-ins are small software programs that can be "plugged in" to use inside the main workstation. Plug-ins are used in DAWs to allow more capabilities when it comes to audio editing. There are several different types of plug-ins. For example, stock plug-ins are the plug-ins that come already installed with a DAW, and Virtual Studio Technology (VST) plug-ins. Invented by Steinberg, VST plug-ins allow producers to apply simple or advanced effects such as filters, limiting, compression, reverb, flanging, panning, noise reduction, and equalizers.
MIDI vs. audio
MIDI (pronounced "middy") and audio are both compressed digital formats that are used within a Digital Audio Workspace (DAW). MIDI stands for Musical Instrument Digital Interface. MIDI is used with plug-ins that allow the user to control the notes of various plug-in instruments. MIDI is universally accepted and if one plug-in or synthesizer is used using MIDI, then it can be modified with another synthe |
https://en.wikipedia.org/wiki/Tilia%20cordata | Tilia cordata, the small-leaved lime or small-leaved linden, is a species of tree in the family Malvaceae, native to much of Europe. Other common names include little-leaf or littleleaf linden, or traditionally in South East England, pry or pry tree. Its range extends from Britain through mainland Europe to the Caucasus and western Asia. In the south of its range it is restricted to high elevations.
Description
Tilia cordata is a deciduous tree growing to tall, diameter 1/3 to 1/2 the height, with a trunk up to 1 m diameter. The largest known trunk circumference was a specimen in Närke, Sweden, that measured 8.35 meters diameter at chest height. Lindar in Germany is said to be over 1000 years old. The bark is smooth and grayish when young, firm with vertical ridges and horizontal fissures when older. The crown is rounded in a formal oval shape to pyramidal. Branching is upright and increases in density with age. The leaves are alternately arranged, rounded to triangular-ovate, 3–8 cm long and broad, mostly hairless (unlike the related Tilia platyphyllos) except for small tufts of brown hair in the leaf vein axils – the leaves are distinctively heart-shaped. The buds are alternate, pointed egg shaped and have red scales. It has no terminal bud. The small yellow-green hermaphrodite flowers are produced in clusters of five to eleven in early summer with a leafy yellow-green subtending bract, have a rich, heavy scent; the trees are much visited by bees to the erect flowers which are held above the bract; this flower arrangement is distinctly different from that of the Common Lime Tilia × europaea where the flowers are held beneath the bract. The fruit is a dry nut-like drupe 6–7 mm long by 4 mm broad containing one, or sometimes two, brown seeds (infertile fruits are globose), downy at first becoming smooth at maturity, and (unlike T. platyphyllos and also T. × europaea) not ribbed but very thin and easily cracked open.
Ecology
The trees favour good, loamy sites, but can also be found on sandy, infertile soils, and are not thought to be drought resistant. Dormant shoots of Tilia cordata can resist winter frost temperatures as low as −34 °C.
In Britain Tilia cordata, traditionally called pry, is considered an indicator of ancient woodland, and is becoming increasingly rare. Owing to its rarity, a number of woods have been given SSSI status. Cocklode Wood, part of the Bardney Limewoods, is the best surviving spread of medieval small leaved limes in England. Another site is Shrawley Wood in Worcestershire. Small-leaved lime was once regarded as holy and good for carving.
Trees in northern England were found to have established when the climate was warmer and have adapted to the cooling climate. Paleobotanical analysis of tree pollen preserved in peat deposits demonstrates that Tilia cordata was present as a woodland tree in the southern Lake District c 3100 B.C. In spite of the late migration of T. cordata into the Lake District, pollen diagrams |
https://en.wikipedia.org/wiki/Logical%20volume%20management | In computer storage, logical volume management or LVM provides a method of allocating space on mass-storage devices that is more flexible than conventional partitioning schemes to store volumes. In particular, a volume manager can concatenate, stripe together or otherwise combine partitions (or block devices in general) into larger virtual partitions that administrators can re-size or move, potentially without interrupting system use.
Volume management represents just one of many forms of storage virtualization; its implementation takes place in a layer in the device-driver stack of an operating system (OS) (as opposed to within storage devices or in a network).
Design
Most volume-manager implementations share the same basic design. They start with physical volumes (PVs), which can be either hard disks, hard disk partitions, or Logical Unit Numbers (LUNs) of an external storage device. Volume management treats each PV as being composed of a sequence of chunks called physical extents (PEs). Some volume managers (such as that in HP-UX and Linux) have PEs of a uniform size; others (such as that in Veritas) have variably-sized PEs that can be split and merged at will.
Normally, PEs simply map one-to-one to logical extents (LEs). With mirroring, multiple PEs map to each LE. These PEs are drawn from a physical volume group (PVG), a set of same-sized PVs which act similarly to hard disks in a RAID1 array. PVGs are usually laid out so that they reside on different disks or data buses for maximum redundancy.
The system pools LEs into a volume group (VG). The pooled LEs can then be concatenated together into virtual disk partitions called logical volumes or LVs. Systems can use LVs as raw block devices just like disk partitions: creating mountable file systems on them, or using them as swap storage.
Striped LVs allocate each successive LE from a different PV; depending on the size of the LE, this can improve performance on large sequential reads by bringing to bear the combined read-throughput of multiple PVs.
Administrators can grow LVs (by concatenating more LEs) or shrink them (by returning LEs to the pool). The concatenated LEs do not have to be contiguous. This allows LVs to grow without having to move already-allocated LEs. Some volume managers allow the re-sizing of LVs in either direction while online. Changing the size of the LV does not necessarily change the size of a file system on it; it merely changes the size of its containing space. A file system that can be resized online is recommended in that it allows the system to adjust its storage on-the-fly without interrupting applications.
PVs and LVs cannot be shared between or span different VGs (although some volume managers may allow moving them at will between VGs on the same host). This allows administrators conveniently to bring VGs online, to take them offline or to move them between host systems as a single administrative unit.
VGs can grow their storage pool by absorbing ne |
https://en.wikipedia.org/wiki/Branching%20factor | In computing, tree data structures, and game theory, the branching factor is the number of children at each node, the outdegree. If this value is not uniform, an average branching factor can be calculated.
For example, in chess, if a "node" is considered to be a legal position, the average branching factor has been said to be about 35, and a statistical analysis of over 2.5 million games revealed an average of 31. This means that, on average, a player has about 31 to 35 legal moves at their disposal at each turn. By comparison, the average branching factor for the game Go is 250.
Higher branching factors make algorithms that follow every branch at every node, such as exhaustive brute force searches, computationally more expensive due to the exponentially increasing number of nodes, leading to combinatorial explosion.
For example, if the branching factor is 10, then there will be 10 nodes one level down from the current position, 102 (or 100) nodes two levels down, 103 (or 1,000) nodes three levels down, and so on. The higher the branching factor, the faster this "explosion" occurs. The branching factor can be cut down by a pruning algorithm.
The average branching factor can be quickly calculated as the number of non-root nodes (the size of the tree, minus one; or the number of edges) divided by the number of non-leaf nodes (the number of nodes with children).
See also
k-ary tree
Outdegree
Hierarchy
Hierarchical organization
References
Trees (data structures)
Analysis of algorithms
Combinatorial game theory
Computer chess |
https://en.wikipedia.org/wiki/Creative%20Micro%20Designs | Creative Micro Designs (CMD) was founded in 1987 by Doug Cotton and Mark Fellows. It is a computer technology company which originally developed and sold products for the Commodore 64 and C128 8-bit personal computers. After 2001 it sold PCs and related equipment.
History
CMD's first product, JiffyDOS, was developed from 1985 onwards by Mark Fellows. An updated disk operating system, it maintained broad compatibility with Commodore floppy drives' DOS while offering much increased read write access.
CMD stopped selling Commodore products in 2001. In July of that year, programmer Maurice Randal was sold an exclusive license to produce and sell the Commodore related products. His company Click Here Software Co supplied the products until around 2009.
In 2010, Jim Brain acquired the license to supply JiffyDOS. Since January of that year, he has sold the product via his web shop Retro Innovations.
Products
SuperCPU - A 65816 CPU 8/16-bit upgrade for the C64 and C128 released on May 4, 1997, with version 2, the C128 compatible version, being launched in 1998.
RAMLink - A 'fast' solid-state RAM-Disk that would plug into the cartridge port of the C64 or C128 which added between 1 Megabyte and 16 Megabytes. The C64 version typically required a 'timer jump clip'. The RAMPort allowed it to work with the Commodore 17xx RAM Expansion Units
FD series - The FD2000 used 'High Density' Disks of up to 1.6 Megabytes of storage, with the FD4000 using 'Enhanced Density' Disks of up to 3.2 Megabytes of storage
HD series - SCSI Hard drives of between 20 Megabytes and 4.4 Gigabytes using CMD's native partitioning system of 16 Megabytes per partition
JiffyDOS - Adds DOS Wedge commands for easier functionality via BASIC command prompt
SwiftLink/Turbo232 - Adds dial-up modems to your Commodore 64 or 128 of up to 38.4kbit/s (SwiftLink) or 56.6kbit/s (Turbo232)
1750 XL - a Commodore 17xx REU clone in two flavours adding either 512 Kilobytes or 2 Megabytes
SuperRAMCard - Works in conjunction with the SuperCPU to add between 1 Megabyte and 16 Megabytes of directly accessible memory using the 65816 processor
SmartTRACK/SmartMOUSE - An 'intelligent' Commodore 1351 3-buttoned mouse or trackball which had 2K of RAM and a battery-backed Y2K compliant Real Time Clock which was GEOS compatible
References
External links
The unofficial CMD—Creative Micro Designs homepage
JiffyDOS at Brain Innovations — officially licensed JiffyDOS products.
http://www.go4retro.com/products/jiffydos/ - An updated side where you can buy your legal version of JiffyDOS
American companies established in 1987
American companies disestablished in 2009
Commodore 64
Commodore 64 peripheral manufacturers
Computer companies established in 1987
Computer companies disestablished in 2009
Defunct computer companies of the United States
Home computer hardware companies |
https://en.wikipedia.org/wiki/OpenSSL | OpenSSL is a software library for applications that provide secure communications over computer networks against eavesdropping, and identify the party at the other end. It is widely used by Internet servers, including the majority of HTTPS websites.
OpenSSL contains an open-source implementation of the SSL and TLS protocols. The core library, written in the C programming language, implements basic cryptographic functions and provides various utility functions. Wrappers allowing the use of the OpenSSL library in a variety of computer languages are available.
The OpenSSL Software Foundation (OSF) represents the OpenSSL project in most legal capacities including contributor license agreements, managing donations, and so on. OpenSSL Software Services (OSS) also represents the OpenSSL project for support contracts.
OpenSSL is available for most Unix-like operating systems (including Linux, macOS, and BSD), Microsoft Windows and OpenVMS.
Project history
The OpenSSL project was founded in 1998 to provide a free set of encryption tools for the code used on the Internet. It is based on a fork of SSLeay by Eric Andrew Young and Tim Hudson, which unofficially ended development on December 17, 1998, when Young and Hudson both went to work for RSA Security. The initial founding members were Mark Cox, Ralf Engelschall, Stephen Henson, Ben Laurie, and Paul Sutton.
, the OpenSSL management committee consisted of seven people and there are seventeen developers with commit access (many of whom are also part of the OpenSSL management committee). There are only two full-time employees (fellows) and the remainder are volunteers.
The project has a budget of less than $1 million USD per year and relies primarily on donations. Development of TLS 1.3 was sponsored by Akamai.
Major version releases
Algorithms
OpenSSL supports a number of different cryptographic algorithms:
Ciphers
AES, Blowfish, Camellia, Chacha20, Poly1305, SEED, CAST-128, DES, IDEA, RC2, RC4, RC5, Triple DES, GOST 28147-89, SM4
Cryptographic hash functions
MD5, MD4, MD2, SHA-1, SHA-2, SHA-3, RIPEMD-160, MDC-2, GOST R 34.11-94, BLAKE2, Whirlpool, SM3
Public-key cryptography
RSA, DSA, Diffie–Hellman key exchange, Elliptic curve, X25519, Ed25519, X448, Ed448, GOST R 34.10-2001, SM2
(Perfect forward secrecy is supported using elliptic curve Diffie–Hellman since version 1.0.)
FIPS 140 validation
FIPS 140 is a U.S. Federal program for the testing and certification of cryptographic modules. An early FIPS 140-1 certificate for OpenSSL's FOM 1.0 was revoked in July 2006 "when questions were raised about the validated module's interaction with outside software." The module was re-certified in February 2007 before giving way to FIPS 140-2. OpenSSL 1.0.2 supported the use of the OpenSSL FIPS Object Module (FOM), which was built to deliver FIPS approved algorithms in a FIPS 140-2 validated environment. OpenSSL controversially decided to categorize the 1.0.2 architecture as 'end of life' or |
https://en.wikipedia.org/wiki/Meridian%20Lossless%20Packing | Meridian Lossless Packing, also known as Packed PCM (PPCM), is a lossless compression technique for PCM audio data developed by Meridian Audio, Ltd. MLP is the standard lossless compression method for DVD-Audio content (often advertised with the Advanced Resolution logo) and typically provides about 1.5:1 compression on most music material. All DVD-Audio players are equipped with MLP decoding, while its use on the discs themselves is at their producers' discretion.
Dolby TrueHD, used in Archival Disc Blu-ray and HD DVD, employs MLP,
but compared with DVD-Audio, adds higher bit rates, 8 full-range channels, extensive metadata, and custom speaker placements (as specified by SMPTE).
Standard DVD has a maximum transfer rate of 9.6 Mb/s, making it impossible to store 6 channels of 24-bit/96 kHz uncompressed audio.
MLP is designed to reduce the peak data rate below that rate, as well as reduce average data rate,
unlike most data compression algorithms that focus only on reducing the average data rates.
In order to be able to quickly start decoding at any point in the audio stream, such as when jumping to a particular time while editing, or restart decoding after transmission errors,
MLP puts restart information approximately every 5 ms in the compressed audio stream.
MLP in packaged media formats
See also
Direct Stream Transfer
FLAC
Monkey's Audio
TTA
WavPack
Master Quality Authenticated
References
External links
Dolby TrueHD announcement
Meridian Lossless Packing (MLP) in a Nutshell
"MLP Lossless Compression" by Bob Stuart of Meridian Audio, Ltd.
MLP on MultimediaWiki
Lossless audio codecs
DVD |
https://en.wikipedia.org/wiki/Journaling | Journaling may refer to:
Electronic message journaling, tracking and retention of electronic communications
Journaling file system, a technique in computer file systems to prevent corruption
Journal therapy
Writing therapy, a form of psychotherapy
Writing in a diary |
https://en.wikipedia.org/wiki/Auto%20trail | The system of auto trails was an informal network of marked routes that existed in the United States and Canada in the early part of the 20th century. Marked with colored bands on utility poles, the trails were intended to help travellers in the early days of the automobile.
Auto trails were usually marked and sometimes maintained by organizations of private individuals. Some, such as the Lincoln Highway, maintained by the Lincoln Highway Association, were well-known and well-organized, while others were the work of fly-by-night promoters, to the point that anyone with enough paint and the will to do so could set up a trail. Trails were not usually linked to road improvements, although counties and states often prioritized road improvements because they were on trails.
In the mid-to-late 1920s, the auto trails were essentially replaced with the United States Numbered Highway System. The Canadian provinces had also begun implementing similar numbering schemes.
List of auto trails
See also
List of historic auto trails in Iowa
List of U.S. Routes
U.S. Highway association
References
External links
North American Auto Trails
Richard F. Weingroff, From Names to Numbers: The Origins of the U.S. Numbered Highway System |
https://en.wikipedia.org/wiki/Windows%20Management%20Instrumentation | Windows Management Instrumentation (WMI) consists of a set of extensions to the Windows Driver Model that provides an operating system interface through which instrumented components provide information and notification. WMI is Microsoft's implementation of the Web-Based Enterprise Management (WBEM) and Common Information Model (CIM) standards from the Distributed Management Task Force (DMTF).
WMI allows scripting languages (such as VBScript or Windows' PowerShell) to manage Microsoft Windows personal computers and servers, both locally and remotely. WMI comes preinstalled in Windows 2000 through Windows 11 OSes. It is available as a download for Windows NT and Windows 95 to Windows 98.
Microsoft also provides a command-line interface to WMI called Windows Management Instrumentation Command-line (WMIC). However, WMIC is deprecated starting with Windows 10, version 21H1, Windows 11 and Windows Server 2022.
Purpose of WMI
The purpose of WMI is to define a proprietary set of environment-independent specifications which allow management information to be shared between management applications. WMI prescribes enterprise management standards and related technologies for Windows that work with existing management standards, such as Desktop Management Interface (DMI) and SNMP. WMI complements these other standards by providing a uniform model. This model represents the managed environment through which management data from any source can be accessed in a common way.
Development process
Because WMI abstracts the manageable entities with CIM and a collection of providers, the development of a provider implies several steps. The major steps can be summarized as follows:
Create the manageable entity model
Define a model
Implement the model
Create the WMI provider
Determine the provider type to implement
Determine the hosting model of the provider
Create the provider template with the ATL wizard
Implement the code logic in the provider
Register the provider with WMI and the system
Test the provider
Create consumer sample code.
Importance of WMI providers
Since the release of the first WMI implementation during the Windows NT 4.0 SP4 era (as an out-of-band download), Microsoft has consistently added WMI providers to Windows:
Under Windows NT 4.0, Microsoft had roughly 15 WMI providers available once WMI was installed
When Windows 2000 was released, there were 29 WMI providers as part of the operating system installation
With the release of Windows Server 2003, Microsoft included in the platform more than 80 WMI providers
Windows Vista includes 13 new WMI providers, taking the number close to around 100 in all
Windows Server 2008 includes more providers, including providers for IIS 7, PowerShell and virtualization
Windows 10 includes 47 providers for the Mobile Device Management (MDM) service.
Many customers have interpreted the growth in numbers of providers as a sign that WMI has become at Microsoft the "ubiquitous" management layer of |
https://en.wikipedia.org/wiki/Cryptographic%20hash%20function | A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of bits) that has special properties desirable for a cryptographic application:
the probability of a particular -bit output result (hash value) for a random input string ("message") is (as for any good hash), so the hash value can be used as a representative of the message;
finding an input string that matches a given hash value (a pre-image) is unfeasible, assuming all input strings are equally likely. The resistance to such search is quantified as security strength, a cryptographic hash with bits of hash value is expected to have a preimage resistance strength of bits. However, if the space of possible inputs is significantly smaller than , or if it can be ordered by likelihood, then the hash value can serve as an oracle, allowing efficient search of the limited or ordered input space. A common example is the use of a standard fast hash function to obscure user passwords in storage. If an attacker can obtain the hashes of a set of passwords, they can test each hash value against lists of common passwords and all possible combinations of short passwords and typically recover a large fraction of the passwords themselves. See #Attacks on hashed passwords.
A second preimage resistance strength, with the same expectations, refers to a similar problem of finding a second message that matches the given hash value when one message is already known;
finding any pair of different messages that yield the same hash value (a collision) is also unfeasible, a cryptographic hash is expected to have a collision resistance strength of bits (lower due to the birthday paradox).
Cryptographic hash functions have many information-security applications, notably in digital signatures, message authentication codes (MACs), and other forms of authentication. They can also be used as ordinary hash functions, to index data in hash tables, for fingerprinting, to detect duplicate data or uniquely identify files, and as checksums to detect accidental data corruption. Indeed, in information-security contexts, cryptographic hash values are sometimes called (digital) fingerprints, checksums, or just hash values, even though all these terms stand for more general functions with rather different properties and purposes.
Non-cryptographic hash functions are used in hash tables and to detect accidental errors, their construction frequently provides no resistance to a deliberate attack. For example, a denial-of-service attack on hash tables is possible if the collisions are easy to find, like in the case of linear cyclic redundancy check (CRC) functions.
Properties
Most cryptographic hash functions are designed to take a string of any length as input and produce a fixed-length hash value.
A cryptographic hash function must be able to withstand all known types of cryptanalytic attack. In theoretical cryptography, the security level of a cry |
https://en.wikipedia.org/wiki/Optical%20mark%20recognition | Optical mark recognition (OMR) collects data from people by identifying markings on a paper.
OMR enables the hourly processing of hundreds or even thousands of documents. For instance, students may remember completing quizzes or surveys that required them to use a pencil to fill in bubbles on paper (seen to the right). A teacher or teacher's aide would fill out the form, then feed the cards into a system that grades or collects data from them.
Background
Many OMR devices have a scanner that shines a light onto a form. The device then looks at the contrasting reflectivity of the light at certain positions on the form. It will detect the black marks because they reflect less light than the blank areas on the form.
Some OMR devices use forms that are printed on transoptic paper. The device can then measure the amount of light that passes through the paper. It will pick up any black marks on either side of the paper because they reduce the amount of light passing through.
In contrast to the dedicated OMR device, desktop OMR software allows a user to create their own forms in a word processor or computer and print them on a laser printer. The OMR software then works with a common desktop image scanner with a document feeder to process the forms once filled out.
OMR is generally distinguished from optical character recognition (OCR) by the fact that a complicated pattern recognition engine is not required. That is, the marks are constructed in such a way that there is little chance that the OMR device will not read them correctly. This does require the image to have high contrast and an easily recognizable or irrelevant shape. A related field to OMR and OCR is the recognition of barcodes, such as the UPC bar code found on product packaging.
One of the most familiar applications of OMR is the use of #2 pencil (HB in Europe) bubble optical answer sheets in multiple choice question examinations. Students mark their answers, or other personal information, by darkening circles on a forms. The sheet is then graded by a scanning machine.
In the United States and most European countries, a horizontal or vertical "tick" in a rectangular "lozenge" is the most commonly used type of OMR form;
The most familiar form in the United Kingdom is the UK National lottery form.
Lozenge marks represent a later technology that is easier to mark and easier to erase. The large "bubble" marks are legacy technology from very early OMR machines that were so insensitive a large mark was required for reliability. In most Asian countries, a special marker is used to fill in an optical answer sheet. Students, likewise, mark answers or other information by darkening circles marked on a pre-printed sheet. Then the sheet is automatically graded by a scanning machine.
Many of today's OMR applications involve people filling in specialized forms. These forms are optimized for computer scanning, with careful registration in the printing, and careful design so that amb |
https://en.wikipedia.org/wiki/QW | QW may refer to:
Airlines
Qingdao Airlines, China (founded 2014; IATA:QW)
Blue Wings, Germany (2002–2012; IATA:QW)
Computing
qw() operator, in Perl
QWERTY keyboard layout
Entertainment and media
QuakeWorld, a 1996 video game build
QueerWeek, an unpublished New York magazine project
Enemy Territory: Quake Wars, a 2007 video game
Other uses
Quantum well, in quantum physics and materials science
Quo warranto, a legal writ |
https://en.wikipedia.org/wiki/David%20Behrman | David Behrman (born August 16, 1937) is an American composer and a pioneer of computer music. In the early 1960s he was the producer of Columbia Records' Music of Our Time series, which included the first recording of Terry Riley's In C. In 1966 Behrman co-founded Sonic Arts Union with fellow composers Robert Ashley, Alvin Lucier and Gordon Mumma. He wrote the music for Merce Cunningham's dances Walkaround Time (1968), Rebus (1975), Pictures (1984) and Eyespace 40 (2007). In 1978, he released his debut album On the Other Ocean, a pioneering work combining computer music with live performance.
Biography
Early life and education
Behrman's father, S. N. Behrman, was a successful playwright and Hollywood screenplay writer. His mother Elza Heifetz Behrman was the sister of violinist Jascha Heifetz.
Behrman attended the Phillips Academy in Andover, Massachusetts, where his classmates included Carl Andre, Hollis Frampton and Frank Stella. There he also developed a lifelong friendship with composer and pianist Frederic Rzewski. While attending summer camp at Indian Hill in 1953 he was taught modern music by Wallingford Riegger. He studied music at Harvard from 1955 to 1959, where he formed a lifelong friendship with Christian Wolff and where he continued his friendship with Frederic Rzewski. He attended the summer school at Darmstadt in 1959, where he met La Monte Young and Nam June Paik. He received a Master of Arts from Columbia University in 1963.
Teaching
He has been a member of the Avery Graduate Arts Program faculty at Bard College since 1998. He was co-director of the Center for Contemporary Music at Mills College in 1975–1980, and has taught also at the California Institute of the Arts, Ohio State University, Rutgers University, and the Technical University of Berlin.
Music
Behrman is known as a minimalist composer. His music has often involved interactions between live performers and computers, usually with the computer generating sounds triggered by some aspect of the live performance, usually certain pitches, but sometimes other aspects of the live sound, such as volume in QRSL (as recorded by Maggi Payne on The Extended Flute (CRI807). Many of his significant works, such as On the Other Ocean, Interspecies Small Talk, and others have been released on Lovely Music.
Personal life
Behrman was briefly married to Japanese video artist, sculptor and avant-garde performance artist Shigeko Kubota. The marriage ended in 1969. He has been married since 1979 to media-artist Terri Hanlon.
Behrman lives in New York City.
Awards
1994, Foundation for Contemporary Arts Grants to Artists Award.
Discography
On the Other Ocean Lovely Music Ltd. (1977)
Leapday Night Lovely Music Ltd. (1987)
Unforeseen Events XI Records (1991)
Wave Train Alga Marghen (1998)
My Dear Siegfried XI Records (2005)
Films
1976 - Music With Roots in the Aether: Opera for Television. Tape 1: David Behrman. Produced and directed by Robert Ashley. New York, New York: Lovely Music |
https://en.wikipedia.org/wiki/Assignment | Assignment, assign or The Assignment may refer to:
Homework
Sex assignment
The process of sending National Basketball Association players to its development league; see
Computing
Assignment (computer science), a type of modification to a variable
Drive letter assignment, the process of assigning alphabetical identifiers to disk drives or partitions
ASSIGN (DOS command)
Mathematics
Assignment problem, a type of math problem
Assignment (mathematical logic)
Financial and legal
Assignment (housing law), a concept that allows the transfer of a tenancy from one person to another
Assignment (law), a transfer of rights between two parties
Along with clearing, a stage in exercising a financial option
General assignment or Assignment for the Benefit of Creditors, an alternative to bankruptcy for businesses that's available in British common law and some US states
Entertainment
Literature
The Assignment (novella), by Friedrich Dürrenmatt
The Assignment, a 2016 book by Sophie Labelle
The Assignment, a 2020 novel by Liza Wiemer
Film and TV
The Assignment (1977 film)
The Assignment (1997 film)
Assignment (2015 film)
The Assignment (2016 film)
"The Assignment" (Star Trek: Deep Space Nine)
Assignment (TV program), a late night news magazine program
Podcasts
The Assignment, a podcast by Audie Cornish
See also |
https://en.wikipedia.org/wiki/Duck%20typing | Duck typing in computer programming is an application of the duck test—"If it walks like a duck and it quacks like a duck, then it must be a duck"—to determine whether an object can be used for a particular purpose. With nominative typing, an object is of a given type if it is declared as such (or if a type's association with the object is inferred through mechanisms such as object inheritance). With duck typing, an object is of a given type if it has all methods and properties required by that type. Duck typing may be viewed as a usage-based structural equivalence between a given object and the requirements of a type.
Example
This simple example in Python 3 demonstrates how any object may be used in any context until it is used in a way that it does not support.
class Duck:
def swim(self):
print("Duck swimming")
def fly(self):
print("Duck flying")
class Whale:
def swim(self):
print("Whale swimming")
for animal in [Duck(), Whale()]:
animal.swim()
animal.fly()
Output:
Duck swimming
Duck flying
Whale swimming
AttributeError: 'Whale' object has no attribute 'fly'
If it can be assumed that anything that can swim is a duck because ducks can swim, a whale could be considered a duck; however, if it is also assumed that a duck must be capable of flying, the whale will not be considered a duck.
In statically typed languages
In some statically-typed languages such as Boo and D, class type checking can be specified to occur at runtime rather than at compile time.
Comparison with other type systems
Structural type systems
Duck typing is similar to, but distinct from, structural typing. Structural typing is a static typing system that determines type compatibility and equivalence by a type's structure, whereas duck typing is dynamic and determines type compatibility by only that part of a type's structure that is accessed during runtime.
The TypeScript, Elm and Python languages support structural typing to varying degrees.
Protocols and interfaces
Protocols and interfaces provide a way to explicitly declare that some methods, operators or behaviors must be defined. If a third-party library implements a class that cannot be modified, a client cannot use an instance of it with an interface unknown to that library even if the class satisfies the interface requirements. A common solution to this problem is the adapter pattern. In contrast, with duck typing, the object would be accepted directly without the need for an adapter.
Templates or generic types
Template (also called generic) functions or methods apply the duck test in a static typing context; this brings all of the advantages and disadvantages of static versus dynamic type checking. Duck typing can also be more flexible in that only the methods actually called at runtime must be implemented, while templates require implementations of all methods that cannot be proven unreachable at compile time.
In languages such as Java, Scala and Objective-C, |
https://en.wikipedia.org/wiki/WWE%20Raw | WWE Raw, also known as Monday Night Raw or simply Raw, is an American professional wrestling television program produced by WWE. It airs live every Monday at 8 p.m. Eastern Time (ET) on USA Network. The show features characters from the Raw brand, to which WWE employees are assigned to work and perform. The show debuted on January 11, 1993 and is considered to be one of two flagship shows, along with Friday Night SmackDown.
In September 2000, Raw moved from the USA Network to TNN, which rebranded to Spike TV in August 2003. On October 3, 2005, Raw returned to the USA Network, where it remains to this day. The WWE Network has ceased operations in the United States as of April 5, 2021, with all content being moved to Peacock, which currently has most Raw episodes, excluding content that was censored or removed by Peacock's standards and practices department. Recent episodes are still available for on-demand viewing 30 days after the original air date.
Since its first episode, Raw has been broadcast live from 208 different arenas, 171 cities and towns, and ten different nations: United States, Canada, United Kingdom, Afghanistan in 2005, Iraq in 2006 and 2007, South Africa, Germany, Japan, Italy, and Mexico.
History
Beginning as WWF's Monday Night Raw, the program first aired on January 11, 1993 on the USA Network as a replacement for Prime Time Wrestling, which aired on the network for eight years. The original Raw was sixty minutes in length and broke new ground in televised professional wrestling. Traditionally, wrestling shows were pre-taped on sound stages with small audiences or at large arena shows. The Raw formula was considerably different from the pre-taped weekend shows that aired at the time such as Superstars and Wrestling Challenge. Instead of matches taped weeks in advance with studio voice overs and taped discussion, Raw was a show shot and aired to a live audience, with angles and matches playing out as they happened.
Raw originated from the Grand Ballroom at the Manhattan Center, a small New York City theater, and aired live each week. The combination of an intimate venue and live action proved to be a successful improvement. However, the weekly live schedule proved to be a financial drain on the WWF. From spring 1993 until spring 1997, Raw would tape several week's worth of episodes after a live episode had aired. The WWF taped several weeks worth of Raw from the Mid-Hudson Civic Center in Poughkeepsie, New York in April 1993, and again in June and October. The first episode produced outside of New York was taped in Bushkill, Pennsylvania in November 1993 and Raw left the Manhattan Center permanently as the show would be taken on the road throughout the United States and had in smaller venues.
On September 4, 1995, the WWF's chief competitor World Championship Wrestling began airing its new wrestling show, Monday Nitro, live each week on TNT, which marked the start of the Monday Night Wars. Raw and Nitro went head-to-head f |
https://en.wikipedia.org/wiki/MDK%20%28disambiguation%29 | MDK is a 1997 computer game by Shiny.
MDK may also refer to:
Music
"M.D.K.", a song by American electro band God Module from the album Seance
MDK, an electronic music producer based in Vancouver, Canada
Mëkanïk Dëstruktïẁ Kömmandöh, a 1973 album from Magma
Other uses
MDK (community), a group of communities on the social networking site VK.com
MDK, Inc., the model railway manufacturing company that makes K-Line brand
MDK, a human gene which makes a protein called Midkine
mdk, ISO 639-3 code for the Mangbutu language
MDK, the IATA code for Mbandaka Airport
Minedykkerkommandoen, a Norwegian clearance diver force
Jinan East railway station, see Jinan Metro
Moodle, Moodle Developers Kit
See also
MDK-2M, a Soviet Cold War-era heavy artillery tractor |
https://en.wikipedia.org/wiki/Neuroevolution | Neuroevolution, or neuro-evolution, is a form of artificial intelligence that uses evolutionary algorithms to generate artificial neural networks (ANN), parameters, and rules. It is most commonly applied in artificial life, general game playing and evolutionary robotics. The main benefit is that neuroevolution can be applied more widely than supervised learning algorithms, which require a syllabus of correct input-output pairs. In contrast, neuroevolution requires only a measure of a network's performance at a task. For example, the outcome of a game (i.e., whether one player won or lost) can be easily measured without providing labeled examples of desired strategies. Neuroevolution is commonly used as part of the reinforcement learning paradigm, and it can be contrasted with conventional deep learning techniques that use gradient descent on a neural network with a fixed topology.
Features
Many neuroevolution algorithms have been defined. One common distinction is between algorithms that evolve only the strength of the connection weights for a fixed network topology (sometimes called conventional neuroevolution), and algorithms that evolve both the topology of the network and its weights (called TWEANNs, for Topology and Weight Evolving Artificial Neural Network algorithms).
A separate distinction can be made between methods that evolve the structure of ANNs in parallel to its parameters (those applying standard evolutionary algorithms) and those that develop them separately (through memetic algorithms).
Comparison with gradient descent
Most neural networks use gradient descent rather than neuroevolution. However, around 2017 researchers at Uber stated they had found that simple structural neuroevolution algorithms were competitive with sophisticated modern industry-standard gradient-descent deep learning algorithms, in part because neuroevolution was found to be less likely to get stuck in local minima. In Science,
journalist Matthew Hutson speculated that part of the reason neuroevolution is succeeding where it had failed before is due to the increased computational power available in the 2010s.
It can be shown that there is a correspondence between neuroevolution and gradient descent.
Direct and indirect encoding
Evolutionary algorithms operate on a population of genotypes (also referred to as genomes). In neuroevolution, a genotype is mapped to a neural network phenotype that is evaluated on some task to derive its fitness.
In direct encoding schemes the genotype directly maps to the phenotype. That is, every neuron and connection in the neural network is specified directly and explicitly in the genotype. In contrast, in indirect encoding schemes the genotype specifies indirectly how that network should be generated.
Indirect encodings are often used to achieve several aims:
modularity and other regularities;
compression of phenotype to a smaller genotype, providing a smaller search space;
mapping the search space (genome) to the |
https://en.wikipedia.org/wiki/SIPRI%20Arms%20Transfers%20Database%2C%20Iraq%201973%E2%80%931990 | The Stockholm International Peace Research Institute, SIPRI, Arms Transfers Database contains information on all international transfers of major weapons (including sales, gifts and production under licence) to states, international organizations and armed non-state groups since 1950. It is the only publicly available resource providing consistent data on arms transfers for this length of time. The database can be used to track transfers of major weapons and to answer such questions as:
Who are the main suppliers and recipients of major weapons?
How have relations between different suppliers and recipients changed over time?
Where do countries in conflict get their weapons?
How do states implement their export control regulations?
Where are potentially destabilizing build-ups of weapons occurring today?
What major weapons have been exported or imported?
Imports of conventional arms by Iraq 1973–1990, by source
Values are shown in millions of US dollars at constant (1990) estimated values. "Soviet Union and Warsaw Pact" includes Czechoslovakia, East Germany, Hungary, Poland, and Romania. The majority of these transfers came from the Soviet Union, followed by Czechoslovakia.
The Stockholm International Peace Research Institute (SIPRI) makes the following comment of the methodology of this table:
The SIPRI data on arms transfers refer to actual deliveries of major conventional weapons. To permit comparison between the data on such deliveries of different weapons and identification of general trends, SIPRI uses a trend-indicator value. The SIPRI values are therefore only an indicator of the volume of international arms transfers and not of the actual financial values of such transfers.
SIPRI's data are founded entirely on open sources:
The type of open information used by SIPRI cannot provide a comprehensive picture of world arms transfers. Published reports often provide only partial information, and substantial disagreement among reports is common. Order and delivery dates, exact numbers, types of weapon and the identity of suppliers or recipients may not always be clear.
Arms suppliers to Iraq
The table shows the majority of conventional arms imported by Iraq during the 1970s, when the regime was building up the armies which were to attack Iran in 1980, were supplied by the Soviet Union and its satellites, principally Czechoslovakia. The only substantial Western arms supplier to Iraq was France, which continued to be a major supplier until 1990, when Iraq invaded Kuwait and all legal arms transfers to Iraq ended.
The United States did not supply any arms to Iraq until 1982, when Iran's growing military success alarmed American policymakers. It then did so every year until 1988. These sales amounted to less than 1% of the total arms sold to Iraq in the relevant period. Although most other countries never hesitated to sell military hardware directly to Saddam Hussein's regime, the U.S., equally keen to protect its interests in the regi |
https://en.wikipedia.org/wiki/Amoeba%20%28operating%20system%29 | Amoeba is a distributed operating system developed by Andrew S. Tanenbaum and others at the Vrije Universiteit Amsterdam. The aim of the Amoeba project was to build a timesharing system that makes an entire network of computers appear to the user as a single machine. Development at the Vrije Universiteit was stopped: the source code of the latest version (5.3) was last modified on 30 July 1996.
The Python programming language was originally developed for this platform.
Overview
The goal of the Amoeba project was to construct an operating system for networks of computers that would present the network to the user as if it were a single machine. An Amoeba network consists of a number of workstations connected to a "pool" of processors, and executing a program from a terminal causes it to run on any of the available processors, with the operating system providing load balancing. Unlike the contemporary Sprite, Amoeba does not support process migration.
The workstations would typically function as networked terminals only. Aside from workstations and processors, additional machines operate as servers for files, directory services, TCP/IP communications etc.
Amoeba is a microkernel-based operating system. It offers multithreaded programs and a remote procedure call (RPC) mechanism for communication between threads, potentially across the network; even kernel-threads use this RPC mechanism for communication. Each thread is assigned a 48-bit number called its "port", which serves as its unique, network-wide "address" for communication.
The user interface and APIs of Amoeba were modeled after Unix and compliance with the POSIX standard was partially implemented; some of the Unix emulation code consists of utilities ported over from Tanenbaum's other operating system, MINIX. Early versions used a "homebrew" window system, which the Amoeba authors considered "faster ... in our view, cleaner ... smaller and much easier to understand", but version 4.0 uses the X Window System (and allows X terminals as terminals).
The system uses FLIP as a network protocol.
See also
Distributed computing
Multikernel
Plan 9 from Bell Labs
References
External links
Amoeba home page (static page, ftp links are dead)
FSD-Amoeba page at Sourceforge (file downloads give 403 errors)
ArchiveOS mirror of Amoeba 5.3
Microkernel-based operating systems
Distributed computing architecture
Distributed operating systems
Computer science in the Netherlands
Information technology in the Netherlands
Microkernels |
https://en.wikipedia.org/wiki/Gyrator | A gyrator is a passive, linear, lossless, two-port electrical network element proposed in 1948 by Bernard D. H. Tellegen as a hypothetical fifth linear element after the resistor, capacitor, inductor and ideal transformer. Unlike the four conventional elements, the gyrator is non-reciprocal. Gyrators permit network realizations of two-(or-more)-port devices which cannot be realized with just the conventional four elements. In particular, gyrators make possible network realizations of isolators and circulators. Gyrators do not however change the range of one-port devices that can be realized. Although the gyrator was conceived as a fifth linear element, its adoption makes both the ideal transformer and either the capacitor or inductor redundant. Thus the number of necessary linear elements is in fact reduced to three. Circuits that function as gyrators can be built with transistors and op-amps using feedback.
Tellegen invented a circuit symbol for the gyrator and suggested a number of ways in which a practical gyrator might be built.
An important property of a gyrator is that it inverts the current–voltage characteristic of an electrical component or network. In the case of linear elements, the impedance is also inverted. In other words, a gyrator can make a capacitive circuit behave inductively, a series LC circuit behave like a parallel LC circuit, and so on. It is primarily used in active filter design and miniaturization.
Behaviour
An ideal gyrator is a linear two port device which couples the current on one port to the voltage on the other and vice versa. The instantaneous currents and instantaneous voltages are related by
where is the gyration resistance of the gyrator.
The gyration resistance (or equivalently its reciprocal the gyration conductance) has an associated direction indicated by an arrow on the schematic diagram. By convention, the given gyration resistance or conductance relates the voltage on the port at the head of the arrow to the current at its tail. The voltage at the tail of the arrow is related to the current at its head by minus the stated resistance. Reversing the arrow is equivalent to negating the gyration resistance, or to reversing the polarity of either port.
Although a gyrator is characterized by its resistance value, it is a lossless component. From the governing equations, the instantaneous power into the gyrator is identically zero.
A gyrator is an entirely non-reciprocal device, and hence is represented by antisymmetric impedance and admittance matrices:
If the gyration resistance is chosen to be equal to the characteristic impedance of the two ports (or to their geometric mean if these are not the same), then the scattering matrix for the gyrator is
which is likewise antisymmetric. This leads to an alternative definition of a gyrator: a device which transmits a signal unchanged in the forward (arrow) direction, but reverses the polarity of the signal travelling in the backward direction (or |
https://en.wikipedia.org/wiki/Fractint | Fractint (originally FRACT386) is a freeware computer program to render and display many kinds of fractals. The program originated on MS-DOS, then ported to the Atari ST, Linux, and Macintosh. During the early 1990s, Fractint was the definitive fractal generating program for personal computers.
The name is a portmanteau of fractal and integer, since the first versions of Fractint used only integer arithmetic (also known as fixed-point arithmetic), for faster rendering on computers without math coprocessors. Since then, floating-point arithmetic and arbitrary-precision arithmetic modes have been added.
FractInt can draw most kinds of fractals that have appeared in the literature. It also has a few "fractal types" that are not strictly speaking fractals, but may be more accurately described as display hacks. These include cellular automata.
Development
Fractint originally appeared in 1988 as FRACT386, a computer program for rendering fractals very quickly on the Intel 80386 processor using integer arithmetic. The 80386 requires the Intel 80387 coprocessor to natively support floating point math, which was rare in IBM PC compatibles.
Early versions of FRACT386 were written by Bert Tyler, who based it on a Mandelbrot generator for a TI-based processor that used integer math and decided to try programming something similar for his 386 machine.
In February 1989, the program was renamed Fractint. In July 1990, it was ported to the Atari ST, with the math routines rewritten in Motorola 68000 assembly language by Howard Chu.
See also
Fractal art
Fractal-generating software
References
Further reading
Michael Frame, Benoit Mandelbrot, Fractals, Graphics, and Mathematics Education, Volume 58 of Mathematical Association of America Notes, Cambridge University Press, 2002, , pp. 57–59 (and used throughout the book)
External links
Mirror of now-gone spanky.triumf.ca Fractint site
Fractint Development Team WWW pages via the Wayback Machine
1988 software
Fractal software
Numerical software
Cellular automaton software
DOS software
Atari ST software
Proprietary freeware for Linux |
https://en.wikipedia.org/wiki/G77 | G77 or G-77 may refer to:
The old g77 FORTRAN compiler of GCC which has been replaced by GNU Fortran since release 4.0.
Group of 77, a loose coalition of developing nations designed to promote its members' collective economic interests and create an enhanced joint negotiating capacity in the United Nations. |
https://en.wikipedia.org/wiki/Windows%20Media | Windows Media is a discontinued multimedia framework for media creation and distribution for Microsoft Windows. It consists of a software development kit (SDK) with several application programming interfaces (API) and a number of prebuilt technologies, and is the replacement of NetShow technologies.
The Windows Media SDK was replaced by Media Foundation when Windows Vista was released.
Software
Windows Media Center
Windows Media Player
Windows Media Encoder
Windows Media Services
Windows Movie Maker
Formats
Advanced Systems Format (ASF)
Advanced Stream Redirector (ASX)
Windows Media Audio (WMA)
Windows Media Playlist (WPL)
Windows Media Video (WMV) and VC-1
Windows Media Station (NSC)
WMV HD, (Windows Media Video High Definition), the branding name for high definition (HD) media content encoded using Windows Media codecs. WMV HD is not a separate codec.
HD Photo (formerly Windows Media Photo, standardized as JPEG XR)
DVR-MS, the recording format used by Windows Media Center
SAMI, the closed caption format developed by Microsoft. It can be used to synchronize captions and audio descriptions with online video.
Protocols
Media Stream Broadcast (MSB), for multicast distribution of Advanced Systems Format content over a network
Media Transfer Protocol (MTP), for transferring and synchronizing media on portable devices
Microsoft Media Services (MMS), the streaming transport protocol
Windows Media DRM, an implementation of digital rights management
External links
Official website
Description of the algorithm used for WMA encryption
Microsoft Windows multimedia technology
Multimedia frameworks
Discontinued Microsoft software |
https://en.wikipedia.org/wiki/VK | VK, Vk or vk may refer to:
VK (company), a Russian internet company
VK (service), a Russian social network
VK Mobile, a Korean mobile phone manufacturer
Akai VK, a portable helical scan EIA video VTR
Holden VK Commodore, a model of GM Holden's Commodore car, produced from 1984 to 1986
Vasant Kunj, an upmarket residential colony in South West Delhi, India
Virat Kohli, an Indian cricketer born 1988
Virgin Nigeria Airways (IATA airline designator VK, 2004-2012)
Level Europe (IATA airline designator VK since 2018)
Visual kei, a movement among Japanese musicians featuring eccentric, sometimes flamboyant looks
VK (drink), an alcopop sold in the UK
Voight-Kampff machine, in the science fiction film Blade Runner
Cirrus VK-30, an American homebuilt aircraft
de Volkskrant, a Dutch daily newspaper
Vedanta Kesari, an English-language monthly magazine in India
Versuchskampffahrzeug, a German abbreviation, meaning research/experimental fighting vehicle. Used in the names of some German tanks
Vertical Kilometer, a one km uphill running time trial / race
The prefix of callsigns allocated to Australian Amateur Radio operators
Vulkan
See also
VKS (disambiguation) |
https://en.wikipedia.org/wiki/LZ | LZ may refer to:
Computing
.lz, a filename extension for an lzip archive
Abraham Lempel (born 1936) and Jacob Ziv (born 1931), Israeli computer scientists:
Lempel-Ziv, prefix for family of data compression algorithms, sometimes used as beginning for file name extensions
Lempel–Ziv–Markov chain algorithm
Aviation
Republic of Bulgaria (aviation code)
Air Link IATA code
Balkan Bulgarian Airlines IATA code (1947-2002)
Swiss Global Air Lines IATA code (2005-2018)
Landing zone, an area where aircraft can land
LZ-, prefix of the serial numbers of Zeppelin airships built by Ferdinand von Zeppelin
Other uses
LUX-ZEPLIN, a dark matter detection experiment
Lubrizol, a chemical manufacturer (NYSE symbol LZ)
Lutz jump, a figure skating jump
Led Zeppelin, an English rock band
See also
Landing zone (disambiguation)
ZL (disambiguation)
IZ (disambiguation)
1Z (disambiguation) |
https://en.wikipedia.org/wiki/Bell%20Mobility | Bell Mobility Inc. is a Canadian wireless network operator and the division of Bell Canada which offers wireless services across Canada. It operates networks using LTE and HSPA+ on its mainstream networks. Bell Mobility is the third-largest wireless carrier in Canada, with 10.1 million subscribers as of Q3 2020.
Bell-owned Virgin Mobile Canada as well as Loblaws prepaid PC Telecom, operate as MVNOs on the Bell Mobility network. Some of Bell Canada's regional subsidiaries continue to operate their own wireless networks separate from (but generally allowing for roaming with) Bell Mobility; these are Northwestel (NMI Mobility and Latitude Wireless), Télébec (Télébec Mobilité), and NorthernTel (NorthernTel Mobility).
In July 2006, Bell Mobility assumed responsibility for the former Aliant wireless operations in Atlantic Canada as part of a larger restructuring of both Bell and Aliant, and continued to do business there as Aliant Mobility until re-branding as Bell in April 2008. Bell similarly acquired MTS in Manitoba in 2017, rebranding it as Bell MTS; initially operating autonomously as Bell MTS Mobility, its wireless customers were brought under Bell Mobility in late-2018.
Networks
Although both are different and independent from one another, both the CDMA and UMTS networks use the 850 and 1900 MHz frequencies. Bell's LTE network uses Band 4 Advanced Wireless Services (AWS 1700/2100 MHz) and Band 2 Personal Communications Service (PCS 1900 MHz) in most coverage areas and Band 7 (2600 MHz) in a few areas.
As of April 30, 2019, all CDMA service from Bell has been discontinued.
UMTS
In October 2009, Telus Mobility and Bell announced plans to deploy HSPA technology by 2010 as part of an effort to eventually upgrade to LTE technology. The network, using largely shared infrastructure, launched on November 4, 2009.
According to Bell, the single-channel HSPA+ network is available to 96% of the Canadian population. It provides download speeds of up to 21 Mbit/s, with typical speeds ranging between 3½ and 8 Mbit/s. The dual-channel network, on the other hand, began in 2010 and is available to 70% of the Canadian population. It can reach download speeds of up to 42 Mbit/s but with typical speeds of 7 to 14 Mbit/s.
Bell's HSPA+ network coverage is in portions of all Canadian provinces and territories, but it is not possible to drive in Canada between the Pacific coast to the Atlantic coast without going through areas without any cellular coverage, as there are gaps in cellular coverage in British Columbia and Ontario.
LTE
Bell launched LTE by using the 1700 MHz (Band 4) frequency in Toronto and surrounding areas on September 14, 2011. Since then, Bell has expanded LTE into most areas of Canada where it has HSPA coverage, and launched LTE on to the 2600 MHz (Band 7) frequency for additional bandwidth in March 2012 and on to the 700 MHz spectrum (paired bands LTE Band 12/17 and 13 and unpaired Band 29) in 2014. Bell will use either Band 13 or Band 12 |
https://en.wikipedia.org/wiki/CodeCon | CodeCon was an annual conference for software hackers and technology enthusiasts, held every year between 2002 and 2009. CodeCon was not intended to be a computer security conference, but a conference with a focus on software developers doing presentations of technologies, as computer programs, rather than products.
History
Bram Cohen and Len Sassaman are credited with devising and organizing the first conference at the DNA Lounge in San Francisco, California in 2002. The conference was the result of discussion on building a small, programmer-focused convention. Some projects discussed at the first CodeCon include BitTorrent and Peek-a-Booty. There were also panel discussions, including one about the legality of hacking, which focused on the actions of the MPAA and RIAA against peer-to-peer file sharing networks.
Later conferences have included discussions on P2P, and the Helios voting system.
Sassaman proposed to his then-girlfriend Meredith L. Patterson during the Q&A after her presentation at the 2006 CodeCon; the two were later married.
Other uses
Bloomberg's CodeCon programming contest platform and events.
An abbreviation for Re/code's Code Conference.
References
External links
Hacker culture
Computer conferences |
https://en.wikipedia.org/wiki/Computability | Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence of an algorithm to solve the problem.
The most widely studied models of computability are the Turing-computable and μ-recursive functions, and the lambda calculus, all of which have computationally equivalent power. Other forms of computability are studied as well: computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field of hypercomputation.
Problems
A central idea in computability is that of a (computational) problem, which is a task whose computability can be explored.
There are two key types of problems:
A decision problem fixes a set S, which may be a set of strings, natural numbers, or other objects taken from some larger set U. A particular instance of the problem is to decide, given an element u of U, whether u is in S. For example, let U be the set of natural numbers and S the set of prime numbers. The corresponding decision problem corresponds to primality testing.
A function problem consists of a function f from a set U to a set V. An instance of the problem is to compute, given an element u in U, the corresponding element f(u) in V. For example, U and V may be the set of all finite binary strings, and f may take a string and return the string obtained by reversing the digits of the input (so f(0101) = 1010).
Other types of problems include search problems and optimization problems.
One goal of computability theory is to determine which problems, or classes of problems, can be solved in each model of computation.
Formal models of computation
A model of computation is a formal description of a particular type of computational process. The description often takes the form of an abstract machine that is meant to perform the task at hand. General models of computation equivalent to a Turing machine (see Church–Turing thesis) include:
Lambda calculus A computation consists of an initial lambda expression (or two if you want to separate the function and its input) plus a finite sequence of lambda terms, each deduced from the preceding term by one application of beta reduction.
Combinatory logic
A concept which has many similarities to -calculus, but also important differences exist (e.g. fixed point combinator Y has normal form in combinatory logic but not in -calculus). Combinatory logic was developed with great ambitions: understanding the nature of paradoxes, making foundations of mathematics more economic (conceptually), eliminating the notion of variables (thus clarifying their role in mathematics).
μ-recursive functions A computation consists of a μ-recursive function, i.e. its defining sequence, any input value(s) and a sequence of recursive functi |
https://en.wikipedia.org/wiki/Edward%20Felten | Edward William Felten (born March 25, 1963) is the Robert E. Kahn Professor of Computer Science and Public Affairs at Princeton University, where he was also the director of the Center for Information Technology Policy from 2007 to 2015 and from 2017 to 2019. On November 4, 2010, he was named Chief Technologist for the Federal Trade Commission, a position he officially assumed January 3, 2011. On May 11, 2015, he was named the Deputy U.S. Chief Technology Officer. In 2018, he was nominated to and began a term as Board Member of PCLOB.
Felten has done a variety of computer security research, including groundbreaking work on proof-carrying authentication and work on security related to the Java programming language, but he is perhaps best known for his paper on the Secure Digital Music Initiative (SDMI) challenge.
Biography
Felten attended the California Institute of Technology and graduated with a degree in physics in 1985. He worked as a staff programmer at Caltech from 1986 to 1989 on a parallel supercomputer project at Caltech. He then enrolled as a graduate student in computer science at the University of Washington. He was awarded a Master of Science degree in 1991 and a Ph.D. in 1993. His Ph.D. thesis was on developing an automated protocol for communication between parallel processors.
In 1993, he joined the faculty of Princeton University in the department of computer science as an assistant professor. He was promoted to associate professor in 1999 and to professor in 2003. In 2006, he joined the Woodrow Wilson School of Public and International Affairs, but computer science remains his home department. In 2005, he became the director of the Center for Information and Technology Policy at Princeton. He has served as a consultant to law firms, corporations, private foundations, and government agencies. His research involves computer security, and technology policy.
He lives in Princeton, New Jersey with his family. From 2006 to 2010, he was a member of the board of the Electronic Frontier Foundation (EFF). In 2007, he was inducted as a Fellow of the Association for Computing Machinery.
In November 2010, he was named Chief Technologist of the Federal Trade Commission.
In 2013, Felton was elected a member of the National Academy of Engineering for contributions to security of computer systems, and for impact on public policy.
On May 11, 2015, he was named Deputy U.S. Chief Technology Officer for The White House.
United States v. Microsoft
Felten was a witness for the United States government in United States v. Microsoft, where the software company was charged with committing a variety of antitrust crimes. During the trial, Microsoft's attorneys denied that it was possible to remove the Internet Explorer web browser from a Windows 98 equipped computer without significantly impairing the operation of Windows.
Citing research he had undertaken with Christian Hicks and Peter Creath, two of his former students, Felten testified that it |
https://en.wikipedia.org/wiki/Kokura%20Station | in Kokurakita-ku is the main railway station in Kitakyushu, Japan. It is part of the JR Kyushu network and the San'yō Shinkansen stops here. It is the second largest station in Kyushu with 120,000 users daily. In the late 1990s, the Kokura station area was expanded and remodelled.
JR lines
Kagoshima Main Line
San'yō Shinkansen
Nippō Main Line
Hitahikosan Line
JR limited express trains
San'yō Shinkansen Nozomi, Hikari, and Kodama ( - - )
San'yō Shinkansen Mizuho, and Sakura ( - ( by Kyushu Shinkansen)
Sonic (Hakata - //)
Nichirin Seagaia (Hakata - )
Kirameki (Mojikō/Kokura - Hakata)
Monorail
Kitakyushu Monorail
Tracks
History
April 1, 1891: Opened by the private company Kyushu Tetsudo in front of Kokura Castle.
July 1, 1907: Brought under state control.
March 1, 1958: Reconstructed 700 meters east of original location (the former station site is now known as Nishi ("West")
Kokura).
March 10, 1975: Sanyo Shinkansen services commenced.
April 1, 1987: Following privatisation of JNR it came under the control of JR Kyushu. The Shinkansen platforms are run by JR West.
April 1, 1998: Kitakyushu Monorail line is extended to Kokura Station as part of a major reconstruction of the station building.
Passenger statistics
In fiscal 2016, the station was used by an average of 35,431 passengers daily (boarding passengers only), and it ranked 2nd among the busiest stations of JR Kyushu.
Surrounding area
Kokura Castle
Kitakyushu Stadium
West Japan General Exhibition Center
Kitakyushu International Conference Center
References
External links
Station Information (JR Kyushu)
Railway stations in Fukuoka Prefecture
Buildings and structures in Kitakyushu
Sanyō Shinkansen
Railway stations in Japan opened in 1891 |
https://en.wikipedia.org/wiki/Whatever%20Happened%20to...%20Robot%20Jones%3F | Whatever Happened to... Robot Jones? (simply known as Robot Jones or WHTRJ?) is an American animated television series created by Greg Miller for Cartoon Network. It follows Robot Jones, a teenage robot who attends the fictional suburban Polyneux Middle School in a retrofuturistic 1980s world. Episodes follow Robot Jones researching aspects of human life, including music, facial hair, and gym class. Jones is guided by his three friends, Socks, Mitch, and Cubey. Robot Jones is often smitten with his crush, Shannon Westerburg, a tall, young girl with orthodontic headgear and a prosthesis. In school, Robot Jones interacts with his teachers, Mr. McMcMc, Mr. Workout, and Mrs. Raincoat; the principal, Mr. Madman; and janitor Clancy Q. Sleepyjeans. His arch-rivals, Lenny and Denny Yogman, try to sabotage Jones's research by making school more difficult for him.
Miller's first pilot aired on Cartoon Network on June 16, 2000, as part of "Voice Your Choice Weekend", a contest in which previously unaired pilots were broadcast for viewers to decide which should be given a full series. Even though the Robot Jones pilot ranked second below Grim & Evil in the event, Robot Jones was greenlit for its own series, which premiered on July 19, 2002. The first season voice of Robot Jones was created with a Microsoft Word 97 text-to-speech function. Beginning with the second season, Robot Jones's voice was dubbed over by child actor Bobby Block, and reruns of the first season were re-dubbed with Block's voice overs. The series ended on November 14, 2003, after 13 episodes and a pilot.
Premise
Robot Jones (voiced by a text-to-speech program in the pilot and season 1; Bobby Block in season 2 and season 1 reruns) is a teenage robot living in a fictional early 1980s version of Delaware where robots are commonplace. Robot attempts to learn human nature by attending Polyneux Middle School with his new friends Timothy "Socks" Morton (Kyle Sullivan), a tall boy who loves rock music, Mitch Davis (Gary LeRoi Gray), a headphones-wearing boy whose eyes are hidden by his long hair, and Charles "Cubey" Cubinacle (Myles Jeffrey), a shorter boy who loves video games. He holds an unrequited crush on Shannon Westerburg (Grey DeLisle), a girl with a large retainer and prosthetic metal leg.
In each episode, Robot Jones explores a concept faced by average teenagers, such as gym class or competitions. Robot immerses himself in each subject to fully understand it while trying to fit in with his human peers, but this is challenging due to his social ineptitude and others' lack of understanding. As Robot settles in at school, he explores humanoid concepts of his own will. Though the situations he finds himself in are usually at his parents' insistence, others are a result of Robot trying to get closer to Shannon. An example is in "Summer Camp" when Socks convinces Robot to go camping and Robot discovers the ability to feel jealous. Due to his polite nature and short stature, students at hi |
https://en.wikipedia.org/wiki/Orkut | Orkut was a social networking service owned and operated by Google. The service was designed to help users meet new and old friends and maintain existing relationships. The website was named after its creator, Google employee Orkut Büyükkökten.
Orkut was one of the most visited websites in India and Brazil in 2008. In 2008, Google announced that Orkut would be fully managed and operated in Brazil, by Google Brazil, in the city of Belo Horizonte. This was decided due to the large Brazilian user base and growth of legal issues.
On June 30, 2014, Google announced it would be closing Orkut on September 30, 2014. No new accounts could be created starting from July 2014. Users could download their profile archive by Google Takeout.
In April 2022, the website was reactivated.
Features
Orkut's features and interface changed significantly with time. Initially, each member could become a fan of any of the friends in their list and also evaluate whether their friend is "Trustworthy", "Cool", "Sexy" on a scale of 1 to 3 (marked by icons), which was aggregated as a percentage. Unlike Facebook, where one can only view profile details of people in their network, Orkut initially allowed anyone to visit everyone's profile, unless a potential visitor was on a person's "Ignore List" (this feature was eventually changed so that users could choose between showing their profile to all networks or specified ones). Each member was also able to customize their profile preferences and restrict information that appears on their profile from their friends and/or others. Another feature was that any member can add any other member on Orkut to his/her "Crush List".
When a user logged in, they saw the people in their friends list in the order of their login to the site, the first person being the latest one to do so. Orkut's competitors were other social networking sites including Myspace and Facebook. The site Ning was a more direct competitor, as it allowed for the creation of social networks similar to Orkut's "communities".
An Orkut user was also able to add videos to their profile from either YouTube or Google Video with the additional option of creating either restricted or unrestricted polls for polling a community of users. There was at one point an option to integrate GTalk with Orkut, enabling chat and file sharing. Similar to Facebook, users could also use a "like" button to share interests with friends. Users could also change their interface from a wide range of colorful themes in the library. Themes were only available in Brazil and India. Orkut was arguably 'the only thriving social networking site' in India during 2005–2008.
History
Origins
Orkut was quietly launched on January 22, 2004 by Google. Orkut Büyükkökten, a Turkish software engineer, developed it as an independent project while working at Google. While previously working for Affinity Engines, he had developed a similar system, InCircle, intended for use by university alumni groups. In late |
https://en.wikipedia.org/wiki/Mario%20Party | is a party video game series featuring characters from the Mario franchise in which up to four local players or computer-controlled characters (called "CPUs") compete in a board game interspersed with minigames. The games are currently developed by NDcube and published by Nintendo, being previously developed by Hudson Soft. The series is known for its party game elements, including the often unpredictable multiplayer modes that allow play with up to four, and sometimes eight, human players or CPUs.
After the development of Mario Party 8, several of Hudson Soft's key designers left to work for Nintendo subsidiary NDcube, developers of Wii Party. Starting in 2012 with Mario Party 9, NDcube has taken over development of the series from Hudson Soft. The first instalment in the series on the Nintendo Switch, Super Mario Party, was released on October 5, 2018.
The series received generally favorable reception in the beginning, but as the series has progressed, the reception has become more mixed. The series holds the record for the longest-running minigame series. As of December 2014, Nintendo reported cumulative worldwide sales of 39.6 million game copies in the Mario Party franchise.
Gameplay
Over the course of the Mario Party series, gameplay has changed to suit the technology of the hardware. There are several game modes available in each of the games, each of which provides its own rules and challenges.
Party Mode
Every game in the main series has a standard Party Mode in which up to four players play through a board, trying to collect as many stars as possible. In every turn, each player rolls a die (Dice Block) and progresses on the board, which usually has branching paths. Coins are primarily earned by performing well in a minigame played at the end of each turn. On most boards, players earn stars by reaching a star space and purchasing a star for a certain amount of coins. The star space appears randomly on one of several pre-determined locations and moves every time a star is purchased, usually occupying a blue space. On some boards, the star location is fixed.
Every Mario Party game contains at least 50 to 100 minigames with a few different types. Four-player games are a free-for-all in which players compete individually. In 2-vs-2 and 1-vs-3 minigames, players compete as two groups, cooperating to win, even though they are still competing individually in the main game. Some minigames in Mario Party are 4-player co-op, even though it doesn't say it. In most situations, winners earn ten coins each.
Battle minigames first appeared in Mario Party 2. These games are like the four-player games, but instead of winners earning ten coins each, each player contributes a randomly selected number of coins (or all coins if the player falls short of the pot amount). The winner of the minigame receives approximately 70% of the pot, the second-place winner receives the other 30%, and a random player occasionally gets coins left over from roundin |
https://en.wikipedia.org/wiki/Software%20suite | A software suite (also known as an application suite) is a collection of computer programs (application software, or programming software) of related functionality, sharing a similar user interface and the ability to easily exchange data with each other.
Features
Advantages
Less costly than buying individual packages
Identical or very similar GUI
Designed to interface with each other
Helps the learning curve of the user
Disadvantages
Not all purchased features are always used by the user
Takes a significant amount of disk space (bloatware), as compared to buying only the needed packages
Requires effort to use the packages together
Types
Office suites, such as Microsoft Office
Internet suites
Graphics suite, such as Adobe Creative Cloud
IDEs, such as Eclipse, and Visual Studio
See also
Application software
Package (package management system)
Runtime environment
References |
https://en.wikipedia.org/wiki/Address%20book | An address book or a name and address book is a book, or a database used for storing entries called contacts. Each contact entry usually consists of a few standard fields (for example: first name, last name, company name, address, telephone number, e-mail address, fax number, mobile phone number). Most such systems store the details in alphabetical order of people's names, although in paper-based address books entries can easily end up out of order as the owner inserts details of more individuals or as people move. Many address books use small ring binders that allow adding, removing, and shuffling of pages to make room.
Little black book
The 1953 film version of Kiss Me, Kate features a musical scene in which Howard Keel's character laments the loss of the social life he enjoyed before marriage, naming numerous female romantic encounters while perusing a miniature black book, which has given rise to the trope of a little black book referring to a list of past or potential sexual partners.
Software address book
Address books can also appear as software designed for this purpose, such as the "Address Book" application included with Apple Inc.'s Mac OS X. Simple address books have been incorporated into email software for many years, though more advanced versions have emerged in the 1990s and beyond, and in mobile phones.
A personal information manager (PIM) integrates an address book, calendar, task list, and sometimes other features.
Entries can be imported and exported from the software to transfer them between programs or computers. The common file formats for these operations are:
LDIF (*.ldif, *.ldi)
Tab delimited (*.tab, *.txt)
Comma-separated (*.csv)
vCard (*.vcf)
Individual entries are frequently transferred as vCards (*.vcf), which are comparable to physical business cards. And some software applications like Lotus Notes and Open Contacts can handle a vCard file containing multiple vCard records.
Online address book
An online address book typically enables users to create their own web page (or profile page), which is then indexed by search engines like Google and Bing. This in turn enables users to be found by other people via a search of their name and then contacted via their web page containing their personal information. Ability to find people registered with online address books via search engine searches usually varies according to the commonness of the name and the number of results for the name. Typically, users of such systems can synchronize their contact details with other users that they know to ensure that their contact information is kept up to date.
Network address book
Many people have many different address books: their email accounts, their mobile phone, and the "friends lists" on their social networking services. A network address book allows them to organize and manage their address books through one interface and share their contacts across their different address books and social networks
See also
|
https://en.wikipedia.org/wiki/WRT | WRT may refer to:
Computing
Linksys WRT54G series of wireless routers
Web Runtime (WRT) for the Symbian/S60 mobile OS
Organisations
Wallace Roberts & Todd, an architecture firm in Philadelphia, United States
W Racing Team, a Belgian motor racing team
Places in England
Warton Aerodrome, Lancashire (IATA code)
Worstead railway station, Norfolk (CRS code)
See also |
https://en.wikipedia.org/wiki/ARP%20spoofing | In computer networking, ARP spoofing, ARP cache poisoning, or ARP poison routing, is a technique by which an attacker sends (spoofed) Address Resolution Protocol (ARP) messages onto a local area network. Generally, the aim is to associate the attacker's MAC address with the IP address of another host, such as the default gateway, causing any traffic meant for that IP address to be sent to the attacker instead.
ARP spoofing may allow an attacker to intercept data frames on a network, modify the traffic, or stop all traffic. Often the attack is used as an opening for other attacks, such as denial of service, man in the middle, or session hijacking attacks.
The attack can only be used on networks that use ARP, and requires attacker have direct access to the local network segment to be attacked.
ARP vulnerabilities
The Address Resolution Protocol (ARP) is a widely used communications protocol for resolving Internet layer addresses into link layer addresses.
When an Internet Protocol (IP) datagram is sent from one host to another in a local area network, the destination IP address must be resolved to a MAC address for transmission via the data link layer. When another host's IP address is known, and its MAC address is needed, a broadcast packet is sent out on the local network. This packet is known as an ARP request. The destination machine with the IP in the ARP request then responds with an ARP reply that contains the MAC address for that IP.
ARP is a stateless protocol. Network hosts will automatically cache any ARP replies they receive, regardless of whether network hosts requested them. Even ARP entries that have not yet expired will be overwritten when a new ARP reply packet is received. There is no method in the ARP protocol by which a host can authenticate the peer from which the packet originated. This behavior is the vulnerability that allows ARP spoofing to occur.
Attack anatomy
The basic principle behind ARP spoofing is to exploit the lack of authentication in the ARP protocol by sending spoofed ARP messages onto the LAN. ARP spoofing attacks can be run from a compromised host on the LAN, or from an attacker's machine that is connected directly to the target LAN.
An attacker using ARP spoofing will disguise as a host to the transmission of data on the network between the users. Then users would not know that the attacker is not the real host on the network.
Generally, the goal of the attack is to associate the attacker's host MAC address with the IP address of a target host, so that any traffic meant for the target host will be sent to the attacker's host. The attacker may choose to inspect the packets (spying), while forwarding the traffic to the actual default destination to avoid discovery, modify the data before forwarding it (man-in-the-middle attack), or launch a denial-of-service attack by causing some or all of the packets on the network to be dropped.
Defenses
Static ARP entries
The simplest form of certification is the |
https://en.wikipedia.org/wiki/Hardware%20abstraction | Hardware abstractions are sets of routines in software that provide programs with access to hardware resources through programming interfaces. The programming interface allows all devices in a particular class C of hardware devices to be accessed through identical interfaces even though C may contain different subclasses of devices that each provide a different hardware interface.
Hardware abstractions often allow programmers to write device-independent, high performance applications by providing standard operating system (OS) calls to hardware. The process of abstracting pieces of hardware is often done from the perspective of a CPU. Each type of CPU has a specific instruction set architecture or ISA. The ISA represents the primitive operations of the machine that are available for use by assembly programmers and compiler writers. One of the main functions of a compiler is to allow a programmer to write an algorithm in a high-level language without having to care about CPU-specific instructions. Then it is the job of the compiler to generate a CPU-specific executable. The same type of abstraction is made in operating systems, but OS APIs now represent the primitive operations of the machine, rather than an ISA. This allows a programmer to use OS-level operations (e.g. task creation/deletion) in their programs while retaining portability over a variety of different platforms.
Overview
Many early computer systems did not have any form of hardware abstraction. This meant that anyone writing a program for such a system would have to know how each hardware device communicated with the rest of the system. This was a significant challenge to software developers since they then had to know how every hardware device in a system worked to ensure the software's compatibility. With hardware abstraction, rather than the program communicating directly with the hardware device, it communicates to the operating system what the device should do, which then generates a hardware-dependent instruction to the device. This meant programmers didn't need to know how specific devices worked, making their programs compatible with any device.
An example of this might be a "Joystick" abstraction. The joystick device, of which there are many physical implementations, is readable/writable through an API which many joystick-like devices might share. Most joystick-devices might report movement directions. Many joystick-devices might have sensitivity-settings that can be configured by an outside application. A Joystick abstraction hides details (e.g., register format, I2C address) of the hardware so that a programmer using the abstracted API, does not need to understand the details of the device's physical interface. This also allows code reuse since the same code can process standardized messages from any kind of implementation which supplies the "joystick" abstraction. A "nudge forward" can be from a potentiometer or from a capacitive touch sensor that recognise |
https://en.wikipedia.org/wiki/Mung%20%28computer%20term%29 | Mung or munge is computer jargon for a series of potentially destructive or irrevocable changes to a piece of data or a file. It is sometimes used for vague data transformation steps that are not yet clear to the speaker. Common munging operations include removing punctuation or HTML tags, data parsing, filtering, and transformation.
The term was coined in 1958 in the Tech Model Railroad Club at the Massachusetts Institute of Technology. In 1960 the backronym "Mash Until No Good" was created to describe Mung, and by 1976 it was revised to "Mung Until No Good", making it one of the first recursive acronyms. It lived on as a recursive command in the editing language TECO.
It differs from the very similar term munge, because munging usually implies destruction of data, while mungeing usually implies modifying data (simple passwords) in order to create protection related to that data.
Munging may also describe the constructive operation of tying together systems and interfaces that were not specifically designed to interoperate (also called 'duct-taping'). Munging can also describe the processing or filtering of raw data into another form.
As the "no good" part of the acronym implies, munging often involves irrevocable destruction of data. Hence in the early text-adventure game Zork, the user could mung an object and thereby destroy it, making it impossible to finish the game if the object was an important item.
See also
Jargon File – a glossary of hacker slang.
Slug – an application of munging for creating human-friendly URLs.
Kludge – a neologism developed near this time with a similar meaning
References
External links
Jargon File entry
Mung and munge at FOLDOC
Email address munging is considered harmful
Computer jargon |
https://en.wikipedia.org/wiki/MS/8 | MS/8 or The RL Monitor System is a discontinued computer operating system developed for the Digital Equipment Corporation PDP-8 in 1966 by Richard F. Lary.
History
RL Monitor System, as it was initially called, was developed on a 4K (12-bit) PDP-8 with "a Teletype that had a paper tape reader and punch and .. a single DECtape." It was a disk oriented system, faster than its predecessor, the PDP-8 4K Disk Monitor System, with tricks to make it run quickly on DECtape based systems.
Still named RL, it was submitted to DECUS in 1970.
MS/8 was replaced by P?S/8 and COS-310.
See also
PDP-8
Digital Equipment Corporation
References
External links
"What is a PDP-8?". PDP-8 and DECmate documentation files.
Free software operating systems
1966 software |
https://en.wikipedia.org/wiki/Determination%20of%20the%20day%20of%20the%20week | The determination of the day of the week for any date may be performed with a variety of algorithms. In addition, perpetual calendars require no calculation by the user, and are essentially lookup tables.
A typical application is to calculate the day of the week on which someone was born or a specific event occurred.
Concepts
In numerical calculation, the days of the week are represented as weekday numbers. If Monday is the first day of the week, the days may be coded 1 to 7, for Monday through Sunday, as is practiced in ISO 8601. The day designated with 7 may also be counted as 0, by applying the arithmetic modulo 7, which calculates the remainder of a number after division by 7. Thus, the number 7 is treated as 0, the number 8 as 1, the number 9 as 2, the number 18 as 4, and so on. If Sunday is counted as day 1, then 7 days later (i.e.day 8) is also a Sunday, and day 18 is the same as day 4, which is a Wednesday since this falls three days after Sunday (i.e.).
The basic approach of nearly all of the methods to calculate the day of the week begins by starting from an 'anchor date': a known pair (such as 1 January 1800 as a Wednesday), determining the number of days between the known day and the day that you are trying to determine, and using arithmetic modulo 7 to find a new numerical day of the week.
One standard approach is to look up (or calculate, using a known rule) the value of the first day of the week of a given century, look up (or calculate, using a method of congruence) an adjustment for the month, calculate the number of leap years since the start of the century, and then add these together along with the number of years since the start of the century, and the day number of the month. Eventually, one ends up with a day-count to which one applies modulo 7 to determine the day of the week of the date.
Some methods do all the additions first and then cast out sevens, whereas others cast them out at each step, as in Lewis Carroll's method. Either way is quite viable: the former is easier for calculators and computer programs, the latter for mental calculation (it is quite possible to do all the calculations in one's head with a little practice). None of the methods given here perform range checks, so unreasonable dates will produce erroneous results.
Corresponding days
Every seventh day in a month has the same name as the previous:
Corresponding months
"Corresponding months" are those months within the calendar year that start on the same day of the week. For example, September and December correspond, because 1 September falls on the same day as 1 December (as there are precisely thirteen 7-day weeks between the two dates). Months can only correspond if the number of days between their first days is divisible by 7, or in other words, if their first days are a whole number of weeks apart. For example, February of a common year corresponds to March because February has 28 days, a number divisible by 7, 28 days being exactly four wee |
https://en.wikipedia.org/wiki/Combustion%20%28software%29 | Combustion was a computer program for motion graphics, compositing, and visual effects developed by Discreet Logic, a division on Autodesk, and originally released in July 2000. It shares a timeline-based interface and also a node-based interface with Autodesk Media and Entertainment's (formerly Discreet) higher-end compositing systems Inferno, Flame and Flint. This is in contrast to the exclusively either layer-based or node-based interface used by some other compositing applications.
Combustion was a support software tool for Flame and Inferno. Combustion was a superior software tool for vfx frame-to-frame painting, with some of the functionalities still not currently included in other compositing software in 2019.
The last version of Combustion was Combustion 2008. The end of its development was never officially announced, but the company was known to be concurrently developing a new compositing platform, Autodesk Toxik.
References
Compositing software
Autodesk discontinued products |
https://en.wikipedia.org/wiki/AIROS%20Native%20Radio%20Network | American Indian Radio on Satellite or AIROS was a service that transmitted Native American radio programs between producers and radio stations via satellite. It also distributed radio programming directly to listeners via the Internet. Its satellite service ran from 1994 to 2006. It was operated by Native American Public Telecommunications.
Programming
AIROS carried a variety of Native American radio programming, including news and music. Although primarily a distributor, it produced some of its own programming.
Two of the programs AIROS carried have become among the longest-running Native American radio programs. The music program Native Sounds Native Voices originates in the studios of KZUM. It was first broadcast in Lincoln Nebraska in 1994. Native American Calling is a call-in talk show. AIROS carried its national premiere June 5, 1995. Initially, it was jointly produced by AIROS and the Alaska Public Radio Network and originated from the studios of KUNM, Albuquerque, New Mexico. In 2001, the New York Times described Native American Calling as very popular. By 2006, it was produced by Koahnic and was one of the best-known Native American radio programs.
Distribution
In the 1990s, satellite communications were considered especially useful for reaching radio stations in remote locations that did not have access to services like special high-quality telephone lines or the Internet. AIROS started its satellite distribution network in 1994. AIROS used the Public Radio Satellite System. As a result, its programming was available to public radio stations across the United States, not just Native American stations. The number of stations AIROS served grew from 29 in 1995 to 50 in 2000 and 77 in 2001, including Native American and other stations in the United States and Canada. In 2001, the New York Times described AIROS as the "primary distribution system for (Native American) public radio". AIROS satellite operations ended in 2006, when Koahnic won the contract to distribute Native American programming over the Public Radio Satellite System.
By 2014, Koahnic's Native Voice One and Radio Bilingüe were the two indigenous radio networks in the United States. Like AIROS, both used the Public Radio Satellite System.
AIROS also used the Internet to connect producers, radio broadcasters and listeners. In 1997, AIROS initiated webcasts, reaching the large urban Native American population out of reach of Native American radio stations. AIROS claimed it had one of the first web sites to provide live-streaming. Broadcast stations continued to be the primary means of reaching American Indians on reservations lacking reliable Internet. AIROS live streaming ended in December 2010. Podcasts continued for a few more years.
See also
NATV Native American Television
Satélite Radio Bilingüe, which distributes native and other Spanish language programming via satellite.
References
Native American radio
Public radio in the United States
Companies based in |
https://en.wikipedia.org/wiki/Knowledge%20Navigator | The Knowledge Navigator is a concept described by former Apple Computer CEO John Sculley in his 1987 book, Odyssey: Pepsi to Apple. It describes a device that can access a large networked database of hypertext information, and use software agents to assist searching for information.
Videos
Apple produced several concept videos showcasing the idea. All of them featured a tablet style computer with numerous advanced capabilities, including an excellent text-to-speech system with no hint of "computerese", a gesture based interface resembling the multi-touch interface later used on the iPhone and an equally powerful speech understanding system, allowing the user to converse with the system via an animated "butler" as the software agent.
In one vignette a university professor returns home and turns on his computer, in the form of a tablet the size of a large-format book. The agent is a bow-tie wearing butler who appears on the screen and informs him that he has several calls waiting. He ignores most of these, from his mother, and instead uses the system to compile data for a talk on deforestation in the Amazon Rainforest. While he is doing this, the computer informs him that a colleague is calling, and they then exchange data through their machines while holding a video based conversation.
In another such video, a young student uses a smaller handheld version of the system to prompt him while he gives a class presentation on volcanoes, eventually sending a movie of an exploding volcano to the video "blackboard". In a final installment a user scans in a newspaper by placing it on the screen of the full-sized version, and then has it help him learn to read by listening to him read the scanned results, and prompting when he pauses.
Credits
The videos were funded and sponsored by Bud Colligan, Director of Apple's higher education marketing group, written and creatively developed by Hugh Dubberly and Doris Mitsch of Apple Creative Services, with technical and conceptual input from Mike Liebhold of Apple's Advanced Technologies Group and advice from Alan Kay, then an Apple Fellow. The videos were produced by The Kenwood Group in San Francisco and directed by Randy Field. The director of photography was Bill Zarchy. The post-production mix was done by Gary Clayton at Russian Hill Recording for The Kenwood Group. The product industrial design was created by Gavin Ivester and Adam Grosser of Apple design.
The Knowledge Navigator video premiered in 1987 at Educom, the leading higher education conference, in a keynote by John Sculley, with demos of multimedia, hypertext and interactive learning directed by Bud Colligan.
The music featured in this video is Georg Anton Benda's Harpsichord Concerto in C.
Reception
The software agent in the video has been discussed in the domain of human–computer interaction. It was criticized as being an unrealistic portrayal of the capacities of any software agent in the foreseeable future, or even in a distant future.
Som |
https://en.wikipedia.org/wiki/Wolfgang%20Wahlster | Wolfgang Wahlster (born February 2, 1953) is a German artificial intelligence researcher. He was CEO and Scientific Director of the German Research Center for Artificial Intelligence and full professor of computer science at Saarland University, Saarbrücken. Wahlster remains Chief Executive Advisor of the German Research Center for Artificial Intelligence. In May 2019, he was honored by the Gesellschaft für Informatik as one of 10 most important heads of German artificial intelligence history. He is sometimes called the inventor of the "Industry 4.0" term.
Wahlster was one of the initiators of the Hermes Award, given each year since 2004 at the Hannover Messe and for many years was the Chairman of the Hermes Award Jury.
In 2016, he was elected to the University Council of the Technische Universität Darmstadt.
Education
Wahlster graduated from the Max-Planck Gymnasium in Delmenhorst. From 1972 to 1977 he studied computer science and theoretical linguistics at the University of Hamburg, where he received his diploma in 1977. In 1981 he received his doctorate in computer science from the University of Hamburg.
Awards and recognition
Wahlster was awarded the Deutscher Zukunftspreis ("German Future Award") in 2001 and has been a foreign member of the Class for Engineering Sciences of the Royal Swedish Academy of Sciences since 2003. In 2004, he was elected as a fellow of the Gesellschaft für Informatik.
In 2020, Wahlster was awarded an honorary title doctor honoris causa of Czech Technical University (CTU) in Prague and in 2021 elected as an honorary foreign member of the Engineering Academy of the Czech Republic (EACR).
External links
Wahlster at the German Research Centre for Artificial Intelligence
References
1953 births
Living people
Artificial intelligence researchers
German computer scientists
Fellows of the Association for the Advancement of Artificial Intelligence
Members of the Royal Swedish Academy of Sciences
Commanders Crosses of the Order of Merit of the Federal Republic of Germany
Recipients of the Saarland Order of Merit
Academic staff of Technische Universität Darmstadt
Fellows of the European Association for Artificial Intelligence
Presidents of the Association for Computational Linguistics
University of Hamburg alumni |
https://en.wikipedia.org/wiki/CBS%20Radio | CBS Radio was a radio broadcasting company and radio network operator owned by CBS Corporation and founded in 1928, with consolidated radio station groups owned by CBS and Westinghouse Broadcasting/Group W since the 1920s, and Infinity Broadcasting since the 1970s. The broadcasting company was sold to Entercom (now known as Audacy, Inc.) on November 17, 2017.
Although CBS's involvement in radio dates back to the establishment of the original CBS Radio Network in 1927, the most recent radio division was formed by the 1997 acquisition of Infinity Broadcasting by CBS owner Westinghouse. In 1999, Infinity became a division of the original Viacom; in 2005, Viacom spun CBS and Infinity Broadcasting back into a separate company, and the division was renamed CBS Radio. It was the last radio group left to be tied to a major broadcast television network, as NBC divested its radio interests in the 1980s, and ABC sold off its division to Citadel Broadcasting (now part of Cumulus Media) in 2007.
Early origins
CBS Radio is one of the oldest units within CBS Corporation, and has been around since 1928. However, the actual CBS Radio Network (now CBS News Radio) was launched in 1927, when CBS itself was known as United Independent Broadcasters. Columbia Records later joined in and that company was renamed the Columbia Phonographic Broadcasting System. In September 1927, Columbia Records sold the company to William S. Paley and in 1928, Paley streamlined the corporate name to Columbia Broadcasting System.
In 1940, Paley also joined forces with the journalist Edmund Chester at CBS Radio and Nelson Rockefeller at the Department of State's Office of the Coordinator of Inter-American Affairs to launch the imaginative Network of the Americas (La Cadena de Las Americas) in 1942. This innovative radio network beamed both news and cultural programming live to North and South America in support of cultural diplomacy and Pan Americanism in accordance with President Franklin Roosevelt's Good Neighbor policy during World War II.
History
The company that would become CBS Radio was founded in 1972 as Infinity Broadcasting Corporation by Michael A. Wiener and Gerald Carrus, with the acquisition of KOME, an FM radio station that served the San Francisco Bay Area. It became a publicly traded company twice, in 1986, and again in 1992.
Westinghouse Electric Corporation acquired CBS, Inc. in 1995 and then acquired Infinity Broadcasting in 1997. Westinghouse, which produced the first radio broadcast on November 2, 1920, with KDKA in Pittsburgh, Pennsylvania, would later change its name to the original CBS Corporation, and reorganize all of its radio properties (including its own Group W stations), as well as its outdoor advertising business, under the Infinity Broadcasting Corporation name. Westinghouse acquired American Radio Systems in September 1997. In 2000, CBS Corporation was merged into Viacom. On December 31, 2005, Viacom spun out its motion picture and cable televisi |
https://en.wikipedia.org/wiki/Mydoom | mydoom also known as, my.doom, W32.MyDoom@mm, Novarg, Mimail.R, Shimgapi, W32/Mydoom@MM, WORM_MYDOOM, Win32.Mydoom is a computer worm affecting Microsoft Windows. It was first sighted on January 26, 2004. It became the fastest-spreading e-mail worm ever, exceeding previous records set by the Sobig worm and ILOVEYOU, a record which as of 2023 has yet to be surpassed.
MyDoom appears to have been commissioned by e-mail spammers to send junk e-mail through infected computers. The worm contains the text message "andy; I'm just doing my job, nothing personal, sorry," leading many to believe that the worm's creator was paid. Early on, several security firms expressed their belief that the worm originated from a programmer in Russia. The actual author of the worm is unknown.
The worm appeared to be a poorly sent e-mail, and most people who originally were e-mailed the worm ignored it, thinking it was spam. However, it eventually spread to infect at least 500 thousand computers across the globe.
Speculative early coverage held that the sole purpose of the worm was to perpetrate a distributed denial-of-service attack against SCO Group. 25 percent of MyDoom.A-infected hosts targeted SCO Group with a flood of traffic. Trade press conjecture, spurred on by SCO Group's own claims, held that this meant the worm was created by a Linux or open source supporter in retaliation for SCO Group's controversial legal actions and public statements against Linux. This theory was rejected immediately by security researchers. Since then, it has been likewise rejected by law enforcement agents investigating the virus, who attribute it to organized online crime gangs.
Initial analysis of MyDoom suggested that it was a variant of the Mimail worm—hence the alternate name Mimail.R—prompting speculation that the same people were responsible for both worms. Later analyses were less conclusive as to the link between the two worms.
MyDoom was named by Craig Schmugar, an employee of computer security firm McAfee and one of the earliest discoverers of the worm. Schmugar chose the name after noticing the text "mydom" within a line of the program's code. He noted: "It was evident early on that this would be very big. I thought having 'doom' in the name would be appropriate."
Technical overview
MyDoom is primarily transmitted via e-mail, appearing as a transmission error, with subject lines including "Error", "Mail Delivery System", "Test" or "Mail Transaction Failed" in different languages, including English and French. The mail contains an attachment that, if executed, resends the worm to e-mail addresses found in local files such as a user's address book. It also copies itself to the "shared folder" of peer-to-peer file sharing application Kazaa in an attempt to spread that way.
MyDoom avoids targeting e-mail addresses at certain universities, such as Rutgers, MIT, Stanford and UC Berkeley, as well as certain companies such as Microsoft and Symantec. Some early reports claimed |
https://en.wikipedia.org/wiki/Aerobiz | is a business simulation video game for the Super NES and Mega Drive/Genesis game consoles, released in 1992 by Koei. It was also released for the FM Towns, PC-9801 and X68000 computer platforms in Japan.
As CEO of a budding international airline, the player has a limited amount of time to expand their business to become the industry leader against three other airlines (either AI-controlled or human opponents). The player has an amount of control over how their airline develops, such as the name, investments, what routes to fly, plane purchases, and other various aspects, while at the mercy of world events such as politics (for instance, choosing to run an airline out of Moscow will restrict the player to buying only Soviet planes, and will make negotiating with Western nations more difficult) and natural disasters. The player can also get the company involved in peripheral businesses such as hotels and shuttle services. Once Perestroika is initiated, then the Cold War restrictions no longer apply in the game.
The sequel Aerobiz Supersonic was released in August 1994 for the SNES and Mega Drive/Genesis. The player is presented with a wider variety of options in nearly everything. Another sequel known as Air Management '96 was released only in Japan for the Sega Saturn and PlayStation.
Gameplay
Aerobiz features two timeframes to play the game through: 1963 to 1995, and 1983 to 2015. After selecting the timeframe, the players then choose a city for their airline's headquarters. This allows a certain amount of handicapping: some cities, such as New York, London, and Tokyo, start the player with many airplanes and a large amount of money; others, such as Lima, Nairobi, and Honolulu, start the player with only a couple of airplanes and a small amount of money. The players then select a difficulty level, which affects the number of passengers, world events (and the reactions of the passengers to those world events), and the win conditions. A charter system of independent airlines can have their shares bought or sold on the stock market; owning at least 51% of the company makes it eligible to be assimilated into the main airline.
The gameplay is superficially straightforward: players negotiate for access slots at each airport, buy airplanes, then open routes and start business. After each player has made their desired moves, the game shows any world events that affect the players (for instance, a labor strike will delay shipments of aircraft from that company, while the Olympic Games will boost traffic worldwide, particularly to the host city). The game then shows the results of direct competition between airlines flying the same routes, then the quarterly results of sales, expenses, profits, and passengers flown. After the January–March quarter of every year, it also shows annual results. There are elements of enhancing airline service, such as improving the convenience of arrivals/departures, along with reductions in fare, improving the quality of |
https://en.wikipedia.org/wiki/Irish%20Primary%20Principals%20Network | Irish Primary Principals’ Network (IPPN) was established in 2000 and has become the recognised professional body for Ireland’s primary school leaders. With a membership of over 6,000 Principals and Deputy Principals, the IPPN is an independent, not-for-profit, voluntary association, a registered charity, a company limited by guarantee and an officially recognised Education Partner.
References
External links
Irish Primary Principals Network
Education in the Republic of Ireland
2000 establishments in Ireland
Organizations established in 2000 |
https://en.wikipedia.org/wiki/Philip%20Greenspun | Philip Greenspun (born September 28, 1963) is an American computer scientist, educator, early Internet entrepreneur, and pilot who was a pioneer in developing online communities like photo.net.
Biography
Greenspun was born on September 28, 1963, grew up in Bethesda, Maryland, and received a B.S. in Mathematics from MIT in 1982. After working for HP Labs in Palo Alto and Symbolics, he became a founder of ICAD, Inc. Greenspun returned to MIT to study electrical engineering and computer science, eventually receiving a Ph.D.
Working with Isaac Kohane of Boston Children's Hospital and Harvard Medical School, Greenspun was the developer of an early Web-based electronic medical record system. The system is described in "Building national electronic medical record systems via the World Wide Web" (1996). Greenspun and Kohane continue to work together on a medical informatics at Harvard Medical School.
In 1995, Greenspun was hired to lead development of Hearst Corporation's Internet services, which included early e-commerce sites. In 1997 he co-founded ArsDigita, a web services company which grew to $20 million in annual revenues by 2000.
Photo.net and ArsDigita
In 1993, Greenspun founded photo.net, an online community for people helping each other to improve their photographic skills. He seeded the community with "Travels with Samantha", a photo-illustrated account of a trip from Boston to Alaska and back. Photo.net became a business in 2000 with the help of some of his cofounders Rajeev Surati and Waikit Lau. Having grown to 600,000 registered users, it was acquired by NameMedia in 2007 for $6 million, according to documents filed in connection with a planned public offering of NameMedia shares. Greenspun founded the open-source software company ArsDigita and, as CEO, grew it to about $20 million in revenue before taking a venture capital investment.
Greenspun was an early developer of database-backed Web sites, which became the dominant approach to engineering sites with user contributions, e.g., Amazon.com. Greenspun was also a developer of one of the first Web-based electronic medical record systems. Greenspun's Oracle-based community site LUSENET was an important early host of free forums.
Aviation
Greenspun was employed as a commercial pilot for Delta Air Lines subsidiary Comair from 2008 until it ceased operation in 2012. According to the FAA Airmen registry, Greenspun holds an Airline Transport Pilot License and Flight Instructor certificates for both airplanes and helicopters, as well as type ratings for two turbojet-powered airplanes. Greenspun is listed as an instructor at the East Coast Aero Club and was interviewed by NPR regarding the success of a Groupon helicopter lesson offer.
Publications
Greenspun has written several textbooks on developing Internet applications, including Philip and Alex's Guide to Web Publishing, SQL for Web Nerds, and Software Engineering for Internet Applications, the textbook for an MIT course. Greensp |
https://en.wikipedia.org/wiki/Old%20Fort%20Erie | Old Fort Erie, also known as Fort Erie, or the Fort Erie National Historic Site of Canada, was the first British fort to be constructed as part of a network developed after the Seven Years' War (known as "the French and Indian War" in the colonies) was concluded by the Treaty of Paris (1763), at which time France ceded its territories east of the Mississippi River (all of New France) to Great Britain. The installation is located on the southern edge of what is now the Town of Fort Erie, Ontario, directly across the Niagara River from Buffalo, New York, United States.
The fort and surrounding battlefield are owned and operated by the Niagara Parks Commission, a self-funded agency of the Ontario provincial government.
History
The British established control of their new territory by occupying the French forts and by constructing a line of communications along the Niagara River and Upper Great Lakes. The original fort, built in 1764, was located on the Niagara River's edge below the present fort (parking lot on Lakeshore Road). It served as a supply depot and a port for ships transporting merchandise, troops and passengers via Lake Erie to the Upper Great Lakes. In 1795, the fort consisted of some wooden blockhouses surrounded by a wooden palisade (dropped from the plan was a magazine, officer's quarters, storehouses and guard house). Provisions were stored inside the fort, and just outside was a large wooden magazine (original plans were to have it built inside the fort), as well as houses for workmen. The fort was damaged by winter storms and in 1803, plans were made for a new fort on the higher ground behind the original. It was larger and made of flintstone but was not quite finished at the start of the War of 1812.
The fort served as a supply base for British troops, United Empire Loyalists Rangers, and allied Iroquois warriors during the American Revolution. The little fort at the water's edge suffered considerable damage due to continuous winter storms. In 1803, planning was authorized for a new Fort Erie on the heights behind the original post. The new fort was made more formidable as it was constructed of the Onondaga flintstone that was readily available in the area.
War of 1812 (1812–1815)
Fort Erie was the site of the bloodiest battles during the War of 1812. This new fort was unfinished when the United States declared war on June 18, 1812. Part of the garrison of Fort Erie fought at the Battle of Frenchman's Creek against an American attack in November 1812. In 1813, Fort Erie was held for a period by U.S. forces and then abandoned on June 9, 1813. The fort had been partially dismantled by the small garrison of British troops and Canadian Militia as they withdrew.
British reoccupation followed American withdrawal from the area in December 1813. The British attempted to rebuild the fort. On July 3, 1814 another American force landed nearby and again captured Fort Erie. The U.S. Army used the fort as a supply base and expanded its |
https://en.wikipedia.org/wiki/Kansas%20City%20Southern%20%28company%29 | Kansas City Southern (KCS) was a pure transportation holding company with railroad investments in the United States, Mexico, and Panama. The KCS rail network included about of track in the U.S. and Mexico.
Its primary U.S. holding was the Kansas City Southern Railway (KCS), a Class I railroad that operated about in 10 states in the midwestern and southeastern United States. KCS's hubs include Kansas City, Missouri; Shreveport, Louisiana; New Orleans; Dallas; and Houston. Among Class I railroads, KCS had the shortest route between Kansas City, the second-largest rail hub in the country, and the Gulf of Mexico. Its primary international holding was Kansas City Southern de México (KCSM), which operated about in 15 states in northeastern, central, southeast-central and southwest-central Mexico. KCSM reached the Gulf of Mexico ports of Tampico, Altamira, and Veracruz, and the Pacific Ocean deepwater container port of Lázaro Cárdenas. KCS obtained 100% of ownership of KCSM in 2005, making KCS the only U.S. Class I Railroad to own track in Mexico.
The company also owned half of Panama Canal Railway Company (PCRC), which operates the Panama Canal Railway, providing ocean-to-ocean transshipment service between the Atlantic and Pacific oceans. The railroad served as an intermodal line for world commerce and complements the Canal, the Colón Free Trade Zone, and the Pacific and Atlantic ports. As of 2009, PCRC's wholly owned subsidiary, Panarail Tourism, offered passenger service for business commuters, tourists, and private charters.
Beginning in 2021, KCS became the subject of a bidding war between Canadian National Railway and Canadian Pacific Railway. Canadian Pacific (CP) emerged as the winner. CP then sought a merger, which was approved by the US Surface Transportation Board on March 15, 2023, and the combined "Canadian Pacific Kansas City Limited" was created on April 14, 2023. The combined company forms the only railroad serving all of the countries in the North American trade zone (Canada, Mexico, and the United States).
History
In 1887, Arthur Edward Stilwell and Edward L. Martin began construction on and incorporated the Kansas City Suburban Belt Railway in suburban Kansas City, Missouri. Beginning operations in 1890, the railroad served the Argentine District in Kansas City, Kansas; Independence, Missouri; and the riverside commercial and industrial districts of Kansas City.
While the Belt Railway was a success, Stilwell had a much bigger dream. Over the ensuing decade, the line grew through construction and acquisition of other roads, such as the Texarkana and Fort Smith Railway, to become a through route between Kansas City and Port Arthur, Texas. With the final spike being driven north of Beaumont, Texas, on September 11, 1897, the Kansas City, Pittsburg and Gulf Railroad Company (KCP&G) was completed. In 1900, KCP&G became The Kansas City Southern Railway Company (KCS). In 1939, KCS acquired the Louisiana and Arkansas Railway (L&A) |
https://en.wikipedia.org/wiki/Computer%20desk | The computer desk and related ergonomic desk are furniture pieces designed to comfortably and aesthetically provide a working surface and house or conceal office equipment including computers, peripherals and cabling for office and home-office users.
Computer desk
The most common form of the computer desk is an ergonomic variant of the office desk, which has an adjustable and sufficient desktop space for handwriting. Provisions for a monitor shelf and holes for routing cables are integrated in the design, making it easier to connect the computer components together. The typical armoire desk provides space for a keyboard, mouse, monitor, printer and speakers. cubicle desk designs for business and government workplaces include a range of shelves, trays and cable-routing holes for computer systems. In some computer desks, the cabling is affixed to the modesty panel at the back of the desk, to create a neater appearance.
There are a great variety of computer desk shapes and forms. Large multiple student computer desks configured in rows are designed to house dozens of computer systems while facilitating wiring, general maintenance, theft prevention and vandalism reduction. Small rolling lectern desks or computer carts with tiny desktops provide just enough room for a laptop computer and a mouse pad. Computer desks are typically mass-produced and require some self-assembly.
The computer itself is normally separate from the desk, which is designed to hold a typically sized computer, monitor and accessories. Cabling must be routed through the channels and access openings by the user or installer. A small number of computers are built within a desk made specially for them, like the British i-desk. Various proposals for the "Office of the future" suggested other integrated designs, but these have not been taken up.
A rolling chair table configuration offers mobility and improved access in situations where a desk is not convenient. Gyratory computer tables can be used over a bed. Modular computer tables separate user interface elements from the computing and network connection, allowing more placement flexibility. The modules are connected via wireless technology.
Ergonomic desk
The ergonomic desk is a modern desk form which, like the adjustable drawing table or drafting table, offers mechanical adjustments for the placement of its elements in order to maximize user comfort and efficiency. The ergonomic desk is usually a "stand-alone" piece of furniture allowing access to the adjustment mechanisms. Some ergonomic desks have a sufficiently large desktop height adjustment to create either a common "sit-down" desk or a less common standing desk, which allows the user to work while standing. The ergonomic desk is usually a close companion to the ergonomic chair.
The ergonomic desk originated with the beginning of the field of human factors or ergonomics after World War II. Legislation stating minimal requirements for furniture used by office work |
https://en.wikipedia.org/wiki/MSC | MSC may refer to:
Computers
Message Sequence Chart
Microelectronics Support Centre of UK Rutherford Appleton Laboratory
MIDI Show Control
MSC Malaysia (formerly known as Multimedia Super Corridor)
USB mass storage device class (USB MSC)
Mobile Switching Center, of a phone network
Management saved console
Corporations
Managed service company, a UK company structure
MSC Industrial Direct, formerly Manhattan Supply Company
MSC Software, simulation software company, formerly MacNeal-Schwendler Corporation
Metric Systems Corporation
Mediterranean Shipping Company
Education
Master of Science, usually MSc or M.Sc.
Mastère en sciences, French degree
Memorial Student Center, Texas A&M University, US
Mesa State College, Colorado, United States
Mount Saint Charles Academy, Catholic school in Rhode Island, United States
Munsang College, Hong Kong
Marinduque State College, Philippines, now Marinduque State University
Military
Medical Service Corps, of the US military forces
Military Sealift Command, US Navy
Military Staff Committee, United Nations body
Munich Security Conference, annual international security conference
Religious
Marianites of Holy Cross
Missionaries of the Sacred Heart
Science
Miles of Standard Cable, former telephony unit of loss
Manned Spacecraft Center, later Johnson Space Center
Mathematics Subject Classification
Messinian salinity crisis, a geological event
Meteorological Service of Canada
Biology
Mechanosensitive channels
Mesenchymal stem cell
MSC (gene), a human gene encoding the protein musculin
Seafaring
Maritime Safety Committee, a United Nations body
Marine Stewardship Council, concerned with sustainable fishing
Manchester Ship Canal, England
Mediterranean Shipping Company, a container shipping company
MSC Cruises, a cruise line
Sports
Metro Suburban Conference, athletic conference, Illinois, US
Mid-South Conference, US athletic conference
Mobile Legends: Bang Bang Southeast Asia Cup, MOBA esports tournament
Mohammedan Sporting Club (Dhaka), Bangladesh
Mohammedan Sporting Club (Chittagong), a branch in Chittagong
Mohammedan Sporting Club (Kolkata)
Mombasa Sports Club, Kenya
Other
Air Cairo (ICAO designator), Egyptian airline
Mail services center
Manpower Services Commission, UK, 1973-1987
Member of State Council
Meritorious Service Cross, a Canadian decoration bestowed by the Monarch
Metropolitan Special Constabulary, London, England
Motorcycle Stability Control, an ABS variant
Movimiento Scout Católico (Catholic Scout Movement), Spain |
https://en.wikipedia.org/wiki/IEEE%20802.7 | IEEE 802.7 is a sub-standard of the IEEE 802 which covers broadband local area networks. The working group did issue a recommendation in 1989, but is currently inactive and in hibernation.
IEEE 802.07
Working groups |
https://en.wikipedia.org/wiki/Pitfall%21 | Pitfall! is a video game developed by David Crane for the Atari Video Computer System (later renamed Atari 2600) and released in 1982 by Activision. The player controls Pitfall Harry, who has a time limit of 20 minutes to seek treasure in a jungle. The game world is populated by enemies and hazards that variously cause the player to lose lives or points.
Crane had made several games for both Atari, Inc. and Activision before working on Pitfall! in 1982. He started with creating a new realistic-style walking animation for a person on the Atari 2600 hardware. After completing it, he fashioned a game around it. He used a jungle setting with items to collect and enemies to avoid, and the result became Pitfall!
Pitfall! received mostly positive reviews at the time of its release praising both its gameplay and graphics. The game was influential in the platform game genre and various publications have considered it one of the greatest video games of all time. It is also one of the best-selling Atari 2600 video games. The game was ported to several contemporary video game systems. It has been included in various Activision compilation games and was included as a secret extra in later Activision published titles.
Gameplay
Pitfall! is a video game set in a jungle where the player controls Pitfall Harry, a fortune hunter and explorer. Pitfall! has been described as a platform game by Nick Montfort and Ian Bogost, authors of Racing the Beam. Similar to Superman (1979) and Adventure (1980), the game does not feature side-scrolling, but instead loads one screen at a time, with a new screen appearing when Harry moves to the edge. The goal is to get Harry as many points as possible within a twenty-minute time limit. The player starts the game with 2000 points and can collect a total of 32 treasure hidden among 255 different scenes to increase their total, ranging from a money bag worth 2000 points, to a diamond ring worth 5000 points.
Pitfall Harry moves left and right and can jump over and onto objects, swing from vines, and climb up and down ladders to seek treasure and avoid danger. The player can also lose points from hazards, such as falling down a hole or colliding with rolling logs. The player starts with three lives and can lose one if they are hit by a scorpion, cobra rattler, crocodile or sink into quicksand, swamps or tar pits.
Development
Pitfall! was developed by David Crane, for Activision. Crane had previously worked at Atari, Inc. in the late 1970s developing games for the Atari Video Computer System, later released as the Atari 2600. The system became known as the Atari 2600 after the release of the Atari 5200 in 1982. After discovering the high profits Atari had made for games he developed such as Outlaw, Canyon Bomber and Slot Machine, he asked the president of Atari Ray Kassar for recognition on their titles and more pay. When he was turned down, Crane and other Atari programmers left the company to form Activision in 1979. Crane was th |
https://en.wikipedia.org/wiki/COMDEX | COMDEX (an abbreviation of COMputer Dealers' EXhibition) was a computer expo trade show held in the Las Vegas Valley of Nevada, United States, each November from 1979 to 2003. It was one of the largest computer trade shows in the world, usually second only to the German CeBIT, and one of the largest trade shows in any industry sector. COMDEX exhibitions were held in many other countries from 1982 to 2005, with 185 shows altogether. The first COMDEX was held in 1979 at the MGM Grand (now Horseshoe), with 167 exhibitors and 3904 attendees. In 1981, the first COMDEX/Spring was held in New York City.
History
Organizers
The Interface Group
COMDEX was started by The Interface Group, whose organizers included Sheldon Adelson, and Richard Katzeff. In 1995, they sold the show to the Japanese technology conglomerate Softbank Corp. In 2001, Softbank sold the show to Key3Media, a spin-off of Ziff Davis. After entering Chapter 11 bankruptcy in February 2003, Key3Media resurfaced as Medialive International with a cash infusion from Thomas Weisel Capital Partners, which had previously invested in the company. In November 2006, Forbes magazine reported that United Business Media PLC had purchased the events assets of MediaLive International Inc.
Northeast Computer Faire
Personal Computer Faire in San Francisco, the Northeast Computer Faire in Boston, and Southern California Computer Faire were presented by Computer Faire Inc., Newton, Mass., a subsidiary of Prentice-Hall.
Northeast Computer Faire 1988 was presented by The Interface Group and Boston Computer Society in Boston.
Attendance
COMDEX was initially restricted to those directly involved in the computer industry. It was the one show where all levels of manufacturers and developers of computers, peripherals, software, components, and accessories met with distributors, retailers, consultants and their competitors.
Colloquially known as "Geek Week", COMDEX evolved into a major technical convention, with the industry making major product announcements and releases there. Numerous small companies from around the world rose to prominence following appearance at COMDEX, and industry leaders sought opportunities to make keynote addresses. They discussed the computer industry, history, trends and future potential. The first COMDEX Conference, attracted 4000 paying attendees and grew to over 100,000, becoming a launch platform for key technologies. Bluetooth and USB had conference programming and associated exhibition floor pavilions to help these technologies and start up companies be seen in such a large event and marketplace. In 1982, Microsoft founder Bill Gates attended the conference and saw a demonstration of VisiCorp's Visi On, a GUI software suite for IBM PC compatible computers. The development of Windows 1.0 began soon thereafter. In 1999, Linus Torvalds attended the exhibition to talk about the Linux family of operating system. A Linux conference and exhibition hall was a co-located event, he |
https://en.wikipedia.org/wiki/Referential%20integrity | Referential integrity is a property of data stating that all its references are valid. In the context of relational databases, it requires that if a value of one attribute (column) of a relation (table) references a value of another attribute (either in the same or a different relation), then the referenced value must exist.
For referential integrity to hold in a relational database, any column in a base table that is declared a foreign key can only contain either null values or values from a parent table's primary key or a candidate key. In other words, when a foreign key value is used it must reference a valid, existing primary key in the parent table. For instance, deleting a record that contains a value referred to by a foreign key in another table would break referential integrity. Some relational database management systems (RDBMS) can enforce referential integrity, normally either by deleting the foreign key rows as well to maintain integrity, or by returning an error and not performing the delete. Which method is used may be determined by a referential integrity constraint defined in a data dictionary.
The adjective 'referential' describes the action that a foreign key performs, 'referring' to a linked column in another table. In simple terms, 'referential integrity' guarantees that the target 'referred' to will be found. A lack of referential integrity in a database can lead relational databases to return incomplete data, usually with no indication of an error.
Formalization
An inclusion dependency over two (possibly identical) predicates and from a schema is written , where the , are distinct attributes (column names) of and . It implies that the tuples of values appearing in columns for facts of must also appear as a tuple of values in columns for some fact of .
Such constraint is a particular form of tuple-generating dependency (TGD) where in both the sides of the rule there is only one relational atom. In first-order logic it is expressible as , where is the vector (whose size is ) of variables shared by and , and no variable appears multiple times neither in the TGD's body nor in its head.
Logical implication between inclusion dependencies can be axiomatized by inference rules
and can be decided by a PSPACE algorithm. The problem can be shown to be PSPACE-complete by reduction from the acceptance problem for a linear bounded automaton. However, logical implication between dependencies that can be inclusion dependencies or functional dependencies is undecidable by reduction from the word problem for monoids.
Declarative referential integrity
Declarative Referential Integrity (DRI) is one of the techniques in the SQL database programming language to ensure data integrity.
Meaning in SQL
A table (called the referencing table) can refer to a column (or a group of columns) in another table (the referenced table) by using a foreign key. The referenced column(s) in the referenced table must be under a unique constraint |
https://en.wikipedia.org/wiki/Child%20process | A child process in computing is a process created by another process (the parent process). This technique pertains to multitasking operating systems, and is sometimes called a subprocess or traditionally a subtask.
There are two major procedures for creating a child process: the fork system call (preferred in Unix-like systems and the POSIX standard) and the spawn (preferred in the modern (NT) kernel of Microsoft Windows, as well as in some historical operating systems).
History
Child processes date to the late 1960s, with an early form in later revisions of the Multiprogramming with a Fixed number of Tasks Version II (MFT-II) form of the IBM OS/360 operating system, which introduced sub-tasking (see task). The current form in Unix draws on Multics (1969), while the Windows NT form draws on OpenVMS (1978), from RSX-11 (1972).
Children created by fork
A child process inherits most of its attributes, such as file descriptors, from its parent. In Unix, a child process is typically created as a copy of the parent, using the fork system call. The child process can then overlay itself with a different program (using ) as required.
Each process may create many child processes but will have at most one parent process; if a process does not have a parent this usually indicates that it was created directly by the kernel. In some systems, including Linux-based systems, the very first process (called init) is started by the kernel at booting time and never terminates (see Linux startup process); other parentless processes may be launched to carry out various daemon tasks in userspace. Another way for a process to end up without a parent is if its parent dies, leaving an orphan process; but in this case it will shortly be adopted by init.
The SIGCHLD signal is sent to the parent of a child process when it exits, is interrupted, or resumes after being interrupted. By default the signal is simply ignored.
Children created by spawn
End of life
When a child process terminates, some information is returned to the parent process.
When a child process terminates before the parent has called wait, the kernel retains some information about the process, such as its exit status, to enable its parent to call wait later. Because the child is still consuming system resources but not executing it is known as a zombie process. The wait system call is commonly invoked in the SIGCHLD handler.
POSIX.1-2001 allows a parent process to elect for the kernel to automatically reap child processes that terminate by explicitly setting the disposition of SIGCHLD to SIG_IGN (although ignore is the default, automatic reaping only occurs if the disposition is set to ignore explicitly), or by setting the SA_NOCLDWAIT flag for the SIGCHLD signal. Linux 2.6 kernels adhere to this behavior, and FreeBSD supports both of these methods since version 5.0. However, because of historical differences between System V and BSD behaviors with regard to ignoring SIGCHLD, calling wait remai |
https://en.wikipedia.org/wiki/Parent%20process | In computing, a parent process is a process that has created one or more child processes.
Unix-like systems
In Unix-like operating systems, every process except (the swapper) is created when another process executes the fork() system call. The process that invoked fork is the parent process and the newly created process is the child process. Every process (except process 0) has one parent process, but can have many child processes.
The operating system kernel identifies each process by its process identifier. is a special process that is created when the system boots; after forking a child process becomes the swapper process (sometimes also known as the "idle task"). , known as , is the ancestor of every other process in the system.
Linux
In the Linux kernel, in which there is a very slim difference between processes and POSIX threads, there are two kinds of parent processes, namely real parent and parent. Parent is the process that receives the SIGCHLD signal on child's termination, whereas real parent is the thread that actually created this child process in a multithreaded environment. For a normal process, both these two values are same, but for a POSIX thread which acts as a process, these two values may be different.
Zombie processes
The operating system maintains a table that associates every process, by means of its process identifier (generally referred to as "pid") to the data necessary for its functioning. During a process's lifetime, such data might include memory segments designated to the process, the arguments it's been invoked with, environment variables, counters about resource usage, user-id, group-id and group set, and maybe other types of information.
When a process terminates its execution, either by calling exit (even if implicitly, by executing a return command from the main function) or by receiving a signal that causes it to terminate abruptly, the operating system releases most of the resources and information related to that process, but still keeps the data about resource utilization and the termination status code, because a parent process might be interested in knowing if that child executed successfully (by using standard functions to decode the termination status code) and the amount of system resources it consumed during its execution.
By default, the system assumes that the parent process is indeed interested in such information at the time of the child's termination, and thus sends the parent the signal SIGCHLD to alert that there is some data about a child to be collected. Such collection is done by calling a function of the wait family (either wait itself or one of its relatives, such as waitpid, waitid or wait4). As soon as this collection is made, the system releases those last bits of information about the child process and removes its pid from the process table. However, if the parent process lingers in collecting the child's data (or fails to do it at all), the system has no option but keep |
https://en.wikipedia.org/wiki/Comparison%20of%20computer%20viruses | The compilation of a unified list of computer viruses is made difficult because of naming. To aid the fight against computer viruses and other types of malicious software, many security advisory organizations and developers of anti-virus software compile and publish lists of viruses. When a new virus appears, the rush begins to identify and understand it as well as develop appropriate counter-measures to stop its propagation. Along the way, a name is attached to the virus. As the developers of anti-virus software compete partly based on how quickly they react to the new threat, they usually study and name the viruses independently. By the time the virus is identified, many names denote the same virus.
Another source of ambiguity in names is that sometimes a virus initially identified as a completely new virus is found to be a variation of an earlier known virus, in which cases, it is often renamed. For example, the second variation of the Sobig worm was initially called "Palyh" but later renamed "Sobig.b". Again, depending on how quickly this happens, the old name may persist.
Scope
In terms of scope, there are two major variants: the list of "in-the-wild" viruses, which list viruses in active circulation, and lists of all known viruses, which also contain viruses believed not to be in active circulation (also called "zoo viruses"). The sizes are vastly different: in-the-wild lists contain a hundred viruses but full lists contain tens of thousands.
Comparison of viruses and related programs
{|class="wikitable sortable" border="1"
!Virus
!Alias(es)
!Types
!Subtype
!Isolation Date
!Isolation
!Origin
!Author
!Notes
|-
|1260
|V2Px
|DOS
|Polymorphic
|1990
|
|
|
|First virus family to use polymorphic encryption
|-
|4K
|4096
|DOS
|
|1990-01
|
|
|
|The first known MS-DOS-file-infector to use stealth
|-
|5lo
|
|DOS
|
|1992-10
|
|
|
|Infects .EXE files only
|-
|Abraxas
|Abraxas5
|DOS,Windows 95, 98
|
|1993-04
|Europe
|
|ARCV group
|Infects COM file. Disk directory listing will be set to the system date and time when infection occurred.
|-
|Acid
|Acid.670, Acid.670a, Avatar.Acid.670, Keeper.Acid.670
|DOS,Windows 95, 98
|
|1992
|
|
|Corp-$MZU
|Infects COM file. Disk directory listing will not be altered.
|-
|Acme
|
|DOS,Windows 95 DOS
|
|1992
|
|
|
|Upon executing infected EXE, this infects another EXE in current directory by making a hidden COM file with same base name.
|-
|ABC
|ABC-2378, ABC.2378, ABC.2905
|DOS
|
|1992-10
|
|
|
|ABC causes keystrokes on the compromised machine to be repeated.
|-
|Actifed
|
|DOS
|
|
|
|
|
|
|-
|Ada
|
|DOS
|
|1991-10
|
|Argentina
|
|The Ada virus mainly targets .COM files, specifically COMMAND.COM.
|-
|AGI-Plan
|Month 4-6
|DOS
|
|
|Mülheim
|
|
|AGI-Plan is notable for reappearing in South Africa in what appeared to be an intentional re-release.
|-
|AI
|
|DOS
|
|
|
|
|
|
|-
|AIDS
|AIDSB, Hahaha, Taunt
|DOS
|
|1990
|
|
|
|AIDS is the first virus known to exploit the DOS "corresponding file" vulnerability.
|- |
https://en.wikipedia.org/wiki/Process%20identifier | In computing, the process identifier (a.k.a. process ID or PID) is a number used by most operating system kernels—such as those of Unix, macOS and Windows—to uniquely identify an active process. This number may be used as a parameter in various function calls, allowing processes to be manipulated, such as adjusting the process's priority or killing it altogether.
Unix-like
In Unix-like operating systems, new processes are created by the fork() system call. The PID is returned to the parent process, enabling it to refer to the child in further function calls. The parent may, for example, wait for the child to terminate with the waitpid() function, or terminate the process with kill().
There are two tasks with specially distinguished process IDs: swapper or sched has process ID 0 and is responsible for paging, and is actually part of the kernel rather than a normal user-mode process. Process ID 1 is usually the init process primarily responsible for starting and shutting down the system. Originally, process ID 1 was not specifically reserved for init by any technical measures: it simply had this ID as a natural consequence of being the first process invoked by the kernel. More recent Unix systems typically have additional kernel components visible as 'processes', in which case PID 1 is actively reserved for the init process to maintain consistency with older systems.
Process IDs, in the first place, are usually allocated on a sequential basis, beginning at 0 and rising to a maximum value which varies from system to system. Once this limit is reached, allocation restarts at 300 and again increases. In macOS and HP-UX, allocation restarts at 100. However, for this and subsequent passes any PIDs still assigned to processes are skipped. Some consider this to be a potential security vulnerability in that it allows information about the system to be extracted, or messages to be covertly passed between processes. As such, implementations that are particularly concerned about security may choose a different method of PID assignment. On some systems, like MPE/iX, the lowest available PID is used, sometimes in an effort to minimize the number of process information kernel pages in memory.
The current process ID is provided by a getpid() system call, or as a variable $$ in shell. The process ID of a parent process is obtainable by a getppid() system call.
On Linux, the maximum process ID is given by the pseudo-file /proc/sys/kernel/pid_max.
Pidfile
Some processes, for example, the moc music player and the MySQL daemon, write their PID to a documented file location, to allow other processes to look it up.
Microsoft Windows
On the Windows family of operating systems, one can get the current process's ID using the GetCurrentProcessId() function of the Windows API, and ID of other processes using GetProcessId(). Internally, process ID is called a client ID, and is allocated from the same namespace as thread IDs, so these two never overlap. The Syst |
https://en.wikipedia.org/wiki/Polylogarithmic%20function | In mathematics, a polylogarithmic function in is a polynomial in the logarithm of ,
The notation is often used as a shorthand for , analogous to for .
In computer science, polylogarithmic functions occur as the order of time or memory used by some algorithms (e.g., "it has polylogarithmic order"), such as in the definition of QPTAS (see PTAS).
All polylogarithmic functions of are for every exponent (for the meaning of this symbol, see small o notation), that is, a polylogarithmic function grows more slowly than any positive exponent. This observation is the basis for the soft O notation .
References
Mathematical analysis
Polynomials
Analysis of algorithms |
https://en.wikipedia.org/wiki/List%20of%20Famicom%20Disk%20System%20games | Family Computer Disk System games were released only in Japan, for the aftermarket floppy drive compatible with Nintendo's Family Computer home video game console. Games released in North America and Europe are in the list of Nintendo Entertainment System games. Games released for the Family Computer are in the List of Family Computer games.
List
This list consists of officially licensed Family Computer Disk System games.
Unlicensed games
Unreleased games
References
External links
List of Famicom Disk games with all serial numbers and additional info (In Japanese)
Famicom World's FDS game database
Famicom Disk System
Famicom Disk System
Famicom Disk System |
https://en.wikipedia.org/wiki/TVO%20%28disambiguation%29 | TVO is a Canadian television network, formerly named TVOntario. It may also refer to:
Television
Televisora de Oriente, a Venezuelan television station
TV Osaka, a Japanese television station
TVQ, which carried the on air branding of TV0 between 1983 and 1988
Other uses
Teollisuuden Voima, a Finnish nuclear power company
Theatre Versus Oppression, a UK-registered charity which uses applied theatre techniques
Tom Voltaire Okwalinga, Ugandan social media personality
Total value of ownership, an evaluation method
Total viable organism, a term for determining the microbial content of a sample
TVO engine or petrol-paraffin engine, a dual-fuel internal combustion engine
Tractor vaporising oil, an engine fuel for British tractors
See also
tvOS, an Apple operating system |
https://en.wikipedia.org/wiki/Grounded%20for%20Life | Grounded for Life is an American television sitcom that debuted on January 10, 2001, as a mid-season replacement on Fox. Created by Mike Schiff and Bill Martin, it ran for two seasons on the network until being canceled only two episodes into its third season. It was immediately picked up for the rest of the third season by the WB, where it aired for two additional seasons until the series ended on January 28, 2005.
The show starred Donal Logue and Megyn Price as Sean and Claudia Finnerty, an Irish Catholic couple living on Staten Island, New York, with their three children: Lily (Lynsey Bartilson), Jimmy (Griffin Frazen), and Henry (Jake Burbage). The show also stars Kevin Corrigan, Bret Harrison, and Richard Riehle. The show has featured guest stars such as Ashton Kutcher, Danny Masterson, Mila Kunis, Wilmer Valderrama (cast of That '70s Show), Dave Foley, Kevin McDonald, Scott Thompson (cast of The Kids in the Hall), Mike Vogel, Natasha Lyonne, Vincent Pastore, Miriam Flynn, Stephen Root, and Elizabeth Berridge (Kevin Corrigan's real-life wife).
Premise
The show, set in an Irish-Catholic neighborhood of Staten Island, New York, is about the comedic interplay of the Irish-American Catholic Finnerty family. One of the show's central aspects is that Sean and Claudia Finnerty had their first child and got married when they were 18 years old. Thus, although their most senior is a teenage daughter, the parents are relatively young and not complete with their "wild" years. (In an episode where Sean goes to fetch Lily from the police station and is mistaken for her drug dealer, his father quips, "That's what happens when you're 18 and don't know what a rubber is!") The show features an unusual style of storytelling, often starting with a scene at the end of the story or sometimes in the middle and filling in the gaps with flashbacks. Its main concepts are an Irish/Italian Catholic family with one daughter and two sons, surviving endless catastrophes, and utilizing flashbacks to explain each current situation further.
The opening sequence is set to a guitar theme, performed by the band Ween, that also serves as the music between scenes. The first sequence, used for the first 11 episodes of season 1, showed the family playing basketball. The twelfth episode ("Jimmy Was Kung-Fu Fighting") onwards showed a mix of scenes from Season 1. The sequence was updated each year to include scenes from the current season. The opening sequence was later truncated, as cast names were shown after the sequence, over the episode itself.
Music is essential in the production of the series, as musical cues introduce and conclude flashbacks. Episodes are also named after songs or are a play on song names or lyrics. Each episode has slightly different music in the opening sequence, differing at the end of the sequence.
Two episodes from Season 3, "Oh, What a Knight" and "Part-Time Lover," did not air on primetime, but can be seen in syndication on ABC Family.
Cast and c |
https://en.wikipedia.org/wiki/Adaptive%20coding | Adaptive coding refers to variants of entropy encoding methods of lossless data compression. They are particularly suited to streaming data, as they adapt to localized changes in the characteristics of the data, and don't require a first pass over the data to calculate a probability model. The cost paid for these advantages is that the encoder and decoder must be more complex to keep their states synchronized, and more computational power is needed to keep adapting the encoder/decoder state.
Almost all data compression methods involve the use of a model, a prediction of the composition of the data. When the data matches the prediction made by the model, the encoder can usually transmit the content of the data at a lower information cost, by making reference to the model.
This general statement is a bit misleading as general data compression algorithms would include the popular LZW and LZ77 algorithms,
which are hardly comparable to compression techniques typically called adaptive.
Run-length encoding and the typical JPEG compression with run length encoding and predefined Huffman codes do not transmit a model.
A lot of other methods adapt their model to the current file and need to transmit it in addition to the encoded data, because both the encoder and the decoder need to use the model.
In adaptive coding, the encoder and decoder are instead equipped with a predefined meta-model about how they will alter their models in response to the actual content of the data, and otherwise start with a blank slate, meaning that no initial model needs to be transmitted. As the data is transmitted, both encoder and decoder adapt their models, so that unless the character of the data changes radically, the model becomes better-adapted to the data it is handling and compresses it more efficiently approaching the efficiency of the static coding.
Adaptive method
Encoder
Initialize the data model as per agreement.
While there is more data to send
Encode the next symbol using the data model and send it.
Modify the data model based on the last symbol.
Decoder
Initialize the data model as per agreement.
While there is more data to receive
Decode the next symbol using the data model and output it.
Modify the data model based on the decoded symbol.
Any adaptive coding method has a corresponding static model method, in which the data model is precalculated and then transmitted with the data.
Static method
Encoder
Initialize the data model based on a first pass over the data.
Transmit the data model.
While there is more data to send
Encode the next symbol using the data model and send it.
Decoder
Receive the data model.
While there is more data to receive
Decode the next symbol using the data model and output it.
Examples
Adaptive image coding was used by the Cassini-Huygens craft to relay images from Saturn. Only about 5% of the images show any visual signs of damage. As the spacecraft has an error correcting Flash drive and long timeframes b |
https://en.wikipedia.org/wiki/Metro%20Blue%20Line%20%28Minnesota%29 | The Metro Blue Line is a light rail line in Hennepin County, Minnesota, that is part of the Metro network. It travels from downtown Minneapolis to Minneapolis–Saint Paul International Airport and the southern suburb of Bloomington. Formerly the Hiawatha Line (Route 55) prior to May 2013, the line was originally named after the Milwaukee Road's Hiawatha passenger train and Hiawatha Avenue, reusing infrastructure from the former and running parallel to the latter for a portion of the route. The line opened June 26, 2004, and was the first light rail service in Minnesota. An extension, Bottineau LRT, is planned to open in 2028.
The Blue Line is operated by Metro Transit, the primary bus and train operator in the Twin Cities. As of December 2022, the service operates from approximately 3:19am to 12:50am with 15minute headways most of the day. The route averaged 32,928 daily riders in 2019, representing 13 percent of Metro Transit's ridership. The line carried 10.6 million riders in 2015.
In South Minneapolis, several bus routes converge at transit centers along the line, offering connections to other Metro lines and frequent bus routes. The line has two park and ride stations at Fort Snelling and 30th Avenue stations, with a combined capacity of 2,569 vehicles. Major destinations along the corridor include downtown Minneapolis, Lake Street, Minnehaha Park, Minneapolis–St. Paul International Airport, and the Mall of America. At the airport, the Blue Line provides free, 24/7 service between Lindbergh and Humphrey terminals. An owl shuttle train, the Airport Shuttle, runs between terminals during times when no Blue Line service is scheduled.
History
Background
The Minneapolis–St. Paul area once had an extensive network of streetcars (operated for many years by Twin City Rapid Transit, a precursor of Metro Transit), but the tracks were removed and services were eliminated in the 1950s.
Over the years since the last trolley ran in 1954, many people have pushed for the reintroduction of rail transport in the Twin Cities. Proposals for a modern streetcar or light rail along the Hiawatha Avenue corridor appeared in the pages of the Star Tribune as early as 1974. The primary reason is that traffic congestion has grown considerably since the streetcar system ceased operation: a 2003 report by the Texas Transportation Institute indicated that the area was the 17th most congested area in the country, with the second fastest congestion growth.
Rail projects struggled to gain political support until the 1990s, when several factors combined to make the idea more palatable. Governor Jesse Ventura and Minnesota Transportation Commissioner Elwyn Tinklenberg heavily promoted the idea of rail transport, and significant amounts of money became available from the federal government. Previous governors had advocated light rail, but had not been able to get legislation passed. Governor Tim Pawlenty had campaigned on a promise to fight the expansion of light rail, but |
https://en.wikipedia.org/wiki/Chiclet%20keyboard | A chiclet keyboard is a computer keyboard with keys that form an array of small, flat rectangular or lozenge-shaped rubber or plastic keys that look like erasers or "Chiclets", a brand of chewing gum manufactured in the shape of small squares with rounded corners. It is an evolution of the membrane keyboard, using the same principle of a single rubber sheet with individual electrical switches underneath each key, but with the addition of an additional upper layer which provides superior tactile feedback through a buckling mechanism. The term "chiclet keyboard" is sometimes incorrectly used to refer to island keyboards.
Since the mid-1980s, chiclet keyboards have been mainly restricted to lower-end electronics, such as small handheld calculators, cheap PDAs and many remote controls, though the name is also used to refer to scissor keyboards with superficially similar appearance.
History
The term first appeared during the home computer era of the late 1970s to mid-1980s. The TRS-80 Color Computer, TRS-80 MC-10, and Timex Sinclair 2068 were all described as having "chiclet keys".
This style of keyboard has been met with a poor reception. John Dvorak wrote that it was "associated with $99 el cheapo computers". The keys on ZX Spectrum computers are "rubber dome keys" which were sometimes described as "dead flesh", while the feel of the IBM PCjr's chiclet keyboard was reportedly compared to "massaging fruit cake". Its quality was such that an amazed Tandy executive, whose company had previously released a computer with a similarly unpopular keyboard, asked "How could IBM have made that mistake with the PCjr?"
Design
Chiclet keyboards operate under essentially the same mechanism as in the membrane keyboard. In both cases, a keypress is registered when the top layer is forced through a hole to touch the bottom layer. For every key, the conductive traces on the bottom layer are normally separated by a non-conductive gap. Electrical current cannot flow between them; the switch is open. However, when pushed down, conductive material on the underside of the top layer bridges the gap between those traces; the switch is closed, current can flow, and a keypress is registered. All such keyboards are characterized by having each key surrounded (and held in place) by a perforated plate, so there is a space between the keys.
Unlike the membrane keyboard, where the user presses directly onto the top membrane layer, this form of chiclet keyboard places a set of moulded rubber keys above this. With some key designs, the user pushes the key, and under sufficient pressure the thin sides of the rubber key suddenly collapse. In other designs — such as that seen in the diagram — the deliberate weak point is where the key joins the rest of the sheet. The effect is similar in both cases. This collapse allows the solid rubber center to move downwards, forcing the top membrane layer against the bottom layer, and completing the circuit. The "sudden collapse" of the chi |
https://en.wikipedia.org/wiki/Project%20Athena | Project Athena was a joint project of MIT, Digital Equipment Corporation, and IBM to produce a campus-wide distributed computing environment for educational use. It was launched in 1983, and research and development ran until June 30, 1991. , Athena is still in production use at MIT. It works as software (currently a set of Debian packages) that makes a machine a thin client, that will download educational applications from the MIT servers on demand.
Project Athena was important in the early history of desktop and distributed computing. It created the X Window System, Kerberos, and Zephyr Notification Service. It influenced the development of thin computing, LDAP, Active Directory, and instant messaging.
Description
Leaders of the $50 million, five-year project at MIT included Michael Dertouzos, director of the Laboratory for Computer Science; Jerry Wilson, dean of the School of Engineering; and Joel Moses, head of the Electrical Engineering and Computer Science department. DEC agreed to contribute more than 300 terminals, 1600 microcomputers, 63 minicomputers, and five employees. IBM agreed to contribute 500 microcomputers, 500 workstations, software, five employees, and grant funding.
History
In 1979 Dertouzos proposed to university president Jerome Wiesner that the university network mainframe computers for student use. At that time MIT used computers throughout its research, but undergraduates did not use computers except in Course VI (computer science) classes. With no interest from the rest of the university, the School of Engineering in 1982 approached DEC for equipment for itself. President Paul E. Gray and the MIT Corporation wanted the project to benefit the rest of the university, and IBM agreed to donate equipment to MIT except to the engineering school.
Project Athena began in May 1983. Its initial goals were to:
Develop computer-based learning tools that are usable in multiple educational environments
Establish a base of knowledge for future decisions about educational computing
Create a computational environment supporting multiple hardware types
Encourage the sharing of ideas, code, data, and experience across MIT
The project intended to extend computer power into fields of study outside computer science and engineering, such as foreign languages, economics, and political science. To implement these goals, MIT decided to build a Unix-based distributed computing system. Unlike those at Carnegie Mellon University, which also received the IBM and DEC grants, students did not have to own their own computer; MIT built computer labs for their users, although the goal was to put networked computers into each dormitory. Students were required to learn FORTRAN and Lisp, and would have access to sophisticated graphical workstations, capable of 1 million instructions per second and with 1 megabyte of RAM and a 1 megapixel display.
Although IBM and DEC computers were hardware-incompatible, Athena's designers intended that software |
https://en.wikipedia.org/wiki/UTM | UTM may refer to:
Computing
Unified threat management, an approach to network security
Universal Turing machine, a theoretical computer
Urchin Tracking Module parameters, used in Urchin, a Web analytics package that served as the base for Google Analytics and other analytics
Usability testing method, in interaction design
Unbounded transactional memory, transactional memory without bounds on transaction size or time
Universeller Transaktionsmonitor, transaction system for Fujitsu-Siemens BS2000/OSD mainframe
Universities
Technical University of Moldova
Universiti Teknologi Malaysia, also known as University of Technology, Malaysia
University of Technology, Mauritius
University of Tennessee at Martin
University of Toronto Mississauga
University of Toulouse II – Le Mirail, France
Universidad Tecnológica de la Mixteca, the Spanish name of Mexican public university Technological University of the Mixteca
Technical University of Manabi, higher technical level university located in the city of Portoviejo, province of Manabí, Ecuador.
Other
Ultrasonic thickness measurement, using ultrasound waves to determine thickness of metals
Undergraduate Texts in Mathematics, a series of books published by Springer-Verlag
Universal testing machine, a machine used to test the tensile and compressive stresses in materials
Universal Transverse Mercator coordinate system, a grid-based method of mapping locations on the surface of the Earth
Unmanned aircraft system traffic management, a system for cooperative control of unmanned aerial vehicles
Union des travailleurs de Mauritanie (Union of Mauritanian Workers), a national trade union center in Mauritania
Uniunea Tineretului Muncitoresc (Union of Communist Youth), Romania's former communist youth party organisation |
https://en.wikipedia.org/wiki/UTS | UTS may refer to:
Computing
Unicode Technical Standard
Universal Time-Sharing System, an operating system for XDS Sigma computers
Amdahl UTS, a Unix operating system for IBM-compatible mainframes
Science and mechanical
Ultimate tensile strength of a material
Unified Thread Standard for screws
Untriseptium, an unsynthesized chemical element
Education
University of Technology Sydney, Australia
Unification Theological Seminary of the Unification Church, New York, US
Union Theological Seminary (Philippines), Protestant seminary
Union Theological Seminary in the City of New York, US
University of Toronto Schools, Canada
University Transit Service of the University of Virginia, US
Other uses
Uts (river), a river in Belarus
Huntsville Regional Airport in Huntsville, Texas (FAA ID)
Underground Ticketing System, as used in London Underground ticketing
Uner Tan syndrome
Ultimate Tennis Showdown
UTAS UTS-15, a Turkey Pump-action shotgun |
https://en.wikipedia.org/wiki/Ray%20casting | Ray casting is the methodological basis for 3D CAD/CAM solid modeling and image rendering. It is essentially the same as ray tracing for computer graphics where virtual light rays are "cast" or "traced" on their path from the focal point of a camera through each pixel in the camera sensor to determine what is visible along the ray in the 3D scene. The term "Ray Casting" was introduced by Scott Roth while at the General Motors Research Labs from 1978–1980. His paper, "Ray Casting for Modeling Solids", describes modeled solid objects by combining primitive solids, such as blocks and cylinders, using the set operators union (+), intersection (&), and difference (-). The general idea of using these binary operators for solid modeling is largely due to Voelcker and Requicha's geometric modelling group at the University of Rochester. See solid modeling for a broad overview of solid modeling methods. This figure on the right shows a U-Joint modeled from cylinders and blocks in a binary tree using Roth's ray casting system in 1979.
Before ray casting (and ray tracing), computer graphics algorithms projected surfaces or edges (e.g., lines) from the 3D world to the image plane where visibility logic had to be applied. The world-to-image plane projection is a 3D homogeneous coordinate system transformation (aka: 3D projection, affine transformation, or projective transform (Homography)). Rendering an image in that way is difficult to achieve with hidden surface/edge removal. Plus, silhouettes of curved surfaces have to be explicitly solved for whereas it is an implicit by-product of ray casting, so there is no need to explicitly solve for it whenever the view changes.
Ray casting greatly simplified image rendering of 3D objects and scenes because a line transforms to a line. So, instead of projecting curved edges and surfaces in the 3D scene to the 2D image plane, transformed lines (rays) are intersected with the objects in the scene. A homogeneous coordinate transformation is represented by 4x4 matrix. The mathematical technique is common to computer graphics and geometric modeling. A transform includes rotations around the three axes, independent scaling along the axes, translations in 3D, and even skewing. Transforms are easily concatenated via matrix arithmetic. For use with a 4x4 matrix, a point is represented by [X, Y, Z, 1] and a direction vector is represented by [Dx, Dy, Dz, 0]. (The fourth term is for translation and that does not apply to direction vectors.)
Concept
Ray casting is the most basic of many computer graphics rendering algorithms that use the geometric algorithm of ray tracing. Ray tracing-based rendering algorithms operate in image order to render three-dimensional scenes to two-dimensional images. Geometric rays are traced from the eye of the observer to sample the light (radiance) travelling toward the observer from the ray direction. The speed and simplicity of ray casting comes from computing the color of the light without r |
https://en.wikipedia.org/wiki/System%20X%20%28supercomputer%29 | System X (pronounced "System Ten") was a supercomputer assembled by Virginia Tech's Advanced Research Computing facility in the summer of 2003. Costing US$5.2 million, it was originally composed of 1,100 Apple Power Mac G5 computers with dual 2.0 GHz processors. System X was decommissioned on May 21, 2012.
System X ran at 12.25 Teraflops, (20.24 peak), and was ranked #3 on November 16, 2003 and #280 in the July 2008 edition of the TOP500 list of the world's most powerful supercomputers. The system used error-correcting (ECC) RAM, which is important for accuracy due to the rate of bits flipped by cosmic rays or other interference sources in its vast number of RAM chips.
Background
The supercomputer's name originates from the use of the Mac OS X operating system for each node, and because it was the first university computer to achieve 10 teraflops on the high performance LINPACK benchmark. The supercomputer is also known as Big Mac or Terascale Cluster. In 2003 it was also touted as "the world's most powerful and cheapest homebuilt supercomputer." System X was constructed with a relatively low budget of just $5.2 million, in the span of only three months, thanks in large part to using off-the-shelf Power Mac G5 computers. By comparison, the Earth Simulator, the fastest supercomputer at the time, cost approximately $400 million to build.
Upgrade to Server-Grade Parts
In 2004, Virginia Tech upgraded its computer to Apple's newly released, Xserve G5 servers. The upgraded version ranked #7 in the 2004 TOP500 list and its server-grade error-correcting memory solved the problem of cosmic ray interference. In October 2004, Virginia Tech partially rebuilt System X at a cost of about $600,000. These improvements brought the computer's speed up to 12.25 Teraflops, which placed System X #14 on the 2005 TOP500 list.
Similar Projects
Virginia Tech's system was the model for Xseed, a smaller system also made from Xserve servers and built by Bowie State University in Maryland. Xseed was ranked #166 in the 2005 TOP500.
System G has 324 Mac Pros (2592 processor cores) with QDR InfiniBand in Virginia Tech's Center for High-End Computing Systems.
See also
History of supercomputing
References
External links
Virginia Tech - System X (via Internet Archive)
CHECS Computing Resources: Experimental Facilities - System G, Production Computing Facilities - System X (via Internet Archive)
Virginia Tech - Advanced Research Computing
TOP500 website
Film about System X, YouTube
One-of-a-kind computers
Supercomputers
Virginia Tech |
https://en.wikipedia.org/wiki/Eser | Eser may refer to:
ESER, a German abbreviation for a Comecon computer standard
Eser (name)
Eser, an abbreviation (SR) commonly used in Russia around the times of the Russian Revolution for the members of Socialist-Revolutionary Party
A member of A Just Russia party, from the Russian-language initialism SR of the party name "Spravedlivaya Rossiya"
Eser (company), an international construction company from Ankara, Turkey, active over the Middle East, Central Asia, East Europe and North Africa |
https://en.wikipedia.org/wiki/WordWeb | WordWeb is an international English dictionary and thesaurus program for Microsoft Windows, iOS, Android and Mac OS X. It is partly based on the WordNet database.
Functions
WordWeb usually resides in the Windows' notification area. It can be activated by holding down CTRL and right-clicking a word in almost any program. This opens the WordWeb main window, with definitions. In addition to its dictionary and thesaurus features, it includes:
Phrase guessing – for example, CTRL + right-clicking 'Princeton' in 'Princeton University' shows the meaning of the combined entity rather than only 'Princeton'.
Words from pictures – CTRL + right-clicking a word within an image (for example, the 'Free' in the Wikipedia logo) asks WordWeb to guess the word.
Wordweb is used primarily by international students to find out meanings, improve their vocabulary and progress through academic life.
Information
The thesaurus is integrated into the dictionary. Under each definition, various related words are shown, including:
Synonyms
Antonyms
Hyponyms ('play' lists several sub-types of play, including 'passion play')
Hypernyms ('daisy' is listed as a type of 'flower')
Constituents (under 'forest', listed parts include 'tree' and 'underbrush')
Words describing things that might be thereby constituted
Similar words (words that are not synonyms, but are semantically similar; 'big' is listed as similar to 'huge')
Each shown word can be double-clicked to jump to its entry. WordWeb keeps a history of each session, allowing users to see their previously viewed entries.
Users can also actively improve the dictionary and thesaurus by submitting errors (such as missing words, phrases, or more senses for existing entries) and enhancement requests.
Wordweb is not a social platform in any way.
Versions
There are two WordWeb versions: the free version, which does not have the word list, search, anagram, or customization features; and the paid version, WordWeb Pro.
WordWeb 5 added the ability to list entries from three online sources: Wikipedia, Wiktionary, and WordWeb Online. These details appear in three separate tabs. Version 6 added audio pronunciations and support for third-party Oxford and Chambers add-on dictionaries.
WordWeb 7 was mainly a content upgrade, with revised definition and sound databases, but also had significantly updated one-click support for the latest browsers and 64-bit programs.
Other changes included updated audio pronunciations, improved one-click integration with other programs, better one-click 64-bit and Windows 8 program support, keyboard hotkeys for Bookmark menu items, and auto-detect support for the latest third-party Concise Oxford and Merriam-Webster dictionary add-ons.
As of version 7, WordWeb required Windows XP, Windows Vista, Windows 7, Windows 8, or Windows 10.
WordWeb 8 includes one-click and keyboard lookup, including in Mozilla Thunderbird and Firefox without browser plugins. Support for Windows XP was dropped.
Open |
https://en.wikipedia.org/wiki/Oberon-2 | Oberon-2 is an extension of the original Oberon programming language that adds limited reflection and object-oriented programming facilities, open arrays as pointer base types, read-only field export, and reintroduces the FOR loop from Modula-2.
It was developed in 1991 at ETH Zurich by Niklaus Wirth and Hanspeter Mössenböck, who is now at Institut für Systemsoftware (SSW) of the University of Linz, Austria. Oberon-2 is a superset of Oberon, is fully compatible with it, and was a redesign of Object Oberon.
Oberon-2 inherited limited reflection and single inheritance ("type extension") without the interfaces or mixins from Oberon, but added efficient virtual methods ("type bound procedures"). Method calls were resolved at runtime using C++-style virtual method tables.
Compared to fully object-oriented languages like Smalltalk, in Oberon-2, basic data types and classes are not objects, many operations are not methods, there is no message passing (it can be emulated somewhat by reflection and through message extension, as demonstrated in ETH Oberon), and polymorphism is limited to subclasses of a common class (no duck typing as in Python, and it's not possible to define interfaces as in Java). Oberon-2 does not support encapsulation at object or class level, but modules can be used for this purpose.
Reflection in Oberon-2 does not use metaobjects, but simply reads from type descriptors compiled into the executable binaries, and exposed in the modules that define the types and/or procedures. If the format of these structures are exposed at the language level (as is the case for ETH Oberon, for example), reflection could be implemented at the library level. It could thus be implemented almost entirely at library level, without changing the language code. Indeed, ETH Oberon makes use of language-level and library-level reflection abilities extensively.
Oberon-2 provides built-in runtime support for garbage collection similar to Java and performs bounds and array index checks, etc., that eliminate the potential stack and array bounds overwriting problems and manual memory management issues inherent in C and C++. Separate compiling using symbol files and namespaces via the module architecture ensure fast rebuilds since only modules with changed interfaces need to be recompiled.
The language Component Pascal is a refinement (a superset) of Oberon-2.
Example code
The following Oberon-2 code implements a simple binary tree:
MODULE Trees;
TYPE
Tree* = POINTER TO Node;
Node* = RECORD
name-: POINTER TO ARRAY OF CHAR;
left, right: Tree
END;
PROCEDURE (t: Tree) Insert* (name: ARRAY OF CHAR);
VAR p, father: Tree;
BEGIN p := t;
REPEAT father := p;
IF name = p.name^ THEN RETURN END;
IF name < p.name^ THEN p := p.left ELSE p := p.right END
UNTIL p = NIL;
NEW(p); p.left := NIL; p.right := NIL; NEW(p.name, LEN(name)+1); COPY(name, p.name^);
IF name < father.name^ THEN father.left := p ELSE fath |
https://en.wikipedia.org/wiki/Aviion | Aviion (styled AViiON) was a series of computers from Data General that were the company's main product from the late 1980s until the company's server products were discontinued in 2001. Earlier Aviion models used the Motorola 88000 CPU, but later models moved to an all-Intel solution when Motorola stopped work on the 88000 in the early 1990s. Some versions of these later Intel-based machines ran Windows NT, while higher-end machines ran the company's flavor of Unix, DG/UX.
History
Data General had, for most of its history, essentially mirrored the strategy of DEC with a competitive (but, in the spirit of the time, incompatible) minicomputer with a better price/performance ratio. However, by the 1980s, Data General was clearly in a downward spiral relative to DEC. With the performance of custom-designed minicomputer CPU's dropping relative to commodity microprocessors, the cost of developing a custom solution no longer paid for itself. A better solution was to use these same commodity processors, but put them together in such a way to offer better performance than a commodity machine could offer.
With Aviion, DG shifted its sight from a purely proprietary minicomputer line to the burgeoning Unix server market. The new line was based around the Motorola 88000, a high performance RISC processor with some support for multiprocessing and a particularly clean architecture. The machines ran a System V Unix variant known as DG/UX, largely developed at the company's Research Triangle Park facility. DG/UX had previously run on the company's family of Eclipse MV 32-bit minicomputers (the successors to Nova and the 16-bit Eclipse minis) but only in a very secondary role to the Eclipse MV mainstay AOS/VS and AOS/VS II operating systems. Also, some Aviion servers from this era ran the proprietary Meditech MAGIC operating system.
From February 1988 to October 1990, Robert E. Cousins was the Department Manager for workstation development. During this time they produced the Maverick project and several follow-ons including the 300, 310 and 400 series workstations along with the 4000 series servers.
Aviion were released in a variety of sizes beginning in the summer of 1989. They debuted as a pizza box workstation (codenamed "Maverick") and a server in both roller-mounted and rackmount flavors ("Topgun"). Speed-bumped and scaled-up versions followed, culminating in, first, the 16-CPU AV/9500 server and then the up to 32-way AV 10000 server in 1995, DG's first implementation of a Non-Uniform Memory Access (NUMA) design. Workstations remained part of the line for a time, but the emphasis increasingly shifted towards servers.
In 1992, Motorola joined the AIM alliance to develop "cut down" versions of the IBM POWER CPU design into a single-chip CPU for desktop machines, and eventually stopped further development of the 88000. Because of this, DG gave up working with Motorola, and decided instead to align its efforts with what was soon to become the clear winner i |
https://en.wikipedia.org/wiki/Run-length%20limited | Run-length limited or RLL coding is a line coding technique that is used to send arbitrary data over a communications channel with bandwidth limits. RLL codes are defined by four main parameters: m, n, d, k. The first two, m/n, refer to the rate of the code, while the remaining two specify the minimal d and maximal k number of zeroes between consecutive ones. This is used in both telecommunication and storage systems that move a medium past a fixed recording head.
Specifically, RLL bounds the length of stretches (runs) of repeated bits during which the signal does not change. If the runs are too long, clock recovery is difficult; if they are too short, the high frequencies might be attenuated by the communications channel. By modulating the data, RLL reduces the timing uncertainty in decoding the stored data, which would lead to the possible erroneous insertion or removal of bits when reading the data back. This mechanism ensures that the boundaries between bits can always be accurately found (preventing bit slip), while efficiently using the media to reliably store the maximal amount of data in a given space.
Early disk drives used very simple encoding schemes, such as RLL (0,1) FM code, followed by RLL (1,3) MFM code, which were widely used in hard disk drives until the mid-1980s and are still used in digital optical discs such as CD, DVD, MD, Hi-MD and Blu-ray. Higher-density RLL (2,7) and RLL (1,7) codes became the de facto industry standard for hard disks by the early 1990s.
Need for RLL coding
On a hard disk drive, information is represented by changes in the direction of the magnetic field on the disk, and on magnetic media, the playback output is proportional to the density of flux transition. In a computer, information is represented by the voltage on a wire. No voltage on the wire in relation to a defined ground level would be a binary zero, and a positive voltage on the wire in relation to ground represents a binary one. Magnetic media, on the other hand, always carries a magnetic flux either a "north" pole or a "south" pole. In order to convert the magnetic fields to binary data, some encoding method must be used to translate between the two.
One of the simplest practical codes, modified non-return-to-zero-inverted (NRZI), simply encodes a 1 as a magnetic polarity transition, also known as a "flux reversal", and a zero as no transition. With the disk spinning at a constant rate, each bit is given an equal time period, a "data window", for the magnetic signal that represents that bit, and the flux reversal, if any, occurs at the start of this window. (Note: older hard disks used one fixed length of time as the data window over the whole disk, but modern disks are more complicated; for more on this, see zoned bit recording.)
This method is not quite that simple, as the playback output is proportional to the density of ones, a long run of zeros means no playback output at all.
In a simple example, consider the binary pattern 101 |
https://en.wikipedia.org/wiki/RLL | RLL may refer to:
Run Length Limited, an encoding scheme for disk drives
Relay Ladder Logic, a programming language for industrial control
Radio Local Loop, same as Wireless Local Loop (WLL)
Rahal Letterman Lanigan Racing, an auto racing team in the WeatherTech SportsCar Championship
right lower lobe, see List of medical abbreviations: R |
https://en.wikipedia.org/wiki/Partial-response%20maximum-likelihood | In computer data storage, partial-response maximum-likelihood (PRML) is a method for recovering the digital data from the weak analog read-back signal picked up by the head of a magnetic disk drive or tape drive. PRML was introduced to recover data more reliably or at a greater areal-density than earlier simpler schemes such as peak-detection. These advances are important because most of the digital data in the world is stored using magnetic storage on hard disk or tape drives.
Ampex introduced PRML in a tape drive in 1984. IBM introduced PRML in a disk drive in 1990 and also coined the acronym PRML. Many advances have taken place since the initial introduction. Recent read/write channels operate at much higher data-rates, are fully adaptive, and, in particular, include the ability to handle nonlinear signal distortion and non-stationary, colored, data-dependent noise (PDNP or NPML).
Partial response refers to the fact that part of the response to an individual bit may occur at one sample instant while other parts fall in other sample instants. Maximum-likelihood refers to the detector finding the bit-pattern most likely to have been responsible for the read-back waveform.
Theoretical development
Partial-response was first proposed by Adam Lender in 1963. The method was generalized by Kretzmer in 1966. Kretzmer also classified the several different possible responses, for example, PR1 is duobinary and PR4 is the response used in the classical PRML. In 1970, Kobayashi and Tang recognized the value of PR4 for the magnetic recording channel.
Maximum-likelihood decoding using the eponymous Viterbi algorithm was proposed in 1967 by Andrew Viterbi as a means of decoding convolutional codes.
By 1971, Hisashi Kobayashi at IBM had recognized that the Viterbi algorithm could be applied to analog channels with inter-symbol interference and particularly to the use of PR4 in the context of Magnetic Recording (later called PRML). (The wide range of applications of the Viterbi algorithm is well described in a review paper by Dave Forney.) A simplified algorithm, based upon a difference metric, was used in the early implementations. This is due to Ferguson at Bell Labs.
Implementation in products
The first two implementations were in Tape (Ampex - 1984) and then in hard disk drives (IBM - 1990). Both are significant milestones with the Ampex implementation focused on very high data-rate for a digital instrumentation recorder and IBM focused on a high level of integration and low power consumption for a mass-market HDD. In both cases, the initial equalization to PR4 response was done with analog circuitry but the Viterbi algorithm was performed with digital logic. In the tape application, PRML superseded 'flat equalization'. In the HDD application, PRML superseded RLL codes with 'peak detection'.
Tape recording
The first implementation of PRML was shipped in 1984 in the Ampex Digital Cassette Recording System (DCRS). The chief engineer on |
https://en.wikipedia.org/wiki/MindVox | MindVox was an early Internet service provider in New York City. The service was referred to as "the Hells Angels of Cyberspace" — it was founded in 1991 by Bruce Fancher (Dead Lord) and Patrick Kroupa (Lord Digital), two former members of the Legion of Doom hacker group. The system was partially online by March 1992, and open to the public in November of that year.
MindVox was the second ISP in New York City. By the time the first MindVox test message was posted to Usenet in 1992, customers of the rival service, Panix, had made nearly 6,000 posts. The test message was apparently posted by the infamous Phiber Optik, who would have been waiting for a Manhattan grand jury indictment at the time for hacking activities.
The registration of the service's phantom.com domain, occurred on 14 February 1992.
Founding and early years
The distinctive logo shown to the left was the system's original ASCII art banner, appearing on the text-only service's dial-up login page. MindVox was originally accessible only through telnet, FTP and direct dial-up. Its existence predates the invention of SSH and widespread use of the World Wide Web by several years. In later years, MindVox was also accessible via the web.
The parent company, Phantom Access Technologies, Inc. took its name from a hacking program written by Kroupa during his early teens, called Phantom Access.
MindVox functioned both as a private BBS service, containing its own dedicated discussion groups, termed "conferences" — though usually referred to as "forums" by users — as well as a provider of internet and Usenet access. By 1994 the subscriber base was at around 3,000. In many ways MindVox was a harder, edgier, New York incarnation of the WELL, (a famous Northern Californian online community.) While users were drawn from all over the world, the majority lived in the New York City area, and members who met through the conferences often became acquainted in person, either on their own, or through what were termed "VoxMeats" (a formal gathering of members whose double entendre name was rumored to be well-earned.)
Prominent MindVox "evangelists" included sci-fi author Charles Platt, who wrote about MindVox for Wired Magazine and featured it within his book Anarchy Online. MindVox also attracted (sometimes with the aid of free accounts) artists, writers and activists including Billy Idol, Wil Wheaton, Robert Altman, Douglas Rushkoff, John Perry Barlow, and Kurt Cobain. The level of hysteria and hype surrounding MindVox was so great that in 1993 executives at MTV who were using the system wanted to buy it outright and turn MindVox into a subsidiary of Viacom.
"Voices in My Head"
MindVox was deeply connected to the emerging non-academic hacker culture and ideas about the potentials of cyberspace, as can be seen in Patrick Kroupa's essay, Voices in my Head, MindVox: The Overture, which announced the upcoming opening of MindVox, and crossed the line into shaping an entire culture's mythology, seeing p |
https://en.wikipedia.org/wiki/Ulrike%20Poppe | Ulrike Poppe (original name Ulrike Wick; born 26 January 1953 in Rostock, GDR) was a member of the East German opposition. In 1982 she founded the "Women for Peace" network and in 1985 joined the Initiative for Peace and Human Rights. In 1989 she joined Democracy Now.
Poppe was a victim of the Stasi's psychological warfare program.
In 1995 she was awarded the Order of Merit and in 2000 the Gustav Heinemann Prize.
Since 2001 she has been married to Claus Offe.
References
External links
Biography (in German) at Deutsches Historisches Museum
Andrew Curry: Piecing Together the Dark Legacy of East Germany's Secret Police Wired magazine 16.02, 18 January 2008
1953 births
Living people
People from Rostock
People from Bezirk Rostock
East German dissidents
East German women in politics
Recipients of the Cross of the Order of Merit of the Federal Republic of Germany |
https://en.wikipedia.org/wiki/Mission%20Control%20%28macOS%29 | Mission Control is a feature of the macOS operating system. Dashboard, Exposé, and Spaces were combined and renamed Mission Control in 2011 with the release of Mac OS X 10.7 Lion. Exposé was first previewed on June 23, 2003, at the Apple Worldwide Developers Conference as a feature of the then forthcoming Mac OS X 10.3 Panther.
Mission Control allows a user to do the following:
View all open application windows
View all open application windows of a specific application
Hide all application windows and show the desktop
Manage application windows across multiple monitors
Manage application windows across multiple virtual desktops
Usage
Exposé and Mission Control include three separate features for organizing windows and open applications:
All windows Shows all open and unhidden windows, and all virtual desktops, shrinking their appearance so they all fit on a single screen. On newer Mac keyboards, this is activated from the F3 key, or F9 on older keyboards. On Apple's Magic Mouse or multi-touch trackpads, this can be activated by pulling up on the trackpad with three or four fingers. Mission Control redesigned this feature extensively to show all running desktops.
Application windows Also called 'App Exposé'. Shows all open and minimized windows for the currently active application. During this mode, the user can choose a window to switch to by using mouse or keyboard, or cycle through windows of different applications by pressing the tab key. This can be activated by pulling down with three or four fingers on a trackpad, the F10 key on older keyboards, by pressing Control + F3 on newer Apple aluminium and MacBook keyboards, or by right-clicking the app's icon on the dock and selecting 'Show all windows'. On OS X Snow Leopard, App Exposé can be activated by clicking and holding the application's icon in the dock.
Desktop Moves all windows off the screen, with just the edges of the windows visible at the side of the screen, giving the user clear access to the desktop and any icons on it. This can be activated by pressing Command F3 on newer Apple aluminum and Macbook keyboards, the F11 key on older keyboards. On a trackpad, it can be selected by placing four fingers on the trackpad and pulling them away from each other.
In the first two cases, after Mission Control is activated, the user can select any window by clicking on it or selecting it with arrow keys and pressing Enter. Exposé then deactivates, leaving the selected window in the foreground. Using Apple Mighty Mouse, it is possible to select a window using the Scroll Ball, by scrolling in the direction of that window.
The keyboard shortcuts used for activating Exposé can be customized to be any of the function keys, the shift, control, option or command key, the fn key on Mac laptops, or even a mouse button on multiple-button mice (including Apple Mighty Mouse).
Different features of Mission Control can also be activated by moving the mouse to a 'hot corner' of the desktop. Th |
https://en.wikipedia.org/wiki/Qatar%20Airways | Qatar Airways Company Q.C.S.C. (, al-Qaṭariya), operating as Qatar Airways, is the flag carrier of Qatar. Headquartered in the Qatar Airways Tower in Doha, the airline operates a hub-and-spoke network, flying to over 150 international destinations across Africa, Asia, Europe, the Americas, and Oceania from its base at Hamad International Airport, using a fleet of more than 200 aircraft. Qatar Airways Group employs more than 43,000 people. The carrier has been a member of the Oneworld alliance since October 2013.
History
Origin
The State of Qatar was a joint-owner member of Gulf Air along with Oman, the UAE (only the Emirate of Abu Dhabi), and the Kingdom of Bahrain, until May 2002, following its withdrawal. It became the first country among the three to withdraw from the airline to solely focus on its own airline Qatar Airways, although it remained a member of the airline for six months after the government announced its complete withdrawal.
Foundation
Qatar Airways was established by the government of Qatar on November 22, 1993; operations started on January 20, 1994. Amman was first served in May 1994. In April 1995, the airline's CEO was the Sheikh Hamad Bin Ali Bin Jabor Al Thani who employed a staff of . By this time the fleet consisted of Airbus A310s that served a route network including Abu Dhabi, Bangkok, Cairo, Dubai, Khartoum, Kuwait, London, Madras, Manila, Muscat, Osaka, Sharjah, Taipei, Tokyo and Trivandrum. During , ex-All Nippon Airways Boeing 747s were bought from Boeing. The airline acquired a second-hand Boeing 747SP from Air Mauritius in 1996.
Services to Athens, Istanbul, Madras and Tunis were suspended in late 1996, whereas Calcutta and Muscat were removed from the route network in January and , respectively. Flights to London were launched during . The airline also took delivery of two second-hand 231-seater Airbus A300-600R aircraft on lease from Ansett Worldwide Aviation Services (AWAS) during the year; they replaced two Boeing 747s. The entering of these two A300s into the fleet also marked the introduction of a new logo. A A300-600R joined the fleet shortly afterwards, also on lease from AWAS. In July 1998 the carrier placed a firm order with Airbus for Airbus A320s, slated for delivery between and ; it also took options for more aircraft of the type. Also in 1998, the carrier struck a deal with Singapore Aircraft Leasing Enterprise (SALE) for the lease of Airbus A320s, with deliveries scheduled between February and April 1999; these latter aircraft were aimed at replacing the Boeing 727-200 Advanced fleet and to fill the capacity gap before the hand over of the first A320 from Airbus. The airline took delivery of the A320 powered by Aero Engines V2500 on lease from SALE in February 1999.
A A300-600R on lease from AWAS joined the fleet in April 2000. In October 2000, Qatar Airways ordered an International Aero Engines V2500-powered Airbus A319CJ and took an option for another aircraft of the type. The |
https://en.wikipedia.org/wiki/Wally%20Szczerbiak | Walter Robert "Wally" Szczerbiak Jr. ( ; born March 5, 1977) is an American former professional basketball player and current color analyst for the New York Knicks on MSG Network. He played 10 seasons for four teams in the National Basketball Association. Szczerbiak played college basketball for Miami (of Ohio) University and is one of five of the university's basketball players whose jerseys have been retired.
Early life
Wally Szczerbiak was born in Madrid, Spain, to Marilyn and Walt Szczerbiak, a former ABA player who helped lead Real Madrid to three FIBA European Champions Cup (now called EuroLeague) championships. During his time with Real Madrid, the elder Szczerbiak set a Spanish League single-game scoring record with 65 points. Wally Szczerbiak spent much of his childhood in Europe during his father's playing career, and he was taught to speak fluent Spanish and Italian.
When Walt Szczerbiak retired, he moved his family back to his native Long Island, New York. Wally Szczerbiak played basketball at Cold Spring Harbor High School in Cold Spring Harbor, New York. As a senior in the 1994–95 season, he averaged 36.6 points per game and 15.9 rebounds per game. He was named the winner of the Richard Sangler Award as Nassau County's outstanding boys' basketball player. Szczerbiak competed for the Long Island team in the 1994 Empire State Games. Despite his outstanding high school statistics, the small size of Szczerbiak's school did not win him the attention of East Coast college coaches, and he went unrecruited.
College career
During the fall of his high school senior year, Szczerbiak and his parents visited the Miami University campus in Oxford, Ohio. The following Monday, despite Walt's wishes for his son to wait before making a decision, Szczerbiak called coach Herb Sendek and committed to play for Miami of Ohio.
In his first two seasons at Miami of Ohio, Szczerbiak averaged 8.0 and 12.8 points per game, respectively. As a junior in 1997–98, he burst onto the scene as one of college basketball's leading scorers, averaging 24.4 points per game and earning first-team All-MAC honors despite missing several games with a broken right wrist.
In his senior season, Szczerbiak averaged 24.2 points per game and led the Redhawks to the Sweet 16 in the 1999 NCAA tournament as a #10 seed. Szczerbiak scored a career-high 43 points in a first-round win over #7 seed Washington. He followed that performance with 24 points in a second-round toppling of #2 seed Utah, leading the Redhawks to the Sweet 16. Despite Szczerbiak's 23-point performance, the team lost to Kentucky, 58–43. Miami finished the season with a record of 24–8.
Szczerbiak was named MAC Player of the Year, was honored as a first-team All-American by Basketball News and Sports Illustrated, and was selected as a second-team All-American by the Associated Press (AP).
Szczerbiak finished his college career as Miami of Ohio's second all-time leading scorer with 1,847 points. He earned a degre |
https://en.wikipedia.org/wiki/BS2 | BS2 may refer to:
NHK BS 2, a former TV channel
BS2, a BS postcode area for Bristol, England
BS2, a center drill bit size
BS/2, the original German name of the OS/2 operating system
BASIC Stamp 2, a microcontroller
Brave Saint Saturn, an American Christian rock band
Brigade Spéciale N°2, a group related to Geheime Feldpolizei, the German secret military police during World War II
Brilliance BS2, a car
BS 2, Specification and Sections of Tramway Rails and Fishplates, a British Standard
BS-II Bharat Stage emission standards in India
, a Brazilian bank
See also
BS-2A and BS-2B, a Yuri (satellite) |
https://en.wikipedia.org/wiki/The%20Coroner%27s%20Toolkit | The Coroner's Toolkit (or TCT) is a suite of free computer security programs by Dan Farmer and Wietse Venema for digital forensic analysis. The suite runs under several Unix-related operating systems: FreeBSD, OpenBSD, BSD/OS, SunOS/Solaris, Linux, and HP-UX. TCT is released under the terms of the IBM Public License.
Parts of TCT can be used to aid analysis of and data recovery from computer disasters.
TCT was superseded by The Sleuth Kit. Although TSK is only partially based on TCT, the authors of TCT have accepted it as official successor to TCT.
References
External links
Official home page
Feature: The Coroner's Toolkit
Frequently Asked Questions about The Coroner's Toolkit
Computer forensics
Unix security-related software
Hard disk software
Digital forensics software |
https://en.wikipedia.org/wiki/Fixed-point%20arithmetic | In computing, fixed-point is a method of representing fractional (non-integer) numbers by storing a fixed number of digits of their fractional part. Dollar amounts, for example, are often stored with exactly two fractional digits, representing the cents (1/100 of dollar). More generally, the term may refer to representing fractional values as integer multiples of some fixed small unit, e.g. a fractional amount of hours as an integer multiple of ten-minute intervals. Fixed-point number representation is often contrasted to the more complicated and computationally demanding floating-point representation.
In the fixed-point representation, the fraction is often expressed in the same number base as the integer part, but using negative powers of the base b. The most common variants are decimal (base 10) and binary (base 2). The latter is commonly known also as binary scaling. Thus, if n fraction digits are stored, the value will always be an integer multiple of b−n. Fixed-point representation can also be used to omit the low-order digits of integer values, e.g. when representing large dollar values as multiples of $1000.
When decimal fixed-point numbers are displayed for human reading, the fraction digits are usually separated from those of the integer part by a radix character (usually '.' in English, but ',' or some other symbol in many other languages). Internally, however, there is no separation, and the distinction between the two groups of digits is defined only by the programs that handle such numbers.
Fixed-point representation was the norm in mechanical calculators. Since most modern processors have fast floating-point unit (FPU), fixed-point representations are now used only in special situations, such as in low-cost embedded microprocessors and microcontrollers; in applications that demand high speed and/or low power consumption and/or small chip area, like image, video, and digital signal processing; or when their use is more natural for the problem. Examples of the latter are accounting of dollar amounts, when fractions of cents must be rounded to whole cents in strictly prescribed ways; and the evaluation of functions by table lookup.
Representation
A fixed-point representation of a fractional number is essentially an integer that is to be implicitly multiplied by a fixed scaling factor. For example, the value 1.23 can be stored in a variable as the integer value 1230 with implicit scaling factor of 1/1000 (meaning that the last 3 decimal digits are implicitly assumed to be a decimal fraction), and the value can be represented as 1230 with an implicit scaling factor of 1000 (with "minus 3" implied decimal fraction digits, that is, with 3 implicit zero digits at right). This representation allows standard integer arithmetic units to perform rational number calculations.
Negative values are usually represented in binary fixed-point format as a signed integer in two's complement representation with an implicit scaling factor a |
https://en.wikipedia.org/wiki/Key%20derivation%20function | In cryptography, a key derivation function (KDF) is a cryptographic algorithm that derives one or more secret keys from a secret value such as a master key, a password, or a passphrase using a pseudorandom function (which typically uses a cryptographic hash function or block cipher). KDFs can be used to stretch keys into longer keys or to obtain keys of a required format, such as converting a group element that is the result of a Diffie–Hellman key exchange into a symmetric key for use with AES. Keyed cryptographic hash functions are popular examples of pseudorandom functions used for key derivation.
History
The first deliberately slow (key stretching) password-based key derivation function was called "crypt" (or "crypt(3)" after its man page), and was invented by Robert Morris in 1978. It would encrypt a constant (zero), using the first 8 characters of the user's password as the key, by performing 25 iterations of a modified DES encryption algorithm (in which a 12-bit number read from the real-time computer clock is used to perturb the calculations). The resulting 64-bit number is encoded as 11 printable characters and then stored in the Unix password file. While it was a great advance at the time, increases in processor speeds since the PDP-11 era have made brute-force attacks against crypt feasible, and advances in storage have rendered the 12-bit salt inadequate. The crypt function's design also limits the user password to 8 characters, which limits the keyspace and makes strong passphrases impossible.
Although high throughput is a desirable property in general-purpose hash functions, the opposite is true in password security applications in which defending against brute-force cracking is a primary concern. The growing use of massively-parallel hardware such as GPUs, FPGAs, and even ASICs for brute-force cracking has made the selection of a suitable algorithms even more critical because the good algorithm should not only enforce a certain amount of computational cost not only on CPUs, but also resist the cost/performance advantages of modern massively-parallel platforms for such tasks. Various algorithms have been designed specifically for this purpose, including bcrypt, scrypt and, more recently, Lyra2 and Argon2 (the latter being the winner of the Password Hashing Competition). The large-scale Ashley Madison data breach in which roughly 36 million passwords hashes were stolen by attackers illustrated the importance of algorithm selection in securing passwords. Although bcrypt was employed to protect the hashes (making large scale brute-force cracking expensive and time-consuming), a significant portion of the accounts in the compromised data also contained a password hash based on the fast general-purpose MD5 algorithm, which made it possible for over 11 million of the passwords to be cracked in a matter of weeks.
In June 2017, The U.S. National Institute of Standards and Technology (NIST) issued a new revision of their digital authenti |
https://en.wikipedia.org/wiki/Craig%20Reynolds%20%28computer%20graphics%29 | Craig W. Reynolds (born March 15, 1953), is an artificial life and computer graphics expert, who created the Boids artificial life simulation in 1986. Reynolds worked on the film Tron (1982) as a scene programmer, and on Batman Returns (1992) as part of the video image crew. Reynolds won the 1998 Academy Scientific and Technical Award in recognition of "his pioneering contributions to the development of three-dimensional computer animation for motion picture production." He is the author of the OpenSteer library.
References
External links
Craig Reynolds' home page
OpenSteer
1953 births
People in information technology
Living people
Researchers of artificial life
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/Subgraph%20isomorphism%20problem | In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H.
Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete. However certain other cases of subgraph isomorphism may be solved in polynomial time.
Sometimes the name subgraph matching is also used for the same problem. This name puts emphasis on finding such a subgraph as opposed to the bare decision problem.
Decision problem and computational complexity
To prove subgraph isomorphism is NP-complete, it must be formulated as a decision problem. The input to the decision problem is a pair of graphs G and H. The answer to the problem is positive if H is isomorphic to a subgraph of G, and negative otherwise.
Formal question:
Let , be graphs. Is there a subgraph such that ? I. e., does there exist a bijection such that ?
The proof of subgraph isomorphism being NP-complete is simple and based on reduction of the clique problem, an NP-complete decision problem in which the input is a single graph G and a number k, and the question is whether G contains a complete subgraph with k vertices. To translate this to a subgraph isomorphism problem, simply let H be the complete graph Kk; then the answer to the subgraph isomorphism problem for G and H is equal to the answer to the clique problem for G and k. Since the clique problem is NP-complete, this polynomial-time many-one reduction shows that subgraph isomorphism is also NP-complete.
An alternative reduction from the Hamiltonian cycle problem translates a graph G which is to be tested for Hamiltonicity into the pair of graphs G and H, where H is a cycle having the same number of vertices as G. Because the Hamiltonian cycle problem is NP-complete even for planar graphs, this shows that subgraph isomorphism remains NP-complete even in the planar case.
Subgraph isomorphism is a generalization of the graph isomorphism problem, which asks whether G is isomorphic to H: the answer to the graph isomorphism problem is true if and only if G and H both have the same numbers of vertices and edges and the subgraph isomorphism problem for G and H is true. However the complexity-theoretic status of graph isomorphism remains an open question.
In the context of the Aanderaa–Karp–Rosenberg conjecture on the query complexity of monotone graph properties, showed that any subgraph isomorphism problem has query complexity Ω(n3/2); that is, solving the subgraph isomorphism requires an algorithm to check the presence or absence in the input of Ω(n3/2) different edges in the graph.
Algorithms
describes a recursive backtracking procedure for solving the subgraph isomorphism problem. Although its running time is, in general, exponential, it takes polynomial time for any fixed choice of H (wi |
https://en.wikipedia.org/wiki/GNOWSYS | GNOWSYS (Gnowledge Networking and Organizing system) is a specification for a generic distributed network based memory/knowledge management. It is developed as an application for developing and maintaining semantic web content. It is written in Python. It is implemented as a Django app. The GNOWSYS project was launched by Nagarjuna G. in 2001, while he was working at Homi Bhabha Centre for Science Education (HBCSE).
The memory of GNOWSYS is designed as a node-oriented space. A node is described by other nodes to which it has links. The nodes are organized and processed according to a complex data structure called the neighborhood.
Applications
The application can be used for web-based knowledge representation and content management projects, for developing structured knowledge bases, as a collaborative authoring tool, suitable for making electronic glossaries, dictionaries and encyclopedias, for managing large web sites or links, developing an online catalogue for a library of any thing including books, to make ontologies, classifying and networking any objects, etc. This tool is also intended to be used for an on-line tutoring system with dependency management between various concepts or software packages. For example, the dependency relations between Debian packages have been represented by the gnowledge portal .
Component Classes
The kernel is designed to provide support to persistently store highly granular nodes of knowledge representation like terms, predicates and very complex propositional systems like arguments, rules, axiomatic systems, loosely held paragraphs, and more complex structured and consistent compositions. All the component classes in GNOWSYS are classified according to complexity into three groups, where the first two groups are used to express all possible well formed formulae permissible in a first order logic.
Terms
‘Object’, ‘Object Type’ for declarative knowledge, ‘Event’, ‘Event Type’, for temporal objects, and ‘Meta Types’ for expressing upper ontology. The
objects in this group are essentially any thing about which the knowledge engineer intends to express and store in the knowledge base, i.e., they are the objects of discourse. The instances of these component classes can be stored with or without expressing ‘instance of’ or ‘sub-class of’ relations among them.
Predicates
This group consists of ‘Relation’, and ‘Relation Type’ for expressing declarative knowledge, and ‘Function’ and ‘Function Type’ for expressing procedural knowledge. This group is to express qualitative and quantitative relations among the various instances stored in the knowledge base. While instantiating the predicates can be characterized by their logical properties of relations, quantifiers and cardinality as monadic predicates
of these predicate objects.
Structures
‘System’, ‘Encapsulated Class’, ‘Program’, and ‘Process’, are other base classes for complex structures, which can be combined iteratively to produce more complex systems. Th |
https://en.wikipedia.org/wiki/Mimail | Mimail is a computer worm which first emerged in August 2003; it is transmitted via e-mail. Since its initial release, nearly two dozen variants of the original Mimail worm have appeared. The Mydoom worm, which emerged in January 2004, was initially believed to be a variant of Mimail. Mimail is written in the C programming language.
References
Computer worms |
https://en.wikipedia.org/wiki/Personal%20firewall | A personal firewall is an application which controls network traffic to and from a computer, permitting or denying communications based on a security policy. Typically it works as an application layer firewall.
A personal firewall differs from a conventional firewall in terms of scale. A personal firewall will usually protect only the computer on which it is installed, as compared to a conventional firewall which is normally installed on a designated interface between two or more networks, such as a router or proxy server. Hence, personal firewalls allow a security policy to be defined for individual computers, whereas a conventional firewall controls the policy between the networks that it connects.
The per-computer scope of personal firewalls is useful to protect machines that are moved across different networks. For example, a laptop computer may be used on a trusted intranet at a workplace where minimal protection is needed as a conventional firewall is already in place, and services that require open ports such as file and printer sharing are useful. The same laptop could be used at public Wi-Fi hotspots, where it may be necessary to decide the level of trust and reconfigure firewall settings to limit traffic to and from the computer. A firewall can be configured to allow different security policies for each network.
Unlike network firewalls, many personal firewalls are able to control network traffic allowed to programs on the secured computer. When an application attempts an outbound connection, the firewall may block it if blacklisted, or ask the user whether to blacklist it if it is not yet known. This protects against malware implemented as an executable program. Personal firewalls may also provide some level of intrusion detection, allowing the software to terminate or block connectivity where it suspects an intrusion is being attempted.
Features
Common personal firewall features:
Block or alert the user about all unauthorized inbound or outbound connection attempts.
Allows the user to control which programs can and cannot access the local network and/or Internet and provide the user with information about an application that makes a connection attempt.
Hide the computer from port scans by not responding to unsolicited network traffic.
Monitor applications that are listening for incoming connections.
Monitor and regulate all incoming and outgoing Internet users.
Prevent unwanted network traffic from locally installed applications.
Provide information about the destination server with which an application is attempting to communicate.
Track recent incoming events, outgoing events, and intrusion events to see who has accessed or tried to access your computer.
Blocks and prevents hacking attempt or attack from hackers.
Limitations
Firewalls help protecting internal network from hackers, However firewall do have some limitations.
If the system has been compromised by malware, spyware or similar software, these programs c |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.