source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/List%20of%20acquisitions%20by%20Cisco | Cisco Systems, Inc., commonly known as Cisco, is an American computer networking company. Cisco made its first acquisition in 1993, which was followed by a series of further acquisitions.
History
Founded in 1984, Cisco did not acquire a company during the first seven years of its existence; but, on September 24, 1993, Cisco acquired Crescendo Communications, a LAN switching company. Following the first Cisco takeover purchase, acquisitions have constituted 50 percent of the company's business activity.
The company's largest acquisition is the purchase of Splunk—a software company that develops software for the analysis and monitoring of machine-generated data—28 billion. Cisco's previous largest acquisition was tied between Cerent Corporation and Scientific Atlanta for $6.9 billion in 1999 and 2005 respectively.
The majority of companies acquired by Cisco are based in the United States (U.S.) and a total of 149 companies have been acquired . Most of the companies acquired by Cisco are related to computer networking, with several LAN switching and Voice over Internet Protocol (VoIP) companies included in the list of acquisitions.
Acquisitions
Each acquisition is for the respective company in its entirety, unless otherwise specified, and the date of the agreement between Cisco Systems and the subject of the acquisition is listed. The value of each acquisition is listed in the US$ currency because Cisco Systems is headquartered in California, U.S.
The majority of its products and business units have come from acquisitions, with Cisco Systems spending more than $70 billion to acquire approximately 218 organizations as of October 2021.
See also
Composite Software
References
External links
Official website (Acquisitions)
Cisco Systems |
https://en.wikipedia.org/wiki/3dmiX | 3dmiX is a computer program for BeOS that displays each track of an audio as an object on the virtual 3D sound stage and allows the users to modify its panning and volume by dragging the object around. The program was previously named 3dsound and also Benoit's Mix after its creator, Benoit Schillings, now CTO at Google X. The program is often cited as an example of a cool application for BeOS.
References
External links
3dmiX: Better track visualization by Yasser Malaika.
BeOS software |
https://en.wikipedia.org/wiki/Microsoft%20Servers | Microsoft Servers (previously called Windows Server System) is a discontinued brand that encompasses Microsoft software products for server computers. This includes the Windows Server editions of the Microsoft Windows operating system, as well as products targeted at the wider business market. Microsoft has since replaced this brand with Microsoft Azure, Microsoft 365 and Windows 365.
Servers
Operating system
The Windows Server family of operating systems consists of Windows operating systems developed and licensed for use on server computers. This family started with Windows Server 2003, for which Microsoft released a major upgrade every four years and a minor upgrade every two years following a major release.
This family has branded members too, such as Windows Home Server, Windows HPC Server and Windows MultiPoint Server.
Windows components
The following products are shipped as Windows component, as opposed to standalone products.
Internet Information Services (IIS): Web server, FTP server and basic email server
Hyper-V: Bare-metal hypervisor
Windows Services for UNIX
Windows Server Update Services
Productivity
Some of the products included in the Windows Server System product branding are designed specifically for interaction with Microsoft Office. These include:
BizTalk Server: Business process design and integration tools
Exchange Server: E-mail and collaboration server
Host Integration Server: Data and management connector between Windows environments and mainframe and midrange platforms such as IBM i. Formerly known as Microsoft SNA Server
Project Server: Project management and resource allocation services; works as the server component to Microsoft Project
SharePoint Server: Produces sites intended for collaboration, file sharing, web databases, social networking and web publishing.
Skype for Business Server: Instant messaging and presence server, integration with telephone PBX systems. Integrates with Skype for Business.
SQL Server: Relational Database Management and business intelligence server
Security
Exchange Online Protection
Identity Integration Server – Identity management product
Microsoft System Center
Microsoft System Center, a set of server products, aims specifically at helping corporate system administrators manage a network of Windows Server and client desktop systems.
System Center Advisor: Software-as-a-service offering that helps change or assess the configuration of Microsoft Servers software over the Internet
System Center App Controller: Unified management for public and private clouds, including cloud-based virtual machines and services
System Center Capacity Planner Provides purchasing and best-practice capacity planning guidance
Microsoft Endpoint Configuration Manager: Configuration management, asset management, patch deployment tools for Windows desktops (previously Systems Management Server); includes Software Center.
System Center Data Protection Manager: Continuous data prote |
https://en.wikipedia.org/wiki/Stack%20%28computer%20science%29 | {{safesubst:#invoke:RfD||2=Stack (computer science)|month = October
|day = 15
|year = 2023
|time = 01:09
|timestamp = 20231015010935
|content=
REDIRECT Stack (abstract data type)
}} |
https://en.wikipedia.org/wiki/Call%20stack | In computer science, a call stack is a stack data structure that stores information about the active subroutines of a computer program. This kind of stack is also known as an execution stack, program stack, control stack, run-time stack, or machine stack, and is often shortened to just "the stack". Although maintenance of the call stack is important for the proper functioning of most software, the details are normally hidden and automatic in high-level programming languages. Many computer instruction sets provide special instructions for manipulating stacks.
A call stack is used for several related purposes, but the main reason for having one is to keep track of the point to which each active subroutine should return control when it finishes executing. An active subroutine is one that has been called, but is yet to complete execution, after which control should be handed back to the point of call. Such activations of subroutines may be nested to any level (recursive as a special case), hence the stack structure. For example, if a subroutine DrawSquare calls a subroutine DrawLine from four different places, DrawLine must know where to return when its execution completes. To accomplish this, the address following the instruction that jumps to DrawLine, the return address, is pushed onto the top of the call stack with each call.
Description
Since the call stack is organized as a stack, the caller pushes the return address onto the stack, and the called subroutine, when it finishes, pulls or pops the return address off the call stack and transfers control to that address. If a called subroutine calls on yet another subroutine, it will push another return address onto the call stack, and so on, with the information stacking up and unstacking as the program dictates. If the pushing consumes all of the space allocated for the call stack, an error called a stack overflow occurs, generally causing the program to crash. Adding a subroutine's entry to the call stack is sometimes called "winding"; conversely, removing entries is "unwinding".
There is usually exactly one call stack associated with a running program (or more accurately, with each task or thread of a process), although additional stacks may be created for signal handling or cooperative multitasking (as with setcontext). Since there is only one in this important context, it can be referred to as the stack (implicitly, "of the task"); however, in the Forth programming language the data stack or parameter stack is accessed more explicitly than the call stack and is commonly referred to as the stack (see below).
In high-level programming languages, the specifics of the call stack are usually hidden from the programmer. They are given access only to a set of functions, and not the memory on the stack itself. This is an example of abstraction. Most assembly languages, on the other hand, require programmers to be involved with manipulating the stack. The actual details of the stack in a programm |
https://en.wikipedia.org/wiki/George%20James%20Symons | George James Symons FRS (6 August 1838 – 10 March 1900) was a British meteorologist who founded and managed the British Rainfall Organisation, an unusually dense and widely distributed network of rainfall data collection sites throughout the British Isles.
Life
He was the only child of Joseph Symons by his wife, Georgina Moon.
He was born at Queen's Row, Pimlico, on 6 August 1838.
His education, begun at St. Peter's collegiate school, Eaton Square, was completed under private tuition at Thornton rectory, Leicestershire.
He subsequently passed with distinction through the course at the school of mines, Jermyn Street.
From boyhood, he made observations on the weather with instruments of his own construction, and at the age of seventeen became a member of the Royal Meteorological Society.
From 1863, he sat on the council, acted as secretary 1873-9 and 1882–99, and was elected president in 1880 and again in 1900.
In 1857, he undertook, and continued to discharge until his death, the duties of meteorological reporter to the registrar-general, and was appointed by Robert FitzRoy in 1860 to a post in the meteorological department of the board of trade, which he held for three years.
He resigned it owing to the growing exigencies of his rainfall observations.
The first of a series of thirty-nine annual volumes containing statistics on the subject was published by him in 1860 ; it included records from 168 stations in England and Wales.
In 1898, the number of stations had grown to 3,404, of which 436 were in Scotland and 186 in Ireland, and they were manned by an army of over three thousand volunteer observers.
This unique organisation was kept by Symons under close personal supervision, and the upshot was the accumulation of a mass of data of standard value, unmatched in any other country.
The sanitary importance of water-supply was a determining motive for its collection.
Symons began, in 1863, the issue of a monthly rain-circular, which developed in 1866 into the Monthly Meteorological Magazine, still in course of publication.
He was a prominent member of various committees appointed by the British Association, and as secretary to the conference on lightning rods in 1878 shared largely in the four years' task of compiling its report.
Elected in 1878 a fellow of the Royal Society, he acted as chairman of the committee on the eruption of Krakatoa in 1883, and edited the voluminous report published in 1888.
He sat on the council of the Social Science Association in 1878, and on the jury of the Health Exhibition in 1884; was registrar to the Sanitary Institute from 1880 to 1895, and drew up a report on the 1884 Colchester earthquake for the Mansion House committee.
In 1876, he received the Telford premium of the Institution of Civil Engineers for a paper on Floods and Water Economy, and in 1897 the Albert medal of the Society of Arts for the 'services rendered to the United Kingdom' by his rainfall observations.
He was a member of the Sc |
https://en.wikipedia.org/wiki/Local%20variable | In computer science, a local variable is a variable that is given local scope. A local variable reference in the function or block in which it is declared overrides the same variable name in the larger scope. In programming languages with only two levels of visibility, local variables are contrasted with global variables. On the other hand, many ALGOL-derived languages allow any number of nested levels of visibility, with private variables, functions, constants and types hidden within them, either by nested blocks or nested functions. Local variables are fundamental to procedural programming, and more generally modular programming: variables of local scope are used to avoid issues with side-effects that can occur with global variables.
Scope
Local variables may have a lexical or dynamic scope, though lexical (static) scoping is far more common. In lexical scoping (or lexical scope; also called static scoping or static scope), if a variable name's scope is a certain block, then its scope is the program text of the block definition: within that block's text, the variable name exists, and is bound to the variable's value, but outside that block's text, the variable name does not exist. By contrast, in dynamic scoping (or dynamic scope), if a variable name's scope is a certain block, then its scope is that block and all functions transitively called by that block (except when overridden again by another declaration); after the block ends, the variable name does not exist. Some languages, like Perl and Common Lisp, allow the programmer to choose static or dynamic scoping when defining or redefining a variable. Examples of languages that use dynamic scoping include Logo, Emacs lisp, and the shell languages bash, dash, and the MirBSD Korn shell (mksh)'s "local" declaration. Most other languages provide lexically scoped local variables.
In most languages, local variables are automatic variables stored on the call stack directly. This means that when a recursive function calls itself, local variables in each instance of the function are given distinct addresses. Hence variables of this scope can be declared, written to, and read, without any risk of side-effects to functions outside of the block in which they are declared.
Programming languages that employ call by value semantics provide a called subroutine with its own local copy of the arguments passed to it. In most languages, these local parameters are treated the same as other local variables within the subroutine. In contrast, call by reference and call by name semantics allow the parameters to act as aliases of the values passed as arguments, allowing the subroutine to modify variables outside its own scope.
Static local variables
A special type of local variable, called a static local, is available in many mainstream languages (including C/C++, Visual Basic, VB.NET and PHP) which allows a value to be retained from one call of the function to another – it is a static variable with local sco |
https://en.wikipedia.org/wiki/ISO%2010303-22 | ISO 10303-22 is a part of the implementation methods of STEP with the official title Standard data access interface or simply SDAI.
SDAI defines an abstract Application Programming Interface (API) to work on application data according to a given data models defined in EXPRESS. SDAI itself is defined independent of a particular programming language. Language bindings exist for
Part 23 - C++ language binding of the standard data access interface
Part 24 - C binding of the standard data access interface
Part 27 - Java binding to the standard data access interface with Internet/Intranet extensions
The development of language bindings for FORTRAN and the interface definition language (IDL) of CORBA were canceled.
The original intent of SDAI and its bindings to programming languages was to achieve portability of software applications from one implementation to another. This was soon abandoned because there were only a few commercial implementations and they differed significantly in their detailed APIs. Today the term SDAI is sometimes used for many types of APIs supporting STEP, even if they only partially follow the strict functionality as defined in ISO 10303-22 and its implementation methods, or not at all. Part 35 of STEP (Abstract test methods for SDAI implementations) provides a formal way how to prove the conformance of an implementation with SDAI.
The main components of SDAI are:
SDAI dictionary schema, a meta level EXPRESS schema to describe EXPRESS schemas
Managing objects
SDAI session to control the whole SDAI environment for a single user/thread including optional transaction control
SDAI repository the physical (typically) container to store SDAI models and Schema instances, e.g. a database
SDAI model a subdivision of an SDAI repository, containing entity instance according to a particular EXPRESS schema
Schema instance a logical grouping of one or several SDAI models, making up a valid population according to a particular EXPRESS schema
Operations
to deal with the managing objects
to create, delete and modify application data (entity instance, attribute values, aggregates and their members)
to validate application data according to all the constraints and rules specified in EXPRESS
Major software vendors for SDAI and similar STEP-APIs
Eurostep
EPM Technology
LKSoftWare GmbH / JSDAI
Open Design Alliance STEP SDK Open Design Alliance STEP SDK
PDTec AG: The Ecco Toolkit provides implementation of ISO 10303-11, -14, -21, -28.
STEP Tools, Inc
Open-source implementations of SDAI
The NIST STEP Class Library is a public domain implementation of ISO 10303-21(ASCII data exchange files), -22(SDAI), -23 (C++ SDAI binding) using ISO 10303-11:1994. The development of the NIST STEP Class Library has been stopped in the late 1990s. STEPcode (formerly STEP Class Library) has been improved by the BRL-CAD developers on github under the BSD license. STEPcode also has an experimental Python binding.
JSDAI is a complete implementatio |
https://en.wikipedia.org/wiki/TACPOL%20%28programming%20language%29 | TACPOL (Tactical Procedure Oriented Language) is a block structured programming language developed by the United States Army for the TACFIRE Tactical Fire Direction command and control application. TACPOL is similar to PL/I.
Language constructs
Reserved words
Unlike PL/I, TACPOL keywords—called particles—are reserved words and cannot be used as identifiers. There are roughly 100 reserved words.
Identifiers
TACPOL identifiers can be any length, but if longer than eight characters only the first five concatenated with the last three characters were actually used.
Data types
TACPOL supports fixed-point binary numeric data, fixed-length character strings up to 512 bytes, and fixed-length bit strings up to 32 bits. There is no support for floating point numeric data or for pointers. Arrays may have up to three dimensions, but dynamic bounds are not permitted. Additional types are records, called groups, limited to a single level of nesting, tables (arrays of groups), and unions, called cells.
Control structures
Control structures include IF-THEN-ELSE, iteration, WHILE and CASE statements.
Procedures
Procedures may have value parameters, quantity parameters – by reference without type-checking, parameterless procedure and label parameters.
Implementations
The TACPOL compiler ran on and generated code for the AN/GYK-12, a militarized version of the Litton Industries L-3050 32-bit minicomputer.
Criticism and defense
Positive features
TACPOL is easy to learn.
Negative features
"TACPOL has a large number of special language features which were included for reasons of efficiency because the inclusion of corresponding cleanly designed general purpose features was not properly understood."
"Cost per instruction of TACPOL [is] higher than language used for other military computers."
Notes
References
External links
TACPOL Reference Manual (USACSCS-TF-4-1)
Serafino, et.al. "Report to the High Order Language Working Group" (1977)
United States General Accounting Office. "Tactical Operations System Should Not Continue as Planned" (1979)
See also
JOVIAL
CMS-2
CORAL
Ada
United States Army equipment
Domain-specific programming languages |
https://en.wikipedia.org/wiki/SWI-Prolog | SWI-Prolog is a free implementation of the programming language Prolog, commonly used for teaching and semantic web applications. It has a rich set of features, libraries for constraint logic programming, multithreading, unit testing, GUI, interfacing to Java, ODBC and others, literate programming, a web server, SGML, RDF, RDFS, developer tools (including an IDE with a GUI debugger and GUI profiler), and extensive documentation.
SWI-Prolog runs on Unix, Windows, Macintosh and Linux platforms.
SWI-Prolog has been under continuous development since 1987. Its main author is Jan Wielemaker.
The name SWI is derived from ("Social Science Informatics"), the former name of the group at the University of Amsterdam, where Wielemaker was employed when he intiated the development of SWI-Prolog. The name of this group has changed to HCS (Human-Computer Studies).
Execution model
SWI-Prolog is not based on the Warren Abstract Machine execution model of Prolog.
Instead, it is based on an extended version of the ZIP virtual machine, a minimal virtual machine for Prolog implementing a simple language consisting of only seven instructions. SWI-Prolog-specific extensions aim at improving performance in several ways: ad hoc instructions are introduced to support unification, predicate invocation, some frequently used built-in predicates, arithmetic, control flow, and negation as failure. Prolog can easily be compiled into this language, and the abstract machine code is easily decompiled back into Prolog. This feature is often exploited to interleave compiled and interpreted code execution.
Web framework
SWI-Prolog installs with a web framework based on definite clause grammars.
Distributed computing
SWI-Prolog queries may be distributed over several servers and web pages through the Pengines system.
XPCE
XPCE is a platform-independent object-oriented GUI toolkit for SWI-Prolog, Lisp and other interactive and dynamically typed languages. Although XPCE was designed to be language-independent, it has gained popularity mostly with Prolog. The development XPCE graphic toolkit started in 1987, together with SWI-Prolog.
It supports buttons, menus, sliders, tabs and other basic GUI widgets. XPCE is available for all platforms supported by SWI-Prolog.
PceEmacs
PceEmacs is a SWI-Prolog builtin editor. PceEmacs is an Emacs clone implemented in Prolog (and XPCE). It supports proper indentation, syntax highlighting, full syntax checking by calling the SWI-Prolog parser, warning for singleton variables and finding predicate definitions based on the source information from the Prolog database.
Interface between Java and Prolog (JPL)
JPL is a bidirectional interface between Java and Prolog. It requires both SWI-Prolog and Java SDK. It is installed as a part of SWI-Prolog.
Constraint logic programming libraries (CLP)
Constraint logic programming functionality came rather late in the lifetime of SWI-Prolog, because it lacked the basic support. This changed early |
https://en.wikipedia.org/wiki/ViewSheet | ViewSheet is a spreadsheet program produced in the 1980s by Acornsoft for use with the BBC Micro and Acorn Electron microcomputers. It was distributed as a pre-installed ROM with some computer models, such as the Master. ViewSheet was written by Mark Colton.
Description
ViewSheet supports spreadsheets of up to 255 by 255 cells in size. Each cell can contain a number, formula or text label. Cells are referred to as slots in the official Acornsoft documentation. The program is supplied with a keyboard card listing the various commands, which on the BBC Micro is placed under the clear plastic strip above the function keys.
The spreadsheet is entered by typing *SHEET. All BBC Micro screen modes are supported, and the background and foreground colours can be changed by use of Ctrl-S,n,n,0,0,0 key sequences.
The program supports user-defined windows that can display cells from various different parts of the spreadsheet within the same screen. This is useful in lieu of a WIMP environment, as it saves the user the inconvenience of moving back and forth around the spreadsheet to view cells which are far apart from each other.
ViewSheet supports saving of spreadsheets to both disk and tape and printing to both serial and parallel printers. These operations are performed in command mode, which also allows changing various options such as VDU settings and screen resolution. The program also integrates with Acornsoft's View word processor, allowing mixing of spreadsheet data and word processor text within the same printout. There's also a built-in facility for generating character-based bar charts.
Cells can be left or right justified and formatted according to a user specified layout. Numeric values are stored internally as five-byte floating point numbers. The ViewSheet file format is documented on page 128 of the supplied user guide, which also contains an example BBC BASIC program to print out values from a saved spreadsheet.
ViewSheet takes advantage of a second 6502 processor, which triples the amount of memory available for spreadsheets, assuming the default screen mode is used (mode 3).
Critical reception
ViewSheet was reviewed by Gordon Taylor in the January 1985 edition of A&B computing
and a book ViewSheet and Viewstore: A Dabhand Guide by Graham Bell was published by Dabs Press in 1989.
David Brown, in his review for The Micro User states that ViewSheet "succeeds in providing all the basic spreadsheet functions in a well presented package". Although, he also cites several shortcomings of the program, writing "In conclusion, Viewsheet's major failing is to provide adequate facilities for textual labelling." and finishes by noting "Acornsoft is capable of producing better programs".
References
1984 software
Spreadsheet software
Acorn Computers |
https://en.wikipedia.org/wiki/Alfonsine%20tables | The Alfonsine Tables (, ), sometimes spelled Alphonsine Tables, provided data for computing the position of the Sun, Moon and planets relative to the fixed stars.
The tables were named after Alfonso X of Castile, who sponsored their creation. They were compiled in Toledo, Spain, and contain astronomical data starting on June 1, 1252, the date of the coronation of the King.
Production
Alfonso X assembled a team of scholars, known as the Toledo School of Translators, who among other translating tasks, were asked to produce new tables that updated the Tables of Toledo. The new tables were based on earlier astronomical works and observations by Islamic astronomers, adding observations by astronomers Alfonso had gathered in Toledo, among them several Jewish scholars, like Yehuda ben Moshe and Isaac ibn Sid. He also brought Aben Raghel y Alquibicio and Aben Musio y Mohamat, from Seville, Joseph Aben Alí and Jacobo Abenvena, from Córdoba, and fifty more from Gascony and Paris.
The instructions for the Alfonsine tables were originally written in Castilian Spanish. The first printed edition of the Alfonsine tables appeared in 1483, and a second edition in 1492.
Georg Purbach used the Alfonsine tables for his book, Theoricae novae planetarum (New Theory of the Planets). Nicolaus Copernicus used the second edition in his work. One use of these and similar astronomical tables was to calculate ephemerides, which were in turn used by astrologers to cast horoscopes. Canons on the tables included those by John of Saxony and his teacher John of Lignères (fl 1320 to 1335).
Methodology
The methods of Claudius Ptolemy were used to compute the table, dividing the year into 365 days, 5 hours, 49 minutes, 16 seconds—very close to the currently accepted figure. Copernicus's observation that his system could explain the planetary motions with no more than 34 circles has been taken to imply that a large number of additional epicycles had been subsequently introduced into the Ptolemaic system in an attempt to make it conform with observation. (There is a famous (but probably apocryphal) quote attributed to Alfonso upon hearing an explanation of the extremely complicated mathematics required to demonstrate Ptolemy's geocentric model of the solar system: "If the Lord Almighty had consulted me before embarking on creation thus, I should have recommended something simpler.") However, modern computations using Ptolemy's unmodified theory have replicated the published Alfonsine tables.
Popularity
The Alfonsine tables were the most popular astronomical tables in Europe and updated versions were regularly produced for three hundred years. Nicolaus Copernicus, known as the father of modern astronomy, bought a copy while at the University of Cracow, and cared about it enough to have it professionally bound with pieces of wood and leather. Alexander Bogdanov maintained that these tables formed the basis for Copernicus's development of a heliocentric understanding in astron |
https://en.wikipedia.org/wiki/Jonathan%20Turner | Jonathan Turner may refer to:
Jonathan Baldwin Turner (1805–1899), American educational reformer
Jonathan H. Turner (born 1942), American sociologist
Jonathan S. Turner (born 1953), American computer scientist
Jonathan D. C. Turner (born 1958), British barrister
Jon Turner (b.d. unknown), British yacht builder
Jonathan Turner (Boy Meets World), a character in Boy Meets World
See also
John Turner (disambiguation) |
https://en.wikipedia.org/wiki/Grace%20Murray%20Hopper%20Park | Grace Murray Hopper Park is a small memorial park in Arlington, Virginia. The park is named in honor of Grace Hopper, a computer scientist and naval officer. The park is near Riverhouse, a high-rise community where Hopper lived her later years. The park was originally funded by private sources, but is now owned by Arlington. The park is located across the I-395 corridor from The Pentagon.
Hopper, Grace Murray Park |
https://en.wikipedia.org/wiki/Iverson%20notation | Iverson notation can refer to:
APL (programming language)
Iverson bracket, in mathematics |
https://en.wikipedia.org/wiki/Revision | Revision is the process of revising.
More specifically, it may refer to:
Update, a modification of software or a database
Revision control, the management of changes to sets of computer files
ReVisions, a 2004 anthology of alternate history short stories
Revision3, a San Francisco based Internet television network
Revision (Boxcar album) a remix music album by synthpop group Boxcar
Revisions (album), an album by the band 3
Revision (demoparty), a demoparty which takes place on Easter in Saarbrücken, Germany
"Revisions" (Stargate SG-1), an episode of the Stargate SG-1 science-fiction television series
Revisions (anime) a 2019 anime television series
Final Articles Revision Convention (disambiguation), either of two International Labour Organisation conventions
Revision or revising, a British term for exam preparation
Taxonomic revision is a novel analysis of the variation patterns in a particular taxon
Revision (writing), the general process of revising written work, or a version produced by that process
See also
Revisionism (disambiguation) |
https://en.wikipedia.org/wiki/Extent%20%28file%20systems%29 | In computing, an extent is a contiguous area of storage reserved for a file in a file system, represented as a range of block numbers, or tracks on count key data devices. A file can consist of zero or more extents; one file fragment requires one extent. The direct benefit is in storing each range compactly as two numbers, instead of canonically storing every block number in the range. Also, extent allocation results in less file fragmentation.
Extent-based file systems can also eliminate most of the metadata overhead of large files that would traditionally be taken up by the block-allocation tree. But because the savings are small compared to the amount of stored data (for all file sizes in general) but make up a large portion of the metadata (for large files), the overall benefits in storage efficiency and performance are slight.
In order to resist fragmentation, several extent-based file systems do allocate-on-flush. Many modern fault-tolerant file systems also do copy-on-write, although that increases fragmentation. As a similar design, the CP/M file system uses extents as well, but those do not correspond to the definition given above. CP/M's extents appear contiguously as a single block in the combined directory/allocation table, and they do not necessarily correspond to a contiguous data area on disk.
IBM OS/360 and successors allocate files in multiples of disk tracks or cylinders. Files could originally have up to 16 extents, but this restriction has since been lifted. The initial allocation size and the size of additional extents to be allocated if required are specified by the user via Job Control Language. The system attempts to allocate the initial size as a contiguous area, although this may be split if contiguous space is not available.
Adoption
The systems supporting filesystem extents include the following:
APFS Apple File System
ASM Automatic Storage Management Oracle's database-oriented filesystem
BFS BeOS, Zeta and Haiku operating systems
Btrfs Extent-based copy-on-write (COW) file system for Linux
EFS Extent File System SGI's first-generation file system for Irix
Ext4 Linux filesystem (when the configuration enables extents the default in Linux since version 2.6.23)
Files-11 OpenVMS filesystem
HFS and HFS Plus Hierarchical File System Apple Macintosh filesystems
High Performance File System (HPFS) on OS/2, eComStation and ArcaOS
IceFS IceFileSystem optional file system for MorphOS
JFS Journaled File System used by AIX, OS/2/eComStation/ArcaOS and Linux operating systems
ISO 9660 Extent-based file system for optical disc media
Microsoft SQL Server versions 2000–2008 support extents of up to 64 KB
Multi-Programming Executive a filesystem by Hewlett-Packard
NTFS
OCFS2 Oracle Cluster File System a shared-disk file system for Linux
Reiser4 Linux filesystem (in "extents" mode)
SINTRAN III file system used by early computer company Norsk Data
UDF Universal Disk Format standard for optical media
VERITAS Fi |
https://en.wikipedia.org/wiki/Kerala%20backwaters | The Kerala backwaters are a network of brackish lagoons and canals lying parallel to the Arabian Sea of the Malabar coast of Kerala state in south-western India. It also includes interconnected lakes, rivers, and inlets, a labyrinthine system formed by more than of waterways, and sometimes compared to bayous. The network includes five large lakes linked by canals, both man made and natural, fed by 38 rivers, and extending virtually half the length of Kerala state. The backwaters were formed by the action of waves and shore currents creating low barrier islands across the mouths of the many rivers flowing down from the Western Ghats range. In the midst of this landscape there are a number of towns and cities, which serve as the starting and end points of backwater cruises. There are 34 backwaters in Kerala. Out of it, 27 are located either closer to Arabian Sea or parallel to the sea. The remaining 7 are inland navigation routes.
The backwaters have a unique ecosystem: freshwater from the rivers meets the seawater from the Arabian Sea. A barrage has been built near Thanneermukkom, so salt water from the sea is prevented from entering the deep inside, keeping the fresh water intact. Such fresh water is extensively used for irrigation purposes. Many unique species of aquatic life including crabs, frogs and mudskippers, water birds such as terns, kingfishers, darters and cormorants, and animals such as otters and turtles live in and alongside the backwaters. Palm trees, pandanus shrubs, various leafy plants, and bushes grow alongside the backwaters, providing a green hue to the surrounding landscape.
Hydrography
National Waterway 3 from Kollam to Kottappuram, covers a distance of and runs almost parallel to the coastline of southern Kerala facilitating both cargo movement and backwater tourism. Vembanad is the largest of the lakes, covering an area of . The lake has a large network of canals that meander through the region of Kuttanad. The important rivers from north to south are the Valapattanam , Chaliyar , Kadalundipuzha , Bharathappuzha , Chalakudy , Periyar , Pamba , Achankovil , Meenachil , and Kalladayar . Other than these, there are 35 more small rivers and rivulets flowing down from the Ghats. Most of these rivers are navigable up to the midland region, in country crafts.
Vembanad Lake is the longest backwater in Kerala, as well as the longest lake in India. The Kochi city, Kuttanad, Kumarakom, and Pathiramanal Island are located in this long backwater. The Vellayani Lake, the Pookode Lake, and the Sasthamcotta Lake are the freshwater lakes in Kerala. Sasthamcotta is the largest among them. The Kerala backwaters host three of the world’s Ramsar Convention-listed wetlands: Ashtamudi Lake, Sasthamkotta Lake, and the Vembanad-Kol wetlands are noted as being wetlands of international importance.
Tourism
Houseboats
Kettuvallam (Kerala houseboats) in the backwaters are one of the prominent tourist attractions in Kerala. More than 2,000 o |
https://en.wikipedia.org/wiki/VueScan | VueScan is a computer program for image scanning, especially of photographs, including negatives. It supports optical character recognition (OCR) of text documents. The software can be downloaded and used free of charge, but adds a watermark on scans until a license is purchased.
Purpose
VueScan is intended to work with a large number of image scanners, excluding specialised professional scanners such as drum scanners, on many computer operating systems (OS), even if drivers for the scanner are not available for the OS. These scanners are supplied with device drivers and software to operate them, included in their price. A 2014 review considered that the reasons to purchase VueScan are to allow older scanners not supported by drivers for newer operating systems to be used in more up-to-date systems and for better scanning and processing of photographs (prints; also slides and negatives when supported by scanners) than is afforded by manufacturers' software. The review did not report any advantages to VueScan's processing of documents over other software. The reviewer considered VueScan comparable to SilverFast, a similar program, with support for some specific scanners better in one or the other. Vuescan supports more scanners, with a single purchase giving access to the full range of both film and flatbed scanners, and costs less.
The VueScan program can be used with its own drivers or with drivers supplied by the scanner manufacturer, if supported by the operating system. VueScan drivers can also be used without the VueScan program by application software that supports scanning directly, such as Adobe Photoshop, again enabling the use of scanners without current manufacturers' drivers.
In 2019 when Apple released macOS Catalina, they removed support for running 32-bit programs, including 32-bit drivers for scanning equipment. In response, Hamrick released VueScan 9.7, effectively saving thousands of scanners from being rendered obsolete.
Overview
VueScan enables the user to modify and fine-tune the scanning parameters. The program uses its own independent method to interface with scanner hardware, and can support many older scanners under computer operating systems for which drivers are not available, allowing old scanners to be used with newer platforms that do not otherwise support them.
VueScan supports an increasing number of scanners and digital cameras; 2,400 on Windows, 2,100 on Mac OS X and 1,900 on Linux in 2018.
VueScan is supplied as one downloadable file for each operating system, which supports the full range of scanners. Without the purchase of a license the program runs in fully functional demonstration mode, identical to Professional mode, except that watermarks are superimposed on saved and printed images. Purchase of a license removes the watermark. A standard license allows updates for one year; a professional license allows unlimited updates and provides some additional features.
VueScan supports optical character r |
https://en.wikipedia.org/wiki/TCP%20congestion%20control | Transmission Control Protocol (TCP) uses a congestion control algorithm that includes various aspects of an additive increase/multiplicative decrease (AIMD) scheme, along with other schemes including slow start and congestion window (CWND), to achieve congestion avoidance. The TCP congestion-avoidance algorithm is the primary basis for congestion control in the Internet. Per the end-to-end principle, congestion control is largely a function of internet hosts, not the network itself. There are several variations and versions of the algorithm implemented in protocol stacks of operating systems of computers that connect to the Internet.
To avoid congestive collapse, TCP uses multi-faceted congestion-control strategy. For each connection, TCP maintains a CWND, limiting the total number of unacknowledged packets that may be in transit end-to-end. This is somewhat analogous to TCP's sliding window used for flow control.
Additive increase/multiplicative decrease
The additive increase/multiplicative decrease (AIMD) algorithm is a closed-loop control algorithm. AIMD combines linear growth of the congestion window with an exponential reduction when a congestion takes place. Multiple flows using AIMD congestion control will eventually converge to use equal amounts of a contended link.
This is the algorithm that is described in for the "congestion avoidance" state.
Congestion window
In TCP, the congestion window (CWND) is one of the factors that determines the number of bytes that can be sent out at any time. The congestion window is maintained by the sender and is a means of stopping a link between the sender and the receiver from becoming overloaded with too much traffic. This should not be confused with the sliding window maintained by the sender which exists to prevent the receiver from becoming overloaded. The congestion window is calculated by estimating how much congestion there is on the link.
When a connection is set up, the congestion window, a value maintained independently at each host, is set to a small multiple of the maximum segment size (MSS) allowed on that connection. Further variance in the congestion window is dictated by an additive increase/multiplicative decrease (AIMD) approach. This means that if all segments are received and the acknowledgments reach the sender on time, some constant is added to the window size. It will follow different algorithms.
A system administrator may adjust the maximum window size limit, or adjust the constant added during additive increase, as part of TCP tuning.
The flow of data over a TCP connection is also controlled by the use of the receive window advertised by the receiver. A sender can send data less than its own congestion window and the receive window.
Slow start
Slow start, defined by . is part of the congestion control strategy used by TCP in conjunction with other algorithms to avoid sending more data than the network is capable of forwarding, that is, to avoid causing network co |
https://en.wikipedia.org/wiki/Daibhidh%20%C3%93%20Duibhgheann%C3%A1in | Dáibhídh Ó Duibhgeannáin (fl. 1651–1696), also known as Dáibhídh mac Matthew Glas Ó Duibhgeannáin or Dáibhídh Bacach ("lame David"), was a scribe, compiler and poet who was active between the years 1651 and 1696. In the earliest of his known works, Royal Irish Academy Ms. 24.P.9., he writes on page 238: "sguirim go ttrasada ar Loch Mesg dam a ttigh Thaidgh Oig Ui Fhlaibhertaigh 1 die Aprilis 1651, Dauid Duigenan qui scripsit/I stop now, and I on Loch Mask in the house of Tadhg Og O Flaherty, April 1st, 1651, David Duigenan who wrote this." A later entry specifies the place as Oileán Ruadh, or Red Island.
There is a slight chance that he may have been the (or an) intermediary responsible for presenting Dubhaltach MacFhirbhisigh with "Volume C" of the original four volumes of the autograph of the Annals of the Four Masters, covering the period AM 2242 to AD 1171. Peregrine O'Duignan, one of the four main responsible for compiling the book, was a kinsman of Dáibhídh's. However, an idea proposed by the writer of this article that Dáibhídh was MacFhirbhisigh's mysterious amanuensis cannot be sustained, as a comparison of their handwriting bears no resemblance to each other.
Throughout his life, he transcribed such works as "Suibhne Gelt/The Frenzy of Sweeney", "The Adventures of the Two Idiot Saints", "The Battle of Magh Rath", and "The Banquet of Dun na Gedh.". He is believed to have lived his final years in Shancough, Tirerrill, County Sligo, where he lived with his wife, a Mac Con Midhe. He died in 1696.
See also
List of Irish historians
Clan O Duibhgeannain
Further reading
The Learned Family of O Duigenan, Fr. Paul Walsh, "Irish Ecceslastical Record", 1921
The Celebrated Antiquary: Dubhaltach Mac Fhirbhisigh - His Lineage, Life and Learning, Nollaig Ó Muraíle, Maynooth, 1996.
Scríobhaithe Lámhscríbhinní Gaeilge I nGaillimh 1700-1900, William Mahon, in "Galway:History and Society", 1996
Sources
17th-century Irish poets
Writers from County Roscommon
1696 deaths
Year of birth unknown
Irish-language writers
Irish scribes
Irish scholars and academics |
https://en.wikipedia.org/wiki/Eric%20Goles | Eric Antonio Goles Chacc (born August 21, 1951) is a Chilean mathematician and computer scientist of Croatian descent. He studied civil engineering at the University of Chile before taking two doctorates at the University of Grenoble in France. A professor at the University of Chile, he is known for his work on cellular automata.
Goles was born in Antofagasta, northern Chile.
In 1993, Goles was awarded Chile's National Prize for Exact Sciences. He was President of CONICYT (the Chilean equivalent of the National Science Foundation in the U.S.), and an advisor on science and technology to the Chilean government.
Goles currently teaches and does research at the Adolfo Ibáñez University.
External links
Goles Biography as a Director of the Chilean Millennium Science Initiative
Fuller biography in Spanish at website of CONICYT
1951 births
Living people
Chilean computer scientists
20th-century Chilean mathematicians
21st-century Chilean mathematicians
Cellular automatists
People from Antofagasta
Chilean people of Croatian descent
University of Chile alumni
Grenoble Alpes University alumni
Academic staff of the University of Chile |
https://en.wikipedia.org/wiki/Carnforth%20railway%20station | Carnforth is a railway station on the Bentham and Furness Lines, north of Lancaster, England, which serves the market town of Carnforth, Lancashire. It is owned by Network Rail and managed by Northern Trains.
History
Carnforth railway station was opened on 22 September 1846 by the Lancaster and Carlisle Railway (L&CR). It had a single platform and was a second-class station. It became a junction on 6 June 1857, when the Ulverstone and Lancaster Railway arrived from the north-west. The station served as the line's southern terminus. The Furness Railway took over the U&LR in 1862, and became the second major company operating to Carnforth.
The station was enlarged during the 1870s. In 1880, it began receiving trains from the Midland Railway, following the commissioning of a south-to-east direct curve to the Furness and Midland Joint Railway – creating a triangular junction.
The L&CR was taken over by the London and North Western Railway (LNWR), with the station operated under a joint management by the Furness Railway and LNWR – the Midland Railway having running powers into the station. Station personnel wore a uniform with the initials CJS for Carnforth: Joint Station. The Furness Railway erected a distinctive stone-built signal box to the north-west of the station in 1882, used until 1903, and this survives preserved as a grade II listed building.
A major rebuilding project, including a 300-yard long platform (currently used by northbound services), started in 1938 with government funding. With the opening of the new Platform on 3 July 1939, it brought the number of platforms in use to six. In 1942, the government approved the rebuilding of Carnforth MPD into a major regional railway depot – the work being completed in 1944.
The film Brief Encounter was partly filmed at the station in February 1945. The station clock became a powerful icon through repeated use in the film.
Withdrawal of West Coast Main Line services
The West Coast Main Line (WCML) platforms were closed in May 1970, following the withdrawal of local stopping passenger services between Lancaster and Carlisle two years earlier. The platform walls facing the fast lines were demolished, cut back and fenced off before the commissioning of 25 kV overhead electrification in 1974. This made Carnforth a secondary line station, even though it is situated on the main line, as WCML trains cannot call.
In 2011, Network Rail rejected proposals to reopen the mainline platforms, stating that there would be too few passengers to justify slowing down mainline trains. Only the former platforms 4 (the original Furness Railway through platform) and 6 (the LMS 1939 platform) remain in use (now renumbered 1 and 2); the old 'Midland bay' (No 5), which once catered for services on the Furness and Midland Joint Railway (between Carnforth and ) has had its track removed.
Responsibility for the signalling at the station is divided between Preston PSB (main line) and the surviving manual ex-Furness R |
https://en.wikipedia.org/wiki/List%20of%20Doctor%20Who%20robots | The long-running British science fiction television series Doctor Who has featured a multitude of robots since its original airing in 1963.
Despite appearing as robots, both the Daleks and Cybermen are not listed here, as they are depicted as organic creatures that have been transformed into cyborgs, as opposed to completely inorganic and true robots.
A
Anne Droid
Auton
B
Bracewell
C
Cleaners
Clockwork Robot
D
Davinadroid
Drathro
E
Emojibot
H
Handbot
Heavenly Host
K
K1
The Doctor's first enemy in his fourth incarnation. It is the main villain during ‘’Robot’’.
K2
An upgraded version of K1 appearing in the comic Robo Rampage (2016).
K9
A robotic dog that serves as the companion to The Doctor, during the latter half of his fourth incarnation. The first iteration of the dog was acquired by The Doctor during The Invisible Enemy.
Kamelion
A shape-shifting android acquired by the Fifth Doctor as a companion at the end of the two-part story The King's Demons (1983). Kamelion was weak-willed, allowing The Master to be able to take control of him on two occasions.
Kandyman
M
Mechanoid (Mechonoid)
Mechonoids (sometimes spelled 'Mechanoids') are large, multifaceted, spherical robots created by humans. They first appear in the second season serial, The Chase (1965), being sent to prepare the planet Mechanus for colonization. While working on the colonization task, they imprison stranded astronaut Steven Taylor due to him not having their control codes. A group of Daleks, pursuing the TARDIS crew, engaged the Mechanoids in battle; which side was victorious is not shown.
In the original shooting script, they were to be called 'Mechons', but this was changed shortly before filming. But some actors had already memorized lines from the previous draft, leading to the robots being erroneously referred to as Mechons in some dialog in the finished episodes. Accidental misspellings in media publications and offial sources have led to confusion about the spelling of 'Mechonoids'. Originally intended to be spelled with an 'o' as a slight revision of the name 'Mechon', the name has been commonly misspelled with an 'a' both in episode credits and in other sources.
The Mechanoids next appeared in the TV21 comic strip story The Eve of War (1966). They are depicted as the sworn enemies of the Daleks. A race of blue-skinned humanoids subtly interfere with events, using a robot called K2, in order to prevent a war. This was followed by a further comic strip appearance (where they are again referenced as "Mechanoids") in the story The World That Waits, included in the 1966 The Dalek World annual. The narrative depicts a Dalek attack on Mechanus resulting in the destruction of a Mechanoid city.
War of the Daleks (1997), an Eighth Doctor BBC Books novel written by John Peel, features a Mechanoid identified as Mechon 179. It works as a gardener on the planet Hesperus and is destroyed helping to defend the planet against a Dalek invasion.
The |
https://en.wikipedia.org/wiki/Picturehouse%20Cinemas | Picturehouse Cinemas is a network of cinemas in the United Kingdom, operated by Picturehouse Cinemas Ltd and owned by Cineworld. The company runs its own film distribution arm, Picturehouse Entertainment, which has released acclaimed films such as David Lowery's A Ghost Story, Sally Potter's The Party and Francis Lee's God's Own Country, Custody, Capernaum and The Wife. A previous iteration of this distribution arm, which focused largely on alternative content, was sold in 2017 to Howard Panter and Rosemary Squire and rebranded as Trafalgar Releasing.
The first cinema in the chain, Phoenix Picturehouse, opened in Oxford in 1989, but many of the others operated independently before then: the Duke of York's Picture House in Brighton, for example, opened in 1910 and is Britain's longest continually operating cinema.
On 17 March 2020, Picturehouse and all other movie cinema companies in the UK temporarily closed their UK cinemas, due to the COVID-19 pandemic, reopening them on 31 July. A second closure took place from 9 October 2020 until 17 May 2021, due to an insufficient amount of new film releases and a second wave of the pandemic closing indoor venues.
On 7 September 2022, Cineworld filed for Chapter 11 bankruptcy in the United States.
Locations
Current
Former
Planned
Industrial action
In 2014, Cineworld was subject to industrial action owing to its refusal to pay the London living wage to its staff. Started by workers at the Ritzy Cinema, Brixton, the resulting Ritzy Living Wage campaign attracted the support of Eric Cantona and Terry Jones.
Industrial action resumed in October 2016 over the issue of the Living Wage, as well as recognition of the theatre union BECTU, parental pay and sick pay, and spread to six Picturehouse cinemas, making it the biggest strike action ever by cinema workers in the UK. Staff at the Ritzy Cinema were represented by BECTU while other cinemas were represented by the Picturehouse Staff Forum, a company union set up by management in 2003 and later run by Picturehouse staff.
Strikes continued into 2018, when workplace reps were found to be unfairly dismissed and were instructed to be reinstated, meanwhile Picturehouse claimed that they were one of the highest paying employers in the UK cinema industry.
In 2019, following a membership vote, the Staff Forum (run by Picturehouse management) was dissolved and later removed by the Certification Officer from the official list of trade unions. BECTU also called off the company boycott, stating "BECTU members have now agreed to suspend our Living Staff Living Wage campaign and call off the public boycott to focus on fighting for equal pay at the Ritzy and continuing to challenge the dismissal of other members. We won’t rest until Ritzy and Picturehouse follows suit with other cinema employers we have successfully worked with and treats all its workers fairly." As of 2022, Picturehouse cinemas still do not pay their frontline staff living wage.
References
Externa |
https://en.wikipedia.org/wiki/Nudi | Nudi may refer to:
Nudi - means language; speech; talk in Kannada
Nudi (software), a computer program to type in Kannada script
Nudi, Iran, a village in Ardabil Province, Iran
Mario Nudi (1912–1945), Italian soldier and police officer |
https://en.wikipedia.org/wiki/Sensor%20web | Sensor web is a type of sensor network that heavily utilizes the World Wide Web and is especially suited for environmental monitoring.
OGC's Sensor Web Enablement (SWE) framework defines a suite of web service interfaces and communication protocols abstracting from the heterogeneity of sensor (network) communication.
Definition
The term "sensor web" was first used by Kevin Delin of NASA in 1997,
to describe a novel wireless sensor network architecture where the individual pieces could act and coordinate as a whole. In this sense, the term describes a specific type of sensor network: an amorphous network of spatially distributed sensor platforms (pods) that wirelessly communicate with each other. This amorphous architecture is unique since it is both synchronous and router-free, making it distinct from the more typical TCP/IP-like network schemes. A pod as a physical platform for a sensor can be orbital or terrestrial, fixed or mobile and might even have real time accessibility via the Internet. Pod-to-pod communication is both omni-directional and bi-directional where each pod sends out collected data to every other pod in the network. Hence, the architecture allows every pod to know what is going on with every other pod throughout the sensor web at each measurement cycle. The individual pods (nodes) were all hardware equivalent and Delin's architecture did not require special gateways or routing to have each of the individual pieces communicate with one another or with an end user. Delin's definition of a sensor web was an autonomous, stand-alone, sensing entity – capable of interpreting and reacting to the data measured – that does not necessarily require the presence of the World Wide Web to function.
As a result, on-the-fly data fusion, such as false-positive identification and plume tracking, can occur within the sensor web itself and the system subsequently reacts as a coordinated, collective whole to the incoming data stream. For example, instead of having uncoordinated smoke detectors, a sensor web can react as a single, spatially dispersed, fire locator.
The term "sensor web" has also morphed into sometimes being associated with an additional layer connecting sensors to the World Wide Web.
The Sensor Web Enablement (SWE) initiative of the Open Geospatial Consortium (OGC) defines service interfaces which enable an interoperable usage of sensor resources by enabling their discovery, access, tasking, as well as eventing and alerting. By defining standardized service interfaces, a sensor web based on SWE services hides the heterogeneity of an underlying sensor network, its communication details and various hardware components, from the applications built on top of it.
OGC's SWE initiative defines the term "sensor web" as an infrastructure enabling access to sensor networks and archived sensor data that can be discovered and accessed using standard protocols and application programming interfaces. Through this abstraction from sens |
https://en.wikipedia.org/wiki/UNIX%20System%20III | UNIX System III (or System 3) is a discontinued version of the Unix operating system released by AT&T's Unix Support Group (USG).
AT&T announced System III in late 1981, and it was first released outside of Bell Labs in 1982. UNIX System III was a mix of various AT&T Unix systems: Version 7 Unix, PWB/UNIX 2.0, CB UNIX 3.0, UNIX/RT and UNIX/32V. System III supported the DEC PDP-11 and VAX computers.
The system was apparently called System III because it was considered the outside release of UNIX/TS 3.0.1 and CB UNIX 3 which were internally supported Bell Labs Unices; its manual refers to it as UNIX Release 3.0 and there were no Unix versions called System I or System II. There was no official release of UNIX/TS 4.0 (which would have been System IV) either, so System III was succeeded by System V, based on UNIX/TS 5.0.
System III introduced new features such as named pipes, the uname system call and command, and the run queue. It also combined various improvements to Version 7 Unix by outside organizations. However, it did not include notable additions made in BSD such as the C shell (csh) and screen editing.
Third-party variants of System III include (early versions of) HP-UX, IRIX, IS/3 and PC/IX, PC-UX, PNX, SINIX, Venix and Xenix.
References
External links
System III source code
Bell Labs Unices
Discontinued operating systems
1982 software |
https://en.wikipedia.org/wiki/Contact%20tracing | In public health, contact tracing is the process of identifying persons who may have been exposed to an infected person ("contacts") and subsequent collection of further data to assess transmission. By tracing the contacts of infected individuals, testing them for infection, and isolating or treating the infected, this public health tool aims to reduce infections in the population. In addition to infection control, contact tracing serves as a means to identify high-risk and medically vulnerable populations who might be exposed to infection and facilitate appropriate medical care. In doing so, public health officials utilize contact tracing to conduct disease surveillance and prevent outbreaks. In cases of diseases of uncertain infectious potential, contact tracing is also sometimes performed to learn about disease characteristics, including infectiousness. Contact tracing is not always the most efficient method of addressing infectious disease. In areas of high disease prevalence, screening or focused testing may be more cost-effective.
The goals of contact tracing include:
Interrupting ongoing transmission and reduce the spread of an infection
Alerting contacts to the possibility of infection and offer preventive services or prophylactic care
Offering diagnosis, counseling and treatment to already infected individuals
If the infection is treatable, helping prevent reinfection of the originally infected patient
Learning about the epidemiology of a disease in a particular population
Being a tool in multifaceted prevention strategy to effectively curb the spread of an infectious disease.
History
Contact tracing programs were first implemented to track syphilis cases in the 1930s. Initial efforts proved to be difficult given the stigmatization associated with sexually transmitted infections (STIs). Individuals were reluctant to report infections because they were concerned for their privacy. Revealing partner history and details about sexual activity was challenging as it affected relationships among individuals and community members. In addition, public health officials targeted certain populations such as sex workers, minorities, and at-risk populations further eliciting feeling of fear, shame, and guilt in society. With these negative implications of contact tracing, particularly in the space of sexually transmitted infections, public health officials found it difficult to elicit information from exposed individuals. During the HIV epidemic, many affected person were hesitant to report information, which hindered the efforts to understand HIV and curb the spread. To combat some of the negative stigma associated with contact tracing and STIs, health departments sometimes referred to contact tracing as partner notification in the 1980s. Partner notification, also called partner care, is a subset of contact tracing aimed specifically at informing sexual partners of an infected person and addressing their health needs. This definition evolv |
https://en.wikipedia.org/wiki/OkCupid | OkCupid (often abbreviated as OKC, but officially OkC) is a U.S.-based, internationally operating online dating, friendship, and formerly also a social networking website and application. It features multiple-choice questions to match members. Registration is free. OkCupid is owned by Match Group, which also owns Tinder, Hinge, Plenty of Fish, and many other popular dating apps and sites.
While the site and app once supported multiple modes of communication, this has been restricted to messaging. OkCupid was listed in Time magazine's 2007 Top 10 dating websites. The website was acquired by IAC's Match.com division in 2011.
History
OkCupid was originally owned by Humor Rainbow, Inc. OkCupid's founders (Chris Coyne, Christian Rudder, Sam Yagan, and Max Krohn) were students at Harvard University when they gained recognition for their creation of TheSpark and, later, SparkNotes. Among other things, TheSpark.com featured a number of humorous self-quizzes and personality tests, including the four-variable Myers-Briggs style Match Test. SparkMatch debuted as a beta experiment of allowing registered users who had taken the Match Test to search for and contact each other based on their Match Test types. The popularity of SparkMatch took off and it was launched as its own site, later renamed OkCupid. In 2001, they sold SparkNotes to Barnes & Noble, and began work on OkCupid.
In November 2007, OkCupid launched Crazy Blind Date, a no-cost dating service that set people up on blind dates with little to no notice. The site served people in Boston, San Francisco, Austin, New York City, Chicago, Washington, D.C., and Los Angeles. Daters would complete an optional questionnaire about their availability, preferred neighborhood for dates and their preferred type of date. They would meet up at an agreed upon location without knowing how their date would look ahead of time. In April 2010, Time Out reported that the website was under construction for updates, but would remain free once it resumed operation. In 2013, it was relaunched and integrated into the OkCupid platform as an app for iPhone and Android devices.
In 2008, OkCupid spun off its test-design portion under the name Hello Quizzy (HQ), while keeping it inextricably linked to OkCupid and reserving existent OkCupid users' names on HQ. However, the original Dating Persona Test has since been removed.
Since August 2009, an "A-list" account option is available to users of OkCupid and provides additional services for monthly fees.
In February 2011, OkCupid was acquired by IAC/InterActiveCorp, operators of Match.com, for US$50 million. Editorial posts from 2010 by an OkCupid founder in which Match.com and pay-dating were criticized for exploiting users and being "fundamentally broken" were removed from the OkCupid blog at the time of the acquisition. In a press response, OkCupid's CEO explained that the removal was voluntary.
In November 2012, OkCupid launched the social discovery service Tallygram, but re |
https://en.wikipedia.org/wiki/Undo | Undo is an interaction technique which is implemented in many computer programs. It erases the last change done to the document, reverting it to an older state. In some more advanced programs, such as graphic processing, undo will negate the last command done to the file being edited. With the possibility of undo, users can explore and work without fear of making mistakes, because they can easily be undone.
The expectations for undo are easy to understand: to have a predictable functionality, and to include all "undoable" commands. Usually undo is available until the user undoes all executed operations. But there are some actions which are not stored in the undo list, and thus they cannot be undone. For example, save file is not undoable, but is queued in the list to show that it was executed. Another action which is usually not stored, and thus not undoable, is scrolling or selection.
The opposite of undo is redo. The redo command reverses the undo or advances the buffer to a more recent state.
The common components of undo functionality are the commands which were executed of the user, the history buffer(s) which stores the completed actions, the undo/redo manager for controlling the history buffer, and the user interface for interacting with the user.
In most Microsoft Windows applications, the keyboard shortcut for the undo command is Ctrl+Z or Alt+Backspace, and the shortcut for redo is Ctrl+Y or Ctrl+Shift+Z.
In most Apple Macintosh applications, the shortcut for the undo command is Command-Z, and the shortcut for redo is Command-Shift-Z.
On all platforms, the undo/redo functions can also be accessed via the Edit menu.
History
The ability to undo an operation on a computer was independently invented multiple times, in response to how people used computers.
The File Retrieval and Editing System, developed starting in 1968 at Brown University, is reported to be the first computer-based system to have had an "undo" feature.
Warren Teitelman developed a Programmer's Assistant as part of BBN-LISP with an Undo function, by 1971.
The Xerox PARC Bravo text editor had an Undo command in 1974.
A 1976 research report by Lance A. Miller and John C. Thomas of IBM, Behavioral Issues in the Use of Interactive Systems, noted that "it would be quite useful to permit users to 'take back' at least the immediately preceding command (by issuing some special 'undo' command)." The programmers at the Xerox PARC research center assigned the keyboard shortcut Ctrl-Z to the undo command, which became a crucial feature of text editors and word processors in the personal computer era. In 1980, Larry Tesler of Xerox PARC began working at Apple Computer. There, he and Bill Atkinson advocated for the presence of an undo command as a standard fixture on the Apple Lisa. Atkinson was able to convince the individual developers of the Lisa's application software to include a single level of undo and redo, but was unsuccessful in lobbying for multiple levels. When |
https://en.wikipedia.org/wiki/Allerion | Allerion may refer to:
Charge (heraldry)
Ultimate Corp; see Pick Operating System#Derivative and related products |
https://en.wikipedia.org/wiki/Queer%20Duck | Queer Duck is an American adult animated web series produced by Icebox.com that originally appeared on the company's website, then later moved to the American cable network Showtime, where it aired following the American version of Queer as Folk. Although far from being the first gay cartoon character, Queer Duck was the first animated series to have homosexuality as its predominant theme.
Like several later television cartoons, Queer Duck was animated in Macromedia Flash. The show was created, written, and executive-produced by Mike Reiss, who also produced network cartoons The Simpsons and The Critic. Queer Duck animation was directed and designed by Xeth Feinberg; the theme song was performed by drag celebrity RuPaul. In Canada, Queer Duck aired on Teletoon at Night whilst in the UK it was aired as a short segment as part of magazine show That Gay Show which aired on BBC Choice, the forerunner to BBC Three.
Scholar Lawrence La Fountain-Stokes called the use of the term queer duck as "interesting" and described the show as about a "group of American gay animals" with their personalities seemingly "based on gay white men."
Characters
Queer Duck
The title character, whose full name is Adam Seymour Duckstein (voiced by Jim J. Bullock), is a gay anthropomorphic duck who works as a nurse. In an interview included on the DVD release of Queer Duck: The Movie Reiss states that Bullock is the only member of the cast that is actually gay, and that he had insisted that the character be voiced by someone gay.
Queer Duck has cyan-colored feathers, a little spiky fringe, and may wear purple eye shadow. He wears a sleeveless rainbow top and, like almost everyone else in the series, does not wear trousers. This follows the tradition of semi-nudity of cartoon animals exemplified by Porky Pig, Donald Duck, Top Cat, etc. He is often shown to have two fingers and one thumb on each hand, though on occasion he has the three fingers and one thumb per hand that is typical of many contemporary cartoons.
Queer Duck is known to gossip about anything and everything, especially on the phone while watching television, as shown on Oh Christ!, The Gaining of Herpes from Sparky and A Gay Outing. He is promiscuous in his own way, but not as obsessed with sex as his boyfriend Openly Gator; for example, he'll often utter the word "cock" but swiftly follows it with another word, like "tails", such as in The Gay Road to Morocco.
His nemesis is known to be radio show host Laura Schlessinger, who is pictured as a haggard and ugly old woman.
Queer Duck has also been a victim of gay bashing, as shown in Ku Klux Klan & Ollie, in which Ku Klux Klan members attempt to burn his house down. When his disguise fails, he kisses the unveiled Jerry Falwell, only to get shot down by the other homophobes. When in heaven he finds out that famous icons like Socrates and Leonardo da Vinci are also gay, much to the chagrin of Jerry Falwell.
Over the course of the series, the audience learns |
https://en.wikipedia.org/wiki/Generation%20loss | Generation loss is the loss of quality between subsequent copies or transcodes of data. Anything that reduces the quality of the representation when copying, and would cause further reduction in quality on making a copy of the copy, can be considered a form of generation loss. File size increases are a common result of generation loss, as the introduction of artifacts may actually increase the entropy of the data through each generation.
Analog generation loss
In analog systems (including systems that use digital recording but make the copy over an analog connection), generation loss is mostly due to noise and bandwidth issues in cables, amplifiers, mixers, recording equipment and anything else between the source and the destination. Poorly adjusted distribution amplifiers and mismatched impedances can make these problems even worse. Repeated conversion between analog and digital can also cause loss.
Generation loss was a major consideration in complex analog audio and video editing, where multi-layered edits were often created by making intermediate mixes which were then "bounced down" back onto tape. Careful planning was required to minimize generation loss, and the resulting noise and poor frequency response.
One way of minimizing the number of generations needed was to use an audio mixing or video editing suite capable of mixing a large number of channels at once; in the extreme case, for example with a 48-track recording studio, an entire complex mixdown could be done in a single generation, although this was prohibitively expensive for all but the best-funded projects.
The introduction of professional analog noise reduction systems such as Dolby A helped reduce the amount of audible generation loss, but were eventually superseded by digital systems which vastly reduced generation loss.
According to ATIS, "Generation loss is limited to analog recording because digital recording and reproduction may be performed in a manner that is essentially free from generation loss."
Digital generation loss
Used correctly, digital technology can eliminate generation loss. This implies the exclusive use of lossless compression codecs or uncompressed data from recording or creation until the final lossy encode for distribution through internet streaming or optical discs. Copying a digital file gives an exact copy if the equipment is operating properly. This trait of digital technology has given rise to awareness of the risk of unauthorized copying. Before digital technology was widespread, a record label, for example, could be confident knowing that unauthorized copies of their music tracks were never as good as the originals.
Generation loss can still occur when using lossy video or audio compression codecs as these introduce artifacts into the source material with each encode or reencode. Lossy compression codecs such as Apple ProRes, Advanced Video Coding and mp3 are very widely used as they allow for dramatic reductions on file size while being i |
https://en.wikipedia.org/wiki/ScrollKeeper | ScrollKeeper is a document cataloging system. It manages documentation metadata, as specified by the Open Source Metadata Framework (OMF). ScrollKeeper was used by the GNOME desktop help browser, Yelp, but has since been replaced by Rarian. It was also used by the KDE help browser and ScrollServer documentation server.
References
External links
ScrollKeeper
ScrollKeeper on SourceForge.net
Open Source Metadata Framework
GNOME obsolete
KDE
Metadata |
https://en.wikipedia.org/wiki/Digital%20Systems | Digital Systems Inc., Seattle, USA, between 1966 and 1979 an accounting service and technology development company founded by John Q. Torode. The company was reorganized into the microcomputer design and development company Digital Microsystems, Inc. (DMS), Oakland, USA, founded in 1979. In 1984, it was sold to the new UK operation Digital Microsystems Ltd. (DML) (owned by Extel Group Plc) and finally ended its US operations in 1986. Without Torode, Digital Microsystems Ltd.'s product HiNet (Hierarchical Integration Network) was sold to Apricot Computers Plc in 1987. In 1986, Torode founded a new company, IC Designs, Inc., based partly on Theodore "Ted" H. Kehl's VLSI technology at the University of Washington (UW), which was bought by Cypress Semiconductor Corp. in 1993.
References
Further reading
Internet service providers of Bulgaria
Defunct computer companies of the United States |
https://en.wikipedia.org/wiki/TiK | TiK is an open source instant messaging client for the AOL Instant Messenger (AIM) system, which uses AOL's TOC protocol. It is a GUI client which is written in the Tcl/Tk programming language. Reportedly, the "T" and the "K" in TiK's name stands for "Tk", and the "i" stands for "instant messenger".
It was originally created and maintained by AOL, the first releases seemed to occur in the 1998 time frame, but roughly around 1999 AOL abandoned the project after producing version 0.75, the last AOL produced version. Following this, several independent developers continued to add new features to the client, however work has stalled and the client is currently unmaintained, the last version released was version 0.90.
External links
Independent TiK development website
Tik 0.75 (Last AOL Version)
AIM (software) clients
Free software programmed in Tcl
Free software that uses Tk (software) |
https://en.wikipedia.org/wiki/Neural%20circuit | A neural circuit (also known as a biological neural network BNNs) is a population of neurons interconnected by synapses to carry out a specific function when activated. Multiple neural circuits interconnect with one another to form large scale brain networks.
Neural circuits have inspired the design of artificial neural networks, though there are significant differences.
Early study
Early treatments of neural networks can be found in Herbert Spencer's Principles of Psychology, 3rd edition (1872), Theodor Meynert's Psychiatry (1884), William James' Principles of Psychology (1890), and Sigmund Freud's Project for a Scientific Psychology (composed 1895). The first rule of neuronal learning was described by Hebb in 1949, in the Hebbian theory. Thus, Hebbian pairing of pre-synaptic and post-synaptic activity can substantially alter the dynamic characteristics of the synaptic connection and therefore either facilitate or inhibit signal transmission. In 1959, the neuroscientists, Warren Sturgis McCulloch and Walter Pitts published the first works on the processing of neural networks. They showed theoretically that networks of artificial neurons could implement logical, arithmetic, and symbolic functions. Simplified models of biological neurons were set up, now usually called perceptrons or artificial neurons. These simple models accounted for neural summation (i.e., potentials at the post-synaptic membrane will summate in the cell body). Later models also provided for excitatory and inhibitory synaptic transmission.
Connections between neurons
The connections between neurons in the brain are much more complex than those of the artificial neurons used in the connectionist neural computing models of artificial neural networks. The basic kinds of connections between neurons are synapses: both chemical and electrical synapses.
The establishment of synapses enables the connection of neurons into millions of overlapping, and interlinking neural circuits. Presynaptic proteins called neurexins are central to this process.
One principle by which neurons work is neural summation – potentials at the postsynaptic membrane will sum up in the cell body. If the depolarization of the neuron at the axon hillock goes above threshold an action potential will occur that travels down the axon to the terminal endings to transmit a signal to other neurons. Excitatory and inhibitory synaptic transmission is realized mostly by excitatory postsynaptic potentials (EPSPs), and inhibitory postsynaptic potentials (IPSPs).
On the electrophysiological level, there are various phenomena which alter the response characteristics of individual synapses (called synaptic plasticity) and individual neurons (intrinsic plasticity). These are often divided into short-term plasticity and long-term plasticity. Long-term synaptic plasticity is often contended to be the most likely memory substrate. Usually, the term "neuroplasticity" refers to changes in the brain that are caused by activi |
https://en.wikipedia.org/wiki/Barcode%20printer | A barcode printer is a computer peripheral for printing barcode labels or tags that can be attached to, or printed directly on, physical objects. Barcode printers are commonly used to label cartons before shipment, or to label retail items with UPCs or EANs.
The most common barcode printers employ one of two different printing technologies. Direct thermal printers use a printhead to generate heat that causes a chemical reaction in specially designed paper that turns the paper black. Thermal transfer printers also use heat, but instead of reacting the paper, the heat melts a waxy or resin substance on a ribbon that runs over the label or tag material. The heat transfers ink from the ribbon to the paper. Direct thermal printers are generally less expensive, but they produce labels that can become illegible if exposed to heat, direct sunlight, or chemical vapors.
Barcode printers are designed for different markets. Industrial barcode printers are used in large warehouses and manufacturing facilities. They have large paper capacities, operate faster and have a longer service life. For retail and office environments, desktop barcode printers are most common.
See also
Computer printer
Label printer
References
External links
Printer
Computer printers
Automatic identification and data capture
Packaging machinery |
https://en.wikipedia.org/wiki/Mathematical%20software | Mathematical software is software used to model, analyze or calculate numeric, symbolic or geometric data.
Evolution of mathematical software
Numerical analysis and symbolic computation had been in most important place of the subject, but other kind of them is also growing now. A useful mathematical knowledge of such as algorism which exist before the invention of electronic computer, helped to mathematical software developing. On the other hand, by the growth of computing power (such as seeing on Moore's law), the new treatment (for example, a new kind of technique such as data assimilation which combined numerical analysis and statistics) needing conversely the progress of the mathematical science or applied mathematics.
The progress of mathematical information presentation such as TeX or MathML will demand to evolution form formula manipulation language to true mathematics manipulation language (notwithstanding the problem that whether mathematical theory is inconsistent or not). And popularization of general purpose mathematical software, special purpose mathematical software so called one purpose software which used special subject will alive with adapting for environment progress at normalization of platform. So the diversity of mathematical software will be kept.
Software calculator
A software calculator allows the user to perform simple mathematical operations, like addition, multiplication, exponentiation and trigonometry. Data input is typically manual, and the output is a text label.
Computer algebra systems
Many mathematical suites are computer algebra systems that use symbolic mathematics. They are designed to solve classical algebra equations and problems in human readable notation.
Statistics
Many tools are available for statistical analysis of data. See also Comparison of statistical packages.
Theorem provers and proof assistants
Optimization software
Geometry
Numerical analysis
The Netlib repository contains various collections of software routines for numerical problems, mostly in Fortran and C. Commercial products implementing many different numerical algorithms include the IMSL, NMath and NAG libraries; a free alternative is the GNU Scientific Library. A different approach is taken by the Numerical Recipes library, where emphasis is placed on clear understanding of algorithms.
Many computer algebra systems (listed above) can also be used for numerical computations.
Music mathematics software
Music mathematics software utilizes mathematics to analyze or synthesize musical symbols and patterns.
Musimat (by Gareth Loy)
Websites
A growing number of mathematical software is available in web browsers, without the need to download or install any code.
Programming libraries
Low-level mathematical libraries intended for use within other programming languages:
GMP, the GNU Multi-Precision Library for high-performant arbitrary precision arithmetic.
Class Library for Numbers, a high-level C++ library for arbitrary |
https://en.wikipedia.org/wiki/Field%20encapsulation | In computer programming, field encapsulation involves providing methods that can be used to read from or write to the field rather than accessing the field directly. Sometimes these accessor methods are called getX and setX (where X is the field's name), which are also known as mutator methods. Usually the accessor methods have public visibility while the field being encapsulated is given private visibility - this allows a programmer to restrict what actions another user of the code can perform. Compare the following Java class in which the name field has not been encapsulated:
public class NormalFieldClass {
public String name;
public static void main(String[] args)
{
NormalFieldClass example1 = new NormalFieldClass();
example1.name = "myName";
System.out.println("My name is " + example1.name);
}
}
with the same example using encapsulation:
public class EncapsulatedFieldClass {
private String name;
public String getName()
{
return name;
}
public void setName(String newName)
{
name = newName;
}
public static void main(String[] args)
{
EncapsulatedFieldClass example1 = new EncapsulatedFieldClass();
example1.setName("myName");
System.out.println("My name is " + example1.getName());
}
}
In the first example a user is free to use the public name variable however they see fit - in the second however the writer of the class retains control over how the private name variable is read and written by only permitting access to the field via its getName and setName methods.
Advantages
The internal storage format of the data is hidden; in the example, an expectation of the use of restricted character sets could allow data compression through recoding (e.g., of eight bit characters to a six bit code). An attempt to encode characters out of the range of the expected data could then be handled by casting an error in the set routine.
In general, the get and set methods may be produced in two versions - an efficient method that assumes that the caller is delivering appropriate data and that the data has been stored properly, and a debugging version that while slower, performs validity checks on data received and delivered. Such detection is useful when routines (calling or called) or internal storage formats are newly created or modified.
The location of the stored data within larger structures may be hidden and so enabling changes to be made to this storage without the necessity of changing the code that references the data. This also reduces the likelihood of unexpected side effects from such changes. This is especially advantageous when the accessors are part of an operating system (OS), a case where the calling (application) code may not be available to the developers of the OS.
Disadvantages
Access to a subroutine involves additional overhead not present when data is accessed directly. While this is becoming of less concern wi |
https://en.wikipedia.org/wiki/Blue%20Frontier%20Campaign | The Blue Frontier Campaign is a United States marine conservation activist organization founded by David Helvarg in 2003.
The Campaign has established a nationwide network of grassroots (the marine conservation community or Blue Movement calls this 'seaweed') lobbyists. It is campaigning for an American Oceans Act to protect what the members call "our public seas" and is working to improve ocean policies in the 23 coastal states of the United States. Blue Frontier supports maritime community activists by distributing model policies and practices. Its other objectives include the creation of books, a TV documentary series, and other educational materials on ocean exploration and stewardship. The first such creation was the 2005 - 2006 Ocean and Coastal Conservation Guide. The Blue Vision Conference in Washington DC in July 2004 and Blue Vision Mid-Atlantic Conference at the National Aquarium in Baltimore in April 2005 were the start of a series of seminars to introduce seaweed activists to oceanographers, port officials, and other marine stakeholders. Annual awards called "The Breakers" are presented in ten categories: Art & Entertainment, Conservation Science, Marine Education, Best Business Practices, and Hero of the Seas.
Future plans for the Campaign include endowing a fellowship for investigative reporting on waste, fraud and abuse on America's Seas, working to include marine education in middle school and high school curricula, and developing a media campaign that highlights lessons from the past American frontier, and "applies these to our new blue one".
The directors of the Campaign represent other activist organizations including Clean Ocean Action, The Democracy Collaborative, EarthEcho International, Khaled Bin Sultan Living Oceans Foundation, National Alliance for Hispanic Health, Reef Relief, and Save Our Shores. It also has a panel of over twenty advisors.
In 2007 two new Blue Frontier projects include Roz Savage's solo crossing of the Pacific Ocean, and a school program for the 50 Ways to Save the Ocean book.
See also
Seaweed rebellion
Publications
Helvarg, David, 50 Ways to Save the Ocean, (Inner Ocean Publishing, 2006)
Helvarg, David, Blue Frontier: Dispatches from America's Ocean Wilderness, (Sierra Club Books, 2006)
Helvarg, David (ed.), Ocean and Coastal Conservation Guide 2005-2006: The Blue Movement Directory, (Island Press, 2005)
Helvarg, David, Blue Frontier: Saving America's Living Seas, (W. H. Freeman, 2001)
References
Blue Frontier Campaign web-site Retrieved April 11, 2005
Marine conservation organizations
Nature conservation organizations based in the United States
Organizations established in 2003
2003 establishments in the United States |
https://en.wikipedia.org/wiki/UPX | UPX (Ultimate Packer for Executables) is a free and open source executable packer supporting a number of file formats from different operating systems.
Compression
UPX uses a data compression algorithm called UCL, which is an open-source implementation of portions of the proprietary NRV (Not Really Vanished) algorithm.
UCL has been designed to be simple enough that a decompressor can be implemented in just a few hundred bytes of code. UCL requires no additional memory to be allocated for decompression, a considerable advantage that means that a UPX packed executable usually requires no additional memory.
UPX (since 2.90 beta) can use LZMA on most platforms; however, this is disabled by default for 16-bit due to slow decompression speed on older computers (use --lzma to force it on).
Starting with version 3.91, UPX also supports 64-Bit (x64) PE files on the Windows platform. This feature is currently declared as experimental.
Decompression
UPX supports two mechanisms for decompression: an in-place technique and extraction to temporary file.
The in-place technique, which decompresses the executable into memory, is not possible on all supported platforms. It has the advantage of being more efficient in terms of memory, and that the environment set up by the OS remains correct.
The rest uses extraction to temporary file. This procedure involves additional overhead and other disadvantages; however, it allows any executable file format to be packed. The extraction to temporary file method has several disadvantages:
Special permissions are ignored, such as suid.
argv[0] will not be meaningful.
Multiple running instances of the executable are unable to share common segments.
Unmodified UPX packing is often detected and unpacked by antivirus software scanners. UPX also has a built-in feature for unpacking unmodified executables packed with itself.
Supported formats
UPX supports the following formats:
Portable Executable (PE, EXE and DLL files):
ARM (Windows CE)
32-bit x86 (Windows Desktop)
64-bit x86-64 (Windows Desktop, still experimental)
RTM32 (DOS extender, as generated by Borland C/Pascal compilers)
COFF executables, used by DJGPP2
a.out format, BSD i386 (removed)
Raw 8086/DOS files:
DOS/COM (including some binary images)
DOS/EXE
DOS/SYS
Watcom/LE (used by DOS4G, PMODE/W, DOS32A and CauseWay)
TMT/adam (as generated by the TMT Pascal compiler)
Atari/TOS
Linux kernel, i386, x86-64 and ARM
Linux Executable and Linkable Format, i386, x86-64, ARM, PowerPC, MIPS
PlayStation 1/EXE (MIPS R3000)
Darwin Mach-O, ppc32, i386, and x86-64
UPX does not currently support PE files containing CIL code intended to run on the .NET Framework.
Notes
References
External links
Free data compression software
Free software programmed in C++
EXE packers
1998 software
Assembly language software |
https://en.wikipedia.org/wiki/F1%20%28disambiguation%29 | F1 is Formula One, the highest class of auto racing sanctioned by the FIA.
F1, F01, F.I, F.1 or F-1 may refer to:
Computing
F1, a computer Function key
F1, an Office Assistant in Microsoft Office
F1 Magazine, a Syrian monthly computer magazine published in Arabic
Google F1, Google's SQL database management system (DBMS)
Oppo F1, a smartphone by Oppo Electronics
Military craft and weapons
F1 grenade (disambiguation), several types of hand grenade
F 1 Hässlö, a former Swedish Air Force wing
F1 SMG, an Australian submachine gun
Dassault Mirage F1, a French combat aircraft
FCM F1, a 1940 French super-heavy tank
Fokker F.I, a German fighter triplane
HMS F1, an F-class submarine of the Royal Navy, launched in 1915
HMS Kelly (F01), a 1938 British Royal Navy K-class destroyer
Kampfgeschwader 76, from its historic Geschwaderkennung code with the Luftwaffe in World War II
Mitsubishi F-1, a fighter/attack aircraft of the Japan Air Self-Defense Force
North American F-1 Fury, the FJ known as the F-1 from 1962 onward
Sopwith Camel F.1, a 1916 British World War I single-seat fighter biplane
USS F-1 (SS-20), an F-class submarine of the United States Navy
Felixstowe F.1, a Seaplane Experimental Station-designed flying boat
Fokker F.I (1919), an abortive design that served for the 1916 Fokker F.II airliner construction
Avion MAI F-1, a sporting biplane
FR F1, a French precision rifle
Science
F1 hybrid, a first-generation hybrid (or crossbreed) animal or plant
F1-isoprostane, a type of isoprostane
F1 layer, a layer of the ionosphere
F1 score, a statistical performance measure of a test or classifier
F-1 cubesat, a picosatellite developed in Vietnam
Vascular dementia's ICD-10 code
F1, a tornado intensity rating on the Fujita scale
f1, the formant with the lowest frequency in acoustics and phonetics
F-1 (nuclear reactor), the oldest operating research reactor
NIST-F1, a cesium fountain clock and the United States' primary time and frequency standard
F1, the field with one element
Vehicles
McLaren F1, a sports car
BMW F01, an automobile platform
F1, the project codename and development designation of the first Lexus vehicle
NCC Class F1, a Northern Counties Committee Irish steam locomotive
SECR F1 Class, a South Eastern and Chatham Railway, British steam locomotive
SP&S Class F-1, an American steam locomotive class, of the Spokane, Portland and Seattle 700
Ford F-Series, includes the F-1 pickup truck
Finnish Steam Locomotive Class F1
SpaceX Falcon 1 space launch rocket
Video games
F-1 Race, a 1984 game for the Famicom, later remade for Game Boy
F1 (video game), a 1993 multiformat game by Domark/Tengen
F1 Challenge, a 1995 Sega Saturn game by Virgin Interactive
F1 Grand Prix (2005 video game), a PSP game by Traveller's Tales
F1 2000 (video game), a game by Electronic Arts for the PlayStation
Formula One 04, a game by Studio Liverpool for PS2
Formula One 05, a game by Studio Liverpool for PS2
Formula One 06, a |
https://en.wikipedia.org/wiki/Netvigator | Netvigator is a residential Internet service provider in Hong Kong, operated as a brand of Hong Kong Telecom, a subsidiary of PCCW. The company did offer iTV, an interactive movie television network that allowed users to watch movies on their TV screen by demand. The service ended in 2002 (PCCW later re-entered multichannel television market with IPTV service Now TV in 2003).
History
Netvigator dial-up Internet Access Service was first launched under Hong Kong Telecom IMS Limited under the directorship of Dr. William Lo on 18 April 1996. It acquired another ISP, hkstar, with all the infrastructure and clients. Their broadband service, under the brand name "Super Netvigator" was launched as a value-added service of the InteractiveTV (iTV) in May 1998. Subsequently, it launched their standalone broadband service (directly connected to PC without iTV), under the service name "Netvigator 1.5M Ultraline", in July 1999.
United Kingdom operation
Trading initially under the Netvigator brand, with the company name UK Broadband, PCCW entered the UK broadband market with wireless broadband in mid-2004, starting with the Thames Valley. The brand migrated to Now Broadband during 2005, and the London market was opened for business. At the same time the support call centre for the UK was moved from Hong Kong to an outsourcer in the north of England.
In September 2007, Now Broadband sent out letters to selected areas in the UK cancelling the service, citing "limitations not apparent when we launched the service in your area" as the reason for closing certain radio sites.
References
External links
UK Broadband (ex-Netvigator) corporate details
Internet service providers of Hong Kong
Former internet service providers of the United Kingdom
Companies established in 1996
Pacific Century Group |
https://en.wikipedia.org/wiki/National%20Fire%20Incident%20Reporting%20System | The National Fire Incident Reporting System (NFIRS) is a system established by the National Fire Data Center of the United States Fire Administration (USFA), a division of the Federal Emergency Management Agency. The System was established after the 1973 National Commission on Fire Prevention and Control report, America Burning, led to passage of the Federal Fire Prevention and Control Act of 1974 (P.L. 93-498), which authorizes the USFA to gather and analyze information on the magnitude of the Nation's fire problem, as well as its detailed characteristics and trends. The Act further authorizes the USFA to develop uniform data reporting methods, and to encourage and assist state agencies in developing and reporting data.
The NFIRS has two objectives: to help state and local governments develop fire reporting and analysis capability for their own use, and to obtain data that can be used to more accurately assess and subsequently combat the fire problem at a national level. To meet these objectives, the USFA has developed a standard NFIRS package that includes incident and casualty forms, a coding structure for data processing purposes, manuals, computer software and procedures, documentation and a National Fire Academy training course for utilizing the system.
The NFIRS reporting format is based on the National Fire Protection Association Standard 901, "Uniform Coding for Fire Protection" (1976 version), the 1981 codes for Fire Service Casualty Reporting, and the 1990 codes for Hazardous Materials Reporting. The version of NFIRS current as of June, 2006, version 5.0, was released in January, 1999. NFIRS 5.0 expands the collection of data beyond fires to include the full range of fire department activity on a national scale. It is a true all-incident reporting system.
Within the NFIRS states, participating local fire departments fill out the Incident and Casualty reports as fires occur. They forward the completed incidents via paper forms, computer media or the Internet to their state office where the data is validated and consolidated into a single computerized database. Feedback reports are generated and forwarded to the participating fire departments. Periodically, computer media containing the aggregated statewide data is sent to the National Fire Data Center at the USFA to be included in the National Database. This database is used to answer questions about the nature and causes of injuries, deaths, and property loss resulting from fires. The information is disseminated through a variety of means to states and other organizations. The National Fire Incident Reporting System is a model of successful Federal, State and local partnership. The database constitutes the world's largest, national, annual collection of incident information.
The success of NFIRS is due in part to the unique cooperative effort between USFA and the National Fire Information Council (NFIC). NFIC plays a vital role in the USFA's efforts to achieve an accurate nationwid |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Delaware | The following is a list of FCC-licensed radio stations in the U.S. state of Delaware, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
WNWK
WRJE
See also
Delaware media
List of newspapers in Delaware
List of television stations in Delaware
Media of locales in Delaware: Dover, Wilmington
References
Bibliography
External links
(Directory ceased in 2017)
Maryland, DC, Delaware Broadcasters Association
Delaware
Radio |
https://en.wikipedia.org/wiki/Microsoft%20Pascal | Microsoft Pascal is a discontinued implementation of the Pascal programming language developed by the Microsoft Corporation for compiling programs for running on its MS-DOS and Xenix operating systems and, in later versions, on OS/2 (like many other Microsoft programming tools, albeit they are only capable of generating 16-bit programs for the latter).
Overview
Microsoft Pascal version 1.0 was released in 1980. The last version of Microsoft Pascal to be released was version 4.0 in 1988, when Microsoft Pascal was superseded by Microsoft QuickPascal, a cheaper development tool that Microsoft produced in order to compete with Borland's Turbo Pascal.
Microsoft Pascal was priced at , whereas QuickPascal was priced between , and the differences between the two were similar to those between Microsoft BASIC Professional Development System and Microsoft QuickBASIC.
Unlike the ISO compliant Microsoft Pascal product, QuickPascal went after the ultimate compatibility with Turbo Pascal. This included not only source-level compatibility, but rather complete binary compatibility with widely available unit libraries for the competitor's compiler. To achieve this level of compatibility, QuickPascal moved away from the common file format (OBJ) and tool set (LINK, LIB) shared by Microsoft's other compilers.
References
Notes
Jon Udell, Clash of the Object-Oriented Pascals, BYTE, July, 1989.
M.I.Trofimov, The End of Pascal?, BYTE, March, 1990, p. 36.
Pascal
Pascal programming language family |
https://en.wikipedia.org/wiki/System%20resource | In computing, a system resource, or simple resource, is any physical or virtual component of limited availability within a computer system. All connected devices and internal system components are resources. Virtual system resources include files (concretely file handles), network connections (concretely network sockets), and memory areas.
Managing resources is referred to as resource management, and includes both preventing resource leaks (not releasing a resource when a process has finished using it) and dealing with resource contention (when multiple processes wish to access a limited resource). Computing resources are used in cloud computing to provide services through networks.
Major resource types
Interrupt request (IRQ) lines
Direct memory access (DMA) channels
Port-mapped I/O
Memory-mapped I/O
Locks
External devices
External memory or objects, such as memory managed in native code, from Java; or objects in the Document Object Model (DOM), from JavaScript
General resources
CPU, both time on a single CPU and use of multiple CPUs – see multitasking
Random-access memory and virtual memory – see memory management
Hard disk drives, include space generally, contiguous free space (such as for swap space), and use of multiple physical devices ("spindles"), since using multiple devices allows parallelism
Cache space, including CPU cache and MMU cache (translation lookaside buffer)
Network throughput
Electrical power
Input/output operations
Randomness
Categories
Some resources, notably memory and storage space, have a notion of "location", and one can distinguish contiguous allocations from non-contiguous allocations. For example, allocating 1 GB of memory in a single block, versus allocating it in 1,024 blocks each of size 1 MB. The latter is known as fragmentation, and often severely impacts performance, so contiguous free space is a subcategory of the general resource of storage space.
One can also distinguish compressible resources from incompressible resources. Compressible resources, generally throughput ones such as CPU and network bandwidth, can be throttled benignly: the user will be slowed proportionally to the throttling, but will otherwise proceed normally. Other resources, generally storage ones such as memory, cannot be throttled without either causing failure (if a process cannot allocate enough memory, it typically cannot run) or severe performance degradation, such as due to thrashing (if a working set does not fit into memory and requires frequent paging, progress will slow significantly). The distinction is not always sharp; as mentioned, a paging system can allow main memory (primary storage) to be compressed (by paging to hard drive (secondary storage)), and some systems allow discardable memory for caches, which is compressible without disastrous performance impact. Electrical power is to some degree compressible: without power (or without sufficient voltage) an electrical device cannot run, and will sto |
https://en.wikipedia.org/wiki/Fellow%20%28emulator%29 | Fellow is an emulator designed to run software written for the Amiga computer platform. Released under the GNU General Public License, Fellow is free software.
Fellow was released shortly after the first usable release of the Unix Amiga Emulator (UAE). The competition between the two projects proved to be mutually beneficial. Originally, Fellow ran under DOS, but was ported to Microsoft Windows (WinFellow) and Linux (XFellow.) Development on WinFellow ceased in 2005, but was revived with a new release in 2010 to improve compatibility with Windows 7 and Windows Vista. Development on XFellow has apparently halted after a release in 2003 (based on timestamps inside the archive).
According to its author, Petter Schau, one of the main objectives in writing Fellow was to create an Amiga emulator that could run demos from the 1980s Amiga demoscene at full speed. Schau believed that Fellow and UAE belonged to a class of first-generation Amiga emulators, and that more accurate, full-speed emulators would be available in the future. As computing power increased, full-speed performance became achievable. Once more powerful computers were available, UAE became preferable due to its more accurate emulation, whereas Fellow remains popular for older hardware.
See also
Amiga emulation
References
External links
WinFellow
XFellow
Amiga emulators
Amiga
DOS emulation software
Windows emulation software
Free video game console emulators |
https://en.wikipedia.org/wiki/Archaeological%20theory | Archaeological theory refers to the various intellectual frameworks through which archaeologists interpret archaeological data. Archaeological theory functions as the application of philosophy of science to archaeology, and is occasionally referred to as philosophy of archaeology. There is no one singular theory of archaeology, but many, with different archaeologists believing that information should be interpreted in different ways. Throughout the history of the discipline, various trends of support for certain archaeological theories have emerged, peaked, and in some cases died out. Different archaeological theories differ on what the goals of the discipline are and how they can be achieved.
Some archaeological theories, such as processual archaeology, holds that archaeologists are able to develop accurate, objective information about past societies by applying the scientific method to their investigations, whilst others, such as post-processual archaeology, dispute this, and claim all archaeological data is tainted by human interpretation and social factors, and any interpretation they make about past societies is therefore subjective.
Other archaeological theories, such as Marxist archaeology, instead interpret archaeological evidence within a framework for how its proponents believe society operates. Marxist archaeologists in general believe that the bipolarism that exists between the processual and post-processual debates is an opposition inherent within knowledge production and is in accord with a dialectical understanding of the world. Many Marxist archaeologists believe that it is this polarism within the anthropological discipline (and all academic disciplines) that fuels the questions that spur progress in archaeological theory and knowledge. This constant interfacing and conflict between the extremes of the two heuristic playing grounds (subjective vs. objective) is believed to result in a continuous reconstruction of the past by scholars.
Background
Since the early 20th century, most accounts of archaeological methodology have accepted the data that is uncovered by the archaeologist is subsequently interpreted through a theoretical viewpoint. Nevertheless, the archaeological community is divided over the extent to which theory pervades the discipline. On one side, there are those who believe that certain archaeological techniques – such as excavation or recording – are neutral and outside of the bounds of theory, while on the other are those who believe that these too are also influenced by theoretical considerations. Archaeologist Ian Hodder, a prominent advocate of the latter view, criticised the alternate approach by highlighting that methodological decisions, such as where to open a trench, how diligently to excavate a stratigraphic layer and whether to keep every artefact discovered, are all based on prior theoretical interpretations of the site, and that even excavatory techniques could not therefore escape the realm of theo |
https://en.wikipedia.org/wiki/Ninne%20Pelladata%20%281996%20film%29 | Ninne Pelladata () is a 1996 Indian Telugu-language romantic family drama film, produced by Nagarjuna under the Annapurna Studios banner and directed by Krishna Vamsi. It stars Nagarjuna and Tabu, and music composed by Sandeep Chowta. The film was remade in Kannada as Preethsod Thappa. The film has received the National Film Award for Best Feature Film in Telugu for that year. This film recorded as Industry Hit at box office.
Plot
Ninne Pelladata is family romance based movie in which Mahalakshmi comes to Hyderabad for flight training and falls in love with Seenu. The duo decide to inform their respective parents of their plan to get married. Seenu's family welcomes Mahalakshmi, and approves of her. It is revealed during the film that Seenu's father is the brother of Mahalakshmi's mother who had married Mahalakshmi's father against the wishes of her brothers due to which there's an enemity between the 2 families. Just shortly after their approval, Mahalakshmi's parents interrupt the proceedings and forcibly take Mahalaxmi with them, to get her married to someone else. Finally, both Seenu and Mahalakshmi fights against both the families making them understand their mistake. Later, Seenu and Mahalakshmi gets married where both the families get united.
Cast
Soundtrack
The music was composed by Sandeep Chowta. Music released on T-Series Audio Company.
Unnaiye Kalyaanam Pannikkiren (Tamil Version)
Production
Krishna Vamsi went to Vishakapatnam to scout locations for a Nagarjuna film that would go on to become Samudram. After he got comparisons with Ram Gopal Varma's Gulabi (1995), Vamsi ditched the script and rewrote it so that it was sans violence. He took the Hindi films Hum Aapke Hain Koun..! (1994) and Dilwale Dulhania Le Jayenge (1995) for inspiration and changed the script to suit the Telugu audience. Vamsi narrated the script to Nagarjuna on the sets of Ramudochadu (1996). Nagarjuna accepted the film after the three minute narration.
Meena was initially offered the role of Tabu, but she was unable to adjust the dates, the crew searched for other options and finalized Tabu.
Box office
The film had a successful 100-day run in 39 centres.
The film had a 175-day run in 4 centres.
Its dubbed version in Tamil, Unnaiye Kalyanam Pannikiren was also a super hit.
Its Remake version in Kannada, Preethsod Thappa starring V. Ravichandran and Shilpa Shetty was also a super hit.
Its collected total 16.3 cr shares in total run and went onto become an industry hit.
Accolades
Notes
References
External links
1996 films
1990s Telugu-language films
Indian romantic drama films
Indian romantic musical films
Telugu films remade in other languages
Films directed by Krishna Vamsi
Films scored by Sandeep Chowta
Films set in Hyderabad, India
Best Telugu Feature Film National Film Award winners
1996 romantic drama films
1990s romantic musical films
Films shot in the Maldives |
https://en.wikipedia.org/wiki/Biodegradability%20prediction | Biodegradability prediction is biologically inspired computing and attempts to predict biodegradability of anthropogenic materials in the environment. Demand for biodegradability prediction is expected to increase with governments stepping up environmental regulations (see, for instance, testing for bioaccumulation in the REACH proposal).
Example:
Development of quantitative structure-activity relationship (QSARs) for biodegradation, for instance, biochemical oxygen demand for chemicals released into the environment with the aid of machine learning and other artificial intelligence methods.
The University of Minnesota Biocatalysis and Biodegradation Database (UM-BBD), which contains information on microbial biocatalytic reactions and biodegradation pathways for primarily xenobiotic, chemical compounds. One of its many features allows the prediction of microbial catabolic reactions using substructure searching, a rule-base, and atom-to-atom mapping.
See also
Anaerobic digestion
Biodegradation
Composting
Landfill gas monitoring
List of environment topics
List of ecology topics
Petersen matrix
References
External links
UM-BBD
Biodegradation
Biodegradable waste management |
https://en.wikipedia.org/wiki/Neural%20network | A neural network is a neural circuit of biological neurons, sometimes also called a biological neural network, or a network of artificial neurons or nodes in the case of an artificial neural network.
Artificial neural networks are used for solving artificial intelligence (AI) problems; they model connections of biological neurons as weights between nodes. A positive weight reflects an excitatory connection, while negative values mean inhibitory connections. All inputs are modified by a weight and summed. This activity is referred to as a linear combination. Finally, an activation function controls the amplitude of the output. For example, an acceptable range of output is usually between 0 and 1, or it could be −1 and 1.
These artificial networks may be used for predictive modeling, adaptive control and applications where they can be trained via a dataset. Self-learning resulting from experience can occur within networks, which can derive conclusions from a complex and seemingly unrelated set of information.
Overview
A biological neural network is composed of a group of chemically connected or functionally associated neurons. A single neuron may be connected to many other neurons and the total number of neurons and connections in a network may be extensive. Connections, called synapses, are usually formed from axons to dendrites, though dendrodendritic synapses and other connections are possible. Apart from electrical signalling, there are other forms of signalling that arise from neurotransmitter diffusion.
Artificial intelligence, cognitive modelling, and neural networks are information processing paradigms inspired by how biological neural systems process data. Artificial intelligence and cognitive modelling try to simulate some properties of biological neural networks. In the artificial intelligence field, artificial neural networks have been applied successfully to speech recognition, image analysis and adaptive control, in order to construct software agents (in computer and video games) or autonomous robots.
Historically, digital computers evolved from the von Neumann model, and operate via the execution of explicit instructions via access to memory by a number of processors. On the other hand, the origins of neural networks are based on efforts to model information processing in biological systems. Unlike the von Neumann model, neural network computing does not separate memory and processing.
Neural network theory has served to identify better how the neurons in the brain function and provide the basis for efforts to create artificial intelligence.
History
The preliminary theoretical base for contemporary neural networks was independently proposed by Alexander Bain (1873) and William James (1890). In their work, both thoughts and body activity resulted from interactions among neurons within the brain.
For Bain, every activity led to the firing of a certain set of neurons. When activities were repeated, the connections between thos |
https://en.wikipedia.org/wiki/Cutthroats%20%28video%20game%29 | Cutthroats is an interactive fiction computer game written by Michael Berlyn and Jerry Wolper and was published by Infocom in 1984. It was released for the Amiga, Apple II, Atari 8-bit, Atari ST, Commodore 64, MS-DOS, TRS-80, TI-99/4A, and Macintosh. It is Infocom's thirteenth game.
Plot
The game takes place in and around the fictional Hardscrabble Island. For centuries, Hardscrabble was a thriving seaport, but the local fishing industry died out in the 1920s. Most of the area's remaining population is an assortment of hard-luck types and people of questionable ethics.
The player's character is a skilled diver scraping to make ends meet. One night, an old shipmate named Hevlin barges in with a map indicating the locations of two previously undiscovered shipwrecks. Flashing between excitement and paranoia, Hevlin abruptly leaves, asking the player to safekeep the map. Naturally, the old sailor is murdered as he practically steps from the doorway; someone obviously wants this map quite badly.
As the player attempts to mount a perilous dive for sunken treasure, several characters offer their help. Some of them can be trusted and some cannot. Failure to tell the difference between the two can result in an "untimely accident". Successfully making positive contact with the right characters is the only way the player can advance to the actual shipwrecks. Once the dive begins the player must locate and retrieve the treasure from that wreck to complete the game.
Each time the game is played, either the São Vera or the Leviathan is randomly chosen as the wreck to be explored. The other two locations contain no treasure and are red herrings.
The game has 68 locations.
Release
Each package of Cutthroats contained the following physical items:
True Tales of Adventure, a fictional magazine catering to self-styled adventurers
Four Shipwrecks off Hardscrabble Island, a fictional book "published" by the Hardscrabble Harbor Historical Society with information on the wrecks of São Vera, H.M.S. Intrangisent, The Fianna, and S.S. Leviathan.
A dive map indicating the locations and depths of the above four ships
A "supplemental price list" from Outfitters International featuring a tide table. As the equipment available does not appear in list form or in any other reference within the game, the player requires the price list packaged with the game for a successful dive.
Reception
Antic criticized Cutthroats use of timed puzzles that "made us feel as though were being overly manipulated", and called others "obscure, illogical and nearly clueless. Be prepared to mail away for the [Invisiclues]". The magazine concluded that the game was inferior to Berlyn's Infidel.
References
External links
''Cutthroats' at Infocom-if.org]
Scans of the 'packaging
1980s interactive fiction
1984 video games
Adventure games
Amiga games
Apple II games
Atari 8-bit family games
Atari ST games
Classic Mac OS games
Commodore 64 games
DOS games
Infocom games
Scuba diving video games |
https://en.wikipedia.org/wiki/Lenslok | Lenslok is a copy protection mechanism found in some computer games and other software on the 8-bit Atari computers, Commodore 64, ZX Spectrum, Sinclair QL, MSX and Amstrad CPC. It was created by John Frost, an inventor and electronics consultant, and marketed by ASAP Developments, a subsidiary of J Rothschild Holdings. The first game to use it was Elite for the ZX Spectrum.
Overview
Lenslok was released in 1985 as a plastic lens in a foldaway frame. The Lenslok device was essentially a row of prisms arranged vertically in a plastic holder. Before the game started, a two-letter code was displayed on the screen, but it was corrupted by being split into vertical bands which were then rearranged on screen. By viewing these bands through the Lenslok they were restored to their correct order and the code could be read and entered allowing access to the game. The device was small enough when folded flat to fit next to an audio cassette in a standard case.
In order for the Lenslok to work correctly the displayed image has to be the correct size. This meant that before each use the software needed to be calibrated to take account of the size of the display. Users found this setup particularly annoying, at least in part because they found the instructions that were initially shipped unclear. Additionally, the device could not be calibrated at all for very large and very small televisions, and some games shipped with mismatched Lensloks that prevented the code from being correctly descrambled. The Lenslok system was not used in later releases of Elite.
Software
Lenslok was used on the following releases:
ACE, released by Cascade Games
Elite, released by Firebird
The Advanced Music System, released by Firebird
Fighter Pilot, released by Digital Integration
Graphic Adventure Creator, released by Incentive Software
Jewels of Darkness, released by Rainbird
Moon Cresta, released by Incentive Software
OCP Art Studio, released by Rainbird
The Price of Magik, released by Level 9 Computing
Supercharge, released by Digital Precision
Tomahawk, released by Digital Integration
TT Racer, released by Digital Integration
See also
Product key
References
External links
Lenslok Instruction Sheet (PDF file)
Bird Sanctuary - Lenslok Article containing further details on Lenslok, with photographs.
LensKey A Lenslok emulator allowing access to emulated versions of the games.
Copy protection
ZX Spectrum
Atari 8-bit family |
https://en.wikipedia.org/wiki/Bi-directional%20delay%20line | In mathematics, a bi-directional delay line is a numerical analysis technique used in computer simulation for solving ordinary differential equations by converting them to hyperbolic equations. In this way an explicit solution scheme is obtained with highly robust numerical properties. It was introduced by Auslander in 1968.
It originates from simulation of hydraulic pipelines where wave propagation was studied. It was then found that it could be used as an efficient numerical technique for numerically insulating different parts of a simulation model in each times step. It is used in the HOPSAN simulation package (Krus et al. 1990).
It is also known as the Transmission Line Modelling (TLM) from an independent development by Johns and O'Brian 1980. This is also extended to partial differential equations.
References
D.M. Auslander, "Distributed System Simulation with Bilateral Delay Line Models", Journal of Basic Engineering, Trans. ASME p195-p200. June 1968.
P. B. Johns and M.O'Brien. "Use of the transmission line modelling (t.l.m) method to solve nonlinear lumped networks", The Radio Electron and Engineer. 1980.
P Krus, A Jansson, J-O Palmberg, K Weddfeldt. "Distributed Simulation of Hydromechanical Systems". Presented at Third Bath International Fluid Power Workshop, Bath, UK 1990.
Numerical differential equations
Numerical analysis |
https://en.wikipedia.org/wiki/Write%20once%2C%20compile%20anywhere | Write once, compile anywhere (WOCA) is a philosophy taken by a compiler and its associated software libraries or by a software library/software framework which refers to a capability of writing a computer program that can be compiled on all platforms without the need to modify its source code. As opposed to Sun's write once, run anywhere slogan, cross-platform compatibility is implemented only at the source code level, rather than also at the compiled binary code level.
Introduction
There are many languages that follow the WOCA philosophy, such as C++, Pascal (see Free Pascal), Ada, Cobol, or C, on condition that they don't use functions beyond those provided by the standard library. Languages like Go go even further in as far that no system specific things are used, it should just work, and for system-specific elements a system of platform-specific files is used. A computer program may also use cross-platform libraries, which provide an abstraction layer hiding the differences between various platforms, for things like sockets and GUI, ensuring the portability of the written source code. This is, for example, supported by Qt (C++) or the Lazarus (Pascal) IDE via its LCL and corresponding widgetsets.
Today, we have very powerful desktop computers as well as computers in our phones, which often have sophisticated applications such as word processing, Database management, and spreadsheets, that can allow people with no programming experience to, sort, extract, and manipulate their data. and create documents (such as PDF files) showing their now organized information, or printing it out. Before 2000, some of these were not available, and prior to 1980, almost none of them were.
From the start of computer automation in the early 1960s, if you wanted a report from data you had, or needed to print up invoices, payroll checks, purchase orders, and other paperwork businesses, schools and governments generated, you typed them up on a physical typewriter, possibly using pre-printed forms. Otherwise, if you did have information stored in a computer, and wanted it sorted, manipulated, or printed, it required someone to write a program to do so. In some cases, the person needed information that professional programmers either could not understand how to provide a program to do what they wanted; the available programmers could not produce something in a reasonable amount of time; or there weren't any programmers they could use, caused some non-programming professionals to learn some programming skills, at least to know how to manipulate and print out information they needed from their data.
Whether the work was done by a professional programmer, or an end-user writing a program to provide them information for their own use, the means to do this in either case is the same. Write a program, submit it to a compiler (another program that converts written programs into instructions the computer can understand), fix any errors, then repeat until the program wor |
https://en.wikipedia.org/wiki/Barcelona%20Supercomputing%20Center | The Barcelona Supercomputing Center () is a public research center located in Barcelona, Catalonia, Spain. It hosts MareNostrum, a 13.7 Petaflops, Intel Xeon Platinum-based supercomputer, which also includes clusters of emerging technologies. , it ranked 13th in the world. , it dropped to 88th. It is expected to host one of Europe's first quantum computers.
Location and management
The Center is located in a former chapel named Torre Girona, at the Polytechnic University of Catalonia (UPC), and was established on April 1, 2005. It is managed by a consortium composed of the Spanish Ministry of Science and Innovation (60%), the Government of Catalonia (30%) and the UPC (10%). Professor Mateo Valero is its main administrator. The MareNostrum supercomputer is contained inside an enormous glass box in a former chapel.
Budget
The Barcelona Supercomputing Center had an initial operational budget of €5.5 million/year (about US$7 million/year) to cover the period of 2005–2011. The center has had a very rapid growth and in 2018 had a workforce of around 600 workers and an annual global budget of more than 34 million euros.
The Center has contributed to the development of the IBM cell microprocessor architecture.
Staff
Director: Mateo Valero
Associate director: Josep Maria Martorell
Computer Sciences director: Jesús Labarta
Computer Sciences associate director: Eduard Ayguadé
Life Sciences director: Alfonso Valencia
Earth Sciences director:
Computer Applications for Science and Engineering director: José María Cela
Operations director: Sergi Girona
In popular culture
The Barcelona Supercomputing Center appears in Dan Brown's 2017 science fiction mystery thriller novel Origin, as the home of the E-Wave device.
Notes
External links
Barcelona Supercomputing Center (BSC)
Research institutes in Catalonia
Polytechnic University of Catalonia
Supercomputer sites
2005 establishments in Catalonia
Research institutes established in 2005 |
https://en.wikipedia.org/wiki/Sentient%20Networks | Sentient Networks, Inc., was an American networking hardware company that manufactured of Asynchronous Transfer Mode (ATM) and Frame Relay concentrators and switches for central offices. Founded in 1995 in Sarasota, Florida, the company soon after moved to San Jose, California. It was acquired by Cisco Systems in 1999.
History
Sentient Networks was founded in 1995 by Nimish Shah, who previously an employee of Loral Data Systems in Sarasota, Florida, before the latter subsidiary was shut down. He founded Sentient in Tampa Bay, Florida; the company soon saw venture capital backing from companies such as Sequoia Capital Accel Partners, AT&T, and Ameritech. By late 1996, the company employed 35 and had leased a 6,000-square-foot building in Sarasota for its headquarters and a 1,000-square-foot facility in San Jose, California, as a regional office. In September 1996, the company moved its entire operations to a 26,000-square-foot facility in San Jose.
Sentient made products for Internet service providers, interexchange carriers, and Regional Bell Operating Companies. It developed the industry's highest-density ATM Circuit Emulation Service (CES) gateway. The company's first successful product was the Ultimate 1000 network switch, which incorporated the company's new proprietary Any Service/Any Port architecture, allowing individual parts to be configured as ATM or Frame Relay switches. Released in 1996, it was purportedly the first product to comply fully with the ATM Forum's "Anchorage Accord" specification. Sentient negotiated an OEM agreement with DSC Communitations in 1997 for their Ultimate 1000.
Cisco Systems, also of San Jose, announced their intent to acquire on April 8, 1999. Sentient at that point had 102 employees; its CEO was Greg McAdoo. Sentient's employees joined the Multi-Service Switching business unit (MSSBU) of Cisco, which was the part of Cisco created by their acquisition of StrataCom. The acquisition was finalized June 25, 1999, with Sentient receiving $125 million.
References
1995 establishments in Florida
1996 disestablishments in Florida
1996 establishments in California
1999 disestablishments in California
1999 mergers and acquisitions
American companies established in 1995
American companies disestablished in 1999
Cisco Systems acquisitions
Computer companies established in 1995
Computer companies disestablished in 1999
Defunct computer companies of the United States
Defunct networking companies
Networking hardware companies |
https://en.wikipedia.org/wiki/Superconducting%20quantum%20computing | Superconducting quantum computing is a branch of solid state quantum computing that implements superconducting electronic circuits using superconducting qubits as artificial atoms, or quantum dots. For superconducting qubits, the two logic states are the ground state and the excited state, denoted respectively. Research in superconducting quantum computing is conducted by companies such as Google, IBM, IMEC, BBN Technologies, Rigetti, and Intel. Many recently developed QPUs (quantum processing units, or quantum chips) utilize superconducting architecture.
, up to 9 fully controllable qubits are demonstrated in the 1D array, and up to 16 in 2D architecture. In October 2019, the Martinis group, partnered with Google, published an article demonstrating novel quantum supremacy, using a chip composed of 53 superconducting qubits.
Background
Classical computation models rely on physical implementations consistent with the laws of classical mechanics. Classical descriptions are accurate only for specific systems consisting of a relatively large number of atoms. A more general description of nature is given by quantum mechanics. Quantum computation studies quantum phenomena applications beyond the scope of classical approximation for the purpose of informing artificial intelligence processing and communication. Various models of quantum computation exist, but the most popular models incorporate concepts of qubits and quantum gates (or gate-based superconducting quantum computing).
Superconductors are implemented due to the fact that at low temperatures they have infinite conductivity and zero resistance. Each qubit is built using semiconductor circuits with an LC circuit: a capacitor and an inductor.
Superconducting capacitors and inductors are used to produce a resonant circuit that dissipates almost no energy, as heat can disrupt quantum information. The superconducting resonant circuits are a class of artificial atoms that can be used as qubits. Theoretical and physical implementations of quantum circuits are widely different. Implementing a quantum circuit had its own set of challenges and must abide by DiVincenzo's criteria, conditions proposed by theoretical physicist David P DiVincenzo, which is set of criteria for the physical implementation of superconducting quantum computing, where the initial five criteria ensure that the quantum computer is in line with the postulates of quantum mechanics and the remaining two pertaining to the relaying of this information over a network.
We map the ground and excited states of these atoms to the 0 and 1 state as these are discrete and distinct energy values and therefore it is in line with the postulates of quantum mechanics. In such a construction however an electron can jump to multiple other energy states and not be confined to our excited state; therefore, it is imperative that the system be limited to be affected only by photons with energy difference required to jump from the ground state to th |
https://en.wikipedia.org/wiki/ATM%20Forum | The ATM Forum was founded in 1991 to be the industry consortium to promote Asynchronous Transfer Mode technology used in telecommunication networks; the founding president and chairman was Fred Sammartino of Sun Microsystems. It was a non-profit international organization. The ATM Forum created over 200 implementation agreements.
History
In 1996 ATM technology stabilized with the "Anchorage Accord", which established the baseline of ATM implementations. While ATM did not live up to every expectation, it remained an important core network technology.
The Frame Relay Forum (promoting Frame Relay) also started in 1991. The MPLS Forum (which supported Multiprotocol Label Switching had begun in 2000. Those two merged in 2003 to become the MPLS and Frame Relay Alliance (MFA).
In 2005, the ATM Forum joined forces with the MFA to form the MFA Forum, which was renamed to be the IP/MPLS Forum.
In May 2009 the IP/MPLS Forum merged with the Broadband Forum.
Sampling of specifications
ATM-MPLS Network Interworking
Multi-Protocol Over ATM
TM 4.1
User-Network Interface
B-ICI
ANNI
PNNI
Frame-based ATM
ILMI
622.08 Mbit/s physical layer
Inverse ATM Mux
Circuit Emulation Service
ATM Security Framework
Circuit Emulation Service
A widely adopted specification to emerge from the ATM Forum was the Circuit Emulation Service (CES) specification. This specification defined a method of creating a service out of mapping TDM DS0 and DS1/E1 Plesiochronous Digital Hierarchy (PDH) signals into Asynchronous Transfer Mode (ATM) cells. It also supported J2 and DS-3 signals. The service was built around the ATM Adaption Layer 1 specification from the ITU. The 1.0 version was approved about 1995 and the 2.0 version was approved in January 1997.
References
External links
ATM Forum
ATM Forum Interoperability Agreements
MFA Forum
Technology consortia
Asynchronous Transfer Mode |
https://en.wikipedia.org/wiki/Mathcad | Mathcad is computer software for the verification, validation, documentation and re-use of mathematical calculations in engineering and science, notably mechanical, chemical, electrical, and civil engineering. Released in 1986 on DOS, it introduced live editing (WYSIWYG) of typeset mathematical notation in an interactive notebook, combined with automatic computations. It was originally developed by Mathsoft, and since 2006 has been a product of Parametric Technology Corporation.
History
Mathcad was conceived and developed by Allen Razdow and Josh Bernoff at Mathsoft founded by David Blohm and Razdow. It was released in 1986. It was the first system to support WYSIWYG editing and recalculation of mathematical calculations mixed with text. It was also the first to check the consistency of engineering units through the full calculation. Other equation solving systems existed at the time, but did not provide a notebook interface: Software Arts' TK Solver was released in 1982, and Borland's Eureka: The Solver was released in 1987.
Mathcad was acquired by Parametric Technology in April 2006.
Mathcad was named "Best of '87" and "Best of '88" by PC Magazines editors.
Overview
Mathcad's central interface is an interactive notebook in which equations and expressions are created and manipulated in the same graphical format in which they are presented (WYSIWYG). This approach was adopted by systems such as Mathematica, Maple, Macsyma, MATLAB, and Jupyter.
Mathcad today includes some of the capabilities of a computer algebra system, but remains oriented towards ease of use and documentation of numerical engineering applications.
Mathcad is part of a broader product development system developed by PTC, addressing analytical steps in systems engineering. It integrates with PTC's Creo Elements/Pro, Windchill, and Creo Elements/View. Its live feature-level integration with Creo Elements/Pro enables Mathcad analytical models to be directly used in driving CAD geometry, and its structural awareness within Windchill allows live calculations to be re-used and re-applied toward multiple design models.
Summary of capabilities
The Mathcad interface allows users to combine a variety of different elements (mathematics, descriptive text, and supporting imagery) into a worksheet, in which dependent calculations are dynamically recalculated as inputs change. This allows for simple manipulation of input variables, assumptions, and expressions. Mathcad's functionality includes:
Numerous numeric functions for statistics, data analysis, image processing, and signal processing;
Ubiquitous dimensionality checking and simplification;
Solution of systems of equations, such as ODEs and PDEs using several methods;
Root finding for polynomials and other functions;
Symbolic manipulation of mathematical expressions;
Parametric 2D and 3D plotting and discrete data plotting;
Leverage standard, readable mathematical expressions within embedded program constructs;
Vector and |
https://en.wikipedia.org/wiki/Aravind%20Joshi | Aravind Krishna Joshi (August 5, 1929 – December 31, 2017) was the Henry Salvatori Professor of Computer and Cognitive Science in the computer science department of the University of Pennsylvania. Joshi defined the tree-adjoining grammar formalism which is often used in computational linguistics and natural language processing.
Joshi studied at Pune University and the Indian Institute of Science, where he was awarded a BE in electrical engineering and a DIISc in communication engineering respectively. Joshi's graduate work was done in the electrical engineering department at the University of Pennsylvania, and he was awarded his PhD in 1960. He became a professor at Penn and was the co-founder and co-director of the Institute for Research in Cognitive Science.
Awards and recognitions
Guggenheim fellow, 1971–72
Fellow of the Institute of Electrical and Electronics Engineers (IEEE), 1976
Best Paper Award at the National Conference on Artificial Intelligence, 1987
Founding Fellow of the American Association for Artificial Intelligence (AAAI), 1990
IJCAI Award for Research Excellence, 1997
Fellow of the Association for Computing Machinery, 1998
Elected to the National Academy of Engineering, 1999
First to be awarded the Association for Computational Linguistics Lifetime Achievement Award at the 40th anniversary meeting of the ACL, 2002
Awarded the Rumelhart Prize, 2003
Benjamin Franklin Medal in Computer and Cognitive Science, 2005
Doctor honoris causa of mathematical and physical sciences, Charles University in Prague, October 30, 2013
S.-Y. Kuroda Prize of the SIG Mathematics of Language of the ACL, 2013
Awarded history
On April 21, 2005, Joshi was awarded the Franklin Institute's Benjamin Franklin Medal in Computer and Cognitive Science. The Franklin Institute citation states that he was awarded the medal "for his fundamental contributions to our understanding of how language is represented in the mind, and for developing techniques that enable computers to process efficiently the wide range of human languages. These advances have led to new methods for computer translation."
References
External links
Aravind Joshi's home page
ACL Lifetime Achievement Award
Benjamin Franklin Award
1929 births
2017 deaths
Linguists from the United States
American people of Marathi descent
Fellows of the Association for Computing Machinery
Fellow Members of the IEEE
University of Pennsylvania faculty
Indian emigrants to the United States
Fellows of the Association for the Advancement of Artificial Intelligence
Artificial intelligence researchers
Computational linguistics researchers
American computer scientists
Indian computer scientists
American Hindus
The Benjamin Franklin Medal in Computer and Cognitive Science laureates
Indian Institute of Science alumni
Members of the United States National Academy of Engineering
Rumelhart Prize laureates
Scientists from Pune
American academics of Indian descent
20th-century Indian mathematicians
Fellows |
https://en.wikipedia.org/wiki/Reconfigure | To reconfigure refers to:
Reconfigurable computing: changing the data path of a computing system in addition to the control flow
Control reconfiguration: changing the loop structure and controller parameters in an automatic control loop
Reconfigurable antenna: changing the antenna physically or electrically to control its antenna properties |
https://en.wikipedia.org/wiki/Mindat.org | Mindat.org is a non-commercial interactive online database covering minerals across the world. Originally created by Jolyon Ralph as a private project in 1993, it was launched as a community-editable website in October 2000. it is operated by the Hudson Institute of Mineralogy.
History
Mindat was started in 1993 as a personal database project by Jolyon Ralph. He then developed further versions as a Microsoft Windows application before launching a community-editable database website on 10 October 2000.
After further development taking to the Internet stage, Mindat.org became an outreach program of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit educational foundation incorporated in the state of New York. To address the increasing open data needs from individual researchers and organizations, Mindat.org has started to build and maintain an open data API for data query and access, and the efforts have received support from the National Science Foundation.
Description
Mindat claims to be the largest mineral database and mineralogical reference website on the Internet. It is used by professional mineralogists, geologists, and amateur mineral collectors alike, and is referenced in many publications.
The database covers a variety of topics: scientific articles, field trip reports, mining history, advice for collectors, book reviews, mineral entries, localities, and photographs. Much of the information is from published literature, but registered editors may add and revise information and references. Editors are vetted for their expertise, in order to ensure accuracy. References have to be provided in the proper format, and editors own the copyright of data that they have contributed. The data is organized into mineral and locality pages, with links that allow for easy navigation among the pages.
The pages about minerals include individual minerals and rocks. Naming conventions adhere to the various standards and definitions as published by the International Mineralogical Association, the British Geological Survey, and the Meteoritical Society.
It interfaces directly with the Mineral Evolution Database (MED), and is an important source for scientific research. Many studies have used Mindat for locality information when building knowledge about diversity and distribution of minerals.
, it included:
Around 300,000 mineral localities
Over 1.2m mineral-locality pairs
Nearly a million photographs
Information on Apollo lunar samples and meteorites
Recognition
Jolyon Ralph was awarded the Mineralogical Society of America's Distinguished Public Service Medal in 2011 for his work on Mindat.org.
References
External links
Mindat.org - 10 years online today (archived copy)
Gemdat.org a related website
Online databases
Mineralogy
American science websites
Scientific databases |
https://en.wikipedia.org/wiki/Polytree | In mathematics, and more specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclic graph whose underlying undirected graph is a tree. In other words, if we replace its directed edges with undirected edges, we obtain an undirected graph that is both connected and acyclic.
A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirected graph is a forest. In other words, if we replace its directed edges with undirected edges, we obtain an undirected graph that is acyclic.
A polytree is an example of an oriented graph.
The term polytree was coined in 1987 by Rebane and Pearl.
Related structures
An arborescence is a directed rooted tree, i.e. a directed acyclic graph in which there exists a single source node that has a unique path to every other node. Every arborescence is a polytree, but not every polytree is an arborescence.
A multitree is a directed acyclic graph in which the subgraph reachable from any node forms a tree. Every polytree is a multitree.
The reachability relationship among the nodes of a polytree forms a partial order that has order dimension at most three. If the order dimension is three, there must exist a subset of seven elements , , and such that, for either or , with these six inequalities defining the polytree structure on these seven elements.
A fence or zigzag poset is a special case of a polytree in which the underlying tree is a path and the edges have orientations that alternate along the path. The reachability ordering in a polytree has also been called a generalized fence.
Enumeration
The number of distinct polytrees on unlabeled nodes, for , is
Sumner's conjecture
Sumner's conjecture, named after David Sumner, states that tournaments are universal graphs for polytrees, in the sense that every tournament with vertices contains every polytree with vertices as a subgraph. Although it remains unsolved, it has been proven for all sufficiently large values of .
Applications
Polytrees have been used as a graphical model for probabilistic reasoning. If a Bayesian network has the structure of a polytree, then belief propagation may be used to perform inference efficiently on it.
The contour tree of a real-valued function on a vector space is a polytree that describes the level sets of the function. The nodes of the contour tree are the level sets that pass through a critical point of the function and the edges describe contiguous sets of level sets without a critical point. The orientation of an edge is determined by the comparison between the function values on the corresponding two level sets.
See also
Glossary of graph theory
Notes
References
.
.
.
.
.
.
.
.
.
Trees (graph theory)
Directed acyclic graphs |
https://en.wikipedia.org/wiki/Solarsoft | Solarsoft is a collaborative software development system created at Lockheed-Martin to support solar data analysis and spacecraft operation activities. It is widely recognized in the solar physics community as having revolutionized solar data analysis starting in the early 1990s. Solarsoft is in active development and use by research groups on all seven continents.
Solarsoft is a store-and-forward system that makes use of rsync, csh and other UNIX tools to distribute the software to a wide variety of platforms. Solarsoft predates CVS and most other collaborative development systems; hence, it does not provide direct support for many features that today would be considered necessary, such as software versioning. The use of Solarsoft has grown to include calibration data and even complete catalog indices for some instruments, as well as the scientific software.
Most of the software in the Solarsoft tree pertains to either solar data analysis or specific space missions or observatories such as Yohkoh or SOHO. The vast majority is written in IDL, the most commonly used analysis platform in the solar physics community, though some C, ana, and PDL modules are also available.
External links
Solarsoft @ LMSAL
Solarsoft @ NASA
Physics software
Lockheed Martin |
https://en.wikipedia.org/wiki/Factory%20%28object-oriented%20programming%29 | In object-oriented programming, a factory is an object for creating other objects; formally, it is a function or method that returns objects of a varying prototype or class from some method call, which is assumed to be "new". More broadly, a subroutine that returns a "new" object may be referred to as a "factory", as in factory method or factory function. The factory pattern is the basis for a number of related software design patterns.
Motivation
In class-based programming, a factory is an abstraction of a constructor of a class, while in prototype-based programming a factory is an abstraction of a prototype object. A constructor is concrete in that it creates objects as instances of a single class, and by a specified process (class instantiation), while a factory can create objects by instantiating various classes, or by using other allocation schemes such as an object pool. A prototype object is concrete in that it is used to create objects by being cloned, while a factory can create objects by cloning various prototypes, or by other allocation schemes.
A factory may be implemented in various ways. Most often it is implemented as a method, in which case it is called a factory method. Sometimes it is implemented as a function, in which case it is called a factory function. In some languages, constructors are themselves factories. However, in most languages they are not, and constructors are invoked in a way that is idiomatic to the language, such as by using the keyword new, while a factory has no special status and is invoked via an ordinary method call or function call. In these languages, a factory is an abstraction of a constructor, but not strictly a generalization, as constructors are not themselves factories.
Terminology
Terminology differs as to whether the concept of a factory is itself a design pattern – in Design Patterns there is no "factory pattern", but instead two patterns (factory method pattern and abstract factory pattern) that use factories. Some sources refer to the concept as the factory pattern, while others consider the concept itself a programming idiom, reserving the term "factory pattern" or "factory patterns" to more complicated patterns that use factories, most often the factory method pattern; in this context, the concept of a factory itself may be referred to as a simple factory. In other contexts, particularly the Python language, "factory" itself is used, as in this article. More broadly, "factory" may be applied not just to an object that returns objects from some method call, but to a subroutine that returns objects, as in a factory function (even if functions are not objects) or factory method. Because in many languages factories are invoked by calling a method, the general concept of a factory is often confused with the specific factory method pattern design pattern.
Use
OOP provides polymorphism on object use by method dispatch, formally subtype polymorphism via single dispatch determined by the type of |
https://en.wikipedia.org/wiki/Language%20processing%20in%20the%20brain | In psycholinguistics, language processing refers to the way humans use words to communicate ideas and feelings, and how such communications are processed and understood. Language processing is considered to be a uniquely human ability that is not produced with the same grammatical understanding or systematicity in even human's closest primate relatives.
Throughout the 20th century the dominant model for language processing in the brain was the Geschwind-Lichteim-Wernicke model, which is based primarily on the analysis of brain-damaged patients. However, due to improvements in intra-cortical electrophysiological recordings of monkey and human brains, as well non-invasive techniques such as fMRI, PET, MEG and EEG, a dual auditory pathway has been revealed and a two-streams model has been developed. In accordance with this model, there are two pathways that connect the auditory cortex to the frontal lobe, each pathway accounting for different linguistic roles. The auditory ventral stream pathway is responsible for sound recognition, and is accordingly known as the auditory 'what' pathway. The auditory dorsal stream in both humans and non-human primates is responsible for sound localization, and is accordingly known as the auditory 'where' pathway. In humans, this pathway (especially in the left hemisphere) is also responsible for speech production, speech repetition, lip-reading, and phonological working memory and long-term memory. In accordance with the 'from where to what' model of language evolution, the reason the ADS is characterized with such a broad range of functions is that each indicates a different stage in language evolution.
The division of the two streams first occurs in the auditory nerve where the anterior branch enters the anterior cochlear nucleus in the brainstem which gives rise to the auditory ventral stream. The posterior branch enters the dorsal and posteroventral cochlear nucleus to give rise to the auditory dorsal stream.
Language processing can also occur in relation to signed languages or written content.
Early neurolinguistics models
Throughout the 20th century, our knowledge of language processing in the brain was dominated by the Wernicke-Lichtheim-Geschwind model. The Wernicke-Lichtheim-Geschwind model is primarily based on research conducted on brain-damaged individuals who were reported to possess a variety of language related disorders. In accordance with this model, words are perceived via a specialized word reception center (Wernicke's area) that is located in the left temporoparietal junction. This region then projects to a word production center (Broca's area) that is located in the left inferior frontal gyrus. Because almost all language input was thought to funnel via Wernicke's area and all language output to funnel via Broca's area, it became extremely difficult to identify the basic properties of each region. This lack of clear definition for the contribution of Wernicke's and Broca's regions to hu |
https://en.wikipedia.org/wiki/Inductionism | Inductionism is the scientific philosophy where laws are "induced" from sets of data. As an example, one might measure the strength of electrical forces at varying distances from charges and induce the inverse square law of electrostatics. This concept is considered one of the two pillars of the old view of the philosophy of science, together with verifiability. An application of inductionism can show how experimental evidence can confirm or inductively justify the belief in generalization and the laws of nature.
Origin and development
Some aspects of induction has been credited to Aristotle. For example, in Prior Analytics, he proposed an inductive syllogism, which served to establish the primary and immediate proposition. For scholars, this constitutes the principle of demonstrative science. The Greek philosopher, however, did not develop a detailed theory of induction. Some sources even state that the Aristotelian conceptualization of induction is different from its modern mainstream interpretations due to its position that inductive arguments are deductively valid.
The early form of modern inductionism is associated with the philosophies of thinkers such as Francis Bacon. This can be demonstrated in the way Bacon favored the steady and incremental collection of empirical evidence using a method that derives general principles from the senses and particulars, gradually leading to the most general principles.
Inductionism is also said to be based on Newtonian physics. This is evident in Isaac Newton's Rule of Reasoning in Philosophy, which articulated his belief that it is imperative to cover the unobservably small features of the world through a methodology that has a strong empirical base. Here, the speculative hypothesis was replaced by induction from premises obtained through observation and experiment.
Opposing views
It is noted that no law of science can be considered mere inductive generalization of facts because each law does not exist in isolation. This is for, instance, demonstrated by thinkers such as John Stuart Mill, who maintained that inductionism is the initial act in the formulation of a general law using the deductive approaches to science. There are thinkers who propose a model that is considered anti-inductionism. These include Karl Popper, who argued that science could progress without making any use of induction and that there is a fundamental asymmetry between induction and deduction.
See also
Inductive reasoning
References
Metatheory of science
Inductive reasoning |
https://en.wikipedia.org/wiki/Money%20Money%202020 | Money Money 2020 is the debut studio album by new wave band The Network (a Green Day side project). It was released on September 30, 2003, through Adeline Records. Members of Green Day have denied being involved in the Network, however, Mike Dirnt revealed that they had a hand in the album. It was the band's only release for seventeen years, upon which they returned in 2020 with a sequel album entitled Money Money 2020 Part II: We Told Ya So!
Background
The album came with a DVD that featured six music videos for songs on the album directed and produced by Roy Miles of AntiDivision. It was re-released by Reprise Records on November 9, 2004. This release did not include the DVD, but it did include two additional tracks, "Teenagers from Mars" and "Hammer of the Gods". The song "Roshambo" was featured in the video game NHL 2005, and "Teenagers from Mars" was featured in the video game Tony Hawk's American Wasteland. The album was later released on vinyl by Adeline Records in 2011 and 2015, but only featured the 12 tracks from the original release.
Track listing
Personnel
Fink – lead vocals, lead guitar, backing vocals, drums on "Hungry Hungry Models"
Van Gough – lead vocals, bass guitar, backing vocals
The Snoo – drums, lead vocals on "Hungry Hungry Models"
Z – keyboards, backing vocals, keytar on "Right Hand-A-Rama"
Captain Underpants – keytar, keyboards on "Right Hand-A-Rama"
Balducci – rhythm guitar
References
2003 debut albums
The Network albums
Adeline Records albums |
https://en.wikipedia.org/wiki/Negamax | Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game.
This algorithm relies on the fact that to simplify the implementation of the minimax algorithm. More precisely, the value of a position to player A in such a game is the negation of the value to player B. Thus, the player on move looks for a move that maximizes the negation of the value resulting from the move: this successor position must by definition have been valued by the opponent. The reasoning of the previous sentence works regardless of whether A or B is on move. This means that a single procedure can be used to value both positions. This is a coding simplification over minimax, which requires that A selects the move with the maximum-valued successor while B selects the move with the minimum-valued successor.
It should not be confused with negascout, an algorithm to compute the minimax or negamax value quickly by clever use of alpha–beta pruning discovered in the 1980s. Note that alpha–beta pruning is itself a way to compute the minimax or negamax value of a position quickly by avoiding the search of certain uninteresting positions.
Most adversarial search engines are coded using some form of negamax search.
Negamax base algorithm
NegaMax operates on the same game trees as those used with the minimax search algorithm. Each node and root node in the tree are game states (such as game board configuration) of a two player game. Transitions to child nodes represent moves available to a player who is about to play from a given node.
The negamax search objective is to find the node score value for the player who is playing at the root node. The pseudocode below shows the negamax base algorithm, with a configurable limit for the maximum search depth:
function negamax(node, depth, color) is
if depth = 0 or node is a terminal node then
return color × the heuristic value of node
value := −∞
for each child of node do
value := max(value, −negamax(child, depth − 1, −color))
return value
(* Initial call for Player A's root node *)
negamax(rootNode, depth, 1)
(* Initial call for Player B's root node *)
negamax(rootNode, depth, −1)
The root node inherits its score from one of its immediate child nodes. The child node that ultimately sets the root node's best score also represents the best move to play. Although the negamax function shown only returns the node's best score, practical negamax implementations will retain and return both best move and best score for the root node. Only the node's best score is essential with non-root nodes. And a node's best move isn't necessary to retain nor return for non-root nodes.
What can be confusing is how the heuristic value of the current node is calculated. In this implementation, this value is always calculated from the point of view of player A, whose color value is one. In other words, higher heuristic values always represent situations more favora |
https://en.wikipedia.org/wiki/Butt-Ugly%20Martians | Butt-Ugly Martians is a computer-animated television series co-produced by Mike Young Productions, Digital Content Development Corporation Limited and Just Entertainment. It was sold to ITV on October 2, 2000, for the original television pilot and premiered on CITV in the UK on February 19, 2001. In 2002, it also premiered on Nickelodeon in the United States, but also aired on Nicktoons until 2003.
The series is produced using Alias Wavefront Maya 3D software.
Premise
The plot of the series begins when the Butt-Ugly Martians (B.U.M.) are forced to invade planets for the evil Emperor Bog, but when they are sent to Earth they become addicted to American culture. Deciding not to hurt Earth, they simply pretend to be occupying the planet for Bog. They are shown around by their Earthling friends: Mike, Cedric, and Angela. The Butt-Ugly Martians continue to hang out on Earth as long as Emperor Bog never finds out.
Characters
Main
B-Bop A-Luna (voiced by Charlie Schlatter) – Commander B-Bop A-Luna is the diplomat and leader of the Butt-Ugly Martians. Brave, comedic, showy, and a little big headed (although increasingly less as the show went on), B-Bop can always be trusted to think up a good cover story and look convincing doing it. He's a natural leader, able to get even the most cowardly characters behind him even when he's not entirely sure what to do. Nevertheless, B-Bop can think on the fly and usually comes up with a plan that works. He also has a bit of a temper; 2T and Do-Wah are usually the two to calm him down. He is more tactile than the other two Martians. B-Bop is officially the commanding officer of 2T and Do-Wah in the Martian Fleet (he is occasionally addressed as "Commander" by the two). He wears a yellow uniform and a Yellow BKM suit. His age (along with 2T and Do-Wah's) is not revealed. It is assumed that the three are teenagers, although they refer to Mike, Cedric and Angela as kids.
2T Fru-T (voiced by Rob Paulsen) – 2T Fru-T is the mechanic (described on the BUM merchandise as a "tech officer", he is most likely a lieutenant as he is of lower status than B-Bop but higher than Do-Wah) for the Butt-Uglies and inventor of BKM. Sometimes B.Bop and Do-Wah can pick on 2T although they are his friends. A mechanical prodigy, 2T is the MacGyver of Martians and has been able to construct anything from invisibility rays to the BKM (Butt Kicking Mode) suits using parts that were immediately available. He often finds himself at the mercy of sub-standard parts sent to him by Dr. Damage, but these never slow him down for long. 2T is a bit socially inept, often forgetting Earth colloquialisms and fading into technical jargon when it is not necessary. He's also a bad liar under stress, although he can think of a good cover story whenever B-Bop is indisposed. He's usually calm, but has been known to snap at his friends whenever he feels betrayed (this may be insecurity; one episode has him stopping Muldoon in his usual slew of anti-alien insul |
https://en.wikipedia.org/wiki/Network-centric%20warfare | Network-centric warfare, also called network-centric operations or net-centric warfare, is a military doctrine or theory of war that aims to translate an information advantage, enabled partly by information technology, into a competitive advantage through the computer networking of dispersed forces. It was pioneered by the United States Department of Defense in the 1990s.
Background and history
In 1996, Admiral William Owens introduced the concept of a 'system of systems' in a paper published by the Institute for National Security Studies in the United States. He described a system of intelligence sensors, command and control systems, and precision weapons that provided situational awareness, rapid target assessment, and distributed weapon assignment.
Also in 1996, the United States' Joint Chiefs of Staff released Joint Vision 2010, which introduced the military concept of full-spectrum dominance. Full Spectrum Dominance described the ability of the US military to dominate the battlespace from peace operations through to the outright application of military power that stemmed from the advantages of information superiority.
Network Centric Warfare
The term "network-centric warfare" and associated concepts first appeared in the United States Department of Navy's publication, "Copernicus: C4ISR for the 21st Century." The ideas of networking sensors, commanders, and shooters to flatten the hierarchy, reduce the operational pause, enhance precision, and increase speed of command were captured in this document. As a distinct concept, however, network-centric warfare first appeared publicly in a 1998 US Naval Institute Proceedings article by Vice Admiral Arthur K. Cebrowski and John Garstka. However, the first complete articulation of the idea was contained in the book Network Centric Warfare : Developing and Leveraging Information Superiority by David S. Alberts, John Garstka and Frederick Stein, published by the Command and Control Research Program (CCRP). This book derived a new theory of warfare from a series of case studies on how business was using information and communication technologies to improve situation analysis, accurately control inventory and production, as well as monitor customer relations.
The information revolution has permeated the military world as well, with network-centric warfare replacing traditional combat methods. Technology is now at the forefront of battlefields, creating a new era of warfare - network-centric.
It's a new level of communication and coordination through what is known as tactical interoperability. From human soldiers to smart weapon systems, command & control systems, automatic sentry systems, and platforms on land, air, and space - all these elements are seamlessly connected in a single communication fabric, with encompass battle management systems for all services, catering to individuals from General HQs to soldiers on the field.
Understanding Information Age Warfare
Network-centric warfare was |
https://en.wikipedia.org/wiki/Martin%20Richards%20%28computer%20scientist%29 | Martin Richards (born 21 July 1940) is a British computer scientist known for his development of the BCPL programming language which is both part of early research into portable software, and the ancestor of the B programming language invented by Ken Thompson in early versions of Unix and which Dennis Ritchie in turn used as the basis of his widely used C programming language.
Education
Richards studied mathematics as an undergraduate student at the University of Cambridge and took the Cambridge Diploma in Computer Science. His PhD was on programming language design and implementation. He was a senior lecturer at the University of Cambridge Computer Laboratory until his retirement in 2007.
Research
In addition to BCPL Richards' work includes the development of the TRIPOS portable operating system.
He was awarded the IEEE Computer Society's Computer Pioneer Award in 2003 for "pioneering system software portability through the programming language BCPL".
Richards is a fellow of St John's College at the University of Cambridge.
References
Living people
Fellows of St John's College, Cambridge
History of computing in the United Kingdom
Members of the University of Cambridge Computer Laboratory
Programming language designers
Kernel programmers
1940 births |
https://en.wikipedia.org/wiki/Lisa%20the%20Vegetarian | "Lisa the Vegetarian" is the fifth episode of the seventh season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on October 15, 1995. In the episode, Lisa decides to stop eating meat after bonding with a lamb at a petting zoo. Her schoolmates and family members ridicule her for her beliefs, but with the help of Apu as well as Paul and Linda McCartney, she commits to vegetarianism.
Directed by Mark Kirkland, "Lisa the Vegetarian" is the first full-length episode David S. Cohen wrote for The Simpsons. David Mirkin, the showrunner at the time, supported the episode in part because he had just become a vegetarian himself. Former Beatle Paul McCartney and his wife Linda guest star in the episode; their condition for appearing was that Lisa would remain a vegetarian for the rest of the series. The episode makes several references to McCartney's musical career, and his song "Maybe I'm Amazed" plays during the closing credits.
In its original broadcast, "Lisa the Vegetarian" was watched by 14.6 million viewers and finished 47th in the ratings for the week of October 9–15, 1995, with a 9.0 Nielsen rating. It was the fourth highest-rated show on the Fox network that week.
The episode received universal acclaim from television critics and it has won two awards, an Environmental Media Award and a Genesis Award, for highlighting environmental and animal issues, respectively.
Plot
The Simpson family visits a petting zoo, where Lisa is enraptured by a cute lamb. That night, Marge serves lamb chops for dinner. Troubled by the connection between the dish and its living counterpart, Lisa announces that she is now a vegetarian. Bart and Homer mock her relentlessly for her newfound vegetarianism. Reaction at school is no better; when Lisa objects to dissecting a worm in class and requests a vegetarian alternative to the cafeteria food, Principal Skinner labels her an "agitator". After her second-grade class is forced to watch a Meat Council propaganda film starring Troy McClure that criticizes vegetarianism, Lisa's classmates tease and shun her.
Jealous of Ned Flanders' barbecue, Homer hosts his own, complete with roast pig. Lisa makes gazpacho as an alternative to meat, but Homer's guests ridicule her. After Homer inadvertently flips a burger into her room that lands on her face, Lisa is enraged. To stop the guests from eating the roast, she uses a riding mower to drive away with the pig in tow. Homer and Bart chase her, but she pushes the pig off a slope. It rolls into a river and is shot into the air by a dam spillway's suction.
At home, Homer is furious at Lisa for ruining his party, Lisa rebukes him for serving a meat-based dish. At breakfast the next day, Lisa runs away after Homer's choice of words causes Lisa to reach her breaking point, calling Homer a "prehistoric carnivore". Lisa eventually succumbs to the pressure to eat meat and bites into a hot dog from the roller grill at the K |
https://en.wikipedia.org/wiki/King-Size%20Homer | "King-Size Homer" is the seventh episode of the seventh season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on November 5, 1995. In the episode, Homer despises the nuclear plant's new exercise program and decides to attain a weight of so he can claim a disability and work from home.
The episode was written by Dan Greaney and directed by Jim Reardon. Joan Kenley makes her second of three guest appearances on The Simpsons in the episode as the voice of the telephone lady. It features cultural references to the world's heaviest twins, the 1993 film What's Eating Gilbert Grape, and the soft drink Tab.
Since airing, the episode has received positive reviews from fans and television critics, and Empire named it the best episode of the series. It acquired a Nielsen rating of 10.0 and was the third highest-rated show on the Fox network that week.
Plot
Mr. Burns organizes a compulsory morning calisthenics program at the nuclear power plant, to Homer's dismay. After learning that an employee who is disabled can work from home through worker's compensation, Homer unsuccessfully tries to injure himself. Upon learning that employees who weigh or more qualify as disabled, he begins eating excessively, despite Marge and Lisa's repeated warnings that he is endangering his health. With Bart and Dr Nick's help, Homer eventually increases his weight to and Mr. Burns installs a stay-at-home work terminal in the Simpson house. Marge admits that she finds herself less attracted to Homer because of his weight gain, but he vows to prove he can be a better worker because of it.
Homer soon tires of his monotonous responsibilities as a safety inspector and resorts to simply typing "yes" every time the system prompts him. Looking for shortcuts, he leaves his terminal with a drinking bird to press the Y key to indicate "yes" on the keyboard and goes to the cinema. After being denied admission due to his weight and getting teased by people outside the theater, Homer returns to his station to find that his bird has fallen over and a nuclear meltdown is imminent unless the system is manually shut down.
Unable to call the plant because his fingers are too fat to dial a telephone keypad, and too heavy to drive or skateboard, Homer resorts to hitchhiking. Drivers refuse to pick him up because his bright muumuu and excited jabbering make him seem like a lunatic. After hijacking an ice cream truck, Homer arrives at the power plant during a workout program and reaches the shutdown switch, which is situated over a tank of radioactive gas that is about to explode. He falls onto the hatch just as it bursts open and becomes stuck in it from the waist down, blocking the gas from escaping. In recognition of Homer's bravery and action to minimize the environmental damage caused by the gas release, Burns gives him a medal and offers him any reward he chooses. Homer asks Burns to help him lose weight, having seen |
https://en.wikipedia.org/wiki/Online%20school | An online school (virtual school, e-school, or cyber-school) teaches students entirely or primarily online or through the Internet. It has been defined as "education that uses one or more technologies to deliver instruction to students who are separated from the instructor and to support regular and substantive interaction between the students. Online education exists all around the world and is used for all levels of education (K-12 High school/secondary school, college, or graduate school). This type of learning enables the individuals to earn transferable credits, take recognized examinations, and advance to the next level of education over the Internet.
Virtual education is most commonly used in high school and college. 30-year-old students or older tend to study online programs at higher rates. This group represents 41% of the online education population, while 35.5% of students ages 24–29 and 24.5% of students ages 15–23 participate in virtual education.
Virtual education is becoming increasingly used worldwide. There are currently more than 4,700 colleges and universities that provide online courses to their students. In 2015, more than 6 million students were taking at least one course online, this number grew by 3.9% from the previous year. 29.7% of all higher education students are taking at least one distance course. The total number of students studying on a campus exclusively dropped by 931,317 people between the years 2012 and 2015. Experts say that because the number of students studying at the college level is growing, there will also be an increase in the number of students enrolled in distance learning.
Instructional models vary, ranging from distance learning types which provide study materials for independent self-paced study, to live, interactive classes where students communicate with a teacher in a class group lesson. Class sizes range widely from a small group of 6 pupils or students to hundreds in a virtual school.
The courses that are independent and self-paced are called asynchronous courses. Typically for this type of learning, the students are given the assignments and information and are expected to complete the assignments by the due date. This is done on their own time. There is no scheduled time when the class meets. Usually, the only interactions that take place are through discussion boards, blogs, and wikis.
On the other hand, synchronous online courses happen in real-time. The instructor and students all interact online at the same time. This is done either through text, video, or audio chat. Therefore, these lessons are socially constructed. In addition to the scheduled class time, there are usually additional assignments to complete. A key to keeping Kindergartners engaged in distance learning can be challenging. Individualizing lessons and giving mini breaks can help students stay engaged during short synchronous sessions. As an educator you have to find creative ways to keep children attention on the |
https://en.wikipedia.org/wiki/Computerized%20maintenance%20management%20system | A computerized maintenance management system (CMMS) is any software package that maintains a computer database of information about an organization's maintenance operations. This information is intended to help maintenance workers do their jobs more effectively (for example, determining which machines require maintenance and which storerooms contain the spare parts they need) and to help management make informed decisions (for example, calculating the cost of machine breakdown repair versus preventive maintenance for each machine, possibly leading to better allocation of resources).
CMMS data may also be used to verify regulatory compliance. To properly control the maintenance of a facility, information is required to analyze what is occurring. Manually, this requires a tremendous amount of effort and time. A CMMS also allows for record keeping, to track completed and assigned tasks in a timely and cost-effective manner.
See also
1:5:200
Building lifecycle management
Computer-aided facility management (CAFM)
Corrective maintenance
Enterprise asset management (EAM)
Facility management
Fixed assets register (FAR)
Inspection
Logistics management
Maintenance, repair and operations
Performance supervision system
Predictive maintenance
Preventive maintenance
References
Further reading
Business software
Information technology management
Management cybernetics
Maintenance |
https://en.wikipedia.org/wiki/S-LINK | S-LINK, for simple link interface, is a high-performance data acquisition standard developed at CERN for collecting information from particle accelerators and other sources. Unlike similar systems, S-LINK is based on the idea that data will be collected and stored by computers at both ends of the link, as opposed to a "dumb" devices collecting data to be stored on a "smart" computer. Having a full computer at both ends allows S-LINK to be very thin, primarily defining the logical standards used to feed data at high speed from the motherboards to the link hardware interfaces.
S-LINK started in 1995 in response to problems collecting data from the new ATLAS experiment at CERN. ATLAS was extensively instrumented with stand-alone computers, which sent data via a variety of methods to be collected on various servers. S-LINK was seen as a way to provide a single mechanism for forwarding the data from the collection to the link hardware with extremely low latency. Generally the S-LINK hardware provided functionality that would normally be provided by networking (or other) drivers running on the host CPU, thereby tying up cycles and introducing delays.
S-LINK used a 32-bit bus running up to 66 MHz, allowing for throughout up to 264 MB/s. The "link side" was typically connected to optical fibre for transmission to the collecting machines, known as the read-out motherboard, or ROMB. Data could also be sent back to the front-end motherboard or FEMB, typically for flow control purposes at a much lower speed.
References
External links
S-LINK
Particle experiments
Data |
https://en.wikipedia.org/wiki/Lenstra%E2%80%93Lenstra%E2%80%93Lov%C3%A1sz%20lattice%20basis%20reduction%20algorithm | The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis with n-dimensional integer coordinates, for a lattice L (a discrete subgroup of Rn) with , the LLL algorithm calculates an LLL-reduced (short, nearly orthogonal) lattice basis in time where is the largest length of under the Euclidean norm, that is, .
The original applications were to give polynomial-time algorithms for factorizing polynomials with rational coefficients, for finding simultaneous rational approximations to real numbers, and for solving the integer linear programming problem in fixed dimensions.
LLL reduction
The precise definition of LLL-reduced is as follows: Given a basis
define its Gram–Schmidt process orthogonal basis
and the Gram-Schmidt coefficients
for any .
Then the basis is LLL-reduced if there exists a parameter in such that the following holds:
(size-reduced) For . By definition, this property guarantees the length reduction of the ordered basis.
(Lovász condition) For k = 2,3,..,n .
Here, estimating the value of the parameter, we can conclude how well the basis is reduced. Greater values of lead to stronger reductions of the basis. Initially, A. Lenstra, H. Lenstra and L. Lovász demonstrated the LLL-reduction algorithm for . Note that although LLL-reduction is well-defined for , the polynomial-time complexity is guaranteed only for in .
The LLL algorithm computes LLL-reduced bases. There is no known efficient algorithm to compute a basis in which the basis vectors are as short as possible for lattices of dimensions greater than 4. However, an LLL-reduced basis is nearly as short as possible, in the sense that there are absolute bounds such that the first basis vector is no more than times as long as a shortest vector in the lattice,
the second basis vector is likewise within of the second successive minimum, and so on.
Applications
An early successful application of the LLL algorithm was its use by Andrew Odlyzko and Herman te Riele in disproving Mertens conjecture.
The LLL algorithm has found numerous other applications in MIMO detection algorithms and cryptanalysis of public-key encryption schemes: knapsack cryptosystems, RSA with particular settings, NTRUEncrypt, and so forth. The algorithm can be used to find integer solutions to many problems.
In particular, the LLL algorithm forms a core of one of the integer relation algorithms. For example, if it is believed that r=1.618034 is a (slightly rounded) root to an unknown quadratic equation with integer coefficients, one may apply LLL reduction to the lattice in spanned by and . The first vector in the reduced basis will be an integer linear combination of these three, thus necessarily of the form ; but such a vector is "short" only if a, b, c are small and is even smaller. Thus the first three entries of this short vector are likely to be |
https://en.wikipedia.org/wiki/Voter%20database | A voter database is a database containing information on voters for the purpose of assisting a political party or an individual politician, in their Get out the vote (GOTV) efforts and other areas of the campaign.
In most countries, the election agency makes the electoral roll available to all campaigns soon after the election campaign has begun. Campaigns can then merge this information with the other data they have collected on voters over the years to create their database. Often basic information such as phone numbers and postal codes are not included on the voters list, and the campaign will have to procure this data as well.
Uses
The voter database is central to many parts of a campaign:
Fundraising: The database can determine who should receive fundraising direct mail or telephone calls. These letters and calls can be tailored to reflect the issues and concerns of each potential donor. Past donor history, support for related advocacy groups, magazine subscriptions, and consumer behaviour can all be used to find likely donors and maximize the returns of any fundraising efforts.
Recruitment: As with fundraising, databases, especially those with detailed past election behaviour, are essential to recruiting volunteers and also finding locations for lawn signs.
Issue tracking: A campaign can track how certain issues are perceived across geographic and demographic lines and can show how to adjust the campaign's message for different audiences. By databasing all incoming telephone calls and e-mails as well as entering petitions and supporter lists from advocacy groups and NGOs (Non-Government Organizations) one can closely track how issues are followed by the electorate.
Get out the vote: One of the most important parts of a modern campaign is the campaign to ensure one's own supporters go to the polls on election day, and databases are central to this. A successful voter identification campaign requires connecting with a significant portion of the electorate and recording how they are going to vote in a database. On election day this information needs to be given out with accurate contact information for each voter so that they can be pulled to the polls.
Voter information
Personal data frequently included in a voter database:
Name
Physical address
Mailing address
Phone number
Party membership or affiliation
Voting history (including federal, sub-national, primary, municipal, or special election voting history)
Absentee or military voter designations
Source of voter registration, e.g. DMV/MVA, Public Assistance Office, etc.
Ethnicity or emerges race hypothesis
Gender
Birth date or age range
Data that may be added from commercial sources:
"Extreme voters" status (voters who vote very frequently)
Homeownership
Hunting or fishing license holders
Boat owners
Concealed Weapon Permit Holders
Occupation such as physical therapist, teacher, etc.
Charitable or political contributions
Magazine subscription status
Voter database |
https://en.wikipedia.org/wiki/Voter%20Vault | The Voter Vault is a database of voters in the United States used by the Republican Party. Construction started in the 1990s, and it was first used in 2002. By 2004 it had about 168 million entries. By around 2019 it had been renamed GOP Data Center.
The Democratic Party equivalent database is Demzilla.
See also
Cambridge Analytica
Catalist
Civis Analytics
Data dredging
Get out the vote
Herd behaviour
Right-wing politics
Predictive analytics
Psychographic
Timshel
References
External links
"GOP Voter Vault shipped overseas" from PC World, 2004
Time article on Demzilla and Voter Vault, 2004.
Political campaigns
Republican Party (United States)
Databases in the United States
Voter databases |
https://en.wikipedia.org/wiki/Cumulus%20Media%20Networks | Cumulus Media Networks was an American radio network owned and operated by Cumulus Media. From 2011 until its merger with Westwood One, it controlled many of the radio assets formerly belonging to the American Broadcasting Company (ABC), which was broken up in 2007; Cumulus owned the portion of the network that was purchased by Citadel Broadcasting that year.
The network adopted its final name in September 2011, following Cumulus's acquisition of Citadel; prior to this, it had been known as Citadel Media Networks since April 2009, after licensing the "ABC Radio Networks" name from The Walt Disney Company for nearly two years. ABC now operates ABC Audio which produces mostly short-form audio content for radio stations.
As ABC Radio Networks, it was the penultimate of the original major radio networks to still be owned by its original founding company, CBS Radio being the last. The Mutual Broadcasting System and the NBC Radio Network were both dissolved in 1999 after both were sold to the original Westwood One a decade earlier.
History
Cumulus Media Networks had its origins in an early network set up by WJZ (now WABC) in New York City which provided programs to other stations over Western Union lines.
NBC Blue Network
WJZ radio, originally owned by Westinghouse and its informal network were absorbed into the National Broadcasting Company in 1927. To the parent company Radio Corporation of America, WJZ and affiliates were known as the Blue Network while New York station WEAF and its affiliates (also absorbed into NBC) were known as the "Red Network." On the air, both were identified as "NBC, the National Broadcasting Company;" the distinctions between the two networks were, beyond staff and advertisers, mostly a matter of the more popular and established programming appearing on NBC Red.
Both NBC networks were owned by RCA; following a Federal Communications Commission investigation into the network's influence over advertising, strict ownership rules were introduced in 1941. RCA was compelled to sell one network and three local stations.
ABC Radio
RCA put an asking price of $8 million on the Blue network; after two years on the market, it was sold in 1943 to businessman Edward J. Noble, owner of Life Savers candy and the Rexall Drug store chain, for the asking price. After Noble took over, the network identified itself on-air as "The Blue Network." It was officially renamed the American Broadcasting Company, Inc. in June 1945 after the company bought the rights to the name from (what would later become) Storer Broadcasting.
With about 65 affiliates, ABC began with few of the big names and popular shows the other networks offered, so counter-programming became an ABC specialty. Industry policy had been to forbid taped or pre-recorded programs; ABC lured some big-name stars by adapting the tape technology developed in World War II. To add to its programming, ABC bought stations KECA (now KABC) in Los Angeles and WXYZ (now WXYT) in Detroit, |
https://en.wikipedia.org/wiki/BUNCH | The BUNCH was the nickname for the group of mainframe computer competitors of IBM in the 1970s. The name is derived from the names of the five companies: Burroughs, UNIVAC, NCR, Control Data Corporation (CDC), and Honeywell. These companies were grouped together because the market share of IBM was much higher than all of its competitors put together.
During the 1960s, IBM and these five computer manufacturers, along with RCA and General Electric, had been known as "IBM and the Seven Dwarfs". The description of IBM's competitors changed after GE's 1970 sale of its computer business to Honeywell and RCA's 1971 sale of its computer business to Sperry (who owned UNIVAC), leaving only five "dwarves". The companies' initials thus lent themselves to a new acronym, BUNCH. International Data Corporation estimated in 1984 that BUNCH would receive less than $2 billion of an estimated $11.4 billion in mainframe computer sales that year, with IBM receiving most of the remainder. IBM so dominated the mainframe market that observers expected the BUNCH to merge or exit the industry. BUNCH followed IBM into the microcomputer market with their own PC compatibles. but unlike that company did not quickly adjust to retail sales of smaller computers.
Digital Equipment Corporation (DEC), at one point the second largest in the industry, was joined to BUNCH as DeBUNCH.
Fate of BUNCH
Burroughs & UNIVAC In September 1986, after Burroughs purchased Sperry (the parent company of UNIVAC), the name of the company was changed to Unisys.
NCR In 1982, NCR became involved in open systems architecture, starting with the UNIX-powered TOWER 16/32, and placed more emphasis on computers smaller than mainframes. NCR was acquired by AT&T Corporation in 1991. A restructuring of AT&T in 1996 led to its re-establishment on 1 January 1997 as a separate company. In 1998, NCR sold its computer hardware manufacturing assets to Solectron and ceased to produce general-purpose computer systems.
Control Data Corporation Control Data Corporation is now Syntegra (USA), a subsidiary of British company BT Group's BT Global Services.
Honeywell In 1991, Honeywell's computer division was sold to French computer company Groupe Bull.
Other mainframe manufacturers during the 1960s and 1970s
Bendix Corporation introduced the G-15 in 1956 and the G-20 in 1961, with the G-21 shortly afterwards. Control Data Corporation purchased the Bendix computer division in 1963.
Philco sold military computers as well as the commercial TRANSAC S-1000 and TRANSAC S-2000; Ford Motor Company purchased Philco in December 1961.
Scientific Data Systems (later known as Xerox Data Systems after its purchase by Xerox in 1969) also sold mainframe computers, but with around 1% market share, it was not a major factor in the marketplace. Xerox closed the division in 1975, with most rights sold to Honeywell.
In 1976, Cray Research (a company supported by Seymour Cray's former employer Control Data Corporation), released the Cray-1 |
https://en.wikipedia.org/wiki/Passive%20optical%20network | A passive optical network (PON) is a fiber-optic telecommunications technology for delivering broadband network access to end-customers. Its architecture implements a point-to-multipoint topology in which a single optical fiber serves multiple endpoints by using unpowered (passive) fiber optic splitters to divide the fiber bandwidth among the endpoints. Passive optical networks are often referred to as the last mile between an Internet service provider (ISP) and its customers. Many fiber ISPs prefer this technology.
Components and characteristics
A passive optical network consists of an optical line terminal (OLT) at the service provider's central office (hub), passive (non-power-consuming) optical splitters, and a number of optical network units (ONUs) or optical network terminals (ONTs), which are near end users. A PON reduces the amount of fiber and central office equipment required compared with point-to-point architectures. A passive optical network is a form of fiber-optic access network.
In most cases, downstream signals are broadcast to all premises sharing multiple fibers. Encryption can prevent eavesdropping.
Upstream signals are combined using a multiple access protocol, usually time-division multiple access (TDMA).
History
Passive optical networks were first proposed by British Telecommunications in 1987.
Two major standard groups, the Institute of Electrical and Electronics Engineers (IEEE) and the Telecommunication Standardization Sector of the International Telecommunication Union (ITU-T), develop standards along with a number of other industry organizations.
The Society of Cable Telecommunications Engineers (SCTE) also specified radio frequency over glass for carrying signals over a passive optical network.
FSAN and ITU
Starting in 1995, work on fiber to the home architectures was done by the Full Service Access Network (FSAN) working group, formed by major telecommunications service providers and system vendors. The International Telecommunication Union (ITU) did further work, and standardized on two generations of PON. The older ITU-T G.983 standard was based on Asynchronous Transfer Mode (ATM), and has therefore been referred to as APON (ATM PON). Further improvements to the original APON standard – as well as the gradual falling out of favor of ATM as a protocol – led to the full, final version of ITU-T G.983 being referred to more often as broadband PON, or BPON. A typical APON/BPON provides 622 megabits per second (Mbit/s) (OC-12) of downstream bandwidth and 155 Mbit/s (OC-3) of upstream traffic, although the standard accommodates higher rates.
The ITU-T G.984 Gigabit-capable Passive Optical Networks (GPON, G-PON) standard represented an increase, compared to BPON, in both the total bandwidth and bandwidth efficiency through the use of larger, variable-length packets. Again, the standards permit several choices of bit rate, but the industry has converged on 2.488 gigabits per second (Gbit/s) of downstream bandwidth |
https://en.wikipedia.org/wiki/SULFNBK.EXE | SULFNBK.EXE (short for Setup Utility for Long File Name Backup) is an internal component of the Microsoft Windows operating system (in Windows 98 and Windows ME) for restoring long file names.
Email hoax
The component became famous in the early 2000s as the subject of an e-mail hoax. The hoax claimed that SULFNBK.EXE was a virus, and contained instructions to locate and delete the file. While the instructions worked, they were needless and (in some rare cases, for example, when the long file names are damaged and need to be restored) can cause disruptions, as SULFNBK.EXE is not a virus, but instead an operating system component.
Even people who didn't receive the e-mail were still perplexed if they found the file by themselves (because of its quickly hand-drawn icon), thinking that it could be a virus or trojan horse.
In Windows 98 and ME, where the file existed, SULFNBK.EXE can be found in Windows "COMMAND" directory (a directory that contains command line tools, usually ).
A very similar hoax happened with jdbgmgr.exe.
References
External links
Cara menghapus Aplikasi Di Laptop (Completely Uninstall the Program)
Symantec Security Response - SULFNBK.EXE Warning (Symantec)
SULFNBK Hoax virus profile (McAfee)
Sophos hoax description: SULFNBK (Sophos)
F-Secure Hoax Information Pages: Sulfnbk.exe virus hoax (F-Secure)
sulfnbk.exe virus (Vmyths.com)
SULFNBK.EXE: Should the Windows file SULFNBK.EXE be deleted because it masks a dormant virus? (Snopes.com)
Windows administration
Windows files
Virus hoaxes |
https://en.wikipedia.org/wiki/Oha%20Suta | Oha Suta () is the Japanese children's breakfast television show. Produced by Shogakukan-Shueisha Productions (ShoPro) for TV Tokyo, the show airs on TX Network (TXN). It premiered in 1997 as a relaunch of (. Sutajio is a loanword from English word "studio"), which originally ran from 2 April 1979 to 27 June 1986 on what is now TXN; the title of this revival, Oha Suta, comes from the portmanteau of the original Ohayō Studio.
Cast
Subaru Kimura
Ike Nwala
Yuki Sakurai (Maki Kota / Mighty Kou Z)
Ryogo Matsumaru (Prince Insparkle Matsumaru-kun)
Cyborg Warrior Iwai (Yuki Iwai)
Masuo
Taiiku Okazaki
Chocolate Planet (Shohei Osada & Shun Matsuo)
Miki (Asei & Kosei)
Sakura Inoue
Fire Tachibana (Naoto Ikeda)
Kaminari (Manabu Takeuchi & Takumi Ishida)
Yamamoto Bucho (Hiroshi Yamamoto)
Sunshine Ikezaki
Oha Girls
Oha Girl Apple (おはガールアップル, July 1998 - September 1998)
Oha Girl Banana (おはガールバナナ, October 1998 - March 1999)
Oha Girl Citrus (おはガールシトラス, April 1999 - March 2000)
Oha Girl Cherry (おはガールチェリー, April 1999 - March 2000)
Oha Girl Grape (おはガールグレープ, April 2001 - March 2002)
Oha Girl Fruitpunch (おはガールフルーツポンチ, April 2002 - March 2003)
Oha Girl Starfruit (おはガールスターフルーツ, April 2003 - March 2004)
Oha Girl Starfruit 2 (おはガールスターフルー2, April 2004 - March 2005)
Oha Girl Candy Mint (おはガールキャンディミント, April 2005 - March 2007)
Oha Girl 2007-2008 (おはガール, April 2007 - March 2008)
Oha Girl 2008-2009 (おはガール, April 2008 - March 2009)
Oha Girl 2009-2010 (おはガール, April 2009 - March 2010)
Oha Girl Maple (おはガールメープル, April 2010 - March 2012)
Oha Girl Chu! Chu! Chu! (おはガールちゅ！ちゅ！ちゅ！, April 2012 - March 2014)
Oha Girl 2016 - 2017 (おはガール, April 2016 - September 2017)
Oha Girl 2017 - 2019 (おはガール, October 2017 - September 2019)
Oha Girl from Girls² (おはガール from Girls², April 2019 – October 2021)
Oha Girl from Lucky² (おはガール from Lucky², October 2021 – March 2022)
Oha Girl 2022 (おはガール, April 2022 – Present)
External links
Japanese children's television series
1997 Japanese television series debuts
1990s Japanese television series
2000s Japanese television series
2010s Japanese television series
2020s Japanese television series
TV Tokyo original programming |
https://en.wikipedia.org/wiki/Far%20pointer | In a segmented architecture computer, a far pointer is a pointer which includes a segment selector, making it possible to point to addresses outside of the default segment.
Comparison and arithmetic on far pointers is problematic: there can be several different segment-offset address pairs pointing to one physical address.
In 16-bit x86
For example, in an Intel 8086, as well as in later processors running 16-bit code, a far pointer has two parts: a 16-bit segment value, and a 16-bit offset value. A linear address is obtained by shifting the binary segment value four times to the left, and then adding the offset value. Hence the effective address is 20 bits (actually 21-bit, which led to the address wraparound and the Gate A20). There can be up to 4096 different segment-offset address pairs pointing to one physical address. To compare two far pointers, they must first be converted (normalized) to their 20-bit linear representation.
On C compilers targeting the 8086 processor family, far pointers were declared using a non-standard "far" qualifier. For example, char far *p; defined a far pointer to a char. The difficulty of normalizing far pointers could be avoided with the non-standard "huge" qualifier.
Example of far pointer:
#include <stdio.h>
int main() {
char far *p =(char far *)0x55550005;
char far *q =(char far *)0x53332225;
*p = 80;
(*p)++;
printf("%d",*q);
return 0;
}
Output of the following program: 81; Because both addresses point to same location.
Physical Address = (value of segment register) * 0x10 + (value of offset).
Location pointed to by pointer 'p' is : 0x5555 * 0x10 + 0x0005 = 0x55555
Location pointed to by pointer 'q' is : 0x5333 * 0x10 + 0x2225 = 0x55555
So, p and q both point to the same location 0x55555.
References
Computer memory |
https://en.wikipedia.org/wiki/Embarrassingly%20parallel | In parallel computing, an embarrassingly parallel workload or problem (also called embarrassingly parallelizable, perfectly parallel, delightfully parallel or pleasingly parallel) is one where little or no effort is needed to separate the problem into a number of parallel tasks. This is often the case where there is little or no dependency or need for communication between those parallel tasks, or for results between them.
Thus, these are different from distributed computing problems that need communication between tasks, especially communication of intermediate results. They are easy to perform on server farms which lack the special infrastructure used in a true supercomputer cluster. They are thus well suited to large, Internet-based volunteer computing platforms such as BOINC, and do not suffer from parallel slowdown. The opposite of embarrassingly parallel problems are inherently serial problems, which cannot be parallelized at all.
A common example of an embarrassingly parallel problem is 3D video rendering handled by a graphics processing unit, where each frame (forward method) or pixel (ray tracing method) can be handled with no interdependency. Some forms of password cracking are another embarrassingly parallel task that is easily distributed on central processing units, CPU cores, or clusters.
Etymology
"Embarrassingly" is used here to refer to parallelization problems which are "embarrassingly easy". The term may imply embarrassment on the part of developers or compilers: "Because so many important problems remain unsolved mainly due to their intrinsic computational complexity, it would be embarrassing not to develop parallel implementations of polynomial homotopy continuation methods." The term is first found in the literature in a 1986 book on multiprocessors by MATLAB's creator Cleve Moler, who claims to have invented the term.
An alternative term, pleasingly parallel, has gained some use, perhaps to avoid the negative connotations of embarrassment in favor of a positive reflection on the parallelizability of the problems: "Of course, there is nothing embarrassing about these programs at all."
Examples
Some examples of embarrassingly parallel problems include:
Monte Carlo analysis
Distributed relational database queries using distributed set processing.
Numerical integration
Serving static files on a webserver to multiple users at once.
Bulk processing of unrelated files of similar nature in general, such as photo gallery resizing and conversion.
The Mandelbrot set, Perlin noise and similar images, where each point is calculated independently.
Rendering of computer graphics. In computer animation, each frame or pixel may be rendered independently (see parallel rendering).
Some brute-force searches in cryptography. Notable real-world examples include distributed.net and proof-of-work systems used in cryptocurrency.
BLAST searches in bioinformatics with split databases.
Large scale facial recognition systems that compare |
https://en.wikipedia.org/wiki/Cindy%20%28film%29 | Cindy is a 1978 American musical television movie, shot on videotape and first broadcast on the ABC television network, with an entirely African-American cast. Directed by William A. Graham, the film is an urbanized retelling of Cinderella.
Plot
After World War II, Cindy (Woodard) has moved from the south to live in Harlem with her newly blended family. She finds herself constantly abused by her stepmother and stepsisters. Her father (Mitchell) provides some comfort but cannot prevent the abuse entirely. One night, she meets Captain Joe Prince (Davis) and is swept off her feet. A romance soon ensues.
Cast
Charlayne Woodard as Cindy
Cleavant Derricks as Michael Simpson
Mae Mercer as Sara Hayes
Nell Carter as Olive
Alaina Reed Hall as Venus
Scoey Mitchell as Cindy's Father
Clifton Davis as Captain Joe Prince
W. Benson Terry as Miles Archer
Musical numbers
All songs are composed by Stan Daniels, unless otherwise noted.
"Jesus, Lover of My Soul" (Charles Wesley)—Cindy and Cast
"Sugar Hill Ball"—Olive, Venus, and Cindy
"Your Feet's Too Big" (Fred Fisher, Ada Benson)—Fats Waller
"Men's Room Attendant"—Cindy's Father and Male Chorus
"When It Happens"—Joe, Cindy, Olive, Venus, and Sara
"Love Is the Magic"—Cindy
Awards and nominations
See also
Rodgers & Hammerstein's Cinderella (1997), ABC's remake of the 1957 musical version of the fairy tale starring Brandy and Whitney Houston as Cinderella and her fairy godmother respectively
The Wiz (1978), a version of The Wizard of Oz with an all-Black cast
External links
Films based on Charles Perrault's Cinderella
Films based on Cinderella
1978 television films
1978 films
ABC network original films
Films directed by William Graham (director) |
https://en.wikipedia.org/wiki/Hot%20Wheels%3A%20AcceleRacers | Hot Wheels: AcceleRacers is a 2005 computer-animated series of four films produced by Canadian company Mainframe Entertainment, which also produced the television series ReBoot. Available on DVD and VHS, it has also been shown on Cartoon Network.
A sequel to the 2003 film Hot Wheels: World Race, the series takes place two years after the World Race in California and puts Mattel's Hot Wheels toy cars in a ReBoot-like situation. The films were distributed by Warner Bros. Television and Walt Disney Studios Motion Pictures and the soundtrack was distributed by Sony BMG. A collectible card game, which was shown in the DVD bonus, and other merchandise were also made.
The series aired on Cartoon Network in 2005-2006 Ignition (January 8), The Speed of Silence (March 19), Breaking Point (June 25) and The Ultimate Race (October 1).
Plot
Two years after the end of the World Race, Dr. Peter Tezla continues to study the information he gathered on the Wheel of Power while it was in his possession. However, he finds that Gelorum has returned fully repaired, now with her army of Racing Drones and is attempting to steal the Wheel of Power again. Tezla enters Highway 35 himself and attempts to stop Gelorum but fails and is greatly injured as the Drones capture the Wheel. He manages to escape back to Earth, and the Drones turn Hot Wheels City into their new headquarters.
Meanwhile, in present-day California, former World Race drivers Vert Wheeler, Kurt Wylde, Taro Kitano, and Mark Wylde have now become members of two street racing teams: the Teku and the Metal Maniacs. During a grudge race on the coastline, Dr. Tezla's robotic assistant Gig appears, telling the World Race drivers that Dr. Tezla needs their help. Arriving at Dr. Tezla’s old base from the World Race, with some of their new teammates, they find it partially destroyed. Former Dune Ratz driver Brian Kadeem appears and takes them to the AcceleDrome, Dr. Tezla's new base. After the drivers arrive, Dr. Tezla appears on a large hologram in the middle of the cavern and tells them what he has found: new Acceleron knowledge from the Wheel of Power's research. Now that the Wheel has been taken from its spire in Highway 35, the Drones have control over the dimension’s portals.
Each of the symbols on the Wheel represents one of the Racing Realms, inter-dimensional worlds that have tracks that go through a single element in the hardest way possible for driving conditions (there are only fifteen Realms in the series, twelve that were actually shown and three that the Drones had already completed before the beginning of the series, but only the AcceleChargers from those three are shown). The Drones have been entering the Realms, and each time a Realm is finished, the first driver to reach the end of the track obtains an AcceleCharger, which gives a car the ability to drive through any condition that relates to the realm that it was won in. Discovering that the Wheel hologram is always in sync with the actual Wh |
https://en.wikipedia.org/wiki/Zone%20bit%20recording | In computer storage, zone bit recording (ZBR) is a method used by disk drives to optimise the tracks for increased data capacity. It does this by placing more sectors per zone on outer tracks than on inner tracks. This contrasts with other approaches, such as constant angular velocity (CAV) -drives, where the number of sectors per track are the same.
On a disk consisting of roughly concentric tracks – whether realized as separate circular tracks or as a single spiral track – the physical track length (circumference) is increased as it gets farther from the centre hub.
The inner tracks are packed as densely as the particular drive's technology allows. The packing of the rest of the disks is changed depending on the type of disk. Zone recording was pioneered and patented by Chuck Peddle in 1961 while working for General Electric.
With a CAV-drive the data on the outer tracks are the same angular width of those in the centre, and so less densely packed. Using ZBR instead, the inner zoning is used to set the read/write rate, which is the same for other tracks. This permits the drive to have more bits stored in the outside tracks compared to the inner ones. Storing more bits per track equates to achieving a higher total data capacity on the same disk area.
However, ZBR influences other performance characteristics of the hard disk. In the outer most tracks, data will have the highest data transfer rate. Since both hard disks and floppy disks typically number their tracks beginning at the outer edge and continuing inward, and since operating systems typically fill the lowest-numbered tracks first, this is where the operating system typically stores its own files during its initial installation onto an empty drive. Testing disk drives when they are new or empty after defragmenting them with some benchmarking applications will often show their highest performance. After some time, when more data are stored in the inner tracks, the average data transfer rate will drop, because the transfer rate in the inner zones is slower; this, combined with the head's longer stroke and possible fragmentation, may give the impression of the disk drive slowing down over time.
Some other ZBR drives, such as the 800 kilobyte 3.5" floppy drives in the Apple IIGS and older Macintosh computers, don't change the data rate but rather spin the medium slower when reading or writing outer tracks, thus approximating the performance of constant linear velocity drives.
Products that use ZBR
Commodore 1541 floppy disk (combined ZBR, ZCAV and GCR for 17–21 sectors á 256 bytes in 4 writing speed zones)
Sirius 1/Victor 9000 floppy disk (combined ZBR, ZCLV and GCR for 11–19 sectors á 512 bytes in 9 rotation speed zones)
Apple Macintosh 400K/800K floppy disk (combined ZBR, ZCAV and GCR)
DVD-RAM
Most hard drives since the 1990s
See also
Zoned constant linear velocity (ZCLV)
Constant linear velocity (CLV)
References
Rotating disc computer storage media |
https://en.wikipedia.org/wiki/Seastalker | Seastalker is an interactive fiction game written by Stu Galley and Jim Lawrence and published by Infocom in 1984. It was released simultaneously for several popular computer platforms of the time, such as the Commodore 64, Apple II, and IBM PC compatibles (as a self-booting disk). The game was marketed as an introduction to interactive fiction for preteen players, having difficulty rating of "Junior." It was the only game to ever use this rating, which was replaced by the "Introductory" label given to games such as Wishbringer. It is Infocom's twelfth game.
Galley and Lawrence later wrote Moonmist for Infocom.
Plot
The player's character is a young inventor and marine scientist. A research facility called the Aquadome issues a call for help, indicating that the undersea structure is being attacked by a sea monster. With helpful assistant Tip, the player must navigate to the Aquadome in the new untested two-person submarine Scimitar and investigate the problem. But that isn't all... it looks like there may be a saboteur within the Aquadome as well.
The game has 30 locations.
Release
The package includes the following physical items:
A logbook for the Scimitar, including a letter from "The President" congratulating the player on acceptance into the Discovery Squad
Four double-sided "top secret Infocards", containing hints printed in blue ink beneath a pattern of red ink
A decoder featuring a small square of red plastic to reveal the hints on the Infocards
A nautical chart of Frobton Bay for navigation
A "Discovery Squad "badge" sticker
Reception
Computer Gaming World noted Seastalkers easiness, recommending it only as a beginner's text adventure, particularly for young kids. Exemplifying this are the numerous tips dropped by both in-game characters and the game itself, directing the player to the included Infocards. The review complained of minor inconsistencies like items that could not be interacted with until an in-game character told the player of its existence.
PC Magazine gave Seastalker 10.0 points out of 12. It also noted the game's relatively low difficulty level, praised the prose, and stated, "I enjoyed myself immensely".
References
External links
Seastalker package, documentation, and feelies
Seastalker at Infocom-if.org
1980s interactive fiction
1984 video games
Adventure games
Amiga games
Amstrad CPC games
Apple II games
Atari 8-bit family games
Atari ST games
Classic Mac OS games
Commodore 64 games
Infocom games
TI-99/4A games
Video games developed in the United States
Single-player video games |
https://en.wikipedia.org/wiki/ZX%20Microdrive | The ZX Microdrive is a magnetic-tape data storage system launched in July 1983 by Sinclair Research for its ZX Spectrum home computer. It was proposed as a faster-loading alternative to the cassette and cheaper than a floppy disk, but it suffered from poor reliability and lower speed.
Microdrives used tiny cartridges containing a endless loop of magnetic tape, which held a minimum of 85 KB and performed a complete circuit in approximately eight seconds.
The Microdrive technology was later also used in the Sinclair QL and ICL One Per Desk personal computers.
Development
It is claimed the Microdrive concept was originally suggested by Andrew Grillet at an interview with Sinclair Research in 1974. Grillet proposed "a version of the Learjet Stereo 8 system, modified to allow two 64k core images per track for roll-out roll-in swapping using the KUTS protocol". Grillet was offered a better-paying job at Xerox, and never worked for Sinclair Research. Development of the ZX Microdrive hardware by Sinclair engineers Jim Westwood, David Southward and Ben Cheese started in 1982.
Products
The Microdrive was comparatively cheap (£49.95 at launch) and technologically innovative but also rather limited. Connecting a ZX Microdrive to a ZX Spectrum required the ZX Interface 1 unit, costing £49.95, although this could be bought packaged with a Microdrive for £79.95. Later, in March 1985, the ZX Spectrum Expansion System was launched for £99.95. This consisted of Interface 1, a Microdrive, a blank cartridge and several cartridges containing Tasword Two (a word processor), Masterfile (a database), Quicksilva's Games Designer and Ant Attack games, and an introductory cartridge.
Technology
Microdrives used tiny ( including protective cover) cartridges containing a endless loop of magnetic tape, wide, driven at 76 cm/s (30 in/s); thus performing a complete circuit in approximately 8 seconds. The cartridges held a minimum of 85 KB when formatted on a ZX Microdrive (exact capacity depended on the number of "bad" sectors found and the precise speed of the Microdrive motor when formatting). The data retrieval rate was 15 KB/s, i.e., 120 kbit/s. It was possible to "expand" the capacity of a fresh microdrive cartridge by formatting it several times. This caused the tape to stretch slightly, increasing the length of the tape loop, so that more sectors can be marked out on it. This procedure was widely documented in the Sinclair community magazines of the 1980s.
A total of eight ZX Microdrive units could be connected to the Interface 1 by daisy chaining one drive to the next via an electrical connector block.
The system acquired a reputation for unreliability. The tapes stretched during use (giving them a short life span), eventually rendering the data stored unreadable. Also the "write protection" was software-based, thus a computer crash could erase the data on an entire tape in 8 seconds. The cartridges were relatively expensive (initially sold for £4.95 each, |
https://en.wikipedia.org/wiki/Might%20and%20Magic%20II%3A%20Gates%20to%20Another%20World | Might and Magic II: Gates to Another World (also known as Might and Magic Book Two: Gates to Another World) is a role-playing video game developed and published by New World Computing in 1988. It is the sequel to Might and Magic Book One: The Secret of the Inner Sanctum.
Gameplay
After the events of Might and Magic Book One: The Secret of the Inner Sanctum, the adventurers who helped Corak defeat Sheltem on VARN take the "Gates to Another World" located in VARN to the land of CRON (Central Research Observational Nacelle). The land of CRON is facing many problems brought on by the encroachment of Sheltem and the adventurers must travel through CRON, the four elemental planes and even through time to help Corak stop Sheltem from flinging CRON into its sun.
While in many ways Might and Magic II is an updated version of the original, the improved graphics help greatly with navigation, and the interface added several functions that facilitated gameplay, such as a "delay" selector which allowed for faster or slower response times, and a spinning cursor when input was required - all features lacking in Might and Magic Book One.
As with Might and Magic Book One, the player used up to six player-generated characters at a time, and a total of twenty-six characters could be created, who thereafter stayed at the various inns across CRON. To continue game continuity it was possible to "import" the characters developed from the first game. Additionally, Might and Magic II became the first game in the series to utilize "hirelings", predefined characters which could extend the party to eight active characters. Hirelings were controlled like regular characters but required payment each day; pay increased with level.
Other new features include two new character classes, an increased number of spells, the introduction of class "upgrade" quests and more than twice the number of mini-quests. Also added was "secondary skills" such as mountaineering (necessary for travelling mountainous regions) and linguist (raising the character's intelligence, and necessary for reading certain messages). Each character could have up to two secondary skills. The game introduced an automap feature to the series, activated by training a character in the cartographer skill.
Perhaps the most peculiar development in this game was the numeric scope. Character levels could reach 255 ((28)-1), at which point they could train without limit, provided they had enough gold. Hit points could be extended as high as 65535 ((216)-1) and magic points up to 9999. To nearly any item, a "+" bonus could be added via an enchantment. This "+" bonus increased the weapon's damage or attribute bonus, as in Dungeons & Dragons, but unlike D&D the ceiling on "+" bonuses was 63. Might and Magic II pitted the player's party against any one of 255 monsters varying from 1 hit point to 64000. Battles could consist of up to 255 opponents.
While Might and Magic II remained a battle-focused game, there were many |
https://en.wikipedia.org/wiki/Might%20and%20Magic%20IV%3A%20Clouds%20of%20Xeen | Might and Magic IV: Clouds of Xeen (originally released as Might and Magic: Clouds of Xeen) is the fourth installment in the Might and Magic series by New World Computing.
Plot
Might and Magic IV focuses on the events that occur after the adventurers of Might and Magic III set off to follow Sheltem after he escapes from Terra. Trouble is brewing in the land of Xeen. A mysterious villain by the name of Lord Xeen has imprisoned Crodo, overseer of Xeen, in a tower and is unleashing havoc across the land. A new band of adventurers must be formed to stop him and save the Clouds of Xeen.
Gameplay
Might and Magic IV uses a game engine based on that used by Might and Magic III: Isles of Terra, and the gameplay is almost identical. More emphasis is placed on cutscenes than in the earlier game, possibly due to the availability of larger hard drives.
This game and its successor, Might and Magic V: Darkside of Xeen can be combined to make one large game, World of Xeen. In-game, this is visualised as either game being a 'side' of a flat, rectangular planetoid. In the combined game, areas in both games become available that are impossible to access in the standalone games. Both game's endings can be achieved, after either of which gameplay continues. A third ending is available in the combined games only.
The game was available initially on floppy disc but was also released on CD. Might and Magic IV and V were some of the very first Western games to come out on CD, although Japanese studios had been using the CD-ROM medium since 1988. They were also the first games to come out where every character's dialogs are recorded on the CDs; the software plays the CD back at specific tracks, seeking to the proper second offset within the track.
Clouds of Xeen introduced several new features into the series. This included a notes section which kept track of important information such as quests, clues, passwords, and the coordinates of locations of note. It also had a difficulty setting where you could select Adventurer or Warrior, with the latter having more challenging enemies in combat, but no other gameplay differences. It also had a separate inventory for quest items which kept the player from accidentally discarding or selling critical items.
Reception
Computer Gaming World Scorpia stated in 1993 that "There isn't much plot to Clouds of Xeen ... The world is rather empty of everyday people", similar to previous games in the series. She criticized the ending for being too binary: "if you have the right item, Xeen is toast; if you don't have it, your party is toast ... makes the confrontation almost pointless". Scorpia nonetheless concluded that both "hard-core Might & Magic fans" and some others might enjoy the game. She later that year advised players to install and play Clouds and Might & Magic V: Darkside of Xeen together for "the most enjoyment". The game was reviewed in 1993 in Dragon #191 by Hartley, Patricia, and Kirk Lesser in "The Role of Comput |
https://en.wikipedia.org/wiki/Might%20and%20Magic%20VI%3A%20The%20Mandate%20of%20Heaven | Might and Magic VI: The Mandate of Heaven, commonly abbreviated to Might and Magic VI or simply MM6, is a role-playing video game developed by New World Computing and published by 3DO in 1998. It is the sixth installment in the Might and Magic series, the sequel to Might and Magic V: Darkside of Xeen and the first of the Might and Magic titles to take place on the same planet as Heroes of Might and Magic. It continues the storyline of Heroes of Might and Magic II, and takes place at the same time as Heroes of Might and Magic III in the series chronology. The game was compared favorably to its peers, role-playing video games such as The Elder Scrolls II: Daggerfall. Critics praised it for its non-linear, user-friendly premise, an interactive, detailed game world and a polished, bug-free initial release. A Limited Edition version of the game was also released, including a cloth map of Enroth, a strategy guide and the first five games of the series on CD-ROM. It was followed by three sequels, with Might and Magic VII: For Blood and Honor directly continuing the story arc.
Gameplay
In Might and Magic VI, the player takes control of four adventurers, each starting with low attributes, guiding them to be mighty heroes to save the fictional land of Enroth. Unlike the previous titles, The Mandate of Heaven moved away from grid-based maps and granted players fully explorable maps to roam over, including scalable mountains. Battles can be conducted either in real time or in a turn-based mode, allowing players to take time determining what enemies to attack or what spells to cast, although turn-based mode severely limits the player's movement. As in the rest of the series, all action is shown through the eyes of the party, in first person view, but the new engine allows full 360 degree turning as well as looking up and down. For gameplay and storyline reasons, along with the fact that it is based on a new platform, Might and Magic VI includes no character transfer system between its prequels or sequels, unlike earlier instalments.
Apart from the main quest line, there are a number of side and promotion quests available to take on, but although they are not abundant, most are detailed in their setup and planning. Because the game operates under a calendar schedule with a day and night system, the time of year affects the availability of several scheduled events, such as the Solstices and the presence of the Circus of the Sun.
Character creation and improvement
Uniquely for the series, Might and Magic VI is the first and only Might and Magic title to offer players no choice regarding race: all playable characters are human. Also, unlike previous versions of the Might and Magic series, the party size is limited to four characters (with two slots for NPCs), compared to the six character party sizes in previous games. Players then choose one of six class that are available in the game for use: Knight, Druid, Paladin, Cleric, Sorcerer and Archer. The class c |
https://en.wikipedia.org/wiki/Dodgson%20condensation | In mathematics, Dodgson condensation or method of contractants is a method of computing the determinants of square matrices. It is named for its inventor, Charles Lutwidge Dodgson (better known by his pseudonym, as Lewis Carroll, the popular author), who discovered it in 1866. The method in the case of an n × n matrix is to construct an (n − 1) × (n − 1) matrix, an (n − 2) × (n − 2), and so on, finishing with a 1 × 1 matrix, which has one entry, the determinant of the original matrix.
General method
This algorithm can be described in the following four steps:
Let A be the given n × n matrix. Arrange A so that no zeros occur in its interior. An explicit definition of interior would be all ai,j with . One can do this using any operation that one could normally perform without changing the value of the determinant, such as adding a multiple of one row to another.
Create an (n − 1) × (n − 1) matrix B, consisting of the determinants of every 2 × 2 submatrix of A. Explicitly, we write
Using this (n − 1) × (n − 1) matrix, perform step 2 to obtain an (n − 2) × (n − 2) matrix C. Divide each term in C by the corresponding term in the interior of A so .
Let A = B, and B = C. Repeat step 3 as necessary until the 1 × 1 matrix is found; its only entry is the determinant.
Examples
Without zeros
One wishes to find
All of the interior elements are non-zero, so there is no need to re-arrange the matrix.
We make a matrix of its 2 × 2 submatrices.
We then find another matrix of determinants:
We must then divide each element by the corresponding element of our original matrix. The interior of the original matrix is
, so after dividing we get
.
The process must be repeated to arrive at a 1 × 1 matrix.
Dividing by the interior of the 3 × 3 matrix, which is just −5, gives and −8 is indeed the determinant of the original matrix.
With zeros
Simply writing out the matrices:
Here we run into trouble. If we continue the process, we will eventually be dividing by 0. We can perform four row exchanges on the initial matrix to preserve the determinant and repeat the process, with most of the determinants precalculated:
Hence, we arrive at a determinant of 36.
Desnanot–Jacobi identity and proof of correctness of the condensation algorithm
The proof that the condensation method computes the determinant of the matrix if no divisions by zero are encountered is based on an identity known as the Desnanot–Jacobi identity (1841) or, more generally, the Sylvester determinant identity (1851).
Let be a square matrix, and for each , denote by the matrix that results from by deleting the -th row and the -th column. Similarly, for
, denote by the matrix that results from by deleting the -th and -th rows and the -th and -th columns.
Desnanot–Jacobi identity
Proof of the correctness of Dodgson condensation
Rewrite the identity as
Now note that by induction it follows that when applying the Dodgson condensation procedure to a square matrix of order , the matrix in the |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.