source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/BET%20Soul | BET Soul is an American pay television network that is controlled by the BET Networks division of Paramount Global, which owns the network. The channel showcases R&B, funk, soul, neo soul, hip hop, jazz and Motown music from various decades. The channel uses an automated "wheel" schedule that was introduced during the early years of MTV2 and is also used by sister channel BET Jams. The loop repeats three times a day, starting at 6 a.m. Eastern Time, and then resetting at 2 p.m. and 10 p.m.
Originating as VH1 Soul, a spinoff of VH1, the channel moved under the editorial control of BET on December 28, 2015 as part of Viacom's (now Paramount's) ongoing restructuring of their pay-TV operations.
History
Early years (1998-2006)
The channel, which was originally a commercial-free service, debuted on August 1, 1998 with VH1 Smooth as part of the "MTV Digital Suite" of digital cable channels, which was sold only to cable providers to give them an advantage over satellite services. The first video shown on the channel was "Boogie Wonderland" by Earth, Wind & Fire.
In its early years, VH1 Soul's main focus was on R&B and soul videos of the late 1960s, 1970s, 1980s, and 1990s, along with live performance clips from even earlier years. Janet Jackson, Prince, TLC, Usher, Tony Toni Tone, Marvin Gaye, Aretha Franklin, Patti LaBelle and Stevie Wonder were some of the channel's main staples. By 2003, the channel had stopped showing most of the pre-1990s videos, since these were often played on VH1 Classic's Soul Power program. The channel then gradually began to focus more on underground, alternative, and old skool hip-hop videos, while continuing to feature new R&B musicians.
Change of format (2006-2015)
On February 1, 2006, VH1 Soul revamped its programming and introduced different one-hour themed video blocks to its schedule, as opposed to the prior random rotation of videos. However, the basic 'wheel schedule' structure remained, and does so to this day.
In Spring 2007, VH1 Soul, alongside its sister networks MTV Jams and MTV Hits, were briefly dropped from Time Warner Cable's Southern California systems that were formerly operated by Adelphia and Comcast. However, all three channels returned to TWC within a few months, under a new, specialized service tier. To date, however, the three networks remain conspicuously absent from many of Time Warner Cable and Bright House Networks' systems, most notably in New York City. Even as the 'Digital Suite' concept was discontinued, the network has neither offered to DirecTV nor Dish Network until 2016.
The last edition of the Vibe Awards aired on the channel in November 2007, after a one-year hiatus due to the merger of The WB and UPN into The CW. By this time, as the channel's distribution increased, VH1 Soul began showing regular advertising. Commercials were removed in 2009, but were restored on January 1, 2011.
For a short time from 2008 until 2009 the network aired non-music video programming in some timeslo |
https://en.wikipedia.org/wiki/CINT | CINT is a command line C/C++ interpreter that was originally included in the object oriented data analysis package ROOT. Although intended for use with the other faculties of ROOT, CINT can also be used as a standalone addition to another program that requires such an interpreter. In 2013, CERN switched to the Cling C++ interpreter, so CINT is now distributed standalone by the author.
CINT is an interpreted version of C/C++, much in the way BeanShell is an interpreted version of Java. In addition to being a language interpreter, it offers certain Bash-like shell features such as history and tab-completion. To accomplish the latter, it relies heavily on the reflection support built into ROOT. User classes that follow these interfaces may also take advantage of these features.
The language originally interpreted by CINT was actually something of a hybrid between C and C++, covering about 95% of ANSI C and 85% of C++. The syntax, however, is a bit more forgiving than either language. For example, the operator -> can be replaced by . with only an optional warning. In addition, statements on the command line do not need to end with a semi-colon, although this is necessary for statements in macros.
As an alternative to CINT, ROOT also provides Cling which is an REPL application using LLVM's Clang as a C++ JIT compilation environment.
See also
C/C++ Interpreter Ch
References
C programming language family
Interpreters (computing) |
https://en.wikipedia.org/wiki/Wi-Fi%20hotspot | A hotspot is a physical location where people can obtain Internet access, typically using Wi-Fi technology, via a wireless local-area network (WLAN) using a router connected to an Internet service provider.
Public hotspots may be created by a business for use by customers, such as coffee shops or hotels. Public hotspots are typically created from wireless access points configured to provide Internet access, controlled to some degree by the venue. In its simplest form, venues that have broadband Internet access can create public wireless access by configuring an access point (AP), in conjunction with a router to connect the AP to the Internet. A single wireless router combining these functions may suffice.
A private hotspot, often called tethering, may be configured on a smartphone or tablet that has a network data plan, to allow Internet access to other devices via Bluetooth pairing, or through the RNDIS protocol over USB, or even when both the hotspot device and the device[s] accessing it are connected to the same Wi-Fi network but one which does not provide Internet access. Similarly, a Bluetooth or USB OTG can be used by a mobile device to provide Internet access via Wi-Fi instead of a mobile network, to a device that itself has neither Wi-Fi nor mobile network capability.
Uses
The public can use a laptop or other suitable portable device to access the wireless connection (usually Wi-Fi) provided. Of the estimated 150 million laptops, 14 million PDAs, and other emerging Wi-Fi devices sold per year for the last few years, most include the Wi-Fi feature.
The iPass 2014 interactive map, that shows data provided by the analysts Maravedis Rethink, shows that in December 2014 there are 46,000,000 hotspots worldwide and more than 22,000,000 roamable hotspots. More than 10,900 hotspots are on trains, planes and airports (Wi-Fi in motion) and more than 8,500,000 are "branded" hotspots (retail, cafés, hotels). The region with the largest number of public hotspots is Europe, followed by North America and Asia.
Libraries throughout the United States are implementing hotspot lending programs to extend access to online library services to users at home who cannot afford in-home Internet access or do not have access to Internet infrastructure. The New York Public Library was the largest program, lending out 10,000 devices to library patrons. Similar programs have existed in Kansas, Maine, and Oklahoma; and many individual libraries are implementing these programs.
Wi-Fi positioning is a method for geolocation based on the positions of nearby hotspots.
Security issues
Security is a serious concern in connection with public and private hotspots. There are three possible attack scenarios. First, there is the wireless connection between the client and the access point, which needs to be encrypted, so that the connection cannot be eavesdropped or attacked by a man-in-the-middle attack. Second, there is the hotspot itself. The WLAN encryption ends at the i |
https://en.wikipedia.org/wiki/Arpwatch | arpwatch is a computer software tool for monitoring Address Resolution Protocol traffic on a computer network. It generates a log of observed pairing of IP addresses with MAC addresses along with a timestamp when the pairing appeared on the network. It also has the option of sending an email to an administrator when a pairing changes or is added.
Network administrators monitor ARP activity to detect ARP spoofing, network flip-flops, changed and new stations and address reuse.
arpwatch was developed by Lawrence Berkeley National Laboratory, Network Research Group, as open-source software and is released under the BSD license.
See also
ArpON
arping
Ettercap
References
External links
Source files
Free network management software
Linux security software
Unix security software
Software using the BSD license |
https://en.wikipedia.org/wiki/SOCOM%20II%20U.S.%20Navy%20SEALs | SOCOM II U.S. Navy SEALs is a tactical shooter video game developed by Zipper Interactive and published by Sony Computer Entertainment for PlayStation 2. It is the sequel to SOCOM U.S. Navy SEALs.
The online servers for this game, along with other PlayStation 2 and PlayStation Portable SOCOM titles, were shut down on 31 August, 2012.
Gameplay
SOCOM II U.S. Navy SEALs is a third-person tactical shooter. There are 12 different single-player missions: split equally between Albania, Algeria, Brazil and Russia. There are five different ranks that can be played in the game: Ensign, Lieutenant, Commander, Captain and Admiral. The player starts with the first three ranks unlocked, but must finish the single player game on Commander to unlock Captain, and on Captain to unlock Admiral. Players can unlock new models for multiplayer, as well as movies, music, concept art, and credits by completing certain objectives.
Each mission has primary, secondary, and hidden bonus objectives. Players have to complete all the primary objectives to win the mission, and secondary objectives are optional, but add to the overall score for the mission. The hidden bonus objectives usually help make other missions easier. For example, finding a map in one mission means the player will not have to work to find that place in the next mission. A letter grade is received at the end of each mission based on 4 categories of score: Stealth, Accuracy, Teamwork, and Objective Completion. In single player, orders can be given to the rest of the team. This can be done using either the command menu or a USB headset. The menu features new command options, enabling the player to order their teammates to drop to the ground and hold position when outdoors.
The online and lan multiplayer portion of SOCOM II U.S. Navy SEALs requires a broadband connection for play. This mode sets two teams of up to eight, SEALs and Terrorists, against each other. The default round time is six minutes, and each game is decided based on the first team to win 6 of 11 possible rounds. Each team spawns at opposite sides of the map, and proceeds to pursue its objective. When a character dies, the player must wait for the next round to resume play. While dead, the player may monitor the status of his teammates, and may change his weapon load. In a room created by a given SOCOM II U.S. Navy SEALs user, factors such as the number of rounds, round type, round time, weapon restrictions, and friendly fire can all be adjusted to the creator's liking.
SOCOM II U.S. Navy SEALs supports chat and prohibits in-game loitering. Voice chat is permitted in server lobbies, but not while in the armory of game lobbies. There are in-game options to mute certain players and to switch to different channels of communication (offense, defense, etc.). Problems with locating acquaintances in the original SOCOM online lead to the development of both a Friend List and a Clan Roster. The game features twelve new online maps, along with ten |
https://en.wikipedia.org/wiki/Alienware | Alienware is an American computer hardware subsidiary of Dell. Their product range is dedicated to gaming computers and can be identified by their alien-themed designs. Alienware was founded in 1996 by Nelson Gonzalez and Alex Aguila. The development of the company is also associated with Frank Azor, Arthur Lewis, Joe Balerdi, and Michael S. Dell. The company's corporate headquarters is located in The Hammocks, Miami, Florida.
History
Overview
Established in 1996 as Saikai of Miami, Inc. by Nelson Gonzalez and Alex Aguila, two childhood friends, Alienware assembles desktops, notebooks, workstations, and PC gaming consoles. According to employees, the name "Alienware" was chosen because of the founders' fondness for the hit television series The X-Files, which also inspired the science-fiction themed names of product lines such as Area-51, Hangar 18, and Aurora. In 1997, it changed its name to Alienware.
Acquisition and current status
Dell had considered buying the Alienware company since 2002, but did not agree to purchase the company until March 22, 2006. As a subsidiary, it retains control of its design and marketing while benefiting from Dell's purchasing power, economies of scale, and supply chain, which lowered its operating costs.
Initially, Dell maintained its competing XPS line of gaming PCs, often selling computers with similar specifications, which may have hurt Alienware's market share within its market segment. Due to corporate restructuring in the spring of 2008, the XPS brand was scaled down, and the Desktop line was eliminated leaving only the XPS Notebooks, but XPS Desktop models had returned by the end of the year.
Product development of gaming PCs was consolidated with Dell's gaming division, with Alienware becoming Dell's premier gaming brand. On June 2, 2009, The M17x was introduced as the first Alienware/Dell branded system. This launch also expanded Alienware's global reach from 6 to 35 countries while supporting 17 different languages.
Computer systems models (after acquisition by Dell)
Windows OS-based consoles
Alienware announced that it would be releasing a series of video game consoles starting in 2014, aiming to compete with the Sony PlayStation 4, Nintendo Wii U, and the Microsoft Xbox One. The first version in this series, the Alpha, ran Windows 8.1. The operating system and ability to play PC games is what separates the Alpha from the eighth generation of video game consoles. At E3 2016, Alienware announced the second rendition of the Alpha, the Alpha R2. The R2 adds 6th generation Intel processors, a choice of either the AMD Radeon R9 M470X or Nvidia GeForce 960 graphics cards, and support for Alienware's proprietary Graphics Amplifier. It also ships with Windows 10.
Graphics Amplifier
The Graphics Amplifier allows an Alienware laptop to run most full length (or smaller, non-hybrid) desktop GPUs. A proprietary PCIe 3.0 ×4 cable is used instead of the Thunderbolt 3 cable used on most other eGPUs .
Laptops
|
https://en.wikipedia.org/wiki/XMP | XMP may refer to:
Computing
Cray X-MP, a supercomputer
Extensible Metadata Platform, an ISO standard for the creation, processing and interchange of metadata for all kinds of resources
Extreme Memory Profile, information about a computer memory module, used to encode higher-performance memory timings
Gaming
eXpanded MultiPlayer (U2XMP), the multiplayer expansion to Unreal II
Unreal Tournament: Expanded Multiplayer (UT:XMP), a total conversion of expanded multiplayer for Unreal Tournament 2004
Exotic matter pulse burster, a weapon in the game Ingress
Other uses
Extremely Metal-Poor, stars, galaxies and related
Xanthosine monophosphate, an intermediate in purine metabolism |
https://en.wikipedia.org/wiki/Digital%20watermarking | A digital watermark is a kind of marker covertly embedded in a noise-tolerant signal such as audio, video or image data. It is typically used to identify ownership of the copyright of such signal. "Watermarking" is the process of hiding digital information in a carrier signal; the hidden information should, but does not need to, contain a relation to the carrier signal. Digital watermarks may be used to verify the authenticity or integrity of the carrier signal or to show the identity of its owners. It is prominently used for tracing copyright infringements and for banknote authentication.
Like traditional physical watermarks, digital watermarks are often only perceptible under certain conditions, e.g. after using some algorithm. If a digital watermark distorts the carrier signal in a way that it becomes easily perceivable, it may be considered less effective depending on its purpose. Traditional watermarks may be applied to visible media (like images or video), whereas in digital watermarking, the signal may be audio, pictures, video, texts or 3D models. A signal may carry several different watermarks at the same time. Unlike metadata that is added to the carrier signal, a digital watermark does not change the size of the carrier signal.
The needed properties of a digital watermark depend on the use case in which it is applied. For marking media files with copyright information, a digital watermark has to be rather robust against modifications that can be applied to the carrier signal. Instead, if integrity has to be ensured, a fragile watermark would be applied.
Both steganography and digital watermarking employ steganographic techniques to embed data covertly in noisy signals. While steganography aims for imperceptibility to human senses, digital watermarking tries to control the robustness as top priority.
Since a digital copy of data is the same as the original, digital watermarking is a passive protection tool. It just marks data, but does not degrade it or control access to the data.
One application of digital watermarking is source tracking. A watermark is embedded into a digital signal at each point of distribution. If a copy of the work is found later, then the watermark may be retrieved from the copy and the source of the distribution is known. This technique reportedly has been used to detect the source of illegally copied movies.
History
The term "Digital Watermark" was coined by Andrew Tirkel and Charles Osborne in December 1992. The first successful embedding and extraction of a steganographic spread spectrum watermark was demonstrated in 1993 by Andrew Tirkel, Gerard Rankin, Ron Van Schyndel, Charles Osborne, and others.
Watermarks are identification marks produced during the paper making process. The first watermarks appeared in Italy during the 13th century, but their use rapidly spread across Europe. They were used as a means to identify the paper maker or the trade guild that manufactured the paper. The marks often we |
https://en.wikipedia.org/wiki/KOVR | KOVR (channel 13) is a television station licensed to Stockton, California, United States, serving as the CBS outlet for the Sacramento area. It is owned and operated by the network's CBS News and Stations division alongside independent station KMAX-TV (channel 31). Both stations share studios on KOVR Drive in West Sacramento, while KOVR's transmitter is located in Walnut Grove, California.
KOVR began broadcasting in September 1954 from studios in Stockton and a transmitter atop Mount Diablo. This facility provided wide coverage from San Francisco to Sacramento and beyond, but KOVR could not obtain a network affiliation in the San Francisco market, whereas its move completely into the Stockton/Sacramento area in 1957 resulted in an affiliation with ABC. After moving, the station was sold twice before being acquired by newspaper publisher McClatchy in 1963. McClatchy would sell the station in 1980 under intense pressure on owners of newspaper-broadcast combinations, and it changed hands another six times from 1983 to 1996. The station became a CBS affiliate in 1995 as the result of an affiliation switch and was purchased by CBS in 2005; uniquely, it broadcasts prime time programming one hour ahead of other West Coast stations. Traditionally a third-rated station in local news, ratings have gradually improved for its newscasts since the 1990s.
History
The Mount Diablo years
On March 5, 1948, Radio Diablo, Inc. (later Television Diablo) filed an application for a new television station to broadcast on channel 13, first assigned to San Francisco and then to San Jose, from Mount Diablo in Contra Costa County. From Mount Diablo, the principals in Radio Diablo operated FM station KSBR, which had an effective radiated power of 250,000 watts and, having just moved to the mountaintop, claimed it was heard from the Oregon state line to Bakersfield. Two other groups applied for the channel by late 1948, but they would all have to wait after the Federal Communications Commission (FCC) imposed a freeze on new television station awards that would last nearly four years. When the freeze ended, channel 13 had been removed from San Jose to Stockton, where it could still cover the city of license from Mount Diablo. In addition to Radio Diablo, another Stockton broadcasting station applied for the channel: radio station KXOB. Radio Diablo, headed by O. H. Brown, estimated it could serve 3.5 million people in San Francisco, Stockton, and Sacramento from its mountaintop site. The owners of KXOB would ultimately receive shares in Radio Diablo in a settlement agreement, and broadcaster and furniture store owner Edward Peffer did likewise, paving the way for the FCC to grant Radio Diablo the construction permit on February 11, 1954. Leslie Hoffman, who had become the new president of the company, was to have the station named for him as KHOF, but when Hoffman thought of the possibility of "cough" puns based on the designation, the call sign was changed to KOVR, for " |
https://en.wikipedia.org/wiki/Sigil%20Games%20Online | Sigil Games Online, Inc. was a computer game developer based in Carlsbad, California founded in January 2002 by Brad McQuaid and Jeff Butler, key development team members who created EverQuest, the most popular massively multiplayer online role-playing game before World of Warcraft. McQuaid and Butler left Sony Online Entertainment (SOE), the publisher of EverQuest, and formed Sigil Games Online to develop "the next big thing". McQuaid told the video game website IGN, "I find myself much happier at the results of assembling an all-star team of MMOG developers and focusing on making one ground-breaking, unprecedented project, as opposed to being spread thin like I was as VP/CCO at Verant/SOE.". Sigil released their only game "Vanguard: Saga of Heroes" on January 30, 2007 after several well publicized delays and a last minute switch from publishing with Microsoft to publishing again with SOE. On May 15, 2007, SOE announced that they had completed a transaction to purchase key assets of Sigil Games Online. As a result, SOE now owns Vanguard: Saga of Heroes, described as Sigil's "tent pole property".
Vanguard: Saga of Heroes
McQuaid and Butler formerly worked for Sony Online Entertainment on the team developing EverQuest. After their departure, they formed Sigil; on May 16, 2002, Sigil announced that they had reached an exclusive publishing deal with Microsoft and they began work on "Vanguard: Saga of Heroes". With the pedigree of the "all-star" team at Sigil and the bravado of CEO Brad McQuaid, there were very high expectations for the game among MMO fans and the press.
An early marketing fact sheet for Vanguard included the following: "Vanguard: Saga of Heroes will be the premier third generation massively multiplayer RPG. A vast, seamless, immersive virtual world filled with elements of familiar High Fantasy, including traditional themes and more, all depicted using cutting-edge graphics technology. Sigil's expertise and experience in the field will bring groundbreaking static and dynamic content to the genre. Vanguard will build upon the successes and strengths of earlier MMORPGs to improve popular game mechanics and features, but also address these pioneering games' mistakes and deficiencies. Vanguard will focus heavily on interdependence, challenge, and reward, while simultaneously addressing tedious and annoying issues, including camping, excessive downtime and more."
Originally, Sigil worked with Microsoft to co-publish 'Vanguard but after 4 years, and less than one year before the game's release, the partnership was quickly dissolved. On May 5, 2006 Sigil announced that they had negotiated a deal to purchase the rights to Vanguard back from Microsoft, and at the same time announced that they had arranged a co-publishing deal between Sigil and Sony Online Entertainment. "Vanguard: Saga of Heroes" was released on January 30, 2007, co-published by Sigil and Sony Online Entertainment. While initial preview coverage was positive the launch le |
https://en.wikipedia.org/wiki/CMD | CMD may refer to:
Entities
Cable Mágico Deportes, a Peruvian TV network
Center for Media and Democracy, left-wing nonprofit organization in U.S.
Center for Molecular Design, Janssen Pharmaceutica
Coleg Meirion-Dwyfor, a college in Gwynedd, Wales
Creative Micro Designs, a computer hardware company
Lakas–CMD, Lakas–Christian Muslim Democrats, a center-right political party in the Philippines
Medical
Congenital muscular dystrophy
Craniomandibular dysfunction
Custom-made device, a medical device designed and manufactured for the specific use of a particular patient.
Technology
cmd.exe, command prompt on the OS/2 and Windows NT families of operating systems
CMD file (CP/M), the filename extension used by executable programs
Concerted metalation deprotonation, a kind of chemical reaction
Travel
Camden Road railway station, London, England, National Rail code
Cootamundra Airport, IATA airport code "CMD"
Other
Chromo-modal dispersion
C.M.D. or Cmd, a Command paper, published by the UK government
Color-magnitude diagram, a plot of brightness against colour for a group of stars
Catastrophe à moyens dépassé, "disaster without sufficient rescue means" in French |
https://en.wikipedia.org/wiki/Dominic%20Giampaolo | Dominic P. Giampaolo is a software developer who helped develop the Be File System for the Be Operating System (BeOS) and currently works at Apple Inc.
After graduating from Lewiston High School in Lewiston, Maine in 1987, he started studying political science at American University in Washington, D.C., but changed to computer science after one semester. After completing his bachelor's degree, he did a master's degree at Worcester Polytechnic Institute.
After graduating, he travelled to the west coast to work for Silicon Graphics in their Advanced Systems Division. There he worked in the group that ported IRIX to the 64-bit R8000 microprocessor chip set and worked on the RealityEngine and InfiniteReality graphics systems. While working for Silicon Graphics, he located and fixed a bug in Discreet Logic's Flame compositing system that was delaying post-production of the motion picture Speed.
In October 1995, Giampaolo heard about the BeBox from a friend at a poker game. Shortly after visiting the Be Inc. offices to see a demo of the computer, he began working on the BeOS, working initially in a number of areas including the kernel and the POSIX layer but most notably developing the Be File System alongside Cyril Meurillon, which replaced the Old Be File System written by Benoit Schillings which had itself replaced the original flat file system written by Meurillon. The Be File System included a number of advances compared to other personal computer filesystems in use at the time, such as a journal to improve reliability and support for extensive metadata that can be indexed to respond quickly to searches.
After Be, Giampaolo worked at Google and then QNX Software Systems. While at QNX, he discovered a bug in the Instruction Fetch Unit of Intel Pentium II and Pentium III processors.
Since March 2002, Giampaolo has been working for Apple Inc., where he is part of the macOS file system (Apple File System project) and Spotlight groups.
Bibliography
Giampaolo, Dominic (1999). Practical File System Design with the Be File System. Morgan Kaufmann. .
References
External links
Dominic Giampaolo's personal homepage
Introducing Apple File System
Year of birth missing (living people)
Living people
American University alumni
Worcester Polytechnic Institute alumni
American computer programmers
Apple Inc. employees
Be Inc. people
Silicon Graphics people
Google employees |
https://en.wikipedia.org/wiki/Yuliang%20Zheng | Yuliang Zheng is the Chair of the Department of Computer and Information Sciences at the University of Alabama at Birmingham. He is best known for inventing the Signcryption cryptographic primitive that combines the digital signature and encryption operations into one single step. He also invented the HAVAL hash function, SPEED cipher, and STRANDOM pseudo-random number generator.
Zheng serves as Chief Technology Officer of Calyptix Security Corporation, a company he co-founded in 2002.
External links
Homepage of Yuliang Zheng
Yokohama National University alumni
Monash University alumni
University of North Carolina at Charlotte faculty
Living people
Year of birth missing (living people)
Modern cryptographers
Chinese cryptographers
American chief technology officers |
https://en.wikipedia.org/wiki/Reeds%E2%80%93Sloane%20algorithm | The Reeds–Sloane algorithm, named after James Reeds and Neil Sloane, is an extension of the Berlekamp–Massey algorithm, an algorithm for finding the shortest linear-feedback shift register (LFSR) for a given output sequence, for use on sequences that take their values from the integers mod n.
References
External links
Reeds–Sloane Algorithm on MathWorld
Cryptanalytic algorithms |
https://en.wikipedia.org/wiki/Multiple%20encryption | Multiple encryption is the process of encrypting an already encrypted message one or more times, either using the same or a different algorithm. It is also known as cascade encryption, cascade ciphering, multiple encryption, and superencipherment. Superencryption refers to the outer-level encryption of a multiple encryption.
Some cryptographers, like Matthew Green of Johns Hopkins University, say multiple encryption addresses a problem that mostly doesn't exist: Modern ciphers rarely get broken... You’re far more likely to get hit by malware or an implementation bug than you are to suffer a catastrophic attack on AES. .... and in that quote lies the reason for multiple encryption, namely poor implementation. Using two different cryptomodules and keying processes from two different vendors requires both vendors' wares to be compromised for security to fail completely.
Independent keys
Picking any two ciphers, if the key used is the same for both, the second cipher could possibly undo the first cipher, partly or entirely. This is true of ciphers where the decryption process is exactly the same as the encryption process—the second cipher would completely undo the first. If an attacker were to recover the key through cryptanalysis of the first encryption layer, the attacker could possibly decrypt all the remaining layers, assuming the same key is used for all layers.
To prevent that risk, one can use keys that are statistically independent for each layer (e.g. independent RNGs).
Ideally each key should have separate and different generation, sharing, and management processes.
Independent Initialization Vectors
For en/decryption processes that require sharing an Initialization Vector (IV) / nonce these are typically, openly shared or made known to the recipient (and everyone else). Its good security policy never to provide the same data in both plaintext and ciphertext when using the same key and IV. Therefore, its recommended (although at this moment without specific evidence) to use separate IVs for each layer of encryption.
Importance of the first layer
With the exception of the one-time pad, no cipher has been theoretically proven to be unbreakable.
Furthermore, some recurring properties may be found in the ciphertexts generated by the first cipher. Since those ciphertexts are the plaintexts used by the second cipher, the second cipher may be rendered vulnerable to attacks based on known plaintext properties (see references below).
This is the case when the first layer is a program P that always adds the same string S of characters at the beginning (or end) of all ciphertexts (commonly known as a magic number). When found in a file, the string S allows an operating system to know that the program P has to be launched in order to decrypt the file. This string should be removed before adding a second layer.
To prevent this kind of attack, one can use the method provided by Bruce Schneier:
Generate a random pad R of the same size as the |
https://en.wikipedia.org/wiki/King%20World%20Productions | King World Productions, Inc. (also known as King World Entertainment, King World Enterprises, or simply King World) was a production company and syndicator of television programming in the United States independently established in 1964 until acquired by CBS in 1999, with its eventual 2007 incorporation into CBS Television Distribution (now CBS Media Ventures). Following the death of Roger King, the company continues to exist on paper as an intellectual property holder and under the moniker of KWP Studios to hold the copyright for television shows like Rachael Ray, which premiered nationally on September 18, 2006.
History
Founding with The Little Rascals
The division was started in 1964 by Charles King (1912–1972). It was a company that expressly handled television distribution of the Hal Roach-produced Our Gang short comedy films from the 1930s. When Roach lost the rights to the name Our Gang (it was retained by the Metro-Goldwyn-Mayer film studio, who bought the series from Roach in 1938), the shorts were retitled as The Little Rascals.
It was through this acquisition that the comedy shorts made from 1929 through 1938 have been made available to audiences for the past fifty years. King World later co-produced an animated TV special with Muller-Rosen Productions and Murakami-Wolf-Swenson in 1979 called The Little Rascals Christmas Special and later co-produced an 1982–1984 animated The Little Rascals TV series with Hanna-Barbera. King died in 1972 and the company was taken over by King's children: Roger M. King (1944-2007), Michael (1948-2015), Robert (1940-2020), Diana (1949-2019), Richard (1941-2020), and Karen.
1980s expansion
In 1983, the company acquired the syndication rights to NBC's daytime game show Wheel of Fortune. Merv Griffin, the show's creator and producer, had shopped the program to various other studios prior to reaching a deal with King World. King World also would acquire the rights to distribute Griffin's own long-running talk/variety program from Metromedia's syndication division. A year later, Griffin announced plans to revive another of his game show creations, Jeopardy!, and King World agreed to distribute that program as well.
In 1984 King World formed an ad-sales barter division called Camelot Entertainment Sales. Later that year president Robert King left the company to form The Television Program Source; a television syndication company that was founded as a joint venture between King, Alan Bennett, and Columbia Pictures Television. King World also purchased television and film distributor Leo A. Gutman, Inc. whose titles included the theatricals Joan of Arc, Anna Karenina and the Sherlock Holmes and East Side Kids series; and two 1960s television westerns, Branded and The Guns of Will Sonnett.
In 1986, King World signed Oprah Winfrey to a syndication deal and agreed to distribute her Chicago-based daytime talk program nationally, resulting in the premiere of The Oprah Winfrey Show in September of that year. |
https://en.wikipedia.org/wiki/Internet%20Storage%20Name%20Service | In computing, the proposed Internet Storage Name Service (iSNS) protocol allows automated discovery, management and configuration of iSCSI and Fibre Channel devices (using iFCP gateways) on a TCP/IP network.
Features
iSNS provides management services similar to those found in Fibre Channel networks, allowing a standard IP network to operate in much the same way that a Fibre Channel storage area network does. Because iSNS is able to emulate Fibre Channel fabric services and manage both iSCSI and Fibre Channel devices, an iSNS server can be used as a consolidated configuration point for an entire storage network. However, the use of iSNS is optional for iSCSI while it is required for iFCP. Additionally, an iSNS implementation is not required by the standard to provide support for both of these protocols.
Components
The iSNS standard defines four components:
The iSNS Protocol iSNSP is a protocol that specifies how iSNS clients and servers communicate. It is intended to be used by various platforms, including switches and targets as well as server hosts.
iSNS Clients iSNS clients are part of iSNSP aware storage devices. iSNS clients initiate transactions with iSNS servers using the iSNSP, register device attribute information in a common Discovery Domain (DD), download information about other registered clients and receive asynchronous notification of events that occur in their DD(s).
iSNS Servers iSNS servers respond to iSNS protocol queries and requests made by iSNS clients using the iSNSP. iSNS servers initiate iSNSP State Change Notifications and store properly authenticated information submitted by a registration request in an iSNS database.
iSNS Databases iSNS databases are the information repositories for iSNS server(s). They maintain information about iSNS client attributes; while implementations will vary, a directory-enabled implementation of iSNS, for example, might store client attributes in an LDAP directory.
Services
An iSNS implementation provides four primary services:
Name registration and storage resource discovery
Discovery domains and login control
State-change notification
Bidirectional mappings between Fibre Channel and iSCSI devices
Name registration and storage resource discovery
iSNS implementations allow all entities in a storage network to register and query an iSNS database. Both targets and initiators can register with the iSNS database, and each entity can inquire about other initiators and targets. For example, a client initiator can obtain information about target devices from an iSNS server.
Discovery domains and login control
Administrators can use the discovery domains to divide storage nodes into manageable, non-exclusive groups. By grouping storage nodes, administrators are able to limit the login process of each host to the most appropriate subset of targets registered with the iSNS, which allows the storage network to scale by reducing the number of unnecessary logins and by limiting the |
https://en.wikipedia.org/wiki/Robert%20Hyatt | Robert Morgan Hyatt (born 1948) is an American computer scientist and programmer. He co-authored the computer chess programs Crafty and Cray Blitz which won two World Computer Chess Championships in the 1980s. Hyatt was a computer science professor at the University of Southern Mississippi (1970–1985) and University of Alabama at Birmingham (1988–2016).
Early life and education
Hyatt was born in Laurel, Mississippi in 1948. He earned a bachelor's degree in 1970 and an M.S. in 1983, both from the University of Southern Mississippi. His master's dissertation was titled Cray Blitz: A Computer Chess Playing Program. Hyatt earned a Ph.D. in computer and information sciences at the University of Alabama at Birmingham in 1988. His thesis was titled A High-Performance Parallel Algorithm to Search Depth-First Game Trees. Bruce Wilsey Suter was Hyatt's doctoral advisor.
Career
Hyatt is co-author of the computer chess program Crafty and the co-author of Cray Blitz, a two-time winner of the World Computer Chess Championships. He has been actively involved in computer chess since he first started to program a computer to play chess in 1968. These efforts have been supported by various computer vendors such as Univac (1978), Cray Research (1980–1994), and more recently AMD via their developer's lab. Crafty is freely available both in executable form (from many different web sites) and in source form (from Hyatt's home page). Crafty presently participates in many computer chess tournaments (and an occasional human chess tournament). An old version of the source of Cray Blitz is also available on the internet for those interested in seeing what computer chess looked like in the late 1980s.
Hyatt taught computer science for 46 years, from 1970 through 1985 at the University of Southern Mississippi and from 1985 through 2016 at the University of Alabama at Birmingham. He retired in 2016 as an associate professor of computer science at the University of Alabama at Birmingham, in the Department of Computer and Information Sciences (1988–2016).
References
External links
American computer scientists
Computer chess people
University of Southern Mississippi alumni
University of Alabama at Birmingham alumni
University of Alabama at Birmingham faculty
Living people
People from Laurel, Mississippi
University of Southern Mississippi faculty
American computer programmers
20th-century American scientists
21st-century American scientists
1948 births |
https://en.wikipedia.org/wiki/Christian%20Broadcasting%20Network | The Christian Broadcasting Network (CBN) is an American Christian media production and distribution organization. Founded in 1960 by Pat Robertson, it produces the long-running TV series The 700 Club, co-produces the ongoing Superbook anime, and has operated a number of TV channels and radio stations.
CBN has been described as having been "at the forefront of the culture wars since the network's inception in the early 1960s."
Operations
One of the company's mainstays is The 700 Club, which uses a religious variety program that mixes sermons, interviews, and religious music (such as hymns and gospel). The name refers to a fundraising drive where Robertson successfully sought 700 viewers willing to contribute $10 a month to sustain the station. The 700 Club is the longest-running program in the variety format. Initially focused on devotional content, The 700 Club became increasingly political in the late 1970s, adding news segments.
Today, CBN News, provides news updates to The 700 Club and produces religious news programs such as CBN NewsWatch and Christian World News; it also produces a special hour-long block of prime time election coverage hosted by Robertson during American presidential and mid-term elections, airing on Freeform, which also carries The 700 Club and the half-hour talk show 700 Club Interactive. CBN also operates the CBN News Channel. The company also produces a version of The 700 Club aimed at Spanish speaking Americans (Club 700 Hoy).
CBN Asia manages Operation Blessing International Relief and Development Corporation (OBI), an international relief and missionary effort, and has international programming, producing local programs including Solusi in Indonesia and From Heart to Heart in Thailand.
CBN India produces three shows, a daily Hindi program Ek Nayee Zindagi, a bi-weekly Telugu program Nireekshana and an award-winning weekly Bengali program Samadhan.
CBN has broadcast programs in over 70 languages.
CBN now serves mainly as a production company for The 700 Club, and four other syndicated shows: CBN NewsWatch, Christian World News, 700 Club Interactive and The Brody File, a news-analysis program hosted by political journalist David Brody.
Some of CBN's programs also air on the Trinity Broadcasting Network, Cornerstone Television, FamilyNet, LeSEA Broadcasting Corporation, TCT and Middle East Television, all of which are Evangelical Christian networks. The secular commercial stations that continue to air The 700 Club in syndication (along with Freeform) air CBN's annual telethon during the last week of January.
The Charity Navigator gave CBN a 3-star overall rating, a 3-star financial rating and a 2-star accountability and transparency rating.
History
Beginnings
CBN was founded in 1960 in Portsmouth, Virginia by Pat Robertson, who had recently become a born-again Christian. CBN entered into the broadcasting industry in October 1961, when WYAH-TV in Portsmouth – the group's flagship station – signed on the air. |
https://en.wikipedia.org/wiki/Canberra%20Deep%20Space%20Communication%20Complex | The Canberra Deep Space Communication Complex (CDSCC) is a satellite communication station, part of the Deep Space Network of NASA's Jet Propulsion Laboratory (JPL), located at Tidbinbilla in the Australian Capital Territory. Opened in 1965, the complex was used for tracking the Apollo Lunar Module, and along with its two sister stations at Goldstone, California and Madrid, Spain is now used for tracking and communicating with NASA's spacecraft, particularly interplanetary missions. Its DSS-43 antenna is the only antenna on Earth that can send commands to Voyager 2. It is managed in Australia by the Commonwealth Scientific and Industrial Research Organisation (CSIRO) for NASA’s Space Communications and Navigation program (SCaN) at NASA Headquarters in Washington, D.C.
Location
The complex is located in the Paddys River (a tributary of the Cotter River) valley, about 20 km from Canberra in the Australian Capital Territory. The complex is part of the Deep Space Network run by NASA's Jet Propulsion Laboratory (JPL). It is commonly referred to as the Tidbinbilla Deep Space Tracking Station and was officially opened on 19 March 1965 by then Prime Minister of Australia Sir Robert Menzies.
The station is separated from Canberra by the Murrumbidgee River and, more importantly, the Coolamon Ridge, Urambi Hills, and Bullen Range, which help shield the dishes from the city's radio frequency (RF) noise. Located nearby is the Tidbinbilla Nature Reserve.
Management
The CSIRO manages most of NASA's activities in Australia.
In February 2010 CSIRO took over direct management of the site with the establishment of CASS (CSIRO Astronomy and Space Science). Previous to this CDSCC had been managed by external sub-contractor organisations, such as Raytheon Australia from 2003–2010; BAE Systems (formerly British Aerospace Australia) 1990–2003; AWA Electronic Services -1990.
History
During the mid 1960s NASA built three tracking stations in the Australian Capital Territory.
The Tidbinbilla Tracking Station (now known as CDSCC) was opened in 1965 and is the only NASA tracking station in Australia still in operation. During the Apollo program, Tidbinbilla was used for tracking the Apollo Lunar Module.
The Orroral Valley Tracking Station () was opened in May 1965 in what is now part of Namadgi National Park. Its role was orbiting satellite support, although it also supported the Apollo-Soyuz Test Project in 1975. It was closed in 1985.
Honeysuckle Creek Tracking Station () opened in 1967 and was built primarily to support the Apollo Moon missions, mainly communications with the Apollo Command Module. After the cancellation of the Apollo Project the station supported Skylab until its re-entry in 1979 when the station joined the Deep Space Network in support of the Viking and Voyager projects. 1981 saw the closure of the station and its 26 m antenna was moved to CDSCC to become known as Deep Space Station 46. After the antenna was removed the rest of the facility |
https://en.wikipedia.org/wiki/KCDSA | KCDSA (Korean Certificate-based Digital Signature Algorithm) is a digital signature algorithm created by a team led by the Korea Internet & Security Agency (KISA). It is an ElGamal variant, similar to the Digital Signature Algorithm and GOST R 34.10-94. The standard algorithm is implemented over , but an elliptic curve variant (EC-KCDSA) is also specified.
KCDSA requires a collision-resistant cryptographic hash function that can produce a variable-sized output (from 128 to 256 bits, in 32-bit increments). HAS-160, another Korean standard, is the suggested choice.
Domain parameters
: a large prime such that for .
: a prime factor of such that for .
: a base element of order in .
The revised version of the spec additional requires either that be prime or that all of its prime factors are greater than .
User parameters
: signer's private signature key such that .
: signer's public verification key computed by where .
: a hash-value of Cert Data, i.e., .
The 1998 spec is unclear about the exact format of the "Cert Data". In the revised spec, z is defined as being the bottom B bits of the public key y, where B is the block size of the hash function in bits (typically 512 or 1024). The effect is that the first input block corresponds to y mod 2^B.
: the lower B bits of y.
Hash Function
: a collision resistant hash function with |q|-bit digests.
Signing
To sign a message :
Signer randomly picks an integer and computes
Then computes the first part:
Then computes the second part:
If , the process must be repeated from the start.
The signature is
The specification is vague about how the integer be reinterpreted as a byte string input to hash function. In the example in section C.1 the interpretation is consistent with using the definition of I2OSP from PKCS#1/RFC3447.
Verifying
To verify a signature on a message :
Verifier checks that and and rejects the signature as invalid if not.
Verifier computes
Verifier checks if . If so then the signature is valid; otherwise it is not valid.
EC-KCDSA
EC-KCDSA is essentially the same algorithm using Elliptic-curve cryptography instead of discrete log cryptography.
The domain parameters are:
An elliptic curve over a finite field.
A point in generating a cyclic subgroup of prime order . ( is often denoted in other treatments of elliptic-curve cryptography.)
The user parameters and algorithms are essentially the same as for discrete log KCDSA except that modular exponentiation is replaced by point multiplication. The specific differences are:
The public key is
In signature generation, where
In signature verification, the verifier tests whether
External links
KCDSA specification and analysis
Digital signature schemes
Elliptic curve cryptography
Public-key cryptography
Standards of South Korea |
https://en.wikipedia.org/wiki/HAS-160 | HAS-160 is a cryptographic hash function designed for use with the Korean KCDSA digital signature algorithm. It is derived from SHA-1, with assorted changes intended to increase its security. It produces a 160-bit output.
HAS-160 is used in the same way as SHA-1. First it divides input in blocks of 512 bits each and pads the final block. A digest function updates the intermediate hash value by processing the input blocks in turn.
The message digest algorithm consists of 80 rounds.
External links
HAS-160 specification.
A description of HAS-160, and some test vectors.
RHash, an open source command-line tool capable of calculating HAS-160.
Cryptographic hash functions |
https://en.wikipedia.org/wiki/Wide%20character | A wide character is a computer character datatype that generally has a size greater than the traditional 8-bit character. The increased datatype size allows for the use of larger coded character sets.
History
During the 1960s, mainframe and mini-computer manufacturers began to standardize around the 8-bit byte as their smallest datatype. The 7-bit ASCII character set became the industry standard method for encoding alphanumeric characters for teletype machines and computer terminals. The extra bit was used for parity, to ensure the integrity of data storage and transmission. As a result, the 8-bit byte became the de facto datatype for computer systems storing ASCII characters in memory.
Later, computer manufacturers began to make use of the spare bit to extend the ASCII character set beyond its limited set of English alphabet characters. 8-bit extensions such as IBM code page 37, PETSCII and ISO 8859 became commonplace, offering terminal support for Greek, Cyrillic, and many others. However, such extensions were still limited in that they were region specific and often could not be used in tandem. Special conversion routines had to be used to convert from one character set to another, often resulting in destructive translation when no equivalent character existed in the target set.
In 1989, the International Organization for Standardization began work on the Universal Character Set (UCS), a multilingual character set that could be encoded using either a 16-bit (2-byte) or 32-bit (4-byte) value. These larger values required the use of a datatype larger than 8-bits to store the new character values in memory. Thus the term wide character was used to differentiate them from traditional 8-bit character datatypes.
Relation to UCS and Unicode
A wide character refers to the size of the datatype in memory. It does not state how each value in a character set is defined. Those values are instead defined using character sets, with UCS and Unicode simply being two common character sets that encode more characters than an 8-bit wide numeric value (255 total) would allow.
Relation to multibyte characters
Just as earlier data transmission systems suffered from the lack of an 8-bit clean data path, modern transmission systems often lack support for 16-bit or 32-bit data paths for character data. This has led to character encoding systems such as UTF-8 that can use multiple bytes to encode a value that is too large for a single 8-bit symbol.
The C standard distinguishes between multibyte encodings of characters, which use a fixed or variable number of bytes to represent each character (primarily used in source code and external files), from wide characters, which are run-time representations of characters in single objects (typically, greater than 8 bits).
Size of a wide character
Early adoption of UCS-2 ("Unicode 1.0") led to common use of UTF-16 in a number of platforms, most notably Microsoft Windows, .NET and Java. In these systems, it is com |
https://en.wikipedia.org/wiki/EDIFACT | United Nations/Electronic Data Interchange for Administration, Commerce and Transport (UN/EDIFACT) is an international standard for electronic data interchange (EDI) developed for the United Nations and approved and published by UNECE, the UN Economic Commission for Europe.
In 1987, following the convergence of the UN and US/ANSI syntax proposals, the UN/EDIFACT Syntax Rules were approved as the ISO standard ISO 9735 by the International Organization for Standardization.
The EDIFACT standard provides:
a set of syntax rules to structure data
an interactive exchange protocol (I-EDI)
standard messages which allow multi-country and multi-industry exchange
The work of maintenance and further development of this standard is done through the United Nations Centre for Trade Facilitation and Electronic Business (UN/CEFACT) under the UN Economic Commission for Europe, in the Finance Domain working group UN CEFACT TBG5.
Example
See below for an example of an EDIFACT message used to answer a flight ticket (FRA-JFK-MIA) availability request:
The UNA segment is optional. If present, it specifies the special characters that are to be used to interpret the remainder of the message. There are six characters following UNA in this order:
component data element separator ( in this sample)
data element separator ( in this sample)
decimal mark ( in this sample)
release character ( in this sample)
reserved, must be a space
segment terminator ( in this sample)
With the exception of the decimal mark (see below), the special characters in the sample UNA segment above are also the default values.
The component data element separator and data element separator are the "first level" and "second level" separators of data elements within a message segment. Referring to them as + and : for brevity, the + separates top-level or composite data elements, and : separates second-level data elements nested within composite data elements. Trailing empty (or null) data elements and their leading separators are omitted to reduce message size.
The decimal mark is used to separate the integer from the fractional part of non-integer numbers. The optional nature of the UNA segment and the initial choice of the comma ("") as the default decimal mark provide a source of common confusion. Versions 1 through 3 of the ISO 9735 syntax rules specify the comma as the default; version 4 states that the decimal mark position in the UNA segment is to be ignored and that the comma and the dot ("") may be used indifferently in numeric data values. The UNB segment indicates which version of the syntax rules is in effect.
Release character (analogous to the in regular expressions) is used as a prefix to remove special meaning from the separator, segment termination, and release characters when they are used as plain text ("Escape character" is the equivalent North American term).
Segment terminator indicates the end of a message segment.
Note: The line breaks after each segment |
https://en.wikipedia.org/wiki/Aeronautical%20Fixed%20Telecommunication%20Network | The Aeronautical Fixed Telecommunications Network (AFTN) is a worldwide system of aeronautical fixed circuits provided, as part of the Aeronautical Fixed Service, for the exchange of messages and/or digital data between aeronautical fixed stations having the same or compatible communications characteristics. AFTN comprises aviation entities including: ANS (Air Navigation Services) providers, aviation service providers, airport authorities and government agencies, to name a few. It exchanges vital information for aircraft operations such as distress messages, urgency messages, flight safety messages, meteorological messages, flight regularity messages and aeronautical administrative messages.
Communications infrastructure
The original AFTN infrastructure consisted of landline teleprinter links between the major centers. Some long distance and international links were based on duplex radioteletype transmissions and leased lines. When it upgraded to CIDIN (Common ICAO Data Interchange Network), it was upgraded to X.25 links at much higher data rates. As the Aeronautical Message Handling System (AMHS) comes online over the next decade, it will switch to X.400 links, with either dedicated lines or tunneled through IP.
AFTN Station address format
An AFTN address is an eight-letter-group composed of a four-letter ICAO Location Indicator plus a three-letter-group identifying an organization or service addressed and an additional letter.
The additional letter represents a department, division or process within the organization/function addressed. The letter X is used to complete the address when an explicit identification of the department, division or process is not required.
For instance: LEBBYNYX.
Location Indicator - A four-letter code group formulated in accordance with rules prescribed by ICAO and assigned to the location of an aeronautical fixed station. In the ICAO DOC7910, location indicators that are assigned to locations to which messages can not be addressed over the AFTN are identified by an asterisk(*)
The four-letter Location Indicators are listed in ICAO Doc 7910 — Location Indicators. The three-letter designators are listed in ICAO Doc 8585 — Designators for Aircraft Operating Agencies, Aeronautical Authorities and Services.
Every location (airport or other facility) with a connection to the AFS is assigned a unique four letter code (the aeronautical location indicator) by ICAO. The first letter or two letters indicate the country and the remaining two or three letters the specific location. For instance the letter K is the first letter of the four letter ICAO address location within the continental United States. The first letter for a Canadian aerodrome, or airport address, is C. Southern Europe codes begin with L, and specifically codes in Spain with LE. For example, New York's John F. Kennedy airport is KJFK while Goose Bay Canada's airport is identified as CYYR and Bilbao in Spain as LEBB.
Some irregular four-letter codes |
https://en.wikipedia.org/wiki/Jonas%20Quinn | Jonas Quinn is a fictional character in the Canadian-American television series Stargate SG-1, a science fiction show about a military team exploring the galaxy via a network of alien transportation devices. Played by Corin Nemec, Jonas is introduced in the season 5 episode "Meridian." Jonas fills Daniel Jackson's empty spot on the SG-1 team in season 6 and the beginning of season 7, and last appears in the mid-season 7 episode "Fallout".
Nemec's character replaced Daniel Jackson (portrayed by Michael Shanks) during season 6 after Shanks had left the show amid controversy after season 5. The producers based Jonas' motivation to join Stargate Command on his momentary reluctance to actively prevent Daniel's death, and his feelings of responsibility afterwards. Jonas was slowly integrated into the story in a prolonged transition stage over the first half of season 6. Nemec was open to continue playing Jonas Quinn after season 6, but a new contract was reached with Michael Shanks for Daniel to return in season 7. The role of Jonas was reduced to recurring status in season 7.
Role in Stargate SG-1
Character arc
Jonas Quinn is introduced in the season 5 episode "Meridian" as a scientist of the human nation of Kelowna on Langara, a planet with an industrial level comparable to Earth of the 1940s, and that is also locked in a cold war with two rival states. He is an exceptionally quick learner, which becomes useful in memorizing SG mission reports and earth culture. The Kelownans are experimenting with naqahdriah (an unstable but extremely powerful native element related to naqahdah) to build a bomb against their two rival nations, Terrania and the Andari Federation. Jonas is present when SG-1 team member Daniel Jackson gets radiation-poisoned with naqahdriah in an attempt to prevent a catastrophe in Kelowna, but when the Kelownan leaders respond with indifference to Daniel's imminent death and glee with regards to the destructive power of the naqahdriah, Jonas steals a small amount of naqahdriah and offers it to Earth for more peaceful uses. Still wracked by guilt in the season 6 premiere "Redemption" over his hesitation to step in, Jonas helps Major Samantha Carter find a solution to save Earth from an attack by the Goa'uld Anubis. Although Colonel Jack O'Neill is reluctant to add a new fourth member to SG-1, he allows Jonas to join the team, partly to prevent a Russian from being assigned.
After several missions with SG-1, Jonas is confronted with his past in "Shadow Play" and learns more of the effects of naqahdriah on people. In "Metamorphosis", the Goa'uld Nirrti learns via an Ancient DNA Resequencer that Jonas is different from other humans, but she is killed before this is further investigated. In "Prophecy", Nirrti's experiments cause clairvoyant visions in Jonas, and the doctors remove a potentially lethal tumor from his brain. After SG-1 finds the de-ascended Daniel on another planet in the season 7 premiere "Fallen"/"Homecoming", Jonas a |
https://en.wikipedia.org/wiki/WC3 | WC3 may stand for:
Wing Commander III: Heart of the Tiger, a 1994 space combat simulation computer and video game
Warcraft III: Reign of Chaos, a 2002 real-time strategy computer game
Warcraft III: The Frozen Throne, expansion pack to Reign of Chaos
Warcraft III: Reforged, the remastered of edition for both Warcraft III: Reign of Chaos and The Frozen Throne
A common misspelling of W3C, World Wide Web Consortium
Wayne County Community College District, community college in the Detroit area |
https://en.wikipedia.org/wiki/Visual%20editor | A visual editor is computer software for editing text files using a textual or graphical user interface that normally renders the content (text) in accordance with embedded markup code, e.g., HTML, Wikitext, rather than displaying the raw text. Edits made to the page appear in real time, correctly formatted, and are often referred to as WYSIWYG (What You See Is What You Get). It is common for the software to permit switching to source-code editor mode so that the original source code can be viewed or modified.
By definition, all visual editors require a re-fresh-able display device. However, some editors using such devices, e.g., BRIEF, ISPF, gVim, KEDIT, THE, XEDIT, are not visual editors.
See also
WYSIWYG
Notes
References |
https://en.wikipedia.org/wiki/Occurs%20check | In computer science, the occurs check is a part of algorithms for syntactic unification. It causes unification of a variable V and a structure S to fail if S contains V.
Application in theorem proving
In theorem proving, unification without the occurs check can lead to unsound inference. For example, the Prolog goal
will succeed, binding X to a cyclic structure which has no counterpart in the Herbrand universe.
As another example,
without occurs-check, a resolution proof can be found for the non-theorem
: the negation of that formula has the conjunctive normal form , with and denoting the Skolem function for the first and second existential quantifier, respectively; the literals and are unifiable without occurs check, producing the refuting empty clause.
Rational tree unification
Prolog implementations usually omit the occurs check for reasons of efficiency, which can lead to circular data structures and looping.
By not performing the occurs check, the worst case complexity of unifying a term
with term
is reduced in many cases from
to
;
in the particular, frequent case of variable-term unifications, runtime shrinks to
.
Modern implementations, based on Colmerauer's Prolog II,
use rational tree unification to avoid looping. However it is difficult to keep the complexity time linear in the presence of cyclic terms. Examples where Colmerauers algorithm becomes quadratic can be readily constructed, but refinement proposals exist.
See image for an example run of the unification algorithm given in Unification (computer science)#A unification algorithm, trying to solve the goal , however without the occurs check rule (named "check" there); applying rule "eliminate" instead leads to a cyclic graph (i.e. an infinite term) in the last step.
Sound unification
ISO Prolog implementations have the built-in predicate unify_with_occurs_check/2 for sound unification but are free to use unsound or even looping algorithms when unification is invoked otherwise, provided the algorithm works correctly for all cases that are "not subject to occurs-check" (NSTO). The built-in acyclic_term/1 serves to check the finiteness of terms.
Implementations offering sound unification for all unifications are Qu-Prolog and Strawberry Prolog and (optionally, via a runtime flag): XSB, SWI-Prolog, Tau Prolog, Trealla Prolog and Scryer Prolog. A variety
of optimizations can render sound unification feasible for common cases.
See also
Notes
References
Automated theorem proving
Logic programming
Programming constructs
Unification (computer science) |
https://en.wikipedia.org/wiki/Oaklisp | Oaklisp is a portable object-oriented Scheme developed by Kevin J. Lang and Barak A. Pearlmutter while Computer Science PhD students at Carnegie Mellon University. Oaklisp uses a superset of Scheme syntax. It is based on generic operations rather than functions, and features anonymous classes, multiple inheritance, a strong error system, setters and locators for operations, and a facility for dynamic binding.
Version 1.2 includes an interface, bytecode compiler, run-time system and documentation.
References
External links
Oaklisp homepage
Scheme (programming language) implementations
Object-oriented programming languages |
https://en.wikipedia.org/wiki/OBJ%20%28programming%20language%29 | OBJ is a programming language family introduced by Joseph Goguen in 1976, and further worked on by Jose Meseguer.
Overview
It is a family of declarative "ultra high-level" languages. It features abstract types, generic modules, subsorts (subtypes with multiple inheritance), pattern-matching modulo equations, E-strategies (user control over laziness), module expressions (for combining modules), theories and views (for describing module interfaces) for the massively parallel RRM (rewrite rule machine).
Members of the OBJ family of languages include CafeOBJ, Eqlog, FOOPS, Kumo, Maude, OBJ2, and OBJ3.
OBJ2
OBJ2 is a programming language with Clear-like parametrised modules and a functional system based on equations.
OBJ3
OBJ3 is a version of OBJ based on order-sorted rewriting. OBJ3 is agent-oriented and runs on Kyoto Common Lisp AKCL.
See also
Automated theorem proving
Comparison of programming languages
Formal methods
References
J. A. Goguen, Higher-Order Functions Considered Unnecessary for Higher-Order Programming. In Research Topics in Functional Programming (June 1990). pp. 309–351.
"Principles of OBJ2", K. Futatsugi et al., 12th POPL, ACM 1985, pp. 52–66.
External links
The OBJ archive
The OBJ family
Information and OBJ3 manual, PostScript format
Academic programming languages
Functional languages
Logic in computer science
Formal specification languages
Theorem proving software systems
Term-rewriting programming languages |
https://en.wikipedia.org/wiki/Object%20Data%20Management%20Group | The Object Data Management Group (ODMG) was conceived in the summer of 1991 at a breakfast with object database vendors that was organized by Rick Cattell of Sun Microsystems. In 1998, the ODMG changed its name from the Object Database Management Group to reflect the expansion of its efforts to include specifications for both object database and object–relational mapping products.
The primary goal of the ODMG was to put forward a set of specifications that allowed a developer to write portable applications for object database and object–relational mapping products. In order to do that, the data schema, programming language bindings, and data manipulation and query languages needed to be portable.
Between 1993 and 2001, the ODMG published five revisions to its specification. The last revision was ODMG version 3.0, after which the group disbanded.
Major components of the ODMG 3.0 specification
Object Model. This was based on the Object Management Group's Object Model. The OMG core model was designed to be a common denominator for object request brokers, object database systems, object programming languages, etc. The ODMG designed a profile by adding components to the OMG core object model.
Object Specification Languages. The ODMG Object Definition Language (ODL) was used to define the object types that conform to the ODMG Object Model. The ODMG Object Interchange Format (OIF) was used to dump and load the current state to or from a file or set of files.
Object Query Language (OQL). The ODMG OQL was a declarative (nonprocedural) language for query and updating. It used SQL as a basis, where possible, though OQL supports more powerful object-oriented capabilities.
C++ Language Binding. This defined a C++ binding of the ODMG ODL and a C++ Object Manipulation Language (OML). The C++ ODL was expressed as a library that provides classes and functions to implement the concepts defined in the ODMG Object Model. The C++ OML syntax and semantics are those of standard C++ in the context of the standard class library. The C++ binding also provided a mechanism to invoke OQL.
Smalltalk Language Binding. This defined the mapping between the ODMG ODL and Smalltalk, which was based on the OMG Smalltalk binding for the OMG Interface Definition Language (IDL). The Smalltalk binding also provided a mechanism to invoke OQL.
Java Language Binding. This defined the binding between the ODMG ODL and the Java programming language as defined by the Java 2 Platform. The Java binding also provided a mechanism to invoke OQL.
Status
ODMG 3.0 was published in book form in 2000. By 2001, most of the major object database and object-relational mapping vendors claimed conformance to the ODMG Java Language Binding. Compliance to the other components of the specification was mixed. In 2001, the ODMG Java Language Binding was submitted to the Java Community Process as a basis for the Java Data Objects specification. The ODMG member companies then decided to concentrate their eff |
https://en.wikipedia.org/wiki/Object%20identifier | In computing, object identifiers or OIDs are an identifier mechanism standardized by the International Telecommunication Union (ITU) and ISO/IEC for naming any object, concept, or "thing" with a globally unambiguous persistent name.
Syntax and lexicon
An OID corresponds to a node in the "OID tree" or hierarchy, which is formally defined using the ITU's OID standard, X.660. The root of the tree contains the following three arcs:
0: ITU-T
1: ISO
2: joint-iso-itu-t
Each node in the tree is represented by a series of integers separated by periods, corresponding to the path from the root through the series of ancestor nodes, to the node. Thus, an OID denoting Intel Corporation appears as follows,
1.3.6.1.4.1.343
and corresponds to the following path through the OID tree:
1 ISO
1.3 identified-organization,
1.3.6 DoD,
1.3.6.1 internet,
1.3.6.1.4 private,
1.3.6.1.4.1 IANA enterprise numbers,
1.3.6.1.4.1.343 Intel Corporation
A textual representation of the OID paths is also commonly seen; for example,
iso.identified-organization.dod.internet.private.enterprise.intel
Each node in the tree is controlled by an assigning authority, which may define child nodes under the node and delegate assigning authority for the child nodes. Continuing with the example, the node numbers under root node "1" are assigned by ISO; the nodes under "1.3.6" are assigned by the US Department of Defense; the nodes under "1.3.6.1.4.1" are assigned by IANA; the nodes under "1.3.6.1.4.1.343" are assigned by Intel Corporation, and so forth.
Usage
In computer security, OIDs serve to name almost every object type in X.509 certificates, such as components of Distinguished Names, CPSs, etc.
Within X.500 and LDAP schemas and protocols, OIDs uniquely name each attribute type and object class, and other elements of schema.
In Simple Network Management Protocol (SNMP), each node in a management information base (MIB) is identified by an OID.
IANA assigns Private Enterprise Numbers (PEN) to companies and other organizations under the 1.3.6.1.4.1 node. OIDs down-tree from these are among the most commonly seen; for example, within SNMP MIBs, as LDAP attributes, and as vendor suboptions in the Dynamic Host Configuration Protocol (DHCP).
In the United States, Health Level Seven (HL7), a standards-developing organization in the area of electronic health care data exchange, is the assigning authority at the 2.16.840.1.113883 (joint-iso-itu-t.country.us.organization.hl7) node. HL7 maintains its own OID registry, and as of December 1, 2020 it contained almost 20,000 nodes, most of them under the HL7 root.
DICOM uses OIDs.
The Centers for Disease Control and Prevention uses OIDs to manage the many complex values sets or "vocabularies" used in the Public Health Information Network (PHIN) Vocabulary Access and Distribution System (VADS).
See also
Digital object identifier
Extended Validation Certificate
International Geo Sample Number
LSID
Persistent Object Id |
https://en.wikipedia.org/wiki/Object%20Lisp | Object Lisp was a computer programming language, a dialect of the Lisp language. It was an object-oriented extension for the Lisp dialect Lisp Machine Lisp, designed by Lisp Machines, Inc. Object Lisp was also an early example of prototype-based programming.
It was seen as a competitor to other object-oriented extensions to Lisp at around the same time such as Flavors, in use by Symbolics, Common Objects developed by Hewlett-Packard, and CommonLoops, in use by Xerox.
Object Lisp was also used in early versions of Macintosh Common Lisp. There, the user interface toolkit was written using Object Lisp.
References
14 December 1985 net.lang.lisp USENET post about the Common Lisp meeting in Boston, 9-11 December 1985, which discusses Object Lisp
"ObjectLISP User Manual", G. Drescher, LMI 1985
Object-oriented programming languages
Lisp programming language family |
https://en.wikipedia.org/wiki/Object%20Oberon | Object Oberon is a programming language which is based on the language Oberon with features for object-oriented programming. Oberon-2 was essentially a redesign of Object Oberon.
References
Modula programming language family
Oberon programming language family
Object-oriented programming languages |
https://en.wikipedia.org/wiki/Object-Oriented%20Fortran | Object-Oriented Fortran is an object-oriented extension of Fortran, in which data items can be grouped into objects, which can be instantiated and executed in parallel.
It was available for Sun, Iris, iPSC, and nCUBE, but is no longer supported.
Fortran programming language family |
https://en.wikipedia.org/wiki/Le%20Lisp | Le Lisp (also Le_Lisp and Le-Lisp) is a programming language, a dialect of the language Lisp.
Programming language
It was developed at the French Institute for Research in Computer Science and Automation (INRIA), to be an implementation language for a very large scale integration (VLSI) workstation being designed under the direction of Jean Vuillemin. Le Lisp also had to run on various incompatible platforms (mostly running Unix operating systems) that were used by the project. The main goals for the language were to be a powerful post-Maclisp version of Lisp that would be portable, compatible, extensible, and efficient.
Jérôme Chailloux led the Le Lisp team, working with Emmanuel St. James, Matthieu Devin, and Jean-Marie Hullot in 1980. The dialect is historically noteworthy as one of the first Lisp implementations to be available on both the Apple II and the IBM PC.
On 2020-01-08, INRIA agreed to migrate the source code to the 2-clause BSD License which allowed few native ports from ILOG and Eligis to adopt this license model.
References
External links
, Eligis, for x86 processors
Le Lisp at Computer History Museum's Software Preservation Group
Le-Lisp Open Source repository on GitHub
Lisp programming language family
Lisp (programming language) |
https://en.wikipedia.org/wiki/QUIKTRAN | QUIKTRAN is a Fortran-like, interactive computer programming language with debugging facilities.
More than a Fortran-based programming language, QUIKTRAN was IBM's first entry in on-line Time Sharing in the 1960s. It ran on an IBM 7040/7044, using an IBM 7740 as a dial up communications processor. In 1967 an IBM data center supported over 400 commercial customers in a time-sharing environment; users could dial up and log into the Quiktran system. They could store their own Fortran programs in private libraries for later execution, or execute numerous IBM-supplied programs for applications including linear programming, communication network design, and business programs. The system on the receiving end allowed teletype or typewriter keyboards using data phones or acoustic modems to connect. It could support approximately 50 simultaneous users, The hardware used was an IBM 1301 40-platter disk for storage, and an IBM 7320 Magnetic Drum for program swapping. The QUIKTRAN system was superseded by Call/360. Quiktran and Call/360 were supported by Service Bureau Corp., a wholly owned subsidiary of IBM. SBC was later sold to Minneapolis-based company (Control Data Corporation).
Source: Burt McGregor
References
Sammet 1969, p.226.
External links
History of Programming Languages: QUIKTRAN
Fortran programming language family
Procedural programming languages
Programming languages created in 1964 |
https://en.wikipedia.org/wiki/PROMAL | PROMAL (PROgrammer's Microapplication Language) is a structured programming language from Systems Management Associates for MS-DOS, Commodore 64, and Apple II. PROMAL features simple syntax, no line numbers, long variable names, functions and procedures with argument passing, real number type, arrays, strings, pointer, and a built-in I/O library. Like ABC and Python, indentation is part of the language syntax.
The language uses a single-pass compiler to generate byte code that is interpreted when the program is run. The compiler can compile to/from disk and memory. The software package for C64 includes a full-screen editor and command shell.
Reception
Ahoy! called PROMAL for the Commodore 64 "one of the best" structured languages. It concluded "As an introduction to structured programming languages and as an alternative to BASIC, PROMAL is well worth the time needed to learn it and the $49.95 to purchase it".
Example code
From the PROMAL program disk:
PROGRAM SIEVE
; Sieve of Eratosthenes Benchmark
; test (BYTE magazine)
; 10 iterations, 1800 element array.
INCLUDE LIBRARY
CON SIZE=1800
WORD I
WORD J
WORD PRIME
WORD K
WORD COUNT
BYTE FLAGS[SIZE]
BEGIN
OUTPUT "10 ITERATIONS"
FOR J= 1 TO 10
COUNT=0
FILL FLAGS, SIZE, TRUE
FOR I= 0 TO SIZE
IF FLAGS[I]
PRIME=I+I+3
K=I+PRIME
WHILE K <= SIZE
FLAGS[K]=FALSE
K=K+PRIME
COUNT=COUNT+1
OUTPUT "#C#I PRIMES", COUNT
END
References
Computer Language, Mar 1986, pp. 128–134
External links
PROMAL for the Commodore 64
PROMAL - Trademark Details
C programming language family |
https://en.wikipedia.org/wiki/C%2A | C* (or C-star) is a data-parallel superset of ANSI C with synchronous semantics.
History
It was developed in 1987 as an alternative language to *Lisp and CM-Fortran for the Connection Machine CM-2 and above. The language C* adds to C a "domain" data type and a selection statement for parallel execution in domains.
For the CM-2 models the C* compiler translated the code into serial C, calling PARIS (Parallel Instruction Set) functions, and passed the resulting code to the front end computer's native compiler. The resulting executables were executed on the front end computer with PARIS calls being executed on the Connection Machine.
On the CM-5 and CM-5E parallel C* Code was executed in a SIMD style fashion on processing elements, whereas serial code was executed on the PM (Partition Manager) Node, with the PM acting as a "front end" if directly compared to a CM-2.
The latest version of C* as of 27 August 1993 is 6.x.
An unimplemented language dubbed "Parallel C" (not to be confused with Unified Parallel C) influenced the design of C*. Dataparallel-C was based on C*.
References
General
C*: An Extended C Language for Data Parallel Programming, John R. Rose and Guy L. Steele, Jr., in Proceedings of the Second International Conference on Supercomputing, vol. II, L. P. Kartashev et al. eds, May 1987, pp 2–16.
C* User Guide, Thinking Machines Corporation, 1991
C* Programming Manual, Thinking Machines Corporation, 1993.
The Art of Parallel Programming (2nd Ed.), B. P. Lester, 1st World Publishing, 2006. (A downloadable version of the "C* Compiler and Parallel Computer Simulation System" is available at the publisher's Web site.)
C*, Guy L. Steele, Jr., in Encyclopedia of Parallel Computing, D. Padua, ed., Springer, 2011, pp 207–212.
Concurrent programming languages |
https://en.wikipedia.org/wiki/Dataparallel-C | Dataparallel-C: C with parallel extensions by Hatcher and Quinn of the University of New Hampshire. Dataparallel-C was based on an early version of C* and runs on the Intel iPSC/2 and nCUBE.
C programming language family |
https://en.wikipedia.org/wiki/CAD/CAM | CAD/CAM refers to the integration of Computer-aided design (CAD) and Computer-aided manufacturing (CAM). Both of these require powerful computers. CAD software helps designers and draftsmen; CAM "reduces manpower costs" in the manufacturing process.
Overview
Both CAD and CAM are computer-intensive. Although, in 1981, Computervision was #1 and IBM was #2, IBM had a major advantage: its systems could accommodate "eight to 20" users at a time, whereas most competitors only had enough power to accommodate "four to six." CAD/CAM was described by The New York Times as a "computerized design and manufacturing process" that made its debut "when Computervision pioneered it in the 1970's."
Other 1980s major players in CAD/CAM included General Electric and Parametric Technology Corporation; the latter subsequently acquired Computervision, which had been acquired by Prime Computer.
CAD/CAM originated in the 1960s; an IBM 360/44 was used to build via CNC the wings of an airplane.
Computer-aided design (CAD)
One goal of CAD is to allow quicker iterations in the design process; another is to enable smoothly transitioning to the CAM stage. Although manually created drawings historically facilitated "a designer's goal of displaying an idea," it did not result in a machine-readable result that could be modified
and subsequently be used to directly build a prototype. It can also be used to "ensure that all the separate parts of a product will fit together as intended."
CAD, when linked with simulation, can also enable bypassing building a less than satisfactory test version, resulting in having "dispensed with the costly, time-consuming task of building a prototype."<ref
Computer-aided manufacturing (CAM)
In Computer-aided manufacturing (CAM), using computerized specifications, a computer directs machines such as lathes and milling machines to perform work that otherwise would be controlled by a lathe or milling machine operator. This process, which is called Numerical Control (NC OR CNC), is what came to be known as 20th century Computer-aided manufacturing (CAM), and it originated in the 1960s. Early 21st century CAM introduced use of 3D printers.
CAM, although it requires initial expenditures for equipment, covers this outlay with reduced labor cost and speedy transition from
CAD to finished product, especially when the result is both timely and "ensuring one-time machining success rate."
See also
Computer-aided technologies
CAD/CAM dentistry
CAD/CAM in the footwear industry
References
Computer-aided design
Computer-aided manufacturing
Computer-aided engineering |
https://en.wikipedia.org/wiki/Call-with-current-continuation | In the Scheme computer programming language, the procedure call-with-current-continuation, abbreviated call/cc, is used as a control flow operator. It has been adopted by several other programming languages.
Taking a function f as its only argument, (call/cc f) within an expression is applied to the current continuation of the expression.
For example ((call/cc f) e2) is equivalent to applying f to the current continuation of the expression. The current continuation is given by replacing (call/cc f) by a variable c bound by a lambda abstraction, so the current continuation is (lambda (c) (c e2)). Applying the function f to it gives the final result (f (lambda (c) (c e2))).
As a complementary example, in an expression (e1 (call/cc f)), the continuation for the sub-expression (call/cc f) is (lambda (c) (e1 c)), so the whole expression is equivalent to (f (lambda (c) (e1 c))).
In other words it takes a "snapshot" of the current control context or control state of the program as an object and applies f to it.
The continuation object is a first-class value and is represented as a function, with function application as its only operation. When a continuation object is applied to an argument, the existing continuation is eliminated and the applied continuation is restored in its place, so that the program flow will continue at the point at which the continuation was captured and the argument of the continuation then becomes the "return value" of the call/cc invocation. Continuations created with call/cc may be called more than once, and even from outside the dynamic extent of the call/cc application.
In computer science, making this type of implicit program state visible as an object is termed reification. (Scheme does not syntactically distinguish between applying continuations or functions.)
With call/cc a variety of complex control operators can be implemented from other languages via a few lines of code, e.g., McCarthy's amb operator for nondeterministic choice, Prolog-style backtracking, Simula 67-style coroutines and generalizations thereof, Icon-style generators, or engines and threads or even the obscure COMEFROM.
Examples
As shown by the next example, call/cc can be used to emulate the function of the return statement known from C-style languages, which is missing from Scheme:
(define (f return)
(return 2)
3)
(f (lambda (x) x))
=> 3
(call-with-current-continuation f)
=> 2
Calling f with a regular function argument first applies this function to the value 2, then returns 3. However, when f is passed to call/cc (as in the last line of the example), applying the parameter (the continuation) to 2 forces execution of the program to jump to the point where call/cc was called, a |
https://en.wikipedia.org/wiki/Ada%20Programming%20Support%20Environment | Ada Programming Support Environment or APSE, was a specification for a programming environment to support software development in the Ada programming language. This represented the second stage of the U.S. military Ada project; once the language was implemented, it was felt necessary to specify and implement a standard set of tools, hence the APSE. CAIS-A, Common APSE Interface Set A, was defined in MIL STD-1838A.
CAIS defines a set of Ada APIs to enable portability of development tools across operating systems. As of 1988, CAIS implementations were developed for Unix, VMS and IBM MVS.
References
Further reading
International Requirements and Design Criteria for the Portable Common Interface Set (1992-05-01)
DoD Requirements and Design Criteria for the Common APSE Interface Set (CAIS) (July 1987)
Ada (programming language) |
https://en.wikipedia.org/wiki/Cairo%20%28operating%20system%29 | Cairo was the codename for a project at Microsoft from 1991 to 1996. Its charter was to build technologies for a next-generation operating system that would fulfill Bill Gates's vision of "information at your fingertips." Cairo never shipped, although portions of its technologies have since appeared in other products.
Overview
Cairo was announced at the 1991 Microsoft Professional Developers Conference by Jim Allchin. It was demonstrated publicly (including a demo system for all attendees to use) at the 1993 Cairo/Win95 PDC. Microsoft changed stance on Cairo several times, sometimes calling it a product, other times referring to it as a collection of technologies.
Features
Cairo used distributed computing concepts to make information available quickly and seamlessly across a worldwide network of computers.
The Windows 95 user interface was based on the initial design work that was done on the Cairo user interface. DCE/RPC shipped in Windows NT 3.1. Content Indexing is now a part of Internet Information Server and Windows Desktop Search.
The remaining component is the object file system. It was once planned to be implemented in the form of WinFS as part of Windows Vista but development was cancelled in June 2006, with some of its technologies merged into other Microsoft products such as Microsoft SQL Server 2008, also known under the codename "Katmai".
See also
History of Microsoft Windows
List of Microsoft codenames
References
Notes
Distributed operating systems
Microsoft Windows
Microsoft operating systems
Object-oriented operating systems
Uncompleted Microsoft initiatives |
https://en.wikipedia.org/wiki/N.Y.P.D.%20%28TV%20series%29 | N.Y.P.D. was a half-hour American police crime drama set in the context of the New York City Police Department. The program appeared on the ABC network during the 1967–1968 and 1968–1969 United States network television schedules, running in the evening during the 9:30 p.m. time slot. During the second season, N.Y.P.D was joined by The Mod Squad and It Takes a Thief to form a 2½ hour block of crime dramas.
Plot
N.Y.P.D. centers around three New York police detectives – Lt. Mike Haines (Jack Warden), Detective Jeff Ward (Robert Hooks), and Detective Johnny Corso (Frank Converse) – who fight a wide range of crimes and criminals. The show features many real New York City locations, as well as episodes based on actual New York City police cases.
Cast
Jack Warden as Lt. Mike Haines
Robert Hooks as Det. Jeff Ward
Frank Converse as Det. Johnny Corso
Ted Beniades as Det. Richie
Denise Nicholas as Ethel
Tom Rosqui as Det. Jacobs
Production
Development
The show was a production of Talent Associates, Ltd., a company founded by Alfred Levy and David Susskind. Talent Associates had produced 14 years of the anthology program Armstrong Circle Theatre and The Kaiser Aluminum Hour, both highly respected shows. Television producer, movie producer, and talk show host Susskind created N.Y.P.D. with screenwriter Arnold Perl (Cotton Comes to Harlem).
At the time of his death in 1971, Arnold Perl was working on a screenplay about assassinated black activist Malcolm X, which would later become the basis for Spike Lee's 1992 film, Malcolm X. Daniel Melnick, the show's executive producer, was a partner with Susskind in Talent Associates and had brought Mel Brooks and Buck Henry together to create the TV comedy Get Smart in 1965. Producer Susskind and actor Harvey Keitel would work together again on Martin Scorsese's Alice Doesn't Live Here Anymore (1974). Scripted by writers like Lonne Elder, who would later be the first African-American nominated for a Best Screenplay Oscar (for 1972's Sounder), the stories came with such titles as "Cruise to Oblivion," "Which Side Are You On?," "The Screaming Woman," and "Deadly Circle of Violence."
In N.Y.P.D. scripts, there were white cops and black cops, white suspects and black suspects, white witnesses and black witnesses, an unselfconscious racial blend that would not otherwise be seen for several years on U.S. network television (Room 222 and Hawaii Five-O were among the next series to feature casts situated similarly.)
Casting
Among the actors who appeared in the series were
Al Pacino S2E5 "Deadly Circle of Violence"
Martin Sheen S2E8 "The Peep Freak"
Jon Voight S1E14 "The Bombers"
Harvey Keitel S2E6 The Shady Lady
Jane Alexander S2E14 The Night Watch
Roy Scheider S2E19 Who's Got the Bundle?
Sam Waterston S2E23 No Day Trippers Need Apply
Charles Grodin S1E6 Money Man
Howard Da Silva S1E7 Old Gangsters Never Die
Murray Hamilton S1E24 The Private Eye Puzzle
Charles Durning S2E1 Naked in the Streets
Ro |
https://en.wikipedia.org/wiki/Link%20encryption | Link encryption is an approach to communications security that encrypts and decrypts all network traffic at each network routing point (e.g. network switch, or node through which it passes) until arrival at its final destination. This repeated decryption and encryption is necessary to allow the routing information contained in each transmission to be read and employed further to direct the transmission toward its destination, before which it is re-encrypted. This contrasts with end-to-end encryption where internal information, but not the header/routing information, is encrypted by the sender at the point of origin and only decrypted by the intended recipient.
Link encryption offers two main advantages:
encryption is automatic so there is less opportunity for human error.
if the communications link operates continuously and carries an unvarying level of traffic, link encryption defeats traffic analysis.
On the other hand, end-to-end encryption ensures only the intended recipient has access to the plaintext.
Link encryption can be used with end-to-end systems by superencrypting the messages.
Bulk encryption refers to encrypting a large number of circuits at once, after they have been multiplexed.
References
Cryptography |
https://en.wikipedia.org/wiki/Kosmos%20212 | Kosmos 212 ( meaning Cosmos 212) was one of a series of Soviet Soyuz programme test spacecraft whose purpose was to further test and develop the passenger version. Scientific data and measurements were relayed to earth by multichannel telemetry systems equipped with space-borne memory units. Kosmos 212 and Kosmos 213 automatically docked in orbit on 15 April 1968. Both spacecraft landed on Soviet territory.
Mission
On 14 April 1968 at 10:00:00 GMT, the Soyuz 11A511 s/n Ya15000-09 booster and Kosmos 212 were set up at Site 31/6 of Baikonur Cosmodrome and the planned mission could be carried out. Kosmos 212 was operated in a low Earth orbit, it had a perigee of , an apogee of , an inclination of 51.7°, and an orbital period of 88.75 minutes, and had a mass of .
Number of orbits: ~80
References
Soyuz uncrewed test flights
Kosmos satellites
1968 in the Soviet Union
Spacecraft launched in 1968 |
https://en.wikipedia.org/wiki/Code%20injection | Code injection is the exploitation of a computer bug that is caused by processing invalid data. The injection is used by an attacker to introduce (or "inject") code into a vulnerable computer program and change the course of execution. The result of successful code injection can be disastrous, for example, by allowing computer viruses or computer worms to propagate.
Code injection vulnerabilities occur when an application sends untrusted data to an interpreter. Injection flaws are most often found in SQL, LDAP, XPath, NoSQL queries, OS commands, XML parsers, SMTP headers, program arguments, etc. Injection flaws tend to be easier to discover when examining source code than via testing. Scanners and fuzzers can help find injection flaws.
Injection can result in data loss or corruption, lack of accountability, or denial of access. Injection can sometimes lead to complete host takeover.
Certain types of code injection are errors in interpretation, giving special meaning to user input. Similar interpretation errors exist outside the world of computer science such as the comedy routine Who's on First?. In the routine, there is a failure to distinguish proper names from regular words. Likewise, in some types of code injection, there is a failure to distinguish user input from system commands.
Code injection techniques are popular in system hacking or cracking to gain information, privilege escalation or unauthorized access to a system. Code injection can be used malevolently for many purposes, including:
Arbitrarily modifying values in a database through SQL injection. The impact of this can range from website defacement to serious compromise of sensitive data.
Installing malware or executing malevolent code on a server by injecting server scripting code (such as PHP or ASP).
Privilege escalation to root permissions by exploiting Shell Injection vulnerabilities in a setuid root binary on UNIX, or Local System by exploiting a service on Microsoft Windows.
Attacking web users with HTML/script injection (Cross-site scripting).
Code Injection attacks in Internet of Things could also lead to severe consequences like data breaches and service disruption.
In 2008, 5.66% of all vulnerabilities reported that year were classified as Code Injection, the highest year on record. In 2015, this had decreased to 0.77%.
Benign and unintentional use
Code injection may be used with good intentions; for example, changing or tweaking the behavior of a program or system through code injection can cause the system to behave in a certain way without any malicious intent. Code injection could, for example:
Introduce a useful new column that did not appear in the original design of a search results page.
Offer a new way to filter, order, or group data by using a field not exposed in the default functions of the original design.
As regards programs like Dropbox, add special parts that could be used to connect to online resources in an offline program.
Utilize the Li |
https://en.wikipedia.org/wiki/Kosmos%20213 | Kosmos 213 ( meaning Cosmos 213) was one of a series of Soviet Soyuz programme test spacecraft whose purpose was to further test and develop the passenger version. Scientific data and measurements were relayed to earth by multichannel telemetry systems equipped with space-borne memory units. Kosmos 212 and Kosmos 213 automatically docked in orbit on April 15, 1968. Both spacecraft landed on Soviet territory.
Mission
On 15 April 1968 at 09:34:18 GMT, the Soyuz 11A511 s/n U15000-06 booster and Kosmos 213 were set up at Site 1/5 of Baikonur Cosmodrome and the planned mission could be carried out. Kosmos 213 was operated in a low Earth orbit, it had a perigee of , an apogee of , an inclination of 51.4°, and an orbital period of 89.16 minutes, and had a mass of .
References
Soyuz uncrewed test flights
Kosmos satellites
1968 in the Soviet Union
Spacecraft launched in 1968 |
https://en.wikipedia.org/wiki/TPS%20report | A TPS report ("test procedure specification") is a document used by a quality assurance group or individual, particularly in software engineering, that describes the testing procedures and the testing process.
Definition
The official definition and creation is provided by the Institute of Electrical and Electronics Engineers (IEEE) as follows:
In popular culture
Office Space
Its use in popular culture increased after the comedic 1999 film Office Space. In the movie, multiple managers and coworkers inquire about an error that protagonist Peter Gibbons (played by Ron Livingston) makes in omitting a cover sheet to send with his "TPS reports". It is used by Gibbons as an example that he has eight different bosses to whom he directly reports. According to the film's writer and director Mike Judge, the abbreviation stood for "Test Program Set" in the movie.
After Office Space, "TPS report" has come to connote pointless, mindless paperwork, and an example of "literacy practices" in the work environment that are "meaningless exercises imposed upon employees by an inept and uncaring management" and "relentlessly mundane and enervating".
Other references and allusions
In King of the Hill (also produced by Mike Judge), Kahn is being chewed out, then remarks to his boss "No sir, I filed my TPS report yesterday."
The 2015 puzzle video game Please, Don't Touch Anything featured the question "What is a TPS Report?" as one of many hidden clues that lead to a unique ending.
In Lost season 1, episode 4, John Locke's boss says "Locke, I told you I need those TPS reports done by noon today."
In Ralph Breaks the Internet, a TPS report is visibly hanging in one of the cubicles seen during Ralph's viral video montage. However, it was incorrectly placed in a cubicle in the accounting department, where TPS reports are not functionally relevant.
In Borderlands 2, a legendary weapon is named the "Actualizer" with a flavor text description of "We need to talk about your DPS reports", parodying the corporate term by replacing it with the common gaming abbreviation for "Damage Per Second".
In The Mandalorian, TPS reports are mentioned in the episode "Chapter 15: The Believer" as work to do by the character Migs Mayfeld when attempting to avoid an imperial officer, in a reference to Office Space.
The TV series The Family Man features a scene in series 2, episode 1 in which the manager of the protagonist asks him to "start thinking about your TPS reports!", in amongst other apparent references to Office Space.
In the NCIS episode "Starting Over", Gary Cole's Agent Parker mentions his least favorite paperwork being TPS reports. When McGee corrects him telling him they're "TBS reports", he says, "Ah, old habits, weird", then takes a sip of coffee, paying homage to his Office Space character, Bill Lumbergh.
In Season 4, Episode 10 ("High") of Rescue Me, Janet Gavin starts a new job and hands off a TPS report at the beginning of the scene.
In the Terry Tate: Office Lineba |
https://en.wikipedia.org/wiki/WABC | WABC may refer to:
New York broadcasters
WABC (AM), a radio station (770 AM)
WABC-TV, the flagship station of the ABC television network (channel 7)
Former callsigns
WPLJ, a radio station (95.5 FM), which formerly used the call sign WABC-FM
WCBS (AM), a radio station (880 AM), which formerly used the WABC call sign
Other broadcasters
Classic Gold WABC, a defunct British radio station |
https://en.wikipedia.org/wiki/Terminal%20%28macOS%29 | Terminal (Terminal.app) is the terminal emulator included in the macOS operating system by Apple. Terminal originated in NeXTSTEP and OPENSTEP, the predecessor operating systems of macOS.
As a terminal emulator, the application provides text-based access to the operating system, in contrast to the mostly graphical nature of the user experience of macOS, by providing a command-line interface to the operating system when used in conjunction with a Unix shell, such as zsh (the default shell since macOS Catalina). The user can choose other shells available with macOS, such as the KornShell, tcsh, and bash.
The preferences dialog for Terminal.app in OS X 10.8 (Mountain Lion) and later offers choices for values of the TERM environment variable. Available options are ansi, dtterm, nsterm, rxvt, vt52, vt100, vt102, xterm, xterm-16color and xterm-256color, which differ from the OS X 10.5 (Leopard) choices by dropping the xterm-color and adding xterm-16color and xterm-256color. These settings do not alter the operation of Terminal, and the xterm settings do not match the behavior of xterm.
Terminal includes several features that specifically access macOS APIs and features. These include the ability to use the standard macOS Help search function to find manual pages and integration with Spotlight. Terminal was used by Apple as a showcase for macOS graphics APIs in early advertising of Mac OS X, offering a range of custom font and coloring options, including transparent backgrounds.
See also
List of terminal emulators
References
Utilities for macOS
Terminal emulators |
https://en.wikipedia.org/wiki/Robert%20Everett | Robert Everett may refer to:
Fats Everett (Robert Ashton Everett, 1915–1969), U.S. Representative from Tennessee
Robert Everett (computer scientist) (1921–2018), American computer scientist
Robert W. H. Everett (1901–1942), British World War 2 naval pilot and Grand National winner
Robert W. Everett (1839–1915), U.S. Representative from Georgia
Robert Lacey Everett (1833–1916), English farmer and Liberal politician
Terry Everett (Robert Terry Everett, born 1937), U.S. Representative from Alabama
Robert Everett (minister) (1791–1875), a leader of the Welsh-speaking abolitionist movement |
https://en.wikipedia.org/wiki/Philip%20Kaplan | Philip J. "Pud" Kaplan (born October 30, 1975) is an American entrepreneur and computer programmer who has founded several Internet companies.
He created the Fucked Company website in May 2000 and wrote the corresponding book F'd Companies () in 2002.
He has subsequently created other websites and web-based ventures, including the online advertising market site AdBrite, which he founded in 2004. In June 2009, Kaplan joined Charles River Ventures as an Entrepreneur In Residence.
In July 2011, Kaplan formed ADHD Labs, an incubator for web and iPhone apps. ADHD Labs' company, TinyLetter, was acquired by MailChimp in August 2011. In 2012, Kaplan's company founded Fandalism, a social networking website for musicians. He expanded the site to offer the digital distribution of music, and in early 2013, the service was spun off under the name DistroKid.
Kaplan obtained his Bachelor of Science in 1997 from the Syracuse University School of Information Studies and delivered the convocation address at the Class of 2014 graduation ceremony. He currently resides in New York City.
References
External links
American Internet celebrities
1975 births
Living people
Bethesda-Chevy Chase High School alumni
Syracuse University alumni
21st-century American businesspeople |
https://en.wikipedia.org/wiki/Computer%20network%20naming%20scheme | In computing, naming schemes are often used for objects connected into computer networks.
Naming schemes in computing
Server naming is a common tradition. It makes it more convenient to refer to a machine by name than by its IP address.
The CIA named their servers after states.
Server names may be named by their role or follow a common theme such as colors, countries, cities, planets, chemical element, scientists, etc. If servers are in multiple different geographical locations they may be named by closest airport code.
Such as web-01, web-02, web-03, mail-01, db-01, db-02.
Airport code example:
lax-001
lax-002
arn-001
City-State-Nation example:
3-character unique number
2-character production/development classifier
3-character city ID
2-character state/province/region ID
2-character nation ID
Thus, a production server in Minneapolis, Minnesota would be nnn.ps.min.mn.us.example.com, or a development server in Vancouver, BC, would be nnn.ds.van.bc.ca.example.com.
Large networks often use a systematic naming scheme, such as using a location (e.g. a department) plus a purpose to generate a name for a computer.
For example, a web server in NY may be called "nyc-www-04.xyz.net".
However, smaller networks will frequently use a more personalized naming scheme to keep track of the many hosts. Popular naming schemes include trees, planets, rocks, etc.
Network naming can be hierarchical in nature, such as the Internet's Domain Name System. Indeed, the Internet employs several universally applicable naming methods: uniform resource name (URN), uniform resource locator (URL), and uniform resource identifier (URI).
See also
Systematic name
Geospatial network
Naming convention
References
External links
- "Choosing a Name for Your Computer"
- "The Naming of Hosts"
Naming schemes
Naming conventions in Active Directory
URIs, URLs, and URNs: Clarifications and Recommendations 1.0
Naming conventions
Network addressing
Servers (computing) |
https://en.wikipedia.org/wiki/San%20Francisco%20Canyon%20Company | San Francisco Canyon Company was a software development company that was contracted by Apple Computer in 1992 to port the QuickTime technology to Microsoft Windows. They made their first release of QuickTime for Windows in November 1992.
In July 1993, Intel contracted the San Francisco Canyon Company to improve the performance of Microsoft's Video for Windows technology on Intel processors. By the end of 1993, Intel and Microsoft had combined their efforts to improve Video for Windows by creating a joint technology called Display Control Interface that was included in version 1.1d of Video for Windows (released in late 1994). As with WinG, the main problem this technology fixed was that Windows 3.x video drivers implemented all GDI routines including for drawing bitmaps in the video drivers themselves, and performance of these routines varied across drivers.
The lawsuit "Apple Computer v. San Francisco Canyon Co.", filed on December 6, 1994, alleged that the San Francisco Canyon Company used some of the code developed under contract to Apple in their additions to Video for Windows. Apple expanded the lawsuit to include Intel and Microsoft on February 10, 1995, alleging that Microsoft and Intel knowingly used the software company to aid them in stealing several thousand lines of Apple's QuickTime code in their effort to improve the performance of Video for Windows.
On March 3, 1995, a Federal judge issued a temporary restraining order that prohibited Microsoft from distributing its current version of Video for Windows. Microsoft subsequently released version 1.1e of Video for Windows, which removed all of the code contributed by the San Francisco Canyon Company, stating in the release notes "does not include the low-level driver code that was licensed from Intel Corporation".
Later testimony in the United States v. Microsoft Corp. case revealed that, at the time, Apple was threatening Microsoft with a multibillion-dollar lawsuit over the allegedly stolen code, and in return Bill Gates was threatening the cancellation of Microsoft Office for Mac. In August 1997, Apple and Microsoft announced a settlement deal. Apple would drop all current lawsuits, including all lingering issues from the "Look & Feel" lawsuit and the "QuickTime source code" lawsuit, and agree to make Internet Explorer for Mac the default browser on the Macintosh unless the user explicitly chose the bundled Netscape browser. In return, Microsoft agreed to continue developing Office, Internet Explorer, and various developer tools and software for the Mac for the next 5 years, and purchase $150 million of non-voting Apple stock. The companies also agreed to mutual collaboration on Java technologies, and to cross-license all existing patents, and patents obtained during the five-year deal, with one another.
References
Further reading
Carlton, Jim (1997). Apple: The Inside Story of Intrigue, Egomania, and Business Blunders. Random House. .
External links
"Intel and Mi |
https://en.wikipedia.org/wiki/MTVX | MTVX was an American hard rock music video channel operated by Viacom's MTV Networks division. A sister channel of MTV, MTVX was available exclusively on digital cable providers, being the first network to be made available as part of the "MTV Networks Digital Suite".
Format
MTVX aired no advertising outside of MTV2 promos, airing videos on a daily loop programmed to air in three eight-hour blocks per day. The channel aired contemporary videos and older videos that were no longer shown on MTV. Likewise, MTVX was not limited to just one genre of rock music videos. The channel aired a variety of genres, including punk, metal, and grunge.
Also, MTVX showcased otherwise unknown or unheard music to the masses, such as Static-X, Disturbed, Finger Eleven, Black Label Society, SOiL, Soulfly, Sepultura, Tool, Pantera, Kittie, Dope, Coal Chamber, Primus, Mushroomhead and others.
Closure
MTVX ended on May 1, 2002, and was replaced by MTV Jams, a hip hop music video channel. The last video played on MTVX was "See You On The Other Side" by Ozzy Osbourne. The replacement of MTVX was decried by rock music fans. MTV's explanation, based upon ratings and Billboard chart information, was that viewers wanted a devoted network for hip hop and R&B videos, rather than the alternative rock and hard rock videos that MTVX had been created to play, and claims that hard rock formats went into a quick decline post-9/11 due to industry and radio de-emphasis.
Reuse of brand
In 2011 MTV began reusing the MTVX brand (with X standing here for 'extended') for "a new cross-media group in charge of developing content for various platforms such as TV, computers and mobile phones." MTV launched MTVX in August The effort never resulted in any actual product or program branded by MTVX, though the brand name of MTVX remained present on MTV's official corporate page for several years.
References
MTV channels
Defunct television networks in the United States
Television channels and stations established in 1998
Television channels and stations disestablished in 2002 |
https://en.wikipedia.org/wiki/ReplayGain | ReplayGain is a proposed technical standard published by David Robinson in 2001 to measure and normalize the perceived loudness of audio in computer audio formats such as MP3 and Ogg Vorbis. It allows media players to normalize loudness for individual tracks or albums. This avoids the common problem of having to manually adjust volume levels between tracks when playing audio files from albums that have been mastered at different loudness levels.
Although this de facto standard is now formally known as ReplayGain, it was originally known as Replay Gain and is sometimes abbreviated RG.
ReplayGain is supported in a large number of media software and portable devices.
Operation
ReplayGain works by first performing a psychoacoustic analysis of an entire audio track or album to measure peak level and perceived loudness. Equal-loudness contours are used to compensate for frequency effects and statistical analysis is used to accommodate for effects related to time. The difference between the measured perceived loudness and the desired target loudness is calculated; this is considered the ideal replay gain value. Typically, the replay gain and peak level values are then stored as metadata in the audio file. ReplayGain-capable audio players use the replay gain metadata to automatically attenuate or amplify the signal on a per-track or per-album basis such that tracks or albums play at a similar loudness level. The peak level metadata can be used to prevent gain adjustments from inducing clipping in the playback device.
Metadata
The original ReplayGain proposal specified an 8-byte field in the header of any file. Most implementations now use tags for ReplayGain information. FLAC and Ogg Vorbis use the REPLAYGAIN_* Vorbis comment fields. MP3 files usually use ID3v2. Other formats such as AAC and WMA use their native tag formats with a specially formatted tag entry listing the track's replay gain and peak loudness.
ReplayGain utilities usually add metadata to the audio files without altering the original audio data. Alternatively, a tool can amplify or attenuate the data itself and save the result to another, gain-adjusted audio file; this is not perfectly reversible in most cases. Some lossy audio formats, such as MP3, are structured in a way that they encode the volume of each compressed frame in a stream, and tools such as MP3Gain take advantage of this for directly applying the gain adjustment to MP3 files, adding undo information so that the process is reversible.
Target loudness
The target loudness is specified as the loudness of a stereo pink noise signal played back at 89 dB sound pressure level or −14 dB relative to full scale. This is based on SMPTE recommendation RP 200:2002, which specifies a similar method for calibrating playback levels in movie theaters using a reference level 6 dB lower (83 dB SPL, −20 dBFS).
Track-gain and album-gain
ReplayGain analysis can be performed on individual tracks, so that all tracks will be of equal volume |
https://en.wikipedia.org/wiki/Norton%20AntiVirus | Norton AntiVirus is an anti-virus or anti-malware software product founded by Peter Norton, developed and distributed by Symantec (now Gen Digital) since 1990 as part of its Norton family of computer security products. It uses signatures and heuristics to identify viruses. Other features included in it are e-mail spam filtering and phishing protection.
Symantec distributes the product as a download, a box copy, and as OEM software. Norton AntiVirus and Norton Internet Security, a related product, held a 61% US retail market share for security suites as of the first half of 2007. Competitors, in terms of market share in this study, include antivirus products from CA, Trend Micro, and Kaspersky Lab.
Norton AntiVirus runs on Microsoft Windows, Linux, and macOS. Windows 7 support was in development for versions 2006 through 2008. Version 2009 has Windows 7 supported update already. Versions 2010, 2011, and 2012 all natively support Windows 7, without needing an update. Version 12 is the only version fully compatible with Mac OS X Lion.
With the 2015 series of products, Symantec made changes in its portfolio and briefly discontinued Norton AntiVirus. This action was later reversed with the introduction of Norton AntiVirus Basic.
Origins
In May 1989, Symantec launched Symantec Antivirus for the Macintosh (SAM). SAM 2.0, released March 1990, incorporated technology allowing users to easily update SAM to intercept and eliminate new viruses, including many that didn't exist at the time of the program's release.
In August 1990 Symantec acquired Peter Norton Computing from Peter Norton. Norton and his company developed various DOS utilities including the Norton Utilities, which did not include antivirus features. Symantec continued the development of acquired technologies. The technologies are marketed under the name of "Norton", with the tagline "from Symantec". Norton's crossed-arm pose, a registered U.S. trademark, was traditionally featured on Norton product packaging. However, his pose was later moved to the spine of the packaging, and eventually dropped altogether.
With the 1998 version 5.0 update, SAM was renamed Norton AntiVirus (NAV) for Macintosh.
Windows/DOS editions
By early 1991, U.S. computers were invaded by hundreds of foreign virus strains and corporate PC infection was becoming a serious problem. Symantec's Norton Group launched Norton AntiVirus 1.0 (NAV) for PC and compatible computers. Ads for the product, with suggested retail $129, featured Norton in his crossed-arm pose, wearing a pink shirt and surgical mask covering his nose and mouth.
Due to bug in the software, the original Norton Antivirus 1.0 does not repair infected files or boot sectors properly. This was fixed when version 1.5 was released in June 1991, along with the addition of the option of installing multiple scan levels of the Norton Antivirus Intercept (later renamed to Norton Antivirus Auto-Protect starting off with Norton Antivirus 3.0 released in Septemb |
https://en.wikipedia.org/wiki/DOSEMU | DOSEMU, stylized as dosemu, is a compatibility layer software package that enables DOS operating systems (e.g., MS-DOS, DR-DOS, FreeDOS) and application software to run atop Linux on x86-based PCs (IBM PC compatible computers).
Features
It uses a combination of hardware-assisted virtualization features and high-level emulation. It can thus achieve nearly native speed for 8086-compatible DOS operating systems and applications on x86 compatible processors, and for DOS Protected Mode Interface (DPMI) applications on x86 compatible processors as well as on x86-64 processors. DOSEMU includes an 8086 processor emulator for use with real-mode applications in x86-64 long mode.
DOSEMU is only available for x86 and x86-64 Linux systems (Linux 3.15 x86-64 systems cannot enter DPMI by default. This is fixed in 3.16).
DOSEMU is an option for people who need or want to continue to use legacy DOS software; in some cases virtualisation is good enough to drive external hardware such as device programmers connected to the parallel port. According to its manual, "dosemu" is a user-level program which uses certain special features of the Linux kernel and the 80386 processor to run DOS in a DOS box. The DOS box, relying on a combination of hardware and software, has these abilities:
Virtualize all input-output and processor control instructions
Supports the word size and addressing modes of the iAPX86 processor family's "real mode", while still running within the full protected mode environment
Trap all DOS and BIOS system calls and emulate such calls as needed for proper operation and good performance
Simulate a hardware environment over which DOS programs are accustomed to having control.
Provide DOS services through native Linux services; for example, dosemu can provide a virtual hard disk drive which is actually a Linux directory hierarchy.
API-level support for Packet driver, IPX, Berkeley sockets (dosnet).
See also
Comparison of platform virtualization software
Virtual DOS machine
DOSBox
Wine
FreeDOS
References
External links
dosemu2
DOS emulators
Compatibility layers
Linux emulation software |
https://en.wikipedia.org/wiki/Go%20%28radio%20show%29 | Go! was a Saturday morning entertainment show on the Radio One network of the Canadian Broadcasting Corporation that ran from 2002 to 2010, hosted by Brent Bambury. The show included interviews, music, live performances, and comedy bits.
The show first aired as a summer series in 2002, concurrently with Bambury's stint as host of All in a Day, the network's local afternoon program in Ottawa. Following a second summer run in 2003, the show was added to the network's regular year-round schedule that fall.
The show was produced in Ottawa before moving to Toronto in 2005. After 2004, most episodes were broadcast in front of a live studio audience.
According to Bambury, "we wanted to do a show that wasn't about anything, so every week was a voyage of discovery to figure out what it was about. But what it was really about was that you didn't have to think very hard. You didn't have to feel smart about anything to listen to it. It was the opposite of a CBC show." The show's format commonly took the form of a pop culture contest of some type. For example, three celebrities would compete against each other in a trivia match, or celebrity judges would evaluate amateur stand-up comedians or celebrity impersonators. Early in the show's run, this included a consistent regular feature titled Groove Shinny, which set a Canadian musician against a "perfect musical mind" (Richard Crouse) and a "perfect stranger", for a music trivia match. At other times, the show would simply broadcast offbeat comedy and entertainment segments, such as guests singing Bible passages or a comedic mock kidnapping of Governor General Adrienne Clarkson.
Regulars included Nana aba Duncan who appeared in an audience participation features titled "Contest Nana", in which she presented an audio montage of soundclips which listeners can e-mail the show to identify. The feature was previously hosted by comedian Sabrina Jalees. Kliph Nesteroff hosted a segment titled "That Time of the Month", showcasing unintentionally funny audio ephemera from the 1950s, 1960s and 1970s. A live musical guest also often appeared, performing three or four numbers during the course of the show.
The last episode of the show aired on June 26, 2010. In September, Bambury launched a new public affairs magazine show, Day 6, in the same time slot. Go's weekly listener montage contest was retained on Day 6 as "Riffed from the Headlines".
References
CBC Radio One programs
Canadian radio game shows
2000s Canadian game shows
2010s Canadian game shows
2002 radio programme debuts
2010 radio programme endings
2000s Canadian radio programs
2010s Canadian radio programs |
https://en.wikipedia.org/wiki/Idrisi | Idrisi may refer to:
Muhammad al-Idrisi, 12th-century explorer, geographer and writer
Idris I of Libya, 20th-century Libyan king
IDRISI, a GIS computer program
İdrisqışlaq, Azerbaijan
Idrisis of Asir, the former ruling family of the Emirate of Asir
Idrisi Shaikh or Darzi, a Muslim community of India
See also
Idris (disambiguation) |
https://en.wikipedia.org/wiki/Brendan%20Eich | Brendan Eich (; born July 4, 1961) is an American computer programmer and technology executive. He created the JavaScript programming language and co-founded the Mozilla project, the Mozilla Foundation, and the Mozilla Corporation. He served as the Mozilla Corporation's chief technical officer before he was appointed chief executive officer, but resigned shortly after his appointment due to pressure over his firm opposition to same-sex marriage. He subsequently became the CEO of Brave Software.
Early life
Eich grew up in Pittsburgh; Gaithersburg, Maryland; and Palo Alto, and he attended Ellwood P. Cubberley High School, graduating in the class of 1979. He received his bachelor's degree in mathematics and computer science at Santa Clara University, and he received his master's degree in 1985 from the University of Illinois at Urbana–Champaign. Eich is Roman Catholic.
He began his career at Silicon Graphics, working for seven years on operating system and network code. He then worked for three years at MicroUnity Systems Engineering writing microkernel and DSP code.
Career
Netscape
Eich started work at Netscape Communications Corporation in April 1995. Eich originally joined intending to put Scheme "in the browser", but his Netscape superiors insisted that the language's syntax resemble that of Java. As a result, Eich devised a language that had much of the functionality of Scheme, the object-orientation of Self, and the syntax of Java. He completed the first version in ten days in order to accommodate the Navigator 2.0 Beta release schedule, and was called Mocha, but renamed LiveScript in September 1995 and finally in a joint announcement with Sun Microsystems it was named JavaScript in December. Simultaneously, he designed the first SpiderMonkey engine for the Netscape Navigator browser at Netscape Communications. When Mozilla inherited the Netscape base code in 1998, it included this engine, which was written in the C programming language. It was then changed in JavaScript 1.5 to comply with the ECMA-262 standard. Eich continued to oversee the development of SpiderMonkey, the specific implementation of JavaScript in Navigator.
Mozilla
In early 1998, Eich co-founded the free and open-source software project Mozilla with Jamie Zawinski and others, creating the mozilla.org website, which was meant to manage open-source contributions to the Netscape source code. He served as Mozilla's chief architect. AOL bought Netscape in 1999. After AOL shut down the Netscape browser unit in July 2003, Eich helped spin out the Mozilla Foundation.
In August 2005, after serving as a lead technologist and as a member of the board of directors of the Mozilla Foundation, Eich became chief technical officer (CTO) of the newly founded Mozilla Corporation, meant to be the Mozilla Foundation's for-profit arm. Eich continued to "own" the Mozilla SpiderMonkey module, its JavaScript engine until he passed on the ownership of it to Dave Mandolin in 2011.
Appointment to |
https://en.wikipedia.org/wiki/Process%20control%20network | A Process Control Network (PCN) is a communications network layer that is a part of the Industrial Automation networks in Process Industries. This network is used to transmit instructions and data between control and measurement units and Supervisory Control and Data Acquisition (SCADA) equipment.
Industry requirements
These networks have, over the years, used many of the technologies and topologies utilised in other network applications. However, Process Control Networks (PCNs) have several special requirements that must be met in order for the solution to be acceptable to the industry. These requirements are, in no particular order: Robustness, Determinacy, Compatibility. Robustness includes requirements such as connection redundancy, reduced sensitivity to Electromagnetic Interference (EMI), and good error checking and correction. Determinacy involves assuring that each device is guaranteed access to the network, and in many cases mechanisms to allow priority information (such as alarms) through the system. Compatibility allows SCADA and Distributed Control Systems (DCS) from various manufacturers to communicate with control and measurement equipment from others.
Development of standards
Many early PCNs were serial based, using low level standards such as EIA RS-422 and EIA RS-485 with proprietary protocols on top. One of the de facto standards (which is now becoming an open standard) is Modbus, originally from Modicon. Many PCNs used token passing based protocols because they are essentially deterministic. Both Allen Bradley and Eurotherm utilised such mechanisms. Many of the measurement and control unit manufacturers signed up to the Fieldbus consortium but rather than one standard emerging each manufacturer promoted their own 'standard' leading to a myriad, and confusing, range of physical and logical systems. Modern process control networks rely on Ethernet, TCP/IP, and Microsoft Windows technology.
References
Networks |
https://en.wikipedia.org/wiki/Ranked%20list%20of%20Mexican%20states | The 32 federal states of Mexico are ranked below according to population, size, population density, and GDP.
By population
Total population based on data from the 2020 National Population Census.
By area
Total continental surface based on data from the 2020 National Population Census.
By population density
Population density based on data from the 2020 National Census.
By Gross domestic product
Nominal GDP in 2019 based on latest data from Mexico's National Accounts System, INEGI.
By GDP (PPP) per capita
GDP (PPP) per capita in 2018 based on latest data from OECD Statistics.
See also
States of Mexico
References
Mexico
States, ranked
Ranked |
https://en.wikipedia.org/wiki/Code%20segment | In computing, a code segment, also known as a text segment or simply as text, is a portion of an object file or the corresponding section of the program's virtual address space that contains executable instructions.
Segment
The term "segment" comes from the memory segment, which is a historical approach to memory management that has been succeeded by paging. When a program is stored in an object file, the code segment is a part of this file; when the loader places a program into memory so that it may be executed, various memory regions are allocated (in particular, as pages), corresponding to both the segments in the object files and to segments only needed at run time. For example, the code segment of an object file is loaded into a corresponding code segment in memory.
The code segment in memory is typically read-only and has a fixed size, so on embedded systems it can usually be placed in read-only memory (ROM), without the need for loading. If the code segment is not read-only, then the particular architecture allows self-modifying code. Fixed-position or position-independent code may be shared in memory by several processes in segmented or paged memory systems. As a memory region, the code segment may be placed below the heap or stack in order to prevent heap and stack overflows from overwriting it.
See also
.bss
Data segment
References
Executable file formats
Memory management |
https://en.wikipedia.org/wiki/Inherit%20the%20Earth | Inherit the Earth: Quest for the Orb is an adventure game developed by The Dreamers Guild and published by New World Computing in 1994.
The point and click adventure game features a world of talking humanoid animals, with the gameplay focusing on a fox on a quest to find a stolen orb, a relic of the mythical humans.
History
Development
Inherit the Earth was developed by The Dreamers Guild for the DOS platform and published by New World Computing. The game was originally released in 1994 and later ported to the Macintosh. The German version Erben der Erde: Die große Suche was published by Softgold and first released as a port to the Amiga, followed by the DOS version.
In 1996 the German computer magazine with CD "Bestseller Games #10" brought 300,000 units of ITE on the German market as budget release.
Re-release
In 2000 the former Dreamers Guild co-founder Joe Pearce started a new company, Wyrmkeep Entertainment. In 2002 Pearce acquired the rights for the game, and self-published Inherit the Earth on his website for Windows and macOS. The full version was offered for $20 via PayPal and Kagi.com, while a free demo was downloadable.
In late 2004 Pearce provided the ScummVM developers with the source code of Inherit the Earth's SAGA engine (Scripts for Animated Graphic Adventures), which made ports to alternative platforms, like Linux, possible. In March 2007, a Pocket PC edition was released. This was followed by a port to the iPad in 2010.
The game has also been released digitally on GOG.com and Steam in June 2013.
Sequels
According to one of the original artists and animators, Lisa Jennings, the game ends on a "To be continued" note, as it was originally intended to be part of a trilogy, which did not happen due to conflicts between the developer and publisher.
On January 13, 2013 a Kickstarter crowdfunding campaign for the development of a sequel was initiated by Wyrmkeep Entertainment, but the funding goal was not met. A second campaign was started on July 16, 2014 with a higher goal to account for adding voice acting to the project. This campaign was also unsuccessful. On March 5, 2015, a Patreon funding drive was launched, with the aim to help finish funding the sequel's first of three chapters. This Patreon was intended to lead into another Kickstarter drive, with the base goal undetermined, but stated to be under $30,000.
Plot
In a far future, mankind is extinct and Earth is populated by several tribes of anthropomorphic animals – collectively referred to as the Morph – who have achieved a level of technology and societal sophistication roughly equivalent to Europe in the High Middle Ages. The humans are enshrined in legends as having been the ones who gave the Morph prehensile hands, mouths capable of speech, and the ability to think and feel, but the Morph have very little understanding of their long-lost forebears, who exist now only in stories, ruins and a few technological relics.
The game begins with the protagonist, Ri |
https://en.wikipedia.org/wiki/The%20Young%20Turks | The Young Turks (TYT) is an American progressive news commentary show on YouTube that additionally appears on selected television channels. TYT serves as the flagship program of the TYT Network, a multi-channel network of associated web series focusing on news and current events. TYT covers politics, lifestyle, pop culture, science, sport and other social topics. The program was created by Cenk Uygur, Ben Mankiewicz and Dave Koller. Uygur is Turkish-American and named the program after the Young Turks movement of the 20th century. Currently co-hosted by Uygur and Ana Kasparian, it is also often accompanied by various other in-studio contributors. The Young Turks began as a radio program that premiered on February 14, 2002, on Sirius Satellite Radio before launching a web series component in 2005 on YouTube; it was later carried on Air America.
In addition to being carried on the TYT Network and YouTube, it is also currently available on Amazon Prime Direct, iTunes, Hulu, Roku, on Pluto TV through a 24-hour feed and on social media platforms Instagram, Facebook, and Twitter. It has spawned two spin-off television series, one that aired on Current TV from 2011 to 2013 and a second that debuted on Fusion in 2016 as a limited-run program developed to cover the 2016 United States presidential election. The Young Turks also served as the subject of a documentary, entitled Mad as Hell, which was released in 2014. The network also has a channel on YouTube TV. For most of its existence TYT relied on small grassroots financial contributions from its viewership to sustain itself as an independent news organization. However, in 2017 TYT sought to expand its media network and hire more staff through various venture capital fundraising efforts that raised $20 million.
The Young Turks is the longest-running news and politics talk show online.
Format
The Young Turks live streams for up to three hours, with its story selection and associated commentary broken up by format. Issues that the show focuses on include national political news, the influence of money in the political process, drug policy, social security, the privatization of public services, climate change, the influence of religion, abortion and reproductive rights, civil rights and issues of injustice towards people of color and sexual minorities, sexual morality, and the influence of corporations, neutrality and establishment political thought on traditional news media. The program maintains a liberal/progressive ideology in its political commentary. Co-creator and host Cenk Uygur describes himself as an "independent progressive" and asserts that the show is aimed at the "98 percent 'not in power'" and what he describes as the 60 percent of Americans who hold progressive views.
The two-hour main show is usually hosted by Cenk Uygur and Ana Kasparian, with a rotating cast of other progressive co-hosts, including John Iadarola, Jayar Jackson and more. The first hour usually focuses on American poli |
https://en.wikipedia.org/wiki/Two-level%20scheduling | Two-level scheduling is a computer science term to describe a method to more efficiently perform process scheduling that involves swapped out processes.
Consider this problem: A system contains 50 running processes all with equal priority. However, the system's memory can only hold 10 processes in memory simultaneously. Therefore, there will always be 40 processes swapped out written on virtual memory on the hard disk. The time taken to swap out and swap in a process is 50 ms respectively.
With straightforward Round-robin scheduling, every time a context switch occurs, a process would need to be swapped in (because only the 10 least recently used processes are swapped in). Choosing randomly among the processes would diminish the probability to 80% (40/50). If that occurs, then obviously a process also need to be swapped out. Swapping in and out of is costly, and the scheduler would waste much of its time doing unneeded swaps.
That is where two-level scheduling enters the picture. It uses two different schedulers, one lower-level scheduler which can only select among those processes in memory to run. That scheduler could be a Round-robin scheduler. The other scheduler is the higher-level scheduler whose only concern is to swap in and swap out processes from memory. It does its scheduling much less often than the lower-level scheduler since swapping takes so much time.
Thus, the higher-level scheduler selects among those processes in memory that have run for a long time and swaps them out. They are replaced with processes on disk that have not run for a long time. Exactly how it selects processes is up to the implementation of the higher-level scheduler. A compromise has to be made involving the following variables:
Response time: A process should not be swapped out for too long. Then some other process (or the user) will have to wait needlessly long. If this variable is not considered resource starvation may occur and a process may not complete at all.
Size of the process: Larger processes must be subject to fewer swaps than smaller ones because they take longer time to swap. Because they are larger, fewer processes can share the memory with the process.
Priority: The higher the priority of the process, the longer it should stay in memory so that it completes faster.
References
Tanenbaum, Albert Woodhull, Operating Systems: Design and Implementation, p.92
Processor scheduling algorithms |
https://en.wikipedia.org/wiki/Danny%20Goodman | Danny Goodman is a computer programmer, technology consultant, and an author of over three dozen books and hundreds of magazine articles on computer-related topics. He is best known as the author of The Complete HyperCard Handbook (1987, Bantam Books, 650,000 copies in print), The JavaScript Bible (1996, IDG Books, 500,000 copies in print), and Dynamic HTML (1998, O'Reilly & Associates, 100,000 copies in print). His The Complete AppleScript Handbook (1993, Random House) is also notable as an important early work on the AppleScript programming language.
Goodman began writing about electronics and computers in the late 1970s, and became a full-time author in 1981. In 1987, the first edition of the highly acclaimed The Complete HyperCard Handbook was published. This influential work was once cited as being "the best selling Macintosh book and fastest selling computer book in history".
Having received critical acclaim with his Macintosh-related works, especially on scripting via HyperCard and AppleScript, he turned his attention to the new scripting language of the Internet, JavaScript, and related technologies such as HTML and Cascading Style Sheets. His articles on the websites of Netscape, Apple Computer, and O'Reilly Media have been popular and noted for being accessible to both experts and non-professionals. In particular, his better known works have covered important techniques for achieving compatible cross-browser scripting solutions, dealing with the many differences of the major browsers Netscape Navigator, Internet Explorer, Opera, Safari and others; as well as discussing cross-platform issues involving the Macintosh, Windows, and Unix environments.
Goodman has written a few apps for the iPhone, namely iFeltThat (earthquake maps) and BeaconAid-HF (for radio frequency monitoring).
Goodman was born in Chicago, Illinois, and moved to San Francisco in 1983. He has a BA and M.A. from the University of Wisconsin–Madison in Classical Antiquity.
Awards
Computer Press Association Book Awards:
Best Product Specific Book (1987): The Complete HyperCard Handbook (1987, Bantam Books)
Best Product Specific Book (1988): Danny Goodman's HyperCard Developer's Guide (1988, Bantam Books)
Best Introductory How-To Book, Systems (1992): Danny Goodman's Macintosh Handbook (1992, Bantam Books)
Software Publishers Association Awards:
Best Utility (1987): Focal Point (1987, Activision)
Best Add-On (1987): Focal Point (1987, Activision)
Best User Interface (1987): Business Class (1987, Activision)
References
External links
American technology writers
Writers from California
University of Wisconsin–Madison College of Letters and Science alumni
O'Reilly writers
American computer programmers
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Sylvester%20of%20Kiev | Sylvestr () (–1123, aged 67-68) was a clergyman and a writer in Kievan Rus'.
Some sources name Sylvestr as a compiler of either the Primary Chronicle itself or its second edition. He was a hegumen of the Vydubetsky Monastery in Kiev, which had been founded by Prince Vsevolod Yaroslavich. In 1118, Sylvestr was sent to Pereiaslav as a bishop.
As a person close to Vsevolod's son Vladimir Monomakh, Sylvestr played a notable role in political and ecclesiastical affairs of Kievan Rus.
He is said to have continued the work of St Nestor the Chronicler and written nine Lives of the holy saints of the Kiev Caves. He is celebrated on September 28 and commemorated on January 2.
References
Russian religious leaders
Eastern Orthodox chroniclers
12th-century historians
Vydubychi Monastery
1050s births
1123 deaths
Year of birth uncertain
Writers from Kievan Rus' |
https://en.wikipedia.org/wiki/John%20Pollard%20%28mathematician%29 | John M. Pollard (born 1941) is a British mathematician who has invented algorithms for the factorization of large numbers and for the calculation of discrete logarithms.
His factorization algorithms include the rho, p − 1, and the first version of the special number field sieve, which has since been improved by others.
His discrete logarithm algorithms include the rho algorithm for logarithms and the kangaroo algorithm. He received the RSA Award for Excellence in Mathematics.
External links
John Pollard's web site
Living people
20th-century British mathematicians
21st-century British mathematicians
Number theorists
Place of birth missing (living people)
1941 births |
https://en.wikipedia.org/wiki/VINSON | VINSON is a family of voice encryption devices used by U.S. and allied military and law enforcement, based on the NSA's classified Suite A SAVILLE encryption algorithm and 16 kbit/s CVSD audio compression. It replaces the Vietnam War-era NESTOR (KY-8/KY-28|28/KY-38|38) family.
These devices provide tactical secure voice on UHF and VHF line of sight (LOS), UHF SATCOM communication and tactical phone systems. These terminals are unclassified Controlled Cryptographic Items (CCI) when unkeyed and classified to the keymat of the key when going secure.
VINSON devices include:
KY-57
KY-58
KY-68
KY-99a (MINTERM)
KY-100 (AIRTERM)
KYV-2
FASCINATOR
VINSON is embedded into many modern military radios, such as SINCGARS. Many multi-algorithm COMSEC modules are also backwards-compatible with VINSON.
See also
Advanced Narrowband Digital Voice Terminal (ANDVT) system for low bandwidth secure voice communications that replaced VINSON.
References
National Security Agency encryption devices |
https://en.wikipedia.org/wiki/SAVILLE | SAVILLE is a classified NSA Type 1 encryption algorithm, developed in the late 1960s, jointly by the Government Communications Headquarters (GCHQ) in the UK and the National Security Agency (NSA) in the US. It is used broadly, often for voice encryption, and implemented in many encryption devices.
Little is known publicly about the algorithm itself due to its classified nature and inclusion in the NSA's Suite A. Some documentation related to the KYK-13 fill device and statements made by military officials confirm that SAVILLE has a 128-bit key, which consists of 120 key bits and an 8-bit checksum. Furthermore, it is known that SAVILLE has two modes of operation: Autonomous Mode (also known as Key-Auto-KEY or KAK) and Autoclave Mode (also known as Cipher-Text Auto Key or CTAK). On the AIM microchip, it runs at 4% of the clock rate (compare DES at 76% and BATON at 129%). The Cypris chip mentions two modes; specifications for Windster and Indictor specify that they provide Saville I.
Some devices and protocols that implement SAVILLE:
Secure Telephone Equipment (STU)
The VINSON family (voice encryption)
UK Lamberton (BID/250)
APCO Project 25 (single-channel land mobile radios) (Saville has algorithm ID 04)
Versatile encryption chips: AIM, Cypris, Sierra I/II, Windster, Indictor, Presidio, Railman
Spendex 40
Spendex 50 (also known as DBT)
Elcrovox 1/4
References
External links
SAVILLE info at cryptomuseum.com
Block ciphers
Type 1 encryption algorithms |
https://en.wikipedia.org/wiki/Pelephone | Pelephone (, , lit. "wonder phone") is a mobile network operator in Israel, and also the first company to offer mobile telephony services in Israel. Due to this, the brand-name "Pelephone" became the genericized trademark for mobile phones in Israel, regardless of service provider. The company is a subsidiary of the Israeli telecommunications conglomerate Bezeq, which is also the principal provider of fixed-line telephone service in the country. As of June 2016 Pelephone had 2.26 million wireless subscribers.
History
Pelephone was founded as a company in 1985 as a joint venture between Motorola and Tadiran, after Motorola was awarded the contract to build Israel's first mobile phone network in November 1983. Pelephone began operations of its mobile phone network in March 1986. Pelephone's first television commercial featured Israeli actor Hanan Goldblatt using his car phone to buy and sell shares via a stockbroker while driving at the same time. Pelephone's first CEO was Benny Epstein, who served in that position until 1994.
In 1994, Bezeq acquired 50% ownership of Pelephone, and in 2004 acquired full ownership of the company from its co-owner Motorola.
In December 2011 Pelephone became the host network of "Rami Levy Communications", the first MVNO to begin operating in Israel. As of 2012, Pelephone states that it has 4,500 employees, although the workers' union says that there are just 3,800.
YouPhone (Alon Cellular) was a member of the Pelephone network as a virtual MVNO operator. It was established as a subsidiary of Alon Blue Square Israel, but since 2015 it has been owned completely by Pelephone and also merged its operations with Pelephone.
Network
The Pelephone network started as AMPS/NAMPS in the 850 MHz band. In 1998 it converted to IS-95 CDMA and in 2004 CDMA2000/EV-DO mobile data capabilities were added as well.
A 3G UMTS network in the 850/2100 MHz bands was launched in early 2009 and in March of that year, Pelephone stopped selling cellphones that use the CDMA system. In mid-2010, the UMTS network was upgraded to HSPA+. In 2014 the company launched an LTE network in the 1800 MHz band. and in 2020 5G NR services were launched, using the 3500 MHz band.
In April 2017, Pelephone announced plans to shut down their CDMA network over the summer, and did so on June 28, 2017.
Operations and services
Pelephone lost its monopoly status in 1994, when Cellcom was founded, breaking Pelephone's monopoly as a mobile network operator, and in 1999, a third competitor, Partner (formerly known as Orange) was established.
The prefix (area code) for Pelephone customers is 050, although customers who requested to keep their old number from a different cellular company may have a different area code, as required by law.
Between 2003 and 2022, Pelephone pursued a multibranding strategy to reach previously underserved market segments. These included Esc, a youth-focused subsidiary which operated between 2003 and 2007 in cooperation with radio stati |
https://en.wikipedia.org/wiki/Network%20programming | Network programming may refer to one of several things:
Computer network programming
Scheduling broadcast programs |
https://en.wikipedia.org/wiki/Broadcast%20programming | Broadcast programming is the practice of organizing or ordering (scheduling) of broadcast media shows, typically the radio and the television, in a daily, weekly, monthly, quarterly, or season-long schedule.
Modern broadcasters use broadcast automation to regularly change the scheduling of their shows to build an audience for a new show, retain that audience, or compete with other broadcasters' shows. Most broadcast television shows are presented weekly in prime time or daily in other dayparts, though exceptions are not rare.
At a micro level, scheduling is the minute planning of the transmission; what to broadcast and when, ensuring an adequate or maximum utilization of airtime. Television scheduling strategies are employed to give shows the best possible chance of attracting and retaining an audience. They are used to deliver shows to audiences when they are most likely to want to watch them and deliver audiences to advertisers in the composition that makes their advertising most likely to be effective.
With the growth of digital platforms and services allowing non-linear, on-demand access to television content, this approach to broadcasting has since been referred to using the retronym linear (such as linear television and linear channels).
History
With the beginning of scheduled television in 1936, television programming was initially only concerned with filling a few hours each evening – the hours now known as prime time. Over time, though, television began to be seen during the daytime and late at night, as well on the weekends. As air time increased, so did the demand for new material. With the exception of sports television, variety shows became much more important in prime time.
Scheduling strategies
Lead-ins and lead-outs
Broadcasters may schedule a program to air before or after a widely viewed tent-pole program, such as a popular series, or a special such as a high-profile sporting event, in the hope that audience flow will encourage the audience to tune-in early or stay for the second program. The second program is usually one that the broadcaster wants to promote to a wider audience, such as a new or lower-profile series. Sometimes, a lower-profile program may be scheduled between two tentpole programs, a technique known as hammocking.
Lead-outs can sometimes help to launch new programs and talent; in 1982, NBC premiered Late Night with David Letterman as a lead-out for its long-running late-night talk show The Tonight Show Starring Johnny Carson. Characterized by an off-beat style appealing to young adults, Late Night helped launch the career of host David Letterman, and influence later entries into the genre. Despite Carson's endorsement of Letterman as a successor following his 1992 retirement, NBC chose Jay Leno instead, and Letterman departed for CBS to host a spiritual successor—Late Show with David Letterman—beginning in the 1993–94 season. Late Night would continue as a franchise with hosts such as Conan O'Brien and J |
https://en.wikipedia.org/wiki/Sign%20bit | In computer science, the sign bit is a bit in a signed number representation that indicates the sign of a number. Although only signed numeric data types have a sign bit, it is invariably located in the most significant bit position, so the term may be used interchangeably with "most significant bit" in some contexts.
Almost always, if the sign bit is 0, the number is non-negative (positive or zero). If the sign bit is 1 then the number is negative, although formats other than two's complement integers allow a signed zero: distinct "positive zero" and "negative zero" representations, the latter of which does not correspond to the mathematical concept of a negative number.
In the two's complement representation, the sign bit has the weight where is the number of bits. In the ones' complement representation, the most negative value is , but there are two representations of zero, one for each value of the sign bit. In a sign-and-magnitude representation of numbers, the value of the sign bit determines whether the numerical value is positive or negative.
Floating-point numbers, such as IEEE format, IBM format, VAX format, and even the format used by the Zuse Z1 and Z3 use a sign-and-magnitude representation.
When using a complement representation, to convert a signed number to a wider format the additional bits must be filled with copies of the sign bit in order to preserve its numerical value, a process called sign extension or sign propagation.
References
Binary arithmetic
Computer arithmetic
Sign (mathematics) |
https://en.wikipedia.org/wiki/BATON | BATON is a Type 1 block cipher in use since at least 1995 by the United States government to secure classified information.
While the BATON algorithm itself is secret (as is the case with all algorithms in the NSA's Suite A), the public PKCS#11 standard includes some general information about how it is used. It has a 320-bit key and uses a 128-bit block in most modes, and also supports a 96-bit electronic codebook mode. 160 bits of the key are checksum material. It supports a "shuffle" mode of operation, like the NSA cipher JUNIPER. It may use up to 192 bits as an initialization vector, regardless of the block size.
In response to a Senate question about encrypted video links, the NSA said that BATON could be used for encryption at speeds higher than those possible with Skipjack.
Usage
BATON is used in a variety of products and standards:
APCO Project 25 (Public standard for land mobile radio) (Algorithm IDs 01 and 41)
PKCS#11 (Public standard for encryption tokens)
CDSA/CSSM (Another public standard)
HAIPE-IS (NSA's version of IPsec)
FNBDT (Advanced flexible voice security protocol)
Thales Datacryptor 2000 (a British network-encryption box)
SecNet-11 (a crypto-secure 802.11b PC Card, based on the Sierra chip)
Fortezza Plus (a PC Card product, used in the STE)
SafeXcel-3340 (a HAIPIS network-encryption box)
Numerous embeddable encryption modules: AIM, CYPRIS, MYK-85, Sierra (microchip), etc.
See also
Advanced Encryption Standard
References
External links
PKCS documentation
Discussion of BATON
Quotes about BATON
Senate security interview
Type 1 encryption algorithms
Block ciphers |
https://en.wikipedia.org/wiki/List%20of%20computer%20technology%20code%20names | Following is a list of code names that have been used to identify computer hardware and software products while in development. In some cases, the code name became the completed product's name, but most of these code names are no longer used once the associated products are released.
Symbol and numbers
19H1 — Windows 10 version 1903
4Course — Sun 4 × 1.05 GB 3.5" SCSI2 disks in Dinnerbox+ package
83% — UHU Linux 1.1 Beta 4
A
Alder — Windows CE 2.0
Apollo — Windows Phone 8
Astro — Android 0.9 (internal codename)
Aurora — Windows Small Business Server 2011 Essentials
Aurora — Sun SPARCstation 5
B
B52 Rock Lobster — Commodore Amiga 500
Baikal — ASP Linux 7.2
Bali — BL440ZX
Bali — Sun JavaEngine 1
Bamboo — Mandrake Linux 9.1
Banias — Intel 1st generation Pentium M processors
Banister — Intel 440MX
Bantam — Sun SBus FDDI
Barak — StartCom Linux 4.0.0-AS
Barcelona — AMD Opteron "K10" architecture
Barney — Sun StorEdge T3 chassis
Barracuda — Opera 11.10 browser (Also A hard drive series from Seagate)
Bart — Sun SPARCCompilers 5.x
Barton — AMD Athlon XP
Batman — Sun ATM SBus card
Batphone — Sun SBus card for ISDN
Beagle — Novell Linux desktop search and metadata technology due with SLES 10
Becks — Apple Macintosh II
Beetle — Sun SunRay 100
Beefy Miracle — Fedora Linux 17
Bender — Android 1.0/1.1 (internal codename)
BHA — Apple Power Macintosh 7100/66 ("Butt Head Astronomer" Carl Sagan)
Big Electric Cat — Adobe Photoshop 4.0
Big Foot — Quantum 5.25" hard drive
Big Sur — Apple Font Pack
Bigfish — Sun StorEdge 9900 series
Bigmac — Sun 100 MBit Ethernet SBus card
BigTop — Sun SunPro 3.0 compilers
Biltmore — Red Hat Linux 4.2
Bimini — BI440ZX
Birch — Microsoft Windows CE 2.11
Bismillah — Turkix Linux 1.0
Blackbeard — Sun PCI SCSI hardware RAID controller
Blackbird — Apple Macintosh IIfx
Blackbird — Apple Macintosh PowerBook 540
Blackbird — Sun UltraSPARC II
Blackbird+ — Sun UltraSPARC II 250 MHz
Blackbird LC — Apple Macintosh PowerBook 520/520c
Blackford — Intel 5000P chipset
Blackjack — Sun Netra E1 PCI System Expander
Bladerunner — nVidia GeForce 2 Ultra
Bladerunner — Sun GUI for Jumpstart profiles
Blaze — Sun UltraSPARC II
Blaze — Adobe Flash CS3
Blue — Windows 8.1
Blue — Windows Phone 8.1
Blue Box — Apple Mac OS compatibility layer for Rhapsody
Bluebird — Mandrake Linux 8.2
Bluedog — Sun HPC ClusterTools 3.1
Blueringer — Sun 4MB SBus Token Ring
Blueringer II — Sun 16MB SBus Token Ring
Blugu — Apple Workgroup Server 60, 80
Bo — Debian GNU/Linux 1.3
BOB W — Apple Macintosh PowerBook Duo 210/230
Bon Echo — Mozilla Firefox 2.0
Bongo — Apple Macintosh Performa/Power Macintosh 5200
Bonjour — Turkix Linux 10.0a
Bordeaux — Fedora Core 5 Linux
Borealis — Sun cPCI QuadFastEthernet
Borrow — Blag Linux 10000
Braun — Sun JavaStation
BraveHawk 200 DC3 — HP-9000 K370/K570 - 898
Brazil — Apple Macintosh IIvx
Brazil 32 — Apple Macintosh Performa 600
BreadboxA — Sun enclosure for Netra NFS
Breezy |
https://en.wikipedia.org/wiki/Aerial%20survey | Aerial survey is a method of collecting geomatics or other imagery by using airplanes, helicopters, UAVs, balloons or other aerial methods. Typical types of data collected include aerial photography, Lidar, remote sensing (using various visible and invisible bands of the electromagnetic spectrum, such as infrared, gamma, or ultraviolet) and also geophysical data (such as aeromagnetic surveys and gravity. It can also refer to the chart or map made by analysing a region from the air. Aerial survey should be distinguished from satellite imagery technologies because of its better resolution, quality and atmospheric conditions (which can negatively impact and obscure satellite observation). Today, aerial survey is sometimes recognized as a synonym for aerophotogrammetry, part of photogrammetry where the camera is placed in the air. Measurements on aerial images are provided by photogrammetric technologies and methods.
Aerial surveys can provide information on many things not visible from the ground.
Terms used in aerial survey
exposure station or air station the position of the optical center of the camera at the moment of exposure.
flying height the elevation of the exposure station above the datum (usually mean sea level).
altitude the vertical distance of the aircraft above the Earth's surface.
tilt the angle between the aerial camera and the horizontal axis perpendicular to the line of flight.
tip the angle between the aerial camera and the line of flight.
principal point the point of intersection of the optical axis of the aerial camera with the photographical plane.
isocentre the point on the aerial photograph in which the bisector of the angle of tilt meets the photograph.
nadir point the image of the nadir, i.e. the point on the aerial photograph where a plumbline dropped from the front nodal point pierces the photograph.
scale ratio of the focal length of the camera objective and the distance of the exposure station from the ground.
azimuth the clockwise horizontal angle measured about the ground nadir point from the ground survey North meridian in the plane of photograph.
orthomosaic A high-resolution map created by orthophotos, usually via drones is termed as an orthomosaic. Ortho meaning a nadir image and mosaic meaning a collection of images.
Temporal ResolutionTime between observations.
Uses
Aerial surveys are used for:
Archaeology
Fishery surveys
Geophysics in geophysical surveys
Hydrocarbon exploration
Land survey
Mining and mineral exploration
Monitoring wildlife and insect populations (called aerial census or sampling)
Monitoring vegetation and ground cover
Reconnaissance
Transportation projects in conjunction with ground surveys (roadway, bridge, highway)
Aerial surveys use a measuring camera where the elements of its interior orientation are known, but with much larger focal length and film and specialized lenses.
Aerial survey sensors
In order to carry out an aerial survey, a sensor needs to be fixed to the i |
https://en.wikipedia.org/wiki/Statistical%20database | A statistical database is a database used for statistical analysis purposes. It is an OLAP (online analytical processing), instead of OLTP (online transaction processing) system. Modern decision, and classical statistical databases are often closer to the relational model than the multidimensional model commonly used in OLAP systems today.
Statistical databases typically contain parameter data and the measured data for these parameters. For example, parameter data consists of the different values for varying conditions in an experiment (e.g., temperature, time). The measured data (or variables) are the measurements taken in the experiment under these varying conditions.
Many statistical databases are sparse with many null or zero values. It is not uncommon for a statistical database to be 40% to 50% sparse. There are two options for dealing with the sparseness: (1) leave the null values in there and use compression techniques to squeeze them out or (2) remove the entries that only have null values.
Statistical databases often incorporate support for advanced statistical analysis techniques, such as correlations, which go beyond SQL. They also pose unique security concerns, which were the focus of much research, particularly in the late 1970s and early to mid-1980s.
Privacy in statistical databases
In a statistical database, it is often desired to allow query access only to aggregate data, not individual records. Securing such a database is a difficult problem, since intelligent users can use a combination of aggregate queries to derive information about a single individual.
Some common approaches are:
only allowing aggregate queries (SUM, COUNT, AVG, STDEV, etc.)
rather than returning exact values for sensitive data like income, only return which partition it belongs to (e.g. 35k-40k)
return imprecise counts (e.g. rather than 141 records met query, only indicate 130-150 records met it.)
don't allow overly selective WHERE clauses
audit all users queries, so users using system incorrectly can be investigated
use intelligent agents to detect automatically inappropriate system use
For many years, research in this area was stalled, and it was thought in 1980 that, to quote:
The conclusion is that statistical databases are almost always subject to compromise. Severe restrictions on allowable query set sizes will render the database useless as a source of statistical information but will not secure the confidential records.
But in 2006, Cynthia Dwork defined the field of differential privacy, using work that started appearing in 2003. While showing that some semantic security goals, related to work of Tore Dalenius, were impossible, it identified new techniques for limiting the increased privacy risk resulting from inclusion of private data in a statistical database. This makes it possible in many cases to provide very accurate statistics from the database while still ensuring high levels of privacy.
Some further reading
Statistical an |
https://en.wikipedia.org/wiki/RTML | RTML is a proprietary programming language used exclusively by Yahoo!'s Yahoo! Store and Yahoo! Site web hosting services.
History
The language originated at Viaweb, a company founded in 1995 by Paul Graham and Robert T. Morris, as the template language for their e-commerce platform. RTML stands for "Robert T. Morris Language". The RTML editor was offered as an option for customers (usually small businesses) who wanted to customize their online stores more than the built-in templates allowed. The built-in templates were also written in RTML, and provided the starting point for most people who used the language.
In 1998, Yahoo! bought Viaweb for $49.6 million and renamed the service Yahoo! Store. Yahoo! later offered the RTML-based content management system in a hosting platform without a shopping cart, under the name Yahoo! Site.
In 2003, Yahoo! renamed the Yahoo! Store service Yahoo! Merchant Solutions (part of Yahoo! Small Business), and at the same time began offering new customers the choice of a more standard PHP/MySQL web hosting environment instead of the RTML-based Store Editor. , many new Yahoo! Merchant Solutions sites and legacy Yahoo! Stores continue to be built using the Store Editor and RTML.
Language
Although Yahoo!'s documentation does not mention it, RTML is actually implemented on top of a Lisp-based system. The language is somewhat unusual in that the programmer cannot edit the source code directly as text. Instead, keywords are presented as hyperlinks in a browser-based HTML interface. Clicking on a keyword selects it, and its attributes can be edited. Blocks of code can be pushed and popped from a clipboard, using the stack metaphor. The editor maintains the code's s-expression structure automatically, and visually represents it in the web interface using indentation instead of Lisp's parentheses.
Most of the keywords correspond to HTML elements, but there are also conditionals, recursion, and other control flow features that make it a "real" programming language.
RTML templates are evaluated dynamically for each pageview during editing, but for the live site a "publish" process generates static HTML files from them.
Abbreviation
Yahoo!'s documentation used to say that RTML was an acronym for "Real Time Markup Language", but Graham admitted that "we made up various explanations for what RTML was supposed to stand for, but actually I named it after Robert Morris, the other founder of Viaweb, whose username is rtm."
References
External links
Yahoo!'s own RTML Reference
Yahoo! Merchant Solutions Developer Network - Yahoo's Directory of Merchant Solutions Developers
Yahoo! Merchant Solutions Developer site
Lisp in Web-Based Applications - transcript of a talk by Paul Graham that mentions RTML
RTML section of YourStoreForums.com - a forum for Yahoo store owners with a dedicated RTML section
Yahoo Small Business - Yahoo Small Business Official Website
Domain-specific programming languages
Yahoo! |
https://en.wikipedia.org/wiki/SSE | SSE may refer to:
Computing
Senior software engineer
Server-sent events, pushes content to web clients
Simple Sharing Extensions, extends RSS from unidirectional to bidirectional
Sizzle (selector engine), JQuery feature, allowing CSS-like selection of DOM elements
SPARQL Syntax Expressions
SQL Server Express Edition, Microsoft software
Streaming SIMD Extensions, an instruction set extension introduced with the Pentium III
Social Software Engineering, social aspects of software development and the developed software
Searchable symmetric encryption
Economics and finance
Social and solidarity economy
Steady-state economy
Substantial shareholdings exemption, a United Kingdom tax relief relating to capital gains on shares
Supply-side economics
Sustainable Stock Exchanges Initiative, a United Nations initiative to promote a peer-to-peer-based learning platform for stock exchanges
Small-scale enterprise
Exchanges
Shanghai Shipping Exchange, see Shipping industry of China
Shanghai Stock Exchange
Somalia Stock Exchange
Entertainment
Shin Seiki Evangelion, an anime produced by Gainax Animation
Skyrim Special Edition, the remastered version of The Elder Scrolls V: Skyrim
Spaceship Earth (Epcot), an attraction and icon at Epcot, located in the Walt Disney World Resort
Sins of a Solar Empire, a video game created by Ironclad Games
Subspace Emissary, the main story of the game Super Smash Brothers Brawl
Three venues in the UK:
SSE Arena, Belfast
The SSE Arena, Wembley, London
SSE Hydro, Glasgow
Language
Scottish Standard English, or Standard Scottish English, a dialect of the English language
Standard Singapore English, a dialect of the English language
Sign Supported English, the use of British Sign Language with an English grammar
Organizations
SSE plc (formerly Scottish and Southern Energy), an energy company in the UK and Ireland
School for Social Entrepreneurs, a training institution in the UK; founded by Michael Young
School of Social Ecology, an academic unit of the University of California, Irvine
Seed Savers Exchange, a seedbank
Seven Seas Entertainment, a North American publisher of Japanese manga
Society for Scientific Exploration, in fringe science
Society for the Study of Evolution, in science, a professional organization of evolutionary biologists
Southern Star Endemol, an Australian television company
Stockholm School of Economics, one of Northern Europe's leading business schools
Stredoslovenská energetika, an energy company in Slovakia
Symbiosis School of Economics, an Economics college in India
Other
Sensitive site exploitation, a military term used to describe retrieving incriminating information from a location
Silk screen effect, a visual phenomenon seen in rear-projection televisions
Soapsuds enema, a synonym for a large volume enema, whether or not soap is used
South-southeast, a compass direction (one of the eight "half-winds")
Submerged signal ejector, a device used by submarines
Sum of squared estimate of errors, in statistic |
https://en.wikipedia.org/wiki/Gorm | Gorm may refer to:
Computing
Gorm (computing), a rapid application development tool
GORM, the "fantastic ORM library" for the Go programming language
Grails Object-Relational Mapping, see
People
Gorm the Old (died 958), Danish king
Gorm, Danish chieftain defeated by the Welsh king Rhodri the Great in 855
Gorm Jensen (1886–1968), Danish Olympic gymnast
Prince Gorm of Denmark (1919–1991), grandson of King Frederik VIII
Gorm Henrik Rasmussen (born 1955), Danish poet
Gorm Kjernli (born 1981), Norwegian politician
Other uses
Danish ironclad Gorm, a monitor built for the Royal Danish Navy in the 1860s
Gorm Gulthyn, a god in Dungeons & Dragons
House of Gorm, a Danish ruling family
Sail Gorm, a mountain range in Sutherland, Scotland
Island of Gorm, a fictional place from the children's toy 'Gormiti'
, the Irish and Scottish Gaelic word for "blue"; see
Gorm, a range of storage furniture sold by Swedish outlet IKEA |
https://en.wikipedia.org/wiki/Slotket | In computer hardware terminology, slotkets, also known as slockets, (both short for slot to socket adapter) are adapters that allow socket-based microprocessors to be used on slot-based motherboards.
Slotkets were first created to allow the use of Socket 8 Pentium Pro processors on Slot 1 motherboards. Later, they became more popular for inserting Socket 370 Intel Celerons into Slot 1 based motherboards. This lowered costs for computer builders, especially with dual processor machines. High-end motherboards accepting two Slot 1 processors (usually Pentium 2) were widely available, but double-socketed motherboards for the less expensive Socket 370 Celerons were not. The slotkets remained popular in the transition period from Slot to Socket-based Pentium III processors by allowing CPU upgrades in existing Slot 1 motherboards.
Slotkets were never introduced to take advantage of the AMD Athlon processors' transition from the Slot A form factor to the Socket A form factor. Adapters that go the other way around (from socket-based motherboards to slot-based CPUs) have never been introduced, because Socket 8 based motherboards do not support the higher clock frequencies of Slot 1 based processors.
Today, slotkets have largely disappeared, as Intel and AMD have not manufactured CPUs in slot form factors since 1999.
See also
CPU socket
External links
How to Install a Slocket
CPU sockets |
https://en.wikipedia.org/wiki/Young%27s%20Literal%20Translation | Young's Literal Translation (YLT) is a translation of the Bible into English, published in 1862. The translation was made by Robert Young, compiler of Young's Analytical Concordance to the Bible and Concise Critical Comments on the New Testament. Young used the Textus Receptus (TR) and the Masoretic Text (MT) as the basis for his translation. He wrote in the preface to the first edition, "It has been no part of the Translator's plan to attempt to form a New Hebrew or Greek Text—he has therefore somewhat rigidly adhered to the received ones." Young produced a "Revised Version" of his translation in 1887, but he stuck with the Received Text. He wrote in the preface to the Revised Edition, "The Greek Text followed is that generally recognized as the 'Received Text,' not because it is thought perfect, but because the department of Translation is quite distinct from that of textual criticism, and few are qualified for both. If the original text be altered by a translator, (except he give his reasons for and against each emendation,) the reader is left in uncertainty whether the translation given is to be considered as that of the old or of the new reading." A new Revised Edition was released ten years after Robert Young's death on October 14, 1888. The 1898 version was based on the TR, easily confirmed by the word "bathe" in Revelation 1:5 and the word "again" in Revelation 20:5. The "Publishers' Note to the Third Edition" explains, "The work has been subjected to a fresh revision, making no alteration on the principles on which the Translation proceeds, but endeavouring to make it as nearly perfect in point of accuracy on its present lines as possible."
Translation philosophy
The Literal Translation is, as the name implies, a very literal translation of the original Hebrew and Greek texts. The Preface to the Second Edition states:
Therefore, Young used the present tense in many places in which other translations use the past tense, particularly in narratives. For example, the YLT version of Genesis begins as follows:
Young's Literal Translation in the 1898 edition also consistently renders the Hebrew tetragrammaton (divine name) throughout the Old Testament as "Jehovah", instead of the traditional practice of representing the tetragrammaton in English as "" in small capitals, but editions prior to 1898 do say "" in small capitals.
Assessment
Young's translation is closer to the Hebrew than the better-known versions of this passage in English. The Revised Standard Version (RSV), which is based on Biblia Hebraica Stuttgartensia, for example, treats verses 1–3 in this way:
Young's usage of English present tense rather than past tense has been supported by scholars ranging from the medieval Jewish rabbi Rashi (who advised, "[If] you are going to interpret [this passage] in its plain sense, interpret it thus: At the beginning of the creation of heaven and earth, when the earth was (or the earth being) unformed and void [...] God said, 'Let there b |
https://en.wikipedia.org/wiki/Grammar%20checker | A grammar checker, in computing terms, is a program, or part of a program, that attempts to verify written text for grammatical correctness. Grammar checkers are most often implemented as a feature of a larger program, such as a word processor, but are also available as a stand-alone application that can be activated from within programs that work with editable text.
The implementation of a grammar checker makes use of natural language processing.
History
The earliest "grammar checkers" were programs that checked for punctuation and style inconsistencies, rather than a complete range of possible grammatical errors. The first system was called Writer's Workbench, and was a set of writing tools included with Unix systems as far back as the 1970s. The whole Writer's Workbench package included several separate tools to check for various writing problems. The "diction" tool checked for wordy, trite, clichéd or misused phrases in a text. The tool would output a list of questionable phrases, and provide suggestions for improving the writing. The "style" tool analyzed the writing style of a given text. It performed a number of readability tests on the text and output the results, and gave some statistical information about the sentences of the text.
Aspen Software of Albuquerque, New Mexico released the earliest version of a diction and style checker for personal computers, Grammatik, in 1981. Grammatik was first available for a Radio Shack - TRS-80, and soon had versions for CP/M and the IBM PC. Reference Software International of San Francisco, California, acquired Grammatik in 1985. Development of Grammatik continued, and it became an actual grammar checker that could detect writing errors beyond simple style checking.
Other early diction and style checking programs included Punctuation & Style, Correct Grammar, RightWriter and PowerEdit. While all the earliest programs started out as simple diction and style checkers, all eventually added various levels of language processing, and developed some level of true grammar checking capability.
Until 1992, grammar checkers were sold as add-on programs. There were a large number of different word processing programs available at that time, with WordPerfect and Microsoft Word the top two in market share. In 1992, Microsoft decided to add grammar checking as a feature of Word, and licensed CorrecText, a grammar checker from Houghton Mifflin that had not yet been marketed as a standalone product. WordPerfect answered Microsoft's move by acquiring Reference Software, and the direct descendant of Grammatik is still included with WordPerfect.
As of 2019, grammar checkers are built into systems like Google Docs and Sapling.ai, browser extensions like Grammarly and Qordoba, desktop applications like Ginger, free and open-source software like LanguageTool, and text editor plugins like those available from WebSpellChecker Software.
Technical issues
The earliest writing style programs checked for wordy, trite, |
https://en.wikipedia.org/wiki/Ren%C3%A9%20de%20Possel | Lucien Alexandre Charles René de Possel (7 February 1905 – 1974) was a French mathematician, one of the founders of the Bourbaki group, and later a pioneer computer scientist, working in particular on optical character recognition.
Life
Possel was born in Marseille. He had the conventional background for a member of Bourbaki: the École Normale Supérieure, agrégation, and then study in Germany. He left Bourbaki at an early stage: there was an obvious personal matter intruding between him and André Weil who had married De Possel's ex-wife Eveline following her divorce from De Possel in 1937.
Work
De Possel published an early book on game theory in 1936 (Sur la théorie mathématique des jeux de hasard et de réflexion). His later research work in computer science at the Institut Blaise Pascal was in a position of relative isolation, as the subject strove for independence and to move away from the imposed role of service provider in the field of numerical analysis. He became director there in 1960, in succession to Louis Couffignal (1902–1966), until an administrative reorganisation under the C. N. R. S. in 1969. He was a leading figure in pushing for the later Institut de Programmation. He died in Paris.
References
External links
Biography (including 4 pictures) on St-Andrews site.
Nicolas Bourbaki
École Normale Supérieure alumni
1905 births
1974 deaths
20th-century French mathematicians |
https://en.wikipedia.org/wiki/Overlay | Overlay may refer to:
Computers
Overlay network, a computer network which is built on top of another network
Video overlay, techniques to display video on computer display
Hardware overlay, one type of video overlay that uses memory dedicated to the application
Another term for exec, replacing one process by another
Overlay (programming), a technique to reduce the amount of memory used by a program
Overlay keyboard, a specialized keyboard with no pre-set keys
Keyboard overlay, a sheet of printed text sitting between the keys, depicting an alternate keyboard layout
Vector overlay, an analysis procedure in a geographic information system for integrating multiple data sets
Other uses
Overlay architecture, temporary elements that supplement existing buildings and infrastructure for major sporting events or festivals
Overlay control, in semiconductor manufacturing, for monitoring layer-to-layer alignment on multi-layer device structures
Overlay plan, a method of introducing new area codes in telephony
Historic overlay district, a zoning district that applies special rules to a portion of other districts, usually for historic or conservation reasons
When the payoffs in gambling are greater than the costs; see Advantage gambling
See also
Layover (disambiguation)
Over (disambiguation)
Lay (disambiguation)
Overlap (disambiguation)
Overload (disambiguation)
Superposition (disambiguation) |
https://en.wikipedia.org/wiki/Preferred%20Roaming%20List | The Preferred Roaming List (PRL) is a database residing in a wireless (primarily CDMA) device, such as a cellphone, that contains information used during the system selection and acquisition process. In the case of -based CDMA devices, the PRL resides on the R-UIM. The PRL indicates which bands, sub bands, and service provider identifiers will be scanned and in what priority order. Without a PRL, the device may not be able to roam, i.e. obtain service outside of the home area. There may be cases where missing or corrupt PRLs can lead to a customer not having service at all.
On many networks, regularly updating the PRL is advised if the subscriber uses the device outside the home area frequently, particularly if they do so in multiple different areas. This allows the phone to choose the best roaming carriers, particularly "roaming partners" with whom the home carrier has a cost-saving roaming agreement, rather than using non-affiliated carriers. PRL files can also be used to identify home networks along with roaming partners, thus making the PRL an actual list that determines the total coverage of the subscriber, both home and roaming coverage.
The PRL is built by an operator and is normally not accessible to the user. Many operators provide the ability for the user to download the latest PRL to their device by dialing an Over-the-air (OTA) feature code. In the United States, for Verizon / MetroPCS / US Cellular, this feature code is *228 (*ACT). For Sprint, it is ##873283# (it is also possible to use code ##72786# on Android or ##25327# on iOS to completely clear out the service programming and redo OTA activation, which includes updating the PRL). In Canada, for Telus Mobility, the PRL update feature code is *22803 (*ACT03).
PRL structure
The PRL consists of two tables (along with some header and overhead information):
Acquisition Table – An indexed list of frequencies on which the device may search for particular systems. The idea behind the acquisition table is to optimize the acquisition time by identifying only the frequencies that should be searched, rather than searching the entire frequency spectrum. The information contained in each acquisition table entry includes an index, the network type, and associated channel blocks.
System Table – A prioritized list of systems that the device is permitted to access (Preferred Systems) and those that it is explicitly forbidden to access (Negative Systems). Note that it is also possible to indicate forbidden systems using a separate SID/NID Lockout List in the handset; however, this is not a recommended approach as it creates control over system selection outside of the PRL.
Each system table entry belongs to a geographic area known as a GEO. These GEOs are listed in priority order. Each IS-95/1xRTT system is identified by either SID/NID or, in the case of enhanced PRL, SID/NID or MCC/MNC. To support 1xEV-DO systems, the PRL must be IS-683-C or later. Each 1xEV-DO system is identifie |
https://en.wikipedia.org/wiki/Artpack | An artpack is an archive of computer artwork which is distributed in a compressed format such as ZIP or RAR.
While most artpacks today contain either ANSI and ASCII art or hirez VGA, they may also include a combination of RIPscrip art, tracked or otherwise digital music, poetry and editorials, 3D computer animation and related software utilities.
The first artpack ever was The Acquisition, released by ACiD Productions in the early 1990s. Artpacks were originally released on a monthly basis by competing groups in the artscene, naming their files accordingly, i.e. . Very few groups still carry on the tradition of monthly releases in this day, rather they opt to numbering their artpacks in sequence rather than by date, i.e. , releasing their artpacks without any defined schedule.
In retrospect, artpacks are recognized as one of the primary reasons that the early computer art scene is so well preserved and documented in relation to other underground computer scenes at the time.
Notes
Artscene
Computer art |
https://en.wikipedia.org/wiki/Wagon%20Train | Wagon Train is an American Western television series that aired 8 seasons: first on the NBC television network (1957–1962), and then on ABC (1962–1965). Wagon Train debuted on September 18, 1957, and became number one in the Nielsen ratings. It is the fictional adventure story of a large westbound wagon train through the American Old West, from Missouri to California. Its format attracted different famous guest stars per episode, as travelers or as residents of the settlements they encountered. The show initially starred supporting film actor Ward Bond as the wagon master (replaced after his death in 1960 by John McIntire) and Robert Horton as the scout (eventually replaced by similar-looking Robert Fuller when Horton opted to leave the series).
The series was inspired by the 1950 film Wagon Master and the 1930 early widescreen film The Big Trail, both featuring Ward Bond.
The series influenced the development of Star Trek, pitched as "Wagon Train to the stars" and launched in 1966.
Overview
The series chronicles the adventures of a wagon train from St. Joseph, Missouri, across the plains of the Midwestern United States and the Rocky Mountains to Sacramento, California. It features the trials of the series regulars, who conducted the train through the American West.
Episodes revolve around the stories of guest characters portraying members of the massive wagon train or encountered by it. Many starring roles were played by already famous actors such as Ernest Borgnine, Bette Davis, Jane Wyman, Ronald Reagan, Lee Marvin, and Joseph Cotten. Episode titles routinely emphasize the guest characters, such as "The Willy Moran Story" and "The Echo Pass Story".
As a favor to Ward Bond, film director John Ford joined the show to direct a 1960 segment titled "The Colter Craven Story", which includes many members of the "John Ford Stock Company", momentarily featuring John Wayne speaking from the shadows and billed in the credits as "Michael Morris".
Cast
The regular cast includes:
Ward Bond as wagon master Major Seth Adams (1957–61, seasons 1–4). Bond died of a heart attack in the middle of the fourth season, and was replaced by John McIntire as wagon master. No explanation was ever given on the show.
Robert Horton as scout Flint McCullough (1957–62, seasons 1–5).
John McIntire as Christopher Hale (1961–65, seasons 4–8), replacing Bond as wagon master upon Bond's death. McIntire had guest starred in a Season 3 episode in the role of preacher Andrew Hale, apparently Christopher's brother according to a reference made by Christopher later in the series.
Robert Fuller as scout Cooper Smith (1963–65, seasons 7–8) replacing the McCullough character after Robert Horton left the series. Fuller had previously played a lead in the western series Laramie and physically resembled Horton. Fuller and McIntire rotated top billing from week to week on the series. Fuller even shared the same birthday as Horton, albeit nine years apart.
Frank McGrath as cook Charlie |
https://en.wikipedia.org/wiki/Google%20Desktop | Google Desktop was a computer program with desktop search capabilities, created by Google for Linux, Apple Mac OS X, and Microsoft Windows systems. It allowed text searches of a user's email messages, computer files, music, photos, chats, Web pages viewed, and the ability to display "Google Gadgets" on the user's desktop in a Sidebar.
In September 2011, Google announced it would discontinue a number of its products, including Google Desktop. The reason given was that "In the last few years, there’s been a huge shift from local to cloud-based storage and computing, as well as the integration of search and gadget functionality into most modern operating systems. People now have instant access to their data, whether online or offline. As this was the goal of Google Desktop, the product will be discontinued."
Features
As of January 2008, Google Desktop featured the following functionality:
Sidebar
A prominent feature of the Google Desktop is the Sidebar, which holds several common Gadgets and resides off to one side of the desktop. The Sidebar is available on the Windows and Linux versions of Google Desktop. The Sidebar comes pre-installed with the following gadgets:
Email – a panel which lets one view their own Gmail messages.
Scratch Pad – here the user can store notes; they are saved automatically
Photos – displays a slideshow of photos from the "My Pictures" folder (address can be changed)
News – shows the latest headlines from Google News, and how long ago they were written. The News panel is personalized depending on the type of news that users read.
Weather – shows the current weather for a location specified by the user.
Web Clips – shows updated content from RSS and Atom web feeds.
Google Talk – If Google Talk is installed, double clicking the window title will dock it to the user's sidebar.
Like the Windows Taskbar, the Google Desktop sidebar can be set to Auto-Hide mode, where it will only appear once the user moves the mouse cursor towards the side where it resides. If not on auto-hide, by default the sidebar will always take up about 1/6 – 1/9 of the screen (depending on the screen resolution), and other windows are forced to resize. However, the sidebar can be resized to take less space, and users can disable the "always on top" feature in the options. With the auto-hide feature on, the sidebar temporarily overlaps maximized windows.
Another feature that comes with the Sidebar is alerts. When the Sidebar is minimized, new email and news can be displayed on a pop-up window above the Windows Taskbar.
Quick Find
When searching in the sidebar, deskbar or floating deskbar, Google Desktop displays a "Quick Find" window. This window is filled with six (by default) of the most relevant results from the user's computer. These results update as the user types, and allows use without having to open another browser window.
Deskbars
Deskbars are boxes which enable searching directly from the desktop. Web results will open in a bro |
https://en.wikipedia.org/wiki/CHEX-DT | CHEX-DT (channel 12) is a television station in Peterborough, Ontario, Canada, part of the Global Television Network. Owned and operated by network parent Corus Entertainment, the station maintains studios on Monaghan Road (near Rose Avenue) in the southern portion of Peterborough, and its transmitter is located on Television Hill, just outside the city.
History
The station signed on the air on March 26, 1955, as an independently-owned affiliate of CBC Television; its inaugural broadcast was a National Hockey League ice hockey game. CHEX was founded by a media partnership that already published The Peterborough Examiner newspaper and owned radio station CHEX (now CKRU). The partnership included politician Rupert Davies, who was also involved in a similar arrangement in Kingston that established CKWS-TV. The Davies family sold its media interests to Power Corporation of Canada in 1976. On April 13, 2000, the station was acquired by Canadian media conglomerate Corus Entertainment.
On May 20, 2015, Corus and Bell Media announced an agreement whereby its three CBC stations would leave the public network (after 60 years in the case of CHEX) and "affiliate" with CTV. The affiliation switch took effect on August 31, 2015. Most TV service providers serving the region already carry CBLT, and any that do not will have to add a CBC affiliate such as CBLT to their basic services in order to comply with Canadian Radio-television and Telecommunications Commission (CRTC) regulations.
Legally the affiliation with CTV was described as a "program supply agreement", and not as an "affiliation" (a term with specific legal implications under CRTC rules), as Corus maintained editorial control over the stations' programming and the ability to sell local advertising, and did not delegate responsibility for CTV programs aired by the station to Bell Media. The switch was approved by the CRTC on August 27, 2015, dismissing objections by Rogers Media (who argued that the change was an "affiliation" and thus required CRTC consent to implement, and was not in the public interest because it created duplicate sources of CTV programming), and by a resident who complained that because he only received television over the air, he would lose his ability to receive CBC Television as a result of the disaffiliation.
Following the expiration of CHEX's three-year deal with CTV, the station became a Global owned-and-operated station (O&O) and rebranded itself as Global Peterborough on August 27, 2018; the CHEX branding will be retained for the station's newscasts.
News operation
Local newscasts, branded as CHEX News, air weekdays from 6-9 a.m., at 12:00 p.m., weeknights at 5:00, 5:30, 6:00, and 11:00 p.m., and weekends at 6:00 p.m.
In September 2016, CHEX began to replace CTV News programming with Global News programs, moving its late-night newscast to 11 p.m. to replace the CTV National News (the vacant timeslot at 11:30 p.m. was replaced with ET Canada), and adding an airing |
https://en.wikipedia.org/wiki/Crash | Crash or CRASH may refer to:
Common meanings
Collision, an impact between two or more objects
Crash (computing), a condition where a program is abruptly forcibly terminated for performing an illegal operation.
Cardiac arrest, a medical condition in which the heart stops beating
Couch surfing, temporarily staying at another person's home
Gate crashing, the act of entering an event without invitation
Stock market crash, a sudden dramatic decline of stock prices
Traffic collision, a vehicle hitting another object
Arts and entertainment
Film
The Crash (1932 film), a drama starring Ruth Chatterton
Crash (1974 film), a Norwegian drama directed by Rolf Clemens
Crash!, a 1977 suspense drama starring José Ferrer and Sue Lyon
Crash (1978 film), a made-for-TV docudrama starring William Shatner and Adrienne Barbeau
Crash: The Mystery of Flight 1501, a 1990 made-for-TV film starring Cheryl Ladd
Crash (1996 film), a drama directed by David Cronenberg
Crash (2004 film), directed by Paul Haggis and winner of the 2005 Academy Award for Best Picture
The Crash (2017 film), a thriller directed by Aram Rappaport
Television
Crash (1984 TV series), a Danish science-fiction series
Crash (2008 TV series), an American drama based on the 2004 film
Crash (2009 TV series), an English-language Welsh medical drama series
Çarpışma (), a 2018-19 Turkish TV series
Publications
Crash (J. G. Ballard novel), the basis of the 1996 film
Crash (magazine), dedicated to the ZX Spectrum home computer and published from 1984 to 1991
Crash (Spinelli novel), by Jerry Spinelli, 1996
Crash Magazine, a French independent magazine
Crash! (manga), a 2007 manga series by Yuka Fujiwara
Music
Bands
Crash (South Korean band), a thrash metal band, who formed in 1991 from Seoul
Crash (UK band), an indie rock band, from New York in the 1980s
Albums
Crash (Billy "Crash" Craddock album) (1976)
Crash (Dave Matthews Band album) (1996)
Crash (Decyfer Down album) (2009)
Crash (The Human League album) (1986)
Crash! (album), by guitarist Kenny Burrell (1963)
Crash (Charli XCX album) (2022)
Songs
"Crash" (Cavo song) (2009)
"Crash" (Feeder song) (1997)
"Crash" (The Primitives song) (1988)
"Crash" (Royseven song) (2007)
"Crash" (Gwen Stefani song) (2006)
"Crash" (Have Some Fun), by TKA featuring Michelle Visage (1990)
"Crash" (Usher song) (2016)
"Crash", by Baboon from Something Good Is Going to Happen to You, 2002
"Crash" by Delta Goodrem on her album Bridge Over Troubled Dreams 2021
"Crash", by Shayne Ward from Obsession, 2010
"Crash", by Nicola Roberts from Cinderella's Eyes, 2011
Fictional characters
Crash Bandicoot (character), the primary protagonist in the video game series of the same name
Video games
Burnout Crash!, a spin-off of the Burnout series
Crash Bandicoot, a series of adventure video games
Crash Bandicoot (video game), the first game of the series
Hot Wheels: Crash!, a video game released in 1999 for Microsoft Windows
Card games
Crash |
https://en.wikipedia.org/wiki/Routing%20%28disambiguation%29 | Routing is the process of path selection in a network, such as a computer network or transportation network.
Routing may also refer to:
Route of administration, the path by which a drug, fluid, poison or other substance is brought into contact with the body
Hollowing out an area of wood or plastic using a router (woodworking)
National Routeing Guide, a guide to trains over the United Kingdom's rail network
Routing (hydrology), a technique used to predict the changes in shape of a hydrograph
ABA routing transit number, a bank code used in the United States
Routing number (Canada)
Weather routing
In electronics and computer technologies:
Routing (electronic design automation), a step in the design of printed circuit boards and integrated circuits
The packet forwarding algorithm in a computer network
The role of a router hardware in a computer network
See also
Forwarding (disambiguation)
Route (disambiguation)
Router (disambiguation)
Rout
Vehicle routing problem |
https://en.wikipedia.org/wiki/Remote%20access%20service | A remote access service (RAS) is any combination of hardware and software to enable the remote access tools or information that typically reside on a network of IT devices.
A remote access service connects a client to a host computer, known as a remote access server. The most common approach to this service is remote control of a computer by using another device which needs internet or any other network connection.
Here are the connection steps:
User dials into a PC at the office.
Then the office PC logs into a file server where the needed information is stored.
The remote PC takes control of the office PC's monitor and keyboard, allowing the remote user to view and manipulate information, execute commands, and exchange files.
Many computer manufacturers and large businesses' help desks use this service widely for technical troubleshooting of their customers' problems. Therefore you can find various professional first-party, third-party, open source, and freeware remote desktop applications. Which some of those are cross-platform across various versions of Windows, macOS, UNIX, and Linux. Remote desktop programs may include LogMeIn or TeamViewer.
To use RAS from a remote node, a RAS client program is needed, or any PPP client software. Most remote control programs work with RAS. PPP is a set of industry standard framing and authentication protocols that enable remote access.
Microsoft Remote Access Server (RAS) is the predecessor to Microsoft Routing and Remote Access Server (RRAS). RRAS is a Microsoft Windows Server feature that allows Microsoft Windows clients to remotely access a Microsoft Windows network.
History
The term was originally coined by Microsoft when referring to their built-in Windows NT remote access tools. RAS is a service provided by Windows NT which allows most of the services which would be available on a network to be accessed over a modem link. The service includes support for dialup and logon, presents the same network interface as the normal network drivers (albeit slightly slower). RAS works with several major network protocols, including TCP/IP, IPX, and NBF. It is not necessary to run Windows NT on the client—there are client versions for other Windows operating systems. RAS enables users to log into an NT-based LAN using a modem, X.25 connection or WAN link.
Starting in the mid-1990s, several manufacturers such as U.S. Robotics produced "modem terminal servers". Instead of having RS-232 ports, these would directly incorporate an analog modem. These devices were commonly used by Internet service providers to allow consumer dial-up. Modern versions interface to an ISDN PRI instead of having analog modem ports.
Remote access services are now commonly used for online technical support for personal computers. The first instance of this was in 1987 in the United Kingdom, provided by a company called Jade Technologies. This used the MS-DOS based program called PC Anywhere to directly link into MS-DOS and early W |
https://en.wikipedia.org/wiki/Voice%20over%20WLAN | Voice over Wireless LAN (VoWLAN), also Voice over WiFi (VoWiFi), is the use of a wireless broadband network according to the IEEE 802.11 standards for the purpose of vocal conversation. In essence, it is Voice over IP (VoIP) over a Wi-Fi network. In most cases, the Wi-Fi network and voice components supporting the voice system are privately owned.
VoWLAN can be conducted over any Internet accessible device, including a laptop, PDA or VoWLAN units which look and function like DECT and cellphones. Just like for IP-DECT, the VoWLAN's main advantages to consumers are cheaper local and international calls, free calls to other VoWLAN units and a simplified integrated billing of both phone and Internet service providers.
Although VoWLAN and 3G have certain feature similarities, VoWLAN is different in the sense that it uses a wireless internet network (typically 802.11) rather than a cellular network. Both VoWLAN and 3G are used in different ways, although with a femtocell the two can deliver similar service to users and can be considered alternatives.
Applications
For a single location organisation it enables use of existing Wi-Fi network for low (or no) cost of use VoIP (hence VoWLAN) communication in a similar manner to land mobile radio system or walkie-talkie systems with push to talk and emergency broadcast channels. They are also used across multiple locations for mobile workers such as delivery drivers, these workers need to take advantage of 3G type services whereby a cellular company provide data access between the handheld device and the companies back-end network.
Benefits
A voice over WLAN system offers several benefits to organizations, such as hospitals and warehouses. Such advantages include increased mobility and cost savings. For instance, nurses and doctors within a hospital can maintain voice communications at any time at less cost, compared to cellular service.
Types
as an extension to cellular network using Generic Access Network or Unlicensed Mobile Access (the equivalent but more commercial term).
as a local network independent of cellular company.
Design considerations
A Wi-Fi network that supports voice telephony must be carefully designed in a way that maximizes performance and is able to support the applicable call density. A voice network includes call gateways in addition to the Wi-Fi access points. The gateways provide call handling among wireless IP phones and connections to traditional telephone systems. The Wi-Fi network supporting voice applications must provide much stronger signal coverage than what's needed for most data-only applications. In addition, the Wi-Fi network must provide seamless roaming between access points.
Commercial service
One of the attractions of VoWLAN is that it uses widely available Wi-Fi and as such can be used without involving a service provider (e.g. running a Skype client on a laptop connected to the internet over Wi-Fi). However, there are network operators who use this technolog |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.