source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Shunting%20yard
|
Shunting yard may refer to:
Classification yard
Shunting yard algorithm
British term for rail yard
|
https://en.wikipedia.org/wiki/Shunting%20yard%20algorithm
|
In computer science, the shunting yard algorithm is a method for parsing arithmetical or logical expressions, or a combination of both, specified in infix notation. It can produce either a postfix notation string, also known as Reverse Polish notation (RPN), or an abstract syntax tree (AST). The algorithm was invented by Edsger Dijkstra and named the "shunting yard" algorithm because its operation resembles that of a railroad shunting yard. Dijkstra first described the shunting yard algorithm in the Mathematisch Centrum report MR 34/61.
Like the evaluation of RPN, the shunting yard algorithm is stack-based. Infix expressions are the form of mathematical notation most people are used to, for instance or . For the conversion there are two text variables (strings), the input and the output. There is also a stack that holds operators not yet added to the output queue. To convert, the program reads each symbol in order and does something based on that symbol. The result for the above examples would be (in Reverse Polish notation) and , respectively.
The shunting yard algorithm will correctly parse all valid infix expressions, but does not reject all invalid expressions. For example, is not a valid infix expression, but would be parsed as . The algorithm can however reject expressions with mismatched parentheses.
The shunting yard algorithm was later generalized into operator-precedence parsing.
A simple conversion
Input:
Push 3 to the output queue (whenever a number is read it is pushed to the output)
Push + (or its ID) onto the operator stack
Push 4 to the output queue
After reading the expression, pop the operators off the stack and add them to the output.
In this case there is only one, "+".
Output:
This already shows a couple of rules:
All numbers are pushed to the output when they are read.
At the end of reading the expression, pop all operators off the stack and onto the output.
Graphical illustration
Graphical illustration of algorithm, using a three-way railroad junction. The input is processed one symbol at a time: if a variable or number is found, it is copied directly to the output a), c), e), h). If the symbol is an operator, it is pushed onto the operator stack b), d), f). If the operator's precedence is lower than that of the operators at the top of the stack or the precedences are equal and the operator is left associative, then that operator is popped off the stack and added to the output g). Finally, any remaining operators are popped off the stack and added to the output i).
The algorithm in detail
while there are tokens to be read:
read a token
if the token is:
- a number:
put it into the output queue
- a function:
push it onto the operator stack
- an operator o1:
while (
there is an operator o2 at the top of the operator stack which is not a left parenthesis,
and (o2 has greater precedence than o1 or (o1 and o2 have the same pre
|
https://en.wikipedia.org/wiki/Birkenhead%20Hamilton%20Square%20railway%20station
|
Birkenhead Hamilton Square railway station (commonly shortened to Hamilton Square station) serves the town of Birkenhead, in Merseyside, England, on the Wirral Line of the Merseyrail network. The station is close to Hamilton Square in Birkenhead.
History
Hamilton Square station was built by the Mersey Railway and opened on 1 February 1886. The station building was designed by G. E. Grayson in Italianate style, and has been designated as a Grade II listed building. It stood on that railway's original route from James Street station in Liverpool to Green Lane, later extended to Rock Ferry and Birkenhead Park. Just south of the station, the lines towards Rock Ferry and Birkenhead Park diverge; this junction was originally built as a flat crossing.
With the platforms being at a deep level, three hydraulic lifts were provided to transport passengers from ground level to the platforms and back, as well as flights of steps. Each lift was able to accommodate up to 100 passengers at a time and took 45 seconds to travel in each direction. The lifts were installed by Easton and Anderson.
By 1970 all-electric lifts were in operation, each with a capacity of 70 persons, these lifts having the Ward Leonard control system, which gave gentle stops and starts, blistering acceleration, and a fast transit time.
The first electric train passenger service ran through the station on 3 May 1903, with a 650 V DC fourth rail system and Mersey Railway electric units built by Westinghouse. Despite the journey being far quicker than travel aboard the Mersey Ferry service, passengers were not keen on travelling underground due to the smoke from the previous coal-powered steam locomotives. A Frequent electric trains sign was erected on the outside of the station's large hydraulic lift tower (slightly below the position of the present sign) to publicise these cleaner trains. The booking hall had a central ticket office, as was popular on the London Underground.
In the 1970s, as part of the expansion programme of the Merseyrail network, a burrowing junction was built at Hamilton Square so that trains heading towards New Brighton and West Kirby did not have to cross the path of trains coming from Rock Ferry on the flat crossing. Along with the construction of the loop tunnel in the centre of Liverpool, this improved the capacity of the Wirral Line, allowing increased train frequencies. The burrowing junction required the construction of a new -long tunnel, dug at a depth of between and , between Hamilton Square and Lorn Street and directly beneath the Town Hall and Market Street.
As part of the project, Hamilton Square gained a new platform (Platform 3) for New Brighton and West Kirby services, and the rest of the station was refurbished. The signal box was closed on 9 May 1977, with signalling operation transferred to James Street, when Hamilton Square's burrowing junction and platform came into use. Unfortunately, this investment coincided with the significant declin
|
https://en.wikipedia.org/wiki/Operating%20system%20abstraction%20layer
|
An operating system abstraction layer (OSAL) provides an application programming interface (API) to an abstract operating system making it easier and quicker to develop code for multiple software or hardware platforms.
OS abstraction layers deal with presenting an abstraction of the common system functionality that is offered by any Operating system by the means of providing meaningful and easy to use Wrapper functions that in turn encapsulate the system functions offered by the OS to which the code needs porting. A well designed OSAL provides implementations of an API for several real-time operating systems (such as vxWorks, eCos, RTLinux, RTEMS). Implementations may also be provided for non real-time operating systems, allowing the abstracted software to be developed and tested in a developer friendly desktop environment.
In addition to the OS APIs, the OS Abstraction Layer project may also provide a hardware abstraction layer, designed to provide a portable interface to hardware devices such as memory, I/O ports, and non-volatile memory. To facilitate the use of these APIs, OSALs generally include a directory structure and build automation (e.g., set of makefiles) to facilitate building a project for a particular OS and hardware platform.
Implementing projects using OSALs allows for development of portable embedded system software that is independent of a particular real-time operating system. It also allows for embedded system software to be developed and tested on desktop workstations, providing a shorter development and debug time.
Implementations
TnFOX
MapuSoft Technologies - provides a commercial OS Abstraction implementation allowing software to support multiple RTOS operating systems.
ClarinoxSoftFrame – middleware which provides OS abstraction targeting wireless embedded device and system development. It comprises wireless protocol stacks, development tools and memory management techniques in addition to the support of desktop and a range of real-time operating systems
IBM's Rhapsody
ACE
External links
http://opensource.gsfc.nasa.gov/projects/osal/index.php
http://osal.sf.net
https://github.com/nasa/osal
http://www.clarinox.com/index.php?id=34
http://ntmio.com/
https://www.mapusoft.com/mapusoft-os-abstraction-layer/
Operating system technology
|
https://en.wikipedia.org/wiki/WNW
|
WNW may stand for:
West-northwest, a compass point
West Norwood railway station, London, National Rail station code WNW
Wideband Networking Waveform, a military radio protocol
|
https://en.wikipedia.org/wiki/Earl%20Weaver%20Baseball
|
Earl Weaver Baseball is a baseball video game (1987) designed by Don Daglow and Eddie Dombrower and published by Electronic Arts. The artificial intelligence for the computer manager was provided by Baseball Hall of Fame member Earl Weaver, then manager of the Baltimore Orioles, based on a lengthy series of interviews. EWB was a major hit, and along with John Madden Football helped pave the way for the EA Sports brand, which launched in 1992. A Sega Genesis version was planned but cancelled.
Innovations
Earl Weaver Baseball is remembered for introducing many innovations to the computer sports game industry. It was the first commercial computer sports game to allow players to simulate an entire season of games without actually showing each game play-by-play on the screen. The Amiga version featured voice synthesis, a first in a sports computer game. Unlike baseball games released since, names were represented phonetically, so that even custom-created players could be announced by the synthesized voice. For the first time, different stadiums were shown graphically on the screen, with gameplay adjusted for their actual dimensions. Defunct or demolished stadiums were included, such as the Polo Grounds (New York), Griffith Stadium (Washington, D.C.), Ebbets Field (Brooklyn, New York), and Sportsman's Park (St. Louis).
Earl Weaver Baseball II
Earl Weaver Baseball II (EWB2) was the sequel to the classic game, and featured many advances, including the first full 3D camera that would render a television-style viewing experience. However, the game was released prematurely by Electronic Arts, and it suffered from quality and performance problems.
I Got It Baseball
In 2002, Dombrower released a version of EWB2 called I Got It Baseball as shareware, though in this version, the gamer can only manage, not participate. However, the managerial AI still remains, though now called "The Skipper". Also intact are the physics engine, the player AI, the fully developed team, player, and ballpark editors; stat accumulation, and a now-commonplace "QuickPlay" option. It can be downloaded at his website.
Reception
Earl Weaver Baseball was very successful for EA. Computer Gaming World in 1987 called the game "undoubtedly the most exciting sports simulations to be released in years". It praised the game's graphics and audio, and noted its extensive offensive and defensive options. In 1988 the magazine noted that "wind, ball and player speed, and playing surface can all affect a given play's result. To offer all this and the ability to play in both strategy/action and strategy only mode is simply awesome". Game reviewers Hartley and Patricia Lesser complimented the game in their "The Role of Computers" column in Dragon #126 (1987), calling it "the finest computer simulation for baseball we’ve ever seen" and "impressive beyond belief". The Lessers reviewed the IBM version of the game in the following issue (#127), and gave the game 4½ stars. They later reviewed the
|
https://en.wikipedia.org/wiki/Blind%20write
|
In computing, a blind write occurs when a transaction writes a value without reading it. Any view serializable schedule that is not conflict serializable must contain a blind write.
In particular, a write wi(X) is said to be blind if it is not the last action of resource X and the following action on X is a write wj(X).
Transaction processing
|
https://en.wikipedia.org/wiki/SUSE%20Linux%20Enterprise
|
SUSE Linux Enterprise (SLE) is a Linux-based operating system developed by SUSE. It is available in two editions, suffixed with Server (SLES) for servers and mainframes, and Desktop (SLED) for workstations and desktop computers. Its major versions are released at an interval of 3–4 years, while minor versions (called "Service Packs") are released about every 12 months. SUSE Linux Enterprise products receive more intense testing than the upstream openSUSE community product, with the intention that only mature, stable versions of the included components will make it through to the released enterprise product.
It is developed from a common code base with other SUSE Linux Enterprise products.
IBM's Watson was built on IBM's POWER7 systems using SLES. HPE's Frontier, world's first and fastest exascale supercomputer runs on SUSE's SLES 15 (HPE Cray OS).
In March 2018, SUSE Product Manager Jay Kruemcke wrote in SUSE blog that SUSE Linux Enterprise developers have ported it to Raspberry Pi.
SUSE Linux Enterprise Server
SLES was developed based on SUSE Linux by a small team led by Marcus Kraft and Bernhard Kaindl as principal developer who were supported by Joachim "Jos" Schröder. It was first released on October 31, 2000 as a version for IBM S/390 mainframe machines. In December 2000, the first enterprise client (Telia) was made public. In April 2001, the first SLES for x86 was released.
From a business perspective, SLES is not only a technical offering, but also has entangled a commercial offering (services and support). The initial business model was inspired by recurrent charges established in the mainframe world at this time, and innovated by Jürgen Geck and Malcom Yates. Based on customer needs and feedback as well as other evolving Linux based offerings the business model has been reworked by different people in the subsequent years until today.
SUSE Linux Enterprise Server 9 (SLES 9) was released in August 2004. Service Pack 4 was released in December 2007. It was supported by hardware vendors including IBM, HP, Sun Microsystems, Dell, SGI, Lenovo, and Fujitsu Siemens Computers.
SUSE Linux Enterprise Server 10 (SLES 10) was released in July 2006, and is also supported by the major hardware vendors. Service pack 4 was released in April 2011. SLES 10 shared a common codebase with SUSE Linux Enterprise Desktop 10—Novell's desktop distribution for business use—and other SUSE Linux Enterprise products.
SUSE Linux Enterprise Server 11 (SLES 11) was released on March 24, 2009 and included Linux kernel 2.6.27, Oracle Cluster File System Release 2, support for the OpenAIS cluster communication protocol for server and storage clustering, and Mono 2.0. SLES 11 SP1 (released May 2010) rebased the kernel version to 2.6.32. In February 2012, SLES 11 SP2 was released, based on kernel version 3.0.10.
SLES 11 SP2 included a Consistent Network Device Naming feature for Dell servers.
SUSE Linux Enterprise Server 12 (SLES 12) beta was made available on Febru
|
https://en.wikipedia.org/wiki/Webfoot%20Technologies
|
Webfoot Technologies is an American developer of personal computer games and video games for various platforms. Titles developed include Hello Kitty: Happy Party Pals and various Dragon Ball Z games for the Game Boy Advance.
Webfoot is best known for its series of Dragon Ball Z games for the Game Boy Advance which were published by Infogrames and Atari. This includes the best selling Dragon Ball Z: The Legacy of Goku series of RPG games. Webfoot has also developed other games based on popular licenses including The Legend of Korra, American Girl, Tonka, Hello Kitty, Fear Factor, and Phil Mickelson Golf.
The firm was founded during the early days of the web by Dana Dominiak and Pascal Pochol. The original catalog of titles included mostly DOS-based games, but they later expanded to Microsoft Windows software and eventually Apple Macintosh, Palm Pilot, Windows Mobile (Pocket PC), and handheld platforms including the Game Boy Advance and Nintendo DS. Webfoot's earliest Windows title was probably the cult classic DROD: Deadly Rooms of Death which was programmed by Erik Hermansen. Several of Webfoot's budget products became popular in the late 1990s with best-sellers such as 3D Frog Frenzy, 3D Pinball Express, Super Huey III, and Mahjong Ultimate.
Handheld games
American Girl: Kit Mystery Challenge! for Nintendo DS
American Girl: Julie Finds a Way for Nintendo DS
Dream Day Wedding for Nintendo DS
Dragon Ball Z: The Legacy of Goku for Game Boy Advance
Dragon Ball Z: The Legacy of Goku II for Game Boy Advance
Dragon Ball Z: Buu's Fury for Game Boy Advance
Dragon Ball GT: Transformation for Game Boy Advance
Dragon Ball Z: Taiketsu for Game Boy Advance
Dragon Ball Z Legacy of Goku I and II: 2 Games In 1 for Game Boy Advance
Dragon Ball Z Buu's Fury and Dragon Ball GT Transformations Dual Pack for Game Boy Advance
Fabulous Finds for Nintendo DS
Fancy Nancy: Tea Party Time for Nintendo DS
Hello Kitty: Happy Party Pals for Game Boy Advance
Homie Rollerz for Nintendo DS
Mahjong: Ancient China Adventure for Nintendo DS
My Little Pony Crystal Princess: The Runaway Rainbow for Game Boy Advance
My Little Pony: Pinkie Pie's Party for Nintendo DS
Scripp's Spelling Bee for Nintendo DS
Texas Hold'em Poker Pack for Nintendo DS
The Biggest Loser for Nintendo DS
The Legend of Korra: A New Era Begins for the Nintendo 3DS
The Trash Pack for Nintendo DS and Nintendo 3DS
Tonka on the Job for Game Boy Advance
You Don't Know Jack for Nintendo DS
Console games
Mahjong Party for Wii
Published PC games
3D Alien Invasion
3D Brick Bustin' Madness / 3D Brick Busters
3D Bubble Burst / Sea Bubble Burst
3D Bug Attack
3D Caveman Rocks / Journey to Stonehenge
3D Cube Hopper/ Boingers / Jumpy's World
3D Coyote Helicopter Hunter / BSE Hunter
3D Dragon Castle / 3D Dragon Duel
3D Frog Frenzy
3D Galaxy Fighters
3D Marble Flip
3D Maze Man: Amazing Adventures / 3D Frog Man / 3D Ms. Maze / Lady Cruncher / Cruncher in Mazeland
3D Missile Madness
3D
|
https://en.wikipedia.org/wiki/Libavcodec
|
libavcodec is a free and open-source library of codecs for encoding and decoding video and audio data.
libavcodec is an integral part of many open-source multimedia applications and frameworks. The popular MPV, xine and VLC media players use it as their main, built-in decoding engine that enables playback of many audio and video formats on all supported platforms. It is also used by the ffdshow tryouts decoder as its primary decoding library. libavcodec is also used in video editing and transcoding applications like Avidemux, MEncoder or Kdenlive for both decoding and encoding.
libavcodec contains decoder and sometimes encoder implementations of several proprietary formats, including ones for which no public specification has been released. As such, a significant reverse engineering effort is part of libavcodec development. Having such codecs available within the standard libavcodec framework gives a number of benefits over using the original codecs, most notably increased portability, and in some cases also better performance, since libavcodec contains a standard library of highly optimized implementations of common building blocks, such as DCT and color space conversion. However, while libavcodec does strive to achieve decoding that is bit-exact to their official format implementations, occasional bugs and missing features in such re-implementations can sometimes introduce playback compatibility problems for certain files.
Implemented video codecs
libavcodec includes video decoders and/or encoders for the following formats, this list is not exhaustive:
Animated GIF
Asus video format v1 and v2
AVS (decoding only, encoding through libxavs)
AV1
CamStudio format (decoding only)
CineForm (decoding only)
Cinepak
Creative YUV (CYUV, decoding only)
Dirac
DNxHD
Duck Corporation Truemotion 1, 2, and RT codecs (Decoding only)
FFV1
Flash Screen Video v1 and v2
H.261
H.262/MPEG-2 Part 2
H.263
H.264/MPEG-4 AVC (native decoder, encoding through x264 and hardware encoding)
H.265 HEVC (native decoder, encoding through x265 and hardware encoding)
Huffyuv
id Software RoQ Video
Indeo (decoding only)
Lagarith (decoding only)
MJPEG
MPEG-1
MPEG-4 Part 2 (the format used for example by the popular DivX and Xvid codecs)
Apple ProRes
QuickDraw (decoding only)
QuickTime: Graphics (decoding only), Video (decoding only) and Animation (RLE)
RealVideo RV10 and RV20
RealVideo RV30 and RV40 (decoding only)
SheerVideo (decoding only)
Smacker video (decoding only)
Snow
Sorenson Spark under the name FLV1
SVQ1
SVQ3 (decoding only)
Theora (native decoder, encoding through libtheora)
TrueMotion v1 and v2 (decoding only)
VC-1 (decoding only)
Sierra VMD Video (decoding only)
VMware VMnc (decoding only)
VP3 (decoding only)
VP5 (decoding only)
VP6 (decoding only)
VP7 (decoding only)
VP8 (native decoder, encoding through libvpx)
VP9 (native decoder, encoding through libvpx)
VQA (decoding only)
WMV version 7 and 8
WMV version 9 (de
|
https://en.wikipedia.org/wiki/Milhouse%20of%20Sand%20and%20Fog
|
"Milhouse of Sand and Fog" is the third episode of the seventeenth season of the American animated television series The Simpsons. It originally aired on Fox network in the United States on September 25, 2005.
Plot
During Reverend Lovejoy's sermon, Maggie is scratching. The family takes Maggie to see Dr. Hibbert, who diagnoses Maggie with chicken pox. Inspired by Ned Flanders' suggestion of purposely exposing his sons to chicken pox, Homer invites all the neighborhood kids over to the Simpson house for a "pox party". He ends up catching it himself, by drinking from Maggie's milk bottle, having no childhood immunity. Milhouse's parents Luann and Kirk attend the party, and after getting drunk on Marge's custom Margaritas, they resume their relationship.
Milhouse feels neglected because his parents are not fawning over him as they did while they were separated. He schemes to break them up again, and Bart helps him with a plot borrowed from The O.C.. The boys place a bra, belonging to Marge, on Kirk's bed. Luann finds the bra, assumes Marge is having an affair with Kirk, and informs Homer. When Homer confronts Marge, she angrily denies the allegation and kicks him out of the house.
Prodded by Lisa, Bart confesses to Marge that he left the bra in Kirk's bed, but Marge refuses to reconcile with Homer as he still does not trust her. In order to bring Homer and Marge back together, Lisa inadvertently influences Bart and Milhouse to plan to throw a dummy that looks like Bart off a cliff into the river below, while Homer and Marge, after receiving false messages from each other to meet, watch. However, after breaking his glasses, Milhouse accidentally pushes the real Bart off the cliff. Homer leaps into the rapids to rescue him, but they end up clinging on to a rock near a waterfall. There Bart confesses to Homer what he did, causing Homer to strangle him. Marge tells them to trust her, and let go of the rock. They let go and she catches them, swinging from a rope attached to a tree. Once safely on the river bank, Marge and Homer reconcile. They see Milhouse, thinking Bart died, jump off the cliff, leaving his fate unresolved. Marge wonders if Milhouse can swim, to which Bart asks "What do you think?"
Production
Writer Patric M. Verrone based the episode on his own experiences at the time since he was raising three children and dealing with chickenpox.
Cultural references
In August 2022, screenshots from this episode were used in social media to erroneously show that the series had predicted the 2022–2023 mpox outbreak. Instead, the screenshots from this episode showing Homer with rashes were combined with an image of Homer with a monkey from the ninth season episode "Girly Edition."
References
External links
The Simpsons (season 17) episodes
2005 American television episodes
|
https://en.wikipedia.org/wiki/Howard%20Beale%20%28Network%29
|
Howard Beale is a fictional character from the film Network (1976) and one of the central characters therein. He is played by Peter Finch, who won a posthumous Oscar for the role.
Plot summary
In Network, Beale, the anchorman for the UBS Evening News, struggles to accept the ramifications of the social ailments and depravity existing in the world. His producers exploit him for high ratings and avoid giving him the psychiatric assistance that some, especially news division president and his best friend, Max Schumacher (William Holden), think he needs.
Beale, a long-standing and respected anchorman who began his career at UBS in 1950, saw his ratings begin a slow but steady decline in 1969. In 1970, his wife died and he became lonely, causing him to drink heavily. In September 1975, the UBS network decided to fire him, leading him to engage in binge drinking as he feels there is nothing left for him in the world. Beale's career as "The Mad Prophet of the Airwaves" is sparked by his half-joking offer, after receiving his two weeks' notice, to kill himself on nationwide TV. He subsequently apologizes to his viewers, telling them he "ran out of bullshit." Viewers respond positively and the network producer Diana Christensen (Faye Dunaway) wants him to serve as an "angry man" news anchorman. Schumacher feels that Christensen is exploiting his troubled friend, but Beale happily embraces the role of the "angry man". His foul-mouthed tirades feature a dark vision of America as a nation in decline as he speaks about the "depression" (i.e the recession caused by the Arab oil shock of 1973-74), OPEC, rising crime, the collapse of traditional values and other contemporary issues. Beale believes his ranting is guided by a voice in his head, talking of having some mystical connection to some sort of higher supernatural power, but Schumacher believes he is losing his mind. However, encouraged by Christensen, the executives at UBS decide that his unhinged ranting about the state of the world, especially when he repeatedly shouts "I'm as mad as hell and I'm not going to take this anymore!", will revive ratings at the struggling network. He is given his own show where he can say whatever he likes, and the carnivalesque show becomes the number one show in the United States. Beale shouts about whatever issue of the moment is agitating him until he passes out. At one point, he rants about how television is an "illusion" that peddles fantasies that can never be realized.
Unfortunately for the network, he exposes the ties between CCA, the corporation that owns the network, and business interests in Saudi Arabia. At a time when Saudi Arabia was unpopular in the United States owing to the Arab oil boycott of 1973-74, Beale charges that the House of Saud is buying up the United States and demands his audience send telegrams to the White House to save the United States from being bought up by the Saudis. Arthur Jensen, CCA chairman and chief stockholder (played by Ned
|
https://en.wikipedia.org/wiki/WPF
|
WPF may refer to:
Computing
WebSphere Partition Facility, an IBM facility
Windows Presentation Foundation, a graphical subsystem for rendering user-interfaces in applications using Microsoft Windows
Sports and games
Women's Professional Fastpitch, professional women's softball league
World Pickleball Federation
World Pump It Up Festival, an annual competition/event on the dance game Pump It Up
Other
Western People's Front, a political party in Sri Lanka, active in the Western Province
Wolf Preservation Foundation, an international non-profit organisation
World Population Foundation, founded in 1987 in the Netherlands
|
https://en.wikipedia.org/wiki/WJZ%20%28AM%29
|
WJZ (1300 kHz) is a commercial AM radio station in Baltimore, Maryland. It is owned by Audacy, Inc., and broadcasts a sports betting radio format, carrying the BetQL network during the day and evening, with CBS Sports Radio heard nights and weekends. The studios are on Clarkview Road in Baltimore, off Jones Falls Expressway (Interstate 83).
WJZ is powered at 5,000 watts, using a directional antenna with a five-tower array. The transmitter site is on Clays Lane in Windsor Mill. Programming is simulcast on FM translator W285EJ at 104.9 MHz in White Marsh, Maryland. It is also heard on 106.5 WWMX's HD-2 digital subchannel.
History
WEAR (1922–1924)
Federal Communications Commission records list the station's "First License Date" as November 3, 1924, reflecting the date an initial license was issued for the station as WFBR. However, the station has traditionally traced its history to a predecessor station, the Baltimore American newspaper's WEAR, which was first licensed in 1922.
Effective December 1, 1921, the U.S. Department of Commerce, in charge of radio at the time, adopted a regulation formally establishing a broadcasting station category, which set aside the wavelength of 360 meters (833 kHz) for entertainment broadcasts, and 485 meters (619 kHz) for farm market and weather reports. On June 3, 1922, the Baltimore American & News Publishing Company was issued a license for a new station on the shared 360 meter "entertainment" wavelength. The station's call letters, WEAR, were randomly assigned from a sequential roster of available call signs.
WEAR was the third broadcasting station licensed in the state of Maryland, following two earlier Baltimore grants: WKC, which had been licensed the previous March, followed by WCAO in May.
WEAR's June 8 inaugural program included a speech from Mayor William F. Broening and live musical performances. On June 14, 1922, U.S. President Warren G. Harding's speech at the dedication of the Francis Scott Key Monument at Fort McHenry was broadcast by the station. This is generally considered the first time a President of the United States gave a speech over a civilian radio station.
In 1924 WEAR was reassigned to 1150 kHz. The station was deleted on October 27, 1924.
WFBR (1924–1990)
Equipment formerly used by WEAR was acquired in order to establish another station. On November 3, 1924, the Fifth Regiment of the Maryland National Guard received a license for a station on 1180 kHz. The new station's call letters, WFBR, were also randomly assigned from the sequential list of available call signs; other new stations licensed the same month included WFBK (Hanover, New Hampshire), WFBL (Syracuse, New York), WFBM (Indianapolis, Indiana), WFBN (Bridgewater, Massachusetts), WFBQ (Raleigh, North Carolina), WFBT (Pitman, New Jersey and WFBU (Boston, Massachusetts). A tradition later developed that WFBR could be rendered as "World's First Broadcasting Regiment". Another slogan, also derived from the call letter
|
https://en.wikipedia.org/wiki/PC-MOS/386
|
PC-MOS/386 is a multi-user, multitasking computer operating system produced by The Software Link (TSL), announced at COMDEX in November 1986 for February 1987 release. PC-MOS/386, a successor to PC-MOS, can run many MS-DOS programs on the host machine or a terminal connected to it. Unlike MS-DOS, PC-MOS/386 is optimized for the Intel 80386 processor; however early versions will run on any x86 computer. PC-MOS/386 used to be proprietary, but it was released as open-source software in 2017.
History
The last commercial version produced was v5.01, compatible with MS-DOS 5. It required a memory management unit (MMU) to support memory protection, so was not compatible with 8086 and 8088 processors.
MMU support for 286 class machines was provided using a proprietary hardware shim inserted between the processor and its socket. 386 machines did not require any special hardware.
Multi-user operation suffered from the limitations of the day including the inability of the processor to schedule and partition running processes. Typically swapping from a foreground to a background process on the same terminal used the keyboard to generate an interrupt and then swap the processes. The cost of RAM (over US$500/Mb in 1987) and the slow and expensive hard disks of the day limited performance.
PC-MOS terminals could be x86 computers running terminal emulation software communicating at 9600 or 19200 baud, connected via serial cables. However, the greatest benefit was reached when using standard, "dumb" terminals which shared the resources of the then central 386-based processor. Speeds above this required specialized hardware boards which increased cost, but the speed was not a serious limitation for interacting with text-based programs.
PC-MOS also figured prominently in the lawsuit Arizona Retail Systems, Inc. v. The Software Link, Inc., where Arizona Retail Systems claimed The Software Link violated implied warranties on PC-MOS. The case is notable because The Software Link argued that it had disclaimed the implied warranties via a license agreement on the software's shrinkwrap licensing. The result of the case, which Arizona Retail Systems won, helped to establish US legal precedent regarding the enforceability of shrinkwrap licenses.
There was a year 2000 problem-like issue in this operating system, first manifesting on 1 August 2012 rather than 1 January 2000: files created on the system from this date on would no longer work.
On 21 July 2017 PCMOS/386 was relicensed under GPL v3 and its source code uploaded to GitHub, with the "year 2012" issue corrected.
Commands
Commands supported by PC-MOS Version 4 are:
ABORT
ADDDEV
ADDTASK
ALIAS
AUTOCD
BATECHO
BREAK
CALL
RETURN
CD
CLASS
CLS
COMMAND
COMPFILE
COPY
DATE
DEBUG
DIR
DIRMAP
DISKCOPY
DISKID
DOT
ECHO
ED
ENVSIZE
ERASE
EXCEPT
EXPORT
FILEMODE
FLUSH
FOR
FORMAT
GOTO
HDSETUP
HELP
IF
IMPORT
INSERT
KEY
KEYMAP
MD
MORE
MOS
MOSADM
MSORT
MSYS
NEXT
ONLY
PATH
PAUSE
PR
|
https://en.wikipedia.org/wiki/The%20Software%20Link
|
The Software Link, Inc. (TSL) was a company in Norcross, Georgia that developed software for personal computers from 1986 to 1994. The company was co-founded by Rod Roark and Gary Robertson.
Products
PC-MOS: an MS-DOS-like multiuser operating system with support for multi-tasking on serial terminals;
PC-MOS/386: a later version of PC-MOS using features not present on processors prior to the 80386;
LANLINK: a NetBIOS-ready local area network that leverages serial and parallel port connected platforms; and
MultiLink: a multitasking environment for DOS.
History
PC-MOS figured prominently in the lawsuit Arizona Retail Systems, Inc. v. The Software Link, Inc., where Arizona Retail Systems claimed The Software Link violated implied warranties on PC-MOS. The case is notable because The Software Link argued that it had disclaimed the implied warranties via a license agreement on the software's shrinkwrap licensing. The result of the case, which Arizona Retail Systems won, helped to establish US legal precedent about the enforceability or otherwise of shrinkwrap licensing.
References
Defunct software companies of the United States
Software companies established in 1984
Software companies disestablished in 1997
|
https://en.wikipedia.org/wiki/PDN
|
PDN may refer to:
Digital
PDN Gateway (Packet Data Network Gateway),
PDN Mail, electronic messaging developed by Prime Computer
Public data network
File extension
Portable Draughts Notation (.PDN), the standard computer format for recording draughts games
.PDN, the native format for the graphics editing program Paint.NET
Publication
Pacific Daily News, a newspaper based on Guam
Photo District News, US publication for photographers
Entity
Department of Physiology, Development and Neuroscience, University of Cambridge
National Democratic Party (Argentina) ()
Other
ISO 639:pdn or Podena language, spoken in Indonesia
Phenotypic disease network (PDN)
|
https://en.wikipedia.org/wiki/Windows%20Photo%20Viewer
|
Windows Photo Viewer (formerly Windows Picture and Fax Viewer) is an image viewer included with the Windows NT family of operating systems. It was first included with Windows XP and Windows Server 2003 under its former name. It was temporarily replaced with Windows Photo Gallery in Windows Vista, but was reinstated in Windows 7. This program succeeds Imaging for Windows. In Windows 10, it is deprecated in favor of a Universal Windows Platform app called Photos, although it can be brought back with a registry tweak.
Windows Photo Viewer can show individual pictures, display all pictures in a folder as a slide show, reorient them in 90° increments, print them either directly or via an online print service, send them in e-mail or burn them to a disc. Windows Photo Viewer supports images in BMP, JPEG, JPEG XR (formerly HD Photo), PNG, ICO, GIF and TIFF file formats.
Evolution
Compared to Windows Picture and Fax Viewer, changes have been made to the graphical user interface in Windows Photo Viewer.
Whereas Windows Picture and Fax Viewer uses GDI+, Windows Photo Viewer uses Windows Imaging Component (WIC) and takes advantage of Windows Display Driver Model.
Although GIF files are supported in Windows Photo Viewer, whereas Windows Picture and Fax Viewer displays animated GIFs, Windows Photo Viewer only displays the first frame. Windows Picture and Fax Viewer was also capable of viewing multi-page TIFF files, (except those that employ JPEG compression) as well as annotating the TIFF files. Windows Photo Viewer, on the other hand, has added support for JPEG XR file format and ICC profiles.
Bugs
Some devices and Android phones are able to take photos and screenshots and have a custom ICC Profile being applied to said pictures, however Windows Photo Viewer will render an error when trying to display the picture with an "Windows Photo Viewer can't display this picture because there might not be enough memory available on your computer." exception when an unknown ICC Profile is detected. A patch is available on GitHub that fixes this behavior.
Also regarding ICC profiles, when a custom Display ICC profile is applied after installing a Monitor driver, Windows Photo Viewer wrongly shifts the picture hue to a warm tint. The feature is intentional but greatly exaggerated. This is fixed by removing or replacing the Display ICC Profile.
In Windows 10 and Windows 11
In support documentation, Microsoft states that Windows Photo Viewer is not part of Windows 10, and a user still has it only if they upgraded from Windows 7 or 8.1. However, it can be brought back in Windows 10 and Windows 11 with registry editing, by adding the appropriate entries ("capabilities") in HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows Photo Viewer\Capabilities\FileAssociations. It is also possible to restore the Preview option in the context menu. Windows Photo Viewer itself remains built-in, and is set as default for the Tagged Image File Format files (.tif).
See also
Imaging for
|
https://en.wikipedia.org/wiki/Winlogon
|
Winlogon (Windows Logon) is the component of Microsoft Windows operating systems that is responsible for handling the secure attention sequence, loading the user profile on logon, creates the desktops for the window station, and optionally locking the computer when a screensaver is running (requiring another authentication step). In Windows Vista and later operating systems, the roles and responsibilities of Winlogon have changed significantly.
Overview
Winlogon is launched by the Session Manager Subsystem as a part of the booting process of Windows NT.
Before Windows Vista, Winlogon was responsible for starting the Service Control Manager and the Local Security Authority Subsystem Service, but since Vista these have been launched by the Windows Startup Application (wininit.exe).
The first part of the logon process Winlogon conducts is starting the process that shows the user the logon screen. Before Windows Vista this was done by GINA, but starting with Vista this is done by LogonUI. These programs are responsible for getting user credential and passing them to the Local Security Authority Subsystem Service, which authenticates the user.
After control is given back to Winlogon, it creates and opens an interactive window station, WinSta0, and creates three desktops, Winlogon, Default and ScreenSaver. Winlogon switches from the Winlogon desktop to the Default desktop when the shell indicates that it is ready to display something for the user, or after thirty seconds, whichever comes first.
The system switches back to the Winlogon desktop if the user presses Control-Alt-Delete or when a User Account Control prompt is shown. Winlogon now starts the program specified in the Userinit value which defaults to userinit.exe. This value supports multiple executables.
Responsibilities
Window station and desktop protection
Winlogon sets the protection of the window station and corresponding desktops to ensure that each is properly accessible. In general, this means that the local system will have full access to these objects and that an interactively logged-on user will have read access to the window station object and full access to the application desktop object.
Standard SAS recognition
Winlogon has special hooks into the User32 server that allow it to monitor Control-Alt-Delete secure attention sequence (SAS) events. Winlogon makes this SAS event information available to GINAs/credential providers to use as their SAS, or as part of their SAS. In general, GINAs should monitor SASs on their own; however, any GINA that has the standard ++ SAS as one of the SASs it recognizes should use the Winlogon support provided for this purpose.
SAS routine dispatching
When Winlogon encounters a SAS event or when a SAS is delivered to Winlogon by the GINA, Winlogon sets the state accordingly, changes to the Winlogon desktop, and calls one of the SAS processing functions of the GINA.
User profile loading
When users log on, their user profiles are load
|
https://en.wikipedia.org/wiki/Substring
|
In formal language theory and computer science, a substring is a contiguous sequence of characters within a string. For instance, "the best of" is a substring of "It was the best of times". In contrast, "Itwastimes" is a subsequence of "It was the best of times", but not a substring.
Prefixes and suffixes are special cases of substrings. A prefix of a string is a substring of that occurs at the beginning of ; likewise, a suffix of a string is a substring that occurs at the end of .
The substrings of the string "apple" would be:
"a", "ap", "app", "appl", "apple",
"p", "pp", "ppl", "pple",
"pl", "ple",
"l", "le"
"e", ""
(note the empty string at the end).
Substring
A string is a substring (or factor) of a string if there exists two strings and such that . In particular, the empty string is a substring of every string.
Example: The string ana is equal to substrings (and subsequences) of banana at two different offsets:
banana
|||||
ana||
|||
ana
The first occurrence is obtained with b and na, while the second occurrence is obtained with ban and being the empty string.
A substring of a string is a prefix of a suffix of the string, and equivalently a suffix of a prefix; for example, nan is a prefix of nana, which is in turn a suffix of banana. If is a substring of , it is also a subsequence, which is a more general concept. The occurrences of a given pattern in a given string can be found with a string searching algorithm. Finding the longest string which is equal to a substring of two or more strings is known as the longest common substring problem.
In the mathematical literature, substrings are also called subwords (in America) or factors (in Europe).
Prefix
A string is a prefix of a string if there exists a string such that . A proper prefix of a string is not equal to the string itself; some sources in addition restrict a proper prefix to be non-empty. A prefix can be seen as a special case of a substring.
Example: The string ban is equal to a prefix (and substring and subsequence) of the string banana:
banana
|||
ban
The square subset symbol is sometimes used to indicate a prefix, so that denotes that is a prefix of . This defines a binary relation on strings, called the prefix relation, which is a particular kind of prefix order.
Suffix
A string is a suffix of a string if there exists a string such that . A proper suffix of a string is not equal to the string itself. A more restricted interpretation is that it is also not empty. A suffix can be seen as a special case of a substring.
Example: The string nana is equal to a suffix (and substring and subsequence) of the string banana:
banana
||||
nana
A suffix tree for a string is a trie data structure that represents all of its suffixes. Suffix trees have large numbers of applications in string algorithms. The suffix array is a simplified version of this data structure that lists the start positions of the suffixes in alphabetically sor
|
https://en.wikipedia.org/wiki/Web%20scraping
|
Web scraping, web harvesting, or web data extraction is data scraping used for extracting data from websites. Web scraping software may directly access the World Wide Web using the Hypertext Transfer Protocol or a web browser. While web scraping can be done manually by a software user, the term typically refers to automated processes implemented using a bot or web crawler. It is a form of copying in which specific data is gathered and copied from the web, typically into a central local database or spreadsheet, for later retrieval or analysis.
Scraping a web page involves fetching it and extracting from it. Fetching is the downloading of a page (which a browser does when a user views a page). Therefore, web crawling is a main component of web scraping, to fetch pages for later processing. Once fetched, extraction can take place. The content of a page may be parsed, searched and reformatted, and its data copied into a spreadsheet or loaded into a database. Web scrapers typically take something out of a page, to make use of it for another purpose somewhere else. An example would be finding and copying names and telephone numbers, companies and their URLs, or e-mail addresses to a list (contact scraping).
As well as contact scraping, web scraping is used as a component of applications used for web indexing, web mining and data mining, online price change monitoring and price comparison, product review scraping (to watch the competition), gathering real estate listings, weather data monitoring, website change detection, research, tracking online presence and reputation, web mashup, and web data integration.
Web pages are built using text-based mark-up languages (HTML and XHTML), and frequently contain a wealth of useful data in text form. However, most web pages are designed for human end-users and not for ease of automated use. As a result, specialized tools and software have been developed to facilitate the scraping of web pages.
Newer forms of web scraping involve monitoring data feeds from web servers. For example, JSON is commonly used as a transport mechanism between the client and the web server.
There are methods that some websites use to prevent web scraping, such as detecting and disallowing bots from crawling (viewing) their pages. In response, there are web scraping systems that rely on using techniques in DOM parsing, computer vision and natural language processing to simulate human browsing to enable gathering web page content for offline parsing
History
The history of web scraping dates back nearly to the time when the World Wide Web was born.
After the birth of the World Wide Web in 1989, the first web robot, World Wide Web Wanderer, was created in June 1993, which was intended only to measure the size of the web.
In December 1993, the first crawler-based web search engine, JumpStation, was launched. As there were fewer websites available on the web, search engines at that time used to rely on human administrators to collec
|
https://en.wikipedia.org/wiki/The%20Doe%20Network
|
The Doe Network is a non-profit organization of volunteers who work with law enforcement to connect missing persons cases with John/Jane Doe cases. They maintain a website about cold cases and unidentified persons, and work to match these with missing persons.
Purpose
The organization's website features cold case disappearances and unidentified decedents, to create awareness for such cases and to generate potential leads. Case files are created for both unidentified and missing persons, detailing physical estimations of the subjects as well as circumstances of the disappearance, sightings, and recovery of the unidentified subjects.
Images of the missing and unidentified, including forensic facial reconstructions, tattoos, and age progressions are also posted when available for cases. Cases of murder conviction without a body are also listed, although their cases have been solved. In some instances, the victim could possibly remain unidentified.
The website provides an online form so that visitors can submit potential matches between missing and unidentified persons, which are subsequently reviewed by volunteers prior to submission to authorities. After the form is completed by a reader, 16 members of the Doe Network's administrative panel evaluate the importance of the possible match and whether or not to submit it to investigators handling the case. This organization also works alongside other databases, such as the National Missing and Unidentified Persons System and the NCIC.
The Doe Network features worldwide cases and is presented in various languages.
Since the launch of the Doe Network, more than 600 people have volunteered to take part in case reviews. Members are selected after review of their applications and confirmation of their background information. A core team organizes information that is published on the Web site, compiling approved information received from other members.
History
The Doe Network website was created in 1999 by Jennifer Marra of Michigan as a website database for international long-term missing persons and unidentified victims. Marra turned control of the site over to Helene Wahlstrom of Sweden in 2001.
Helene Wahlstrom joined forces with the Cold Cases Yahoo! group headed by Todd Matthews of Tennessee, and they recruited a wider volunteer group to assist the Doe Network to find potential matches between missing persons and unidentified victims. Matthews had assisted in the 1998 identification of Barbara Ann Hackmann Taylor, who was previously nicknamed "Tent Girl" in her cold case. This success inspired him to create a website to help solve similar cases.
Over the years, the Doe Network has been recognized for its work as one of a number of amateur groups who use the Internet to assist families and law enforcement with trying to identify missing persons and unidentified victims.
Matthews founded a different organization, known as Project EDAN (Everyone Deserves a Name). This is a group of forensic art
|
https://en.wikipedia.org/wiki/Digital%20rights
|
Digital rights are those human rights and legal rights that allow individuals to access, use, create, and publish digital media or to access and use computers, other electronic devices, and telecommunications networks. The concept is particularly related to the protection and realization of existing rights, such as the right to privacy and freedom of expression, in the context of digital technologies, especially the Internet. The laws of several countries recognize a right to Internet access.
Human rights and the Internet
A number of human rights have been identified as relevant with regard to the Internet. These include freedom of expression, privacy, and freedom of association. Furthermore, the right to education and multilingualism, consumer rights, and capacity building in the context of the right to development have also been identified.
APC Internet Rights Charter (2001)
The APC Internet Rights Charter was established by the Association for Progressive Communications (APC) at the APC Europe Internet Rights Workshop, held in Prague, February 2001. The Charter draws on the People's Communications Charter and develops seven themes: internet access for all; freedom of expression and association; access to knowledge, shared learning and creation - free and open source software and technology development; privacy, surveillance and encryption; governance of the internet; awareness, protection and realization of rights. The APC states that "the ability to share information and communicate freely using the internet is vital to the realization of human rights as enshrined in the Universal Declaration of Human Rights, the International Covenant on Economic, Social and Cultural Rights, the International Covenant on Civil and Political Rights and the Convention on the Elimination of All Forms of Discrimination against Women." The APC Internet Rights Charter is an early example of a so-called Internet bill of rights, an important element of digital constitutionalism.
World Summit on the Information Society (WSIS) (2003-2004)
In December 2003 the World Summit on the Information Society (WSIS) was convened under the auspice of the United Nations (UN). After lengthy negotiations between governments, businesses and civil society representatives the WSIS Declaration of Principles was adopted reaffirming human rights:
We reaffirm the universality, indivisibility, interdependence and interrelation of all human rights and fundamental freedoms, including the right to development, as enshrined in the Vienna Declaration. We also reaffirm that democracy, sustainable development, and respect for human rights and fundamental freedoms as well as good governance at all levels are interdependent and mutually reinforcing. We further resolve to strengthen the rule of law in international as in national affairs.
The WSIS Declaration also makes specific reference to the importance of the right to freedom of expression in the "Information Society" in stating:
We reaf
|
https://en.wikipedia.org/wiki/Harry%20Huskey
|
Harry Douglas Huskey (January 19, 1916 – April 9, 2017) was an American computer design pioneer.
Early life and career
Huskey was born in Whittier, in the Smoky Mountains region of North Carolina and grew up in Idaho. He received his bachelor's degree in mathematics and physics at the University of Idaho. He was the first member of his family to attend college. He gained his Master's and then his PhD in 1943 from the Ohio State University on Contributions to the Problem of Geöcze. Huskey taught mathematics to U.S. Navy students at the University of Pennsylvania and then worked part-time on the early ENIAC and EDVAC computers in 1945. This work represented his first formal introduction to computers, according to his obituary in The New York Times.
He visited the National Physical Laboratory (NPL) in the United Kingdom for a year and worked on the Pilot ACE computer with Alan Turing and others. He was also involved with the EDVAC and SEAC computer projects.
Huskey designed and managed the construction of the Standards Western Automatic Computer (SWAC) at the National Bureau of Standards in Los Angeles (1949–1953). He also designed the G-15 computer for Bendix Aviation Corporation, a machine, operable by one person. He had one at his home that is now in the Smithsonian Institution in Washington, D.C.
After five years at the National Bureau of Standards, Huskey joined the faculty of the University of California, Berkeley in 1954 and then University of California, Santa Cruz from 1966. He cofounded the computer and information science program at UC Santa Cruz in 1967. He became director of its computer center. In 1986, UC Santa Cruz named him professor emeritus. While at Berkeley, he supervised the research of pioneering programming language designer Niklaus Wirth, who gained his PhD in 1963. During 1963-1964 Prof. Huskey participated in establishing the Computer Center at IIT Kanpur and convened a meeting there with many pioneers of computing technology. Participants included Forman Acton of Princeton University, Robert Archer of Case Institute of Technology, S. Barton of CDC, Australia, S. Beltran from the Centro de Calculo in Mexico City, John Makepeace Bennett of the University of Sydney, Launor Carter of SDC - author of the subsequent Carter Report on Computer Technology for Schools, David Evans of UC Berkeley, Bruce Gilchrist of IBM-SBC, Clay Perry of UC San Diego, Sigeiti Moriguti of the University of Tokyo, Gio Wiederhold, also of UC Berkeley, Adriaan van Wijngaarden of the Mathematisch Centrum in Amsterdam, Maurice Wilkes of Cambridge University.
Huskey was Professor Emeritus at the University of California after his retirement at the age of 70 in 1986. In 1994 he was inducted as a Fellow of the Association for Computing Machinery. Dag Spicer, senior curator at the Computer History Museum in Mountain View, California, "described Dr. Huskey as a 'Zelig-like character, present at some of computing's greatest moments.'"
Personal lif
|
https://en.wikipedia.org/wiki/Dan%20Hsu
|
Dan "Shoe" Hsu (born 1971) is the former editorial director of the 1UP Network, as well as former editor-in-chief of the video game magazine Electronic Gaming Monthly, a position he held from 2001 to 2008. Hsu attended the University of Michigan. His nickname, "Shoe", refers to the pronunciation of his surname.
Hsu first joined EGM's magazine staff in 1996. Including a year-long absence in 2000 to work at website Gamers.com, Hsu spent 12 years working for EGM before announcing his April 25, 2008 departure from the 1UP Network. Immediately after leaving 1UP, Hsu started a personal blog with former EGM Senior Editor Crispin Boyer called Sore Thumbs Blog. This blog is no longer active.
Hsu co-founded Bitmob (and parent company Bitmob Media, Inc.) with Demian Linn, the former executive producer of GameVideos.com and The 1UP Show. Bitmob.com soft-launched in May 2009.
On December 1, 2009 it was announced via press release that Hsu would be returning to Electronic Gaming Monthly as part of its relaunch, along with Demian Linn.
VentureBeat acquired Bitmob on February 1, 2012. Since then, Bitmob has been incorporated into VentureBeat's gaming site, GamesBeat, where Hsu served as the editor-in-chief until October 2014, where he announced he was leaving gaming media permanently. He's still in the gaming business, currently working at Blizzard Entertainment as Senior Director of Content Programming.
Controversies
Hsu created a stir in the gaming industry in late 2005, when he wrote an editorial about the practice of gaming magazines and websites selling article and editorial opportunities to gaming publishers in exchange for advertising agreements. Citing an unnamed contact at a major game publishing company, Hsu refused to name the parties involved, but condemned those responsible for not maintaining journalistic integrity. The matter was publicized further when Slashdot linked to a Games.net editorial response written by Chris Cook, a writer for game magazine GamePro, who admonished Hsu for not specifying which companies were involved in the practices that were alluded to.
Following the launch of the Microsoft Xbox 360 in November 2005, Hsu interviewed Peter Moore, then the head of marketing for the Home and Entertainment division of Microsoft. At the time of the interview, there was much negative publicity in the media regarding technical problems with the system, as well as some complaints of the limited software line-up at launch within the gaming community. Much of the interview focused on these issues, as well as other various complaints by some gamers over limited backward compatibility with original Xbox games on the 360 and a possible lack of improvement in graphics and game play over previous console generations. Hsu's questioning were viewed as inappropriately rude, confrontational, or aggressive by some readers. This reaction caused Hsu to defend the interview in his blog twice; the first time saying that there had been much positive resp
|
https://en.wikipedia.org/wiki/Pacific%20Data%20Images
|
Pacific Data Images (PDI) was an American computer animation production company based in Redwood City, California, that was bought by DreamWorks SKG in 2000. It was renamed PDI/DreamWorks and was owned by DreamWorks Animation.
Founded in 1980 by Carl Rosendahl, PDI was one of the pioneers of computer animation. It produced over 700 commercials, contributed visual effects to more than 70 feature films, and produced and contributed to many of DreamWorks Animation's films, beginning with DreamWorks' first animated film Antz (1998). PDI's final animated film before its closure on January 22, 2015 was Penguins of Madagascar (2014).
History
1980–1987: early years
PDI was founded in 1980 by Carl Rosendahl with a loan of $25,000 from his father. He was joined in 1981 by Richard Chuang and in 1982 by Glenn Entis. Richard and Glenn wrote the foundation of the in-house computer animation software that was to be used for the next two decades. They started work on 3D software at the end of 1981, and 3D production started in the fall of 1982. The initial goal of the company was "Entertainment using 3D computer animation".
The first computer at PDI was a DEC PDP 11/44 with 128 kilobytes of memory. This was a lot of memory given that the computer had only 64 kilobytes (16-bits) of address space. It had a 20 megabyte disk. Attached to this was a $65,000 framebuffer which had a resolution of 512×512 and was 32 bits deep.
The first 3D image rendered at PDI was done on March 12, 1982. The image was simply a 4 by 4 by 4 grid of spheres of varying colors. The spheres were not polygonal, they were implicitly rendered and were fully anti-aliased. The resulting image was 512 by 480 by 24 (8 bits for red, green and blue channels) which took 2 minutes to render.
The PDP-11 was soon replaced by a DEC VAX-11/780 and later PDI shifted to another superminicomputer called the Ridge 32 from Ridge Computers. This machine was 2–4 times faster than the VAX-11/780 at a fraction of the cost.
The original in-house software evolved into a large suite of tools which included a polygon scan-line renderer (called p2r), an interactive animation program (called e-motion), an animation scripting / scene-description language (called script) and a lighting tool (called led). All of these tools were written in C and deployed on a variety of machines running various flavors of Unix.
The initial investment to start the company was . Its original offices were in Sunnyvale, California working out of a garage owned by Carl's father. PDI moved to its first real offices in 1985 (Sunnyvale), to its second offices in 1995 (Palo Alto) and to its last location in Redwood City at the Pacific Shores Center in 2002. The growth of the company was financed solely through profit. The company was run as an open book; monthly financial reviews were shared with the entire company, and a detailed monthly financial report was released. Money was never taken out of the company which maintained a 7% investm
|
https://en.wikipedia.org/wiki/Windows%20code%20page
|
Windows code pages are sets of characters or code pages (known as character encodings in other operating systems) used in Microsoft Windows from the 1980s and 1990s. Windows code pages were gradually superseded when Unicode was implemented in Windows, although they are still supported both within Windows and other platforms, and still apply when Alt code shortcuts are used.
There are two groups of system code pages in Windows systems: OEM and Windows-native ("ANSI") code pages.
(ANSI is the American National Standards Institute.) Code pages in both of these groups are extended ASCII code pages. Additional code pages are supported by standard Windows conversion routines, but not used as either type of system code page.
ANSI code page
ANSI code pages (officially called "Windows code pages" after Microsoft accepted the former term being a misnomer ) are used for native non-Unicode (say, byte oriented) applications using a graphical user interface on Windows systems. The term "ANSI" is a misnomer because these Windows code pages do not comply with any ANSI (American National Standards Institute) standard; code page 1252 was based on an early ANSI draft that became the international standard ISO 8859-1, which adds a further 32 control codes and space for 96 printable characters. Among other differences, Windows code-pages allocate printable characters to the supplementary control code space, making them at best illegible to standards-compliant operating systems.)
Most legacy "ANSI" code pages have code page numbers in the pattern 125x. However, 874 (Thai) and the East Asian multi-byte "ANSI" code pages (932, 936, 949, 950), all of which are also used as OEM code pages, are numbered to match IBM encodings, none of which are identical to the Windows encodings (although most are similar). While code page 1258 is also used as an OEM code page, it is original to Microsoft rather than an extension to an existing encoding. IBM have assigned their own, different numbers for Microsoft's variants, these are given for reference in the lists below where applicable.
All of the 125x Windows code pages, as well as 874 and 936, are labelled by Internet Assigned Numbers Authority (IANA) as "Windows-number", although "Windows-936" is treated as a synonym for "GBK". Windows code page 932 is instead labelled as "Windows-31J".
ANSI Windows code pages, and especially the code page 1252, were so called since they were purportedly based on drafts submitted or intended for ANSI. However, ANSI and ISO have not standardized any of these code pages. Instead they are either:
Supersets of the standard sets such as those of ISO 8859 and the various national standards (like Windows-1252 vs. ISO-8859-1),
Major modifications of these (making them incompatible to various degrees, like Windows-1250 vs. ISO-8859-2)
Having no parallel encoding (like Windows-1257 vs. ISO-8859-4; ISO-8859-13 was introduced much later). Also,
|
https://en.wikipedia.org/wiki/Methods%20of%20computing%20square%20roots
|
Methods of computing square roots are numerical analysis algorithms for approximating the principal, or non-negative, square root (usually denoted , , or ) of a real number. Arithmetically, it means given , a procedure for finding a number which when multiplied by itself, yields ; algebraically, it means a procedure for finding the non-negative root of the equation ; geometrically, it means given two line segments, a procedure for constructing their geometric mean.
Every real number except zero has two square roots. The principal square root of most numbers is an irrational number with an infinite decimal expansion. As a result, the decimal expansion of any such square root can only be computed to some finite-precision approximation. However, even if we are taking the square root of a perfect square integer, so that the result does have an exact finite representation, the procedure used to compute it may only return a series of increasingly accurate approximations.
The continued fraction representation of a real number can be used instead of its decimal or binary expansion and this representation has the property that the square root of any rational number (which is not already a perfect square) has a periodic, repeating expansion, similar to how rational numbers have repeating expansions in the decimal notation system.
The most common analytical methods are iterative and consist of two steps: finding a suitable starting value, followed by iterative refinement until some termination criterion is met. The starting value can be any number, but fewer iterations will be required the closer it is to the final result. The most familiar such method, most suited for programmatic calculation, is Newton's method, which is based on a property of the derivative in the calculus. A few methods like paper-and-pencil synthetic division and series expansion, do not require a starting value. In some applications, an integer square root is required, which is the square root rounded or truncated to the nearest integer (a modified procedure may be employed in this case).
The method employed depends on what the result is to be used for (i.e. how accurate it has to be), how much effort one is willing to put into the procedure, and what tools are at hand. The methods may be roughly classified as those suitable for mental calculation, those usually requiring at least paper and pencil, and those which are implemented as programs to be executed on a digital electronic computer or other computing device. Algorithms may take into account convergence (how many iterations are required to achieve a specified precision), computational complexity of individual operations (i.e. division) or iterations, and error propagation (the accuracy of the final result).
Procedures for finding square roots (particularly the square root of 2) have been known since at least the period of ancient Babylon in the 17th century BCE. Heron's method from first century Egypt was the first asce
|
https://en.wikipedia.org/wiki/Spicy%20City
|
Spicy City is an adult animated erotic cyberpunk television series which was created by Ralph Bakshi for HBO. It is an anthology series in a similar format as television programs such as The Twilight Zone and Tales from the Crypt. The series premiered on July 11, 1997 and ended on August 22, with a total of 6 episodes over the course of 1 season.
Premise
The plot was described as a science fiction anthology series set in a futuristic city with a steamy side. Each episode is introduced by Raven, a nightclub hostess who also makes brief appearances in the tales.
Production
Discussions involving a series based upon Trey Parker and Matt Stone's video Christmas card Jesus vs. Santa (which would become South Park) led HBO to contact Ralph Bakshi in order to produce the first animated series targeted specifically toward adults. Bakshi enlisted a team of writers, including his son Preston, to develop Spicy Detective, later renamed Spicy City.
Cast
Michelle Phillips as Raven
James Keane (credited as James Kean) as Lem
Barry Stigler as Boxer
Mary Mara as Alice Kerchief/Geisha
John Hostetter as Jake
Vince Melocchi as Shark
Alex Fernandez as Armando "Mano" Mantio
Cecilia Noël as Red Beans
James Hanes as Big Vinnie
Ralph Bakshi as Stevie/Connelly/Goldblum
Pamala Tyson as Bruja/Ebony and Venus Sartori
Tuesday Knight as Prostitute/Virus
James Keane as Flaxson
Darrell Kunitomi as Loh
Grace Zandarski as Driver
James Asher as Harry
Tasia Valenza as Margo
Tony Amendola as Skankmeyer
Julia DeMita as Frenchy
Rick Najera as Vic Guapo
Lewis Arquette as Farfelson/Corbin
Jennifer Darling as Elvira
E.G. Daily as Nisa Lolita
Joey Camen as Max
Michael Yama as Otaku
Brock Peters as Bird
Charlie Adler as Additional Voices
Dan Castellaneta as Additional Voices
Tress MacNeille as Additional Voices
Matt K. Miller as Additional Voices
Andy Philpot as Additional Voices
Marnie Mosiman as Additional Voices
Brendan O'Brien as Additional Voices
David Fennoy as Additional Voices
Danny Mann as Additional Voices
Episodes
Reception
The series premiered on 11 July 1997, beating South Park to television by over a month and becoming the first "adults only" cartoon series.
Although critical reaction was mixed and largely unfavorable, Spicy City received acceptable ratings. The Los Angeles Times called the series "Adolescent Humor for Adults". The Dallas Morning News said the series "exploits the female form".
A second season was approved, but the network wanted to fire Bakshi's writing team and hire professional Los Angeles screenwriters. When Bakshi refused to cooperate with the network, the series was cancelled.
References
External links
1990s American science fiction television series
1990s American adult animated television series
1997 American television series debuts
1997 American television series endings
American adult animation anthology series
American adult animated mystery television series
American adult animated science fiction television series
English-language te
|
https://en.wikipedia.org/wiki/Shortest%20common%20supersequence
|
In computer science, the shortest common supersequence of two sequences X and Y is the shortest sequence which has X and Y as subsequences. This is a problem closely related to the longest common subsequence problem. Given two sequences X = < x1,...,xm > and Y = < y1,...,yn >, a sequence U = < u1,...,uk > is a common supersequence of X and Y if items can be removed from U to produce X and Y.
A shortest common supersequence (SCS) is a common supersequence of minimal length. In the shortest common supersequence problem, two sequences X and Y are given, and the task is to find a shortest possible common supersequence of these sequences. In general, an SCS is not unique.
For two input sequences, an SCS can be formed from a longest common subsequence (LCS) easily. For example, the longest common subsequence of X and Y is Z. By inserting the non-LCS symbols into Z while preserving their original order, we obtain a shortest common supersequence U. In particular, the equation holds for any two input sequences.
There is no similar relationship between shortest common supersequences and longest common subsequences of three or more input sequences. (In particular, LCS and SCS are not dual problems.) However, both problems can be solved in time using dynamic programming, where is the number of sequences, and is their maximum length. For the general case of an arbitrary number of input sequences, the problem is NP-hard.
Shortest common superstring
The closely related problem of finding a minimum-length string which is a superstring of a finite set of strings = { 1,2,...,n } is also NP-hard. Several constant factor approximations have been proposed throughout the years, and the current best known algorithm has an approximation factor of 2.475. However, perhaps the simplest solution is to reformulate the problem as an instance of weighted set cover in such a way that the weight of the optimal solution to the set cover instance is less than twice the length of the shortest superstring . One can then use the O(log())-approximation for weighted set-cover to obtain an O(log())-approximation for the shortest superstring (note that this is not a constant factor approximation).
For any string in this alphabet, define () to be the set of all strings which are substrings of . The instance of set cover is formulated as follows:
Let be empty.
For each pair of strings and , if the last symbols of are the same as the first symbols of , then add a string to that consists of the concatenation with maximal overlap of with .
Define the universe of the set cover instance to be
Define the set of subsets of the universe to be { () | ∈ ∪ }
Define the cost of each subset (x) to be ||, the length of .
The instance can then be solved using an algorithm for weighted set cover, and the algorithm can output an arbitrary concatenation of the strings for which the weighted set cover algorithm outputs ().
Example
Consider the set = { abc, cde
|
https://en.wikipedia.org/wiki/Rogue%20access%20point
|
A rogue access point is a wireless access point that has been installed on a secure network without explicit authorization from a local network administrator, whether added by a well-meaning employee or by a malicious attacker.
Dangers
Although it is technically easy for a well-meaning employee to install a "soft access point" or an inexpensive wireless router—perhaps to make access from mobile devices easier—it is likely that they will configure this as "open", or with poor security, and potentially allow access to unauthorized parties.
If an attacker installs an access point they are able to run various types of vulnerability scanners, and rather than having to be physically inside the organization, can attack remotely—perhaps from a reception area, adjacent building, car park, or with a high gain antenna, even from several miles away.
Prevention and detection
To prevent the installation of rogue access points, organizations can install wireless intrusion prevention systems to monitor the radio spectrum for unauthorized access points.
Presence of a large number of wireless access points can be sensed in airspace of a typical enterprise facility. These include managed access points in the secure network plus access points in the neighborhood. A wireless intrusion prevention system facilitates the job of auditing these access points on a continuous basis to learn whether there are any rogue access points among them.
In order to detect rogue access points, two conditions need to be tested:
whether or not the access point is in the managed access point list
whether or not it is connected to the secure network
The first of the above two conditions is easy to test—compare wireless MAC address (also called as BSSID) of the access point against the managed access point BSSID list. However, automated testing of the second condition can become challenging in the light of following factors: a) Need to cover different types of access point devices such as bridging, NAT (router), unencrypted wireless links, encrypted wireless links, different types of relations between wired and wireless MAC addresses of access points, and soft access points, b) necessity to determine access point connectivity with acceptable response time in large networks, and c) requirement to avoid both false positives and negatives which are described below.
False positives occur when the wireless intrusion prevention system detects an access point not actually connected to the secure network as wired rogue. Frequent false positives result in wastage of administrative bandwidth spent in chasing them. Possibility of false positives also creates hindrance to enabling automated blocking of wired rogues due to the fear of blocking friendly neighborhood access point.
False negatives occur when the wireless intrusion prevention system fails to detect an access point actually connected to the secure network as wired rogue. False negatives result in security holes.
If an unauthoriz
|
https://en.wikipedia.org/wiki/Great%20Valley%20Products
|
Great Valley Products is a former third-party Amiga hardware supplier. The company was known for CPU accelerators and SCSI host adapters for the Amiga 500 and Amiga 2000 computer series. The company liquidated itself in July 1995. A new company GVP-M picked up rights to the Amiga products.
Employee Shareholders
Great Valley Products was owned by its managing employees and their family members.
Gerard Bucas – President
David Ziembicki Sr. – Vice President of Operations
Jeff Boyer – Vice President of Engineering
Gregg Garnick – Vice President of Sales
Erik Quackenbush – Director of Software Development
George Rapp – Director of Technical Support
GVP A530 Turbo
GVP A530 Turbo released in 1992 is a processor accelerator, disc controller and PC-286 co-system for Amiga 500.
External links
Great Valley Products – M New company.
Amiga Hardware Database – Descriptions, photos, drivers and benchmarks of GVP products.
amiga-hardware.com – Images of GVP's A530 68030 accelerator
References
Amiga
Defunct computer companies of the United States
|
https://en.wikipedia.org/wiki/Innobase
|
Innobase was a Finnish company headquartered in Helsinki, Finland. Innobase is best known for being the developer of the InnoDB transactional storage engine for the MySQL open source database system. From 2005 on, Innobase was a subsidiary of Oracle Corporation, which acquired Innobase. It has been fully merged into Oracle and terminated all business activities as of July 8, 2013.
History
In 1995 Heikki Tuuri founded Innobase to develop InnoDB. In September 2000 Innobase started collaboration with MySQL AB, which resulted in the release of MySQL that incorporated InnoDB in March 2001.
InnoDB was originally closed source, but was released to open source after Innobase failed to find a buyer for InnoDB and started collaboration with MySQL. MySQL tried to close a deal with Innobase in the following years, but eventually Oracle acquired Innobase in October, 2005. Oracle eventually also acquired Sun Microsystems, owner of MySQL AB, in January 2010.
References
Oracle acquisitions
Companies based in Helsinki
Defunct companies of Finland
Information technology companies of Finland
|
https://en.wikipedia.org/wiki/Safi%20Qureshey
|
Safi Urrehman Qureshey is a Pakistani-American entrepreneur. He was the co-founder and CEO of AST Research, Inc., a personal computer manufacturer acquired by Samsung Electronics in 1997. Qureshey is involved with several start-up technology companies as an advisor, board member and seed investor. Qureshey currently serves as regent's professor at the University of California, Irvine's (UCI's) Graduate School of Management, and also actively supports U.C. Irvine's Bonney Center for Neurobiology of Learning and Memory. Qureshey graduated from The University of Texas at Arlington in 1975 as a Computer Science Major. In 2000, he created the eponymous "Safi Qureshey Foundation" to provide "a conduit of support for socially and economically underserved children and adults to build better and more secure futures".
Qureshey was named by California Governor Arnold Schwarzenegger to his transition team, to help him put together his new administration. Qureshey is also a former member of President Clinton's Export Council.
Early life and education
Qureshey was born in Karachi, Pakistan on February 15, 1951. He attended the University of Karachi and received a Bachelor's of Science in Physics. He later came to the United States and attended the University of Texas, Arlington, where he graduated with a BS in electrical engineering after transferring from the physics department.
Career
AST Research
In 1980, he and two colleagues, Albert Wong and Tom Yuen formed AST Research, in Irvine, California. Qureshey served as the company's CEO. The name AST came from the first letters of their first names. The company originally provided consulting services, moved to building motherboards for IBM computers and eventually started building their own PCs. They shipped their first computer in 1986, and shipped the first sub-$1,000 computer in 1990. Samsung acquired the company in 1997 and Qureshey stepped down as CEO.
Quartics
After leaving AST, Qureshey founded Quartics, an Irvine, CA-based semiconductor startup developing systems-on-a-chip (SoC) for wireless video transmission. The company's products were chips that allowed PCs to transmit content to televisions, and HD video codecs. Qureshey served as the company's CEO until November 2008.
Irvine Ventures
In 2000, Qureshey launched the Irvine Ventures incubator with a $50M investment. The group works with UCI and other local research institutions to launch new companies.
Government service
In 2003, Qureshey was named by California Governor Arnold Schwarzenegger to his transition team, to help him put together his new administration. Qureshey was also a member of President Clinton's Export Council, where he traveled to emerging countries with successive Secretaries of Commerce to promote international business.
Teaching
Qureshey is a Regent's Professor with the Paul Merage School of Business at UCI.
Patents
Qureshey holds a number of patents related to web audio broadcasts and playback onto connected dev
|
https://en.wikipedia.org/wiki/Calvin%20Gotlieb
|
Calvin Carl "Kelly" Gotlieb, (March 27, 1921 – October 16, 2016) was a Canadian professor and computer scientist who has been called the "Father of Computing" in Canada. He was a Professor in Computer Science at the University of Toronto.
Biography
He received a Bachelor of Science in physics in 1942, a Master of Arts in 1944 and a Ph.D. in 1947 from the University of Toronto.
In 1948, he co-founded the computation centre at the University of Toronto and was part of the first team in Canada to build computers and to provide computing services. In 1950, he created the first university course on computing in Canada and in 1951 offered the first graduate course. In 1964, he helped to found the first Canadian graduate department of computer science at the University of Toronto.
In 1958, he helped to found the Canadian Information Processing Society and was its president from 1960 to 1961.
In 1995, he was made a Member of the Order of Canada. He was a Fellow of the Royal Society of Canada and in 2006, a founding Fellow of the Canadian Information Processing Society. In 1994, he received the International Federation for Information Processing Isaac L. Auerbach Award and was inducted as a Fellow of the Association for Computing Machinery.
He was married to Phyllis Bloom, a Canadian science fiction novelist and poet, from 1949 until her death in 2009. Kelly and Phyllis Gotlieb had three children: son Leo Gotlieb; daughters Margaret Gotlieb and Jane Lipson.
Kelly Gotlieb died on October 16, 2016, in Toronto.
References
External links
Calvin Carl Gotlieb at The Canadian Encyclopedia
Prof. Gotlieb, Classified Work interview with, Stephen Ibaraki
Prof. Gotlieb, Pioneer in Computing Profile by, Stephen Ibaraki
Prof. Gotlieb, International Science and Engineering Fair interview with, Stephen Ibaraki
Prof. Gotlieb, Security Trumps Privacy interview with, Stephen Ibaraki
Prof. Gotlieb, Skills Shortage interview with, Stephen Ibaraki
Prof. Gotlieb, Evolution of Computers interview with, Stephen Ibaraki
Prof. Gotlieb, Foundational work with the ACM interview with, Stephen Ibaraki
Prof. Gotlieb, IFIP and CIPS interview with, Stephen Ibaraki
Calvin Gotlieb archival papers held at the University of Toronto Archives and Records Management Services
1921 births
2016 deaths
Canadian computer scientists
Fellows of the Association for Computing Machinery
Fellows of the Royal Society of Canada
Members of the Order of Canada
Scientists from Toronto
University of Toronto alumni
Academic staff of the University of Toronto
|
https://en.wikipedia.org/wiki/Cisco%20Express%20Forwarding
|
Cisco Express Forwarding (CEF) is an advanced layer 3 switching technology used mainly in large core networks or the Internet to enhance the overall network performance. Although CEF is a Cisco proprietary protocol other vendors of multi-layer switches or high-capacity routers offer a similar functionality where layer-3 switching or routing is done in hardware (in an ASIC) instead of by software and the (central) CPU.
Function
CEF is mainly used to increase packet switching speed by reducing the overhead and delays introduced by other routing techniques. CEF consists of two key components: The Forwarding Information Base (FIB) and adjacencies.
The FIB is similar to the routing table generated by multiple routing protocols, maintaining only the next-hop address for a particular IP-route.
The adjacency table maintains layer 2 or switching information linked to a particular FIB entry, avoiding the need for an Address Resolution Protocol (ARP) request for each table lookup. There are several types of adjacencies. Some are listed below:
Cache adjacency: This type of entry contains the correct outbound interface and the correct MAC address for its FIB entry. The MAC address is the IP address's MAC address if the destination's subnet is directly connected to the router, or is the MAC address of the router that the packet needs to be sent to if the destination's subnet is not directly connected to the router currently processing the packet.
Receive adjacency: This type of entry handles packets whose final destinations include the router itself. This includes packets whose IP addresses are assigned to the router itself, broadcast packets, and multicasts that have set up the router itself as one of the destinations.
Null adjacency: Handles packets destined to a NULL interface. Packets with FIB entries pointing to NULL adjacencies will normally be dropped.
Punt adjacency: Deals with packets that require special handling or that cannot be switched by CEF. Such packets are forwarded to the next switching layer (generally fast switching) where they can be processed and hopefully forwarded correctly.
Glean adjacency: This adjacency is created when the router knows that either the destination IP's subnet is directly connected to the router itself and it does not know that destination device's MAC address, or the router knows the IP address of the router to forward a packet to for a destination, but it does not know that router's MAC address. Packets that trigger this entry will generate an ARP request.
Discard adjacency: FIB entries pointing to this type of adjacency will be discarded.
Drop adjacency: Packets pointing to this entry are dropped, but the prefix will be checked.
In order to take full advantage of CEF, it is recommended to use distributed CEF (dCEF), where there is a FIB table on each of the line cards. This avoids the need for querying the main processor or routing table in order to get the next-hop information. Instead, fast switching
|
https://en.wikipedia.org/wiki/SciELO
|
SciELO (Scientific Electronic Library Online) is a bibliographic database, digital library, and cooperative electronic publishing model of open access journals. SciELO was created to meet the scientific communication needs of developing countries and provides an efficient way to increase visibility and access to scientific literature. Originally established in Brazil in 1997, today there are 16 countries in the SciELO network and its journal collections: Argentina, Bolivia, Brazil, Chile, Colombia, Costa Rica, Cuba, Ecuador, Mexico, Paraguay, Peru, Portugal, South Africa, Spain, Uruguay, and Venezuela.
SciELO was initially supported by the São Paulo Research Foundation (FAPESP) and the Brazilian National Council for Scientific and Technological Development (CNPq), along with the Latin American and Caribbean Center on Health Sciences Information (BIREME). SciELO provides a portal that integrates and provides access to all of the SciELO network sites. Users can search across all SciELO collections or limit the search by a single country collection, or browse by subject area, publisher, or journal title.
Database and projects
By October 2015 the database contained:
1,249 journals
39,651 issues (journal numbers)
573,525 research articles
13,005,080 citations (sum of the number of items in each article's reference list)
from different countries, universally accessible for free open access, in full-text format. The SciELO Project's stated aims are to "envisage the development of a common methodology for the preparation, storage, dissemination and evaluation of scientific literature in electronic format". All journals are published by a special software suite which implements a scientific electronic virtual library accessed via several mechanisms, including a table of titles in alphabetic and subject list, subject and author indexes and a search engine.
History
Project's launch timeline:
1997: Beginning of the development of SciELO as a FAPESP supported project in partnership with BIREME.
1998: SciELO goes live.
1998: Chile's national research agency CONICYT asks to be considered as a pilot project outside of Brazil.
1999-2000: Chile joined as a regional collection, project supported by CONICYT.
2002: the CNPq also began its support for SciELO.
2005: Argentina joined as a regional collection, project supported by CONICET
2009: South Africa joined as a regional collection, project supported by ASSAf.
2012: the SciELO Books project is launched.
2013: the SciELO Citation Index is integrated into Thomson Reuters' Web of Knowledge (WoS), covering about 650 journals total, 300 more than the 350 already in the WoS.
2017 SciELO announced that they were setting up a preprints server – SciELO Preprints.
Open access
In 2013 the Latin American SciELO project completed 15 years of free publishing.
Open access has long emphasized access to scholarly materials. However, open access can also mean access to the means of producing visible and re
|
https://en.wikipedia.org/wiki/QuickTime%20File%20Format
|
QuickTime File Format (QTFF) is a computer file format used natively by the QuickTime framework.
Design
The format specifies a multimedia container file that contains one or more tracks, each of which stores a particular type of data: audio, video, or text (e.g. for subtitles). Each track either contains a digitally-encoded media stream (using a specific format) or a data reference to the media stream located in another file. Tracks are maintained in a hierarchical data structure consisting of objects called atoms. An atom can be a parent to other atoms or it can contain media or edit data, but it is not supposed to do both.
The ability to contain abstract data references for the media data, and the separation of the media data from the media offsets and the track edit lists means that QuickTime is particularly suited for editing, as it is capable of importing and editing in place (without data copying). Other later-developed media container formats such as Microsoft's Advanced Systems Format or the Matroska and Ogg containers lack this abstraction, and require all media data to be rewritten after editing.
Relation to MP4
Because both the QuickTime and MP4 container formats can use the same MPEG-4 formats, they are mostly interchangeable in a QuickTime-only environment. MP4, being an international standard, has more support. This is especially true on hardware devices, such as the PlayStation Portable and various DVD players; on the software side, most DirectShow and Video for Windows codec packs include an MP4 parser, but not one for QTFF.
In QuickTime Pro's MPEG-4 Export dialog, an option called "Passthrough" allows a clean export to MP4 without affecting the audio or video streams. One discrepancy ushered in by QuickTime 7 released on April 29, 2005, is that the QuickTime file format supports multichannel audio (used, for example, in the high-definition trailers on Apple's site).
Extensions
The International Organization for Standardization approved the QuickTime file format as the basis of the MPEG-4 file format. The MPEG-4 file format specification was created on the basis of the QuickTime format specification published in 2001. The MP4 () file format was published in 2001 as the revision of the MPEG-4 Part 1: Systems specification published in 1999 (ISO/IEC 14496-1:2001). In 2003, the first version of MP4 format was revised and replaced by MPEG-4 Part 14: MP4 file format (ISO/IEC 14496-14:2003). The MP4 file format was generalized into the ISO Base Media File Format ISO/IEC 14496-12:2004, which defines a general structure for time-based media files. It in turn is used as the basis for other multimedia file formats (for example 3GP, Motion JPEG 2000). A list of all registered extensions for ISO Base Media File Format is published on the official registration authority website www.mp4ra.org. This registration authority for code-points in "MP4 Family" files is Apple Inc. and it is named in Annex D (informative) in MPEG-4 Part 12.
See
|
https://en.wikipedia.org/wiki/Dynamic-link%20library
|
Dynamic-link library (DLL) is Microsoft's implementation of the shared library concept in the Microsoft Windows and OS/2 operating systems. These libraries usually have the file extension DLL, OCX (for libraries containing ActiveX controls), or DRV (for legacy system drivers).
The file formats for DLLs are the same as for Windows EXE files – that is, Portable Executable (PE) for 32-bit and 64-bit Windows, and New Executable (NE) for 16-bit Windows. As with EXEs, DLLs can contain code, data, and resources, in any combination.
Data files with the same file format as a DLL, but with different file extensions and possibly containing only resource sections, can be called resource DLLs. Examples of such DLLs include icon libraries, sometimes having the extension ICL, and font files, having the extensions FON and FOT.
Background
The first versions of Microsoft Windows ran programs together in a single address space. Every program was meant to co-operate by yielding the CPU to other programs so that the graphical user interface (GUI) could multitask and be maximally responsive. All operating-system level operations were provided by the underlying operating system: MS-DOS. All higher-level services were provided by Windows Libraries "Dynamic Link Library". The Drawing API, Graphics Device Interface (GDI), was implemented in a DLL called GDI.EXE, the user interface in USER.EXE. These extra layers on top of DOS had to be shared across all running Windows programs, not just to enable Windows to work in a machine with less than a megabyte of RAM, but to enable the programs to co-operate with each other. The code in GDI needed to translate drawing commands to operations on specific devices. On the display, it had to manipulate pixels in the frame buffer. When drawing to a printer, the API calls had to be transformed into requests to a printer. Although it could have been possible to provide hard-coded support for a limited set of devices (like the Color Graphics Adapter display, the HP LaserJet Printer Command Language), Microsoft chose a different approach. GDI would work by loading different pieces of code, called "device drivers", to work with different output devices.
The same architectural concept that allowed GDI to load different device drivers also allowed the Windows shell to load different Windows programs, and for these programs to invoke API calls from the shared USER and GDI libraries. That concept was "dynamic linking".
In a conventional non-shared static library, sections of code are simply added to the calling program when its executable is built at the "linking" phase; if two programs call the same routine, the routine is included in both the programs during the linking stage of the two. With dynamic linking, shared code is placed into a single, separate file. The programs that call this file are connected to it at run time, with the operating system (or, in the case of early versions of Windows, the OS-extension), performing the binding.
|
https://en.wikipedia.org/wiki/Bachelor%20of%20Computer%20Science
|
The Bachelor of Computer Science (abbreviated BCompSc or BCS) is a bachelor's degree for completion of an undergraduate program in computer science. In general, computer science degree programs emphasize the mathematical and theoretical foundations of computing.
Typical requirements
Because computer science is a wide field, courses required to earn a bachelor of computer science degree vary. A typical list of course requirements includes topics such as:
Computer programming
Programming paradigms
Algorithms
Data structures
Logic & Computation
Computer architecture
Some schools may place more emphasis on mathematics and require additional courses such as:
Linear algebra
Calculus
Probability theory and statistics
Combinatorics and discrete mathematics
Differential calculus and mathematics
Beyond the basic set of computer science courses, students can typically choose additional courses from a variety of different fields, such as:
Theory of computation
Operating systems
Numerical computation
Compilers, compiler design
Real-time computing
Distributed systems
Computer networking
Data communication
Computer graphics
Artificial intelligence
Human-computer interaction
Information theory
Software testing
Information assurance
Some schools allow students to specialize in a certain area of computer science.
Related degrees
Bachelor of Software Engineering
Bachelor of Science in Information Technology
Bachelor of Computing
Bachelor of Information Technology
Bachelor of Computer Information Systems
See also
Computer science
Computer science and engineering
Bachelor of Business Information Systems
References
Computer Science
Computer science education
Computer science educators
|
https://en.wikipedia.org/wiki/List%20of%20countries%20by%20life%20expectancy
|
This list of countries by life expectancy provides a comprehensive list of countries alongside their respective life expectancy figures. The data is differentiated by gender, presenting life expectancies for males, females, and a combined average. In addition to sovereign nations, the list encompasses several non-sovereign entities and territories. The figures serve as an indicator of the quality of healthcare in the respective countries and are influenced by various factors, including the prevalence of diseases such as HIV/AIDS. This article introduces the concept of Healthy life expectancy (HALE), which denotes the average number of years a person is expected to live in "full health". There are challenges in comparing life expectancies across countries due to disparities in data reporting and collection standards. The primary source of the most recent data presented is the World Bank Group's 2021 report.
Methodology
The life expectancy is shown separately for males and for females, as well as a combined figure. Several non-sovereign entities and territories are also included in this list.
The figures reflect the quality of healthcare in the countries listed as well as other factors including HIV infections.
From the beginning of the current century there is a tendency to also estimate Healthy life expectancy (HALE) — the average number of years that a person can expect to live in "full health".
Comparing life expectancies across countries can be problematic. For example, due to poor reporting in some countries and various local standards in collecting statistics. This is especially true for Healthy life expectancy, the definition of which criteria may change over time, even within a country.
World Bank Group (2021)
Estimation of the World Bank Group for 2021. Only countries with populations over 50,000 are listed. The values in the World Bank Group tables are rounded. All calculations were done on raw data, therefore, due to the nuances of rounding, in some places illusory inconsistencies of indicators arose, with a size of 0.01 year.
United Nations (2021)
Shown is the "period life expectancy" at birth. This is the average number of years a newborn would live if age-specific mortality rates in the current year were to stay the same throughout its life. The data is taken from the 2020 and 2022 United Nations World Population Prospects. It is also used to calculate the Human Development Index. Only countries with populations over 50,000 are listed. Due to this criterion, the table does not include Monaco (LE 85.9 years, population 39,000). By default, the list is sorted by 2021. Data for 2021 can also be viewed via Our World in Data.
World Health Organization (2019)
According to data published by the World Health Organization in December 2020. By default, data is sorted by life expectancy at birth for all population, and in case of equal values by HALE for all population.
CIA World Factbook (2022)
The US CIA published the following
|
https://en.wikipedia.org/wiki/Network%20bridge
|
A network bridge is a computer networking device that creates a single, aggregate network from multiple communication networks or network segments. This function is called network bridging. Bridging is distinct from routing. Routing allows multiple networks to communicate independently and yet remain separate, whereas bridging connects two separate networks as if they were a single network. In the OSI model, bridging is performed in the data link layer (layer 2). If one or more segments of the bridged network are wireless, the device is known as a wireless bridge.
The main types of network bridging technologies are simple bridging, multiport bridging, and learning or transparent bridging.
Transparent bridging
Transparent bridging uses a table called the forwarding information base to control the forwarding of frames between network segments. The table starts empty and entries are added as the bridge receives frames. If a destination address entry is not found in the table, the frame is flooded to all other ports of the bridge, flooding the frame to all segments except the one from which it was received. By means of these flooded frames, a host on the destination network will respond and a forwarding database entry will be created. Both source and destination addresses are used in this process: source addresses are recorded in entries in the table, while destination addresses are looked up in the table and matched to the proper segment to send the frame to. Digital Equipment Corporation (DEC) originally developed the technology in the 1980s.
In the context of a two-port bridge, the forwarding information base can be seen as a filtering database. A bridge reads a frame's destination address and decides to either forward or filter. If the bridge determines that the destination host is on another segment on the network, it forwards the frame to that segment. If the destination address belongs to the same segment as the source address, the bridge filters the frame, preventing it from reaching the other network where it is not needed.
Transparent bridging can also operate over devices with more than two ports. As an example, consider a bridge connected to three hosts, A, B, and C. The bridge has three ports. A is connected to bridge port 1, B is connected to bridge port 2, C is connected to bridge port 3. A sends a frame addressed to B to the bridge. The bridge examines the source address of the frame and creates an address and port number entry for host A in its forwarding table. The bridge examines the destination address of the frame and does not find it in its forwarding table so it floods (broadcasts) it to all other ports: 2 and 3. The frame is received by hosts B and C. Host C examines the destination address and ignores the frame as it does not match with its address. Host B recognizes a destination address match and generates a response to A. On the return path, the bridge adds an address and port number entry for B to its forwarding tabl
|
https://en.wikipedia.org/wiki/Index%20of%20software%20engineering%20articles
|
This is an alphabetical list of articles pertaining specifically to software engineering.
0–9
2D computer graphics —
3D computer graphics
A
Abstract syntax tree —
Abstraction —
Accounting software —
Ada —
Addressing mode —
Agile software development —
Algorithm —
Anti-pattern —
Application framework —
Application software —
Artificial intelligence —
Artificial neural network —
ASCII —
Aspect-oriented programming —
Assembler —
Assembly language —
Assertion —
Automata theory —
Automotive software —
Avionics software
B
Backward compatibility —
BASIC —
BCPL —
Berkeley Software Distribution —
Beta test —
Boolean logic —
Business software
C
C —
C++ —
C# —
CAD —
Canonical model —
Capability Maturity Model —
Capability Maturity Model Integration —
COBOL —
Code coverage —
Cohesion —
Compilers —
Complexity —
Computation —
Computational complexity theory —
Computer —
Computer-aided design —
Computer-aided manufacturing —
Computer architecture —
Computer bug —
Computer file —
Computer graphics —
Computer model —
Computer multitasking —
Computer programming —
Computer science —
Computer software —
Computer term etymologies —
Concurrent programming —
Configuration management —
Coupling —
Cyclomatic complexity
D
Data structure —
Data-structured language —
Database —
Dead code —
Decision table —
Declarative programming —
Design pattern —
Development stage —
Device driver —
Disassembler —
Disk image —
Domain-specific language
E
EEPROM —
Electronic design automation —
Embedded system —
Engineering —
Engineering model —
EPROM —
Even-odd rule —
Expert system —
Extreme programming
F
FIFO (computing and electronics) —
File system —
Filename extension —
Finite-state machine —
Firmware —
Formal methods —
Forth —
Fortran —
Forward compatibility —
Functional decomposition —
Functional design —
Functional programming
G
Game development —
Game programming —
Game tester —
GIMP Toolkit —
Graphical user interface
H
Hierarchical database —
High-level language —
Hoare logic —
Human–computer interaction —
Hyperlink —
Hyper-threading
I
IEEE Software —
Imperative programming —
Information technology engineering —
Information systems —
Information technology —
Instruction set —
Interactive programming —
Interface description language —
Intermediate language —
Interpreter —
Invariant —
ISO —
ISO 9000 —
ISO 9001 —
ISO 9660 —
ISO/IEC 12207 —
ISO image —
Iterative development
J
Java —
Java Modeling Language —
Java virtual machine
K
Kernel —
Knowledge management
L
Level design —
Level designer —
LIFO —
Linux —
List of programming languages —
Literate programming
M
Machine code —
Machine language —
Mainframe —
Medical informatics —
Medical software —
Mesh networking —
Metadata (computing) —
Microcode —
Microprogram —
Microsoft Windows —
Minicomputer —
MIPS architecture —
Multi-paradigm programming language
N
Neural network software —
Numerical analysis
O
Object code —
Object database —
Object-oriented programming —
Ontology —
Opcode —
Open implementation —
Open-source soft
|
https://en.wikipedia.org/wiki/Friedrich%20L.%20Bauer
|
Friedrich Ludwig "Fritz" Bauer (10 June 1924 – 26 March 2015) was a German pioneer of computer science and professor at the Technical University of Munich. He coined the term Software engineering
Life
Bauer earned his Abitur in 1942 and served in the Wehrmacht during World War II, from 1943 to 1945. From 1946 to 1950, he studied mathematics and theoretical physics at Ludwig-Maximilians-Universität in Munich. Bauer received his Doctor of Philosophy (Ph.D.) under the supervision of Fritz Bopp for his thesis Gruppentheoretische Untersuchungen zur Theorie der Spinwellengleichungen ("Group-theoretic investigations of the theory of spin wave equations") in 1952. He completed his habilitation thesis Über quadratisch konvergente Iterationsverfahren zur Lösung von algebraischen Gleichungen und Eigenwertproblemen ("On quadratically convergent iteration methods for solving algebraic equations and eigenvalue problems") in 1954 at the Technical University of Munich. After teaching as a privatdozent at the Ludwig Maximilian University of Munich from 1954 to 1958, he became extraordinary professor for applied mathematics at the University of Mainz. Since 1963, he worked as a professor of mathematics and (since 1972) computer science at the Technical University of Munich. He retired in 1989.
Work
Bauer's early work involved constructing computing machinery (e.g. the logical relay computer STANISLAUS from 1951–1955). In this context, he was the first to propose the widely used stack method of expression evaluation.
Bauer was a member of the committees that developed the imperative computer programming languages ALGOL 58, and its successor ALGOL 60, important predecessors to all modern imperative programming languages. For ALGOL 58, Bauer was with the German Gesellschaft für Angewandte Mathematik und Mechanik (GAMM, Society of Applied Mathematics and Mechanics) which worked with the American Association for Computing Machinery (ACM). For ALGOL 60, Bauer was with the International Federation for Information Processing (IFIP) IFIP Working Group 2.1 on Algorithmic Languages and Calculi, which specified, maintains, and supports the languages ALGOL 60 and ALGOL 68.
Bauer was an influential figure in establishing computer science as an independent subject in German universities, which until then was usually considered part of mathematics. In 1967, he held the first lecture in computer science at a German university at the Technical University of Munich, titled Information Processing. By 1972, computer science had become an independent academic discipline at the TUM. In 1992, it was separated from the Department of Mathematics to form an independent Department of Informatics, though Bauer had retired from his chair in 1989.
In 1968, he coined the term software engineering which has been in widespread use since, and has become a discipline in computer science.
His scientific contributions spread from numerical analysis (Bauer–Fike theorem) and fundamentals of int
|
https://en.wikipedia.org/wiki/El%20Nueve
|
Channel 9, known by its brand name El Nueve (stylized as elnueve) is an Argentine free-to-air television network based in Buenos Aires with programming centred on general entertainment.
History
Origins and first Romay ownership
After the fall of the second government of Juan Perón, the military government of Pedro Eugenio Aramburu opened three new television licenses in Buenos Aires for bidding: channels 9, 11 and 13. The winner for channel 9, which would bear the callsign LS 83 TV, was Compañía Argentina de Televisión, S.A. (CADETE), which began its broadcasts in 1960. Canal 9's stock was partially owned by foreign companies, including the United States' NBC.
In 1963 Alejandro Saúl Romay, who was the owner of Radio Libertad and known as "the czar of TV", became the manager of Canal 9, and in the following years he acquired the stock held by the foreign investors, transforming Canal 9 into the first television network fully funded by Argentine capital. Under his leadership, Canal 9 became competitive in the ratings, fighting for first place with Canal 13 and then Canal 11.
Nationalization
In 1974, during Juan Perón's third term as President of Argentina, Canal 9 was seized by the government along with channels 11 and 13, remaining as a state-owned station throughout the following military regime, this time under Argentine Army administration. It began color broadcasts in 1980.
Romay returns
At the end of military dictatorship, the network was re-privatized in 1983, and Alejandro Romay regained control of the channel in the bidding process, a position he would hold from taking possession of the station on May 25, 1984, until 1997. In the five months between the return to democracy and Romay's taking control of the station, Alfredo Garrido took over as administrator, sowing the seeds for Canal 9's return to the top of the ratings throughout the remainder of the 1980s. Romay's long term as the owner of Canal 9 made him one of the most powerful figures in Argentine media. Following its re-privatization, the station was renamed "Canal 9 Libertad" (Channel 9 Liberty) and a new logo debuted for this purpose. In 1997, new studios were constructed in the Buenos Aires neighborhood of Colegiales.
At its height under Romay, Canal 9 adopted as part of its visual identity a dove near the number 9 logo, which earned the channel the nickname of El canal de la palomita ("The channel of the little dove"). It was replaced with a heart logo in 1995.
1997-2002: Azul Televisión
Australian regional broadcaster Prime Television bought all of Canal 9 in 1997 for US$135 million ($ in dollars); Prime then onsold half of it for US$74 million. In response to a ratings slump and wanting to tone down Canal 9 from a style that often tended toward the sensational under Romay, a US$20 million ($ in dollars) rebranding effort was embarked upon, with its largest element a massive rebrand from Canal 9 Libertad to Azul Televisión in January 1999.
However, Prime Television d
|
https://en.wikipedia.org/wiki/Resource%20%28Windows%29
|
In Microsoft Windows, resources are read-only data embedded in portable executable files like .exe, DLL, CPL, SCR, SYS or (beginning with Windows Vista) MUI files.
The Windows API provides for easy access to all applications resources.
Types
Each resource has a type and a name, both being either numeric identifiers or strings.
Windows has a set of predefined resource types:
Cursor and animated cursor
Icon
Bitmap
Dialog box template
Font
HTML document
String and message template
Version data
Manifest data
arbitrary (binary) data
The programmer can also define custom data types in resources.
Usage
The icon that Windows displays for a program file is actually the first icon resource in its EXE file. If the EXE file has no icon resources, a standard icon is displayed.
The version resource for EXE and DLL files is displayed in the Version tab of their property pages.
Resources always have a language attached to them, and Windows will automatically use the most fitting language if possible. This allows for programs adapting their language to the locale of the user.
Editors are available that can modify resources embedded in EXE or DLL files. These are typically used to translate all strings of an application to another language, or to modify its icons and bitmaps accordingly.
References
External links
MSDN: Windows Resource Files Guide
MSDN: Better Resource File Guide with reference
Windows architecture
|
https://en.wikipedia.org/wiki/Bruce%20Jay%20Nelson
|
Bruce Jay Nelson (January 19, 1952 – September 19, 1999) was an American computer scientist best known as the inventor of the remote procedure call concept for computer network communications.
Bruce Nelson graduated from Harvey Mudd College in 1974, and went on to earn a master's in computer science from Stanford University in 1976, and a Ph.D. in computer science from Carnegie Mellon University in 1982. While pursuing his Ph.D., he worked at Xerox PARC where he developed the concept of remote procedure call (RPC).
He and his collaborator Andrew Birrell were awarded the 1994 Association for Computing Machinery (ACM) Software System Award for the work on RPC.
In 1996 he joined Cisco Systems as Chief Science Officer.
He died September 19, 1999, due to complications from an aortic dissection, while on a business trip to Tel Aviv, Israel.
In 2007 the Birrell and Nelson paper won an operating system hall of fame award from the ACM. Classmates and friends endowed a scholarship in his name at Carnegie Mellon.
Harvey Mudd College also named a speaker series in his honor.
He was an avid photographer, backpacker, free-diver and world traveler.
His outgoing and eccentric personality included a fascination with crows, leading a friend to name his company "Caw Networks".
Published papers
References
1952 births
1999 deaths
Harvey Mudd College alumni
Carnegie Mellon University alumni
Deaths from aortic dissection
American computer scientists
Place of birth missing
|
https://en.wikipedia.org/wiki/Rename
|
Rename may refer to:
Rename (computing), rename of a file on a computer
RENAME (command), command to rename a file in various operating systems
Rename (relational algebra), unary operation in relational algebra
Company renaming, rename of a product
Name change, rename of a person
Geographical renaming, rename of a geographical location
See also
Renaming (disambiguation)
|
https://en.wikipedia.org/wiki/List%20of%20Yellowstone%20geothermal%20features
|
This is a sortable table of the notable geysers, hot springs, and other geothermal features in the geothermal areas of Yellowstone National Park.
External links
Online Database of Yellowstone's Thermal Features this link is broken - goes to a TDS generic search page of Wyoming
Geothermal features
|
https://en.wikipedia.org/wiki/Broadcasting%20%28networking%29
|
In computer networking, telecommunication and information theory, broadcasting is a method of transferring a message to all recipients simultaneously. Broadcasting can be performed as a high-level operation in a program, for example, broadcasting in Message Passing Interface, or it may be a low-level networking operation, for example broadcasting on Ethernet.
All-to-all communication is a computer communication method in which each sender transmits messages to all receivers within a group. In networking this can be accomplished using broadcast or multicast. This is in contrast with the point-to-point method in which each sender communicates with one receiver.
Addressing methods
There are four principal addressing methods in the Internet Protocol:
Overview
In computer networking, broadcasting refers to transmitting a packet that will be received by every device on the network. In practice, the scope of the broadcast is limited to a broadcast domain.
Broadcasting is the most general communication method and is also the most intensive, in the sense that many messages may be required and many network devices are involved. This is in contrast to unicast addressing in which a host sends datagrams to another single host, identified by a unique address.
Broadcasting may be performed as all scatter in which each sender performs its own scatter in which the messages are distinct for each receiver, or all broadcast in which they are the same.
The MPI message passing method which is the de facto standard on large computer clusters includes the MPI_Alltoall method.
Not all network technologies support broadcast addressing; for example, neither X.25 nor Frame Relay have broadcast capability. The Internet Protocol Version 4 (IPv4), which is the primary networking protocol in use today on the Internet and all networks connected to it, supports broadcast, but the broadcast domain is the broadcasting host's subnet, which is typically small; there is no way to do an Internet-wide broadcast. Broadcasting is largely confined to local area network (LAN) technologies, most notably Ethernet and Token Ring, where the performance impact of broadcasting is not as large as it would be in a wide area network.
The successor to IPv4, IPv6 does not implement the broadcast method, so as to prevent disturbing all nodes in a network when only a few may be interested in a particular service. Instead, IPv6 relies on multicast addressing - a conceptually similar one-to-many routing methodology. However, multicasting limits the pool of receivers to those that join a specific multicast receiver group.
Both Ethernet and IPv4 use an all-ones broadcast address to indicate a broadcast packet. Token Ring uses a special value in the IEEE 802.2 control field.
Broadcasting may be abused to perform a type of DoS-attack known as a Smurf attack. The attacker sends forged ping requests with the source IP address of the victim computer, and all computers in the domain flood the victim c
|
https://en.wikipedia.org/wiki/Subshell
|
Subshell may refer to:
Subshell, of an electron shell
Subshell, a child process launched by a shell in computing
|
https://en.wikipedia.org/wiki/WMYO-CD
|
WMYO-CD (channel 24) is a low-power, Class A television station in Louisville, Kentucky, United States, affiliated with several digital multicast networks. The station is owned by Aircom Media. WMYO-CD's studios are located on Potters Lane in Clarksville, Indiana, and its transmitter is located in the Louisville tower farm in Floyd County (northeast of Floyds Knobs).
History
The station was founded on June 22, 1994, as W24BW (although it had a construction permit as W62BM) and first signed on the air on March 1, 1996. It was founded by Greater Louisville Communications, Inc. (owned by local businessmen Jerome Hutchinson Sr. and Jerome Hutchinson Jr.). From the late 1990s until 2003, the station carried music video programming from MuchUSA (now Fuse TV), the U.S. counterpart of the Canadian music video network MuchMusic. In 2003, the station switched its affiliation to America One, and began airing community and regional programming as well as sporting events. Channel 24's first chief engineer, Virgil Baldon Jr. (1994–1997), had the foresight to install a forward-compatible Acrodyne analog-to-digital convertible solid-state transmitter when W24BW began operations, over ten years ahead of the 2009 digital television transition. Baldon also oversaw the change of the transmitting antenna's directional main beam to 135 degrees true for maximum signal over the city of Louisville. Baldon was the first African-American engineer to oversee and successfully launch a TV station in the state of Kentucky.
In 2007, the Cascade Broadcasting Group, then-owners of Campbellsville-based WBKI-TV (channel 34), began operating W24BW under a local marketing agreement; the station moved its operations into WBKI's studio facility off Blankenbaker Parkway in Jeffersontown. The LMA also included a purchase option to buy the station. Cascade tried to rebrand channel 24 as the "Louisville Network" (or "LouNET"), and aired locally produced programs that were geared primarily towards the market's African American and Hispanic community. The station also began to brand under the fictional "WYCS" call letters (standing for "Your Community Station"), to avert confusion with other local translator stations which just transmitted completely automated content straight from their network's satellites.
Greater Louisville Broadcasting later sold channel 24 to New Albany Broadcasting Co., Inc. On November 10, 2009, the station changed its call sign to W24BW-D, upon beginning digital operation. On May 20, 2010, the station changed its call sign to WKYI-CD, denoting its status as a class A digital television station.
In January 2015, WKYI-CD took over the affiliation of This TV on 24.2 in place of WAVE, which was required by a company-wide agreement to offer the new male-focused subchannel Grit instead. This programming is mainly carried in the mornings, primetime and overnights on the station rather than the full 24/7 service.
The station changed its call sign to WBKI-CD on Decembe
|
https://en.wikipedia.org/wiki/June%201980
|
The following events happened in June 1980:
June 1, 1980 (Sunday)
The first 24-hour news channel, Cable News Network (CNN), was launched. The U.S.-based network launched at 6:00 p.m. Eastern Time from Atlanta with an original staff of 170 employees, and 130 more in bureaus in Chicago, Dallas, Los Angeles, New York City, San Francisco and Washington, D.C. The inaugural broadcast on the channel was an introduction by Ted Turner. Following the introduction and a pre-recorded version of "The Star-Spangled Banner" performed by three military bands, the husband and wife team of Dave Walker and Lois Hart anchored the channel's first newscast at 6:05 with a live report from Fort Wayne, Indiana, about reaction there to the wounding of civil rights leader Vernon Jordan. Among the first segments was a videotaped interview with then-President Jimmy Carter by Daniel Schorr. At the beginning, CNN was available to two million households that had cable television and whose provider carried the channel.
Rioting broke out at the Cuban refugee center at Fort Chaffee, Arkansas after 200 stationed inside broke through the front gates and threw rocks at soldiers and local law enforcement officers. At least 15 officers were injured, along with four refugees and a civilian. The refugees retreated after troopers fired 20 shots from pistols and shotguns.
Full-time color television broadcasting began in Venezuela on the Venevisión network and on Radio Caracas Television.
The suicidal pilot of an air taxi killed himself and nine other people in Barra do Garças, Mato Grosso state. Mauro Milhomem had taken on four government officials as passengers in an Embraer Sertanejo-721 plane for the Taxi Aereo Garapu service and then crashed after an unsuccessful attempt to crash into the hotel where his wife was staying. All four of his passengers were killed, and five employees of an accounting firm died when Milhomem's airplane impacted a two-story building.
Thierry Vigneron broke the world record for the pole vault, surpassing the mark of Władysław Kozakiewicz with a vault of 5.75 meters (18 feet, 10 3/8 inches) at the French Club championships in Colombes. Vigneron tipped the bar as he leapt over it, but it stayed in place.
The All-Ireland Hurling championship was played, as Castlegar of Galway defeated McQuillan's of Antrim 1–11 to 1–8.
Died:
Arthur C. Nielsen, 83, American market researcher and founder of the A.C. Nielsen survey that tracks viewing preferences and issues the Nielsen ratings measurements for television programming.
Rube Marquard, 93, American baseball pitcher and inductee into the Baseball Hall of Fame.
June 2, 1980 (Monday)
In South Africa, the oil plants at Sasolburg was attacked by Umkhonto we Sizwe, the African National Congress's (ANC) military wing. They bombed two strategically important SASOL (oil-from-coal) plants and an oil refinery.
Bassam Shakaa, the Palestinian Mayor of Nablus, Ibrahim Tawil, the mayor of El-Bireh, and Karim Khalaf, the
|
https://en.wikipedia.org/wiki/August%201980
|
The following events happened in August 1980:
August 1, 1980 (Friday)
The premium cable network Cinemax was inaugurated in the U.S. as a films-only channel operated by Home Box Office (HBO) The new service began at 10:00 in the morning Eastern Time.
The wreck of the Dublin to Cork express train killed 18 people and injured more than 70, most of them teenagers who were on their way to Cork for a weekend vacation. Part of a group of 200 students, the victims were enjoying themselves in "two crowded restaurant cars located just behind the locomotive." At the railway station in the village of Buttevant in County Cork, only from their destination, the locomotive struck a faulty switch and derailed; the rear coaches then plowed into the back of the second dining car. The accident, at the time, was Ireland's deadliest crash.
Vigdís Finnbogadóttir became the 4th President of Iceland and the world's first democratically elected female president.
Died:
Strother Martin, 61, American film actor known for Cool Hand Luke
Patrick Depailler, 35, French race car driver
María Lourdes de Urquijo and her husband, Manuel de la Sierra, were murdered in their Madrid home by their son-in-law, Rafael Escobedo. The couple, marquis and marchioness, were the heads of one of Spain's wealthiest families as part of the Urquijo banking group.
August 2, 1980 (Saturday)
A terrorist bombing killed 85 people at the Bologna Centrale railway station and wounded more than 200. At 10:25 in the morning, the bomb exploded inside the first-class and second-class waiting rooms of the station and collapsed the roof above a platform of the tracks onto three cars of a train pulling out to go to Basel in Switzerland. Two hours earlier, a judge in the Italian city signed the indictments of eight members of the right-wing Armed Revolutionary Nuclei Group.
Born: Jose Sixto "Dingdong" Dantes, Philippine actor and film producer; in Quezon City
Died:
Regina "Gene" Weltfish, 77, American anthropologist and authority in the history of the Pawnee people of the Plains Indians.
Verdun Scott, 64, the only athlete to be a member of both the New Zealand test cricket team and the New Zealand rugby league team.
August 3, 1980 (Sunday)
The closing ceremony was held in Moscow for the 1980 Summer Olympics. Of the 81 participating national teams, 18 marched with the Olympic flag instead of their national flags in order to show their disapproval of the Soviet invasion of Afghanistan. Later, in place of the American flag to identify the nation that would host the next summer games, the flag of Los Angeles was hoisted instead.
The first triathlon in Canada was held at Elk/Beaver Lake Regional Park near Saanich, British Columbia, almost six years after the modern event had been introduced in San Diego on September 25, 1974. The event of a one-mile swim across Elk Lake, a 20-mile bicycle race and a ten-kilometer run, attracted 51 competitors.
Born:
Teuku Rifnu Wikana, Indonesian film actor, in Pemat
|
https://en.wikipedia.org/wiki/List%20of%20countries%20by%20HIV/AIDS%20adult%20prevalence%20rate
|
The human immunodeficiency virus (HIV), which causes AIDS, varies in prevalence from nation to nation. Listed here are the prevalence rates among adults in various countries, based on data from various sources, largely the CIA World Factbook.
As of 2018, 38 million people are estimated infected with HIV globally.
The HIV pandemic is most severe in Southern Africa. Over 10% of all people infected with HIV/AIDS reside within the region. Adult HIV prevalence exceeds 15% in Eswatini, Botswana, and Lesotho, while an additional six countries report adult HIV prevalence of at least 10%. Outside Africa, the highest prevalence rate is found in the Bahamas (3.3%).
In absolute numbers, South Africa (7.5 million), followed by Mozambique (2.2 million), India (2.1 million) and Nigeria (1.8 million) had the highest HIV/AIDS number of cases by the end of 2022. While South Africa's large population of HIV-positive people is attributable to its high disease prevalence (17.3%, one of the highest in the world), Nigeria's is lower at 1.3%, with India's prevalence rate at 0.2%. However, countries such as Nigeria with high HIV rates above 1% are classified as having Generalized HIV Epidemics (GHEs) by UNAIDS, while India's prevalence is well below this threshold, with a prevalence lower than the US's and about the same as Spain.
HIV/AIDS prevalence estimates table
This data was sourced from the CIA's world factbook and UNAIDS AIDS info website unless referenced otherwise. A horizontal dash "-" indicates the data was not published. Adult prevalence describes ages between 15 and 49.
See also
AIDS pandemic
By region:
HIV/AIDS in Africa
HIV/AIDS in Asia
HIV/AIDS in Europe
HIV/AIDS in North America
HIV/AIDS in South America
References
Sources
External links
HIV/AIDS Survey Indicators Database
World Health Organization; Prevalence of HIV among adults aged 15 to 49 (%) by country
World Health Organization; Number of deaths due to AIDS by country
World Health Organization; Number of people (all ages) living with HIV by country
HIV AIDS adult prevalence rate
HIV AIDS adult prevalence rate
|
https://en.wikipedia.org/wiki/August%201981
|
The following events occurred in August 1981:
August 1, 1981 (Saturday)
MTV, the Music Television cable network, went on the air at 12:01 AM from Fort Lee, New Jersey on cable systems in the United States, with John Lack's introductory words, "Ladies and gentlemen, rock and roll." Initially, MTV showed music videos 24 hours a day. The very first selection was "Video Killed the Radio Star" from Buggles. Pat Benatar's "You Better Run" was the second. When it launched, MTV reached 800,000 subscribers and cable television was still in only 25% of American homes. The MTV network would come under criticism in its first 19 months of existence because of its practice of featuring only songs from white musical artists in heavy rotation.
Abu Daoud, the PLO terrorist who had overseen the massacre of Israeli athletes at the 1972 Summer Olympics, was shot five times at close range while sitting in the coffee shop of the Victoria Hotel in Warsaw. Daoud survived his wounds and lived almost 30 more years until his death at the age of 72.
Canadian serial killer Clifford Robert Olson, Jr., who abducted and murdered 11 teenagers and children (mostly girls) over eight months in British Columbia, was stopped by police after he picked up two young girls who were hitchhiking. He was arrested after the name and address of one of his victims was found in a book in his van. After the government guaranteed to provide $110,000 ($343,885 as of 2023) to his wife, Olson showed police the location of the bodies of victims who had not yet been located and pled guilty to 11 counts of murder on January 11, 1982. He died in prison in 2011.
In Mexico, a freight train derailment near San Luis Potosi ruptured a tanker car carrying chlorine gas, killing 29 people and sending another 1,000 to the hospital.
Died: Paddy Chayefsky, 58, American screenwriter and 3-time Oscar winner
August 2, 1981 (Sunday)
Mohammad Ali Rajai was sworn in as the second President of Iran.
Lou Cannon of The Washington Post published the first description of U.S. President Ronald Reagan as "The Great Communicator". Variations of the nickname ("communicator-executive", "Communicator in Chief") had appeared earlier.
Frederick Mellinger, owner of Frederick's of Hollywood, introduced thong underwear to the United States.
Died: Delfo Cabrera, 62, Argentine runner who won the 1948 Olympic marathon, was killed in a car accident in Buenos Aires.
August 3, 1981 (Monday)
The Professional Air Traffic Controllers Organization (PATCO) went on strike at 7:00 am Eastern Time. The union's demand was for each employee to have a $10,000 annual wage increase, a 32-hour workweek (a four-day week and an eight-hour day combined) and increased benefits. President Reagan, citing the law that prohibited federal government employees from striking, ordered walkouts to return before 11:00 am EST Wednesday or be fired. Of the 16,395 Americans who guided airplane takeoffs and landings, 4,199 stayed on the job. The Federal Aviation Adminis
|
https://en.wikipedia.org/wiki/October%201981
|
The following events occurred in October 1981:
October 1, 1981 (Thursday)
The first cellular telephone system was inaugurated. Nordic Mobile Telephone (Nordisk MobilTelephoni, NMT) set up the network in Sweden.
Eighty-three people were killed and more than 300 injured when a car bomb exploded outside of the Beirut headquarters of the Palestine Liberation Organization's intelligence center. The Front for the Liberation of Lebanon from Foreigners, which the PLO asserted was a front for Israel, claimed it carried out the attack.
Gunther Guillaume, whose unmasking as an East German spy brought down the government of West German chancellor Willy Brandt in 1974, was released from prison and allowed to cross into East Germany.
The first five percent of President Reagan's 25% cut of U.S. federal income taxes took effect. The next 10% would take effect July 1, 1982, and the final 10% on July 1, 1983.
Led by Dr. Paul L. Schechter, astronomers at the Kitt Peak National Observatory reported the discovery of a "hole" in the universe, 300 million light years in diameter, that had only one-tenth of the stars and galaxies found elsewhere. The void, described by Schechter as "exceedingly hard to understand", is beyond the constellation Boötes and encompasses one percent of the space in the known universe.
October 2, 1981 (Friday)
The Ayatollah Ali Khamenei was elected president of Iran with 16,007,972 votes out of 16,846,996 cast. Education minister Ali-Akbar Parvaresh placed second.
U.S. president Ronald Reagan announced his plans to resurrect the B-1 bomber program that had been scrapped by President Carter, with 100 of the planes to be built by 1987, and another plan to deploy 100 MX missiles.
Died:
Harry Golden, 79, American journalist
Hazel Scott, 61, American jazz singer and pianist
October 3, 1981 (Saturday)
The hunger strike at Maze Prison was called off after seven months by Sinn Féin, the political arm of the Irish Republican Army. Ten IRA prisoners had died, while another seven had given up fasting. The decision, made by prisoner Brendan McFarlane, ended the fasting for the remaining six IRA strikers. Three days later, Secretary of State for Northern Ireland James Prior announced that some of the original demands of the strikers, including the right to not wear prison uniforms, would be granted.
Born: Zlatan Ibrahimović, Swedish footballer, in Malmö
October 4, 1981 (Sunday)
The body in Lee Harvey Oswald's grave was exhumed at the Rose Hill Cemetery in Fort Worth, Texas to determine whether the corpse was indeed Oswald's. Michael Eddowes, author of the 1977 book The Oswald File, paid the $250,000 expense for the body removal and its examination at the Baylor University Medical Center. Oswald's dental records were examined and confirmed that his was indeed the body in the grave. The examining team wrote a detailed account of the examination two years later.
October 5, 1981 (Monday)
The last model of the Triumph Motor Company's sports cars, a 1982 T
|
https://en.wikipedia.org/wiki/TechLife
|
TechLife (formerly PC User) is an Australian general computer magazine, published monthly by Future Australia.
The magazine's regular content consists of computer hardware and software reviews and previews, technology news and opinion articles, technical how-to guides, and a 'help station' feature where the magazine's contributors provide answers to technical queries from readers. Each issue includes a companion DVD of free full-version software, trial software, game demos and video tutorials, many of which complement articles in the magazine. The magazine also includes software created by contributing writers, including two customized versions of Linux – 'UserOS Ultra', based on Xubuntu 7.10 and aimed at older computers; and 'PCUserOS Extreme', based on the Ubuntu 8.04 'Hardy Heron' and designed for use on more recent computer hardware.
Notable Australian IT journalists who have regularly contributed to the magazine include Rose Vines, Helen Bradley, Darren Yates, Philip Moore, Link Harris, David Flynn, Roulla Yiacoumi, Alex Kidman and Angus Kidman.
History
PC User was first published in 1990 and is Australia's best selling computer magazine, with a monthly circulation of 31,062 as at July–December 2011.
In 2009 a "NetGuide" section was added after the cessation of publication of Australian NetGuide.
In January 2010, PC User celebrated its 20th anniversary with a special anniversary issue.
Long-time editor Glenn Rees (who edited the title from 1992 to 1999 and again from 2002 to 2012) left the magazine in February 2012 as part of a restructure of the Australian Consolidated Press tech magazines including the PC User sister publication APC. The current editor-in-chief of PC User is Tony Sarno, who is also editor-in-chief of APC.
In June 2012, PC User was rebranded and relaunched as TechLife "to address a lack of innovation in the consumer technology publication space" according to the publisher, as well as more clearly delineating the difference between the more mainstream PC User and APC, which is aimed at professionals and "power users". TechLife will be available in print and tablet editions and cover a broader spectrum than PC User, offering editorial on the application of technology to all consumer lifestyle activities, from fitness to entertainment.
In August 2013, TechLife and APC were sold to Future.
References
External links
1990 establishments in Australia
ACP magazine titles
Computer magazines published in Australia
Magazines established in 1990
Magazines published in Sydney
Monthly magazines published in Australia
|
https://en.wikipedia.org/wiki/Tim%20Webster
|
Tim Webster (born 15 December 1951) is an Australian television and radio personality and sports broadcaster. He held various presenting roles on Network 10 from 1981 until 2008.
Career
Early career
In 1972, Webster started working for Bathurst radio station 2BS, progressing from a media buyer to a radio announcer. Later, Webster was part of the on-air team at Triple M Sydney.
Television
Webster was the first newsreader on breakfast television show Good Morning Australia. In the early 1980s, he presented Eyewitness News in Sydney alongside Katrina Lee. The pair enjoyed considerable success, often No. 1 in their timeslot.
On 20 January 1992, Webster launched Australia's first regular weeknight 5:00 pm newscast, reuniting with Katrina Lee to co-present Sydney's Ten Eyewitness News First at Five.
Webster covered various major sporting events for Network 10, including the Melbourne Cup, Olympic Games, Commonwealth Games and Australasian golf tour. From 1993 to 2004, he was the host of the nightly sports program Sports Tonight.
During the 2003 Logie Awards, Webster was bitten on a thigh by a snake that Steve Irwin was handling during a performance.
In 2005, Webster became the co-presenter of Perth's Ten News at Five, alongside Charmaine Dragun, while continuing as the sports presenter on the Sydney bulletin. Following Dragun's death in late 2007, Webster continued as the solo anchor of the Perth bulletin until 5 May 2008, after which he was replaced by Narelda Jacobs ahead of the bulletin's relocation back to Perth. Later that same month, he stepped down as the Sydney bulletin's sports presenter on 30 May 2008, retiring from Network 10 after 27 years.
In early 2011, Webster presented sport alongside Sandra Sully on Sydney's short-lived Ten Evening News. After that bulletin was axed, and replaced by 6.30 with George Negus (which moved from its original 6:00 pm timeslot) on 4 April 2011, Webster acted as a fill-in presenter for Ten News at Five and other national bulletins.
Radio
In June 2008, Webster joined radio station 2UE as fill-in newsreader and sports presenter. He replaced Steve Price who moved to John Laws' former timeslot.
Webster hosted an afternoon program on Sydney's 2UE, 1.00 pm to 4.00 pm Monday to Friday, before joining Macquarie Sports Radio in 2018 as a weekend host.
In February 2019, Webster took over mornings on Sydney's 2CH from Bob Rogers. In January 2020, he moved to breakfast. In 2023 Webster joined ABC Radio Sydney as a presenter on the national overnight program.
Personal life
Webster went to school at Scots College in Sydney.
Webster has two sons and a daughter.
Webster was diagnosed with Barrett's esophagus in 2005. He developed oesophageal cancer as a result of the condition and underwent surgery to remove a tumour in his oesophagus.
References
Australian sports broadcasters
Former 2GB presenters
Living people
People educated at Scots College (Sydney)
Television personalities from Sydney
Sky News Australia
|
https://en.wikipedia.org/wiki/Equiangular%20lines
|
In geometry, a set of lines is called equiangular if all the lines intersect at a single point, and every pair of lines makes the same angle.
Equiangular lines in Euclidean space
Computing the maximum number of equiangular lines in n-dimensional Euclidean space is a difficult problem, and unsolved in general, though bounds are known. The maximal number of equiangular lines in 2-dimensional Euclidean space is 3: we can take the lines through opposite vertices of a regular hexagon, each at an angle 120 degrees from the other two. The maximum in 3 dimensions is 6: we can take lines through opposite vertices of an icosahedron. It is known that the maximum number in any dimension is less than or equal to . This upper bound is tight up to a constant factor to a construction by de Caen. The maximum in dimensions 1 through 16 is listed in the On-Line Encyclopedia of Integer Sequences as follows:
1, 3, 6, 6, 10, 16, 28, 28, 28, 28, 28, 28, 28, 28, 36, 40, ... .
In particular, the maximum number of equiangular lines in 7 dimensions is 28. We can obtain these lines as follows. Take the vector (−3,−3,1,1,1,1,1,1) in , and form all 28 vectors obtained by permuting the components of this. The dot product of two of these vectors is 8 if both have a component 3 in the same place or −8 otherwise. Thus, the lines through the origin containing these vectors are equiangular. Moreover, all 28 vectors are orthogonal to the vector (1,1,1,1,1,1,1,1) in , so they lie in a 7-dimensional space. In fact, these 28 vectors and their negatives are, up to rotation and dilation, the 56 vertices of the 321 polytope. In other words, they are the weight vectors of the 56-dimensional representation of the Lie group E7.
Equiangular lines are equivalent to two-graphs. Given a set of equiangular lines, let c be the cosine of the common angle. We assume that the angle is not 90°, since that case is trivial (i.e., not interesting, because the lines are just coordinate axes); thus, c is nonzero. We may move the lines so they all pass through the origin of coordinates. Choose one unit vector in each line. Form the matrix M of inner products. This matrix has 1 on the diagonal and ±c everywhere else, and it is symmetric. Subtracting the identity matrix I and dividing by c, we have a symmetric matrix with zero diagonal and ±1 off the diagonal. This is the Seidel adjacency matrix of a two-graph. Conversely, every two-graph can be represented as a set of equiangular lines.
The problem of determining the maximum number of equiangular lines with a fixed angle in sufficiently high dimensions was solved by Jiang, Tidor, Yao, Zhang, and Zhao. The answer is expressed in spectral graph theoretic terms. Let denote the maximum number of lines through the origin in dimensions with common pairwise angle . Let denote the minimum number (if it exists) of vertices in a graph whose adjacency matrix has spectral radius exactly . If is finite, then for all sufficiently large dimension
|
https://en.wikipedia.org/wiki/Outbound%20Systems
|
Outbound Systems, Inc., was an American computer company based in Boulder, Colorado. Founded by Warren Conner in 1989, the company offered Macintosh clone computer systems in various portable form factors between 1989 and 1991. It left the Mac conversion business in 1992 to build windows-based desktop computers before going bankrupt in 1993.
Wallaby laptop
The company's first product, the Wallaby, was a Mac clone laptop. It is powered by a 15-MHz Motorola 68000 processor. Later versions increased the clock speed to 20 MHz.
The Wallaby laptop was introduced in 1989 and was significantly lighter, at just over 4 kg, and easier to carry than Apple's own Macintosh Portable released at around the same time. Due to Apple's refusal to license the Macintosh Toolbox in read-only memory (ROM), Wallaby users had to install a Mac ROM to make the computer work. The ROM was typically removed from an older Mac, a process that would render the donor Mac unusable except when docked with the laptop using a special cable. Even with this additional cost, a typical price of $4,000 USD compared favorably to that of the Mac Portable.
The Wallaby featured a built-in pointing device located below the keyboard, named the Trackbar (with earlier models referring to it under the trademark of Isopoint); it was a cylinder that scrolled up and down and slid left and right. It ran on standard camcorder batteries, rather than the expensive custom batteries commonly found in most portable computers around this time.
Outbound notebook
The Wallaby laptop was succeeded by the Outbound notebook in 1991.
The Notebook ran on the same style of lead-acid camcorder batteries as the earlier Laptop, and had a 9.7" passive-matrix monochrome LCD display. It used a 2.5" IDE hard drive, which was unusual for the time, as Apple didn't start using IDE drives in PowerBooks until the PowerBook 150 in 1994. The Notebook had an internal microphone and speaker, headphone jack, two serial ports, ADB port, and SCSI port. The Notebook's SCSI port was unique in that it supported the Outbound Outrigger full-page external monochrome monitor, which attached via the SCSI port.
The Notebook's CPU, RAM, Mac ROM, and optional 68882 FPU were mounted on a removable daughtercard. This permitted easy RAM installation and optional upgrades; the daughtercard could simply be swapped out for another one with a faster CPU, or an FPU inserted into the available socket. The daughtercard had four 30-pin SIMM sockets. Due to the Notebook's design, only 4MB of RAM could be addressed by the Mac system software, even in System 7; additional RAM would appear as a "Silicon Disk" which was an Outbound specific RAM disk.
Demise
Apple's introduction of the PowerBook in 1991 led to the demise of the Mac-compatible laptop aftermarket. Probably more significant than the increased competition was the fact that Outbound was using ROMs under a licensing agreement with Apple. Apple refused to license the use of subsequent proprietary
|
https://en.wikipedia.org/wiki/Jim%20Horning
|
James Jay Horning (24 August 1942 – 18 January 2013) was an American computer scientist and ACM Fellow.
Overview
Jim Horning received a PhD in computer science from Stanford University in 1969 for a thesis entitled A Study of Grammatical Inference. He was a founding member, and later chairman, of the Computer Systems Research Group at the University of Toronto, Canada, from 1969 until 1977. He was then a Research Fellow at the Xerox Palo Alto Research Center (PARC) from 1977 until 1984 and a founding member and senior consultant at DEC Systems Research Center (DEC/SRC) from 1984 until 1996. He was founder and director of STAR Lab from 1997 until 2001 at InterTrust Technologies Corp.
Peter G. Neumann reported on 22 January 2013 in the RISKS Digest, Volume 27, Issue 14, that Horning had died on 18 January 2013.
Horning's interests included programming languages, programming methodology, specification, formal methods, digital rights management and computer/network security. A major contribution was his involvement with the Larch approach to formal specification with John Guttag (MIT) et al.
Selected publications
A Compiler Generator (with William M. McKeeman and D. B. Wortman), Prentice Hall (1970). .
References
External links
Home page
Curriculum Vitae
1942 births
2013 deaths
Stanford University alumni
American computer scientists
Academic staff of the University of Toronto
Xerox people
Digital Equipment Corporation people
Fellows of the Association for Computing Machinery
Formal methods people
|
https://en.wikipedia.org/wiki/SBS%20Monday%20comedy%20slot
|
The SBS Monday comedy slot was part of the schedule of Australian state broadcaster SBS dedicated to off-beat, often offensive comedy programming, often produced by SBS itself and usually the highest rating night on SBS TV.
Prior to 2013, programs aired between 8:30 and 9:30pm Monday nights, after Top Gear and before SBS World News Australia. During the summer non-ratings period, it aired after Top Gear Australia. As of 2014, the slot is currently filled with programs of other genres, and much comedy programming is screened on SBS Two.
Programs aired
Bro'Town
Broken News
Chappelle's Show
Crank Yankers
Drawn Together
Garth Marenghi's Darkplace
Gerhard Reinke's Wanderlust
Housos
John Callahan's Quads!
John Safran vs God
John Safran's Music Jamboree
Life Support
The Mighty Boosh
Pizza World Record
Rex the Runt
Song for the Socceroos
South Park
Speaking in Tongues
Stella Street
Strangers with Candy
Stripperella
Swift and Shift Couriers
Velvet Soup
External links
SBS TV's website
Lists of Australian television series
Special Broadcasting Service original programming
Television programming blocks in Australia
|
https://en.wikipedia.org/wiki/Perfect%20Developer
|
Perfect Developer (PD) is a tool for developing computer programs in a rigorous manner. It is used to develop applications in areas including IT systems and airborne critical systems. The principle is to develop a formal specification and refine the specification to code. Even though the tool is founded on formal methods, the suppliers claim that advanced mathematical knowledge is not a prerequisite.
PD supports the Verified Design by Contract paradigm, which is an extension of Design by contract. In Verified Design by Contract, the contracts are verified by static analysis and automated theorem proving, so that it is certain that they will not fail at runtime.
The Perfect specification language used has an object-oriented style, producing code in programming languages including Java, C# and C++. It has been developed by the UK company Escher Technologies Ltd. They note on their website that their claim is not that the language itself is perfect, but that it can be used to produce code which perfectly implements a precise specification.
See also
JML
Safety Integrity Level
External links
Perfect Developer
Escher Technologies
Defence Standards
Formal methods tools
Formal specification languages
|
https://en.wikipedia.org/wiki/Nord-10
|
Nord-10 was a medium-sized general-purpose 16-bit minicomputer designed for multilingual time-sharing applications and for real-time multi-program systems, produced by Norsk Data. It was introduced in 1973. The later follow up model, Nord-10/S, introduced in 1975, introduced CPU cache, paging, and other miscellaneous improvements.
The CPU had a microprocessor, which was defined in the manual as a portmanteau of microcode processor, not to be confused with the then nascent microprocessor. The CPU additionally contained instructions, operator communication, bootstrap loaders, and hardware test programs, that were implemented in a 1K read-only memory.
The microprocessor also allowed for customer specified instructions to be built in. Nord-10 had a memory management system with hardware paging extending the memory size from 64 to 256K 16-bit words and two independent protecting systems, one acting on each page and one on the mode of instructions. The interrupt system had 16 program levels in hardware, each with its own set of general-purpose registers.
Note: Much of the following information is taken from a document written by Norsk Data introducing the Nord-10. Some information, particularly about the memory system, may be inaccurate for the later Nord-10/S.
Central processor
The central processing unit (CPU) consisted of a total 24 printed circuit boards. The last eight positions in the rack were used for input/output (I/O) devices operated by program control, such as the console teleprinter (teletype), paper punched tape and punched card reader and punch, line printer, display, operator's panel, and a real-time clock.
The Nord-10 had 160 processor registers, of which 128 were available to programs, eight on each of the 16 program levels. Six of those registers were general registers, one was the program counter, and the other contained status information. Floating point arithmetic operations were standard. The instructions could operate on five different formats, a bit, an 8-bit byte, 16-bit words, 32-bit double words, and 48-bit floating point words.
Memory
The random-access memory system of the first Nord-10s were built up of 8K 16-bit modules housed in a special memory rack. One 19-inch rack could hold up to eight 8K modules. It was possible to extend the Nord-10's physical address space beyond 64K up to a maximum of 256K 16-bit words. The paging system translated a 16-bit virtual address into an 18-bit physical address.
The hardware paging system made it possible for one user to write programs up to 64K (virtual memory), and only parts of the program to be present in physical memory at any time (using dynamic memory allocation). The paging system divided memory into 1K pages. The four page index tables were found in a 256 word extremely fast memory block. The calculation of a physical address resulted in no appreciable delay in the effective memory cycle time.
The Nord-10 had two independent protection systems. Each individual page c
|
https://en.wikipedia.org/wiki/Nord-1
|
Nord-1 was Norsk Data's first minicomputer and the first commercially available computer made in Norway.
It was a 16-bit system, developed in 1967 from the Simulation for Automatic Machinery. The first Nord-1 (serial number 2) installed was at the heart of a complete ship system aboard a Japanese-built cargo liner, the Taimyr. The system included bridge control, power management, load condition monitoring, and the first ever computer-controlled, radar-sensed anti-collision system (Automatic Radar Plotting Aid). Taimyr's Nord-1 turned out reliable for the time, with more than a year between failures.
It was probably the first minicomputer to feature floating-point arithmetic equipment as standard, and had an unusually rich complement of hardware registers for its time. It also featured relative addressing, and a fully automatic context switched interrupt system. It was also the first minicomputer to offer virtual memory, offered as an option by 1969. It was succeeded by the Nord-10.
Remaining machines
The Nord-1 has been unusually well-preserved. Approximately 60 machines seem to have been produced, and at the very least ten machines have been preserved, including serial numbers 2, 4, and 5. This may be because the company Norsk Data was already a very large and very rapidly growing corporation by the time many of these machines were decommissioned.
References
Norsk Data minicomputers
1967 establishments in Norway
16-bit computers
|
https://en.wikipedia.org/wiki/John%20Rushby
|
John Rushby (born 1949) is a British computer scientist now based in the United States and working for SRI International. He previously taught and did research for Manchester University and later Newcastle University.
Early life and education
John Rushby was born and brought up in London, where he attended Dartford Grammar School. He studied at Newcastle University in the United Kingdom, gaining his computer science BSc there in 1971 and his PhD in 1977.
Career
From 1974 to 1975, he was a lecturer in the Computer Science Department at Manchester University. From 1979 to 1982, he was a research associate in the Department of Computing Science at the Newcastle University.
Rushby joined SRI International in Menlo Park, California in 1983. Currently he is Program Director for Formal Methods and Dependable Systems in the Computer Science Laboratory at SRI. He developed the Prototype Verification System, which is a theorem prover.
Awards and memberships
Rushby was the recipient of the 2011 Harlan D. Mills Award from the IEEE Computer Society.
References
External links
Official homepage
Personal homepage
Living people
British computer scientists
American computer scientists
Formal methods people
Alumni of Newcastle University
British expatriates in the United States
SRI International people
People educated at Dartford Grammar School
1949 births
|
https://en.wikipedia.org/wiki/Butterfly%20diagram
|
In the context of fast Fourier transform algorithms, a butterfly is a portion of the computation that combines the results of smaller discrete Fourier transforms (DFTs) into a larger DFT, or vice versa (breaking a larger DFT up into subtransforms). The name "butterfly" comes from the shape of the data-flow diagram in the radix-2 case, as described below. The earliest occurrence in print of the term is thought to be in a 1969 MIT technical report. The same structure can also be found in the Viterbi algorithm, used for finding the most likely sequence of hidden states.
Most commonly, the term "butterfly" appears in the context of the Cooley–Tukey FFT algorithm, which recursively breaks down a DFT of composite size n = rm into r smaller transforms of size m where r is the "radix" of the transform. These smaller DFTs are then combined via size-r butterflies, which themselves are DFTs of size r (performed m times on corresponding outputs of the sub-transforms) pre-multiplied by roots of unity (known as twiddle factors). (This is the "decimation in time" case; one can also perform the steps in reverse, known as "decimation in frequency", where the butterflies come first and are post-multiplied by twiddle factors. See also the Cooley–Tukey FFT article.)
Radix-2 butterfly diagram
In the case of the radix-2 Cooley–Tukey algorithm, the butterfly is simply a DFT of size-2 that takes two inputs (x0, x1) (corresponding outputs of the two sub-transforms) and gives two outputs (y0, y1) by the formula (not including twiddle factors):
If one draws the data-flow diagram for this pair of operations, the (x0, x1) to (y0, y1) lines cross and resemble the wings of a butterfly, hence the name (see also the illustration at right).
More specifically, a radix-2 decimation-in-time FFT algorithm on n = 2 p inputs with respect to a primitive n-th root of unity relies on O(n log2 n) butterflies of the form:
where k is an integer depending on the part of the transform being computed. Whereas the corresponding inverse transform can mathematically be performed by replacing ω with ω−1 (and possibly multiplying by an overall scale factor, depending on the normalization convention), one may also directly invert the butterflies:
corresponding to a decimation-in-frequency FFT algorithm.
Other uses
The butterfly can also be used to improve the randomness of large arrays of partially random numbers, by bringing every 32 or 64 bit word into causal contact with every other word through a desired hashing algorithm, so that a change in any one bit has the possibility of changing all the bits in the large array.
See also
Mathematical diagram
Zassenhaus lemma
Signal-flow graph
References
External links
explanation of the FFT and butterfly diagrams.
butterfly diagrams of various FFT implementations (Radix-2, Radix-4, Split-Radix).
FFT algorithms
Diagrams
|
https://en.wikipedia.org/wiki/Banedanmark
|
Banedanmark (; previously Banestyrelsen) is a Danish company that is responsible for the maintenance and traffic control on all of the state owned Danish railway network.
History
In 1997, Banedanmark came into existence, having been branched off from DSB as a government agency. Between 2004 and 2010, Banedanmark was a state-owned company that was controlled by the Danish Ministry of Transport. During 2010, Banedanmark was reorganised, once again becoming a government agency under the Danish Ministry of Transport.
One of the first projects overseen by Banedanmark, although most of the construction work had already been completed prior to its creation, was the Øresund Bridge, a combined railway and motorway bridge spanning the Øresund strait between Denmark and Sweden. The bridge, which was recognised under the Trans-European Transport Network (TEN-T) framework as Priority Project 11, was opened to traffic in 1999.
During 2008, Banedanmark announced plans for the conversion of signalling across the entire Danish railway network to European Train Control System (ETCS) Level 2. This measure was necessitated by the near obsolete nature of parts of the network's signalling. In 2009, the Danish government approved funding of €3.3 billion over several years to Banedanmark for the project; at the time, the projected completion date was 2021. This programme makes Denmark the first European country to attempt a complete conversion of a national network to ETCS Level 2. Additional funding for the initiative was provided by the European Union. The resignalling work was put out to competitive tender, and contracts awarded to Alstom in July 2012. At the same time, Banedanmark was also undertaking the progressive electrification of several unelectrified lines; accordingly, the organisation originally planned for the ETCS rollout to be synchronised with these electrification efforts as to minimise cost and the infrastructure changes required.
However, during the late 2010s, the ETCS programme reportedly ran into issues with the retrofitting of existing rolling stock to use the new signalling system; the IC3 fleet of long distance diesel multiple units proved to be a particular source of problems, thus the end date of the rollout was postponed considerably. Freight operators were also reportedly unable to upgrade some of their locomotives to be ETCS compatible yet. These difficulties were in part compounded by the sweeping scale of the programme; no other nation had attempted such a conversion before and was regarded as one of the largest resignalling schemes in the world. During August 2022, it was announced that work to replace legacy signalling with ETCS on the Holstebro - Herning and Vejle - Skanderborg lines in Jutland had been completed; it was anticipated that the ETCS rollout would continue through to 2030. Advantages of the new signalling included better train punctuality, more stable operation, and more detailed traffic information.
Another major un
|
https://en.wikipedia.org/wiki/Twiddle%20factor
|
A twiddle factor, in fast Fourier transform (FFT) algorithms, is any of the trigonometric constant coefficients that are multiplied by the data in the course of the algorithm. This term was apparently coined by Gentleman & Sande in 1966, and has since become widespread in thousands of papers of the FFT literature.
More specifically, "twiddle factors" originally referred to the root-of-unity complex multiplicative constants in the butterfly operations of the Cooley–Tukey FFT algorithm, used to recursively combine smaller discrete Fourier transforms. This remains the term's most common meaning, but it may also be used for any data-independent multiplicative constant in an FFT.
The prime-factor FFT algorithm is one unusual case in which an FFT can be performed without twiddle factors, albeit only for restricted factorizations of the transform size.
For example, W82 is a twiddle factor used in 8-point radix-2 FFT.
References
W. M. Gentleman and G. Sande, "Fast Fourier transforms—for fun and profit," Proc. AFIPS 29, 563–578 (1966).
FFT algorithms
|
https://en.wikipedia.org/wiki/Code%20bloat
|
In computer programming, code bloat is the production of program code (source code or machine code) that is perceived as unnecessarily long, slow, or otherwise wasteful of resources. Code bloat can be caused by inadequacies in the programming language in which the code is written, the compiler used to compile it, or the programmer writing it. Thus, while code bloat generally refers to source code size (as produced by the programmer), it can be used to refer instead to the generated code size or even the binary file size.
Examples
The following JavaScript algorithm has a large number of redundant variables, unnecessary logic and inefficient string concatenation.
// Complex
function TK2getImageHTML(size, zoom, sensor, markers) {
var strFinalImage = "";
var strHTMLStart = '<img src="';
var strHTMLEnd = '" alt="The map"/>';
var strURL = "http://maps.google.com/maps/api/staticmap?center=";
var strSize = '&size='+ size;
var strZoom = '&zoom='+ zoom;
var strSensor = '&sensor='+ sensor;
strURL += markers[0].latitude;
strURL += ",";
strURL += markers[0].longitude;
strURL += strSize;
strURL += strZoom;
strURL += strSensor;
for (var i = 0; i < markers.length; i++) {
strURL += markers[i].addMarker();
}
strFinalImage = strHTMLStart + strURL + strHTMLEnd;
return strFinalImage;
};
The same logic can be stated more efficiently as follows:
// Simplified
const TK2getImageHTML = (size, zoom, sensor, markers) => {
const [ { latitude, longitude } ] = markers;
let url = `http://maps.google.com/maps/api/staticmap?center=${ latitude },${ longitude }&size=${ size }&zoom=${ zoom }&sensor=${ sensor }`;
markers.forEach(marker => url += marker.addMarker());
return `<img src="${ url }" alt="The map" />`;
};
Code density of different languages
The difference in code density between various computer languages is so great that often less memory is needed to hold both a program written in a "compact" language (such as a domain-specific programming language, Microsoft P-Code, or threaded code), plus an interpreter for that compact language (written in native code), than to hold that program written directly in native code.
Reducing bloat
Some techniques for reducing code bloat include:
Code refactoring a commonly used code sequence into a subroutine, and calling that subroutine from several locations, rather than copy and pasting the code at each of those locations (copy-and-paste programming).
Re-using subroutines that have already been written (perhaps with additional parameters), rather than re-writing them again from scratch as a new routine.
Combine Program analysis to detect bloated code, with Program transformation to remove bloated code.
See also
Dead code elimination
Minimalism (computing)
Muntzing
Polymorphism (computer science)
Software optimization
Software bloat
Lightweight software
References
Software optimization
Software eng
|
https://en.wikipedia.org/wiki/Edge%20disjoint%20shortest%20pair%20algorithm
|
Edge disjoint shortest pair algorithm is an algorithm in computer network routing. The algorithm is used for generating the shortest pair of edge disjoint paths between a given pair of vertices. For an undirected graph G(V, E), it is stated as follows:
Run the shortest path algorithm for the given pair of vertices
Replace each edge of the shortest path (equivalent to two oppositely directed arcs) by a single arc directed towards the source vertex
Make the length of each of the above arcs negative
Run the shortest path algorithm (Note: the algorithm should accept negative costs)
Erase the overlapping edges of the two paths found, and reverse the direction of the remaining arcs on the first shortest path such that each arc on it is directed towards the destination vertex now. The desired pair of paths results.
In lieu of the general purpose Ford's shortest path algorithm valid for negative arcs present anywhere in a graph (with nonexistent negative cycles), Bhandari provides two different algorithms, either one of which can be used in Step 4. One algorithm is a slight modification of the traditional Dijkstra's algorithm, and the other called the Breadth-First-Search (BFS) algorithm is a variant of the Moore's algorithm. Because the negative arcs are only on the first shortest path, no negative cycle arises in the transformed graph (Steps 2 and 3). In a nonnegative graph, the modified Dijkstra algorithm reduces to the traditional Dijkstra's algorithm, and can therefore be used in Step 1 of the above algorithm (and similarly, the BFS algorithm).
The Modified Dijkstra AlgorithmBhandari, Ramesh (1994), “Optimal Diverse Routing in Telecommunication Fiber Networks”, Proc. of IEEE INFOCOM, Toronto, Canada, pp. 1498-1508.
G = (V, E)
d(i) – the distance of vertex i (i∈V) from source vertex A; it is the sum of arcs in a possible
path from vertex A to vertex i. Note that d(A)=0;
P(i) – the predecessor of vertex i on the same path.
Z – the destination vertex
Step 1.
Start with d(A) = 0,
d(i) = l (Ai), if i∈ΓA; Γi ≡ set of neighbor vertices of vertex i, l(ij) = length of arc from vertex i to vertex j.
= ∞, otherwise.
Assign S = V-{A}, where V is the set of vertices in the given graph.
Assign P(i) = A, ∀i∈S.
Step 2.
a) Find j∈S such that d(j) = min d(i), i∈S.
b) Set S = S – {j}.
c) If j = Z (the destination vertex), END; otherwise go to Step 3.
Step 3.
∀i∈Γj, if d(j) + l(ji) < d(i),
a) set d(i) = d(j) + l(ji), P(i) = j.
b) S = S ∪{i}
Go to Step 2.
Example
The main steps of the edge-disjoint shortest pair algorithm are illustrated below:Figure A shows the given undirected graph G(V, E) with edge weights.
Figure B displays the calculated shortest path ABCZ from A to Z (in bold lines).
Figure C shows the reversal of the arcs of the shortest path and their negative weights.
Figure D displays the shortest path ADCBZ from A to Z determined in the new transformed. graph of Figure C (this is determined using the
|
https://en.wikipedia.org/wiki/Poisson%20regression
|
In statistics, Poisson regression is a generalized linear model form of regression analysis used to model count data and contingency tables. Poisson regression assumes the response variable Y has a Poisson distribution, and assumes the logarithm of its expected value can be modeled by a linear combination of unknown parameters. A Poisson regression model is sometimes known as a log-linear model, especially when used to model contingency tables.
Negative binomial regression is a popular generalization of Poisson regression because it loosens the highly restrictive assumption that the variance is equal to the mean made by the Poisson model. The traditional negative binomial regression model is based on the Poisson-gamma mixture distribution. This model is popular because it models the Poisson heterogeneity with a gamma distribution.
Poisson regression models are generalized linear models with the logarithm as the (canonical) link function, and the Poisson distribution function as the assumed probability distribution of the response.
Regression models
If is a vector of independent variables, then the model takes the form
where and . Sometimes this is written more compactly as
where is now an (n + 1)-dimensional vector consisting of n independent variables concatenated to the number one. Here is simply concatenated to .
Thus, when given a Poisson regression model and an input vector , the predicted mean of the associated Poisson distribution is given by
If are independent observations with corresponding values of the predictor variables, then can be estimated by maximum likelihood. The maximum-likelihood estimates lack a closed-form expression and must be found by numerical methods. The probability surface for maximum-likelihood Poisson regression is always concave, making Newton–Raphson or other gradient-based methods appropriate estimation techniques.
Maximum likelihood-based parameter estimation
Given a set of parameters θ and an input vector x, the mean of the predicted Poisson distribution, as stated above, is given by
and thus, the Poisson distribution's probability mass function is given by
Now suppose we are given a data set consisting of m vectors , along with a set of m values . Then, for a given set of parameters θ, the probability of attaining this particular set of data is given by
By the method of maximum likelihood, we wish to find the set of parameters θ that makes this probability as large as possible. To do this, the equation is first rewritten as a likelihood function in terms of θ:
Note that the expression on the right hand side has not actually changed. A formula in this form is typically difficult to work with; instead, one uses the log-likelihood:
Notice that the parameters θ only appear in the first two terms of each term in the summation. Therefore, given that we are only interested in finding the best value for θ we may drop the yi! and simply write
To find a maximum, we need to solve an equation
|
https://en.wikipedia.org/wiki/Model-based%20reasoning
|
In artificial intelligence, model-based reasoning refers to an inference method used in expert systems based on a model of the physical world. With this approach, the main focus of application development is developing the model. Then at run time, an "engine" combines this model knowledge with observed data to derive conclusions such as a diagnosis or a prediction.
Reasoning with declarative models
A robot and dynamical systems as well are controlled by software. The software is implemented as a normal computer program which consists of if-then-statements, for-loops and subroutines. The task for the programmer is to find an algorithm which is able to control the robot, so that it can do a task. In the history of robotics and optimal control there were many paradigm developed. One of them are expert systems, which is focused on restricted domains. Expert systems are the precursor to model based systems.
The main reason why model-based reasoning is researched since the 1990s is to create different layers for modeling and control of a system. This allows to solve more complex tasks and existing programs can be reused for different problems. The model layer is used to monitor a system and to evaluate if the actions are correct, while the control layer determines the actions and brings the system into a goal state.
Typical techniques to implement a model are declarative programming languages like Prolog and Golog. From a mathematical point of view, a declarative model has much in common with the situation calculus as a logical formalization for describing a system. From a more practical perspective, a declarative model means, that the system is simulated with a game engine. A game engine takes a feature as input value and determines the output signal. Sometimes, a game engine is described as a prediction engine for simulating the world.
In 1990, criticism was formulated on model-based reasoning. Pioneers of Nouvelle AI have argued, that symbolic models are separated from underlying physical systems and they fail to control robots. According to behavior-based robotics representative a reactive architecture can overcome the issue. Such a system doesn't need a symbolic model but the actions are connected direct to sensor signals which are grounded in reality.
Knowledge representation
In a model-based reasoning system knowledge can be represented using causal rules. For example, in a medical diagnosis system the knowledge base may contain the following rule:
patients : Stroke(patient) Confused(patient) Unequal(Pupils(patient))
In contrast in a diagnostic reasoning system knowledge would be represented through diagnostic rules such as:
patients : Confused(patient) Stroke(patient)
patients : Unequal(Pupils(patient)) Stroke(patient)
There are many other forms of models that may be used. Models might be quantitative (for instance, based on mathematical equations) or qualitative (for instance, based on cause/effect models.) They may i
|
https://en.wikipedia.org/wiki/Inerter
|
Inerter may refer to:
Inerting system, a device to increase the safety of a closed tank that contains highly flammable material
Inerter, an element of mechanical network theory, known as a J-damper when implemented as a real device in the suspensions of Formula 1 racing cars
|
https://en.wikipedia.org/wiki/Mashup%20%28web%20application%20hybrid%29
|
A mashup (computer industry jargon), in web development, is a web page or web application that uses content from more than one source to create a single new service displayed in a single graphical interface. For example, a user could combine the addresses and photographs of their library branches with a Google map to create a map mashup. The term implies easy, fast integration, frequently using open application programming interfaces (open API) and data sources to produce enriched results that were not necessarily the original reason for producing the raw source data.
The term mashup originally comes from creating something by combining elements from two or more sources.
The main characteristics of a mashup are combination, visualization, and aggregation. It is important to make existing data more useful, for personal and professional use. To be able to permanently access the data of other services, mashups are generally client applications or hosted online.
In the past years, more and more Web applications have published APIs that enable software developers to easily integrate data and functions the SOA way, instead of building them by themselves. Mashups can be considered to have an active role in the evolution of social software and Web 2.0. Mashup composition tools are usually simple enough to be used by end-users. They generally do not require programming skills and rather support visual wiring of GUI widgets, services and components together. Therefore, these tools contribute to a new vision of the Web, where users are able to contribute.
The term "mashup" is not formally defined by any standard-setting body.
History
The broader context of the history of the Web provides a background for the development of mashups. Under the Web 1.0 model, organizations stored consumer data on portals and updated them regularly. They controlled all the consumer data, and the consumer had to use their products and services to get the information.
The advent of Web 2.0 introduced Web standards that were commonly and widely adopted across traditional competitors and which unlocked the consumer data. At the same time, mashups emerged, allowing mixing and matching competitors' APIs to develop new services.
The first mashups used mapping services or photo services to combine these services with data of any kind and therefore to produce visualizations of data.
In the beginning, most mashups were consumer-based, but recently the mashup is to be seen as an interesting concept useful also to enterprises. Business mashups can combine existing internal data with external services to generate new views on the data.
There was also the free Yahoo! Pipes to build mashups for free using the Yahoo! Query Language.
Types of mashup
There are many types of mashup, such as business mashups, consumer mashups, and data mashups. The most common type of mashup is the consumer mashup, aimed at the general public.
Business (or enterprise) mashups define applications that combi
|
https://en.wikipedia.org/wiki/Nights%20with%20Alice%20Cooper
|
Nights with Alice Cooper was a radio show hosted by Detroit born rock and roll artist and shock rock pioneer Alice Cooper. It was syndicated by United Stations Radio Networks and broadcast on a wide variety of affiliate radio stations in the United States, Canada, the United Kingdom, Australia, New Zealand, Oman, and Europe. The most recent show is also streamed online in a continuous loop by Radionomy; this stream is also used for the official Nights with Alice Cooper app for iOS and Android, which additionally offers "exclusive content" as well as interaction with other fans.
During the program, Cooper played requests as well as his favorite songs (most of which are from the classic rock genre), answered emails from his fans, and interviewed celebrities. Celebrities he has interviewed on his show include Joe Perry of Aerosmith, Brian Johnson of AC/DC, Ozzy Osbourne, Meat Loaf, Rob Zombie, Glenn Danzig, Def Leppard, Peter Frampton and Jerry Springer. The show also plays rare tracks from classic rock artists, along with blues, early punk rock, and psychedelic music.
In 2005, The Guardian described the program as "a distinctive music show... Cooper makes an entertaining host with some unique one-liners".
History
The show debuted on January 26, 2004, on 16 stations, including its flagship station, KDKB in Phoenix, Arizona (later moved to sister station KSLX-FM following its switch to alternative rock).
Nights with Alice Cooper features many segments, including "Tuesday Bluesday", "Freaky Facts", "Movie Music Madness", "Cooper's Covers", "Same Name" (two different songs with the same name), "Closet Classic", "The Quiet Room", "Lockdown Rockdown" (songs for Cooper's jailed listeners), "Monster Prog", "Throwback Thursday", "Hey Superstar Clean Out the Garage", "The Best Band You've Never Heard In Your Life" and "Songs We Just Don't Understand". Alice also plays his own rare songs and tells the stories behind them in the "Alice's B.O." (Beyond Obscure) and "Alice's Lost Hits" segments.
Holidays are big events on Nights with Alice Cooper, especially Halloween. The radio show has offered numerous contests and giveaways, including a flyaway trip to see Cooper in concert; a trip to see Led Zeppelin in London; and in October 2008, the giveaway of a signed ESP guitar. Alice is also a huge trivia buff, and gives away signed pairs of his own pants to listeners who correctly answer his questions, which mostly relate to rare rock or movie trivia.
The show is also known for Cooper's humorous self-deprecating one-liner outros to commercial breaks: An announcer often tells Cooper's listeners that they are listening to (among many things) "a man for whom even Dr. Phil has no cure", "a man who is not afraid to look like a fool--and demonstrates so regularly", and, possibly most famously, "a man with a face made for radio", and other things mocking and/or questioning Cooper's intelligence, wisdom, talent, career, activities, looks, etc. in such ways.
In the
|
https://en.wikipedia.org/wiki/Firuzabadi
|
Firuzabadi () also spelled as al-Fayrūzabādī ( (1329–1414) was a lexicographer and was the compiler of al-Qamous (), a comprehensive and, for nearly five centuries, one of the most widely used Arabic dictionaries.
Name
He was Abū al-Ṭāhir Majīd al-Dīn Muḥammad ibn Ya'qūb ibn Muḥammad ibn Ibrāhīm al-Shīrāzī al-Fīrūzābādī (), known simply as Muḥammad ibn Ya'qūb al-Fīrūzābādī (). His nisbas "al-Shīrāzī" and "al-Fīrūzābādī" refer to the cities of Shiraz (located near Kazerun, his place of birth) and Firuzabad (his father's hometown) in Fars, Persia, respectively.
Life
Firuzabadi, of Persian origin, was born in Kazerun, Fars, Persia, and educated in Shiraz, Wasit, Baghdad and Damascus. He spent ten years in Jerusalem before travelling in Western Asia and Egypt, and settling in 1368, in Mecca for almost three decades. From Mecca he visited Delhi in the 1380s. He left Mecca in the mid-1390s and returned to Baghdad, then Shiraz (where he was received by Timur) and finally travelled on to Ta'izz in Yemen. In 1395, he was appointed chief qadi (judge) of Yemen by Al-Ashraf Umar II, who had summoned him from India a few years before to teach in his capital. Al-Ashraf's marriage to a daughter of Firūzābādī added to Firuzabadi's prestige and power in the royal court.
In his latter years, Firūzābādī converted his house at Mecca, and appointed three teachers, to a school of Maliki law.
Sufism and relations with Ibn Arabi
Firuzabadi composed several poems lauding Ibn Arabi for his writings, including the . Ibn Arabi's works inspired Firūzābādī's intense interest in Sufism.
Selected works
("The Surrounding Ocean"); his principal literary legacy is this voluminous dictionary, which amalgamates and supplements two great dictionaries; Al-Muhkam by Ibn Sida (d. 1066) and Al-ʿUbab () by al-Saghānī (d. 1252). Al-Saghānī's dictionary had itself supplemented the seminal medieval Arabic dictionary of Al-Jawharī (d. ca. 1008), titled al-Sihah. Firūzābādī also produced a concise simplified edition using a terse notation system and omitting grammatical examples of usage and some rarer definitions. The larger-print-two-volume concise dictionary proved much more popular than the vast Lisan al-Arab dictionary of Ibn Manzur (d. 1312) with its numerous quotations and usage examples.
Al-Bulghah fī tārīkh a'immat al-lughah () (Damascus 1972, in Arabic).
References
External Links
Searchable Online Version Firuzabadi, al-Qāmūs al-Muḥīṭ القاموس المحيط للفيروزآبادي, The Arabic Lexicon
Further reading
Vivian Strotmann, Majd al-Dīn al-Fīrūzābādī (1329–1415): A Polymath on the Eve of the Early Modern Period, Islamic History and Civilization, Volume 121 (Brill, 2015).
Arabic Lexicography: Its History, and Its Place in the General History of Lexicography, by John Haywood, year 1965
Baheth.info has a searchable copy of Firuzabadi's al-Qāmūs al-Muḥīṭ dictionary
1329 births
People from Kazerun
Iranian writers
1414 deaths
Medieval grammarians of Arabic
Iranian lexicographers
Gra
|
https://en.wikipedia.org/wiki/Hazy%20Sighted%20Link%20State%20Routing%20Protocol
|
The Hazy-Sighted Link State Routing Protocol (HSLS) is a wireless mesh network routing protocol being developed by the CUWiN Foundation. This is an algorithm allowing computers communicating via digital radio in a mesh network to forward messages to computers that are out of reach of direct radio contact. Its network overhead is theoretically optimal, utilizing both proactive and reactive link-state routing to limit network updates in space and time. Its inventors believe it is a more efficient protocol to route wired networks as well. HSLS was invented by researchers at BBN Technologies.
Efficiency
HSLS was made to scale well to networks of over a thousand nodes, and on larger networks begins to exceed the efficiencies of the other routing algorithms. This is accomplished by using a carefully designed balance of update frequency, and update extent in order to propagate link state information optimally. Unlike traditional methods, HSLS does not flood the network with link-state information to attempt to cope with moving nodes that change connections with the rest of the network. Further, HSLS does not require each node to have the same view of the network.
Why a link-state protocol?
Link-state algorithms are theoretically attractive because they find optimal routes, reducing waste of transmission capacity. The inventors of HSLS claim that routing protocols fall into three basically different schemes: proactive (such as OLSR), reactive (such as AODV), and algorithms that accept sub-optimal routings. If one graphs them, they become less efficient as they are more purely any single strategy, and the network grows larger. The best algorithms seem to be in a sweet spot in the middle.
The routing information is called a "link state update." The distance that a link-state is copied is the "time to live" and is a count of the number of times it may be copied from one node to the next.
HSLS is said to optimally balance the features of proactive, reactive, and suboptimal routing approaches. These strategies are blended by limiting link state updates in time and space. By limiting the time to live the amount of transmission capacity is reduced. By limiting the times when a proactive routing update is transmitted, several updates can be collected and transmitted at once, also saving transmission capacity.
By definition, a link-state algorithm uses the available information to produce the best route, so routing is as optimal as possible, given the available information.
The suboptimal routing happens naturally because distant nodes get information less frequently.
Minimizing proactive updates is the tricky part. The scheme is adapted from two limited link-state routing algorithms. One, "Near-Sighted Link-State Routing" is limited in space, in the number of node-hops that routing information may be transmitted. The other routing algorithm, "Discretized Link-State Routing" limits the times that the routing information may be transmitted. Since the
|
https://en.wikipedia.org/wiki/Egon%20B%C3%B6rger
|
Egon Börger (born 13 May 1946) is a German-born computer scientist based in Italy.
Life and work
Börger was born in Bad Laer, Westphalia, Lower Saxony, Germany. Between 1965 and 1971 he studied at the Sorbonne, Paris (France), Université Catholique de Louvain, Institut Supérieur de Philosophie de Louvain and University of Münster (Germany). Between 1972 and 1976, he was at the Università di Salerno in Italy, where he taught the first courses in the newborn Computer Science Degree.
Since 1985 he has held a Chair in computer science at the University of Pisa, Italy. Since September 2010, he has been an elected member of the Academia Europaea.
Egon Börger is a pioneer of applying logical methods in computer science. He is co-founder of the international conference series CSL. He is also one of the founders of the Abstract State Machines (ASM) formal method for accurate and controlled design and analysis of computer-based systems and cofounder of the series of international ASM workshops, which in 2008 merged with the regular meetings of the B and Z User Groups to form the international ABZ conference.
Börger contributed to the theoretical foundations of the method and initiated its industrial applications in a variety of fields, in particular programming languages, System architecture, requirements and software (re-)engineering, control systems, protocols, web services.
To this date, he is one of the leading scientists in ASM-based modeling and verification technology, which he has crucially shaped by his activities. In 2007, he received the Humboldt Research Award.
Festschrifts were produced for Börger's 60th and 75th birthdays.
Selected publications
Egon Börger and Robert Stärk, Abstract State Machines: A Method for High-Level System Design and Analysis, Springer-Verlag, 2003. ()
Egon Börger Computability, Complexity, Logic (North-Holland, Amsterdam 1989, translated from the German original from 1985, Italian Translation Bollati-Borighieri 1989)
Egon Börger, The Classical Decision Problem (co-authored by E.Graedel and Y.Gurevich), Springer-Verlag 1997, , 2nd Edition as "Universitext", Springer-Verlag 2001,
Egon Börger, Java and the Java Virtual Machine: Definition, Verification, Validation (co-authored by R. Staerk and J. Schmid), Springer-Verlag , 2001
Egon Börger and Alexander Raschke, Modeling Companion for Software Pratitioners, Springer, 2018. (, )
References
External links
Egon Börger home page
Publications, etc.
Curriculum Vitae
1946 births
Living people
People from Osnabrück (district)
University of Paris alumni
Université catholique de Louvain alumni
University of Münster alumni
German computer scientists
German emigrants to Italy
Italian computer scientists
Academic staff of the University of Pisa
Formal methods people
Computer science writers
Members of Academia Europaea
20th-century Italian scientists
21st-century Italian scientists
German expatriates in France
|
https://en.wikipedia.org/wiki/CBC%20Records
|
CBC Records was a Canadian record label owned and operated by the Canadian Broadcasting Corporation, which distributed CBC programming, including live concert performances, in album and digital format(s). For much of its history, the label focused primarily on classical music and jazz, as well as tie-in albums to CBC Radio shows such as Royal Canadian Air Farce and Brave New Waves.
The division's origins were in the network's transcription service, which produced and distributed recordings of CBC radio and television programming prior to the 1960s. The CBC began releasing albums in 1966 under the CBC Records imprint in cooperation with commercial labels such as RCA Records, and established its own internal division, CBC Enterprises, in 1982 to directly release the albums as well as CBC-related books and videotapes. The label's primary mandate was to promote and distribute Canadian artists, including recordings by the Toronto Symphony Orchestra, the National Arts Centre Orchestra, Anton Kuerti, James Campbell, Maureen Forrester, Glenn Gould, Healey Willan, Angela Hewitt, Ben Heppner and Measha Brueggergosman. A smaller number of pop and rock albums were also released, including the CBC Radio 3 series of compilation albums.
Over the label's years of operation, its recordings won 25 Juno Awards.
The label's classical division was closed in 2008, around the same time as CBC Radio 2's repositioning from an almost entirely classical and jazz service to a predominantly adult album alternative format. The label's last classical release was Barber/Korngold/Walton: Violin Concertos, a recording by Bramwell Tovey and James Ehnes in conjunction with the Vancouver Symphony Orchestra which won the Grammy Award for Best Instrumental Soloist(s) Performance (with Orchestra) in 2008. A few pop-oriented projects remained in development, but the corporation's primary strategy shifted from releasing physical recordings to internet distribution technologies such as podcasting, online music sales and the 2012 launch of CBC Music.
The French-language side of the CBC, Radio-Canada, had its own counterpart, Les Disques SRC, which focused on French-language music. Recordings with cross-linguistic appeal among both anglophones and francophones were branded with both names, while recordings of interest to only one of the language communities were branded as one or the other.
See also
List of record labels
References
Defunct record labels of Canada
Records
Record labels established in 1966
Classical music record labels
Jazz record labels
Record labels disestablished in 2008
1966 establishments in Canada
2008 disestablishments in Canada
|
https://en.wikipedia.org/wiki/Delay-tolerant%20networking
|
Delay-tolerant networking (DTN) is an approach to computer network architecture that seeks to address the technical issues in heterogeneous networks that may lack continuous network connectivity. Examples of such networks are those operating in mobile or extreme terrestrial environments, or planned networks in space.
Recently, the term disruption-tolerant networking has gained currency in the United States due to support from DARPA, which has funded many DTN projects. Disruption may occur because of the limits of wireless radio range, sparsity of mobile nodes, energy resources, attack, and noise.
History
In the 1970s, spurred by the decreasing size of computers, researchers began developing technology for routing between non-fixed locations of computers. While the field of ad hoc routing was inactive throughout the 1980s, the widespread use of wireless protocols reinvigorated the field in the 1990s as mobile ad hoc networking (MANET) and vehicular ad hoc networking became areas of increasing interest.
Concurrently with (but separate from) the MANET activities, DARPA had funded NASA, MITRE and others to develop a proposal for the Interplanetary Internet (IPN). Internet pioneer Vint Cerf and others developed the initial IPN architecture, relating to the necessity of networking technologies that can cope with the significant delays and packet corruption of deep-space communications. In 2002, Kevin Fall started to adapt some of the ideas in the IPN design to terrestrial networks and coined the term delay-tolerant networking and the DTN acronym. A paper published in 2003 SIGCOMM conference gives the motivation for DTNs. The mid-2000s brought about increased interest in DTNs, including a growing number of academic conferences on delay and disruption-tolerant networking, and growing interest in combining work from sensor networks and MANETs with the work on DTN. This field saw many optimizations on classic ad hoc and delay-tolerant networking algorithms and began to examine factors such as security, reliability, verifiability, and other areas of research that are well understood in traditional computer networking.
Routing
The ability to transport, or route, data from a source to a destination is a fundamental ability all communication networks must have. Delay and disruption-tolerant networks (DTNs), are characterized by their lack of connectivity, resulting in a lack of instantaneous end-to-end paths. In these challenging environments, popular ad hoc routing protocols such as AODV and DSR fail to establish routes. This is due to these protocols trying to first establish a complete route and then, after the route has been established, forward the actual data. However, when instantaneous end-to-end paths are difficult or impossible to establish, routing protocols must take to a "store and forward" approach, where data is incrementally moved and stored throughout the network in hopes that it will eventually reach its destination. A common techniqu
|
https://en.wikipedia.org/wiki/Fuzzy%20agent
|
In computer science a fuzzy agent is a software agent that implements fuzzy logic. This software entity interacts with its environment through an adaptive rule-base and can therefore be considered a type of intelligent agent.
References
Artificial intelligence
|
https://en.wikipedia.org/wiki/WMFP
|
WMFP (channel 62) is a television station licensed to Foxborough, Massachusetts, United States, serving the Boston area and primarily airing paid programming from OnTV4U. It is owned by WRNN-TV Associates alongside Norwell-licensed ShopHQ affiliate WWDP (channel 46). Through a channel sharing agreement, the two stations transmit using WWDP's spectrum from a tower off Pleasant Street in West Bridgewater. WMFP's studios are located on Lakeland Park Drive in Peabody.
History
1987–1995
The station first signed on the air on October 16, 1987, on UHF channel 62, originally licensed to Lawrence, Massachusetts. Initially, the station broadcast approximately eight hours per day of programming, operating its transmitter from a hill behind the Baldpate Hospital in Georgetown, Massachusetts. The early programming was primarily home shopping. WMFP was originally owned by MFP, Inc.; the company's largest shareholder was Boston-area political commentator Avi Nelson, who owned 35% of the station and also served as its president, treasurer, and secretary.
In September 1992, a new broadcast antenna was mounted, via a Sikorsky sky-crane helicopter, on top of One Beacon Street in Boston. WMFP installed its new transmitter on an upper floor of the building, and started broadcasting from Boston in November 1992. In addition to Avi Nelson, Bill Mockbee, well known in Boston radio and television broadcasting, was the general manager; composer/conductor/actor David Morrow was the operations manager; and Jim Capillo served as production manager, producing several local programs for the station. WMFP also expanded to a 24-hour schedule, with programming including syndicated talk shows, game shows, low budget movies, and drama shows. In early 1993, the station picked up several NBC programs that were not cleared by then-affiliate WBZ-TV (channel 4), including Later.
In May 1994, Nelson agreed to sell WMFP to the Shop at Home Network for $7 million. Shop at Home announced—even before an affiliation swap moved the NBC affiliation to WHDH-TV—that it would not retain the secondary NBC affiliation. The sale closed in 1995.
2006–2015
On May 16, 2006, Shop at Home's parent, the E. W. Scripps Company, announced that the network would suspend operations, effective June 22. However, Shop at Home temporarily ceased operations one day early than said target date on June 21, WMFP then switched to Jewelry Television (and, on June 23, to a mixture of both networks). On September 26, 2006, Scripps announced that it would sell its Shop at Home stations, including WMFP, to New York City-based Multicultural Television for $170 million. The sale of WMFP was finalized on April 24, 2007. Before the sale announcement, the station entered into discussions to affiliate with MyNetworkTV (a broadcast network created by News Corporation as a competitor to The CW, both of which launched in September 2006). MyNetworkTV instead chose to affiliate with WZMY-TV (channel 50, now WWJE-DT).
In May 2007,
|
https://en.wikipedia.org/wiki/WNEU
|
WNEU (channel 60) is a television station licensed to Merrimack, New Hampshire, United States, serving as the Boston-area outlet for the Spanish-language network Telemundo. It is owned and operated by NBCUniversal's Telemundo Station Group alongside Nashua, New Hampshire–licensed Class A NBC station WBTS-CD (channel 15, formerly WYCN-CD), which shares spectrum with Boston-based PBS member station WGBX-TV (channel 44) to provide full-market coverage.
WNEU and WBTS-CD, along with co-owned regional cable news channel New England Cable News (NECN) and regional sports network NBC Sports Boston, share studios at the NBCU Boston Media Center on B Street in Needham, Massachusetts, with WNEU's transmitter in the same city, off Cedar Street.
WNEU's Telemundo programming was formerly simulcast by the low-power WYCN-LD (as analog WTMU-LP) as a translator. On January 1, 2017, WYCN-LD (as WBTS-LD) became an owned-and-operated NBC station known as NBC Boston, replacing previous affiliate WHDH (channel 7). In October 2019, WYCN-LD moved its transmitter to Norton, Massachusetts, and became the Telemundo station for Providence, Rhode Island.
History
Early years
The station first signed on the air August 14, 1987, as WGOT, an independent station owned by Golden Triangle TV 60 Corporation. The call sign was derived from the so-called "Golden Triangle" region that encompasses Manchester, Nashua and Salem, New Hampshire. Neal Cortell, who owned 50 percent of WGOT, had earlier owned a stake in WXPO-TV (channel 50, now occupied by WWJE-DT).
Paugus Television bought WGOT for $1.35 million on January 13, 1989. In the early 1990s, WGOT unsuccessfully attempted to become New Hampshire's Fox affiliate; in 1991, Paugus filed an antitrust lawsuit against Fox, its Boston affiliate WFXT (channel 25), and the Boston Celtics (who owned WFXT at the time) for conspiring to block WGOT from joining the network, as well as using Fox programming and WFXT's Celtics broadcasts to place channel 60 at a disadvantage in obtaining cable carriage. Another attempt at obtaining a Fox affiliation for the station ended in November 1994, after Fox attempted to instead lure ABC affiliate WMUR-TV (channel 9).
As WPXB
Paxson Communications purchased WGOT from Paugus for $3.05 million on May 17, 1995, and switched the station to a mix of infomercials and religious programming, as an affiliate of the Infomall TV Network (or inTV). Paxson referred to WGOT as inTV's Boston affiliate; however, the channel 60 signal did not reach the city. To solve this, Paxson bought WRAP-LP (channel 33) in Gloucester from Electron Communications on October 31, 1996, moved the station to channel 54 in Boston under the callsign W54CN, and brought it to the air that November as a translator of WGOT. In December 2000, W54CN moved to channel 40 as W40BO.
WGOT changed its call sign to WPXB on January 20, 1998, and subsequently became a charter owned-and-operated station of Pax TV (now Ion Television) when it launched on
|
https://en.wikipedia.org/wiki/Nonlinearity%20%28disambiguation%29
|
Nonlinearity is a property of mathematical functions or data that cannot be graphed on straight lines, systems whose output(s) are not directly proportional to their input(s), objects that do not lie along straight lines, shapes that are not composed of straight lines, or events that are shown or told out-of-sequence.
Science and mathematics
Nonlinear acoustics is a branch of physics and acoustics dealing with sound waves of sufficiently large amplitudes.
A nonlinear complementarity problem is found in applied mathematics.
Nonlinear control theory is the area of control theory which deals with systems that are nonlinear, time-variant, or both.
Nonlinear dimensionality reduction is a simplification that assumes that the data of interest lie on an embedded non-linear manifold within the higher-dimensional space.
Nonlinear element, or nonlinear device, is an electrical element which does not have a linear relationship between current and voltage, e.g. a diode.
Nonlinear functional analysis is a branch of Mathematical Analysis that deals with nonlinear mappings.
Nonlinear optics, in physics, examines the properties of light in media in which the polarization responds nonlinearly to the electric field.
Nonlinear photonic crystals are periodic structures whose optical response depends on the intensity of the optical field that propagates into the crystal.
Nonlinear programming is the process of solving an optimization problem, where some of the parameters are nonlinear.
Nonlinear regression, in statistics, represents fitting a model equation that is not linear in its parameters to the data in a table.
Nonlinear resonance in physics is the occurrence of resonance in a nonlinear system.
Nonlinear Schrödinger equation is a nonlinear variation of the Schrödinger equation.
Non-linear sigma model is found in quantum field theory.
Nonlinear system, in mathematics, represents a system whose behavior is not expressible as a linear function of its descriptors.
A nonlinear X-wave (NLX) is a multi-dimensional wave that can travel without distortion.
Nonlinearity (journal) is a peer-reviewed scientific journal of the Institute of Physics and the London Mathematical Society.
Computing
Nonlinear gameplay, in computer and video games, presents players with challenges that can be completed in a number of different sequences.
Non-linear editing, editing audio and/or video using random access to the source material
Non-Linear Systems, a defunct computer manufacturer
Arts
Nonlinear narratives portray events in a non-chronological manner.
Other
Nonlinear pricing is a broad term that covers any kind of price structure in which there is a nonlinear relationship between price and the quantity of goods.
Non-linear writing, a writing system whose symbols do not consist of lines
Nonlinears, advanced androids in the Inquest of Pilot Pirx
See also
Linear (disambiguation)
|
https://en.wikipedia.org/wiki/WUTF-TV
|
WUTF-TV (channel 27) is a television station licensed to Worcester, Massachusetts, United States, broadcasting the Spanish-language UniMás network to the Boston area. It is owned by Entravision Communications, which provides certain services to Marlborough-licensed Univision-owned station WUNI (channel 66) under a joint sales agreement (JSA) with TelevisaUnivision. WUTF-TV's studios are located on 4th Avenue, and its transmitter is located on Cedar Street, both in Needham.
History
V66
The station first signed on the air on February 12, 1985 as WVJV-TV (branded as "V-66, the Beat of Boston"), maintaining a music video format at a time when they were a major part of the American culture (this was just four years after MTV launched in August 1981). The station was originally owned by longtime New England radio broadcasters John Garabedian (who later became host of the nationally syndicated radio show Open House Party) and Arnie "Woo-Woo" Ginsburg. Garabedian also owned WGTR (1060 AM, now WQOM); both WVJV and WGTR operated from studios in Natick. The music format combined videos from progressive rock (as heard on WBCN) and pop contemporary (as heard on WXKS-FM). Irrespective of the must-carry rule requiring cable systems to carry the station, many cable systems freely chose to carry WVJV instead of VH1. WVJV was also the first station in the Boston area to transmit in stereo.
Change from music videos to home shopping
Garabedian had hoped to launch a national over-the-air music video network (predating the existence of The Box) to compete against MTV, if WVJV had succeeded. However, although channel 66 received a sizable number of viewers, the station struggled to retain them for long periods of time, and by mid-1986, the station's advertising sales were insufficient to ensure the station's long-term viability; additionally, attempts to broaden the station's programming to include shows on sports and other topics proved unsuccessful. Consequently, WVJV was sold to the Home Shopping Network later that year, with the station transitioning to HSN's shopping programs soon afterwards on September 21, 1986; a callsign change to WHSH followed the next year. For the next thirteen years, WHSH continued to run HSN programming, with some local feature segments in-between.
A documentary film about V66 titled Life on the V: The Story of V66, produced by Christian de Rezendes and Eric Green, premiered at the Independent Film Festival of Boston on April 29, 2014.
"Hub 66", WHUB-TV
In 1999, Barry Diller, owner of HSN and its broadcast arm USA Broadcasting (formerly Silver King Television), began plans to turn his stations into true independents under the "CityVision" banner. After switching stations in Miami, Atlanta, and Dallas–Fort Worth, this format was implemented in Boston on Channel 66 as WHUB-TV (from Boston's nickname "The Hub"), with the "Hub 66" branding and a main slogan echoing The Standells' "Dirty Water" ("Ahhh, Boston you're our home").
The stat
|
https://en.wikipedia.org/wiki/Beyond%20the%20Beyond
|
Beyond the Beyond, known in Japan as , is a role-playing video game that was developed by Camelot Software Planning and published by Sony Computer Entertainment for the PlayStation in 1995. Though not the first role-playing game released for the PlayStation, Beyond the Beyond was the first RPG available in the west for the console using a traditional Japanese RPG gameplay style like Final Fantasy, Dragon Quest and Phantasy Star. The characters were designed by popular manga artist Ami Shibata.
Gameplay
Gameplay in Beyond the Beyond is, for the most part, standard for a role-playing video game. However, the turn-based battle system does contain one feature that was not standard in role-playing games at the time. Dubbed the "Active Playing System", this feature allows the player to increase the chances of either landing an improved attack on an enemy or defending from an enemy attack by pressing the X button at the correct time during battle. It is similar to the timing-based attacks in the later role-playing game Final Fantasy VIII (1999).
Plot
Long ago in the world of Beyond the Beyond, a battle raged between the 'Beings of Light' and the 'Warlocks of the Underworld'. Before the planet was destroyed, the two sides signed a treaty leaving the surface world to the Beings of Light and underground to the Warlocks. After hundreds of years of peace, inexplicable happenings begin to occur. The player must control Finn, a young swordsman, to stop the evil power that has broken the treaty and invaded the surface world.
Development
The soundtrack was composed by Motoi Sakuraba, who later worked on other Camelot Soft titles such as Shining Force III and the Golden Sun series along with other series such as Star Ocean and Valkyrie Profile.
For the North American release, Beyond the Beyond was translated into English by four production personnel at Sony Computer Entertainment America.
Reception
Critical assessments of Beyond the Beyond were divided upon its release: While Shawn Smith and Sushi-X of Electronic Gaming Monthly found it to be an impressive RPG, Dan Hsu and Crispin Boyer in the same publication and Glenn Rubenstein in GameSpot deemed it derivative and underwhelming, though still a solid and satisfying enough experience for fans of the genre, GamePros Scary Larry considered it outright "lame and predictable", and Next Generation described it as "painfully derivative, plodding, and not even a terribly challenging adventure". However, there were points of agreement, with even the most positive reviews remarking that the game has a very generic RPG visual style and simply does not look like a next generation RPG, though some also remarked that the 3D battle graphics are impressive.
Most reviews said that the story is highly derivative and suffers from overlong, dull dialogues, though Next Generation, which otherwise gave one of the more negative reviews, said the story was pleasingly long and interesting. While Shawn Smith and Dan Hsu prais
|
https://en.wikipedia.org/wiki/Intelligent%20agent
|
In artificial intelligence, an intelligent agent (IA) is an agent acting in an intelligent manner; It perceives its environment, takes actions autonomously in order to achieve goals, and may improve its performance with learning or acquiring knowledge. An intelligent agent may be simple or complex: A thermostat or other control system is considered an example of an intelligent agent, as is a human being, as is any system that meets the definition, such as a firm, a state, or a biome.
Leading AI textbooks define "artificial intelligence" as the "study and design of intelligent agents", a definition that considers goal-directed behavior to be the essence of intelligence. Goal-directed agents are also described using a term borrowed from economics, "rational agent".
An agent has an "objective function" that encapsulates all the IA's goals. Such an agent is designed to create and execute whatever plan will, upon completion, maximize the expected value of the objective function. For example, a reinforcement learning agent has a "reward function" that allows the programmers to shape the IA's desired behavior, and an evolutionary algorithm's behavior is shaped by a "fitness function".
Intelligent agents in artificial intelligence are closely related to agents in economics, and versions of the intelligent agent paradigm are studied in cognitive science, ethics, the philosophy of practical reason, as well as in many interdisciplinary socio-cognitive modeling and computer social simulations.
Intelligent agents are often described schematically as an abstract functional system similar to a computer program. Abstract descriptions of intelligent agents are called abstract intelligent agents (AIA) to distinguish them from their real-world implementations. An autonomous intelligent agent is designed to function in the absence of human intervention. Intelligent agents are also closely related to software agents (an autonomous computer program that carries out tasks on behalf of users).
As a definition of artificial intelligence
Artificial Intelligence: A Modern Approach defines an "agent" as
"Anything that can be viewed as perceiving its environment through sensors and acting upon that environment through actuators"
It defines a "rational agent" as:
"An agent that acts so as to maximize the expected value of a performance measure based on past experience and knowledge."
It also defines the field of "artificial intelligence research" as:
"The study and design of rational agents"
Padgham & Winikoff (2005) agree that an intelligent agent is situated in an environment and responds in a timely (though not necessarily real-time) manner to changes in the environment. However, intelligent agents must also proactively pursue goals in a flexible and robust way. Optional desiderata include that the agent be rational, and that the agent be capable of belief-desire-intention analysis.
Kaplan and Haenlein define artificial intelligence as "A system's ability to co
|
https://en.wikipedia.org/wiki/Open%20Media%20Network
|
The Open Media Network (OMN) was a P2PTV service and application which provided distribution of educational and public service programs. The network was founded in 2005 by Netscape pioneers Mike Homer and Marc Andreessen. After operating for an extended beta period, development ended with the serious illness and subsequent death in 2009 of founder Homer.
The OMN network operated as a large, centrally controlled grid network for the distribution of free radio and TV content over P2P, described as "part TiVo, part BitTorrent file swapping". The Open Media Network client application was available for Apple Mac OS X (but not Intel based Macs as of October 2007) and Microsoft Windows (XP and 2000, but not Vista as of October 2007).
The OMN infrastructure was powered by Kontiki grid network technology, a commercial alternative to BitTorrent.
The U.S. Public Broadcasting Service (PBS) launched a "download to own" initiative with OMN and Google which allowed viewers to purchase episodes of popular PBS programs via the Internet for viewing anytime, anywhere. The fees for downloading videos ranged from about $2 to about $8 (U.S.). Video files were made available in whatever format the producer chose, including WMV, QuickTime and Google's GVI format.
See also
PPLive
Cybersky-TV
Octoshape
Miro
References
File sharing networks
BitTorrent clients
|
https://en.wikipedia.org/wiki/P2PTV
|
P2PTV refers to peer-to-peer (P2P) software applications designed to redistribute video streams in real time on a P2P network; the distributed video streams are typically TV channels from all over the world but may also come from other sources. The draw to these applications is significant because they have the potential to make any TV channel globally available by any individual feeding the stream into the network where each peer joining to watch the video is a relay to other peer viewers, allowing a scalable distribution among a large audience with no incremental cost for the source.
Technology and use
In a P2PTV system, each user, while downloading a video stream, is simultaneously also uploading that stream to other users, thus contributing to the overall available bandwidth. The arriving streams are typically a few minutes time-delayed compared to the original sources. The video quality of the channels usually depends on how many users are watching; the video quality is better if there are more users.
The architecture of many P2PTV networks can be thought of as real-time versions of BitTorrent: if a user wishes to view a certain channel, the P2PTV software contacts a "tracker server" for that channel in order to obtain addresses of peers who distribute that channel; it then contacts these peers to receive the feed. The tracker records the user's address, so that it can be given to other users who wish to view the same channel. In effect, this creates an overlay network on top of the regular internet for the distribution of real-time video content.
The need for a tracker can also be eliminated by the use of distributed hash table technology.
Some applications allow users to broadcast their own streams, whether self-produced, obtained from a video file, or through a TV tuner card or video capture card. Many of the commercial P2PTV applications were developed in China (TVUPlayer, PPLive, QQLive, PPStream). The majority of available applications broadcast mainly Asian TV stations, with the exception of TVUPlayer, which carries a number of North American stations including CBS, Spike TV, and Fox News. Some applications distribute TV channels without a legal license to do so; this utilization of P2P technology is particularly popular to view channels that are either not available locally, or only available by paid subscription, as is the case for some sports channels. Distributing links to pirated P2PTV feeds on a U.S.-based Web site can result in the U.S. government seizing the Web site, as it did with several P2PTV aggregation sites prior to Super Bowl XLV. By January 2009, there were about 14,000 P2P channels on PPStream.
Other commercial P2PTV applications outside China are Abroadcasting (USA), Zattoo (Switzerland/USA), Octoshape (Denmark), LiveStation (UK).
Issues for broadcasters
Broadcasting via a P2PTV system is usually much cheaper than the alternatives and can be done by private individuals.
No quality of service (QoS). Compared t
|
https://en.wikipedia.org/wiki/Remote%20Data%20Objects
|
Remote Data Objects (abbreviated RDO) is an obsolete data access application programming interface primarily used in Microsoft Visual Basic applications on Windows 95 and later operating systems. This includes database connection, queries, stored procedures, result manipulation, and change commits. It allowed developers to create interfaces that can directly interact with Open Database Connectivity (ODBC) data sources on remote machines, without having to deal with the comparatively complex ODBC API.
Remote Data Objects was included with versions 4, 5, and 6 of Visual Basic; the final version of RDO is version 2.0.
See also
Microsoft Data Access Components
References
External links
Using Remote Data Objects and the RemoteData Control — Documentation on the Microsoft Developer Network
Microsoft application programming interfaces
Database APIs
|
https://en.wikipedia.org/wiki/Lehmer%E2%80%93Schur%20algorithm
|
In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm for complex polynomials, extending the idea of enclosing roots like in the one-dimensional bisection method to the complex plane. It uses the Schur-Cohn test to test increasingly smaller disks for the presence or absence of roots.
Schur-Cohn algorithm
This algorithm allows one to find the distribution of the roots of a complex polynomial with respect to the unit circle in the complex plane. It is based on two auxiliary polynomials, introduced by Schur.
For a complex polynomial of degree its reciprocal adjoint polynomial is defined by and its Schur Transform by
where a bar denotes complex conjugation.
So, if with , then
,
with leading zero-terms, if any, removed. The coefficients of can therefore be directly expressed in those of and, since one or more leading coefficients cancel, has lower degree than . The roots of , , and are related as follows.
Lemma
Let be a complex polynomial and .
The roots of , including their multiplicities, are the images under inversion in the unit circle of the non-zero roots of .
If , then , and share roots on the unit circle, including their multiplicities.
If , then and have the same number of roots inside the unit circle.
If , then and have the same number of roots inside the unit circle.
Proof
For we have and, in particular,
for .
Also implies . From this and the definitions above the first two statements follow.
The other two statements are a consequence of Rouché's theorem applied on the unit circle to the functions and , where is a polynomial that has as its roots the roots of on the unit circle, with the same multiplicities. □
For a more accessible representation of the lemma,
let , and denote the number of roots of inside, on, and outside the unit circle respectively and similarly for .
Moreover let be the difference in degree of and . Then the lemma implies that
if and
if
(note the interchange of and ).
Now consider the sequence of polynomials , where and .
Application of the foregoing to each pair of consecutive members of this sequence gives the following result.
Theorem[Schur-Cohn test]
Let be a complex polynomial with and let be the smallest number such that . Moreover let for and for .
All roots of lie inside the unit circle if and only if
, for , and .
All roots of lie outside the unit circle if and only if
for and .
If and if for (in increasing order) and otherwise, then has no roots on the unit circle and the number of roots of inside the unit circle is
.
More generally, the distribution of the roots of a polynomial with respect to an arbitrary circle in the complex plane, say one with centre and radius , can be found by application of the Schur-Cohn test to the 'shifted and scaled' polynomial defined by .
Not every scaling factor is allowed, however, for the Schur-Cohn test can be applied to the pol
|
https://en.wikipedia.org/wiki/Computer%20Power%20and%20Human%20Reason
|
Computer Power and Human Reason: From Judgment to Calculation (1976) by Joseph Weizenbaum displays the author's ambivalence towards computer technology and lays out the case that while artificial intelligence may be possible, we should never allow computers to make important decisions because computers will always lack human qualities such as compassion and wisdom.
Weizenbaum makes the crucial distinction between deciding and choosing. Deciding is a computational activity, something that can ultimately be programmed. It is the capacity to choose that ultimately makes one a human being. Choice, however, is the product of judgment, not calculation. Comprehensive human judgment is able to include non-mathematical factors such as emotions. Judgment can compare apples and oranges, and can do so without quantifying each fruit type and then reductively quantifying each to factors necessary for mathematical comparison.
The book caused disagreement with, and separation from other members of the artificial intelligence research community, a status the author later said he'd come to take pride in.
See also
Ethics of artificial intelligence
Critique of technology
References
External links
Review of Computer Power and Human Reason
Excerpt from Computer Power and Human Reason
Documentary Film on Joseph Weizenbaum, his life, his book and his humor Weizenbaum. Rebel at Work. (25C3 Video Recording)
Plug & Pray, Documentary Film on Joseph Weizenbaum and the ethics of technology
Sociology books
Technology books
Philosophy of artificial intelligence
1976 non-fiction books
|
https://en.wikipedia.org/wiki/Guess%20value
|
In mathematical modeling, a guess value is more commonly called a starting value or initial value. These are necessary for most optimization problems which use search algorithms, because those algorithms are mainly deterministic and iterative, and they need to start somewhere. One common type of application is nonlinear regression.
Use
The quality of the initial values can have a considerable impact on the success or lack of such of the search algorithm. This is because the fitness function or objective function (in many cases a sum of squared errors (SSE)) can have difficult shapes. In some parts of the search region, the function may increase exponentially, in others quadratically, and there may be regions where the function asymptotes to a plateau. Starting values that fall in an exponential region can lead to algorithm failure because of arithmetic overflow. Starting values that fall in the asymptotic plateau region can lead to algorithm failure because of "dithering". Deterministic search algorithms may use a slope function to go to a minimum. If the slope is very small, then underflow errors can cause the algorithm to wander, seemingly aimlessly; this is dithering.
Finding value
Guess values can be determined a number of ways. Guessing is one of them. If one is familiar with the type of problem, then this is an educated guess or guesstimate. Other techniques include linearization, solving simultaneous equations, reducing dimensions, treating the problem as a time series, converting the problem to a (hopefully) linear differential equation, and using mean values. Further methods for determining starting values and optimal values in their own right come from stochastic methods, the most commonly known of these being evolutionary algorithms and particularly genetic algorithms.
Mathematical optimization
Regression analysis
Computational statistics
|
https://en.wikipedia.org/wiki/Bitonic%20sorter
|
Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. The algorithm was devised by Ken Batcher. The resulting sorting networks consist of comparators and have a delay of , where is the number of items to be sorted. This makes it a popular choice for sorting large numbers of elements on an architecture which itself contains a large number of parallel execution units running in lockstep, such as a typical GPU.
A sorted sequence is a monotonically non-decreasing (or non-increasing) sequence. A bitonic sequence is a sequence with for some , or a circular shift of such a sequence.
Complexity
Let and .
It is evident from the construction algorithm that the number of rounds of parallel comparisons is given by .
It follows that the number of comparators is bounded (which establishes an exact value for when is a power of 2).
Although the absolute number of comparisons is typically higher than Batcher's odd-even sort, many of the consecutive operations in a bitonic sort retain a locality of reference, making implementations more cache-friendly and typically more efficient in practice.
How the algorithm works
The following is a bitonic sorting network with 16 inputs:
The 16 numbers enter as the inputs at the left end, slide along each of the 16 horizontal wires, and exit at the outputs at the right end. The network is designed to sort the elements, with the largest number at the bottom.
The arrows are comparators. Whenever two numbers reach the two ends of an arrow, they are compared to ensure that the arrow points toward the larger number. If they are out of order, they are swapped. The colored boxes are just for illustration and have no effect on the algorithm.
Every red box has the same structure: each input in the top half is compared to the corresponding input in the bottom half, with all arrows pointing down (dark red) or all up (light red). If the inputs happen to form a bitonic sequence (a single nondecreasing sequence followed by a single nonincreasing one or vice versa), then the output will form two bitonic sequences. The top half of the output will be bitonic, and the bottom half will be bitonic, with every element of the top half less than or equal to every element of the bottom half (for dark red) or vice versa (for light red). This theorem is not obvious, but can be verified by carefully considering all the cases of how the various inputs might compare, using the zero-one principle, where a bitonic sequence is a sequence of 0s and 1s that contains no more than two "10" or "01" subsequences.
The red boxes combine to form blue and green boxes. Every such box has the same structure: a red box is applied to the entire input sequence, then to each half of the result, then to each half of each of those results, and so on. All arrows point down (blue) or all point up (green). This structure is known as a butterfly network. If the input to this box happens
|
https://en.wikipedia.org/wiki/Comparison%20of%20web%20server%20software
|
Web server software allows computers to act as web servers. The first web servers supported only static files, such as HTML (and images), but now they commonly allow embedding of server side applications.
Some web application frameworks include simple HTTP servers. For example the Django framework provides runserver, and PHP has a built-in server. These are generally intended only for use during initial development. A production server will require a more robust HTTP front-end such as one of the servers listed here.
Overview
Features
Some features may be intentionally not included to web server to avoid featuritis. For example:
TLS/HTTPS may be enabled with a separate stunnel daemon that terminates TLS and redirects raw HTTP packets to http daemon.
NGINX and OpenBSD httpd authors decided not to include CGI interpretation but instead use FastCGI. For OpenBSD was developed a slowcgi gateway.
BusyBox httpd doesn't have automatically generated directory listing but it may be implemented as a CGI script
Operating system support
See also
Comparison of application servers
Embedded HTTP server
Gunicorn (HTTP server)
Helicon Ape
References
External links
Netcraft Web Server Survey
Usage Statistics and Market Share of Web Servers for Websites
Web Servers
Internet Protocol based network software
|
https://en.wikipedia.org/wiki/TV5%20%28Philippine%20TV%20network%29
|
TV5 (also known as 5 and formerly known as ABC) is a Philippine free-to-air television and radio network. It is headquartered in Mandaluyong, with alternate studios located in Novaliches, Quezon City. TV5 serves as the flagship property of TV5 Network, Inc., which is owned by MediaQuest Holdings, the multimedia arm of PLDT, a telecommunications company. The network is commonly referred to as "The Kapatid Network", using the Filipino term for "sibling", a branding introduced in 2010.
TV5 derives its name from its flagship station in Metro Manila, DWET-TV, which broadcasts on VHF Channel 5 for analog transmission, UHF Channel 18 for digital transmission, and UHF Channel 51 for digital test transmission (licensed to TV5's sister company, Mediascape/Cignal TV). In addition to DWET-TV, TV5 operates seven other owned-and-operated stations and has nine affiliate television stations. Its programming is available on cable and satellite TV providers nationwide. TV5's content is also accessible outside the Philippines through Kapatid Channel and AksyonTV International.
History
The early years (1960–1972)
Joaquin "Chino" Roces, the owner of the Manila Times, obtained a radio-TV franchise through Republic Act 2945 from Congress on June 19, 1960. He went on to establish the Associated Broadcasting Corporation (ABC), with its initial studios located along Pasong Tamo. ABC's first radio stations were DZMT 1100 kHz, DZTM 1380 kHz, and DZWS 1070 kHz. ABC became the fourth television network in the Philippines when it launched DZTM-TV Channel 5. From 1960 to September 23, 1972, ABC operated both radio and television services.
However, on September 23, 1972, President Ferdinand E. Marcos declared Martial Law, resulting in the forced shutdown of ABC and the Manila Times. Other networks like ABS-CBN, RBS, MBC, and RMN–IBC also had their radio and television broadcasts halted as a result of martial law.
After the People Power Revolution in 1986, Chino Roces successfully advocated for the network's reinstatement with President Corazon Cojuangco-Aquino. While ABS-CBN reopened in the same year, ABC did not resume operations until it conducted a test broadcast in 1991 and officially reopened in 1992. Chino Roces died in 1988, but his son Edgardo Roces played a key role in reopening the network.
Following Chino Roces's death, new stakeholders led by broadcast veteran Edward Tan and Edgardo Roces worked towards resuming broadcasts. They obtained approval from the Securities and Exchange Commission for an increase in capitalization and amendments to ABC's articles of incorporation and by-laws. Subsequently, they were granted a permit to operate by the National Telecommunications Commission (NTC).
The return and growth (1992–2003)
ABC completed the construction of its studio complex and transmitter tower in San Bartolome, Novaliches, Quezon City in 1990. Test broadcasts began at the end of 1991, featuring documentaries from Japan. On February 21, 1992, the network offic
|
https://en.wikipedia.org/wiki/UNOS%20%28operating%20system%29
|
UNOS is the first, now discontinued, 32-bit Unix-like real-time operating system (RTOS) with real-time extensions. It was developed by Jeffery Goldberg, MS. who left Bell Labs after using Unix and became VP of engineering for Charles River Data Systems (CRDS), now defunct. UNOS was written to capitalize on the first 32-bit microprocessor, the Motorola 68k central processing unit (CPU). CRDS sold a UNOS based 68K system, and sold porting services and licenses to other manufacturers who had embedded CPUs.
History
Jeff Goldberg created an experimental OS using only eventcounts for synchronization, that allowed a preemptive kernel, for a Charles River Data Systems (CRDS) PDP-11. CRDS hired Goldberg to create UNOS and began selling it in 1981.
UNOS was written for the Motorola 68000 series processors. While compatible with Version 7 Unix, it is also an RTOS. CRDS supported it on the company's Universe 68 computers, as did Motorola's Versabus systems. CRDS's primary market was OEMs embedding the CRDS unit within a larger pile of hardware, often requiring better real-time response than Unix could deliver.
UNOS has a cleaner kernel interface than UNIX in 1981. There was e.g., a system call to obtain ps information instead of reading /dev/kmem.
UNOS required memory protection, with the 68000 using an MMU developed by CRDS; and only used Motorola MMUs after UNOS 7 on the 68020 (CRDS System CP20) (using the MC68851 PMMU).
UNOS was written in the programming languages C and assembly language, and supported Fortran, COBOL, Pascal, and Business Basic.
Limits
UNOS from CRDS never supported paged virtual memory and multiprocessor support had not been built in from the start, so the kernel remained mostly single-threaded on the few multiprocessor systems built.
A UNOS variant enhanced by H. Berthold AG under the name vBertOS added demanded page loading and paged processes in 1984, but was given up in favor of SunOS because of the missing GUI and the missing networking code in Spring 1985, when Berthold imported the first Sun to Europe.
References
Discontinued operating systems
Embedded operating systems
Real-time operating systems
Unix variants
68k architecture
|
https://en.wikipedia.org/wiki/3D%20scanning
|
3D scanning is the process of analyzing a real-world object or environment to collect three dimensional data of its shape and possibly its appearance (e.g. color). The collected data can then be used to construct digital 3D models.
A 3D scanner can be based on many different technologies, each with its own limitations, advantages and costs. Many limitations in the kind of objects that can be digitised are still present. For example, optical technology may encounter many difficulties with dark, shiny, reflective or transparent objects. For example, industrial computed tomography scanning, structured-light 3D scanners, LiDAR and Time Of Flight 3D Scanners can be used to construct digital 3D models, without destructive testing.
Collected 3D data is useful for a wide variety of applications. These devices are used extensively by the entertainment industry in the production of movies and video games, including virtual reality. Other common applications of this technology include augmented reality, motion capture, gesture recognition, robotic mapping, industrial design, orthotics and prosthetics, reverse engineering and prototyping, quality control/inspection and the digitization of cultural artifacts.
Functionality
The purpose of a 3D scanner is usually to create a 3D model. This 3D model consists of a polygon mesh or point cloud of geometric samples on the surface of the subject. These points can then be used to extrapolate the shape of the subject (a process called reconstruction). If colour information is collected at each point, then the colours or textures on the surface of the subject can also be determined.
3D scanners share several traits with cameras. Like most cameras, they have a cone-like field of view, and like cameras, they can only collect information about surfaces that are not obscured. While a camera collects colour information about surfaces within its field of view, a 3D scanner collects distance information about surfaces within its field of view. The "picture" produced by a 3D scanner describes the distance to a surface at each point in the picture. This allows the three dimensional position of each point in the picture to be identified.
In some situations, a single scan will not produce a complete model of the subject. Multiple scans, from different directions are usually helpful to obtain information about all sides of the subject. These scans have to be brought into a common reference system, a process that is usually called alignment or registration, and then merged to create a complete 3D model. This whole process, going from the single range map to the whole model, is usually known as the 3D scanning pipeline.
Technology
There are a variety of technologies for digitally acquiring the shape of a 3D object. The techniques work with most or all sensor types including optical, acoustic, laser scanning, radar, thermal, and seismic. A well established classification divides them into two types: contact and non-contact. No
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.