source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/S7%20%28ZVV%29 | The S7 is a regional railway service of the Zürich S-Bahn on the ZVV (Zürich transportation network) and is one of the network's trunk services.
Route
The service links Winterthur, in the northeast of the canton of Zürich, and Rapperswil-Jona, on the on north shore of Lake Zürich but just over the cantonal boundary in the canton of St. Gallen. From Winterthur, the service runs over the main Zurich–Winterthur railway line to Effretikon, but then takes the secondary route via Kloten to Zürich Oerlikon, from where it proceeds through Zürich via Zürich Hauptbahnhof and Zürich Stadelhofen. From Stadelhofen, trains then run over the Lake Zürich right-bank railway line to Rapperswil. Between Stadelhofen and Meilen trains run non-stop, with a parallel stopping service provided by lines S6 and S16.
The following stations are served:
Winterthur Hauptbahnhof
Kemptthal
Effretikon
Bassersdorf
Kloten
Kloten Balsberg
Opfikon
Zürich Oerlikon
Zürich Hardbrücke
Zürich Hauptbahnhof
Zürich Stadelhofen
Meilen
Uetikon
Männedorf
Stäfa
Uerikon
Feldbach
Kempraten
Rapperswil
Rolling stock
services are operated by RABe 511 EMUs or Re 450 locomotives push-pulling double-deck coaches. RABe 514 ("DTZ") EMUs were used previously.
Scheduling
The normal frequency is one train every 30 minutes. A journey over the full length of the service takes 74 minutes.
See also
Rail transport in Switzerland
Trams in Zürich
References
External links
ZVV official website: Routes & zones
Zürich S-Bahn lines
Transport in the canton of St. Gallen
Transport in the canton of Zürich |
https://en.wikipedia.org/wiki/Nice%20%28Unix%29 | nice is a program found on Unix and Unix-like operating systems such as Linux. It directly maps to a kernel call of the same name. nice is used to invoke a utility or shell script with a particular CPU priority, thus giving the process more or less CPU time than other processes. A niceness of -20 is the lowest niceness, or highest priority. The default niceness for processes is inherited from its parent process and is usually 0.
Systems have diverged on what priority is the lowest. Linux systems document a niceness of 19 as the lowest priority, BSD systems document 20 as the lowest priority. In both cases, the "lowest" priority is documented as running only when nothing else wants to.
Etymology
Niceness value is a number attached to processes in *nix systems, that is used along with other data (such as the amount of I/O done by each process) by the kernel process scheduler to calculate a process' 'true priority'which is used to decide how much CPU time is allocated to it.
The program's name, nice, is an allusion to its task of modifying a process' niceness value.
The term niceness itself originates from the idea that a process with a higher niceness value is nicer to other processes in the system and to users by virtue of demanding less CPU powerfreeing up processing time and power for the more demanding programs, who would in this case be less nice to the system from a CPU usage perspective.
Use and effect
nice becomes useful when several processes are demanding more resources than the CPU can provide. In this state, a higher-priority process will get a larger chunk of the CPU time than a lower-priority process. Only the superuser (root) may set the niceness to a lower value (i.e. a higher priority). On Linux it is possible to change /etc/security/limits.conf to allow other users or groups to set low nice values.
If a user wanted to compress a large file without slowing down other processes, they might run the following:
$ nice -n 19 tar cvzf archive.tgz largefile
The exact mathematical effect of setting a particular niceness value for a process depends on the details of how the scheduler is designed on that implementation of Unix. A particular operating system's scheduler will also have various heuristics built into it (e.g. to favor processes that are mostly I/O-bound over processes that are CPU-bound). As a simple example, when two otherwise identical CPU-bound processes are running simultaneously on a single-CPU Linux system, each one's share of the CPU time will be proportional to 20 − p, where p is the process' priority. Thus a process, run with nice +15, will receive 25% of the CPU time allocated to a normal-priority process: (20 − 15)/(20 − 0) = 0.25. On the BSD 4.x scheduler, on the other hand, the ratio in the same example is about ten to one.
Similar commands
The related renice program can be used to change the priority of a process that is already running.
Linux also has an ionice program, which affects scheduling of I/O rat |
https://en.wikipedia.org/wiki/UNISERVO%20I | The UNISERVO tape drive was the primary I/O device on the UNIVAC I computer. It was the first tape drive for a commercially sold computer.
The UNISERVO used metal tape: a thin strip of nickel-plated phosphor bronze (called Vicalloy) 1200 feet long. These metal tapes and reels were very heavy with a combined weight of 25lbs. Data was recorded in eight channels on the tape (six for the data value, one parity channel for error checking, and one timing channel) at a density of 128 bits per inch. The tape could be moved at 100 inches per second, giving a nominal transfer rate of 12,800 characters per second. Data were recorded in fixed size blocks of 60 words of 12 characters each. Making allowance for the empty space between tape blocks, the actual transfer rate was around 7,200 characters per second.
The UNISERVO supported both forward and backward modes on read or write operation. This offered significant advantages in data sorting and merging applications. The data transfers to/from the UNIVAC I processor were fully buffered in a one block dedicated memory, permitting instruction execution in parallel with tape movement and data transfer. The internal serial data path permitted inserting a tape data block into main memory in one instruction.
UNIVAC continued to use the name UNISERVO for later models of tape drive (e.g., UNISERVO II, UNISERVO IIIC, UNISERVO VIII-C) for later computers in their product line. The UNISERVO II could read metal tapes from the UNIVAC I as well as use higher density PET film base/ferric oxide media tapes that became the industry standard. While UNIVAC was first with computer tape, and had higher performance than contemporary IBM tape drives, IBM was able to set the data interchange standard. UNIVAC was later forced to be compatible with the IBM technology.
Technical details
The tape motion in the UNISERVO I was controlled by a single capstan connected to a synchronous motor. Supply and take-up reel motion was buffered via a complex pulley-string-spring arrangement, as the design was prior to the invention of the vacuum column buffer. The tape drive contained a permanent leader, and each tape reel had a connector link to the leader. The nickel-plated phosphor bronze tapes were very abrasive, and to counter this problem a thin plastic wear tape was slowly moved over the recording head, between the head and the tape, preventing the recording head from quickly wearing out. The metal tapes also were dirty, and a slowly renewed felt wiper collected tape debris. The UNISERVO I had a high-speed rewind capability, and multiple drives on the UNIVAC I could rewind while others continued with data processing reads or writes.
The later UNISERVO IIA and IIIA omitted the plastic wear tape and felt wipers, since they were primarily used with PET film-base magnetic tape. Both continued the use of single capstan drives and were vacuum column designs. The IIIC and later tapes used NRZI encoding to be compatible with the IBM 729 series |
https://en.wikipedia.org/wiki/National%20Learning%20Network | The National Learning Network (NLN) was a UK national partnership programme designed to increase the uptake of Information Learning Technology (ILT) across the learning and skills sector in England. Supported by the Learning and Skills Council and other sector bodies, the NLN provided network infrastructure and a wide-ranging programme of support, information and training, as well as the NLN Materials − a substantial range of e-learning content. The initiative began in 1999 with the aim of helping to transform post-16 education. The Government's total investment in the NLN totalled £156 million over a five-year period.
Although the network itself is no longer operational, the main output of the initiative − the NLN Materials − continue to represent one of the most substantial and wide-ranging collections of e-learning materials in the UK. Available free to the post-16 sector, they are still actively promoted and updated.
The name National Learning Network is also the name of several centres in Ireland for people with physical and Intellectual disabilities.
History
The seeds for the UK's National Learning Network (NLN) were sown in the spring of 1999 through the collaboration of the Further Education Funding Council for England (FEFC), the Higher Education Funding Council for England (HEFCE) and agencies like Becta, NILTA, FEDA and Jisc. This government-funded project resulted in three main developments:
The Joint Information Services Committee (JISC) that had been managing the Joint Academic Network (JANET) on behalf of UK Universities and Research Councils would now be part-funded by the Further Education Funding Council. Consequently, all UK Colleges of Further Education would be connected to the JANET network and benefit from the data sets and learning resources available through it.
Support for the newly connected colleges would be provided by the JISC Regional Support Centres (RSC), set up by university and college partnerships to cover all FEFC funding areas. The RSCs' initial brief was to manage the connection of FE colleges to the JANET network, train local IT staff and provide high level technical support.
A massive programme of learning materials development would be set up under the name of National Learning Network (NLN) to enable Further Education and the Adult and Community Learning (ACL) sectors to make best use of JANET and the enhanced ICT resources that these sectors enjoyed. A substantial body of work was developed by colleges, universities and commercial organisations and were made available to all qualifying parties. NLN has played a significant role in the adoption of Information and Learning Technology (ILT) by the post-16 education sectors in the UK.
NLN Materials
Four rounds of interactive learning materials were commissioned and authored under the NLN banner, covering a wide range of academic and vocational topics. The last body of work − Round 4, adding to the 800 hours of materials already available, was ai |
https://en.wikipedia.org/wiki/Abraxas%20%28computer%20virus%29 | Abraxas, also known as Abraxas5, discovered in April 1993, is an encrypted, overwriting, file infecting computer virus which infects .COM and .EXE files, although it does not infect . It does not become memory resident. Each time an infected file is executed, Abraxas infects the copy of located in the C:\DOS directory (creating the file if it does not exist), as well as one EXE file in the current directory. Due to a bug in the virus, only the first EXE file in any directory is infected.
Abraxas-infected files will become 1,171 bytes in length and contain Abraxas' viral code. The file's date and time in the DOS disk directory listing will be set to the system date and time when infection occurred. The following text strings can be found within the viral code in all Abraxas infected programs:
"*.exe c:\dos\dosshell.com .. MS-DOS (c)1992"
"->>ABRAXAS-5<<--"
"...For he is not of this day"
"...Nor he of this mind"
Execution of infected programs will also result in the display of a graphic "ABRAXAS" on the system display, accompanied by an ascending scale being played on the system speaker.
Abraxas was created with the PS-MPC virus creation tool, which can be used to create similar, easily detected viruses, which are usually encrypted as well.
More than 20 viruses have appeared which have clearly been produced with the PS-MPC:
203 (computer virus)
644 (computer virus)
Abraxas (computer virus)
ARCV-n (computer virus) Remark: ARCV group has also produced viruses with the TPE and developed the ARCV strain.
Joshua (computer virus)
Kersplat (computer virus)
McWhale (computer virus)
Mimic (computer virus)
Small ARCV (computer virus)
Small EXE (computer virus)
Swan Song (computer virus)
The name "Abraxas" was also used for a virus in the video game Tron: Evolution.
See also
Actifed
References
External links
Abraxas virus, by McAfee
PS-MPC Virus Generator, by University of Hamburg
F-Secure Virus Descriptions : PS-MPC, by Mikko Hypponen, F-Secure
ARCV Busted!, by DecimatoR
Virus Writing Groups (A-M), by LineZer0 Network Zine
DOS file viruses |
https://en.wikipedia.org/wiki/English%20Electric%20DEUCE | The DEUCE (Digital Electronic Universal Computing Engine) was one of the earliest British commercially available computers, built by English Electric from 1955. It was the production version of the Pilot ACE, itself a cut-down version of Alan Turing's ACE.
Hardware description
The DEUCE had 1450 thermionic valves, and used mercury delay lines for its main memory; each of the 12 delay lines could store 32 instructions or data words of 32 bits each. It adopted the then high 1 megahertz clock rate of the Pilot ACE. Input/output was via Hollerith 80-column punch-card equipment. The reader read cards at the rate of 200 per minute, while the card punch rate was 100 cards per minute. The DEUCE also had an 8192-word magnetic drum for main storage. To access any of the 256 tracks of 32 words, the drum had one group of 16 read and one group of 16 write heads, each group on independent moveable arms, each capable of moving to one of 16 positions. Access time was 15 milliseconds if the heads were already in position; an additional 35 milliseconds was required if the heads had to be moved. There was no rotational delay incurred when reading from and writing to drum. Data was transferred between the drum and one of the 32-word delay lines.
The DEUCE could be fitted with paper tape equipment; the reader speed was 850 characters per second, while the paper tape output speed was 25 characters per second. (The DEUCE at the University of New South Wales {UTECOM} had a Siemens M100 teleprinter attached in 1964, giving 10 characters per second input/output). Decca magnetic tape units could also be attached. The automatic multiplier and divider operated asynchronously (that is, other instructions could be executed while the multiplier/divider unit was in operation). Two arithmetic units were provided for integer operations: one of 32 bits and another capable of performing 32-bit operations and 64-bit operations. Auto-increment and auto-decrement were provided on eight registers from about 1957. Array arithmetic and array data transfers were permitted. Compared with contemporaries such as the Manchester Mark 1, DEUCE was about ten times faster.
The individual words of the quadruple registers were associated with an auto-increment/decrement facility. That facility could be used for counting and for modifying instructions (for indexing, loop control, and for changing the source or destination address of an instruction).
Being a serial machine, access time to a single register was 32 microseconds, a double register 64 microseconds, and a quadruple register 128 microseconds. That for a delay line was 1024 microseconds.
Instruction times were: addition, subtraction, logical operations: 64 microseconds for 32-bit words; double-precision 96 microseconds; multiplication and division 2 milliseconds. For array arithmetic and transfer operations, time per word was 33 microseconds per word for 32 words.
Floating-point operations were provided by software; times: 6 mill |
https://en.wikipedia.org/wiki/Automatic%20Computing%20Engine | The Automatic Computing Engine (ACE) was a British early electronic serial stored-program computer design by Alan Turing. Turing completed the ambitious design in late 1945, having had experience in the years prior with the secret Colossus computer at Bletchley Park.
The ACE was not built, but a smaller version, the Pilot ACE, was constructed at the National Physical Laboratory and became operational in 1950. A larger implementation of the ACE design was the MOSAIC computer which became operational in 1955. ACE also led to the Bendix G-15 and other computers.
Background
The project was managed by John R. Womersley, superintendent of the Mathematics Division of the National Physical Laboratory (NPL). The use of the word Engine was in homage to Charles Babbage and his Difference Engine and Analytical Engine. Turing's technical design Proposed Electronic Calculator was the product of his theoretical work in 1936 "On Computable Numbers" and his wartime experience at Bletchley Park where the Colossus computers had been successful in breaking German military codes. In his 1936 paper, Turing described his idea as a "universal computing machine", but it is now known as the Universal Turing machine.
Turing was sought by Womersley to work in the NPL on the ACE project; he accepted and began work on 1 October 1945 and by the end of the year he completed his outline of his 'Proposed electronic calculator', which was the first reasonably complete design of a stored-program computer and, apart from being on a much larger scale than the final working machine, anticipated the final realisation in most important respects. However, because of the strict and long-lasting secrecy around the Bletchley Park work, he was prohibited (because of the Official Secrets Act) from explaining that he knew that his ideas could be implemented in an electronic device. The better-known EDVAC design presented in the First Draft of a Report on the EDVAC (dated 30 June 1945), by John von Neumann, who knew of Turing's theoretical work, received much publicity, despite its incomplete nature and questionable lack of attribution of the sources of some of the ideas.
Turing's report on the ACE was written in late 1945 and included detailed logical circuit diagrams and a cost estimate of £11,200. He felt that speed and size of memory were crucial and he proposed a high-speed memory of what would today be called 25 kilobytes, accessed at a speed of 1 MHz; he remarked that for the purposes required "the memory needs to be very large indeed by comparison with standards which prevail in most valve and relay work, and [so] it is necessary to look for some more economical form of storage", and that memory "appears to be the main limitation in the design of a calculator, i.e. if the storage problem can be solved all the rest is comparatively straightforward". The ACE implemented subroutine calls, whereas the EDVAC did not, and what also set the ACE apart from the EDVAC was the use of Abbr |
https://en.wikipedia.org/wiki/Acid%20%28computer%20virus%29 | Acid is a computer virus which infects .COM and .EXE files including . Each time an infected file is executed, Acid infects all of the .EXE files in the current directory. Later, if an infected file is executed, it infects the .COM files in the current directory. Programs infected with Acid will have had the first 792 bytes of the host program overwritten with Acid's own code. There will be no file length increase unless the original host program was smaller than 792 bytes, in which case it will become 792 bytes in length. The program's date and time in the DOS disk directory listing will not be altered.
The following text strings are found in infected files:
"*.EXE *.COM .."
"Program too big to fit in memory"
"Acid Virus"
"Legalize ACiD and Pot"
"By: Copyfright Corp-$MZU"
External links
Computer Viruses (A), by Probert Encyclopedia
Acid virus, by McAfee
DOS file viruses |
https://en.wikipedia.org/wiki/Acme%20%28computer%20virus%29 | Acme is a computer virus which infects MS-DOS EXE files. Each time an infected file is executed, Acme may infect an EXE in the current directory by creating a hidden 247 byte long read-only COM file with the same base name. (In MS-DOS, if the file extension is not specified, and two files with the same base name exist, one with .COM and one with .EXE, the .COM file will always be executed instead of the .EXE file.) Acme is a variant of Clonewar, a spawning virus. Acme is also perhaps a descendant of the small single-step infector Zeno, which is not to be confused with the Zeno programming language.
External links
Computer Viruses (A), by Probert Encyclopedia
Clonewar virus, by McAfee
DOS file viruses |
https://en.wikipedia.org/wiki/Turtle%20Geometry | Turtle Geometry is a college-level math text written by Hal Abelson and Andrea diSessa which aims to engage students in exploring mathematical properties visually via a simple programming language to maneuver the icon of a turtle trailing lines across a personal computer display.
See also
Turtle graphics
Turtle Geometry at MIT Press
Computer science books
1981 non-fiction books
MIT Press books |
https://en.wikipedia.org/wiki/Sharp%20PC-1251 | The Sharp PC-1251 was a small pocket computer that was also marketed as the Tandy Pocket Computer.
It was created by Sharp Corporation in 1982.
Technical specifications
24 digit (5×7 pixel) LCD
Integrated speaker
Same connector for printer and tape drive as PC-1401
2 built-in batteries
4 KB RAM
576 kHz clock frequency
24 KB ROM
See also
Sharp pocket computer character sets
References
External links
Sharp PC-1251 pictures on MyCalcDB (database of 70s and 80s pocket calculators)
PC-1251
PC-1251 |
https://en.wikipedia.org/wiki/Sharp%20PC-1350 | The Sharp PC-1350 is a small pocket computer manufactured by Sharp. The PC-1350 was introduced in 1984 and was used by engineers, and favored by programmers for its programming and graphical capabilities. It was superseded in 1987 by the PC-1360, which featured one additional RAM expansion port, improved BASIC, floppy disk capability, and a faster CPU.
Technical specifications
Listed below are the technical specification of the PC-1350 and PC-1360 models.
CMOS 8-bit CPU SC61860 at 768 kHz
24x4 character (150x32 pixels) LCD controlled by SC43537 display LSI chip
4 KiB RAM on 2x HM6116 chip
40 KiB System ROM (8 KiB CPU internal, 32 KiB external on SC613256 chip)
Integrated piezo speaker (beep only)
I/O Sharp custom interfaces for printers and tape recorders
I/O RS-232 at TTL level
Powered by two CR-2032 lithium batteries (consumption max. 5 mA during arithmetical computing, 20 uA during poweroff)
Built-in BASIC interpreter
RAM expansion port, for up to 20 KiB of RAM in total.
See also
Sharp pocket computer character sets
References
External links
Images of a PC-1350 and a short description of functionality.
PC-1350 Service manual.
PC-1350 Mame / Emma / Mess emulator page.
PC-1350 Memory map
PC-1350
PC-1350 |
https://en.wikipedia.org/wiki/Sharp%20PC-1403 | The Sharp PC-1403 was a small scientific calculator and pocket computer manufactured by Sharp. It was the successor of the Sharp PC-1401, and had better display, more RAM and better system software.
Technical specifications
CPU: Hitachi SC61860 (8-bit CMOS) 768 kHz
Memory: 8 KB RAM (6863 bytes available), 72 KB ROM; 32 KB RAM in PC-1403H model
Display: Monochrome LCD 1 line with 24 5×7 characters
Power: 6 V DC - 2× CR2032, 0.03 W
Connector (11 pins) for external devices
Integrated speaker (4 kHz beep only)
Contrast adjustment wheel
Software: Simple BASIC interpreter; calculator mode
Matrix calculations
Manufacturing started in 1986.
It is possible to convert the 1403 to a 1403H by removing the 8 K RAM and soldering in a 32 K RAM. An inverter IC is needed for this, too.
Calculator
Calculations could be performed in two modes CAL and RUN. In the former, the PC-1403 would behave like a normal scientific calculator at the time with formulas entered in algebraic logic. In RUN mode, BASIC statements could be entered for immediate execution and print out. The latter was similar to the Direct algebraic logic employed by modern calculators.
Programming
The programming model employed was unstructured BASIC for which the PC-1403 distinguished between RUN and PRO mode. The later being used to enter and edit program and the former being used to execute them.
Programming example
Here is a sample program that computes the factorial of an integer number from 0 to 69. It can be called by entering a number or an expression followed by pressing DEF F (in run mode).
10 "F" AREAD N ''allows to start the program with <expression> DEF F
20 F=1 ''Set start value of F to 1
30 FOR I=1 TO N ''counts I from 1 to N
40 F=F*I ''calculates F=F*I
50 NEXT I ''repeats loop from line 40
60 PRINT STR$ N+"!=";F ''print result - i.e. 5!=120.
70 END ''end of program
Machine language programming
It is possible to write machine language programs into memory using the POKE command and starting them with the CALL command.
See also
Sharp pocket computer character sets
References
PC-1403
PC-1403 |
https://en.wikipedia.org/wiki/Sharp%20PC-1500 | The Sharp PC-1500 was a pocket computer produced by Sharp between 1981 and 1985. A rebadged version was also sold as the TRS-80 Pocket Computer PC-2.
The whole computer was designed around the LH5801, an 8-bit CPU similar to the Zilog Z80, but all laid-out in power-saving CMOS circuits. Equipped with 2 KB of on-board RAM, the programming language is BASIC. Later, German engineers provided an assembler for the machine. Later even a C compiler followed.
An external slot is available and accepts memory (from 4 KB to 32 KB) and ROM modules.
Eight versions of this pocket computer with 2 KB memory:
Sharp PC-1500 - Japanese version (1981)
Sharp PC-1500 - Japanese version with blue paint around LCD. CE-157 Kana module bundle model. Known as PC-1500D (1984)
Sharp PC-1500 - European, Australasian and North American version (1982)
Sharp PC-1500 RP2 - Brazilian version (1982)
HiradasTechnika PTA-4000 - Hungarian licence.
HiradasTechnika PTA-4000+16 - Hungarian licence (with internal 16 KB memory extension)
Tandy TRS-80 PC-2
Nanfeng PC-1500A - Chinese license (CKD assembly from Japanese components)
Two versions with 8 KB memory:
Sharp PC-1501 - Japanese rework with 8 KB memory (1984)
Sharp PC-1500A - Western rework with 8 KB memory (1984)
Technical specifications
156×8 pixel LCD
Integrated speaker
Integrated RTC
Memory/cartridge slot
60-pin expansion port for printer and tape drive
Battery slot (4×AA)
Connector for external power supply (Official adaptor is Sharp EA-150, rated at 500 mA at 9 V, comes with the CE-150 printer interface.)
Accessories
CE-150 4-colour printer/plotter and cassette interface in travel case. Known as KA-160 with PTA-4000.
CE-151 4 KB memory module
CE-152 Cassette recorder (as external storage) (same as General Electric 3-5160A)
CE-153 Software board
CE-154 Wallet dedicated to PC-1500 + CE-150 + CE-152 + CE-153
CE-155 8 KB memory module
CE-156 Tape with Katakana software
CE-157 4 KB memory module with CR2032 battery data backup and Katakana chars ROM
CE-158 Communication dock with RS-232C and parallel interface with (4 rechargeable, shrink-wrapped, permanently built-in) NiCd battery (AA) as additional power supply for the computer.
CE-159 8 KB memory module with CR2032 battery data backup
CE-160 7.6 KB read only memory module with CR2032 battery data backup
CE-161 16 KB memory module with CR2032 battery data backup
CE-162E Tape and parallel port interface
CE-163 32 KB (2x16 KB) dual-page memory module with CR2032 battery data backup. Only one page (16 KB) can be accessed at a time, switchable via the following command in PROG mode:
Page 0 : POKE&5804,0 [enter]
Page 1 : POKE&5804,1 [enter]
Related Sharp pocket computers
Sharp PC-1210
Sharp PC-1211
Sharp PC-1251
Sharp PC-1500
Sharp PC-1500A upgrade version with 8 KB onboard RAM
Sharp PC-1501 Japanese version of PC-1500A
Sharp PC-1600 with more memory and larger multi-line LCD display and more graphics capabilities
BASIC compatib |
https://en.wikipedia.org/wiki/Sharp%20PC-1401 | The Sharp PC-1401 is a small pocket computer manufactured by Sharp. It was introduced in 1983 and is one of the first combinations of scientific calculator and portable computer with BASIC interpreter/bytecode compiler. The PC-1402 has the same features but includes 10K of RAM.
Technical specifications
CPU: Hitachi SC61860 (8-bit CMOS), 576 kHz clock frequency
4 KiB RAM (3534 bytes usable) (Two 2К×8 CMOS Static RAM HM6116 chips)
40 KiB ROM (SC613256 chip)
Display: monochrome LCD 16 digits (5×7 pixel) in 1 line (Controlled by SC43536 chip)
Integrated piezoelectric speaker
Keyboard: 76 keys, 1 switch on front, 1 key, 1 knob on back/side
11-pin serial connector for printer/cassette controller and floppy controller CE-140F
Powered from two CR2032 batteries, power consumption is less than 0.03 W
Size: 170×72×9.5mm, weighing around 150 grams
Peripherals
The machine has an 11-pin serial connector, which is almost through-hole compatible. This connects to a proprietary thermal printer, such as a CE-126P. The printer will also serve as an adapter to connect to a tape recorder. The tape recorder provides program and data backup.
Variants
PC-1421
The PC-1421 is a variant of the PC-1401 for financial calculations. It differs from the PC-1401 in the contents of its ROM and higher CPU speed. The PC-1421 CPU clocks at 768kHz vs 576kHz for the PC-1401.
PC-1430
The PC-1430 is a stripped-down variant of the PC-1401. The display and case are mostly the same (except for fewer keys), but the PC-1430 lacks the calculator modus (for calculations the BASIC mode has to be used), it offers less functions, only 2 KB RAM, and no speaker or buzzer.
PC-1450
The PC-1450 supports user changeable RAM cards: CE-211M (3070 bytes = 4 KB / Standard), CE-201M (7166 bytes = 8 KB) or CE-202M (15,358 bytes = 16 KB).
Program examples
10 "F" ''allows to start the program with DEF F
20 INPUT "N=?";N ''Ask for n
30 LET F=1 ''Set start value of F to 1
40 FOR I=1 TO N STEP 1 ''counts I from 1 to N
50 LET F=F*I ''calculates F=F*I
60 NEXT I ''repeats loop from line 40
70 PRINT USING "##";N;"!="; USING ;F ''print result - i.E. 5!=120
80 END ''end of program
See also
Sharp PC-1403
Sharp pocket computer character sets
External links
Sharp PC-1401 pictures on MyCalcDB (database about 70s and 80s pocket calculators)
Sharp PC-1401
PC-1401
PC-1401 |
https://en.wikipedia.org/wiki/Shadowing | Shadowing may refer to:
Shadow fading in wireless communication, caused by obstacles
File shadowing, to provide an exact copy of or to mirror a set of data
Job shadowing, learning tasks by first-hand observation of daily behavior
Projective shadowing, a process by which shadows are added to 3D computer graphics
Variable shadowing, a variable naming issue in computer programming
Speech shadowing, a type of experiment in psycholinguistics
Nuclear shadowing, an effect in nuclear and particle physics
Surveillance, following someones movements
See also
Shadow (disambiguation)
The shadowing lemma, a key result in the theory of dynamical systems
Shading |
https://en.wikipedia.org/wiki/List%20of%20former%20IA-32%20compatible%20processor%20manufacturers | As the 32-bit Intel Architecture became the dominant computing platform during the 1980s and 1990s, multiple companies have tried to build microprocessors that are compatible with that Intel instruction set architecture. Most of these companies were not successful in the mainstream computing market. So far, only AMD has had any market presence in the computing market for more than a couple of product generations. Cyrix was successful during the 386 and 486 generations of products, but did not do well after the Pentium was introduced.
List of former IA-32 compatible microprocessor vendors:
Progressed into surviving companies
Centaur Technology – originally subsidiary of IDT, later acquired by VIA Technologies, still producing compatible low-end devices for VIA
Cyrix – acquired by National Semiconductor, later acquired by VIA Technologies, eventually shut down
NexGen – bought by AMD to help develop the successful K6 device
National Semiconductor – low-end 486 (designed in-house) never widely sold; first acquirer of Cyrix, later keeping only low-end IA-32 devices targeted for consumer System-on-a-chips, finally selling them to AMD
Product discontinued/transformed
Harris Corporation – sold radiation-hardened versions of the 8086 and 80286; product line discontinued. Produced 20 MHz and 25 MHz 80286s (some motherboards were equipped with cache memory, which was unusual for 80286 processors).
NEC – sold processors, such as NEC V20 and NEC V30, that were compatible with early Intel 16-bit architectures; product line transitioned to NEC-designed architectures.
Siemens – sold versions of the 8086 and 80286; product line discontinued.
VM Technology – developed VM860 (8086-compatible processor) and VM8600SP (386-compatible processor) for the Japanese market.
Left the market or closed
Chips and Technologies – left market after failed 386 compatible chip failed to boot the Windows operating system
IBM – Cyrix licensee and developer of Blue Lightning 486 line of processors, eventually left compatible chip market
Rise Technology – after five years of working on the slow mP6 chip (released in 1998), the company closed a year later
Texas Instruments and SGS-Thomson – licensees of Cyrix designs, eventually left compatible chip market
Transmeta – transitioned to an intellectual property company in 2005
United Microelectronics Corporation and Meridian Semiconductor – got out of market after slow 486 compatible missed market window
Incomplete/unsuccessful projects
Chromatic Research – media processor with x86 instruction set compatibility never completed
Exponential Technology – x86-compatible microprocessor never completed
IIT Corp – 486-compatible project never completed
International Meta Systems – Pentium/PPro-class processors "Meta 6000", "Meta 6500", "Meta 7000/BiFrost" never completed
MemoryLogix – multi-threaded CPU core "MLX1" and SOC for PCs never completed
Metaflow Technologies – 486-class processor "CP100" never released
Montalv |
https://en.wikipedia.org/wiki/Symbolic%20Stream%20Generator | The Symbolic Stream Generator (or SSG) is a software productivity aid by Unisys for their mainframe computers of the former UNIVAC 1100/2200 series.
SSG is used to generate RUN-Streams (corresponding to IBM's Job Control Language), apply and administer symbolic changes to program sources as a form of version control, and for many other purposes.
An SSG program (i.e., its "job control script") is called a Skeleton, and its programming language Symstream.
The tool created output streams based on interpreting data provided via multiple input sources. It was originally created by Univac for the creation of Operating System (OS) updates. It was later adopted by the general user community for the creation of complex batch and real-time computer processes. The sources could recursively reference additional sources, providing wide flexibility in input parsing. The rules for output creation were also in source files, with similar levels of dynamic input capability. Interpretation of the multiple input sources allowed for dynamic creation of output stream content. Complex recursive processes could be applied to create program source code, job execution sequences, simulated dynamic input from virtual consoles, and in general provide scripting capabilities reminiscent of the Unix GREP and YACC tools.
See also
List of UNIVAC products
Unisys OS2200 Symbolic Stream Generator (SSG) Programming Reference Manual
History of computing hardware
Scripting languages |
https://en.wikipedia.org/wiki/XL%20%28band%29 | XL is a J-Pop group with three members - Onishi Terukado (guitar and vocals), Tokunaga Akito (programming and songwriting), and noriaki (drums). The band made its debut on 29 April 1998 with the eponymous album XL.
Discography
Singles
O-K! (29 July 1998)
Albums
XL (29 April 1998)
External links
XL - Official website
Japanese pop music groups |
https://en.wikipedia.org/wiki/Openswan | In the field of computer security, Openswan provides a complete IPsec implementation for Linux and FreeBSD.
Openswan, begun as a fork of the now-defunct FreeS/WAN project, continues to use the GNU General Public License. Unlike the FreeS/WAN project, it does not exclusively target the Linux operating system.
Libreswan forked from Openswan in 2012.
See also
Libreswan
strongSwan
External links
References
Virtual private networks
Software forks
Free security software
Cryptographic protocols
IPsec |
https://en.wikipedia.org/wiki/Bill%20Quay | Bill Quay is a residential area in Gateshead, located around from Newcastle upon Tyne, from Sunderland, and from Durham. In 2011, Census data for the Gateshead Metropolitan Borough Council ward of Heworth and Pelaw recorded a total population of 9,100.
Bill Quay is situated between Hebburn to the east, and Pelaw to the southwest. It lies on the south bank of the River Tyne, facing Walker. The area is home to Bill Quay Albion Cricket Club, competitors in the Durham Cricket League.
History
During the nineteenth century, Bill Quay was an industrial area catering for chemical works, bottle works, Robson's Paint, and shipbuilding. The area saw an economic upturn at the end of the nineteenth century, when the Co-Operative Wholesale Society (CWS) opened its vast and extensive string of factories along Shields Road. Boutlands, Harrisons and Wood-Skinner were shipbuilders at Bill Quay, with Harrisons being the final shipbuilder on the south bank of the River Tyne to close.
Demography
According to the 2011 Census, the Pelaw and Heworth ward has a population of 9,100. The ward is split into three distinct districts:
Bill Quay (population of 1,525) – Located to the east of King George's Field, and to the north of the A185 road.
Heworth (population of 5,273) – Located to the south of the Tyne and Wear Metro line.
Pelaw (population of 2,302) – Located to the north of the Tyne and Wear Metro line, and the A185 road.
52.2% of the population are female, slightly above the national average, while 47.8% are male. Only 2.7% of the population were from a black, Asian and minority ethnic (BAME) group, as opposed to 14.6% of the national population.
Data from the 2011 Census found that the average life expectancy in Pelaw and Heworth is 79.1 years for men, and 81.1 years for women. These statistics compare fairly favourably, when compared to the average life expectancy in the North East of England, of 77.4 and 81.4 years, respectively.
Car ownership is lower than the average in the Metropolitan Borough of Gateshead (63.5%), but lower than the national average of 74.2% – with 61.1% of households in the Pelaw and Heworth ward owning at least one car.
Education
Bill Quay is served by one primary school, Bill Quay Primary School. In November 2011, the school was rated "good" by Ofsted. Nearby primary schools include St. Alban's Catholic Primary School in Pelaw, and Wardley Primary School and White Mere Community Primary School in Wardley.
In terms of secondary education, Bill Quay is located within the catchment area for Heworth Grange School in Leam Lane. An inspection carried out by Ofsted in January 2017 deemed the school to be "inadequate". St. Alban's Catholic Primary School in Pelaw also acts as a feeder school for Cardinal Hume Catholic School in Wrekenton, rated "outstanding" by Ofsted in January 2014, as well as the nearby St. Joseph's Catholic Academy in Hebburn, which was rated "requires improvement" by Ofsted in January 2019.
Governance
Pela |
https://en.wikipedia.org/wiki/Prompt | Prompt may refer to:
Computing
Command prompt, characters indicating the computer is ready to accept input
Command Prompt, also known as cmd.exe or cmd, the command-line interpreter in some operating systems
Prompt (natural language), instructions issued to a computer system (such as a text-to-image artificial intelligence) in the form of written or spoken language.
Prompt engineering, a concept in artificial intelligence in which the description of the task is embedded in the input, e.g., as a question, instead of it being implicitly given.
Other uses
Prompter (theatre), sometimes prompt, one who prompts an actor if they forget their line
PROMPT Telescopes (Panchromatic Robotic Optical Monitoring and Polarimetry Telescopes), Chile
Prompt , a source of nitrogen oxides
Project Resource Organisation Management Planning Techniques, a project management method; the predecessor to PRINCE2
See also
Prompt neutron, in nuclear engineering
Prompt criticality
de:Prompt |
https://en.wikipedia.org/wiki/Service%20data%20unit | In Open Systems Interconnection (OSI) terminology, a service data unit (SDU) is a unit of data that has been passed down from an OSI layer or sublayer to a lower layer. This unit of data (SDU) has not yet been encapsulated into a protocol data unit (PDU) by the lower layer. That SDU is then encapsulated into the lower layer's PDU and the process continues until reaching the PHY, physical, or lowest layer of the OSI stack.
The SDU can also be thought of as a set of data that is sent by a user of the services of a given layer, and is transmitted semantically unchanged to a peer service user.
SDU and PDU
It differs from a PDU in that the PDU specifies the data that will be sent to the peer protocol layer at the receiving end, as opposed to being sent to a lower layer.
The SDU accepted by any given layer (n) from layer (n+1) above, is a PDU of the layer (n+1) above. In effect the SDU is the 'payload' of a given PDU. The layer (n) may add headers or trailers, or both, to the SDU and may do other kinds of reformatting, recoding, splitting or transformations on the data, forming one or more layer (n) PDUs. The added headers or trailers and other possible changes are part of the process that makes it possible to get data from a source to a destination. Layer (n) may also generate additional layer (n) PDUSs. Each unit of data that layer (n) gives to layer (n-1) below is in turn handed down as a layer (n-1) SDU.
When the PDU of layer (n+1), plus any metadata layer (n) would add; would exceed the maximum size a layer-n PDU can be (called layer (n)'s maximum transmission unit); the SDU must be split into multiple payloads for layer (n); a process known as fragmentation.
MAC SDU
MAC SDUS or MSDUS are data units transmitted between other Media access controllers on a lower OSI Layer. The PDU counterpart MAC PDU that does the same thing but on the same OSI Layer. When there are larger MAC PDU's as MAC SDU's in the system, the MAC PDU includes more MAC SDU's, because of packet aggregation. If the MAC PDU's are smaller then the MAC SDU's includes more MAC PDU's, because of packet segmentation.
See also
Federal Standard 1037C
References
Telecommunications standards |
https://en.wikipedia.org/wiki/SAS%20%28software%29 | SAS (previously "Statistical Analysis System") is a statistical software suite developed by SAS Institute for data management, advanced analytics, multivariate analysis, business intelligence, criminal investigation, and predictive analytics.
SAS was developed at North Carolina State University from 1966 until 1976, when SAS Institute was incorporated. SAS was further developed in the 1980s and 1990s with the addition of new statistical procedures, additional components and the introduction of JMP. A point-and-click interface was added in version 9 in 2004. A social media analytics product was added in 2010.
Technical overview and terminology
SAS is a software suite that can mine, alter, manage and retrieve data from a variety of sources and perform statistical analysis on it. SAS provides a graphical point-and-click user interface for non-technical users and more through the SAS language.
SAS programs have DATA steps, which retrieve and manipulate data, PROC (procedures) which analyze the data, and may also have functions. Each step consists of a series of statements.
The DATA step has executable statements that result in the software taking an action, and declarative statements that provide instructions to read a data set or alter the data's appearance. The DATA step has two phases: compilation and execution. In the compilation phase, declarative statements are processed and syntax errors are identified. Afterwards, the execution phase processes each executable statement sequentially. Data sets are organized into tables with rows called "observations" and columns called "variables". Additionally, each piece of data has a descriptor and a value.
PROC statements call upon named procedures. Procedures perform analysis and reporting on data sets to produce statistics, analyses, and graphics. There are more than 300 named procedures and each one performs a substantial body of statistical work. PROC statements can also display results, sort data or perform other operations.
SAS macros are pieces of code or variables that are coded once and referenced to perform repetitive tasks.
SAS data can be published in HTML, PDF, Excel, RTF and other formats using the Output Delivery System, which was first introduced in 2007. SAS Enterprise Guide is SAS's point-and-click interface. It generates code to manipulate data or perform analysis without use of the SAS programming language.
The SAS software suite has more than 200 add-on packages, sometimes called components Some of these SAS components, i.e. add on packages to Base SAS include:
History
Origins
The development of SAS began in 1966 after North Carolina State University re-hired Anthony Barr to program his analysis of variance and regression software so that it would run on IBM System/360 computers. The project was funded by the National Institutes of Health. and was originally intended to analyze agricultural data to improve crop yields. Barr was joined by student James Goodnight, who develope |
https://en.wikipedia.org/wiki/Dedicated%20short-range%20communications | Dedicated short-range communications (DSRC) is a technology for direct wireless exchange of vehicle-to-everything (V2X) and other intelligent transportation systems (ITS) data between vehicles, other road users (pedestrians, cyclists, etc.), and roadside infrastructure (traffic signals, electronic message signs, etc.). DSRC, which can be used for both one- and two-way data exchanges, uses channels in the licensed 5.9 GHz band. DSRC is based on IEEE 802.11p.
History
In October 1999, the United States Federal Communications Commission (FCC) allocated 75 MHz of spectrum in the 5.9 GHz band for DSRC-based ITS uses. By 2003, DSRC was used in Europe and Japan for electronic toll collection. In August 2008, the European Telecommunications Standards Institute (ETSI) allocated 30 MHz of spectrum in the 5.9 GHz band for ITS.
In November 2020, the FCC reallocated the lower 45 MHz of the 75 MHz spectrum to the neighboring 5.8 GHz ISM band for unlicensed non-ITS uses, citing DSRC's lack of adoption. Of the 30 MHz that remained for licensed ITS uses, 10 MHz was kept for DSRC (Channel 180, 5.895–5.905 GHz) and 20 MHz was reserved for a successor to DSRC, LTE-CV2X (Channel 183, 5.905–5.925 GHz).
Applications
Singapore's Electronic Road Pricing scheme plans to use DSRC technology for road use measurement (ERP2) to replace its ERP1 overhead gantry method.
In June 2017, the Utah Department of Transportation and the Utah Transit Authority (UTA) demonstrated the use of DSRC for transit signal priority on SR-68 (Redwood Road) in Salt Lake City, whereby several UTA transit buses equipped with DSRC equipment could request changes to signal timing if they were running behind schedule.
Other applications include:
Emergency warning system for vehicles
Cooperative Adaptive Cruise Control
Cooperative Forward Collision Warning
Intersection collision avoidance
Approaching emergency vehicle warning (Blue Waves)
Vehicle safety inspection
Emergency vehicle signal preemption
Electronic parking payments
Commercial vehicle clearance and safety inspections
In-vehicle signing
Rollover warning
Probe data collection
Highway-rail intersection warning
Electronic toll collection
Standardization
DSRC systems in Europe, Japan and the U.S. are incompatible and have significant differences, including spectrum and channels (5.8 GHz RF, 5.9 GHz RF, infrared), data transmission rates, and protocols.
The European standardization organisation European Committee for Standardization (CEN), sometimes in co-operation with the International Organization for Standardization (ISO) developed some DSRC standards:
EN 12253:2004 Dedicated Short-Range CommunicationPhysical layer using microwave at 5.8 GHz (review)
EN 12795:2002 Dedicated Short-Range Communication (DSRC)DSRC Data link layer: Medium Access and Logical Link Control (review)
EN 12834:2002 Dedicated Short-Range CommunicationApplication layer (review)
EN 13372:2004 Dedicated Short-Range Communication (DSRC)DSRC profiles fo |
https://en.wikipedia.org/wiki/Moving%20average | In statistics, a moving average (rolling average or running average) is a calculation to analyze data points by creating a series of averages of different selections of the full data set. It is also called a moving mean (MM) or rolling mean and is a type of finite impulse response filter. Variations include: simple, cumulative, or weighted forms (described below).
A moving average filter is sometimes called a boxcar filter, especially when followed by decimation.
Given a series of numbers and a fixed subset size, the first element of the moving average is obtained by taking the average of the initial fixed subset of the number series. Then the subset is modified by "shifting forward"; that is, excluding the first number of the series and including the next value in the subset.
A moving average is commonly used with time series data to smooth out short-term fluctuations and highlight longer-term trends or cycles. The threshold between short-term and long-term depends on the application, and the parameters of the moving average will be set accordingly. It is also used in economics to examine gross domestic product, employment or other macroeconomic time series. Mathematically, a moving average is a type of convolution and so it can be viewed as an example of a low-pass filter used in signal processing. When used with non-time series data, a moving average filters higher frequency components without any specific connection to time, although typically some kind of ordering is implied. Viewed simplistically it can be regarded as smoothing the data.
Simple moving average
In financial applications a simple moving average (SMA) is the unweighted mean of the previous data-points. However, in science and engineering, the mean is normally taken from an equal number of data on either side of a central value. This ensures that variations in the mean are aligned with the variations in the data rather than being shifted in time. An example of a simple equally weighted running mean is the mean over the last entries of a data-set containing entries. Let those data-points be . This could be closing prices of a stock. The mean over the last data-points (days in this example) is denoted as and calculated as:
When calculating the next mean with the same sampling width the range from to is considered. A new value comes into the sum and the oldest value drops out. This simplifies the calculations by reusing the previous mean .
This means that the moving average filter can be computed quite cheaply on real time data with a FIFO / circular buffer and only 3 arithmetic steps.
During the initial filling of the FIFO / circular buffer the sampling window is equal to the data-set size thus and the average calculation is performed as a cumulative moving average.
The period selected () depends on the type of movement of interest, such as short, intermediate, or long-term.
If the data used are not centered around the mean, a simple moving average lags b |
https://en.wikipedia.org/wiki/Memwatch | Memwatch is a free programming tool for memory leak detection in C, released under the GNU General Public License.
It is designed to compile and run on any system which has an ANSI C compiler. While it is primarily intended to detect and diagnose memory leaks, it can also be used to analyze a program's memory usage from its provided logging facilities. Memwatch differs from most debugging software because it is compiled directly into the program which will be debugged, instead of being compiled separately and loaded into the program at runtime.
See also
Memory management
Memory debugger
External links
Memwatch home page
Free memory management software |
https://en.wikipedia.org/wiki/S29%20%28ZVV%29 | The S29 is a regional railway line of the Zürich S-Bahn on the ZVV (Zürich transportation network), in the cantons of Zürich, Thurgau and Schaffhausen.
Route
The line operated by Thurbo, runs from to , using the Winterthur–Etzwilen railway line (crossing the River Thur) as far as , and the Lake Line (Seelinie) from there on.
Trains usually run every 30 minutes (as of 2023) and a journey takes 46 minutes.
Alternative connections from Winterthur to Stein am Rhein are:
via Schaffhausen using the S12/S33 of Zürich S-bahn to , and then the S1 of St. Gallen S-Bahn along the Lake Line
via Frauenfeld taking the S24/S30 of Zürich S-bahn or the InterCity/InterRegio to , and then Postauto bus line 825 to Stein am Rhein
Stations
Winterthur
Oberwinterthur
Winterthur Wallrüti
Reutlingen
Seuzach
Dinhard
Thalheim-Altikon
Ossingen
Stammheim
Etzwilen
Stein am Rhein
Rolling stock
The S29 service is operated with THURBO rolling stock (Stadler GTW units).
See also
Rail transport in Switzerland
Trams in Zürich
References
ZVV official website: Routes & zones
Zürich S-Bahn lines
Transport in the canton of Zürich
Canton of Schaffhausen |
https://en.wikipedia.org/wiki/TELCOMP | TELCOMP was a programming language developed at Bolt, Beranek and Newman (BBN) in about 1964 and in use until at least 1974. BBN offered TELCOMP as a paid service, with first revenue in October 1965. The service was sold to On-Line Systems, Inc. (OLS) in 1972. In the United Kingdom, TELCOMP was offered by Time Sharing, Ltd, a partnership between BBN and an entrepreneur named Richard Evans.
It was an interactive, conversational language based on JOSS, developed by BBN after Cliff Shaw from RAND visited the labs in 1964 as part of the NIH survey. It was first implemented on the PDP-1 and was used to provide a commercial time sharing service by BBN in the Boston area and later by Time Sharing Ltd. in the United Kingdom.
In 1996, Leo Beranek said "We even developed a programming language called TELCOMP that to this day, some say was better than the programming language that the industry adopted, namely BASIC."
There were at least three versions: TELCOMP I, TELCOMP II, and TELCOMP III.
TELCOMP I was implemented on the PDP-1, TELCOMP II on the PDP-7 and TELCOMP III on the PDP-10, running on DEC
's TOPS-10 operating system or on BBN's own TENEX operating system.
TELCOMP programs were normally input via a paper tape reader on a Teletype Model 33, which would be connected to a PDP via a modem and acoustic telephone line. Data could be read from the paper tape reader or from the Teletype keyboard. Output was either printed to the Teletype or sent to the paper tape punch. Early versions had no facility for on-line storage of programs or data.
During data input using a Teletype, the user would type a response to a printed prompt. If, instead of hitting , the user hit , another, possibly computed, prompt would be printed on the same line. This process could be repeated for the full width of the line. This unusual feature allowed very compact data entry, comparable to full-screen CRT data entry. It saved paper, and the input section of the form became part of the program's printed output.
A later derivative of TELCOMP called STRINGCOMP was oriented towards string handling. Another BBN JOSS-derivative called FILECOMP was developed for the GE MEDINET system, which was cancelled. The implicit file handling system it contained was influential on the MUMPS global database system.
The initial research for LOGO was carried out in TELCOMP, but only the JOSS-style errors and interaction made it through to the actual language.
Commands
A TELCOMP program was made up of numbered lines, each line referred to as a Step. Steps were grouped into Parts. Each line contained one instruction.
DEMAND Read input from the teletype
DO PART Execute all of the steps in a numbered part and then return
DO STEP Execute a single line and return
DONE Stop execution of current part and return to caller
IF Condition, suffixed to any instruction
FOR Loop, suffixed to any instruction
PLOT Type output to the teletype in the form of |
https://en.wikipedia.org/wiki/Logical%20unit%20number | In computer storage, a logical unit number, or LUN, is a number used to identify a logical unit, which is a device addressed by the SCSI protocol or by Storage Area Network protocols that encapsulate SCSI, such as Fibre Channel or iSCSI.
A LUN may be used with any device which supports read/write operations, such as a tape drive, but is most often used to refer to a logical disk as created on a SAN. Though not technically correct, the term "LUN" is often also used to refer to the logical disk itself.
Examples
To provide a practical example, a typical multi-disk drive has multiple physical SCSI ports, each with one SCSI target address assigned. An administrator may format the disk array as a RAID and then partition this RAID into several separate storage-volumes. To represent each volume, a SCSI target is configured to provide a logical unit. Each SCSI target may provide multiple logical units and thus represent multiple volumes, but this does not mean that those volumes are concatenated. The computer that accesses a volume on the disk array identifies which volume to read or write with the LUN of the associated logical unit.
In another example: a single disk-drive has one physical SCSI port. It usually provides just a single target, which in turn usually provides just a single logical unit whose LUN is zero. This logical unit represents the entire storage of the disk drive.
Use
How to select a LUN: In the early versions of SCSI, an initiator delivers a Command Descriptor Block (CDB) to a target (physical unit) and within the CDB is a 3-bit LUN field to identify the logical unit within the target. In current SCSI, the initiator delivers the CDB to a particular logical unit, so the LUN appears in the transport layer data structures and not in the CDB.
LUN vs. SCSI Device ID: The LUN is not the only way to identify a logical unit. There is also the SCSI Device ID, which identifies a logical unit uniquely in the world. Labels or serial numbers stored in a logical unit's storage volume often serve to identify the logical unit. However, the LUN is the only way for an initiator to address a command to a particular logical unit, so initiators often create, via a discovery process, a mapping table of LUN to other identifiers.
Context sensitive: The LUN identifies a logical unit only within the context of a particular initiator. So two computers that access the same disk volume may know it by different LUNs.
LUN 0: There is one LUN which is required to exist in every target: zero. The logical unit with LUN zero is special in that it must implement a few specific commands, most notably Report LUNs, which is how an initiator can find out all the other LUNs in the target. But LUN zero need not provide any other services, such as a storage volume.
Many SCSI targets contain only one logical unit (so its LUN is necessarily zero). Others have a small number of logical units that correspond to separate physical devices and have fixed LUNs. A |
https://en.wikipedia.org/wiki/Fibre%20Channel%20switch | In the computer storage field, a Fibre Channel switch is a network switch compatible with the Fibre Channel (FC) protocol. It allows the creation of a Fibre Channel fabric, that is the core component of a storage area network (SAN). The fabric is a network of Fibre Channel devices which allows many-to-many communication, device name lookup, security, and redundancy. FC switches implement zoning, a mechanism that disables unwanted traffic between certain fabric nodes.
Fibre Channel switches may be deployed one at a time or in larger multi-switch configurations. SAN administrators typically add new switches as their server and storage needs grow, connecting switches together via fiber optic cable using the standard device ports. Some switch vendors offer dedicated high-speed stacking ports to handle inter-switch connections (similar to existing stackable Ethernet switches), allowing high-performance multi-switch configurations to be created using fewer switches overall.
Major manufacturers of Fibre Channel switches include Brocade(Broadcom), Cisco Systems, and QLogic(Marvell).
Fibre Channel Director
A special variety of a FC switch is the Fibre Channel Director, a switch meant to provide backbone infrastructure in a fabric usually featuring at least 128 ports and high-availability attributes, however the term is loose and varies among to manufacturers. It does not differ from a switch in core FC protocol functionality. The director term itself is derived from legacy ESCON Directors such as the IBM 9032-005.
See also
List of Fibre Channel switches
Host Bus Adapter (HBA)
References
Fibre Channel |
https://en.wikipedia.org/wiki/Bob%20O.%20Evans | Bob Overton Evans (August 19, 1927 – September 2, 2004), also known as "Boe" Evans, was an American computer pioneer and corporate executive at IBM (International Business Machines). He led the groundbreaking development of compatible computers that changed the industry.
Early life and education
Evans was born in Grand Island, Nebraska. In 1951, after earning an engineering degree from Iowa State University, he joined IBM as a junior engineer.
Career
Bob O. Evans joined IBM in a low level engineering position in
1951
as it was developing a new range of "computers" based on vacuum tubes (earlier IBM computers used mechanical
switches). A natural and very
capable manager he moved up the company hierarchy to the position of vice president (development) in
the Data Systems division in 1962. This was apparently created as a position where he had responsibility for the
development of "System/360", a merger of IBMs separate scientific and business computing systems.
In the early 1960s, Evans persuaded IBM’s chairman, Thomas J. Watson Jr., to discontinue the company’s development of a hodgepodge of incompatible computers and instead to embark on the development of a single product line of general-purpose, compatible computers. Until then, researchers thought that the fields of scientific computing and commercial data processing each required their own type of special-purpose computer. Compatibility would ensure that the same software could run on any model of the product line, avoiding a re-programming of software.
Evans had overall responsibility for the hardware and software development of what was announced on April 7, 1964, as the IBM System/360 product line, with six models (later gradually expanded to 18 models) and a performance range factor of 50. IBM – in 1964 a company with an annual revenue of $3.2 billion – invested more than $5 billion in engineering, factories and equipment to develop and manufacture System/360, opening five plants and hiring 60,000 employees. In the lead article about System/360 in the IBM Journal of Research and Development, April 1964, only Evans was acknowledged by name, in these words: “The scope of the compatibility objective and of the whole System/360 undertaking was largely due to B. O. Evans, Data Systems Division Vice President–Development.”
After a stint as president of IBM’s Federal Systems Division, in 1969 Evans was named president of IBM’s Systems Development Division (SDD). He was responsible for the development of what was announced on June 30, 1970 as the IBM System/370 product line, initially with three models, later gradually expanded to 17 models. The hardware was supported by four main operating systems. Any application that had run on System/360 could run on System/370. Equally important, where most of the processing on System/360 had been batch-oriented, with only the beginnings of interactive processing, new features of the System/370 opened the door to explosive growth in online tran |
https://en.wikipedia.org/wiki/Tape%20library | In computer storage, a tape library, sometimes called a tape silo, tape robot or tape jukebox, is a storage device that contains one or more tape drives, a number of slots to hold tape cartridges, a barcode reader to identify tape cartridges and an automated method for loading tapes (a robot). Additionally, the area where tapes that are not currently in a silo are stored is also called a tape library. Tape libraries can contain millions of tapes.
One of the earliest examples was the IBM 3850 Mass Storage System (MSS), announced in 1974.
Design
These devices can store immense amounts of data, ranging from 20 terabytes up to 2.1 exabytes of data as of 2016. Such capacity is multiple thousand times that of a typical hard drive and well in excess of what is capable with network attached storage. Typical entry-level solutions cost around $10,000 USD, while high-end solutions can start at as much as $200,000 USD and cost well in excess of $1 million for a fully expanded and configured library.
For large data-storage, they are a cost-effective solution, with cost per gigabyte as low as 2 cents USD. The tradeoff for their larger capacity is their slower access time, which usually involves mechanical manipulation of tapes. Access to data in a library takes from several seconds to several minutes.
Because of their slow sequential access and huge capacity, tape libraries are primarily used for backups and as the final stage of digital archiving. A typical application of the latter would be an organization's extensive transaction record for legal or auditing purposes. Another example is hierarchical storage management (HSM), in which tape library is used to hold rarely used files from file systems.
Software support
There are several large-scale library-management packages available commercially. Open-source implementations include AMANDA, Bacula, and the minimal mtx program.
Barcode labels
Tape libraries commonly have the capability of optically scanning barcode labels which are attached to each tape, allowing them to automatically maintain an inventory of which tapes are where within the library. Preprinted barcode labels are commercially available or custom labels may be generated using commercial or free software. The barcode label is frequently part of the tape label, information recorded at the beginning of the medium to uniquely identify the tape.
Autoloaders
Smaller tape libraries with only one drive are known as autoloaders. The term autoloader is also sometimes used synonymously with stacker, a device in which the media are loaded necessarily in a sequential manner.
Other types of autoloaders may operate with optical discs (such as compact discs or DVDs) or floppy disks.
See also
Optical jukebox
References
Library |
https://en.wikipedia.org/wiki/Multiple%20instruction%2C%20single%20data | In computing, multiple instruction, single data (MISD) is a type of parallel computing architecture where many functional units perform different operations on the same data. Pipeline architectures belong to this type, though a purist might say that the data is different after processing by each stage in the pipeline. Fault tolerance executing the same instructions redundantly in order to detect and mask errors, in a manner known as task replication, may be considered to belong to this type. Applications for this architecture are much less common than MIMD and SIMD, as the latter two are often more appropriate for common data parallel techniques. Specifically, they allow better scaling and use of computational resources. However, one prominent example of MISD in computing are the Space Shuttle flight control computers.
Systolic arrays
Systolic arrays (< wavefront processors), first described by H. T. Kung and Charles E. Leiserson are an example of MISD architecture. In a typical systolic array, parallel input data flows through a network of hard-wired processor nodes, resembling the human brain which combine, process, merge or sort the input data into a derived result.
Systolic arrays are often hard-wired for a specific operation, such as "multiply and accumulate", to perform massively parallel integration, convolution, correlation, matrix multiplication or data sorting tasks. A systolic array typically consists of a large monolithic network of primitive computing nodes, which can be hardwired or software-configured for a specific application. The nodes are usually fixed and identical, while the interconnect is programmable. More general wavefront processors, by contrast, employ sophisticated and individually programmable nodes which may or may not be monolithic, depending on the array size and design parameters. Because the wave-like propagation of data through a systolic array resembles the pulse of the human circulatory system, the name systolic was coined from medical terminology.
A significant benefit of systolic arrays is that all operand data and partial results are contained within (passing through) the processor array. There is no need to access external buses, main memory, or internal caches during each operation, as with standard sequential machines. The sequential limits on parallel performance dictated by Amdahl's law also do not apply in the same way because data dependencies are implicitly handled by the programmable node interconnect.
Therefore, systolic arrays are extremely good at artificial intelligence, image processing, pattern recognition, computer vision, and other tasks that animal brains do exceptionally well. Wavefront processors, in general, can also be very good at machine learning by implementing self-configuring neural nets in hardware.
While systolic arrays are officially classified as MISD, their classification is somewhat problematic. Because the input is typically a vector of independent values, the sys |
https://en.wikipedia.org/wiki/Dream%20100%20FM | Dream 100 was an Independent Local Radio station owned and operated by Bauer. It broadcast to Tendring and Essex from studios in Colchester and Ipswich, airing the same music programming as sister station Town 102.
The station was folded into Greatest Hits Radio East, as part of a rebrand and merger, on 1 September 2020.
History
The station was founded as medium wave outlet Mellow 1557 on 1557 kHz in 1990. The station launched on 7 October 1990 as an easy listening station for Tendring. In 1992 Southern Radio PLC acquired Mellow, as part of a reverse takeover by the Invicta Radio Group, making it part of the same company that owned Invicta FM, Ocean FM, Southern FM, Invicta Supergold and South Coast Radio.
In 1996 Southern Radio sold Mellow on to Radio First, who went on to sell the station to Tindle Radio Ltd on 1 September 1998; on 19 November, it became an FM station and adopted its present name. Despite this name change, the holding company of the radio station was still known as Mellow 1557 Limited, just as it is to this present day.
Former pirate radio DJ Bill Rollins had been at the Tendring station through its various evolutions, from day 1 in 1990.
In 2006, Town 102 was started up as a sister to Dream 100 from Ipswich, focused on south Suffolk. Programmes between 0600 and 1900 Monday to Friday and between 0800 and 1200 on Saturday and Sunday were then produced in the Town 102 studios near Ipswich for broadcast on Dream 100. Programmes outside these times were shared with all Anglian Radio stations. From 27 February 2017, all programming was shared with Town 102, using the same playout and announcers but with station-unique idents.
Originally broadcasting on 100.2 MHz from a transmitter site at Telstar Nurseries at Cook's Green near Little Clacton in Tendring, Dream moved to the new Clacton Freeview transmitter site in 2011.
Sale to Bauer and GHR merger
On 8 February 2019, Dream 100 and Celador's local radio stations were sold to Bauer. The sale was ratified in March 2020 following an inquiry by the Competition and Markets Authority.
On 27 May 2020, it was announced that Dream 100 would join Bauer's Greatest Hits Radio network.
On 13 July 2020, local programming outside weekday breakfast was replaced by networked output from the GHR network, with Dream 100 retaining its own branding.
In September 2020, the station rebranded as Greatest Hits Radio East and merged with several other local stations. The station's local breakfast show was replaced by a regional drivetime show. Localised news bulletins, traffic updates and advertising were retained. The Town 102 and Dream 100 studio in Ipswich closed.
References
External links
Official website
Media UK
Local radio in Suffolk
Dream
Radio stations established in 1990
1990 establishments in England
Radio stations disestablished in 2020
2020 disestablishments in England
Bauer Radio
Greatest Hits Radio
Defunct radio stations in the United Kingdom |
https://en.wikipedia.org/wiki/BOB%20fm%20%28Hertfordshire%29 | BOB fm was an Independent Local Radio station broadcasting to north Hertfordshire in the United Kingdom. Programming originated from studios at the Old Pump House in Knebworth Park. Launched as Hertbeat FM in 2001, it was subsumed into Heart Hertfordshire on 31 May 2019 shortly after acquisition by media group Communicorp.
History
Early Years: Radio Hertford and Hertbeat FM
In October 1998, following seven years of lobbying of the Radio Authority Radio Hertford was granted a Restricted Service Licence to broadcast for a two-week period to Hertford and surrounding areas.
The Radio Authority then invited applications to apply for a long-term Hertford licence. The Radio Hertford consortium submitted a bid to broadcast as Hertbeat FM competing with a rival entrant, Stag FM, backed by The Daily Mail Radio Group. Citing Radio Hertford's lobbying of the Radio Authority, trial broadcast and emphasis on local content, the HertBeat FM bid was awarded a licence in February 2000. The station proposed "an imaginative, music-led service, targeted at discerning 25 to 54-year olds, with intelligent speech that emphasises local news and information."
The Old Pump House at Knebworth Park was converted into radio studios and production offices. Broadcasting commenced on 3 March 2001 with the inaugural show presented by Robbie Owen, founder and a director of the company, his shows continued throughout the life of the station and on for a period under the new management along with Steve Folland, also amongst the original lineup who continued presenting at the station until November 2013. Other programmes included The Ultimate 80's which was presented by Nigel Cayne.
The Hertbeat FM slogan was "Broadcasting to Hatfield, Hertford, Stevenage, Ware and Welwyn Garden City this is 1067 &9 Hertbeat FM".
July 2005 saw Hertbeat FM owner Radio Hertford (Commercial) acquired by Shadow Radio Holdings, led by Brett Harley, resulting in a change of directors.
The station continued offering locally oriented content, music and request shows using a roster of presenters through the day and night.
Jack FM
On 10 May 2010 HertBeat abruptly rebranded as Jack FM – at that time the third Jack FM licensee operating in the UK. Amongst the reasons for terminating HertBeat was confusion with encroaching rival network Heart.
The Jack format was mostly automated, initially only "Jack's Breakfast" with Steve Folland surviving as a presenter-led show but later complemented with a Saturday "Interactive Brunch" topical news show presented by newsreader Chris Hubbard and a Sunday "All Eighties" music show with Brett Harley. The rest of the schedule included music, snippets from "Jack's Breakfast", news and other local content.
In common with the other UK Jack stations many links between segments were provided by the acerbic Voice of Jack, Paul Darrow, recorded at Jack FM Oxfordshire, often tailored for the local audience. Unlike HertBeat, Jack FM rejected listener's requests, a s |
https://en.wikipedia.org/wiki/Parallel%20array | In computing, a group of parallel arrays (also known as structure of arrays or SoA) is a form of implicit data structure that uses multiple arrays to represent a singular array of records. It keeps a separate, homogeneous data array for each field of the record, each having the same number of elements. Then, objects located at the same index in each array are implicitly the fields of a single record. Pointers from one object to another are replaced by array indices. This contrasts with the normal approach of storing all fields of each record together in memory (also known as array of structures or AoS). For example, one might declare an array of 100 names, each a string, and 100 ages, each an integer, associating each name with the age that has the same index.
Examples
An example in C using parallel arrays:
int ages[] = {0, 17, 2, 52, 25};
char *names[] = {"None", "Mike", "Billy", "Tom", "Stan"};
int parent[] = {0 /*None*/, 3 /*Tom*/, 1 /*Mike*/, 0 /*None*/, 3 /*Tom*/};
for (i = 1; i <= 4; i++) {
printf("Name: %s, Age: %d, Parent: %s \n",
names[i], ages[i], names[parent[i]]);
}
in Perl (using a hash of arrays to hold references to each array):
my %data = (
first_name => ['Joe', 'Bob', 'Frank', 'Hans' ],
last_name => ['Smith','Seger','Sinatra','Schultze'],
height_in_cm => [169, 158, 201, 199 ]);
for $i (0..$#{$data{first_name}}) {
printf "Name: %s %s\n", $data{first_name}[$i], $data{last_name}[$i];
printf "Height in CM: %i\n", $data{height_in_cm}[$i];
}
Or, in Python:
first_names = ["Joe", "Bob", "Frank", "Hans" ]
last_names = ["Smith","Seger","Sinatra","Schultze"]
heights_in_cm = [169, 158, 201, 199 ]
for i in range(len(first_names)):
print("Name: %s %s" % (first_names[i], last_names[i]))
print("Height in cm: %s" % heights_in_cm[i])
# Using zip:
for first_name, last_name, height_in_cm in zip(first_names, last_names, heights_in_cm):
print(f"Name: {first_name} {last_name}")
print(f"Height in cm: {height_in_cm}")
Pros and cons
Parallel arrays have a number of practical advantages over the normal approach:
They can save a substantial amount of space in some cases by avoiding alignment issues. For example, some architectures work best if 4-byte integers are always stored beginning at memory locations that are multiple of 4. If the previous field was a single byte, 3 bytes might be wasted. Many modern compilers can automatically avoid such problems, though in the past some programmers would explicitly declare fields in order of decreasing alignment restrictions.
If the number of items is small, array indices can occupy significantly less space than full pointers, particularly on some architectures.
Sequentially examining a single field of each record in the array is very fast on modern machines, since this amounts to a linear traversal of a single array, exhibiting ideal localit |
https://en.wikipedia.org/wiki/Class%20driver | In computing, a class driver is a type of hardware device driver that can operate a large number of different devices of a broadly similar type. Class drivers are very often used with USB based devices, which share the essential USB protocol in common, and devices with similar functionality can easily adopt common protocols.
Instead of having a separate driver for every kind of CD-ROM device, a class driver can operate a wide variety of CD-ROMs from different manufacturers. To accomplish this the manufacturers make their products compatible with a standardized protocol.
In technical terms, a class driver is used as a base or ancestor class for specific drivers which need to have slightly different or extended functionality, but which can take advantage of the majority of the functionality provided by the class driver. This concept is a key aspect of object oriented programming, which when extended to drivers makes it much easier for hardware vendors to provide driver support for their products.
See also
Windows Driver Model
USB video device class
USB device classes
External links
Microsoft USB class driver discussion
Mac OS X class driver information from Apple
Linux gadget drivers
Device drivers |
https://en.wikipedia.org/wiki/Bodmin%20and%20Wenford%20Railway | The Bodmin and Wenford Railway is a heritage railway at Bodmin in Cornwall, England. Its headquarters are at Bodmin General railway station and it connects with the national rail network at .
The original line was opened in 1887 and 1888. Passenger trains were withdrawn in 1967 and freight traffic in 1983. Heritage trains started to operate in 1990. Most of the trains are typical of those that have operated in Cornwall and west Devon.
History
The Cornwall Railway was authorised to construct a branch from its Plymouth to Falmouth main line but lack of funds prevented this. When the main line did open in 1859 the town of Bodmin was only served by Bodmin Road station which was nearly away. An independent Bodmin and Cornwall Junction Railway was authorised in 1864 to construct the branch but again, a lack of funds prevented the work.
The Great Western Railway (GWR) opened a branch line from Bodmin Road as far as its Bodmin station on 27 May 1887 and completed it on 3 September 1888 to where it connected with the Bodmin and Wadebridge Railway (B&WR). This had opened a line from its own Bodmin station to in 1834, although by 1888 it was operated by the London and South Western Railway (LSWR). This gave Wadebridge access to the main line for the first time as the LSWR's own route from Exeter through did not open until 1895.
Boscarne Junction gave the GWR access to the mineral branch line to Wenford. The principal traffic in later years was china clay which was mostly shipped out through south coast ports such as Fowey and Par, even though this required three reversals (at Boscarne, Bodmin and Bodmin Road).
Passenger services were withdrawn by British Rail (BR) on 30 January 1967 but freight continued to Wadebridge until 2 September 1978 and to Wenford until 3 October 1983. Before that happened, a siding had been opened at the Walker Lines Industrial Estate (near Bodmin General on the line to Bodmin Road) for Fulford Trumps who suppliers of agricultural equipment.
As a heritage railway
The Great Western Society leased the engine shed at Bodmin General from 1969. Its GWR 1361 Class locomotive 1363 was kept there and sometimes gave trips around the station area but was moved to their headquarters at Didcot Railway Centre in 1982.
After freight traffic ceased a Bodmin Railway Preservation Society was formed in 1984, their aim being to reopen the whole of the GWR line to Boscarne Junction. Shares were issued by the Bodmin and Wenford Railway plc in 1985 to finance the purchase and restoration of the line. The Cornish Steam Locomotive Society moved their trains from the Imperial Dry at Bugle to Bodmin in 1987. The North Devon Diesel Group brought their locomotives in 1988 but relocated to in 2008.
A Light Railway Order was granted in 1989. Services started on 17 June 1990 between Bodmin General and Bodmin Parkway (the new name of Bodmin Road since 1983) and a new station was opened at on 17 April 1992. The line to Boscarne Junction reopened o |
https://en.wikipedia.org/wiki/WDS | WDS may refer to:
Computing
Webpack dev server
Wireless distribution system, a wireless network bridging technology
Windows Desktop Search, the implementation of Windows Search for Windows XP and Windows Server 2003
Windows Desktop Sharing, a Microsoft screen-sharing technology
Windows Deployment Services, a technology from Microsoft for network-based installation of Windows operating systems.
World Data System, a system for preserving scientific data
Worldwide Diagnostic System, a service tool for Ford trustmark automobile dealerships worldwide
Wide-area data services, a feature of StorTrends iTX
Other uses
Shiyan Wudangshan Airport (IATA code)
Wavelength-dispersive X-ray spectroscopy, a materials analysis method
Washington Double Star Catalog, an astronomical publication |
https://en.wikipedia.org/wiki/Wireless%20distribution%20system | A wireless distribution system (WDS) is a system enabling the wireless interconnection of access points in an IEEE 802.11 network. It allows a wireless network to be expanded using multiple access points without the traditional requirement for a wired backbone to link them. The notable advantage of WDS over other solutions is that it preserves the MAC addresses of client frames across links between access points.
An access point can be either a main, relay, or remote base station.
A main base station is typically connected to the (wired) Ethernet.
A relay base station relays data between remote base stations, wireless clients, or other relay stations; to either a main, or another relay base station.
A remote base station accepts connections from wireless clients and passes them on to relay stations or to main stations. Connections between "clients" are made using MAC addresses.
All base stations in a wireless distribution system must be configured to use the same radio channel, method of encryption (none, WEP, WPA or WPA2) and the same encryption keys. They may be configured to different service set identifiers (SSIDs). WDS also requires every base station to be configured to forward to others in the system.
WDS may also be considered a repeater mode because it appears to bridge and accept wireless clients at the same time (unlike traditional bridging). However, with the repeater method, throughput is halved for all clients connected wirelessly. This is because Wi-Fi is an inherently half duplex medium and therefore any Wi-Fi device functioning as a repeater must use the Store and forward method of communication.
WDS may be incompatible between different products (even occasionally from the same vendor) since the IEEE 802.11-1999 standard does not define how to construct any such implementations or how stations interact to arrange for exchanging frames of this format. The IEEE 802.11-1999 standard merely defines the 4-address frame format that makes it possible.
Technical
WDS may provide two modes of access point-to-access point (AP-to-AP) connectivity:
Wireless bridging, in which WDS APs (AP-to-AP on local routers AP) communicate only with each other and don't allow wireless stations (STA, also known as wireless clients) to access them
Wireless repeating, in which APs (WDS on local routers) communicate with each other and with wireless STAs
Two disadvantages to using WDS are:
The maximum wireless effective throughput may be halved after the first retransmission (hop) being made. For example, in the case of two APs connected via WDS, and communication is made between a computer which is plugged into the Ethernet port of AP A and a laptop which is connected wirelessly to AP B. The throughput is halved, because AP B has to retransmit the information during the communication of the two sides. However, in the case of communications between a computer which is plugged into the Ethernet port of AP A and a computer which is plugged into |
https://en.wikipedia.org/wiki/Cisco%20PIX | Cisco PIX (Private Internet eXchange) was a popular IP firewall and network address translation (NAT) appliance. It was one of the first products in this market segment.
In 2005, Cisco introduced the newer Cisco Adaptive Security Appliance (Cisco ASA), that inherited many of the PIX features, and in 2008 announced PIX end-of-sale.
The PIX technology was sold in a blade, the FireWall Services Module (FWSM), for the Cisco Catalyst 6500 switch series and the 7600 Router series, but has reached end of support status as of September 26, 2007.
PIX
History
PIX was originally conceived in early 1994 by John Mayes of Redwood City, California and designed and coded by Brantley Coile of Athens, Georgia. The PIX name is derived from its creators' aim of creating the functional equivalent of an IP PBX to solve the then-emerging registered IP address shortage. At a time when NAT was just being investigated as a viable approach, they wanted to conceal a block or blocks of IP addresses behind a single or multiple registered IP addresses, much as PBXs do for internal phone extensions. When they began, RFC 1597 and RFC 1631 were being discussed, but the now-familiar RFC 1918 had not yet been submitted.
The design, and testing were carried out in 1994 by John Mayes, Brantley Coile and Johnson Wu of Network Translation, Inc., with Brantley Coile being the sole software developer. Beta testing of PIX serial number 000000 was completed and first customer acceptance was on December 21, 1994 at KLA Instruments in San Jose, California. The PIX quickly became one of the leading enterprise firewall products and was awarded the Data Communications Magazine "Hot Product of the Year" award in January 1995.
Shortly before Cisco acquired Network Translation in November 1995, Mayes and Coile hired two longtime associates, Richard (Chip) Howes and Pete Tenereillo, and shortly after acquisition 2 more longtime associates, Jim Jordan and Tom Bohannon. Together they continued development on Finesse OS and the original version of the Cisco PIX Firewall, now known as the PIX "Classic". During this time, the PIX shared most of its code with another Cisco product, the LocalDirector.
On January 28, 2008, Cisco announced the end-of-sale and end-of-life dates for all Cisco PIX Security Appliances, software, accessories, and licenses. The last day for purchasing Cisco PIX Security Appliance platforms and bundles was July 28, 2008. The last day to purchase accessories and licenses was January 27, 2009. Cisco ended support for Cisco PIX Security Appliance customers on July 29, 2013.
In May 2005, Cisco introduced the ASA which combines functionality from the PIX, VPN 3000 series and IPS product lines. The ASA series of devices run PIX code 7.0 and later. Through PIX OS release 7.x the PIX and the ASA use the same software images. Beginning with PIX OS version 8.x, the operating system code diverges, with the ASA using a Linux kernel and PIX continuing to use the traditional Finesse/PI |
https://en.wikipedia.org/wiki/List%20of%20African%20countries%20by%20GDP%20%28nominal%29 | Gross domestic product (GDP) is the market value of all final goods and services from a nation in a given year. Countries in Africa are sorted according to data from the International Monetary Fund.
The figures presented here do not take into account differences in the cost of living in different countries, and the results can vary greatly from one year to another based on fluctuations in the exchange rates of the country's currency. Such fluctuations may change a country's ranking from one year to the next, even though they often make little or no difference to the standard of living of its population.
Comparisons of national wealth are also frequently made on the basis of purchasing power parity (PPP), to adjust for differences in the cost of living in different countries. PPP largely removes the exchange rate problem, but has its own drawbacks; it does not reflect the value of economic output in international trade, and it also requires more estimation than nominal GDP. On the whole, PPP per capita figures are more narrowly spread than nominal GDP per capita figures.
The 2023 estimates are as follows:
See also
List of African countries by GDP (PPP)
List of African countries by Human Development Index
Economy of Africa
References
GDP
GDP |
https://en.wikipedia.org/wiki/Infographic | Infographics (a clipped compound of "information" and "graphics") are graphic visual representations of information, data, or knowledge intended to present information quickly and clearly. They can improve cognition by using graphics to enhance the human visual system's ability to see patterns and trends. Similar pursuits are information visualization, data visualization, statistical graphics, information design, or information architecture. Infographics have evolved in recent years to be for mass communication, and thus are designed with fewer assumptions about the readers' knowledge base than other types of visualizations. Isotypes are an early example of infographics conveying information quickly and easily to the masses.
Overview
Infographics have been around for many years and recently the increase of the number of easy-to-use, free tools have made the creation of infographics available to a large segment of the population. Social media sites such as Facebook and Twitter have also allowed for individual infographics to be spread among many people around the world. Infographics are widely used in the age of short attention span.
In newspapers, infographics are commonly used to show the weather, as well as maps, site plans, and graphs for summaries of data. Some books are almost entirely made up of information graphics, such as David Macaulay's The Way Things Work. The Snapshots in USA Today are also an example of simple infographics used to convey news and current events.
Modern maps, especially route maps for transit systems, use infographic techniques to integrate a variety of information, such as the conceptual layout of the transit network, transfer points, and local landmarks. Public transportation maps, such as those for the Washington Metro and the London Underground map, are well-known infographics. Public places such as transit terminals usually have some sort of integrated "signage system" with standardized icons and stylized maps.
In his 1983 "landmark book" The Visual Display of Quantitative Information, Edward Tufte defines "graphical displays" in the following passage:
While contemporary infographics often deal with "qualitative" or soft subjects, generally speaking, Tufte's 1983 definition still speaks, in a broad sense, to what infographics are, and what they do—which is to condense large amounts of information into a form where it will be more easily absorbed by the reader.
History
Early history
In 1626, Christoph Scheiner published the Rosa Ursina sive Sol, a book that revealed his research about the rotation of the sun. Infographics appeared in the form of illustrations demonstrating the Sun's rotation patterns.
In 1786, William Playfair, an engineer and political economist, published the first data graphs in his book The Commercial and Political Atlas. To represent the economy of 18th Century England, Playfair used statistical graphs, bar charts, line graphs, area charts, and histograms. In his work, Stati |
https://en.wikipedia.org/wiki/Struct%20%28C%20programming%20language%29 | A struct in the C programming language (and many derivatives) is a composite data type (or record) declaration that defines a physically grouped list of variables under one name in a block of memory, allowing the different variables to be accessed via a single pointer or by the struct declared name which returns the same address. The struct data type can contain other data types so is used for mixed-data-type records such as a hard-drive directory entry (file length, name, extension, physical address, etc.), or other mixed-type records (name, address, telephone, balance, etc.).
The C struct directly references a contiguous block of physical memory, usually delimited (sized) by word-length boundaries. It corresponds to the similarly named feature available in some assemblers for Intel processors. Being a block of contiguous memory, each field within a struct is located at a certain fixed offset from the start.
Because the contents of a struct are stored in contiguous memory, the sizeof operator must be used to get the number of bytes needed to store a particular type of struct, just as it can be used for primitives. The alignment of particular fields in the struct (with respect to word boundaries) is implementation-specific and may include padding, although modern compilers typically support the #pragma pack directive, which changes the size in bytes used for alignment.
In the C++ language, a struct is identical to a C++ class but has a different default visibility: class members are private by default, whereas struct members are public by default.
In other languages
The struct data type in C was derived from the ALGOL 68 struct data type.
Like its C counterpart, the struct data type in C# (Structure in Visual Basic .NET) is similar to a class. The biggest difference between a struct and a class in these languages is that when a struct is passed as an argument to a function, any modifications to the struct in that function will not be reflected in the original variable (unless pass-by-reference is used).
This differs from C++, where classes or structs can be statically allocated or dynamically allocated either on the stack (similar to C#) or on the heap, with an explicit pointer. In C++, the only difference between a struct and a class is that the members and base classes of a struct are public by default. (A class defined with the class keyword has private members and base classes by default.)
Declaration
The general syntax for a struct declaration in C is:
struct tag_name {
type member1;
type member2;
/* declare as many members as desired, but the entire structure size must be known to the compiler. */
};
Here tag_name is optional in some contexts.
Such a struct declaration may also appear in the context of a typedef declaration of a type alias or the declaration or definition of a variable:
typedef struct tag_name {
type member1;
type member2;
} struct_alias;
Initialization
There are three ways to initialize a str |
https://en.wikipedia.org/wiki/Microcell | A microcell is a cell in a mobile phone network served by a low power cellular base station (tower), covering a limited area such as a mall, a hotel, or a transportation hub. A microcell is usually larger than a picocell, though the distinction is not always clear. A microcell uses power control to limit the radius of its coverage area.
Typically the range of a microcell is less than two kilometers wide, whereas standard base stations may have ranges of up to 35 kilometres (22 mi). A picocell, on the other hand, is 200 meters or less, and a femtocell is on the order of 10 meters, although AT&T calls its femtocell that has a range of , a "microcell". AT&T uses "AT&T 3G MicroCell" as a trade mark and not necessarily the "microcell" technology, however.
A microcellular network is a radio network composed of microcells.
Rationale
Like picocells, microcells are usually used to add network capacity in areas with very dense phone usage, such as train stations. Microcells are often deployed temporarily during sporting events and other occasions in which extra capacity is known to be needed at a specific location in advance.
Cell size flexibility is a feature of 2G (and later) networks and is a significant part of how such networks have been able to improve capacity. Power controls implemented on digital networks make it easier to prevent interference from nearby cells using the same frequencies. By subdividing cells, and creating more cells to help serve high density areas, a cellular network operator can optimize the use of spectrum and ensure capacity can grow. By comparison, older analog systems have fixed limits beyond which attempts to subdivide cells simply would result in an unacceptable level of interference.
Microcell/picocell-only networks
Certain mobile phone systems, notably PHS and DECT, only provide microcellular (and Pico cellular) coverage. Microcellular systems are typically used to provide low cost mobile phone systems in high-density environments such as large cities. PHS is deployed throughout major cities in Japan as an alternative to ordinary cellular service. DECT is used by many businesses to deploy private license-free microcellular networks within large campuses where wireline phone service is less useful. DECT is also used as a private, non-networked, cordless phone system where its low power profile ensures that nearby DECT systems do not interfere with each other.
A forerunner of these types of network was the CT2 cordless phone system, which provided access to a looser network (without handover), again with base stations deployed in areas where large numbers of people might need to make calls. CT2's limitations ensured the concept never took off. CT2's successor, DECT, was provided with an interworking profile, GIP so that GSM networks could make use of it for microcellular access, but in practice the success of GSM within Europe, and the ability of GSM to support microcells without using alternative technologies, me |
https://en.wikipedia.org/wiki/Idoru | Idoru is the second book in William Gibson's Bridge trilogy. Idoru is a science-fiction novel set in a postmodern, dystopian, cyberpunk future. One of the main characters, Colin Laney, has a talent for identifying nodal points, analogous to Gibson's own:
Plot summary
In the post Tokyo/San Francisco earthquake world of the early 21st century, Colin Laney is referred to agents of rock and roll megastar Rez (of the musical group Lo/Rez) for a job using his peculiar talent of sifting through vast amounts of mundane data to find "nodal points" of particular relevance. Rez has claimed to want to marry a synthetic personality named Rei Toei, the Idoru (Japanese Idol) of the title, a claim stranger than usual and therefore questioned by his loyal staff, particularly by his head of security, Keith Blackwell. Blackwell believes that someone is manipulating Rez, and wants Laney to find out who. Simultaneously, the Seattle chapter of the Lo/Rez fan club is discussing exactly the same topic of the unbelievable marriage of human and AI construct. Fourteen-year-old Chia Pet McKenzie is chosen by the group to go to Tokyo and meet with the Tokyo chapter to find out what is really happening. On the flight she meets a woman named Maryalice, who dupes her into unwittingly carrying a contraband item through customs in Tokyo.
Laney accepts his new position warily, but is conflicted throughout much of the novel by his past involvement with a powerful infotainment organization, "SlitScan", which thrives on destroying media personalities by exposing their secrets. In the course of this earlier job he feels responsible for the death of an innocent party. His talent had allowed him a foreshadowing of a probable suicide, but SlitScan had tried to limit Laney's role to passive observer. However, Laney's conscience snapped -- he attempted at the last moment to stop the suicide, but instead became mired in a scandal. Yet another organization claiming to be a media watchdog steps in and tries to pull Laney away from SlitScan to use his story to expose SlitScan’s involvement in illegal spying. This goes awry and Laney is left alone, high and dry. Further complicating Laney’s life is that Kathy Torrance, his controller from SlitScan, is attempting to blackmail him with false evidence into betraying his current employers, Lo/Rez, by exposing whatever secret she thinks they are hiding.
Chia, after being brought to the club run by Maryalice’s boyfriend Eddie, is helped to escape by one of the club’s employees who perceives that she is in danger. She takes with her the contraband which was slipped into her luggage. When she meets with the local Tokyo chapter of the Lo/Rez fan club, she is disappointed by their seeming indifference to the impending “wedding," and they inform her this is merely an unfounded rumor. Disbelieving, Chia decides to investigate on her own and seeks the help of her host Mitsuko’s brother Masahiko, an otaku who is a member of the hacker commun |
https://en.wikipedia.org/wiki/Westlink%20M7 | The Westlink M7 is a tolled urban motorway in Sydney, New South Wales that is part of the Sydney Orbital Network. Owned by the NorthWestern Roads (NWR) Group, it connects three motorways: the M5 South-West Motorway at Prestons, the M4 Western Motorway at Eastern Creek, and the M2 Hills Motorway at Baulkham Hills.
Route
Westlink M7 begins at the Roden Cutler Interchange, a Y-junction with the M31 Hume Motorway and M5 South-West Motorway at Prestons, and weaves to the west of Liverpool to the junction of Elizabeth Road and Wallgrove Road in Abbotsbury. From then on it runs parallel to Wallgrove Road north towards the Great Western Highway and the Light Horse interchange, a stack junction with the M4. Continuing north, it leads to Minchinbury and follows alongside Rooty Hill Road up to Dean Park at an exit with Rooty Hill Road North and Richmond Road.
From this junction, Westlink M7 turns eastward along the preserved Castlereagh Freeway corridor through Quakers Hill and Kings Langley up to the interchange with Old Windsor Road to Norwest Business Park and continues southeast to reconcile with the existing M2 Hills Motorway in Baulkham Hills. It is 4 lanes (2 lanes each way) for its entire length.
The M7 cycleway runs parallel to Westlink M7.
Light Horse Interchange
The Light Horse Interchange is the junction of the M4 and M7 motorways. The stack interchange is the largest of its type in the Southern Hemisphere. It was named in honour of an Australian World War One formation, the Australian Light Horse.
History
Western Sydney is the fastest growing part of the Sydney metropolitan area. Pennant Hills and Woodville Roads (signed as Ring Road 5, then as State Route 55), then later Cumberland Highway (State Route 77), were originally buult as bypasses for Sydney, had instead become primary arteries through the western suburbs.
In the late 1980s, with the intended construction of a BHP steel mill in Rooty Hill, Blacktown City Council required BHP to construct an arterial route that allowed industrial traffic to bypass the Rooty Hill CBD and the newly opened Davis Overpass. A two-lane road named Phillip Parkway was constructed between Woodstock Avenue and Eastern Road and opened to traffic in July 1992. The alignment of Phillip Parkway would eventually be the preferred alignment of the Western Sydney Orbital two years later in 1994.
By the late 1990s and early 2000s, Western Sydney had become the third-biggest producer of Australia's GDP, after the Sydney CBD and Melbourne. The growth of industrial and residential areas brought about a massive increase in traffic on its local roads. This led to the planning of the Western Sydney Orbital, which, among its original purposes, was to serve the stillborn second international airport at Badgerys Creek.
In January 2001 the federal government made a commitment to progressively contribute A$356 million to the Western Sydney Orbital project, with the remaining A$1.5 billion required for the design and co |
https://en.wikipedia.org/wiki/PsycINFO | PsycINFO is a database of abstracts of literature in the field of psychology. It is produced by the American Psychological Association and distributed on the association's APA PsycNET and through third-party vendors. It is the electronic version of the now-ceased Psychological Abstracts. In 2000, it absorbed PsycLIT which had been published on CD-ROM.
PsycINFO contains citations and summaries from the 19th century to the present of journal articles, book chapters, books, and dissertations.
Overview
The database, which is updated weekly, contained over 3.5 million records as of October 2013. Approximately 175,000 records were added to the database in 2012.
Coverage
More than 2,540 peer-reviewed journal titles are included in the database, and they make up 78% of the overall content. Journals are included if they are archival, scholarly, peer-reviewed, and regularly published with titles, abstracts, and keywords in English. As of October 2013, over 1,700 journal titles were included in their entirety (i.e. "cover to cover"). Articles were selected for psychological relevance from the remaining titles.
Chapters from authored and edited books make up 11% of database, while entire authored and edited books make up 4% of the database. Books are selected if they are scholarly, professional, or research-based, English-language, published worldwide, and relevant to psychology.
Dissertations are selected from Dissertation Abstracts International (A and B), and make up 10% of database. They are selected on basis of classification in DAI in sections with psychological relevance. The database contains abstracts in dissertation records starting from 1995.
Publications from at least 50 countries are included, with journals in more than 27 languages, and non-English titles in Roman alphabets from 1978 to the present.
Record contents
Each record contains a bibliographic citation, abstract, index terms from the Thesaurus of Psychological Index Terms, keywords, classification categories, population information, the geographical location of the research population, and cited references for journal articles, book chapters, and books, mainly from 2001 to present. Records of books include the book's table of contents.
Abstracts range from 1995 to present, and virtually 100% of records have abstracts (0.007% no abstracts). For non-dissertation documents added from 1967 to present, 99.2% contain abstracts.
The 11th Edition (print) of Thesaurus of Psychological Index Terms was released in July 2007, containing 200 new terms. There are more than 8,400 controlled terms and cross-references, with hierarchical, alphabetical, and subject arrangements. Records are indexed with the most specific term applicable, and major and minor terms assigned, with a maximum of 15 total terms, 5 major terms. The Thesaurus, no longer available in print format, is included with all PsycINFO licenses and is updated regularly.
The classification system consists of 22 major categori |
https://en.wikipedia.org/wiki/Blinkenlights | Blinkenlights is a neologism for diagnostic lights usually on the front panels of old mainframe computers, minicomputers, many early microcomputers, and modern network hardware. It has been seen as a skeuomorph on many modern office machines, most notably on photocopiers.
Etymology
This term is taken from a famous blackletter-Gothic warning sign written in a mangled form of German that was common in computer rooms in English-speaking countries from the early 1960s. One version read:
Some versions of the sign end with the word blinkenlights.
The sign dates back as far as 1955 at IBM, and a copy was reported at London University's Atlas computer facility.
Although the sign might initially appear to be in German and uses an approximation of German grammar, it is composed largely of words that are either near-homonyms of English words or (in the cases of the longer words) actual English words that are rendered in a faux-German spelling. As such, the sign is generally comprehensible by many English speakers regardless of whether they have any fluency in German, but mostly incomprehensible to German speakers with no knowledge of English. Much of the humor in these signs was their intentionally incorrect language.
Michael J. Preston relates the sign as being posted above photocopiers in offices as a warning not to mess with the machine in the first print reference from 1974. The sign is also reported to have been seen on an electron microscope at the Cavendish Laboratory in the 1950s. Such pseudo-German parodies were common in Allied machine shops during and following World War II, and an example photocopy is shown in the Jargon File.
The Jargon File also mentions that German hackers had developed their own versions of the blinkenlights poster, in fractured English:
Actual blinkenlights
The bits and digits in the earliest mechanical and vacuum tube-based computers were typically large and few, making it easy to see and often hear activity. Then, for decades, computers incorporated arrays of indicator lamps in their control panels, indicating the values carried on the address, data, and other internal buses, and in various registers. These could be used for diagnosing or "single-stepping" a halted machine, but even with the machine operating normally, a skilled operator could interpret the high-speed blur of the lamps to tell which section of a large program was executing, whether the program was caught in an endless loop, and so on.
With rising processor clock rates, increased memory sizes, and improved interactive debugging tools, such panel lights gradually lost their usefulness, though today most devices have indicators showing power on/off status, hard disk activity, network activity, and other indicators of "signs of life".
The original IBM PC could have a diagnostics card plugged into it that used LEDs to show what part of the memory it was using, and show the memory address and data code on 7-segment displays whenever the card was m |
https://en.wikipedia.org/wiki/Gulf%20of%20execution | In human computer interaction, the gulf of execution is the gap between a user's goal for action and the means to execute that goal. Usability has as one of its primary goals to reduce this gap by removing roadblocks and steps that cause extra thinking and actions that distract the user's attention from the task intended, thereby preventing the flow of his or her work, and decreasing the chance of successful completion of the task. Similarly, there is a gulf of evaluation that applies to the gap between an external stimulus and the time a person understands what it means. Both phrases are first mentioned in Donald Norman's 1986 book User Centered System Design: New Perspectives on Human-computer Interaction.
Example
This can be illustrated through the discussion of a VCR problem. Let us imagine that a user would like to record a television show. They see the solution to this problem as simply pressing the Record button. However, in reality, to record a show on a VCR, several actions must be taken:
Press the record button.
Specify time of recording, usually involving several steps to change the hour and minute settings.
Select channel to record on - either by entering the channel's number or selecting it with up/down buttons.
Save the recording settings, perhaps by pressing an "OK" or "menu" or "enter" button.
The difference between the user's perceived execution actions and the required actions is the gulf of execution.
Example of Gulf of Execution:
An example of gulf of execution is, if a user wants to save a document in a word processing software, but they are unsure how to access the "Save" feature or they cannot find it easily due to unclear labeling or hidden menus, it creates a Gulf of Execution. The user's intention to save the document is not aligned with the system's interface or available actions, causing frustration and making it challenging for the user to complete the task.
Example of Gulf of Evaluation:
An example of the Gulf of Evaluation can be seen in the context of a voice-controlled virtual assistant, such as Amazon Alexa or Google Assistant. Imagine a user giving a command to the virtual assistant to play a specific song from their music library. After issuing the command, the virtual assistant responds by playing a different song or fails to understand the command altogether.
In this scenario, the Gulf of Evaluation is wide because the user may have difficulty understanding why the virtual assistant played the wrong song or why it didn't recognize the command. The user's mental model of the system's response and behavior may not align with the actual outcome, leading to frustration and confusion. The system's feedback, in this case, is not adequately helping the user evaluate whether their desired action was successful or not.
To bridge the Gulf of Evaluation, designers could improve the feedback provided by the virtual assistant. For example, the assistant could respond with a confirmation message, such as "Pla |
https://en.wikipedia.org/wiki/Robin%27s%20Nest%20%28TV%20series%29 | Robin's Nest is a British sitcom made by Thames Television, which aired on the ITV network for six series from 11 January 1977 to 31 March 1981. It saw Richard O'Sullivan reprise the role of Robin Tripp, one of the lead characters in the sitcom Man About the House, which had ended on 7 April 1976, and co-starred Tessa Wyatt as Robin's girlfriend – and later wife – Vicky and Tony Britton as her father. As well as playing a couple in Robin's Nest, O'Sullivan and Wyatt were a couple in real life at the time having one son, Jamie O'Sullivan.
Format
In the first episode, Robin and Vicky, who share a flat over a Chinese take-away, discover that the tenants have disappeared owing rent to the landlord, Vicky's father James Nicholls. It is the practical Vicky who comes up with the perfect solution: Robin should take over the take-away and convert it into a bistro (The "Robin's Nest" of the title). Robin cannot afford to go it alone, so he has to go cap-in-hand to Vicky's father (Tony Britton), to ask him to be his business partner. Although James disapproves of Robin (believing him to be beneath his daughter), he knows a sensible business deal when it is offered to him – despite his failings, Robin is a brilliant chef – and he agrees. Tension and misunderstandings arise due to their mismatched relationship.
Creators and writers Brian Cooke and Johnnie Mortimer had to gain special permission from the Independent Broadcasting Authority (IBA), then the regulatory body for commercial television in Britain, to be able to portray an unmarried couple living together; special concern arose at scenes in which Robin and Vicky were seen in an obvious state of undress in bed. In 1978, Robin and Vicky married and two years later had a set of twins, whom they eventually name Lucy and James Alexander Tripp. At the end of the last episode, Vicky tells Robin that she's pregnant again.
Other characters
Other characters included:
The one-armed Irish kitchen hand Albert Riddle (David Kelly), who always broke more crockery than he cleaned, and who once asked Robin's culinary advice; unable to cook egg on toast, he asked Robin "How do you stop the egg dribbling into the bottom of the toaster, Mr Tripp?".
Vicky's mother Marion (divorced from her father) would occasionally appear, played first by Honor Blackman, later by Barbara Murray.
Gertrude, Albert's girlfriend, played by ex-Crossroads actress Peggy Aitchison.
Robin's Nest screenwriter George Layton appeared as Vernon Potter, a former student who was at college with Robin Tripp, in a few episodes.
Production props
The Daimler Double Six car used in the series by Vicky's father James Nicholls is still in existence (as at Jan 2021) according to DVLA records.
Theme music score
Star of the show Richard O'Sullivan wrote the theme music for the programme, which was arranged and performed by The Shadows' Brian Bennett.
Foreign adaptations
The show was remade in the United States as Three's a Crowd, a sequel to Three's |
https://en.wikipedia.org/wiki/Golem%20%28ILP%29 | Golem is an inductive logic programming algorithm developed by Stephen Muggleton and Feng. It uses the technique relative least general generalization proposed by Gordon Plotkin. Therefore, only positive examples are used and the search is bottom-up.
Negative examples can be used to reduce the size of the hypothesis by deleting useless literals from the body clause.
Inductive logic programming |
https://en.wikipedia.org/wiki/COMEFROM | In computer programming, COMEFROM (or COME FROM) is an obscure control flow structure used in some programming languages, originally as a joke. COMEFROM is the inverse of GOTO in that it can take the execution state from any arbitrary point in code to a COMEFROM statement.
The point in code where the state transfer happens is usually given as a parameter to COMEFROM. Whether the transfer happens before or after the instruction at the specified transfer point depends on the language used. Depending on the language used, multiple COMEFROMs referencing the same departure point may be invalid, be non-deterministic, be executed in some sort of defined priority, or even induce parallel or otherwise concurrent execution as seen in Threaded Intercal.
A simple example of a "COMEFROM x" statement is a label x (which does not need to be physically located anywhere near its corresponding COMEFROM) that acts as a "trap door". When code execution reaches the label, control gets passed to the statement following the COMEFROM. This may also be conditional, passing control only if a condition is satisfied, analogous to a GOTO within an IF statement. The primary difference from GOTO is that GOTO only depends on the local structure of the code, while COMEFROM depends on the global structure – a GOTO transfers control when it reaches a line with a GOTO statement, while COMEFROM requires scanning the entire program or scope to see if any COMEFROM statements are in scope for the line, and then verifying if a condition is hit. The effect of this is primarily to make debugging (and understanding the control flow of the program) extremely difficult, since there is no indication near the line or label in question that control will mysteriously jump to another point of the program – one must study the entire program to see if any COMEFROM statements reference that line or label.
Debugger hooks can be used to implement a COMEFROM statement, as in the humorous Python goto module; see below. This also can be implemented with the gcc feature "asm goto" as used by the Linux kernel configuration option CONFIG_JUMP_LABEL. A no-op has its location stored, to be replaced by a jump to an executable fragment that at its end returns to the instruction after the no-op.
History
COMEFROM was initially seen in lists of joke assembly language instructions (as 'CMFRM'). It was elaborated upon in a Datamation article by R. Lawrence Clark in 1973, written in response to Edsger Dijkstra's letter Go To Statement Considered Harmful. COMEFROM was eventually implemented in the C-INTERCAL variant of the esoteric programming language INTERCAL along with the even more obscure 'computed COMEFROM'. There were also Fortran proposals for 'assigned COME FROM' and a 'DONT' keyword (to complement the existing 'DO' loop).
On 1 April 2004, Richie Hindle published an implementation of both GOTO and COMEFROM for the Python programming language. Despite being released on April Fools' Day and not being inten |
https://en.wikipedia.org/wiki/Hogan%27s%20Alley%20%28video%20game%29 | is a light gun shooter video game developed and published by Nintendo. It was released for the Family Computer in 1984 and then the arcade Nintendo VS. System and Nintendo Entertainment System in 1985. It was one of the first hit video games to use a light gun as an input device, along with Nintendo's Duck Hunt (1984). The game presents players with "cardboard cut-outs" of gangsters and innocent civilians. The player must shoot the gangs and spare the innocent people. It was a major arcade hit in the United States and Europe.
In real life, Hogan's Alley was a shooting range on the grounds of the Special Police School at Camp Perry, a training facility for the National Guard of the United States.
Gameplay
The game begins with three cardboard cutouts moving into position against a blank wall and turning to face the player. The cutouts display a mixture of gangsters and innocent/friendly people; the player must react quickly and shoot only the gangsters. In later rounds, the backdrop changes from the blank wall to a city block, with some cutouts already exposed as they emerge into view. The player is confronted with five cutouts in each of these latter rounds.
After five rounds apiece in the wall and city block, a bonus round is played. Here, the player has a limited supply of ammunition with which to shoot up to ten tin cans thrown from one side of the screen, trying to bounce them onto ledges at the opposite side for points. After this round, the player returns to the wall rounds and the game continues at an increased speed.
Shooting an innocent person, or failing to shoot a gangster, costs the player one life, which is indicated by the "MISS" counter incrementing by one. No lives can be lost in the bonus round. When all lives are lost, indicated by the "MISS" counter reaching 10 or more, the game is over.
Release
The game is available on the Nintendo Entertainment System and as a Nintendo VS. System Game Pak, which was installed into VS. System Arcade cabinets.
In the United States, Hogan's Alley was released for the Nintendo Entertainment System in 1985 as one of the original 17 launch titles for the system. There are three modes: "Hogan's Alley A" (the blank wall), "Hogan's Alley B" (the town), and "Trick Shot" (shooting soda cans to bounce them onto ledges).
Ports
A modified version of Hogan's Alley using the Wii Remote in place of the NES Zapper was released for the Wii U Virtual Console on January 7, 2016 in North America.
Reception
In North America, the Nintendo Vs. System version of Hogan's Alley became popular in arcades and popularized light gun video games along with Duck Hunt in 1985. In the United States, Hogan's Alley had topped the RePlay arcade charts by November 1985 In Europe, it had also become a very popular arcade game by 1986.
Computer and Video Games magazine gave the arcade version a generally positive review, calling it "a pleasant change" from the space shooters popular in arcades at the time, but noted the game |
https://en.wikipedia.org/wiki/Erna%20Schneider%20Hoover | Erna Schneider Hoover (born June 19, 1926) is an American mathematician notable for inventing a computerized telephone switching method which "revolutionized modern communication". It prevented system overloads by monitoring call center traffic and prioritizing tasks on phone switching systems to enable more robust service during peak calling times. At Bell Laboratories where she worked for over 32 years, Hoover was described as an important pioneer for women in the field of computer technology.
Early life
Erna Schneider was born on June 19, 1926, in Irvington, New Jersey. Her family lived in South Orange, New Jersey and her father was a dentist and her mother was a teacher. She had a younger brother who died from polio at the age of five. She loved swimming, sailing, canoeing, and was interested in science at an early age. According to one source, she read the biography of Marie Curie which suggested to her that she could succeed in a scientific field despite the prevailing ideas about gender roles at the time. She graduated from Columbia High School in nearby Maplewood in 1944, which would later induct her into its hall of fame in 2007.
Hoover attended Wellesley College where she studied classical and medieval philosophy and history. She graduated from Wellesley in 1948 with honors, earning a bachelor's degree, and she was inducted into Phi Beta Kappa and was honored as a Durant Scholar. She earned her PhD from Yale University in philosophy and foundations of mathematics in 1951.
Career
Hoover was a professor at Swarthmore College from 1951 to 1954 where she taught philosophy and logic. However, she had been unable to win a tenure-track position, possibly because of her gender and marital status, according to one view. In 1953, she married Charles Wilson Hoover, Jr., and he was very supportive of his wife's career pursuits. In 1954, she joined Bell Labs as a senior technical associate, and was promoted in 1956. According to one source, the internal training program was the "equivalent of a master's degree in computer science." Switching systems were moving from electronic to computer-based technologies. Problems happened when a call center would be inundated with thousands of calls in a short amount of time, overwhelming the unreliable electronic relays, and causing the entire system to "freeze up."
Hoover used her knowledge of symbolic logic and feedback theory to program the control mechanisms of a call center to use data about incoming calls to impose order on the whole system. It used computer electronic methods to monitor the frequency of incoming calls at different times. Her method gave priority to processes that were concerned with the input and output of the switch over processes that were less important such as record keeping and billing. The computer, as a result, would adjust the call center's acceptance rate automatically, greatly reducing the overloading problem. The system became known as stored program control.
Hoover's thi |
https://en.wikipedia.org/wiki/Don%27t%20Make%20Me%20Think | Don't Make Me Think is a book by Steve Krug about human–computer interaction and web usability. The book's premise is that a good software program or web site should let users accomplish their intended tasks as easily and directly as possible. Krug points out that people are good at satisficing, or taking the first available solution to their problem, so design should take advantage of this. He frequently cites Amazon.com as an example of a well-designed web site that manages to allow high-quality interaction, even though the web site gets bigger and more complex every day.
The book is intended to exemplify brevity and focus. The goal, according to the book's introduction, was to make a text that could be read by an executive on a two-hour airplane flight.
Originally published in 2000, the book was revised in 2005 and 2013 and has sold more than 300,000 copies.
In 2010, the author published a sequel, Rocket Surgery Made Easy, which explains how anyone working on a web site, mobile app, or desktop software can do their own usability testing to ensure that what they're building will be usable.
The book has been referenced in college courses and online courses on usability.
References
External links
Book description on author's website, www.sensible.com
Human–computer interaction
2000 non-fiction books |
https://en.wikipedia.org/wiki/Massively%20parallel%20%28disambiguation%29 | Massively parallel in computing is the use of a large number of processors to perform a set of computations in parallel (simultaneously).
Massively parallel may also refer to:
Massive parallel sequencing, or massively parallel sequencing, DNA sequencing using the concept of massively parallel processing
Massively parallel signature sequencing, a procedure used to identify and quantify mRNA transcripts
See also
MPQC (Massively Parallel Quantum Chemistry), a computational chemistry software program |
https://en.wikipedia.org/wiki/Telecommunications%20rating | In telecommunications rating is the activity of determining the cost of a particular call. The rating process involves converting call-related data into a monetary-equivalent value.
Call-related data is generated at various points in the network or measurements may be taken by third party equipment such as network probes. Generally this data is something quantifiable and specific. The usage data so gathered is then either packaged by the equipment or it may be sent to a charging gateway.etc.
Rating systems typically use some or all of the following types of data about a call:
Time property of the call (day of week, date, time of day)
Amount of usage (Duration of call, amount of data, number of messages, number of songs)
Destination of the call (land line, overseas, etc.)
Origin of call/ Location of the caller (for mobile networks)
Premium charges (third party charges for premium content, cost of physical items such as movie tickets)
Generally individual calls are rated and then the rated amounts are sent to a billing system to provide a bill to the subscriber. Often the rating system will be a module of a larger "Billing System" architecture.
A rating system must be adapted to the constantly changing pricing policies, which have the strategic goal of stimulating demand.
Data structures
To perform the rating calculations it is necessary to produce a Call detail record/EDR. A Call detail record (CDR, also known as Call Data Record) is "a record of a call setup and completion", and its format "varies among telecom providers or programs", which some allow to be configured by the user.
EDR stands for Event Data/Detail Record. EDR records are used for systems that charge more than calls - content. e.g. buying ring tones. The generated CDR/EDR may not be in a form suitable for the particular rating system. In this case a piece of software, known as the mediation system, may be required to render the data into a form useful by the rating system. The mediation system is also useful for gathering data from various sources to aggregate into one record.
In spoken language CDR usually refers to any type of record: voice, SMS or data.
Design choices: support for non programming configuration
In complex systems there's the need of the flexibility to modify and maintain the system by an interface more human-readable than programming code, like editing tables where the behavior of the system is defined. This allows both a quicker editing and the possibility to let the configuration and maintenance of the system to non programmers, like business/tariff analysts. This flexibility comes at the cost of a heavier computational time. The support for "code external" textual configuration of both rating cases-amounts and the algorithmic rating process steps, is sometimes called "Rule-based Rating". Rule-based rating is one simple example of the use of the more general control table technique.
As the telecommunications market comes under increasing pressu |
https://en.wikipedia.org/wiki/Bionix%20%28TV%20programming%20block%29 | Bionix was a late night action programming block that aired between September 10, 2004 and February 7, 2010, on the Canadian television channel YTV. The block primarily featured acquired Japanese anime series aimed at mature audience.
Programming
This is a list of series and movies that have aired on Bionix, with their Canadian TV ratings.
Animated series
Anime
.hack//Sign (14+)
Bleach (14+)
Blue Dragon (C8)
Case Closed (PG)
Death Note (14+)
Eureka Seven (14+)
Fullmetal Alchemist (14+)
Ghost in the Shell: Stand Alone Complex (14+)
Inuyasha (14+)
MÄR (C8)
Mobile Suit Gundam SEED (14+)
Mobile Suit Gundam SEED Destiny (14+)
Naruto (PG)
Witch Hunter Robin (14+)
Zatch Bell! (C8)
Western animation
Avatar: The Last Airbender (C8)
Beast Wars: Transformers (C8)
Futurama (PG)
Invader Zim (PG)
Justice League Unlimited (C8)
ReBoot (C8)
Samurai Jack (C8)
Shadow Raiders (C8)
Live action series
Dark Oracle (C8)
Monster Warriors (C8)
Movies
2005
Inuyasha the Movie: Affections Touching Across Time (14+) (aired March 25, 2005, and August 30, 2008)
Inuyasha the Movie 2: The Castle Beyond the looking Glass (14+) (aired August 26, 2005)
2006
Ultimate Avengers: The Movie (G) (aired September 1, 2006, and April 25, 2008)
Inuyasha the Movie 3: Swords of an Honorable Ruler (14+) (aired December 29, 2006)
2007
Fullmetal Alchemist the Movie: Conqueror of Shamballa (14+) (aired June 22, 2007, and October 19, 2007)
Inuyasha the Movie 4: Fire on the Mystic Island (14+) (aired June 22, 2007, and August 17, 2007)
Princess Mononoke (14+) (aired October 26, 2007)
Naruto the Movie: Ninja Clash in the Land of Snow (PG) (aired November 16, 2007, and June 20, 2008)
2008
Superman: Doomsday (PG) (aired March 7, 2008)
Justice League: The New Frontier (PG) (aired October 4, 2008)
Bleach: Memories of Nobody (14+) (aired November 8, 2008)
He-Man & She-Ra: A Christmas Special (C8) (aired December 13, 2008)
References
External links
Official Bionix page at YTV.com
Anime television
Canadian late-night television programming
YTV (Canadian TV channel) original programming
Television programming blocks in Canada |
https://en.wikipedia.org/wiki/Erik%20Demaine | Erik D. Demaine (born February 28, 1981) is a Canadian-American professor of computer science at the Massachusetts Institute of Technology and a former child prodigy.
Early life and education
Demaine was born in Halifax, Nova Scotia, to mathematician and sculptor Martin L. Demaine and Judy Anderson. From the age of 7, he was identified as a child prodigy and spent time traveling across North America with his father. He was home-schooled during that time span until entering university at the age of 12.
Demaine completed his bachelor's degree at 14 years of age at Dalhousie University in Canada, and completed his PhD at the University of Waterloo by the time he was 20 years old.
Demaine's PhD dissertation, a work in the field of computational origami, was completed at the University of Waterloo under the supervision of Anna Lubiw and Ian Munro. This work was awarded the Canadian Governor General's Gold Medal from the University of Waterloo and the NSERC Doctoral Prize (2003) for the best PhD thesis and research in Canada. Some of the work from this thesis was later incorporated into his book Geometric Folding Algorithms on the mathematics of paper folding published with Joseph O'Rourke in 2007.
Professional accomplishments
Demaine joined the faculty of the Massachusetts Institute of Technology (MIT) in 2001 at age 20, reportedly the youngest professor in the history of MIT, and was promoted to full professorship in 2011. Demaine is a member of the Theory of Computation group at MIT Computer Science and Artificial Intelligence Laboratory.
Mathematical origami artwork by Erik and Martin Demaine was part of the Design and the Elastic Mind exhibit at the Museum of Modern Art in 2008, and has been included in the MoMA permanent collection. That same year, he was one of the featured artists in Between the Folds, an international documentary film about origami practitioners which was later broadcast on PBS television. In connection with a 2012 exhibit, three of his curved origami artworks with Martin Demaine are in the permanent collection of the Renwick Gallery of the Smithsonian Museum.
Demaine was a fan of Martin Gardner and in 2001 he teamed up with his father Martin Demaine and Gathering 4 Gardner founder Tom M. Rodgers to edit a tribute book for Gardner on his 90th birthday. From 2016 to 2020 he was president of the board of directors of Gathering 4 Gardner.
Honours and awards
In 2003, Demaine was awarded the MacArthur Fellowship, the so-called "genius grant".
In 2013, Demaine received the EATCS Presburger Award for young scientists. The award citation listed accomplishments including his work on the carpenter's rule problem, hinged dissection, prefix sum data structures, competitive analysis of binary search trees, graph minors, and computational origami. That same year, he was awarded a fellowship by the John Simon Guggenheim Memorial Foundation.
For his work on bidimensionality, he was the winner of the Nerode Prize in 2015 along with |
https://en.wikipedia.org/wiki/Computer%20Gaming%20World | Computer Gaming World (CGW) was an American computer game magazine published between 1981 and 2006. One of the few magazines of the era to survive the video game crash of 1983, it was sold to Ziff Davis in 1993. It expanded greatly through the 1990s and became one of the largest dedicated video game magazines, reaching around 500 pages by 1997.
In the early 2000s its circulation was about 300,000, only slightly behind the market leader PC Gamer. But, like most magazines of the era, the rapid move of its advertising revenue to internet properties led to a decline in revenue. In 2006, Ziff announced it would be refocused as Games for Windows, before moving it to solely online format, and then shutting down completely later the same year.
History
In 1979, Russell Sipe left the Southern Baptist Convention ministry. A fan of computer games, he realized in spring 1981 that no magazine was dedicated to computer games. Although Sipe had no publishing experience, he formed Golden Empire Publications in June and found investors. He chose the name Computer Gaming World (CGW) instead of alternatives such as Computer Games or Kilobaud Warrior because he hoped that the magazine would both review games and serve as a trade publication for the industry. The first issue appeared in November, about the same as rivals Electronic Games and Softline. (Sipe's religious background led to "Psalm 9:1–2" appearing in each issue. His successor as editor, Johnny L. Wilson, was an evangelical Christian minister.)
The first issues of Computer Gaming World were published from Anaheim, California, and sold for $2.75 individually or $11 for a year's subscription of six issues. These early bimonthly issues were typically 40–50 pages in length, written in a newsletter style, including submissions by game designers such as Joel Billings (SSI), Dan Bunten (Ozark Software), and Chris Crawford. Also, early covers were not always directly related to the magazine's contents, but rather featured work by artist Tim Finkas. In January/February 1986 CGW increased its publication cycle to nine times a year, and the editorial staff included popular writers such as Scorpia, Charles Ardai, and M. Evan Brooks.
CGW survived the video game crash of 1983, which badly hurt the market; by summer 1985 it was the only survivor of 18 color magazines covering computer games in 1983. In autumn 1987 CGW introduced a quarterly newsletter called Computer Game Forum (CGF), which was published during the off-months of CGW. The newsletter never became popular; only two issues were published before it was cancelled. Some of CGF's content became part of CGW, which became a monthly.
The magazine went through significant expansion starting in 1991, with page counts reaching 196 pages by its 100th issue, in November 1992. During that same year, Johnny Wilson (who started as a contributor in 1983), became editor-in-chief, although Sipe remained as publisher. In 1993, Sipe sold the magazine to Ziff Davis—by the |
https://en.wikipedia.org/wiki/FourCC | A FourCC ("four-character code") is a sequence of four bytes (typically ASCII) used to uniquely identify data formats. It originated from the OSType or ResType metadata system used in classic Mac OS and was adopted for the Amiga/Electronic Arts Interchange File Format and derivatives. The idea was later reused to identify compressed data types in QuickTime and DirectShow.
History
In 1984, the earliest version of a Macintosh OS, System 1, was released. It used the single-level Macintosh File System with metadata fields including file types, creator (application) information, and forks to store additional resources. It was possible to change this information without changing the data itself, so that they could be interpreted differently. Identical codes were used throughout the system, as type tags for all kinds of data.
In 1985, Electronic Arts introduced the Interchange File Format (IFF) meta-format (family of file formats), originally devised for use on the Amiga. These files consisted of a sequence of "chunks", which could contain arbitrary data, each chunk prefixed by a four-byte ID. The IFF specification explicitly mentions that the origins of the FourCC idea lie with Apple.
This IFF was adopted by a number of developers including Apple for AIFF files and Microsoft for RIFF files (which were used as the basis for the AVI and WAV file formats). Apple referred to many of these codes as OSTypes. Microsoft and Windows developers refer to their four-byte identifiers as FourCCs or Four-Character Codes. FourCC codes were also adopted by Microsoft to identify data formats used in DirectX, specifically within DirectShow and DirectX Graphics.
In Apple systems
Since Mac OS X Panther, OSType signatures are one of several sources that may be examined to determine a Uniform Type Identifier and are no longer used as the primary data type signature. Mac OS X (macOS) prefers the more colloquial convention of labelling file types using file name extensions. At the time of the change, the change was a source of great contention among older users, who believed that Apple was reverting to a more primitive way that misplaces metadata in the filename.
Filesystem-associated type codes are not readily accessible for users to manipulate, although they can be viewed and changed with certain software, most notably the macOS command line tools GetFileInfo and SetFile which are installed as part of the developer tools into /Developer/Tools, or the ResEdit utility available for older Macs.
Technical details
The byte sequence is usually restricted to ASCII printable characters, with space characters reserved for padding shorter sequences. Case sensitivity is preserved, unlike in file extensions. FourCCs are sometimes encoded in hexadecimal (e.g., "0x31637661" for 'avc1') and sometimes encoded in a human-readable way (e.g., "mp4a"). Some FourCCs however, do contain non-printable characters, and are not human-readable without special formatting for display; for examp |
https://en.wikipedia.org/wiki/Tyranny%20of%20numbers | The tyranny of numbers was a problem faced in the 1960s by computer engineers. Engineers were unable to increase the performance of their designs due to the huge number of components involved. In theory, every component needed to be wired to every other component (or at least many other components) and were typically strung and soldered by hand. In order to improve performance, more components would be needed, and it seemed that future designs would consist almost entirely of wiring.
History
The first known recorded use of the term in this context was made by the Vice President of Bell Labs in an article celebrating the 10th anniversary of the invention of the transistor, for the "Proceedings of the IRE" (Institute of Radio Engineers), June 1958 . Referring to the problems many designers were having, he wrote:
At the time, computers were typically built up from a series of "modules", each module containing the electronics needed to perform a single function. A complex circuit like an adder would generally require several modules working in concert. The modules were typically built on printed circuit boards of a standardized size, with a connector on one edge that allowed them to be plugged into the power and signaling lines of the machine, and were then wired to other modules using twisted pair or coaxial cable.
Since each module was relatively custom, modules were assembled and soldered by hand or with limited automation. As a result, they suffered major reliability problems. Even a single bad component or solder joint could render the entire module inoperative. Even with properly working modules, the mass of wiring connecting them together was another source of construction and reliability problems. As computers grew in complexity, and the number of modules increased, the complexity of making a machine actually work grew more and more difficult. This was the "tyranny of numbers".
It was precisely this problem that Jack Kilby was thinking about while working at Texas Instruments. Theorizing that germanium could be used to make all common electronic components - resistors, capacitors, etc. - he set about building a single-slab component that combined the functionality of an entire module. Although successful in this goal, it was Robert Noyce's silicon version and the associated fabrication techniques that make the integrated circuit (IC) truly practical.
Unlike modules, ICs were built using photoetching techniques on an assembly line, greatly reducing their cost. Although any given IC might have the same chance of working or not working as a module, they cost so little that if they didn't work you simply threw it away and tried another. In fact, early IC assembly lines had failure rates around 90% or greater, which kept their prices high. The U.S. Air Force and NASA were major purchasers of early ICs, where their small size and light weight overcame any cost issues. They demanded high reliability, and the industry's response not only prov |
https://en.wikipedia.org/wiki/Commonsense%20reasoning | In artificial intelligence (AI), commonsense reasoning is a human-like ability to make presumptions about the type and essence of ordinary situations humans encounter every day. These assumptions include judgments about the nature of physical objects, taxonomic properties, and peoples' intentions. A device that exhibits commonsense reasoning might be capable of drawing conclusions that are similar to humans' folk psychology (humans' innate ability to reason about people's behavior and intentions) and naive physics (humans' natural understanding of the physical world).
Definitions and characterizations
Some definitions and characterizations of common sense from different authors include:
"Commonsense knowledge includes the basic facts about events (including actions) and their effects, facts about knowledge and how it is obtained, facts about beliefs and desires. It also includes the basic facts about material objects and their properties."
"Commonsense knowledge differs from encyclopedic knowledge in that it deals with general knowledge rather than the details of specific entities."
Commonsense knowledge is "real world knowledge that can provide a basis for additional knowledge to be gathered and interpreted automatically".
The commonsense world consists of "time, space, physical interactions, people, and so on".
Common sense is "all the knowledge about the world that we take for granted but rarely state out loud".
Common sense is "broadly reusable background knowledge that's not specific to a particular subject area... knowledge that you ought to have."
NYU professor Ernest Davis characterizes commonsense knowledge as "what a typical seven year old knows about the world", including physical objects, substances, plants, animals, and human society. It usually excludes book-learning, specialized knowledge, and knowledge of conventions; but it sometimes includes knowledge about those topics. For example, knowing how to play cards is specialized knowledge, not "commonsense knowledge"; but knowing that people play cards for fun does count as "commonsense knowledge".
Commonsense reasoning problem
Compared with humans, existing AI lacks several features of human commonsense reasoning; most notably, humans have powerful mechanisms for reasoning about "naïve physics" such as space, time, and physical interactions. This enables even young children to easily make inferences like "If I roll this pen off a table, it will fall on the floor". Humans also have a powerful mechanism of "folk psychology" that helps them to interpret natural-language sentences such as "The city councilmen refused the demonstrators a permit because they advocated violence". (A generic AI has difficulty discerning whether the ones alleged to be advocating violence are the councilmen or the demonstrators.) This lack of "common knowledge" means that AI often makes different mistakes than humans make, in ways that can seem incomprehensible. For example, existing self-driving |
https://en.wikipedia.org/wiki/Formula%20One%20%28video%20game%20series%29 | Formula One is a series of computer and video games originally created by Psygnosis, who were eventually renamed to Studio Liverpool. It takes its name from the popular car racing series of the same name. Since 2001, the Formula One series had been made by Studio Liverpool (an internal Sony Computer Entertainment Europe game studio) formed from the restructuring of several studios including Psygnosis, which soon followed with the obtaining of an exclusive FOA Official Licence, which barred any other company to produce a Formula One game for any other platform for 5 years. Sony used this exclusive licence to make Formula One games from 2003 until 2007, releasing a new title every year which included improvements to the graphics engine as well as an updated and complete F1 grid showing the latest liveries, chassis and drivers. The series covered every year from 1995 to 2006, with the exception of the 1996 season. In February 2007, it was announced that Sony had lost the license to produce Formula One video games, meaning Formula One Championship Edition, released at the very end of the previous year, was to be the last game in a series that lasted more than a decade. In May 2008, Codemasters picked up the license, with Sumo Digital, producing F1 2009 for the PSP and Nintendo Wii a year and a half later. Codemasters took over the license proper in 2010, and as of 2020, currently maintain the rights to exclusively produce Formula One games.
Games
References
External links
Sony Interactive Entertainment franchises
Video game franchises
Video game franchises introduced in 1996 |
https://en.wikipedia.org/wiki/COSMAC%20ELF | The COSMAC Elf was an RCA 1802 microprocessor-based computer described in a series of construction articles in Popular Electronics magazine in 1976 and 1977. Through the back pages of electronics magazines, both Netronics and Quest Electronics offered low-priced, enhanced kits that were based on this design. The system was a very early single-board personal computer. It was operated without built-in ROMs and programs were entered directly with help of the CPU integrated DMA using 8 toggle switches and an Input push button.
It featured two hexadecimal LED displays for byte data value output and a set of 8 toggle switches for input. (a hexadecimal keypad was an optional extension) The base configuration had 256 bytes of RAM, but expansion projects could raise that to a power of two-based memory store, with an upper limit of 64K address space.
The original Elf design used a crystal with a frequency in the range of 1 to 2 MHz with the 1802's built in oscillator circuit.
A simple circuit used the DMA feature of the 1802 to permit entry of programs and data into RAM through the toggle switches. Entering a byte via the toggle switches and pressing the "input" button would enter a byte into RAM and display it on the pair of hex LEDs, then advance the DMA counter to the next location. A "memory protect" switch could be used to disable memory alteration. If an error was made in program entry, it could be corrected by turning on memory protect, turning off load mode (thus resetting the program counter to zero), turning on load mode, and pressing "input" to advance to the address of the incorrect data. After turning off memory protect, the correct value could be entered.
The fourth article of the series presented modifications to use a companion RCA 1861 “Pixie” video generator IC (CDP1861). The Pixie required a 1.76 MHz clock, and since that was an uncommon crystal frequency, usually a readily available 3.579545 MHz colorburst crystal was instead used in a separate oscillator circuit with a divide-by-two circuit to drive the clock inputs of both the microprocessor and Pixie. The resulting 1.7897725 MHz clock was close enough for the hardware to work. Monochrome video output (with timing roughly approximating NTSC standard) could be generated using DMA operations interleaved with carefully arranged 1802 opcodes as instructions in software. The maximum resolution of the 1861 was 64h by 128v rectangular pixels. By changing the placement of instructions in the video display control and interrupt routines, pixel rows could be repeated to obtain lower resolutions, allowing the video display to be used with 256 bytes of RAM (64×32 square pixels).
A one-bit output from the microprocessor, the Q line, could be driven by software to produce sounds through an attached speaker, to save programs in RAM to a cassette recorder, and for serial I/O output. Branch instructions in the 1802 instruction set could read the state of the EF1 through EF4 single bit v |
https://en.wikipedia.org/wiki/Core%20Audio | Core Audio is a low-level API for dealing with sound in Apple's macOS and iOS operating systems. It includes an implementation of the cross-platform OpenAL.
Apple's Core Audio documentation states that "in creating this new architecture on Mac OS X, Apple's objective in the audio space has been twofold. The primary goal is to deliver a high-quality, superior audio experience for Macintosh users. The second objective reflects a shift in emphasis from developers having to establish their own audio and MIDI protocols in their applications to Apple moving ahead to assume responsibility for these services on the Macintosh platform."
History
It was introduced in Mac OS X 10.0 (Cheetah).
Architecture
Core Audio supports plugins, which can generate, receive, or process audio streams; these plugins are packaged as a bundle with the extension .
See also
Audio Units
PulseAudio
References
Bibliography
External links
Apple's Core Audio page
MacOS APIs
Audio libraries |
https://en.wikipedia.org/wiki/MPU-401 | The MPU-401, where MPU stands for MIDI Processing Unit, is an important but now obsolete interface for connecting MIDI-equipped electronic music hardware to personal computers. It was designed by Roland Corporation, which also co-authored the MIDI standard.
Design
Released around 1984, the original MPU-401 was an external breakout box providing MIDI IN/MIDI OUT/MIDI THRU/TAPE IN/TAPE OUT/MIDI SYNC connectors, for use with a separately-sold interface card/cartridge ("MPU-401 interface kit") inserted into a computer system. For this setup, the following "interface kits" were made:
MIF-APL: For the Apple II.
MIF-C64: For the Commodore 64.
MIF-FM7: For the Fujitsu FM-7.
MIF-IPC: For the IBM PC/IBM XT. It turned out not to work reliably with 286 and faster processors. Early versions of the actual PCB had IF-MIDI/IBM as a silk screen.
MIF-IPC-A: For the IBM AT, works with PC and XT as well.
Xanadu MUSICOM IFM-PC: For the IBM PC / IBM XT / IBM AT. This was a third party MIDI card, incorporating the MIF-IPC(-A) and additional functionality that was coupled with the OEM Roland MPU-401 BOB. It also had a mini audio jack on the PCB.
MIF-MSX: For the MSX.
MIF-PC8: For the NEC PC-88.
MIF-PC98: For the NEC PC-98.
MIF-X1: For the Sharp X1.
MIF-V64: For the Commodore 64.
In 2014 hobbyists built clones of the MIF-IPC-A card for PCs.
Variants
Later, Roland would put most of the electronics originally found in the breakout box onto the interface card itself, thus reducing the size of the breakout box. Products released in this manner:
MPU-401N: an external interface, specifically designed for use with the NEC PC-98 series notebook computers. This breakout-box unit features a special COMPUTER IN port for direct connection to the computer's 110-pin expansion bus. METRONOME OUT connector was added. Released in Japan only.
MPU-IPC: for the IBM PC/IBM XT/IBM AT and compatibles (8 bit ISA). It had a 25-pin female connector for the breakout box, even though only nine pins were used, and only seven were functionally different: both 5V and ground use two pins each.
MPU-IPC-T: for the IBM PC/IBM XT/IBM AT and compatibles (8-bit ISA). The MIDI SYNC connector was removed from this Taiwanese-manufactured model, and the previously hardcoded I/O address and IRQ could be set to different values with jumpers. The break-out box has three DIN connectors for MIDI (1xIN and 2xOUT) plus three 3.5mm mini jack connectors (TAPE IN, TAPE OUT and METRONOME OUT).
MPU-IMC: for the IBM PS/2's Micro Channel Architecture bus. In earlier models both I/O address and IRQ were hardcoded to IRQ 2 (causing serious problems with the hard disk as it also uses that IRQ); in later models the IRQ could be set with a jumper. It had a 9-pin female connector for the breakout box. . Due to the incompatibility of IRQ 2/9 (and potentially I/O addresses) between the MPU-IMC and IBM PS/2 MCA models certain games will not work with MPU-401.
S-MPU/AT (Super MPU): for the IBM AT and compatibles (1 |
https://en.wikipedia.org/wiki/Foundry%20Networks | Foundry Networks, Inc. was a networking hardware vendor selling high-end Ethernet switches and routers. The company was acquired by Brocade Communications Systems on December 18, 2008.
History
The company was founded in 1996 by Bobby R. Johnson, Jr. and was headquartered in Santa Clara, California, United States. In its first year the company operated under the names Perennium Networks and StarRidge Networks, but by January 1997 the name Foundry Networks was adopted. Foundry Networks had their initial public offering in 1999, during the Internet bubble, with the company reaching a valuation of $9 billion on its first day of trading on NASDAQ with the symbol FDRY.
Foundry Networks designed, manufactured and sold high-end enterprise and service provider switches and routers, as well as wireless, security, and traffic management solutions. It was best known for its Layer 2 & 3 Ethernet switches. Foundry Networks was the first company to build and ship a gigabit Ethernet switch in 1997; to build a Layer 3 switch, also in 1997; to build the first Layer 4-7 switch in 1998 and to include 10 Gigabit Ethernet single connectors in its boxes (since 2001).
Foundry Networks early product lines consisted of the Workgroup, Backbone, and ServerIron products. The TurboIron all GigE switch and then router models were later introduced. Foundry Networks' later product lines consisted of the BigIron, EdgeIron, FastIron, IronPoint, NetIron, SecureIron, and ServerIron. After the early BigIron modular chassis, the Mucho Grande (MG) series chassis were introduced. Later the RX series in 4, 8, 16, and 32 slot versions. The largest and final product, the XMR was a full rack sized switch/router. Their software products included IronView and ServerIron TrafficWorks.
According to a Dell’Oro report published in 1Q2006, Foundry Networks ranked number 4 in a total market share of over US$3,659 million, and its ServerIron application switch ranked first for total port shipments.
Acquisition
On July 21, 2008, Foundry management agreed to allow the company to be acquired by storage networking company Brocade Communications Systems for approximately $3 billion in cash and stock. On November 7, they agreed to a reduced purchase price of roughly $2.6 billion in an all-cash transaction when Brocade was unable to come up with a $400M tranche of financing required to complete the original deal. A meeting was scheduled for December 17, 2008, where shareholders approved the amended agreement.
The acquisition was completed on December 18, 2008.
Qatalyst Partners advised Brocade on financial matters, and Cooley Godward Kronish LLP was Brocade's legal adviser. TJ Grewal, Jody Kirk, and Alex Lam were the deal leads on the Brocade team.
Brocade sold Foundry's FastIron Campus portfolio to Arris (Ruckus Networks) and SRA portfolio to Extreme Networks in 2017.
See also
3Com
Brocade Communications Systems
Cisco
Extreme Networks
HP ProCurve
Ruckus Networks
Nortel
References
Exte |
https://en.wikipedia.org/wiki/Lenovo | Lenovo Group Limited, often shortened to Lenovo ( , ), is a Chinese multinational technology company specializing in designing, manufacturing, and marketing consumer electronics, personal computers, software, business solutions, and related services. Products manufactured by the company include desktop computers, laptops, tablet computers, smartphones, workstations, servers, supercomputers, data storage devices, IT management software, and smart televisions. Its best-known brands include its ThinkPad business line of laptop computers (acquired from IBM), the IdeaPad, Yoga, and Legion consumer lines of laptop computers, and the IdeaCentre and ThinkCentre lines of desktop computers. As of 2021, Lenovo is the world's largest personal computer vendor by unit sales.
Lenovo has operations in over 60 countries and sells its products in around 180+ countries. It was incorporated in Hong Kong, with global headquarters in Beijing, and Morrisville, North Carolina, United States. and operational centres in Singapore and Morrisville, North Carolina, US. It has research centres in Beijing, Chengdu, Yamato (Kanagawa Prefecture, Japan), Singapore, Shanghai, Shenzhen, and Morrisville, and also has Lenovo NEC Holdings, a joint venture with NEC that produces personal computers for the Japanese market.
History
1984–1993: Founding and early history
Lenovo was founded in Beijing on 1 November 1984 as Legend by a team of engineers led by Liu Chuanzhi and Danny Lui. Initially specializing in televisions, the company migrated towards manufacturing and marketing computers.
Liu Chuanzhi and his group of ten experienced engineers, teaming up with Danny Lui, officially founded Lenovo in Beijing on November 1, 1984, with 200,000 yuan. The Chinese government approved Lenovo's incorporation on the same day. Jia Xufu (贾续福), one of the founders of Lenovo, indicated that the first meeting in preparation for starting the company was held on October 17 the same year. Eleven people, the entirety of the initial staff, attended. Each of the founders was a member of the Institute of Computing Technology of the Chinese Academy of Sciences (CAS). The 200,000 yuan used as start-up capital was approved by Zeng Maochao (曾茂朝). The name for the company agreed upon at this meeting was the Chinese Academy of Sciences Computer Technology Research Institute New Technology Development Company. Lenovo has increasingly diversified from the personal computer market and made a number of corporate acquisitions, with the most notable being acquiring and integrating most of IBM's personal computer business and its x86-based server business as well as creating its own smartphone.
The organizational structure of the company was established in 1985 after the Chinese New Year. It included technology, engineering, administrative, and office departments. The group first attempted to import televisions but failed. It rebuilt itself as a company doing quality checks on computers. It also tried and failed to |
https://en.wikipedia.org/wiki/Grey%20hat | A grey hat (greyhat or gray hat) is a computer hacker or computer security expert who may sometimes violate laws or typical ethical standards, but usually does not have the malicious intent typical of a black hat hacker.
The term came into use in the late 1990s, and was derived from the concepts of "white hat" and "black hat" hackers. When a white hat hacker discovers a vulnerability, they will exploit it only with permission and not divulge its existence until it has been fixed, whereas the black hat will illegally exploit it and/or tell others how to do so. The grey hat will neither illegally exploit it, nor tell others how to do so.
A further difference among these types of hacker lies in their methods of discovering vulnerabilities. The white hat breaks into systems and networks at the request of their employer or with explicit permission for the purpose of determining how secure it is against hackers, whereas the black hat will break into any system or network in order to uncover sensitive information for personal gain. The grey hat generally has the skills and intent of the white hat but will break into any system or network without permission.
According to one definition of a grey-hat hacker, when they discover a vulnerability, instead of telling the vendor how the exploit works, they may offer to repair it for a small fee. When one gains illegal access to a system or network, they may suggest to the system administrator that one of their friends be hired to fix the problem; however, this practice has been declining due to the increasing willingness of businesses to prosecute. Another definition of grey hat maintains that grey hat hackers only arguably violate the law in an effort to research and improve security: legality being set according to the particular ramifications of any hacks they participate in.
In the search engine optimization (SEO) community, grey hat hackers are those who manipulate websites' search engine rankings using improper or unethical means but that are not considered search engine spam.
History
The phrase grey hat was first publicly used in the computer security context when DEF CON announced the first scheduled Black Hat Briefings in 1996, although it may have been used by smaller groups prior to this time. Moreover, at this conference a presentation was given in which Mudge, a key member of the hacking group L0pht, discussed their intent as grey hat hackers to provide Microsoft with vulnerability discoveries in order to protect the vast number of users of its operating system. Finally, Mike Nash, Director of Microsoft's server group, stated that grey hat hackers are much like technical people in the independent software industry in that "they are valuable in giving us feedback to make our products better".
The phrase grey hat was used by the hacker group L0pht in a 1999 interview with The New York Times to describe their hacking activities.
The phrase was used to describe hackers who support the ethical |
https://en.wikipedia.org/wiki/Black%20hat%20%28computer%20security%29 | A black hat (black hat hacker or blackhat) is a computer hacker who violates laws or typical ethical standards for nefarious purposes, such as cybercrime, cyberwarfare or malice.
The term originates from 1950s westerns, when bad guys typically wore black hats and good guys white hats. A black hat is contrasted with a white hat. Additionally, there is a third category which is called a grey hat, a person who hacks with good intentions but sometimes without permission.
Description
Criminals who intentionally enter computer networks with malicious intent are known as "black hat hackers". They may distribute malware that steals data (particularly login credentials), financial information, or personal information (such as passwords or credit card numbers). This information is often then sold on the dark web. Additionally, malware can also be used to hold computers hostage or destroy files. Some hackers modify or destroy data in addition to stealing it. Even though hacking has become an important tool for governments to gather intelligence, black hats still tend to work alone or with organized crime groups to make easy money.
Black hat hackers can be novices or experienced criminals. They are usually knowledgeable about infiltrating computer networks and getting around security protocols. Furthermore, they also create malware, a form of software that lets them access computer networks, monitor their victims' online activities, or lock their victims' devices. Black hat hackers can be involved in cyber espionage or protest, in addition to pursuing personal or financial gain. In fact, for some hackers, cybercrime may be an addictive experience.
History
The term "black hat" comes from the color scheme used in westerns from the 1950s, in which the bad guys wore black hats, and the good guys wore white or other light colors.
One example of black hat activity was the WannaCry ransomware in May 2017. Around 400,000 computers in 150 countries were infected by it in the first two weeks of its release. Decryption tools were made available by security experts within days of WannaCry's appearance, limiting extortion payments to approximately $120,000, or slightly more than 1% of the potential haul.
The big data breaches that make headlines are the work of black hat hackers. In a data breach, hackers can steal the financial, personal, or digital information of customers, patients, and constituents. The hackers can then use this information to smear a business or government agency, sell it on the dark web, or extort money from businesses, government agencies, or individuals. The United States experienced a record number of 1,862 data breaches in 2021, according to the Identity Theft Resource Center's 2021 Data Breach Report. Data breaches have been on the rise for some time. From 2013 to 2014, black hat hackers broke into Yahoo and stole 3 billion customer records, making it possibly the largest data breach ever. In addition, the adult website Adult FriendFi |
https://en.wikipedia.org/wiki/Task%20manager | In operating systems, a task manager is a system monitor program used to provide information about the processes and applications running on a computer, as well as the general status of the computer. Some implementations can also be used to terminate processes and applications, as well as change the processes' scheduling priority. In some environments, users can access a task manager with the Control-Alt-Delete keyboard shortcut.
Task managers can display running services (processes) as well as those that were stopped. They can display information about the services, including their process identifier and group identifier.
Common task managers
Activity Monitor, included in macOS
Conky, for the X Window System
htop, for the Unix shell
KDE System Guard, included in KDE
nmon, for Linux and AIX
ps, for the Unix shell
Task Manager, included in Windows
tasklist, for DOS
TaskManager, included in MorphOS
top, for the Unix shell
References
Task managers |
https://en.wikipedia.org/wiki/Autonomous%20learning | Autonomous learning may refer to:
Autonomous learning in homeschooling
Learner autonomy
Machine learning
Self-paced instruction |
https://en.wikipedia.org/wiki/How%20to%20Boil%20Water | How to Boil Water is an American television program. One of the first shows on the Food Network, it began broadcasting in 1993 and was first hosted by Emeril Lagasse. The focus of the show is simple cooking, as the show's title suggests, and is directed at those who have little cooking skill or experience.
In the beginning of the history of Food Network, How to Boil Water was the trademark show of the network. As Emeril's personal popularity grew, he eventually moved on to his own show, Essence of Emeril. How to Boil Water continued with the tandem chefs Cathy Lowe and Sean Donnellan. With this duo, the show followed the formula of a chef teaching somebody with no experience.
After Lowe and Donnellan, Frédéric Van Coppernolle along with comedian Lynne Koplitz, and then later Jack Hourigan, were the show's hosts. This version of the show followed a formula similar to when Emeril hosted. It later returned to the chef-and-student model with chef Tyler Florence and Jack continuing as co-host.
External links
Food Network original programming
1990s American cooking television series
2000s American cooking television series
2010s American cooking television series
1993 American television series debuts |
https://en.wikipedia.org/wiki/Catwalk%20%28Canadian%20TV%20series%29 | Catwalk is a Canadian musical drama series that ran for 49 episodes on the YTV network from 1992 until 1994. The series' first season aired in syndication in the United States, while the second season aired on MTV.
Synopsis
The series was based around six twenty-something adults who formed a band named Catwalk. The episodes centered on the band's personal relationships and struggles to land a record deal, while also featuring their musical performances in nightclubs. Their main gathering place was a downtown loft.
Singer/guitarist Johnnie Camden (Keram Malicki-Sanchez) was at the focus of the show; it was in his loft where the band gathered to rehearse. Relationships were also a major part of the show; there were two couples within the cast, as Daisy (Neve Campbell) dated the group's manager Billy K., and Mary (Kelli Taylor) dated the drummer Jesse (Paul Popowich). The relationship was tumultuous and the couple broke up before the end of the first season.
The show had a somewhat post-apocalyptic flavour, with Blade Runner-style burning oil barrels, dark and ambient lighting, and flashing white lights that pass through blinds, giving the show a futuristic look.
The second season featured a new character, Maggi (Nicole de Boer), who in the first season (in the episode "Toxic Love") became briefly involved with lead guitarist Johnnie Camden, causing tension within the band.
Cast and characters
Lisa Butler as Sierra Williams, the strong-willed lead singer. After watching Johnnie and Mary's performance, she leaves a "clue" in their audition tapes, hoping they find her. Sierra works for Master Sound Records and used to date a guy named Tyrone who's actually a separatist for black people; she would take over keyboards in addition to singing after Daisy left during the second season
Neve Campbell as Daisy McKenzie, the naïve keyboard player who used to date Johnnie and later ends up with Billy K. She almost married to a man named Eric, as she feels she has no one without her parents alive. (first season only)
Christopher Lee Clements as Addie "Atlas" Robinson, the smart tough-guy rapper and dancer who used to work for Billy K to look after his aunt Ellen. He had a troubled past involving his father dying in a crossfire, with a difficulty in letting go. (first season only)
Keram Malicki-Sanchez as Johnnie Camden, the fiercely driven leader and guitarist. He names his guitar "Watson". Johnnie moves out from his father, living in a loft with Jesse as his roommate. His mother Rita left him and his dad years ago. (first season only)
Paul Popowich as Jesse Carlson, the band's drummer who has rebelled against his wealthy family to live on his own terms. He moves into the loft as Johnnie’s roommate. He also plays guitar & piano/keyboards.
Kelli Taylor as Mary Owens, the sensitive but tough bassist and background singer. She is a childhood friend of Johnnie’s and Daisy's. In the second season she, along with Jesse, would take control of the band afte |
https://en.wikipedia.org/wiki/Administrative%20share | Administrative shares are hidden network shares created by the Windows NT family of operating systems that allow system administrators to have remote access to every disk volume on a network-connected system. These shares may not be permanently deleted but may be disabled. Administrative shares cannot be accessed by users without administrative privileges.
Share names
Administrative shares are a collection of automatically shared resources including the following:
Disk volumes: Every disk volume on the system is shared as an administrative share. The name of these shares consists of the drive letters of shared volume plus a dollar sign ($). For example, a system that has volumes C, D and E has three administrative shares named C$, D$ and E$. (NetBIOS is not case sensitive.)
OS folder: The folder in which Windows is installed is shared as admin$
Fax cache: The folder in which faxed pages and cover pages are cached is shared as fax$
IPC shares: This area, which is used for inter-process communication via named pipes and is not part of the file system, is shared as ipc$
Printers folder: This virtual folder, which contains objects that represent installed printers is shared as print$
Domain controller shares: Windows Server family of operating system creates two domain controller-specific shares called sysvol and netlogon which do not have dollar signs ($) appended to their names.
Characteristics
Administrative shares have the following characteristics:
Hidden: The "$" appended to the end of the share name means that it is a hidden share. Windows will not list such shares among those it defines in typical queries by remote clients to obtain the list of shares. One needs to know the name of an administrative share in order to access it. Not every hidden share is an administrative share; in other words, ordinary hidden shares may be created at user's discretion.
Automatically created: Administrative shares are created by Windows, not a network administrator. If deleted, they will be automatically recreated.
Administrative shares are not created by Windows XP Home Edition.
Management
The administrative shares can be deleted just as any other network share, only to be recreated automatically at the next reboot. It is, however, possible to disable administrative shares.
Disabling administrative shares is not without caveats. Previous Versions for local files, a feature of Windows Vista and Windows 7, requires administrative shares to operate.
Restrictions
Windows XP implements "simple file sharing" (also known as "ForceGuest"), a feature that can be enabled on computers that are not part of a Windows domain. When enabled, it authenticates all incoming access requests to network shares as "Guest", a user account with very limited access rights in Windows. This effectively disables access to administrative shares.
By default, Windows Vista and later use User Account Control (UAC) to enforce security. One of UAC's features denies administra |
https://en.wikipedia.org/wiki/Node%20%28computer%20science%29 | A node is a basic unit of a data structure, such as a linked list or tree data structure. Nodes contain data and also may link to other nodes. Links between nodes are often implemented by pointers.
Nodes and trees
Nodes are often arranged into tree structures. A node represents the information contained in a single data structure. These nodes may contain a value or condition, or possibly serve as another independent data structure. Nodes are represented by a single parent node. The highest point on a tree structure is called a root node, which does not have a parent node, but serves as the parent or 'grandparent' of all of the nodes below it in the tree. The height of a node is determined by the total number of edges on the path from that node to the furthest leaf node, and the height of the tree is equal to the height of the root node. Node depth is determined by the distance between that particular node and the root node. The root node is said to have a depth of zero. Data can be discovered along these network paths.
An IP address uses this kind of system of nodes to define its location in a network.
Definitions
Child: A child node is a node extending from another node. For example, a computer with internet access could be considered a child node of a node representing the internet. The inverse relationship is that of a parent node. If node C is a child of node A, then A is the parent node of C.
Degree: the degree of a node is the number of children of the node.
Depth: the depth of node A is the length of the path from A to the root node. The root node is said to have depth 0.
Edge: the connection between nodes.
Forest: a set of trees.
Height: the height of node A is the length of the longest path through children to a leaf node.
Internal node: a node with at least one child.
Leaf node: a node with no children.
Root node: a node distinguished from the rest of the tree nodes. Usually, it is depicted as the highest node of the tree.
Sibling nodes: these are nodes connected to the same parent node.
Markup languages
Another common use of node trees is in web development. In programming, XML is used to communicate information between computer programmers and computers alike. For this reason XML is used to create common communication protocols used in office productivity software, and serves as the base for the development of modern web markup languages like XHTML. Though similar in how it is approached by a programmer, HTML and CSS is typically the language used to develop website text and design. While XML, HTML and XHTML provide the language and expression, the DOM serves as a translator.
Node type
Different types of nodes in a tree are represented by specific interfaces. In other words, the node type is defined by how it communicates with other nodes. Each node has a node type property, which specifies the type of node, such as sibling or leaf.
For example, if the node type property is the constant properties for a node, this property spec |
https://en.wikipedia.org/wiki/Node%20%28networking%29 | In telecommunications networks, a node (, ‘knot’) is either a redistribution point or a communication endpoint. The definition of a node depends on the network and protocol layer referred to. A physical network node is an electronic device that is attached to a network, and is capable of creating, receiving, or transmitting information over a communication channel. A passive distribution point such as a distribution frame or patch panel is consequently not a node.
Computer networks
In data communication, a physical network node may either be data communication equipment (DCE) such as a modem, hub, bridge or switch; or data terminal equipment (DTE) such as a digital telephone handset, a printer or a host computer.
If the network in question is a local area network (LAN) or wide area network (WAN), every LAN or WAN node that participates on the data link layer must have a network address, typically one for each network interface controller it possesses. Examples are computers, a DSL modem with Ethernet interface and wireless access point. Equipment, such as an Ethernet hub or modem with serial interface, that operates only below the data link layer does not require a network address.
If the network in question is the Internet or an intranet, many physical network nodes are host computers, also known as Internet nodes, identified by an IP address, and all hosts are physical network nodes. However, some data-link-layer devices such as switches, bridges and wireless access points do not have an IP host address (except sometimes for administrative purposes), and are not considered to be Internet nodes or hosts, but are considered physical network nodes and LAN nodes.
Telecommunications
In the fixed telephone network, a node may be a public or private telephone exchange, a remote concentrator or a computer providing some intelligent network service. In cellular communication, switching points and databases such as the base station controller, home location register, gateway GPRS Support Node (GGSN) and serving GPRS support node (SGSN) are examples of nodes. Cellular network base stations are not considered to be nodes in this context.
In cable television systems (CATV), this term has assumed a broader context and is generally associated with a fiber optic node. This can be defined as those homes or businesses within a specific geographic area that are served from a common fiber optic receiver. A fiber optic node is generally described in terms of the number of "homes passed" that are served by that specific fiber node.
Distributed systems
If the network in question is a distributed system, the nodes are clients, servers or peers. A peer may sometimes serve as client, sometimes server. In a peer-to-peer or overlay network, nodes that actively route data for the other networked devices as well as themselves are called supernodes.
Distributed systems may sometimes use virtual nodes so that the system is not oblivious to the heterogeneity of the |
https://en.wikipedia.org/wiki/NTV%20%28Russia%29 | NTV (Cyrillic: НТВ) is a Russian free-to-air television channel that was launched as a subsidiary of Vladimir Gusinsky's company . Since 14 April 2001 Gazprom Media controls the network. NTV has no official meaning according to Igor Malashenko, the author of the name and co-founder of the company, but in the 1990s unofficial transcripts of the acronym include "New" (Novoje), "Independent" (Nezavisimoje), "Non-governmental" (Negosudarstvennoje), "Our" (Nashe).
History
Gusinsky era (1993-2001)
Gusinsky founded NTV broadcasting in October 1993 on channel 4. It moved to channel 5 in January 1994. He attracted talented journalists and news anchors of the time such as Tatiana Mitkova, Leonid Parfyonov, Mikhail Osokin, Yevgeniy Kiselyov, Vladimir A. Kara-Murza, Victor Shenderovich and others. The channel set high professional standards in Russian television, broadcasting live coverage and sharp analysis of current events. Starting before the dissolution of Soviet Union as Fourth Programme, the channel broadcast a daily news programme Segodnya and a weekly news-commentary programme Itogi which was jointly supported by the United States magazine Newsweek (at the time, a subsidiary of The Washington Post Company, now Graham Holdings Company). In the early 1990s, , a multibillion-dollar advertising agency, obtained exclusive advertising rights on NTV.
It commented favorably on President Boris Yeltsin's re-election campaign in 1996.
By 1999 NTV had achieved an audience of 102 million, covering about 70% of Russia's territory, and was available in other former Soviet republics.
During parliamentary elections in 1999 and presidential elections in 2000, NTV was critical of the Second Chechen War, Vladimir Putin and the political party Unity backed by him. In the puppet show Kukly ('Puppets') in the beginning of February 2000, the puppet of Putin acted as Little Zaches in a story based on E.T.A. Hoffmann's Little Zaches Called Cinnabar, in which blindness causes villagers to mistake an evil gnome for a beautiful youth. This provoked a fierce reaction from Putin's supporters. On 8 February the newspaper Sankt-Peterburgskie Vedomosti published a letter signed by the Rector of St. Petersburg State University Lyudmila Verbitskaya, the Dean of its Law Department Nikolay Kropachyov and some of Putin's other presidential campaign assistants that urged the prosecution of the authors of the show for what they considered a criminal offence.
Talk show with people of Ryazan and FSB members
On 24 March 2000, two days before the presidential elections, NTV featured the Ryazan apartment bombing of fall 1999 in the talk show Independent Investigation. The interviews of the residents of the Ryazan apartment building, along with FSB public relations director Alexander Zdanovich and Ryazan branch head Alexander Sergeyev was filmed a few days earlier. On 26 March, Boris Nemtsov voiced his concern over the possible shut-down of NTV for airing the talk.
Seven months late |
https://en.wikipedia.org/wiki/Rob%20Glaser | Robert Denis Glaser (born January 16, 1962 in New York City, New York) is the founder of RealNetworks, which produces RealAudio, RealVideo, RealPlayer, and Helix, among other products and services. Before founding RealNetworks, he had become a millionaire by working for Microsoft for ten years.
Glaser, while Chief Executive of RealNetworks, clashed repeatedly with Tony Fadell, widely known as the Godfather of the iPhone and iPod, who then left the company after 6 weeks and went on to founding the products for Apple.
Glaser is a graduate of Yale University with an BS degree in Computer Science and an MA in Economics.
On June 16, 2004, Glaser received the Music Visionary Award, along with EMI Vice Chairman David Munns, from the Music for Youth Foundation, and the United Jewish Appeal.
Glaser was the 22nd largest individual donor to 527 groups in the 2004 US election, donating over $2.2 million to pro-Democratic organizations. He was the leading creditor to Air America Radio, loaning at least $9.8 million according to its bankruptcy filing. In addition, along with economist Jeffrey Sachs and public health expert Josh Ruxin, Glaser founded the Access Project, an NGO dedicated to improving health care in Rwanda by increasing management capacity at health centers. In 1999, Glaser established the Glaser Progress Foundation, "to build a more just, sustainable and humane world." From 2011 to 2015, foundation assets have shrunk from $9 million to $5.7 million; annual grants have shrunk from $1.5 million to $267,000; overhead and expenses have grown slightly from $455,000 to $525,000. In 2016, he set up a web site (PutinTrump.org) to monitor and report then-candidate Donald Trump's connections to Vladimir Putin.
Since June 2010, Glaser has been a partner at global venture firm, Accel Partners, focusing on digital media technology, social media, and mobile service investments. He returned to RealNetworks again as interim CEO in 2012 and resumed the official title of CEO in 2014.
References
External links
No. 41 Rob Glaser: Bit Streamer - Time Digital Top 50 (1999)
Rob Glaser, Moving Target - interview by Randall Rothenberg writing for Wired Magazine (August 1999)
RealNetwork's CEO Rob Glaser - interview by Lance Ulanoff writing for PC Magazine (April 21, 2003)
Free Fall Radio: Air America Goes Bankrupt - Page 3 of the Chapter 11 filing from The Smoking Gun (October 13, 2006)
Rethinking Mobile Data Plans - On the Hot Seat with Rob Glaser - interview by Sue Marek for FierceMobileContent (December 18, 2007)
Big Audio Dynamite - biographical interview with Steve Homer in the Independent Newspaper (February 7, 2000)
1962 births
Air America (radio network)
Living people
20th-century American Jews
American technology executives
Microsoft employees
Yale University alumni
21st-century American Jews |
https://en.wikipedia.org/wiki/Data%20hierarchy | Data hierarchy refers to the systematic organization of data, often in a hierarchical form. Data organization involves characters, fields, records, files and so on. This concept is a starting point when trying to see what makes up data and whether data has a structure. For example, how does a person make sense of data such as 'employee', 'name', 'department', 'Marcy Smith', 'Sales Department' and so on, assuming that they are all related? One way to understand them is to see these terms as smaller or larger components in a hierarchy. One might say that Marcy Smith is one of the employees in the Sales Department, or an example of an employee in that Department. The data we want to capture about all our employees, and not just Marcy, is the name, ID number, address etc.
Purpose of the data hierarchy
"Data hierarchy" is a basic concept in data and database theory and helps to show the relationships between smaller and larger components in a database or data file. It is used to give a better sense of understanding about the components of data and how they are related.
It is particularly important in databases with referential integrity, third normal form, or perfect key. "Data hierarchy" is the result of proper arrangement of data without redundancy. Avoiding redundancy eventually leads to proper "data hierarchy" representing the relationship between data, and revealing its relational structure.
Components of the data hierarchy
The components of the data hierarchy are listed below.
A data field holds a single fact or attribute of an entity. Consider a date field, e.g. "19 September 2004". This can be treated as a single date field (e.g. birthdate), or three fields, namely, day of month, month and year.
A record is a collection of related fields. An Employee record may contain a name field(s), address fields, birthdate field and so on.
A file is a collection of related records. If there are 100 employees, then each employee would have a record (e.g. called Employee Personal Details record) and the collection of 100 such records would constitute a file (in this case, called Employee Personal Details file).
Files are integrated into a database. This is done using a Database Management System. If there are other facets of employee data that we wish to capture, then other files such as Employee Training History file and Employee Work History file could be created as well.
Illustration of the data hierarchy
An illustration of the above description is shown in this diagram below:
The following terms are for better clarity. With reference to the example in the above diagram:
Data field label = Employee Name or EMP_NAME
Data field value = Jeffrey Tan
The above description is a view of data as understood by a user e.g. a person working in Human Resource Department.
The above structure can be seen in the hierarchical model, which is one way to organize data in a database.
In terms of data storage, data fields are made of bytes and these in t |
https://en.wikipedia.org/wiki/CentOS | CentOS (, from Community Enterprise Operating System; also known as CentOS Linux) is a discontinued Linux distribution that provided a free and open-source community-supported computing platform, functionally compatible with its upstream source, Red Hat Enterprise Linux (RHEL). In January 2014, CentOS announced the official joining with Red Hat while staying independent from RHEL, under a new CentOS governing board.
The first CentOS release in May 2004, numbered as CentOS version 2, was forked from RHEL version 2.1AS. Since version 8, CentOS officially supports the x86-64, ARM64, and POWER8 architectures, and releases up to version 6 also supported the IA-32 architecture. , AltArch releases of CentOS 7 are available for the IA-32 architecture, Power ISA, and for the ARMv7hl and AArch64 variants of the ARM architecture. CentOS 8 was released on 24 September 2019.
In December 2020, Red Hat unilaterally terminated CentOS development. In response, CentOS founder Gregory Kurtzer created the Rocky Linux project as a successor to the original mission of CentOS. In March 2021, Cloud Linux (makers of CloudLinux OS) released a new RHEL derivative called AlmaLinux.
CentOS Linux was discontinued at the end of 2021 in favor of CentOS Stream, a distribution positioned upstream of RHEL.
History
CentOS originated as a build of CAOS Linux, an RPM-based Linux distribution started by Gregory Kurtzer in 2002. Infiscale described its GravityOS as "[including] the small footprint of Caos", indicating a certain level of influence from the discontinued distribution.
In June 2006, David Parsley, the primary developer of Tao Linux (another RHEL clone), announced the retirement of Tao Linux and its rolling into CentOS development. Tao users migrated to the CentOS release via .
In July 2009, it was reported in an open letter on the CentOS Project web site that CentOS's founder, Lance Davis, had disappeared in 2008. Davis had ceased contribution to the project, but continued to hold the registration for the CentOS domain and PayPal account. In August 2009, the CentOS team reportedly made contact with Davis and obtained the centos.info and centos.org domains.
In July 2010, CentOS overtook Debian to become the most popular Linux distribution for web servers, with almost 30% of all Linux web servers using it. Debian retook the lead in January 2012.
In January 2014, Red Hat announced that it would sponsor the CentOS Project, "helping to establish a platform well-suited to the needs of open source developers that integrate technologies in and around the operating system". As a result of these changes, ownership of CentOS trademarks was transferred to Red Hat, which now employs most of the CentOS head developers; however, they work as part of Red Hat's Open Source and Standards team, which operates separately from the Red Hat Enterprise Linux team. A new CentOS governing board was also established.
On 8 December 2020, the CentOS Project announced that the distribution wo |
https://en.wikipedia.org/wiki/BlueJ | BlueJ is an integrated development environment (IDE) for the Java programming language, developed mainly for educational purposes, but also suitable for small-scale software development. It runs with the help of Java Development Kit (JDK).
BlueJ was developed to support the learning and teaching of object-oriented programming, and its design differs from other development environments as a result. The main screen graphically shows the class structure of an application under development (in a UML-like diagram), and objects can be interactively created and tested. This interaction facility, combined with a clean, simple user interface, allows easy experimentation with objects under development. Object-oriented concepts (classes, objects, communication through method calls) are represented visually and in its interaction design in the interface.
History
The development of BlueJ was started in 1999 by Michael Kölling and John Rosenberg at Monash University, as a successor to the Blue system. BlueJ is an IDE (Integrated Development Environment). Blue was an integrated system with its own programming language and environment, and was a relative of the Eiffel language. BlueJ implements the Blue environment design for the Java programming language.
In March 2009, the BlueJ project became free and open source software, and licensed under GPL-2.0-or-later with the Classpath exception.
BlueJ is currently being maintained by a team at King's College London, England, where Kölling works.
Supported language
BlueJ supports programming in Java and in Stride. Java support has been provided in BlueJ since its inception, while Stride support was added in 2017.
See also
Greenfoot
DrJava
Educational programming language
References
Bibliography
External links
BlueJ textbook
Integrated development environments
Free integrated development environments
Cross-platform free software
Free software programmed in Java (programming language)
Java development tools
Java platform
Linux programming tools
Software development kits
MacOS programming tools
Programming tools for Windows
Linux software
Educational programming languages
Pedagogic integrated development environments |
https://en.wikipedia.org/wiki/Capital%20Liverpool | Capital Liverpool is an Independent Local Radio station serving Liverpool, England. It is owned and operated by Global as part of the Capital network.
History
Crash FM
The station was launched by Janice Long and Bernie Connor as Liverpool's answer to XFM, with the idea for an alternative music radio station being thought up by the pair at Keith’s Wine Bar on Lark Lane in 1994. Crash FM acquired a Restricted Service Licence (RSL) to broadcast for a month from 5 November 1995, with the studios at Mabel Fletcher College on Greenbank, seeing presenters such as Inspiral Carpets member Clint Boon take to the airwaves.
After a few more RSL broadcasts, the station relaunched on 107.6FM as a full time service, from studios at 27 Fleet Street, on 27 March 1998. Now known as 107 Crash FM, the station had backing from Bob Geldof, Primal Scream, Urban Splash, Kiss 102's Mike Gray and Boy George.
In its application for a full-time licence, Crash FM said it would provide an alternative rock and dance station, aimed at 15- to 34-year-olds, with a target audience of over 80,000 tuning in for around eight hours per week in the first year. The original shareholders also included CLT, although they withdrew before launch with their 25% stake taken by Channel Radio.
Juice 107.6
Crash was bought out by Forever Broadcasting in late 1999 and relaunched as Juice 107.6 on 26 March 2000. By September of that year, the station's RAJAR had increased significantly, after its format had been altered to include more mainstream pop and dance music.
In September 2003, Juice was sold to Absolute Radio (UK) Limited (AR-UK), a consortium made up of UTV Media and Eurocast, for £3.1m. AR-UK were, at the time, making moves in the FM radio licence world, notably in the West Midlands and Glasgow. The new owners aimed to develop more local programming, news and marketing but sold the station to UTV less than two years later.
On 12 January 2012, Juice switched from its Fleet Street studios to a new £1.1m facility at One Park West in Liverpool One, overlooking the Albert Dock.
Capital Liverpool
On 5 June 2015, Juice FM was sold again to Global for £10 million. The sale was given regulatory approval from the Competition and Markets Authority exactly three months later, following a consultation.
On the same day as the sale was cleared, Global announced it would rebrand and relaunch Juice FM as part of the Capital network of contemporary hit radio stations.
The Juice FM brand was phased out at 4pm on 10 January 2016, with the station entering a transition period ahead of the full relaunch as Capital, which took place at 6am on 18 January 2016.
According to RAJAR, Capital Liverpool's listening figures fell to 167,000 listeners per week a year after the rebrand. But as of RAJAR Q2 2019, after significant changes to the initial lineup, the numbers had recovered to 212,000 weekly listeners.
On 26 February 2019, Global confirmed the station's local breakfast and weekend shows would be |
https://en.wikipedia.org/wiki/Capital%20Brighton | Capital Brighton was a local radio station owned and operated by Global Radio as part of the Capital radio network. It served the Brighton and Hove area broadcasting on 107.2 FM and across Sussex on DAB.
In April 2019, the station was merged with a sister Capital station in Hampshire to form Capital South.
History
Surf 107
The station was first launched as Surf 107 in March 1998, when the Radio Authority licensed Brighton and Hove Local Radio Ltd to broadcast on a commercial basis to the Brighton and Hove area.
Co-founders Daniel Nathan and Eugene Perera had previously run a series of trial broadcasts in the city beginning with Festival Radio 97.7 operating under a Home Office special events radio licence in May 1990 during the Brighton Festival and in subsequent years using a Radio Authority restricted service licence from 1991 to 1993. Writer and broadcaster Simon Fanshawe was the first chairman of the company with Eugene Perera as managing director. Various local companies held shares. Surf 107 began broadcasting on Friday 27 March 1998 and went on to win its first Sony Award a year later.
Juice 107.2
In December 2000, the radio station was sold to Forever Broadcasting plc which rebranded the station as Juice 107.2. In August 2003, Daniel Nathan led a group of local investors with the aim of returning the station to local ownership.
In 2011, Juice 107.2 managing director Ryan Heal was recognised as an Outstanding Brightonian for his stewardship at the radio station and leadership within the community.
By this point, Juice 107.2 was required to pay for simulcast on the emerging DAB digital radio platform. The company's directors did not consider the format suitable or financially sustainable and began lobbying parliament. In September 2012, in order to demonstrate an alternative approach to DAB, senior Ofcom engineer Rashid Mustapha together with Daniel Nathan initiated an experimental low cost DAB transmission that ran from the Juice 107.2 rack room and transmission site from September 2012 to January 2013 using open-source software. This work was commended in parliament by the Minister of State Ed Vaizey in November 2013.
An official trial was set in motion and on 31 July 2015, the Juice DIY DAB multiplex went live. In the same month, radio group UKRD acquired a 51% majority holding in the broadcaster, with Daniel Nathan remaining as chairman and local shareholders retaining the minority stake.
In August 2016, UKRD returned its holding in Juice to local investors.
As part of the sale, Laurence Elphick, who had departed as Juice managing director in 2014, returned to the post.
In late October 2016, Ofcom's report concluded that the small scale trials had been a success. In March 2017, the Brighton multiplex became UK's first to only broadcast DAB+. A month later, the work that began as an experiment in Brighton was officially recognised when the Private Members' Small-Scale DAB Bill received Royal Assent to pass into law as an Act o |
https://en.wikipedia.org/wiki/.as | .as is the Internet country code top-level domain (ccTLD) for American Samoa. It is administered by AS Domain Registry. Island Networks, which provides registry services for .gg and .je, is also responsible for the technical operations of .as.
Usage
Domain names are free of charge for businesses and individuals resident in or associated with American Samoa.
There is no restriction on registrants, and the domain is also popular outside of Samoa. There a number of .as names having been registered to and used by people, companies and organizations with no connection to American Samoa (as example, people and organizations related to Asturias, a Spanish region). "AS" or "A/S" is a suffix indicating a joint stock company in some countries including Norway, Denmark, Estonia and Czech Republic, so this TLD may be of use by companies of this sort. Also, some autonomous systems or websites providing information about autonomous systems or BGP, such as bgp4.as, have registered domain names.
It is, sometimes, used as a domain hack, since the suffix "-s" means plural in some languages like English, Spanish, and Portuguese, thus "-as" would be the end of the plural of a word that ends with an "a". Examples of such usage include the Brazilian website escol.as, meaning "schools", or macc.as/feedback for the public food service feedback form for McDonald's in Australia, stemming from the colloquial use of 'Maccas' to describe the restaurant chain in the country.
2016 legacy registrar vulnerability
In April 2016, a security blog publicized a vulnerability in a .AS legacy registrar system which was claimed might have led to exposure of plain-text passwords of domain contacts associated with domains that did not have a registrar, and that this could have potentially allowed an attacker to make modifications to those domains, or even delete them. However, following publication, the AS Domain Registry confirmed to the reporter that legacy managed domains were subject to human oversight and authentication of all changes and that no attempts had been made to take advantage of this apparent vulnerability, and the potential exploit was confirmed to have been closed.
See also
Internet in American Samoa
Internet in the United States
.us
.um
References
External links
IANA .as whois information
Country code top-level domains
Economy of American Samoa
American Samoan culture
sv:Toppdomän#A |
https://en.wikipedia.org/wiki/Sethi%E2%80%93Ullman%20algorithm | In computer science, the Sethi–Ullman algorithm is an algorithm named after Ravi Sethi and Jeffrey D. Ullman, its inventors, for translating abstract syntax trees into machine code that uses as few registers as possible.
Overview
When generating code for arithmetic expressions, the compiler has to decide which is the best way to translate the expression in terms of number of instructions used as well as number of registers needed to evaluate a certain subtree. Especially in the case that free registers are scarce, the order of evaluation can be important to the length of the generated code, because different orderings may lead to larger or smaller numbers of intermediate values being spilled to memory and then restored. The Sethi–Ullman algorithm (also known as Sethi–Ullman numbering) produces code which needs the fewest instructions possible as well as the fewest storage references (under the assumption that at the most commutativity and associativity apply to the operators used, but distributive laws i.e. do not hold). The algorithm succeeds as well if neither commutativity nor associativity hold for the expressions used, and therefore arithmetic transformations can not be applied. The algorithm also does not take advantage of common subexpressions or apply directly to expressions represented as general directed acyclic graphs rather than trees.
Simple Sethi–Ullman algorithm
The simple Sethi–Ullman algorithm works as follows (for a load/store architecture):
Traverse the abstract syntax tree in pre- or postorder
For every non-constant leaf node, assign a 1 (i.e. 1 register is needed to hold the variable/field/etc.) if it is the left child of its parent else assign a 0. For every constant leaf node (RHS of an operation – literals, values), assign a 0.
For every non-leaf node n, assign the number of registers needed to evaluate the respective subtrees of n. If the number of registers needed in the left subtree (l) are not equal to the number of registers needed in the right subtree (r), the number of registers needed for the current node n is max(l, r). If l == r, then the number of registers needed for the current node is r + 1.
Code emission
If the number of registers needed to compute the left subtree of node n is bigger than the number of registers for the right subtree, then the left subtree is evaluated first (since it may be possible that the one more register needed by the right subtree to save the result makes the left subtree spill). If the right subtree needs more registers than the left subtree, the right subtree is evaluated first accordingly. If both subtrees need an equal number of registers, then the order of evaluation is irrelevant.
Example
For an arithmetic expression , the abstract syntax tree looks like this:
=
/ \
a *
/ \
/ \
+ +
/ \ / \
/ \ d 3
+ *
/ \ / |
https://en.wikipedia.org/wiki/Vital%20statistics%20%28government%20records%29 | Vital statistics is accumulated data gathered on live births, deaths, migration, foetal deaths, marriages and divorces. The most common way of collecting information on these events is through civil registration, an administrative system used by governments to record vital events which occur in their populations. Efforts to improve the quality of vital statistics will therefore be closely related to the development of civil registration systems in countries. Civil registration followed the practice of churches keeping such records since the 19th century.
This article covers mainly the US, UK and Canada, with references to global standards.
Definitions
A vital statistics system is defined by the United Nations "as the total process of (a) collecting information by civil registration or enumeration on the frequency or occurrence of specified and defined vital events, as well as relevant characteristics of the events themselves and the person or persons concerned, and (b) compiling, processing, analyzing, evaluating, presenting, and disseminating these data in statistical form"
Civil registration is defined by the United Nations as the" continuous, permanent, compulsory, and universal recording of the occurrence and characteristics of vital events (live births, deaths, fetal deaths, marriages, and divorces) and other civil status events pertaining to the population as provided by decree, law or regulation, in accordance with the legal requirements in each country."
History
United Kingdom
Prior to the creation of the General Register Office (GRO) in 1837, there was no national system of civil registration in England and Wales. Baptisms, marriages and burials were recorded in parish registers maintained by Church of England (Anglican) clergy. However, with the great increase in nonconformity and the gradual relaxation of the laws against Catholics and other dissenters from the late 17th century, more and more baptisms, marriages and burials were going unrecorded in the registers of the Anglican Church.
The increasingly poor state of English parish registration led to numerous attempts to shore up the system in the 18th and early 19th centuries. The Marriage Act of 1753 attempted to prevent 'clandestine' marriages by imposing a standard form of entry for marriages, which had to be signed by both parties to the marriage and by witnesses. Additionally, except in the case of Jews and Quakers, legal marriages had to be carried out according to the rites of the Church of England. Sir George Rose's Parochial Registers Act of 1812 laid down that all events had to be entered on standard entries in bound volumes. It also declared that the church registers of Nonconformists were not admissible in court as evidence of births, marriages and deaths. Only those maintained by the clergy of the Church of England could be presented in court as legal documents, and this caused considerable hardship for Nonconformists. A number of proposals were presented to Parlia |
https://en.wikipedia.org/wiki/.tm | .tm is the Internet country code top-level domain (ccTLD) for Turkmenistan. It is operated by Internet Computer Bureau.
Nic.tm offers domain name purchase, registration, management and renewal as well as Internationalized Domain Name registration for entities who wish to register their domain names using local Turkmen language characters.
It has been marketed as a domain for businesses with trademarks, due to the common use of "TM" in this context.
Registrars
Domains can be bought directly from the registry or from accredited registrars. The registry currently has registrars from 25 different countries.
Domains can be transferred between accredited registrars via an Auth-Code.
References
External links
IANA .tm whois information
List of officially accredited registrars
Tm
Communications in Turkmenistan
Computer-related introductions in 1997 |
https://en.wikipedia.org/wiki/.mn | .mn is the Internet country code top-level domain (ccTLD) for Mongolia. It is administered by .MN Registry, Datacom. The domain name is composed of the consonants in the first syllable of the country name. The .MN registry is operated under the thick registry model. Administrative, Billing, Technical and Registrant contacts are required. The Redemption Grace Period (RGP) is available for .MN domains.
The following second-level domains registration for free to qualifying entities:
.gov.mn – government institutions
.edu.mn – educational institutions
.org.mn – non-profit organizations
.MN Registry signed the .mn zone with DNSSEC on 18 November 2010.
Use outside Mongolia
The .mn domain name has been used to represent the U.S. state of Minnesota, such as by the Minnesota Legislature (senate.mn and house.mn), but such use is not official in the state.
The .mn domain elsewhere outside Mongolia is used primarily as a domain hack, for example vita.mn (a play on vitamin). Another example is cart.mn (a play on the South Park character Eric Cartman, which redirects to www.southparkstudios.com).
References
External links
Domain registrars
Domain.mn – .MN Domain Registry : .MN Domain Registrar
TEC.mn – TEC.mn Service of DomainNRG : .MN Domain Registrar from Minneapolis, MN
Country code top-level domains
Internet in Mongolia
Computer-related introductions in 1995
Science and technology in Mongolia
sv:Toppdomän#M |
https://en.wikipedia.org/wiki/.je | .je is the country code top-level domain for Jersey. The domain is administered by Island Networks, who also administer the .gg domain for neighbouring territory Guernsey. In 2003, a Google Search website was made available for Jersey, which uses the .je domain.
History
Alderney hosts the domain name registry for both bailiwicks of the Channel Islands. The country-code top-level domains of .je and .gg first appeared on the Internet in August 1996 after Jon Postel agreed with Nigel Roberts to add four codes (GG and JE, and IM and AC) to the IANA list of TLDs. The codes for the Channel Islands and for the Isle of Man were entered on to the official United Nations ISO-3166 list in 2006.
Second-level domains
Since 2000, names have been registered principally directly under the country code.
However the following legacy sub-domain are still open for registration
.co.je: commercial/personal domains
.net.je: Internet service providers and commercial
.org.je: organisations (free to local good causes)
.sch.je: schools, primary and secondary education
References
External links
IANA .je whois information
Island Networks website
Country code top-level domains
Jersey
Council of European National Top Level Domain Registries members
Computer-related introductions in 1996 |
https://en.wikipedia.org/wiki/JANET%20NRS | The JANET NRS (Name Registration Scheme) was a pseudo-hierarchical naming scheme used on British academic and research networks in the 1980s. Its purpose was to organise and manage domain names within the JANET network, contributing to the establishment of computer networking familiarities at universities in the United Kingdom and other academic and research institutions. It used a reverse domain name notation.
History
It was proposed in 1983 and used until the superficially similar Internet Domain Name System (DNS) was fully adopted.
Purpose and structure
The JANET NRS was developed to allocate and maintain unique domain names for organisations connected to the JANET network. Its primary purpose was to ensure a standardised and organised approach to domain name registration, facilitating identification and differentiation of institutions and their computer resources on the network.
NRS "second-level domains" consisted of (JANET academic and scientific sites), (commercial) and (Ministry of Defence). Any organisations not falling into these categories were given their own "second-level" name, e.g. (British Library) or (National Engineering Laboratory).
All NRS names had both a standard (long) and abbreviated (up to 18 characters) form. For example, was the less widely used standard equivalent of the abbreviated name .
For email, interoperability between the "Grey Book" email addressing style of and ARPA and USENET addresses of the style was achieved by way of mail gateway at University College London.
Comparison with DNS
As Internet usage expanded and commercial entities emerged, the more general Domain Name System (DNS) superseded the NRS. A principal difference with the Domain Name System was that the order of significance began with the most significant part (so called big-endian addresses). Also, NRS names were canonically written in upper case. For example, the University of Cambridge had the NRS name , whereas its DNS domain is .
After Internet top-level domains were introduced from 1984, confusion was caused when the least significant part of an Internet address matched the most significant part of an NRS address and vice versa. The ccTLD ".cs" for Czechoslovakia came into use around 1990-2 until 1995. The classic joke was that e-mail intended for UK universities ended up in Czechoslovakia, since many JANET e-mail addresses were of the form universityname, where "CS" stood for Computer Science (department).
Another significant difference from the DNS was the concept of context to name lookups, e.g. 'mail' or 'file transfer'. This made the NRS more sophisticated than the DNS, permitting overloading of names.
Legacy
JANET transitioned to using Internet protocols in 1991, and by 1994 the DNS had become the de facto standard for domain names on JANET. The final mail gateway was taken out of service by the end of 1997. Nonetheless, the JANET NRS remains a significant part of the history of network infrastructure and academi |
https://en.wikipedia.org/wiki/Computer%20security%20policy | A computer security policy defines the goals and elements of an organization's computer systems. The definition can be highly formal or informal. Security policies are enforced by organizational policies or security mechanisms. A technical implementation defines whether a computer system is secure or insecure. These formal policy models can be categorized into the core security principles of Confidentiality, Integrity, and Availability. For example, the Bell-La Padula model is a confidentiality policy model, whereas the Biba model is an integrity policy model.
Formal description
If a system is regarded as a finite-state automaton with a set of transitions (operations) that change the system's state, then a security policy can be seen as a statement that partitions these states into authorized and unauthorized ones.
Given this simple definition, one can define a secure system as one that starts in an authorized state and will never enter an unauthorized state.
Formal policy models
Confidentiality policy model
Bell-La Padula model
Integrity policies model
Biba model
Clark-Wilson model
Hybrid policy model
Chinese Wall (Also known as Brewer and Nash model)
Policy languages
To represent a concrete policy, especially for automated enforcement of it, a language representation is needed. There exist a lot of application-specific languages that are closely coupled with the security mechanisms that enforce the policy in that application.
Compared with this abstract policy languages, e.g., the Domain Type Enforcement-Language, is independent of the concrete mechanism.
See also
Anti-virus
Information Assurance - CIA Triad
Firewall (computing)
Protection mechanisms
Separation of protection and security
ITU Global Cybersecurity Agenda
References
Clark, D.D. and Wilson, D.R., 1987, April. A comparison of commercial and military computer security policies. In 1987 IEEE Symposium on Security and Privacy (pp. 184–184). IEEE.
Computer security procedures
Computer security models |
https://en.wikipedia.org/wiki/Radiom%C3%A1s | Radiomás is the state radio network of the Mexican state of Veracruz. It broadcasts on five FM transmitters in the state with most content originating from the state capital in Xalapa.
History
Radiomás came to air on April 6, 2000, with music and pre-recorded IDs. Program production began by that July.
Transmitters
The two lowest-powered transmitters in the network, XHIXH-FM 107.3 Ixhuatlán de Madero (400 watts) and XHSTX-FM 89.7 Santiago Tuxtla (167 watts), were shut down and their permits surrendered on December 21, 2016.
References
Radio stations in Veracruz
Radio stations established in 2000
Public radio in Mexico |
https://en.wikipedia.org/wiki/Channel%20V | Channel [V] ("V" standing for the letter, not the Roman numeral "5") was a Chinese and former Asian pay television musical network originally launched by Star TV Hong Kong (now Disney Networks Group Asia Pacific). It was part of the unit of Disney International Operations, and was launched back in September 1991 to replace the first incarnation of MTV's Asian operation before it was shutdown on October 1, 2021.
The Mainland Chinese version is later owned by Star China Media, and is still operational, since they're a subsidiary of China Media Capital. The Australian channels were later owned by Foxtel before their closure.
Channel [V] previously operated either a local feed or a relay of the international version in Hong Kong, Macau, Southeast Asia, the Middle East, and Thailand or localized versions in India, the Philippines, Taiwan, South Korea, Japan and Australia.
History
Early years
MTV Asia (15 September 1991 – 2 May 1994)
Channel [V] was originally launched on 15 September 1991 as MTV Asia (). It was a 24-hour music channel broadcast in English, Hindi and Chinese, focused on pop music. The STAR TV Network, which is based in British Hong Kong (now called Hong Kong, China since 1997), operated the channel in partnership with Viacom in the United States, which owned MTV-branded regional music channels there. The channel was broadcast across the continent of Asia, reaching from the Far East to the Middle East, as with the AsiaSat 1's footprint. The STAR TV Network have since regionalized the channel to serve its huge viewerships.
On 2 May 1994, MTV Asia left the STAR TV Network as the contract with Viacom expired.
Channel [V] (27 May 1994 – 30 September 2021)
On 27 May 1994, Channel [V] was launched as a replacement of MTV Asia with VJs (who used to work on MTV Asia) celebrating on air from various locations; the Great Wall of China, the Taj Mahal, Downtown Tokyo, the Himalayas etc. At the same time, Channel [V] officially 'split' its beam, in effect, providing two separate services for different regional audiences within the AsiaSat 1's footprint. This enables the channel to provide appropriate programming and viewing time for its viewers from different regions in Asia.
On 5 June 1994, Channel [V] has opened up its production facilities in Taipei, Taiwan.
On 4 July 1994, Sigaw Manila was launched on the Northern Beam.
On 1 August 1994, BPL Oye! was launched on the Southern Beam.
On 5 June 1994, Channel [V] has opened up its production facilities in Mumbai (formerly known as Bombay), India.
On 27 April 1995, the STAR TV Network starts transmitting Channel [V] on the Palapa B2R satellite to Indonesia and the Philippines.
On 30 April 1995, Channel [V] has opened up its production facilities in Dubai, the United Arab Emirates producing Sony Yalla!, the first ever Arabic Top 10 Countdown in the Middle East was launched on the Southern Beam.
On 4 August 1996, a Thai-localized feed of Channel [V] was launched in Thailand, as carried on |
https://en.wikipedia.org/wiki/PLATO%20%28computer%20system%29 | PLATO (Programmed Logic for Automatic Teaching Operations), also known as Project Plato and Project PLATO, was the first generalized computer-assisted instruction system. Starting in 1960, it ran on the University of Illinois' ILLIAC I computer. By the late 1970s, it supported several thousand graphics terminals distributed worldwide, running on nearly a dozen different networked mainframe computers. Many modern concepts in multi-user computing were first developed on PLATO, including forums, message boards, online testing, email, chat rooms, picture languages, instant messaging, remote screen sharing, and multiplayer video games.
PLATO was designed and built by the University of Illinois and functioned for four decades, offering coursework (elementary through university) to UIUC students, local schools, prison inmates, and other universities. Courses were taught in a range of subjects, including Latin, chemistry, education, music, Esperanto, and primary mathematics. The system included a number of features useful for pedagogy, including text overlaying graphics, contextual assessment of free-text answers, depending on the inclusion of keywords, and feedback designed to respond to alternative answers.
Rights to market PLATO as a commercial product were licensed by Control Data Corporation (CDC), the manufacturer on whose mainframe computers the PLATO IV system was built. CDC President William Norris planned to make PLATO a force in the computer world, but found that marketing the system was not as easy as hoped. PLATO nevertheless built a strong following in certain markets, and the last production PLATO system was in use until 2006.
Innovations
PLATO was either the first or an earlier example of many now-common technologies:
Hardware
. Donald Bitzer
. Donald Bitzer
Display Graphics
storing in downloadable fonts.
.
Online communities
Notesfiles (precursor to newsgroups), 1973.
Term-talk (1:1 chat)
Screen software sharing: , used by instructors to help students, precursor of Timbuktu.
Common Computer Game Genres, including many of the early (first?) real time multi-player games
Multiplayer Games
. Rick Bloome
Dungeon Games
. Included the first video game boss.
, likely the first graphical dungeon computer game.
.
Space combat
Flight Simulation: ; this probably inspired UIUC student Bruce Artwick to start Sublogic which was acquired and later became Microsoft Flight Simulator.
Military simulations: .
3D Maze games: , based on a story by J. G. Ballard, the first PLATO 3-D walkthru maze game.
Quest Simulation: , like Trek with monsters, trees, treasures.
Solitaire: solitaire,
Educational
.
Training systems; an ambitious ICAI programming system featuring partial-order plans, used to train Con Edison steam plant operators.
History
Impetus
Before the 1944 G.I. Bill that provided free college education to World War II veterans, higher education was limited to a minority of the US population, though only 9% o |
https://en.wikipedia.org/wiki/NesC | nesC (pronounced "NES-see") is a component-based, event-driven programming language used to build applications for the TinyOS platform. TinyOS is an operating environment designed to run on embedded devices used in distributed wireless sensor networks. nesC is built as an extension to the C programming language with components "wired" together to run applications on TinyOS. The name nesC is an abbreviation of "network embedded systems C".
Components and interfaces
nesC programs are built out of components, which are assembled ("wired") to form whole programs. Components have internal concurrency in the form of tasks. Threads of control may pass into a component through its interfaces. These threads are rooted either in a task or a hardware interrupt.
Interfaces may be provided or used by components. The provided interfaces are intended to represent the functionality that the component provides to its user, the used interfaces represent the functionality the component needs to perform its job.
In nesC, interfaces are bidirectional: They specify a set of functions to be implemented by the interface's provider (commands) and a set to be implemented by the interface's user (events). This allows a single interface to represent a complex interaction between components (e.g., registration of interest in some event, followed by a callback when that event happens). This is critical because all lengthy commands in TinyOS (e.g. send packet) are non-blocking; their completion is signaled through an event (send done). By specifying interfaces, a component cannot call the send command unless it provides an implementation of the sendDone event. Typically commands call downwards, i.e., from application components to those closer to the hardware, while events call upwards. Certain primitive events are bound to hardware interrupts.
Components are statically linked to each other via their interfaces. This increases runtime efficiency, encourages robust design, and allows for better static analysis of programs.
External links
Embedded systems
Wireless sensor network
C programming language family |
https://en.wikipedia.org/wiki/Quad%20Data%20Rate%20SRAM | Quad Data Rate (QDR) SRAM is a type of static RAM computer memory that can transfer up to four words of data in each clock cycle. Like Double Data-Rate (DDR) SDRAM, QDR SRAM transfers data on both rising and falling edges of the clock signal. The main purpose of this capability is to enable reads and writes to occur at high clock frequencies without the loss of bandwidth due to bus-turnaround cycles incurred in DDR SRAM. QDR SRAM uses two clocks, one for read data and one for write data and has separate read and write data buses (also known as Separate I/O), whereas DDR SRAM uses a single clock and has a single common data bus used for both reads and writes (also known as Common I/O). This helps to eliminate problems caused by the propagation delay of the clock wiring, and allows the illusion of concurrent reads and writes (as seen on the bus, although internally the memory still has a conventional single port - operations are pipelined but sequential).
When all data I/O signals are accounted, QDR SRAM is not 2x faster than DDR SRAM but is 100% efficient when reads and writes are interleaved. In contrast, DDR SRAM is most efficient when only one request type is continually repeated, e.g. only read cycles. When write cycles are interleaved with read cycles, one or more cycles are lost for bus turnaround to avoid data contention, which reduces bus efficiency. Most SRAM manufacturers constructed QDR and DDR SRAM using the same physical silicon, differentiated by a post-manufacturing selection (e.g. blowing a fuse on chip).
QDR SRAM was designed for high-speed communications and networking applications, where data throughput is more important than cost, power efficiency or density. The technology was created by Micron and Cypress, later followed by IDT, then NEC, Samsung and Renesas. Quad Data Rate II+ Memory is currently being designed by Cypress Semiconductor for Radiation Hardened Environments.
I/O
Clock inputs
4 clock lines:
Input clock:
K
not-K, or /K
Output clock:
C
not-C, or /C
Control inputs
Two control lines:
not-Write enable: /WPS
not-Read enable: /RPS
Buses
One address bus and two data buses:
Address bus
Data in bus
Data out bus
Clocking scheme
Addresses
Read address latched on rising edge of C
Write address latched on rising edge of K (in burst-of-4 mode, burst-of-2 uses rising edge of not-K)
Data
Write
If /WPS is low
A data word on Data In is latched on rising edge of K
The next data word on Data In is latched on rising edge of /K
Read
A read is a two-cycle process
If /RPS is low
The first rising edge of C latches the read address, A
The second rising edge of C puts the data word, from address A, on the Data Out bus
The next rising edge of /C puts the next data word, from address A+1, on the Data Out bus
External links
AN4065 QDR-II, QDR-II+, DDR-II, DDR-II+ Design GUide
Computer memory |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.