source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Pure%20Data | Pure Data (Pd) is a visual programming language developed by Miller Puckette in the 1990s for creating interactive computer music and multimedia works. While Puckette is the main author of the program, Pd is an open-source project with a large developer base working on new extensions. It is released under BSD-3-Clause. It runs on Linux, MacOS, iOS, Android and Windows. Ports exist for FreeBSD and IRIX.
Pd is very similar in scope and design to Puckette's original Max program, developed while he was at IRCAM, and is to some degree interoperable with Max/MSP, the commercial predecessor to the Max language. They may be collectively discussed as members of the Patcher family of languages.
With the addition of the Graphics Environment for Multimedia (GEM) external, and externals designed to work with it (like Pure Data Packet / PiDiP for Linux, ), framestein for Windows, GridFlow (as n-dimensional matrix processing, for Linux, , Windows), it is possible to create and manipulate video, OpenGL graphics, images, etc., in realtime with extensive possibilities for interactivity with audio, external sensors, etc.
Pd is natively designed to enable live collaboration across networks or the Internet, allowing musicians connected via LAN or even in disparate parts of the globe to create music together in real time. Pd uses FUDI as a networking protocol.
Similarities to Max
Pure Data and Max are both examples of dataflow programming languages. Dataflow languages model a program as a directed graph of the data flowing between operations. In Pure Data and Max, functions or "objects" are linked or "patched" together in a graphical environment which models the flow of the control and audio. Unlike the original version of Max, however, Pd was always designed to do control-rate and audio processing on the host central processing unit (CPU), rather than offloading the sound synthesis and signal processing to a digital signal processor (DSP) board (such as the Ariel ISPW which was used for Max/FTS). Pd code forms the basis of David Zicarelli's MSP extensions to the Max language to do software audio processing.
Like Max, Pd has a modular code base of externals or objects which are used as building blocks for programs written in the software. This makes the program arbitrarily extensible through a public API, and encourages developers to add their own control and audio routines in the C programming language, or with the help of other externals, in Python, Scheme, Lua, Tcl, and many others. However, Pd is also a programming language. Modular, reusable units of code written natively in Pd, called "patches" or "abstractions", are used as standalone programs and freely shared among the Pd user community, and no other programming skill is required to use Pd effectively.
Language features
Like Max, Pd is a dataflow programming language. As with most DSP software, there are two primary rates at which data is passed: sample (audio) rate, usually at 44,100 samples pe |
https://en.wikipedia.org/wiki/Register%20window | In computer engineering, register windows are a feature which dedicates registers to a subroutine by dynamically aliasing a subset of internal registers to fixed, programmer-visible registers. Register windows are implemented to improve the performance of a processor by reducing the number of stack operations required for function calls and returns. One of the most influential features of the Berkeley RISC design, they were later implemented in instruction set architectures such as AMD Am29000, Intel i960, Sun Microsystems SPARC, and Intel Itanium.
General Operation
Several sets of registers are provided for the different parts of the program. Registers are deliberately hidden from the programmer to force several subroutines to share processor resources.
Rendering the registers invisible can be implemented efficiently; the CPU recognizes the movement from one part of the program to another during a procedure call. It is accomplished by one of a small number of instructions (prologue) and ends with one of a similarly small set (epilogue). In the Berkeley design, these calls would cause a new set of registers to be "swapped in" at that point, or marked as "dead" (or "reusable") when the call ends.
Application in CPUs
In the Berkeley RISC design, only eight registers out of a total of 64 are visible to the programs. The complete set of registers are known as the register file, and any particular set of eight as a window. The file allows up to eight procedure calls to have their own register sets. As long as the program does not call down chains longer than eight calls deep, the registers never have to be spilled, i.e. saved out to main memory or cache which is a slow process compared to register access.
By comparison, the Sun Microsystems SPARC architecture provides simultaneous visibility into four sets of eight registers each. Three sets of eight registers each are "windowed". Eight registers (i0 through i7) form the input registers to the current procedure level. Eight registers (L0 through L7) are local to the current procedure level, and eight registers (o0 through o7) are the outputs from the current procedure level to the next level called. When a procedure is called, the register window shifts by sixteen registers, hiding the old input registers and old local registers and making the old output registers the new input registers.
The common registers (old output registers and new input registers) are used for parameter passing. Finally, eight registers (g0 through g7) are globally visible to all procedure levels.
The AMD 29000 improved the design by allowing the windows to be of variable size, which helps utilization in the common case where fewer than eight registers are needed for a call. It also separated the registers into a global set of 64, and an additional 128 for the windows. Similarly, the IA-64 (Itanium) architecture used variable-sized windows, with 32 global registers and 96 for the windows.
In the Infineon C166 architectu |
https://en.wikipedia.org/wiki/BiiN | BiiN Corporation was a company created out of a joint research project by Intel and Siemens to develop fault tolerant high-performance multi-processor computers build on custom microprocessor designs. BiiN was an outgrowth of the Intel iAPX 432 multiprocessor project, ancestor of iPSC and nCUBE.
The company was closed down in October 1989, and folded in April 1990, with no significant sales. The whole project was considered within Intel to have been so poorly managed that the company name was considered to be an acronym for Billions Invested In Nothing. However, several subset versions of the processor designed for the project were later offered commercially as versions of the Intel i960, which became popular as an embedded processor in the mid-1990s.
History
BiiN began in 1982 as Gemini, a research project equally funded by Intel and Siemens. The project's aim was to design and build a complete system for so-called "mission critical" computing, such as on-line transaction processing, industrial control applications (such as managing nuclear reactors), military applications intolerant of computer down-time, and national television services. The central themes of the R&D effort were to be transparent multiprocessing and file distribution, dynamically switchable fault tolerance, and a high level of security. Siemens provided the funding through its energy division UBE (Unternehmensbereich Energietechnik), who had an interest in fault tolerant computers for use in nuclear installations, while Intel provided the technology, and the whole project was organised with alternate layers of Siemens and Intel management and engineers. Siemens staff stemmed from its various divisions, not just UBE (where the project unit was called E85G).
The core development labs were located on an Intel site in Portland, OR, but there were also Siemens labs in Berlin, Germany, (Sietec Systemtechnik, Maxim Ehrlich's team creating the Gemini DBMS), Vienna, Austria, Princeton, New Jersey (United States) and also Nuremberg, Germany, involved in the development.
Since neither Siemens nor Intel could see how to market this new architecture if it were broken up, in 1985 the project became BiiN Partners, and in July 1988 was launched as a company wholly owned by Intel and Siemens. A second company wholly owned by Intel, called BiiN Federal Systems, was also created in order to avoid Foreign Ownership and Controlling Interest (FOCI) problems in selling to the US government. Intel owned all the silicon designs which were licensed to Siemens, while Siemens owned all the software and documentation and licensed them to Intel.
BiiN aimed their designs at the high-end fault tolerant market, competing with Tandem Computers and Stratus Computer, as opposed to the parallel processing market, where Sequent Computer Systems, Pyramid Technology, Alliant Computer Systems and others were operating. In order to compete here they had to make sure their first designs were as powerful as the |
https://en.wikipedia.org/wiki/Paillier%20cryptosystem | The Paillier cryptosystem, invented by and named after Pascal Paillier in 1999, is a probabilistic asymmetric algorithm for public key cryptography. The problem of computing n-th residue classes is believed to be computationally difficult. The decisional composite residuosity assumption is the intractability hypothesis upon which this cryptosystem is based.
The scheme is an additive homomorphic cryptosystem; this means that, given only the public key and the
encryption of and , one can compute the encryption of .
Algorithm
The scheme works as follows:
Key generation
Choose two large prime numbers and randomly and independently of each other such that . This property is assured if both primes are of equal length.
Compute and . lcm means Least Common Multiple.
Select random integer where
Ensure divides the order of by checking the existence of the following modular multiplicative inverse: ,
where function is defined as .
Note that the notation does not denote the modular multiplication of times the modular multiplicative inverse of but rather the quotient of divided by , i.e., the largest integer value to satisfy the relation .
The public (encryption) key is .
The private (decryption) key is
If using p,q of equivalent length, a simpler variant of the above key generation steps would be to set and , where .
The simpler variant is recommended for implementational purposes, because in the general form the calculation time of can be very high with sufficiently large primes p,q.
Encryption
Let be a message to be encrypted where
Select random where and . (Note: if you find a value that has , you can use this to calculate the private key: this is unlikely enough to ignore.)
Compute ciphertext as:
Decryption
Let be the ciphertext to decrypt, where
Compute the plaintext message as:
As the original paper points out, decryption is "essentially one exponentiation modulo ."
Homomorphic properties
A notable feature of the Paillier cryptosystem is its homomorphic properties along with its non-deterministic encryption (see Electronic voting in Applications for usage). As the encryption function is additively homomorphic, the following identities can be described:
Homomorphic addition of plaintexts
The product of two ciphertexts will decrypt to the sum of their corresponding plaintexts,
The product of a ciphertext with a plaintext raising will decrypt to the sum of the corresponding plaintexts,
Homomorphic multiplication of plaintexts
A ciphertext raised to the power of a plaintext will decrypt to the product of the two plaintexts,
More generally, a ciphertext raised to a constant k will decrypt to the product of the plaintext and the constant,
However, given the Paillier encryptions of two messages there is no known way to compute an encryption of the product of these messages without knowing the private key.
Background
Paillier cryptosystem exploits the fact that certain discrete logarithms can |
https://en.wikipedia.org/wiki/Kids%27%20WB | Kids' WB (stylized as Kids' WB!) was an American children's programming service and brand of The WB that aired on the network from September 9, 1995, to September 16, 2006. The block moved to The CW (a result of the merger of Time Warner's The WB and CBS Corporation's UPN), where it aired from September 23, 2006, to May 17, 2008. After the block was discontinued, its Saturday morning programming slot was sold to 4Kids Entertainment and replaced by its successor block, The CW4Kids (later renamed Toonzai).
An online network version of Kids' WB launched on April 28, 2008, but closed on May 17, 2015. The service allowed viewers to stream content, such as Looney Tunes, Hanna-Barbera, and DC Comics. The website operated in different "zones" based on programming type: Kids' WB, Kids' WB Jr. (for shows aimed at younger children), and DC HeroZone (for action-oriented animated series). It was also available on Fancast, where it featured Looney Tunes shorts and full episodes of television series such as Scooby-Doo, The Flintstones, and The Jetsons.
History
1995–1999: early years
Kids' WB launched in the United States on September 9, 1995, striving to compete against the dominance of Fox Kids at the time, and airing on Saturday mornings from 8:00 to 11:00 a.m. and Monday through Fridays from 4:00 p.m. to 5:00 p.m. The block was structured to air in all time zones, airing on a tape delay outside of the Eastern Time Zone to adjust the recommended airtime of the block to each zone. However, during its first five years, an exact timeslot was not announced on-air, leaving viewers to check their local WB station listings; since the programs had different airtimes depending on the local WB affiliate schedule in the market. On September 7, 1996, the Saturday block was extended by one hour, airing from 8:00 a.m. to 12:00 p.m. Eastern Time.
Although Kids' WB aired on almost all of The WB's affiliated stations (including those later affiliated with The WB 100+ Station Group), the network's Chicago affiliate WGN-TV – owned by The WB's co-parent, the Tribune Company – declined to carry the weekday and Saturday blocks. Instead, it opted to air its weekday and Saturday morning newscasts, (the first incarnation of the latter was canceled in 1998), another locally-produced programming (such as The Bozo Super Sunday Show) in the morning hours, and syndicated programming in the afternoons. Kids' WB programming instead aired on WCIU-TV. However, WGN's superstation feed carried the block from 1995 to 1999, making the network available to markets without a local affiliate. WGN-TV began clearing Kids' WB on its Chicago broadcast signal in 2004, taking over the local rights from WCIU-TV.
On September 1, 1997, a weekday morning block was added from 7:00 a.m. to 8:00 a.m. and the weekday afternoon block was extended by one hour, running from 3:00 p.m. to 5:00 p.m. However, WGN's superstation feed, as well as some WB affiliates, had to wait until the next day, as they preempted t |
https://en.wikipedia.org/wiki/CDMA2000 | CDMA2000 (also known as C2K or IMT Multi‑Carrier (IMT‑MC)) is a family of 3G mobile technology standards for sending voice, data, and signaling data between mobile phones and cell sites. It is developed by 3GPP2 as a backwards-compatible successor to second-generation cdmaOne (IS-95) set of standards and used especially in North America and South Korea.
CDMA2000 compares to UMTS, a competing set of 3G standards, which is developed by 3GPP and used in Europe, Japan, China, and Singapore.
The name CDMA2000 denotes a family of standards that represent the successive, evolutionary stages of the underlying technology. These are:
Voice: CDMA2000 1xRTT, 1X Advanced
Data: CDMA2000 1xEV-DO (Evolution-Data Optimized): Release 0, Revision A, Revision B, Ultra Mobile Broadband (UMB)
All are approved radio interfaces for the ITU's IMT-2000. In the United States, CDMA2000 is a registered trademark of the Telecommunications Industry Association (TIA-USA).
1X
CDMA2000 1X (IS-2000), also known as 1x and 1xRTT, is the core CDMA2000 wireless air interface standard. The designation "1x", meaning 1 times radio transmission technology, indicates the same radio frequency (RF) bandwidth as IS-95: a duplex pair of 1.25 MHz radio channels. 1xRTT almost doubles the capacity of IS-95 by adding 64 more traffic channels to the forward link, orthogonal to (in quadrature with) the original set of 64. The 1X standard supports packet data speeds of up to 153 kbit/s with real world data transmission averaging 80–100 kbit/s in most commercial applications. IMT-2000 also made changes to the data link layer for greater use of data services, including medium and link access control protocols and quality of service (QoS). The IS-95 data link layer only provided "best efforts delivery" for data and circuit switched channel for voice (i.e., a voice frame once every 20 ms).
1xEV-DO
CDMA2000 1xEV-DO (Evolution-Data Optimized), often abbreviated as EV-DO or EV, is a telecommunications standard for the wireless transmission of data through radio signals, typically for broadband Internet access. It uses multiplexing techniques including code-division multiple access (CDMA) as well as time-division multiple access to maximize both individual user's throughput and the overall system throughput. It is standardized (IS-856) by 3rd Generation Partnership Project 2 (3GPP2) as part of the CDMA2000 family of standards and has been adopted by many mobile phone service providers around the world – particularly those previously employing CDMA networks.
1X Advanced
1X Advanced (Rev.E) is the evolution of CDMA2000 1X. It provides up to four times the capacity and 70% more coverage compared to 1X.
Networks
The CDMA Development Group states that, as of April 2014, there are 314 operators in 118 countries offering CDMA2000 1X and/or 1xEV-DO service.
History
The intended 4G successor to CDMA2000 was UMB (Ultra Mobile Broadband); however, in November 2008, Qualcomm announced it was ending developmen |
https://en.wikipedia.org/wiki/Convergent%20Technologies%20Operating%20System | The Convergent Technologies Operating System, also known variously as CTOS, BTOS and STARSYS, is a discontinued modular, message-passing, multiprocess-based operating system.
Overview
CTOS had many innovative features for its time. System access was controlled with a user password and Volume or disk passwords. If one knew the password, for example, for a volume, one could access any file or directory on that volume (hard disk). Each volume and directory were referenced with delimiters to identify them, and could be followed with a file name, depending on the operation, i.e. {Network Node}[VolumeName]<DirectoryName>FileName.
It was possible to custom-link the operating system to add or delete features.
CTOS supported a transparent peer-to-peer network carried over serial RS-422 cables (daisy-chain topology) and in later versions carried over twisted pair (star topology) with RS-422 adapters using CTOS Cluster Hub-R12 designed by Paul Jackson Ph.D. of SumNet Pty Limited in Australia. Each workgroup (called a "cluster") was connected to a server (called a "master"). The workstations, normally diskless, were booted over the cluster network from the master, and could optionally be locally booted from attached hard drives.
The Inter-process communication (IPC) is primarily based on the "request" and "respond" messaging foundation that enhanced the Enterprise Application Integration among services for both internal and external environments. Thus CTOS was well known for the message-based Microkernel Architecture. Applications are added as services to the main server. Each client consumes the services via its own mailbox called "exchange" and well-published message formats. The communication works on "request codes" that are owned by the service. The operating system maintains the exchanges, message queues, scheduling, control, message passing, etc., while the service manages the messages at its own exchange using "wait", "check", and "respond" macros.
CTOS ran on Intel x86 computers, and could run concurrently with Windows NT on Unisys PC.
The system API was presented to both high-level languages and assembly language.
Programs
The assembler was very advanced, with a Lisp-like pattern-matching macro facility unmatched by almost any other assembler before or since. There was an always-resident debugger.
Most of the system programs were written in PL/M, an ALGOL-like language from Intel which compiled directly to object code without a runtime library.
The word processor was one of the first screen-oriented editors with many high-powered features, such as multiple views of the same file, cut/copy/paste, unlimited undo/redo, no typing lost after a crash or power failure, user-selectable fonts, and much more.
The spreadsheet allowed blocks of cells to be protected from editing or other user input. The BTOS version allowed scripts to be written that included opening the spreadsheet for user input, then automatically printing graphs based on the in |
https://en.wikipedia.org/wiki/STARSYS | Starsys as a term could refer to the following:
Convergent Technologies Operating System
Starsys Company - Merging with SpaceDev |
https://en.wikipedia.org/wiki/Convergent%20Technologies | Convergent Technologies, Inc., was an American computer company formed by a small group of people who left Intel Corporation and Xerox PARC in 1979. Among the founders were CEO Allen Michels, VP Engineering Bob Garrow, head of marketing Kal Hubler, and operating system architect Ben Wegbreit. Convergent was primarily an OEM vendor with their computers resold by other manufacturers such as ADP, AT&T, Burroughs, Four-Phase Systems, Gould, Mohawk, Monroe Data Systems, NCR, and Prime. The company was purchased by Unisys in 1988.
History
The Distributed Systems division was responsible for the IWS, AWS, and NGEN.
In 1982, Convergent formed the Data Systems division to focus on a multi-processor computer known as the MegaFrame, "the first system upgradable from super-minicomputer to mainframe". The division was headed by Ben Wegbreit and also responsible for the MiniFrame. Steve Blank, in charge of division marketing, went on to found several Silicon Valley startups, including E.piphany, and lectures on technology startups at Stanford University and elsewhere; Jon Huie was in charge of Software; Richard Lowenthal was in charge of Hardware.
Convergent also formed the Advanced Information Products division, with Matt Sanders taking lead of the new division. He was tasked with developing a computer for the low-end market (price target $499). The "Ultra" team was assembled and their pioneering mobile computing product, the WorkSlate, released in November 1983.
The Special Projects division was responsible for the AT&T products.
Former Hewlett-Packard executive Paul C. Ely Jr. took over as CEO in January 1985.
Michels, Sanders, Wegbreit, and another executive left in October 1985 to form The Dana Group. Shortly after, Convergent purchased 40% of Baron Data Systems for $14.6 million. Then purchased the remainder of Baron in May 1987, for $33 million.
Convergent reached an agreement to acquire 3Com in March 1986, but the merger was called off at the last moment.
Unisys bought Convergent Technologies in 1988, after which Convergent Technologies became Unisys Network Computing Group (NCG).
Products
IWS
Introduced in 1980, Convergent's first product was the IWS (Integrated Workstation) based on a 5 MHz Intel 8086 microprocessor, with optional Intel 8087 math coprocessor. The WS-110 integrated the processor, memory I/O, and video display control boards along with two Multibus slots into a unique "lectern" situated next to the monitor and integrated into a common base. The WS-120 placed these boards along with five Multibus slots in a floor-standing enclosure. Floor-standing mass storage units would also be integrated into a system. The video hardware supported "soft fonts" allowing the character set to be changed in RAM rather than a fixed character set in ROM.
Burroughs sold the IWS as the B22, NCR sold it as the WorkSaver 100, and Savin released the Information Station 2000.
AWS
Introduced in November 1981, the next product was a cost-reduced des |
https://en.wikipedia.org/wiki/SAIL%20%28programming%20language%29 | SAIL, the Stanford Artificial Intelligence Language, was developed by Dan Swinehart and Bob Sproull of the Stanford AI Lab. It was originally a large ALGOL 60-like language for the PDP-10 and DECSYSTEM-20. The language combined the earlier PDP-6/-10 language GOGOL compiler, essentially an integer-only version of ALGOL, with the associative store from the LEAP language. The first release was in November 1969 and it saw continued development into the 1980s, including a commercial derivative, MAINSAIL.
SAIL's main feature is a symbolic data system based upon an associative store based on LEAP by Jerry Feldman and Paul Rovner. Items may be stored as unordered sets or as associations (triples). Other features include processes, procedure variables, events and interrupts, contexts, backtracking and record garbage collection. It also has block-structured macros, a coroutining facility and some new data types intended for building search trees and association lists.
History
The GOGOL compiler was originally written by Bill McKeeman on the PDP-1. It was essentially an integer-only version of ALGOL-60 with a number of additions to provide direct access to the memory and other hardware to allow it to be used as a systems programming language. It reduced arrays to a single dimension, removed any ability to perform dynamic memory allocations, but did add some additional string functionality. A greatly updated version by John Sauter, GOGOL II, was written as part of a port of the underlying operating system from ODIN to THOR. When the Stanford AI Lab received their PDP-6, Sauter, Pettit and (mostly) Dan Swinehart wrote GOGOL III for the new machine.
Swinehart, joined by Robert Sproull, merged the GOGOL syntax with additions from the contemporary versions of the LEAP language language to produce the first version of SAIL in November 1969. The main feature of LEAP as a language was its use of associative storage, more commonly known today as a Map or Dictionary. In LEAP, one could set the value of a field in a type using a triple, with the first entry being the variable name, the second being the field name, and the third the value.
Further improvements were added by Russell Taylor, Jim Low and Hana Samet, who added processes, procedure variables, interrupts, context, matching procedures, a new macro system, and other features. Development then passed to Taylor, John Reiser and Robert Smith, who added a debugger, a system-level print statement, records, and performed the conversion from Standord's own SUAI to TENEX. It was later ported to DEC's TOPS-10 as well, while the original TENEX version worked without modification under TOPS-20.
Description
Like many ALGOL systems, and the later Pascal, the basic structure of SAIL is based on the block, which is denoted by the code between the keywords and . Within a block there is further structure, with the declarations of local variables at the top, if any, and the code, or statements, following. In contrast t |
https://en.wikipedia.org/wiki/Adam%20Powell%20%28game%20designer%29 | Adam James Powell (born 20 December 1976) is a Welsh computer programmer, game designer and businessman. He is the co-founder of Neopets and Meteor Games.
Career
Powell attended the University of Nottingham from 1995 to 1998 studying for a computer science degree. During his time at Nottingham, Powell created Dark Heart released in 1996, a popular MUD based on the DikuMUD code.
In 1997, Powell started Shout! Advertising, a UK-based advertising company which operated the third largest click-through program on the Internet by mid-1999. He also co-founded Netmagic, a successful business which designed and sold online banner advertising. Then in July 1999, he founded Powlex, which focused on web page design.
Neopets
Powell first had the idea of Neopets in 1997, while studying at the University of Nottingham.
He and Donna Powell (formerly Donna Williams) started programming the site in September 1999, and launched the site two months later on 15 November 1999. Powell programmed the entire site, and created most of the original activities and games.
In April 2000, Powell negotiated a significant investment in Neopets.com and transferred the company from the UK to Los Angeles, US. After the relocation, Powell remained on staff as creative director and technical lead. Under Powell's management, Neopets went from its initial launch to over 140 million accounts and 5 billion pageviews per month. On 20 June 2005, Viacom bought Neopets, Inc. for US$160 million.
Powell continued to work for Neopets.com until June 2007, aiding the transition following the purchase and continuing to develop high-end concepts for the site.
Powell has creative design and writing credits on a wide variety of Neopets products including SCEA's 2006 PlayStation Portable release Neopets: Petpet Adventures: The Wand of Wishing, Wizards of the Coast September 2003 release the Neopets Trading Card Game and Sony Computer Entertainment America Inc's 2005 release Neopets: The Darkest Faerie, for the PlayStation 2.
Meteor Games
In 2007, Adam and Donna Powell founded Meteor Games, an independent online gaming studio committed to developing immersive and innovative games spanning the web, social networks, and mobile devices. As of February 2011 Meteor Games hadn't raised any venture capital and was profitable
Meteor Games' first project was Twin Skies, a 3D MMO that blended casual gaming and social networking elements with traditional massively multiplayer online role-playing games. Meteor Games released their first web-based game Vikings, Pirates and Ninjas in March 2009. The game was free to play on the web and Facebook.
In the company's shift to the rapidly growing social gaming market it released several games based on internal intellectual property including: Island Paradise which became a large commercial success, Serf Wars, and Ranch Town.
Meteor Games was headquartered in Los Angeles and had 100 employees.
Late in December 2011, Meteor Games laid off 90% of its staff, shu |
https://en.wikipedia.org/wiki/ArsDigita | ArsDigita, LLC, was a web development company founded in Cambridge, Massachusetts in 1997. The company produced a popular open source toolkit, the ArsDigita Community System (ACS), for building database-backed community websites, and flourished at the peak of the dot-com bubble. ACS was also the roots of OpenACS, which added PostgreSQL as a database option and gave the system a fully open-source stack.
History
Foundation
ArsDigita was founded by Philip Greenspun, Tracy Adams, Ben Adida, Eve Andersson, Olin Shivers, Aurelius Prochazka, and Jin Choi. Recruitment for the company was touted heavily by Greenspun, and ArsDigita became notorious among the "elite geeks" as a place where recruiting could result in significant payoffs. During the spring of 1999, for example, recruiting 5 hires would earn the employee a Honda S2000. Recruiting 10 employees would net a Ferrari F355. A trophy F355 in bright yellow was kept parked outside of the Prospect Street office in Cambridge to entice employees into recruiting. Later in the summer of 1999, as new management was brought on board, the policy was quietly changed to a lease of the cars, not outright ownership.
ArsDigita Foundation and ArsDigita University
The founders set up a nonprofit organization, the ArsDigita Foundation, which sponsored the ArsDigita Prize, a programming contest for high-school students held in 1999, 2000, and 2001.
In 2000, a free intensive one-year post-baccalaureate program in computer science was announced, called ArsDigita University. It was based on the undergraduate course of study at the Massachusetts Institute of Technology (MIT) and financed and supported by the ArsDigita Foundation. The majority of the instructors were professors from MIT and the program was tuition free.
Potential recruits were required to submit solutions to a handful of problem sets used in an Internet application development course at MIT. Some of these problem sets required the use of the Oracle object-relational database management system behind Web pages. Others were basic computer science problems such as computing a Fibonacci series recursively using the Tcl programming language.
After running from September 2000 through July 2001, seeing the first class to graduation, the dissolution of the ArsDigita Foundation forced the program to shut down. Most of the course lectures were videotaped. The tapes and other course materials are available free under the Open Content License from aduni.org, a website maintained by the alumni of the university. That site exists to carry on the school's mission of supplying free education, and streams ~150GB/month of lectures to thousands of people around the world. A 4-DVD set containing the videos and course materials (problem sets, exams, solution sets, and course notes) is also available for a fee. The tapes were made available on Google Video in 2008 allowing easier and more flexible access.
Former instructor Holly Yanco became a University of Massa |
https://en.wikipedia.org/wiki/Stale%20pointer%20bug | A stale pointer bug, otherwise known as an aliasing bug, is a class of subtle programming errors that can arise in code that does dynamic memory allocation, especially via the malloc function or equivalent.
If several pointers address (are "aliases for") a given chunk of storage, it may happen that the storage is freed or reallocated (and thus moved) through one alias and then referenced through another, which may lead to subtle (and possibly intermittent) errors depending on the state and the allocation history of the malloc arena. This bug can be avoided by never creating aliases for allocated memory, by controlling the dynamic scope of references to the storage so that none can remain when it is freed, or by use of a garbage collector, in the form of an intelligent memory-allocation library or as provided by higher-level languages, such as Lisp.
The term "aliasing bug" is nowadays associated with C programming, but it was already in use in a very similar sense in the ALGOL 60 and Fortran programming language communities in the 1960s.
See also
Dangling pointer
Software bugs
Software_anomalies |
https://en.wikipedia.org/wiki/IRCnet | IRCnet is currently the third largest IRC network with around 25,000 users using it daily. An early 2005 record had approximately 123,110 users simultaneously connected to the network.
History
Initially, most IRC servers formed a single IRC network, to which new servers could join without restriction, but this was soon abused by people who set up servers to sabotage other users, channels, or servers. In August 1990, the server eris.berkeley.edu remained the only one to allow anyone to connect to the servers.
A group of IRC server operators, with the support of Jarkko Oikarinen, introduced a new "Q-line" into their server configurations, to "quarantine" themselves away from eris by disconnecting from any subset of the IRC network as soon as they saw eris there.
For a few days, the entire IRC network suffered frequent netsplits, but eventually the majority of servers added the Q-line and effectively created a new separate IRC net called EFnet (Eris-Free Network); the remaining servers who stayed connected to eris (and thus were no longer able to connect to EFnet servers) were called A-net (Anarchy Network). A-net soon vanished, leaving EFnet as the only IRC network.
Continuing problems with performance and abuse eventually led to the rise of another major IRC network, Undernet, which split off in October 1992.
Between May and July 1996 IRCnet was formed as a European fork of EFnet, when a number of operator disagreements resulted in a group of European admins declaring their independence. The reasons for the "Great Split" as it came to be called, included:
a policy disagreement about how much power system operators should have. IRCnet formed with the basis that there should be a set of rules defining what SysOps could and could not do. This viewpoint was opposed by many of the US-based EFnet servers.
a technical disagreement on whether the network should use timestamping (TS) or Nick Delay as a means to prevent nick collisions, according to Jarkko Oikarinen.
Vegard Engen, one of the European operators, stated that the immediate cause for the "Great Split" was that a major US EFnet hub had been disconnecting irc.stealth.net without warning, and thereby breaking the link to the European servers.
Characteristics
Many IRCnet servers state that "IRC is a privilege, not a right". That defines the characteristics of network usage ‒ users are normally not permitted to run bots and should avoid abusive behaviour.
Servers are generally open to users from their geographic location and do not allow outside connections, however, there are few open exceptions allowing access to users not covered by any local server.
Strict rules are operated for shell providers regulating, limiting or banning their connections.
IRCnet operates few if any network services to service nicknames or channels. It does implement reop -channelmode that allows channel operators to set hostmasks for users to be automatically "reopped" by the server. This mode is called +R wi |
https://en.wikipedia.org/wiki/X-Win32 | In computing, X-Win32 is a proprietary implementation of the X Window System for Microsoft Windows, produced by StarNet Communications. It is based on X11R7.4.
X- Win32 allows remote display of UNIX windows on Windows machines in a normal window alongside the other Windows applications
Version History
X-Win32 was first introduced by StarNet Communications as a product called MicroX in 1991. As the internet became more widely used in the 1990s the name changed to X-Win32. The table below details the origination and transformation of MicroX into X-Win32.
A limited set of versions and their release notes are available from the product's website.
Features
Standard connection protocols - X-Win32 offers six standard connection protocols: ssh, telnet, rexec, rlogin, rsh, and XDMCP
Window modes - Like other X servers for Microsoft Windows, X-Win32 has two window modes, Single and Multiple. Single window mode contains all X windows with one large visible root window. Multiple window mode allows the Microsoft Window Manager to manage the X client windows
Copy and paste - X-Win32 incorporates a clipboard manager which allows for dynamic copying and pasting of text from X clients to Windows applications and vice versa. A screen-shot tool saves to a PNG file.
OpenGL support - X-Win32 uses the GLX extension which allows for OpenGL Support
Related products
X-Win32 Flash is a version of X-Win32 that can be installed and run directly from a USB Flash Drive
Discontinued products
X-Win64 was a version for 64-bit Windows, but the extended features in that version can now be found in the current version of X-Win32.
X-Win32 LX was a free commercially supported X Server for Microsoft Windows which supported Microsoft Windows Services for UNIX (SFU).
Recon-X was an add-on product for all X server products, including X-Win32 competitors such as Exceed and Reflection X, which added suspend and resume capabilities to running X sessions. Features of Recon-X were incorporated into the LIVE product line
LinuxLIVE is a LIVE client for Linux systems
MacLIVE is a LIVE client for Mac OS X systems
LIVE Console is a LIVE client installed with the LIVE server which allows localhost LIVE connections to be made
See also
Cygwin/X - A free alternative
Exceed - A commercial alternative
Reflection X - A commercial alternative
Xming - Donations or purchase required
References
External links
X-Win32 (product home page)
X servers |
https://en.wikipedia.org/wiki/Akamai%20Technologies | Akamai Technologies, Inc. is an American content delivery network (CDN), cybersecurity, and cloud service company, providing web and Internet security services. The company operates a network of servers worldwide and rents the capacity of the servers to customers wanting to increase the efficiency of their websites by using Akamai owned servers located near the user. When a user navigates to the URL of an Akamai customer, their browser is directed by Akamai's domain name system to a proximal edge server that can serve the requested content. Akamai's mapping system assigns each user to a proximal edge server using sophisticated algorithms such as stable matching and consistent hashing, enabling more reliable and faster web downloads. Further, Akamai implements DDoS mitigation and other security services in its edge server platform.
History
The company was named after akamai, which means 'clever,' or more colloquially, 'cool' in Hawaiian, which Lewin had discovered in a Hawaiian-English dictionary after the suggestion of a colleague.
Akamai Technologies entered the 1998 MIT $50K competition with a business proposition based on their research on consistent hashing, and were selected as one of the finalists. By August 1998, they had developed a working prototype, and with the help of Jonathan Seelig and Randall Kaplan, they began taking steps to incorporate the company. Akamai Technologies was incorporated on August 20, 1998.
In late 1998 and early 1999, a group of business professionals and scientists joined the founding team. Most notably, Paul Sagan, former president of New Media for Time Inc., and George Conrades, former chairman and chief executive officer of BBN Corp. and senior vice president of US operations for IBM. Conrades became the chief executive officer of Akamai in April 1999. The company launched its commercial service in April 1999 and was listed on the NASDAQ Stock Market from October 29, 1999.
On July 1, 2001, Akamai was added to the Russell 3000 Index and Russell 2000 Index.
On September 11, 2001, co-founder Daniel M. Lewin died in the September 11 attacks at the age of 31 when he was stabbed by one of the hijackers. He was seated closest to the hijackers and attempted to foil the hijacking during his flight aboard American Airlines Flight 11, the first plane to crash into the World Trade Center.
In 2005, Paul Sagan was named chief executive officer of Akamai, taking over from Conrades. Sagan worked to differentiate Akamai from its competitors by expanding the company's breadth of services. Under his leadership, the company grew to $1.37 billion in revenue.
In July 2007, Akamai was added to the S&P 500 Index.
In 2013, co-founder Tom Leighton was elected to the position of chief executive officer, replacing Sagan.
On February 9, 2021, Akamai announced it would reorganize into two internal groups: Security Technology and Edge Technology. The company also re-established the role of chief technology officer, and named Ro |
https://en.wikipedia.org/wiki/Nokia%206620 | The 6620 is a smartphone created by Nokia, announced in 2005, running on Series 60 2nd Edition and the Symbian operating system. It was the first EDGE-capable phone for the Americas' market.
It is a version of Nokia's 6600 smartphone for the North American market, with all the features of the 6600 such as the VGA camera, MultiMediaCard slot, Bluetooth and color screen, but with a change to the North American GSM frequencies, newer version of Nokia Series 60 v2 with Feature Pack 1 (the original 6600 had common Series 60 v2 without Feature Packs), the doubling of internal RAM, the addition of Nokia's new Pop-Port connector, the inclusion of stereo sound, and a new EDGE capability, effectively giving it double the download speeds of contemporary General Packet Radio Service (GPRS)-equipped phones. Although not officially designed as a successor, it replaced the Nokia 3620 in the Cingular Wireless (now AT&T Mobility) lineup shortly after their acquisition of AT&T Wireless Services.
This phone usually came packaged with a charger, battery, 32-megabyte MMC card and USB cable.
Features
65,000 color screen
VGA camera for pictures and video
GSM voice communication (850 MHz, 1800 MHz and 1900 MHz)
GPRS and EDGE data communication
Bluetooth, infrared and USB connectivity
Support for SMS, MMS and email messages
Multiple mailboxes for remote email downloads
Web browsing for WAP and HTTP websites
12 megabytes internal memory
MMC expansion slot supporting up to 2 gigabytes
Hands-free speakerphone
Multiple ringtones included with space for more
Usual software including calendar, calculator, wallet, messaging, voice recorder, phone book, gallery, notes
Symbian and Java support for applications and games
Instant Messaging (IM) support
RealPlayer included for audio and video playback
Full MP3 support, including saved playlists
Stereo audio playback using Nokia stereo headphones or Nokia AD-15 3.5mm stereo headphone adapter (the 6600 is mono-only)
Digital downloads
The EDGE capability allows the 6620 to play streaming video, so that users may view video clips that are not stored on the phone itself. The phone also supports downloading smart messages from the network, if supported by the network operator, to update settings.
Technical specifications
The main CPU in this phone is an ARM925t-compatible chip running at 150 MHz while the 6600 only runs at 104 MHz. The camera supports resolutions up to 640x480 and has a 2x digital zoom. It can record video for up to 10 minutes. The RealPlayer software can play back video and audio, and also files in MP3 and AVI format. The talk time is listed at 4 hours, with 200 hours of standby.
See also
Nokia 6600
Nokia 6670
References
External links
Device Details Forum Nokia
Using the Nokia 6620 as a Bluetooth modem
Nokia smartphones
Symbian devices
Mobile phones with infrared transmitter |
https://en.wikipedia.org/wiki/NTRUEncrypt | The NTRUEncrypt public key cryptosystem, also known as the NTRU encryption algorithm, is an NTRU lattice-based alternative to RSA and elliptic curve cryptography (ECC) and is based on the shortest vector problem in a lattice (which is not known to be breakable using quantum computers).
It relies on the presumed difficulty of factoring certain polynomials in a truncated polynomial ring into a quotient of two polynomials having very small coefficients. Breaking the cryptosystem is strongly related, though not equivalent, to the algorithmic problem of lattice reduction in certain lattices. Careful choice of parameters is necessary to thwart some published attacks.
Since both encryption and decryption use only simple polynomial multiplication, these operations are very fast compared to other asymmetric encryption schemes, such as RSA, ElGamal and elliptic curve cryptography. However, NTRUEncrypt has not yet undergone a comparable amount of cryptographic analysis in deployed form.
A related algorithm is the NTRUSign digital signature algorithm.
Specifically, NTRU operations are based on objects in a truncated polynomial ring with convolution multiplication and all polynomials in the ring have integer coefficients and degree at most N-1:
That in this ring has the effect that multiplying a polynomial by rotates the coefficients of the polynomial. A map of the form for a fixed thus produces a new polynomial where every coefficient depends on as many coefficients from as there are nonzero coefficients in .
NTRU has three integer parameters (N, p, q), where N is the polynomial degree bound, p is called the small modulus, and q is called the large modulus; it is assumed that N is prime, q is always (much) larger than p, and p and q are coprime. Plaintext messages are polynomials modulo p but ciphertext messages are polynomials modulo q. Concretely the ciphertext consists of the plaintext message plus a randomly chosen multiple of the public key, but the public key may itself be regarded as a multiple of the small modulus p, which allows the holder of the private key to extract the plaintext from the ciphertext.
History
The NTRUEncrypt Public Key Cryptosystem is a relatively new cryptosystem.
The first version of the system, which was simply called NTRU, was developed around 1996 by three mathematicians (Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman). In 1996 these mathematicians together with Daniel Lieman founded the NTRU Cryptosystems, Inc. and were given a patent (now expired) on the cryptosystem.
During the last ten years people have been working on improving the cryptosystem. Since the first presentation of the cryptosystem, some changes were made to improve both the performance of the system and its security. Most performance improvements were focused on speeding up the process. Up till 2005 literature can be found that describes the decryption failures of the NTRUEncrypt. As for security, since the first version of the NTRU |
https://en.wikipedia.org/wiki/Mobile%20network%20operator | A mobile network operator, also known as a wireless service provider, wireless carrier, cellular company, or mobile network carrier, is a provider of wireless communications services that owns or controls all the elements necessary to sell and deliver services to an end user, including radio spectrum allocation, wireless network infrastructure, back haul infrastructure, billing, customer care, provisioning computer systems, and marketing and repair organizations.
Operator
In addition to obtaining revenue by offering retail services under its own brand, a mobile network operator may also sell access to network services at wholesale rates to mobile virtual network operators.
A key defining characteristic of a mobile network operator is that a mobile network operator must own or control access to a radio spectrum license from a regulatory or government entity. A second key defining characteristic of a mobile network operator is that it must own or control the elements of the network infrastructure necessary to provide services to subscribers over the licensed spectrum.
A mobile network operator typically also has the necessary provisioning, billing, and customer care computer systems and the marketing, customer care, and engineering organizations needed to sell, deliver, and bill for services. However, a mobile network operator can outsource any of these systems or functions and still be considered a mobile network operator.
List of operators
See also
List of telephone operating companies
Mobile phone operator
Mobile virtual network operator
Telephone company
References
Mobile technology
Mobile phone industry |
https://en.wikipedia.org/wiki/NTRU | NTRU is an open-source public-key cryptosystem that uses lattice-based cryptography to encrypt and decrypt data. It consists of two algorithms: NTRUEncrypt, which is used for encryption, and NTRUSign, which is used for digital signatures. Unlike other popular public-key cryptosystems, it is resistant to attacks using Shor's algorithm. NTRUEncrypt was patented, but it was placed in the public domain in 2017. NTRUSign is patented, but it can be used by software under the GPL.
History
The first version of the system, which was called NTRU, was developed in 1996 by mathematicians Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman. That same year, the developers of NTRU joined with Daniel Lieman and founded the company NTRU Cryptosystems, Inc., and were given a patent on the cryptosystem. The name "NTRU", chosen for the company and soon applied to the system as well, was originally derived from the pun Number Theorists 'R' Us or, alternatively, stood for Number Theory Research Unit. In 2009, the company was acquired by Security Innovation, a software security corporation. In 2013, Damien Stehle and Ron Steinfeld created a provably secure version of NTRU, which is being studied by a post-quantum crypto group chartered by the European Commission.
In May 2016, Daniel Bernstein, Chitchanok Chuengsatiansup, Tanja Lange and Christine van Vredendaal released NTRU Prime, which adds defenses against potential attack to NTRU by eliminating algebraic structure they considered worrisome. However, after more than 20 years of scrutiny, no concrete approach to attack the original NTRU exploiting its algebraic structure has been found so far.
NTRU became a finalist in the 3rd round of the Post-Quantum Cryptography Standardization project, whereas NTRU Prime became an alternate candidate.
Performance
At equivalent cryptographic strength, NTRU performs costly private-key operations much faster than RSA does. The time of performing an RSA private operation increases as the cube of the key size, whereas that of an NTRU operation increases quadratically.
In 2010, the Department of Electrical Engineering, University of Leuven, noted that "[using] a modern GTX280 GPU, a throughput of up to encryptions per second can be reached at a security level of 256 bits. Comparing this to a symmetric cipher (not a very common comparison), this is only around 20 times slower than a recent AES implementation."
Resistance to quantum-computer-based attacks
Unlike RSA and elliptic-curve cryptography, NTRU is not known to be vulnerable to attacks on quantum computers. The National Institute of Standards and Technology wrote in a 2009 survey that "[there] are viable alternatives for both public key encryption and signatures that are not vulnerable to Shor's Algorithm" and that "[of] the various lattice based cryptographic schemes that have been developed, the NTRU family of cryptographic algorithms appears to be the most practical". The European Union's PQCRYPTO project (Horiz |
https://en.wikipedia.org/wiki/Lum%20and%20Abner | Lum and Abner was an American network radio comedy program created by Chester Lauck and Norris Goff that was aired from 1931 to 1954. Modeled on life in the small town of Waters, Arkansas, near where Lauck and Goff grew up, the show proved immensely popular. In 1936, Waters changed its name to "Pine Ridge" after the show's fictional town.
Synopsis
The series was created by co-stars Chester Lauck (who played Columbus "Lum" Edwards) and Norris Goff (Abner Peabody). Lum always pronounced his own name as Ed'erds and was very annoyed if Abner or anyone brought up his full first name. The two characters performed as a double act, with Lum generally playing the straight man to Abner's attempts to break free from Lum's influence. As co-owners of the Jot 'em Down Store in the fictional town of Pine Ridge, Arkansas, the pair are constantly stumbling upon moneymaking ideas only to find themselves fleeced by nemesis Squire Skimp, before finally finding a way to redeem themselves. Lum and Abner played the hillbilly theme with deceptive cleverness.
In addition to the title characters, Lauck also played Grandpappy Spears and Cedric Weehunt while Goff played Abner, Squire Skimp, Llewelyn "Mousey" Grey, Dick Huddleston, and most of the other characters.
Lum and Abner, like most sitcoms of the era, had a live house band, in this case a string band in keeping with the show's hillbilly humor. Marshall Jones, before his adoption of the "Grandpa" persona that made him famous years later, was among the band's first members.
Show history
Lauck and Goff had known each other since childhood and attended the University of Arkansas together where they both joined the Sigma Chi fraternity. They performed locally and established a blackface act which led to an audition at radio station KTHS in Hot Springs, Arkansas. Prior to the audition, the two men decided to change their act and portray two hillbillies, due to the large number of blackface acts already in existence. After only a few shows in Hot Springs, they were picked up nationally by NBC, and Lum and Abner, sponsored by Quaker Oats, ran until 1932. Lauck and Goff performed several different characters, modeling many of them on the real-life residents of Waters, Arkansas.
When the Quaker contract expired, Lauck and Goff continued to broadcast on two Texas stations, WBAP (Fort Worth) and WFAA (Dallas). In 1933, The Ford Dealers of America became their sponsor for approximately a year. Horlicks Malted Milk, the 1934–37 sponsor, offered a number of promotional items, including almanacs and fictional Pine Ridge newspapers. During this period, the show was broadcast on Chicago's WGN (AM), one of the founding members of the Mutual Broadcasting System. Effective July 1, 1935, the program was also carried on WLW (Cincinnati, Ohio), KNX (Los Angeles, California), and KFRC (San Francisco, California). Along with The Lone Ranger, Lum and Abner was one of Mutual's most popular programs. In 1936, Dick Huddleston of Waters pet |
https://en.wikipedia.org/wiki/Timing%20attack | In cryptography, a timing attack is a side-channel attack in which the attacker attempts to compromise a cryptosystem by analyzing the time taken to execute cryptographic algorithms. Every logical operation in a computer takes time to execute, and the time can differ based on the input; with precise measurements of the time for each operation, an attacker can work backwards to the input. Finding secrets through timing information may be significantly easier than using cryptanalysis of known plaintext, ciphertext pairs. Sometimes timing information is combined with cryptanalysis to increase the rate of information leakage.
Information can leak from a system through measurement of the time it takes to respond to certain queries. How much this information can help an attacker depends on many variables: cryptographic system design, the CPU running the system, the algorithms used, assorted implementation details, timing attack countermeasures, the accuracy of the timing measurements, etc. Timing attacks can be applied to any algorithm that has data-dependent timing variation. Removing timing-dependencies is difficult in some algorithms that use low-level operations that frequently exhibit varied execution time.
Timing attacks are often overlooked in the design phase because they are so dependent on the implementation and can be introduced unintentionally with compiler optimizations. Avoidance of timing attacks involves design of constant-time functions and careful testing of the final executable code.
Avoidance
Many cryptographic algorithms can be implemented (or masked by a proxy) in a way that reduces or eliminates data-dependent timing information, a constant-time algorithm. Consider an implementation in which every call to a subroutine always returns in exactly x seconds, where x is the maximum time it ever takes to execute that routine on every possible authorized input. In such an implementation, the timing of the algorithm is less likely to leak information about the data supplied to that invocation. The downside of this approach is that the time used for all executions becomes that of the worst-case performance of the function.
The data-dependency of timing may stem from one of the following:
Non-local memory access, as the CPU may cache the data. Software run on a CPU with a data cache will exhibit data-dependent timing variations as a result of memory looks into the cache.
Conditional jumps. Modern CPUs try to speculatively execute past jumps by guessing. Guessing wrong (not uncommon with essentially random secret data) entails a measurable large delay as the CPU tries to backtrack. This requires writing branch-free code.
Some "complicated" mathematical operations, depending on the actual CPU hardware:
Integer division is almost always non-constant time. The CPU uses a microcode loop that uses a different code path when either the divisor or the dividend is small.
CPUs without a barrel shifter runs shifts and rotations in a loop, o |
https://en.wikipedia.org/wiki/Leased%20line | A leased line is a private telecommunications circuit between two or more locations provided according to a commercial contract. It is sometimes also known as a private circuit, and as a data line in the UK. Typically, leased lines are used by businesses to connect geographically distant offices.
Unlike traditional telephone lines in the public switched telephone network (PSTN) leased lines are generally not switched circuits, and therefore do not have an associated telephone number. Each side of the line is permanently connected, always active and dedicated to the other. Leased lines can be used for telephone, Internet, or other data communication services. Some are ringdown services, and some connect to a private branch exchange (PBX) or network router.
The primary factors affecting the recurring lease fees are the distance between end stations and the bandwidth of the circuit. Since the connection does not carry third-party communications, the carrier can assure a specified level of quality.
An Internet leased line is a premium Internet connectivity product, normally delivered over fiber, which provides uncontended, symmetrical bandwidth with full-duplex traffic. It is also known as an Ethernet leased line, dedicated line, data circuit or private line.
History
Leased line services (or private line services) became digital in the 1970s with the conversion of the Bell backbone network from analog to digital circuits. This allowed AT&T to offer Dataphone Digital Services (later re-branded digital data services) that started the deployment of ISDN and T1 lines to customer premises to connect.
Leased lines were used to connect mainframe computers with terminals and remote sites, via IBM's Systems Network Architecture (created in 1974) or DEC's DECnet (created in 1975).
With the extension of digital services in the 1980s, leased lines were used to connect customer premises to Frame Relay or ATM networks. Access data rates increased from the original T1 option with maximum transmission speed of 1.544 Mbit/s up to T3 circuits.
In the 1990s, with the advances of the Internet, leased lines were also used to connect customer premises to ISP point of presence whilst the following decade saw a convergence of the aforementioned services (frame relay, ATM, Internet for businesses) with the MPLS integrated offerings.
Access data rates also evolved dramatically to speeds of up to 10Gbit/s in the early 21st century with the Internet boom and increased offering in long-haul optical networks or metropolitan area networks.
Applications
Leased lines are used to build up private networks, private telephone networks (by interconnecting PBXs) or access the internet or a partner network (extranet).
Here is a review of the leased-line applications in network designs over time:
Site to site data connectivity
Terminating a leased line with two routers can extend network capabilities across sites. Leased lines were first used in the 1970s by enterprise with pro |
https://en.wikipedia.org/wiki/Not%20a%20typewriter | In computing, "Not a typewriter" or ENOTTY is an error code defined in the errno.h found on many Unix systems. This code is now used to indicate that an invalid ioctl (input/output control) number was specified in an ioctl system call.
Details
This error originated in early UNIX. In Version 6 UNIX and earlier, I/O control was limited to serial-connected terminal devices, typically a teletype (abbreviated TTY), through the gtty and stty system calls. If an attempt was made to use these calls on a non-terminal device, the error generated was ENOTTY. When the stty/gtty system calls were replaced with the more general ioctl (I/O control) call, the ENOTTY error code was retained.
Early computers and Unix systems used electromechanical typewriters as terminals. The abbreviation TTY, which occurs widely in modern UNIX systems, stands for "Teletypewriter." For example, the original meaning of the SIGHUP signal is that it Hangs UP the phone line on the teletypewriter which uses it. The generic term "typewriter" was probably used because "Teletype" was a registered trademark of AT&T subsidiary Teletype Corporation and was too specific. The name "Teletype" was derived from the more general term, "teletypewriter"; using "typewriter" was a different contraction of the same original term.
POSIX sidesteps this issue by describing ENOTTY as meaning "not a terminal".
Because ioctl is now supported on other devices than terminals, some systems display a different message such as "Inappropriate ioctl for device" instead.
Occurrence
In some cases, this message will occur even when no ioctl has been issued by the program. This is due to the way the isatty() library routine works. The error code errno is only set when a system call fails. One of the first system calls made by the C standard I/O library is in an isatty() call used to determine if the program is being run interactively by a human (in which case isatty() will succeed and the library will write its output a line at a time so the user sees a regular flow of text) or as part of a pipeline (in which case it writes a block at a time for efficiency). If a library routine fails for some reason unrelated to a system call (for example, because a user name wasn't found in the password file) and a naïve programmer blindly calls the normal error reporting routine perror() on every failure, the leftover ENOTTY will result in an utterly inappropriate "Not a typewriter" (or "Not a teletype", or "Inappropriate ioctl for device") being delivered to the user.
For many years the UNIX mail program sendmail contained this bug: when mail was delivered from another system, the mail program was being run non-interactively. If the destination address was local, but referred to a user name not found in the local password file, the message sent back to the originator of the email was the announcement that the person they were attempting to communicate with was not a typewriter.
See also
lp0 on fire
References
Extern |
https://en.wikipedia.org/wiki/RCN | RCN may refer to:
Radio Cadena Nacional (disambiguation), a broadcast network in Colombia
RCN Radio
RCN TV
RCN Corporation (formerly Residential Communications Network), a cable television, telephone, and Internet service provider in the United States
Radiowe Centrum Nadawcze, Polish designation for a broadcasting transmitter
Reality Check Network, a software based warez magazine that existed from 1995 to 1997
UWC Red Cross Nordic, a United World College in Norway
Reformed Church of Newtown, a church in Queens, NY
Republic of Cinnabar Navy, the setting of the RCN Series of science fiction novels by David Drake
Royal Canadian Navy
Royal College of Nursing, a professional membership organisation of the United Kingdom
Rundstrecken Challenge Nürburgring is a motorsport event series mainly on the Nürburgring
American River Airpark, IATA airport code "RCN" |
https://en.wikipedia.org/wiki/Zeroisation | In cryptography, zeroisation (also spelled zeroization) is the practice of erasing sensitive parameters (electronically stored data, cryptographic keys, and critical security parameters) from a cryptographic module to prevent their disclosure if the equipment is captured. This is generally accomplished by altering or deleting the contents to prevent recovery of the data.
Mechanical
When encryption was performed by mechanical devices, this would often mean changing all the machine's settings to some fixed, meaningless value, such as zero. On machines with letter settings rather than numerals, the letter 'O' was often used instead. Some machines had a button or lever for performing this process in a single step. Zeroisation would typically be performed at the end of an encryption session to prevent accidental disclosure of the keys, or immediately when there was a risk of capture by an adversary.
Software
In modern software based cryptographic modules, zeroisation is made considerably more complex by issues such as virtual memory, compiler optimisations and use of flash memory. Also, zeroisation may need to be applied not only to the key, but also to a plaintext and some intermediate values. A cryptographic software developer must have an intimate understanding of memory management in a machine, and be prepared to zeroise data whenever a sensitive device might move outside the security boundary. Typically this will involve overwriting the data with zeroes, but in the case of some types of non-volatile storage the process is much more complex; see data remanence.
As well as zeroising data due to memory management, software designers consider performing zeroisation:
When an application changes mode (e.g. to a test mode) or user;
When a computer process changes privileges;
On termination (including abnormal termination);
On any error condition which may indicate instability or tampering;
Upon user request;
Immediately, the last time the parameter is required; and
Possibly if a parameter has not been required for some time.
Informally, software developers may also use zeroise to mean any overwriting of sensitive data, not necessarily of a cryptographic nature.
Tamper resistant hardware
In tamper resistant hardware, automatic zeroisation may be initiated when tampering is detected. Such hardware may be rated for cold zeroisation, the ability to zeroise itself without its normal power supply enabled.
Standards
Standards for zeroisation are specified in ANSI X9.17 and FIPS 140-2.
References
Key management |
https://en.wikipedia.org/wiki/Beep%20%28sound%29 | A beep is a short, single tone, typically high-pitched, generally made by a computer or other machine. The term has its origin in onomatopoeia. The word "beep-beep" is recorded for the noise of a car horn in 1929, and the modern usage of "beep" for a high-pitched tone is attributed to Arthur C. Clarke in 1951.
Use in computers
In some computer terminals, the ASCII character code 7, bell character, outputs an audible beep. The beep is also sometimes used to notify the user when the BIOS is not working or there is some other error during the start up process, often during the power-on self-test (POST). A beep is also made when holding down too many keys at the same time, as the computer often cannot handle the processes.
The command-line interfaces of the ReactOS, PTS-DOS, SISNE plus, and AROS operating systems include a beep command.
A beep command is also part of ASCII's MSX-DOS2 Tools for MSX-DOS version 2.
Use in transport
Beeps are also used as a warning when a truck, lorry or bus is reversing. It can also be used to define the sound produced by a car horn. Colloquially, beep is also used to refer to the action of honking the car horn at someone, (e.g., "Why did that guy beep at me?"), and is more likely to be used with vehicles with higher-pitched horns. "Honk" is used if the sound is lower pitched (e.g. Volkswagen Beetles beep, but Oldsmobiles honk. On trains, beeps may be used for communications between members of staff.
Use in telecommunication
Call waiting
A beep is also a colloquialism for a zip tone to indicate a telephone call coming in on the same phone line as someone is currently speaking, either on a landline or mobile phone. The call waiting feature often outputs an audible "beep" noise to indicate that there is a second call coming in.
Paging
The electronic pager is often referred to as a "beeper" for the sound it emits to alert its owner to an incoming message.
Call back request
As a noun, the practice of "beeping" in sub-Saharan Africa refers to the cell phone phenomenon during which a person dials a number but immediately cancels the call before it is answered in order to elicit a call back from the recipient. One reason for this practice is to elicit a recipient to call back when the caller has almost run out of prepaid units for his/her cell phone but still wants or needs to talk to the recipient. In Rwanda, this practice has evolved into an art for courting between men and women, where women "beep" males in order to elicit a call back, which manifests the man's interest and willingness to pay for the woman's call. At times, this practice can be an inconvenience for the recipient, and at times, people ignore the "beeps." "Beeping" is also known as "flashing" in sub Saharan Africa, and is known as "menacing" or "fishing" in Indonesia.
Censorship
The use of profanity and offensive language on free-to-air broadcasts in the United Kingdom, Canada, the United States, Australia, New Zealand, Hong Kong, Thailand, and Japa |
https://en.wikipedia.org/wiki/Shoulder%20surfing | Shoulder surfing may refer to:
Shoulder surfing (computer security)
Shoulder surfing (surfing) |
https://en.wikipedia.org/wiki/Secure%20attention%20key | A secure attention key (SAK) or secure attention sequence (SAS) is a special key or key combination to be pressed on a computer keyboard before a login screen which must, to the user, be completely trustworthy. The operating system kernel, which interacts directly with the hardware, is able to detect whether the secure attention key has been pressed. When this event is detected, the kernel starts the trusted login processing.
The secure attention key is designed to make login spoofing impossible, as the kernel will suspend any program, including those masquerading as the computer's login process, before starting a trustable login operation.
Examples
Some examples are:
for Windows NT.
default sequence for Linux. Not a true C2-compliant SAK.
for PLATO IV in the 1970s.
See also
Control-Alt-Delete
Magic SysRq key
Break key
References
Computer security procedures
Computer access control |
https://en.wikipedia.org/wiki/Barry%20Vercoe | Barry Lloyd Vercoe (born 1937) is a New Zealand-born computer scientist and composer. He is best known as the inventor of Csound, a music synthesis language with wide usage among computer music composers. SAOL, the underlying language for the MPEG-4 Structured Audio standard, is also historically derived from Csound.
Born in Wellington, Vercoe received undergraduate degrees in music (1959) and mathematics (1962) from the University of Auckland before emigrating to the United States. While employed as an assistant professor at the Oberlin Conservatory of Music (1965-1967) and as the Contemporary Music Project's Seattle/Tacoma composer-in-residence (1967-1968), he earned his A.Mus.D. in composition from the University of Michigan (where he studied with Ross Lee Finney) in 1968. Prior to taking these positions, Vercoe supported his doctoral studies by working as a staff statistician at Michigan; it was in this capacity that first acquired an aptitude for computer programming by learning MAD. In 1965, he married fellow composer and Michigan graduate student Elizabeth Vercoe; they had two children before divorcing in the early 1990s. During a summer respite from his doctoral studies and a subsequent two-year postdoctoral fellowship at Princeton University under Godfrey Winham, his research in digital audio processing paved the way for the subsequent evolution of digital musical composition. From 1970 to 1971, he served as a visiting lecturer at the Yale School of Music.
In 1971, Vercoe became an assistant professor of humanities at the Massachusetts Institute of Technology. As one of the epoch's few specialists in digital synthesis, he has speculated that he was indirectly recruited by president Jerome Wiesner through colleagues John Harbison and David Epstein because Wiesner harbored musical inclinations (having previously collaborated with Alan Lomax) and sought to establish an electronic music laboratory as an inevitable extension of the institution's mandate. After a two-year period in which Vercoe designed a real-time digital synthesizer, Wiesner and Edward Fredkin personally procured a PDP-11 for the fledgling research program from Digital Equipment Corporation in the summer of 1973, enabling him to abandon his previous methodology in favor of a streamlined, software-based approach. Shortly thereafter, the Experimental Music Studio was formed in laboratory space vacated by Amar Bose. Following promotion to associate professor in 1974, he joined the Lab for Computer Science as an associate member in 1977. He became a founding member of the MIT Media Lab upon promotion to full professor in 1984 and continues to this day as professor emeritus of music and media arts. For many years, he directed research in machine listening and digital audio synthesis as head of the Lab's Music, Mind, and Machine group and served as associate academic head of its graduate program in media arts and sciences from 2000 until his retirement in 2010. His notable stude |
https://en.wikipedia.org/wiki/Ici%20Radio-Canada%20Premi%C3%A8re | Ici Radio-Canada Première (formerly Première Chaîne) is a Canadian French-language radio network, the news and information service of the Canadian Broadcasting Corporation (known as Société Radio-Canada in French), the public broadcaster of Canada. It is the French counterpart of CBC Radio One, the CBC's similar English-language radio network.
The service is available across Canada, although not as widely as CBC Radio One. Only the provinces of Quebec and Ontario are served by more than one Première originating station. In all other provinces, the whole province is served by a single station with multiple transmitters. It reaches 90 percent of all Canadian francophones.
Each originating station outside Montreal airs a national schedule, taken from flagship station CBF-FM, complete with opted-out local/regional shows at peak times, depending on each market. News bulletins are aired live, irrespective of location.
The network may broadcast on either the AM or FM bands, depending on the market. A national version is available across North America on Sirius XM Canada channel 170. Première was available in Europe, North Africa and the Middle East live via the Hot Bird satellite. The satellite service closed in June 2012 as part of the budget measures affecting Radio Canada International.
History
Some French-language programming had aired on the Canadian Radio Broadcasting Commission's CRCM since 1933, but the CBC's French radio network traces its formal beginning to December 11, 1937, with the launch of CBF in Montreal.
In 1938, the station was expanded into a fledgling network with the launch of CBV in Quebec City and CBJ in Chicoutimi. Also that year, the long-running soap opera La Pension Velder, which ran until 1942 and was then revived in the 1950s as a television series, aired for the first time. The following year, the even more successful and influential Un Homme et son péché was launched.
For the first month of World War II, Radio-Canada aired 24 hours a day, broadcasting war news from Europe. Also that year, the network broadcast its first Montreal Canadiens hockey game.
In 1940, another popular radio soap, Jeunesse dorée, made its debut. In 1941, the network, which had previously relied on Canadian Press reporters, launched its own news division and two shortwave radio stations in Montreal to serve francophones outside Quebec. Throughout the 1940s, its expansion inside Quebec was primarily through private affiliate stations.
In 1942, the network controversially refused to give airtime to the "No" side in the Conscription Plebiscite. Nonetheless, 72.9 per cent of Quebec voters were opposed.
In 1945, the International Service was launched. In 1946, the network launched an experimental FM station in Montreal (which would become CBFX), and expanded outside Quebec for the first time with the launch of CKSB as a private affiliate in St. Boniface, Manitoba, near Winnipeg.
The network also had seven privately owned affiliates:
CHGB, Sai |
https://en.wikipedia.org/wiki/TNI | TNI or Tni may refer to:
Satna Airport, IATA code TNI
Tahitian Noni International, Inc.
Taqramiut Nipingat Inc., an Inuit broadcasting organization in Quebec, Canada
Telephone Network Interface; see Network interface device (NID)
Tentara Nasional Indonesia; abbreviation of the Indonesian National Armed Forces.
Texas Neurosciences Institute, a research and neurological clinical center
Thai-Nichi Institute of Technology a private college in Thailand
Transnationality Index
Transnational Institute
The National Interest
The New Inquiry
Trichoplusia ni, the cabbage looper moth |
https://en.wikipedia.org/wiki/DirectPlay | DirectPlay is part of Microsoft's DirectX API. It is a network communication library intended for computer game development, although it can be used for other purposes.
DirectPlay is a high-level software interface between applications and communication services that allows games to be connected over the Internet, a modem link, or a network. It features a set of tools that allow players to find game sessions and sites to manage the flow of information between hosts and players. It provides a way for applications to communicate with each other, regardless of the underlying online service or protocol. It also resolves many connectivity issues, such as Network Address Translation (NAT).
Like the rest of DirectX, DirectPlay runs in COM and is accessed through component object model (COM) interfaces. By default, DirectPlay uses multi-threaded programming techniques and requires careful thought to avoid the usual threading issues. Since DirectX version 9, this issue can be alleviated at the expense of efficiency.
Networking model
Under the hood, DirectPlay is built on the User Datagram Protocol (UDP) to allow it speedy communication with other DirectPlay applications. It uses TCP and UDP ports 2300 to 2400 and 47624.
DirectPlay sits on layers 4 and 5 of the OSI model.
On layer 4, DirectPlay can handle the following tasks if requested by the application:
Message ordering, which ensures that data arrives in the same order it was sent.
Message reliability, which ensures that data is guaranteed to arrive.
Message flow control, which ensures that data is only sent at the rate the receiver can receive it.
On layer 5, DirectPlay always handles the following tasks:
Connection initiation and termination.
Interfaces
The primary interfaces (methods of access) for DirectPlay are:
IDirectPlay8Server, which allows access to server functionality
IDirectPlay8Client, which allows access to client functionality
IDirectPlay8Peer, which allows access to peer-to-peer functionality
Secondary interfaces are:
Various lobby interfaces that allows players to find and prepare a game before it actually commences.
Thread management interfaces that allows the programmer to fine-tune resource usage. This also allows for a general disabling of worker threads so that tricky multi-threaded issues are avoided at the cost of decreased responsiveness.
Various network address translation (NAT) interfaces that make it easier for players behind routers to host games. Most players on broadband internet connections face this problem.
Various voice communication interfaces known as DirectPlay Voice that make it easier to support audio communication and voice input in games.
Various queue monitoring interfaces that allow the application to get feedback on how much data has been sent and received as requested. This allows an application to decrease/increase the amount of data sent in accordance with the capabilities of the receiver.
DirectPlay Voice
DirectPlay Voice was introduced in |
https://en.wikipedia.org/wiki/Westlaw | Westlaw is an online legal research service and proprietary database for lawyers and legal professionals available in over 60 countries. Information resources on Westlaw include more than 40,000 databases of case law, state and federal statutes, administrative codes, newspaper and magazine articles, public records, law journals, law reviews, treatises, legal forms and other information resources.
Most legal documents on Westlaw are indexed to the West Key Number System, which is West's master classification system of U.S. law. Westlaw supports natural language and Boolean searches. Other significant Westlaw features include KeyCite, a citation checking service, which customers use to determine whether cases or statutes are still good law, and a customizable tabbed interface that lets customers bring their most-used resources to the top. Other tabs organize Westlaw content around the specific work needs of litigators, in-house corporate practitioners, and lawyers who specialize in any of over 150 legal topics. Most customers are attorneys or law students, but other individuals can also obtain accounts.
History
Westlaw was created in 1975 by West Publishing, a company whose headquarters have been in Eagan, Minnesota, since 1992; West was acquired by the Thomson Corporation in 1996. Several of Thomson's law-related businesses outside the United States have their own Westlaw sites, and Westlaw's foreign content is available online. For instance, Westlaw Canada from Carswell includes the Canadian Abridgment and KeyCite Canada, and Westlaw UK provides information from Sweet & Maxwell and independent law reports, case analysis and case status icons. More recently, Westlaw China was introduced, with laws and regulations, cases, digests, and status icons (similar to KeyCite flags), for the law of the People's Republic of China. Westlaw Ireland (IE) was established in 2002, covering information found in Round Hall publications as well as legislation, books, cases, current awareness and full-text articles from many of the country's notable legal journals. Westlaw is used in over 68 countries.
Westlaw is descended from QUIC/LAW, a Canadian computer-assisted legal research project operated by Queen's University from 1968 to 1973. The original name stood for "Queen's University Investigation of Computers and Law." It was directed by Hugh Lawford and Richard von Briesen, and the original code was based on an internal IBM text search project called INFORM/360. The IBM code turned out to be incomplete and required substantial modifications. In 1973, the project was commercialized in the form of a new company called QL Systems and a new product name, QL/SEARCH. In 1976, QL Systems licensed the QL/SEARCH software to West Publishing as the original foundation for what would become Westlaw.
West's chief competitor in the legal information retrieval market is LexisNexis. (Ironically, Lawford and von Briesen sold what by then was called QuickLaw to LexisNexis in |
https://en.wikipedia.org/wiki/LINPACK | LINPACK is a software library for performing numerical linear algebra on digital computers.
It was written in Fortran by Jack Dongarra, Jim Bunch, Cleve Moler, and Gilbert Stewart, and was intended for use on supercomputers in the 1970s and early 1980s. It has been largely superseded by LAPACK, which runs more efficiently on modern architectures.
LINPACK makes use of the BLAS (Basic Linear Algebra Subprograms) libraries for performing basic vector and matrix operations.
The LINPACK benchmarks appeared initially as part of the LINPACK user's manual. The parallel LINPACK benchmark implementation called HPL (High Performance Linpack) is used to benchmark and rank supercomputers for the TOP500 list.
World's most powerful computer by year
References
Benchmarks (computing)
Fortran libraries
Numerical linear algebra
Numerical software |
https://en.wikipedia.org/wiki/Amdahl%20Corporation | Amdahl Corporation was an information technology company which specialized in IBM mainframe-compatible computer products, some of which were regarded as supercomputers competing with those from Cray Research. Founded in 1970 by Gene Amdahl, a former IBM computer engineer best known as chief architect of System/360, it has been a wholly owned subsidiary of Fujitsu since 1997. The company was located in Sunnyvale, California.
From its first machine in 1975, Amdahl's business was to provide mainframe computers that were plug-compatible with contemporary IBM mainframes, but offering higher reliability, running somewhat faster, and costing somewhat less. They often had additional practical advantages as well, in terms of size, power requirements, of being air-cooled instead of requiring a chilled water supply. This offered a price/performance ratio superior to the IBM lineup, and made Amdahl one of the few real competitors to "Big Blue" in the very high-margin computer market segment. The company won about 8% of the mainframe business worldwide, but was a market leader in some regions, most notably in the Carolinas. Proverbially, savvy IBM customers liked to have Amdahl coffee mugs visible in their offices when IBM salespeople came to visit.
As the mainframe market began to change in the later 1980s, Amdahl was increasingly diversified, becoming a major supplier of UNIX and open systems software and servers, data storage subsystems, data communications products, application development software, and a variety of educational and consulting services.
Company origins
Amdahl launched its first product in 1975, the Amdahl 470/6, which competed directly against high-end models in IBM's then-current System/370 family. When IBM announced the introduction of Dynamic Address Translation (DAT), Amdahl announced the 470V/6 and dropped the 470/6. At the time of its introduction, the 470V/6 was less expensive but still faster than IBM's comparable offerings. The first two 470V/6 machines were delivered to NASA (Serial Number 00001) and the University of Michigan (Serial Number 00002). For the next quarter-century Amdahl and IBM competed aggressively against one another in the high-end mainframe market. At its peak, Amdahl had a 24% market share. Amdahl owed some of its success to antitrust settlements between IBM and the U.S. Department of Justice, which ensured that Amdahl's customers could license IBM's mainframe software under reasonable terms.
Gene Amdahl was committed to expanding the capabilities of the uniprocessor mainframe during the late 1970s and early 1980s. Amdahl engineers, working with Fujitsu circuit designers, developed unique, air-cooled chips which were based on high-speed emitter-coupled logic (ECL) circuit macros. These chips were packaged in a chip package with a heat-dissipating cooling attachment (that looked like the heat-dissipating fins on a motorcycle engine) mounted directly on the top of the chip. This patented technology allowed |
https://en.wikipedia.org/wiki/W%20Network | W Network (often shortened to W) is a Canadian English language discretionary specialty channel owned by Corus Entertainment. The channel primarily broadcasts general entertainment programming oriented towards a female audience.
W Network was established in 1995 as the Women's Television Network (WTN), which had a focus on women's lifestyle programming. The channel was eventually acquired by Corus in 2001 and relaunched under its current branding in 2002. As part of the relaunch, W's programming shifted to a mix of both entertainment and lifestyle programming. By 2017, W had moved its lifestyle programming to its sister networks, focusing exclusively on entertainment programming.
The channel is available in two time shifted feeds, East (operating from the Eastern Time Zone) and West (operating from the Pacific Time Zone).
History
In June 1994, Linda Rankin, on behalf of a corporation to be incorporated, (later incorporated as Lifestyle Television (1994) Limited, principally owned by Moffat Communications) was granted a television broadcasting licence by the Canadian Radio-television and Telecommunications Commission (CRTC) to operate a channel called Lifestyle Television, described as offering "information and entertainment programming of particular interest to women."
The channel subsequently launched on January 1, 1995 as Women's Television Network (WTN). Like Moffat's other cable television operations, WTN was headquartered in Winnipeg, Manitoba. Linda Rankin served as the president of the network from its launch.
Programming on the network was originally largely focused on lifestyle programming that many had suggested was "feminist" in nature. Such programming included female takes on traditionally male-dominated activities such as fishing and mechanics, with Natural Angler and Car Care, respectively. While other programs, such as Go Girl!, took a comedic approach at parodying typical female-targeted talk shows that discussed subjects such as beauty, fashion, etc. Other programs included films, current affairs, and occasionally sports.
The channel suffered from low ratings in the beginning. Of the slew of new channels launched on January 1, 1995, WTN was initially the lowest rated channel on average. Linda Rankin later resigned in August 1995 citing "differences in management philosophy".
In December 2000, Shaw Communications announced it intended to purchase Moffat. The deal was later closed in early 2001. Shaw announced in March 2001 that it would sell WTN to Corus Entertainment, a company that it spun off in 1999, for $205 million CAD (Shaw had primarily acquired Moffat for its cable television systems). Once Corus took ownership of the channel, it moved operations from Winnipeg to Toronto in mid-January 2002, laying off 50 employees in the process. Subsequently, Corus relaunched the network as W on April 15, 2002 with a more entertainment-oriented mix of recent dramas and movies. On the same date, Corus launched the west coast fee |
https://en.wikipedia.org/wiki/Hierarchical%20Music%20Specification%20Language | The Hierarchical Music Specification Language (HMSL) is a music programming language written in the 1980s by Larry Polansky, Phil Burk, and David Rosenboom at Mills College. Written on top of Forth, it allowed for the creation of real-time interactive music performance systems, algorithmic composition software, and any other kind of program that requires a high degree of musical informatics. It was distributed by Frog Peak Music, and runs with a very light memory footprint (~1 megabyte) on Macintosh and Amiga systems.
Unlike CSound and other languages for audio synthesis, HMSL is primarily a language for making music. As such, it interfaces with sound-making devices through built-in MIDI classes. However, it has a high degree of built-in understanding of music performance practice, tuning systems, and score reading. Its main interface for the manipulation of musical parameters is through the metaphor of shapes, which can be created, altered, and combined to create a musical texture, either by themselves or in response to real-time or scheduled events in a score.
HMSL has been widely used by composers working in algorithmic composition for over twenty years. In addition to the authors (who are also composers), HMSL has been used in pieces by Nick Didkovsky, The Hub, James Tenney, Tom Erbe, and Pauline Oliveros.
A Java port of HMSL was developed by Nick Didkovsky under the name JMSL, and is designed to interface to the JSyn API.
Audio programming languages |
https://en.wikipedia.org/wiki/Loader%20%28computing%29 | In computer systems a loader is the part of an operating system that is responsible for loading programs and libraries. It is one of the essential stages in the process of starting a program, as it places programs into memory and prepares them for execution. Loading a program involves either memory-mapping or copying the contents of the executable file containing the program instructions into memory, and then carrying out other required preparatory tasks to prepare the executable for running. Once loading is complete, the operating system starts the program by passing control to the loaded program code.
All operating systems that support program loading have loaders, apart from highly specialized computer systems that only have a fixed set of specialized programs. Embedded systems typically do not have loaders, and instead, the code executes directly from ROM or similar. In order to load the operating system itself, as part of booting, a specialized boot loader is used. In many operating systems, the loader resides permanently in memory, though some operating systems that support virtual memory may allow the loader to be located in a region of memory that is pageable.
In the case of operating systems that support virtual memory, the loader may not actually copy the contents of executable files into memory, but rather may simply declare to the virtual memory subsystem that there is a mapping between a region of memory allocated to contain the running program's code and the contents of the associated executable file. (See memory-mapped file.) The virtual memory subsystem is then made aware that pages with that region of memory need to be filled on demand if and when program execution actually hits those areas of unfilled memory. This may mean parts of a program's code are not actually copied into memory until they are actually used, and unused code may never be loaded into memory at all.
Responsibilities
In Unix, the loader is the handler for the system call execve(). The Unix loader's tasks include:
validation (permissions, memory requirements etc.);
memory-mapping the executable object from the disk into main memory;
copying the command-line arguments into virtual memory;
initializing registers (e.g., the stack pointer);
jumping to the program entry point (_start).
In Microsoft Windows 7 and above, the loader is the LdrInitializeThunk function contained in ntdll.dll, that does the following:
initialisation of structures in the DLL itself (i.e. critical sections, module lists);
validation of executable to load;
creation of a heap (via the function RtlCreateHeap);
allocation of environment variable block and PATH block;
addition of executable and NTDLL to the module list (a doubly-linked list);
loading of KERNEL32.DLL to obtain several important functions, for instance BaseThreadInitThunk;
loading of executable's imports (i.e. dynamic-link libraries) recursively (check the imports' imports, their imports and so on);
in debug mod |
https://en.wikipedia.org/wiki/Computer%20Music%20Center | The Computer Music Center (CMC) at Columbia University is the oldest center for electronic and computer music research in the United States. It was founded in the 1950s as the Columbia-Princeton Electronic Music Center.
Location
The CMC is housed in Prentis Hall, 632 West 125th Street, New York City, across the street from Columbia's 17-acre Manhattanville campus. The facility consists of a large graduate research facility specializing in computer music and multimedia research, as well as composition and recording studios for student use. Projects to come out of the CMC since the 1990s include:
ArtBots
dorkbot
PeRColate
Real-Time Cmix
The director of the CMC is Seth Cluett, and the CMC offers classes taught by George E. Lewis, Seth Cluett, David Soldier, Anna Meadors, and Ben Holtzman, as well as visiting faculty who give seminars every year. In collaboration with the Visual Arts Program in the Columbia University School of the Arts, the Computer Music Center offers a Sound Art MFA Program directed by Miya Masaoka. The program was founded in 2014 by Douglas Repetto who served as Director until 2016.
History
The forerunner of the Columbia-Princeton Electronic Music Center was a studio founded in the early 1950s by Columbia University professors Vladimir Ussachevsky and Otto Luening, and Princeton University professors Milton Babbitt and Roger Sessions. Originally concerned with experiments in music composition involving the new technology of reel-to-reel tape, the studio soon branched out into all areas of electronic music research. The center was officially established with a grant from the Rockefeller Foundation in 1959 which was used to finance the acquisition of the RCA Mark II Sound Synthesizer from its owner, RCA.
The center's flagship piece of equipment, the RCA Mark II Sound Synthesizer, was delivered in 1957 after it was developed to Ussachevsky and Babbitt's specifications. The RCA (and the center) were re-housed in Prentis Hall, a building off the main Columbia campus on 125th Street. Significant pieces of electronic music realized on the Synthesizer included Babbitt's Vision and Prayer and Charles Wuorinen's Time's Encomium, which was awarded the 1970 Pulitzer Prize in Music. In 1964 Columbia Records released an album titled simply Columbia-Princeton Electronic Music Center, which was produced principally on the RCA synthesizer.
Most of the luminaries in the field of electronic music (and avant-garde music in general) visited, worked, or studied at the Electronic Music Center, including Edgard Varèse, Chou Wen-chung, Halim El-Dabh, Michiko Toyama, Bülent Arel, Mario Davidovsky, Charles Dodge, Pril Smiley, Alice Shields, Wendy Carlos, Dariush Dolat-Shahi, Kenjiro Ezaki and Luciano Berio. The center also acted as a consulting agency for other electronic music studios in the Western Hemisphere, giving them advice on optimum studio design and helping them purchase equipment.
The staff engineers at the center under Peter Mauzey |
https://en.wikipedia.org/wiki/ICMC | ICMC may refer to:
International Catholic Migration Commission
International Computer Music Conference
The Indiana College Mathematics Competition
International Cryptographic Module Conference
Integrated Currency Management Centre
Inter College Music Competition
Integrated Call Management Centre |
https://en.wikipedia.org/wiki/International%20Computer%20Music%20Conference | The International Computer Music Conference (ICMC) is a yearly international conference for computer music researchers and composers. It is the annual conference of the International Computer Music Association (ICMA).
History
In 1986, the Institute of Sonology institute was moved to the Royal Conservatory of The Hague, hosting the International Computer Music Conference there during its inaugural year.
Each year there is a specific theme. For example, in 2007, the theme was "Immersed Music" and immersive media. ICMC 2007 took place in Copenhagen. On August 28, there was an "Underwater/Water Concert" at the DGI-byen swimcenter, in the hundred-metre DGI-byen pool, as well as the various other pools of the Vandkulturhuset.
This "Immersed Music" theme of ICMC 2007 explored important issues in musical instrument classification and immersion.
2014 40th ICMC is organised joint with the 11th Sound and Music Computing Conference in Athens, Greece 14–20 September 2014.
2017 43rd ICMC took place from Oct 16, 2017 - Oct 20, 2017 in Shanghai, China. 2018 44th ICMC took place from 5–10 August 2018 in Daegu, Korea.
See also
List of electronic music festivals
References
External links
CMA history
ICMA – International Computer Music Association
ICMC 2008, 2008 Conference website, hosted by the Sonic Arts Research Centre, Queen's University Belfast
ICMC|SMC 2014, 2014 Conference website, hosted by the National and Kapodistrian University of Athens, the Institute for Research on Music & Acoustics and the Onassis Cultural Center.
ICMC2016, 12–16 September 2016 in Utrecht, the Netherlands
ICMC2018, 5–10 August 2018 in Daegu, Korea
Computer conferences
Computer music
Computer science conferences
Music conferences
Electronic music festivals in the United Kingdom
Electroacoustic music festivals
Music festivals established in 1974 |
https://en.wikipedia.org/wiki/Open%20Mike%20with%20Mike%20Bullard | Open-Mike with Mike Bullard was a Canadian late-night talk show which was broadcast live from 1997 to 2003 on CTV and on The Comedy Network in primetime. It was hosted by comedian Mike Bullard and initially taped at a studio at the back of Wayne Gretzky's restaurant in Toronto, Ontario before CTV moved the show to Toronto's historic Masonic Temple. Open Mike with Mike Bullard featured two or three panel guests and one musical or comedy performance nightly. The show's bandleader and musical director was Orin Isaacs. Part of Bullard's comedic style was interacting with audience members during his opening monologue, often deriving humour from finding ways to poke fun at an audience member's expense.
In the summer of 2003, Bullard's contract with CTV expired. He did not like their practice of shutting the show down for summers; he knew that it interrupted his exposure and he did not like to see reruns that were dated. He signed a multi-year deal to start a new, similar show on Global called The Mike Bullard Show. The new show carried over many of the staff and sketches from Open-Mike and aired at the same time as his old show had but faltered in the ratings against CTV, which aired The Daily Show with Jon Stewart in the same time slot. The Mike Bullard Show was cancelled in 2004 after a run of 13 weeks.
Segments
"Open-Mike Viewer Of The Week" – Sean Tweedley would make fun of one of the viewers in the audience, but they would be given a digital camera as a prize.
"The Canadian Quiz" – The last guests would be asked three questions about Canada at the end of every show. Officially, the guests were supposed to get all three questions right, but they usually ended up winning the prize regardless. As the segment was sponsored by Canadian Tire, the prize would usually be one of their exclusive products.
"The Insider" – An entertainment-themed monologue.
"Who The Hell Do You Think You Are, You Drunken Bastard?" – a game played at a local bar where the name of a celebrity would be taped on the head of each contestant. They would be given three clues from Mike and had to use them to guess who they were.
"What did you buy at Canadian Tire and why?" – a crew member would visit the Canadian Tire across the street from the studio and ask shoppers when they left what they had bought and why.
Awards
The show won two Gemini Awards, Best Talk Information Series in 1999 and Best Music Variety Program Series in 2001. The show also won the 2000 Hugo Award (Gold Medal) for Best Talk Show at the Chicago International Television Festival. Bullard was also voted one of the top 10 Funniest Canadians in a nationwide poll by TV Guide in 2002.
References
External links
CTV Television Network original programming
1997 Canadian television series debuts
2003 Canadian television series endings
CTV Comedy Channel original programming
Television shows filmed in Toronto
1990s Canadian comedy television series
2000s Canadian comedy television series
Canadian late-night tele |
https://en.wikipedia.org/wiki/Perry%20R.%20Cook | Perry R. Cook (born September 25, 1955) is an American computer music researcher and professor emeritus of computer science and music at Princeton University. He was also founder and head of the Princeton Sound Lab.
Cook has worked in the areas of physical modeling, singing voice synthesis, music information retrieval, principles of computer music controller design, audio analysis and real-time computer music programming languages and systems, and has written a number of books on these subjects. Together with Gary Scavone, he authored the Synthesis Toolkit and with Ge Wang the ChucK programming language. He is also a co-founder, with Dan Trueman in 2005, of the Princeton Laptop Orchestra (PLOrk). Cook was an invited keynote speaker at NIME-07, held in New York City in June, 2007. He is a Fellow of the Association for Computing Machinery (2008) and the Guggenheim Foundation (2003).
Cook is also an avid conch shell musician, including the ancient conch-shell Peruvian instrument known as pututus.
Cook is a founding advisor (since 2008) to Smule, a successful mobile music app company.
In 2012, Cook and Ajay Kapur received an NSF-funded grant to create a programming and technology curriculum for art schools. Beginning in 2013 with Ajay Kapur and others, Cook co-founded Kadenze, an online arts education company.
His adviser was Julius Orion Smith III at Stanford.
References
External links
Princeton SoundLab
Synthesis Toolkit
Princeton Laptop Orchestra
ChucK programming language
1955 births
Living people
Fellows of the Association for Computing Machinery |
https://en.wikipedia.org/wiki/List%20of%20Melbourne%20tram%20routes | This is a list of tram routes on the tram network in Melbourne, Australia, operated by Yarra Trams.
Current routes
Services that deviate from the regular routes below (by diversion or early-termination) are suffixed with the letter 'a', while services diverting to and/or terminating at the depot are suffixed with 'd'.
Special event services
Discontinued routes
This is the list of Melbourne tram routes that have been discontinued or replaced. Tram routes that ran short-workings or temporary routes are not included. Routes changed or removed due to the conversion of cable tram lines are also not included.
References
External links
History of Melbourne Tram Routes 1950-2009
Network map Victoria Department of Transport
Tram routes
Tram routes
Trams in Melbourne |
https://en.wikipedia.org/wiki/Computer%20audio | Computer audio may refer to:
Computer music, music generated by computers;
Sound card, computer hardware for producing sound. |
https://en.wikipedia.org/wiki/Unit%20generator | Unit generators (or ugens) are the basic formal units in many MUSIC-N-style computer music programming languages. They are sometimes called opcodes (particularly in Csound), though this expression is not accurate in that these are not machine-level instructions.
Unit generators form the building blocks for designing synthesis and signal processing algorithms in software. For example, a simple unit generator called OSC could generate a sinusoidal waveform of a specific frequency (given as an input or argument to the function or class that represents the unit generator). ENV could be a unit generator that delineates a breakpoint function. Thus ENV could be used to drive the amplitude envelope of the oscillator OSC through the equation OSC*ENV. Unit generators often use predefined arrays of values for their functions (which are filled with waveforms or other shapes by calling a specific generator function).
The unit generator theory of sound synthesis was first developed and implemented by Max Mathews and his colleagues at Bell Labs in the 1950s.
Code example
In the SuperCollider language, the .ar method in the SinOsc class is a UGen that generates a sine wave. The example below makes a sine wave at frequency 440, phase 0, and amplitude 0.5.
<nowiki>SinOsc.ar(440, 0, 0.5);</nowiki>
See also
Tuning generator
Acoustics software
Audio programming languages |
https://en.wikipedia.org/wiki/Glob%20%28programming%29 | In computer programming, glob () patterns specify sets of filenames with wildcard characters. For example, the Unix Bash shell command mv *.txt textfiles/ moves (mv) all files with names ending in .txt from the current directory to the directory textfiles. Here, * is a wildcard standing for "any string of characters except /" and *.txt is a glob pattern. The other common wildcard is the question mark (?), which stands for one character. For example, mv ?.txt shorttextfiles/ will move all files named with a single character followed by .txt from the current directory to directory shorttextfiles, while ??.txt would match all files whose name consists of 2 characters followed by .txt.
In addition to matching filenames, globs are also used widely for matching arbitrary strings (wildcard matching). In this capacity a common interface is fnmatch.
Origin
The glob command, short for global, originates in the earliest versions of Bell Labs' Unix. The command interpreters of the early versions of Unix (1st through 6th Editions, 1969–1975) relied on a separate program to expand wildcard characters in unquoted arguments to a command: /etc/glob. That program performed the expansion and supplied the expanded list of file paths to the command for execution.
Glob was originally written in the B programming language. It was the first piece of mainline Unix software to be developed in a high-level programming language. Later, this functionality was provided as a C library function, glob(), used by programs such as the shell. It is usually defined based on a function named fnmatch(), which tests for whether a string matches a given pattern - the program using this function can then iterate through a series of strings (usually filenames) to determine which ones match. Both functions are a part of POSIX: the functions defined in POSIX.1 since 2001, and the syntax defined in POSIX.2. The idea of defining a separate match function started with wildmat (wildcard match), a simple library to match strings against Bourne Shell globs.
Traditionally, globs do not match hidden files in the form of Unix dotfiles; to match them the pattern must explicitly start with .. For example, * matches all visible files while .* matches all hidden files.
Syntax
The most common wildcards are , , and .
Normally, the path separator character ( on Linux/Unix, MacOS, etc. or on Windows) will never be matched. Some shells, such as Bash have functionality allowing users to circumvent this.
Unix-like
On Unix-like systems , is defined as above while has two additional meanings:
The ranges are also allowed to include pre-defined character classes, equivalence classes for accented characters, and collation symbols for hard-to-type characters. They are defined to match up with the brackets in POSIX regular expressions.
Unix globbing is handled by the shell per POSIX tradition. Globbing is provided on filenames at the command line and in shell scripts. The POSIX-mandated case statement |
https://en.wikipedia.org/wiki/V8%20%28disambiguation%29 | A V8 is an engine with eight cylinders mounted on the crankcase in two banks of four cylinders.
V8 may also refer to:
Computers
V8 (JavaScript engine), an open-source JavaScript engine
ITU-T V.8, a telecommunications recommendation
V8 Unix, the eighth edition of Research Unix from 1985
Vehicles
Aston Martin V8, 1969 two-door coupe-type automobile manufactured in the United Kingdom
Audi V8, a 1988 large luxury saloon/sedan
Fokker V.8, a German quintuplane
V8 Supercars, an Australian touring car racing category
Other
V8 (band) a heavy metal band
V8 (beverage), a vegetable juice made by Campbell Soup Company
V8 Marlborough Street, a grid road in the new town of Milton Keynes, England
Vigilante 8, a vehicular combat game produced by Luxoflux
Video8, a generation of 8mm video format
V8 (TV channel), a defunct Dutch television channel
See also
ATC code V08 Contrast media, a subgroup of the Anatomical Therapeutic Chemical Classification System
V8 engine (disambiguation) |
https://en.wikipedia.org/wiki/Wol | Wol, WoL or WOL may refer to:
Computing
Wake-on-LAN, (/wɒl/) an Ethernet standard that allows computers to be powered on by a network message
An unofficial initialism for Web Ontology Language
.wol, file extension for the WOLF eBook file format
World Online, a defunct European internet service provider
Write-only language, a programming which facilitates hard to read code
Computer games
War of Legends, (/wɒl/) a fantasy real-time strategy game published by Jagex Games Studio
Warhammer Online, abbreviation used internally by Games Workshop staff
StarCraft II: Wings of Liberty
Westwood Online, multi-player game mode by Westwood Studios, superseded by XWIS
Transport
Illawarra Regional Airport
Wood Lane tube station, London, London Underground station code
Other uses
Owl (Winnie the Pooh), character in the Winnie the Pooh stories, who spells his name "Wol"
Wide outside lane, in bicycle transportation engineering
WOL (AM), a radio station in Washington, D.C.
See also
Word of Life (disambiguation) |
https://en.wikipedia.org/wiki/Judy%20array | In computer science, a Judy array is a data structure implementing a type of associative array with high performance and low memory usage. Unlike most other key-value stores, Judy arrays use no hashing, leverage compression on their keys (which may be integers or strings), and can efficiently represent sparse data; that is, they may have large ranges of unassigned indices without greatly increasing memory usage or processing time. They are designed to remain efficient even on structures with sizes in the peta-element range, with performance scaling on the order of O(log n). Roughly speaking, Judy arrays are highly optimized 256-ary radix trees.
Judy trees are usually faster than AVL trees, B-trees, hash tables and skip lists because they are highly optimized to maximize usage of the CPU cache. In addition, they require no tree balancing and no hashing algorithm is used.
History
The Judy array was invented by Douglas Baskins and named after his sister.
Benefits
Memory allocation
Judy arrays are dynamic and can grow or shrink as elements are added to, or removed from, the array. The memory used by Judy arrays is nearly proportional to the number of elements in the Judy array.
Speed
Judy arrays are designed to minimize the number of expensive cache-line fills from RAM, and so the algorithm contains much complex logic to avoid cache misses as often as possible. Due to these cache optimizations, Judy arrays are fast, especially for very large datasets. On data sets that are sequential or nearly sequential, Judy arrays can even outperform hash tables, since, unlike hash tables, the internal tree structure of Judy arrays maintains the ordering of the keys.
Drawbacks
Judy arrays are extremely complicated. The smallest implementations are thousands of lines of code. In addition, Judy arrays are optimized for machines with 64 byte cache lines, making them essentially unportable without a significant rewrite.
See also
Radix tree
Hash array mapped trie
References
External links
Main Judy arrays site
How Judy arrays work and why they are so fast
A complete technical description of Judy arrays
An independent performance comparison of Judy to Hash Tables
A compact implementation of Judy arrays in 1250 lines of C code
Associative arrays |
https://en.wikipedia.org/wiki/Broadcast%20address | A broadcast address is a network address used to transmit to all devices connected to a multiple-access communications network. A message sent to a broadcast address may be received by all network-attached hosts.
In contrast, a multicast address is used to address a specific group of devices, and a unicast address is used to address a single device.
For network layer communications, a broadcast address may be a specific IP address. At the data link layer on Ethernet networks, it is a specific MAC address.
IP networking
In Internet Protocol version 4 (IPv4) networks, broadcast addresses are special values in the host-identification part of an IP address. The all-ones value was established as the standard broadcast address for networks that support broadcast. This method of using the all-ones address was first proposed by R. Gurwitz and R. Hinden in 1982. The later introduction of subnets and Classless Inter-Domain Routing changed this slightly, so that the all-ones host address of each subnet is that subnet's broadcast address.
The broadcast address for any IPv4 host can be obtained by taking the bit complement (bitwise NOT) of the subnet mask and then performing a bitwise OR operation with the host's IP address. A shortcut to this process (for common masks using only 0 and 1 bit placements) is to simply take the host's IP address and set all bits in the host identifier portion of the address (any bit positions which hold a 0 in the subnet mask) to 1.
As shown in the example below, in order to calculate the broadcast address to transmit a packet to an entire IPv4 subnet using the private IP address space , which has the subnet mask , the broadcast address is calculated as bitwise ORed with = .
A special definition exists for the IP address . It is the broadcast address of the zero network or , which in Internet Protocol standards stands for this network, i.e. the local network. Transmission to this address is limited by definition, in that it is never forwarded by the routers connecting the local network to other networks.
IP broadcasts are used by BOOTP and DHCP clients to find and send requests to their respective servers.
Internet Protocol version 6 (IPv6) does not implement this method of broadcast, and therefore does not define broadcast addresses. Instead, IPv6 uses multicast addressing to the all-hosts multicast group. No IPv6 protocols are defined to use the all-hosts address, though; instead, they send and receive on particular link-local multicast addresses. This results in higher efficiency because network hosts can filter traffic based on multicast address and do not need to process all broadcasts or all-hosts multicasts.
Ethernet
Broadcast is possible also on the underlying data link layer in Ethernet networks. Frames are addressed to reach every computer on a given LAN segment if they are addressed to MAC address . Ethernet frames that contain IP broadcast packages are usually sent to this address.
Ethernet broadcasts a |
https://en.wikipedia.org/wiki/University%20of%20Michigan%20Executive%20System | The University of Michigan Executive System, or UMES, a batch operating system developed at the University of Michigan in 1958, was widely used at many universities. Based on the General Motors Executive System for the IBM 701, UMES was revised to work on the mainframe computers in use at the University of Michigan during this time (IBM 704, 709, and 7090) and to work better for the small student jobs that were expected to be the primary work load at the University.
UMES was in use at the University of Michigan until 1967, when MTS was phased in to take advantage of the newer virtual memory time-sharing technology that became available on the IBM System/360 Model 67.
Programming languages available
FORTRAN
MAD (programming language)
See also
Timeline of operating systems
History of IBM mainframe operating systems
FORTRAN Monitor System
Bell Operating System (BESYS) or Bell Monitor (BELLMON)
SHARE Operating System (SOS)
IBM 7090/94 IBSYS
Compatible Time-Sharing System (CTSS)
Michigan Terminal System (MTS)
Hardware: IBM 701, IBM 704, IBM 709, IBM 7090
External links
University of Michigan Executive System for the IBM 7090 Computer, volumes 1 (General, Utilities, Internal Organization), 2 (Translators), and 3 (Subroutine Libraries), Computing Center, University of Michigan, September 1965, 1050 pp.
The IBM 7094 and CTSS, Tom Van Vleck
University of Michigan Executive System (UMES) subseries, Computing Center publications, 1965-1999, Bentley Historical Library, University of Michigan, Ann Arbor, Michigan
"A Markovian model of the University of Michigan Executive System", James D. Foey, Communications of the ACM, 1967, No.6
Discontinued operating systems
University of Michigan
1958 software
IBM mainframe operating systems |
https://en.wikipedia.org/wiki/Software%20%28disambiguation%29 | Software usually refers to instructions for computer hardware to execute.
Software may also refer to:
IEEE Software, a magazine
Software (novel), part of the Ware Tetralogy, a 1982 cyber-punk novel by Rudy Rucker
Software (album), 1999 album by Grace Slick
Software (band), a German electronic duo active between 1984 and 2000
Software, Etc., a predecessor of the video game retailer GameStop
GNOME Software, a GNOME software package for managing software installation |
https://en.wikipedia.org/wiki/Saturday%20Night%20at%20the%20Movies | Saturday Night at the Movies was a weekly television series on TVOntario, the public educational television network in Ontario, Canada. The series presented classic movies, followed by interviews and feature segments with directors, actors and other people involved in making the films presented.
The show was initially formatted in this way due to requirements that all programming shown on TVO (including dramatic programming) needed to contain educational elements, which was usually accomplished by including interviews and analysis of the programming. Nevertheless, even after these requirements were dropped, the format was maintained; all told, the series presented almost 1,500 films and over 1,000 interviews.
The show was produced for much of its run by Risa Shuman.
Broadcast history
Elwy Yost era
First aired on March 30, 1974, the program was originally hosted by Elwy Yost. The first film shown was Ingmar Bergman's Through a Glass Darkly. During Yost's 25-year tenure as host, he showed a variety of foreign films, but tended to concentrate on Hollywood-produced films from the 1930s through the 1950s, slowly expanding into also showing films from the 1960s and 1970s as the series progressed. Films shown spanned all genres; Yost famously said that of all the films he had ever seen in his life, he had disliked only two. For a number of years, however, the show was unable to broadcast films from the Warner Bros. studio, as TVOntario's transmitter in Windsor created a programming rights conflict with stations in Detroit.
Although the hosts did interview actors and film directors, they often interviewed film crew, such as cinematographers and film editors, who much more rarely receive widespread publicity.
In his final decade hosting the show, Yost lived in Vancouver, British Columbia, and would travel to Toronto to prepare many episodes of the show at once.
Yost retired as host of the series in 1999. The last film he presented was, atypically, a then-recent Hollywood blockbuster: Yost chose Speed to conclude his run as host, as it was written by his son, screenwriter Graham Yost. Around the same time as his retirement, he was inducted into the Order of Canada.
After Yost
Soon after Yost's retirement, the Progressive Conservative government of Mike Harris appointed Isabel Bassett as chair of TVOntario, with a mandate to refocus the network's broadcast schedule more clearly on education. Although there was some concern that the network would lose Saturday Night at the Movies, its highest-rated program, Bassett instead negotiated an agreement with York University to include the series in its film studies curriculum.
Yost was replaced as host for one season by Shelagh Rogers, concurrently with her continuing role as host of CBC Stereo's classical music program Take Five. When Rogers became the host of CBC Radio's morning news program This Morning in 2000, she left Saturday Night at the Movies, which briefly changed to a hostless format. At this t |
https://en.wikipedia.org/wiki/Register%20allocation | In compiler optimization, register allocation is the process of assigning local automatic variables and expression results to a limited number of processor registers.
Register allocation can happen over a basic block (local register allocation), over a whole function/procedure (global register allocation), or across function boundaries traversed via call-graph (interprocedural register allocation). When done per function/procedure the calling convention may require insertion of save/restore around each call-site.
Context
Principle
In many programming languages, the programmer may use any number of variables. The computer can quickly read and write registers in the CPU, so the computer program runs faster when more variables can be in the CPU's registers. Also, sometimes code accessing registers is more compact, so the code is smaller, and can be fetched faster if it uses registers rather than memory. However, the number of registers is limited. Therefore, when the compiler is translating code to machine-language, it must decide how to allocate variables to the limited number of registers in the CPU.
Not all variables are in use (or "live") at the same time, so, over the lifetime of a program, a given register may be used to hold different variables. However, two variables in use at the same time cannot be assigned to the same register without corrupting one of the variables. If there are not enough registers to hold all the variables, some variables may be moved to and from RAM. This process is called "spilling" the registers. Over the lifetime of a program, a variable can be both spilled and stored in registers: this variable is then considered as "split". Accessing RAM is significantly slower than accessing registers and so a compiled program runs slower. Therefore, an optimizing compiler aims to assign as many variables to registers as possible. A high "Register pressure" is a technical term that means that more spills and reloads are needed; it is defined by Braun et al. as "the number of simultaneously live variables at an instruction".
In addition, some computer designs cache frequently-accessed registers. So, programs can be further optimized by assigning the same register to a source and destination of a move instruction whenever possible. This is especially important if the compiler is using an intermediate representation such as static single-assignment form (SSA). In particular, when SSA is not fully optimized it can artificially generate additional move instructions.
Components of register allocation
Register allocation consists therefore of choosing where to store the variables at runtime, i.e. inside or outside registers. If the variable is to be stored in registers, then the allocator needs to determine in which register(s) this variable will be stored. Eventually, another challenge is to determine the duration for which a variable should stay at the same location.
A register allocator, disregarding the chosen allocat |
https://en.wikipedia.org/wiki/Sex%20machine%20%28disambiguation%29 | Sex Machine may refer to:
Human sexuality
Sex machine, a mechanized apparatus that acts as an automated erotic stimulation device
Virtual sex machine or teledildonics, computer-controlled sex toys
Sex Machines Museum, a sex museum in Prague, Czech Republic
Music
"Sex Machine", a song on the 1969 album Stand! by Sly and the Family Stone
Sex Machine (album), a 1970 album by James Brown
"Get Up (I Feel Like Being a) Sex Machine", a 1970 song by James Brown
Live at the Sex Machine, a 1971 funk album by Kool and the Gang
Carter the Unstoppable Sex Machine, a British indie rock band
Sex Machineguns, a Japanese speed metal band
Film
Conviene far bene l'amore (1975), also released as The Sex Machine
Sex Machine (1980 film), a pornographic film starring Jack Wrangler
Sex Machine, a character in the 1996 film From Dusk Till Dawn
People
Santana Sexmachine, Swedish-German drag queen
See also
Fucking Machines |
https://en.wikipedia.org/wiki/QMC | QMC may refer to:
Quaid e Azam Medical College, a medical college in Bahawalpur, Pakistan
Quantum Monte Carlo, a class of computer algorithms
Quartermaster Corporal, a type of appointment in the British Household Cavalry
Quasi-Monte Carlo method, an integration method in mathematics
Queen Margaret College, now Queen Margaret University, in Edinburgh, Scotland
Queen Margaret College (Wellington), an all-girls high school in Wellington, New Zealand
Queen Mary Coast, a portion of the coast of Antarctica
Queen Mary College, a former college of the University of London, now part of Queen Mary University of London
Queen Mary's College, Chennai, a women's college in Chennai
Queen Mary's College, a Sixth Form College in Basingstoke, Hampshire, England
Queen's Medical Centre, a hospital in Nottingham, England
Quezon Memorial Circle, a national park and shrine in Quezon City, Philippines
Quine–McCluskey algorithm, a method used for the minimization of Boolean functions |
https://en.wikipedia.org/wiki/Irish%20Statute%20Book | The Irish Statute Book, also known as the electronic Irish Statute Book (eISB), is a database produced by the Office of the Attorney General of Ireland. It contains copies of Acts of the Oireachtas and statutory instruments. It also contains a Legislation Directory which includes chronological tables of pre-1922 legislation. It is published on a website (irishstatutebook.ie) and was formerly published on CD-ROM.
In 2001, the Irish Law Times said that, whilst the Attorney General's staff deserved to be congratulated for the Irish Statute Book, the CD-ROM version contained a "significant number of errors".
See also
Law of the Republic of Ireland
References
Irish Statute Book. N-Lex.
OECD (2010). Better Regulation in Europe: Ireland 2010. OECD Publishing. . Page 93. Digitized copy from Google Books. .
Ruth O'Flaherty. "The Provision of Library and Research Services in the Office of the Attorney General – a Law Office of the State". Legal Information Management. Cambridge University Press. Volume 11. Issue 3. September 2011. pp 195 – 197. .
External links
Law of the Republic of Ireland |
https://en.wikipedia.org/wiki/Advanced%20Boolean%20Expression%20Language | The Advanced Boolean Expression Language (ABEL) is an obsolete hardware description language (HDL) and an associated set of design tools for programming programmable logic devices (PLDs). It was created in 1983 by Data I/O Corporation, in Redmond, Washington.
ABEL includes both concurrent equation and truth table logic formats as well as a sequential state machine description format. A preprocessor with syntax loosely based on Digital Equipment Corporation's MACRO-11 assembly language is also included.
In addition to being used for describing digital logic, ABEL may also be used to describe test vectors (patterns of inputs and expected outputs) that may be downloaded to a hardware PLD programmer along with the compiled and fuse-mapped PLD programming data.
Other PLD design languages originating in the same era include CUPL and PALASM. Since the advent of larger field-programmable gate arrays (FPGAs), PLD-specific HDLs have fallen out of favor as standard HDLs such as Verilog and VHDL gained adoption.
The ABEL concept and original compiler were created by Russell de Pina of Data I/O's Applied Research Group in 1981. The work was continued by ABEL product development team (led by Dr. Kyu Y. Lee) and included Mary Bailey, Bjorn Benson, Walter Bright, Michael Holley, Charles Olivier, and David Pellerin.
After a series of acquisitions, the ABEL toolchain and intellectual property were bought by Xilinx. Xilinx discontinued support for ABEL in its ISE Design Suite starting with version 11 (released in 2010).
References
External links
University of Pennsylvania's ABEL primer, as recommended by Walter Bright. Dead Link
University of Southern Maine ABEL-HDL Primer, by J. Van der Spiegel
Hardware description languages |
https://en.wikipedia.org/wiki/Netlib | Netlib is a repository of software for scientific computing maintained by AT&T, Bell Laboratories, the University of Tennessee and Oak Ridge National Laboratory. Netlib comprises many separate programs and libraries. Most of the code is written in C and Fortran, with some programs in other languages.
History
The project began with email distribution on UUCP, ARPANET and CSNET in the 1980s.
The code base of Netlib was written at a time when computer software was not yet considered merchandise. Therefore, no license terms or terms of use are stated for many programs. Before the Berne Convention Implementation Act of 1988 (and the earlier Copyright Act of 1976) works without an explicit copyright notice were public-domain software. Also, most of the Netlib code is work of US government employees and therefore in the public domain. While several packages therefore don't have explicit waiver/anti-copyright statements, for instance, the SLATEC package has an explicit statement.
Contents
Some well-known packages maintained in Netlib are:
AMPL Solver Library (ASL)
Basic Linear Algebra Subprograms (BLAS)
EISPACK
LAPACK
LINPACK
MINPACK
QUADPACK
The SLATEC package is special in that it comprises a number of other packages like BLAS and LINPACK.
Other projects
GNU Scientific Library (GSL), written in C and distributed under the GNU General Public License
References
External links
www.netlib.org
Numerical software
Public-domain software with source code |
https://en.wikipedia.org/wiki/S/SL%20programming%20language | The Syntax/Semantic Language (S/SL) is an executable high level specification language for recursive descent parsers, semantic analyzers and code generators developed by James Cordy, Ric Holt and David Wortman at the University of Toronto in 1980.
S/SL is a small programming language that supports cheap recursion and defines input, output, and error token names (& values), semantic mechanisms (class interfaces whose methods are really escapes to routines in a host programming language but allow good abstraction in the pseudocode) and a pseudocode program that defines the syntax of the input language by the token stream the program accepts. Alternation, control flow and one-symbol look-ahead constructs are part of the language.
The S/SL processor compiles this pseudocode into a table (byte-codes) that is interpreted by the S/SL table-walker (interpreter). The pseudocode language processes the input language in LL(1) recursive descent style but extensions allow it to process any LR(k) language relatively easily. S/SL is designed to provide excellent syntax error recovery and repair. It is more powerful and transparent than Yacc but can be slower.
S/SL's "semantic mechanisms" extend its capabilities to all phases of compiling, and it has been used to implement all phases of compilation, including scanners, parsers, semantic analyzers, code generators and virtual machine interpreters in multi-pass language processors.
S/SL has been used to implement production commercial compilers for languages such as PL/I, Euclid, Turing, Ada, and COBOL, as well as interpreters, command processors, and domain specific languages of many kinds. It is the primary technology used in IBM's ILE/400 COBOL compiler, and the ZMailer mail transfer agent uses S/SL for defining both its mail router processing language and its RFC 822 email address validation.
References
Compiling tools
Parser generators |
https://en.wikipedia.org/wiki/SR%20%28programming%20language%29 | SR (short for Synchronizing Resources) is a programming language designed for concurrent programming.
Resources encapsulate processes and the variables they share, and can be separately compiled. Operations provide the primary mechanism for process interaction.
SR provides a novel integration of the mechanisms for invoking and servicing operations. Consequently, it supports local and remote procedure call, rendezvous, message passing, dynamic process creation, multicast, semaphores and shared memory.
Version 2.2 has been ported to the Apollo, DECstation, Data General AViiON, HP 9000 Series 300, Multimax, NeXT, PA-RISC, RS/6000, Sequent Symmetry, SGI IRIS, Sun-3, Sun-4 and others.
See also
Occam
MPD
References
Gregory R. Andrews, Ronald A. Olsson: The SR Programming Language: Concurrency in Practice,
Stephen J. Hartley: Operating Systems Programming: The SR Programming Language, Oxford University Press,
External links
The SR Programming Language
Concurrent programming languages |
https://en.wikipedia.org/wiki/Fifth%20generation%20of%20video%20game%20consoles | The fifth generation era (also known as the 32-bit era, the 64-bit era, or the 3D era) refers to computer and video games, video game consoles, and handheld gaming consoles dating from approximately October 4, 1993, to March 23, 2006. For home consoles, the best-selling console was the Sony PlayStation, followed by the Nintendo 64, and then the Sega Saturn. The PlayStation also had a redesigned version, the PSone, which was launched on July 7, 2000.
Some features that distinguished fifth generation consoles from previous fourth generation consoles include:
3D polygon graphics with texture mapping
3D graphics capabilities – lighting, Gouraud shading, anti-aliasing and texture filtering
Optical disc (CD-ROM) game storage, allowing much larger storage space (up to 650 MB) than ROM cartridges
CD quality audio recordings (music and speech) – PCM audio with 16-bit depth and 44.1 kHz sampling rate
Wide adoption of full motion video, displaying pre-rendered computer animation or live action footage
Analog controllers
Display resolutions from 480i/480p to 576i
Color depth up to 16,777,216 colors (24-bit true color)
This era is known for its pivotal role in the video game industry's leap from 2D to 3D computer graphics, as well as the shift in home console games from being stored on ROM cartridges to optical discs. This was also the first generation to feature internet connectivity: some systems had additional hardware which provided connectivity to an existing device, like the Sega Net Link for the Sega Saturn. The Apple Pippin, a commercial flop, was the first system to feature on-board internet capabilities.
For handhelds, this era was characterized by significant fragmentation, because the first handheld of the generation, the Sega Nomad, had a lifespan of just two years, and the Nintendo Virtual Boy had a lifespan of less than one. Both of them were discontinued before the other handhelds made their debut. The Neo Geo Pocket was released on October 28, 1998, but was dropped by SNK in favor of the fully backwards-compatible Neo Geo Pocket Color just a year later. Nintendo's Game Boy Color (1998) was the most successful handheld by a large margin. There were also two minor updates of the original Game Boy: the Game Boy Light (released in Japan only) and the Game Boy Pocket.
There was considerable time overlap between this generation and the next, the sixth generation of consoles, which began with the launch of the Dreamcast in Japan on November 27, 1998. The fifth generation ended with the discontinuation of the PlayStation (specifically its re-engineered form, the "PSOne") on March 23, 2006, a year after the launch of the seventh generation.
History
Transition to 3D
The 32-bit/64-bit era is most noted for the rise of fully 3D polygon games. While there were games prior that had used three-dimensional polygon environments, such as Virtua Racing and Virtua Fighter in the arcades and Star Fox on the Super NES, it was in this era that many |
https://en.wikipedia.org/wiki/List%20of%20closed%20railway%20stations%20in%20Melbourne | A number of railway lines and stations which formed part of the greater Melbourne railway network have been closed over time, either in part or in full. The decision to close a railway station has historically been made by the department responsible for rail transport within the Government of Victoria.
Over the history of the Melbourne railway network, a total of eleven complete railway lines, as well as 71 railway stations, have been closed. The most recent railway stations to close are Surrey Hills and Mont Albert stations, which closed on 17 February 2023, due to the level crossing removal project which will see the two stations merge and become Union station, while the most recent railway line to close to traffic is the Port Melbourne railway line, which was closed on 11 October 1987, and was subsequently converted to light rail. A number of stations have also been closed and rebuilt at another location, such as West Footscray, which was rebuilt 160 metres away as part of the Regional Rail Link project.
Most closed railway lines have been converted to other uses, such as rail trails or linear parkland. In addition, a number of closed railway stations have been converted for other uses, such as retail stores.
Closed railway lines
Stations
Closed
Rebuilt
These stations previously existed in slightly different locations, and/or at a higher or lower level (for example, originally at ground level then lowered into a cutting), to their modern-day counterparts. They may be considered the closed predecessors of today's stations.
Ardeer (August 1956) – on the Melton line (greater metropolitan line)
Boronia (1998) – on the Belgrave line; track lowered station rebuilt (with a significantly larger capacity than before the rebuild) lowered as part of grade separation under the intersection of Dorset/Boronia Roads. Surface areas and carpark now integrated with Boronia Junction Shopping Centre.
Bentleigh (11 June – 29 August 2016) – on the Frankston line; rebuilt as part of the level crossing removal works at North Road, McKinnon Road and Centre Road.
Box Hill (1983–1985) – on the Belgrave/Lilydale line; track lowered and station incorporated into Box Hill Central shopping centre.
Canterbury (19 June 1966) – on the Belgrave/Lilydale line; current high level station opened on 15 September 1968 and was completed and the Canterbury Road level crossing closed on 22 December 1968
Dandenong – Built 8 October 1887, upgraded in 1994–1995 – Change over for the Pakenham and Cranbourne Lines
Elsternwick (October 1960) – on the Sandringham line; grade separated to remove the level crossing and tram square at Glen Huntly Road.
Epping (29 November 1959) – terminus of the Epping line until 2012; current station opened on 30 November 1964
Fawkner (13 July 1903) – on the Upfield line; current station opened on 10 December 1906
Footscray 1900 – two separate stations for the Williamstown and Sunbury lines were merged into the current site
Flinders Street
Originally M |
https://en.wikipedia.org/wiki/Boulder%20Dash%20%28video%20game%29 | Boulder Dash is a 2D maze-puzzle video game released in 1984 by First Star Software for Atari 8-bit computers. It was created by Canadian developers Peter Liepa and Chris Gray. The player controls Rockford, who collects treasures while evading hazards.
Boulder Dash was ported to many 8-bit and 16-bit systems and turned into a coin-operated arcade game. It was followed by multiple sequels and re-releases and influenced games such as Repton and direct clones such as Emerald Mine.
As of January 2018, BBG Entertainment GmbH owns the intellectual property rights to Boulder Dash.
Gameplay
Boulder Dash takes place in a series of caves, each of which is laid out as rectangular grid of blocks. The player guides the player character, Rockford, with a joystick or cursor keys. In each cave, Rockford has to collect as many diamonds as are needed and avoid dangers, such as falling rocks. When enough diamonds have been collected, the exit door opens, and going through this exit door completes the cave.
Development
As an aspiring game developer, Peter Liepa reached out to a local publisher called Inhome Software. They put him in touch with a young man—Chris Gray—who had submitted a game programmed in BASIC that was not commercial quality, but had potential. The project began with the intention of converting this game to machine language and releasing it through Inhome, but according to Liepa, the game was very primitive. He decided to expand the concept and add more interesting dynamics, and he wrote the new version in Forth in about six months. When it became clear that the game was worth releasing, Liepa rewrote Boulder Dash in 6502 assembly language.
Dissatisfied with the lack of a contact from Inhome Software, Liepa searched for a new publisher He settled on First Star Software, which, according to him, was very happy to publish the game.
Ports
The game was licensed by Exidy for use with their Max-A-Flex arcade cabinet. Released in 1984, it allows buying 30 seconds of game time. This was the first home computer game to be converted to an arcade console.
Reception
II Computing said that "bright, colorful animation coupled with a breezy story line make this game more than just a momentary diversion". Computer Games magazine called it an "incredible addicting maze game" along the lines of Dig Dug, but faster and more exciting.
Mean Machines gave the Game Boy port of Boulder Dash a score of 90%, praising it as "one of the finest video games ever written", describing the game as "one to buy as soon as possible" and noting its faithfulness to the original Commodore 64 version. The same publication reviewed the NES version favourably, stating that it was "an extremely impressive title" and "one of the greatest games ever written". It was given a 92% rating.
The ZX Spectrum version was placed ninth in the Your Sinclair Top 100 Speccy Games Of All Time (Ever) by journalist Stuart Campbell.
IGN reviewed the Virtual Console release of the Commodore 64 versi |
https://en.wikipedia.org/wiki/Formula%20editor | A formula editor is a computer program that is used to typeset mathematical formulas and mathematical expressions.
Formula editors typically serve two purposes:
They allow word processing and publication of technical content either for print publication, or to generate raster images for web pages or screen presentations.
They provide a means for users to specify input to computational systems that is easier to read and check than plain text input and output from computational systems that is easy to understand or ready for publication.
Content for formula editors can be provided manually using a markup language,e.g. TeX or MathML, via a point-and-click GUI, or as computer generated results from symbolic computations such as Mathematica.
Typical features include the ability to nest fractions, radicals, superscripts, subscripts, overscripts and underscripts together with special characters such as mathematical symbols, arrows and scalable parentheses.
Some systems are capable of re-formatting formulae into simpler forms or to adjust line-breaking automatically, while preserving the mathematical meaning of a formula.
Available systems
See also
TeX, a typesetting system designed and mostly written by Donald Knuth
LaTeX, a document markup language and document preparation system for the TeX typesetting program
MathML, an application of XML for describing mathematical notations and capturing both its structure and content. It aims at integrating mathematical formulae into World Wide Web pages and other documents. It is a recommendation of the W3C math working group
References |
https://en.wikipedia.org/wiki/Charting%20application | A charting application is a computer program that is used to create a graphical representation (a chart) based on some non-graphical data that is entered by a user, most often through a spreadsheet application, but also through a dedicated specific scientific application (such as through a symbolic mathematics computing system, or a proprietary data collection application), or using an online spreadsheet service.
There are several online charting services available, the most popular one being the U.S. Department of Education's Institute of Education Sciences' NCES Chart.
See also
List of information graphics software
Charts |
https://en.wikipedia.org/wiki/Processor%20register | A processor register is a quickly accessible location available to a computer's processor. Registers usually consist of a small amount of fast storage, although some registers have specific hardware functions, and may be read-only or write-only. In computer architecture, registers are typically addressed by mechanisms other than main memory, but may in some cases be assigned a memory address e.g. DEC PDP-10, ICT 1900.
Almost all computers, whether load/store architecture or not, load items of data from a larger memory into registers where they are used for arithmetic operations, bitwise operations, and other operations, and are manipulated or tested by machine instructions. Manipulated items are then often stored back to main memory, either by the same instruction or by a subsequent one. Modern processors use either static or dynamic RAM as main memory, with the latter usually accessed via one or more cache levels.
Processor registers are normally at the top of the memory hierarchy, and provide the fastest way to access data. The term normally refers only to the group of registers that are directly encoded as part of an instruction, as defined by the instruction set. However, modern high-performance CPUs often have duplicates of these "architectural registers" in order to improve performance via register renaming, allowing parallel and speculative execution. Modern x86 design acquired these techniques around 1995 with the releases of Pentium Pro, Cyrix 6x86, Nx586, and AMD K5.
When a computer program accesses the same data repeatedly, this is called locality of reference. Holding frequently used values in registers can be critical to a program's performance. Register allocation is performed either by a compiler in the code generation phase, or manually by an assembly language programmer.
Size
Registers are normally measured by the number of bits they can hold, for example, an "8-bit register", "32-bit register", "64-bit register", or even more. In some instruction sets, the registers can operate in various modes, breaking down their storage memory into smaller parts (32-bit into four 8-bit ones, for instance) to which multiple data (vector, or one-dimensional array of data) can be loaded and operated upon at the same time. Typically it is implemented by adding extra registers that map their memory into a larger register. Processors that have the ability to execute single instructions on multiple data are called vector processors.
Types
A processor often contains several kinds of registers, which can be classified according to the types of values they can store or the instructions that operate on them:
User-accessible registers can be read or written by machine instructions. The most common division of user-accessible registers is a division into data registers and address registers.
s can hold numeric data values such as integer and, in some architectures, floating-point values, as well as characters, small bit arrays and other data. I |
https://en.wikipedia.org/wiki/EMachines | eMachines was a brand of economical personal computers. In 2004, it was acquired by Gateway, Inc., which was in turn acquired by Acer Inc. in 2007. The eMachines brand was discontinued in 2013.
History
eMachines was founded in September 1998 by Lap Shun Hui as a joint venture of South Korean companies Korea Data Systems and TriGem. The company sold PCs at prices of $399 or $499, all without a monitor.
By March 1999, the company was ranked fourth in U.S. computer sales, with a 9.9% market share.
In August 1999, the company released the eOne, a computer that resembled the iMac, priced at $799, with a $400 rebate for customers who signed a 3-year agreement with CompuServe.
In September 1999, the company announced plans to launch an internet service provider.
The business acquired Free-PC in November 1999, which had previously provided free computers in exchange for advertising.
In March 2000, at the peak of the dot-com bubble, the company became a public company via an initial public offering, raising $180 million. By that time, the company had sold 2 million computers, but had lost $84.5 million in the previous year on $815 million in sales and a 4% profit margin. Shares fell 8% in their debut. At that time, major shareholders included AOL with a 6.4% stake and Bill T. Gross with a 12.4% stake.
By May 2001, the stock was trading at 38 cents per share and the company was delisted from the NASDAQ.
In January 2002, Lap Shun Hui acquired the company for $161 million.
In December 2003, the company released the T6000 desktop, the world's first mass-marketed AMD Athlon 64-based system, retailing at US$1,299. The systems were primarily sold through Best Buy stores, but the PCs were also available online.
In January 2004, the company was the first to sell notebooks based on the AMD Mobile Athlon 64.
In March 2004, the company was acquired by Gateway Inc. for 50 million shares of Gateway common stock and $30 million cash. Wayne Inouye, CEO of eMachines, became CEO of Gateway, replacing founder Ted Waitt.
In October 2007, Acer Inc. acquired Gateway.
On January 17, 2013, the eMachines brand was discontinued.
References
Acer Inc.
Computer companies established in 1998
Computer companies disestablished in 2013
1998 establishments in California
2013 disestablishments in California
Defunct computer companies of the United States
Defunct companies based in California
Defunct computer hardware companies
Dot-com bubble
Gateway, Inc. |
https://en.wikipedia.org/wiki/Non-access%20stratum | Non-access stratum (NAS) is a functional layer in the NR, LTE, UMTS and GSM wireless telecom protocol stacks between the core network and user equipment.
This layer is used to manage the establishment of communication sessions and for maintaining continuous communications with the user equipment as it moves. The NAS is defined in contrast to the Access Stratum which is responsible for carrying information over the wireless portion of the network.
A further description of NAS is that it is a protocol for messages passed between the User Equipment, also known as mobiles, and Core Nodes (e.g. Mobile Switching Center, Serving GPRS Support Node, or Mobility Management Entity) that is passed transparently through the radio network. Examples of NAS messages include Update or Attach messages, Authentication Messages, Service Requests and so forth. Once the User Equipment (UE) establishes a radio connection, the UE uses the radio connection to communicate with the core nodes to coordinate service. The distinction is that the Access Stratum is for dialogue explicitly between the mobile equipment and the radio network and the NAS is for dialogue between the mobile equipment and core network nodes.
For LTE, the Technical Specification for NAS is 3GPP TS 24.301. For NR, the Technical Specification for NAS is TS 24.501.
+- – - – - -+ +- – - – - – -+
| HTTP | | Application |
+- – - – - -+ +- – - – - – -+
| TCP | | Transport |
+- – - – - -+ +- – - – - – -+
| IP | | Internet |
+- – - – - -+ +- – - – - – -+
| NAS | | Network |
+- – - – - -+ +- – - – - – -+
| AS | | Link |
+- – - – - -+ +- – - – - – -+
| Channels | | Physical |
+- – - – - -+ +- – - – - – -+
Functionality
The following functions exist in the non-access stratum:
Mobility management: maintaining connectivity and active sessions with user equipment as the user moves
Call control management
Session management: establishing, maintaining and terminating communication links
Identity management
See also
Mobility management
GSM
Communication protocol
Internet protocol suite
X.25 protocol suite
OSI protocol suite
3GPP TS 24.301 Non-Access-Stratum (NAS) protocol for Evolved Packet System (EPS); Stage 3
References
Mobile technology
Network protocols |
https://en.wikipedia.org/wiki/DWARF | DWARF is a widely used, standardized debugging data format. DWARF was originally designed along with Executable and Linkable Format (ELF), although it is independent of object file formats. The name is a medieval fantasy complement to "ELF" that had no official meaning, although the backronym "Debugging With Arbitrary Record Formats" has since been proposed.
History
The first version of DWARF proved to use excessive amounts of storage, and an incompatible successor, DWARF-2, superseded it and added various encoding schemes to reduce data size. DWARF did not immediately gain universal acceptance; for instance, when Sun Microsystems adopted ELF as part of their move to Solaris, they opted to continue using stabs, in an embedding known as "stabs-in-elf". Linux followed suit, and DWARF-2 did not become the default until the late 1990s.
The DWARF Workgroup of the Free Standards Group released DWARF version 3 in January 2006, adding (among other things) support for C++ namespaces, Fortran 90 data and additional compiler optimization techniques.
The DWARF committee published version 4 of DWARF, which offers "improved data compression, better description of optimized code, and support for new language features in C++", in 2010.
Version 5 of the DWARF format was published in February 2017. It "incorporates improvements in many areas: better data compression, separation of debugging data from executable files, improved description of macros and source files, faster searching for symbols, improved debugging of optimized code, as well as numerous improvements in functionality and performance."
Structure
DWARF uses a data structure called a Debugging Information Entry (DIE) to represent each variable, type, procedure, etc. A DIE has a tag (e.g., , , ) and attributes (key-value pairs). A DIE can have nested (child) DIEs, forming a tree structure. A DIE attribute can refer to another DIE anywhere in the tree—for instance, a DIE representing a variable would have a entry pointing to the DIE describing the variable's type.
To save space, two large tables needed by symbolic debuggers are represented as byte-coded instructions for simple, special-purpose finite state machines. The Line Number Table, which maps code locations to source code locations and vice versa, also specifies which instructions are part of function prologues and epilogues. The Call Frame Information table allows debuggers to locate frames on the call stack.
DWARF has been divided to different sections like .debug_info, .debug_frame, etc.
Further reading
Michael Eager, chair of the DWARF Standards Committee, has written an introduction to debugging formats and DWARF 3, Introduction to the DWARF Debugging Format.
References
External links
Libdwarf, a C library intended to simplify reading (and writing) applications using DWARF2, DWARF3.
elfutils, another C library for ELF/DWARF file processing.
How debuggers work: Part 3 - Debugging information
Debugging formats DWARF an |
https://en.wikipedia.org/wiki/Action%20semantics | Action semantics is a framework for the formal specification of semantics of programming languages invented by David Watt and Peter D. Mosses in the 1990s. It is a mixture of denotational, operational and algebraic semantics.
Action Semantics aims to be pragmatic. Action-Semantic Descriptions (ASDs) are designed to scale up to handle realistic programming languages. This is aided by the extensibility and modifiability of ASDs. This helps to ensure that extensions and changes do not require too many changes in the description. This is in contrast to the typical case when extending denotational or operational semantics, which may require reformulation of the entire description.
The Action Semantics framework was originally developed at the University of Aarhus and the University of Glasgow. Groups and individuals around the world have since contributed further to the approach.
Semantic entities
An important part of action semantics that gives it a modularity not seen in previous programming language semantics is the use of first-order semantic entities. First-order refers to how, unlike in denotational semantics, where a semantic function can be applied to another semantic function, in action semantics, a semantic entity cannot be applied to another semantic entity of its kind. Furthermore, the semantic entities utilized by action semantics broaden the framework’s ability to describe a programming language’s constructs by serving to denote both program behavior that is independent of any particular implementation and the way in which parts of a program influence the overall performance of the whole. The appropriately named action notation is employed to express the three types of semantic entities found in action semantics: actions, data, and yielders. The central semantic entity in this framework is actions, with data and yielders occupying supplementary roles. More specifically, actions are the mechanisms through which yielders and data are processed. An action, which can occur within another action, is a step-by-step representation of program behavior, where each step accesses current information, changes current information, or does both. Yielders appear within actions and only access current information. A yielder entity is capable of being evaluated, and when it is, the product is a datum entity.
Action entities
Action entities can directly represent programs’ semantics by describing possible program behaviors or represent, in a more indirect way, the impact that individual pieces of a program, like statements or expressions, have on the semantics of the program as a whole. They model computational behavior by indicating changes in state through their generation of new values from passed values. Specifically, an action accepts data passed to it via the current information — the transient data given to it, the bindings received by it, and the current state of storage — and, from this, gives new transient data, creates new bindings, update |
https://en.wikipedia.org/wiki/CD%2BG | CD+G (also known as CD-G, CD+Graphics and TV-Graphics) is an extension of the compact disc standard that can present low-resolution graphics alongside the audio data on the disc when played on a compatible device. CD+G discs are often used for karaoke machines, which use this functionality to present on-screen lyrics for the song contained on the disc. The CD+G specifications were published by Philips and Sony as an extension of the Red Book (CD standard) specifications.
The first CD to be released with CD+G graphics was Eat or Be Eaten by Firesign Theatre in 1985. The CD+EG is a similar format that allows for better graphics, but has very rarely been implemented in releases.
Design
The CD+G format takes advantage of the six Compact Disc subcode channels R through W (which are unused in standard Compact Disc Digital Audio), to provide 6 extra bits in CD+G for graphics information per 24 bytes of audio data. When a disc is read at normal speed, these six channels provide only 28.8 kbit/s for graphics, which is enough to provide primitive visuals but which is dwarfed by modern bitrates (for comparison see ).
In the CD+G system, 16-color (4-bit) raster graphics are constructed using tiled rendering with 6×12 pixel tiles (6 pixels wide and 12 lines high). These tiles are typically font definitions for text (such as for karaoke or info about the music). But the tiles can be used in any manner that tile rending permits, such as for fragments which combine together to represent a picture, or simply for patterns to decorate the background. These tiles are displayed in the main central 288×192 pixel area which is surrounded by a 1-tile thick border (for a total raster field of 300×216 pixels). The 16 colors are defined in a color table, which can be manipulated to change the color scheme and simulate primitive animations.
Instruction Set
The main instructions for manipulating graphics are:
Memory Preset: Set the screen to a particular color.
Border Preset: Set the border of the screen to a particular color.
Tile Block (Normal): Load a 12x6 tile, 2 color tile and display it normally.
Scroll Preset: Scroll the image, filling in the new area with a color.
Scroll Copy: Scroll the image, rotating the bits back around.
Define Transparent Color: Define a specific color as being transparent.
Load Color Table (entries 0-7): Load in the lower 8 entries of the color table.
Load Color Table (entries 8-15): Load in the upper 8 entries of the color table.
Tile Block (XOR): Load a 12x6 tile, 2 color tile and display it using the XOR method.
Improvements
Compact Disc + Extended Graphics (CD+EG, also known as CD+XG and Extended TV-Graphics) is an improved variant of the Compact Disc + Graphics (CD+G) format. Like CD+G, CD+EG utilizes basic audio CD features to display text and video information in addition to the music being played. This extra data is stored in the subcode channels R-W. Very few, if any, CD+EG discs have been published.
288 pixels per l |
https://en.wikipedia.org/wiki/Astrophysics%20Data%20System | The SAO/NASA Astrophysics Data System (ADS) is an online database of over 16 million astronomy and physics papers that are both from peer reviewed and non-peer reviewed sources. Abstracts are available online for free for almost all articles, and fully scanned articles are available in Graphics Interchange Format (GIF), and Portable Document Format (PDF) for older articles. It was developed by the National Aeronautics and Space Administration (NASA) and it is managed by the Smithsonian Astrophysical Observatory.
ADS is a powerful research tool with significant impact on the efficiency of astronomical research since it was started in 1992. Literature searches that would previously take days or weeks to retrieve the result, now take seconds via the ADS search engine, which is custom-built for astronomical needs. Studies have found that the monetary benefit to astronomy that the ADS saves is equivalent to several hundred million US dollars annually (2005).
ADS is used among astronomers worldwide, and therefore ADS usage statistics can be used to analyze global trends in astronomical research.
These studies have revealed that the amount of research an astronomer carries out is related to the per capita gross domestic product (GDP) of the country in which the scientist is based, and that the number of astronomers in a country is proportional to the GDP of that country. Consequently, the total amount of research done in a country is proportional to the square of its GDP divided by its population.
History
The importance of recording and classifying earlier astronomical knowledge and works was recognized in the 18th century, with Johann Friedrich Weidler publishing the first comprehensive history of astronomy in 1741 and the first astronomical bibliography in 1755. This effort was continued by Jérôme de La Lande, who published his Bibliographie astronomique in 1803, a work that covered the time from 480 B. C. to the year of publication. The Bibliographie générale de l’astronomie, Volume I and Volume II published by J.C. Houzeau and A. Lancaster in Brussels, followed in the 1882 to 1889 period.
As the number of astronomers and astronomical publications grew, bibliographical efforts became institutional tasks, first at the Observatoire Royal de Belgique, where the Bibliography of Astronomy was published from 1881 to 1898, and then at the Astronomischer Rechen-Institut in Heidelberg the yearly Astronomischer Jahresbericht was published from 1899 to 1968; after this date it was replaced by the Astronomy and Astrophysics Abstracts yearly book series which continued until the end of the 20th century.
During the 1980s, however, astronomers realized that the nascent technologies which formed the basis of the Internet could eventually be used to build an electronic indexing system of astronomical research papers, which could eventually allow astronomers to make extensive searches of the existing literature on any given research topic, as well as to keep ab |
https://en.wikipedia.org/wiki/LANL%20Research%20Library | The LANL Research Library is a research library at Los Alamos National Laboratory. It contains a substantial collection of books, journals, databases, patents along with technical reports. Additionally it offers literature searching, training, and outreach services. The library has a research and development (R&D) component, which works in areas such as open archives, recommendation systems (including visualization), emergency response information systems, and discovery systems. Its stated mission is to deliver effective and responsive knowledge services, thereby connecting people with information, technology, and resources. Its stated purpose (vision) is essential knowledge services for national security sciences.
Collections
The library houses some 150,000 volumes and 1.5 million unclassified reports on a wide variety of technical subjects pertaining to science, mathematics, and engineering.
There is also an associated online collection of physical science journals, and over 30 terabytes of data is stored locally. There is an abstract server with abstracts for papers submitted to peer reviewed journals prior to their acceptance and publication.
The LANL Research library has, in its collections, 10,000 journals with 150,000 bound journal volumes, and an additional 8,500 electronic journals. Its book collection contains 100,000 print titles, 150,000 print volumes, and an additional 30,000 electronic book titles. The library lists 35 subscription abstracting and index databases, along with an additional 100 open-access databases. Its locally loaded database contains more than 93 million records. 1,327 LANL patents are also listed, in PDF format.
Subject coverage of the electronic journals collection encompasses Agriculture, Astronomy & Astrophysics, Bioinformatics, Genetics, Chemistry, Computer Science, Defense/Military, Earth Sciences, Engineering, Environment, Government and Legal, Health and Safety, Humanities, Information and Library Science, International Affairs, Materials Science, Mathematics, Medicine, Nanotechnology, Physics, and Social Sciences.
The National Security Research Center (NSRC) contains additional documents, resources, and services specifically related to the Manhattan Project.
Public access
General public access is available. General access is permitted for the library's book and journal collections, the electronic databases, and the electronic books and journal articles that are available to the Lab. However, other restrictions apply.
References
Notes
External links
Los Alamos National Laboratory Research Library
National Security Research Center
Richard P. Feynman Center
Buildings and structures in Los Alamos County, New Mexico
American digital libraries
Libraries in New Mexico
Los Alamos National Laboratory |
https://en.wikipedia.org/wiki/4G | 4G is the fourth generation of broadband cellular network technology, succeeding 3G and preceding 5G. A 4G system must provide capabilities defined by ITU in IMT Advanced. Potential and current applications include amended mobile web access, IP telephony, gaming services, high-definition mobile TV, video conferencing, and 3D television.
However, in December 2010, the ITU expanded its definition of 4G to include Long Term Evolution (LTE), Worldwide Interoperability for Microwave Access (WiMAX), and Evolved High Speed Packet Access (HSPA+).
The first-release WiMAX standard was commercially deployed in South Korea in 2006 and has since been deployed in most parts of the world.
The first-release LTE standard was commercially deployed in Oslo, Norway, and Stockholm, Sweden in 2009, and has since been deployed throughout most parts of the world. However, it has been debated whether the first-release versions should be considered 4G. The 4G wireless cellular standard was defined by the International Telecommunication Union (ITU) and specifies the key characteristics of the standard, including transmission technology and data speeds.
Each generation of wireless cellular technology has introduced increased bandwidth speeds and network capacity. 4G has speeds of up to 150 Mbit/s download and 50 Mbit/s upload, whereas 3G had a peak speed of 7.2 Mbit/s download and 2 Mbit/s upload.
4G technology constitutes 58% of the worldwide mobile telecommunication technologies market.
Key Features and Advancements
Speed: 4G networks offer faster data download and upload speeds compared to 3G. Theoretically, 4G can achieve speeds of up to 100 megabits per second (Mbit/s) for high mobility communication and 1 gigabit per second (Gbit/s) for stationary users.
Latency: Reduced latency, resulting in more responsive user experiences.
Capacity: Enhanced network capacity allowing more simultaneous connections.
Advanced Antenna Techniques: Use of MIMO (Multiple Input Multiple Output) and beamforming for better signal quality and improved spectral efficiency.
Technical overview
In November 2008, the International Telecommunication Union-Radio communications sector (ITU-R) specified a set of requirements for 4G standards, named the International Mobile Telecommunications Advanced (IMT-Advanced) specification, setting peak speed requirements for 4G service at 100 megabits per second (Mbit/s)(=12.5 megabytes per second) for high mobility communication (such as from trains and cars) and 1 gigabit per second (Gbit/s) for low mobility communication (such as pedestrians and stationary users).
Since the first-release versions of Mobile WiMAX and LTE support much less than 1 Gbit/s peak bit rate, they are not fully IMT-Advanced compliant, but are often branded 4G by service providers. According to operators, a generation of the network refers to the deployment of a new non-backward-compatible technology. On December 6, 2010, ITU-R recognized that these two technologies, |
https://en.wikipedia.org/wiki/Language%20engineering | Language engineering involves the creation of natural language processing systems, whose cost and outputs are measurable and predictable. It is a distinct field contrasted to natural language processing and computational linguistics. A recent trend of language engineering is the use of Semantic Web technologies for the creation, archiving, processing, and retrieval of machine processable language data.
References
Natural language processing |
https://en.wikipedia.org/wiki/Spencer%20Kimball%20%28computer%20programmer%29 | Spencer Kimball is an American computer programmer, entrepreneur, and business executive. He is the CEO of Cockroach Labs, a company he co-founded in 2014. His work as a programmer includes creating GNU Image Manipulation Program (GIMP) while still in college, and assisting the source code development of CockroachDB, the namesake software of Cockroach Labs. In addition to Cockroach Labs, Kimball was involved in the founding of other tech startups including WeGo and Viewfinder.
Early life and education
Kimball attended the University of California at Berkeley. While still a student in 1995, he developed the first version of GNU Image Manipulation Program (GIMP) as a class project, along with his roommate Peter Mattis. Kimball was also a member of a student club at Berkeley called the eXperimental Computing Facility (XCF). During his time with XCF, he co-wrote the code for GIMP. Kimball said in 1999 that, "From the first line of source code to the last, GIMP was always my 'dues' paid to the free software movement. After using emacs, gcc, Linux, etc., I really felt that I owed a debt to the community which had, to a large degree, shaped my computing development." Kimball graduated with a B.A. in computer science from Berkeley in 1996.
Career
Kimball left college for work, and mostly ended his relationship with the GIMP development community. He co-founded WeGo, a company providing tools for building web communities, in 1998 and served as the company's co-CTO. While at XCF, he met Gene Kan, who was also a member, and the two would later begin working together on a file-sharing program for the Gnutella network, the open source Unix/Linux client gnubile. In 2000, he created a web-based version of GIMP, OnlinePhotoLab.com, that was short-lived. The technology was subsequently folded into Ofoto's online image manipulation tools.
Kimball started work with Google in Mountain View in 2002 and relocated to Google's New York offices in 2004. As one of Google's engineers, he helped spearhead Colossus, a new version of the Google File System. He also worked on the Google Servlet Engine.
In January 2012, Kimball launched the company Viewfinder along with Mattis and Brian McGinnis, formerly of Lehman Brothers. The company developed an app that allowed social media users to share photos, chat privately, and search photo history without leaving the app. The company was acquired by Square, Inc. in December 2013. Kimball moved to Square's New York City office where he became a senior member of the company's East Coast team.
While at Google, Kimball used a database known as Bigtable and followed the development of its next generation, known as Spanner. The database organizes data between thousands of servers to allow Google applications to stay online, even if an entire data center were to go offline. Kimball wanted to use this software but found there was nothing available outside of Google as either closed or open-source software with similar capabilities. He |
https://en.wikipedia.org/wiki/Bounds%20checking | In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before it is used. It is usually used to ensure that a number fits into a given type (range checking), or that a variable being used as an array index is within the bounds of the array (index checking). A failed bounds check usually results in the generation of some sort of exception signal.
As performing bounds checking during each use can be time-consuming, it is not always done. Bounds-checking elimination is a compiler optimization technique that eliminates unneeded bounds checking.
Range checking
A range check is a check to make sure a number is within a certain range; for example, to ensure that a value about to be assigned to a 16-bit integer is within the capacity of a 16-bit integer (i.e. checking against wrap-around). This is not quite the same as type checking. Other range checks may be more restrictive; for example, a variable to hold the number of a calendar month may be declared to accept only the range 1 to 12.
Index checking
Index checking means that, in all expressions indexing an array, the index value is checked against the bounds of the array (which were established when the array was defined), and if the index is out-of-bounds, further execution is suspended via some sort of error. Because reading or especially writing a value outside the bounds of an array may cause the program to malfunction or crash or enable security vulnerabilities (see buffer overflow), index checking is a part of many high-level languages.
Early compiled programming languages with index checking ability included ALGOL 60, ALGOL 68 and Pascal, as well as interpreted programming languages such as BASIC.
Many programming languages, such as C, never perform automatic bounds checking to raise speed. However, this leaves many off-by-one errors and buffer overflows uncaught. Many programmers believe these languages sacrifice too much for rapid execution. In his 1980 Turing Award lecture, C. A. R. Hoare described his experience in the design of ALGOL 60, a language that included bounds checking, saying:
A consequence of this principle is that every occurrence of every subscript of every subscripted variable was on every occasion checked at run time against both the upper and the lower declared bounds of the array. Many years later we asked our customers whether they wished us to provide an option to switch off these checks in the interest of efficiency on production runs. Unanimously, they urged us not to—they already knew how frequently subscript errors occur on production runs where failure to detect them could be disastrous. I note with fear and horror that even in 1980, language designers and users have not learned this lesson. In any respectable branch of engineering, failure to observe such elementary precautions would have long been against the law.
Mainstream languages that enforce run time checking include Ada, C#, Haskell, Java, JavaScr |
https://en.wikipedia.org/wiki/Extrapyramidal%20system | In anatomy, the extrapyramidal system is a part of the motor system network causing involuntary actions. The system is called extrapyramidal to distinguish it from the tracts of the motor cortex that reach their targets by traveling through the pyramids of the medulla. The pyramidal tracts (corticospinal tract and corticobulbar tracts) may directly innervate motor neurons of the spinal cord or brainstem (anterior (ventral) horn cells or certain cranial nerve nuclei), whereas the extrapyramidal system centers on the modulation and regulation (indirect control) of anterior (ventral) horn cells.
Extrapyramidal tracts are chiefly found in the reticular formation of the pons and medulla, and target lower motor neurons in the spinal cord that are involved in reflexes, locomotion, complex movements, and postural control. These tracts are in turn modulated by various parts of the central nervous system, including the nigrostriatal pathway, the basal ganglia, the cerebellum, the vestibular nuclei, and different sensory areas of the cerebral cortex. All of these regulatory components can be considered part of the extrapyramidal system, in that they modulate motor activity without directly innervating motor neurons.
The extrapyramidal tracts include parts of the following:
rubrospinal tract: Conflicts between the motor commands sent by the cerebrum and body position information provided by the proprioceptors cause the cerebellum to stimulate the red nucleus of the midbrain. The red nucleus then sends corrective commands to the spinal cord along the rubrospinal tract.
reticulospinal tract: connects the reticular system, a diffuse region of gray matter in the brain stem, to spinal cord.It also contributes to muscle tone and influences autonomic functions.
lateral vestibulospinal tract: Connects the brain stem nuclei of the vestibular system with the spinal cord. This allows posture, movement, and balance to be modulated on the basis of equilibrium information provided by the vestibular system.
tectospinal tract: This tract projects from the midbrain to the spinal cord and is important for postural movements that are driven by the superior colliculus.
See also
List of regions in the human brain
Extrapyramidal symptoms
Rabbit syndrome, a rare extrapyramidal side effect
Reticulospinal tract
Tectospinal tract
Vestibulospinal tract
References
Central nervous system
All articles with unsourced statements
Motor system |
https://en.wikipedia.org/wiki/K3b | K3b (from KDE Burn Baby Burn) is a CD, DVD and Blu-ray authoring application by KDE for Unix-like computer operating systems. It provides a graphical user interface to perform most CD/DVD burning tasks like creating an Audio CD from a set of audio files or copying a CD/DVD, as well as more advanced tasks such as burning eMoviX CD/DVDs. It can also perform direct disc-to-disc copies. The program has many default settings which can be customized by more experienced users. The actual disc recording in K3b is done by the command line utilities cdrecord or cdrkit, cdrdao, and growisofs. As of version 1.0, K3b features a built-in DVD ripper.
As is the case with most KDE applications, K3b is written in the C++ programming language and uses the Qt GUI toolkit. Released under the GNU General Public License, K3b is free software.
A first alpha of a KDE Platform 4 version of K3b was released on 22 April 2009, the second on 27 May 2009 and a third on 14 October 2009.
K3b is a software project that was started in 1998, and is one of the mainstays of the KDE desktop.
Features
Some of K3b's main features include:
Data CD/DVD burning;
Audio CD burning;
CD-Text support;
Blu-ray/DVD-R/DVD+R/DVD-RW/DVD+RW support;
CD-R/CD-RW support;
Mixed Mode CD (CD-DA and -ROM on one disc);
Multisession CD;
Video CD/Video DVD authoring;
eMovix CD/eMovix DVD;
Disk-to-disk CD and DVD copying;
Erasing Rewritable discs;
ISO image support;
Ripping Audio CDs, Video CDs, Video DVDs.
K3b can also burn data CDs that support Linux/Unix based OS, Windows, DOS, Very Large Files (UDF), Linux/Unix + Windows, Rock Ridge, and Joliet file systems.
K3b's full list of features (the below list could be still incomplete):
Creating data CDs:
Add files and folders to data CD project via drag and drop;
Remove files from your project, move files within your project;
Create empty directories within your project;
Write data CDs on-the-fly directly without an image file or with image file. It's also possible to just create the image file and write it to CD later;
Rockridge and Joliet file system support;
Rename files within the project;
Let K3b rename all the mp3/ogg files you add to your project to a common format like "artist - title.mp3;
For advanced users: support for nearly all the mkisofs options;
Verifying the burned data;
Support for multiple El-Torito boot images;
Multisession support.
Creating audio CDs:
Pluggable audio decoding. Plugins for WAV, mp3, FLAC, and Ogg Vorbis are included;
CD-Text support. Will automagically be filled in from tags in audio files;
Write audio CDs on-the-fly, without decoding audio files to wav before;
Normalize volume levels before writing;
Cut audio tracks at the beginning and the end.
Creating Video CDs:
VCD 1.1, 2.0, SVCD;
CD-i support (Version 4).
Creating mixed-mode CDs:
CD-Extra (CD-Plus, Enhanced Audio CD) support;
All data and audio project features.
Creating eMovix CDs.
CD Copying:
Copy single and multi session d |
https://en.wikipedia.org/wiki/Analytics | Analytics is the systematic computational analysis of data or statistics. It is used for the discovery, interpretation, and communication of meaningful patterns in data. It also entails applying data patterns toward effective decision-making. It can be valuable in areas rich with recorded information; analytics relies on the simultaneous application of statistics, computer programming, and operations research to quantify performance.
Organizations may apply analytics to business data to describe, predict, and improve business performance. Specifically, areas within analytics include descriptive analytics, diagnostic analytics, predictive analytics, prescriptive analytics, and cognitive analytics. Analytics may apply to a variety of fields such as marketing, management, finance, online systems, information security, and software services. Since analytics can require extensive computation (see big data), the algorithms and software used for analytics harness the most current methods in computer science, statistics, and mathematics. According to International Data Corporation, global spending on big data and business analytics (BDA) solutions is estimated to reach $215.7 billion in 2021. As per Gartner, the overall analytic platforms software market grew by $25.5 billion in 2020.
Analytics vs analysis
Data analysis focuses on the process of examining past data through business understanding, data understanding, data preparation, modeling and evaluation, and deployment. It is a subset of data analytics, which takes multiple data analysis processes to focus on why an event happened and what may happen in the future based on the previous data. Data analytics is used to formulate larger organizational decisions.
Data analytics is a multidisciplinary field. There is extensive use of computer skills, mathematics, statistics, the use of descriptive techniques and predictive models to gain valuable knowledge from data through analytics. There is increasing use of the term advanced analytics, typically used to describe the technical aspects of analytics, especially in the emerging fields such as the use of machine learning techniques like neural networks, decision trees, logistic regression, linear to multiple regression analysis, and classification to do predictive modeling. It also includes unsupervised machine learning techniques like cluster analysis, Principal Component Analysis, segmentation profile analysis and association analysis.
Applications
Marketing optimization
Marketing organizations use analytics to determine the outcomes of campaigns or efforts, and to guide decisions for investment and consumer targeting. Demographic studies, customer segmentation, conjoint analysis and other techniques allow marketers to use large amounts of consumer purchase, survey and panel data to understand and communicate marketing strategy.
Marketing analytics consists of both qualitative and quantitative, structured and unstructured data used to drive stra |
https://en.wikipedia.org/wiki/Printer | Printer may refer to:
Technology
Printer (publishing), a person or a company
Printer (computing), a hardware device
Optical printer for motion picture films
People
Nariman Printer (fl. c. 1940), Indian journalist and activist
James Printer (1640–1709), Native American from the Nipmuc tribe who worked as a printer in Cambridge, Massachusetts, U.S.
Casey Printers (born 1981), U.S. football player
Places
Printer, Kentucky, an unincorporated community and coal town in Floyd County, Kentucky, U.S.
Printer's Alley, an alley in downtown Nashville, Tennessee, U.S., that was historically home to multiple publishers
Printer's Park, a small park in the Bronx, New York City, U.S.
See also
The Moscow subway station Pechatniki, whose name means "Printers" |
https://en.wikipedia.org/wiki/IRC%20services | Internet Relay Chat services (usually called IRC services) is a name for a set of features implemented on many modern Internet Relay Chat networks. Services are automated bots with special status which are generally used to provide users with access with certain privileges and protection. They usually implement some sort of login system so that only people on the access control list can obtain these services.
Components
The most popular style of services uses a number of fake clients whose names end in "Serv". The four below are nearly always seen in services of this style.
ChanServ, a channel service bot, is used to protect channel operators and help run the channel. This is convenient for the operators because they do not need to have an operator on the channel all of the time to keep their status.
NickServ, a nickname service bot, is used to register and protect user nicknames.
MemoServ, a memo service bot, is used to record and deliver messages to users who are currently offline.
OperServ is used by IRC operators to perform administrative functions. Also known as AdminServ, RootServ, or OpServ (srvx).
Some others are also seen following this naming convention in some services packages including:
BotServ, a bot which allows channel operators to assign bots to their channels. These bots are mostly a ChanServ representative in the channel.
HelpServ, the help service bot, is used to provide help on a variety of IRC topics.
HostServ, a host service bot, is used to allow general users to register a vhost so that their real IP address on IRC is hidden.
RootServ, used on specific networks, is utilized by Services Root Administrators to perform Root Administrative functions for the IRC Network and Services Program.
SpamServ, used to protect channels against spam.
StatServ, a statistic services bot, is used to perform various statistical analysis on the IRC Network.
Other commonly used services bots:
Global, a message agent, is a specific service that is used to send global messages via services. This agent is usually given a global IRC Operator status as to be able to perform the function. This service must be on a U-lined server so it has the ability to spoof nicknames. This service is often renamed to the name of the network (e.g. DalNet or Xevium.).
History
The original NickServ was written by Armin Gruner at the Technical University of Munich in 1990. The original intention was to give out friendly warnings that somebody else already likes to use a specific nickname, since the IRC protocol has no built-in provision to protect electronic identities.
NoteServ and MsgServ followed up soon after the introduction of NickServ, and had a similar job to today's MemoServ.
It was considered acceptable behavior simply to /ignore NickServ's notices, but an operator decided to /kill NickServ and use the nickname NickServ himself, subsequently collecting all identify passwords from users and being amused by that.
This led to a public debat |
https://en.wikipedia.org/wiki/User-Agent%20header | In computing, the User-Agent header is an HTTP header intended to identify the user agent responsible for making a given HTTP request. Whereas the character sequence User-Agent comprises the name of the header itself, the header value that a given user agent uses to identify itself is colloquially known as its user agent string. The user agent for the operator of a computer used to access the Web has encoded within the rules that govern its behavior the knowledge of how to negotiate its half of a request-response transaction; the user agent thus plays the role of the client in a client–server system. Often considered useful in networks is the ability to identify and distinguish the software facilitating a network session. For this reason, the User-Agent HTTP header exists to identify the client software to the responding server.
Use in client requests
When a software agent operates in a network protocol, it often identifies itself, its application type, operating system, device model, software vendor, or software revision, by submitting a characteristic identification string to its operating peer. In HTTP, SIP, and NNTP protocols, this identification is transmitted in a header field User-Agent. Bots, such as Web crawlers, often also include a URL and/or e-mail address so that the Webmaster can contact the operator of the bot.
In HTTP, the "user agent string" is often used for content negotiation, where the origin server selects suitable content or operating parameters for the response. For example, the user agent string might be used by a web server to choose variants based on the known capabilities of a particular version of client software. The concept of content tailoring is built into the HTTP standard in RFC 1945 "for the sake of tailoring responses to avoid particular user agent limitations".
The user agent string is one of the criteria by which Web crawlers may be excluded from accessing certain parts of a website using the Robots Exclusion Standard (robots.txt file).
As with many other HTTP request headers, the information in the user agent string contributes to the information that the client sends to the server, since the string can vary considerably from user to user.
Format for human-operated web browsers
The user agent string format is currently specified by section 10.1.5 of HTTP Semantics. The format of the user agent string in HTTP is a list of product tokens (keywords) with optional comments. For example, if a user's product were called WikiBrowser, their user agent string might be WikiBrowser/1.0 Gecko/1.0. The "most important" product component is listed first.
The parts of this string are as follows:
product name and version (WikiBrowser/1.0)
layout engine and version (Gecko/1.0)
During the first browser war, many web servers were configured to send web pages that required advanced features, including frames, to clients that were identified as some version of Mozilla only. Other browsers were considered to be |
https://en.wikipedia.org/wiki/IBM%207950%20Harvest | The IBM 7950, also known as Harvest, was a one-of-a-kind adjunct to the Stretch computer which was installed at the United States National Security Agency (NSA). Built by IBM, it was delivered in 1962 and operated until 1976, when it was decommissioned. Harvest was designed to be used for cryptanalysis.
Development
In April 1958, the final design for the NSA-customized version of IBM's Stretch computer had been approved, and the machine was installed in February 1962. The design engineer was James H. Pomerene, and it was built by IBM in Poughkeepsie, New York. Its electronics (fabricated of the same kind of discrete transistors used for Stretch) were physically about twice as big as the Stretch to which it was attached. Harvest added a small number of instructions to Stretch, and could not operate independently.
An NSA-conducted evaluation found that Harvest was more powerful than the best commercially available machine by a factor of 50 to 200, depending on the task.
Architecture
The equipment added to the Stretch computer consisted of the following special peripherals:
IBM 7951 — Stream coprocessor
IBM 7952 — High performance core storage
IBM 7955 — Magnetic tape system, also known as TRACTOR
IBM 7959 — High speed I/O exchange
With the stream processing unit, Harvest was able to process 3 million characters a second.
The TRACTOR tape system, part of the HARVEST system, was unique for its time. It included six tape drives, which handled tape in cartridges, along with a library mechanism that could fetch a cartridge from a library, mount it on a drive, and return it to the library. The transfer rates and library mechanism were balanced in performance such that the system could read two streams of data from tape, and write a third, for the entire capacity of the library, without any time wasted for tape handling.
Programming
Harvest's most important mode of operation was called "setup" mode, in which the processor was configured with several hundred bits of information and the processor then operated by streaming data from memory — possibly taking two streams from memory — and writing a separate stream back to memory. The two byte streams could be combined, used to find data in tables, or counted to determine the frequency of various values. A value could be anything from 1 to 16 contiguous bits, without regard to alignment, and the streams could be as simple as data laid out in memory, or data read repeatedly, under the control of multiply-nested "do"-loop descriptors, which were interpreted by the hardware.
Two programming languages, Alpha and Beta (not be confused with Simula-inspired BETA programming language) were designed for programming it, and IBM provided a compiler for the former around the time the machine was delivered.
Usage
One purpose of the machine was to search text for key words from a watchlist. From a single foreign cipher system, Harvest was able to scan over seven million decrypts for any occurrences of over |
https://en.wikipedia.org/wiki/Micron%20Technology | Micron Technology, Inc. is an American producer of computer memory and computer data storage including dynamic random-access memory, flash memory, and USB flash drives. It is headquartered in Boise, Idaho. Its consumer products, including the Ballistix line of memory modules, are marketed under the Crucial brand. Micron and Intel together created IM Flash Technologies, which produced NAND flash memory. It owned Lexar between 2006 and 2017.
History
1978–1999
Micron was founded in Boise, Idaho, in 1978 by Ward Parkinson, Joe Parkinson, Dennis Wilson, and Doug Pitman as a semiconductor design consulting company. Startup funding was provided by local Idaho businessmen Tom Nicholson, Allen Noble, Rudolph Nelson, and Ron Yanke. Later it received funding from Idaho billionaire J. R. Simplot, whose fortune was made in the potato business. In 1981, the company moved from consulting to manufacturing with the completion of its first wafer fabrication unit ("Fab 1"), producing 64K DRAM chips.
In 1984, the company went public.
In 1994, founder Joe Parkinson retired as CEO and Steve Appleton took over as Chairman, President, and CEO.
A 1996 3-way merger among ZEOS International, Micron Computer, and Micron Custom Manufacturing Services (MCMS) increased the size and scope of the company; this was followed rapidly with the 1997 acquisition of NetFrame Systems, in a bid to enter the mid-range server industry.
2000–present
In 2000, Gurtej Singh Sandhu and Trung T. Doan at Micron initiated the development of atomic layer deposition high-k films for DRAM memory devices. This helped drive cost-effective implementation of semiconductor memory, starting with 90 nm node DRAM. Pitch double-patterning was also pioneered by Gurtej Singh Sandhu at Micron during the 2000s, leading to the development of 30-nm class NAND flash memory, and it has since been widely adopted by NAND flash and RAM manufacturers worldwide.
Micron and Intel created a joint venture in 2005, based in IM Flash Technologies in Lehi, Utah. The two companies formed another joint venture in 2011, IM Flash Singapore, in Singapore. In 2012, Micron became sole owner of this second joint venture.
In 2006, Micron acquired Lexar, an American manufacturer of digital media products.
The company again changed leadership in June 2007 with COO Mark Durcan becoming president.
In 2008, Micron converted the Avezzano chip fab, formerly a Texas Instruments DRAM fab, into a production facility for CMOS image sensors sold by Aptina Imaging.
In 2008, Micron spun off Aptina Imaging, which was acquired by ON Semiconductor in 2014. Micron retained a stake in the spinoff. The core company suffered setbacks, however, requiring layoffs of 15 percent of its workforce in October 2008, during which period the company also announced the purchase of Qimonda's 35.6% stake in Inotera Memories for $400 million. The trend of layoffs and acquisitions continued in 2009 with the termination of an additional 2,000 employees, and the |
https://en.wikipedia.org/wiki/Communication%20source | A source or sender is one of the basic concepts of communication and information processing. Sources are objects which encode message data and transmit the information, via a channel, to one or more observers (or receivers).
In the strictest sense of the word, particularly in information theory, a source is a process that generates message data that one would like to communicate, or reproduce as exactly as possible elsewhere in space or time. A source may be modelled as memoryless, ergodic, stationary, or stochastic, in order of increasing generality.
Communication Source combines Communication and Mass Media Complete and Communication Abstracts to provide full-text access to more than 700 journals, and indexing and abstracting for more than 1,000 core journals. Coverage dating goes back to 1900.
Content is derived from academic journals, conference papers, conference proceedings, trade publications, magazines and periodicals.
A transmitter can be either a device, for example, an antenna, or a human transmitter, for example, a speaker. The word "transmitter" derives from an emitter, that is to say, that emits using the Hertzian waves.
In sending mail it also refers to the person or organization that sends a letter and whose address is written on the envelope of the letter.
In finance, an issuer can be, for example, the bank system of elements.
In education, an issuer is any person or thing that gives knowledge to the student, for example, the professor.
For communication to be effective, the sender and receiver must share the same code. In ordinary communication, the sender and receiver roles are usually interchangeable.
Depending on the language's functions, the issuer fulfills the expressive or emotional function, in which feelings, emotions, and opinions are manifested, such as The way is dangerous.
In economy
In the economy, the issuer is a legal entity, foundation, company, individual firm, national or foreign governments, investment companies or others that develop, register and then trade commercial securities to finance their operations. The issuers are legally responsible for the issues in question and for reporting the financial conditions, materials developed and whatever their operational activities required by the regulations within their jurisdictions.
See also
Common technical regulation
CALM M5
References
Source
Information theory |
https://en.wikipedia.org/wiki/Railway%20Construction%20Act | The was promulgated by the Diet of Japan on June 21, 1892, and designated government support for a network of thirty-three railway lines covering most of Japan, with the exception of Hokkaidō. On April 11, 1922, the Diet amended the law to add an additional network of regional and local routes. Today, these lines form the backbone of the national railway network, JR (although JR has relinquished control of some of the more minor ones).
Lines designated by the Act of 1892
Notable main lines before the Act
The lines listed below were not covered by the act, since they were already built by that time.
Tokyo — Gotenba — Nagoya — Gifu — Maibara — Kusatsu — Kyoto — Osaka — Kōbe (Tōkaidō Main Line)
Tokyo — Hachiōji (Chūō Main Line as Chūō Line Rapid)
Takasaki — Shinonoi — Nagano — Toyono — Naoetsu (Shin’etsu Main Line)
Maibara — Tsuruga (Hokuriku Main Line)
Ōmiya — Takasaki — Maebashi (Takasaki Line)
Tokyo — Ōmiya — Shirakawa — Fukushima — Iwanuma — Sendai — Kogota — Kitakami — Morioka — Aomori (Tōhoku Main Line)
Tokyo — Mito (Jōban Line)
Nagoya — Kameyama — Tsuge — Kusatsu (Kansai Main Line and Kusatsu line)
Osaka — Ōji — Nara (Tōkaidō Main Line and Nara Line)
Ōji — Takada
Kōbe — Himeji — Okayama — Mihara
Marugame — Tadotsu — Kotohira
Moji — Kokura — Hakata — Tosu — Kurume — Ōmuta — Kumamoto
Tosu — Saga
Wakamatsu — Iizuka
See also
Railway Nationalization Act
History of rail transport in Japan
Rail transport in Japan
Japanese legislation
1892 in law
Empire of Japan
1892 in Japan
Railway legislation
History of rail transport in Japan
1892 in rail transport |
https://en.wikipedia.org/wiki/Burst%20mode | Burst mode may refer to:
Science and technology
Burst mode (computing), a data transmission mode
Burst mode (weapon), a firing mode
Burst mode (photography), a camera mode
Bursting or burst mode, a mode in neurons
Other uses
Burst mode, a type of creature in Digimon Data Squad in the Digimon fictional universe |
https://en.wikipedia.org/wiki/Japanese%20National%20Railways | The abbreviated JNR or , was the business entity that operated Japan's national railway network from 1949 to 1987.
Network
Railways
As of June 1, 1949, the date of establishment of JNR, it operated of narrow gauge () railways in all 46 prefectures of Japan. This figure expanded to in 1981 (excluding Shinkansen), but later reduced to as of March 31, 1987, the last day of JNR.
JNR operated both passenger and freight services.
Shinkansen
Shinkansen, the world's first high-speed railway was debuted by JNR in 1964. By the end of JNR in 1987, four lines were constructed:
Tōkaidō Shinkansen , completed in 1964
Sanyō Shinkansen , completed in 1975
Tōhoku Shinkansen , as of 1987
Jōetsu Shinkansen , completed in 1982
Buses
JNR operated bus lines as feeders, supplements or substitutions of railways. Unlike railway operation, JNR Bus was not superior to other local bus operators. The JR Bus companies are the successors of the bus operation of JNR.
Ships
JNR operated ferries to connect railway networks separated by sea or to meet other local demands:
Kanmon Ferry (discontinued in 1964) Shimonoseki Station (Shimonoseki, Yamaguchi) – Mojikō Station (Kitakyūshū, Fukuoka)
Miyajima Ferry Miyajimaguchi Station (Ōno, Hiroshima) – Miyajima Station (Miyajima, Hiroshima)
Nihori Ferry (discontinued in 1982) Nigata Station (Kure, Hiroshima) – Horie Station (Matsuyama, Ehime)
Ōshima Ferry (discontinued in 1976) Ōbatake Station (Yanai, Yamaguchi) – Komatsukō Station (Suō-Ōshima, Yamaguchi)
Seikan Ferry Aomori Station (Aomori, Aomori) – Hakodate Station (Hakodate, Hokkaidō)
Ukō Ferry Uno Station (Tamano, Okayama) – Takamatsu Station (Takamatsu, Kagawa)
Out of three routes assigned to JR companies in 1987, only the Miyajima Ferry remains active as of 2023.
Unions
A number of unions represented workers at JNR, including the National Railway Workers' Union (Kokuro), the National Railway Locomotive Engineers' Union (Doro), and Doro-Chiba, a break-away group from Doro.
History
The term Kokuyū Tetsudō "state-owned railway" originally referred to a network of railway lines operated by 17 private companies that were nationalized following the Railway Nationalization Act of 1906 and placed under the control of the Railway Institute. Later, the Ministry of Railways and the Ministry of Transportation and Communications took over control of the network. The ministries used the name Japanese Government Railways (JGR) to refer their network in English. During World War II, many JGR lines were dismantled to supply steel for the war effort.
On June 1, 1949, by a directive of the U.S. General HQ in Tokyo, JGR was reorganized into Japanese National Railways, a state-owned public corporation. JNR enjoyed many successes, including the inauguration of high-speed Shinkansen service along the Tōkaidō Shinkansen line on October 1, 1964. However, JNR was not a state-run corporation; its accounting was independent from the national budget. Rural sections without enough pass |
https://en.wikipedia.org/wiki/Single-pair%20high-speed%20digital%20subscriber%20line | Single-pair high-speed digital subscriber line (SHDSL) is a form of symmetric digital subscriber line (SDSL), a data communications technology for equal transmit and receive (i.e. symmetric) data rate over copper telephone lines, faster than a conventional voiceband modem can provide. As opposed to other DSL technologies, SHDSL employs trellis-coded pulse-amplitude modulation (TC-PAM). As a baseband transmission scheme, TC-PAM operates at frequencies that include those used by the analog voice plain old telephone service (POTS). As such, a frequency splitter, or DSL filter, cannot be used to allow a telephone line to be shared by both an SHDSL service and a POTS service at the same time. Support of symmetric data rates made SHDSL a popular choice by businesses for private branch exchange (PBX), virtual private network (VPN), web hosting and other data services.
SHDSL features symmetrical data rates in both the upstream and downstream directions, from 192 kbit/s to 2,312 kbit/s of payload in 8 kbit/s increments for one pair and 384 kbit/s to 4,624 kbit/s in 16 kbit/s increments for two pairs of wires. The reach varies according to the loop rate and noise conditions (more noise or higher rate means decreased reach) and may be up to 3,000 meters. The two pair feature may alternatively be used for increased reach applications by keeping the data rate low. Halving the data rate per pair will provide similar speeds to single pair lines while increasing the error/noise tolerance.
With the 32-TC-PAM modulation scheme described in Annexes F and G, symmetric data rates of up to 5,696 kbit/s are permitted on one pair in the optional extended SHDSL mode. Up to four pairs of wires may be bonded using M-pair bonding to produce data rates as high as M5,696 kbit/s. By using four bonded wire pairs, a single SHDSL interface can transmit up to 22,784 kbit/s.
The SHDSL payload may be either 'clear channel' (unstructured), T1 or E1 (full rate or fractional), multiple ISDN Basic Rate Interface (BRI), Asynchronous Transfer Mode (ATM) cells or Ethernet packets. A 'dual bearer' mode allows a mixture of two separate streams (e.g. T1 and ATM) to share the SHDSL bandwidth.
SHDSL standards
The industry standard for SHDSL is defined by ITU-T recommendation G.991.2. This was first published in February 2001. SHDSL equipment is also known by the standard's draft name of G.SHDSL. Major updates to G.991.2 were released in December 2003. Equipment conforming to the 2003 version of G.991.2 is often referred to by the standard's draft name of G.SHDSL.bis or just SHDSL.bis. The updated G.991.2 features:
Optional support for up to four copper pair connections (M-pair)
Optional extensions to allow user data rates up to 5696 kbit/s per pair, described in Annexes F and G
Optional support for dynamic rate repartitioning, allowing flexible change of the SHDSL data rate without service interruption, described in Annex E.10.3
New payload definitions including Ethernet packet transfe |
https://en.wikipedia.org/wiki/List%20of%20wiki%20software |
Standard wiki programs, by programming language
JavaScript-based
TiddlyWiki is a HTML-JavaScript-based server-less wiki in which the entire site/wiki is contained in a single file, or as a Node.js-based wiki application. It is designed for maximum customization possibilities.
Wiki.js is an open-source, Node.js-based wiki application using git as the back end storage mechanism and automatically syncs with any git repository. It provides a visual Markdown editor with assets management, authentication system and a built-in search engine.
Java-based
XWiki is a free wiki software platform written in Java with a design emphasis on extensibility. XWiki is an enterprise wiki engine with a complete wiki feature set (version control, attachments, etc.) and a database engine and programming language which allows database driven applications to be created using the wiki interface.
Perl-based
Foswiki is a structured wiki, typically used to run a collaboration platform, knowledge or document management system a knowledge based, or team portal. is a structured wiki, which enables users to create "wiki applications".
ikiwiki, a "wiki compiler" - can use Subversion or git as the back end storage mechanism. ikiwiki converts wiki pages into HTML pages suitable for publishing on a website.
TWiki is a flexible, powerful, secure, simple Enterprise wiki and application platform. is a structured wiki, typically used to run a project development space, a document management system, a knowledge base, or any other groupware tool. Also available as a VMware appliance.
UseModWiki is a wiki software written in Perl and licensed under General Public License. Created by Clifford Adams in 2000, it is a clone of AtisWiki.
WikiWikiWeb, the first wiki and its associated software.
PHP-based
BookStack is released under the MIT License. It uses the ideas of books to organize pages and store information.
DokuWiki is a wiki application licensed under GPLv2 and written in PHP. It is aimed at the documentation needs of a small company. DokuWiki was built for small companies and organizations that need a simple way to manage information, build knowledge bases and collaborate. It uses plain text files and has a simple but powerful syntax which ensures the datafiles remain readable outside the wiki.
MediaWiki is a free and open-source wiki software package written in PHP. It serves as the platform for Wikipedia and the other Wikimedia projects. MediaWiki is used for projects run by the Wikimedia Foundation, which operates Wikipedia. It is also publicly available for use in other wikis, and has widespread popularity among smaller, non-Wikimedia wikis. MediaWiki is a free and open-source wiki software. It was developed for use on Wikipedia in 2002, and given the name "MediaWiki" in 2003.
Semantic MediaWiki lets you store and query data within the wiki's pages like a database. It is also designed to ease and combine collaborative authoring within a wiki with semantic techn |
https://en.wikipedia.org/wiki/Axiom%20%28computer%20algebra%20system%29 | Axiom is a free, general-purpose computer algebra system. It consists of an interpreter environment, a compiler and a library, which defines a strongly typed hierarchy.
History
Two computer algebra systems named Scratchpad were developed by IBM. The first one was started in 1965 by James Griesmer at the request of Ralph Gomory, and written in Fortran. The development of this software was stopped before any public release. The second Scratchpad, originally named Scratchpad II, was developed from 1977 on, at Thomas J. Watson Research Center, under the direction of Richard Dimick Jenks.
The design is principally due to Richard D. Jenks (IBM Research), James H. Davenport (University of Bath), Barry M. Trager (IBM Research), David Y.Y. Yun (Southern Methodist University) and Victor S. Miller (IBM Research). Early consultants on the project were David Barton (University of California, Berkeley) and James W. Thatcher (IBM Research). Implementation included Robert Sutor (IBM Research), Scott C. Morrison (University of California, Berkeley), Christine J. Sundaresan (IBM Research), Timothy Daly (IBM Research), Patrizia Gianni (University of Pisa), Albrecht Fortenbacher (Universitaet Karlsruhe), Stephen M. Watt (IBM Research and University of Waterloo), Josh Cohen (Yale University), Michael Rothstein (Kent State University), Manuel Bronstein (IBM Research), Michael Monagan (Simon Fraser University), Jonathan Steinbach (IBM Research), William Burge (IBM Research), Jim Wen (IBM Research), William Sit (City College of New York), and Clifton Williamson (IBM Research)
Scratchpad II was renamed Axiom when IBM decided, circa 1990, to make it a commercial product. A few years later, it was sold to NAG. In 2001, it was withdrawn from the market and re-released under the Modified BSD License. Since then, the project's lead developer has been Tim Daly.
In 2007, Axiom was forked twice, originating two different open-source projects: OpenAxiom and FriCAS, following "serious disagreement about project goals". The Axiom project continued to be developed by Tim Daly.
The current research direction is "Proving Axiom Sane", that is, logical, rational, judicious, and sound.
Documentation
Axiom is a literate program. The source code is becoming available in a set of volumes which are available on the axiom-developer.org website. These volumes contain the actual source code of the system.
The currently available documents are:
Combined Table of Contents
Volume 0: Axiom Jenks and Sutor—The main textbook
Volume 1: Axiom Tutorial—A simple introduction
Volume 2: Axiom Users Guide—Detailed examples of domain use (incomplete)
Volume 3: Axiom Programmers Guide—Guided examples of program writing (incomplete)
Volume 4: Axiom Developers Guide—Short essays on developer-specific topics (incomplete)
Volume 5: Axiom Interpreter—Source code for Axiom interpreter (incomplete)
Volume 6: Axiom Command—Source code for system commands and scripts (incomplete)
Volume 7: Axiom Hy |
https://en.wikipedia.org/wiki/Miner%202049er | Miner 2049er is a platform game developed for the Atari 8-bit family of home computers by Bill Hogue and released by his company, Big Five Software, in 1982. The player controls Bounty Bob through multiple levels of a mine, with the goal of traversing all of the platforms while avoiding or defeating enemy mutants. At a time when "climbing games" such as Donkey Kong had four screens, Miner 2049er had ten.
The game was Hogue's first for the Atari 8-bit line, and his first in color, following a string of games for the black-and-white TRS-80. It shipped on a custom 16 kilobyte ROM cartridge compared to the standard 8 kilobyte Atari computer cartridges. The game was ported to the TI-99/4A, IBM PC compatibles, Apple II, Commodore 64, and VIC-20 computers as well the Atari 2600, Atari 5200, ColecoVision, and Super Cassette Vision consoles. The Atari 2600 version was split into two separate releases, each containing three levels.
Miner 2049er received positive press throughout 1983, appearing on best-of lists, with critics complimenting its colors, game design, and originality. The game influenced other platform games of the 1980s, such as Manic Miner. Video magazine's editors commented on the game's popularity in January 1984, declaring it "the most widely played home electronic game of all time" and that "no home-arcade title has had the impact" that Miner 2049er had. While the game received positive reviews in retrospectives from IGN and AllGame, Richard Stanton, in his book A Brief History of Video Games (2015), stated that Miner 2049er ended up mostly forgotten in the wake of Super Mario Bros. (1985).
An Apple II-only sequel, Miner2049er II, was published in 1984. An Atari 8-bit sequel by Hogue, Bounty Bob Strikes Back!, was released in 1985.
Gameplay
Miner 2049er features Bounty Bob, who has chased an evil miner into a series of uranium mines. To complete a stage, Bob must survey the mine by moving left and right across every part of the floor of each level. The levels are full of hazards, including gaps in platforms, slides, radioactive waste, and mutants. The mutants can kill Bob by touching him, but they can be defeated if Bob collects prospecting gear, such as candles and drills, and then touches the mutants. Other game elements include lifts, cannons, and transporters, which can rapidly move Bob to different parts of the screen.
The original and Atari 5200 versions of the game have ten levels, but this varies in the ports. The Atari 2600 version has three (and there is a Volume II cartridge with three more), ColecoVision has eleven, and the TI-99/4A has eight.
Development
Miner 2049er was programmed by Bill Hogue of Big Five Software of Van Nuys, California.
The game was Hogue's first for Atari computers, following games he developed for TRS-80 computers. His team chose to develop for the Atari system, as they felt it was the best combination of graphics and sound. The graphics and audio in the game are credited to Curtis A. Mikolyski |
https://en.wikipedia.org/wiki/Codd%27s%2012%20rules | Codd's twelve rules are a set of thirteen rules (numbered zero to twelve) proposed by Edgar F. Codd, a pioneer of the relational model for databases, designed to define what is required from a database management system in order for it to be considered relational, i.e., a relational database management system (RDBMS). They are sometimes referred to as "Codd's Twelve Commandments".
History
Codd originally set out the rules in 1970, and developed them further in a 1974 conference paper. His aim was to prevent the vision of the original relational database from being diluted, as database vendors scrambled in the early 1980s to repackage existing products with a relational veneer. Rule 12 was particularly designed to counter such a positioning.
While in 1999, a textbook stated "Nowadays, most RDBMSs ... pass the test". another in 2007 suggested "no database system complies with all twelve rules." Codd himself, in his book "The Relational Model for Database Management: Version 2", acknowledged that while his original set of 12 rules can be used for coarse distinctions, the 333 features of his Relational Model Version 2 (RM/V2) are needed for distinctions of a finer grain.
Rules
Rule 0: The foundation rule:
For any system that is advertised as, or claimed to be, a relational data base management system, that system must be able to manage data bases entirely through its relational capabilities.
Rule 1: The information rule:
All information in a relational data base is represented explicitly at the logical level and in exactly one way by values in tables.
Rule 2: The guaranteed access rule:
Each and every datum (atomic value) in a relational data base is guaranteed to be logically accessible by resorting to a combination of table name, primary key value and column name.
Rule 3: Systematic treatment of null values:
Null values (distinct from the empty character string or a string of blank characters and distinct from zero or any other number) are supported in fully relational DBMS for representing missing information and inapplicable information in a systematic way, independent of data type.
Rule 4: Dynamic online catalog based on the relational model:
The data base description is represented at the logical level in the same way as ordinary data, so that authorized users can apply the same relational language to its interrogation as they apply to the regular data.
Rule 5: The comprehensive data sublanguage rule:
A relational system may support several languages and various modes of terminal use (for example, the fill-in-the-blanks mode). However, there must be at least one language whose statements are expressible, per some well-defined syntax, as character strings and that is comprehensive in supporting all of the following items:
Data definition.
View definition.
Data manipulation (interactive and by program).
Integrity constraints.
Authorization.
Transaction boundaries (begin, commit and rollback).
Rule 6: The view updating rule:
All views |
https://en.wikipedia.org/wiki/Fujitsu%20Lifebook | Lifebook is a line of laptop computers made by Fujitsu, which also offers a range of notebooks and tablet PCs within the same Lifebook family.
History
In partnership with Poqet Computer Corporation, Fujitsu launched the world's first hand-held, one-pound, IBM/PC-XT-compatible computer in 1989. It launched its first single-spindle convertible Tablet PC, the Lifebook T3000 Series, in 2003; the T3010 was a launching pad for its current tablet PCs.
Models
All series, including former series, are listed here; currently (2017) the Lifebook A series is being continued more for the cheaper private sector and the series E, P, S, T, U mostly more for the business sector. Fujitsu is traditionally strong in the touch screen and tablet area (in the Lifebook S, T, and U series). In addition, reference is also made to the Stylistic series.
Lifebook A
The A Series was launched in 2010 and initially consisted of the "all-round" models A530, AH530 and AH550, which are offered in different variants. Similarities were displays with 39.6 cm (15.6 inches) diagonal, LED backlighting and 1366 × 768 pixels ( 16:9 aspect ratio , with or without anti-glare protection), as well as the built -in Intel HM55 chipset and keyboards with a numeric keypad . The devices are mainly equipped with mobile processors from the Intel Core i seriesoffered. Even today (2017), the A series, for example with the models A555 and A557, are relatively inexpensive larger laptops (15.6 inches) that are offered as "all-rounders" or as private laptops.
Lifebook B
The B series was the Biblo class for subnotebooks. The first models (B110 and B112, 1998) were very compact (DIN A5 size and 1.1 kg) and had an 8.4" color display. The special thing about the larger (DIN A4 format) successor models B213x (1999) was the touch-sensitive 10.4" TFT screen and the input pen. The B series is no longer built and has been replaced by the T series or P series.
Lifebook C
Until 01/2008, the C series was the entry-level series for professional users. It had a simple and robust design, but some additional options such as 3D graphics cards were not available, and on the outside it hardly differed from the E series.
Lifebook E
The E Series is a line of desktop replacement notebooks. They are particularly robust and usually have more powerful components than the C series (faster processors, more RAM, etc.), which is also reflected in the price. The E series usually has a high-quality, high-contrast 15/15.4-inch screen that is specially designed for office use, since no reflective displays are used and 4:3 formats are mostly available.
Lifebook NH
46.7 cm screen width. multimedia and gaming.
Lifebook P
Several ultraportable notebooks are available under the P-series . This includes e.g. B. the P1620, which is one of the lightest convertible tablet PC with a weight of 1 kg . The P stands for piccolo .
Lifebook Q
The Q series are lifestyle notebooks that stand out from the other series with their piano f |
https://en.wikipedia.org/wiki/Simics | Simics is a full-system simulator or virtual platform used to run unchanged production binaries of the target hardware. Simics was originally developed by the Swedish Institute of Computer Science (SICS), and then spun off to Virtutech for commercial development in 1998. Virtutech was acquired by Intel in 2010. Currently, Simics is provided by Intel in a public release and sold commercially by Wind River Systems, which was in the past a subsidiary of Intel.
Simics contains both instruction set simulators and hardware models, and is or has been used to simulate systems such as Alpha, ARM (32- and 64-bit), IA-64, MIPS (32- and 64-bit), MSP430, PowerPC (32- and 64-bit), RISC-V (32- and 64-bit), SPARC-V8 and V9, and x86 and x86-64 CPUs.
Many different operating systems have been run on various simulated virtual platforms, including Linux, MS-DOS, Windows, VxWorks, OSE, Solaris, FreeBSD, QNX, RTEMS, UEFI, and Zephyr.
The NetBSD AMD64 port was initially developed using Simics before the public release of the chip. The purpose of simulation in Simics is often to develop software for a particular type of hardware without requiring access to that precise hardware, using Simics as a virtual platform. This can applied both to pre-release and pre-silicon software development for future hardware, as well as for existing hardware. Intel uses Simics to provide its ecosystem with access to future platform months or years ahead of the hardware launch.
The current version of Simics is 6 which was released publicly in 2019. Simics runs on 64-bit x86-64 machines running Microsoft Windows and Linux (32-bit support was dropped with the release of Simics 5, since 64-bit provides significant performance advantages and is universally available on current hardware). The previous version, Simics 5, was released in 2015.
Simics has the ability to execute a system in forward and reverse direction. Reverse debugging can illuminate how an exceptional condition or bug occurred. When executing an OS such as Linux in reverse using Simics, previously deleted files reappear when the deletion point is passed in reverse and scrolling and other graphical display and console updates occur backwards as well.
Simics is built for high performance execution of full-system models, and uses both binary translation and hardware-assisted virtualization to increase simulation speed. It is natively multithreaded and can simulate multiple target (or guest) processors and boards using multiple host threads. It has been used to run simulations containing hundreds of target processors.
See also
ARM Fastsim, an instruction-set simulator and set of system models for ARM IP.
Gem5, an open source full-system and ISA simulator and framework.
OVPsim, a full-system simulation framework which is free for non-commercial use, and which comes with over 100 open source models and platforms that run Linux, Android, and many other operating systems.
Qemu, open-source program that can do full-sy |
https://en.wikipedia.org/wiki/Mousepad | A mousepad or mousemat is a surface for placing and moving a computer mouse. A mousepad enhances the usability of the mouse compared to using a mouse directly on a table by providing a surface to allow it to measure movement accurately and without jitter. Some mousepads increase ergonomics by providing a padded wrist rest.
History
During a 1968 presentation by Douglas Engelbart marking the public debut of a mouse,
Engelbart used a control console designed by Jack Kelley of Herman Miller that included a keyboard and an inset portion used as a support area for the mouse.
According to Kelley
and also stated by Alex Pang, Kelley designed the first mousepad a year later, in 1969.
Details of a mousepad designed by Armando M. Fernandez were published in the Xerox Disclosure Journal in 1979 with the description:
By 1982, most users of the Xerox ball mouse were using special pads to increase the friction of the ball in the mouse.
The first commercial manufacturer of mousepads was Moustrak, founded by Bob McDermand. The company began gaining traction when Apple decided to distribute its mousepads, featuring the Apple logo, to computer stores in the United States. Moustrak signed licensing deals with Disney, Paramount, and LucasFilm, and advertised in magazines including MacWorld. However, by the end of the 1980s, lower cost mousepads turned the product into a commodity.
The Oxford English Dictionary tracks the term mouse pad to the August 24, 1983, publication of InfoWorld, and the predominantly British term mousemat to October 17, 1989, in the publication 3D.
Benefits
The three most important benefits of the introduction of the mousepad were higher speed, more precision, and comfort for the user. A secondary benefit was keeping the desk or table surface from being scratched and worn by continuous hand and mouse rubbing motion. Another benefit was reduction of the collection of debris under the mouse, which resulted in reduced jitter of the pointer on the display. Also, it is important to clean mousepads.
The mousepads can be cleaned by special detergents, liquid soap, hand wash or dry cleaning. Not all mousepads are machine washable.
When optical mice, which use image sensors to detect movement, were first introduced into the market, they required special mousepads with optical patterns printed on them. Modern optical mice can function to an acceptable degree of accuracy on plain paper and other surfaces. However, some optical mouse users (especially gamers, designers, and other heavy users) may prefer a mousepad for comfort, speed and accuracy, and to prevent wear to the desk or table surface.
Types
A variety of mousepads exist with many different textured surfaces to fit various types of mouse technologies.
After the steel mouse ball was given a silicone rubber surface, the popular fabric-surface mousepad was found to be the most appropriate. It helped keep the rubberized roller-ball surface cleaner and gave better tracking, speed, and |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.