source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Iomega | Iomega (later LenovoEMC) produced external, portable, and networked data storage products. Established in the 1980s in Roy, Utah, United States, Iomega sold more than 410 million digital storage drives and disks, including the Zip drive floppy disk system. Formerly a public company, it was acquired by EMC Corporation in 2008, and then by Lenovo, which rebranded the product line as LenovoEMC, until discontinuation in 2018.
History
Iomega started in Roy, Utah, U.S. in 1980 and moved its headquarters to San Diego, California in 2001. For many years, it was a significant name in the data storage industry. Iomega's most famous product, the Zip drive, offered relatively large amounts of storage on portable, high-capacity floppy disks. The original Zip disk's 100MB capacity was a huge improvement over the decades-long standard of 1.44MB standard floppy disks. The Zip drive became a common internal and external peripheral for IBM-compatible and Macintosh personal computers. However, Zip drives sometimes failed after a short period, which failure was commonly referred to as the "click of death." This problem, combined with competition from CD-RW drives, caused Zip drive sales to decline dramatically, even after introducing larger 250MB and 750MB versions. Iomega eventually launched a CD-RW drive.
Without the revenue from its proprietary storage disks and drives, Iomega's sales and profits declined considerably. Iomega's stock price, which was over $100 at its height in the 1990s, fell to around $2 in the mid-2000s. Trying to find a niche, Iomega released devices such as the HipZip MP3 player, the FotoShow Digital Image Center, and numerous external hard drives, optical drives, and NAS products. None of these products were successful.
In 2012, reporter Vincent Verweij of Dutch broadcaster Katholieke Radio Omroep revealed that at least 16,000 Iomega NAS devices were publicly exposing their users' files on the Internet. This was due to Iomega having disabled password security by default. KLM, ING Group, and Ballast Nedam all had confidential material leaked in this manner. Iomega USA acknowledged the problem and said future models (starting February 2013) would have password security enabled by default. The company said it would clearly instruct users about the risks of unsecured data.
Acquisition by EMC
On April 8, 2008, EMC Corporation announced plans to acquire Iomega for . The acquisition was completed in June 2008, making Iomega the SOHO/SMB arm of EMC. EMC kept the Iomega brand name alive with products such as the StorCenter NAS line, ScreenPlay TV Link adapter, and v.Clone virtualization software.
Joint venture with Lenovo: LenovoEMC
In 2013, EMC (before the Dell purchase) formed a joint venture with Chinese technology company Lenovo, named LenovoEMC, that took over Iomega's business. LenovoEMC rebranded all of Iomega's products under its name. LenovoEMC designed products for small and medium-sized businesses that could not afford enterprise-c |
https://en.wikipedia.org/wiki/File%20verification | File verification is the process of using an algorithm for verifying the integrity of a computer file, usually by checksum. This can be done by comparing two files bit-by-bit, but requires two copies of the same file, and may miss systematic corruptions which might occur to both files. A more popular approach is to generate a hash of the copied file and comparing that to the hash of the original file.
Integrity verification
File integrity can be compromised, usually referred to as the file becoming corrupted. A file can become corrupted by a variety of ways: faulty storage media, errors in transmission, write errors during copying or moving, software bugs, and so on.
Hash-based verification ensures that a file has not been corrupted by comparing the file's hash value to a previously calculated value. If these values match, the file is presumed to be unmodified. Due to the nature of hash functions, hash collisions may result in false positives, but the likelihood of collisions is often negligible with random corruption.
Authenticity verification
It is often desirable to verify that a file hasn't been modified in transmission or storage by untrusted parties, for example, to include malicious code such as viruses or backdoors. To verify the authenticity, a classical hash function is not enough as they are not designed to be collision resistant; it is computationally trivial for an attacker to cause deliberate hash collisions, meaning that a malicious change in the file is not detected by a hash comparison. In cryptography, this attack is called a preimage attack.
For this purpose, cryptographic hash functions are employed often. As long as the hash sums cannot be tampered with — for example, if they are communicated over a secure channel — the files can be presumed to be intact. Alternatively, digital signatures can be employed to assure tamper resistance.
File formats
A checksum file is a small file that contains the checksums of other files.
There are a few well-known checksum file formats.
Several utilities, such as md5deep, can use such checksum files to automatically verify an entire directory of files in one operation.
The particular hash algorithm used is often indicated by the file extension of the checksum file.
The ".sha1" file extension indicates a checksum file containing 160-bit SHA-1 hashes in sha1sum format.
The ".md5" file extension, or a file named "MD5SUMS", indicates a checksum file containing 128-bit MD5 hashes in md5sum format.
The ".sfv" file extension indicates a checksum file containing 32-bit CRC32 checksums in simple file verification format.
The "crc.list" file indicates a checksum file containing 32-bit CRC checksums in brik format.
As of 2012, best practice recommendations is to use SHA-2 or SHA-3 to generate new file integrity digests;
and to accept MD5 and SHA1 digests for backward compatibility if stronger digests are not available.
The theoretically weaker SHA1, the weaker MD5, or much weaker CRC |
https://en.wikipedia.org/wiki/Metal%20Gear%20Solid%202%3A%20Sons%20of%20Liberty | is a 2001 action-adventure stealth video game developed by Konami Computer Entertainment Japan and published by Konami for the PlayStation 2. Originally released on November 13, 2001, it is the fourth Metal Gear game produced by Hideo Kojima, the seventh overall game in the series and is a sequel to Metal Gear Solid (1998). An expanded edition, titled was released the following year for Xbox and Windows in addition to the PlayStation 2. A remastered version of the game, Metal Gear Solid 2: Sons of Liberty - HD Edition, was later included in the Metal Gear Solid HD Collection for the PlayStation 3, Xbox 360, and PlayStation Vita. The HD Edition of the game was included in the Metal Gear Solid Master Collection Vol. 1 compilation for Nintendo Switch, PlayStation 4, PlayStation 5, Windows, and Xbox Series X/S, which was released on October 24, 2023.
The story revolves around the Big Shell, a massive offshore clean-up facility seized by a group of terrorists who call themselves the Sons of Liberty. They demand an enormous ransom in exchange for the life of the President of the United States and threaten to destroy the facility and create a cataclysmic environmental disaster if their demands are not met. The motives and identities of many of the antagonists and allies change throughout the game, as the protagonists discover a world-shaking conspiracy constructed by a powerful organization known as the Patriots.
Metal Gear Solid 2 received acclaim for its gameplay, graphics, and attention to detail. However, critics were initially divided on the protagonist and the philosophical nature and execution of the game's storyline, which explores themes such as the Information Age, memetics, social engineering, political conspiracies, censorship, artificial intelligence, existentialism, postmodernism, virtual reality, and the internal struggle of freedom of thought. The game was a commercial success, selling seven million copies by 2004. It has since been considered to be one of the greatest video games of all time, as well as a leading example of artistic expression in video games. The game is often considered ahead of its time for dealing with themes and concepts, such as post-truth politics, fake news, alternative facts, synthetic media, and echo chambers, that became culturally relevant in the mid-to-late 2010s.
Gameplay
Metal Gear Solid 2 carries the subtitle of "Tactical Espionage Action," and most of the game involves the protagonist sneaking around to avoid being seen by the enemies. Most fundamental is the broader range of skills offered to the player. The first-person aiming mode allows players to target specific points in the game, greatly expanding tactical options; guards can be blinded by steam, distracted by a flying piece of fruit or hit in weak spots. Players can walk slowly, allowing them to sneak over noisy flooring without making a sound, or hang off walkways to slip past below guards' feet. The corner-press move from Metal Gear Solid, |
https://en.wikipedia.org/wiki/Computer-Assisted%20Passenger%20Prescreening%20System | The Computer-Assisted Passenger Prescreening System (often abbreviated CAPPS) is a counter-terrorism system in place in the United States air travel industry. The United States Transportation Security Administration (TSA) maintains a watchlist, pursuant to 49 USC § 114 (h)(2), of "individuals known to pose, or suspected of posing, a risk of air piracy or terrorism or a threat to airline or passenger safety." The list is used to pre-emptively identify terrorists attempting to buy airline tickets or board aircraft traveling in the United States, and to mitigate perceived threats.
Overview
CAPPS systems rely on what is known as a passenger name record (PNR). When a person books a plane ticket, certain identifying information is collected by the airline: full name, address, etc. This information is used to check against some data store (e.g., a TSA No-Fly list, the FBI ten most wanted fugitive list, etc.) and assign a terrorism "risk score" to that person. High risk scores require the airline to subject the person to extended baggage and/or personal screening, and to contact law enforcement if necessary.
CAPPS I
CAPPS I was first implemented in the late 1990s, in response to the perceived threat of U.S. domestic and international terrorism. CAPPS I was administered by the FBI and FAA. CAPPS screening selected passengers for additional screening of their checked baggage for explosives. CAPPS selectees did not undergo any additional screening at passenger security checkpoints.
September 11, 2001, attacks
On the morning of the September 11 attacks, several of the hijackers were selected by CAPPS. Wail al-Shehri and Satam al-Suqami were selected for extra screening of their checked bags, before they boarded American Airlines Flight 11 at Logan International Airport. Waleed al-Shehri was also selected, but since he had checked no bags, CAPPS selection had no effect on him. Mohamed Atta was selected by CAPPS when he checked in at Portland International Jetport.
All five of the hijackers on American Airlines Flight 77 were CAPPS selectees, with Hani Hanjour, Khalid al-Mihdhar, and Majed Moqed chosen by the CAPPS criteria. Nawaf al-Hazmi and Salem al-Hazmi were selected because they did not provide adequate identification, and had their checked bags held until they boarded the aircraft.
Ahmed al-Haznawi was the only hijacker selected of those on United Airlines Flight 93, and none of the hijackers of United Airlines Flight 175 were selected by CAPPS.
After 9/11
In November 2001, control was transferred to the TSA, where it has "... expanded almost daily as Intelligence Community (IC) agencies and the Office of Homeland Security continue to request the addition of individuals ..."
In 2003, the Transportation Security Administration (TSA) presented a proposal for an expanded system (CAPPS II), which was reviewed by Congress and later canceled by the United States Department of Homeland Security (DHS).
The Computer Assisted Passenger Prescreening S |
https://en.wikipedia.org/wiki/Fat%20binary | A fat binary (or multiarchitecture binary) is a computer executable program or library which has been expanded (or "fattened") with code native to multiple instruction sets which can consequently be run on multiple processor types. This results in a file larger than a normal one-architecture binary file, thus the name.
The usual method of implementation is to include a version of the machine code for each instruction set, preceded by a single entry point with code compatible with all operating systems, which executes a jump to the appropriate section. Alternative implementations store different executables in different forks, each with its own entry point that is directly used by the operating system.
The use of fat binaries is not common in operating system software; there are several alternatives to solve the same problem, such as the use of an installer program to choose an architecture-specific binary at install time (such as with Android multiple APKs), selecting an architecture-specific binary at runtime (such as with Plan 9's union directories and GNUstep's fat bundles), distributing software in source code form and compiling it in-place, or the use of a virtual machine (such as with Java) and just-in-time compilation.
Apollo
Apollo's compound executables
In 1988, Apollo Computer's Domain/OS SR10.1 introduced a new file type, "cmpexe" (compound executable), that bundled binaries for Motorola 680x0 and Apollo PRISM executables.
Apple
Apple's fat binary
A fat-binary scheme smoothed the Apple Macintosh's transition, beginning in 1994, from 68k microprocessors to PowerPC microprocessors. Many applications for the old platform ran transparently on the new platform under an evolving emulation scheme, but emulated code generally runs slower than native code. Applications released as "fat binaries" took up more storage space, but they ran at full speed on either platform. This was achieved by packaging both a 68000-compiled version and a PowerPC-compiled version of the same program into their executable files. The older 68K code (CFM-68K or classic 68K) continued to be stored in the resource fork, while the newer PowerPC code was contained in the data fork, in PEF format.
Fat binaries were larger than programs supporting only the PowerPC or 68k, which led to the creation of a number of utilities that would strip out the unneeded version. In the era of small hard drives, when 80 MB hard drives were a common size, these utilities were sometimes useful, as program code was generally a large percentage of overall drive usage, and stripping the unneeded members of a fat binary would free up a significant amount of space on a hard drive.
NeXT's/Apple's multi-architecture binaries
NeXTSTEP Multi-Architecture Binaries
Fat binaries were a feature of NeXT's NeXTSTEP/OPENSTEP operating system, starting with NeXTSTEP 3.1. In NeXTSTEP, they were called "Multi-Architecture Binaries". Multi-Architecture Binaries were originally intended to allow softwar |
https://en.wikipedia.org/wiki/Vice-county | A vice-county (vice county or biological vice-county) is a geographical division of the British Isles used for the purposes of biological recording and other scientific data-gathering. It is sometimes called a Watsonian vice-county as vice-counties were introduced for Great Britain, its offshore islands, and the Isle of Man, by Hewett Cottrell Watson who first used them in the third volume of his Cybele Britannica published in 1852. Watson's vice-counties were based on the ancient counties of Britain, but often subdividing these boundaries to create smaller, more uniform units, and considering exclaves to be part of the surrounding vice-county.
In 1901 Robert Lloyd Praeger introduced a similar system for Ireland and its off-shore islands.
Vice-counties are the "standard geographical area for county based [...] recording". They provide a stable basis for recording using similarly sized units, and, although National Grid-based reporting has grown in popularity, vice-counties remain a useful mapping boundary, employed in many regional surveys, especially county floras and national lists. This allows data collected over long periods of time to be compared easily. The vice-counties remain unchanged by subsequent local government reorganisations, allowing historical and modern data to be more accurately compared.
In 2002, to mark the 150th anniversary of the introduction of the Watsonian vice-county system, the NBN Trust commissioned the digitisation of the 112 vice-county boundaries for England, Scotland and Wales, based on 420 original one-inch to the mile maps annotated by Dandy in 1947, and held at the Natural History Museum, London. The resulting datafiles were much more detailed than anything readily available to recorders up to that point, and were made freely available (as a beta version). Intended for use with modern GIS and biological recording software, a final 'standard' version was released in 2008. Up until that point, county recorders only had general access to a set of two fold-out vice-county maps covering the entirety of Great Britain, published in 1969.
Vice-county systems
The vice-county system was first introduced by Hewett Cottrell Watson in the third volume of his Cybele Britannica published in 1852. He refined the system in later volumes. The geographical area that Watson called "Britain" consisted of the island of Great Britain with all of its offshore islands, plus the Isle of Man, but excluding the Channel Islands. This area was divided into 112 vice-counties with larger counties divided; for example, Devon into the vice-counties of North Devon and South Devon, and Yorkshire into five vice-counties. Each of these 112 vice-counties has a name and a number. Thus Vice-county 38, often abbreviated to "VC38", is called "Warwickshire".
In 1901, Robert Lloyd Praeger extended the system of vice-counties to Ireland and its off-shore islands, based on an earlier suggestion by C. C. Babington in 1859. The Irish vice-counties were |
https://en.wikipedia.org/wiki/Xerox%20Daybreak | Xerox Daybreak (also Xerox 6085 PCS, Xerox 1186) is a workstation computer marketed by Xerox from 1985 to 1989.
Overview
Daybreak is the final release in the D* (pronounced D-Star) series of machines, some of which share the Wildflower CPU design by Butler Lampson. Machines in this series include, in order, Dolphin, Dorado, Dicentra, Dandelion, Dandetiger, Daybreak, the never-manufactured Daisy, and Dragonfly "a 4-processor VLSI CPU developed at PARC and intended for a high-end printing system".
It was sold as the Xerox 6085 PCS (Professional Computer System) or ViewPoint 6085 PCS when sold as an office workstation running the ViewPoint system. ViewPoint is based on the Star software originally developed for the Xerox Star. The 6085 ran the ViewPoint (later GlobalView) GUI and was used extensively throughout Xerox until being replaced by Suns and PCs. Although years ahead of its time, it was never a commercial success. The proprietary closed architecture and Xerox's reluctance to release the Mesa development environment for general use stifled any third-party development.
A fully configured 6085 came with an 80 MB hard disk, 3.7 MB of RAM, a 5¼-inch floppy disk drive, an Ethernet controller, and a PC emulator card containing an 80186 CPU. The basic system comes with 1.1 MB of RAM and a 10 MB hard disk. It was introduced in 1985 at .
The Daybreak was also sold as a Xerox 1186 workstation when configured as a Lisp machine.
References
External links
OLD-COMPUTERS.COM: Museum: Xerox 6085
Daybreak
Computer workstations
Products introduced in 1985 |
https://en.wikipedia.org/wiki/Digital%20Data%20Storage | Digital Data Storage (DDS) is a computer data storage technology that is based upon the Digital Audio Tape (DAT) format that was developed during the 1980s. DDS is primarily intended for use as off-line storage, especially for generating backup copies of working data.
Design
A DDS cartridge uses tape with a width of 3.81mm, with the exception of the latest formats, DAT-160 and DAT-320, both which use 8mm wide tape. Initially, the tape was 60 meters (197 feet) or 90 meters (295 ft.) in length. Advancements in materials technology have allowed the length to be increased significantly in successive versions. A DDS tape drive uses helical scan recording, the same process used by a video cassette recorder (VCR).
Backward compatibility between newer drives and older cartridges is not assured; the compatibility matrices provided by manufacturers will need to be consulted. Typically drives can read and write tapes in the prior generation format, with most (but not all) also able to read and write tapes from two generations prior. Notice in HP's article that newer tape standards do not simply consist of longer tapes; with DDS-2, for example, the track was narrower than with DDS-1.
At one time, DDS competed against the Linear Tape-Open (LTO), Advanced Intelligent Tape (AIT), VXA, and Travan formats. However, AIT, Travan and VXA are no longer mainstream, and the capacity of LTO has far exceeded that of the most recent DDS standard, DDS-320.
History
DDS-1 Stores up to 1.3 GB uncompressed (2.6 GB compressed) on a 60 m cartridge or 2 GB uncompressed (4 GB compressed) on a 90 m cartridge. The DDS-1 cartridge often does not have the -1 designation, as initially it was the only format, though cartridges produced since the introduction of DDS-2 may carry a -1 designation to distinguish the format from newer formats. A media recognition system was introduced with DDS-2 drives and cartridges to detect the medium type and prevent the loading of an improper medium. From 1993, DDS-1 tapes included the media recognition system marks on the leader tape—a feature indicated by the presence of four vertical bars after the DDS logo.
DDS-2 Stores up to 4 GB uncompressed (8 GB compressed) on a 120 m cartridge.
DDS-3 Stores up to 12 GB uncompressed (24 GB compressed) on a 125 m cartridge. DDS-3 uses PRML (Partial Response Maximum Likelihood) to minimize electronic noise for a cleaner data recording.
DDS-4 DDS-4 stores up to 20 GB uncompressed (40 GB compressed) on a 150 m cartridge. This format is also called DAT 40.
DAT 72 DAT 72 stores up to 36 GB uncompressed (72 GB compressed) on a 170 m cartridge. The DAT 72 standard was developed by HP and Certance. It has the same form-factor as DDS-3 and -4 and is sometimes referred to as DDS-5.
DAT 160 DAT 160 was launched in June 2007 by HP, stores up to 80 GB uncompressed (160 GB compressed). A major change from the previous generations is the width of the tape. DAT 160 uses 8 mm wide tape in a slightly thicker cart |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Ohio | The following is a list of FCC-licensed radio stations in the U.S. state of Ohio, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
1 Operating under a "Shared Time" agreement on the same frequency.
Defunct
KDPM Cleveland (1921–1927)
W45CM/WELD Columbus (1941–1953)
WAQI/WAST Ashtabula (1964–1982)
WBKC/WCDN/WATJ Chardon (1969–2004)
WBBY-FM Westerville (1969–1990)
WBOE Cleveland (1938–1978)
WAND/WCNS/WNYN/WTOF/WBXT/WCER Canton (1947–2011)
WCLW Mansfield (1957–1987)
WCRX-LP Columbus (2007–2020)
WDBK/WFJC Cleveland; moved to Akron in 1927 (1924–1930)
WFRO Fremont (1950–2021)
WJDD Carrollton (surrendered in 2022)
WJEH/WGTR/WJEH Gallipolis (1950–2021)
WJTB North Ridgeville (1984–2017)
WKNT/WJMP Kent (1965–2016)
WJVS Cincinnati (surrendered in 2012)
WKJH-LP Bryan (cancelled in 2023)
WLBJ-LP Fostoria (2015–2020)
WLMH Morrow (cancelled in 2012)
WLQR Toledo (1954–2016)
WMH Cincinnati (1921–1923)
WNSD Cincinnati (1972–1978)
WHBD/WPAY Bellefontaine; moved to Mt. Orab in 1929 and Portsmouth in 1935 (1925–2011)
WWGH-LP
WWGK Cleveland (1947-2021)
WWIZ Lorain (1958–1967)
References
Radio stations
Ohio |
https://en.wikipedia.org/wiki/List%20of%20collectible%20card%20games | This is a list of known collectible card games. Unless otherwise noted, all dates listed are the North American release date.
This contains games backed by physical cards; computer game equivalents are generally called digital collectible card games and are catalogued at List of digital collectible card games.
List
Collectible common-deck card games
These card games are very similar to regular CCGs; however, they do not meet the strict definition, because all players use a shared deck, also known as a common deck, similar to Uno. There is little to no interest in collecting the cards.
Citadel Combat Cards (1992)
Dino Hunt (Steve Jackson Games) (1996)
Dragon Storm Game (Black Dragon Press) (1995)
Nuclear War (Flying Buffalo) (1965)
Non-collectible customizable card games
Sometimes referred to as Living Card Games, these games are very similar to CCGs but lack randomness to the purchase and distribution of the cards. Most are sold as complete sets and are therefore not collectible. Some of these games were meant to be traditional CCGs with booster packs, but the booster packs were never released.
AdventureQuest Worlds The Anything-Goes BattleOn Battle Card Game (Artix Entertainment)
Anachronism (TriKing Games/The History Channel)
Android: Netrunner (Fantasy Flight Games) (2012)
Anime Madness (Matthew Johnston Games) (1996)
Arcmage: Rebirth (Arcmage Creative Commons Games) (2018)
Arkham Horror: The Card Game (Fantasy Flight Games) (2016)
Ashes: Rise of the Phoenixborn (Plaid Hat Games) (2015)
Call of Cthulhu: The Card Game (Fantasy Flight Games) (2008)
Calorie Kids (Ocean of Wisdom) (2000)
Catan Card Game (1996) and its successor The Rivals for Catan (2010) can be played as a customizable card game with the “tournament rules”
ChessHeads (WizerGames) (2004)
Codex: Card-Time Strategy (Sirlin Games) (2016)
Doomtown: Reloaded (Alderac Entertainment Group/Pine Box Entertainment)
Elemental Clash (The Game Crafter/T.O.G. Entertainment) (2009)
A Game of Thrones: The Card Game (Fantasy Flight Games) (2008)
A Game of Thrones: The Card Game Second Edition (Fantasy Flight Games) (2015)
Heavy Gear Fighter (Dream Pod 9) (1995)
Horsepower: 5000 (self-published) (1995)
Killer Bunnies and the Ultimate Odyssey
Knightmare Chess (Steve Jackson Games) (1996)
The Last Great War (The Outsiders Group) (1997)
Legend of the Five Rings: The Card Game (Fantasy Flight Games) (2017)
The Lord of the Rings: The Card Game (Fantasy Flight Games) (2011)
Ophidian 2350 (Ophidian Games/Fleer) (2016)
Shadowfist (2012) (re-styled in 2012 as a "Dynamic Card Game", with pre-constructed starter decks and non-randomized booster packs)
Star Wars: The Card Game (Fantasy Flight Games) (2012)
Star Wars Episode 1 CCG Boxed Set (Decipher, Inc.) (1999)
Tribbles (Decipher, Inc.) (2000)
Warhammer 40,000: Conquest (Fantasy Flight Games) (2014)
Warhammer: Invasion (Fantasy Flight Games) (2009)
Xi Cards (Xi Cards Ltd.) (2014)
Notable non-collectible games
This is a |
https://en.wikipedia.org/wiki/Fat%20tree | The fat tree network is a universal network for provably efficient communication. It was invented by Charles E. Leiserson of the Massachusetts Institute of Technology in 1985. k-ary n-trees, the type of fat-trees commonly used in most high-performance networks, were initially formalized in 1997.
In a tree data structure, every branch has the same thickness (bandwidth), regardless of their place in the hierarchy—they are all "skinny" (skinny in this context means low-bandwidth). In a fat tree, branches nearer the top of the hierarchy are "fatter" (thicker) than branches further down the hierarchy. In a telecommunications network, the branches are data links; the varied thickness (bandwidth) of the data links allows for more efficient and technology-specific use.
Mesh and hypercube topologies have communication requirements that follow a rigid algorithm, and cannot be tailored to specific packaging technologies.
Applications in supercomputers
Supercomputers that use a fat tree network include the two fastest as of late 2018, Summit and Sierra, as well as Tianhe-2, the Meiko Scientific CS-2, Yellowstone, the Earth Simulator, the Cray X2, the Connection Machine CM-5, and various Altix supercomputers.
Mercury Computer Systems applied a variant of the fat tree topology—the hypertree network—to their multicomputers. In this architecture, 2 to 360 compute nodes are arranged in a circuit-switched fat tree network. Each node has local memory that can be mapped by any other node. Each node in this heterogeneous system could be an Intel i860, a PowerPC, or a group of three SHARC digital signal processors.
The fat tree network was particularly well suited to fast Fourier transform computations, which customers used for such signal processing tasks as radar, sonar, and medical imaging.
Related topologies
In August 2008, a team of computer scientists at UCSD published a scalable design for network architecture that uses a topology inspired by the fat tree topology to realize networks that scale better than those of previous hierarchical networks. The architecture uses commodity switches that are cheaper and more power-efficient than high-end modular data center switches.
This topology is actually a special instance of a Clos network, rather than a fat-tree as described above. That is because the edges near the root are emulated by many links to separate parents instead of a single high-capacity link to a single parent. However, many authors continue to use the term in this way.
References
Further reading
Network topology |
https://en.wikipedia.org/wiki/Interstate%20system | Interstate system may refer to:
A system for international relations
Interstate Highway System, a network of controlled-access highways in the United States
Interstate system (world-systems theory), a specific theory of state relationships within world-systems theory. |
https://en.wikipedia.org/wiki/List%20of%20Canadian%20radio%20programs | This is an incomplete list that is biased toward current and popular programming.
0-9
The 180
2 minutes du peuple
3 Guys on the Radio
A
À Propos
Adler on Line
Afghanada
After Hours
And Sometimes Y
The Arts Tonight
As It Happens
B
Backbencher (2010-2011)
Backstage with Ben Heppner
Bandwidth
Basic Black
Because News
Between the Covers
Brave New Waves
Bunny Watson
C
C'est formidable!
C'est la Vie
Canada Live (1992–1993)
Canada Live (2007–)
Canada Reads
Canadia: 2056 (2007-2008)
CBC Radio Overnight
CBC Radio Three
CBC Radio 3 Sessions
CBC Wednesday Night
Charles Adler Tonight (2016-2021)
CHUM Chart
Chatelaine Radio
The Chuck Swirsky Show
The Chumps Without a Net
Commotion
Cross Country Checkup
The Current
D
Day 6
The Dead Dog Café Comedy Hour
The Debaters
Definitely Not the Opera
DiscDrive (2008)
Dispatches
Doc Mailloux
The Doc Project
Double Exposure
E
The Entertainers
F
Finkleman's 45s
Frantic Times
Freestyle
Fuse
G
Gilmour's Albums
Global Village
Go
The Great Eastern
H
The Happy Gang (1937-1959)
Here Come the Seventies
High Definition
The House
I
Ideas
In the Key of Charles
Inside the Music
The Inside Track
Inspector Maigret
The Investigator (1954)
The Irrelevant Show
J
Jake and the Kid
Jazz Beat
Johnny Chase: Secret Agent of Space (1978-1981)
L
Late Night Counsell
Laugh in a Half
Laugh out Loud
Live Audio Wrestling
Lovers and Other Strangers
M
Madly Off in All Directions
Marvin's Room
Medium Rare
Metro Morning
Mr. Interesting's Guide to the Continental United States
Monday Night Playhouse
Monsoon House
Morningside (1976-1997)
Music and Company
The Mystery Project (1992-2002)
N
The National Playlist
National Research Council Time Signal
Nazi Eyes on Canada
Nero Wolfe (a.k.a. Rex Stout's Nero Wolfe)
The Next Chapter
Nightfall (1980-1983)
Night Lines
Nightstream
The Norm
Northern Lights
Now or Never
O
O'Reilly and the Age of Persuasion
O'Reilly on Advertising
The Ongoing History of New Music
OnStage
Ontario Morning
Ontario Today
OverDrive
P
Podcast Playlist
The Point
Prime Time
Prime Time Sports
Q
Q
Quirks and Quarks
R
The R3-30
Radio 2 Morning
Radio 2 Drive
The Radio 2 Top 20
Radio Free Vestibule
The Radio Show
RadioSonic (1997-2003)
Rawhide
RealTime
The Review
ReVision Quest
Rewind
The Roundup
Royal Canadian Air Farce
Running with Scissors with Mr. Interesting
S
Saturday Afternoon at the Opera
Saturday Night Blues
Search Engine
Share the Wealth
The Signal
Simply Sean
Sound Advice
The Sound Lounge
Sounds Like Canada
Spark
Steve, The First
Steve, The Second
The Story from Here
Strike (2007)
Studio Sparks
The Sunday Edition
Sunday Morning
Sunday Night Sex Show
Sunny Days and Nights
T
Talking Books
Tapestry (CBC)
Tapestry (CHFI)
This Country in the Morning (1971-1974)
This I Believe
This Is That
This Morning
Tonic
Trust Inc. (2012)
U
Under the Covers
Unreserved
V
Vanishing Po |
https://en.wikipedia.org/wiki/Hidden-line%20removal | In 3D computer graphics, solid objects are usually modeled by polyhedra. A face of a polyhedron is a planar polygon bounded by straight line segments, called edges. Curved surfaces are usually approximated by a polygon mesh. Computer programs for line drawings of opaque objects must be able to decide which edges or which parts of the edges are hidden by an object itself or by other objects, so that those edges can be clipped during rendering. This problem is known as hidden-line removal.
The first known solution to the hidden-line problem was devised by L. G. Roberts in 1963. However, it severely restricts the model: it requires that all objects be convex. Ruth A. Weiss of Bell Labs documented her 1964 solution to this problem in a 1965 paper.
In 1966 Ivan E. Sutherland listed 10 unsolved problems in computer graphics. Problem number seven was "hidden-line removal". In terms of computational complexity, this problem was solved by Devai in 1986.
Models, e.g. in computer-aided design, can have thousands or millions of edges. Therefore, a computational-complexity approach expressing resource requirements (such as time and memory) as the function of problem sizes is crucial. Time requirements are particularly important in interactive systems.
Problem sizes for hidden-line removal are the total number of the edges of the model and the total number of the visible segments of the edges. Visibility can change at the intersection points of the images of the edges. Let denote the total number of the intersection points of the images of the edges. Both and in the worst case, but usually .
Algorithms
Hidden-line algorithms published before 1984 divide edges into line segments by the intersection points of their images, and then test each segment for visibility against each face of the model. Assuming a model of a collection of polyhedra with the boundary of each topologically equivalent to a sphere and with faces topologically equivalent to disks, according to Euler's formula, there are Θ(n) faces. Testing Θ(n2) line segments against Θ(n) faces takes Θ(n3) time in the worst case. Appel's algorithm is also unstable, because an error in visibility will be propagated to subsequent segment endpoints.
Ottmann and Widmayer
and Ottmann, Widmayer and Wood
proposed O((n + k) log2 n)-time hidden-line algorithms. Then Nurmi improved the running time to O((n + k) log n). These algorithms take Θ(n2 log2 n), respectively Θ(n2 log n) time in the worst case, but if k is less than quadratic, can be faster in practice.
Any hidden-line algorithm has to determine the union of Θ(n) hidden intervals on n edges in the worst case. As Ω(n log n) is a lower bound for determining the union of n intervals,
it appears that the best one can hope to achieve is Θ(n2 log n) worst-case time, and hence Nurmi's algorithm is optimal.
However, the log n factor was eliminated by Devai, who raised the open problem whether the same optimal O(n2) upper bound existed for hidd |
https://en.wikipedia.org/wiki/Richard%20Brodie%20%28programmer%29 | Richard Reeves Brodie (born November 10, 1959) is an American computer programmer and author. He wrote the first version of Microsoft Word. After leaving Microsoft, he became a motivational speaker and authored two books.
Biography
Early life
Brodie was born in Newton, Massachusetts, the elder son of Mary Ann Brodie and Richard Brodie, a child psychologist. He graduated from Newton South High School and entered Harvard College in the fall of 1977, concentrating in applied mathematics with an emphasis on computer science. He left Harvard after his sophomore year and moved to Palo Alto, CA to work for Xerox Corporation's Advanced Systems Division (ASD), where he met Charles Simonyi and helped develop the Bravo X word processor for the Alto computer. Simonyi became a mentor to Brodie at Xerox and took him along when he moved to Microsoft in 1981.
Microsoft
Simonyi hired Brodie in 1981 as Microsoft's 77th employee and a founding member of the Microsoft Application Division.
Brodie distinguished himself at Microsoft by creating the first version of Microsoft Word in less than seven months. In addition to primary authorship of Microsoft Word, he wrote Microsoft's first C compiler, the original version of Notepad, and Word for the IBM PC Jr.
Brodie's success as a programmer brought him to the attention of Bill Gates, who made Brodie his technical assistant in 1983. Brodie's primary accomplishment as Gates's assistant was the management of the Cashmere project, which was released as Word for Windows.
During the Cashmere design, Brodie came up with the idea of the Combo box (a combination text box and drop-down menu widely used today), the Ribbon (a strip of buttons at the top of the screen used to display and change formatting), and the squiggly red underline that checks and flags spelling errors automatically.
Brodie left Microsoft after the company went public in 1986, but returned in 1991 as Chief Software Designer and Lead Developer of the Omega project, which was released as Microsoft Access in 1992. He left Microsoft again in 1994.
After leaving Microsoft
Between his stints at Microsoft, Brodie embarked on a self-improvement quest, taking numerous courses and participating in retreats, seeking an answer to "why money and success didn’t make me happy." He wrote about his experience in his first book, Getting Past OK: The Self-Help Book for People Who Don’t Need Help, first published in 1993. It became a regional bestseller and was republished by Warner Books. He followed it with Virus of the Mind (1995), which explored the new field of memetics from a practical point of view. Hay House bought the rights to both books and currently publishes them in many languages worldwide.
Brodie spoke about his books on The Oprah Winfrey Show and Phil Donahue.
Poker player
Apart from his careers as a programmer and author, Brodie has found creative ways to integrate his love of sports and games into his professional life. In 2003 he joined the profession |
https://en.wikipedia.org/wiki/Philip%20Emeagwali | Philip Emeagwali (born 23 August 1954) is a computer scientist originally from Nigeria. He won the 1989 Gordon Bell Prize for price-performance in high-performance computing applications, in an oil reservoir modeling calculation using a novel mathematical formulation and implementation. He is known for making controversial claims about his achievements that are disputed by the scientific community.
Biography
Philip Emeagwali was born in Akure, Nigeria on 23 August 1954. He was raised in Onitsha in the South Eastern part of Nigeria. His early schooling was suspended in 1967 as a result of the Nigerian Civil War. At age 13, he served in the Biafran army. After the war he completed high-school equivalence through self-study.
Later on he married Dale Brown Emeagwali, an African-American microbiologist.
Education
He traveled to the United States to study under a scholarship following completion of a correspondence course at the University of London. He received a bachelor's degree in mathematics from Oregon State University in 1977. He later moved to Washington D.C., receiving in 1986 a master's degree from George Washington University in ocean and marine engineering, and a second master's in applied mathematics from the University of Maryland. Next magazine suggested that Emeagwali claimed to have further degrees. During this time, he worked as a civil engineer at the Bureau of Land Reclamation in Wyoming.
Court case and the denial of degree
Emeagwali studied for a Ph.D. degree from the University of Michigan from 1987 through 1991. His thesis was not accepted by a committee of internal and external examiners and thus he was not awarded the degree. Emeagwali filed a court challenge, stating that the decision was a violation of his civil rights and that the university had discriminated against him in several ways because of his race. The court challenge was dismissed, as was an appeal to the Michigan state Court of Appeals.
Supercomputing
Emeagwali received the 1989 Gordon Bell Prize for an application of the CM-2 massively-parallel computer. The application used computational fluid dynamics for oil-reservoir modeling. He received a prize in "price/performance" category, with a performance figure of about 400 Mflops/$1M. The winner in the "performance" category was also the winner of the Price/performance category, but unable to receive two prizes: Mobil Research and Thinking Machines used the CM-2 for seismic data processing and achieved the higher ratio of 500 Mflops/$1M. The judges decided on one award per entry. His method involved each microprocessor communicating with six neighbors.
Emeagwali's simulation was the first program to apply a pseudo-time approach to reservoir modeling. He was cited by Bill Clinton as an example of what Nigerians can achieve when given the opportunity and is frequently featured in popular press articles for Black History Month.
Debunked controversial claims
Emeagwali has made several controversial claims abou |
https://en.wikipedia.org/wiki/Info | Info is shorthand for "information". It may also refer to:
Computing
.info, a generic top-level domain
info:, a URI scheme for information assets with identifiers in public namespaces
info (Unix), a command used to view documentation produced by GNU Texinfo
Info.com, a search engine aggregator
, the filename extension for metadata files used by the Amiga Workbench
.nfo, a filename extension for informational text files accompanying compressed software.
Other uses
Info (band), an industrial metal band from Colombia
.info (magazine), a computer magazine
Info TV, a Lithuanian news television station
International Fortean Organization, publishers of the INFO Journal
Miss Info or Minya Oh, an American radio presenter |
https://en.wikipedia.org/wiki/PQ%20tree | A PQ tree is a tree-based data structure that represents a family of permutations on a set of elements, discovered and named by Kellogg S. Booth and George S. Lueker in 1976. It is a rooted, labeled tree, in which each element is represented by one of the leaf nodes, and each non-leaf node is labelled P or Q. A P node has at least two children, and a Q node has at least three children.
A PQ tree represents its permutations via permissible reorderings of the children of its nodes. The children of a P node may be reordered in any way. The children of a Q node may be put in reverse order, but may not otherwise be reordered. A PQ tree represents all leaf node orderings that can be achieved by any sequence of these two operations. A PQ tree with many P and Q nodes can represent complicated subsets of the set of all possible orderings. However, not every set of orderings may be representable in this way; for instance, if an ordering is represented by a PQ tree, the reverse of the ordering must also be represented by the same tree.
PQ trees are used to solve problems where the goal is to find an ordering that satisfies various constraints. In these problems, constraints on the ordering are included one at a time, by modifying the PQ tree structure in such a way that it represents only orderings satisfying the constraint. Applications of PQ trees include creating a contig map from DNA fragments, testing a matrix for the consecutive ones property, recognizing interval graphs, and determining whether a graph is planar.
Examples and notation
If all the leaves of a PQ tree are connected directly to a root P node then all possible orderings are allowed. If all the leaves are connected directly to a root Q node then only one order and its reverse are allowed. If nodes a,b,c connect to a P node, which connects to a root P node, with all other leaf nodes connected directly to the root, then any ordering where a,b,c are contiguous is allowed.
Where graphical presentation is unavailable PQ trees are often noted using nested parenthesized lists. Each matched pair of square parentheses represents a Q node and each matched pair of rounded parentheses represent a P node. Leaves are non-parentheses elements of the lists. The image on the left is represented in this notation by [1 (2 3 4) 5]. This PQ tree represents the following twelve permutations on the set {1, 2, 3, 4, 5}:
12345, 12435, 13245, 13425, 14235, 14325, 52341, 52431, 53241, 53421, 54231, 54321.
PC trees
The PC tree, developed by Wei-Kuan Shih and Wen-Lian Hsu, is a more recent generalization of the PQ tree. Like the PQ tree, it represents permutations by reorderings of nodes in a tree, with elements represented at the leaves of the tree. Unlike the PQ tree, the PC tree is unrooted. The nodes adjacent to any non-leaf node labeled P may be reordered arbitrarily as in the PQ tree, while the nodes adjacent to any non-leaf node labeled C have a fixed cyclic order and may only be reordered by revers |
https://en.wikipedia.org/wiki/Tree%20traversal | In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting (e.g. retrieving, updating, or deleting) each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a binary tree, but they may be generalized to other trees as well.
Types
Unlike linked lists, one-dimensional arrays and other linear data structures, which are canonically traversed in linear order, trees may be traversed in multiple ways. They may be traversed in depth-first or breadth-first order. There are three common ways to traverse them in depth-first order: in-order, pre-order and post-order. Beyond these basic traversals, various more complex or hybrid schemes are possible, such as depth-limited searches like iterative deepening depth-first search. The latter, as well as breadth-first search, can also be used to traverse infinite trees, see below.
Data structures for tree traversal
Traversing a tree involves iterating over all nodes in some manner. Because from a given node there is more than one possible next node (it is not a linear data structure), then, assuming sequential computation (not parallel), some nodes must be deferred—stored in some way for later visiting. This is often done via a stack (LIFO) or queue (FIFO). As a tree is a self-referential (recursively defined) data structure, traversal can be defined by recursion or, more subtly, corecursion, in a natural and clear fashion; in these cases the deferred nodes are stored implicitly in the call stack.
Depth-first search is easily implemented via a stack, including recursively (via the call stack), while breadth-first search is easily implemented via a queue, including corecursively.
Depth-first search
In depth-first search (DFS), the search tree is deepened as much as possible before going to the next sibling.
To traverse binary trees with depth-first search, perform the following operations at each node:
If the current node is empty then return.
Execute the following three operations in a certain order:
N: Visit the current node.
L: Recursively traverse the current node's left subtree.
R: Recursively traverse the current node's right subtree.
The trace of a traversal is called a sequentialisation of the tree. The traversal trace is a list of each visited node. No one sequentialisation according to pre-, in- or post-order describes the underlying tree uniquely. Given a tree with distinct elements, either pre-order or post-order paired with in-order is sufficient to describe the tree uniquely. However, pre-order with post-order leaves some ambiguity in the tree structure.
There are three methods at which position of the traversal relative to the node (in the figure: red, green, or blue) the visit of the node shall take place. The choice of exactly one color determines exactly one visit of a node as describe |
https://en.wikipedia.org/wiki/TDP | TDP or tdp may refer to:
Computing
Thermal design power, a value describing the thermal limits of a computer system
Transparent Distributed Processing, network distributed architecture in the QNX operating system
Politics
Telugu Desam Party, a regional political party in the South Indian states of Telangana and Andhra Pradesh
Territoires de progrès, a political movement in France
Socialist Democratic Party (Turkey), a former political party
Communal Democracy Party, a political party in Northern Cyprus
Democratic Party of Turks, a political party in Macedonia
Science and medicine
TDaP, tetanus, diphtheria and pertussis vaccine
Thermal depolymerization, a process for converting biomass into oil
Thymidine diphosphate, a nucleotide
Thiamine pyrophosphate (thiamine diphosphate), an enzyme cofactor
Torsades de pointes, a form of cardiac arrhythmia
One or more isoforms of TARDBP, a TAR DNA-binding protein
Other uses
Tour de Pologne (TdP), annual men's multiple-stage bicycle race held in Poland
Thames Discovery Programme, a community archaeology project, focusing on the tidal Thames
Trans-Dimensional Police, a fictional agency from the comic book Grimjack
Teledeporte, a Spanish TV sports channel |
https://en.wikipedia.org/wiki/Popstars%20Live | Popstars Live was an Australian music talent show television program similar to Australian Idol that aired on the Seven Network in early 2004. It was an evolution of the original Popstars TV show which aired between 2000 and 2002 on Seven. The show spawned a single and album that made the ARIA charts in April that year.
Popstars Live premiered on the Seven Network in February 2004. It was scheduled to run for 16 weeks and was originally slated to air on Sunday and Wednesday nights. During its short run Popstars Live had a troubled history, with two key personnel, Christine Anu and John Paul Young, leaving the program in April 2004 while others have publicly expressed their own concerns about the show. The show was also a ratings failure.
Origins
Popstars Live was based on the original Popstars, a reality television program that was broadcast on the Seven Network between 2000 and 2002. The aim of that program was to select members for a group or a solo singer and follow the process of recording a single and/or album and the subsequent promotion of the record made by the artists.
The Australian TV show saw the creation of three acts which enjoyed initial success:
Bardot (2000) a girl group number one single and album;
Scandal'us (2001) a mixed pop group, number one single, number two album;
Scott Cain (2002) a male singer, number one single.
While the first season of Popstars was one of the most popular programs on Australian television in 2000, its popularity steadily declined in later seasons. In 2003, the Seven Network rested the concept. However, the success of Australian Idol, a show that became the most popular program on Australian television that year, soon led to the Seven Network revisiting the Popstars format.
Record sales for Idol contestants also played a role in the resurrection of Popstars with Australian Idol winner Guy Sebastian releasing an album Just as I Am that went six times platinum in Australia and runner up Shannon Noll's That's What I'm Talking About striking up sales of five times platinum. Hoping to emulate the success of BMG Records, which had signed on Sebastian and Noll, Universal Music quickly signed up for the new series.
Format
The first five episodes featured the selection of the finalists by the judges. The finalists would then sing live in front of an audience with one finalist being eliminated each week until the final winner is selected. The program aimed to attract a large proportion of voters under 25, a similar as Australian Idol.
Cast
The Popstars Team consisted of:
Luke Jacobz host;
Ian "Molly" Meldrum judge;
Christine Anu judge;
Shauna Jensen judge;
Tania Doko artist mentor;
John Paul Young artist mentor;
The judges initially said that they would offer constructive criticism to the contestants unlike the strong and sometimes personal criticism offered by Mark Holden and Ian "Dicko" Dickson of rival series Australian Idol.
Finalists
The finalists were (in order of elimination):
Tarr |
https://en.wikipedia.org/wiki/GCSE%20%28disambiguation%29 | GCSE is the initialism of General Certificate of Secondary Education.
GCSE can also refer to:
Global common subexpression elimination, an optimization technique used by some compilers.
"Ghetto Children Sex Education", a single released by UK hip-hop artist Blak Twang.
Grand Cross of the Saxe-Ernestine House Order, a historical German Ducal award.
Grand Cross of the Military Order of Saint James of the Sword, a Portuguese order of chilvary. |
https://en.wikipedia.org/wiki/Join%20%28Unix%29 | join is a command in Unix and Unix-like operating systems that merges the lines of two sorted text files based on the presence of a common field. It is similar to the join operator used in relational databases but operating on text files.
Overview
The join command takes as input two text files and a number of options. If no command-line argument is given, this command looks for a pair of lines from the two files having the same first field (a sequence of characters that are different from space), and outputs a line composed of the first field followed by the rest of the two lines.
The program arguments specify which character to be used in place of space to separate the fields of the line, which field to use when looking for matching lines, and whether to output lines that do not match. The output can be stored to another file rather than printing using redirection.
As an example, the two following files list the known fathers and the mothers of some people. Both files have been sorted on the join field — this is a requirement of the program.
george jim
kumar gunaware
albert martha
george sophie
The join of these two files (with no argument) would produce:
george jim sophie
Indeed, only "george" is common as a first word of both files.
History
is intended to be a relation database operator. It is part of the X/Open Portability Guide since issue 2 of 1987. It was inherited into the first version of POSIX.1 and the Single Unix Specification.
The version of join bundled in GNU coreutils was written by Mike Haertel. The command is available as a separate package for Microsoft Windows as part of the UnxUtils collection of native Win32 ports of common GNU Unix-like utilities.
See also
Textutils
Join (SQL)
Relational algebra
List of Unix commands
References
External links
join command
Unix text processing utilities
Unix SUS2008 utilities
Plan 9 commands |
https://en.wikipedia.org/wiki/DIBOL | DIBOL or Digital's Business Oriented Language is a general-purpose, procedural, imperative programming language that was designed for use in Management Information Systems (MIS) software development. It was developed from 1970 to 1993.
DIBOL has a syntax similar to FORTRAN and BASIC, along with BCD arithmetic. It shares the COBOL program structure of separate data and procedure divisions. Unlike Fortran's numeric labels (for GOTO), DIBOL's were alphanumeric; the language supported a counterpart to computed goto.
History
DIBOL was originally marketed by Digital Equipment Corporation (DEC) in 1970.
The original version, DIBOL-8, was produced for PDP-8 systems running COS-300. The PDP-8-like DECmate II, supports the COS-310 Commercial Operating System, featuring DIBOL.
DIBOL-11 was developed for the PDP-11 running COS-350 operating system. It also ran on RSX-11, RT-11, and from 1978 on RSTS/E. DIBOL-32 runs on VMS systems, although it can also be used on other systems through emulators.
ANSI Standards were released in 1983, 1988 and 1992 (ANSI X3.165-1992). The 1992 standard was revised in 2002.
DIBOL compilers were developed by several other companies, including DBL from DISC (later Synergex), Softbol from Omtool, and Unibol from Software Ireland, Ltd. Development of DIBOL effectively ceased after 1993, when an agreement between DEC and DISC replaced DIBOL with DBL on OpenVMS, Digital UNIX, and SCO Unix.
See also
Timeline of programming languages
References
Reading
Procedural programming languages
OpenVMS software
Programming languages created in 1970
Programming languages
Digital Equipment Corporation |
https://en.wikipedia.org/wiki/MAGENTA | In cryptography, MAGENTA is a symmetric key block cipher developed by Michael Jacobson Jr. and Klaus Huber for Deutsche Telekom. The name MAGENTA is an acronym for Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication Applications. (The color magenta is also part of the corporate identity of Deutsche Telekom.) The cipher was submitted to the Advanced Encryption Standard process, but did not advance beyond the first round; cryptographic weaknesses were discovered and it was found to be one of the slower ciphers submitted.
MAGENTA has a block size of 128 bits and key sizes of 128, 192 and 256 bits. It is a Feistel cipher with six or eight rounds.
After the presentation of the cipher at the first AES conference, several cryptographers immediately found vulnerabilities. These were written up and presented at the second AES conference (Biham et al., 1999).
References
External links
John Savard's description of Magenta
SCAN's entry for the cipher
Deutsche Telekom
Feistel ciphers |
https://en.wikipedia.org/wiki/UNIX%20System%20V | Unix System V (pronounced: "System Five") is one of the first commercial versions of the Unix operating system. It was originally developed by AT&T and first released in 1983. Four major versions of System V were released, numbered 1, 2, 3, and 4. System V Release 4 (SVR4) was commercially the most successful version, being the result of an effort, marketed as Unix System Unification, which solicited the collaboration of the major Unix vendors. It was the source of several common commercial Unix features. System V is sometimes abbreviated to SysV.
, the AT&T-derived Unix market is divided between four System V variants: IBM's AIX, Hewlett Packard Enterprise's HP-UX and Oracle's Solaris, plus the free-software illumos forked from OpenSolaris.
Overview
Introduction
System V was the successor to 1982's UNIX System III. While AT&T developed and sold hardware that ran System V, most customers ran a version from a reseller, based on AT&T's reference implementation. A standards document called the System V Interface Definition outlined the default features and behavior of implementations.
AT&T support
During the formative years of AT&T's computer business, the division went through several phases of System V software groups, beginning with the Unix Support Group (USG), followed by Unix System Development Laboratory (USDL), followed by AT&T Information Systems (ATTIS), and finally Unix System Laboratories (USL).
Rivalry with BSD
In the 1980s and early-1990s, UNIX System V and the Berkeley Software Distribution (BSD) were the two major versions of UNIX. Historically, BSD was also commonly called "BSD Unix" or "Berkeley Unix". Eric S. Raymond summarizes the longstanding relationship and rivalry between System V and BSD during the early period:
While HP, IBM and others chose System V as the basis for their Unix offerings, other vendors such as Sun Microsystems and DEC extended BSD. Throughout its development, though, System V was infused with features from BSD, while BSD variants such as DEC's Ultrix received System V features. AT&T and Sun Microsystems worked together to merge System V with BSD-based SunOS to produce Solaris, one of the primary System V descendants still in use today. Since the early 1990s, due to standardization efforts such as POSIX and the success of Linux, the division between System V and BSD has become less important.
Releases
SVR1
System V, known inside Bell Labs as Unix 5.0, succeeded AT&T's previous commercial Unix called System III in January, 1983.
Unix 4.0 was never released externally, which would have been designated as System IV.
This first release of System V (called System V.0, System V Release 1, or SVR1) was developed by AT&T's UNIX Support Group (USG) and based on the Bell Labs internal USG UNIX 5.0.
System V also included features such as the vi editor and curses from 4.1 BSD, developed at the University of California, Berkeley; it also improved performance by adding buffer and inode caches. It also adde |
https://en.wikipedia.org/wiki/Network%20file%20system | Network file system may refer to:
A distributed file system, which is accessed over a computer network
Network File System (protocol), a specific brand of distributed file system |
https://en.wikipedia.org/wiki/Bruce%20Bethke | Bruce Bethke (born 1955) is an American author best known for his 1983 short story "Cyberpunk" which led to the widespread use of the term for the cyberpunk subgenre of science fiction. His novel, Headcrash, won the Philip K. Dick Award in 1995 for SF original paperback published in the US.
Bethke's collected thoughts on the cyberpunk subculture are available on his website, in an essay entitled "The Etymology of Cyberpunk".
Bethke served as a judge on the Philip K. Dick Award in 2013.
Life
Bethke lives in Minnesota where he works as a developer of supercomputer software.
Bibliography
Maverick: Written from an outline by Isaac Asimov in 1990, this novel was one of a series of novels set in Asimov's Robot universe.
Headcrash: Bethke's first published novel, published in 1995. Headcrash is the story of Jack Burroughs, a computer nerd in his mid twenties, who lives with his overbearing mother, and works a dead-end job at a software firm. Jack lives a far more interesting virtual life in the metaverse, where he is an elite hacker who goes by the handle MAX_KOOL. Along with his friend Gunnar, Jack is hired to hack into a corporate system to retrieve files proving that the company was stolen from the rightful heir of its founder. This novel was awarded the Philip K. Dick Award. This work is sometimes credited with the first use of the word "Spam" as a term for junk e-mail. Bethke replies that while he appreciates the thought, the term was in common use on usenet long before he used it in Headcrash.
Rebel Moon: A collaboration with Vox Day, Rebel Moon was the novelization of the prequel of the game Rebel Moon Rising. The main plot is similar to The Moon Is a Harsh Mistress, though the book itself focuses on a few individual characters and their battles in the war, and not the political and economic ramifications of a battle for independence on the moon.
Wild Wild West: The novelization of the critically panned steampunk western comedy film Wild Wild West. Bethke summarily dismisses the novel on his website, stating it was how he paid for a new roof for his house.
Controversy
"Cyberpunk"
Initially written as a series of short stories in 1980, the culminated novel was purchased by a publisher via an exclusive contract which forbade Bethke to sell the novel to any other publisher. The publisher decided not to release the novel, causing several years of legal battles over the rights to the book. Bethke has a downloadable version of the novel available for five dollars on his website.
When asked, during a 2005 interview, "Why was your book Cyberpunk never published when you sold it to a publisher in 1989?" Bruce replied, "Ah, well, hindsight is 20/20. The book was never released because the publisher hated the ending and I refused to rewrite it. What the publisher wanted me to write was a "Frazetta cover" ending; you know, the hero, center stage, with a mighty weapon in his hands, a cowering half-naked babe at his feet, and the blood-smeared cor |
https://en.wikipedia.org/wiki/Wings%203D | Wings 3D is a free and open-source subdivision modeler inspired by Nendo and Mirai from Izware. Wings 3D is named after the winged-edge data structure it uses internally to store coordinate and adjacency data, and is commonly referred to by its users simply as Wings.
Wings 3D is available for Windows, Linux, and Mac OS X, using the Erlang environment.
Overview
Wings 3D can be used to model and texture low to mid-range polygon models. Wings does not support animations and has only basic OpenGL rendering facilities, although it can export to external rendering software such as POV-Ray and YafRay. Wings is often used in combination with other software, whereby models made in Wings are exported to applications more specialized in rendering and animation such as Blender.
Interface
Wings 3D uses context-sensitive menus as opposed to a highly graphical, icon-oriented interface. Modeling is done using the mouse and keyboard to select and modify different aspects of a model's geometry in four different selection modes: Vertex, Edge, Face and Body. Because of Wings's context-sensitive design, each selection mode has its own set of mesh tools. Many of these tools offer both basic and advanced uses, allowing users to specify vectors and points to change how a tool will affect their model. Wings also allows users to add textures and materials to models, and has built-in AutoUV mapping facilities.
Features
A wide variety of Selection and Modeling Tools
Modeling Tool support for Magnets and Vector Operations
Customizable Hotkeys and Interface
Tweak Mode lets you make quick adjustments to a mesh
Assign and edit Lighting, Materials, Textures, and Vertex Colours
AutoUV Mapping
Ngon mesh support
A Plugin Manager for adding and removing plugins
Import and Export in many popular formats
Supported file formats
Wings loads and saves models in its own format (.wings), but also supports several standard 3D formats.
Import
Nendo (.ndo)
3D Studio (.3ds)
Adobe Illustrator (.ai)
Lightwave/Modo (.lwo/.lxo)
Wavefront (.obj)
PostScript (Inkscape) (.ps)
Encapsulated PostScript (.eps)
Stereolithography (.stl)
Paths (.svg)
Export
Nendo (.ndo)
3D Studio (.3ds)
Adobe Illustrator (.ai)
BZFlag (.bzw)
Kerkythea (.xml)
Lightwave/Modo (.lwo/.lxo)
Wavefront (.obj)
POV-Ray (.pov)
Cartoon Edges (.eps/.svg)
Stereolithography (.stl)
Renderware (.rwx)
VRML 2.0 (.wrl)
DirectX (.x)
Collada (.dae)
See also
Blender (software)
3D modelling
References
External links
(The old Wings 3D source code repository)
The Wings 3D Official Development Forum (The best place to get help with Wings 3D)
The OLD Wings 3D Forum
Wings3d.es | The Spanish language Wings 3D Community
Wings3d.de | The German language Wings 3D Community
The Brazilian Portuguese language Wings 3D Community
Wings 3D on the BeyondUnreal.com Wiki
Video Tutorials in the YouTube wings3dchannel
3D graphics software
Free 3D graphics software
3D modeling software for Linux
Free computer-aid |
https://en.wikipedia.org/wiki/GMR%20%28cryptography%29 | In cryptography, GMR is a digital signature algorithm named after its inventors Shafi Goldwasser, Silvio Micali and Ron Rivest.
As with RSA the security of the system is related to the difficulty of factoring very large numbers. But, in contrast to RSA, GMR is secure against adaptive chosen-message attacks, which is the currently accepted security definition for signature schemes— even when an attacker receives signatures for messages of his choice, this does not allow them to forge a signature for a single additional message.
External links
Digital signature schemes |
https://en.wikipedia.org/wiki/Leonard%20Liggio | Leonard P. Liggio (July 5, 1933 – October 14, 2014) was a classical liberal author, research professor of law at George Mason University and executive vice president of the Atlas Network in Fairfax, Virginia.
Career
In 1965, Liggio gave lectures with Russell Stetler on "Imperialism and Anti-Imperialism: The Ideological Question in Vietnam" for the newly founded Free University of New York. Liggio provided editorial direction for Literature of Liberty: A Review of Contemporary Liberal Thought, a periodical published by the Cato Institute from 1978 to 1979, then by the Institute for Humane Studies from 1980 to 1982.
Liggio was a visiting professor of law at the Francisco Marroquin University in Guatemala City, at the Academia Istropolitana in Bratislava (Slovakia), at the Institute for Political and Economic Studies (Georgetown University) and at the University of Aix-en-Provence, France. He was executive director of the John Templeton Foundation Freedom Project at the Atlas Network, where he led the International Freedom Project from 1998 to 2003. Liggio was a distinguished senior scholar with the Institute for Humane Studies, where he served as director of Programs in History and Social Theory from 1974 to 1977, as executive vice-president from 1979 to 1980 and then as president from 1980 to 1989. Liggio served the Humane Studies Foundation as chairman from 1980 to 1994 and then as vice-chairman from 1994 to 1998.
International activities
Liggio had an international influence. In 1958, he attended his first meeting of the Mont Pelerin Society in the United States, held at Princeton University. He became a member of the program committee for the society's 1994 meeting at Cannes in 1992. In 1996, he became its treasurer until 2000 as well as a member of its Program and Planning Committee for the 1998 Society meeting in Washington, D.C., and of its board of directors until 2006. He became the chairman of its program committee for the 2002 meeting in London, England. He was then vice-president of the Mont Pelerin Society from 2000 to 2002 and its president from 2002 to 2004. He has been senior vice-president since 2004 and due to leave in 2006.
Liggio was a trustee with the Competitive Enterprise Institute since 1994 and the Institute for Economic Studies-Europe in Aix-en-Provence since 1999. From 1988 to 1998, he had been a trustee of the Philadelphia Society, of which he was president from 1992 to 1993 and from 1994 to 1995. He had been also a trustee with the Institute for Humane Studies-Europe in Paris from 1989 to 1999 and of the Acton Institute for the Study of Religion and Liberty from 1990 to 1999. He also served on the boards of a number of other think tanks:
Member of the international advisory council, The Social Affairs Unit, Morley House, London, since 1994;
Member, board of trustees, Liberty Fund;
Member, advisory council, Acton Institute, Rome, Italy;
Member, advisory council, Toqueville Institute, Paris, France;
Member, advisor |
https://en.wikipedia.org/wiki/The%20Black%20Museum | The Black Museum is a radio crime-drama program produced by Harry Alan Towers, which was broadcast in the USA on the Mutual network in 1952. It was then broadcast in Europe in 1953 on Radio Luxembourg, a commercial radio station, and was not broadcast by the BBC until 1991.
Towers was based in London, but this series was recorded in Sydney, Australia. In 1946 Towers and his mother, Margaret Miller Towers, started a company called Towers of London that sold various syndicated radio shows around the world, including The Lives of Harry Lime with Orson Welles, The Secrets of Scotland Yard with Clive Brook, Horatio Hornblower with Michael Redgrave, and a series of Sherlock Holmes stories featuring John Gielgud as Holmes, Ralph Richardson as Watson and Welles as Moriarty.
Towers visited Australia in the late 1940s and set up production facilities in Sydney. The Black Museum was produced in Sydney by Creswick Jenkinson on behalf of Towers of London. It had a top-line Australian cast including Joe McCormick, plus American actor Harp McGuire. Orson Welles's introductions were recorded on tape in London, then flown to Australia to be added to the locally recorded performances. This was the first series to be produced in Australia in this way.
The Black Museum was based on real-life cases from the files of Scotland Yard's Black Museum. The programme was transcribed in 1951 and was broadcast in the United States in 1952 on Mutual. More than 500 of the network's stations carried it. Ira Marion was the scriptwriter and music for the series was composed and conducted by Sidney Torch.
This same music was used for the opening credits of, and incidental music in, the 1955 film They Can't Hang Me, starring Terence Morgan.
Orson Welles was both host and narrator of stories of horror and mystery, based on Scotland Yard's collection of murder weapons and various ordinary objects once associated with historical true crime cases. The show's opening began:
"This is Orson Welles, speaking from London.
(Sound of Big Ben chimes)
The Black Museum ... a repository of death. Here in the grim stone structure on the Thames which houses Scotland Yard is a warehouse of homicide, where everyday objects ... a woman’s shoe, a tiny white box, a quilted robe ... all are touched by murder."
Robert Rietti played the lead roles and Keith Pyott was often in the cast.
In 2002, Towers produced The Black Museum for television and hired director Gregory Mackenzie to be the showrunner and director for the anthology series using the original narration by Welles. The adaptation was shot on location in London in a film noir style and the pilot starred Michael York as the Scotland Yard Inspector Russell.
Programme format and themes
Walking through the museum, Welles would pause at one of the exhibits, and his description of an artifact served as a device to lead into a wryly narrated dramatised tale of a brutal murder or a vicious crime. In the closing: "Now until we meet again in the same |
https://en.wikipedia.org/wiki/Common%20Scrambling%20Algorithm | The Common Scrambling Algorithm (CSA) is the encryption algorithm used in the DVB digital television broadcasting for encrypting video streams.
CSA was specified by ETSI and adopted by the DVB consortium in May 1994. It is being succeeded by CSA3, based on a combination of 128-bit AES and a confidential block cipher, XRC. However, CSA3 is not yet in any significant use, so CSA continues to be the dominant cipher for protecting DVB broadcasts.
History
CSA was largely kept secret until 2002. The patent papers gave some hints, but important details, like the layout of the so-called S-boxes, remained secret. Without these, free implementations of the algorithm was not possible. Initially, CSA was to remain implemented in hardware only, making it difficult to reverse engineer existing implementations.
In 2002 FreeDec was released, implementing CSA in software. Though released as binary only, disassembly revealed the missing details and allowed reimplementation of the algorithm in higher-level programming languages.
With CSA now publicly known in its entirety, cryptanalysts started looking for weaknesses.
Description of the cipher
The CSA algorithm is composed of two distinct ciphers: a block cipher and a stream cipher.
When used in encryption mode the data are first encrypted using the 64-bit block cipher in CBC mode, starting from packet end.
The stream cipher is then applied from packet start.
Block cipher
The block cipher process 64-bit blocks in 56 rounds. It uses 8 bits from an expanded key on each round.
Stream cipher
The first 32 round of the stream cipher are used for initialization and do not generate any output.
The first 64 bits of data are used as initialization vector during this phase and are left unchanged.
The stream cipher then generates 2 bits of pseudo-random stream on each round which are xored starting at bit 64 of the packet.
Weaknesses
Were CSA to be broken, encrypted DVB transmissions would be decipherable, which would compromise paid digital television services, as DVB has been standardised for digital terrestrial television in Europe and elsewhere, and is used by many satellite television providers.
Most attacks on the pay-TV system have not targeted CSA itself, but instead the various key exchange systems responsible for generating the CSA keys (Conax, Irdeto, Nagravision, VideoGuard, etc.), either by reverse-engineering and breaking the algorithms altogether, or by intercepting the keys in real-time as they are generated on a legitimate decoder, and then distributing them to others (so-called card sharing).
Software implementations and bit slicing
The stream cipher part of CSA is prone to bit slicing, a software implementation technique which allows decryption of many blocks, or the same block with many different keys, at the same time. This significantly speeds up a brute force search implemented in software, although the factor is too low for a practical real-time attack.
The block cipher part is harder t |
https://en.wikipedia.org/wiki/Run-time%20type%20information | In computer programming, run-time type information or run-time type identification (RTTI) is a feature of some programming languages (such as C++, Object Pascal, and Ada) that exposes information about an object's data type at runtime. Run-time type information may be available for all types or only to types that explicitly have it (as is the case with Ada). Run-time type information is a specialization of a more general concept called type introspection.
In the original C++ design, Bjarne Stroustrup did not include run-time type information, because he thought this mechanism was often misused.
Overview
In C++, RTTI can be used to do safe typecasts using the dynamic_cast<> operator, and to manipulate type information at runtime using the typeid operator and std::type_info class. In Object Pascal, RTTI can be used to perform safe type casts with the as operator, test the class to which an object belongs with the is operator, and manipulate type information at run time with classes contained in the RTTI unit (i.e. classes: TRttiContext, TRttiInstanceType, etc.). In Ada, objects of tagged types also store a type tag, which permits the identification of the type of these object at runtime. The in operator can be used to test, at runtime, if an object is of a specific type and may be safely converted to it.
RTTI is available only for classes that are polymorphic, which means they have at least one virtual method. In practice, this is not a limitation because base classes must have a virtual destructor to allow objects of derived classes to perform proper cleanup if they are deleted from a base pointer.
Some compilers have flags to disable RTTI. Using these flags may reduce the overall size of the application, making them especially useful when targeting systems with a limited amount of memory.
C++ – typeid
The typeid keyword is used to determine the class of an object at run time. It returns a reference to std::type_info object, which exists until the end of the program. The use of typeid, in a non-polymorphic context, is often preferred over dynamic_cast<class_type> in situations where just the class information is needed, because typeid is always a constant-time procedure, whereas dynamic_cast may need to traverse the class derivation lattice of its argument at runtime. Some aspects of the returned object are implementation-defined, such as std::type_info::name(), and cannot be relied on across compilers to be consistent.
Objects of class std::bad_typeid are thrown when the expression for typeid is the result of applying the unary * operator on a null pointer. Whether an exception is thrown for other null reference arguments is implementation-dependent. In other words, for the exception to be guaranteed, the expression must take the form typeid(*p) where p is any expression resulting in a null pointer.
Example
#include <iostream>
#include <typeinfo>
class Person {
public:
virtual ~Person() = default;
};
class Employee : public Person |
https://en.wikipedia.org/wiki/WTTE | WTTE (channel 28) is a television station in Columbus, Ohio, United States, airing programming from the digital multicast network TBD. It is owned by Cunningham Broadcasting, which maintains a local marketing agreement (LMA) with Sinclair Broadcast Group, owner of ABC/MyNetworkTV/Fox affiliate WSYX (channel 6), for the provision of certain services. However, Sinclair effectively owns WTTE as the majority of Cunningham's stock is owned by the family of deceased group founder Julian Smith. Sinclair also operates Chillicothe-licensed CW affiliate WWHO (channel 53) under a separate LMA with Manhan Media. The stations share studios on Dublin Road in Grandview Heights (with a Columbus mailing address), while WTTE's transmitter is located in the Franklinton section of Columbus.
A charter Fox affiliate from the network's sign-on from 1986 to 2021, WTTE also served as the Fox station of record for the nearby Zanesville, Ohio, market.
History
WTTE began operations on June 1, 1984, as the first general-entertainment independent station in central Ohio. The station was founded by the Commercial Radio Institute, a subsidiary of the Baltimore-based Sinclair Broadcast Group (at the time, called Chesapeake Broadcasting Corporation) as the company's third television station after WPTT-TV (now WPNT) in Pittsburgh and flagship station WBFF in Baltimore. The station originally operated from studio and office facilities at 6130 South Sunbury Road in Columbus.
WTTE quickly became the dominant independent station in the area largely because its programming policy was far less conservative than that of the other independent in the area, Christian-oriented WSFJ-TV (channel 51). Channel 28 was a charter affiliate of Fox, having joined the network at its launch on October 9, 1986. From 1995 until 1997, WTTE also carried a secondary affiliation with UPN which was then picked up by WWHO. Early in that run, the station listed both affiliations on an equal level (as "the best of both worlds") in its station identifications of the time, including a period where Fox logos were dropped entirely.
Merger with WSYX
In 1996, Sinclair merged with River City Broadcasting, owner of WSYX. Federal Communications Commission (FCC) rules at the time did not allow one person to own two stations in a single market. Sinclair kept the longer-established WSYX and nominally sold WTTE to Glencairn, Ltd. owned by former Sinclair executive Edwin Edwards. However, nearly all of Glencairn's stock was held by the Smith family, founders and owners of Sinclair. In effect, Sinclair still owned WTTE, and now had a duopoly in Columbus in violation of FCC rules. Sinclair and Glencairn further circumvented the rules by moving WTTE's operations into WSYX's Dublin Road studios under a local marketing agreement, with WSYX as senior partner. Glencairn owned ten other stations—all in markets where Sinclair also had a station. Sinclair was eventually fined $40,000 for its illegal control of Glencairn. The two c |
https://en.wikipedia.org/wiki/RTN | RTN may refer to:
Racetrack Television Network, North America
Random telegraph noise
Recursive transition network
Register transfer notation for synchronous digital circuits
Reticular thalamic nucleus
Retro Television Network, US
Routing Transit Number in US banking system
Rowan Television Network
Royal Thai Navy
Former callsign of the NRN TV station in Lismore, NSW, Australia
RTN (Switzerland), radio broadcaster |
https://en.wikipedia.org/wiki/PDF417 | PDF417 is a stacked linear barcode format used in a variety of applications such as transport, identification cards, and inventory management. "PDF" stands for Portable Data File. The "417" signifies that each pattern in the code consists of 4 bars and spaces in a pattern that is 17 units (modules) long. The PDF417 symbology was invented by Dr. Ynjiun P. Wang at Symbol Technologies in 1991. It is defined in ISO 15438.
Applications
PDF417 is used in many applications by both commercial and government organizations. PDF417 is one of the formats (along with Data Matrix) that can be used to print postage accepted by the United States Postal Service. PDF417 is also used by the airline industry's Bar Coded Boarding Pass (BCBP) standard as the 2D bar code symbolism for paper boarding passes. PDF417 is the standard selected by the Department of Homeland Security as the machine readable zone technology for RealID compliant driver licenses and state issued identification cards. PDF417 barcodes are also included on visas and border crossing cards issued by the State of Israel (example).
Features
In addition to features typical of two dimensional bar codes, PDF417's capabilities include:
Linking. PDF417 symbols can link to other symbols which are scanned in sequence allowing even more data to be stored.
User-specified dimensions. The user can decide how wide the narrowest vertical bar (X dimension) is, and how tall the rows are (Y dimension).
Public domain format. Anyone can implement systems using this format without any license.
The introduction of the ISO/IEC document states:
Manufacturers of bar code equipment and users of bar code technology require publicly available standard symbology specifications to which they can refer when developing equipment and application standards. It is the intent and understanding of ISO/IEC that the symbology presented in this International Standard is entirely in the public domain and free of all user restrictions, licences and fees.
Format
The PDF417 bar code (also called a symbol) consists of 3 to 90 rows, each of which is like a small linear bar code. Each row has:
a quiet zone. This is a mandated minimum amount of white space before the bar code begins.
a start pattern which identifies the format as PDF417.
a "row left" codeword containing information about the row (such as the row number and error correction level)
1–30 data codewords: Codewords are a group of bars and spaces representing one or more numbers, letters, or other symbols.
a "row right" codeword with more information about the row.
a stop pattern.
another quiet zone.
All rows are the same width; each row has the same number of codewords.
Codewords
PDF417 uses a base 929 encoding. Each codeword represents a number from 0 to 928.
The codewords are represented by patterns of dark (bar) and light (space) regions. Each of these patterns contains four bars and four spaces (where the 4 in the name comes from). The total width is 17 |
https://en.wikipedia.org/wiki/ROM%20image | A ROM image, or ROM file, is a computer file which contains a copy of the data from a read-only memory chip, often from a video game cartridge, or used to contain a computer's firmware, or from an arcade game's main board. The term is frequently used in the context of emulation, whereby older games or firmware are copied to ROM files on modern computers and can, using a piece of software known as an emulator, be run on a different device than which they were designed for. ROM burners are used to copy ROM images to hardware, such as ROM cartridges, or ROM chips, for debugging and QA testing.
Creation
ROMs can be copied from the read-only memory chips found in cartridge-based games and many arcade machines using a dedicated device in a process known as dumping. For most common home video game systems, these devices are widely available, examples being the Doctor V64, or the Retrode.
Dumping ROMs from arcade machines, which are highly customized PCBs, often requires individual setups for each machine along with a large amount of expertise.
Copy protection mechanisms
While ROM images are often used as a means of preserving the history of computer games, they are also often used to facilitate the unauthorized copying and redistribution of modern games. Viewing this as potentially reducing sales of their products, many game companies have incorporated so-called features into newer games which are designed to prevent copying, while still allowing the original game to be played. For instance, the GameCube uses non-standard 8 cm DVD-like optical media, which for a long time prevented games stored on those discs from being copied. It was not until a security hole was found in Phantasy Star Online Episode I & II that GameCube games could be successfully copied, using the GameCube itself to read the discs.
SNK also employed a method of copy prevention on their Neo Geo games, starting with The King of Fighters in 1999, which used an encryption algorithm on the graphics ROMs to prevent them from being played in an emulator. Many thought that this would mark the end of Neo Geo emulation. However, as early as 2000, hackers found a way to decrypt and dump the ROMs successfully, making them playable once again in a Neo Geo emulator.
Another company which used to employ methods of copy prevention on their arcade games was Capcom, which is known for its CPS-2 arcade board. This contained a heavy copy protection algorithm which was not broken until 7 years after the system's release in 1993. The original crack by the CPS2Shock Team was not a true emulation of the protection because it used XOR tables to bypass the original encryption and allow the game to play in an emulator. Their stated intent was to wait until CPS-2 games were no longer profitable to release the decryption method (three years after the last game release). The full decryption algorithm was cracked in 2007 by Nicola Salmoria, Andreas Naive and Charles MacDonald of the MAME development team. |
https://en.wikipedia.org/wiki/Fair-share%20scheduling | Fair-share scheduling is a scheduling algorithm for computer operating systems in which the CPU usage is equally distributed among system users or groups, as opposed to equal distribution of resources among processes.
One common method of logically implementing the fair-share scheduling strategy is to recursively apply the round-robin scheduling strategy at each level of abstraction (processes, users, groups, etc.) The time quantum required by round-robin is arbitrary, as any equal division of time will produce the same results.
This was first developed by Judy Kay and Piers Lauder through their research at Sydney University in the 1980s.
For example, if four users (A,B,C,D) are concurrently executing one process each, the scheduler will logically divide the available CPU cycles such that each user gets 25% of the whole (100% / 4 = 25%). If user B starts a second process, each user will still receive 25% of the total cycles, but each of user B's processes will now be attributed 12.5% of the total CPU cycles each, totalling user B's fair share of 25%. On the other hand, if a new user starts a process on the system, the scheduler will reapportion the available CPU cycles such that each user gets 20% of the whole (100% / 5 = 20%).
Another layer of abstraction allows us to partition users into groups, and apply the fair share algorithm to the groups as well. In this case, the available CPU cycles are divided first among the groups, then among the users within the groups, and then among the processes for that user. For example, if there are three groups (1,2,3) containing three, two, and four users respectively, the available CPU cycles will be distributed as follows:
100% / 3 groups = 33.3% per group
Group 1: (33.3% / 3 users) = 11.1% per user
Group 2: (33.3% / 2 users) = 16.7% per user
Group 3: (33.3% / 4 users) = 8.3% per user
References
Processor scheduling algorithms |
https://en.wikipedia.org/wiki/Observer%20bias | Observer bias is one of the types of detection bias and is defined as any kind of systematic divergence from accurate facts during observation and the recording of data and information in studies. The definition can be further expanded upon to include the systematic difference between what is observed due to variation in observers, and what the true value is.
Observer bias is the tendency of observers to not see what is there, but instead to see what they expect or want to see. This is a common occurrence in the everyday lives of many and is a significant problem that is sometimes encountered in scientific research and studies. Observation is critical to scientific research and activity, and as such, observer bias may be as well. When such biases exist, scientific studies can result in an over- or underestimation of what is true and accurate, which compromises the validity of the findings and results of the study, even if all other designs and procedures in the study were appropriate.
Observational data forms the foundation of a significant body of knowledge. Observation is a method of data collection and falls into the category of qualitative research techniques. There are a number of benefits of observation, including its simplicity as a data collection method and its usefulness for hypotheses. Simultaneously, there are many limitations and disadvantages in the observation process, including the potential lack of reliability, poor validity, and faulty perception. Participants' observations are widely used in sociological and anthropological studies, while systematic observation is used where researchers need to collect data without participants direct interactions. The most common observation method is naturalistic observation, where subjects are observed in their natural environments with the goal to assess the behaviour in an intervention free and natural setting.
Observer bias is especially probable when the investigator or researcher has vested interests in the outcome of the research or has strong preconceptions. Coupled with ambiguous underlying data and a subjective scoring method, these three factors contribute heavily to the incidence of observer bias.
Examples of cognitive biases include:
Anchoring – a cognitive bias that causes humans to place too much reliance on the initial pieces of information they are provided with for a topic. This causes a skew in judgement and prevents humans and observers from updating their plans and predictions as appropriate.
Bandwagon effect – the tendency for people to "jump on the bandwagon" with certain behaviours and attitudes, meaning that they adopt particular ways of doings things based on what others are doing.
Bias blind spot – the tendency for people to recognize the impact of bias on others and their judgements, while simultaneously failing to acknowledge and recognize the impact that their own biases have on their own judgement.
Confirmation bias – the tendency for people to look for |
https://en.wikipedia.org/wiki/IPN | IPN may refer to:
Payments
Instant payment notification
Chemistry
Interpenetrating polymer network, form of chemical copolymer
Isopropyl nitrate, a liquid monopropellant
Industry
IPN, a type of I-beam used on European standards
Outer space
Interplanetary Internet
InterPlaNet
InterPlanetary Network, a group of spacecraft equipped with gamma-ray burst detectors
Medicine and anatomy
Infectious pancreatic necrosis, disease in fish
Interpeduncular nucleus, a region of the brain
Other
Independent Practitioners Network association for practitioners in psychotherapy, counselling, and related fields
Index of Place Names in Great Britain
World Bank's Inspection Panel of the World Bank Group
Instytut Pamięci Narodowej (Institute of National Remembrance), a Polish historical research institute
Instituto Pedro Nunes, technology transfer center of the University of Coimbra
Instituto Politécnico Nacional (National Polytechnic Institute), Mexican university
International Policy Network (1971–2011), former British think tank
International Polio Network, former name of Post-Polio Health International
IPN, IATA code for Usiminas Airport in Minas Gerais, Brazil
International pitch notation, a method to specify musical pitch |
https://en.wikipedia.org/wiki/Sprawl%20trilogy | The Sprawl trilogy (also known as the Neuromancer, Cyberspace, or Matrix trilogy) is William Gibson's first set of novels, composed of Neuromancer (1984), Count Zero (1986), and Mona Lisa Overdrive (1988).
The novels are all set in the same fictional future, and are subtly interlinked by shared characters and themes (which are not always readily apparent). The Sprawl trilogy shares this setting with Gibson's short stories "Johnny Mnemonic" (1981), "Burning Chrome" (1982), and "New Rose Hotel" (1984), and events and characters from the stories appear in or are mentioned at points in the trilogy.
Setting and story arc
The novels are set in a near-future world dominated by corporations and ubiquitous computing, after a limited World War III. The events of the novels are spaced over 16 years, and although there are familiar characters that appear, each novel tells a self-contained story. Gibson focuses on the effects of technology: the unintended consequences as it filters out of research labs and onto the street where it finds new purposes. He explores a world of direct mind-machine links ("jacking in"), emerging machine intelligence, and a global information space, which he calls "cyberspace". Some of the novels' action takes place in The Sprawl, officially the 'Boston-Atlanta Metropolitan Axis' - an urban environment extending along most of the East Coast of the United States (as a fictional extrapolation of the real-life Northeast megalopolis).
The story arc which frames the trilogy follows a wide cast of characters in a persistent, ongoing narrative - the major commonality between the three being The Sprawl itself. It focuses on the self-contained stories of each character, and highlights their narrative links through suggestion, references, and imagery.
Neuromancer tells the story of Case, a cyberspace "cowboy" (hacker) that gets picked up for a job with an unknown benefactor. The book is the only one in the trilogy that follows a single cohesive plot, with the sequels both featuring multi-strand narrative structures that culminate in the end.
Count Zero consists of three major protagonists, and chapters alternate from one character's story to the next. The first of these is Turner. Turner is an ex-military mercenary. After becoming the victim of a bombing attack, Turner is hired by an old colleague to assist the dangerous extraction of a tech developer. The second is of Bobby Newmark, a teenager living in the slums with his mother. After an attempt at an illegal cyberspace run, Bobby is forced into hiding when it becomes apparent his experiment has put a target on his back. The third is of Marly Krushkova, a disgraced art museum curator who, after being caught in a major fraud scam, is hired by the immensely wealthy Josef Virek to find the artist behind a series of enigmatic artworks.
Finally, Mona Lisa Overdrive Follows four narrative plot threads that follow a similar pattern to Count Zero. The first is of Kumiko, teenage daughter t |
https://en.wikipedia.org/wiki/CKVU-DT | CKVU-DT (channel 10) is a television station in Vancouver, British Columbia, Canada, serving as the West Coast flagship of the Citytv network. It is owned and operated by network parent Rogers Sports & Media alongside Omni Television station CHNM-DT (channel 42). Both stations share studios at the corner of West 2nd Avenue and Columbia Street (near False Creek) in the Mount Pleasant neighbourhood of Vancouver, while CKVU-DT's transmitter is located atop Mount Seymour in the district municipality of North Vancouver, with additional transmitter link facilities on the roof of the Century Plaza Hotel in Downtown Vancouver.
History
CKVU's history dates back to 1975 when Western Approaches Ltd. was awarded the third television station licence in the Vancouver market by the Canadian Radio-television and Telecommunications Commission (CRTC). Western Approaches—which had, unlike the other applicants, filed for both channel 10 and 26—had emerged from a chaotic proceeding in which the CRTC did not award the main channel 10 allocation in deference to the CBC's plan to use it for a television station in Victoria; that station would never launch because of budget cuts in 1978. The station was originally assigned to broadcast on UHF channel 26, but it was instead given channel 21 prior to its launch. (The CBC was already planning on using channel 26 to launch Radio-Canada station CBUFT.) The station first signed on the air on September 1, 1976; it was the first station in Vancouver to transmit on the UHF band. In addition, CKVU was carried on cable channel 13, an assignment it retains to this day. In its first year of operation, CKVU lost more than $3 million.
In 1979, the station was approaching the break-even point. It was also under the scrutiny of the CRTC at that time due to its lack of local programming. According to the CRTC, CKVU did not produce its own newscasts but instead relayed the Ontario-focused newscasts from the Global Television Network. That same year, Charles Allard, owner of CITV in Edmonton, purchased a 5% common stock and 7% preferred stock interest in CKVU through his company, Allarcom. Canwest Pacific, a subsidiary of CanWest Broadcasting, loaned $4 million to Western Approaches so it could thwart a takeover attempt from Allarcom. Three years later, CanWest loaned another $8 million to Western Approaches to reduce the station's debt with the condition that CanWest would have the option to purchase Western Approaches' shares in CKVU.
In 1984, Western Approaches applied to move CKVU-TV from channel 21 to channel 10, which remained vacant after the CBC Victoria plans fell through. Concerns arose over the potential of a stronger channel 10 signal—which would extend service to 183,000 additional people—to overwhelm cable and antenna receiving equipment aimed at Seattle and KCTS-TV on channel 9, particularly because the cable receiving site was colocated with the CKVU transmitter on Salt Spring Island. The CRTC approved the channel change |
https://en.wikipedia.org/wiki/Maximum%20segment%20size | The maximum segment size (MSS) is a parameter of the Options field of the TCP header that specifies the largest amount of data, specified in bytes, that a computer or communications device can receive in a single TCP segment. It does not count the TCP header or the IP header (unlike, for example, the MTU for IP datagrams). The IP datagram containing a TCP segment may be self-contained within a single packet, or it may be reconstructed from several fragmented pieces; either way, the MSS limit applies to the total amount of data contained in the final, reconstructed TCP segment.
To avoid fragmentation in the IP layer, a host must specify the maximum segment size as equal to the largest IP datagram that the host can handle minus the IP and TCP header sizes. Therefore, IPv4 hosts are required to be able to handle an MSS of 536 octets (= 576 - 20 - 20) and IPv6 hosts are required to be able to handle an MSS of 1220 octets (= 1280 - 40 - 20).
Small MSS values will reduce or eliminate IP fragmentation but will result in higher overhead.
Each direction of data flow can use a different MSS.
For most computer users, the MSS option is established by the operating system.
TCP options size (Variable 0–320 bits, in units of 32 bits) must be deducted from MSS size if TCP options are enabled. For example, TCP Time Stamps are enabled by default on Linux platforms.
Default value
The default TCP Maximum Segment Size is for IPv4 is 536. For IPv6 it is 1220. Where a host wishes to set the maximum segment size to a value other than the default, the maximum segment size is specified as a TCP option, initially in the TCP SYN packet during the TCP handshake. The value cannot be changed after the connection is established.
Inter-Layer Communication
In order to notify MSS to the other end, an inter-layer communication is done as follows:
The Network Driver (ND) or interface should know the Maximum Transmission Unit (MTU) of the directly attached network.
The IP should ask the Network Driver for the Maximum Transmission Unit.
The TCP should ask the IP for the Maximum Datagram Data Size (MDDS). This is the MTU minus the IP header length (MDDS = MTU - IPHdrLen).
When opening a connection, TCP can send an MSS option with the value equal to: MDDS - TCPHdrLen. In other words, the MSS value to send is: MSS = MTU - TCPHdrLen - IPHdrLen
While sending TCP segments to the other end, an inter-layer communication is done as follows:
TCP should determine the Maximum Segment Data Size (MSDS) from either the default or the received value of the MSS option.
TCP should determine if source fragmentation is possible (by asking the IP) and desirable.
If so, TCP may hand to IP, segments (including the TCP header) up to MSDS + TCPHdrLen.
If not, TCP may hand to IP, segments (including the TCP header) up to the lesser of (MSDS + TCPHdrLen) and MDDS.
IP checks the length of data passed to it by TCP. If the length is less than or equal MDDS, IP attaches the IP header and hands i |
https://en.wikipedia.org/wiki/Bonnie%20Nardi | Bonnie A. Nardi is an emeritus professor of the Department of Informatics at the University of California, Irvine, where she led the TechDec research lab in the areas of Human-Computer Interaction and computer-supported cooperative work. She is well known for her work on activity theory, interaction design, games, social media, and society and technology. She was elected to the ACM CHI academy in 2013. She retired in 2018.
Work
Prior to teaching at the University of California, Nardi worked at AT&T Labs, Agilent, Hewlett-Packard and Apple labs. She is among anthropologists who have been employed by high-tech companies to examine consumers' behavior in their homes and offices.
Nardi collaborated with Victor Kaptelinin to write Acting with Technology: Activity Theory and Interaction Design (2009) and Activity Theory in HCI: Fundamentals and Reflections (2012). These works discuss activity theory and offer a basis for understanding our relationship with technology.
Interests
Her interests are in the areas of human-computer interaction, computer supported cooperative work, more specifically in activity theory, computer-mediated communication, and interaction design. Nardi has researched CSCW applications and blogging, and has more recently pioneered the study of World of Warcraft in HCI. She has studied the use of technology in offices, hospitals, schools, libraries and laboratories.
She is widely known among librarians – especially research, reference and digital librarians – for Chapter 7 of Information Ecologies, which focused on librarians as keystone species in information ecologies. Nardi's book inspired the title of a UK conference Information Ecologies: the impact of new information 'species''' hosted, inter alia, by the UK Office of Library Networking, now known by its acronym UKOLN, and led to a keynote address by Nardi at a 1998 Library of Congress Institute on Reference Service in a Digital Age. She had written Information Ecologies while a researcher at ATT Labs Research.
Nardi's self-described theoretical orientation is "activity theory" – aka Cultural-Historical Activity Theory (CHAT) -, a philosophical framework developed by the Russian psychologists Vygotsky, Luria, Leont'ev, and their students. "My interests are user interface design, collaborative work, computer-mediated communication, and theoretical approaches to technology design and evaluation." She is currently conducting an ethnographic study of World of Warcraft. According to Oklahoma Senator Tom Coburn's Wastebook 2010, Nardi received a $100,000 grant to "analyze and understand the ways in which players of World of Warcraft, a popular multiplayer game, engage in creative collaboration". In Coburn's list of 100 supposedly-wasteful federal spending projects, Nardi's project came in at number 6, with Coburn's report saying, "Most people have to work for a living, others get to play video games."Tom Coburn, Wastebook 2010 A Guide to Some of the Most Wasteful Gover |
https://en.wikipedia.org/wiki/IBM%20System/32 | The IBM System/32 (IBM 5320) introduced in January 1975 was a midrange computer with built-in display screen, disk drives, printer, and database report software. It was used primarily by small to midsize businesses for accounting applications. RPG II was the primary programming language for the machine.
Overview
The 16-bit single-user System/32, also known as the IBM 5320, was introduced in 1975, and it was the successor to the IBM System/3 model 6 in the IBM midrange computer line. IBM described it as "the first system to incorporate hardware and comprehensive application software." The New York Times described the 32 as "a compact computer for first‐time users with little or no computer programming experience." Within 40 months, "the System/32 had surpassed the IBM System/3 as the most installed IBM computer."
The computer looked like a large office desk with a very small six-line by forty-character display. Having the appearance of a computerized desk, the System/32 was nicknamed the "Bionic Desk" after The Six Million Dollar Man (bionic man), a popular U.S. TV program when the computer was introduced in 1975. The 32 had a built-in line printer, that directly faced the operator when seated, and could print reports, memos, billing statements, address labels, etc.
It had been introduced January 7, 1975 and was withdrawn from marketing on October 17, 1984. Migration to the IBM System/34 was generally simple because source code was compatible and programs just needed recompilation.
Processor
The System/32 featured a 16-bit processor with a 200ns cycle time known as the Control Storage Processor (CSP). Whereas the System/3 used a hardwired processor, the System/32 implemented the System/3 instruction set in microcode. The System/32 processor utilized a vertical microcode format, with each microinstruction occupying 16 bits of control storage. There were 19 different microinstruction opcodes, however certain microinstructions could carry out different operations depending on which bits were set in the rest of the microinstruction, meaning that there were about 70 distinct operations available in total. An optional set of Scientific Macroinstructions was also available, which were used to support a Fortran compiler by implementing support for floating point arithmetic in microcode. Some IBM engineers, including Glenn Henry and Frank Soltis, have retrospectively described the System/32's microcode as resembling a RISC instruction set.
The System/3 emulation performed poorly, which led IBM to implement performance critical parts of the SCP operating system directly in microcode. The later System/34 and System/36 systems addressed this problem by using two different processors - the System/32 CSP architecture was used exclusively for operating system, I/O control and floating point code, whereas user code ran on the Main Storage Processor (MSP) which implemented the System/3 instruction set directly in hardware without microcode. The use of mic |
https://en.wikipedia.org/wiki/Arbitrary-precision%20arithmetic | In computer science, arbitrary-precision arithmetic, also called bignum arithmetic, multiple-precision arithmetic, or sometimes infinite-precision arithmetic, indicates that calculations are performed on numbers whose digits of precision are limited only by the available memory of the host system. This contrasts with the faster fixed-precision arithmetic found in most arithmetic logic unit (ALU) hardware, which typically offers between 8 and 64 bits of precision.
Several modern programming languages have built-in support for bignums, and others have libraries available for arbitrary-precision integer and floating-point math. Rather than storing values as a fixed number of bits related to the size of the processor register, these implementations typically use variable-length arrays of digits.
Arbitrary precision is used in applications where the speed of arithmetic is not a limiting factor, or where precise results with very large numbers are required. It should not be confused with the symbolic computation provided by many computer algebra systems, which represent numbers by expressions such as , and can thus represent any computable number with infinite precision.
Applications
A common application is public-key cryptography, whose algorithms commonly employ arithmetic with integers having hundreds of digits. Another is in situations where artificial limits and overflows would be inappropriate. It is also useful for checking the results of fixed-precision calculations, and for determining optimal or near-optimal values for coefficients needed in formulae, for example the that appears in Gaussian integration.
Arbitrary precision arithmetic is also used to compute fundamental mathematical constants such as π to millions or more digits and to analyze the properties of the digit strings or more generally to investigate the precise behaviour of functions such as the Riemann zeta function where certain questions are difficult to explore via analytical methods. Another example is in rendering fractal images with an extremely high magnification, such as those found in the Mandelbrot set.
Arbitrary-precision arithmetic can also be used to avoid overflow, which is an inherent limitation of fixed-precision arithmetic. Similar to a 5-digit odometer's display which changes from 99999 to 00000, a fixed-precision integer may exhibit wraparound if numbers grow too large to represent at the fixed level of precision. Some processors can instead deal with overflow by saturation, which means that if a result would be unrepresentable, it is replaced with the nearest representable value. (With 16-bit unsigned saturation, adding any positive amount to 65535 would yield 65535.) Some processors can generate an exception if an arithmetic result exceeds the available precision. Where necessary, the exception can be caught and recovered from—for instance, the operation could be restarted in software using arbitrary-precision arithmetic.
In many cases, the ta |
https://en.wikipedia.org/wiki/Atlantis%20PbeM | Atlantis is a free open-ended multi-player computer moderated fantasy turn-based strategy game for any number of players. It is played via email. The game world is populated by many races and monsters. Players may attempt to carve out huge empires, become master magicians, intrepid explorers, rich traders or any other career that comes to mind and interact with other players in trade, war and alliances. There is no declared winner of the game, players set their own objectives, and one can join at any time.
History
Russell Wallace developed the initial version and ran the first game, Atlantis 1.0 in 1993. Geoff Dunbar continued the legacy, first with the extensive playtest of Atlantis 2.0, and then the commercial game Atlantis 3.0. In 1999 Atlantis 4.0 was created by Geoff Dunbar and released under terms of GNU GPL. "AtlantisDev" Yahoo Group was formed sometime after that and Joseph Traub became the maintainer of the code. Atlantis 4.0 was later expanded on by various contributors from the AtlantisDev group.
Since 2011 development uses Git. Currently several developers contribute to server code on GitHub.
Software
Atlantis 5 server source code. The project's GitHub repository
Atlantis Little Helper open source GUI client
Atlantis Crystal Ball free GUI client
Atlantis Advisor GUI client
AtlaClient GUI client
Running Games
Atlantis New Origins. Version 5.2.5 game with 3 days / week turns. Started at 1 Sep 2023.
Twilight Atlantis (Miskatonic 5). Version 4.2 game with 3 days / week turns.
External links
The Atlantis Project contains the history of Atlantis 1–3.
Atlantis 1.0 source code. Enno Rehling's modernized version of the original Atlantis.
Eressea. The game Eressea started in 1996 as a clone of German Atlantis.
PBM.COM. Greg Lindahl's PbM/PbeM Games Homepage.
Notes
1993 video games
Fantasy video games
Play-by-email video games
Open-source video games
Strategy video games |
https://en.wikipedia.org/wiki/Display%20resolution | The display resolution or display modes of a digital television, computer monitor or display device is the number of distinct pixels in each dimension that can be displayed. It can be an ambiguous term especially as the displayed resolution is controlled by different factors in cathode ray tube (CRT) displays, flat-panel displays (including liquid-crystal displays) and projection displays using fixed picture-element (pixel) arrays.
It is usually quoted as , with the units in pixels: for example, means the width is 1024 pixels and the height is 768 pixels. This example would normally be spoken as "ten twenty-four by seven sixty-eight" or "ten twenty-four by seven six eight".
One use of the term display resolution applies to fixed-pixel-array displays such as plasma display panels (PDP), liquid-crystal displays (LCD), Digital Light Processing (DLP) projectors, OLED displays, and similar technologies, and is simply the physical number of columns and rows of pixels creating the display (e.g. ). A consequence of having a fixed-grid display is that, for multi-format video inputs, all displays need a "scaling engine" (a digital video processor that includes a memory array) to match the incoming picture format to the display.
For device displays such as phones, tablets, monitors and televisions, the use of the term display resolution as defined above is a misnomer, though common. The term display resolution is usually used to mean pixel dimensions, the maximum number of pixels in each dimension (e.g. ), which does not tell anything about the pixel density of the display on which the image is actually formed: resolution properly refers to the pixel density, the number of pixels per unit distance or area, not the total number of pixels. In digital measurement, the display resolution would be given in pixels per inch (PPI). In analog measurement, if the screen is 10 inches high, then the horizontal resolution is measured across a square 10 inches wide. For television standards, this is typically stated as "lines horizontal resolution, per picture height"; for example, analog NTSC TVs can typically display about 340 lines of "per picture height" horizontal resolution from over-the-air sources, which is equivalent to about 440 total lines of actual picture information from left edge to right edge.
Background
Some commentators also use display resolution to indicate a range of input formats that the display's input electronics will accept and often include formats greater than the screen's native grid size even though they have to be down-scaled to match the screen's parameters (e.g. accepting a input on a display with a native pixel array). In the case of television inputs, many manufacturers will take the input and zoom it out to "overscan" the display by as much as 5% so input resolution is not necessarily display resolution.
The eye's perception of display resolution can be affected by a number of factors see image resolution and optical resolutio |
https://en.wikipedia.org/wiki/Network%20security%20policy | A network security policy (NSP) is a generic document that outlines rules for computer network access, determines how policies are enforced and lays out some of the basic architecture of the company security/ network security environment. The document itself is usually several pages long and written by a committee.
A security policy is a complex document, meant to govern data access, web-browsing habits, use of passwords, encryption, email attachments and more. It specifies these rules for individuals or groups of individuals throughout the company. The policies could be expressed as a set of instructions that understood by special purpose network hardware dedicated for securing the network.
Security policy should keep the malicious users out and also exert control over potential risky users within an organization.
Understanding what information and services are available and to which users, as well as what the potential is for damage and whether any protection is already in place to prevent misuse are important when writing a network security policy. In addition, the security policy should dictate a hierarchy of access permissions, granting users access only to what is necessary for the completion of their work. The National Institute of Standards and Technology provides an example security-policy guideline.
See also
Internet security
Security engineering
Computer security
Cybersecurity information technology list
Network security
Industrial espionage
Information security
Security policy
References
External links
Computer Security Resource Center at National Institute of Standards and Technology
Network Security Policy and Procedures document by the City of Madison, Wisconsin
Computer security procedures
Computer network security |
https://en.wikipedia.org/wiki/Hazu%20District | was a district located in southeastern Aichi Prefecture, Japan.
As of 2003 (the last data available), the district had an estimated population of 58,921 with a density of 696.88 persons per km2. Its total area was .
Municipalities
Prior to its dissolution, the district consisted of three towns:
Hazu
Isshiki
Kira
Notes
History
Hazu District was one of the ancient districts of Mikawa Province, and was mentioned in Heian period Ritsuryō records under a variety of kanji spellings. Bordering on Mikawa Bay, one of its noted products was sharkskin and dried shark meat, which was sent as taxes to the Imperial household in Kyoto.
District Timeline
Modern Hazu District was created on 1 October 1889 as part of the cadastral reforms of the early Meiji period. Initially, it consisted of the town of Nishio and 36 villages. On 13 May 1892, the villages Isshiki and Yokosuka were elevated to town status. However, both reverted back to village status in 1906, and in a round of consolidation, the remaining number of villages was reduced to 14. Isshiki regained its town status on 1 October 1923, followed by Yoshida and Hirasaku in 1924, Hazu in 1928, and Terazu in 1929, leaving the district with 6 towns and 6 villages by 1932.
On 15 December 1953, Nishio was elevated to city status, annexing the towns of Hirasaku and Terazu and two villages later that year. On 10 March 1955, Yoshida and the village of Yokosuka were merged to form the town of Kira, leaving the district with three towns and no villages.
2011 merger
On 1 April 2011 - The towns of Hazu, Isshiki and Kira were merged into the expanded city of Nishio. Therefore, Hazu District was dissolved as a result of this merger.
See also
List of dissolved districts of Japan
External links
Counties of Japan
Former districts of Aichi Prefecture |
https://en.wikipedia.org/wiki/Nishikamo%20District | was a district located in Nishimikawa Region in central Aichi Prefecture, Japan.
As of 2004 (the last data available), the district had an estimated population of 16,703 with a density of 43.84 persons per km2. Its total area was 381.06 km2.
Towns and villages
Prior to its dissolution, the district consisted of only one town:
Miyoshi
Notes
History
Kamo District (加茂郡) was one of the ancient districts of Shinano Province, but was transferred to Mikawa Province during the Sengoku period. In the cadastral reforms of the early Meiji period, on July 22, 1878, Kamo District was divided into Nishikamo District and Higashikamo District within Aichi Prefecture. With the organization of municipalities on October 1, 1889, Nishikamo District was divided into 30 villages.
District Timeline
The village of Koromo was elevated to town status on January 29, 1892. In a round of consolidation, the remaining number of villages was reduced from 29 to seven in 1906. On March 1, 1951, Koromo gained city status and on April 1, 1953, the village of Sanage gained town status, merging with two neighboring villages on March 1, 1955. The village of Takahashi was annexed by Komoro in 1956. On April 1, 1958, the village of Miyoshi gained town status; however, on April 1, 1967, the town of Sange was merged into the city of Toyota. The village of Fujioka gained town status on April 1, 1978, leaving the district with two towns and one village. On August 5, 2003, Miyoshi rejected plans to merge with the city of Toyota.
Recent mergers
On April 1, 2005 - The town of Fujioka, and the village of Obara, along with the towns of Asahi, Asuke and Inabu, and the village of Shimoyama (all from Higashikamo District), were merged into the expanded city of Toyota.
On January 4, 2010 - The town of Miyoshi was elevated to city status. Therefore, Nishikamo District was dissolved as a result of this merger.
External links
Counties of Japan
See also
List of dissolved districts of Japan
Higashikamo District, Aichi
Kamo District, Gifu
Kamo District, Hiroshima
Kamo District, Shizuoka
Former districts of Aichi Prefecture |
https://en.wikipedia.org/wiki/Higashikamo%20District | was a district located in Nishimikawa Region in central Aichi Prefecture, Japan.
The entire district is now part of the city of Toyota.
As of 2004 (the last data available), the district had an estimated population of 16,703 with a density of 43.84 persons per km2. Its total area was 381.06 km2.
Municipalities
Prior to its dissolution, the district consisted of three towns and one village:
Asuke
Asahi
Inabu
Shimoyama
Notes
History
Kamo District (加茂郡) was one of the ancient districts of Shinano Province, but was transferred to Mikawa Province during the Sengoku period. In the cadastral reforms of the early Meiji period, on July 22, 1878, Kamo District was divided into Higashikamo District and Nishikamo District within Aichi Prefecture. With the organization of municipalities on October 1, 1889, Higashikamo District was divided into 18 villages.
District Timeline
The village of Asuke was elevated to town status on December 17, 1890, and two new villages were created in 1889 and 1890. In a round of consolidation, the remaining number of villages was reduced from 19 to six in 1906.
On April 1, 1955, three of the remaining villages (Morioka, Kamo, and Aro) were annexed by the town of Asuke; however, a new village (Asahi) was created through a border adjustment with parts of the village of Sanno (formerly from Ena District, Gifu Prefecture).
On November 1, 1961, the village of Matsudaira gained town status, followed by the village of Asahi.
On April 1, 1967, the town of Matsudaira was annexed by the city of Koromo.
Recent mergers
On October 1, 2003 - The town of Inabu was transferred from Kitashitara District to Higashikamo District, leaving the district with two towns and one village.
On April 1, 2005 - The towns of Asuke, Asahi and Inabu, and the village of Shimoyama, along with the town of Fujioka, and the village of Obara (both from Nishikamo District), were all merged into the expanded city of Toyota. Therefore, Higashikamo District was dissolved as a result of this merger.
See also
List of dissolved districts of Japan
Nishikamo District, Aichi
Kamo District, Gifu
Kamo District, Hiroshima
Kamo District, Shizuoka
External links
Counties of Japan
Former districts of Aichi Prefecture |
https://en.wikipedia.org/wiki/Minamishitara%20District | was a district located in eastern Aichi Prefecture, Japan.
As of 2004 (the last data available), the district had an estimated population of 16,703 with a density of 43.84 persons per km2. Its total area was 381.06 km2.
Municipalities
Prior to its dissolution, the district consisted of only one town and one village:
Hōrai
Tsukude
Notes
History
Shitara District (設楽郡) was one of the ancient districts of Mikawa Province having been created in 903 out of Hoi District (宝飯郡). In the cadastral reforms of the early Meiji period, on July 22, 1878 Shitara District was divided into Minamishitara District and Kitashitara District. With the organization of municipalities on October 1, 1889, Minamishitara District was divided into one town (Shinshiro) and 22 villages.
District Timeline
The village of Ebi was elevated to town status on April 28, 1894. In a round of consolidation, the remaining number of villages was reduced from 21 to five in 1906. On April 15, 1955, Shishiro annexed the villages of Chisato and Togō, along with the villages of Funatsuke and Yana from Yana District. On April 1, 1956, the villages of Nagashino and Hōrai were merged with the town of Ono and village of Nanasato in Yana District to form the expanded town of Hōrai, leaving Minamishitara District with three towns and one village. In September of the same year, the town of Ebi was annexed by Hōrai along with the village of Yamayoshida (from Yana District). On November 1, 1958, Shinshiro was elevated to city status.
Recent mergers
On October 1, 2005 - The town of Hōrai, and the village of Tsukude were merged into the expanded city of Shinshiro (formerly also a part of the district). Therefore, Minamishitara District was dissolved as a result of this merger.
See also
List of dissolved districts of Japan
External links
Counties of Japan
Former districts of Aichi Prefecture |
https://en.wikipedia.org/wiki/Hoi%20District | was a district located in eastern Aichi Prefecture, Japan.
As of 2008 (the last data available), the district had an estimated population of 21,766 with a density of 2,194 persons per km2. Its total area was 9.92 km2.
Municipalities
Prior to its dissolution, the district consisted of only one town:
Kozakai
Notes
History
Hoi District was one of the ancient districts of Mikawa Province, and is mentioned in Nara period records. Originally covering all of eastern Mikawa, Shitara District to the north was separated from Hoi in 903. The district contained the provincial capital of Mikawa along with the provincial temple, both of which were located in what is now part of the city of Toyokawa. During the Sengoku period, the area was controlled by various samurai clans, including the Makino and branches of the Honda and Matsudaira clans, all of whom rose to high positions within the Tokugawa shogunate. The area was also a battlefield between the forces of the Imagawa clan and the Oda and Tokugawa clans during the late Sengoku period.
District Timeline
In the cadastral reforms of the early Meiji period, on July 22, 1878 modern Hoi District was created, with its headquarters at Goyu-shuku, a former station on the Tōkaidō. With the organization of municipalities on October 1, 1889, Hoi District was divided into 33 villages.
The villages of Gamagōri and Uchikubo were elevated to town status on October 6, 1891. They were followed in rapid succession by the village of Shimoji (October 16, 1891), the village of Goyu (January 29, 1892), the village of Toyokawa (March 13, 1893), the villages of Akasaka and Kō (June 23, 1894), and the village of Miya (December 10, 1894). In a round of consolidation, the remaining number of villages was reduced from 25 to 11 in 1906. The district office was transferred to the town of Kō in 1923. The village of Katahara was raised to town status on April 1, 1924, the village of Kosakai on September 12, 1926, and the village of Mito on February 11, 1930. On September 1, 1932, the town of Shimoji was annexed by the neighboring city of Toyohashi. The city of Toyokawa was formed on June 1, 1943 by the merger of the towns of Toyokawa, Ushikubo and Kō, and the village of Yawata. The village of Nishiura was raised to town status on February 11, 1944.
On April 1, 1954, the city was Gamagōri was formed by the merger of the towns of Gamagōri and Miya, and the village of Shiotsu. In a further round of consolidations in 1955, the town of Otowa was formed on April 1, 1955 and the structure of the district became six towns and one village. On April 1, 1959, the town of Goyu was annexed by the city of Toyokawa. The village of Ichinomiya was raised to town status on April 1, 1961. The towns of Katahara and Nishiura were annexed by the city of Gamagōri on April 1, 1962 and April 1, 1963 respectively. In a final round of mergers, the town of Ichinomiya was annexed by the city of Toyokawa on February 1, 2006, followed by the towns of Otowa |
https://en.wikipedia.org/wiki/Ihara%20District%2C%20Shizuoka | was a rural district located in central Shizuoka Prefecture, Japan.
As of the end of 2008 (the last data available before its dissolution), the district had an estimated population of 26,859 and a population density of 497.85 persons per km2. Its total area was 53.95 km2.
History
Ihara District was created in the early Meiji cadastral reforms of April 1, 1889, with four towns (Ejiri, Yui, Okitsu, and Kanbara) and ten villages. Fujikawa Fujikawa was raised to town status on January 1, 1901, followed by Tsuji on August 1, 1918. However, both Ejiri and Tsuji were transferred to Abe District on January 13, 1924, leaving the district with four towns and nine villages.
The village of Sodeshi was raised to town status on April 8, 1948, and the village of Nishina was annexed by the city of Shizuoka on April 8, 1948. In 1954 the city of Shimizu annexed the villages of Takabe and Iida, and in 1957, the village of Uchibo was transferred to Fuji District. Later that year, the town of Fujikawa annexed Matsuno village. In 1961, the towns of Okitsu and Sodeshi along with three villages were annexed by the city of Shimizu.
Recent mergers
On March 31, 2006 - the town of Kambara was merged into the expanded city of Shizuoka, specifically at Shimizu-ku.
On November 1, 2008:
the town of Yui was also merged into the expanded city of Shizuoka, specifically at Shimizu-ku
the town of Fujikawa was merged into the expanded city of Fuji. Therefore, Ihara District was dissolved as a result of this merger.
References
External links
Counties of Japan
Former districts of Shizuoka Prefecture |
https://en.wikipedia.org/wiki/Shida%20District%2C%20Shizuoka | was a rural district located in central Shizuoka Prefecture, Japan.
As of the end of 2008 (the last data available before its dissolution), the district had an estimated population of 12,110 and a population density of . Its total area was .
History
Shida District was created in the early Meiji cadastral reforms of 1879 out of Haibara District. In the organization of municipalities of October 1, 1889, Shida District was divided into three town (Shimada, Fujieda and Okabe) and 22 villages. It gained another three villages on April 1, 1896, with the annexation of . Yaizu was raised to town status on June 28, 1901, followed by Aoshima Village on January 1, 1922, leaving the district with five towns and 23 villages.
On January 1, 1948, Shimada was elevated to city status. Yaizu was elevated to city status on March 1, 1951, and Ogawa Village was elevated to town status on October 1, 1952. In a round of consolidation from 1953 to 1956, the number of villages was reduced from 22 to zero, and Fujieda was proclaimed a city on March 31, 1954.
Recent mergers
On November 1, 2008 - the town of Ōigawa (created on March 31, 1955) was merged into the expanded city of Yaizu.
On January 1, 2009 - the town of Okabe was merged into the expanded city of Fujieda. Shida District was dissolved as a result of this merger.
References
External links
Counties of Japan
Former districts of Shizuoka Prefecture |
https://en.wikipedia.org/wiki/Ogasa%20District%2C%20Shizuoka | was a rural district located in western Shizuoka Prefecture, Japan.
As of the end of 2003 (the last data available before its dissolution), the district had an estimated population of 82,248 and a population density of 472.47 persons per km2. Its total area was 174.08 km2.
History
Ogasa District was created on April 1, 1896 through the merger of former and . At the time it was divided into one town (Kakegawa) and 45 villages. Osuka Village was renamed Yokosuka and was elevated to town status on May 1, 1914, and Nishikata Village became Horinouchi Town on January 1, 1922. Ikeshinden was raised to town status on November 1, 1940. Following some consolidation in 1942–1943, the district had four towns and 35 villages.
In 1950–1951, Kakegawa expanded by annexing four neighboring villages, and the town of Kikugawa was created on January 1, 1954 by the merger of Horinouchi Town with three neighboring villages. Kakegawa was raised to city status on March 1, 1954. In a round of mergers and consolidation from 1954 to 1957, the towns of Ogasa (March 31, 1954), Hamaoka (March 31, 1955), and Ōsuka (June 1, 1956) were created and the number of villages reduced from 27 to 2. Mikasa Village was annexed by Kakegawa on October 1, 1960 and Kito Village by Ohama Town on April 1, 1973 to form the town of Daitō.
Recent mergers
On April 1, 2004 - the town of Hamaoka was merged with the former town of Omaezaki (from Haibara District) to create the city of Omaezaki.
On January 17, 2005 - the former town of Kikugawa absorbed the town of Ogasa to create the city of Kikugawa.
On April 1, 2005 - the towns of Daitō and Ōsuka were merged into the expanded city of Kakegawa. Ogasa District was dissolved as a result of this merger.
External links
Counties of Japan
Former districts of Shizuoka Prefecture |
https://en.wikipedia.org/wiki/Inasa%20District%2C%20Shizuoka | was a rural district located in western Shizuoka, Japan.
As of the end of 2003 (the last data available before its dissolution), the district had an estimated population of 52,485 and a population density of 227.20 persons per km2. Its total area was 231.01 km2.
History
Inasa District was created in the early Meiji cadastral reforms of April 1, 1889, and consisted at the time of two towns (Kito and Kanasashi) and six villages. On April 1, 1896 and Nishi-Hamana Village from were joined to Inasa District. Nishi-Hamana became a town on May 1, 1922, and was renamed Mikkabi, giving the district three towns and eight villages.
Iitani Village was annexed by Kanasashi, and the town renamed Inasa on April 1, 1953. On April 1, 1955, Kito annexed Nakamura Village and was renamed Hosoe. The remaining villages were consolidated in 1955–1956, with Miyakoda Village going to the city of Hamamatsu, Higahi-Hamada joining Mikkabi Town, Okuyama and Ihei Villages joining with Inasa Town and Aratama Village joining the town of Hamakita in Hamana District.
On July 1, 2005, the towns of Hosoe, Inasa and Mikkabi, along with the cities of Tenryū and Hamakita, the town of Haruno (from Shūchi District), the towns of Misakubo and Sakuma, the village of Tatsuyama (all from Iwata District), and the towns of Maisaka and Yūtō (both from Hamana District), were merged into the expanded city of Hamamatsu. Inasa District was dissolved as a result of this merger.
External links
Counties of Japan
Former districts of Shizuoka Prefecture |
https://en.wikipedia.org/wiki/DEC%20Systems%20Research%20Center | The Systems Research Center (SRC) was a research laboratory created by Digital Equipment Corporation (DEC) in 1984, in Palo Alto, California.
DEC SRC was founded by a group of computer scientists, led by Robert Taylor, who left the Computer Science Laboratory (CSL) of Xerox PARC after an internal power struggle. SRC survived the takeover of DEC by Compaq in 1998. It was renamed to "Compaq Systems Research Center". When Compaq was acquired by Hewlett-Packard in 2002, SRC was merged with other HP corporate research labs and relocated there.
After Taylor's retirement, the lab was directed by Roy Levin and then by Lyle Ramshaw.
Some of the critical developments made at SRC include the Modula-3 programming language; the snoopy cache, used in the first multiprocessor workstation, the Firefly, built from MicroVAX 78032 microprocessors; the first multi-threaded Unix system, Taos; the first user interface editor; early networked window systems, Trestle. AltaVista was jointly developed by researchers from DEC's Network Systems Laboratory, Western Research Laboratory and Systems Research Center. Among the researchers at SRC, there are Butler Lampson, Chuck Thacker, and Leslie Lamport, all recipients of the ACM A.M. Turing Award.
A later inhabitant of this building is A9.com, a research part of Amazon.com.
References
External links
Downloadable SRC publications
Archived SRC Lab site
Educational buildings in Santa Clara County, California
Systems Research Center
Laboratories in the United States |
https://en.wikipedia.org/wiki/Population%20statistics%20for%20Israeli%20settlements%20in%20the%20West%20Bank | The population statistics for Israeli settlements in the West Bank are collected by the Israel Central Bureau of Statistics. As such, the data contains only population of settlements recognized by the Israeli authorities. Israeli outposts, which are illegal by Israeli law, are not tracked, and their population is hard to establish. All settlements in the West Bank were advised by the International Court of Justice to be unlawful.
As of January 2023, there are 144 Israeli settlements in the West Bank, including 12 in East Jerusalem. In addition, there are over 100 Israeli illegal outposts in the West Bank. In total, over 450,000 Israeli settlers live in the West Bank excluding East Jerusalem, with an additional 220,000 Jewish settlers residing in East Jerusalem.
The construction of the West Bank barrier keeps a significant number of settlements behind it. The total number of settlers east of the barrier lines in 2012 was at least 79,230. By comparison, the number of Gaza Strip settlers in 2005 who refused to move voluntarily and be compensated, and that were forcibly evicted during the Israeli disengagement from Gaza, was around 9,000.
Statistics
Statistics below refer to the period between 1999 and 2018. For more recent data, see List of Israeli settlements.
Unreported Nahal settlements:
Elisha (population of 753 in 2000)
Gvaot (population of 44 in 2003)
Localities of unknown status:
Bitronot
Doran
Ein Hogla
Mahane Giv'on
Other localities:
Shvut Rachel (est. 1991) – an independently governed settlement which is formally designated as a neighborhood of Shilo. As such, its population is counted within Shilo.
See also
Israeli settlement
Judea and Samaria Area
List of cities administered by the State of Palestine
List of cities in Israel
List of Israeli settlements
List of Israeli settlements with city status in the West Bank
Population statistics for Israeli Gaza Strip settlements
Yesha Council
Notes
External links
Israeli Settlements Population in the West Bank at the Jewish Virtual Library
Yesha Council
FMEP Reports: Settlements in the West Bank
West Bank
Israel geography-related lists
Israeli settlement
Palestine (region)-related lists
Demographic lists |
https://en.wikipedia.org/wiki/Laptop%20theft | Laptop theft is a significant threat to users of laptop and netbook computers. Many methods to protect the data and to prevent theft have been developed, including alarms, laptop locks, and visual deterrents such as stickers or labels. Victims of laptop theft can lose hardware, software, and essential data that has not been backed up. Thieves also may have access to sensitive data and personal information. Some systems authorize access based on credentials stored on the laptop including MAC addresses, web cookies, cryptographic keys and stored passwords.
According to the FBI, losses due to laptop theft totaled more than $3.5 million in 2005. The Computer Security Institute/FBI Computer Crime & Security Survey found the average theft of a laptop to cost a company $31,975. In a study surveying 329 private and public organizations published by Intel in 2010, 7.1% of employee laptops were lost or stolen before the end of their usefulness lifespan. Furthermore, it was determined that the average total negative economic impact of a stolen laptop was $49,256—primarily due to compromised data, and efforts to retroactively protect organizations and people from the potential consequences of that compromised data. The total cost of lost laptops to all organizations involved in the study was estimated at $2.1 billion. Of the $48B lost from the U.S. economy as a result of data breaches, 28% resulted from stolen laptops or other portable devices.
In the 2011, Bureau Brief prepared by the NSW Bureau of Crime Statistics and Research it was reported that thefts of laptops have been on the increase over the last 10 years, attributed in part by an increase in ownership but also because they are an attractive proposition for thieves and opportunists. In 2001 2,907 laptops were stolen from New South Wales dwellings, but by 2010 this had risen to 6,492, second only to cash of items taken by thieves. The Bureau reports that one in four break-ins in 2010 resulted in a laptop being stolen. This startling trend in burglaries lends itself to an increase in identity theft and fraud due to the personal and financial information commonly found on laptops. These statistics do not take into account unreported losses so the figures could arguably be much higher.
Businesses have much to lose if an unencrypted or poorly secured laptop is misappropriated, yet many do not adequately assess this risk and take appropriate action. Loss of sensitive company information is of significant risk to all businesses and measures should be taken to adequately protect this data. A survey conducted in multiple countries suggested that employees are often careless or deliberately circumvent security procedures, which leads to the loss of the laptop. According to the survey, employees were most likely to lose a laptop while travelling at hotels, airports, rental cars, and conference events.
Behling and Wood examined the issue of laptop security and theft. Their survey of employees in sou |
https://en.wikipedia.org/wiki/TreadMarks | TreadMarks is a distributed shared memory system created at Rice University in the 1990s.
References
External links
TreadMarks official site
Distributed computing architecture |
https://en.wikipedia.org/wiki/List%20of%20hereditary%20and%20lineage%20organizations | This is a list of notable hereditary and lineage organizations, and is informed by the database of the Hereditary Society Community of the United States of America. It includes societies that limit their membership to those who meet group inclusion criteria, such as descendants of a particular person or group of people of historical importance. It does not include general ethnic heritage societies.
A
Ancient and Honorable Artillery Company of Massachusetts
Aztec Club of 1847
Associated Daughters of Early American Witches
Association Royale des Descendants des Lignages de Bruxelles ()
B
The Baronial Order of Magna Charta
Bloodlines of Salem
C
Children of the American Revolution
Children of the Confederacy
Cleveland Grays
The Colonial Dames of America
The Colonial Dames XVII Century
D
Daughters of Hawaii
Daughters of the American Revolution
Daughters of the Cincinnati
Daughters of the Republic of Texas
Dames of the Loyal Legion
F
Flagon and Trencher
G
General Society of Colonial Wars
General Society of the War of 1812
General Society Sons of the Revolution
H
Hereditary Order of Descendants of Colonial Governors
Hereditary Order of the First Families of Connecticut
Holland Society of New York
The Huguenot Society of America
I
International Society Daughters of Utah Pioneers
J
Jamestowne Society
Job's Daughters International
L
Ladies of the Grand Army of the Republic
Legion of Valor of the United States of America
M
The Mayflower Society
Military Order of Foreign Wars of the United States
Military Order of the Carabao
Military Order of the Loyal Legion of the United States
Military Order of the Stars and Bars
Monticello Association
N
National Society Children of the American Colonists
National Society of the Colonial Dames of America
National Society Daughters of the American Colonists
National Society Descendants of American Farmers
National Society of New England Women
National Society Sons of the American Colonists
National Society of Sons of Utah Pioneers
National Society United States Daughters of 1812
Naval Order of the United States
New England Society in the City of New York
O
Order of Daedalians
Order of the First Families of Virginia
Order of Lafayette
Order of the Founders and Patriots of America
P
Pioneers of Alaska
R
Russian Nobility Association in America
S
Saint Nicholas Society of the City of New York
Society of California Pioneers
Society of Colonial Wars
Society of the Cincinnati
Society of Descendants of the Conquest
Society of Descendants of Ireland
Society of Descendants of the Latin Kingdom of Jerusalem
Society of the Descendants of the Schwenkfeldian Exiles
Society of the Descendants of the Founders of Hartford
Society of Descendants of Scotland
Sons and Daughters of Oregon Pioneers
Sons of the Revolution
Sons of the American Legion
Sons of the American Revolution
Sons of Confederate Veterans
Sons of Union Veterans of the Civil War
Sons of Utah Pioneers
Swedish C |
https://en.wikipedia.org/wiki/Bottom-up | Bottom-up may refer to:
Bottom-up analysis, a fundamental analysis technique in accounting and finance
Bottom-up parsing, a computer science strategy
Bottom-up processing, in Pattern recognition (psychology)
Bottom-up theories of galaxy formation and evolution
Bottom-up tree automaton, in data structures
Bottom-up integration testing, in software testing
Top-down and bottom-up design, strategies of information processing and knowledge ordering
Bottom-up proteomics, a laboratory technique involving proteins
Bottom Up Records, a record label founded by Shyheim
Bottom-up approach of the Holocaust, a viewpoint on the causes of the Holocaust
See also
Bottoms Up (disambiguation)
Top-down (disambiguation)
Capsizing, when a boat is turned upside down
Mundanity, a precursor of social movements
Social movements, bottom-up societal reform
Turtling (sailing) |
https://en.wikipedia.org/wiki/Bloom%20filter | A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either "possibly in set" or "definitely not in set". Elements can be added to the set, but not removed (though this can be addressed with the counting Bloom filter variant); the more items added, the larger the probability of false positives.
The high level idea is to map elements x∈X to values y=h(x)∈Y using a hash function h, and then test for membership of x in X by checking whether y'=h(x')∈Y, and do that using multiple hash functions h.
Bloom proposed the technique for applications where the amount of source data would require an impractically large amount of memory if "conventional" error-free hashing techniques were applied. He gave the example of a hyphenation algorithm for a dictionary of 500,000 words, out of which 90% follow simple hyphenation rules, but the remaining 10% require expensive disk accesses to retrieve specific hyphenation patterns. With sufficient core memory, an error-free hash could be used to eliminate all unnecessary disk accesses; on the other hand, with limited core memory, Bloom's technique uses a smaller hash area but still eliminates most unnecessary accesses. For example, a hash area only 15% of the size needed by an ideal error-free hash still eliminates 85% of the disk accesses.
More generally, fewer than 10 bits per element are required for a 1% false positive probability, independent of the size or number of elements in the set.
Algorithm description
An empty Bloom filter is a bit array of bits, all set to 0. There must also be different hash functions defined, each of which maps or hashes some set element to one of the array positions, generating a uniform random distribution. Typically, is a small constant which depends on the desired false error rate , while is proportional to and the number of elements to be added.
To add an element, feed it to each of the hash functions to get array positions. Set the bits at all these positions to 1.
To query for an element (test whether it is in the set), feed it to each of the hash functions to get array positions. If any of the bits at these positions is 0, the element is definitely not in the set; if it were, then all the bits would have been set to 1 when it was inserted. If all are 1, then either the element is in the set, or the bits have by chance been set to 1 during the insertion of other elements, resulting in a false positive. In a simple Bloom filter, there is no way to distinguish between the two cases, but more advanced techniques can address this problem.
The requirement of designing different independent hash functions can be prohibitive for large . For a good hash function with a wide output, there should be little if any correlation between different bit-fields of s |
https://en.wikipedia.org/wiki/John%20McAfee | John David McAfee ( ; 18 September 1945 – 23 June 2021) was a British-American computer programmer, businessman, and two-time presidential candidate who unsuccessfully sought the Libertarian Party nomination for president of the United States in 2016 and in 2020. In 1987, he wrote the first commercial anti-virus software, founding McAfee Associates to sell his creation. He resigned in 1994 and sold his remaining stake in the company. McAfee became the company's most vocal critic in later years, urging consumers to uninstall the company's anti-virus software, which he characterized as bloatware. He disavowed the company's continued use of his name in branding, a practice that has persisted in spite of a short-lived corporate rebrand attempt under Intel ownership.
McAfee's fortunes plummeted in the financial crisis of 2007–2008. After leaving McAfee Associates, he founded the companies Tribal Voice (makers of the PowWow chat program), QuorumEx, and Future Tense Central, among others, and was involved in leadership positions in the companies Everykey, MGT Capital Investments, and Luxcore, among others. His personal and business interests included smartphone apps, cryptocurrency, yoga, light-sport aircraft and recreational drug use. He resided for a number of years in Belize, but returned to the United States in 2013 while wanted in Belize for questioning on suspicion of murder.
In October 2020, McAfee was arrested in Spain over U.S. tax evasion charges. U.S. federal prosecutors brought criminal and civil charges alleging that McAfee had failed to file income taxes over a four-year period. On 23 June 2021, he was found dead due to an apparent suicide by hanging in his prison cell near Barcelona shortly after the Spanish National Court authorized his extradition to the U.S. His death generated speculation and theories about the possibility that he was murdered. McAfee's wife, Janice McAfee, said she did not believe McAfee committed suicide.
Early life
McAfee was born in Cinderford, in the Forest of Dean, Gloucestershire, England, on 18 September 1945, on a U.S. Army base (of the 596th Ordnance Ammunition Company), to an American father, Don McAfee, who was stationed there, and a British mother, Joan (Williams). His father was from Roanoke, Virginia, and McAfee was himself primarily raised in Salem, Virginia, United States. He said he felt as much British as American. When he was 15, his father, whom a BBC columnist described as "an abusive alcoholic", killed himself with a gun. He had spent his childhood living in fear that a beating from his father could happen at any time, and struggled to make sense of why this was happening to him. In Running With the Devil: The Wild World of John McAfee, it is alleged that McAfee may have shot and killed his father, staging the scene to look like a suicide.
McAfee received a bachelor's degree in mathematics in 1967 from Roanoke College in Virginia, which subsequently awarded him an honorary Doctor of Science |
https://en.wikipedia.org/wiki/Facial%20recognition%20system | A facial recognition system is a technology potentially capable of matching a human face from a digital image or a video frame against a database of faces. Such a system is typically employed to authenticate users through ID verification services, and works by pinpointing and measuring facial features from a given image.
Development began on similar systems in the 1960s, beginning as a form of computer application. Since their inception, facial recognition systems have seen wider uses in recent times on smartphones and in other forms of technology, such as robotics. Because computerized facial recognition involves the measurement of a human's physiological characteristics, facial recognition systems are categorized as biometrics. Although the accuracy of facial recognition systems as a biometric technology is lower than iris recognition, fingerprint image acquisition, palm recognition or voice recognition, it is widely adopted due to its contactless process. Facial recognition systems have been deployed in advanced human–computer interaction, video surveillance, law enforcement, passenger screening, decisions on employment and housing and automatic indexing of images.
Facial recognition systems are employed throughout the world today by governments and private companies. Their effectiveness varies, and some systems have previously been scrapped because of their ineffectiveness. The use of facial recognition systems has also raised controversy, with claims that the systems violate citizens' privacy, commonly make incorrect identifications, encourage gender norms and racial profiling, and do not protect important biometric data. The appearance of synthetic media such as deepfakes has also raised concerns about its security. These claims have led to the ban of facial recognition systems in several cities in the United States. Growing societal concerns led social networking company Meta Platforms to shut down its Facebook facial recognition system in 2021, deleting the face scan data of more than one billion users. The change represented one of the largest shifts in facial recognition usage in the technology's history.
History of facial recognition technology
Automated facial recognition was pioneered in the 1960s by Woody Bledsoe, Helen Chan Wolf, and Charles Bisson, whose work focused on teaching computers to recognize human faces. Their early facial recognition project was dubbed "man-machine" because a human first needed to establish the coordinates of facial features in a photograph before they could be used by a computer for recognition. Using a graphics tablet, a human would pinpoint facial features coordinates, such as the pupil centers, the inside and outside corners of eyes, and the widows peak in the hairline. The coordinates were used to calculate 20 individual distances, including the width of the mouth and of the eyes. A human could process about 40 pictures an hour, building a database of these computed distances. A computer would |
https://en.wikipedia.org/wiki/IMSAI%208080 | The IMSAI 8080 was an early microcomputer released in late 1975, based on the Intel 8080 and later 8085 and S-100 bus. It was a clone of its main competitor, the earlier MITS Altair 8800. The IMSAI is largely regarded as the first "clone" microcomputer. The IMSAI machine ran a highly modified version of the CP/M operating system called IMDOS. It was developed, manufactured and sold by IMS Associates, Inc. (later renamed IMSAI Manufacturing Corp). In total, between 17,000 and 20,000 units were produced from 1975 to 1978.
History
In May 1972, William Millard started a business called IMS Associates (IMS) in the areas of computer consulting and engineering, using his home as an office. By 1973, Millard incorporated the business and soon found funding for it, receiving several contracts, all for software. IMS stood for "Information Management Services".
In 1974, IMS was contacted by a client which wanted a "workstation system" that could complete jobs for any General Motors car dealership. IMS planned a system including a terminal, small computer, printer, and special software. Five of these workstations were to have common access to a hard disk drive, which would be controlled by a small computer. Eventually product development was stopped.
Millard and his chief engineer Joe Killian turned to the microprocessor. Intel had announced the 8080 chip, and compared to the 4004 to which IMS Associates had been first introduced, it looked like a "real computer". Full-scale development of the IMSAI 8080 was put into action using the existing Altair 8800's S-100 bus, and by October 1975 an ad was placed in Popular Electronics, receiving positive reactions.
IMS shipped the first IMSAI 8080 kits on 16 December 1975, before turning to fully assembled units. In 1976, IMS was renamed to IMSAI Manufacturing Corporation because by then, they were a manufacturing company, not a consulting firm.
In 1977, IMSAI marketing director Seymour I. Rubinstein paid Gary Kildall $25,000 for the right to run CP/M version 1.3, which eventually evolved into an operating system called IMDOS, on IMSAI 8080 computers. Other manufacturers followed and CP/M eventually became the de facto standard 8-bit operating system.
By October 1979, the IMSAI corporation was bankrupt. The VDP (all-in-one) computer had sold poorly and was not competitive with the Radio Shack TRS-80, Commodore PET, and Apple II computers. The 'IMSAI' trademark was acquired by Thomas "Todd" Fischer and Nancy Freitas (former early employees of IMS Associates), who continued manufacturing the computers under the IMSAI name as a division of Fischer-Freitas Co. Support for early IMSAI systems continues. The first registration of the trademark IMSAI was on 1980-01-17. The right to the word mark IMSAI expired on 2004-04-06 because Thomas Fischer did not correctly submit the required documents for renewal.
IMSAI 8080 replicas have entered the market, due in part to the legality of hardware copyright encouraging amate |
https://en.wikipedia.org/wiki/Israel%20Railways | Israel Railways Ltd. (, Rakevet Yisra'el) is the state-owned principal railway company responsible for all inter-city, commuter, and freight rail transport in Israel. Israel Railways network consists of of track. All its lines are standard gauge. The network is centered in Israel's densely populated coastal plain, from which lines radiate out in many directions. In 2018, Israel Railways carried 68 million passengers.
Unlike road vehicles and city trams, Israeli heavy rail trains run on the left hand tracks, matching neighboring Egypt and other Middle Eastern countries, whose formerly connected rail networks were constructed by British engineers.
Until 1980, the company's head office was located at Haifa Center HaShmona railway station. Tzvi Tzafriri, the general manager of Israel Railways, decided to move the head office to Tel Aviv Savidor Central Railway Station. In 2017, the company's head office was moved to a new campus built on the grounds of the Lod railway station.
Stations
There are 66 stations on the Israel Railways network, with almost all of the stations being accessible to disabled persons, with public announcement and passenger information systems, vending machines and parking.
Bicycle policy
Bicycles are permitted on trains in designated coaches.
Israel Railways encourages people to use bicycles by building a double-deck parking for bicycles in every railway station and by allowing people to take bicycles with them on trains to minimise the need for private cars.
Smoking
In Israel, smoking is prohibited in public enclosed places and in commercial areas. Although smoking in railway stations is allowed in designated areas, the sale of tobacco from automated vending machines is prohibited.
List of stations
Lines
Israel Railways currently operates 15 passenger service lines. These can be broadly subdivided into inter-city lines, which connect two or more of Israel's major metropolitan centres (Tel Aviv, Jerusalem, Haifa, and Beersheba), usually skipping some of the intermediate stations, and commuter lines, centered on one metropolitan area and serving all stations on the line. However, Israel Railways no longer officially uses this classification.
Some services were partially or fully suspended as a result of the COVID-19 pandemic and electrification works.
Inter-city lines
Commuter lines
† Fully electrified line
‡ Line electrification in progress
Future
The flagship project of Israel Railways is the construction of an improved rail line from Tel Aviv to Jerusalem. The line began as an extension of the current railway to Ben Gurion Airport and Modi'in, and terminates in a new underground station beside the Jerusalem Central Bus Station. An additional proposal will connect Modi'in to Jerusalem if built by connecting to the aforementioned line. The project of electrification, starting with the new Jerusalem-Tel Aviv line is ongoing with plans to eventually electrify all or most of the network.
A line from the city of |
https://en.wikipedia.org/wiki/Obliq | Obliq is an interpreted, object-oriented programming language designed to make distributed, and locally multithreaded, computing simpler and easier to program, while providing program safety and an implicit type system. The interpreter is written in Modula-3, and provides Obliq with full access to Modula-3's network objects abilities. A type inference algorithm for record concatenation, subtyping, and recursive types has been developed for Obliq. Further, it has been proved to be NP-complete
and its lowest complexity to be or if under other modeling up to certain conditions down to and its best known implementation runs in .
Obliq's syntax is very similar to Modula-3, the biggest difference being that Obliq has no need of explicit typed variables (i.e., a variable can hold any data type allowed by the type checker and if does not accepts one, i.e., a given expression execution error will display) although explicit type declarations are allowed and ignored by the interpreter. The basic data types in the language include booleans, integers, reals, characters, strings, and arrays. Obliq supports the usual set of sequential control structures (conditional, iteration, and exception handling forms), and special control forms for concurrency (mutexes and guarded statements). Further, Obliq's objects can be cloned and safely copied remotely by any machine in a distributed network object and it can be done safely and transparently.
Obliq's large standard library provides strong support for mathematical operations, input/output (I/O), persistence, thread control, graphics, and animation. Distributed computing is object-based: objects hold a state, which is local to one process. Scope of objects and other variables is purely lexical. Objects can call methods of other objects, even if those objects are on another machine on the network. Obliq objects are simply collections of named fields (similar to slots in Self and Smalltalk), and support inheritance by delegation (like Self).
The common uses of Obliq involve programming over networks, 3D animation, and distributed computing, as occurs over a local area network (LAN) such as Ethernet. Obliq is included free with the Digital Equipment Corporation (DEC) Modula-3 distribution, but other free versions exist elsewhere including precompiled binaries for several operating systems.
Projects using Obliq
The Collaborative Active Textbooks (CAT) developed using Obliq applets and the Zeus algorithm animation System (written in Modula-3).
Obliq applets (Oblets) special web browser (written in Modula-3) Obliq web page embedded applications.
References
External links
Luca Cardelli's Obliq Quick Start page (archived on 2008-10-17)
Modula programming language family
Oberon programming language family
Prototype-based programming languages
Procedural programming languages
Systems programming languages
Programming languages created in 1993
Dynamically typed programming languages |
https://en.wikipedia.org/wiki/Type%20safety | In computer science, type safety and type soundness are the extent to which a programming language discourages or prevents type errors. Type safety is sometimes alternatively considered to be a property of facilities of a computer language; that is, some facilities are type-safe and their usage will not result in type errors, while other facilities in the same language may be type-unsafe and a program using them may encounter type errors. The behaviors classified as type errors by a given programming language are usually those that result from attempts to perform operations on values that are not of the appropriate data type, e.g., adding a string to an integer when there's no definition on how to handle this case. This classification is partly based on opinion.
Type enforcement can be static, catching potential errors at compile time, or dynamic, associating type information with values at run-time and consulting them as needed to detect imminent errors, or a combination of both. Dynamic type enforcement often allows programs to run that would be invalid under static enforcement.
In the context of static (compile-time) type systems, type safety usually involves (among other things) a guarantee that the eventual value of any expression will be a legitimate member of that expression's static type. The precise requirement is more subtle than this — see, for example, subtyping and polymorphism for complications.
Definitions
Intuitively, type soundness is captured by Robin Milner's pithy statement that
Well-typed programs cannot "go wrong".
In other words, if a type system is sound, then expressions accepted by that type system must evaluate to a value of the appropriate type (rather than produce a value of some other, unrelated type or crash with a type error). Vijay Saraswat provides the following, related definition:
A language is type-safe if the only operations that can be performed on data in the language are those sanctioned by the type of the data.
However, what precisely it means for a program to be "well typed" or to "go wrong" are properties of its static and dynamic semantics, which are specific to each programming language. Consequently, a precise, formal definition of type soundness depends upon the style of formal semantics used to specify a language. In 1994, Andrew Wright and Matthias Felleisen formulated what has become the standard definition and proof technique for type safety in languages defined by operational semantics, which is closest to the notion of type safety as understood by most programmers. Under this approach, the semantics of a language must have the following two properties to be considered type-sound:
Progress A well-typed program never gets "stuck": every expression is either already a value or can be reduced towards a value in some well-defined way. In other words, the program never gets into an undefined state where no further transitions are possible.
Preservation (or subject reduction) After each evaluati |
https://en.wikipedia.org/wiki/GameSurge | GameSurge is a popular Internet Relay Chat network devoted to the online multiplayer gaming community. Games commonly seen referenced on GameSurge include many first person shooters (such as Counter-Strike, Counter-Strike: Source, Team Fortress Classic, Team Fortress 2, Day of Defeat, Call of Duty, and Battlefield 2) and MMORPGs (such as World of Warcraft and Guild Wars).
GameSurge is consistently in the top 20 IRC Networks by users currently online.
History
GameSurge was created in February 2004, as a result of the merger of GamesNET users and the ProGamePlayer Network, a network with common interests. The merger, coincidentally, occurred during a time of legal disputes over the domain name gamesnet.net.
At present day, the user base of GameSurge is primarily North American, with a growing number of English-speaking gamers from Europe. The user base contains a large number of clans who participate in a wide variety of games. Among the more popular games on GameSurge are Counter-Strike, Counter-Strike: Source, Team Fortress Classic, Team Fortress 2, Day of Defeat, Urban Terror and Call of Duty.
Services
GameSurge runs a feature-rich package of services known as srvx, which was written by GameSurge's development staff from scratch in C.
GameSurge provides five user-accessible services:
AuthServ, which provides authentication for other services on the network and allows users to use an account to maintain channel access. In the interests of providing a service directed toward gaming (and thus allowing users to easily switch clan/team/guild tags), GameSurge does not provide nickname registration.
ChanServ, which provides facilities such as event logging and advanced user/ban management.
HelpServ bots, which manage support requests in certain channels via a FIFO queue.
HelpServ, in the #support channel, for general user support.
Other HelpServ bots in miscellaneous help channels throughout the network.
SpamServ, which provides spam protection services to channels on the network. This service was added in .
HostServ, which provides free "titles" to users wishing to use cloaked hosts. See the GameSurge Titles page for details.
References
External links
GameSurge
srvx (network services for GameSurge)
GameSurge Servers
Internet Relay Chat networks |
https://en.wikipedia.org/wiki/FOIL%20%28programming%20language%29 | FOIL was the name for two different programming languages.
CAI style language
The first FOIL was a CAI language developed at the University of Michigan in 1967. The acronym stood for File-Oriented Interpretive Language and it was very similar to other CAI languages like COURSEWRITER and PILOT. However, it tried to make the language somewhat block-structured using whitespace which ended up making the language vaguely similar to BASIC or ABC.
Example
<nowiki>
:START COUNT=0
TY Enter the number of times you want to repeat the statement:
ACCEPT
MAX=NUMBER.(1)
:LOOP
TY This loop has run #COUNT times it will terminate when it runs #MAX times
IF COUNT<MAX,
COUNT=COUNT+1
GO TO :LOOP
TY Do you want to do this again?
ACCEPT
IF 'yes', GO TO START
IF 'no' GO TO FINISH
:FINISH
TY Goodbye!
STOP
</nowiki>
Music generation language
The second FOIL was a music generation language for the Touché computer instrument in 1979. The Touché was a keyboard that had digital tone generation and allowed you to program software for performances. The acronym stood for Far Out Instrument Language and was succeeded by MetaFOIL and FOIL-83. The language was developed by David Rosenboom and was based on Forth.
External links
Information on David Rosenboom's music software
FOIL - a file oriented interpretive language article at the ACM digital library
Educational programming languages |
https://en.wikipedia.org/wiki/Italia%201 | Italia 1 (Italian pronunciation ) is an Italian free-to-air television channel on the Mediaset network, owned by MFE - MediaForEurope. It is oriented at both young and adult people.
Italia 1 was launched on 3 January 1982 and, originally, was owned by Rusconi; after a few months, however, due to the aggressive dumping practices of Silvio Berlusconi's rival network Canale 5, Rusconi was forced to sell the majority of his company to Fininvest, allowing Berlusconi to further strengthen his media holdings.
History
Launch (1982–1983)
Launched 3 January 1982 by print media editor Edilio Rusconi, Italia 1 was born from the idea of a network supported by twenty regional broadcasting stations, some owned by Rusconi himself and others simply affiliated to broadcast throughout Italian territory on the 'ploy' of interconnection. The lead broadcasting station is Milan-based Antenna Nord, but Rome's Quinta Rete also has an important role. Lillo Tombolini is the executive director. The channel's presenter is a young Gabriella Golia, who was already the face of Antenna Nord.
Rusconi's growing national channel starts its programming at noon, with a segment dedicated to children, during which various cartoons and anime series (particularly western cartoons) are broadcast, as well as successful original television series, such as Star Trek, then in the early afternoon air-time is given to region-specific broadcasts, later restarting the national broadcast with more television series and the mid-afternoon 80's and 90's children's programming block, Bim Bum Bam (offering episodes from numerous cartoon series, predominantly more American and European, such as The Smurfs, Snorks, Count Duckula, Police Academy, Iznogoud, Inspector Gadget, Batman: The Animated Series, and Spiff and Hercules, and less Japanese). In the late afternoon the channel again broadcasts from local stations and an hour later airs a television series episode (such as Paper Moon). Generally, in the early evening two films and one television series is broadcast. The network also offers plenty of air-time to sport programs dedicated to soccer, boxing, basketball and motor racing, including Andrea De Adamich's Grand Prix.
Prime time hours were dedicated to predominantly American imports such as Falcon Crest, Kojak, The Big Valley, Project UFO, and Mork & Mindy. On 23 April 1982 an official agreement was made between Gruppo Rusconi and the American network CBS for technical assistance and program sharing.
However, only a few months after its appearance on a national scale funds began to dwindle, mostly due to exorbitant costs of managing broadcast transmission systems, something a print editing house such as Rusconi probably wasn't aware of, but also due to the aggressive advertising policy from its main rival network, Canale 5. In fact, Rusconi's network relied on an external advertising provider, la Publikompass, to sell advertising space while Berlusconi's channel took advantage of owning its ow |
https://en.wikipedia.org/wiki/CFMT-DT | CFMT-DT (channel 47) is a television station in Toronto, Ontario, Canada. It is one of two flagship stations of the Canadian multilingual network Omni Television. CFMT-DT is owned and operated by Rogers Sports & Media alongside sister Omni outlet CJMT-DT (channel 40) and Citytv flagship CITY-DT (channel 57). The stations share studios at 33 Dundas Street East on Yonge-Dundas Square in downtown Toronto, while CFMT-DT's transmitter is located atop the CN Tower.
The station was originally founded on September 3, 1979 by a consortium led by Dan Iannuzzi, Jerry Grafstein, Raymond Moriyama, Steve Stavro, Garth Drabinsky and Nat Taylor as CFMT-TV, branded on air as MTV (Multilingual Television) as Canada's first multicultural independent station and in 1980, CFMT became Canada's first television station to air 24 hours a day, seven days a week. The station has been owned by Rogers Communications since 1986, but later used CFMT as the basis and flagship station to expand its multicultural stations under the Omni brand beginning with the launch of CJMT-TV (Omni.2) in 2002 along with the rebranding of CFMT as Omni.1 and the rest of Canada in subsequent years. The two stations are distinguished by their service of different cultural groups; CFMT caters primarily on European (particularly Western and Eastern) and Latin American cultures while CJMT focuses on Asian cultures (including programming in South Asian and Chinese languages).
History
In December 1978, Dan Iannuzzi, founder of the Italian-language daily newspaper Corriere Canadese and future recipient of the Order of Canada, received a licence to operate a multilingual television station, defeating rival applicants Johnny Lombardi and Leon Kossar. His company, Multilingual Television (Toronto) Ltd., had been producing multilingual television programs since 1972. Iannuzzi initially owned 30% of the station, and other investors included Jerry Grafstein (who was also one of the major investors that helped launch CITY-TV in September 1972), Raymond Moriyama, Steve Stavro, Garth Drabinsky and Nat Taylor. The call letters CFMT were derived from "Canada's First Multilingual Television", as it was the first multicultural television station in Canada. English-language programming was limited to one-third of the station's broadcast hours, with French-language programming accounting for 7% and programming in about two dozen other languages providing the remaining 60%. The station was originally going to broadcast on UHF channel 45, but instead moved to channel 47 for technical reasons. The station first signed on the air on September 3, 1979, broadcasting 24 hours a day, seven days a week, as a multicultural independent station under the brand name MTV (for "Multilingual Television"); that branding was dropped in 1981 to avoid confusion with the upstart American MTV cable network. (The channel even broadcast a program called Video Singles, as of 1983.)
In August 1980, the channel became the first in Canada t |
https://en.wikipedia.org/wiki/CJMT-DT | CJMT-DT (channel 40) is a television station in Toronto, Ontario, Canada. It is one of two flagship stations of the Canadian multilingual network Omni Television. CJMT-DT is owned and operated by Rogers Sports & Media alongside sister Omni outlet CFMT-DT (channel 47) and Citytv flagship CITY-DT (channel 57). The stations share studios at 33 Dundas Street East on Yonge-Dundas Square in downtown Toronto, while CJMT-DT's transmitter is located atop the CN Tower.
History
The station signed on the air on September 16, 2002, broadcasting on UHF channel 44. In 2004, CJMT moved its channel allocation to UHF channel 69. The station was licensed by the Canadian Radio-television and Telecommunications Commission (CRTC) as part of the same process that approved independent station CKXT-TV (channel 51, now defunct). The "J" in its callsign has no particular meaning, except that it was an available callsign that maintained the "MT" lettering (standing for "Multicultural Television") from CFMT (CJMT was formerly the callsign of a now-defunct AM radio station in Chicoutimi, Quebec).
On October 8, 2007, Rogers announced that the operations of the two Omni stations would relocate from 545 Lake Shore Boulevard West to 33 Dundas Street East. CJMT and CFMT integrated their operations into the building – which it shares with City flagship CITY-DT, which moved into the facility the previous month – on October 19, 2009.
Programming
As a multicultural station, CJMT airs programming in the South Asian languages (such as Urdu and Hindi), as well as in Mandarin, Cantonese, Japanese, Korean, Somali and Pashto. As with its sister station CFMT, CJMT also aired syndicated English-language programming until September 25, 2015. The original series Metropia was also broadcast on the station, with repeats on CFMT. In 2014, CJMT began to regularly simulcast CBS late-night talk shows Late Show with David Letterman and The Late Late Show with Craig Ferguson, both of which moved from the main Omni television channel. Both shows have since concluded, with their successors airing on Global and CTV respectively. The first season of the Fox series Empire also aired on CJMT (its second season moved to City).
Sports programming
During the 2007 season, CJMT began airing late-afternoon NFL games, usually the alternate to whatever aired on Sportsnet and CKVU-DT in Vancouver. These games were moved to CITY-DT as of the 2008 season. Rights to these games were later assumed by CTV as of the 2017 season. During the 2014 season, CJMT aired several Thursday Night Football games in simulcast with Sportsnet and CBS.
On June 27, 2013, CJMT broadcast Mandarin-language coverage of a Toronto Blue Jays Major League Baseball game started by Taiwanese player Chien-Ming Wang. This event marked the first ever Canadian MLB telecast in the language.
Newscasts
CJMT-DT broadcasts five hours of locally produced newscasts each week (with one hour each weekday). The station carries two local newscasts aimed at |
https://en.wikipedia.org/wiki/MERLIN | The Multi-Element Radio Linked Interferometer Network (MERLIN) is an interferometer array of radio telescopes spread across England. The array is run from Jodrell Bank Observatory in Cheshire by the University of Manchester on behalf of Science and Technology Facilities Council (STFC).
The array consists of up to seven radio telescopes and includes the Lovell Telescope at Jodrell Bank, Mark II, Cambridge, Defford in Worcestershire, Knockin in Shropshire, and Darnhall and Pickmere (previously known as Tabley) in Cheshire. The longest baseline is therefore 217 km and MERLIN can operate at frequencies between 151 MHz and 24 GHz. At a wavelength of 6 cm (5 GHz frequency), MERLIN has a resolution of 40 milliarcseconds which is comparable to that of the HST at optical wavelengths.
Some of the telescopes are occasionally used for European VLBI Network (EVN) and Very Long Baseline Interferometry (VLBI) observations in order to create an interferometer with even larger baselines, providing images with much greater angular resolution.
MTLRI
In 1973, Henry Proctor Palmer made the suggestion of extending the interferometer links already in place at Jodrell Bank at the time, which started the planning of the telescope array. Construction started in 1975. The system was originally officially called MTRLI (Multi-Telescope Radio Linked Interferometer), but was commonly referred to by the simpler name of MERLIN. It originally consisted of either the 76m Lovell Telescope or the 25m Mark II, along with the 25m Mark III at Wardle, the 85 ft at Defford and a new telescope at Knockin. This
new telescope was made by E-Systems and was constructed based on the design for the telescopes in the Very Large Array, which was being constructed at the same time also by E-Systems.
The construction of the new telescope, the installation of microwave communication links and the construction of the correlator were jointly called "Phase 1" of the MERLIN project, the funding for which was approved on 30 May 1975. The construction of the new telescope started on 9 July 1976, and was completed by 8 October 1976. The telescope was first controlled remotely from Jodrell in January 1977. The microwave links were installed in May 1978. The first observations using the system – measurements of 30 distant radio sources – were taken in January and February 1980. The final cost of phase 1 of the system was £2,179,000 (1976).
Two additional telescopes were added in Phase 2 of the project, along with their radio links to Jodrell Bank. While it was originally proposed that one of the telescopes would be sited at Jodrell Bank and the other at Darnhall, the pair were finally sited at Pickmere (also known as Tabley) and Darnhall. The two telescopes were the same as that at Knockin. Construction on both telescopes started on 9 April 1979, and was completed by 31 October 1979. The Pickmere telescope was connected into MTRLI for the first time on 20 July 1980, followed by the Darnhall telescope o |
https://en.wikipedia.org/wiki/CBC%20Music | CBC Music (formerly known as CBC FM, CBC Stereo and CBC Radio 2) is a Canadian FM radio network operated by the Canadian Broadcasting Corporation. It used to concentrate on classical and jazz. In 2007 and 2008, the network transitioned towards a new "adult music" format with a variety of genres, with the classical genre generally restricted to midday hours. In 2009, Radio 2 averaged 2.1 million listeners weekly, and it was the second-largest radio network in Canada.
History
The CBC's FM network was launched in 1946, but was strictly a simulcast of the AM radio network until 1960. In that year, distinct programming on the FM network began. It was briefly discontinued in 1962, but resumed again in 1964.
In November 1971, the CBC filed license applications for new FM stations in English in St. John's, Halifax, and Calgary; and in French in Quebec City, Ottawa, and Chicoutimi, telling the CRTC that it intended to start a second "more extended and more leisurely" program service on its FM stations, tentatively to be called "Radio Two".
On November 3, 1975, the FM network was renamed CBC Stereo, to distinguish it from the AM network, known as CBC Radio.
In the early 1990s, the CBC began offering selected programs on the Internet, most notably CBC Stereo's RealTime. In September 1996, the corporation formally launched live audio streaming of both CBC Radio and CBC Stereo.
Since the 1980s, many of the AM CBC Radio stations moved to FM due to the limitations of AM broadcasting; as such, in 1997 the CBC renamed the networks CBC Radio One and CBC Radio Two. As of 2018, there are a number of CBC Radio One low-power transmitters with only a few high-powered ones left still operating on the AM band in some areas across Canada.
For much of its history, its programming focused on arts and culture, and primarily consisted of programs devoted to opera, classical music, jazz and theatre. Some programming devoted to Canadian pop and indie rock music was also aired, via the Saturday night CBC Radio 3 simulcast and predecessors such as RadioSonic, Night Lines, and the late-night programme Brave New Waves.
2007 format change
In 2006, speculation arose that Radio Two programming would undergo a format and name change, similar to that which its French counterpart Espace musique undertook in 2004, although no plans were announced until January 2007. These changes, which took effect March 19, resulted in a tighter focus on music – still primarily classical but also including jazz, world music, and live music of all types. The length and frequency of newscasts, which had essentially duplicated those heard on Radio One, was reduced dramatically. The 2007 revamp also resulted in a subtle name change from Radio Two to Radio 2.
In March 2008, the CBC announced plans to complete the transformation of Radio 2, significantly altering its daytime programming lineup. These plans resulted in the "New Radio 2", starting September 2, 2008. In essence, the morning and afternoon |
https://en.wikipedia.org/wiki/Parameterized%20complexity | In computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent difficulty with respect to multiple parameters of the input or output. The complexity of a problem is then measured as a function of those parameters. This allows the classification of NP-hard problems on a finer scale than in the classical setting, where the complexity of a problem is only measured as a function of the number of bits in the input. This appears to have been first demonstrated in . The first systematic work on parameterized complexity was done by .
Under the assumption that P ≠ NP, there exist many natural problems that require superpolynomial running time when complexity is measured in terms of the input size only but that are computable in a time that is polynomial in the input size and exponential or worse in a parameter . Hence, if is fixed at a small value and the growth of the function over is relatively small then such problems can still be considered "tractable" despite their traditional classification as "intractable".
The existence of efficient, exact, and deterministic solving algorithms for NP-complete, or otherwise NP-hard, problems is considered unlikely, if input parameters are not fixed; all known solving algorithms for these problems require time that is exponential (so in particular superpolynomial) in the total size of the input. However, some problems can be solved by algorithms that are exponential only in the size of a fixed parameter while polynomial in the size of the input. Such an algorithm is called a fixed-parameter tractable (fpt-)algorithm, because the problem can be solved efficiently (i.e., in polynomial time) for constant values of the fixed parameter.
Problems in which some parameter is fixed are called parameterized problems. A parameterized problem that allows for such an fpt-algorithm is said to be a fixed-parameter tractable problem and belongs to the class , and the early name of the theory of parameterized complexity was fixed-parameter tractability.
Many problems have the following form: given an object and a nonnegative integer , does have some property that depends on ? For instance, for the vertex cover problem, the parameter can be the number of vertices in the cover. In many applications, for example when modelling error correction, one can assume the parameter to be "small" compared to the total input size. Then it is challenging to find an algorithm that is exponential only in , and not in the input size.
In this way, parameterized complexity can be seen as two-dimensional complexity theory. This concept is formalized as follows:
A parameterized problem is a language , where is a finite alphabet. The second component is called the parameter of the problem.
A parameterized problem is fixed-parameter tractable if the question "?" can be decided in running time , where is an arbitrary function dependin |
https://en.wikipedia.org/wiki/Psi%20%28instant%20messaging%20client%29 | Psi is a free instant messaging client for the XMPP protocol (including such services as Google Talk) which uses the Qt toolkit. It runs on Linux (and other Unix-like operating systems), Windows, macOS and OS/2 (including eComStation and ArcaOS).
User interface of program is very flexible in customization. For example, there are "multi windows" and "all in one" modes, support of different iconsets and themes.
Ready-to-install deb and RPM packages are available for many Linux distributions. Successful ports of Psi were reported for Haiku, FreeBSD and Sun Solaris operating systems.
Due to Psi's free/open-source nature, several forks have appeared, which occasionally contain features that may appear in future official Psi versions.
Project name
'Psi' is the twenty-third letter of the Greek alphabet (Ψ), which is used as the software's logo.
Mission statement
The goal of the Psi project is to create a powerful, yet easy-to-use XMPP client that tries to strictly adhere to the XMPP drafts and XMPP XEPs. This means that in most cases, Psi will not implement a feature unless there is an accepted standard for it in the XMPP community. Doing so ensures that Psi will be compatible, stable, and predictable.
History
The application was created by Justin Karneges and it began as a side project. At various points during its existence Karneges was paid to develop the codebase, during which Psi flourished. Typically however, the release cycle of Psi is relatively slow, but the client has always been seen by its fans as a very stable and powerful instant messaging client. Karneges left the project in late 2004 to pursue other endeavors.
In 2002 Michail Pishchagin started hacking Qt code which later became libpsi library. Pishchagin joined the team in March 2003 and he is responsible for many large chunks in Psi code.
In November 2004, maintenance was taken over by Kevin Smith, a long-time contributor to the project. In 2009, Smith handed maintenance back to Karneges, who also maintains Iris, the Qt/C++ XMPP library upon which Psi is based.
Remko Tronçon started writing his custom patches for Psi in 2003, and became an official developer in May 2005.
In 2009 a Psi fork named Psi+ was started. Project purposes are: implementation of new features, writing of patches and plugins for transferring them to upstream. As of 2017 all active Psi+ developers have become official Psi developers, and now Psi+ is just a development branch of Psi with rolling release development model.
Users who wants to receive new features and bug fixes very quickly may use Psi+ on daily basis. Users who do not care about new trends and prefer constancy may choose Psi as it uses classical development model and its releases are quite rare.
Features
Because XMPP allows gateways to other services, which many servers support, it can also connect to Yahoo!, AIM, Gadu-Gadu, ICQ and Microsoft networks. Other services available using gateway servers include RSS and Atom news feeds, sendi |
https://en.wikipedia.org/wiki/David%20Gelernter | David Hillel Gelernter (born March 5, 1955) is an American computer scientist, artist, and writer. He is a professor of computer science at Yale University.
Gelernter is known for contributions to parallel computation in the 1980s, and for books on topics such as computed worlds (Mirror Worlds). Gelernter is also known for his belief, expressed in his book America-Lite: How Imperial Academia Dismantled Our Culture (and Ushered in the Obamacrats), that liberal academia has a destructive influence on American society. He is in addition known for his views against women in the workforce, and his rejection of the scientific consensus regarding anthropogenic climate change and evolution.
In 1993 Gelernter was sent a mail bomb by Ted Kaczynski, known as the Unabomber. He opened it and the resulting explosion almost killed him, leaving him with permanent loss of use of his right hand as it destroyed 4 fingers, and permanent damage to his right eye.
Early life and education
Gelernter grew up on Long Island, New York. His father Herbert Gelernter was a physicist who, in the late 1950s and 1960s, became a pioneer in artificial intelligence and taught computer science at State University of New York at Stony Brook. Gelernter's grandfather was a rabbi, and Gelernter grew up as a Reform Jew; he later became a follower of Orthodox Judaism.
He received his Bachelor of Arts and Master of Arts degrees in Classical Hebrew literature from Yale University in 1976. He earned his Ph.D. from State University of New York at Stony Brook in 1982.
Career
Computer science
In the 1980s, Gelernter made seminal contributions to the field of parallel computation, specifically the tuple space coordination model, as embodied by the Linda programming system he and Nicholas Carriero designed (which he named for Linda Lovelace, the lead actress in the porn movie Deep Throat, mocking the naming of the programming language Ada in tribute to the scientist and first attributed computer programmer, Ada Lovelace). Bill Joy cited the Linda system as the inspiration for many elements of JavaSpaces and Jini.
In January 1993 in his book Mirror Worlds: or the Day Software Puts the Universe in a Shoebox...How It Will Happen and What It Will Mean, Gelernter wrote: "...people and software work hand-in-glove – and sometimes hand-in-hand."
On June 24, 1993, Gelernter was severely injured opening a mail bomb sent to him by the Unabomber. He recovered from his injuries, but his right hand (which he covers with a glove) and eye were permanently damaged. Some in the press suggested that there were parallels between his thoughts on the need for a human element to computers and those of the Unabomber. He chronicled the ordeal in his 1997 book Drawing Life: Surviving the Unabomber. Two years after the bombing, the Unabomber sent Gelernter a letter, writing: "People with advanced degrees aren't as smart as they think they are."
Gelernter helped found the company Mirror Worlds Technologies, which |
https://en.wikipedia.org/wiki/Adaptive%20Domain%20Environment%20for%20Operating%20Systems | Adeos (Adaptive Domain Environment for Operating Systems) is a nanokernel hardware abstraction layer (HAL), or hypervisor, that operates between computer hardware and the operating system (OS) that runs on it. It is distinct from other nanokernels in that it is not only a low level layer for an outer kernel. Instead, it is intended to run several kernels together, which makes it similar to full virtualization technologies. It is free and open-source software released under a GNU General Public License (GPL).
Adeos provides a flexible environment for sharing hardware resources among multiple operating systems, or among multiple instances of one OS, thereby enabling multiple prioritized domains to exist simultaneously on the same hardware.
Adeos has been successfully inserted beneath the Linux kernel, opening a range of possibilities, such as symmetric multiprocessing (SMP) clustering, more efficient virtualization, patchless kernel debugging, and real-time computing (RT) systems for Linux.
Unusually among HALs, Adeos can be loaded as a Linux loadable kernel module to allow another OS to run along with it. Adeos was developed in the context of real-time application interface (RTAI) to modularize it and separate the HAL from the real-time kernel.
Prior work
Two categories of methods exist to enable multiple operating systems to run on the same system. The first is simulation-based and provides a virtual environment for which to run additional operating systems. The second suggests the use of a nanokernel layer to enable hardware sharing.
In the simulation category, there are tools such as Xen, VMware, Plex86, VirtualPC and SimOS. There is also Kernel-based Virtual Machine (KVM) which is more similar to Adeos , but is not RT and requires specific virtualization hardware support. These methods are used for users who desire to run applications foreign to their base OS, they provide no control over the base OS to the user. Simulation was never meant to be used in a production environment. In the nanokernel category there are tools such as SPACE, cache kernel and Exokernel. All of these suggest building miniature hardware management facilities which can thereafter be used to build production operating systems . The problem of this approach is that it does not address the issue of extant operating systems and their user base.
Adeos addresses the requirements of both categories of application by providing a simple layer that is inserted under an unmodified running OS and thereafter provides the required primitives and mechanisms to allow multiple OSes to share the same hardware environment. Adeos does not attempt to impose any restrictions on the hardware’s use, by the different OSes, more than is necessary for Adeos’ own operation. Instead, such restriction is to be imposed by the system administrator or the system programmer. This exposes the system to mismanagement, but the idea behind Adeos is to give back control to system administrators and pro |
https://en.wikipedia.org/wiki/Data%20Protection%20Act%201998 | The Data Protection Act 1998 (DPA, c. 29) was an Act of Parliament of the United Kingdom designed to protect personal data stored on computers or in an organised paper filing system. It enacted provisions from the European Union (EU) Data Protection Directive 1995 on the protection, processing, and movement of data.
Under the 1998 DPA, individuals had legal rights to control information about themselves. Most of the Act did not apply to domestic use, such as keeping a personal address book. Anyone holding personal data for other purposes was legally obliged to comply with this Act, subject to some exemptions. The Act defined eight data protection principles to ensure that information was processed lawfully.
It was superseded by the Data Protection Act 2018 (DPA 2018) on 23 May 2018. The DPA 2018 supplements the EU General Data Protection Regulation (GDPR), which came into effect on 25 May 2018. The GDPR regulates the collection, storage, and use of personal data significantly more strictly.
Background
The 1998 Act replaced the Data Protection Act of 1984 and the Access to Personal Files Act of 1987. Additionally, the 1998 Act implemented the EU Data Protection Directive 1995.
The Privacy and Electronic Communications (EC Directive) Regulations 2003 altered the consent requirement for most electronic marketing to "positive consent" such as an opt-in box. Exemptions remain for the marketing of "similar products and services" to existing customers and enquirers, which can still be permitted on an opt-out basis.
The Jersey data protection law was modelled on the United Kingdom's law.
Contents
Scope of protection
Section 1 of DPA 1998 defined "personal data" as any data that could have been used to identify a living individual. Anonymised or aggregated data was less regulated by the Act, provided the anonymisation or aggregation had not been done reversibly. Individuals could have been identified by various means including name and address, telephone number, or email address. The Act applied only to data which was held, or was intended to be held, on computers ("equipment operating automatically in response to instructions given for that purpose"), or held in a "relevant filing system".
In some cases, paper records could have been classified as a relevant filing system, such as an address book or a salesperson's diary used to support commercial activities.
The Freedom of Information Act 2000 modified the act for public bodies and authorities, and the Durant case modified the interpretation of the act by providing case law and precedent.
A person who had their data processed had the following rights:
under section 7, to view the data on them held by an organisation for a reasonable fee: the maximum fee was £2 for requests to credit reference agencies, £50 for health and educational request, and £10 per individual otherwise,
under section 14, to request that incorrect information be corrected. If the company ignored the request, a court could |
https://en.wikipedia.org/wiki/Logger | Logger may refer to:
Lumberjack, a woodcutter, a person who harvests lumber
Data logger, software that records sequential data to a log file
Keystroke logger, software that records the keys struck on a computer keyboard
logger, a command line utility that can send messages to the syslog
See also
Logbook
Logging
Lager—beer |
https://en.wikipedia.org/wiki/Delegation%20%28object-oriented%20programming%29 | In object-oriented programming, delegation refers to evaluating a member (property or method) of one object (the receiver) in the context of another original object (the sender). Delegation can be done explicitly, by passing the sending object to the receiving object, which can be done in any object-oriented language; or implicitly, by the member lookup rules of the language, which requires language support for the feature. Implicit delegation is the fundamental method for behavior reuse in prototype-based programming, corresponding to inheritance in class-based programming. The best-known languages that support delegation at the language level are Self, which incorporates the notion of delegation through its notion of mutable parent slots that are used upon method lookup on self calls, and JavaScript; see JavaScript delegation.
The term delegation is also used loosely for various other relationships between objects; see delegation (programming) for more. Frequently confused concepts are simply using another object, more precisely referred to as consultation or aggregation; and evaluating a member on one object by evaluating the corresponding member on another object, notably in the context of the receiving object, which is more precisely referred to as forwarding (when a wrapper object doesn't pass itself to the wrapped object). The delegation pattern is a software design pattern for implementing delegation, though this term is also used loosely for consultation or forwarding.
Overview
This sense of delegation as programming language feature making use of the method lookup rules for dispatching so-called self-calls was defined by Lieberman in his 1986 paper "Using Prototypical Objects to Implement Shared Behavior in Object-Oriented Systems".
Delegation is dependent upon dynamic binding, as it requires that a given method call can invoke different segments of code at runtime. It is used throughout macOS (and its predecessor NeXTStep) as a means of customizing the behavior of program components. It enables implementations such as making use of a single OS-provided class to manage windows, because the class takes a delegate that is program-specific and can override default behavior as needed. For instance, when the user clicks the close box, the window manager sends the delegate a windowShouldClose: call, and the delegate can delay the closing of the window, if there is unsaved data represented by the window's contents.
Delegation can be characterized (and distinguished from forwarding) as late binding of self:
That is, the in a method definition in the receiving object is not statically bound to that object at definition time (such as compile time or when the function is attached to an object), but rather at evaluation time, it is bound to the original object.
It has been argued that delegation may in some cases be preferred to inheritance to make program code more readable and understandable. Despite explicit delegation being fairly widesp |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Wisconsin | The following is a list of FCC-licensed radio stations in the U.S. state of Wisconsin, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
WAWA
WCCX
WDLB-FM
WEBC-FM
WFMR
WGBP-FM
WGLR
WOKW
WRNC-LP
WRZC-LP
WXXD-LP
WZRK
References
External links
Northpine: Upper Midwest Broadcasting
Wisconsin Radio & TV Discussion Forum
Your Midwest Media: Radio & TV Station Listings, News & Information
Wisconsin
Wisconsin-related lists |
https://en.wikipedia.org/wiki/VCY%20America | VCY America, is a traditional, evangelical, conservative Christian ministry based in Milwaukee, Wisconsin. The VCY America Radio Network maintains a format of Christian talk and teaching, as well as traditional Christian music through its broadcast outlets.
History
Originally known as "Milwaukee Youth For Christ", and later, "Greater Milwaukee Youth For Christ", it left the national YFC organization in 1973 and became known as the Wisconsin Voice of Christian Youth (WVCY) until 1995, when it changed to its present name. Its flagship stations in Milwaukee, WVCY-FM and WVCY-TV, share a call sign which refers to the ministry's original name.
Radio network
The ministry operates 36 VCY America-owned radio stations in Arizona, Colorado, Delaware, Illinois, Iowa, Kansas, Michigan, Minnesota, Missouri, New Mexico, New York, Ohio, South Dakota, Texas, West Virginia, and Wisconsin. It also broadcasts over 25 low-power FM translators. VCY America radio also provides programming such as Crosstalk, Worldview Weekend, and Music 'til Dawn to stations throughout the country via satellite. Additionally, VCY has a Christian bookstore in Wauwatosa, Wisconsin which is promoted on air and ships throughout the United States as an additional source of revenue.
VCY has attempted to expand into the San Francisco Bay Area, Las Vegas, and the Coachella Valley through the lease and attempted purchase of a group of three stations in a bankruptcy action: KFRH, KREV and KRCK-FM. In early 2022, the original owner sued successfully to nullify the bankruptcy action against them, and the bankruptcy debtor in possession and trustee was forced to return to the stations to them and nullify the VCY America leases. As of March 2023, the stations are back in trustee control, with the possibility of a sale to VCY America still being considered.
In December 2022 VCY America announced it would purchase WFAS-FM in the New York City area from Cumulus Media, pending final approval from the Federal Communications Commission.RadioInsight.com "VCY America Enters New York City with WFAS-FM Purchase Dec. 8, 2022 Renamed WVBN, the acquisition, completed on February 6, 2023, gave VCY America its first broadcast outlet on the East Coast. VCY America added to its Northeastern expansion in August 2023 with its purchase of WJBR-FM in Wilmington, Delaware, from Beasley Broadcast Group. VCY took control of the station October 6, changing its call sign to WVCW; the move brings its programming into the Philadelphia market.
Programming
VCY America's radio programming includes Christian talk and teaching programming, among them:
Crosstalk, hosted by Jim Schneider, with past Vic Eliason-hosted episodes also aired
Worldview Weekend with Brannon Howse
Grace to You with John MacArthur
In Touch with Charles Stanley
Love Worth Finding with Adrian Rogers
Revive Our Hearts with Nancy DeMoss Wolgemuth
The Alternative with Tony Evans
Liberty Counsel's Faith and Freedom Report
Thru the Bible with J. Ve |
https://en.wikipedia.org/wiki/Structured%20systems%20analysis%20and%20design%20method | Structured Systems Analysis and Design Method (SSADM) is a systems approach to the analysis and design of information systems. SSADM was produced for the Central Computer and Telecommunications Agency, a UK government office concerned with the use of technology in government, from 1980 onwards.
Overview
SSADM is a waterfall method for the analysis and design of information systems. SSADM can be thought to represent a pinnacle of the rigorous document-led approach to system design, and contrasts with more contemporary agile methods such as DSDM or Scrum.
SSADM is one particular implementation and builds on the work of different schools of structured analysis and development methods, such as Peter Checkland's soft systems methodology, Larry Constantine's structured design, Edward Yourdon's Yourdon Structured Method, Michael A. Jackson's Jackson Structured Programming, and Tom DeMarco's structured analysis.
The names "Structured Systems Analysis and Design Method" and "SSADM" are registered trademarks of the Office of Government Commerce (OGC), which is an office of the United Kingdom's Treasury.
History
The principal stages of the development of Structured System Analysing And Design Method were:
1980: Central Computer and Telecommunications Agency (CCTA) evaluate analysis and design methods.
1981: Consultants working for Learmonth & Burchett Management Systems, led by John Hall, chosen to develop SSADM v1.
1982: John Hall and Keith Robinson left to found Model Systems Ltd, LBMS later developed LSDM, their proprietary version.
1983: SSADM made mandatory for all new information system developments
1984: Version 2 of SSADM released
1986: Version 3 of SSADM released, adopted by NCC
1988: SSADM Certificate of Proficiency launched, SSADM promoted as ‘open’ standard
1989: Moves towards Euromethod, launch of CASE products certification scheme
1990: Version 4 launched
1993: SSADM V4 Standard and Tools Conformance Scheme
1995: SSADM V4+ announced, V4.2 launched
2000: CCTA renamed SSADM as "Business System Development". The method was repackaged into 15 modules and another 6 modules were added.
SSADM techniques
The three most important techniques that are used in SSADM are as follows:
Logical Data Modelling
The process of identifying, modelling and documenting the data requirements of the system being designed. The result is a data model containing entities (things about which a business needs to record information), attributes (facts about the entities) and relationships (associations between the entities).
Data Flow Modelling
The process of identifying, modelling and documenting how data moves around an information system. Data Flow Modeling examines processes (activities that transform data from one form to another), data stores (the holding areas for data), external entities (what sends data into a system or receives data from a system), and data flows (routes by which data can flow).
Entity Event Modelling
A two-stranded pro |
https://en.wikipedia.org/wiki/Bluejacking |
Bluejacking is the sending of unsolicited messages over Bluetooth to Bluetooth-enabled devices such as mobile phones, PDAs or laptop computers, sending a vCard which typically contains a message in the name field (i.e., for bluedating) to another Bluetooth-enabled device via the OBEX protocol.
Bluetooth has a very limited range, usually around on mobile phones, but laptops can reach up to with powerful (Class 1) transmitters.
Origins
Bluejacking was reportedly first carried out between 2001 and 2003 by a Malaysian IT consultant who used his phone to advertise Ericsson to a single Nokia 7650 phone owner in a Malaysian bank. He also invented the name, which he claims is an amalgam of Bluetooth and ajack, his username on Esato, a Sony Ericsson fan online forum. Jacking is, however, an extremely common shortening of "hijack', the act of taking over something. Ajack's original posts are hard to find, but references to the exploit are common in 2003 posts.
Another user on the forum claims earlier discovery, reporting a near-identical story to that attributed to Ajack, except they describe bluejacking 44 Nokia 7650 phones instead of one, and the location is a garage, seemingly in Denmark, rather than a Malaysian Bank. Also, the message was an insult to Nokia owners rather than a Sony Ericsson advertisement.
Usage
Bluejacking is usually not very harmful, except that bluejacked people generally don't know what has happened, and so may think that their phone is malfunctioning. Usually, a bluejacker will only send a text message, but with modern phones it's possible to send images or sounds as well. Bluejacking has been used in guerrilla marketing campaigns to promote advergames.
Bluejacking is also confused with Bluesnarfing, which is the way in which mobile phones are illegally hacked via Bluetooth.
Companies
BluejackQ
BlueJackQ is a website dedicated to bluejacking. The website contains a few bluejacking stories taken from the site's forum. The website also includes software that can be used for bluejacking and guides on how to bluejack which are slightly out of date but the basic principle still applies to most makes of phone. Its forum has 4,000 registered users and 93,050 posts. The website has been featured in many news articles.
The forums were opened on the November 13, 2003 and has been the center of BluejackQ from the start. It currently has 4 moderators and has 20 different sections available to members. The areas included information about BluejackQ, reviews of mobile phones, media players, PDAs and Miscellaneous devices, general bluejacking threads and an off-topic area. The BluejackQ podcast was first released as a test version on January 15, 2006, thus becoming the first bluejacking-related podcast. Podcasts 1, 2 and 3 featured three members of the forums.
The forums seem to have been unused since 2020.
Fictional reference in Person of Interest
The authentic bluejacking as described here is not the same exploit which was |
https://en.wikipedia.org/wiki/OS-tan | OS-tan is an Internet meme consisting of moe anthropomorphs of popular operating systems, originating on the Japanese imageboard Futaba Channel. The designs of OS-tan, which were created by various amateur Japanese artists, are typically female; for example, the personifications of Microsoft Windows operating systems are often depicted as sisters of varying ages. The -tan element in the term is a hypocoristic suffix in Japanese that implies extremely youthful endearment.
Though initially appearing only in fan works, the OS-tan proved popular enough that Microsoft branches in Singapore and Taiwan used the OS-tan concept as the basis for ad campaigns for Internet Explorer and Microsoft Silverlight, respectively.
History
The concept of the OS-tan is reported to have begun as a personification of the common perception of Windows Me (Released in 2000 by Microsoft as the 9x counterpart to Windows 2000) as unstable and prone to frequent crashes. Discussions on Futaba Channel likened this to the stereotype of a fickle, troublesome girl and as this personification expanded Me-tan was created and followed by the other characters. One of the early works to predominantly feature the OS-tan was an interactive Flash animation showing a possible intro to an imaginary anime show known as Trouble Windows. It was first published on April 2004 and appears to have quickly spread worldwide.
Commercial products
Ohzora Publishing produced one book based on OS-tan characters, titled . It includes illustrations by over 25 contributors. It also includes 95-tan, ME-tan, XP-tan figures, titled OS Girl 95, OS Girl me, OS Girl XP respectively, but include a molded space for 2k-tan (named OS Girl 2K).
ME-tan, 2K-tan, XP-tan were designed by GUHICO of Stranger Workshop, while 95-tan was designed by Fujisaki Shiro from H.B.Company.
Parthenon Production Limited, company had commercialized Pink Company's OS-tan products.
MALINO from Deja Vu ArtWorks produced the Me Document and Shared Folder! trilogy, which were sold in digital format.
Japanese version of Windows 7 Ultimate DSP Edition includes the unofficial Nanami Madobe mascot. This inspired Microsoft Taiwan to launch an official mascot for Microsoft Silverlight, Hikaru. This was followed up by giving Hikaru "sisters", Lei, Aoi, and Yu.
A special package of the Japanese Windows 7 Ultimate DSP Edition, called the Touch Mouse Artist Edition or Touch Mouse Limited Edition Artist Series, came with an animated tutorial Windows theme (with custom sounds and three desktop backgrounds) featuring Madobe Nanami.
In 2009, an Ubuntu-based comic titled Ubunchu! was serialized in Kantan Ubuntu!, a spinoff from Weekly ASCII magazine. It was authored by Hiroshi Seo, with English version translated by Fumihito Yoshida, Hajime Mizuno, Martin Owens, Arturo Silva, and Anton Ekblad.
Tan suffix
The Japanese suffix is a mispronunciation of , an informal, intimate, and diminutive honorific suffix for a person, used for friends, family, an |
https://en.wikipedia.org/wiki/The%20Crepes%20of%20Wrath | "The Crepes of Wrath" is the eleventh episode of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on April 15, 1990. It was written by George Meyer, Sam Simon, John Swartzwelder and Jon Vitti, and directed by Wes Archer and Milton Gray.
Bart is sent to France on a student exchange trip, where his hosts treat him like a slave. Meanwhile, an Albanian student takes Bart's place in the Simpson family, and shows great interest in Homer's work at the nuclear power plant.
The episode received generally positive reviews from critics. In 1997, David Bauder from TV Guide named it the greatest episode of The Simpsons, and the 17th-greatest episode of any television series.
Plot
After Homer trips over Bart's skateboard and falls down the stairs, he is confined to the couch for several days with an injured back. As punishment, Marge makes Bart clean his room, where he discovers an old cherry bomb. At school the next day, he flushes it down a toilet in the boys' restroom while Principal Skinner's mother, Agnes, is using the adjacent girls' restroom. The resulting explosion blows her off the toilet seat and enrages Principal Skinner.
Skinner proposes to Homer and Marge that Bart be deported by enrolling him in the school foreign exchange program. When Bart sees a picture of a lovely French château, he agrees to go there, much to Homer and Skinner's delight. The Simpsons host a student from Albania named Adil Hoxha.
When Bart arrives at Château Maison, he finds a dilapidated farmhouse at a run-down vineyard. His hosts are winemakers César and Ugolin, who treat him like a slave. Bart is starved while being made to carry buckets of water, pick and crush grapes, sleep on the floor, and test wine contaminated with antifreeze.
Adil arrives in Springfield and impresses Marge and Homer with his polite manners and help with household chores. They are unaware that Adil is actually an Albanian spy sent to obtain blueprints of the Springfield Nuclear Power Plant's reactor. Homer unwittingly takes him on a tour of the plant and thinks nothing when Adil takes many photographs, which he transmits to Albania with a fax machine hidden in Bart's treehouse.
When Bart's captors send him to town to buy a case of antifreeze, he asks a gendarme for help, but the man does not speak a word of English. Bart walks away, and suddenly begins speaking French. Realizing that he is now fluent, he tells the gendarme about the cruelty that he has suffered at the hands of the winemakers, and about their efforts to sell adulterated wine. The men are swiftly arrested and Bart is hailed as a hero for exposing their scheme to sell adulterated wine.
In Springfield, Adil is caught spying by the FBI and deported to Albania in exchange for the return of an American spy captured there. Bart returns home with gifts for his family.
Production
"The Crepes of Wrath" was the first episode of The Simpsons for which George Meyer was credi |
https://en.wikipedia.org/wiki/WBZ-TV | WBZ-TV (channel 4) is a television station in Boston, Massachusetts, United States, serving as the market's CBS outlet. It is owned and operated by the network's CBS News and Stations division alongside independent WSBK-TV (channel 38). Both stations share studios on Soldiers Field Road in the Allston–Brighton section of Boston. WBZ-TV's transmitter is located on Cedar Street in Needham, Massachusetts, on a tower site that was formerly owned by CBS and is now owned by American Tower Corporation (which is shared with transmitters belonging to sister station WSBK as well as WCVB-TV, WBTS-CD and WGBX-TV).
History
As an NBC affiliate (1948–1995)
As the only television station that was built from the ground up by the Westinghouse Electric Corporation, WBZ-TV began operations 10 am at June 9, 1948, with test patterns. The station's dedicatory program aired at 6:30 pm and featured remarks from the Very Rev. Edwin Van Etten, Archbishop Richard Cushing, Rabbi Joshua L. Liebman, Boston Mayor James Michael Curley, Boston Chamber of Commerce president C. Lawrence Muench, and Governor Robert F. Bradford. Due to the uncertainty surrounding the exact day the station would launch, all of the messages were prerecorded and one of the speakers (Liebman) had died before the program aired. The dedication was followed by the station's first news broadcast, hosted by Arch MacDonald.
The station was from its inception associated with the NBC television network, owing to WBZ radio (1030 AM)'s longtime affiliation with NBC's radio networks. At its sign-on, WBZ-TV became the first commercial television station to begin operations in the New England region. The station originally operated from inside the Hotel Bradford alongside its radio sister; its current home was not completed at the time, although master control and its self-supporting tower over the building were in use at sign-on. The WBZ stations would not move into what was then known as the Westinghouse Broadcasting Center until June 17, 1948, when the building was opened.
The station was knocked off the air on August 31, 1954, when Hurricane Carol destroyed its transmitter tower. A temporary transmitter was installed using a short, makeshift tower at the studio site and later on the original tower of WEEI-FM (now WBGB) in Malden. In 1957, WBZ-TV began broadcasting from a tower in Needham, along with WBZ-FM at 106.7 FM (now WMJX). The tower site is now owned by American Tower Corporation, and is used by several Boston-area television stations, including WGBH-TV (channel 2) and WCVB-TV (channel 5).
Channel 4 was in danger of losing its NBC affiliation when Westinghouse balked at NBC's initial offer to trade sister stations KYW radio and WPTZ television (now KYW-TV) in Philadelphia in exchange for WTAM-AM-FM and WNBK television (now WKYC-TV) in Cleveland. In response, NBC threatened to pull its programming from both WBZ-TV and WPTZ unless Westinghouse agreed to the trade. The swap was made in February 1956, b |
https://en.wikipedia.org/wiki/WOR | WOR or wor may refer to:
Wake-on-ring, in computer network terminology
Water-to-oil ratio, in oil drilling
WEPN-FM, a radio station (98.7 FM) licensed to New York, New York, United States, which used the call sign WOR-FM from 1948 to October 1972
Wired OR, in Verilog semantics
Wor, a traditional song and dance genre practiced on Biak, Indonesia
WOR, the National Rail code for Worle railway station in North Somerset, UK
WOR (AM), a radio station (710 AM) licensed to New York, New York, United States
Worchestershire, county in England, Chapman code
World Ocean Review, ocean and climate report from 2010
Worthington Industries, stock ticker symbol
WWOR-TV, a television station (channel 9) licensed to Secaucus, New Jersey, United States, which used the call sign WOR-TV from 1949 to April 1987
See also
Wore (disambiguation) |
https://en.wikipedia.org/wiki/Not%20Another%20Completely%20Heuristic%20Operating%20System | Not Another Completely Heuristic Operating System, or Nachos, is instructional software for teaching undergraduate, and potentially graduate level operating systems courses. It was developed at the University of California, Berkeley, designed by Thomas Anderson, and is used by numerous schools around the world.
Originally written in C++ for MIPS, Nachos runs as a user-process on a host operating system. A MIPS simulator executes the code for any user programs running on top of the Nachos operating system. Ports of the Nachos code exist for a variety of architectures.
In addition to the Nachos code, a number of assignments are provided with the Nachos system. The goal of Nachos is to introduce students to concepts in operating system design and implementation by requiring them to implement significant pieces of functionality within the Nachos system.
In Nachos' case, Operating System simulator simply means that you can run an OS (a guest OS) on top of another one (the host OS), similar to Bochs/VMware. It features emulation for:
A CPU (a MIPS CPU)
A hard drive
An interrupt controller, timer, and misc. other components
which are there to run the Nachos user space applications. That means that you can write programs for Nachos, compile them with a real compiler (an old gcc compiler that produces code for MIPS) and run them. The Nachos kernel instead is compiled to the platform of the Host OS and thus runs natively on the Host OS' CPU.
Nachos version 3.4 has been the stable, commonly used version of Nachos for many years. Nachos version 4.0 has existed as a beta since approximately 1996.
Implementation
Nachos has various modules implementing the functionality of a basic operating system. The wrapper functions for various system calls of the OS kernel are generally implemented in a manner similar to that of the UNIX system calls
. Various parts of the OS are instantiated as objects using the native code. For example, a class Machineis used as the master class of the simulated machine. It contains various objects, such as FileSystem, Processor, Timer, etc. which are defined to simulate various hardware aspects.
Major components
NachOS Machine - Nachos simulates a machine that roughly approximates the MIPS architecture. The machine has registers, memory and a CPU. The Nachos/MIPS machine is implemented by the Machine object, an instance of which is created when Nachos starts up. It contains methods like Run, ReadRegister, WriteRegister, etc. It also defines an interrupt object to handle interrupts. Timer and statistics are also implemented in this.
NachOS Threads - In NachOS a thread class is defined. A thread has an associated state with it which may be ready, running, blocked or just created. The thread object has various methods like PutThreadToSleep, YieldCPU, ThreadFork, ThreadStackAllocate, etc. Each thread runs at a virtual address space.
NachOS UserPrograms - Nachos runs user programs in their own private address space. Nachos c |
https://en.wikipedia.org/wiki/EMWIN | The Emergency Managers Weather Information Network (EMWIN) is a system for distributing a live stream of weather information in the United States. The backbone of the system is operated via satellite by the U.S. National Weather Service (NWS), but data are transmitted over radio repeaters by the NWS, citizens, and other organizations in many regions, and information can also be downloaded via the Internet. Local VHF/UHF radio rebroadcasts and older-generation EMWIN satellite systems operate at the speeds of 1200 and 9600 baud. EMWIN data consists of textual observational and forecast information, including a limited number of cloud and radar images. The new EMWIN, labeled EMWIN-N, began being upgraded in 2009. The upgrade continues through 2011 to ready older GOES satellites to provide a higher speed of 19.2 kbit/s. The data broadcasts are monetarily free with both local rebroadcasts and satellite feeds. EMWIN via Twitter may be done by anyone to spread information on all types of emergencies to virtually unlimited numbers of people in real time also.
EMWIN weather data is primarily transmitted over GOES satellites that observe the United States. The new satellites are the GOES-R series, and are designated GOES 16 and GOES 17.
On February 13, 2017 it suffered a service disruption.
References
External links
EMWIN homepage
EMWIN-N (new system)
Meteorological data and networks
Disaster preparedness in the United States |
https://en.wikipedia.org/wiki/Off-side%20rule | A computer programming language is said to adhere to the off-side rule of syntax if blocks in that language are expressed by their indentation. The term was coined by Peter Landin, possibly as a pun on the offside rule in association football. This is contrasted with free-form languages, notably curly-bracket programming languages, where indentation has no computational meaning and indent style is only a matter of coding conventions and formatting. Off-side-rule languages are also described as having significant indentation.
Definition
Peter Landin, in his 1966 article "The Next 700 Programming Languages", defined the off-side rule thus: "Any non-whitespace token to the left of the first such token on the previous line is taken to be the start of a new declaration."
Code examples
The following is an example of indentation blocks in Python. The colons are part of the Python language syntax for readability; they are not needed to implement the off-side rule.
In Python, the rule is taken to define the boundaries of statements rather than declarations.
def is_even(a: int) -> bool:
"""Determine whether number 'a' is even."""
if a % 2 == 0:
print('Even!')
return True
print('Odd!')
return False
Python also suspends the off-side rule within brackets. A statement within brackets continues until its brackets match (or mismatch):
{
"this": True,
"that": False,
"them": [1, 2,
3, 4, 5,
6, 7, 8,
9, 10, 11, 12]
}
In this dictionary, the keys are indented, and a list is split between four lines.
Implementation
The off-side rule can be implemented in the lexical analysis phase, as in Python, where increasing the indenting results in the lexer outputting an INDENT token, and decreasing the indenting results in the lexer outputting a DEDENT token. These tokens correspond to the opening brace { and closing brace } in languages that use braces for blocks, and means that the phrase grammar does not depend on whether braces or indentation are used. This requires that the lexer hold state, namely the current indent level, and thus can detect changes in indentation when this changes, and thus the lexical grammar is not context-free: INDENT and DEDENT depend on the contextual information of the prior indent level.
Alternatives
The primary alternative to delimiting blocks by indenting, popularized by broad use and influence of the language C, is to ignore whitespace characters and mark blocks explicitly with curly brackets (i.e., { and }) or some other delimiter. While this allows for more formatting freedom – a developer might choose not to indent small pieces of code like the break and continue statements – sloppily indented code might lead the reader astray, such as the goto fail bug.
Lisp and other S-expression-based languages do not differentiate statements from expressions, and parentheses are enough to control the scoping of all statements within the language. As in curly bracket languages, whitespace is mostly ig |
https://en.wikipedia.org/wiki/Indentation%20%28typesetting%29 |
In the written form of many languages, an indentation or indent is an empty space at the beginning of a line to signal the start of a new paragraph. Many computer languages have adopted this technique to designate "paragraphs" or other logical blocks in the program.
For example, the following lines are indented, using between one and six spaces:
This paragraph is indented by 1 space.
This paragraph is indented by 3 spaces.
This paragraph is indented by 6 spaces.
In computer programming, the neologisms outdent, unindent and dedent are used to describe the reversal of the indentation process, realigning text with the page margin (or with previous, lesser, levels of indentation).
In right-to-left languages (e.g. Hebrew and Arabic), indentation is used just the same, but from the right margin of the paper, where the line begins.
Indentation in typesetting
There are three main types of indentation, illustrated below in relation to borders representing the page dimensions.
Indentation in programming
In computer programming languages, indentation is used to format program source code to improve readability. Indentation is generally only of use to programmers; compilers and interpreters rarely care how much whitespace is present in between programming statements. However, certain programming languages rely on the use of indentation to demarcate programming structure, often using a variation of the off-side rule. The Haskell, Occam, Python, MoonScript, and Ya programming languages rely on indentation in this way.
Opinions about where to indent, whether to use spaces or tabs, and how many spaces to use are often hotly debated among programmers, leading some to describe indentation disputes as akin to a religious war. In 2006 a third method of indentation was proposed, called elastic tabstops.
In addition to general indentation of statements, different bracket indentation styles are commonly used.
References
Typography
Source code |
https://en.wikipedia.org/wiki/Akira%20%281988%20film%29 | is a 1988 Japanese animated cyberpunk action film directed by Katsuhiro Otomo, produced by Ryōhei Suzuki and Shunzō Katō, and written by Otomo and Izo Hashimoto, based on Otomo's 1982 manga of the same name. Set in a dystopian 2019, it tells the story of Shōtarō Kaneda, the leader of a biker gang whose childhood friend, Tetsuo Shima, acquires incredible telekinetic abilities after a motorcycle accident, eventually threatening an entire military complex amid chaos and rebellion in the sprawling futuristic metropolis of Neo-Tokyo.
While most of the character designs and settings were adapted from the manga, the plot differs considerably and does not include much of the last half of the manga, which continued publication for two years after the film's release. The soundtrack, which draws heavily from traditional Indonesian gamelan as well as Japanese noh music, was composed by Shōji Yamashiro and performed by Geinoh Yamashirogumi.
Akira was released in Japan on July 16, 1988, by Toho; it was released the following year in the United States by Streamline Pictures. It garnered an international cult following after various theatrical and VHS releases, eventually earning over $80million worldwide in home video sales. It has been cited as a masterpiece and is widely regarded by audiences and critics as one of the greatest films ever made, especially in the field of animation and in the action and science fiction genres. It is regarded as a landmark in Japanese animation, and the most influential and iconic anime film ever made. It is also a pivotal film in the cyberpunk genre, particularly the Japanese cyberpunk subgenre, as well as adult animation. The film had a significant impact on popular culture worldwide, paving the way for the growth of anime and Japanese popular culture in the Western world as well as influencing numerous works in animation, comics, film, music, television and video games.
Plot
In 2019, following a world war triggered by the sudden destruction of Tokyo on July 16, 1988, Neo-Tokyo is plagued by corruption, anti-government protests, terrorism, and gang violence. During a violent rally, the hot-headed Shōtarō Kaneda leads his vigilante bōsōzoku gang, the Capsules, against the rival Clown gang. Kaneda's best friend, Tetsuo Shima, inadvertently crashes his motorcycle into Takashi, an esper who escaped from a government laboratory with the aid of a resistance organization. Assisted by fellow esper Masaru, Japan Self-Defense Forces Colonel Shikishima recaptures Takashi, has Tetsuo hospitalized, and arrests the Capsules. While being interrogated by the police, Kaneda meets Kei, an activist within the resistance movement, and tricks the authorities into releasing her with his gang.
At a secret government facility, Shikishima and his head of research, Doctor Ōnishi, discover that Tetsuo possesses powerful psychic abilities similar to Akira, the esper responsible for Tokyo's 1988 destruction. Esper Kiyoko forewarns Shikishima of Neo- |
https://en.wikipedia.org/wiki/Elementary%2C%20Dear%20Data | "Elementary, Dear Data" is the third episode of the second season of the American science fiction television series Star Trek: The Next Generation, the 29th episode overall. It was written by Brian Alan Lane and directed by Rob Bowman. It was originally released on December 5, 1988, in broadcast syndication.
Set in the 24th century, the series follows the adventures of the Starfleet crew of the Federation starship Enterprise-D. In this episode, a holographic adversary is created on the holodeck of the Enterprise when Data and Geordi take some time off to play a Sherlock Holmes game. The plot line from this episode was continued in the sixth season episode "Ship in a Bottle".
In 1989, "Elementary, Dear Data" was nominated for two Emmy Awards: Outstanding Art Direction for a Series, Richard D. James, Art Director; Jim Mees, Set Decorator and Outstanding Costume Design for a Series, Durinda Wood, Costume Designer; William Ware Theiss, Starfleet Uniforms Creator.
Plot
As the Federation starship Enterprise, under the command of Captain Jean-Luc Picard, waits to rendezvous with the USS Victory, Chief Engineer La Forge and Commander Data go to the holodeck to recreate a Sherlock Holmes mystery. Data, playing Holmes, has memorized all of the Holmes stories, and recognizes and solves the mystery within minutes. Frustrated, Geordi leaves the holodeck, leaving Data confused. In Ten Forward, Geordi explains that the fun is in solving the unknown; Data does not understand. Overhearing their conversation, Chief Medical Officer Dr. Pulaski asserts that Data is incapable of solving a mystery to which he does not already know the outcome. Data accepts Dr. Pulaski's challenge and invites her to join them on the holodeck. There, Geordi instructs the computer to create a unique Sherlock Holmes mystery with an adversary who is capable of defeating Data.
In the new program, Dr. Pulaski is kidnapped, and Data investigates. They soon discover that Professor Moriarty is responsible, but when they find him with Pulaski in his hideout, they are shocked when they learn that Moriarty is aware of the holodeck program being a simulation, and is able to access the holodeck computer, showing them a sketch of the Enterprise he has drawn based on the computer's description. Data and Geordi leave the holodeck to alert the captain, and Geordi realizes that when he asked the computer to create the program he had asked for an adversary who could defeat Data, not Sherlock Holmes; as a result, the computer gave the holodeck character, Professor Moriarty, the intelligence and cunning needed to challenge Data, plus the ability to access the ship's computer. When Moriarty gains access to ship stabilizer controls, Data returns to the holodeck with Captain Picard.
Picard meets Moriarty, who demonstrates that he has evolved beyond his original programming and asks to continue to exist in the real world. Picard tells Moriarty that this would not be possible; instead, he saves the program |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.