source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/.tw | .tw is the Internet country code top-level domain (ccTLD) for Taiwan. The domain name is based on the ISO 3166-1 alpha-2 country code TW. The registry is maintained by the Taiwan Network Information Center (TWNIC), a Taiwanese non-profit organization appointed by the National Communications Commission (NCC) and the Ministry of Transportation and Communication. Since 1 March 2001, TWNIC has stopped allowing itself to sign up new domain names directly, instead allowing new registration through its contracted reseller registrars. , there are 17 registrars.
Registering .tw website domains
Internationalized ccTLDs
ICANN assigned two Internationalized country code top-level domains (IDN ccTLDs) for Taiwan on 25 June 2010:
: taiwan in traditional Chinese characters (DNS name: xn--kpry57d)
: taiwan in simplified Chinese characters (DNS name: xn--kprw13d)
Presently in November 2019, and since at least November 2015 (), the simplified suffix is a DNAME alias for the traditional suffix. As a result any subdomain of the traditional xn--kpry57d TLD automatically has a CNAME alias from the simplified xn--kprw13d TLD. The traditional suffix is in active use.
Second-Level Domains
Registrations under are possible in second-level space or under various domains as third-level domains:
: for educational and academic institutions
: for agencies of the Government of the Republic of China, operated by Taiwan
: for the Republic of China Armed Forces, operated by Taiwan
: for companies or firms (Taiwanese or foreign) registered under the laws of their country
: for network or telecommunications license holders
: for non-profit organizations (Taiwanese or foreign) established according to the laws of their country
: for individuals (must verify their identity by e-mail)
: unrestricted (but registrant must verify their identity by email), intended for gaming-related content
: unrestricted (but registrant must verify their identity by email), intended for online business-related content
: unrestricted (but registrant must verify their identity by email)
: unrestricted
Domain names in Chinese characters may also be registered at the second level. Furthermore, any registrant of a standard domain name who has chosen a domestic registrar may automatically get two more domain names in Chinese characters in the following second-level domains: 網路.tw, 組織.tw and 商業.tw. These second-level domains correspond to , and , respectively.
Statistics
As of March 2017, around 8.31％ of the .tw domains are served via secured HTTPS protocol, with the cPanel, Inc. Certification Authority being the most popular SSL certificate. Apache is the most popular web server, serving 47.60% of the .tw domains, followed by Microsoft-IIS serving 20.31% of the total .tw domains.
See also
.cn (China)
.jp (Japan)
.kr (South Korea)
References
External links
.TW Whois Service
IANA .tw whois information
List of registrars accredited by TWNIC
List of registrars accredited by N |
https://en.wikipedia.org/wiki/IBM%20eServer | IBM eServer was a family of computer servers from IBM. Announced in 2000, it combined the various IBM server brands (AS/400, Netfinity, RS/6000, S/390) under one brand. The various sub-brands were at the same time rebranded from:
IBM RS/6000 to IBM eServer pSeries, p for POWER
IBM AS/400 to IBM eServer iSeries, i for Integrated
IBM Netfinity to IBM eServer xSeries, x for eXtended architecture (with respect to "commodity" Intel-based servers)
IBM System/390 was replaced by the 64-bit IBM eServer zSeries, z for Zero downtime.
The RS/6000 SP supercomputer line was replaced by Blue Gene platform.
Discontinuation
In 2005, IBM announced a new brand, IBM System, as an umbrella for all IBM server and storage brands. The rebranding was completed in 2006 when the IBM xSeries became the IBM System x (later the Lenovo System x).
IBM eServer zSeries became IBM System z
IBM eServer pSeries became IBM System p
IBM eServer iSeries became IBM System i
IBM eServer xSeries became IBM System x (later Lenovo System x)
IBM TotalStorage became IBM Storage
IBM eServer BladeCenter became IBM BladeCenter
IBM eServer 1350 became IBM System Cluster 1350
References
External links
IBM servers
eServer
eServer
Ultra-dense servers |
https://en.wikipedia.org/wiki/APE%20tag | APE tags comprise one extant convention used to store information (metadata) about a given digital audio file. Each APE tag constitutes a discrete element that describes a single attribute of the file's contents.
Each consists of a key/value pair; the key is simply a label that names the attribute, such as , , , or , etc.), and associated with it is a corresponding value, namely, some information descriptive of this file, in terms of the attribute in question (e.g., for ). APE tags can be used with .ape-formatted recordings, as well as with sound files of other audio file formats.
Essence
A sound file, such as an .ape- or .mp3-formatted file, may, in addition to its payload audio data, also contain metadata that provide descriptive or statistical information about its audio content. When APE (v1) tags are used, they will appear at the end of the file, following the data; i.e., the digitized audio stream. Placing the tags at the end of the file, rather than at the beginning, can make expansion of the metadata simpler for programmers to code, but may add more wait time to the user experience for file loading and processing. APE field names ("keys") are character strings for which no rigid standard exists, nor is there a set list of keys nor of their allowable values.
Features
APE tags are more similar to Vorbis comments than ID3 tags. Like Vorbis comments, they are unstructured (key, value) pairs. However, unlike Vorbis comments, they do not allow for inter-key ordering. This is because they store a list of values for each key rather than one value per key.
APE values can be flagged as text, binary, or external types. This allows tag editing software to avoid incorrectly displaying binary values, such as an image of album cover art, in the form of unreadable text to users. In comparison, Vorbis comments do not have a flagging feature, so binary data cannot be easily stored in them (though this is by design).
APEv2 supports Unicode using UTF-8 for values. For keys, an ASCII subset (control characters from 0x00 to 0x1f are not allowed) must be used.
Versions
APEv1
The APEv1 tag was designed for the Monkey's Audio format. In MP3 files, the APE tag is stored at the very end of the file, with no inline declaration in the body of the file. The software handles the writing and access to the tag and does not interfere with the contents of the MP3.
APEv2
The Musepack format developer, Frank Klemm, extended the original APE tag format to add a header, allowing APE tags to be at the beginning of files and allowing metadata values to be Unicode rather than simply ASCII. Because of its simplicity and flexibility, APEv2 was adopted by the WavPack and OptimFROG formats as their primary tag format. Version 3.99 of the official Monkey's Audio software switched from using APEv1 to APEv2.
Media players such as Winamp, foobar2000, MusicBee support reading and writing of APEv2 tags in MP3 files. The tagging string APETAGEX signals the start of an APEv2 re |
https://en.wikipedia.org/wiki/Steve%20Gibson%20%28computer%20programmer%29 | Steven "Steve Tiberius" Gibson (born March 26, 1955) is an American software engineer, security researcher, and IT security proponent. In the early 1980s, he worked on light pen technology for use with Apple and Atari systems, and in 1985, founded Gibson Research Corporation, best known for its SpinRite software.
Early life
Gibson started working on computers as a teenager, and got his first computing job with Stanford University's artificial intelligence lab when he was 15 years old. He then studied electrical engineering and computer science at the University of California, Berkeley.
Career
Gibson was hired as a programmer for California Pacific Computer Company in 1980, where he worked on copy protection for the company's products. He then founded Gibson Laboratories in Laguna Hills, California, in 1981, which developed a light pen for the Apple II, Atari, and other platforms before going out of business in 1983.
In 1985, Gibson founded Gibson Research Corporation (GRC), a computer software development firm, and from 1986 to 1993, he wrote the "Tech Talk" column for InfoWorld magazine.
In 1999, Gibson created one of the first adware removal programs, which he called OptOut. In 2001, he predicted that Microsoft's implementation of the SOCK_RAW protocol in the initial release of Windows XP would lead to widespread chaos by making it easier for Windows XP users to create denial of service (DoS) attacks. That year, his company's website was brought down by DoS attacks which continued for two weeks. Gibson blogged about the attacks and his (ultimately successful) efforts to track down the hacker. Three years after the Windows XP release, Microsoft limited raw socket support in Service Pack 2.
In 2005, he launched a weekly podcast called Security Now with Leo Laporte on TWiT.tv, with its archives hosted on GRC's website.
In 2006, Gibson raised the possibility that the Windows Metafile vulnerability bug was actually a backdoor intentionally engineered into the system. A response by Microsoft, and by Mark Russinovich on Microsoft's Technet blog, stated that the bug appeared to be coding error and that Gibson's reasoning was based upon Microsoft's abort procedure documentation being misleading.
In 2013, he proposed SQRL as a way to simplify the process of authentication without the risk of revelation of information about the transaction to a third party.
GRC products
GRC has created a number of utilities, most of which are freeware.
DNS Benchmark, freeware that lets users test the performance of the domain name servers used by their internet service providers.
Securable, freeware to test whether a pre-Windows 7 computer is 64-bit compatible. It also tells the user whether Data Execution Prevention is enabled.
ShieldsUP, a free browser-based firewall testing service; one of the oldest available
SpinRite, a hard disk scanning and data recovery utility first released in 1988. the current version was 6.0, which was first released in 2004. Sp |
https://en.wikipedia.org/wiki/SUDAAN | SUDAAN is a proprietary statistical software package for the analysis of correlated data, including correlated data encountered in complex sample surveys. SUDAAN originated in 1972 at RTI International (the trade name of Research Triangle Institute). Individual commercial licenses are sold for $1,460 a year, or $3,450 permanently.
Current version
SUDAAN Release 11.0.3, released in May 2018, is a single program consisting of a family of thirteen analytic procedures used to analyze data from complex sample surveys and other observational and experimental studies involving repeated measures and cluster-correlated data. It provides estimates that account for complex design features of a study, including:
unequally weighted or unweighted data
stratification
with- or without-replacement designs
multistage and cluster designs
repeated measures
general cluster-correlation (e.g., correlation due to multiple measures taken from patients)
multiply imputed analysis variables
Example fields of use
SUDAAN enables the analysis of correlated data encountered in various fields of statistical research, including:
survey research (RDD/telephone studies, area sample designs, cluster and stratified designs, list sampling)
clinical trials (safety and efficacy data from multiple sites in multisite trials)
group or community randomized trials
observations on related family members
toxicology (observations on littermates)
multiple subjects within a cluster (patients within physician clinics or students within school classrooms)
social statistics
health outcomes research
longitudinal data analyses
repeated measures.
Strengths
SUDAAN's strength lies in its ability to compute standard errors of ratio estimates, means, totals, regression coefficients, and other statistics in accordance with the sample design, greatly increasing the accuracy and validity of results. Many, if not most, data sets require attention to correlation and weighting, but few statistical software packages offer the user the opportunity to specify how data are correlated and weighted. For many years, SUDAAN remained the only broadly applicable software for analysis of correlated and weighted data. Currently Mplus offers similar capacities for a much broader set of models.
Currently, all nine of SUDAAN's analytic procedures offer three popular robust variance estimation methods:
Taylor series linearization (generalized estimation equations [GEE] for regression models)
jackknife (with or without user-specified replicate weights)
balance repeated replication (BRR).
Operating systems
SUDAAN functions on many computing platforms—including Windows 7/10, DOS, and LINUX—either as a stand-alone statistical software tool, or in SAS-callable format (SAS Version 9).
External links
SUDAAN home page
Mplus Complex Survey Data Project
Statistical software
Proprietary commercial software for Linux |
https://en.wikipedia.org/wiki/Random%20early%20detection | Random early detection (RED), also known as random early discard or random early drop, is a queuing discipline for a network scheduler suited for congestion avoidance.
In the conventional tail drop algorithm, a router or other network component buffers as many packets as it can, and simply drops the ones it cannot buffer. If buffers are constantly full, the network is congested. Tail drop distributes buffer space unfairly among traffic flows. Tail drop can also lead to TCP global synchronization as all TCP connections "hold back" simultaneously, and then step forward simultaneously. Networks become under-utilized and flooded—alternately, in waves.
RED addresses these issues by pre-emptively dropping packets before the buffer becomes completely full. It uses predictive models to decide which packets to drop. It was invented in the early 1990s by Sally Floyd and Van Jacobson.
Operation
RED monitors the average queue size and drops (or marks when used in conjunction with ECN) packets based on statistical probabilities. If the buffer is almost empty, then all incoming packets are accepted. As the queue grows, the probability for dropping an incoming packet grows too. When the buffer is full, the probability has reached 1 and all incoming packets are dropped.
RED is more fair than tail drop, in the sense that it does not possess a bias against bursty traffic that uses only a small portion of the bandwidth. The more a host transmits, the more likely it is that its packets are dropped as the probability of a host's packet being dropped is proportional to the amount of data it has in a queue. Early detection helps avoid TCP global synchronization.
Problems with classic RED
According to Van Jacobson, "there are not one, but two bugs in classic RED." Improvements to the algorithm were developed, and a draft paper was prepared, but the paper was never published, and the improvements were not widely disseminated or implemented. There has been some work in trying to finish off the research and fix the bugs.
Pure RED does not accommodate quality of service (QoS) differentiation. Weighted RED (WRED) and RED with In and Out (RIO) provide early detection with QoS considerations.
Other variants
WRED
In weighted RED you can have different probabilities for different priorities (IP precedence, DSCP) and/or queues.
ARED
The adaptive RED or active RED (ARED) algorithm infers whether to make RED more or less aggressive based on the observation of the average queue length. If the average queue length oscillates around min threshold then early detection is too aggressive. On the other hand, if the average queue length oscillates around max threshold then early detection is being too conservative. The algorithm changes the probability according to how aggressively it senses it has been discarding traffic.
See Srikant for an in-depth account on these techniques and their analysis.
RRED
Robust random early detection (RRED) algorithm was proposed to improve |
https://en.wikipedia.org/wiki/CNC%20wood%20router | A CNC wood router is a CNC router tool that creates objects from wood. CNC stands for computer numerical control. The CNC works on the Cartesian coordinate system (X, Y, Z) for 3D motion control. Parts of a project can be designed in the computer with a CAD/CAM program, and then cut automatically using a router or other cutters to produce a finished part.
The CNC router is ideal for hobbies, engineering prototyping, product development, art, and production work.
Operation
A CNC wood router uses CNC (computer numerical control) and is similar to a metal CNC mill with the following differences:
The wood router typically spins faster — with a range of 13,000 to 24,000 RPM
Professional quality machines frequently use surface facing tools up to 3" in diameter or more, and spindle power from 5 to 15 horsepower. Machines capable of routing heavy material at over a thousand inches per minute are common.
Some machines use smaller toolholders MK2 (Morse taper #2 - on older machines), ISO-30, HSK-63 or the tools just get held in a collet tool holder affixed directly to the spindle nose. ISO-30 and HSK-63 are rapid-change toolholding systems. HSK-63 has begun to supplant the ISO-30 as the rapid change standard in recent years.
A wood router is controlled in the same way as a metal mill, but there are CAM and CAD applications such as Artcam, Mastercam, Bobcad, and AlphaCam, which are specifically designed for use with wood routers.
Wood routers are frequently used to machine other soft materials such as plastics.
Typical three-axis CNC wood routers are generally much bigger than their metal shop counterparts. 5' x 5', 4' x 8', and 5' x 10' are typical bed sizes for wood routers. They can be built to accommodate very large sizes up to, but not limited to 12' x 100'. The table can move, allowing for true three axis (xyz) motion, or the gantry can move, which requires the third axis to be controlled by two slaved servo motors.
Advantages
The advantages of CNC wood router (compared to general machine) as follows,
High degree of automation
Consistent quality
High productivity
Processing complex shape
Easy to implement CAD/CAM
2D, 2.5D and 3D capable
Components
Separate heads
Some wood routers have multiple separate heads that can come down simultaneously or not. Some routers have multiple heads that can run complete separate programs on separate tables all while being controlled by the same interface.
Dust collection / vacuum collector
The wood router typically has 6"-10" air ducts to suck up the wood chips and dust created. They can be piped to a stand-alone or full shop dust collection system.
Some wood routers are specialized for cabinetry and have many drills that can be programmed to come down separately or together. The drills are generally spaced 32 mm apart on centres - a spacing system called 32 mm System. This is for the proper spacing of shelving for cabinets. Drilling can be vertical or horizontal (in the Y or X axis from eit |
https://en.wikipedia.org/wiki/GNU%20Scientific%20Library | The GNU Scientific Library (or GSL) is a software library for numerical computations in applied mathematics and science. The GSL is written in C; wrappers are available for other programming languages. The GSL is part of the GNU Project and is distributed under the GNU General Public License.
Project history
The GSL project was initiated in 1996 by physicists Mark Galassi and James Theiler of Los Alamos National Laboratory. They aimed at writing a modern replacement for widely used but somewhat outdated Fortran libraries such as Netlib. They carried out the overall design and wrote early modules; with that ready they recruited other scientists to contribute.
The "overall development of the library and the design and implementation of the major modules" was carried out by Brian Gough and Gerard Jungman. Other major contributors were Jim Davies, Reid Priedhorsky, M. Booth, and F. Rossi.
Version 1.0 was released in 2001. In the following years, the library expanded only slowly; as the documentation stated, the maintainers were more interested in stability than in additional functionality. Major version 1 ended with release 1.16 of July 2013; this was the only public activity in the three years 2012–2014.
Vigorous development resumed with publication of version 2.0 in October 2015. The latest version 2.7 was released in June 2021.
Example
The following example program calculates the value of the Bessel function of the first kind and order zero for 5:
#include <stdio.h>
#include <gsl/gsl_sf_bessel.h>
int main(void)
{
double x = 5.0;
double y = gsl_sf_bessel_J0(x);
printf("J0(%g) = %.18e\n", x, y);
return 0;
}
The example program has to be linked to the GSL library
upon compilation:
$ gcc $(gsl-config --cflags) example.c $(gsl-config --libs)
The output is shown below and should be correct to double-precision accuracy:
J0(5) = -1.775967713143382920e-01
Features
The software library provides facilities for:
Programming-language bindings
Since the GSL is written in C, it is straightforward to provide wrappers for other programming languages. Such wrappers currently exist for
AMPL
C++
Fortran
Haskell
Java
Julia
Common Lisp
OCaml
Octave
Perl Data Language
Python
R
Ruby
Rust
C++ support
The GSL can be used in C++ classes, but not using pointers to member functions, because the type of pointer to member function is different from pointer to function. Instead, pointers to static functions have to be used. Another common workaround is using a functor.
C++ wrappers for GSL are available. Not all of these are regularly maintained. They do offer access to matrix and vector classes without having to use GSL's interface to malloc and free functions. Some also offer support for also creating workspaces that behave like Smart pointer classes. Finally, there is (limited, as of April 2020) support for allowing the user to create classes to represent a parameterised function as a functor.
While not strictly wrappers, there are som |
https://en.wikipedia.org/wiki/British%20Rail%20Class%20365 | The British Rail Class 365 Networker Express was a class of dual-voltage ( and 750 V DC) electric multiple-unit passenger train built by ABB at Holgate Road Carriage Works in 1994 and 1995.
The Class 365 was derived from the EMU after the planned "Universal Networker" Classes 371 and 381 were not funded through to production. An initial prototype that better suited the operation of long-distance services was developed from an existing unit (designated as Class 465/3), as the new type was intended to operate services in South East England and on the Great Northern Route. The purchase of 41 Class 365s was authorised in late 1993; they would be the last trains to be built at the Holgate Road works prior to its closure. Due to the front end of refurbished units resembling a smiling face, the trains have been nicknamed "Happy Trains" by enthusiasts.
Deliveries began in 1994 under Network SouthEast and continued after operations transferred to the private sector; the final unit was delivered to West Anglia Great Northern (WAGN) in July 1998. Connex South Eastern received 16 units while West Anglia Great Northern received 25. During 2004, South Eastern Trains opted to transfer all of its sets to WAGN.
The Class 365 has been involved in several accidents, which has included fatalities; the most serious accident to date occurred at Potters Bar in 2002. In September 2014, all units were transferred with the Thameslink, Southern & Great Northern franchise to Govia Thameslink Railway. In June 2018, ten sets were transferred to Abellio ScotRail to operate services from Edinburgh to Glasgow and Stirling. On 15 May 2021, Great Northern withdrew the last of its Class 365 sets. During July 2021, all of the Class 365s were acquired by Eversholt Rail Group; all but 3 vehicles have been scrapped. Newer types of rolling stock, such as the Class 385s and Class 387s, have typically been introduced to replace the type with various operators.
Background
In the early 1990s, the Networker family was entering large-scale service in the Network SouthEast sector – both third-rail 'Networker' EMUs (/) and 'Network Turbo' DMUs (/) were in service, with proposals for others, including a so-called "Universal Networker", intended as Classes 371 and 381, that would have dual-voltage capability. However, by 1992, no work had been done in the development of these due to a lack of funding, so a replacement plan was required. For this, the Class 465 was modified for longer-distance services – a prototype was converted from an existing unit (designated as Class 465/3) to determine suitability, before funding was authorised during late 1993 for the purchase of 41 dual-voltage EMUs, each of four cars. These became the Class 365. Network SouthEast had successfully advocated in favour of the Class 365 project to secure investment from the British government; however, this came at the expense of competing proposals, including InterCity's envisioned InterCity 250 series of high speed tr |
https://en.wikipedia.org/wiki/Instruction%20scheduling | In computer science, instruction scheduling is a compiler optimization used to improve instruction-level parallelism, which improves performance on machines with instruction pipelines. Put more simply, it tries to do the following without changing the meaning of the code:
Avoid pipeline stalls by rearranging the order of instructions.
Avoid illegal or semantically ambiguous operations (typically involving subtle instruction pipeline timing issues or non-interlocked resources).
The pipeline stalls can be caused by structural hazards (processor resource limit), data hazards (output of one instruction needed by another instruction) and control hazards (branching).
Data hazards
Instruction scheduling is typically done on a single basic block. In order to determine whether rearranging the block's instructions in a certain way preserves the behavior of that block, we need the concept of a data dependency. There are three types of dependencies, which also happen to be the three data hazards:
Read after Write (RAW or "True"): Instruction 1 writes a value used later by Instruction 2. Instruction 1 must come first, or Instruction 2 will read the old value instead of the new.
Write after Read (WAR or "Anti"): Instruction 1 reads a location that is later overwritten by Instruction 2. Instruction 1 must come first, or it will read the new value instead of the old.
Write after Write (WAW or "Output"): Two instructions both write the same location. They must occur in their original order.
Technically, there is a fourth type, Read after Read (RAR or "Input"): Both instructions read the same location. Input dependence does not constrain the execution order of two statements, but it is useful in scalar replacement of array elements.
To make sure we respect the three types of dependencies, we construct a dependency graph, which is a directed graph where each vertex is an instruction and there is an edge from I1 to I2 if I1 must come before I2 due to a dependency. If loop-carried dependencies are left out, the dependency graph is a directed acyclic graph. Then, any topological sort of this graph is a valid instruction schedule. The edges of the graph are usually labelled with the latency of the dependence. This is the number of clock cycles that needs to elapse before the pipeline can proceed with the target instruction without stalling.
Algorithms
The simplest algorithm to find a topological sort is frequently used and is known as list scheduling. Conceptually, it repeatedly selects a source of the dependency graph, appends it to the current instruction schedule and removes it from the graph. This may cause other vertices to be sources, which will then also be considered for scheduling. The algorithm terminates if the graph is empty.
To arrive at a good schedule, stalls should be prevented. This is determined by the choice of the next instruction to be scheduled. A number of heuristics are in common use:
The processor resources used by the already |
https://en.wikipedia.org/wiki/Apple%20Productivity%20Experience%20Group | Apple Productivity Experience Group (known as APEX) is an operating unit of Microsoft that, as of 2009, is the largest software developer outside of Apple Inc. for the macOS and iOS operating systems. Formed as Macintosh Business Unit on January 7, 1997, it was initially composed of over 100 individuals from the existing cross platform Word, Excel, and PowerPoint teams in Microsoft's Office Division, and grew to 180 people the next year, with the addition of the Internet Explorer for Mac and Outlook Express for Mac teams. In 2000, it moved from the Office Division to the Specialized Devices and Applications Group inside the Entertainment and Devices Division, and is now back inside the Microsoft Office division.
History
Prior to the creation of the Mac BU, Microsoft had developed Macintosh software, starting in 1984 with Word 1.0 for Macintosh. During the early and mid 1990s, Microsoft's Word, Excel, and Powerpoint teams simultaneously developed Windows and Macintosh versions of these applications, but after releasing Office 97 for Windows, Microsoft decided, in January 1997, to form a separate Macintosh Business Unit to focus on creating applications optimized for the Macintosh platform. In August 1997, as part of a broader partnership agreement with Apple, Microsoft committed to continue developing and supporting Macintosh software for at least 5 more years, renewing this pledge on January 10, 2006 at the Macworld Conference & Expo. Ben Waldman was the Mac BU's founder and first General Manager (GM), serving from its inception in January 1997 through January 2000, when he was succeeded by Kevin Browne, who served through December 18, 2002, and Roz Ho, who served from December 18, 2002 to June 8, 2007; after that, Craig Eisler became the GM. In October 2008, Eisler was tapped by Robbie Bach to lead all Entertainment Client efforts, and Eric Wilfred became the GM of MacBU.
Software
APEX develops macOS and iOS versions of Microsoft Office and OneNote. Previously developed software by the Mac BU include Internet Explorer (development ceased in 2003), Virtual PC, and the MSN for Mac OS X browser (cancelled May 31, 2005).
References
External links
Microsoft divisions
Macintosh software companies
1997 establishments in Washington (state)
Companies based in Redmond, Washington
Software companies established in 1997 |
https://en.wikipedia.org/wiki/Geoff%20Crammond | Geoff Crammond is a computer game designer and programmer who specialises in motor racing games. A former defence industry systems engineer, he claims to have had little interest in motor racing before programming his first racing game (Revs) back in 1984, but he holds a physics degree, which may explain the realism of some of his programming. As a consequence of that project he became a big fan of Formula One motor racing. At the end of the 80s, this interest, plus the ever improving capabilities of home computers, inspired him to specialise in programming Formula One racing simulations.
Games
One of his early releases was Aviator, a Spitfire simulator released by Acornsoft for the BBC Micro in March 1984. Having been motivated to make his own flight simulator from the hardware level upwards, Crammond identified the possibility of using one of the increasingly sophisticated home computers, if only "to cannibalise it". Recognising the potential of the BBC Micro, he ordered one in 1981 and, upon receiving it six months later, then set about familiarising himself with the system, taking a detour to produce a Space Invaders clone, Super Invaders, which was accepted for publication and sold by Acornsoft. Discussion with Acornsoft about his plans for making a flight simulator led to the Aviator concept, and the program itself was written in a period of nine months.
Although displayed in only four colours and has few of the features of modern simulators for more powerful computers, Aviator was of unparalleled quality at the time of its release, with a realistic flight model that included g-forces that could tear the wings off in a dive. This would be accompanied by a continuous high pitched beep. The wings could be restored by removing the physical pressure on the airframe which was causing the flight envelope to be exceeded. Generally, this could be achieved by returning the joystick to a neutral centre position. The landscape was crudely rendered, and was basically a plane. Some scenic features were drawn as vector graphics, including low hills, fields, a lake, a suspension bridge over a river, and a small town which comprised a cluster of three buildings. Bonus points could be earned for flying under the bridge or along the main street of the town at a lower altitude than the buildings. Double points were earned for performing these stunts upside down. The game also had a shoot-'em-up mode in which alien vessels were seeded in the fields, feeding on the crops and growing until they could become airborne, at which point they headed for the town. The player could destroy the aliens on the ground as they fed, or (for reduced points) tackle them in the air (the aliens were agile but could not return fire). If an alien reached the town, the game was lost. A minor bug permitted the plane to be landed upside down without consequence, so long as the landing gear had been deployed.
Although better known for his Formula One simulation games on the PC and |
https://en.wikipedia.org/wiki/System%20bus | A system bus is a single computer bus that connects the major components of a computer system,
combining the functions of a data bus to carry information, an address bus to determine where it should be sent or read from, and a control bus to determine its operation. The technique was developed to reduce costs and improve modularity, and although popular in the 1970s and 1980s, more modern computers use a variety of separate buses adapted to more specific needs.
The system level bus (as distinct from a CPU's internal datapath busses) connects the CPU to memory and I/O devices.
Typically a system level bus is designed for use as a backplane.
Background scenario
Many of the computers were based on the First Draft of a Report on the EDVAC report published in 1945. In what became known as the Von Neumann architecture, a central control unit and arithmetic logic unit (ALU, which he called the central arithmetic part) were combined with computer memory and input and output functions to form a stored program computer. The Report presented a general organization and theoretical model of the computer, however, not the implementation of that model.
Soon designs integrated the control unit and ALU into what became known as the central processing unit (CPU).
Computers in the 1950s and 1960s were generally constructed in an ad-hoc fashion.
For example, the CPU, memory, and input/output units were each one or more cabinets connected by cables. Engineers used the common techniques of standardized bundles of wires and extended the concept as backplanes were used to hold printed circuit boards in these early machines.
The name "bus" was already used for "bus bars" that carried electrical power to the various parts of electric machines, including early mechanical calculators.
The advent of integrated circuits vastly reduced the size of each computer unit, and buses became more standardized.
Standard modules could be interconnected in more uniform ways and were easier to develop and maintain.
Description
To provide even more modularity with reduced cost, memory and I/O buses (and the required control and power buses) were sometimes combined into a single unified system bus.
Modularity and cost became important as computers became small enough to fit in a single cabinet (and customers expected similar price reductions).
Digital Equipment Corporation (DEC) further reduced cost for mass-produced minicomputers, and memory-mapped I/O into the memory bus, so that the devices appeared to be memory locations. This was implemented in the Unibus of the PDP-11 around 1969, eliminating the need for a separate I/O bus.
Even computers such as the PDP-8 without memory-mapped I/O were soon implemented with a system bus, which allowed modules to be plugged into any slot.
Some authors called this a new streamlined "model" of computer architecture.
Many early microcomputers (with a CPU generally on a single integrated circuit) were built with a single system bus, starting wi |
https://en.wikipedia.org/wiki/.vn | .vn is the country code top-level domain (ccTLD) for Vietnam.
The domain name registry for .vn is the Vietnam Internet Network Information Center (VNNIC).
In 2003, the company Dot VN, Inc. signed an agreement with the VNNIC allowing it to market the .vn domain name abroad.
Nowadays, a .vn domain name can be registered from all over the world via a worldwide .vn accredited registrar system.
The number of national domain name ".vn" surpassed 500,000 domains, ranked first in Southeast Asia & ASEAN and ranked TOP 10 in the Asia-Pacific region in terms of number of domain names maintained in use.
.vn domain names with 1 or 2 characters are registered through an auction.
There are 43 1-character .vn domain names, including: 36 domain names with a plain ASCII character (a, b, c, .. .x, y, z, 0, 1, 2, 3, .. 7, 8 , 9.vn) and 7 domain names with a Vietnam-specific character (â, ă, đ, ê, ô, ơ, ư.vn). There are 1296 2-character domain names with a combination of ASCII characters (a0, a1, a2, ..., z7, z8, z9.vn).
History
In 1994, Rob Hurle was one of the first people to think of and register the .vn TLD for Vietnam instead of using the .au (Australia) TLD. VNPT managed the DNS servers and the .vn TLD.
In 2000, VNPT transferred the DNS server and the .vn TLD to the Vietnam Internet Network Information Center (VNNIC), which was established by the Vietnamese government.
In 2003, Dot VN, Inc. signed a contract with VNNIC allowing the company to market .vn domain names abroad.
Second-level domains
The .vn domain name may be registered as a ccTLD or country code second-level domain (ccSLD). Below is a list of ccSLDs under the .vn domain name.
References
External links
IANA .vn whois information
Country code top-level domains
Internet properties established in 1994
Internet in Vietnam
sv:Toppdomän#V |
https://en.wikipedia.org/wiki/Mutator%20method | In computer science, a mutator method is a method used to control changes to a variable. They are also widely known as setter methods. Often a setter is accompanied by a getter, which returns the value of the private member variable. They are also known collectively as accessors.
The mutator method is most often used in object-oriented programming, in keeping with the principle of encapsulation. According to this principle, member variables of a class are made private to hide and protect them from other code, and can only be modified by a public member function (the mutator method), which takes the desired new value as a parameter, optionally validates it, and modifies the private member variable. Mutator methods can be compared to assignment operator overloading but they typically appear at different levels of the object hierarchy.
Mutator methods may also be used in non-object-oriented environments. In this case, a reference to the variable to be modified is passed to the mutator, along with the new value. In this scenario, the compiler cannot restrict code from bypassing the mutator method and changing the variable directly. The responsibility falls to the developers to ensure the variable is only modified through the mutator method and not modified directly.
In programming languages that support them, properties offer a convenient alternative without giving up the utility of encapsulation.
In the examples below, a fully implemented mutator method can also validate the input data or take further action such as triggering an event.
Implications
The alternative to defining mutator and accessor methods, or property blocks, is to give the instance variable some visibility other than private and access it directly from outside the objects. Much finer control of access rights can be defined using mutators and accessors. For example, a parameter may be made read-only simply by defining an accessor but not a mutator. The visibility of the two methods may be different; it is often useful for the accessor to be public while the mutator remains protected, package-private or internal.
The block where the mutator is defined provides an opportunity for validation or preprocessing of incoming data. If all external access is guaranteed to come through the mutator, then these steps cannot be bypassed. For example, if a date is represented by separate private year, month and day variables, then incoming dates can be split by the setDate mutator while for consistency the same private instance variables are accessed by setYear and setMonth. In all cases month values outside of 1 - 12 can be rejected by the same code.
Accessors conversely allow for synthesis of useful data representations from internal variables while keeping their structure encapsulated and hidden from outside modules. A monetary getAmount accessor may build a string from a numeric variable with the number of decimal places defined by a hidden currency parameter.
Modern programming langua |
https://en.wikipedia.org/wiki/Tera%20Computer%20Company | The Tera Computer Company was a manufacturer of high-performance computing software and hardware, founded in 1987 in Washington, D.C., and moved 1988 to Seattle, Washington, by James Rottsolk and Burton Smith. The company's first supercomputer product, named MTA, featured interleaved multi-threading, i.e. a barrel processor. It also had no data cache, relying instead on switching between threads for latency tolerance, and used a deeply pipelined memory system to handle many simultaneous requests, with address randomization to avoid memory hot spots.
Upon acquiring the Cray Research division of Silicon Graphics in 2000, the company was renamed to Cray Inc.
See also
Heterogeneous Element Processor
References
Software companies based in Seattle
Computer companies established in 1987
Computer companies disestablished in 2000
Software companies established in 1987
Silicon Graphics
Defunct software companies of the United States
Defunct computer companies of the United States |
https://en.wikipedia.org/wiki/Z39.50 | Z39.50 is an international standard client–server, application layer communications protocol for searching and retrieving information from a database over a TCP/IP computer network, developed and maintained by the Library of Congress. It is covered by ANSI/NISO standard Z39.50, and ISO standard 23950.
Z39.50 is widely used in library environments, for interlibrary catalogue search and loan, often incorporated into integrated library systems and personal bibliographic reference software, and social media such as LibraryThing.
Work on the Z39.50 protocol began in the 1970s, and led to successive versions in 1988, 1992, 1995 and 2003. The Contextual Query Language (formerly called the Common Query Language) is based on Z39.50 semantics.
Search syntax
The protocol supports search, retrieval, sort, and browse. Search queries contain attributes, typically from the bib-1 attribute set which defines six attributes to specify information searches on the server computer: use, relation, position, structure, truncation, completeness. The syntax of Z39.50 allows for very complex queries.
In practice, the functional complexity is limited by the uneven implementations by developers and commercial vendors. The syntax of Z39.50 is abstracted from the underlying database structure. For example, if the client specifies an author search using attribute 1003, the server must determine how to map that search to the indexes it contains. This allows Z39.50 queries to be formulated without knowing anything about the target database, but it also means that results for the same query can vary widely among different servers. One server may have an author index and another may use its index of personal names, whether they are authors or not. A third may have no name index and fall back on its keyword index, and yet another may have no suitable index and return an error.
An attempt to remedy the inconsistency is the Bath Profile (named after Bath, England, where the working group first met in 1999). This document rigidly specifies the search syntax to employ for common bibliographic searches, and the expected response of Bath-compliant servers. Implementation of the Bath Profile has been slow but is gradually improving the Z39.50 landscape. The Bath Profile is maintained by Library and Archives Canada.
Modernization efforts
Z39.50 is a pre-Web technology, and various working groups are attempting to update it to fit better into the modern environment. These attempts fall under the designation ZING (Z39.50 International: Next Generation), and pursue various strategies.
The successors to Z39.50 are the twin protocols SRU/SRW (Search/Retrieve via URL/Search/Retrieve Web service), which drop the Z39.50 communications protocol (replacing it with HTTP) while still attempting to preserve the benefits of the query syntax. SRU is REST-based, and enables queries to be expressed in URL query strings; SRW uses SOAP. Both expect search results to be returned as XML.
These proj |
https://en.wikipedia.org/wiki/Panda%20Security | Panda Security is a Spanish cybersecurity software company. Panda Security's core offering is antivirus software and more recently has expanded into providing and developing cybersecurity software. This includes security products and services for both businesses and home users, as well as protection tools for systems, networks, emails, and other private information. Panda Security employs around 458 people.
Overview
In 2005, Panda Security was the fourth largest antivirus vendor worldwide, with 3.2% of the marketplace. In November 2015 OPSWAT measured Panda Security's market share to be 3.6%. The company, whose shares were previously 100% held by Mikel Urizarbarrena, announced on April 24, 2007, the sale of 75% of its shares to Southern European investment group Investindustrial and private equity firm Gala Capital. On 30 July 2007, the company changed its name from Panda Software to Panda Security and Urizarbarrena was replaced by Jorge Dinares. Almost one year later, on 3 June 2008, amidst flagging sales, the board of directors voted to replace Dinares with Juan Santana, the CEO. Santana resigned in September 2011 and was replaced by José Sancho as acting CEO.
Panda Security was rated in Jan 2018 by Gartner analysts as an Endpoint Protection Visionary. Technological milestones include its launch of security systems, such as the SaaS concept (Security as a Service) or antivirus solutions that provide protection from the cloud (cloud computing) and are based on what Panda calls Collective Intelligence, a security model Panda introduced on the market in 2007. According to its CEO, the main benefit this security model provides is that it allows automatic scanning of threats instead of the manual scans carried out by other companies.
The firm has subsidiaries in the US, Italy, Switzerland, Germany, Austria, Belgium, the Netherlands, France, the UK, Sweden, Finland, Spain, and Japan. Additionally, it has franchises in another 44 countries. The US subsidiary moved its headquarters to Orlando, Florida in 2009.
In late 2009, Panda Security created a partnership with Web of Trust to help fight against the war on viruses.
Panda was previously embroiled in a lawsuit with one of its channel partners, External Technologies, Inc. In 2013, Panda prevailed in this lawsuit, recovering a judgment in excess of $100,000 and prevailing on all claims asserted by External against Panda. On 3 August 2010, a new office location in Menlo Park, California was publicly announced by Panda's CEO via his Twitter account.
In 2012, the firm was the tenth largest antivirus vendor worldwide, with 2.0% of the marketplace.
In March 2020, Seattle-based network security firm WatchGuard announced that they entered into an agreement to acquire Panda Security.
Products
TruPrevent, which was introduced in 2003, is the firm's technology for proactive protection. It offers generic protection against many of the techniques used by new malware, with policies and rules that are deve |
https://en.wikipedia.org/wiki/LinuxTV | The LinuxTV project is an informal group of volunteers who develop software regarding digital television for the Linux kernel-based operating systems. The community develops and maintains the Digital Video Broadcasting (DVB) driver subsystem which is part of the Linux kernel since version 2.6.x. The Linux kernel and the LinuxTV CVS include a fair number of drivers for commonly available PCI cards and USB devices, but the DVB subsystem core is also targeted towards set-top boxes which run some (embedded) Linux.
The LinuxTV project was originally initiated by the Berlin, Germany based company Convergence Integrated Media GmbH with the goal to distribute free and open source software for the production, distribution and reception of digital television. In 1998, the Convergence founders claimed that "Only the access to the source code of our future television sets will guarantee the independence of content and technology".
After some financial troubles, in 2002 Convergence had been taken over by the German set top box manufacturer Galaxis AG, and renamed to Convergence GmbH. Although both Convergence GmbH and Galaxis AG went bankrupt in 2005, the LinuxTV project lives on independently, being supported by the large developer community that had gathered around the project over the years.
Another significant Convergence development is DirectFB, a thin library that provides hardware graphics acceleration and windowing features for GTK+-based and other graphical Linux applications without the use of X.Org Server, and which its developers claim "adds graphical power to embedded systems".
See also
Tvheadend
Video4Linux
List of free television software
Digital television
References
External links
DVB-Wiki
Sunray Linux DVB receiver
Free television software
Set-top box
Software that uses GTK
Television organizations |
https://en.wikipedia.org/wiki/Franklin%20Electronic%20Publishers | Franklin Electronic Publishers, Incorporated (formerly Franklin Computer Corporation) is an American consumer electronics manufacturer based in Burlington, New Jersey, founded in 1981. Since the mid-1980s, it has primarily created and sold hand-held electronic references, such as spelling correctors, dictionaries, translation devices, medical references, and Bibles. It was publicly traded on the American Stock Exchange under the symbol FEP until September 30, 2009, when it merged with Saunders Acquisition Corporation.
Early history
Franklin was founded in 1981 by Barry Borden, Russell Bower, and Joel Shusterman as Franklin Computer Corporation. It manufactured clones of the Apple II series computer, which it first marketed in 1982.
In early 1982, Franklin released the Franklin ACE 100, and in March of the same year, the Franklin ACE 1000; they were very close copies of the Apple II and Apple II Plus computers, respectively. The motherboard design is nearly identical and Franklin also copied Apple's ROMs. Two months later, Apple Computer sued Franklin for copyright violation. Franklin initially won, but ultimately lost. (See Apple Computer, Inc. v. Franklin Computer Corp..)
Franklin followed with the ACE 1200, which included two built-in 5¼" floppy drives and an ACE 80 Zilog Z80 processor card (a rebranded PCPI Appli-Card) for CP/M compatibility—a popular third-party option for the Apple II. The ACE 1200 was identical to the ACE 1000, but with the addition of dual built-in floppy drives and four expansion cards pre-installed (one of which offered color video; the ACE 1000 was monochrome). At its peak workforce in 1983, Franklin employed 450 employees.
In August 1983, Franklin, a computer company, faced a legal ruling against its argument that computer code, being primarily in digital form, could not be copyrighted since it did not exist in printed form. Franklin openly acknowledged that it had copied Apple's ROM and operating system code. Despite this admission, Franklin obtained an injunction that allowed it to continue selling its computers. This significant case had long-lasting effects and established important legal precedents regarding copyright and reverse engineering. Even more than 30 years after the ruling in August 1983, the case continued to be frequently cited in legal discussions.
In June 1984, Franklin filed for reorganization under Chapter 11 of the Federal Bankruptcy Act. Franklin reduced its workforce to just over 100, from a previous total of 275 employees. Franklin had been planning to release the Franklin CX, a portable Apple II clone, but this release was cancelled due to the bankruptcy.
Starting in October 1985, Franklin released a second-generation line of Apple II clones, consisting of the ACE 2000 series (based on the Apple IIe) and ACE 500 (based on the Apple IIc). These included more memory, as well as offering many features unique to the Apple IIe and Apple IIc, all while undercutting Apple's price. The ACE 2200 |
https://en.wikipedia.org/wiki/Computer%20History%20Museum | The Computer History Museum (CHM) is a museum of computer history, located in Mountain View, California. The museum presents stories and artifacts of Silicon Valley and the information age, and explores the computing revolution and its impact on society.
History
The museum's origins date to 1968 when Gordon Bell began a quest for a historical collection and, at that same time, others were looking to preserve the Whirlwind computer. The resulting Museum Project had its first exhibit in 1975, located in a converted coat closet in a DEC lobby. In 1978, the museum, now The Digital Computer Museum (TDCM), moved to a larger DEC lobby in Marlborough, Massachusetts. Maurice Wilkes presented the first lecture at TDCM in 1979 – the presentation of such lectures has continued to the present time.
TDCM incorporated as The Computer Museum (TCM) in 1982. In 1984, TCM moved to Boston, locating on Museum Wharf.
In 1996/1997, the TCM History Center (TCMHC) was established; a site at Moffett Field was provided by NASA (an old building that was previously the Naval Base furniture store) and a large number of artifacts were shipped there from TCM.
In 1999, TCMHC incorporated and TCM ceased operation, shipping its remaining artifacts to TCMHC in 2000. The name TCM had been retained by the Boston Museum of Science so, in 2000, the name TCMHC was changed to Computer History Museum (CHM).
In 2002, CHM opened its new building, previously occupied by Silicon Graphics, at 1401 N. Shoreline Blvd in Mountain View, California, to the public. The facility was later heavily renovated and underwent a two-year $19 million makeover before reopening in January 2011.
John Hollar, a former media executive, was appointed CEO in July 2008. Dan'l Lewin, a former technology executive, replaced Hollar as CEO in March 2018.
Collections and exhibition space
The Computer History Museum claims to house the largest and most significant collection of computing artifacts in the world. This includes many rare or one-of-a-kind objects such as a Cray-1 supercomputer as well as a Cray-2, Cray-3, the Utah teapot, the 1969 Neiman Marcus Kitchen Computer, an Apple I, and an example of the first generation of Google's racks of custom-designed web servers. The collection comprises nearly 90,000 objects, photographs and films, as well as of cataloged documentation and several hundred gigabytes of software.
The CHM oral history program conducts video interviews around the history of computing, this includes computer systems, networking, data-processing, memory, and data-storage. There are over 1,000 interviews recorded as of 2021, including panel discussions on the origins of the IBM PC and the hard disk drive, and individual interviews with Joanna Hoffman, Steve Chen, Dame Stephanie Shirley, and Donald Knuth.
The museum's exhibit "Revolution: The First 2000 Years of Computing", opened to the public on January 13, 2011. It covers the history of computing in 20 galleries, from the abacus to t |
https://en.wikipedia.org/wiki/Wendy%20Venturini | Wendy Venturini (born January 30, 1979 in Chicago, Illinois) is an American reporter for the Performance Racing Network (PRN). She works as broadcaster for NASCAR Cup Series races and sometimes as a pit reporter for races on PRN. She had been a pit reporter in the NASCAR Craftsman Truck Series, and reporter for NASCAR RaceDay. Venturini is a 2000 graduate of the University of North Carolina at Chapel Hill.
In 2007, Venturini was one of the commentators for DirecTV's NASCAR Hot Pass coverage, making her the first female play-by-play announcer in auto racing history.
On August 29, 2014, Venturini was announced as the anchor for the 2014 Sylvania 300 NASRCAR Sprint Cup Series race for Performance Racing Network, becoming the first woman to serve such a position.
She is the daughter of two-time Automobile Racing Club of America (ARCA) Champion and multi-car owner Bill Venturini. Her older brother, Billy Venturini, is also an owner on the ARCA circuit.
Personal life
She is married to Jarrad Egert who serves as the director of engine track support for Joe Gibbs Racing's NASCAR Cup and Xfinity Series teams. They had their first child, Caleb James, on December 22, 2010.
On June 23, 2018, Venturini was struck by a vehicle while exercising near Sonoma Raceway in Northern California. She was transported to Marin General Hospital in Marin, California, where she was admitted to the intensive care unit. Doctors later diagnosed her with a skull fracture. Venturini returned to broadcasting in August of that same year.
References
External links
Speed Channel bio
Living people
1979 births
NASCAR people
Motorsport announcers
University of North Carolina at Chapel Hill alumni
American radio sports announcers
American television sports announcers
Women sports announcers |
https://en.wikipedia.org/wiki/Sargon%20%28chess%29 | Sargon (or SARGON) is a line of chess-playing software for personal computers. The original SARGON from 1978 was written in assembly language by Dan and Kathleen "Kathe" Spracklen for the Z80-based Wavemate Jupiter II.
History
SARGON was introduced at the 1978 West Coast Computer Faire where it won the first computer chess tournament held strictly for microcomputers, with a score of 5–0. This success encouraged the authors to seek financial income by selling the program directly to customers. Since magnetic media were not widely available at the time, the authors placed an advert in Byte magazine selling for $15 photocopied listings that would work in any Z80-based microcomputer. Availability of the source code allowed porting to other machines. For example, the March–April 1979 issue of Recreational Computing describes a project that converted Sargon to an 8080 program by using macros. Later the Spracklens were contacted by Hayden Books and a book was published.
Commercialization
When magnetic media publishing became widely available, a US Navy petty officer, Paul Lohnes, ported Sargon to the TRS-80, altering the graphics, input, and housekeeping routines but leaving the Spracklens' chess-playing algorithm intact. Paul consulted with the Spracklens, who were both living in San Diego at the time, to make the TRS-80 version an instant success with the help of Hayden Book's newly established software division: Hayden Software. Paul was not involved in further refinements to the TRS-80 version due to his reassignment to sea duty shortly after signing the deal with Hayden Software.
In the early 1980s, SARGON CHESS was ported to the Nascom (by Bits & PCs, 1981), Exidy Sorcerer, and Sharp MZ 80K. A complete rewrite was necessary later for the Apple II, programmed by Kathleen's brother Gary Shannon. Both were published by Hayden Software.
Improved versions
The Spracklens made significant improvements on the original program and released Sargon II. J. Mishcon reviewed Sargon II in the October 1980 issue of The Space Gamer magazine, stating that the program beat him regularly on level 5, which took 40 minutes per move. He often beat the program at level 3—when it considered moves for about two minutes—and stated that "Level 0 is an idiot but responds instantly".
Sargon 2.5, sold as a ROM module for the Chafitz Modular Game System, was identical to Sargon II but incorporated pondering. It received a 1641 rating at the Paul Masson tournament in June–July 1979, and 1736 at the San Jose City College Open in January 1980.
Sargon 3.0 finished in seventh place at the October 1979 North American Computer Chess Championship. The competition had improved, but 3.0 drew against Cray Blitz and easily defeated Mychess, its main microcomputer rival. In December, 3.0 easily won the second microcomputer championship in London.
Sargon III was a complete rewrite. Instead of an exchange evaluator, this version used a capture search algorithm. Also included was a che |
https://en.wikipedia.org/wiki/FreeMove | The FreeMove alliance is a business alliance of mobile telecommunications companies based in Europe.
History
The FreeMove alliance was established in 2003, combining the national network capabilities of four of Europe's largest national mobile operators: Deutsche Telecom, France Télécom (now Orange S.A.), Telefónica and Telecom Italia (TIM) for multinational customers.
Timeline
January 2020: Swisscom joined FreeMove in January 2020.
November 2017: BT joined FreeMove in November 2017.
September 2013 : Eir, the main Irish operator, joins FreeMove.
August 2011: FreeMove expands its presence into South East Europe with mobile telecommunications services providers Cosmote (Greece)
February 2011: FreeMove signs a partnership with leading Russian operator MegaFon.
November 2010: A key strategic partnership with T-Mobile US is announced to better support multinational corporations operating on both sides of the Atlantic.
October 2010: FreeMove and Turkcell announce their partnership.
March 2007: FreeMove and Bridge Alliance announce that the two organisations have signed a Memorandum of Understanding to pave the way for establishing an tight cooperation across their combined global footprint.
September 2006: Spanish operator Amena, part of the France Télécom group, joins FreeMove.
March 2006: TeliaSonera, the leading Nordic and Baltic operator, joins FreeMove.
January 2006: Telefónica leaves FreeMove as a condition of the acquisition of O2.
December 2003: FreeMove is formed with four leading European operators. Orange, Deutsche Telekom, Telecom Italia and Telefónica,
Membership
As of July 2020, FreeMove has four active members and one former member. Founding member Telefónica was required to end membership of FreeMove in order to acquire O2, with the European Commission citing competition concerns. The Commission were concerned non-FreeMove members would have to pay significantly more for roaming services in the UK, as three out of the four largest mobile network operators would have been members of the FreeMove alliance.
Partnerships
FreeMove has partnerships with several mobile telecommunication operators and alliances which provide services in territories not serviced by members. Partners have access to the FreeMove networks and FreeMove has access to the partner's network.
BT
BT joined FreeMove in November 2017. BT is one of the world’s leading communications services companies. BT serves the needs of customers in the UK and in 180 countries worldwide. Their main activities are the provision of fixed-line services, broadband, mobile and TV products and services as well as networked IT services.
Bridge Alliance
FreeMove has been co-operating with the Bridge Alliance since 2007. This partnership gas been extended in June 2017. Bridge covers over 800 million customers across 38 markets, ensuring that frequent travelers can use a suite of value-added services for roaming amongst member countries.
Swisscom
Swisscom joined FreeMo |
https://en.wikipedia.org/wiki/Delimiter-separated%20values | Formats that use delimiter-separated values (also DSV) store two-dimensional arrays of data by separating the values in each row with specific delimiter characters. Most database and spreadsheet programs are able to read or save data in a delimited format. Due to their wide support, DSV files can be used in data exchange among many applications.
A delimited text file is a text file used to store data, in which each line represents a single book, company, or other thing, and each line has fields separated by the delimiter.
Compared to the kind of flat file that uses spaces to force every field to the same width, a delimited file has the advantage of allowing field values of any length.
Delimited formats
Any character may be used to separate the values, but the most common delimiters are the comma, tab, and colon. The vertical bar (also referred to as pipe) and space are also sometimes used. Column headers are sometimes included as the first line, and each subsequent line is a row of data. The lines are separated by newlines.
For example, the following fields in each record are delimited by commas, and each record by newlines:
"Date","Pupil","Grade"
"25 May","Bloggs, Fred","C"
"25 May","Doe, Jane","B"
"15 July","Bloggs, Fred","A"
"15 April","Muniz, Alvin ""Hank""","A"
Note the use of the double quote to enclose each field. This prevents the comma in the actual field value (Bloggs, Fred; Doe, Jane; etc.) from being interpreted as a field separator. This necessitates a way to "escape" the field wrapper itself, in this case the double quote; it is customary to double the double quotes actually contained in a field as with those surrounding "Hank". In this way, any ASCII text including newlines can be contained in a field.
ASCII includes several control characters that are intended to be used as delimiters. They are: 28 for File Separator, 29 for Group Separator, 30 for Record Separator, and 31 for Unit Separator. Use of these characters has not achieved widespread adoption; some systems have replaced their control properties with more accepted controls such as CR/LF and TAB.
Uses and applications
Due to their widespread use, comma- and tab-delimited text files can be opened by several kinds of applications, including most spreadsheet programs and statistical packages, sometimes even without the user designating which delimiter has been used. Despite that each of those applications has its own database design and its own file format (for example, accdb or xlsx), they can all map the fields in a DSV file to their own data model and format.
Typically a delimited file format is indicated by a specification. Some specifications provide conventions for avoiding delimiter collision, others do not. Delimiter collision is a problem that occurs when a character that is intended as part of the data gets interpreted as a delimiter instead. Comma- and space-separated formats often suffer from this problem, since in many contexts those character |
https://en.wikipedia.org/wiki/Stop1984 | The founder of Stop1984 started the project in 2001 as NGO which is documented in the
community of Heise.de (German link).
The project was discontinued in early 2008.
Computer scientists disbelieve in lawfulness of the German decree of telecommunication control (German link)
Objectives of Stop1984
Stop1984 mostly tries to alert people with its website on:
the value of the own privacy
the value of the own data
the risks of data abuse
the consequences of the loss of privacy
the political, social and individual consequences of increasing surveillance
the dangers of political disinterest
The political objectives are:
publishing formerly unpublished numbers regarding the success oder failure of surveillance
that data privacy and the right of informational self-determination find a place in the Basic Constitutional Law in Germany and in European Law
Of course, this objectives can only be achieved by interested and committed people.
Supporters of Stop1984
Supporter of Stop1984 are:
Richard Stallman
Brad Templeton
Jacob Levich
Wolf-Dieter Roth
German Union for Privacy (http://www.datenschutzverein.de/ Website, German link)
Activities of Stop1984
Every month Stop1984 published a magazine in German that could be downloaded, "Lasst mich in Ruhe" (Don't bother me).
The satirical story about the German state with the title "Henry läuft" (Henry runs) (archived version) was published there as well. Stop1984 also signed a statement (archived) of Privacy International.
Every day, Stop1984 sent a German summary of news regarding privacy, data privacy, press freedom and similar via email to its subscribers.
See also
TCPA
Chaos Computer Club
ACLU
External links
217.172.182.26 - Reconstructed website of STOP1984 as of January 2007 by Corvus Corax (ex-webmaster)
Internet governance advocacy groups
Political organisations based in Germany |
https://en.wikipedia.org/wiki/VMX | VMX may refer to:
Computing
Virtual Machine Extensions, instructions on processors with x86 virtualization
AltiVec, a floating point and integer SIMD instruction set called VMX by IBM
vMX 3D, an Ethernet router in the Juniper MX-Series by Juniper Networks
.vmx, a filename extension for virtual machine configuration files used by VMware
Other uses
Vintage motocross
VMX (TalkTalk), an on-demand music television service
VMX (Voice Message Exchange), a voicemail company |
https://en.wikipedia.org/wiki/Atomic%20commit | In the field of computer science, an atomic commit is an operation that applies a set of distinct changes as a single operation. If the changes are applied, then the atomic commit is said to have succeeded. If there is a failure before the atomic commit can be completed, then all of the changes completed in the atomic commit are reversed. This ensures that the system is always left in a consistent state. The other key property of isolation comes from their nature as atomic operations. Isolation ensures that only one atomic commit is processed at a time. The most common uses of atomic commits are in database systems and version control systems.
The problem with atomic commits is that they require coordination between multiple systems. As computer networks are unreliable services, this means no algorithm can coordinate with all systems as proven in the Two Generals Problem. As databases become more and more distributed, this coordination will increase the difficulty of making truly atomic commits.
Usage
Atomic commits are essential for multi-step updates to data. This can be clearly shown in a simple example of a money transfer between two checking accounts.
This example is complicated by a transaction to check the balance of account Y during a transaction for transferring 100 dollars from account X to Y. To start, first 100 dollars is removed from account X. Second, 100 dollars is added to account Y. If the entire operation is not completed as one atomic commit, then several problems could occur. If the system fails in the middle of the operation, after removing the money from X and before adding into Y, then 100 dollars has just disappeared. Another issue is if the balance of Y is checked before the 100 dollars is added, the wrong balance for Y will be reported.
With atomic commits neither of these cases can happen, in the first case of the system failure, the atomic commit would be rolled back and the money returned to X. In the second case, the request of the balance of Y cannot occur until the atomic commit is fully completed.
Database systems
Atomic commits in database systems fulfil two of the key properties of ACID, atomicity and consistency. Consistency is only achieved if each change in the atomic commit is consistent.
As shown in the example atomic commits are critical to multistep operations in databases. Due to modern hardware design of the physical disk on which the database resides true atomic commits cannot exist. The smallest area that can be written to on disk is known as a sector. A single database entry may span several different sectors. Only one sector can be written at a time. This writing limit is why true atomic commits are not possible. After the database entries in memory have been modified they are queued up to be written to disk. This means the same problems identified in the example have reoccurred. Any algorithmic solution to this problem will still encounter the Two Generals’ Problem. The two-phase commit prot |
https://en.wikipedia.org/wiki/Exit%20status | In computing, the exit status, or exit code, of a terminated process is an integer number that is made available to its parent process (or caller). In DOS, this may be referred to as an errorlevel.
When computer programs are executed, the operating system creates an abstract entity called a process in which the book-keeping for that program is maintained. In multitasking operating systems such as Unix or Linux, new processes can be created by active processes. The process that spawns another is called a parent process, while those created are child processes. Child processes run concurrently with the parent process. The technique of spawning child processes is used to delegate some work to a child process when there is no reason to stop the execution of the parent. When the child finishes executing, it exits by calling the exit system call. This system call facilitates passing the exit status code back to the parent, which can retrieve this value using the wait system call.
Semantics
The parent and the child can have an understanding about the meaning of the exit statuses. For example, it is common programming practice for a child process to return (exit with) zero to the parent signifying success. Apart from this return value from the child, other information like how the process exited, either normally or by a signal may also be available to the parent process.
The specific set of codes returned is unique to the program that sets it. Typically it indicates success or failure. The value of the code returned by the function or program may indicate a specific cause of failure. On many systems, the higher the value, the more severe the cause of the error. Alternatively, each bit may indicate a different condition, with these being evaluated by the or operator together to give the final value; for example, fsck does this.
Sometimes, if the codes are designed with this purpose in mind, they can be used directly as a branch index upon return to the initiating program to avoid additional tests.
AmigaOS
In AmigaOS, MorphOS and AROS, four levels are defined:
OK 0
WARN 5
ERROR 10
FAILURE 20
Shell and scripts
Shell scripts typically execute commands and capture their exit statuses.
For the shell's purposes, a command which exits with a zero exit status has succeeded. A nonzero exit status indicates failure. This seemingly counter-intuitive scheme is used so there is one well-defined way to indicate success and a variety of ways to indicate various failure modes. When a command is terminated by a signal whose number is N, a shell sets the variable $? to a value greater than 128. Most shells use 128+N, while ksh93 uses 256+N.
If a command is not found, the shell should return a status of 127. If a command is found but is not executable, the return status should be 126. Note that this is not the case for all shells.
If a command fails because of an error during expansion or redirection, the exit status is greater than zero.
C language
The |
https://en.wikipedia.org/wiki/Language%20Of%20Temporal%20Ordering%20Specification | In computer science Language Of Temporal Ordering Specification (LOTOS) is a formal specification language based on temporal ordering of events. LOTOS is used for communications protocol specification in International Organization for Standardization (ISO) Open Systems Interconnection model (OSI) standards.
LOTOS is an algebraic language that consists of two parts: a part for the description of data and operations, based on abstract data types, and a part for the description of concurrent processes, based on process calculus.
Work on the standard was completed in 1988, and it was published as ISO 8807 in 1989. Between 1993 and 2001, an ISO committee worked to define a revised version of the LOTOS standard, which was published in 2001 as E-LOTOS.
See also
Formal methods
List of ISO standards
CADP
E-LOTOS
Process calculus
References
ISO/IEC international standard 8807:1989. Information Processing Systems - Open Systems Interconnection - LOTOS: A Formal Description Technique based on the Temporal Ordering of Observational Behaviour. Geneva, September 1989.
The Formal Description Technique LOTOS, P.H.J. van Eijk et al., editors, North-Holland, 1989.
LOTOSphere: Software Development with LOTOS, Tommaso Bolognesi, Jeroen van de Lagemaat, and Chris Vissers, editors, Kluwer Academic Publishers, 1995.
Hubert Garavel, Frédéric Lang, and Wendelin Serwe, From LOTOS to LNT. In Joost-Pieter Katoen, Rom Langerak, and Arend Rensink, editors, ModelEd, TestEd, TrustEd - Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday, vol. 10500 of Lecture Notes in Computer Science, pages 3–26, Springer International Publishing, October 2017, doi 10.1007/978-3-319-68270-9_1.
External links
World-wide Environment for Learning LOTOS (WELL)
Tutorials for LOTOS (see section 3)
LOTOS in the RKBExplorer
Process calculi
Formal methods
Formal specification languages
Concurrency (computer science)
Theoretical computer science
Concurrency control
Synchronization |
https://en.wikipedia.org/wiki/ZMODEM | ZMODEM is an inline file transfer protocol developed by Chuck Forsberg in 1986, in a project funded by Telenet in order to improve file transfers on their X.25 network. In addition to dramatically improved performance compared to older protocols, ZMODEM offered restartable transfers, auto-start by the sender, an expanded 32-bit CRC, and control character quoting supporting 8-bit clean transfers, allowing it to be used on networks that would not pass control characters.
In contrast to most transfer protocols developed for bulletin board systems (BBSs), ZMODEM was not directly based on, nor compatible with, the seminal XMODEM. Many variants of XMODEM had been developed in order to address one or more of its shortcomings, and most remained backward compatible and would successfully complete transfers with "classic" XMODEM implementations. This list includes Forsberg's own YMODEM.
ZMODEM eschewed backward compatibility in favor of producing a radically improved protocol. It performed as well or better than any of the high-performance varieties of XMODEM, did so over links that previously didn't work at all, like X.25, or had poor performance, like Telebit modems, and included useful features found in few or no other protocols. ZMODEM became extremely popular on bulletin board systems (BBS) in the early 1990s, becoming a standard as widespread as XMODEM had been before it.
Improvements
Streaming
Generally, file transfer protocols break down a file into a series of packets, and then send them one-at-a-time to the receiver. The main portion of the packet, the payload, is a certain number of bytes from the file being sent. After the payload comes a checksum or cyclic redundancy check (CRC) that can be used to determine if the payload was received correctly. If the packet is received correctly, the receiver sends an message and the sender then starts sending the next packet.
The telephone system introduces a small delay known as latency that interferes with this process. Even if the receiver sends the immediately, the delay in the phone lines means there will always be some time before the sender receives it and sends the next packet. As modem speeds increase, this delay represents a larger and larger number of packets that could have been sent during the delay, decreasing the channel efficiency.
XMODEM used 128-byte payloads with a three-byte header and one-byte checksum for a total of 132 bytes per packet. In the era of 300 bit/s modems, a packet took about four seconds to send, and typical latencies were on the order of of a second, so the performance overhead was not significant. As speeds increase the problem becomes more problematic; at 2400 bit/s a packet takes about to send, so about of the available bandwidth is wasted waiting for s. At 9600 bit/s a packet requires only 0.13 seconds to send, so about of the bandwidth is wasted.
One solution to this problem is the use of a sliding window. These protocols address latency by allowing t |
https://en.wikipedia.org/wiki/XMODEM | XMODEM is a simple file transfer protocol developed as a quick hack by Ward Christensen for use in his 1977 MODEM.ASM terminal program. It allowed users to transmit files between their computers when both sides used MODEM. Keith Petersen made a minor update to always turn on "quiet mode", and called the result XMODEM.
XMODEM, like most file transfer protocols, breaks up the original data into a series of "packets" that are sent to the receiver, along with additional information allowing the receiver to determine whether that packet was correctly received. If an error is detected, the receiver requests that the packet be re-sent. A string of bad packets causes the transfer to abort.
XMODEM became extremely popular in the early bulletin board system (BBS) market, largely because it was simple to implement. It was also fairly inefficient, and as modem speeds increased, this problem led to the development of a number of modified versions of XMODEM to improve performance or address other problems with the protocol. Christensen believed his original XMODEM to be "the single most modified program in computing history".
Chuck Forsberg collected a number of common modifications into his YMODEM protocol, but poor implementation led to a further fracturing before they were re-unified by his later ZMODEM protocol. ZMODEM became very popular, but never completely replaced XMODEM in the BBS market.
Packet structure
The original XMODEM used a 128-byte data packet, the basic block size used on CP/M floppy disks. The packet was prefixed by a simple 3-byte header containing a <SOH> character, a "block number" from 1-255, and the "inverse" block number—255 minus the block number. Block numbering starts with 1 for the first block sent, not 0. The header was followed by the 128 bytes of data, and then a single-byte checksum. The checksum was the sum of all 128 data bytes in the packet modulo 256. The complete packet was thus 132 bytes long, containing 128 bytes of payload data, for a total channel efficiency of about 97%.
The file was marked "complete" with a <EOT> character sent after the last block. This character was not in a packet, but sent alone as a single byte. Since the file length was not sent as part of the protocol, the last packet was padded out with a "known character" that could be dropped. In the original specification, this defaulted to <SUB> or 26 decimal, which CP/M used as the end-of-file marker inside its own disk format. The standard suggested any character could be used for padding, but there was no way for it to be changed within the protocol itself – if an implementation changed the padding character, only clients using the same implementation would correctly interpret the new padding character.
Transfer details
Files were transferred one packet at a time. When received, the packet's checksum was calculated by the receiver and compared to the one received from the sender at the end of the packet. If the two matched, the receiver sent |
https://en.wikipedia.org/wiki/YMODEM | YMODEM is a file transfer protocol used between microcomputers connected together using modems. It was primarily used to transfer files to and from bulletin board systems. YMODEM was developed by Chuck Forsberg as an expansion of XMODEM and was first implemented in his CP/M YAM program. Initially also known as YAM, it was formally given the name "YMODEM" in 1985 by Ward Christensen, author of the original XMODEM.
YMODEM extended XMODEM in three ways, combining features found in other extended XMODEM varieties. Like XMODEM-CRC, YMODEM replaced the 8-bit checksum with a 16-bit cyclic redundancy check (CRC), but made it the default form of correction instead of optional. From TeLink it added the "block 0" header that sent the filename and size, which allowed batch transfers (multiple files in a single session) and eliminated the need to add padding at the end of the file. Finally, YMODEM allowed the block size to be increased from the original 128 bytes of data to 1024, as in XMODEM-1k, which greatly improved throughput on faster modems.
Forsberg built the standard with all of these features as runtime options, allowing a single protocol driver to fall back to XMODEM-CRC or even XMODEM when connecting to non-YAM systems. He believed that programmers would want to implement as many of these features as possible on any given platform. He was dismayed to find that the majority of implementations were actually providing nothing more than 1k block size with CRC-16, failing to implement the "block 0" while continuing to use the YMODEM name. The result was the release of many mutually incompatible YMODEM implementations, and the use of the name YMODEM Batch to clearly indicate those versions that did support the complete standard.
Features
XMODEM
The original XMODEM was a very simple protocol and that is the reason for its success; it could be implemented on practically any machine of the era, even those with very limited processors and storage. It worked by breaking up the data to be sent into 128-byte packets, adding a 3-byte header and 1-byte checksum footer, and sending the resulting 132-byte packets out in order. The receiving computer recalculated the checksum from the 128 bytes of data, and if it matched the checksum sent in the footer it sent back an , and if it did not match, a . When the sender received an it sent the next packet, while a caused it to re-send the last one.
There were a number of problems with the protocol. The use of a simple checksum meant some common errors could go unnoticed. The small packet size and requirement to wait for the or led to slow performance on higher speed links or ones with significant latency. Finally, as the transfer contained no details of the file, every file had to be manually started, which could be a chore when many small files were being transferred.
Solutions to these problems were developed during the early 1980s. XMODEM-CRC replaced the checksum with a 16-bit cyclic redundancy check (CRC), |
https://en.wikipedia.org/wiki/Xpress%20Transport%20Protocol | Xpress Transport Protocol (XTP) is a transport layer protocol for high-speed networks promoted by the XTP Forum developed to replace TCP. XTP provides protocol options for error control, flow control, and rate control. Instead of separate protocols for each type of communication, XTP controls packet exchange patterns to produce different models, e.g. reliable datagrams, transactions, unreliable streams, and reliable multicast connections.
Long latency is one of the major problems in satellite communications. Couple this with possible environmental variables and sometimes asymmetrical bandwidth conditions, the quality of service in satellite communications is sometimes lacking. XTP addresses these issues in a variety of ways such as a Selective Retransmission algorithm that deals with loss recovery. This works by the receiver detecting missing data packets and transmitting a list of those missing packets to the sender, who then is able to quickly resend missing packets as needed. As stated, XTP also provides rate control in which the maximum bandwidth can be specified as well as what size burst data can be accepted. XTP also offers a reliable multicast protocol, and the flexibility to match any specific application needs.
XTP does not employ congestion avoidance algorithms. XTP is a real-time option at Layer 4 for the US Navy SAFENET LAN Profile.
See also
T/TCP
SCTP
References
Caini, C., Firrincieli, R., Marchese, M., de Cola, T., Luglio, M., Roseti, C., et al. (2006). Transport layer protocols and architectures for satellite networks. International Journal of Satellite Communications and Networking, 25, 1-26. Retrieved March 9, 2009 from http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.73.7647&rep=rep1&type=pdf
W. Timothy Strayer, Bert J. Dempsey, Alfred C. Weaver. XTP: The Xpress Transfer Protocol. Addison-Wesley, Reading, Mass 1992.
Internet protocols
Internet Standards
Transport layer protocols |
https://en.wikipedia.org/wiki/Apple%20Computer%2C%20Inc.%20v.%20Franklin%20Computer%20Corp. | Apple Computer, Inc. v. Franklin Computer Corp., 714 F.2d 1240 (3d Cir. 1983), was the first time an appellate level court in the United States held that a computer's BIOS could be protected by copyright. As second impact, this ruling clarified that binary code, the machine readable form of software and firmware, was copyrightable too and not only the human-readable source code form of software.
Franklin Computer Corporation introduced the Franklin Ace 1000, a clone of Apple Computer's Apple II, in 1982. Apple quickly determined that substantial portions of the Franklin ROM and operating system had been copied directly from Apple's versions, and on May 12, 1982, filed suit in the United States District Court for the Eastern District of Pennsylvania. It cited the presence of some of the same embedded strings, such as the name "James Huston" (an Apple programmer), and "Applesoft," on both the Apple and Franklin system disks.
Franklin admitted that it had copied Apple's software but argued that it would have been impractical to independently write its own versions of the software and maintain compatibility, although it said it had written its own version of Apple's copy utility and was working on its own versions of other software. Franklin argued that because Apple's software existed only in machine-readable form, and not in printed form, and because some of the software did not contain copyright notices, it could be freely copied. The Apple II firmware was likened to a machine part whose form was dictated entirely by the requirements of compatibility (that is, an exact copy of Apple's ROM was the only part that would "fit" in an Apple-compatible computer and enable its intended function), and was therefore not copyrightable.
The district court found in favor of Franklin. However, Apple appealed the ruling to the United States Court of Appeals for the Third Circuit which, in a separate case decided three days after Franklin won at the lower level, had determined that both a program existing only in a written form unreadable to humans (e.g. object code) and one embedded on a ROM were protected by copyright. (See Williams Elec., Inc., v. Artic Int'l, Inc., 685 F.2d 870 (1982)). The Court of Appeals overturned the district court's ruling in Franklin by applying its holdings in Williams and going further to hold that operating systems were also copyrightable. The Court remanded the case to the District Court for a determination regarding whether Apple's operating system was one of a very limited number of ways to achieve its function. If it was, then Franklin would not be liable for copyright infringement. The parties settled.
Apple was able to force Franklin to withdraw its clones by 1988. The company later brought non-infringing clones to market, but as these models were only partially compatible with the Apple II, and as the Apple II architecture was by this time outdated in any case, they enjoyed little success in the marketplace.
IBM believ |
https://en.wikipedia.org/wiki/IP%20aliasing | IP aliasing is associating more than one IP address to a network interface. With this, one node on a network can have multiple connections to a network, each serving a different purpose.
In the Linux kernel, it was first implemented by Juan José Ciarlante in 1995. On Solaris IP aliasing was called logical network interface and was first available in Solaris 2.5 in 1995. It has also been possible in Microsoft Windows NT since (at least) Windows NT 3.51, released in 1995.
IP aliasing can be used to provide multiple network addresses on a single physical interface. This demonstrates using IP version 4 addresses only. One reason for using this could be to make a computer look as though it is multiple computers, so for example you could have one server that is acting as both a gateway (router) and a DHCP server and DNS using three different IP addresses, perhaps with a future plan to use a hardware router and to move the functionality to separate DNS and DHCP servers. Or indeed the opposite you could decide to replace the three different hardware devices with a single server to reduce the administration overhead. In this case you can have three different addresses which are all on the same computer without having to install many physical network interfaces. Another reason to use IP aliasing could be to have the computer on two different logical network subnets whilst using a single physical interface.
References
Internet architecture |
https://en.wikipedia.org/wiki/JasPer | Jasper is a computer software project to create a reference implementation of the codec specified in the JPEG-2000 Part-1 standard (i.e. ISO/IEC 15444-1) - started in 1997 at Image Power Inc. and at the University of British Columbia. It consists of a C library and some sample applications useful for testing the codec.
The copyright owner began licensing the code to the public under an MIT License-style license in 2004 in response to requests from the open-source community. JasPer operated as a component of many software projects, both free and proprietary, including (but not limited to) netpbm (as of release 10.12), ImageMagick and KDE (as of version 3.2). the GEGL graphics library supported JasPer in its latest Git versions.
Jasper AI is used to generate text through natural language processing (NLP) and natural language generation (NLG) methods. The algorithm organizes and creates NLG-based content. This text generation model is typically trained through unsupervised pre-training in which the language transformation model learns and captures countless pieces of valuable information from a large dataset.
In a series of objective JPEG-2000-compression quality tests conducted in 2004, "Jasper was the best codec, closely followed by IrfanView and Kakadu".
However, Jasper remains one of the slowest implementations of the JPEG-2000 codec, as it was designed for reference, not performance.
Etymology
The name "Jasper" has simultaneous connotations with Canada's Jasper National Park, with the semi-precious gemstone, jasper, and with "JP" as an abbreviation of the JPEG-2000 standard.
See also
OpenJPEG
References
Notes:
JPEG
C (programming language) libraries
Graphics software |
https://en.wikipedia.org/wiki/Automatic%20programming | In computer science, automatic programming is a type of computer programming in which some mechanism generates a computer program to allow human programmers to write the code at a higher abstraction level.
There has been little agreement on the precise definition of automatic programming, mostly because its meaning has changed over time. David Parnas, tracing the history of "automatic programming" in published research, noted that in the 1940s it described automation of the manual process of punching paper tape. Later it referred to translation of high-level programming languages like Fortran and ALGOL. In fact, one of the earliest programs identifiable as a compiler was called Autocode. Parnas concluded that "automatic programming has always been a euphemism for programming in a higher-level language than was then available to the programmer."
Program synthesis is one type of automatic programming where a procedure is created from scratch, based on mathematical requirements.
Origin
Mildred Koss, an early UNIVAC programmer, explains: "Writing machine code involved several tedious steps—breaking down a process into discrete instructions, assigning specific memory locations to all the commands, and managing the I/O buffers. After following these steps to implement mathematical routines, a sub-routine library, and sorting programs, our task was to look at the larger programming process. We needed to understand how we might reuse tested code and have the machine help in programming. As we programmed, we examined the process and tried to think of ways to abstract these steps to incorporate them into higher-level language. This led to the development of interpreters, assemblers, compilers, and generators—programs designed to operate on or produce other programs, that is, automatic programming."
Generative programming
Generative programming and the related term meta-programming are concepts whereby programs can be written "to manufacture software components in an automated way" just as automation has improved "production of traditional commodities such as garments, automobiles, chemicals, and electronics."
The goal is to improve programmer productivity. It is often related to code-reuse topics such as component-based software engineering.
Source-code generation
Source-code generation is the process of generating source code based on a description of the problem or an ontological model such as a template and is accomplished with a programming tool such as a template processor or an integrated development environment (IDE). These tools allow the generation of source code through any of various means.
Modern programming languages are well supported by tools like Json4Swift (Swift) and Json2Kotlin (Kotlin).
Programs that could generate COBOL code include:
the DYL250/DYL260/DYL270/DYL280 series
Business Controls Corporation's SB-5
Peat Marwick Mitchell's PMM2170 application-program-generator package
These application generators supported COBOL in |
https://en.wikipedia.org/wiki/KC%2085 | The KC 85 ('KC' meaning "Kleincomputer", or "small computer") were models of microcomputers (KC 85/2, KC 85/3 and KC 85/4) built in East Germany by VEB Mikroelektronik "Wilhelm Pieck" Mühlhausen. The first model in the series, the HC 900, originally designed as a home computer and introduced in 1984, was renamed to KC 85/2 in 1985 to de-emphasize its use as consumer good.
Despite similar names, the KC 85 computers were not directly related to the KC 87 series produced by VEB Robotron-Meßelektronik "Otto Schön" Dresden.
The availability of the KC 85 series for private customers was very limited. The computers were mostly used at educational institutions, organizations, and enterprises.
Technical information
They were based on the U880 CPU (an East German clone of the Z80), with clock speeds of 1.75 MHz (KC 85/2, KC 85/3) and 1.77 MHz (KC 85/4).
Unlike the Pravetz series 8 personal computers, manufactured in Bulgaria, which were equipped with dedicated displays, floppy disks and quality keyboards, the entire KC series used TV sets for display purposes. Connectors provided were TV-out via coaxial cable, composite video, RGB video. Generic tape recorders was used for data storage. The KC 85 used a separate keyboard driven by a remote control IC.
The KC 85/2 was the first computer made in Mühlhausen and had only font ROMs for capital letters, and no BASIC in ROM. Later, the KC 85/3 was introduced and this one had a KC-BASIC [de] interpreter in ROM, freeing the user from having to load it from a cassette every time. Both systems typically had 16 KB of free RAM, but could be expanded with add-on modules. The module sockets feature prominently on photos, as they occupy the upper 50% of the casing.
The KC 85/4 had 64 KB of RAM, not counting the video ram of more than 40 KB, and better graphics capabilities. In fact, the KC 85/2 and KC 85/3 were practically indistinguishable in board design except for a different ROM and an internal piezo speaker. The KC 85/4 board was redesigned, but featured the same digital-to-analog video PCB as the previous generation.
All KC-series computers from Mühlhausen were capable of displaying graphics at a resolution of 320×256 pixels. The video ram layout was awkwardly split into a 256x256 portion and a 64x256 portion to avoid a time-consuming multiplication with 40 when addressing video memory. On the KC85/4 the video ram layout was changed in a backwards-incompatible manner to 40 columns of 256 bytes and the bytes in one column were put into consecutive memory addresses. The kernel interface was of course kept as-is and software that relied on it could continue running unchanged. The color possibilities were limited in the typical color-cell fashion: each 4×8-pixel cell had a single foreground (out of 16) and background color (out of 8, slightly darker than foreground equivalents).
This limitation was brought down to 1×8 on the KC 85/4 (the color cells on both the KC85/3 and KC85/4 were thus quite small compared to |
https://en.wikipedia.org/wiki/Non-blocking%20I/O%20%28Java%29 | java.nio (NIO stands for New Input/Output) is a collection of Java programming language APIs that offer features for intensive I/O operations. It was introduced with the J2SE 1.4 release of Java by Sun Microsystems to complement an existing standard I/O. NIO was developed under the Java Community Process as JSR 51. An extension to NIO that offers a new file system API, called NIO.2, was released with Java SE 7 ("Dolphin").
Features and organization
The APIs of NIO were designed to provide access to the low-level I/O operations of modern operating systems. Although the APIs are themselves relatively high-level, the intent is to facilitate an implementation that can directly use the most efficient operations of the underlying platform.
The Java NIO APIs are provided in the package and its subpackages. The documentation by Oracle identifies these features.
Buffers for data of primitive types
Character set encoders and decoders
A pattern-matching facility based on Perl-style regular expressions (in package )
Channels, a new primitive I/O abstraction
A file interface that supports locks and memory mapping of files up to Integer.MAX_VALUE bytes (2 GiB)
A multiplexed, non-blocking I/O facility for writing scalable servers
NIO buffers
NIO data transfer is based on buffers ( and related classes). These classes represent a contiguous extent of memory, together with a small number of data transfer operations. Although theoretically these are general-purpose data structures, the implementation may select memory for alignment or paging characteristics, which are not otherwise accessible in Java. Typically, this would be used to allow the buffer contents to occupy the same physical memory used by the underlying operating system for its native I/O operations, thus allowing the most direct transfer mechanism, and eliminating the need for any additional copying. In most operating systems, provided the particular area of memory has the right properties, transfer can take place without using the CPU at all. The NIO buffer is intentionally limited in features in order to support these goals.
There are buffer classes for all of Java's primitive types except boolean, which can share memory with byte buffers and allow arbitrary interpretation of the underlying bytes.
Usage
NIO buffers maintain several pointers that dictate the function of their accessor methods. The NIO buffer implementation contains a rich set of methods for modifying these pointers:
The flip() method, rather than performing a "flip" or paging function in the canonical sense, moves the position pointer to the origin of the underlying array (if any) and the limit pointer to the former position of the position pointer.
Three get() methods are supplied for transferring data out of a NIO buffer. The bulk implementation, rather than performing a "get" in the traditional sense, "puts" the data into a specified array. The "offset" argument supplied to this method refers not to the offse |
https://en.wikipedia.org/wiki/Young%20Hercules | Young Hercules is a prequel series to the television series Hercules: The Legendary Journeys that originally aired on Fox Kids Network. It premiered on September 12, 1998 and ended on May 14, 1999, with a total of 50 episodes over the course of 1 season. It stars Ryan Gosling in the title role. The series was based on Heracles.
Plot
The show features the efforts of Ares, the god of war, played by Kevin Tod Smith, who attempts often to destroy his younger half-brother to win over Zeus' good graces. Among his group is his nephew Strife (Joel Tobeck), who is the rather weaker member of the team. Strife's mother is Discord, goddess of retribution (Meighan Desmond), who acts more level-headed and power hungry than her counterpart on more than one occasion. The series has two other villains: Hera, queen of the gods and Hercules' stepmother; and Apollo, god of the sun and Hercules' half-brother.
The series follows Hercules (Ryan Gosling) as he attends Cheiron's Academy to train in the arts of the warrior under the wise headmaster Cheiron the Centaur (Nathaniel Lees). He makes friends with the future king of Corinth, Prince Jason (Chris Conrad) and a thieving former member of a bandit group named Iolaus (Dean O'Gorman), who was sentenced to train at the academy as an alternative to prison for his crimes. Hercules also meets the academy's first female cadet, Lilith (Jodie Rimmer). Other characters of interest include Kora, the innkeeper who (unknown to Hercules and his friends) is a devotee of Artemis, Goddess of the Hunt. As the series develops, Kora is revealed to have special powers which allow her to do Artemis' bidding. There are hints of romance between Hercules and Kora, although their friendship keeps it all innocent.
Cast
Main
Ian Bohen as Hercules (pilot only)
Ryan Gosling as Hercules
Dean O'Gorman as Iolaus
Chris Conrad as Jason
Supporting
Jodie Rimmer as Lilith
Mfundo Morrison as Theseus
Nathaniel Lees as Cheiron
Angela Marie Dotchin as Kora
Kevin Smith as Ares
Joel Tobeck as Strife
Meighan Desmond as Discord
Katrina Browne as Cyane, an Amazon
Jason Hoyte as Hephaestus, god of metallurgy
Sharon Tyrell as Alcmene
Alison Bruce as Simula
Elizabeth Hawthorne as Hera
Jay Ryan as Cadet
John Bach as Zeus
Production
Young Hercules''' executive producers were Robert Tapert and Sam Raimi. Liz Friedman and Eric Gruendemann were co-executive producers, and former MTV producer Cynthia Hsiung was producer of the series. Eric Lewald and Julia Lewald were head writers. In New Zealand, where principal photography was shot, Janine Dickins held down the fort as the New Zealand producer while three series directors took turns shooting the episodes in blocks of four along with a fourth director for second unit. Chris Graves, Charlie Haskell and Andrew Merrifield shot principal photography and Simon Rabbi shot second unit. Later in the series, Simon Rabbi shot principal photography for the 50th episode, "Valley of the Shadow."
The series |
https://en.wikipedia.org/wiki/NIC%20handle | A NIC handle (Network Information Centre handle) is a unique alphanumeric character sequence that represents an entry in the databases maintained by Network Information Centres. When a new domain name is registered with a domain name registrar, a NIC handle is assigned by the registrar to the particular set of information associated with that domain name (such as who registered it and a contact e-mail address). Once a domain name has been registered, its NIC handle can be used to search for that record in the database.
The NIC handle was developed in 1982 by Ken Harrenstien and Vic White working at the early Network Information Center at SRI International.
Modern use
The NIC Handle system is no longer commonly used by domain name registries. It was previously possible to query WHOIS by NIC handle, and see all the domains registered by that NIC handle, but this service was discontinued (presumably due to spam).
NIC Handles are still used extensively in the RIPE Database to identify people and business roles.
See also
Network Information Centre (NIC)
References
Domain Name System |
https://en.wikipedia.org/wiki/J-Cart | The J-Cart is a special ROM cartridge developed by Codemasters for the Sega Genesis console. It held not only the game data but also came with two additional gamepad ports. This effectively allowed four players to play simultaneously without any extra adapters. The first J-Cart game, Tennis All-Stars, was released in early 1994.
Micro Machines 2: Turbo Tournament also allowed up to eight players to play simultaneously using up to four gamepads, each player using only the D-pad or face buttons.
The J-Cart came relatively late in the life cycle of the console. In addition, Codemasters never licensed the technology to other publishers. Thus the number of games released as J-Carts was limited.
Games
Pete Sampras Tennis
Pete Sampras Tennis '96
Micro Machines 2: Turbo Tournament
Micro Machines 96
Micro Machines Military
Super Skidmarks
References
Codemasters
Sega Genesis
Unlicensed Sega hardware
Video game storage media |
https://en.wikipedia.org/wiki/Little%20Computer%20People | Little Computer People, also called House-on-a-Disk, is a social simulation game released in 1985 by Activision for the
Commodore 64, ZX Spectrum, Amstrad CPC, Atari ST and Apple II. An Amiga version was released in 1987. Two Japanese versions were also released in 1987, a Family Computer Disk System version, published in Japan by DOG (a subsidiary of Square), and a PC-8801 version.
Gameplay
The game has no winning conditions, and one setting: a sideways view of the inside of a three-story house. After a short time, an animated character will move in and occupy the house. He goes about a daily routine, doing everyday things like cooking, watching television or reading the newspaper. Players are able to interact with this person in various ways, including entering simple commands for the character to perform, playing a game of poker with him and offering presents. On occasion, the character initiates contact on his own, inviting the player to a game or writing a letter explaining his feelings and needs. Each copy of the game generates its own unique character, so no two copies play exactly the same. The character's name is randomly selected from a list of 256 names.
The documentation that accompanied the game fully kept up the pretense of the "little people" being real, and living inside one's computer (the software merely "bringing them out"), with the player as their caretaker.
Two versions of the game existed for the Commodore 64: the disk version, which played as described above, and the cassette version, which omitted several features. On tape versions, the Little Computer Person was generated from scratch every time the game was started up (not only on the first boot, as with other versions), and thus did not go through the "moving in" sequence seen on other versions. Also, on cassette versions the Computer Person had no memory, and did not communicate meaningfully with the user; and the card games, such as poker, could not be played.
Copy protection
In pirated copies of the game on the Atari ST (and possibly other platforms) the game would load, but the character would simply stand knocking on the screen and wagging a finger at the player disapprovingly.
Add-ons
According to High Score!, add-ons were planned, such as diskettes filled with new furniture and an "LCP Apartment" in an apartment building, with the LCPs all interacting. These add-ons, also described in terms of a sequel expanding on the LCP concept, never materialized.
Reception
Roy Wagner reviewed the game for Computer Gaming World, and stated that "The game is more cute than fun or challenging. The range of activities are limited and not very exciting, but can be interesting. The "game" is ideally suited for children. It does a good job of teaching about caring for another."
Little Computer People earned a Zzap!64 Gold Medal Award in 1985. Games magazine listed it as one of its top 10 best entertainment software produced in 1985. Jerry Pournelle of BYTE named it his g |
https://en.wikipedia.org/wiki/The%20Yes%20Men | The Yes Men are a culture jamming activist duo and network of supporters created by Jacques Servin and Igor Vamos. Through various actions, the Yes Men primarily aim to raise awareness about problematic social and political issues. To date, the duo have produced three films: The Yes Men (2003), The Yes Men Fix the World (2009), and The Yes Men Are Revolting (2014). In these films, they impersonate entities that they dislike, a practice that they call "identity correction." The Yes Men operate under the mission statement that lies can expose truth. They create and maintain fake websites similar to ones they intend to spoof, which have led to numerous interview, conference, and TV talk show invitations. They espouse the belief that corporations and governmental organizations often act in dehumanizing ways toward the public. Elaborate props are sometimes part of the ruse (e.g. Survivaball), as shown in their 2003 DVD release The Yes Men. The Yes Men have collaborated with other groups of similar interest, including Improv Everywhere, Andrew Boyd and Steve Lambert.
Background
According to Servin, the Yes Men concept initially sprang from their creation of a fake website spoofing the World Trade Organization. To the surprise of Servin and Vamos, many believed the site to be authentic, and the two were consequently contacted to speak at a conference in Austria. Since this time, the Yes Men have continued performing large-scale hoaxes, in what they describe as a collaborative effort with journalists to help the media tell stories which they believe are important.
The Yes Men often deploy a satirical approach: they pose as a powerful entity (typically a corporate or government representative or executive) and make ridiculous and shocking comments that caricature the ideological position of the organization or person. Furthermore, they acknowledge the idea that many corporate or government entities manipulate their ideology using spin; in response, the Yes Men use this power of spin to their own advantage, and use media outlets to disseminate their personal interpretation of the situation. A sense of humor and shock value is usually employed to make these issues more palatable to the general public and to call greater media attention to stories of interest. Some of these outrageous ideas include the prospect of selling one's vote or a proposition that the poor should consume recycled human waste. On most occasions, little to no shock or outrage is publicly evoked in response to their prank.
On occasion, the Yes Men's phony spokesperson will make announcements that represent fictitious scenarios for the anti-globalization movement or opponents of corporate crime. This has often resulted in false news reports, such as those covering the demise of the World Trade Organization, or Dow Chemical paying compensation to the victims of the Bhopal disaster.
The Yes Men have posed as spokespeople for the WTO, McDonald's, Dow Chemical, and the United States Dep |
https://en.wikipedia.org/wiki/Multi%20Router%20Traffic%20Grapher | The Multi Router Traffic Grapher (MRTG) is free software for monitoring and measuring the traffic load on network links. It allows the user to see traffic load on a network over time in graphical form.
It was originally developed by Tobias Oetiker and Dave Rand to monitor router traffic, but has developed into a tool that can create graphs and statistics for almost anything.
MRTG is written in Perl and can run on Windows, Linux, Unix, Mac OS and NetWare.
How it works
SNMP
MRTG uses the Simple Network Management Protocol (SNMP) to send requests with two object identifiers (OIDs) to a device. The device, which must be SNMP-enabled, will have a management information base (MIB) to look up the OIDs specified. After collecting the information it will send back the raw data encapsulated in an SNMP protocol. MRTG records this data in a log on the client along with previously recorded data for the device. The software then creates an HTML document from the logs, containing a list of graphs detailing traffic for the selected devices in the server.
Script output
Alternatively, MRTG can be configured to run a script or command, and parse its output for counter values. The MRTG website contains a large library of external scripts to enable monitoring of SQL database statistics, firewall rules, CPU fan RPMs, or virtually any integer-value data.
Features
Measures two values (I for Input, O for Output) per target.
Gets its data via an SNMP agent, or through the output of a command line.
Typically collects data every five minutes (it can be configured to collect data less frequently).
Creates an HTML page per target that features four graphs (GIF or PNG images).
Results are plotted vs time into day, week, month and year graphs, with the I plotted as a full green area, and the O as a blue line.
Automatically scales the Y axis of the graphs to show the most detail.
Adds calculated Max, Average and Current values for both I and O to the target's HTML page.
Can also send warning emails if targets have values above a certain threshold.
See also
RRDtool - Reimplementation of MRTG's graphing and logging features
Munin - Another monitoring application with web interface, based on RRDtool
Cacti - A similar tool using RRDtool
References
External links
Helpful page with example MRTG grabs and explanations.
Solaris PME
Red Hat Enterprise Linux MRTG Configuration HOW-TO
MRTGEXT module for supporting MRTG and Nagios monitoring systems on Novell Servers project
Trend View a MRTG Frontend for Windows
MRTG-XTRA, a Windows distribution of MRTG --DISCONTINUED--
Internet Protocol based network software
Network analyzers
Free network management software |
https://en.wikipedia.org/wiki/Echo%20TV%20Russia | Echo TV (since February 15, 2002, also Ekho TV, Телекомпания «Эхо», Эхо-ТВ) is a television company. Echo TV is affiliated with Echo of Moscow radio station and RTVi satellite television network. The president is Alexei Venediktov.
References
External links
Russian-language television stations
Defunct television channels in Russia
RTVI
Echo of Moscow |
https://en.wikipedia.org/wiki/John%20R.%20Pierce | John Robinson Pierce (March 27, 1910 – April 2, 2002), was an American engineer and author. He did extensive work concerning radio communication, microwave technology, computer music, psychoacoustics, and science fiction. Additionally to his professional career he wrote science fiction for many years using the names John Pierce, John R. Pierce, and J. J. Coupling. Born in Des Moines, Iowa, he earned his PhD from Caltech, and died in Sunnyvale, California, from complications of Parkinson's Disease.
At Bell Labs
Pierce wrote about electronics and information theory, and developed jointly the concept of pulse-code modulation (PCM) with his Bell Laboratories colleagues Bernard M. Oliver and Claude Shannon. He supervised the Bell Labs team which built the first transistor, and at the request of one of them, Walter Brattain, invented the term transistor; he recalled:
Pierce's early work at Bell Labs concerned vacuum tubes of all sorts. During World War II he discovered the work of Rudolf Kompfner in a British radar laboratory, where Kompfner had invented the traveling-wave tube; Pierce worked out the mathematics for this broadband amplifier device, and wrote a book about it, after hiring Kompfner for Bell Labs. He later recounted that "Rudy Kompfner invented the traveling-wave tube, but I discovered it." According to Kompfner's book, the statement "Rudi invented the traveling-wave tube, and John discovered it" was due to Dr. Eugene G. Fubini, quoted in The New Yorker "Profile" on Pierce, September 21, 1963.
Pierce is widely credited for saying "Nature abhors a vacuum tube", but Pierce attributed that quip to Myron Glass. Others say that quip was "commonly heard at the Bell Laboratories prior to the invention of the transistor".
Other famous Pierce quips are "Funding artificial intelligence is real stupidity", "I thought of it the first time I saw it", and "After growing wildly for years, the field of computing appears to be reaching its infancy."
The National Inventors Hall of Fame has honored Bernard M. Oliver
and Claude Shannon
as the inventors of PCM,
as described in 'Communication System Employing Pulse Code Modulation,' filed in 1946 and 1952, granted in 1956. Another patent by the same title was filed by John Pierce in 1945, and issued in 1948: . The three of them published "The Philosophy of PCM" in 1948.
Pierce did significant research involving satellites, including an important role as executive director of Bell's Research-Communications Principles Division)
for the development of the first commercial communications satellite, Telstar 1.
In fact, although Arthur C. Clarke was the first to propose geostationary communications satellites, Pierce seems to have thought of the idea independently and may have been the first to discuss unmanned communications satellites. Clarke himself characterized Pierce as "one of the two fathers of the communications satellite" (along with Harold Rosen). See ECHO – America's First Communications Sate |
https://en.wikipedia.org/wiki/CHIP-8 | CHIP-8 is an interpreted programming language, developed by Joseph Weisbecker made on his 1802 Microprocessor. It was initially used on the COSMAC VIP and Telmac 1800 8-bit microcomputers in the mid-1970s. CHIP-8 programs are run on a CHIP-8 virtual machine. It was made to allow video games to be more easily programmed for these computers. The simplicity of CHIP-8, and its long history and popularity, has ensured that CHIP-8 emulators and programs are still being made to this day. It also gave inspiration to similar systems with certain limitations and compatibility independent of hardware called fantasy consoles.
Roughly fifteen years after CHIP-8 was introduced, derived interpreters appeared for some models of graphing calculators (from the late 1980s onward, these handheld devices in many ways have more computing power than most mid-1970s microcomputers for hobbyists).
An active community of users and developers existed in the late 1970s, beginning with ARESCO's "VIPer" newsletter whose first three issues revealed the machine code behind the CHIP-8 interpreter.
CHIP-8 applications
There are a number of classic video games ported to CHIP-8, such as Pong, Space Invaders, Tetris, and Pac-Man. There are also applications like a random maze generator and Conway's Game of Life.
CHIP-8 extensions and variations
During the 1970s and 1980s, CHIP-8 users shared CHIP-8 programs, but also changes and extensions to the CHIP-8 interpreter, in the COSMAC VIP users' newsletter, VIPER magazine. These extensions included CHIP-10 and Hi-Res CHIP-8, which introduced a higher resolution than the standard 64x32, and CHIP-8C and CHIP-8X, which extended the monochrome display capabilities to support limited color, among other features. These extensions were mostly backwards compatible, as they were based on the original interpreter, although some repurposed rarely used opcodes for new instructions.
In 1979, Electronics Australia ran a series of articles on building a kit computer similar to the COSMAC VIP, based on the Motorola 6800 architecture. This computer, the DREAM 6800, came with its own version of CHIP-8. A newsletter similar to VIPER, called DREAMER, was used to share CHIP-8 games for this interpreter. In 1981, Electronics Today International (ETI) ran a series of articles on building a computer, the ETI-660, which also was very similar to the VIP (and used the same microprocessor). ETI ran regular ETI-660 and general CHIP-8 columns until 1985.
In 1990, a CHIP-8 interpreter called CHIP-48 was made for HP-48 graphing calculators so games could be programmed more easily. Erik Bryntse later created another interpreter based on CHIP-48, called SCHIP, S-CHIP or Super-Chip. SCHIP extended the CHIP-8 language with a larger resolution and several additional opcodes meant to make programming easier. If it were not for the development of the CHIP-48 interpreter, CHIP-8 would not be as well known today.
David Winter's emulator, disassembler, and extended techn |
https://en.wikipedia.org/wiki/Priority%20ceiling%20protocol | In real-time computing, the priority ceiling protocol is a synchronization protocol for shared resources to avoid unbounded priority inversion and mutual deadlock due to wrong nesting of critical sections. In this protocol each resource is assigned a priority ceiling, which is a priority equal to the highest priority of any task which may lock the resource. The protocol works by temporarily raising the priorities of tasks in certain situations, thus it requires a scheduler that supports dynamic priority scheduling.
ICPP versus OCPP
There are two variants of the protocol: Original Ceiling Priority Protocol (OCPP) and Immediate Ceiling Priority Protocol (ICPP). The worst-case behaviour of the two ceiling schemes is identical from a scheduling view point. Both variants work by temporarily raising the priorities of tasks.
In OCPP, a task X's priority is raised when a higher-priority task Y tries to acquire a resource that X has locked. The task's priority is then raised to the priority ceiling of the resource, ensuring that task X quickly finishes its critical section, unlocking the resource. A task is only allowed to lock a resource if its dynamic priority is higher than the priority ceilings of all resources locked by other tasks. Otherwise the task becomes blocked, waiting for the resource.
In ICPP, a task's priority is immediately raised when it locks a resource. The task's priority is set to the priority ceiling of the resource, thus no task that may lock the resource is able to get scheduled. This ensures the OCPP property that "A task can only lock a resource if its dynamic priority is higher than the priority ceilings of all resources locked by other tasks".
ICPP is easier to implement than OCPP, as blocking relationships need not be monitored
ICPP leads to fewer context switches as blocking is prior to first execution
ICPP requires more priority movements as this happens with all resource usage
OCPP changes priority only if an actual block has occurred
ICPP is called "Ceiling Locking" in Ada, "Priority Protect Protocol" in POSIX and "Priority Ceiling Emulation" in RTSJ.
It is also known as "Highest Locker's Priority Protocol" (HLP).
See also
Priority inheritance
References
Real-time computing
Concurrency control |
https://en.wikipedia.org/wiki/Dangling%20pointer | Dangling pointers and wild pointers in computer programming are pointers that do not point to a valid object of the appropriate type. These are special cases of memory safety violations. More generally, dangling references and wild references are references that do not resolve to a valid destination.
Dangling pointers arise during object destruction, when an object that has an incoming reference is deleted or deallocated, without modifying the value of the pointer, so that the pointer still points to the memory location of the deallocated memory. The system may reallocate the previously freed memory, and if the program then dereferences the (now) dangling pointer, unpredictable behavior may result, as the memory may now contain completely different data. If the program writes to memory referenced by a dangling pointer, a silent corruption of unrelated data may result, leading to subtle bugs that can be extremely difficult to find. If the memory has been reallocated to another process, then attempting to dereference the dangling pointer can cause segmentation faults (UNIX, Linux) or general protection faults (Windows). If the program has sufficient privileges to allow it to overwrite the bookkeeping data used by the kernel's memory allocator, the corruption can cause system instabilities. In object-oriented languages with garbage collection, dangling references are prevented by only destroying objects that are unreachable, meaning they do not have any incoming pointers; this is ensured either by tracing or reference counting. However, a finalizer may create new references to an object, requiring object resurrection to prevent a dangling reference.
Wild pointers arise when a pointer is used prior to initialization to some known state, which is possible in some programming languages. It also calls as Uninitialized pointer. They show the same erratic behavior as dangling pointers, though they are less likely to stay undetected because many compilers will raise a warning at compile time if declared variables are accessed before being initialized.
Cause of dangling pointers
In many languages (e.g., the C programming language) deleting an object from memory explicitly or by destroying the stack frame on return does not alter associated pointers. The pointer still points to the same location in memory even though it may now be used for other purposes.
A straightforward example is shown below:
{
char *dp = NULL;
/* ... */
{
char c;
dp = &c;
}
/* c falls out of scope */
/* dp is now a dangling pointer */
}
If the operating system is able to detect run-time references to null pointers, a solution to the above is to assign 0 (null) to dp immediately before the inner block is exited. Another solution would be to somehow guarantee dp is not used again without further initialization.
Another frequent source of dangling pointers is a jumbled combination of malloc() and free() library calls: a pointer becomes dangling wh |
https://en.wikipedia.org/wiki/Sinclair%20User | Sinclair User was a magazine dedicated to the Sinclair Research range of home computers, most specifically the ZX Spectrum (while also occasionally covering arcade games). Initially published by ECC Publications, and later EMAP, it was published in the UK between 1982 and 1993, and was the longest running Sinclair-based magazine. The magazine contained news, game reviews, previews, tips, help guides, columns, readers' letters, and cover-mounted game demos.
History
In earlier years, the magazine built up personality cults around some of its "hilariously" monikered staff, including Bill "Incorruptible" Scolding, John "Disgusting" Gilbert, Chris "Lunchbreaks" Bourne, Claire "Ligger" Edgely, Richard Price (writer of the "Gordo Greatbelly" adventure tips section), and columnist Andrew Hewson (founder of Hewson Consultants software).
Under David Kelly's editorial tenure, the magazine began to focus more on the gaming scene, and featured more colour graphics under designer Gareth "the Mad Celt". By the time of editor Graham Taylor, the magazine included the cartoon character Kamikaze Bear, and the tone of the publication changed from a semi-serious magazine to something aimed more at children.
In May 1992 the former rival publication CRASH was notionally subsumed into Sinclair User but in practice this meant little more than the addition of the Crash! logo to the magazine's cover page.
Timex Sinclair User
A short-lived spin-off known as Timex Sinclair User was also published for the American market, where versions of Sinclair computers were marketed under the Timex Sinclair name.
See also
Sinclair Programs
Your Sinclair
Computer and Video Games
References
External links
Archived Sinclair User magazines on the Internet Archive
Sinclair User Magazine Online, unofficial archive.
Video game magazines published in the United Kingdom
Defunct computer magazines published in the United Kingdom
ZX Spectrum magazines
Magazines established in 1982
Magazines disestablished in 1993
Monthly magazines published in the United Kingdom
1983 establishments in the United Kingdom
1993 disestablishments in the United Kingdom
Magazines published in London |
https://en.wikipedia.org/wiki/Telmac%201800 | The Telmac 1800 was an early microcomputer delivered in kit form. It was introduced in 1977 by Telercas Oy, the Finnish importer of RCA microchips. Most of the 2,000 kits manufactured over four years were bought by electronics enthusiasts in Finland, Sweden and Norway.
An expansion board, OSCOM, later became available, and included an alphanumeric video display, and up to of memory. A Tiny BASIC could be run on this configuration.
The first-ever commercial video game to be developed in Finland, Chesmac (fi), was developed by Raimo Suonio on a Telmac 1800 computer in 1979.
The Telmac 1800 was followed by the Oscom Nano and the Telmac 2000.
Major features
RCA 1802 (COSMAC) microprocessor CPU @ 1.75 MHz
Cassette tape interface
2 kB RAM, expandable to 4 kB
RCA CDP1861 'Pixie' video chip, 64×128 pixels display resolution
Sound limited to a fixed frequency tone
Able to run a CHIP-8 interpreter
References
External links
Revival Studios Developer of new Chip-8/SuperChip/MegaChip8 games.
Telmac 1800 schematics.
See also
Telmac TMC-600
Early microcomputers
8-bit computers |
https://en.wikipedia.org/wiki/Crash%20%28magazine%29 | Crash, stylized as CRASH, is a magazine dedicated to the ZX Spectrum home computer, primarily focused on games. It was published from 1984 to 1991 by Newsfield Publications Ltd until their liquidation, and then until 1992 by Europress. It was relaunched as a quarterly A5 magazine in December 2020 with the backing of the original founders.
The magazine was launched to cater for the booming Spectrum games market. It was immediately popular owing to its quality of writing and distinctive, though occasionally controversial, artwork created by Oliver Frey. By 1986 it had become the biggest-selling British computer magazine with over 100,000 copies sold monthly, but struggled towards the end of the decade after other magazines put cassettes of games on the front cover. In the 2010s, a number of retrospective issues were created via a kickstarter campaign leading to the new publication by Fusion Retro.
History
Crash was launched in 1983 in Ludlow, Shropshire by Roger Kean, Oliver Frey and Franco Frey. The trio had met the previous year when they were working for newspaper publisher Alan Purnell, learning how to write and produce a magazine from scratch. Franco Frey had worked for an electronics company, and had been asked by one of his business contacts if could get hold of video games. Kean remembers that "The High Street was ignorant of computer games" and they wanted to source titles and sell them. They set up a mail order catalogue called Crash Micro Games Action and advertised in contemporary computer magazines such as Computer and Video Games. It was immediately successful, so by late 1983, they decided to launch a dedicated magazine, forming the company Newsfield to do so. Kean and Oliver Frey wanted a catchy title for the magazine, choosing "Crash" after J. G. Ballard's novel of the same name.
Though he had regularly played video games throughout the 1970s, the middle-aged Kean realised that the target market for the magazine was teenagers and young men, and the writing needed to accommodate this. Consequently, he hired teenage staff writer Matthew Uffindel and the pair recruited local schoolchildren to review the games, including Ben Stone and Robin Candy. To produce screenshots, a camera was set up to directly capture the television set or monitor that the Spectrum was plugged into. The film was then processed in-house, printed and delivered to a local print shop to prepare the final page.
The first issue was intended to be published in November 1983, in time for the pre-Christmas trade, but owing to a conflict with retailers WH Smith it was published in February the following year. The magazine maintained focus squarely on Spectrum gaming. It was an instant hit thanks to Oliver Frey's artwork and Kean's writing, assisted by Uffindel. Kean and the Frey brothers would continue to be involved with the magazine throughout its lifetime.
Reviewers would give their direct opinions on whether a game was good or not, regardless of advertising or |
https://en.wikipedia.org/wiki/Digital%20illustration | Digital illustration or computer illustration is the use of digital tools to produce images under the direct manipulation of the artist, usually through a pointing device such as a graphics tablet or, less commonly, a mouse. It is distinguished from computer-generated art, which is produced by a computer using mathematical models created by the artist. It is also distinct from digital manipulation of photographs, in that it is an original construction "from scratch". Photographic elements such as background or texture may be incorporated into such works, but they are not necessarily the primary basis.
Pointing devices
Mice are not very precise for drawing, so a graphics tablet is often an important tool for most digital illustrators, because it allows the user to make a mark easily in any direction, in a way that reflects the natural or "lively" line made by the human hand. In addition to flexibility of movement, an industry-standard digital drawing tablet has a pressure-sensitive surface, allowing the illustrator to make marks that vary from faint to bold, and from thin to broad, similar to how one would work with a brush. These variations mimic traditional wet and dry media. A hybrid graphics tablet/screen might be helpful, since the artist can see more accurately where to place strokes in the image, but the hardware is currently much more expensive.
Illustration software
There are two main types of tools used for digital illustration: bitmapped (also known as "raster") and vector applications. Bitmap applications are commonly called "painting" programs, such as Adobe Photoshop, while vector applications, such as Adobe Illustrator, are called "drawing" programs. These terms reflect the difference in look-and-feel between the images created in each type of program. With a bitmap application, the content is stored digitally in fixed rows and columns of pixels, which can be created in separate layers for more easily isolating and manipulating different parts of the image. A bitmap image contains information about each pixel's hue (color), luminance (brightness), and saturation (intensity of color). When the pointing device moves over an area of the image, new colors and values are applied to the underlying pixels. Painting tools allow the easy creation of "fuzzy" imagery, including effects such as glows and soft shadows, and textures such as fur, velvet, stone and skin, and are heavily used in photo-retouching.
With vector-based tools, the content is stored digitally as resolution-independent mathematical formulae describing lines (open paths), shapes (closed paths), and color fills, strokes or gradients. Vector paths are constructed of anchor points and path segments by using the pointing device to click and drag. Many vector graphics are readily available for download from online databases which can then be edited and incorporated into larger projects. Drawing tools typically create precise lines, shapes and patterns with well-defined edges |
https://en.wikipedia.org/wiki/Oracle%20Reports | Oracle Reports is a tool for developing reports against data stored in an Oracle database. Oracle Reports consists of Oracle Reports Developer (a component of the Oracle Developer Suite) and Oracle Application Server Reports Services (a component of the Oracle Application Server).
Output formats
The report output can be delivered directly to a printer or saved in the following formats: HTML, RTF, PDF, XML, Microsoft Excel
History
Oracle RPT
Oracle RPT was an early, primitive predecessor to SQL*Report Writer. There was no editor or IDE provided and instead the reports were created by editing text files to control the report output.
SQL*Report Writer
Character based report writing tool.
The software was purchased by Oracle from a third party
Oracle Reports 1
New GUI mode IDE
Major rewrite
Oracle Reports 2.0
Oracle Reports 2.5
Release April 1995.
New Object Navigator.
New Toolbars.
New Menus.
Still no undos.
More stable IDE.
Oracle Reports 6i
New features added in 6i:
WebDB integration
XML Output
HTML Parameter Form Extensions
SQL Access to the Reports Server Queue
EXEC_SQL Integration
Oracle Reports 9i
New features added in 9i:
XML report definition
Query types: XML, JDBC, Oracle9i OLAP, text files
Pluggable Data Sources
Java Importer
Oracle9i JDeveloper Integration
Oracle9i SCM Integration
Integration with BI Beans
Oracle9iAS Portal Report Import
Edit Oracle9iAS Discoverer Worksheet Export.
Oracle Reports 10g
New features added in 10g:
New output format spreadsheet, output to Microsoft Excel.
Extended HTML formatting customisation
Compliant to HTML 4.01 and XML 1.1 standards...
References
External links
Oracle Reports
Oracle Reports FAQ
RPT Conversion to PL/SQL Stored Procedures
Oracle software
Reporting software |
https://en.wikipedia.org/wiki/MaxDB | MaxDB is an ANSI SQL-92 (entry level) compliant relational database management system (RDBMS) from SAP AG, which was also delivered by MySQL AB from 2003 to 2007. MaxDB is targeted for large SAP environments e.g. mySAP Business Suite, and other applications that require enterprise-level database functionality.
History
The database development started in 1977 as a research project at the Technical University of Berlin headed by Rudolf Munz. In the early 1980s it became a database product that subsequently was owned by Nixdorf Computer, Siemens-Nixdorf, Software AG and today by SAP AG. It has at various times been named VDN, RDS, Reflex, Supra 2, DDB/4, Entire SQL-DB-Server and Adabas D. In 1997 SAP acquired the software from Software AG and developed it as SAP DB, releasing the source code under the GNU General Public License in October 2000.
In 2003 SAP AG and MySQL AB jointly re-branded the database system to MaxDB. In October 2007 this reselling agreement was terminated and sales and support of the database reverted to SAP. SAP AG now manages MaxDB development, distribution, and support. New versions of the source code of MaxDB are no longer available under the GNU General Public License. SAP also stated that "Further commercial support concepts to cover mission critical use requirements outside of SAP scenarios are currently subject to discussion."
MaxDB since version 7.5 is based on the code base of SAP DB 7.4. Therefore, the MaxDB software version 7.5 can be used as a direct upgrade of previous SAP DB versions starting 7.2.04 and higher.
Features
MaxDB is delivered with a set of administration and development tools. Most tools are available with both a GUI and command line interface (CLI). It offers bindings for JDBC; ODBC; SQLDBC (native C/C++ interface); precompiler; PHP; Perl; Python; WebDAV; OLE DB, ADO, DAO, RDO and .NET via ODBC; Delphi and Tcl via Third Party Programming Interfaces. MaxDB is cross-platform, offering releases for HP-UX, IBM AIX, Linux, Solaris, Microsoft Windows 2000, Microsoft Windows Server 2003, and up to Microsoft Windows 10.
MaxDB offers built-in hot backup, does not need any online reorganizations and claims to be SQL 92 Entry-Level compatible.
MaxDB since version 7.7.00, uses multiversion concurrency control (MVCC) instead of the previous lock based implementation.
Licensing
MaxDB was licensed under the GNU General Public License (GPL) from versions 7.2 through 7.6. Programming interfaces were licensed under the GPL with exceptions for projects released under other open source licenses.
SAP DB 7.3 and 7.4 were licensed as GPL but with LGPL drivers. MaxDB 7.5 was offered under dual licensing, i.e. licensed as GPL with GPL drivers or a commercial license.
From version 7.5 through version 7.6 onwards distribution of MaxDB (previously SAP DB) to the open source community was provided by MySQL AB, the same company that develops the open-source software database, MySQL.
Development was done by SAP AG, |
https://en.wikipedia.org/wiki/DeskMate | DeskMate is a software application that provides a graphical operating environment. It originally was for Tandy Corporation's TRSDOS Operating System for their TRS-80 line of computers, but eventually shifted to MS-DOS. Like GEM from Digital Research, it is not a full operating system, but runs on top an existing system. Initial ports only ran on Tandy's PCs such as the Tandy 1000, but later became available for true IBM PC compatibles and competed with early versions of Microsoft Windows.
Some non-Tandy software uses DeskMate to provide the user interface via a runtime version of the operating environment for those without it. This includes Activision's The Music Studio and a version of Lotus 1-2-3.
DeskMate 1.0
DeskMate version 1.0 was included with the original Tandy 1000 and did not work correctly on non-Tandy computers. This was mainly due to the use of the function keys - as most non-Tandy PCs either did not come with an F12 button or with one that did not act in the same way as a Tandy F12 function key (Tandy adopted F11/F12 before IBM did).
DeskMate was popular, increasing sales of the Tandy 1000 to homes and schools.
DeskMate 2
By the time Personal DeskMate was released with the Tandy 1000 EX, it was a GUI that acted as a portal for many other office productivity applications. The DeskMate application would run on top of MS-DOS. The user interface was made up of text. The applications that made up the suite were:
a basic word processor ("Text")
a spreadsheet ("Worksheet")
a calendar
a basic database program ("Filer")
The programs all fit on a 360K floppy disk. With careful manipulation, it was possible to isolate the individual applications and remove the others, placing them on separate floppies to be swapped when required. DeskMate was still required, as the individual programs could not be accessed directly.
DeskMate 3
DeskMate 3 added a number of basic applications:
a drawing program ("Draw")
a simple digital audio editing program ("Sound")
a simple music program ("Music"), which could play music with audio samples created in Sound, used the 3-channel Tandy DAC, which provided 22 kHz 8-bit audio.
an online service ("PC Link")
The core parts of DeskMate (and DOS) were shipped in ROM on certain Tandy 1000s, allowing the computer to boot into DeskMate within a few seconds.
This was the first version of DeskMate that allowed for a run-time version that could be distributed with applications. This allowed users to use DeskMate applications on their PC's even if they did not have DeskMate installed.
Professional DeskMate
Tandy offered DeskMate for corporate users as an alternative to OS/2 Presentation Manager. Professional DeskMate provides a text-based GUI for DOS, with LocalTalk-based file-service and email extensions.
WinMate
This was a complete rewrite for Microsoft Windows 3.1, providing a simplified user interface and a few applications.
Reception
Noting that Tandy had found that Personal DeskMate increased sales of its |
https://en.wikipedia.org/wiki/AST%20Research | AST Research, Inc., later doing business as AST Computer, was a personal computer manufacturer. It was founded in 1980 in Irvine, California, by Albert Wong, Safi Qureshey, and Thomas Yuen, as an initialism of their first names. In the 1980s, AST designed add-on expansion cards, and evolved toward the 1990s into a major personal computer manufacturer. AST was acquired by Samsung Electronics in 1997 but was de facto closed in 1999 due to a series of losses.
Foundation (1979–1986)
AST Research was founded as AST Associates by Thomas C. K. Yuen, Albert C. Wong, and Safi U. Qureshey. All three were immigrants to the United States—Yuen and Wong from Hong Kong and Qureshey from Pakistan. Yuen had met Qureshey while working for Computer Automation Inc. in the 1970s, while Wong was a roommate of Yuen's while they both attended Orange Coast College in Costa Mesa, California. All had come to the United States to study engineering. Yuen was the principal founder of AST, proposing the creation of the company in 1979. Before breaking into the manufacture of hardware, Yuen envisioned the company as a computer consultancy firm for large businesses. The three incorporated AST Research with $2,000 of start-up capital in Irvine, California, in July 1980. The company name is an initialism for the three founders' first names. Selecting their initial job titles by drawing straws, Qureshey was named president, Yuen was named treasurer, and Wong was named secretary.
AST delivered its first products by the end of 1981. By then, the computer consultancy idea had been abandoned, the company was renamed to AST Research, and the trio were deep into researching and developing expansion cards for the original IBM Personal Computer, which had been released in August 1981. The founders deemed the initial models of the IBM PC to have been equipped with an inadequate amount of RAM and communications capability and so devised a range of expansion cards that provided these features. They are listed in the charter issue of PC Magazine as follows: a series of memory expansion cards, ranging from 64 KB to 256 KB of additional RAM (with parity); a modem card with a phone jack and an RS-232 serial port; two asynchronous serial communication cards, one with a single RS-232 port and the other dual ports; and an advanced serial communication card, featuring two independently programmable RS-232 ports that could be programmed to support asynchronous, bisynchronous, SDLC, and HDLC protocols.
Sales of this initial lineup of products doubled every month within the first year of availability. Needing to keep up with the increasing demand from the customer base, the company vied for venture capital but were turned down by multiple banks. Instead, the founders all took out second mortgages on their residences in 1982 and were able to pool an additional $50,000 to invest into the company. Fortunately for the founders, AST's sales reached $13 million in 1983. This sudden increase in sales finall |
https://en.wikipedia.org/wiki/NEC%20PC-100 | The NEC PC-100 was a Japanese home computer available on October 13, 1983. It operated on 8086 CPU 7 MHz, 128KB RAM, 128KB VRAM, a Japanese language capable keyboard and a two button mouse. It had three models and its color monitor, PC-KD651, which could be used vertically or horizontally, had the price tag of 198,000 yen. Its biggest advantage over other computers of that time was its high graphical capability of 720 by 512 with a selection of 16 color out of 512 color available on its high end model30. Its OS was MS-DOS and was also equipped with a spreadsheet program Maruchipuran (Multiplan) and a text editor JS-WORD as well as the game Lode Runner.
The development was operated by NEC Electronic Device Business Group, ASCII (Microsoft dealer in Japan) and Cybernet Kogyo, a subsidiary of Kyocera.
Far ahead of its time and too costly, PC-100 did not sell well. A complete set with the printer PC-PR201 that could print alphabet, hiragana, katakana and kanji, came to nearly a million yen. For a comparison, the Nintendo Family Computer released in July of the same year was only 14,800 yen and the vaunted Apple Lisa 2 sold for 2.2 million yen. The cheaper PC-9801F2 also by NEC outsold it.
model10 (398,000 yen) - a 5-inch 2D (360KB) floppy disk drive
model20 (448,000 yen) - two 5-inch 2D floppy disk drives
model30 (558,000 yen) - two 5-inch 2D floppy disk drives
Competition with PC-98
NEC faded out the PC-100 because of the reorganization of their business units rather than its technical issues.
The Electronic Device Business Group launched the PC-8001 in 1979, making NEC the biggest PC vendor in Japan. However, the Japanese personal computer industry had just begun, and it was unclear which market would grow. Other large computer manufacturers, IBM Japan and Fujitsu, had not focused on the personal computer industry yet. Hitachi and Sharp released home computers for hobbyists. Sord and Oki Electric Industry released personal computers for small-business sector.
In 1981, NEC expanded personal computer lines into three groups: NEC Home Electronics, Information Processing Business Group and Electronic Device Business Group, with each specializing in a particular series. The Electronic Device Business Group developed the PC-8801 for consumers who wanted to use it for both hobby and business. The Information Processing Business Group began developing the PC-9801 specialized for business market.
By 1983, the Japanese personal computer industry grew greatly, and its distribution network became complex. It caused the problem for NEC that each group competed to sell its own product to the same chain. Their biggest competitor was each group in the company, and they contested for the leadership. One software company's president recalled the sales section of PC-9801 often said "Down with the 88!".
The PC-100 and PC-9801F were released at the same time, and the problem surfaced. A store manager complained he couldn't determine which salesperson to f |
https://en.wikipedia.org/wiki/Corel%20Linux | Corel Linux, also called Corel LinuxOS, was a Debian-based operating system made by Corel that began beta testing on September 21, 1999 and was released to the public on November 15, 1999. It mainly competed against Windows 98 and Windows 2000 by Microsoft, plus Mac OS 9 by Apple. Corel later discontinued the distribution, but did not remove the former Corel Open Source Development website until March 2002.
Corel did not use KFM, the standard KDE file manager. It instead used its own file manager, CFM. This, along with other modifications Corel made, made the operating system incompatible with other versions of Linux much more so than other competitors in the industry. At a time when there was relatively little commercial Linux software available, this was a serious hurdle for Corel and its users.
The operating system's Second Edition was released on August 15, 2000, in download, regular and deluxe editions. The latter bundled Corel WordPerfect Office for Linux.
Xandros purchased the Corel Linux source code and development team when Corel scrapped its Linux business in August 2001.
System requirements
Corel Linux has the following system requirements:
Features
Corel Linux featured a file manager that was very close in look and feel to Windows Explorer. The file manager provided an integrated Windows SMB network browser. The company also advertised that the operating system was compatible with its flagship software.
Applications
The key selling point of Corel Linux was its compatibility with the company's WordPerfect applications. The eponymous word processor's eighth version was given away to personal customers in the hopes that they would purchase WordPerfect Office 2000. This suite added the Quattro Pro, Corel Presentations and CorelCentral programs. The Deluxe version of that suite added the Paradox database manager and Railroad Tycoon II: Gold. The latter omits a level editor, the network mode and some scenarios from the original game. The 'Limited Edition' of Corel Linux Deluxe came with Civilization: Call to Power instead of Railroad Tycoon II. Unlike the free WordPerfect 8, the office suite was not written natively for Linux, but instead consisted of the Windows programs powered by Corel's fork of the Wine compatibility layer. As a result, the Linux suite suffered from a performance penalty compared to the Windows version and WordPerfect 8.
As with the WordPerfect suite, Corel adapted its graphics applications to run on Linux using Wine. This consisted of the CorelDraw (stylized CorelDRAW) suite. While the eponymous program was paid software, Corel Photo-Paint was available as a free download.
SmartMove
Corel SmartMove was a part of Corel Linux. This application provided the following:
Migrate Microsoft Windows settings to Corel Linux.
Automate restoring settings that are changed by SmartMove.
Provide an easy way to access network folders through Corel Linux.
SmartMove was built around the Wine libraries to read th |
https://en.wikipedia.org/wiki/Rete%20testis | The rete testis ( ) is an anastomosing network of delicate tubules located in the hilum of the testicle (mediastinum testis) that carries sperm from the seminiferous tubules to the efferent ducts. It is the homologue of the rete ovarii in females. Its function is to provide a site for fluid reabsorption.
Structure
The rete testis is the network of interconnecting tubules where the straight seminiferous tubules (the terminal part of the seminiferous tubules) empty. It is located within a highly vascular connective tissue in the mediastinum testis. The epithelial cells form a single layer that lines the inner surface of the tubules. These cells are cuboidal, with microvilli and a single cilium on their surface.
Development
In the development of the urinary and reproductive organs, the testis is developed in much the same way as the ovary, originating from mesothelium as well as mesonephros. Like the ovary, in its earliest stages it consists of a central mass covered by a surface epithelium. In the central mass, a series of cords appear. These cords run together toward the future hilum and form a network that ultimately becomes the rete testis.
Function
It appears the function of the rete testis is to mix the sperm as they leave the seminiferous tubules. Sperm leave the seminiferous tubules in the dilute secretions of Sertoli cells. The rete testis does modify the luminal fluids with a limited amount of secretion and reabsorption, but their primary function is to mix and transport the sperm into the efferent ductules, where the major function is reabsorption of about 95% of the fluid, which increases the sperm concentration prior to entering the epididymis.
Clinical significance
Rete tubular ectasia is a disorder of the rete testis characterized by multiple benign cysts.
Etymology
English uses the Neo-Latin name for the structure, which simply means "network of the testis".
Additional images
References
External links
Image at UC Davis
Diagram
Diagram
Scrotum |
https://en.wikipedia.org/wiki/Hauppauge%20Computer%20Works | Hauppauge Computer Works ( ) is a US manufacturer and marketer of electronic video hardware for personal computers. Although it is most widely known for its WinTV line of TV tuner cards for PCs, Hauppauge also produces personal video recorders, digital video editors, digital media players, hybrid video recorders and digital television products for both Windows and Mac. The company is named after the hamlet of Hauppauge, New York, in which it is based.
In addition to its headquarters in New York, Hauppauge also has sales and technical support offices in France, Germany, the Netherlands, Sweden, Italy, Poland, Australia, Japan, Singapore, Indonesia, Taiwan, Spain and the UK.
Company history
Hauppauge was co-founded by Kenneth Plotkin and Kenneth Aupperle, and became incorporated in 1982.
Starting in 1983, the company followed Microway, the company that a year earlier provided the software needed by scientists and engineers to modify the IBM PC Fortran compiler so that it could transparently employ Intel 8087 coprocessors. The 80-bit Intel 8087 math coprocessor ran a factor of 50 faster than the 8/16-bit 8088 CPU that the IBM PC software came with. However, in 1982, the speed-up in floating-point-intensive applications was only a factor of 10 as the initial software developed by Microway and Hauppauge continued to call floating point libraries to do computations instead of placing inline x87 instructions inline with the 8088's instructions that allowed the 8088 to drive the 8087 directly. By 1984, inline compilers made their way into the market providing increased speed ups. Hauppauge provided similar software products in competition with Microway that they bundled with math coprocessors and remained in the Intel math coprocessor business until 1993 when the Intel Pentium came out with a built-in math coprocessor. However, like other companies that entered the math coprocessor business, Hauppauge produced other products that contributed to a field that is today called HPC - high-performance computing.
The math coprocessor business rapidly expanded starting in 1984 with software products that accelerated applications like Lotus 1-2-3. At the same time the advent of the 80286 based IBM PC/AT with its 80287 math coprocessor provided new opportunities for companies that had grown up selling 8087s and supporting software. This included products like Hauppauge's 287 Fast/5, a product that took advantage of the 80287's design that used an asynchronous clock to drive its FPU at 5 MHz instead of the 4 MHz clocking provided by IBM, making it possible for the 80287s that came with the AT to be overclocked to 12 MHz.
By 1987, math coprocessors had become Intel's most profitable product line bringing in competition from vendors like Cyrix whose first product was a math coprocessor faster than the new Intel 80387, but whose speed was stalled by the 80386 that acted as a governor. This is when Andy Grove decided it was time for Intel to recapture its channel |
https://en.wikipedia.org/wiki/Christopher%20Langton |
Christopher Gale Langton (born 1948/49) is an American computer scientist and one of the founders of the field of artificial life. He coined the term in the late 1980s when he organized the first "Workshop on the Synthesis and Simulation of Living Systems" (otherwise known as Artificial Life I) at the Los Alamos National Laboratory in 1987. Following his time at Los Alamos, Langton joined the Santa Fe Institute (SFI), to continue his research on artificial life. He left SFI in the late 1990s, and abandoned his work on artificial life, publishing no research since that time.
He was profiled extensively in chapters 6 and 8 of the book Complexity (1993), by M. Mitchell Waldrop.
Artificial life
Langton made numerous contributions to the field of artificial life, both in terms of simulation and computational models of given problems and to philosophical issues. Early on, he identified the problems of information, computation and reproduction as intrinsically connected with complexity and its basic laws. Inspired by ideas coming from physics, particularly phase transitions, he developed several key concepts and quantitative measures for cellular automata and suggested that critical points separating order from disorder could play a very important role in shaping complex systems, particularly in biology. These ideas were also explored simultaneously, albeit with different approximations, by James P. Crutchfield and Per Bak among others.
While a graduate student at the University of Michigan, Langton created the Langton ant and Langton loop, both simple artificial life simulations, in addition to his lambda parameter, a dimensionless measure of complexity and computation potential in cellular automata, given by a chosen state divided by all the possible states. For a 2-state, 1-r neighborhood, 1D cellular automata the value is close to 0.5. For a 2-state, Moore neighborhood, 2D cellular automata, like Conway's Life, the value is 0.273.
Personal life
Langton is the first-born son of Jane Langton, author of books including the Homer Kelly Mysteries. He has two adult sons: Gabe and Colin. He is an atheist.
Major publications
Christopher G. Langton. "Artificial Life: An Overview". (Editor), MIT Press, 1995.
Christopher G. Langton. "Artificial Life III: Proceedings of the Third Interdisciplinary Workshop on the Synthesis and Simulation of Living Systems". (Editor), Addison-Wesley, 1993.
Christopher G. Langton. "Life at the Edge of Chaos". in "Artificial Life II", Addison-Wesley, 1991.
Christopher G. Langton. "Artificial Life II: Proceedings of the Second Interdisciplinary Workshop on the Synthesis and Simulation of Living Systems". (Editor), Addison-Wesley, 1991.
Christopher G. Langton. "Computation at the edge of chaos". Physica D, 42, 1990.
Christopher G. Langton. "Computation at the edge of Chaos: Phase-Transitions and Emergent Computation." Ph.D. Thesis, University of Michigan (1990).
Christopher G. Langton. "Is There a Sharp Phase Transit |
https://en.wikipedia.org/wiki/A%20Country%20Practice | A Country Practice is an Australian television soap opera/serial which was broadcast on the Seven Network from 18 November 1981 until 22 November 1993, and subsequently on Network Ten from 13 April 1994 to 5 November 1994. Altogether, 14 seasons and 1,088 episodes were produced.
The show was produced at the ATN-7's production facility at Epping, New South Wales, Pitt Town and Oakville, suburbs on the outskirts of northwest Sydney, Australia, were used for most of the exterior filming, with the historic heritage-listed Clare House, built in 1838, serving as the location of the Wandin Valley Bush Nursing Hospital.
Many other fictional locations, including Dr. Terence Elliot's (Shane Porteous) medical practice, Frank and Shirley Gilroy's house Brian Wenzel and Lorrae Desmond, the Wandin Valley Church and Burrigan High School where filmed in the Hawkesbury.
Several of the regular cast members became popular celebrities as a result of their roles in the series. It also featured a number of native Australian animals, particularly the iconic 'Fatso the wombat' adding to its appeal both domestically and internationally. After the series was cancelled by the Seven Network in 1993, the series was relaunched on the Network Ten in 1994.
At the time of its cancellation, A Country Practice was the longest-running Australian TV drama; however, by the late 1990s, that record was surpassed by Network Ten series Neighbours. At the height of its popularity, the show attracted 8–10 million Australian viewers weekly (at a time when the population of Australia was 15 million). The series was eventually sold to, and broadcast in 48 countries.
Creation
A Country Practice creator and executive producer James Davern had previously worked on a similar rural-based series as the producer and director of the long-running Bellbird, which screened on ABC Television (1967–1977). In 1979, he entered the pilot episode for a script contest by Network Ten, which was looking for a new hit soap opera after the demise of Number 96. Davern came third and won a merit award. Although TEN turned the series down, rival TV station Seven Network picked it up. Davern's contribution to the industry was recognised when he was honoured with the Order of Australia (OAM) in 2014.
Production
Format
Though sometimes considered a soap opera, the storylines of the show's two 45 minute episodes screened over any one week formed a self-contained narrative block. The storylines were meant to have a primary appeal to adult and older youthful audiences, and in particular they had greater appeal to children from middle-class backgrounds. As it did not have the open ended narrative of a traditional soap opera, it was technically a "series". Nevertheless, many storylines were developed as sub-plots for several episodes before becoming the focus of a particular week's narrative block. Overall, the program "so emphasized the ongoing storylines of its major characters as to make the distinction between se |
https://en.wikipedia.org/wiki/Family%20Radio | Family Radio, also known by its licensee name Family Stations, Inc., is a non-profit, non-denominational, educational Christian radio network based in Franklin, Tennessee with network operations located in Alameda, California, United States. Established in 1958, Family Radio airs religious music and programming, both past and present, and is listener-supported.
Programming
Family Radio's music programming consists mainly of traditional Christian hymns and other genres within Christian music. For decades, Family Radio avoided any types of Contemporary Christian Music and only played traditional. At some points they played small amounts of very light Christian songs from the 70's, but they avoided anything even moderately contemporary, even softer songs within that genre. In the past year, though, softer Contemporary Christian Music from recent years has been added and mixed in with the traditional music. Contemporary Artists being mixed in range from John Michael Talbot, Steve Green, Christine Wyrtzen, to Casting Crowns, MercyMe, Chris Tomlin, among others. They play about 4 an hour.
One of Family Radio's oldest broadcasts was a telephone-talk program called Open Forum in which Harold Camping, the network's co-founder, president and general manager, responded to callers' questions and comments, as they relate to the Bible, and used the platform to promote his various end-time predictions. The program was finally cancelled not long after Camping's third failed "rapture-less" prediction and a stroke which he suffered in June 2011. Other programs that have aired on Family Radio over the years include the morning programs Rise and Rejoice and The Christian Home; Family Bible Reading Fellowship, a half-hour Bible reading program; Radio Reading Circle, featuring readings of Christian books; the overnight program Nightwatch; Echoes, which features recordings of sermons delivered by pastors from churches around the world); Music to Live By, an afternoon program; the nighttime program The Quiet Hours; Family Bible Study; and Beyond Intelligent Design. Family Radio also has broadcast programs and features from outside ministries, including Answers in Genesis, hosted by Ken Ham, as well as teaching programs hosted by James Montgomery Boice, Donald Barnhouse, John F. MacArthur, R.C. Sproul, John Piper, and Alistair Begg. Some of these ministries were reluctant to allow their programs to air on Family Radio until Harold Camping's programs no longer aired.
Support
Family Radio relies solely on listener-supported funding and donations, and is unaffiliated with any religious denomination.
Outside programming broadcast over the Family Radio network was limited as Camping considered the organized church apostate, and therefore devoid of God's Spirit and under Satan's control.
The listenership of Family Radio understandably declined after the failed 1994 prediction, but before long the organization was growing at a rate much higher than it had previously experie |
https://en.wikipedia.org/wiki/End-to-end%20delay | End-to-end delay or one-way delay (OWD) refers to the time taken for a packet to be transmitted across a network from source to destination. It is a common term in IP network monitoring, and differs from round-trip time (RTT) in that only path in the one direction from source to destination is measured.
Measurement
The ping utility measures the RTT, that is, the time to go and come back to a host. Half the RTT is often used as an approximation of OWD but this assumes that the forward and back paths are the same in terms of congestion, number of hops, or quality of service (QoS). This is not always a good assumption. To avoid such problems, the OWD may be measured directly.
Direct
OWDs may be measured between two points A and B of an IP network through the use of synchronized clocks; A records a timestamp on the packet and sends it to B, which notes the receiving time and calculates the OWD as their difference. The transmitted packets need to be identified at source and destination in order to avoid packet loss or packet reordering. However, this method suffers several limitations, such as requiring intensive cooperation between both parties, and the accuracy of the measured delay is subject to the synchronization precision.
The Minimum-Pairs Protocol is an example by which several cooperating entities, A, B, and C, could measure OWDs between one of them and a fourth less cooperative one (e.g., between B and X).
Estimate
Transmission between two network nodes may be asymmetric, and the forward and reverse delays are not equal. Half the RTT value is the average of the forward and reverse delays and so may be sometimes used as an approximation to the end-to-end delay. The accuracy of such an estimate depends on the nature of delay distribution in both directions. As delays in both directions become more symmetric, the accuracy increases.
The probability mass function (PMF) of absolute error, E, between the smaller of the forward and reverse OWDs and their average (i.e., RTT/2) can be expressed as a function of the network delay distribution as follows:
where a and b are the forward and reverse edges, and fy(z) is the PMF of delay of edge z (that is,
Delay components
End-to-end delay in networks comes from several sources including transmission delay, propagation delay, processing delay and queuing delay.
See also
Age of Information
Minimum-Pairs Protocol
Network delay
Store and forward
References
External links
Sample delay calculations
Computer networking |
https://en.wikipedia.org/wiki/LAN%20Manager | LAN Manager is a discontinued network operating system (NOS) available from multiple vendors and developed by Microsoft in cooperation with 3Com Corporation. It was designed to succeed 3Com's 3+Share network server software which ran atop a heavily modified version of MS-DOS.
History
The LAN Manager OS/2 operating system was co-developed by IBM and Microsoft, using the Server Message Block (SMB) protocol. It originally used SMB atop either the NetBIOS Frames (NBF) protocol or a specialized version of the Xerox Network Systems (XNS) protocol. These legacy protocols had been inherited from previous products such as MS-Net for MS-DOS, Xenix-NET for MS-Xenix, and the afore-mentioned 3+Share. A version of LAN Manager for Unix-based systems called LAN Manager/X was also available. LAN Manager/X was the basis for Digital Equipment Corporation's Pathworks product for OpenVMS, Ultrix and Tru64.
In 1990, Microsoft announced LAN Manager 2.0 with a host of improvements, including support for TCP/IP as a transport protocol for SMB, using NetBIOS over TCP/IP (NBT). The last version of LAN Manager, 2.2, which included an MS-OS/2 1.31 base operating system, remained Microsoft's strategic server system until the release of Windows NT Advanced Server in 1993.
Versions
1987 – MS LAN Manager 1.0 (Basic/Enhanced)
1989 – MS LAN Manager 1.1
1991 – MS LAN Manager 2.0
1992 – MS LAN Manager 2.1
1992 – MS LAN Manager 2.1a
1993 – MS LAN Manager 2.2
1994 – MS LAN Manager 2.2a
Many vendors shipped licensed versions, including:
3Com Corporation 3+Open
HP LAN Manager/X
IBM LAN Server
Tapestry Torus
The Santa Cruz Operation
Password hashing algorithm
The LM hash is computed as follows:
The user's password is restricted to a maximum of fourteen characters.
The user's password is converted to uppercase.
The user's password is encoded in the System OEM code page.
This password is NULL-padded to 14 bytes.
The “fixed-length” password is split into two 7-byte halves.
These values are used to create two DES keys, one from each 7-byte half, by converting the seven bytes into a bit stream with the most significant bit first, and inserting a parity bit after every seven bits (so 1010100 becomes 10101000). This generates the 64 bits needed for a DES key. (A DES key ostensibly consists of 64 bits; however, only 56 of these are actually used by the algorithm. The parity bits added in this step are later discarded.)
Each of the two keys is used to DES-encrypt the constant ASCII string “KGS!@#$%”, resulting in two 8-byte ciphertext values. The DES CipherMode should be set to ECB, and PaddingMode should be set to NONE.
These two ciphertext values are concatenated to form a 16-byte value, which is the LM hash.
Security weaknesses
LAN Manager authentication uses a particularly weak method of hashing a user's password known as the LM hash algorithm, stemming from the mid-1980s when viruses transmitted by floppy disks were the major concern. Although it is based on DES, |
https://en.wikipedia.org/wiki/Accounting%20method%20%28computer%20science%29 | In the field of analysis of algorithms in computer science, the accounting method is a method of amortized analysis based on accounting. The accounting method often gives a more intuitive account of the amortized cost of an operation than either aggregate analysis or the potential method. Note, however, that this does not guarantee such analysis will be immediately obvious; often, choosing the correct parameters for the accounting method requires as much knowledge of the problem and the complexity bounds one is attempting to prove as the other two methods.
The accounting method is most naturally suited for proving an O(1) bound on time. The method as explained here is for proving such a bound.
The method
A set of elementary operations which will be used in the algorithm is chosen and their costs are arbitrarily set to 1. The fact that the costs of these operations may differ in reality presents no difficulty in principle. What is important is that each elementary operation has a constant cost.
Each aggregate operation is assigned a "payment". The payment is intended to cover the cost of elementary operations needed to complete this particular operation, with some of the payment left over, placed in a pool to be used later.
The difficulty with problems that require amortized analysis is that, in general, some of the operations will require greater than constant cost. This means that no constant payment will be enough to cover the worst case cost of an operation, in and of itself. With proper selection of payment, however, this is no longer a difficulty; the expensive operations will only occur when there is sufficient payment in the pool to cover their costs.
Examples
A few examples will help to illustrate the use of the accounting method.
Table expansion
It is often necessary to create a table before it is known how much space is needed. One possible strategy is to double the size of the table when it is full. Here we will use the accounting method to show that the amortized cost of an insertion operation in such a table is O(1).
Before looking at the procedure in detail, we need some definitions. Let be a table, an element to insert, num(T) the number of elements in , and size(T) the allocated size of . We assume the existence of operations create_table(n), which creates an empty table of size , for now assumed to be free, and elementary_insert(T,E), which inserts element into a table that already has space allocated, with a cost of 1.
The following pseudocode illustrates the table insertion procedure:
function table_insert(T, E)
if num(T) = size(T)
U := create_table(2 × size(T))
for each F in T
elementary_insert(U, F)
T := U
elementary_insert(T, E)
Without amortized analysis, the best bound we can show for n insert operations is O(n) — this is due to the loop at line 4 that performs num(T) elementary insertions.
For analysis using the accounting method, we assign a p |
https://en.wikipedia.org/wiki/IBM%20LAN%20Server | IBM LAN Server is a discontinued network operating system introduced by International Business Machines (IBM) in 1988. LAN Server started as a close cousin of Microsoft's LAN Manager and first shipped in early 1988. It was originally designed to run on top of Operating System/2 (OS/2) Extended Edition. The network client was called IBM LAN Requester and was included with OS/2 EE 1.1 by default. (Eventually IBM shipped other clients and supported yet more. Examples include the IBM OS/2 File/Print Client, IBM OS/2 Peer, and client software for Microsoft Windows.) Here the short term LAN Server refers to the IBM OS/2 LAN Server product. There were also LAN Server products for other operating systems, notably AIX—now called Fast Connect—and OS/400.
Version history
Predecessors included IBM PC LAN Program (PCLP). Variants included LAN Server Ultimedia (optimized for network delivery of multimedia files) and LAN On-Demand. Add-ons included Directory and Security Server, Print Services Facility/2 (later known as Advanced Printing), Novell NetWare for OS/2, and LAN Server for Macintosh.
Innovations
LAN Server pioneered certain file and print sharing concepts such as domains (and domain controllers), networked COM ports, domain aliases, and automatic printer driver selection and installation.
See also
LAN messenger
Server Message Block (SMB)
References
Further reading
Computer-related introductions in 1988
LAN Server
Network operating systems
OS/2
Servers (computing) |
https://en.wikipedia.org/wiki/MusE | MusE is computer software, a sequencer for Musical Instrument Digital Interface (MIDI) and audio, with recording and editing abilities. It was originally written by Werner Schweer and now is developed by the MusE development team. It is free software released under GPL-2.0-or-later.
MusE aims to be a complete multitrack virtual studio for Linux. As of 2020, it has no support under other platforms as it relies on Linux-only technologies, such as Advanced Linux Sound Architecture (ALSA). It also supports the Linux Audio Session Handler (LASH).
From version 0.7 on, its music notation abilities were removed to MuseScore. However, they return in 2.0.
From version 2.2 MusE supports the LV2 audio plugin format and the formerly supported Linux Audio Developer's Simple Plugin API (LADSPA), Disposable Soft Synth Interface (DSSI), and Virtual Studio Technology (VST).
From version 4.0 a redesigned user interface has been added.
References
External links
Audio editing software that uses Qt
Audio recording software
Audio software with JACK support
Digital audio workstation software
Free audio editors
Free audio software
Free music software
Music software for Linux |
https://en.wikipedia.org/wiki/Lists%20of%20American%20Jews | These are lists of prominent American Jews, arranged by field of activity.
Academics
Biologists and physicians
Chemists
Computer scientists
Economists
Historians
Linguists
Mathematicians
Philosophers
Physicists
Activists
Activists
Artists
Architects
Cartoonists
Composers
Photographers
Visual artists
Business
Businesspeople
in finance
in media
in real estate
in retail
Entertainers
Composers
Entertainers (actors and musicians)
Legal system
Jurists
Supreme Court Justices
Military
Military
Politicians
Politicians
Sportspeople
Sportspeople
Writers
Authors
Journalists
Playwrights
Poets
References
The Jewish Phenomenon: The 7 Keys to the Wealth of a People, by Steven Silbiger, 2010, Evans Publishing.
Jews,United States |
https://en.wikipedia.org/wiki/Dartmouth%20workshop | The Dartmouth Summer Research Project on Artificial Intelligence was a 1956 summer workshop widely considered to be the founding event of artificial intelligence as a field.
The project lasted approximately six to eight weeks and was essentially an extended brainstorming session. Eleven mathematicians and scientists originally planned to attend; not all of them attended, but more than ten others came for short times.
Background
In the early 1950s, there were various names for the field of "thinking machines": cybernetics, automata theory, and complex information processing. The variety of names suggests the variety of conceptual orientations.
In 1955, John McCarthy, then a young Assistant Professor of Mathematics at Dartmouth College, decided to organize a group to clarify and develop ideas about thinking machines. He picked the name 'Artificial Intelligence' for the new field. He chose the name partly for its neutrality; avoiding a focus on narrow automata theory, and avoiding cybernetics which was heavily focused on analog feedback, as well as him potentially having to accept the assertive Norbert Wiener as guru or having to argue with him.
In early 1955, McCarthy approached the Rockefeller Foundation to request funding for a summer seminar at Dartmouth for about 10 participants. In June, he and Claude Shannon, a founder of information theory then at Bell Labs, met with Robert Morison, Director of Biological and Medical Research to discuss the idea and possible funding, though Morison was unsure whether money would be made available for such a visionary project.
On September 2, 1955, the project was formally proposed by McCarthy, Marvin Minsky, Nathaniel Rochester and Claude Shannon. The proposal is credited with introducing the term 'artificial intelligence'.
The Proposal states:
The proposal goes on to discuss computers, natural language processing, neural networks, theory of computation, abstraction and creativity (these areas within the field of artificial intelligence are considered still relevant to the work of the field).
On May 26, 1956, McCarthy notified Robert Morison of the planned 11 attendees:
For the full period:
1) Dr. Marvin Minsky
2) Dr. Julian Bigelow
3) Professor D.M. Mackay
4) Mr. Ray Solomonoff
5) Mr. John Holland
6) Dr. John McCarthy
For four weeks:
7) Dr. Claude Shannon
8) Mr. Nathaniel Rochester
9) Mr. Oliver Selfridge
For the first two weeks:
10) Dr. Allen Newell
11) Professor Herbert Simon
He noted, "we will concentrate on a problem of devising a way of programming a calculator to form concepts and to form generalizations. This of course is subject to change when the group gets together."
The actual participants came at different times, mostly for much shorter times. Trenchard More replaced Rochester for three weeks and MacKay and Holland did not attend—but the project was set to begin.
Around June 18, 1956, the earliest participants (perhaps only Ray Solomonoff, maybe with Tom Etter) arri |
https://en.wikipedia.org/wiki/Cyberkinetics | Cyberkinetics is an American company with roots tied to the University of Utah. It was co-founded by John Donoghue, Mijail Serruya, Gerhard Friehs of Brown University, and Nicho Hatsopoulos of the University of Chicago. The Braingate technology and related Cyberkinetic’s assets were sold to Blackrock Neurotech (then Blackrock Microsystems) and BrainGate Inc. in 2008.
Funding
Scientists behind the project used $9.3 million in first round funding led by Oxford Bioscience Partners. A 2002 merger with Bionic Technologies, co-founded by Brian Hatt and Richard A. Normann (the inventor of the Utah array) added to a tech team armed with intellectual property rights gained from Brown, MIT, and others. They say they're three to five years away from putting a product on the market.
According to their latest SEC filing, the Founders of the company resigned from the Board of Directors at the end of October 2008.
Merger and renaming
In late 2004, Cyberkinetics initiated a reverse merger with a Texas company in order to gain access to the public market. The resulting company was renamed Cyberkinetics Neurotechnology Systems, Inc. and its shares are listed under the symbol CYKN.OB. In 2009, the BrainGate business and related Cyberkinetic assets were sold to privately held Braingate, Inc. In the same year, Cyberkinetics was acquired by Blackrock Microsystems, LLC. The acquisition included a small team and ownership of neurophysiological recording devices.
Clinical trials
Since July 8, 2009, clinical trials are being conducted for the Brain Gate 2 Neural Interface System. Since July 16, 2009, the pilot clinical trial of the BrainGate2 Neural Interface System is registered at ClinicalTrials.gov.
See also
Brain-computer interface
BrainGate
References
External links
Blackrock Microsystems Official Website
Cyberkinetics Neurotechnology Official Website
Donoghue Lab
Hatsopoulos Lab
BrainGate Official Website
Brain–computer interfacing |
https://en.wikipedia.org/wiki/K%C5%8Dsuke%20Okano | is a Japanese voice actor. He was born in Tokyo, and is often featured on Japanese anime television network Animax as narrator along with fellow voice actor Yukari Tamura.
Filmography
Television animation
Asuka Jr. in Saint Tail (1995)
Maeno in Ping-Pong Club (1995)
Recca Hanabishi in Flame of Recca (1997)
Kuki Jr. in Grander Musashi RV (1998)
Kaname Takasato, Aozaru in Twelve Kingdoms (2002)
Usop, Vincent in Midnight Horror School (2002)
Hot Rod(Hot Shot) in Transformers: Armada (2003)
Sokan Watabe in Sensei no Ojikan (2004)
Yashima-sama in Kamichu (2005)
Mahiro Atori in Hiiro no Kakera (2012)
Cameramon in Digimon Universe: Appli Monsters (2016)
Unknown date
Taichi Miyamoto in Bleach
Haguruma in Boruto: Naruto Next Generations
Tsukado in Naruto Shippuden
Russell Tringum in Fullmetal Alchemist
Noboru Yoshikawa in Great Teacher Onizuka
Kenta Nakamura in Initial D
Daisuke Hayami in Rockman EXE
Hotshot in Transformers Animated
Rikichi Yamada in Nintama Rantarou
Current Okeanos in Saint Seiya Episode.G drama CDs
Yusaku Tsunemura in Baka and Test (second season)
Original video animation
Captain Tsubasa: Holland Youth (1994) (Makoto Soda)
Yamato 2520 (1995) (Carl)
Sokan Watabe in Sensei no Ojikan
Theatrical animation
Crayon Shin-chan: The Storm Called: The Adult Empire Strikes Back (2001) (A sake dealer)
Video games
Metalman and Shadowman in Super Adventure Rockman (1998)
Reiji Azuma/Zwei in Phantom of Inferno (2000)
Werner Blues (Brett Varner) in Growlanser II: The Sense of Justice (2001)
Mahiro Atori in Hiiro no Kakera (2006)
PlayStation Move Heroes (2011) (Lunk)
Drama CDs
Abunai series 2: Abunai Summer Vacation (????)
Baito wa Maid!? (????) (Yuuya Tamura)
Daisuki (????) (Yoshida)
GENE Tenshi wa Sakareru (????) (Arche Yan)
Kageki series 5: Kageki ni Tengoku (????) (angel 3)
Last Order (????) (Yoshihiro Shiho)
Naguru Hakui no Tenshi (????) (Tomoki Igarashi)
Rijichou-sama no Okiniiri (????) (Rentarou Kashiwagi)
Romantist Taste (????) (Kazuma Ehara)
Dubbing
Live-action
The Faculty (Casey Connor (Elijah Wood))
The Hangover Part II (Leslie Chow (Ken Jeong))
The Hangover Part III (Leslie Chow (Ken Jeong))
Monkeybone (Herb (Dave Foley))
Mr. & Mrs. Smith (2008 NTV edition) (Benjamin "The Tank" Danz (Adam Brody))
The O.C. (Seth Cohen (Adam Brody))
Power Rangers In Space (Seymour)
Power Rangers Mystic Force (Xander Bly/Green Mystic Ranger (Richard Brancatisano))
Power Rangers Samurai (Negatron)
The Quick and the Dead (1997 TV Asahi edition) (Fee 'The Kid' Herod (Leonardo DiCaprio))
Road Trip (Barry Manilow (Tom Green))
Scooby-Doo (Scrappy Doo (Scott Innes))
White Squall (Shay Jennings (Jason Marsden))
Animation
Atomic Betty (Sparky)
Courage the Cowardly Dog (The Nowhere Newsman & Di-Lung)
Dexter's Laboratory (Major Glory)
Oscar's Oasis (Suricates)
Recess (Butch)
Spider-Man (Cletus Kasady/Carnage)
References
External links
Animax
1969 births
Living people
Male voice actors from Tokyo
Japanese male voice actors |
https://en.wikipedia.org/wiki/Anne-Mie%20van%20Kerckhoven | Anne-Mie Van Kerckhoven (born 5 December, 1951 in Antwerp) is a Belgian artist whose work involves painting, drawing, computer art and video art.
Biography
Anne-Mie Van Kerckhoven (also known as AMVK) was born in Antwerp and lives in Antwerp and Berlin. In 1981 she founded the noise band Club Moral with Danny Devos. Since 1982 she has been represented by Zeno X Gallery in Antwerp, Belgium, and since 1999 by Galerie Barbara Thumm in Berlin. In 2003 she was awarded the Flanders' Prize for Visual Arts.
In 2005 the HeadNurse-files was published. By means of installation shots, film stills and artistic images, this book presents an overview of the projects' development from 1995 to 2004 and possibly beyond. In 2006 she was awarded a DAAD stipendium to spend one year in Berlin.
In 2022 she will receive an honorary doctor degree from the University of Antwerp.
Life and work
Anne-Mie Van Kerckhoven has been fascinated for a long time with the representation in the mass media of images of women, of interiors, of the kinetic powers of any kind of language. She investigates supra-moral connections in contemporary society between sex and technology. Her work connects different knowledge systems, explores the areas of the unconscious, and looks at moral aberrations or the obscene from a female point of view.
Since 2005 she has been working on a conceptual and pictorial trialogue between the mystic Marguerite Porete, the hermetic Giordano Bruno and the philosopher Herbert Marcuse.
Selected exhibitions
Solo
Anne-Mie Van Kerckhoven, Zeno X Gallery Antwerp, 1995
Morele Herbewapening / Moral Rearmament, Kunsthalle Lophem 1996
HeadNurse, Zeno X Gallery Antwerp, 1998
Nursing care, in melancholy stupor, MuHKA Antwerp, 1999
Prober5, Galerie Barbara Thumm Berlin, 2000
In Dreams, Galerie Barbara Thumm 2003
Deeper, Kunsthalle Lophem 2003
AntiSade, Zeno X Gallery Antwerpen, 2003
How reliable is the brain?, , Aachen, 2004
AMVK – EZFK: Europaisches Zentrum für Futuristische Kunst (Kunsthalle Bern) 2005.
Veerkracht thuis!, Objectif exhibitions Antwerp, 2006
Oh, the Sick Lady / Ah, the Sick Lady (Explodes from Within), Galerie Barbara Thumm Berlin, 2007
Über das ICH (Willkür und Transzendenz) and a lot of fun (daadgalerie Berlin) 2007
Nothing More Natural, Kunstmuseum Luzern Lucerne, 2008
Nothing More Natural, Wiels Center for Contemporary Art, Brussels, 2008
Nothing More Natural, Kunsthalle Nürnberg Nuremberg 2009
On Mars the Rising Sun is Blue, Zeno X Gallery Antwerp, 2009
In a Saturnian World, Renaissance Society Chicago 2011
Mistress of the Horizon, Mu.ZEE Ostend, 2012
3 Carrels (Degenerate Customized Solutions), Zeno X Gallery Antwerp, 2014
Serving Compressed Energy with Vacuum, Kunstverein München München, 2015
AMVK, MuHKA, Antwerp 2018
AMVK, , Kassel, 2018
Group
Woord en Beeld, MuHKA Antwerp, 1992
Trouble spot.painting (MuHKA/NICC) Antwerp 1999
Die Verletzte Diva, Galerie im Taxispalais Berlin, 2000
Dream Extensions Ghent 2004
Dea |
https://en.wikipedia.org/wiki/SOCOM%20U.S.%20Navy%20SEALs%20%28video%20game%29 | SOCOM U.S. Navy SEALs is a tactical shooter video game developed by Zipper Interactive and published by Sony Computer Entertainment for PlayStation 2.
In addition to the 12 offline single player missions, SOCOM also featured online play via the Internet. SOCOM uses a USB headset for its speech recognition commands offline, and allows voice chat with teammates when playing online; this was the first game for the PlayStation 2 to use the headset.
The online servers for this game, along with other PlayStation 2 and PlayStation Portable SOCOM titles, were shut down on August 31, 2012.
Gameplay
The player leads a four-man team (three AI-controlled teammates) of United States Navy SEALs through 12 missions in four regions: Alaska, Thailand, Congo, and Turkmenistan in the then-future of 2006 and 2007. In the single player missions, commands can be spoken using the included USB headset or via an onscreen menu if the optional SOCOM headset was not purchased. Typical missions consist of killing terrorists, rescuing hostages, retrieving intelligence, or destroying terrorist bases.
The player character's codename is Kahuna, while the NPC teammates' codenames are Boomer, Spectre and Jester. The team is divided into two sub-groups, Alpha and Bravo. The Alpha group consists of the player and Boomer (the Able element), while the remaining two make up Bravo. Commands can be issued to both individuals and a whole group, for example it is possible to ask team Bravo to remain stationary while the player is scouting the area with Boomer. However the player can not venture alone through a map, when Kahuna is too far away from Boomer he will automatically resume following the player, regardless of prior orders. Briefings and intel such as maps and photos are given prior to each mission.
Before each mission, the player may choose new equipment for themself and their teammates. Usually this consists of a primary and secondary weapon, along with two pieces of equipment like extra ammunition, explosives and so on. However, on some missions it is required that a team member carries a particular piece of equipment, such as C4 for destroying walls or vehicles. Characters are very vulnerable to enemy fire and may die after just a couple of shots, depending on where one is hit and what weapon is used. It is required that at least one teammate survives along with the player, if not the mission fails.
At the end of each mission, the player is given a rating based on stealth, accuracy and teamwork. These ratings are alphabetical, with "A" being the highest grade. Once the game is completed for the first time, the player unlocks a higher difficulty and can try to complete the game again and again with a progressively higher difficulty.
Online gameplay
Online players choose one of two sides: SEALs or terrorists. Maps consist of three types: suppression (eliminate all members of the opposite team), extraction (rescue hostages) and demolition (capture a satchel and destroy the |
https://en.wikipedia.org/wiki/COSMAC | COSMAC may refer to:
The RCA (CDP)1802 microprocessor, aka RCA COSMAC
The COSMAC ELF an RCA COSMAC microprocessor–based computer released 1976, sold as a kit
The COSMAC VIP an RCA COSMAC microprocessor–based computer aimed at video games, released 1977, sold as a kit |
https://en.wikipedia.org/wiki/Colossal%20Cave | Colossal Cave may refer to:
Colossal Cave (Arizona), cave system in Arizona
Colossal Cavern, cave in Kentucky
Colossal Cave Adventure, 1976 computer game based on Mammoth Cave National Park in Kentucky
Colossal Cave (video game), 2023 reimagining of the 1976 video game
See also
Mammoth Cave (disambiguation)
Grotta Gigante |
https://en.wikipedia.org/wiki/Switch%20and%20Data | Switch and Data Facilities Company, Inc. was a U.S. public corporation that provided network-neutral data centers and Internet exchange services to network-centric businesses. Switch and Data was acquired by Equinix in 2010.
Switch and Data provided services including colocation, interconnection, network connectivity and peering from 34 data center locations. Typically, customers looked to Switch and Data to add scale and interconnectivity to their networks to support increases in IP and network traffic volumes. In addition, customers used Switch and Data's data center facilities to house and power their network infrastructure.
In 2008 Switch and Data expanded by adding over a quarter million square feet of data center capacity, an increase of 34% of their total capacity. Before their purchase by Equinix, Switch and Data's footprint included 23 markets throughout U.S. and Canada and provides power and cooling densities of up to 200 watts per square foot to more than 900 customers. In 2009, the company had announced a $75 million capex budget for further expansion. Switch and Data previously launched their Content and Entertainment and Financial Services Practices to help these industries with low-latency data aggregation and distribution.
Company history
Switch and Data was founded in 1998 by James F. Lavin and Stephen Kelly. In March 2003, Switch and Data acquired PAIX, the world's first commercial Internet peering exchange. The PAIX acquisition gave Switch and Data and strong presence in global Internet peering and added some of the world's leading Internet content and service providers as customers. Between 2004 and 2005, Switch and Data purchased RACO, Meridian Telesis and LayerOne. The company completed an initial public offering of its stock on February 8, 2007, and is currently traded on the NASDAQ exchange under ticker symbol SDXC. Switch and Data is headquartered in Tampa, Florida.
Switch and Data was acquired by Equinix on May 4, 2010 for 683.4 Million.
Products and services
Switch and Data is a North American provider of network-neutral data centers and Internet exchanges. In addition, the company offers services such as colocation, interconnection and remote technical support. The companies’ data centers provide the power, interconnectivity, security, redundancy, cooling and site technical support to house and safeguard its customers’ network and computing equipment.
Switch and Data is a network-neutral provider which means that customers can choose to interconnect with multiple competing carriers across its national footprint of densely interconnected data centers. Customers can exchange traffic and IP content through direct connections with each other, or through many-to-many peering connections on Switch and Data's PAIX Internet exchange. Switch and Data's customers have provisioned approximately 21,100 cross-connects between each other in the company's 34 sites.
Data center locations
Switch and Data has 34 data centers |
https://en.wikipedia.org/wiki/William%20R.%20Corliss | William Roger Corliss (August 28, 1926 – July 8, 2011) was an American physicist and writer who was known for his interest in collecting data regarding anomalous phenomena (including cryptozoology, out-of-place artifacts and unidentified flying objects). Corliss was Charles Fort's most direct successor. Arthur C. Clarke described Corliss as "Fort's latter-day - and much more scientific - successor."
Biography
Starting in 1974, Corliss published a number of works in the "Sourcebook Project". Each volume was devoted to a scientific field (archeology, astronomy, geology, et cetera) and featured articles culled almost exclusively from scientific journals. Corliss was inspired by Charles Fort, who decades earlier also collected reports of unusual phenomena.
Many of the articles in Corliss's works were earlier mentioned in Charles Fort's works. Unlike Fort, known for his idiosyncratic writing style, Corliss initially offered little in the way of his own opinions or editorial comments, preferring to let the articles speak for themselves. Corliss quoted all relevant parts of articles (often reprinting entire articles or stories, including illustrations). In some of his later Sourcebook efforts, such as the mid-1990s Biological Anomalies series, Corliss added his evaluation of both the reliability of the claims, and their ranking as anomalies. Well-documented reports from credible sources are ranked as a "1" while entirely unsubstantiated reports are rated as a "4", with "2" or "3" representing intermediate reports. Similarly, Corliss's uses a rating of "1" for anomalies that cannot be explained by existing scientific theories, while a "4" describes phenomena that are unusual but do not challenge scientific theories.
Corliss wrote many other books and articles, notably including 13 educational books about astronomy, outer space and space travel for NASA and a similar number for the Atomic Energy Commission and the National Science Foundation.
Reception
In his book Unexplained!, Jerome Clark describes Corliss as "essentially conservative in outlook". He explains, "Corliss [is] more interested in unusual weather, ball lighting, geophysical oddities, extraordinary mirages, and the like — in short, anomalies that, while important in their own right, are far less likely to outrage mainstream scientists than those that delighted Fort, such as UFOs, monstrous creatures, or other sorts of extraordinary events and entities."
Arthur C. Clarke said:
The meteorologist Charles A. Doswell has praised the research of Corliss, stating his documentation of anomalies was intriguing. However, the geologist Henry Faul has criticized Corliss. In a review for Handbook of Unusual Natural Phenomena, Faul noted:
In a review for a book that documented astronomical anomalies, the astronomer Joseph Veverka wrote that Corliss had shown negligence of the scientific literature for more than a decade and made incorrect statements. However, Richard Baum wrote a mostly positiv |
https://en.wikipedia.org/wiki/John%20Fitch | John Fitch may refer to:
John Fitch (computer scientist) (born 1945), computer scientist, mathematician and composer
John Fitch (inventor) (1743–1798), early American inventor, built the first steamboat in the United States in 1786
John Fitch, Massachusetts settler for whom Fitchburg, Massachusetts is named
John Fitch (racing driver) (1917–2012), racing driver, inventor of innovative safety devices and descendant of John Fitch (inventor)
John A. Fitch (1881–1959), writer and professor of labor relations
John H. Fitch, namesake of YMCA Camp Fitch in Springfield, Pennsylvania
John Knowles Fitch (1880–1943), founder of Fitch Ratings, Ltd
John Nugent Fitch (1840–1927), botanical illustrator
See also
Jon Fitch (born 1978), U.S. mixed martial arts fighter |
https://en.wikipedia.org/wiki/Anticipation%20%28artificial%20intelligence%29 | In artificial intelligence (AI), anticipation occurs when an agent makes decisions based on its explicit beliefs about the future. More broadly, "anticipation" can also refer to the ability to act in appropriate ways that take future events into account, without necessarily explicitly possessing a model of the future events.
The concept stays in contrast to the reactive paradigm, which is not able to predict future system states.
In AI
An agent employing anticipation would try to predict the future state of the environment (weather in this case) and make use of the predictions in the decision making. For example,
If the sky is cloudy and the air pressure is low,
it will probably rain soon
so take the umbrella with you.
Otherwise
leave the umbrella home.
These rules explicitly take into account possible future events.
In 1985, Robert Rosen defined an anticipatory system as follows:
A system containing a predictive model of itself and/or its environment,
which allows it to change state at an instant in accord
with the model's predictions pertaining to a later instant.
To some extent, Rosen's definition of anticipation applies to any system incorporating machine learning. At issue is how much of a system's behaviour should or indeed can be determined by reasoning over dedicated representations, how much by on-line planning, and how much must be provided by the system's designers.
In animals
Humans can make decisions based on explicit beliefs about the future. More broadly, animals can act in appropriate ways that take future events into account, although they may not necessarily have an explicit cognitive model of the future; evolution may have shaped simpler systemic features that result in adaptive anticipatory behavior in a narrow domain. For example, hibernation is anticipatory behavior, but does not appear to be driven by a cognitive model of the future.
See also
Action selection
Cognition
Dynamic planning
The History of artificial intelligence
MindRACES
Nature and nurture
The Physical symbol system hypothesis
Strong AI
Robert Rosen
Teleonomy
References
External links
MindRACES: From Reactive to Anticipatory Cognitive Embodied Systems, 2004
Artificial intelligence |
https://en.wikipedia.org/wiki/Optimization%20problem | In mathematics, engineering, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions.
Optimization problems can be divided into two categories, depending on whether the variables are continuous or discrete:
An optimization problem with discrete variables is known as a discrete optimization, in which an object such as an integer, permutation or graph must be found from a countable set.
A problem with continuous variables is known as a continuous optimization, in which an optimal value from a continuous function must be found. They can include constrained problems and multimodal problems.
Continuous optimization problem
The standard form of a continuous optimization problem is
where
is the objective function to be minimized over the -variable vector ,
are called inequality constraints
are called equality constraints, and
and .
If , the problem is an unconstrained optimization problem. By convention, the standard form defines a minimization problem. A maximization problem can be treated by negating the objective function.
Combinatorial optimization problem
Formally, a combinatorial optimization problem is a quadruple , where
is a set of instances;
given an instance , is the set of feasible solutions;
given an instance and a feasible solution of , denotes the measure of , which is usually a positive real.
is the goal function, and is either or .
The goal is then to find for some instance an optimal solution, that is, a feasible solution with
For each combinatorial optimization problem, there is a corresponding decision problem that asks whether there is a feasible solution for some particular measure . For example, if there is a graph which contains vertices and , an optimization problem might be "find a path from to that uses the fewest edges". This problem might have an answer of, say, 4. A corresponding decision problem would be "is there a path from to that uses 10 or fewer edges?" This problem can be answered with a simple 'yes' or 'no'.
In the field of approximation algorithms, algorithms are designed to find near-optimal solutions to hard problems. The usual decision version is then an inadequate definition of the problem since it only specifies acceptable solutions. Even though we could introduce suitable decision problems, the problem is more naturally characterized as an optimization problem.
See also
− the optimum need not be found, just a "good enough" solution.
References
External links
Computational problems |
https://en.wikipedia.org/wiki/Novagen%20Software | Novagen Software Ltd (commonly referred to as Novagen) was a British software developer which released a number of computer games on a variety of platforms from the mid-1980s to the early 1990s.
The company was set up by Paul Woakes and Bruce Jordan and employed approximately 18 people. In addition to running Novagen, Paul Woakes also developed and programmed the vast majority of the company's products and the first version of a custom loading scheme that worked ten times faster than Commodore's own, which became Novaload.
Games
Encounter! (1983) Atari 8-bit, (1984) C64
Mercenary (1985) Atari 8-bit, C64, C16, Plus/4, ZX Spectrum, Amstrad CPC, Amiga, Atari ST
Mercenary: The Second City (1986) expansion pack for Mercenary
Mercenary Compendium Edition (1987) Mercenary + The Second City
Backlash (1988) Amiga, Atari ST
Battle Island (1988) C64
Hell Bent (1989) Amiga, Atari ST
Damocles: Mercenary II (1990) Amiga, Atari ST
Damocles: Mission Disk 1 (1991) Amiga, Atari ST
Damocles: Mission Disk 2 (1991) Amiga, Atari ST
Damocles Compendium Edition (1991) Damocles + Mission Disk 1 + Mission Disk 2
Encounter (1991) Amiga, Atari ST
Mercenary III (1992) Amiga, Atari ST
References
External links
The Novagen Team
Defunct video game companies of the United Kingdom
Software companies of the United Kingdom |
https://en.wikipedia.org/wiki/Temporally%20ordered%20routing%20algorithm | The Temporally Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad hoc networks.
It was developed by Vincent Park and Scott Corson at the University of Maryland and the Naval Research Laboratory. Park has patented his work, and it was licensed by Nova Engineering, who are marketing a wireless router product based on Park's algorithm.
Operation
The TORA attempts to achieve a high degree of scalability using a "flat", non-hierarchical routing algorithm. In its operation the algorithm attempts to suppress, to the greatest extent possible, the generation of far-reaching control message propagation. In order to achieve this, the TORA does not use a shortest path solution, an approach which is unusual for routing algorithms of this type.
TORA builds and maintains a Directed Acyclic Graph (DAG) rooted at a destination. No two nodes may have the same height.
Information may flow from nodes with higher heights to nodes with lower heights. Information can therefore be thought of as a fluid that may only flow downhill. By maintaining a set of totally ordered heights at all times, TORA achieves loop-free multipath routing, as information cannot 'flow uphill' and so cross back on itself.
The key design concepts of TORA is localization of control messages to a very small set of nodes near the occurrence of a topological change. To accomplish this, nodes need to maintain the routing information about adjacent (one hop) nodes. The protocol performs three basic functions:
Route creation
Route maintenance
Route erasure
During the route creation and maintenance phases, nodes use a height metric to establish a directed acyclic graph (DAG) rooted at destination. Thereafter links are assigned based on the relative height metric of neighboring nodes. During the times of mobility the DAG is broken and the route maintenance unit comes into picture to reestablish a DAG routed at the destination.
Timing is an important factor for TORA because the height metric is dependent on the logical time of the link failure.
TORA's route erasure phase is essentially involving flooding a broadcast clear packet (CLR) throughout the network to erase invalid routes
Route creation
A node which requires a link to a destination because it has no downstream neighbours for it sends a QRY (query) packet and sets its (formerly unset) route-required flag. A QRY packet contains the destination id of the node a route is sought to. The reply to a query is called an update UPD packet. It contains the height quintuple of the neighbour node answering to a query and the destination field which tells for which destination the update was meant for.
A node receiving a QRY packet does one of the following:
If its route required flag is set, this means that it doesn't have to forward the QRY, because it has itself already issued a QRY for the destination, but better discard it to prevent message overhead.
If the node has no downstream lin |
https://en.wikipedia.org/wiki/Apple%20Cinema%20Display | The Apple Cinema Display is a line of flat-panel computer monitors developed and sold by Apple Inc. between 1999 and 2011. It was initially sold alongside the older line of Studio Displays, but eventually replaced them. Apple offered 20, 22, 23, 24, 27, and 30-inch sizes, with the last model being a 27-inch size with LED backlighting.
There have been three designs for the Cinema Display, one featuring polycarbonate plastic and two featuring anodized aluminum. The first displays were designed to match the colorful plastic of the Power Mac G3 and later the Power Mac G4, while the second revisions were designed to match the aluminum aesthetics of the Power Mac G5 and PowerBook G4. The last available design matched the unibody laptops released in October 2008.
The Apple Cinema Display name was retired in July 2011 with the introduction of the Apple Thunderbolt Display, and the Cinema Display models were no longer offered on the Apple Store website as of August 2014.
Models
Cinema Display
The first model—the 22-inch Apple Cinema Display—was introduced in September 1999 alongside the Power Mac G4 and used DVI for video input. It was enclosed in a high-density plastic frame with an easel-style stand and had a display resolution of 1600×1024.
This model was upgraded in July 2000 with the Apple Display Connector (ADC), which ran DVI, USB, and 28V power through a single connector.
It was eventually replaced by a 20-inch model on January 28, 2003, that sported a widescreen display with up to 1680×1050 resolution and a brightness of 230 cd/m2.
The 20" Cinema Display was updated again June 28, 2004 to match the aluminum design of the new Cinema HD Display. It retained the 1680x1050 resolution of the previous model but saw its brightness increased to 250 cd/m2, and was introduced at a $1,299 USD price point. Apple continued to sell this display with no further changes until October 2008.
Cinema HD Display
The 23-inch model, dubbed the "Cinema HD Display," was introduced on March 20, 2002, and supported full 1:1 1080p playback on a 1920x1200 pixel display.
On June 28, 2004, Apple introduced a redesigned line of Cinema Displays, along with a new 30-inch model that, like the 23-inch model, carried the "Cinema HD Display" name. The new models had an anodized aluminum enclosure that matched Apple's high-end lines of professional products. An alternative stand or a wall mount could be used with a VESA mount adapter kit that was sold separately. Though the display enclosures had not been redesigned for a long period of time, several "silent" improvements were made to the brightness levels and contrast ratios.<ref>{{cite web | last = Taghap | first = Herschell | date = March 28, 2006 | url = https://arstechnica.com/gadgets/2006/03/3369/ | title = Apple's 30 Cinema Display gets quiet upgrade | publisher = Ars Technica | access-date =August 3, 2010}}</ref>
30-inch model compatibility
Due to the high resolution (2560×1600), the 30-inch model requires a |
https://en.wikipedia.org/wiki/Zenith%20MinisPort | The Zenith MinisPort (styled as minisPORT) is a subnotebook based on an 80C88 CMOS CPU running at two software selectable speeds: 4.77 MHz or 8 MHz. It was released in 1989 by Zenith Data Systems (ZDS).
It had 1 (model ZL-1) or 2 MB (model ZL-2) of RAM, ran MS-DOS 3.3 Plus from ROM, had a 640×200 LCD display and CGA and composite monochrome outputs. The MinisPort was one of the first actual subnotebooks, apart from a contemporary NEC model.
Features
Internal 2-inch "LT" floppy disk drive (793 KB formatted, double-sided, double-density, 80 tracks, 245 tpi, media: Fujifilm LT-1). The floppy disks typically cost $80 for ten of them. The disks were not compatible with two-inch "VF" video floppy diskettes.
An external standard 3.5-inch 720 KB double-density floppy drive was available as well.
Built-in FastLynx transfer software that could install itself on any other DOS computer over a serial cable without the need for any pre-existing software on the remote system. It relied on the user typing in a DOS mode command on the other computer, which transferred control of that computer's command line to the Zenith over the serial line. The software then copied itself across, and the user could then move files. This to some extent compensated for the fact that no other computer ever used the 2-inch floppy disks, thus rendering floppy transfers impractical.
The ability to set aside some of its upper memory (typically the 384 KB area between 640 KB and 1 MB) as a battery-backed RAM disk; this was relatively unique in DOS-based laptops (others, like the Toshiba T1000 also supported RAM disks). The RAM disk appeared as C: in DOS and enabled the computer to run with no spinning disks, extending battery life and increasing reliability. Contents were preserved with the power off, though using a minuscule amount of current from the main battery.
Later versions included an integral 20 MB hard disk. This was enough to run WordPerfect and associated programs, including spell-checkers and diagnostic programs.
Dimensions
The MinisPort is 12.5-inch wide × 9.8-inch deep × 1.29-inch tall (318 mm × 249 mm × 33 mm), (lid closed), 7.75-inch (197 mm) tall (lid open). It weighs 5.9 lb (2.7 kg) with the battery.
References
External links
Full specification and photographs (in Spanish)
Lots of documentation and photographs (in English)
Newsletters on the Minisport Laptop Hacker (ZIP-file, documents in English)
Webpage maintained by the original author of the Minisport Laptop Hacker, including how to delete the hardware password.
Subnotebooks
MinisPort |
https://en.wikipedia.org/wiki/Bruce%20Eckel | Bruce Eckel (born ) is a computer programmer, author, and consultant.
Eckel's best known works are Thinking in Java and the two-volume series Thinking in C++, aimed at programmers wanting to learn the Java or C++ programming languages, respectively, particularly those with little experience of object-oriented programming.
Eckel was a founding member of the ANSI/ISO C++ standard committee.
Views on computing
In 2011, Eckel extolled the virtues of the Go programming language as a natural successor to C++:
See also
ISO/IEC 14882 - C++ standard
References
Bibliography
Computer Interfacing with Pascal & C, Bruce Eckel. Eisys 1988, .
Using C++, Bruce Eckel. Osborne/McGraw-Hill 1989, .
C++ Inside & Out, Bruce Eckel. Osborne/McGraw-Hill 1993, .
Blackbelt C++: The Masters Collection, Edited by Bruce Eckel. M&T/Holt 1994, .
Thinking in C++: Introduction to Standard C++, Volume One (2nd Edition), Bruce Eckel. Prentice-Hall PTR 2000, . Available for free download
Thinking in C++, Vol. 2: Practical Programming, 2nd Edition, Bruce Eckel and Chuck Allison. Prentice-Hall PTR, 2003. . Available for free download
Thinking in Java, 4th Edition, Bruce Eckel. Prentice-Hall PTR, 2006. .
"First Steps in Flex", Bruce Eckel and James Ward. MindView, Inc., 2008. .
"Atomic Scala", Bruce Eckel and Dianne Marsh. Mindview, LLC, 2013. .
"On Java 8", Bruce Eckel, MindView LLC, 2017. .
"Atomic Kotlin", Bruce Eckel & Svetlana Isakova, MindView LLC, 2021. .
External links
Computing Thoughts- Eckel's blog
Interview with Bruce Eckel by Clay Shannon
List of other interviews with him
Latest news on upcoming book Atomic Kotlin
MindView - Eckel's company
- Eckel on building corporate cultures that increase employee happiness and thus employee productivity, O'Reilly Open Source Convention, 2013
People in information technology
American technology writers
1957 births
Living people |
https://en.wikipedia.org/wiki/Distributed%20Interactive%20Simulation | Distributed Interactive Simulation (DIS) is an IEEE standard for conducting real-time platform-level wargaming across multiple host computers and is used worldwide, especially by military organizations but also by other agencies such as those involved in space exploration and medicine.
History
The standard was developed over a series of "DIS Workshops" at the Interactive Networked Simulation for Training symposium, held by the University of Central Florida's Institute for Simulation and Training (IST). The standard itself is very closely patterned after the original SIMNET distributed interactive simulation protocol, developed by Bolt, Beranek and Newman (BBN) for Defense Advanced Research Project Agency (DARPA) in the early through late 1980s. BBN introduced the concept of dead reckoning to efficiently transmit the state of battle field entities.
In the early 1990s, IST was contracted by the United States Defense Advanced Research Project Agency to undertake research in support of the US Army Simulator Network (SimNet) program. Funding and research interest for DIS standards development decreased following the proposal and promulgation of its successor, the High Level Architecture (simulation) (HLA) in 1996. HLA was produced by the merger of the DIS protocol with the Aggregate Level Simulation Protocol (ALSP) designed by MITRE.
There was a NATO standardisation agreement (STANAG 4482, Standardised Information Technology Protocols for Distributed Interactive Simulation (DIS), adopted in 1995) on DIS for modelling and simulation interoperability. This was retired in favour of HLA in 1998 and officially cancelled in 2010 by the NATO Standardization Agency (NSA).
The DIS family of standards
DIS is defined under IEEE Standard 1278:
IEEE 1278-1993 - Standard for Distributed Interactive Simulation - Application protocols
IEEE 1278.1-1995 - Standard for Distributed Interactive Simulation - Application protocols
IEEE 1278.1-1995 - Standard for Distributed Interactive Simulation - Application protocols (Corrections)
IEEE 1278.1A-1998 - Standard for Distributed Interactive Simulation - Application protocols Errata (May 1998)
IEEE 1278.1-2012 - Standard for Distributed Interactive Simulation - Application protocols
IEEE-1278.2-1995 - Standard for Distributed Interactive Simulation - Communication Services and Profiles
IEEE 1278.3-1996 - Recommended Practice for Distributed Interactive Simulation - Exercise Management and Feedback
IEEE 1278.4-1997 - Recommended Practice for Distributed Interactive - Verification Validation & Accreditation
IEEE P1278.5-XXXX - Fidelity Description Requirements (never published)
In addition to the IEEE standards, the Simulation Interoperability Standards Organization (SISO) maintains and publishes an "enumerations and bit encoded fields" document yearly. This document is referenced by the IEEE standards and used by DIS, TENA and HLA federations. Both PDF and XML versions are available.
Current status
SISO, a s |
https://en.wikipedia.org/wiki/Linux%20Virtual%20Server | Linux Virtual Server (LVS) is load balancing software for Linux kernel–based operating systems.
LVS is a free and open-source project started by Wensong Zhang in May 1998, subject to the requirements of the GNU General Public License (GPL), version 2. The mission of the project is to build a high-performance and highly available server for Linux using clustering technology, which provides good scalability, reliability and serviceability.
Overview
The major work of the LVS project is now to develop advanced IP load balancing software (IPVS), application-level load balancing software (KTCPVS), and cluster management components.
IPVS: an advanced IP load balancing software implemented inside the Linux kernel. The IP Virtual Server code is merged into versions 2.4.x and newer of the Linux kernel mainline.
KTCPVS: implements application-level load balancing inside the Linux kernel, still under development.
LVS can be used for building highly scalable and highly available network services, such as web, email, media and VoIP services, and integrating scalable network services into large-scale reliable e-commerce or e-government applications. LVS-based solutions already have been deployed in many real applications throughout the world, including Wikipedia.
The LVS components depend upon the Linux Netfilter framework, and its source code is available in the net/netfilter/ipvs subdirectory within the Linux kernel source. LVS is able to handle UDP, TCP layer-4 protocols as well as FTP passive connection by inspecting layer-7 packets. It provides a hierarchy of counters in the /proc directory.
The userland utility program used to configure LVS is called ipvsadm, which requires superuser privileges to run.
Schedulers
LVS implements several balancing schedulers, listed below with the relevant source files:
Round-robin (ip_vs_rr.c)
Weighted round-robin (ip_vs_wrr.c)
Least-connection (ip_vs_lc.c)
Weighted least-connection (ip_vs_wlc.c)
Locality-based least-connection (ip_vs_lblc.c)
Locality-based least-connection with replication (ip_vs_lblcr.c)
Destination hashing (ip_vs_dh.c)
Source hashing (ip_vs_sh.c)
Shortest expected delay (ip_vs_sed.c)
Never queue (ip_vs_nq.c)
Maglev hashing (ip_vs_mh.c)
Glossary
Commonly used terms include the following:
LVS director: load balancer that receives all incoming client requests for services and directs them to a specific "real server" to handle the request
Real servers: nodes that make up an LVS cluster which are used to provide services on the behalf of the cluster
Client computers: computers requesting services from the virtual server
VIP (Virtual IP address): the IP address used by the director to provide services to client computers
RIP (Real IP address): the IP address used to connect to the cluster nodes
DIP (Directors IP address): the IP address used by the director to connect to network of real IP addresses
CIP (Client IP address): the IP address assigned to a client computer, that |
https://en.wikipedia.org/wiki/Stockholm%20International%20Peace%20Research%20Institute | Stockholm International Peace Research Institute (SIPRI) is an international institute based in Stockholm. It was founded in 1966 and provides data, analysis and recommendations for armed conflict, military expenditure and arms trade as well as disarmament and arms control. The research is based on open sources and is directed to decision-makers, researchers, media and the interested public.
SIPRI's organizational purpose is to conduct scientific research in issues on conflict and cooperation of importance for international peace and security, with the goal of contributing to an understanding for the conditions for a peaceful solution of international conflicts and sustainable peace.
SIPRI was ranked among the top three non-US world-wide think tanks in 2014 by the University of Pennsylvania Lauder Institute's Global Go To Think Tanks Report. In 2020, SIPRI ranked 34th amongst think tanks globally.
History
In 1964, Prime Minister of Sweden Tage Erlander put forward the idea of establishing a peace research institute to commemorate Sweden's 150 years of unbroken peace.
A Swedish Royal Commission chaired by Ambassador Alva Myrdal proposed in its 1966 report to establish an institute, later named the Stockholm International Peace Research Institute, SIPRI. The institute's research should seek to contribute to "the understanding of the preconditions for a stable peace and for peaceful solutions of international conflicts" and the Commission recommended that research be concentrated on armaments, their limitation and reduction, and arms control. The commission also recommended that SIPRI work is of "an applied research character directed towards practical-political questions [which] should be carried on in a constant interchange with research of a more theoretical kind".
SIPRI has built its reputation and standing on competence, professional skills, and the collection of hard data and precise facts, rendering accessible impartial information on weapon developments, arms transfers and production, military expenditure, as well as on arms limitations, reductions and disarmament. The task of the institute is to conduct "scientific research on questions of conflict and cooperation of importance for international peace and security with the aim of contributing to an understanding of the conditions for peaceful solution of international conflicts and for a stable peace".
The Swedish Riksdag decided that the Institute be established on 1 July 1966 with the legal status of an independent foundation.
Organisation
SIPRI's organisation consists of a governing board, director, deputy director, research staff collegium and support staff. The governing board takes decisions on important matters concerning the research agenda, activities, organisation and financial administration of the institute. Other matters are decided by the director. The research staff collegium advises the Director on research matters.
The staff of 84 employees is mainly international |
https://en.wikipedia.org/wiki/Ivar%20Jacobson | Ivar Hjalmar Jacobson (born 1939) is a Swedish computer scientist and software engineer, known as major contributor to UML, Objectory, Rational Unified Process (RUP), aspect-oriented software development and Essence.
Biography
Ivar Jacobson was born in Ystad, Sweden, on September 2, 1939. He received his Master of Electrical Engineering degree at Chalmers Institute of Technology in Gothenburg in 1962. After his work at Ericsson, he formalized the language and method he had been working on in his PhD at the Royal Institute of Technology in Stockholm in 1985 on the thesis Language Constructs for Large Real Time Systems.
After his master's degree, Jacobson joined Ericsson and worked in R&D on computerized switching systems AKE and AXE including PLEX. After his PhD thesis in April 1987, he started Objective Systems with Ericsson as a major customer. A majority stake of the company was acquired by Ericsson in 1991, and the company was renamed Objectory AB. Jacobson developed the software method Object-Oriented Software Engineering (OOSE) published 1992, which was a simplified version of the commercial software process Objectory (short for Object Factory).
In October, 1995, Ericsson divested Objectory to Rational Software and Jacobson started working with Grady Booch and James Rumbaugh, known collectively as the Three Amigos.
When IBM bought Rational in 2003, Jacobson decided to leave, after he stayed on until May 2004 as an executive technical consultant.
In mid-2003 Jacobson formed Ivar Jacobson International (IJI) which operates across three continents with offices in the UK, the US, Sweden, Switzerland, China, and Singapore.
Work
Ericsson
In 1967 at Ericsson, Jacobson proposed the use of software components in the new generation of software controlled telephone switches Ericsson was developing. In doing this he invented sequence diagrams, and developed collaboration diagrams. He also used state transition diagrams to describe the message flows between components.
Jacobson saw a need for blueprints for software development. He was one of the original developers of the Specification and Design Language (SDL). In 1976, SDL became a standard in the telecoms industry.
At Objectory he also invented use cases as a way to specify functional software requirements.
Rational Software
At Rational, Jacobson and his friends, Grady Booch and James Rumbaugh, designed the UML and his Objectory Process evolved to become the Rational Unified Process under the leadership of Philippe Kruchten.
Essential Unified Process
In November 2005, Jacobson announced the Essential Unified Process or “EssUP” for short. EssUP was a new “Practice”-centric software development process derived from established software development practices. It integrated practices sourced from three different process camps: the unified process camp, the agile software development camp and the process improvement camp. Each one of them contributed different capabilities: structure, ag |
https://en.wikipedia.org/wiki/Tuple-versioning | Tuple-versioning (also called point-in-time) is a mechanism used in a relational database management system to store past states of a relation. Normally, only the current state is captured.
Using tuple-versioning techniques, typically two values for time are stored along with each tuple: a start time and an end time. These two values indicate the validity of the rest of the values in the tuple.
Typically when tuple-versioning techniques are used, the current tuple has a valid start time, but a null value for end time. Therefore, it is easy and efficient to obtain the current values for all tuples by querying for the null end time.
A single query that searches for tuples with start time less than, and end time greater than, a given time (where null end time is treated as a value greater than the given time) will give as a result the valid tuples at the given time.
For example, if a person's job changes from Engineer to Manager, there would be two tuples in an Employee table, one with the value Engineer for job and the other with the value Manager for job. The end time for the Engineer tuple would be equal to the start time for the Manager tuple.
The pattern known as log trigger uses this technique to automatically store historical information of a table in a database.
See also
Temporal database
Bitemporal data
Log trigger
References
Comparison of Access Methods for Time-Evolving Data, by Betty Salzberg and Vassilis J. Tsotras, ACM Computing Surveys, Vol. 31, No. 2, June 1999.
Data modeling |
https://en.wikipedia.org/wiki/Romance%20of%20the%20Three%20Kingdoms%20%28disambiguation%29 | Romance of the Three Kingdoms is a novel written by Luo Guanzhong.
Romance of the Three Kingdoms may also refer to:
Romance of the Three Kingdoms (video game series), computer/video game series by Koei
Romance of the Three Kingdoms (TV series), 1994 CCTV television series
Three Kingdoms (TV series), 2010 TV series, directed by Gao Xixi
San Guo Zhi (manhua), by Lee Chi Ching
Romance of the Three Kingdoms (2009 animation), Chinese-Japanese joint product animation
See also
Records of the Three Kingdoms (disambiguation)
Three Kingdoms (disambiguation) |
https://en.wikipedia.org/wiki/Almacelles | Almacelles () is a town in the comarca of Segrià, in Catalonia, Spain with a population of 6,800 as of 2016.
References
External links
Government data pages
Municipalities in Segrià |
https://en.wikipedia.org/wiki/National%20Automated%20Fingerprint%20Identification%20System | The National Automated Fingerprint Identification System (NAFIS) is an Australian fingerprint and palm print database and matching system to assist law enforcement agencies across Australia and the Department of Immigration and Border Protection to establish the identity of persons and to help solve crimes and for other purposes.
NAFIS was established in 1986, and an upgraded system commenced operations in April 2001 and provides technological improvements in fingerprint matching.
It has shown to be really reliable in fingerprint matching.
References
Law enforcement in Australia
Biometric databases |
https://en.wikipedia.org/wiki/Ascendancy%20%28video%20game%29 | Ascendancy is a 4X science fiction turn-based strategy computer game. It was originally released for MS-DOS in 1995 and was updated and re-released for iOS in 2011 by The Logic Factory. Ascendancy is a galactic struggle to become the dominant life form, hence the title. The game's introductory cinematic states: "Wildly different cultures competed for the same worlds. In the enormous upheaval that followed, one of these species would gain ascendancy."
The iOS version of Ascendancy was a Universal app, meaning it was designed for both the iPad and the iPhone / iPod touch platforms.
The original Ascendancy was released during a golden age of 4X space games in the mid-1990s. Several reviewers praised the game for having great graphics being entertaining, and being fun to play.
The original version of the game won the Software Publisher's Association Codie award for Best Strategy Software of 1996, as voted on by games industry members.
The music of the game was composed by Nenad Vugrinec.
Gameplay
In Ascendancy the player takes on the role of leader of an alien species, tasked with guiding their people into space to explore and colonize other worlds. The player does this by building structures and space ships, researching technology and growing stronger through war or diplomacy.
Players begin with a single colony planet which must be developed. They can select several types of buildings to construct on the planet's surface and can eventually construct spaceships and leave the planet altogether. Ships travel to other solar systems along determined paths, called star lanes. Spaceships can peacefully colonize unoccupied planets or invade inhabited planets and usurp structures. They can also do battle with enemy planets or other ships.
Ascendancy's primary display is a three-dimensional rotatable model of the star cluster, which details the star cluster's solar systems, starlanes, and civilizations. The player can "zoom in" to view rotatable models of solar systems (including planets and ships); view a planet's surface and use various screens to manage their fleet, planets and research. This play style is similar to the Master of Orion series.
Planets
On each planet the player must manage three areas of development: Research, Industry and Prosperity. Research points are shared among all colonies and allow the player to learn new technology, such as advanced building structures or spaceship components. Industry, meanwhile, is local to each colony and determines how quickly that planet can complete projects. Prosperity determines how quickly a planet's population will grow, providing additional workers for future construction. Players begin with the ability to construct buildings for each of these areas and can discover more as the game progresses.
Planet topography is expressed as various colored squares. White squares are general purpose, where any structure can be built. Green squares increase the output of Prosperity-producing buildings, whil |
https://en.wikipedia.org/wiki/Hay%20Inclined%20Plane | The Hay Inclined Plane is a canal inclined plane in the Ironbridge Gorge in Shropshire, with a height of . It was located at the end of the Shropshire Canal, part of a network of canals that linked the industrial region of east Shropshire with the River Severn. The inclined plane was in operation from 1793 to 1894. It can be visited as part of the Blists Hill Victorian Town and is also a waypoint on the South Telford Heritage Trail.
History
The proprietors of the Shropshire Canal held a competition in 1788 to find the best means of raising and lowering heavy weights between the canal and the river Severn. They selected a design by Henry Williams and James Loudon, which was also used at a number of other inclined planes in east Shropshire. Construction of the Hay inclined plane was completed in 1793. By 1820 it was in poor condition and substantial repairs were needed. Further repairs were also carried out in the 1840s.
In 1857 the Hay inclined plane was taken over by the London and North Western Railway. The following year the LNWR closed the Shropshire canal between the Wrockwardine Wood and Windmill inclined planes, leaving only a short section of canal to serve the industrial area of Blists Hill. In 1861 they opened the Coalport branch line from Wellington to Coalport which passed underneath the Hay inclined plane near Coalport.
The last recorded use of the Hay inclined plane was thought to be in 1894 and it was formally closed in 1907. It was restored in 1968 and again in 1975, including the reinstatement of rails, as part of the creation of the Ironbridge Gorge Museums.
Operation
The Shropshire Canal used box-shaped tub boats long with a load capacity of 5 tons. Twin railway tracks were laid down the incline. The tub boats ascended and descended the inclined plane on wheeled cradles which ran on the rails. At the bottom of the incline the rails went underwater allowing the cradle to become submerged and the tub boat to either float free or be floated into position. At the top of the incline the rails also started under water then climbed a short slope out of the water to the top of the incline.
In operation an empty boat would be loaded into the bottom cradle and a full boat would be loaded into the top cradle. A rope would be attached to the loaded top cradle and it would be drawn out of the water to the top of the incline using a small winding drum driven by a steam engine. The main incline rope would then be attached to the cradle and the loaded boat would descend the incline, counterbalanced by an empty boat ascending on the other rail line. The speed would be controlled by a brake on the main winding drum. On reaching the summit a rope from the small winding drum would be attached to the cradle to control its descent into the upper basin.
Although the loaded boats were travelling downhill, and so the plane was mostly worked by gravity, a small steam engine was also provided and drove the winding drums. This was of Adam Heslop |
https://en.wikipedia.org/wiki/Ad%20blocking | Ad blocking or ad filtering is a software capability for blocking or altering online advertising in a web browser, an application or a network. This may be done using browser extensions or other methods.
History
The first ad blocker was Internet Fast Forward, a plugin for the Netscape Navigator browser, developed by PrivNet and released in 1996. The AdBlock extension for Firefox was developed in 2002, with Adblock Plus being released in 2006. uBlock (now called uBlock Origin) was first released in 2014.
Technologies and native countermeasures
Online advertising exists in a variety of forms, including web banners, pictures, animations, embedded audio and video, text, or pop-up windows, and can even employ audio and video autoplay. Many browsers offer some ways to remove or alter advertisements: either by targeting technologies that are used to deliver ads (such as embedded content delivered through browser plug-ins or via HTML5), targeting URLs that are the source of ads, or targeting behaviors characteristic of ads (such as the use of HTML5 AutoPlay of both audio and video).
Prevalence
Use of mobile and desktop ad blocking software designed to remove traditional advertising grew by 41% worldwide and by 48% in the U.S. between Q2 2014 and Q2 2015. As of Q2 2015, 45 million Americans were using ad blockers. In a survey research study released Q2 2016, Met Facts reported 72 million Americans, 12.8 million adults in the UK, and 13.2 million adults in France were using ad blockers on their PCs, smartphones, or tablet computers. In March 2016, the Internet Advertising Bureau reported that UK ad blocking was already at 22% among people over 18 years old.
As of 2021, 27% of US Internet users used ad blocking software, a trend that has been increasing since 2014.
Among technical audiences the rate of blocking reaches 58% as of 2021.
Benefits
For users, the benefits of ad blocking software include quicker loading and cleaner looking web pages with fewer distractions, protection from malvertising, stopping intrusive actions from ads, reducing the amount of data downloaded by the user, lower power consumption, privacy benefits gained through the exclusion of web tracking, and preventing undesirable websites from making ad revenue out of the user's visit.
Publishers and their representative trade bodies, on the other hand, argue that web ads provide revenue to website owners, which enable the website owners to create or otherwise purchase content for the website. Publishers state that the prevalent use of ad blocking software and devices could adversely affect website owner revenue.
User experience
Ad blocking software may have other benefits to users' quality of life, as it decreases Internet users' exposure to advertising and marketing industries, which promote the purchase of numerous consumer products and services that are potentially harmful or unhealthy and on creating the urge to buy immediately. The average person sees more than 5000 advertis |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.