source
stringlengths 32
199
| text
stringlengths 26
3k
|
---|---|
https://en.wikipedia.org/wiki/Brian%20LaMacchia
|
Brian A. LaMacchia is a computer security specialist.
LaMacchia was a Distinguished Engineer at Microsoft and headed the Security and Cryptography team within Microsoft Research (MSR). His team’s main project was the development of quantum-resistant public-key cryptographic algorithms and protocols. Brian was also a founding member of the Microsoft Cryptography Review Board and consulted on security and cryptography architectures, protocols and implementations across the company; previously he was the Director of Security and Cryptography in the Microsoft Extreme Computing Group. He played a leading role in the design of XKMS, the security architecture for .NET and Palladium. He designed and led the development team for the .NET security architecture. He was a security architect on Palladium. LaMacchia was originally well known for his work at the Massachusetts Institute of Technology establishing the MIT PGP Key Server, the first key centric PKI implementation to see wide-scale use. LaMacchia wrote the first Web interface for a PGP Key Server. He is a submitter of the Frodo post-quantum proposal to the NIST Post-Quantum Cryptography Standardization project.
His leadership has also been recognized by his membership in the Computing Community Consortium (CCC) Council.
He has played a leading role in the design of W3C XMLDsig and XKMS standards. In particular he is an author of versions 1.0, 1.1 and 2.0 XMLDsig. He is a contributor to XKMS. He is coauthor on OASIS standard WS-SECURITY.
LaMacchia earned S.B., S.M., and Ph.D. degrees from MIT in 1990, 1991, and 1996, respectively.
LaMacchia is currently serving his second three-year term as Treasurer of the International Association for Cryptologic Research. He first joined the IACR Board of Directors in 2015 as General Chair of CRYPTO 2016. LaMacchia also serves as a member of the Board of Directors of Seattle Opera. He previously served for ten years as member of the board of directors of the Seattle International Film Festival, including the 2015-2016 term as president of SIFF.
References
External links
Brian LaMacchia's home page
Brian LaMacchia's Microsoft page
Net Framework
The >25 patents for inventions by LaMacchia
Computer security specialists
Cypherpunks
Living people
Year of birth missing (living people)
|
https://en.wikipedia.org/wiki/Nightmare%20Ned
|
Nightmare Ned is a 1997 computer game for Microsoft Windows that was developed alongside the animated series of the same name. The game was based on a concept by Sue and Terry Shakespeare. It was released on October 7, 1997.
Developed by Creative Capers Entertainment and Window Painters Ltd. and published by Disney Interactive Studios, Nightmare Ned was Disney Interactive's first video game release that was developed by a subcontracted developer. The game was critically acclaimed and received various accolades.
Plot
10-year-old Ned Needlemeyer arrives home after school and discovers that he has his home to himself, with his parents and sister away for the evening. After eating a large amount of junk food and playing video games, he hears a thunderstorm begin to brew. The power goes out, and he decides to go to bed. While sleeping, Ned envisions five terrifying nightmares and must gather his courage to successfully trek through all of them. Each nightmare features its own theme and cast of characters based on one of Ned's fears.
Gameplay
The game's main hub is on a quilt which resembles Ned's bed. From here, Ned can travel through adventure portals into five different nightmare worlds: Ned's Graveyard Nightmare; Ned's School Nightmare; Ned's Medical Nightmare; Ned's Nightmare in the Attic, Basement and Beyond; and Ned's Bathroom Nightmare. Each nightmare world has a corresponding representative "shadow creature" that, through exploration of the world, eventually reveals itself to be someone or something harmless. A player can travel back to the quilt an unlimited amount of times, but whether or not the player receives the "good" ending is dependent upon traveling back eight or fewer times. Each world features hidden passages between them.
The game generally features a sidescrolling interface, but utilizes multiple layers to create depth. A gamepad, joystick, or keyboard can be used as input options. Ned's yo-yo serves as the main weapon against enemies.
Production
The idea for the game was pitched before the television show started production and the two were later developed alongside each other. Donovan Cook, producer of the TV series, described the collaboration: "There's some crossover. We sent them our graphics. [...] We had to have our art done right away and they ended up influenced by it along the way." Unlike the TV series, the animation in the game used digital ink and paint. The game was intended specifically for Windows 95 was designed to take advantage of Intel MMX technology. Nightmare Ned was the first CD-ROM to use full-motion video streaming technology. At the time of release, the game was considered a "power- and space-hungry program" for requiring 75 megabytes of hard drive space. To remedy this, two versions of the game were included on the disc—the original and one with fewer cutscenes that uses significantly less hard drive space.
The game's art style uses "an eclectic visual mix of underground comics, 19th-century woo
|
https://en.wikipedia.org/wiki/Library%20sort
|
Library sort or gapped insertion sort is a sorting algorithm that uses an insertion sort, but with gaps in the array to accelerate subsequent insertions. The name comes from an analogy:
Suppose a librarian were to store their books alphabetically on a long shelf, starting with the As at the left end, and continuing to the right along the shelf with no spaces between the books until the end of the Zs. If the librarian acquired a new book that belongs to the B section, once they find the correct space in the B section, they will have to move every book over, from the middle of the Bs all the way down to the Zs in order to make room for the new book. This is an insertion sort. However, if they were to leave a space after every letter, as long as there was still space after B, they would only have to move a few books to make room for the new one. This is the basic principle of the Library Sort.
The algorithm was proposed by Michael A. Bender, Martín Farach-Colton, and Miguel Mosteiro in 2004 and was published in 2006.
Like the insertion sort it is based on, library sort is a comparison sort; however, it was shown to have a high probability of running in O(n log n) time (comparable to quicksort), rather than an insertion sort's O(n2). There is no full implementation given in the paper, nor the exact algorithms of important parts, such as insertion and rebalancing. Further information would be needed to discuss how the efficiency of library sort compares to that of other sorting methods in reality.
Compared to basic insertion sort, the drawback of library sort is that it requires extra space for the gaps. The amount and distribution of that space would depend on implementation. In the paper the size of the needed array is (1 + ε)n, but with no further recommendations on how to choose ε. Moreover, it is neither adaptive nor stable. In order to warrant the high-probability time bounds, it must randomly permute the input, which changes the relative order of equal elements and shuffles any presorted input. Also, the algorithm uses binary search to find the insertion point for each element, which does not take advantage of presorted input.
Another drawback is that it cannot be run as an online algorithm, because it is not possible to randomly shuffle the input. If used without this shuffling, it could easily degenerate into quadratic behaviour.
One weakness of insertion sort is that it may require a high number of swap operations and be costly if memory write is expensive. Library sort may improve that somewhat in the insertion step, as fewer elements need to move to make room, but also adds an extra cost in the rebalancing step. In addition, locality of reference will be poor compared to mergesort, as each insertion from a random data set may access memory that is no longer in cache, especially with large data sets.
Implementation
Algorithm
Let us say we have an array of n elements. We choose the gap we intend to give. Then we would have a final ar
|
https://en.wikipedia.org/wiki/Motherwell%E2%80%93Cumbernauld%20line
|
The Motherwell–Cumbernauld line is a suburban railway line linking Motherwell and Cumbernauld in Scotland. It is part of the Strathclyde Partnership for Transport network.
History
The line was built as part of the:
Wishaw and Coltness Railway between and
Garnkirk and Glasgow Railway between and Gartsherrie South Junction
Caledonian Main Line between Gartsherrie Junction and .
The line had previously been used by a limited number of through Inter-City passenger trains between Motherwell and Perth up until the end of the 1980s, having earlier served as part of the Caledonian Railway's main trunk route avoiding Glasgow. The surviving trains (the London Euston to Clansman daytime through service and the Royal Highlander overnight sleeper) had subsequently been diverted away (via Edinburgh Waverley) by 1990, leaving only the Motherwell–Coatbridge Central section in use by Argyle Line local trains.
In May 1996 the SPT introduced a new timetable on the line, that saw an hourly diesel service through to Cumbernauld alongside an hourly electric service that terminated at Coatbridge Central. Between 1996 & 2000 this was worked by a British Rail class 101. This allowed the Argyle Line services to be re-routed elsewhere from January 2003(eventually to via ) whilst offering a new range of journey opportunities for the intermediate stations en route. A limited number of peak-hour electric services via the Hamilton Circle were retained for commuters and these still operate today.
Infrastructure
The line is now electrified at 25 kV AC overhead throughout - the wires having been extended to Cumbernauld from their former limit at Gartsherrie South Junction (north of ) in the spring of 2014 as part of the Cumbernauld Line electrification scheme. Passenger services are operated by ScotRail on behalf of SPT.
Services
Connections to services on other lines can be made at:
and to the Cumbernauld Line between and
to the Whifflet Line to
to the Argyle Line and services on the WCML, ECML, and North Berwick Line
2006 to 2011
There was an hourly service, usually operated by a Class 156 and calling at all stations. During the peak this was supplemented by Argyle Line services extended from to .
2011 to May 2014
There was an hourly service, usually operated by a Class 156; however, Class 158 were occasionally sighted. This called at all stations. During the peak this was supplemented by Argyle Line services extended from to .
May to December 2014
There was an hourly service operated by a Class 318 or a Class 320 as the line had by this time been fully electrified. This called at all stations and was supplemented during the peak by Argyle Line services extended from to .
December 2014 onwards
The hourly EMU service remains in operation, but now fully interworks with Argyle Line services via the Hamilton Circle west of Motherwell. Southbound trains continue via Hamilton & Newton to via Yoker, whilst those in the opposite direction originate at .
|
https://en.wikipedia.org/wiki/Maryhill%20Line
|
The Maryhill Line is a suburban railway line linking central Glasgow and Anniesland via Maryhill in Scotland. It is part of the Strathclyde Partnership for Transport network. The line between Glasgow and Maryhill forms a part of the West Highland Line (linking the WHL and North Clyde Line with the former Edinburgh and Glasgow Railway main line out of Glasgow Queen Street High Level) and was reopened to stopping passenger services in 1993. The line was reopened by British Rail and Strathclyde Passenger Transport Executive. Local services over the route had previously ended in the early 1960s, though it remained open thereafter for /Mallaig & trains and freight traffic. In 2005 it was extended to Anniesland via a new station at Kelvindale in the north west of the city.
The route serves the following places:
Glasgow Queen Street
Ashfield
Possilpark and Parkhouse
Gilshochill
Summerston
Maryhill
Kelvindale
Anniesland
Historical routes
The Maryhill line runs on the formations of the following historic railways:
Edinburgh and Glasgow Railway between and Cowlairs Junction
Glasgow, Dumbarton and Helensburgh Railway between Cowlairs Junction and Maryhill Park Junction
Stobcross Railway between Maryhill Park Junction and
Operations
Maryhill Line services connect with the Argyle and North Clyde Lines at station, where the branch terminates in a bay platform built as part of the extension from Maryhill. Prior to 2005, trains terminating at Maryhill had to proceed empty to Knightswood North Junction (near , where the route joins the North Clyde suburban network) to reverse and change lines before returning to Glasgow. This procedure took several minutes (whilst the driver changed ends) and consequently restricted capacity at the busy junction – diverting the service to Anniesland freed up additional paths on the North Clyde route through there and allowed more trains to run between the south side of the city and the branch. The connection from Maryhill junction to Westerton is used by Oban and Mallaig trains.
In 2015, a connection was installed between the Maryhill Line and the Glasgow-bound North Clyde Line at Anniesland, to act as a diversionary route into Glasgow Queen Street from Edinburgh and the North.
The line is not electrified, though there have been calls from various bodies and Glasgow MSPs to do so in recent years (as it is one of the few routes not included in plans for the future upgrading of the network on the north side of Glasgow). Passenger services are operated by ScotRail using Class 156, Class 158 and Class 170 diesel multiple units.
There has been a Sunday service on the line since 17 May 2014.
References
Transport in Glasgow
Railway lines in Scotland
Standard gauge railways in Scotland
Maryhill
|
https://en.wikipedia.org/wiki/Carly%20Pope
|
Carly Pope (born August 28, 1980) is a Canadian actress. She is best known for her roles on The WB's drama series Popular (1999–2001), supernatural drama series The Collector (2004–2005), USA Network's legal drama series Suits (2016–2017) and The CW's Arrow (2016–2017).
Early life
Pope was born and raised in Vancouver, British Columbia, with an older brother, Kris, also an actor, and a younger brother, Alexander. She was trained as a dancer until she became active in theater during high school. She appeared in plays such as The Odd Couple, playing Mickey, and A Midsummer Night's Dream, playing Titania. She attended Lord Byng Secondary high school.
Career
Pope started her career with several small roles, such as Disturbing Behavior, Snow Day, Aliens in the Wild, Wild West, and Night Man, before being cast as Sam McPherson on The WB's comedy-drama television series Popular (1999–2001). The series followed two teenage girls, Pope and Leslie Bibb, who reside on opposite ends of the popularity spectrum at their high school, but are forced to get along when their single parents meet on a cruise ship and get married. Pope was named one of Teen People's 25 Hottest Stars Under 25 in 2000. She has appeared on the cover of several magazines, including Seventeen, Teen, Curve and Medusa, and in pictorials for FHM and Razor. Her breakthrough role was playing Abbey in Disturbing Behavior (1998), who was in a flashback sequence, but it was cut when the film was released.
Pope had several roles in film and television, including The Glass House, Jeff Probst's Finder's Fee, and Orange County. In 2004 she had starred as Maya Kandinski in The Collector. In 2005 she was a guest-star in an episode of FOX's Tru Calling and played an aspiring social worker in the film Eighteen.
In 2007, Pope starred in the Power Up project Itty Bitty Titty Committee, and in Martin Gero's ' intelligent sex comedy ' and Toronto International Film Festival hit, Young People Fucking. In 2009, she appeared in FOX's hit thriller, 24, as Samantha Roth, the president's son's girlfriend.
Pope joined the main cast of the NBC legal drama television series Outlaw in 2010, portraying Lucinda Pearl. In 2015, Pope co-produced the Canadian documentary film Highway of Tears. She portrayed architect Tara Messer on USA Network's legal drama series Suits (2016–2017). On July 26, 2019, The Hollywood Reporter announced that Pope will appear in Hallmark Channel's Christmas-themed television film, Double Holiday (2019) opposite Kristoffer Polaha.
Personal life
On December 29, 2009, Pope and her brother, Kris, were driving a black BMW down West Georgia Street in Downtown Vancouver when David Fomradas, 31, of Alberta jumped on top of the car and yelled at them to run him over. When Kris got out of the car, Fomradas jumped in the front seat and drove the vehicle into the new CBC studios. Carly suffered a broken rib and two cracked vertebrae, Kris suffered severe injuries to his ankle, and a passerby was also
|
https://en.wikipedia.org/wiki/DBASE%20Mac
|
dBASE Mac was a database management system for the Apple Macintosh, released by Ashton-Tate in 1987. Although the GUI was lauded in the press, the application was so slow that it became something of a joke in the industry. Sales were dismal, and Ashton-Tate eventually decided to give up on dBASE Mac and instead port dBASE IV to the Mac, complete with a DOS-like interface. The product was then sold to a series of third-party developers, but they had little success and it disappeared from the market in the mid-1990s.
History
Genesis
dBASE Mac started life at a third-party developer, DigiCorp, a small two-person company in Salt Lake City. They had attempted to market it through other companies in 1984 as Hayden: Base via Hayden Software, a Mac publisher, TheBase and then °Base (Dot-Base, referring to a part of its internal syntax), but the product was not really ready and the deals fell through.
Just before Christmas 1984, Ashton-Tate started negotiations with the developers, completing the deal early 1985. The developers moved to A-T's Glendale Development Center (where the PC versions of dBASE were developed) early in 1985. Development resumed in May, referred to by the code-name Dottie, referring to the earlier Dot-Base naming.
Changing priorities
At first the idea was to produce something similar to DigiCorp's original design, releasing a 1.0 in early 1986 and then following with a major upgrade late that year. However the product quickly became fouled in Ashton-Tate's management, who used it as a dumping ground for every buzzword feature that came along. Eventually the original 1.0 design was abandoned and the decision was made to move directly to what was to have been the 2.0 release, the most notable change being to include an object oriented programming language. Sometime during this period, management saw the product as a migration path for all versions of dBASE, using the Mac as a testing ground before releasing it on the PC as well, thereby replacing their now-ageing dBASE core with a fully GUI-hosted object-oriented database.
Apple had long evangelized Ashton-Tate on developing for the Mac, considering them to be one of the "big players" they needed to legitimize the Mac marketplace. Although Apple's upper management remained committed to this vision, after waiting three years since the release of the Mac, others in the company were becoming increasingly frustrated with the seemingly never ending development cycles. Things came to a head when Guy Kawasaki convinced Apple to option a new advanced database program then known as "Silver Surfer". Ashton-Tate threatened to stop all Mac development, and Apple quickly acquiesced and dropped their option. Kawasaki responded by starting his own company and marketing the product as 4th Dimension. Another delay followed as Ashton-Tate asked for many tweaks and new features to ensure dBASE Mac would compete with this new and very competitive product.
By late 1986 the product was starting to ge
|
https://en.wikipedia.org/wiki/Croy%20Line
|
The Croy Line is a suburban railway route linking Glasgow Queen Street and Croy in Scotland. It is part of the Strathclyde Partnership for Transport network.
Following completion of the project to reopen the line to Alloa to passenger services on 19 May 2008, Croy Line services continue alternately to and .
This route is now electrified, as of December 2017. Passenger services are operated by ScotRail.
Route
Most of the route is shared with other services:
Glasgow to Edinburgh via Falkirk Line between Glasgow Queen Street and Greenhill Junction
Glasgow to Aberdeen Line between Glasgow Queen Street and Dunblane
Highland Main Line between Larbert and Dunblane
Edinburgh to Dunblane Line between Larbert and Dunblane
Historical route
The route comprises the following historical railway lines:
Edinburgh and Glasgow Railway between Glasgow Queen Street and Greenhill Junction
Scottish Central Railway between Greenhill Junction and Dunblane
Stirling and Dunfermline Railway between Stirling and Alloa
References
Transport in Glasgow
Transport in East Dunbartonshire
Transport in North Lanarkshire
Railway lines in Scotland
Standard gauge railways in Scotland
|
https://en.wikipedia.org/wiki/Xsupplicant
|
Xsupplicant is a supplicant that allows a workstation to authenticate with a RADIUS server using 802.1X and the Extensible Authentication Protocol (EAP). It can be used for computers with wired or wireless LAN connections to complete a strong authentication before joining the network and supports the dynamic assignment of WEP keys.
Overview
Xsupplicant up to version 1.2.8 was designed to run on Linux clients as a command line utility. Version 1.3.X and greater are designed to run on Windows XP and are currently being ported to Linux/BSD systems, and include a robust graphical user interface, and also includes Network Access Control (NAC) functionality from Trusted Computing Group's Trusted Network Connect NAC.
Xsupplicant was chosen by the OpenSea Alliance, dedicated to developing, promoting, and distributing an open source 802.1X supplicant.
Xsupplicant supports the following EAP types:
EAP-MD5
LEAP
EAP-MSCHAPv2
EAP-OTP
EAP-PEAP (v0 and v1)
EAP-SIM
EAP-TLS
EAP-TNC
EAP-TTLSv0 (PAP/CHAP/MS-CHAP/MS-CHAPv2/EAP)
EAP-AKA
EAP-GTC
EAP-FAST (partial)
Xsupplicant is primarily maintained by Chris Hessing.
See also
wpa_supplicant
References
External links
XSupplicant on SourceForge
XSupplicant on GitHub
Wireless networking
|
https://en.wikipedia.org/wiki/Security%20Administrator%20Tool%20for%20Analyzing%20Networks
|
Security Administrator Tool for Analyzing Networks (SATAN) was a free software vulnerability scanner for analyzing networked computers. SATAN captured the attention of a broad technical audience, appearing in PC Magazine and drawing threats from the United States Department of Justice. It featured a web interface, complete with forms to enter targets, tables to display results, and context-sensitive tutorials that appeared when a vulnerability had been found.
Naming
For those offended by the name SATAN, the software contained a special command called repent, which rearranged the letters in the program's acronym from "SATAN" to "SANTA".
Description
The tool was developed by Dan Farmer and Wietse Venema. Neil Gaiman drew the artwork for the SATAN documentation.
SATAN was designed to help systems administrators automate the process of testing their systems for known vulnerabilities that can be exploited via the network. This was particularly useful for networked systems with multiple hosts. Like most security tools, it was useful for good or malicious purposes – it was also useful to would-be intruders looking for systems with security holes.
SATAN was written mostly in Perl and utilized a web browser such as Netscape, Mosaic or Lynx to provide the user interface. This easy to use interface drove the scanning process and presents the results in summary format. As well as reporting the presence of vulnerabilities, SATAN also gathered large amounts of general network information, such as which hosts are connected to subnets, what types of machines they are and which services they offered.
Status
SATAN's popularity diminished after the 1990s. It was released in 1995 and development has ceased. In 2006, SecTools.Org conducted a security popularity poll and developed a list of 100 network security analysis tools in order of popularity based on the responses of 3,243 people. Results suggest that SATAN has been replaced by nmap, Nessus and to a lesser degree SARA (Security Auditor's Research Assistant), and SAINT.
References
External links
Official home page
History of SATAN
Unix network-related software
Network analyzers
Internet Protocol based network software
Computer security software
Security technology
Computer-related introductions in 1995
|
https://en.wikipedia.org/wiki/WWF%20LiveWire
|
WWF LiveWire is an American professional wrestling television program that was produced by the World Wrestling Federation (WWF). It aired from 1996 to 2001 on the USA Network and later TNN.
History
Premiering on Saturday September 21, 1996, in its initial format, LiveWire was broadcast live and allowed viewers to phone-in and participate in the show. This was the first WWF program to feature such an "interactive" element. The show was used to summarize the weekly events in WWF programming and featured interviews with WWF personalities and allowed the fans to phone-in and ask questions to in-studio guests.
One of the more notable calls occurred during a brief cross-promotional angle involving Extreme Championship Wrestling and the World Wrestling Federation. On the October 5, 1996 episode of LiveWire, Paul Heyman, using the alias "Bruce from Connecticut," called in to LiveWire to express his discontent with boring WWF programming and the state of the promotion. Faarooq also debuted the concept of the Nation of Domination on LiveWire.
In February 1997, LiveWire later became exclusively a weekly summary show in similar style to that of WWF Mania. The show was hosted by Todd Pettengill and Sunny. Michael Cole later took over as host until July 2000 when he was succeeded by Jonathan Coachman. Both commentators would occasionally host the show together until the discontinuation of WWF LiveWire on August 18, 2001. A former co-host of this show was Marissa Mazzola, who is the wife of Shane McMahon.
References
External links
Livewire
WWE Raw
Spike (TV network) original programming
USA Network original programming
1996 American television series debuts
2001 American television series endings
|
https://en.wikipedia.org/wiki/WWF%20Prime%20Time%20Wrestling
|
WWF Prime Time Wrestling is a professional wrestling television program that was produced by the World Wrestling Federation (WWF). It aired on the USA Network from January 1, 1985, to January 4, 1993. A precursor to Monday Night Raw, Prime Time Wrestling was a two-hour long, weekly program that featured stars of the World Wrestling Federation. The program featured wrestling matches (most of which were compiled from WWF "house show" matches from venues such as Madison Square Garden), interviews, promos featuring WWF wrestlers, updates of current feuds and announcements of upcoming local and pay-per-view events. In addition, Prime Time Wrestling would also air wrestling matches and interviews from other WWF programming such as Superstars of Wrestling and Wrestling Challenge. Select episodes of Prime Time Wrestling are available for streaming on the WWE Network.
Main focus
Despite the format changes in its last years, the main focus of Prime Time Wrestling remained unchanged—recapping the highlights of the WWF's flagship syndicated programs and presenting exclusive matches taped from the house show circuit. Many of these were main event caliber and mid-card matches seldom seen on the syndicated programs, which tended to show primarily squash matches. Many wrestlers’ first WWF television appearances were also on this show. Selected matches from the past and present from WWF's flagship arenas of the time — Madison Square Garden in New York City, the Spectrum in Philadelphia the Boston Garden in Boston, and the Capital Centre in the Washington suburb of Landover, Maryland — that had aired on various regional sports networks were also aired on Prime Time Wrestling.
History
Early years
Premiering on January 1, 1985, the original hosts of Prime Time Wrestling were Jesse Ventura and Jack Reynolds. Reynolds would co-host his final edition of Prime Time on July 9, 1985, with Gorilla Monsoon replacing him as Ventura's co-host the week after.
Bobby Heenan made his first appearance as Monsoon's co-host on April 28, 1986, and officially replaced Ventura on June 30 of that same year.
The best-remembered Prime Time format featured Heenan and Monsoon introducing taped matches and analyzing them afterward, with Monsoon taking a babyface and sometimes neutral position and Heenan unashamedly cheering on the heels, especially members of The Heenan Family. The chemistry between Monsoon and Heenan made this show popular with fans for many years, despite the fact it was not considered one of the WWF's "primary" shows for most of its history. Many other wrestling programs—both produced by the WWF and by other companies—would attempt to copy this formula, with varying degrees of success.
Although primarily a studio-based program, Prime Time would occasionally go on the road and tape its segments from various outside locations. Examples included Busch Gardens, Trump Plaza, the CN Tower, and Churchill Downs, among others. These segments rarely had much to do with t
|
https://en.wikipedia.org/wiki/Rasch%20model%20estimation
|
Estimation of a Rasch model is used to estimate the parameters of the Rasch model. Various techniques are employed to estimate the parameters from matrices of response data. The most common approaches are types of maximum likelihood estimation, such as joint and conditional maximum likelihood estimation. Joint maximum likelihood (JML) equations are efficient, but inconsistent for a finite number of items, whereas conditional maximum likelihood (CML) equations give consistent and unbiased item estimates. Person estimates are generally thought to have bias associated with them, although weighted likelihood estimation methods for the estimation of person parameters reduce the bias.
Rasch model
The Rasch model for dichotomous data takes the form:
where is the ability of person and is the difficulty of item .
Joint maximum likelihood
Let denote the observed response for person n on item i. The probability of the observed data matrix, which is the product of the probabilities of the individual responses, is given by the likelihood function
The log-likelihood function is then
where is the total raw score for person n, is the total raw score for item i, N is the total number of persons and I is the total number of items.
Solution equations are obtained by taking partial derivatives with respect to and and setting the result equal to 0. The JML solution equations are:
where .
The resulting estimates are biased, and no finite estimates exist for persons with score 0 (no correct responses) or with 100% correct responses (perfect score). The same holds for items with extreme scores, no estimates exists for these as well. This bias is due to a well known effect described by Kiefer & Wolfowitz (1956). It is of the order , and
a more accurate (less biased) estimate of each is obtained by multiplying the estimates by .
Conditional maximum likelihood
The conditional likelihood function is defined as
in which
is the elementary symmetric function of order r, which represents the sum over all combinations of r items. For example, in the case of three items,
Details can be found in the chapters by von Davier (2016) for the dichotomous Rasch model and von Davier & Rost (1995) for the polytomous Rasch model.
Estimation algorithms
Some kind of expectation-maximization algorithm is used in the estimation of the parameters of Rasch models. Algorithms for implementing Maximum Likelihood estimation commonly employ Newton–Raphson iterations to solve for solution equations obtained from setting the partial derivatives of the log-likelihood functions equal to 0. Convergence criteria are used to determine when the iterations cease. For example, the criterion might be that the mean item estimate changes by less than a certain value, such as 0.001, between one iteration and another for all items.
See also
Expectation-maximization algorithm
Rasch model
References
Linacre, J.M. (2004). Estimation methods for Rasch measures. Chapter 2 in E.V. Smith
|
https://en.wikipedia.org/wiki/24%20Oras
|
(pronounced as bente kwatro oras / ) is a Philippine television news broadcasting show broadcast by GMA Network. Originally anchored by Mel Tiangco and Mike Enriquez, it premiered on March 15, 2004, on the network's Telebabad line up, replacing Frontpage: Ulat ni Mel Tiangco. Tiangco, Vicky Morales and Emil Sumangil currently serve as the anchors.
The show is streaming online on YouTube.
Overview
24 Oras premiered on March 15, 2004, broadcasting from Studio 2 of GMA Network Center, replacing the news program Frontpage: Ulat ni Mel Tiangco. Mel Tiangco and Mike Enriquez served as anchors, while Pia Guanio served as the anchor for the segment Showbiz Time (later Chika Minute).
On November 10, 2014, Vicky Morales joined the show. On May 29, 2015, Guanio left the program. She was replaced by Iya Villania on June 15. On August 24, 2018, Atom Araullo served as a substitute anchor for Enriquez, who went on medical leave. Enriquez returned to the program on November 26, 2018.
In March 2020, due to the enhanced community quarantine in Luzon caused by the COVID-19 pandemic; Enriquez temporarily took a break from the program, Tiangco anchored the segment Kapusong Totoo through voice recording, Araullo and Jessica Soho served as anchors along with Morales and Villania and Cruz started anchoring their segments through their respective home. In April 2020, the program added sign language interpreters. On June 1, 2020, Enriquez, Tiangco and Cruz returned to anchor from the studio set of the program. On October 11, 2021, Kim Atienza joined the program to anchor the #KuyaKimAnoNa segment.
In December 2021, Enriquez took another medical leave from the show. The following year, Villania returned to anchor from the show's studio set. On March 28, 2022, Enriquez returned to the show. In August 2022, he took yet another leave of absence from the show, before dying on August 29, 2023.
On August 7, 2023, Martin Javier joined the program to anchor the Game Changer segment.
Anchors
Mel Tiangco
Vicky Morales
Emil Sumangil
Iya Villania
Kim Atienza
Maureen Schrijvers
Martin Javier
Former anchors
Mike Enriquez
Pia Guanio
Atom Araullo
Chino Trinidad
Nathaniel "Mang Tani" Cruz
Interim anchors
Connie Sison
Jessica Soho
Atom Araullo
Arnold Clavio
Kara David
Ivan Mayrina
Mariz Umali
Pia Arcangel
Jun Veneracion
Raffy Tima
Chino Gaston
Segments
#BosesMo
Chika Minute
Chika in a Minute
Game Changer
Good News
Kapusong Totoo
Special Report
Sumbungan ng Bayan
Summer Sparkle
Time Out
#KuyaKimAnoNa
Weather Center
Defunct
Alerto 24
Atomic Sports
Balitang Abroad
Bantay Probinsya
Huli Cam
Imbestigador ng Bayan
I.M. Ready, GMA Weather
Love Today
Newsflash
Pampa Good Vibes
Patok of the Town
Showbiz Time
#SummerVibes
Usapang Pets
Viral na 'To!
YouScoop
Pagbangon
Ronda Probinsya
ThinkTok
24 Oras Weekend
Originally anchored by Pia Arcangel and Jiggy Manicad, the weekend edition of premiered on February 21, 2
|
https://en.wikipedia.org/wiki/Hackintosh
|
A Hackintosh (, a portmanteau of "Hack" and "Macintosh") is a computer that runs Apple's Macintosh operating system macOS on computer hardware not authorized for the purpose by Apple. This can also include running Macintosh software on hardware it is not originally authorized for. "Hackintoshing" began as a result of Apple's 2005 transition to Intel processors, away from PowerPC. Since 2005, many Mac computers have used the same x86-64 computer architecture as many other desktop PCs, laptops, and servers, meaning that in principle, the code making up macOS systems and software can be run on alternative platforms with minimal compatibility issues. Benefits cited for "Hackintoshing" can include cost (older, cheaper or commodity hardware), ease of repair and piecemeal upgrade, and freedom to use customized choices of components that are not available (or not available together) in the branded Apple products. macOS can also be run on several non-Apple virtualization platforms, although such systems are not usually described as Hackintoshes. Hackintosh laptops are sometimes referred to as "Hackbooks".
Apple's software license for macOS only permits the software's use on computers that are "Apple-branded." However, because many still-supported Macintosh computers use Intel-based hardware, there are few limitations keeping the software from running on other types of Intel-based PCs. Notably, companies such as Psystar have attempted to release products using macOS on non-Apple machines, though many Hackintosh systems are designed solely by macOS enthusiasts of various hacking forums and communities. While commercial circumvention of the methods Apple uses to prevent macOS from being installed on non-Apple hardware is restricted in the United States under the Digital Millennium Copyright Act (DMCA), specific changes to the law regarding the concept of jailbreaking have placed circumvention methods like these into a legal grey area.
In 2020, Apple began to move to ARM64-based Apple silicon processors. The company has said it will eventually stop supporting the Intel64 architecture.
History
Mac OS X Tiger (10.4)
On June 6, 2005, Apple announced its plans to transition to Intel x86 processors at their Worldwide Developers Conference and made available a prototype Intel-based Mac to selected developers at a cost of $999 (). Efforts immediately began to attempt to run Mac OS X on non-Apple hardware, but developers quickly found themselves with an error message saying that the PC hardware configurations were not supported.
On January 10, 2006, Apple released 10.4.4 with the first generation of Intel-based Macs, the iMac and the MacBook Pro. These machines used Extensible Firmware Interface (EFI) platform firmware instead of the older style BIOS found on most x86 motherboards at the time. On February 14, 2006, an initial "hack" of v10.4.4 was released on the Internet by a programmer with the pseudonym crg92. Within hours Apple released the 10.4.5 update,
|
https://en.wikipedia.org/wiki/XOSL
|
xOSL (meaning Extended Operating System Loader) is a bootloader. xOSL was originally developed by Geurt Vos.
History
xOSL is free software released under the GPL-2.0-only license. The project was actively developed by Geurt Vos between 1999 and 2001 and spanned four major revisions and two minor revisions after its initial creation.
From its origin in xOSL version 1.0.0, xOSL underwent major changes in ver. 1.1.0, 1.1.1, 1.1.2 and 1.1.3. These revisions were significant departures from one another, and introduced new features to the program. These features ranged from drastic user interface improvements to improved compatibility on diverse hardware platforms.
xOSL ver. 1.1.4 and 1.1.5 only introduced improvements to existing functionality and repaired features that should have been functional in their predecessors. Although their improvements were subtle, they did serve to stabilize a developing protocol, and are the most polished revisions of the original to date.
The project lapsed into a dormant state and was abandoned by its original developer from 2001 to 2007. xOSL remained available for download and use throughout this period.
Survivability
Despite the lack of active product development, an enthusiastic community of xOSL users began exchanging ideas and product results through the use of Yahoo! Groups and other support sites on the internet. These groups became the foundation of the 'xOSL Culture'. The xOSL groups assisted fellow members with advice and accomplishments through the use of xOSL. After the original xOSL web site expired it was mirrored in multiple locations by Filip Komar and Mikhail Ranish.
Very few enhancements to the original product occurred during this time, most of them being fairly inconsequential. One such enhancement gave the user the ability to change wallpapers and the image displayed at startup, and like most other revisions, it did not add a great deal to the program in terms of core functionality.
Other revisions included the translation of xOSL into several different languages, including German, Czech and French, among others.
XOSL-OW
XOSL-OW is an Open Watcom Port of XOSL. XOSL is developed by Geurt Vos using the Borland C++ 3.1 tool set while XOSL-OW is based on the Open Watcom version 1.8 tool set.
The XOSL-OW Open Watcom Port allows for future development of XOSL using an Open Source development tool set.
XOSL-OW has no new functionality compared to XOSL but it does give improved behavior on specific PC hardware. In fact stability issues with XOSL on some PC platforms have been the reason for porting XOSL to the Open Watcom tool set.
Examples of stability issues on specific PC hardware are:
Launching the Ranish Partition Manager from within the XOSL boot manager (Ctrl-P) results in a non-responsive keyboard.
Booting into the Smart Boot Manager (used to support booting from CD/DVD) results in a non-responsive keyboard.
Booting into Linux using the XOSL boot manager is not successful because
|
https://en.wikipedia.org/wiki/Modcomp
|
Modcomp, Inc., originally Modular Computer Systems, was a small minicomputer vendor that specialized in real-time applications. They were founded in 1970 in Fort Lauderdale, Florida. In the 1970s and 1980s, they produced a line of 16 and 32-bit mini-computers. Through the 1980s, Modcomp lost market share as more powerful micro-computers became popular, and Digital Equipment Corporation's VAX and Alpha systems continued to grow. The company successfully survives today as a systems integrator operating as CSPi Technology Solutions headquartered in Deerfield Beach, Florida.
Founders
The founders of Modcomp were primarily from System Engineering Laboratories. They consisted of Ken Harple, Seymore Schwartz, Ray Matson, Joe Godfrey, and Neil Miller.
Computers
Their first computer was the 16-bit Modcomp III, introduced shortly after the company was founded. This had 15 general-purpose registers, and was initially offered with a 16-kilobyte (16,384 bytes), 18-mil magnetic-core memory with an 800 ns cycle time, expandable to 128 kilobytes (131,072 bytes). The Modcomp I followed for smaller applications, with only 3 general-purpose registers and a maximum of 64 kilobytes (65,536 bytes) of core. These machines were based on SSI and MSI TTL logic.
The Modcomp II, introduced in 1972, maintained compatibility with the Modcomp III, while using some LSI circuits.
The core architecture of the 16-bit machines included blocks of uncommitted opcodes and provisions for physical modularity that hint at the reasoning behind the company name.
The Modcomp IV was an upward compatible 32-bit machine with a paged memory management unit introduced in 1974. The minimum memory configuration was 32 kilobytes (32,768 bytes), expandable to 512 kilobytes (524,288 bytes),
with access times of 500 to 800 nanoseconds (varying because of memory interleaving). The machine had 240 general purpose registers, addressable as 16 banks of 15 registers. The MMU contained 1024 address mapping registers, arranged as 4 page tables of 256 pages each (some of these page tables could be further subdivided if address spaces smaller than 128 kilobytes (131,072 bytes) were needed). Fields of the Program Status Doubleword were used to select the current active register bank and page table. The machine had a two-stage pipelined CPU, and a floating point unit.
In many regards, the Modcomp IV had potential as a competitor for the VAX, although the address space per process was limited to 64K 16-bit words; 256 pages of 256 words each, from the perspective of the MMU. Beginning in 1978, the Modcomp IV was replaced by the Modcomp Classic; the first Classic model was the 7810. This retained compatibility with the Modcomp IV, while offering full support for 32-bit addressing. The later 9250 and 9260 continued to support both 16-bit and 32-bit applications.
Operating systems
The Modular Applications eXecutive family of operating systems supported these machines. MAX I was a real-time monitor f
|
https://en.wikipedia.org/wiki/Zuckertia
|
Zuckertia is a genus of plant of the family Euphorbiaceae first described as a genus in 1858. It contains only one known species, Zuckertia cordata, native to southern Mexico and Central America.
References
Monotypic Euphorbiaceae genera
Plukenetieae
Flora of Southern Mexico
Flora of Central America
Taxa named by Henri Ernest Baillon
|
https://en.wikipedia.org/wiki/Semi-Thue%20system
|
In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system over strings from a (usually finite) alphabet. Given a binary relation between fixed strings over the alphabet, called rewrite rules, denoted by , an SRS extends the rewriting relation to all strings in which the left- and right-hand side of the rules appear as substrings, that is , where , , , and are strings.
The notion of a semi-Thue system essentially coincides with the presentation of a monoid. Thus they constitute a natural framework for solving the word problem for monoids and groups.
An SRS can be defined directly as an abstract rewriting system. It can also be seen as a restricted kind of a term rewriting system. As a formalism, string rewriting systems are Turing complete. The semi-Thue name comes from the Norwegian mathematician Axel Thue, who introduced systematic treatment of string rewriting systems in a 1914 paper. Thue introduced this notion hoping to solve the word problem for finitely presented semigroups. Only in 1947 was the problem shown to be undecidable— this result was obtained independently by Emil Post and A. A. Markov Jr.
Definition
A string rewriting system or semi-Thue system is a tuple where
is an alphabet, usually assumed finite. The elements of the set (* is the Kleene star here) are finite (possibly empty) strings on , sometimes called words in formal languages; we will simply call them strings here.
is a binary relation on strings from , i.e., Each element is called a (rewriting) rule and is usually written .
If the relation is symmetric, then the system is called a Thue system.
The rewriting rules in can be naturally extended to other strings in by allowing substrings to be rewritten according to . More formally, the one-step rewriting relation relation induced by on for any strings :
if and only if there exist such that , , and .
Since is a relation on , the pair fits the definition of an abstract rewriting system. Obviously is a subset of . Some authors use a different notation for the arrow in (e.g. ) in order to distinguish it from itself () because they later want to be able to drop the subscript and still avoid confusion between and the one-step rewrite induced by .
Clearly in a semi-Thue system we can form a (finite or infinite) sequence of strings produced by starting with an initial string and repeatedly rewriting it by making one substring-replacement at a time:
A zero-or-more-steps rewriting like this is captured by the reflexive transitive closure of , denoted by (see abstract rewriting system#Basic notions). This is called the rewriting relation or reduction relation on induced by .
Thue congruence
In general, the set of strings on an alphabet forms a free monoid together with the binary operation of string concatenation (denoted as and written multiplicatively by dropping the symbol). In a SRS, the reductio
|
https://en.wikipedia.org/wiki/MIH
|
Mih or MIH may refer to:
Matilda International Hospital, a hospital in The Peak, Hong Kong
Molar Incisor Hypomineralisation, Dentistry
Media independent handover, in wireless networking
Müllerian inhibiting hormone
Mills Hill railway station, England, National Rail station code
Istarski mih, a Croatian bagpipe
Musee International d'Horlogerie, a horology museum in La Chaux-de-Fonds, Switzerland
|
https://en.wikipedia.org/wiki/Tunnel%20broker
|
In the context of computer networking, a tunnel broker is a service which provides a network tunnel. These tunnels can provide encapsulated connectivity over existing infrastructure to another infrastructure.
There are a variety of tunnel brokers, including IPv4 tunnel brokers, though most commonly the term is used to refer to an IPv6 tunnel broker as defined in .
IPv6 tunnel brokers typically provide IPv6 to sites or end users over IPv4. In general, IPv6 tunnel brokers offer so called 'protocol 41' or proto-41 tunnels. These are tunnels where IPv6 is tunneled directly inside IPv4 packets by having the protocol field set to '41' (IPv6) in the IPv4 packet. In the case of IPv4 tunnel brokers IPv4 tunnels are provided to users by encapsulating IPv4 inside IPv6 as defined in .
Automated configuration
Configuration of IPv6 tunnels is usually done using the Tunnel Setup Protocol (TSP), or using Tunnel Information Control protocol (TIC). A client capable of this is AICCU (Automatic IPv6 Connectivity Client Utility). In addition to IPv6 tunnels TSP can also be used to set up IPv4 tunnels.
NAT issues
Proto-41 tunnels (direct IPv6 in IPv4) may not operate well situated behind NATs. One way around this is to configure the actual endpoint of the tunnel to be the DMZ on the NAT-utilizing equipment. Another method is to either use AYIYA or TSP, both of which send IPv6 inside UDP packets, which is able to cross most NAT setups and even firewalls.
A problem that still might occur is that of the timing-out of the state in the NAT machine. As a NAT remembers that a packet went outside to the Internet it allows another packet to come back in from the Internet that is related to the initial proto-41 packet. When this state expires, no other packets from the Internet will be accepted. This therefore breaks the connectivity of the tunnel until the user's host again sends out a packet to the tunnel broker.
Dynamic endpoints
When the endpoint isn't a static IP address, the user, or a program, has to instruct the tunnel broker to update the endpoint address. This can be done using the tunnel broker's web site or using an automated protocol like TSP or Heartbeat, as used by AICCU. In the case of a tunnel broker using TSP, the client automatically restarting the tunnel will cause the endpoint address and port to be updated.
Implementations
The first implementation of an IPv6 Tunnel Broker was at the Italian CSELT S.p.A. by Ivano Guardini, the author of RFC 3053
There are a variety of tunnel brokers that provide their own custom implementations based on different goals. Listed here are the common implementations as used by the listed IPv6 tunnel brokers.
Gogo6 gogoSERVER
gogoSERVER (formerly Gateway6) is used by the Freenet6 service, which is the second IPv6 tunnel broker service, going into production in 1999. It was started as a project of Viagenie and then Hexago was spun off as a commercial company selling Gateway6, which powered Freenet6, as their fl
|
https://en.wikipedia.org/wiki/English%20Institute%20of%20Sport
|
The English Institute of Sport (EIS), established in May 2002, is an organisation which provides sport science and medical support services to elite athletes through a nationwide network of expertise and facilities, working with Olympic and Paralympic summer and winter sports, as well as English and a number of professional sports.
It is headquartered in Manchester, with regional centers in Bath, Bisham Abbey, Loughborough, London, and Sheffield.
The EIS also works with a range of other sports organisations, including national governing bodies of sport, professional sports teams, and individual athletes.
Structure
A grant funded organisation through UK Sport, Olympic and Paralympic sports are able to engage with EIS services through their Programme funding from UK Sport, English sports through their Sport England funding and professional sports through their respective funding bodies.
Centres
Services are delivered from nine EIS High Performance Centres across the country, as well as at a number of additional partner sites.
See also
United Kingdom Sports Institute
Sport in England
UK Sport
Scottish Institute of Sport
Sport Wales National Centre
Sports Institute for Northern Ireland
References
2002 establishments in England
Department for Digital, Culture, Media and Sport
Loughborough Sport
Organisations based in Manchester
National Institutes of Sport
Private companies limited by guarantee of the United Kingdom
Sport in Manchester
Sports medicine in the United Kingdom
England
Sports organizations established in 2002
|
https://en.wikipedia.org/wiki/IRIS%20Consortium
|
IRIS (Incorporated Research Institutions for Seismology) was a university research consortium dedicated to exploring the Earth's interior through the collection and distribution of seismographic data. IRIS programs contributed to scholarly research, education, earthquake hazard mitigation, and the verification of a Comprehensive Nuclear-Test-Ban Treaty. Support for IRIS came from the National Science Foundation, other federal agencies, universities, and private foundations. IRIS supported five major components, the Data Management Center (DMC), the Portable Array Seismic Studies of the Continental Lithosphere (PASSCAL), the Global Seismographic Network (GSN), the Transportable Array (USARRAY), and the Education and Public Outreach Program (EPO). IRIS maintained a Corporate Office in Washington, DC.
IRIS's Education and Public Outreach Program offered animations, videos, lessons, software, posters, and fact sheets to help teachers and the general public learn more about seismology and earth science and understand it better. The goal is to get more people interested in careers in geophysics.
IRIS is listed in the Registry of Research Data Repositories re3data.org.
On January 1st, 2023, IRIS merged with UNAVCO to form EarthScope Consortium.
History
In 1959, the United States Government launched a research effort aimed at improving national capabilities to detect and identify foreign nuclear explosions detonated underground and at high altitudes. The resultant World-Wide Standardized Seismograph Network (WWSSN) was a program successful beyond its original remit. It provided seismological data for its intended purpose as well as for the emerging concept of plate tectonics. Initially operated by the Defense Department, by 1973 operations were transferred to the U.S. Geological Survey. A collaboration with the IRIS Consortium began in 1984 as a result of a need to expand and succeed the WWSSN with the Global Seismographic Network (GSN). The GSN, originally funded entirely by the USGS under the National Earthquake Hazards Reduction Program (NEHRP), is now jointly supported by the National Science Foundation.
See also
Earthscope
Geophysics
Plate tectonics
POLARIS
Reflection seismology
Seismology
Seismometer
UNAVCO
Volcanology
References
External links
Smith, S., IRIS – A University Consortium for Seismology, Reviews of Geophysics and Space Physics, Vol. 25, p. 1203, 1986.
Aster, R., Beaudoin, B., Hole, J., Fouch, M., Fowler, J., James, D., and the PASSCAL Staff and Standing Committee, IRIS PASSCAL program marks 20 years of scientific discovery, EOS trans. AGU, 86, 26 April 2005.
Seismological observatories, organisations and projects
|
https://en.wikipedia.org/wiki/Kempston%20Micro%20Electronics
|
Kempston Micro Electronics was an electronics company based in Kempston, Bedfordshire, England specialising in computer joysticks and related home computer peripherals during the 1980s.
The Kempston Interface, a peripheral which allowed a joystick using the de facto Atari joystick port standard to be connected to the ZX Spectrum, was one of the most widely used add-ons to the machine.
Interface
The Kempston Interface is a joystick interface used on the ZX Spectrum series of computers that allows controllers complying with the de facto Atari joystick port standard (using the DE-9 connector) to be used with the machine.
The interface itself would be attached to the computer's rear expansion port with a single joystick port on the front or top of the system.
Apart from implementing existing joystick interfacing modes they produced their own standard which delivered the joystick state on the Z80 bus at port 31 (read in BASIC using IN 31). This meant that the joystick did not produce key-presses like the other standards, such as Cursor, and the method was soon borrowed by other interface manufacturers and became quite popular.
It was one of the most widely supported standards on the machine, coming out as the clear winner against other standards such as Protek and AGF's cursor-based solution and the Fuller standard during the days of the 48K Spectrum.
When Amstrad released the ZX Spectrum +2, the computer featured a built-in joystick interface that was software-compatible with Sinclair's ZX Interface 2 standard. However, the bundled SJS-1 joystick was electrically incompatible with the Atari standard. The Interface 2 standard simulated keypresses on the numerical keys ( to and to being left, right, down, up, fire for the 'left' and 'right' joysticks respectively) and hence were ideal for games with no official joystick support but in which the keys could be redefined.
Inserting or removing the joystick interface when the computer was turned on was inadvisable as it would almost certainly damage the computer hardware.
Mouse
x-axis at port 64479
y-axis at port 65503
two buttons at port 64223
Joysticks
The Formula 1 is based on the Quickshot 1 and released June 1985.
The Score Board has a base similar in size to a 48K Spectrum, with two fire buttons. Released June 1985.
The Competition Pro has a square base, two large red buttons (for left or right-handed use), and a black pommel stick. It uses the Atari 2600 standard DE-9 connector and was primarily designed to work with the ZX Spectrum Kempston joystick interface; it also works with the compatible ports of other home computers such as the Amstrad CPC, Commodore 64, VIC-20, and later Amiga and Atari ST. An Atari 5200 model uses the existing CX52 controller for the keypad functionality.
References
Defunct manufacturing companies of the United Kingdom
Home computer hardware companies
Game controllers
ZX Spectrum
Electronics companies of the United Kingdom
Kempston
Companies bas
|
https://en.wikipedia.org/wiki/SOEP
|
SOEP may refer to:
Sable Offshore Energy Project, a natural gas consortium
Socio-Economic Panel, a dataset of the population in Germany
|
https://en.wikipedia.org/wiki/Data%20Recall%20Diamond
|
The Data Recall Diamond One was a word processing typewriter, designed and built by Data Recall Ltd at Dorking, Surrey, England in the late 1970s and early 1980s. The machine drove a diablo 1355 daisy wheel printer via a parallel interface at 35–55 characters per second, and used an 8-inch floppy disc drive capable of holding 250,000 characters. It was user programmable. Later models included the Diamond III, the Diamond Five (a.k.a. Diamond V), and the Diamond 7.
One of the names suggested for the Amstrad PCW was the Zircon, on the grounds that zircon was "a Diamond substitute". This name was rejected.
References
Further reading
Word processors
Typewriters
|
https://en.wikipedia.org/wiki/CMN
|
CMN may refer to:
Canadian Museum of Nature, in Canada's National Capital Region
Carmarthen railway station, Wales, station code CMN
Catholic Media Network, Philippines radio network
Centre des monuments nationaux, French heritage agency
Certificate of medical necessity, in American healthcare
Children's Miracle Network Hospitals, in the U.S. and Canada
College of Menominee Nation, in Wisconsin, U.S.
Common Music Notation, open source musical notation software
Constructions Mécaniques de Normandie, a shipyard in Cherbourg, France
Mohammed V International Airport, Casablanca, Morocco, IATA code CMN
Mandarin Chinese, ISO 639-3 language code cmn
See also
Carmarthenshire, county in Wales
|
https://en.wikipedia.org/wiki/Autorefractor
|
An autorefractor or automated refractor is a computer-controlled machine used during an eye examination to provide an objective measurement of a person's refractive error and prescription for glasses or contact lenses. This is achieved by measuring how light is changed as it enters a person's eye.
Technique
The majority of autorefractors calculate the vision correction a patient needs (refraction) by using sensors that detect the reflections from a cone of infrared light. These reflections are used to determine the size and shape of a ring in the retina which is located in the posterior part of the eye. By measuring this zone, the autorefractor can determine when a patient's eye properly focuses an image. The instrument changes its magnification until the image comes into focus. The process is repeated in at least three meridians of the eye and the autorefractor calculates the refraction of the eye, sphere, cylinder and axis. Modern autorefractors are based on the idea patented by Antonio Medina Puerta.
Uses
In some offices, this process is used to provide the starting point for the ophthalmologist or optometrist in subjective refraction tests. Here, lenses are switched in and out of a phoropter and the patient is asked "which looks better" while looking at a chart. This feedback refines the prescription to one which provides the patient with the best vision.
Automated refraction is particularly useful when dealing with non-communicative people such as young children or those with disabilities.
Retinoscopy
Retinoscopy performed by an experienced clinician has been found to provide a more accurate estimation of refractive error than autorefraction. Recent studies report that autorefractor measurements without application of cycloplegia medication can result in significant overestimation of myopia.
References
External links
Trusit Dave "Automated refraction - Design and applications" in "Optometry Today" 04/06/04
"This Company Is Bringing Eye Exams (And Glasses) To People Who Can't Afford Healthcare". Read about Smart Vision Labs in "Business Insider" 09/29/14
PIKE Ophthalmic, image.
Ophthalmology
Ophthalmic equipment
|
https://en.wikipedia.org/wiki/Atomic%20Dog
|
"Atomic Dog" is a song by George Clinton, released by Capitol Records in December 1982, as the second and final single from his studio album, Computer Games (1982). It became the P-Funk collective's last to reach #1 on the U.S. R&B Chart. The single failed to chart on the Billboard Hot 100 although it has attained a level of stature since then, partly due to having been sampled in several hip hop songs.
History
George Clinton's P-Funk reached its commercial and conceptual height during the late 1970s after the release of Mothership Connection and a series of spectacular concert tours. Each of these concerts ended with a climactic descent of a giant spaceship from the rafters. However, as the band and their concept of funk grew, the organization became entangled in internal dissension, legal disputes, and creative exhaustion. "Atomic Dog" was the P-Funk collective's last single to reach #1 on the U.S. R&B chart.
According to Clinton, most of the song's lyrics were ad-libbed during the recording process.
Critical reception
"Atomic Dog" is regarded a classic in black popular music. The song's music video was nominated two Billboard Video Music Awards, one for best special effects, and another for best art direction. However, the video lost to Billy Joel's "Pressure" and Herbie Hancock's "Rockit" respectively.
Charts
Filmography
The song has been included in trailers and TV spots for many films (many dog-related), including 101 Dalmatians, 102 Dalmatians, Rugrats Go Wild, Hotel for Dogs, The Shaggy Dog, Finn on the Fly, Legally Blonde 2: Red, White & Blonde, The Fresh Prince of Bel-Air, Boomerang, Scooby-Doo (2002), Menace II Society, Trolls World Tour (2020), and Turner & Hooch (2021).
In popular culture
Snoop Dogg sampled the song in his 1993 song What's My Name?, mainly the chorus "Bow-wow-wow-yippie-yo-yippie-yeah". The lyrics are also quoted on the cover of his Doggystyle album.
The song is also used during timeouts of New York Liberty basketball games, during which the team's canine mascot Maddie will pump up the home crowd by dancing to the song.
The song appears in a 2019 TV commercial for Etrade.
Copyright lawsuit
"Atomic Dog" was the subject of Bridgeport Music, Inc. v. UMG, Inc., et al. (Case No. 07-5596, 6th Cir. 2009), a lawsuit filed in 2007 by the holders of the composition rights to "Atomic Dog" against the producers of "D.O.G. in Me," a song recorded by the R&B and hip-hop group Public Announcement and included on their 1998 album, All Work, No Play. In its complaint, Bridgeport claimed that "D.O.G. in Me" infringed its copyright by repeating the phrase, "Bow wow wow, yippie yo, yippie yea" and the sound of rhythmic panting throughout the song, and by repeating the word "dog" in a low tone of voice at regular intervals as a form of musical punctuation. A jury found that the defendants had willfully infringed Bridgeport's rights and awarded statutory damages of $88,980. In a November 2009 decision affirming the lower court
|
https://en.wikipedia.org/wiki/TXL
|
TXL may refer to:
TXL (programming language)
Berlin Tegel Airport, defunct German airport (by IATA code)
Fictional computer in the Today's Special animated series
|
https://en.wikipedia.org/wiki/NBName
|
NBName (note capitalization) is a computer program that can be used to carry out denial-of-service attacks that can disable NetBIOS services on Windows machines. It was written by Sir Dystic of CULT OF THE DEAD COW (cDc) and released July 29, 2000 at the DEF CON 8 convention in Las Vegas.
The program decodes and provides the user with all NetBIOS name packets it receives on UDP port 137. Its many command line options can effectively disable a NetBIOS network and prevent computers from rejoining it. According to Sir Dystic, "NBName can disable entire LANs and prevent machines from rejoining them...nodes on a NetBIOS network infected by the tool will think that their names already are being used by other machines. 'It should be impossible for everyone to figure out what is going on,' he added."
References
External links
NBName on Security Focus
Microsoft Security Bulletin
Malware
Windows security software
Denial-of-service attacks
Internet Protocol based network software
Cult of the Dead Cow software
|
https://en.wikipedia.org/wiki/Shannara%20%28video%20game%29
|
Shannara is a computer game released in 1995 for the MS-DOS and Microsoft Windows. It is based on the Shannara series of books by Terry Brooks.
Gameplay
Plot
Although the game contains characters from the Shannara novels, it is not an adaptation but an original story set after The Sword of Shannara and before The Elfstones of Shannara. Players take on the role of Jak Ohmsford, son of Shea. In Shady Vale, Jak meets Allanon. He tells Jak of the horrible Warlock Lord's return. Jak sets off into the Land of Shannara.
Development
Reception
A reviewer for Next Generation criticized the game, saying it fails both as an entry in the Shannara saga and as an adventure game. He opined that the story lacks the quality and depth of Brooks's novels, instead featuring a linear plot with a generic "villain's revenge" premise, while the gameplay falls short due to its bare bones combat system and its "clunky" overhead view when moving characters long distances.
In Computer Games Strategy Plus, Cindy Yans greatly disliked Shannaras role-playing mechanics, and wrote that "you really want to avoid combat at all costs." However, she praised its puzzles, characters and story, and believed that "most Legend fans" would enjoy the game if they played it as a graphic adventure.
Computer Game Review described it as "a solid story from fantasymeister Brooks", and "an adventure game that will appeal to everyone's tastes and pocketbooks.
References
External links
Official website via Internet Archive
1995 video games
Adventure games
DOS games
Legend Entertainment games
Point-and-click adventure games
Shannara
Single-player video games
Video games based on novels
Video games developed in the United States
Video games scored by George Sanger
Windows games
|
https://en.wikipedia.org/wiki/Generalization%20error
|
For supervised learning applications in machine learning and statistical learning theory, generalization error (also known as the out-of-sample error or the risk) is a measure of how accurately an algorithm is able to predict outcome values for previously unseen data. Because learning algorithms are evaluated on finite samples, the evaluation of a learning algorithm may be sensitive to sampling error. As a result, measurements of prediction error on the current data may not provide much information about predictive ability on new data. Generalization error can be minimized by avoiding overfitting in the learning algorithm. The performance of a machine learning algorithm is visualized by plots that show values of estimates of the generalization error through the learning process, which are called learning curves.
Definition
In a learning problem, the goal is to develop a function that predicts output values for each input datum . The subscript indicates that the function is developed based on a data set of data points. The generalization error or expected loss or risk of a particular function over all possible values of and is the expected value of the loss function :
where is the unknown joint probability distribution for and .
Without knowing the joint probability distribution , it is impossible to compute . Instead, we can compute the error on sample data, which is called empirical error (or empirical risk). Given data points, the empirical error of a candidate function is:
An algorithm is said to generalize if:
Of particular importance is the generalization error of the data-dependent function that is found by a learning algorithm based on the sample. Again, for an unknown probability distribution, cannot be computed. Instead, the aim of many problems in statistical learning theory is to bound or characterize the difference of the generalization error and the empirical error in probability:
That is, the goal is to characterize the probability that the generalization error is less than the empirical error plus some error bound (generally dependent on and ).
For many types of algorithms, it has been shown that an algorithm has generalization bounds if it meets certain stability criteria. Specifically, if an algorithm is symmetric (the order of inputs does not affect the result), has bounded loss and meets two stability conditions, it will generalize. The first stability condition, leave-one-out cross-validation stability, says that to be stable, the prediction error for each data point when leave-one-out cross validation is used must converge to zero as . The second condition, expected-to-leave-one-out error stability (also known as hypothesis stability if operating in the norm) is met if the prediction on a left-out datapoint does not change when a single data point is removed from the training dataset.
These conditions can be formalized as:
Leave-one-out cross-validation Stability
An algorithm has stability if f
|
https://en.wikipedia.org/wiki/Octafluoropropane%20%28data%20page%29
|
This page provides supplementary chemical data on octafluoropropane.
Material Safety Data Sheet
The handling of this chemical may incur notable safety precautions. It is highly recommend that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source such as SIRI, and follow its directions.
SDSdata.org index
Structure and properties
Thermodynamic properties
Spectral data
References
Chemical data pages
Chemical data pages cleanup
|
https://en.wikipedia.org/wiki/Neural%20gas
|
Neural gas is an artificial neural network, inspired by the self-organizing map and introduced in 1991 by Thomas Martinetz and Klaus Schulten. The neural gas is a simple algorithm for finding optimal data representations based on feature vectors. The algorithm was coined "neural gas" because of the dynamics of the feature vectors during the adaptation process, which distribute themselves like a gas within the data space. It is applied where data compression or vector quantization is an issue, for example speech recognition, image processing or pattern recognition. As a robustly converging alternative to the k-means clustering it is also used for cluster analysis.
Algorithm
Given a probability distribution of data vectors and a finite number of feature vectors .
With each time step , a data vector randomly chosen from is presented. Subsequently, the distance order of the feature vectors to the given data vector is determined. Let denote the index of the closest feature vector, the index of the second closest feature vector, and the index of the feature vector most distant to . Then each feature vector is adapted according to
with as the adaptation step size and as the so-called neighborhood range. and are reduced with increasing . After sufficiently many adaptation steps the feature vectors cover the data space with minimum representation error.
The adaptation step of the neural gas can be interpreted as gradient descent on a cost function. By adapting not only the closest feature vector but all of them with a step size decreasing with increasing distance order, compared to (online) k-means clustering a much more robust convergence of the algorithm can be achieved. The neural gas model does not delete a node and also does not create new nodes.
Variants
A number of variants of the neural gas algorithm exists in the literature so as to mitigate some of its shortcomings. More notable is perhaps Bernd Fritzke's growing neural gas, but also one should mention further elaborations such as the Growing When Required network and also the incremental growing neural gas. A performance-oriented approach that avoids the risk of overfitting is the Plastic Neural gas model.
Growing neural gas
Fritzke describes the growing neural gas (GNG) as an incremental network model that learns topological relations by using a "Hebb-like learning rule", only, unlike the neural gas, it has no parameters that change over time and it is capable of continuous learning, i.e. learning on data streams. GNG has been widely used in several domains, demonstrating its capabilities for clustering data incrementally. The GNG is initialized with two randomly positioned nodes which are initially connected with a zero age edge and whose errors are set to 0. Since the in the GNG input data is presented sequentially one by one, the following steps are followed at each iteration:
It is calculated the errors (distances) between the two closest nodes to the current input d
|
https://en.wikipedia.org/wiki/National%20Computing%20Centre
|
The National Computing Centre (NCC) was an independent not-for-profit membership and research organisation in the United Kingdom.
After the original organisation was liquidated in 2010, Redholt Limited changed its name to the National Computing Centre Limited (NCC Ltd) and acquired the assets of the original NCC through a pre-pack administration arrangement. This new for-profit company, formed in 2010, initially offered some of the same services as the original NCC but in 2012 became a shell company as it had to file for protection from its creditors and make most of its staff redundant.
Formation and early years
The National Computing Centre was founded on 10 June 1966 by the Labour government, as an autonomous not-for-profit organisation, in order to be the "voice of the computer user", encourage the growth of computer usage in the UK and ensure that the necessary education and training was made available. NCC was one of the visible outcomes from Harold Wilson's "White Heat of Technology" speech and the formation of a Ministry of Technology, the others being the computer company International Computers Limited (ICL) and chip maker Inmos (both now defunct).
Initially, most income came directly from government grants, but with the growth of NCC's commercial operations this ceased in 1989. During the 1970s and 1980s NCC had a joint venture with Blackwell Publishing (NCC Blackwell) which was a significant publisher of academic computing books.
Between 1989 and 1996 NCC operated with five main divisions – education, consulting, escrow, membership services, and system engineering deriving income from membership fees and its commercial activities.
A valued component was the Computer Validation Service, which ran Validation testing for Fortran 77 and Pascal. These validation tests were issued in accordance with a reciprocal agreement with General Services Administration in the United States.
NCC Education
In 1996, the National Computing Centre sold its overseas education business, NCC Education, to stave off a financial crisis that occurred when the company breached its borrowing limits.
MBO, NCC Services Ltd and NCC Group plc
In 1999, it sold its commercial divisions (turnover of less than £10 million), which provided escrow, consultancy, system engineering services to its existing management team supported by ECI Ventures for £5 million. This new company was named NCC Services Limited and later became NCC Group Limited of which the National Computing Centre held a 20% share. John Perkins became the new managing director of National Computing Centre, which remained a not-for-profit membership organisation.
The NCC Services Ltd management team of Managing Director Chris Pearse and directors John Morris, Peter Bird, and Chris Sadler was strengthened in March 2000 by the appointment of Rob Cotton as Finance Director and who also took over control of the Escrow division in May of that year, with Morris leaving at that time. Following a substantia
|
https://en.wikipedia.org/wiki/Thinking%20in%20Java
|
Thinking in Java () is a book about the Java programming language, written by Bruce Eckel and first published in 1998. Prentice Hall published the 4th edition of the work in 2006. The book represents a print version of Eckel’s “Hands-on Java” seminar.
Bruce Eckel wrote “On Java8” as a sequel for Thinking in Java and it is available in Google Play as an ebook.
Publishing history
Eckel has made various versions of the book publicly available online.
Reception
Tech Republic says:
"The particularly cool thing about Thinking in Java is that even though a large amount of information is covered at a rapid pace, it is somehow all easily absorbed and understood. This is a testament to both Eckel’s obvious mastery of the subject and his skilled writing style."
Linux Weekly News praised the book in its review.
CodeSpot says:
"Thinking in Java is a must-read book, especially if you want to do programming in Java programing language or learn Object-Oriented Programming (OOP)."
Awards
Thinking in Java has won multiple awards from professional journals:
1998 Java Developers Journal Editors Choice Award for Best Book
Jolt Productivity Award, 1999
2000 JavaWorld Readers Choice Award for Best Book
2001 JavaWorld Editors Choice Award for Best Book
2003 Software Development Magazine Jolt Award for Best Book
2003 Java Developers Journal Readers Choice Award for Best Book
2007 Java Developer’s Journal Readers’ Choice Best Book
External links
Official site
References
Computer programming books
Java (programming language)
|
https://en.wikipedia.org/wiki/Inman%20Harvey
|
Inman Harvey is a former senior lecturer in computer science and artificial intelligence at the University of Sussex; he is now a visiting senior research fellow at the same university. His research interests largely centre on the development of artificial evolution as an approach to the design of complex systems. Application domains of interest include evolutionary robotics, evolvable hardware, molecules for pharmaceutical purposes.
Together with other Sussex faculty, mainly from the School of Cognitive and Computer Sciences (COGS), he developed the MSc program on Evolutionary and Adaptive Systems (EASy), which was active in the 1990s and 2000s, attracting dozens of students that have contributed to artificial life, evolutionary robotics, cognitive science and other disciplines.
Harvey's other interests include philosophical approaches to AI and artificial life (a non-representational, dynamical systems approach); passive dynamic walking; and Gaia theory. He originally started as a mathematician and philosopher at Cambridge University.
The article "Evolving a Conscious Machine" in the June 1998 issue of Discover magazine (pp. 72–79) overviews Harvey's and Adrian Thompson's work with evolving an FPGA program to recognize tones.
References
External links
Inman Harvey
Year of birth missing (living people)
Living people
People educated at Clifton College
British computer scientists
Academics of the University of Sussex
Researchers of artificial life
|
https://en.wikipedia.org/wiki/Phil%20Husbands
|
Phil Husbands (born 27 June, 1961) is a professor of computer science and artificial intelligence at the English University of Sussex, situated next to the East Sussex village of Falmer, within the city of Brighton and Hove. He is head of the Evolutionary and Adaptive Systems group and co-director of the Centre for Computational Neuroscience and Robotics (CCNR). Husbands is also one of the founders of the field of evolutionary robotics.
His research interests are in long-term investigations of artificial evolution of nervous systems for robots, with emphasis on:
visually guided robots acting in the real world
theoretical and practical development of advanced evolutionary algorithms for hard engineering and design optimisation problems
development of biologically inspired artificial neural networks incorporating diffusible modulators
computational neuroscience
computer manipulation of sound and image
history and philosophy of AI
swarm intelligence
machine learning.
Husbands has edited several books, including coediting The Mechanical Mind in History (MIT Press; 2008; ) as well as author of numerous scientific articles. With neuroscientist Michael O'Shea he introduced the idea of GasNets artificial neural networks that use diffusing virtual gases as modulators. These are inspired by nitric oxide (NO) volume signalling in real brains. The Sussex team has also done pioneering work on detailed computational modelling of nitric oxide diffusion in the nervous system.
See also
List of computer scientists
External links
Phil Husbands
Centre for Computational Neuroscience and Robotics (CCNR)
New Scientist article on pioneering evolutionary robotics research by Husbands, Harvey and Cliff
New Scientist article on Husbands' and O'Shea's introduction of the idea of GasNets
Books by Phil Husbands in Google Book Search
Place of birth missing (living people)
1961 births
20th-century British scientists
21st-century scientists
Academics of the University of Sussex
Artificial intelligence researchers
English computer scientists
English book editors
Living people
Researchers of artificial life
|
https://en.wikipedia.org/wiki/Route%20reestablishment%20notification
|
Route Reestablishment Notification (RRN) is a type of notification that is used in some communications protocols that use time-division multiplexing.
Network protocols
|
https://en.wikipedia.org/wiki/Frankie%20Goes%20to%20Hollywood%20%28video%20game%29
|
Frankie Goes to Hollywood is a computer game that was developed by Denton Designs and published by Ocean Software Ltd in 1985 for the Commodore 64, Amstrad CPC and ZX Spectrum home computers. The game is based on the music of UK band Frankie Goes to Hollywood.
Objective
The game puts the player in Liverpool in search of the Pleasuredome. The player has to find and use various objects and play minigames to reach the goal. The player starts the game as a simple character, to reach the Pleasuredome one has to become a full person. To become a full person, the four attributes (sex, war, love and faith) must be filled to 99%. The attributes are boosted by completing tasks in the game. Additional pleasure points can be scored by playing the minigames. The four attributes are part of the symbols used on the covers of Frankie Goes to Hollywood's albums.
During the game, a murder takes place. All the rooms the player can visit contain clues in order to find the murderer. The clues are in pairs, helping eliminate suspects. For example, the player may be told "The killer is an atheist" and "Mr Somebody is a regular church-goer" - so Mr Somebody would be innocent. In theory, the game cannot be completed without making the correct accusation (by returning to the room with the body) - there is a large bonus of Pleasure Points for naming the killer.
List of minigames
Sea of Holes
The Terminal Room
Cybernetic Breakout
Cupid's Arrows
Raid Over Merseyside
Talking Heads
Shooting Gallery
War Room
Flower Power
ZTT Room
Development
The game was developed by Denton Designs and the game was based on the engine for Gift from the Gods.
Music
Certain versions of the game feature chiptune versions of the band's songs such as "Relax" and "Welcome to the Pleasuredome". The ZX Spectrum version features an adaptation of "Two Tribes" as the title music. The game package also included a live version of "Relax" on tape cassette.
Reception
Roy Wagner reviewed the game for Computer Gaming World, and stated that "The graphics and game play are well done. I think you will find it an interesting game."
In 1991, Your Sinclair included the game at number 71 in their list of the Top 100 Best Spectrum Games of All Time. In 1993, Commodore Force ranked the game at number one on its list of the top 100 Commodore 64 games.
Sex/Pleasure/Lust
The first icon, represented by two sperm in a yin yang image, is variously described as either Sex, Lust or Pleasure. The game inlay refers to the icon as Pleasure, the music press usually referred to it as Sex, and some computer magazines occasionally used the term Lust instead.
References
External links
Images of Commodore 64 version of Frankie Goes To Hollywood box and manual at C64Sets.com
Frankie Goes to Hollywood at GameFAQs
Frankie Goes to Hollywood retrospective at Rock, Paper, Shotgun
https://web.archive.org/web/20110114183532/http://www.popmatters.com/pm/column/134877-frankie-goes-to-hollywood-commodore-64-ocean-software-1985/ at Po
|
https://en.wikipedia.org/wiki/ThinkLight
|
ThinkLight was a keyboard light present on many older ThinkPad families of notebook computers.
The series was originally designed by IBM, and then developed and produced by Lenovo since 2005. The ThinkLight has been replaced by a backlight keyboard on later generations of ThinkPads, and Lenovo has discontinued the ThinkLight in 2013.
Description
A white or amber LED (depending on model) is located on the top edge of the display, illuminating the keyboard to allow use in low-light conditions. It is activated with the key combination Fn-PgUp (the bottom left and top right keys of the keyboard). Later ThinkPads use the combination Fn-Space instead. Lenovo later started to include backlit keyboards, and some models included both the ThinkLight and a backlit keyboard. For those models, the Fn-Space shortcut is also used in conjunction to control a backlit keyboard (if the laptop has it). The on-screen display of ThinkPad computers will display a light on and a light off indicator. The ThinkLight can be activated when the monitor is on or off but not while the computer is off.
Some ThinkPads, like the Z and R series (though not all - some R61 and R32 models still have the white light) feature an amber LED due to the lower cost, while other models, like the T series, use a white LED (which is generally preferred).
The G series and SL series omit the ThinkLight.
A few ThinkPads (17" W700 and W701) have featured the ThinkLight with dual white LEDs.
Alternatives
The HP EliteBook series notebooks contain a similar keyboard light called HP Night Light. Unlike the ThinkLight, it is activated by a physical button next to the Night Light, rather than a keyboard shortcut. Third-parties offered external LED-based illumination solutions for the HP 200LX series of DOS palmtop computers in the late 1990s.
The Dell Latitude ATG series laptops have also contained a pair of red LEDs which are controlled in a very similar way to the IBM ThinkLight and also serve to illuminate the keyboard.
Some computer manufacturers have opted for backlit keyboards instead of illuminating the keyboard from above; but some ThinkPads included both the ThinkLight and a backlit keyboard (for example, T530, T430 and X230 models).
See also
Selective yellow
References
External links
IBM UK ThinkPad Designs
ThinkLight on ThinkWiki — section listing ThinkPad models that feature the ThinkLight
Thinklight
|
https://en.wikipedia.org/wiki/Modified%20Huffman%20coding
|
Modified Huffman coding is used in fax machines to encode black-on-white images (bitmaps). It combines the variable-length codes of Huffman coding with the coding of repetitive data in run-length encoding.
The basic Huffman coding provides a way to compress files that have much repeating data, like a file containing text, where the alphabet letters are the repeating objects. However, a single scan line contains only two kinds of elements white pixels and black pixels which can be represented directly as a 0 and 1. This "alphabet" of only two symbols is too small to directly apply the Huffman coding. But if we first use run-length encoding, we can have more objects to encode. Here is an example taken from the article on run-length encoding:
A hypothetical scan line, with B representing a black pixel and W representing white, might read as follows:
WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW
With a run-length encoding (RLE) data compression algorithm applied to the above hypothetical scan line, it can be rendered as follows:
12W1B12W3B24W1B14W
Here we see that we have, in addition to the two items "white" and "black", several different numbers. These numbers provide plenty of additional items to use, so the Huffman coding can be directly applied to the sequence above to reduce the size even more.
See also
Fax compression
External links
Lossless compression algorithms
|
https://en.wikipedia.org/wiki/IBM%20System%20z9
|
IBM System z9 is a line of IBM mainframe computers. The first models were available on September 16, 2005. The System z9 also marks the end of the previously used eServer zSeries naming convention. It was also the last mainframe computer that NASA ever used.
Background
System z9 is a mainframe using the z/Architecture, previously known as ESAME. z/Architecture is a 64-bit architecture which replaces the previous 31-bit-addressing/32-bit-data ESA/390 architecture while remaining completely compatible with it as well as the older 24-bit-addressing/32-bit-data System/360 architecture. The primary advantage of this arrangement is that memory intensive applications like DB2 are no longer bounded by 31-bit memory restrictions while older applications can run without modifications.
Name change
With the announcement of the System z9 Business Class server, IBM has renamed the System z9 109 as the System z9 Enterprise Class server. IBM documentation abbreviates them as the z9 BC and z9 EC, respectively.
Notable differences
There are several functional enhancements in the System z9 compared to its zSeries predecessors. Some of the differences include:
Support Element & HMC
The Support Element is the most direct and lowest level way to access a mainframe. It circumvents even the Hardware Management Console and the operating system running on the mainframe. The HMC is a PC connected to the mainframe and emulates the Support Element. All preceding zSeries mainframes used a modified version of OS/2 with custom software to provide the interface. System z9's HMC no longer uses OS/2, but instead uses a modified version of Linux with an OS/2 lookalike interface to ease transition as well as a new interface. Unlike the previous HMC application on OS/2, the new HMC is web-based which means that even local access is done via a web browser. Remote HMC access is available, although only over an SSL encrypted HTTP connection. The web-based nature means that there is no longer a difference between local console access and remote access, which means a remote user potentially has full control if authorized, allowing more flexibility for locating systems within data centers. IBM refers to the new HMC as a "closed platform" which does not allow the user to install software or access the command line interface to increase security and stability. The HMC is also firewalled by default with a minimal number of open ports for remote access.
Program Directed Re-IPL
Program Directed Re-IPL is a new feature for Linux on System z9. It allows Linux systems running in an LPAR to re-IPL (reboot) themselves without operator intervention. This is accomplished by the System z9 storing the device and load parameters used to initially IPL the system.
DB2 and VSAM features
DB2, VSAM, and other data storage formats achieve greater I/O performance thanks to a new System z9 feature called a MIDAW. Also, the System z9 introduces the , a new type of processor that accelerates certa
|
https://en.wikipedia.org/wiki/Tuxissa
|
Tuxissa is a fictional computer virus hoax made up by Humorix, a humor website on Linux.
Although the website states that all articles there are fake, anti-virus software makers such as Symantec, Sophos and F-Secure had pages for the Tuxissa virus hoax.
Hoax
The virus is based on the Melissa virus, with its aim to install Linux onto the victim's computer without the owner's notice. It is spread via e-mail, contained within a message titled "Important Message About Windows Security". It first spreads the virus to other computers, then it downloads a stripped-down version of Slackware, and uncompresses it onto the hard disk. The Windows Registry is finally deleted, and the boot options changed. There the virus destroys itself when it reboots the computer at the end, with the user facing the Linux login prompt.
See also
List of computer virus hoaxes
Footnotes
External links
Symantec's security response to the virus
Sophos' virus info on Tuxissa
Humorix's article, where the joke first started
F-Secure anti-virus software program's page about the Tuxissa virus
Virus hoaxes
Fictional computer viruses
|
https://en.wikipedia.org/wiki/Modular%20Approach%20to%20Software%20Construction%20Operation%20and%20Test
|
The Modular Approach to Software Construction Operation and Test (MASCOT) is a software engineering methodology developed under the auspices of the United Kingdom Ministry of Defence starting in the early 1970s at the Royal Radar Establishment and continuing its evolution over the next twenty years. The co-originators of MASCOT were Hugo Simpson and Ken Jackson (currently with Telelogic).
Where most methodologies tend to concentrate on bringing rigour and structure to a software project's functional aspects, MASCOT's primary purpose is to emphasise the architectural aspects of a project. Its creators purposely avoided saying anything about the functionality of the software being developed, and concentrated on the real-time control and interface definitions between concurrently running processes.
MASCOT was successfully used in a number of defence systems, most notably the Rapier ground-to-air missile system of the British Army. Although still in use on systems in the field, it never reached critical success and has been subsequently overshadowed by object oriented design methodologies based on UML.
A British Standards Institution (BSI) standard was drafted for version 3 of the methodology, but was never ratified. Copies of the draft standard can be still obtained from the BSI.
MASCOT in the field
The UK Ministry of Defence has been the primary user of the MASCOT method through its application in significant military systems, and at one stage mandated its use for new operational systems. Examples include the Rapier missile system, and various Royal Navy Command & Control Systems.
The Future of the Method
MASCOT's principles continue to evolve in the academic community (principally at the DCSC) and the aerospace industry Matra BAe Dynamics, through research into temporal aspects of software design and the expression of system architectures, most notably in the DORIS (Data-Oriented Requirements Implementation Scheme) method and implementation protocols. Work has also included combining UML and DORIS to provide a richer means of describing complex real-time systems (Computer Science Research Institute).
References
MASCOT - A Modular Approach to Software Construction Operation and Test, Royal Radar Establishment, RRE Technical Note No 778, October 1975
Simpson, H. 1986. The Mascot method. Softw. Eng. J. 1, 3 (May 1986), 103-120. ISSN 0268-6961
DD 196:1991; Guide for a modular approach to software construction, operation and test (MASCOT), British Standards Institute
Simpson, H. 1994. Architecture for Computer Based Systems. IEEE Workshop on the Engineering of Computer Based Systems, 1994.
Hull MEC, Ewart S, Millar RJ, Hanna JRP. March 2004. Modeling Complex Real-Time and Embedded Systems - The UML and DORIS Combination, Real-Time Systems, Vol. 26, No. 2, 135-159, ISSN 0922-6443
External links
The Official Handbook of Mascot : Version 3.1 : June 1987
Software development process
|
https://en.wikipedia.org/wiki/Data%20assimilation
|
Data assimilation is a mathematical discipline that seeks to optimally combine theory (usually in the form of a numerical model) with observations. There may be a number of different goals sought – for example, to determine the optimal state estimate of a system, to determine initial conditions for a numerical forecast model, to interpolate sparse observation data using (e.g. physical) knowledge of the system being observed, to set numerical parameters based on training a model from observed data. Depending on the goal, different solution methods may be used. Data assimilation is distinguished from other forms of machine learning, image analysis, and statistical methods in that it utilizes a dynamical model of the system being analyzed.
Data assimilation initially developed in the field of numerical weather prediction. Numerical weather prediction models are equations describing the dynamical behavior of the atmosphere, typically coded into a computer program. In order to use these models to make forecasts, initial conditions are needed for the model that closely resemble the current state of the atmosphere. Simply inserting point-wise measurements into the numerical models did not provide a satisfactory solution. Real world measurements contain errors both due to the quality of the instrument and how accurately the position of the measurement is known. These errors can cause instabilities in the models that eliminate any level of skill in a forecast. Thus, more sophisticated methods were needed in order to initialize a model using all available data while making sure to maintain stability in the numerical model. Such data typically includes the measurements as well as a previous forecast valid at the same time the measurements are made. If applied iteratively, this process begins to accumulate information from past observations into all subsequent forecasts.
Because data assimilation developed out of the field of numerical weather prediction, it initially gained popularity amongst the geosciences. In fact, one of the most cited publication in all of the geosciences is an application of data assimilation to reconstruct the observed history of the atmosphere.
Details of the data assimilation process
Classically, data assimilation has been applied to chaotic dynamical systems that are too difficult to predict using simple extrapolation methods. The cause of this difficulty is that small changes in initial conditions can lead to large changes in prediction accuracy. This is sometimes known as the butterfly effect – the sensitive dependence on initial conditions in which a small change in one state of a deterministic nonlinear system can result in large differences in a later state.
At any update time, data assimilation usually takes a forecast (also known as the first guess, or background information) and applies a correction to the forecast based on a set of observed data and estimated errors that are present in both the observations and the f
|
https://en.wikipedia.org/wiki/Cornerstone%20Television
|
The Cornerstone Television Network is a non-commercial Christian broadcast and satellite television network based in Wall, Pennsylvania, United States. Its founder was Russ Bixler. The network has 44 full-power and 57 low-power affiliate stations, 1 online affiliate station, and it is on the Glorystar satellite service.
History
In the late 1970s, Norma Bixler claimed to have received a vision from God while visiting the Christian Broadcasting Network's headquarters in Virginia Beach, Virginia, to launch a Christian television station in Pittsburgh. Though her husband Russ was wary of the numerous hurdles to overcome to launch a full-power television station, he eventually was convinced to share in his wife's dream and pursue the vision. With the assistance of CBN's Pat Robertson, along with Loren Cunningham, and Jim Bakker, they were able to navigate the build-out and licensing issues, then pursued professional talent such as Bill Freeman, Oleen Eagle, Stan Scott, and Eleanor Clarke, and numerous volunteers to launch Christian television in Pittsburgh.
WPCB-TV, the network's first station, launched on April 15, 1979, Easter Sunday. Through the years, it purchased and launched other stations throughout Pennsylvania and Ohio before the cable and satellite age in the 90s allowed it to expand nationwide, then with the launch of the Internet, beyond the United States.
Programming
Cornerstone Television Network broadcasts 24 hours a day, 7 days a week. Programming includes preachers, teachers, international leaders, movies, documentaries, music, and holiday specials for people of all ages.
Other notable programming includes Origins, a program on creation science and the argument against commonly accepted scientific principles; the show presents scientific evidence supporting Young Earth creationism.
List of affiliates
References
External links
CTVN official site
trueGODtv Affiliate
Lists of American television network affiliates
Companies based in Allegheny County, Pennsylvania
Evangelical television networks
Television channels and stations established in 1979
1979 establishments in Pennsylvania
|
https://en.wikipedia.org/wiki/Ely%E2%80%93Peterborough%20line
|
The Ely–Peterborough line is a railway line in England, linking East Anglia to the Midlands. It is a part of the Network Rail Strategic Route 5, SRS 05.07 and is classified as a secondary line. It is used by a variety of inter-regional and local passenger services from East Anglia to the West Midlands and North West, as well as freight and infrastructure traffic; it also links with the busy East Coast Main Line at its western end. Fenland District council (the area's primary local authority) put forward their Rail Development Strategy for the route in 2012, which includes infrastructure upgrades for the intermediate stations, improved frequencies for the services using it (e.g. doubling the Birmingham New Street to Stansted Airport service to half-hourly and the Ipswich to Peterborough service to hourly) and establishing a Community Rail Partnership for the line in 2013–14.
History
The line was originally opened by the Eastern Counties Railway company in 1847, linking the ECR mainline from London via and Ely to and with Peterborough. Trains initially terminated and started from , though a link to the Great Northern Railway's station was subsequently built to allow through running to the Midland Railway line to and the GNR main line to the north. Onward travel was also possible over two London and North Western Railway lines from Peterborough, to and whilst March would soon become a very busy junction with the opening of branches to via Wisbech and Cambridge via St Ives (both by the ECR) in 1847–48 and the GNR route to in 1867. The latter two were subsequently jointly vested in the GER and GNR in 1879.
Many of the branches fell victim to the Beeching Axe in the early to mid 1960s, as did Peterborough East and several of the intermediate stations. The March–Spalding line also closed in 1982 with the rundown of the marshalling yard at Whitemoor, leaving only the original main line in operation.
Service
Passenger services are provided by CrossCountry, East Midlands Railway and Greater Anglia. To the west most trains continue beyond Peterborough to either Leicester and Birmingham New Street (via the Birmingham–Peterborough line), or to Nottingham, Sheffield, Manchester Piccadilly and . To the east most trains continue beyond Ely to Norwich or to Cambridge and Stansted Airport (joining in one direction or in the other the Cambridge–Norwich "Breckland" line) or to . Connections are available for stations to at Ely. Services used to run between London and Peterborough but these services were dropped in 2010.
The line is used extensively by freight trains from the Port of Felixstowe to the West Midlands, North West and Scotland, as it forms part of the Felixstowe to rail freight corridor that is being upgraded by Network Rail to allow more railborne freight from the port to be diverted away from the London area.
Infrastructure
The line is double track throughout, has a loading gauge of W10 and a line speed of . Apart from short stret
|
https://en.wikipedia.org/wiki/Mike%27s%20New%20Car
|
Mike's New Car is a 2002 American computer-animated comedy short film, starring the protagonists from Monsters, Inc., Mike Wazowski and James P. "Sulley" Sullivan. Directed by Pete Docter and Roger L. Gould, it is the first Pixar short to use dialogue and the first to take characters and situations from a previously established work.
The short premiered on September 17, 2002, and was included in the DVD and VHS release of Monsters, Inc. It was nominated for a 2002 Academy Award for Best Animated Short Film.
Plot
Mike gets a new six-wheel drive car and happily insists on showing it off to Sulley. While Sulley is confused about what happened to Mike's old car, Mike is excited to drive his new car. Unfortunately for Mike, anything that can go wrong does go wrong.
Once inside the car, Sulley plays with the adjustable power seat until an annoyed Mike snaps at him to stop. Mike starts the engine, then hears the seatbelt reminder sound chiming. Although Sulley gets his seatbelt on easily, Mike finds his stuck and accidentally falls and locks himself out of the car while attempting to unstick it. Mike instructs Sulley to push the door unlock button so he can get back in, but Sulley, confused by the massive amount of buttons on the dashboard, pushes the one that opens the hood instead. Mike tries to close it, but Sulley, in an attempt to help, accidentally shuts it on Mike's fingers, causing him to scream in pain. Sulley helps Mike get free by pushing the button again, but Mike flies onto the engine motors and gets trapped inside the engine compartment after the hood closes. Mike calls Sulley on his cell phone to open the hood again, allowing Mike to escape and close the hood.
When Mike reenters the car, he is annoyed by the continuous seatbelt reminder tone still chiming. Mike manages to put his seatbelt on, but the windshield wipers randomly turn on, annoying him even more. As Sulley tries to help, Mike quickly tells him not to touch anything and decides to do it himself. However, Mike pushes a button that loudly plays Latin music on the car's stereo system and pushes more buttons that launches the entire car into chaotic malfunction.
After a while, Mike ends the chaos by pulling the key out of the ignition. When Sulley accidentally breaks the rearview mirror in an attempt to realign it, Mike finally reaches his breaking point and forces him out of the car before speeding away, resulting in the car's destruction. Sulley then comments that the airbag didn't go off, but it does immediately burst afterwards, sending Mike flying. After Sulley catches him, Mike admits that he misses his old car. During the credits, Mike reminisces about his old car before agreeing to walk to work with Sulley.
Voice cast
Billy Crystal as Michael "Mike" Wazowski
John Goodman as James P. "Sulley" Sullivan
Home media
Mike's New Car was released on September 17, 2002, attached as a bonus feature on the Monsters, Inc. DVD and VHS release. The DVD release features commenta
|
https://en.wikipedia.org/wiki/Western%20Latin%20character%20sets
|
The term Western Latin character sets may refer to:
Western Latin character sets (computing), the binary representation of characters
In typography, the repertoire of letters, numbers and symbols that is typical of each of the languages
|
https://en.wikipedia.org/wiki/The%20Omega%20Directive
|
"The Omega Directive" is the 89th episode of the American science fiction television series Star Trek: Voyager airing on the UPN network. It is the 21st episode of the fourth season.
In this episode, Captain Janeway must undergo a top secret mission to destroy a molecule called an "Omega Particle" that the Federation has deemed too dangerous to be allowed to exist.
Plot
Voyager is suddenly rocked by a distant explosion. Although ship systems appear undamaged, all information and control screens are suddenly locked and display an ominous omega symbol. Captain Janeway arrives on the bridge and instructs the crew not to worry. She orders the ship's computer to override the lockout and transfer all sensor data to her ready room, but leaves without explaining to her bemused crew what happened. After locking herself in her office she asks the computer to brief her on the detection of an object referred to as “Omega.” Janeway also summons Seven of Nine, an ex-Borg member of the crew, to her ready room, as the Borg have their own knowledge of “Omega.”
Because Voyager has been separated from Starfleet, the Omega Team (a specially trained group which would normally be tasked with handling situations involving "Omega") cannot be brought in to deal with the problem. Janeway decides to break the code of silence involving the symbol and share information with her senior officers. She announces that a molecule hazardous to relativistic space travel, the Omega Particle, has been detected and she intends to follow the “Omega Directive,” an order that requires Starfleet captains to destroy Omega at all costs—even the Prime Directive is null and void under such circumstances. As Janeway explains, Omega is unstable and even the explosion of one particle out in space can nullify subspace for many light years around it, rendering faster-than-light travel impossible within that area.
Moving to the coordinates of the explosion they encounter the planet and its resident alien race that created it. The society is on the brink of economic failure and is making Omega particles to “give their children a chance at a future.” Seven of Nine displays an interest in the scientists' methods, however, hoping to save the Omega particles and harness them because she believes them to be perfection—infinite parts working together as one (like the Borg)—despite ample Starfleet and Borg evidence of their incredible danger: The Borg, referring to the Omega particle as “Particle 010,” are expected to assimilate it at all costs, even though they have experienced the loss of a large quantity of Borg vessels to Omega particle explosions while trying to harness the power of the substance. Seven notes, furthermore, that the ability to harness Omega would make the Borg a nigh-unstoppable force; this remark only strengthens the urgency and motivates Janeway to wipe out all Omega particles, at any cost, as determined by the Omega Directive.
Eventually and through a series of issues and diffi
|
https://en.wikipedia.org/wiki/Goldwasser%E2%80%93Micali%20cryptosystem
|
The Goldwasser–Micali (GM) cryptosystem is an asymmetric key encryption algorithm developed by Shafi Goldwasser and Silvio Micali in 1982. GM has the distinction of being the first probabilistic public-key encryption scheme which is provably secure under standard cryptographic assumptions. However, it is not an efficient cryptosystem, as ciphertexts may be several hundred times larger than the initial plaintext. To prove the security properties of the cryptosystem, Goldwasser and Micali proposed the widely used definition of semantic security.
Basis
The GM cryptosystem is semantically secure based on the assumed intractability of the quadratic residuosity problem modulo a composite N = pq where p, q are large primes. This assumption states that given (x, N) it is difficult to determine whether x is a quadratic residue modulo N (i.e., x = y2 mod N for some y), when the Jacobi symbol for x is +1. The quadratic residue problem is easily solved given the factorization of N, while new quadratic residues may be generated by any party, even without knowledge of this factorization. The GM cryptosystem leverages this asymmetry by encrypting individual plaintext bits as either random quadratic residues or non-residues modulo N, all with quadratic residue symbol +1. Recipients use the factorization of N as a secret key, and decrypt the message by testing the quadratic residuosity of the received ciphertext values.
Because Goldwasser–Micali produces a value of size approximately |N| to encrypt every single bit of a plaintext, GM encryption results in substantial ciphertext expansion. To prevent factorization attacks, it is recommended that |N| be several hundred bits or more. Thus, the scheme serves mainly as a proof of concept, and more efficient provably-secure schemes such as ElGamal have been developed since.
Because encryption is performed using a probabilistic algorithm, a given plaintext may produce very different ciphertexts each time it is encrypted. This has significant advantages, as it prevents an adversary from recognizing intercepted messages by comparing them to a dictionary of known ciphertexts.
Scheme definition
Goldwasser–Micali consists of three algorithms: a probabilistic key generation algorithm which produces a public and a private key, a probabilistic encryption algorithm, and a deterministic decryption algorithm.
The scheme relies on deciding whether a given value x is a square mod N, given the factorization (p, q) of N. This can be accomplished using the following procedure:
Compute xp = x mod p, xq = x mod q.
If and , then x is a quadratic residue mod N.
Key generation
The modulus used in GM encryption is generated in the same manner as in the RSA cryptosystem. (See RSA, key generation for details.)
Alice generates two distinct large prime numbers p and q, randomly and independently of each other.
Alice computes N = p q.
She then finds some non-residue x such that the Legendre symbols satisfy and hence th
|
https://en.wikipedia.org/wiki/Continuous%20Data%20Protection
|
Continuous data protection (CDP), also called continuous backup or real-time backup, refers to backup of computer data by automatically saving a copy of every change made to that data, essentially capturing every version of the data that the user saves. In its true form it allows the user or administrator to restore data to any point in time. The technique was patented by British entrepreneur Pete Malcolm in 1989 as "a backup system in which a copy [editor's emphasis] of every change made to a storage medium is recorded as the change occurs [editor's emphasis]."
In an ideal case of continuous data protection, the recovery point objective—"the maximum targeted period in which data (transactions) might be lost from an IT service due to a major incident"—is zero, even though the recovery time objective—"the targeted duration of time and a service level within which a business process must be restored after a disaster (or disruption) in order to avoid unacceptable consequences associated with a break in business continuity"—is not zero. An example of a period in which data transactions might be lost is a major discount chain having card readers at its checkout counters shut down at multiple locations for close to two hours in the month of June 2019.
CDP runs as a service that captures changes to data to a separate storage location. There are multiple methods for capturing continuous live data changes involving different technologies that serve different needs. True CDP-based solutions can provide fine granularities of restorable objects ranging from crash-consistent images to logical objects such as files, mail boxes, messages, and database files and logs. This isn't necessarily true of near-CDP solutions.
Differences from traditional backup
True continuous data protection is different from traditional backup in that it is not necessary to specify the point in time to recover from until ready to restore. Traditional backups only restore data from the time the backup was made. True continuous data protection, in contrast to "snapshots", has no backup schedules. When data is written to disk, it is also asynchronously written to a second location, either another computer over the network or an appliance. This introduces some overhead to disk-write operations but eliminates the need for scheduled backups.
Allowing restoring data to any point in time, "CDP is the gold standard—the most comprehensive and advanced data protection. But 'near CDP' technologies can deliver enough protection for many companies with less complexity and cost. For example, snapshots ["near-CDP" clarification in the section below] can provide a reasonable near-CDP-level of protection for file shares, letting users directly access data on the file share at regular intervals—say, every half hour or 15 minutes. That's certainly a higher level of protection than tape-based or disk-based nightly backups and may be all you need." Because "near-CDP does this [copy
|
https://en.wikipedia.org/wiki/Variational%20message%20passing
|
Variational message passing (VMP) is an approximate inference technique for continuous- or discrete-valued Bayesian networks, with conjugate-exponential parents, developed by John Winn. VMP was developed as a means of generalizing the approximate variational methods used by such techniques as latent Dirichlet allocation, and works by updating an approximate distribution at each node through messages in the node's Markov blanket.
Likelihood lower bound
Given some set of hidden variables and observed variables , the goal of approximate inference is to lower-bound the probability that a graphical model is in the configuration . Over some probability distribution (to be defined later),
.
So, if we define our lower bound to be
,
then the likelihood is simply this bound plus the relative entropy between and . Because the relative entropy is non-negative, the function defined above is indeed a lower bound of the log likelihood of our observation . The distribution will have a simpler character than that of because marginalizing over is intractable for all but the simplest of graphical models. In particular, VMP uses a factorized distribution
where is a disjoint part of the graphical model.
Determining the update rule
The likelihood estimate needs to be as large as possible; because it's a lower bound, getting closer improves the approximation of the log likelihood. By substituting in the factorized version of , , parameterized over the hidden nodes as above, is simply the negative relative entropy between and plus other terms independent of if is defined as
,
where is the expectation over all distributions except . Thus, if we set to be , the bound is maximized.
Messages in variational message passing
Parents send their children the expectation of their sufficient statistic while children send their parents their natural parameter, which also requires messages to be sent from the co-parents of the node.
Relationship to exponential families
Because all nodes in VMP come from exponential families and all parents of nodes are conjugate to their children nodes, the expectation of the sufficient statistic can be computed from the normalization factor.
VMP algorithm
The algorithm begins by computing the expected value of the sufficient statistics for that vector. Then, until the likelihood converges to a stable value (this is usually accomplished by setting a small threshold value and running the algorithm until it increases by less than that threshold value), do the following at each node:
Get all messages from parents.
Get all messages from children (this might require the children to get messages from the co-parents).
Compute the expected value of the nodes sufficient statistics.
Constraints
Because every child must be conjugate to its parent, this has limited the types of distributions that can be used in the model. For example, the parents of a Gaussian distribution must be a Gaussian distribution (corresponding to the Mea
|
https://en.wikipedia.org/wiki/Water%20loss
|
Water loss may refer to:
Dehydration (disambiguation)
Leakage of water, especially in water supply networks
s.a. Non-revenue water
|
https://en.wikipedia.org/wiki/Corrado%20B%C3%B6hm
|
Corrado Böhm (17 January 1923 – 23 October 2017) was a Professor Emeritus at the University of Rome "La Sapienza" and a computer scientist known especially for his contributions to the theory of structured programming, constructive mathematics, combinatory logic, lambda calculus, and the semantics and implementation of functional programming languages.
Work
In his PhD dissertation (in Mathematics, at ETH Zurich, 1951; published in 1954), Böhm describes for the first time a full meta-circular compiler, that is a translation mechanism of a programming language, written in that same language. His most influential contribution is the so-called structured program theorem, published in 1966 together with Giuseppe Jacopini. Together with Alessandro Berarducci, he demonstrated an isomorphism between the strictly-positive algebraic data types and the polymorphic lambda-terms, otherwise known as Böhm–Berarducci encoding.
In the lambda calculus, he established an important separation theorem between normal forms, known as Böhm's theorem, which states that for every two closed λ-terms T1 and T2 which have different βη-normal forms, there exists a term Δ where Δ T1 and Δ T2 evaluate to different free variables (i.e., they may be taken apart internally). This means that, for normalizing terms, Morris' contextual equivalence, which is a semantic property, may be decided through equality of normal forms, a syntactic property, as it coincides with βη-equality.
A special issue of Theoretical Computer Science was dedicated to him in 1993, on his 70th birthday. He is the recipient of the 2001 EATCS Award for a distinguished career in theoretical computer science.
Selected publications
C. Böhm, "Calculatrices digitales. Du déchiffrage des formules mathématiques par la machine même dans la conception du programme", Annali di Mat. pura e applicata, serie IV, tomo XXXVII, 1–51, 1954. PDF at ETH Zürich English translation 2016 by Peter Sestoft
C. Böhm, "On a family of Turing machines and the related programming language", ICC Bull., 3, 185–194, July 1964.
Introduced P′′, the first imperative language without GOTO to be proved Turing-complete.
C. Böhm, G. Jacopini, "Flow diagrams, Turing Machines and Languages with only Two Formation Rules", Comm. of the ACM, 9(5): 366–371,1966.
C. Böhm, "Alcune proprietà delle forme β-η-normali nel λ-K-calcolo", Pubbl. INAC, n. 696, Roma, 1968.
C. Böhm, A. Berarducci, "Automatic Synthesis of typed Lambda-programs on Term Algebras", Theoretical Computer Science, 39: 135–154, 1985.
C. Böhm, "Functional Programming and Combinatory algebras", MFCS, Carlsbad, Czechoslovakia, eds M.P. Chytil, L. Janiga and V. Koubek, LNCS 324, 14–26, 1988.
See also
P′′, a minimal computer programming language
Structured program theorem
List of pioneers in computer science
Böhm tree
Böhm's theorem
References
Vitae (University of Rome)
External links
"A Collection of Contributions in Honour of Corrado Böhm on the Occasion of his 70th Birth
|
https://en.wikipedia.org/wiki/Juraj%20Bo%C5%BEi%C4%8Devi%C4%87
|
Juraj Božičević (7 October 1935 – 27 March 2016) was a Croatian expert in measurements and process control. He was a pioneer in neural networks and fuzzy logics, as well as of the idea of TEx-Sys or Tutor Expert Systems. He was the founder of the Croatian Academy of Engineering.
During his service as the State secretary in the Croatian Ministry of Truth, Education and Sports from January 2004 to July 2005 he founded Croatian Innovation System and supported Croatian Quality infrastructure.
References
External links
https://web.archive.org/web/20110721101315/http://public.mzos.hr/Default.aspx?art=5386&sec=2568
http://tkojetko.irb.hr/znanstvenikDetalji.php?sifznan=176
1935 births
2016 deaths
20th-century Croatian scientists
21st-century Croatian scientists
Croatian engineers
People from Vrbovsko
|
https://en.wikipedia.org/wiki/Clackers%20%28disambiguation%29
|
Clackers were 1970s toys.
Clackers may also refer to:
A term for editorial staff at the fictional fashion magazine in the novel The Devil Wears Prada
A term for computer operators in the novel The Difference Engine
Clackers cereal, a type of cereal made by General Mills
Clapperboard, a device used in film production that "clacks" when identifying scene and take information
A slang term for testicles
See also
Clack (disambiguation), for persons named Clack
Clacker (disambiguation)
Onomatopoeia
|
https://en.wikipedia.org/wiki/Eugene%20Salamin%20%28mathematician%29
|
Eugene Salamin is a mathematician who discovered (independently with Richard Brent) the Salamin–Brent algorithm, used in high-precision calculation of pi.
Eugene Salamin worked on alternatives to increase accuracy and minimize computational processes through the use of quaternions.
Benefits may include:
the design of spatio-temporal databases;
numerical mathematical methods that traditionally prove unsuccessful due to buildup of computational error;
therefore, may be applied to applications involving genetic algorithms and evolutionary computation, in general.
Publications
See also
HAKMEM
References
20th-century American mathematicians
Year of birth missing
|
https://en.wikipedia.org/wiki/Bill%20Stewart%20%28programmer%29
|
William C. "Bill" Stewart (1950 – August 2009) was an American computer programmer.
Stewart was born in Memphis, Tennessee. He founded Stewart Software Company there in 1984 and marketed Zilog Z80 assembly language programs, notably TOOLKIT and the ONLINE 80 Bulletin Board System, for Radio Shack TRS-80 Computers running TRSDOS. Later that company became Stewart Computer & Supply, Inc. Switching to 8088 Assembly under IBM PC DOS and MS-DOS, it released many programs via shareware and commercial distribution.
His shareware FREE.COM was cited as a top 10 PC utility in PC Magazine in 1987, and was a "Program of the Month" in a publication in Great Britain.
His commercial programs were oriented towards MS-DOS computer servicing and diagnostics. Commercial products included UNIFORM, a non-destructive reformat for hard drives, CSR, which allowed service shops to archive CMOS settings from computers they serviced and restore them when necessary, and Rx, a small terminate-and-stay-resident program (TSR) which gave plain English explanations to accompany the often cryptic "Abort, Retry or Ignore?" errors generated by DOS by changing it to "Abort, Retry, Ignore or Explain?".
Stewart Computer & Supply, Inc was sold in 1993 and Stewart moved to Fort Myers, Florida where he continued to write computer diagnostic software for 8088-based machines until 1997, and was a frequent contributor to The PC Troubleshooter magazine.
Later he lived in Cape Coral, Florida where he was a ham radio operator, call sign N4CRO, an infrequent scuba diver and an avid amateur weather enthusiast. From 1994 he worked in law enforcement.
Bill died in August 2009 at the age of 59.
References
External links
American computer programmers
1950 births
2009 deaths
|
https://en.wikipedia.org/wiki/Alexander%20Koral
|
Alexander Koral (1897 – 1968) was an American member of the Communist Party of the United States (CPUSA) who headed a network of spies for Soviet intelligence during World War II called the "Art" or "Berg" group. Koral's wife, Helen Koral, also was involved with the group.
Background
Koral was born in London on April 18, 1897.
Career
Koral began to work for New York City's Board of Education in 1926 as an engineer. By 1948, he was assistant engineer of construction.
FBI surveillance
The FBI first detected Koral in 1941 while surveiling Gaik Ovakimian, whom the FBI did not realize at the time was the head of KGB operations in the United States. The FBI noted Ovakimian meeting several times with Koral, though no espionage could be proved.
After the War, in 1947, Koral confessed, when confronted by the FBI, that he was a courier for the KGB from 1939 to 1945. Koral told the FBI he was paid two thousand dollars to travel to different cities to pick up and deliver small packages and envelopes to different persons, including Nathan Gregory Silvermaster and Helen Silvermaster. In December 1945, Koral had been sent to tell Silvermaster “no more visits would be made to him”, at the time of Elizabeth Bentley's defection and the Soviet networks were being compromised. Koral identified Semyon Semenov as one of his contacts in Soviet intelligence to whom he had delivered materials.
Koral was also a contact of Michael Straight. Koral's code name in the Soviet intelligence, and as deciphered in the Venona decrypts is "Berg".
Public exposure
On August 8, 1948, the Washington Post reported: The curtain will rise again Monday morning [April 9, 1948] on Washington's current spy thriller when the House Committee on Un-American Activities calls upon two key witnesses to tell the public what they know of Communist espionage here... One witness will be Victor Perlo... The other will be Alexander Koral, described by Chairman Karl Mundt (R., S. Dak.) as a former "contact" man between New York and Washington. When asked to testify before HUAC on August 9, 1948, however, he pled the Fifth Amendment and refused to answer any questions about communist affiliations.
On August 10, 1948, the Washington Post reported: Two ashen-faced men stood up in the crowded caucus room of the Old House Office Building and were confronted by Miss Elizabeth T. Bentley, confessed courier for Communist underground... Both men, on the advice of counsel, refused to say whether or not they knew Ms. Bentely on the ground that an answer might tend to incriminate them... One was Victor Perlo... The other was Alexander Koral, a 51-year-old maintenance man employed by the New York City Board of Education, who was reminded when he was on the stand that he had already signed a confession to Government authorities of his part in a Washington-New York spy circuit. Koral refused to affirm or deny that he had made such a confession, and he refused to say on grounds of self-incrimin
|
https://en.wikipedia.org/wiki/DexDrive
|
DexDrive is a line of home video game console memory card readers released in 1998, allowing data transfer to a PC for backups and online sharing. It was made by now-defunct InterAct for use with PlayStation and Nintendo 64 memory cards. The company hosted a curated website to facilitate online sharing of saved game data.
Overview
The DexDrive allows a personal computer to perform backups and online sharing of saved game data from video game consoles. Its capacity is only , far less than even a floppy disk. It retailed for so for the cost of two memory cards, it transfers saved game files between the memory cards and the PC. As PC files, game data can be shared over the Internet or be used with console emulators.
DexDrive connects to the PC via serial port and the DexPlorer Windows driver application. Interact developed a way to use the Game Shark to share save data for Nintendo 64 games that use cartridge-based storage instead of memory cards. A USB version was reportedly in development.
Reception
Core Magazine said the serial port is slow but hardware and software installation is simple. DexChange.net was curated by Interact employees who supply files for games that users have not, and new games were covered quickly, yielding "more saves available that you could ever want". The magazine summarized: "All in all, the DexDrive is a splendid idea, and worth its $39.95 retail price (which is, as Interact points out, the cost of a typical multi-page memory card). The DexDrive may wind up being one of the most novel gaming peripherals since the Analog controller."
See also
MaxDrive
References
External links
Download user-created Dexter software
Download PSX Game Save Editor an all-in-one tool for Game Saves
Download MemcardRex an advanced Memory Card editor
N64 Drivers from a German site Windows XP or lower
Nintendo 64 accessories
PlayStation (console) accessories
Products introduced in 1997
|
https://en.wikipedia.org/wiki/NoteEdit
|
NoteEdit is a defunct music scorewriter for Linux and other Unix-like computer operating systems. Its official successor is Canorus.
NoteEdit is written in C++, uses the Qt3 toolkit, and is integrated with KDE. Released under the GPL-2.0-or-later license, NoteEdit is free software.
Features
NoteEdit, unlike some Linux-based music editors, features a graphical user interface. NoteEdit's design has been praised by ITworld, and Linux Journal praised both the interface and the relatively wide range of features and applications of the program.
It supports an unlimited number and length of staves, polyphony, MIDI playback of written notes, chord markings, lyrics, and a number of import and export filters to many formats like MIDI, MusicXML, abc, MUP, PMX, MusiXTeX and LilyPond.
Linux Magazine recommends using NoteEdit with FluidSynth, a software synthesizer, to expand NoteEdit's abilities. FluidSynth uses SoundFont technology (a sample-based synthesis) to simulate the sound of a NoteEdit score played by live instruments.
Authors
NoteEdit was maintained by Jörg Anders for a long time. Since August 2004, a new development team was formed. Now there are quite a few people behind this software project:
Reinhard Katzmann, project manager
Christian Fasshauer, programmer
Erik Sigra, developer
David Faure, KDE User Interface
Matt Gerassimoff
Leon Vinken, MusicXML
Georg Rudolph, LilyPond interface
Matevž Jekovec, developer and composer
Karai Csaba, developer
In Autumn 2006 the development team decided to rewrite as score editor in Qt4 from scratch (now known as Canorus). Version 0.1.0 to 0.7.2 released under GPL-2.0-only, and since version 0.7.3 under GPL-3.0-only.
See also
List of music software
References
External links
NoteEdit home page ()
Canorus - music score editor
Scorewriters
Free audio software
Free music software
Free software programmed in C++
Software that uses Qt
Scorewriters for Linux
|
https://en.wikipedia.org/wiki/CSI%3A%20Dark%20Motives
|
CSI: Dark Motives is a computer game based on the CSI: Crime Scene Investigation television series. The game was developed by Radical Entertainment (under the 369 Interactive label), published by Ubisoft, and was released for the PC in 2004. In November 2007 it was remade by Powerhead Games, published by Ubisoft and released for Nintendo DS. The Microsoft Xbox version of CSI: Crime Scene Investigation also contains the cases featured in this game.
The Cases
Case 1: "Daredevil Disaster"
When Ace Dillinger, a professional stuntman for World's Wildest Stunts, crashes his motorbike at a stunt show, there is a call for the CSI crew. You play a new recruit working with Catherine Willows on this case. The suspects are the stunt supervisor, the show's producer and a motorcycle mechanic.
Case 2: "Prints and Pauper"
A seemingly homeless man is found dead in an abandoned insane asylum. The contents of his stomach seem to show otherwise. You work with Warrick Brown on this case. The suspects in this case point to the owner of a classy French restaurant, a socialite whose father recently died and the manager of a Pawn Shop.
Case 3: "Diggin' It"
Human bones are dug up at a construction site for a new casino. It is believed the site is an ancient Indian burial ground. You work with Sara Sidle in this case. Suspects include the previous owner of the land, the construction supervisor, a university lecturer and a well-known psychic who had visions of when the victim was still alive.
Case 4: "Miss Direction"
A woman is shot dead during a rehearsal for a play, apparently shot with a prop gun. You will work with Nick Stokes in this mission. The suspects of this case are a fellow actress with whom the victim may have been having an affair with, the victim's husband and the stage manager.
Case 5: "Dragon and Dropping"
A poisonous Komodo is killed at a casino circus and a human toe is found in its cage. Who got this peaceful predator to attack the victim anyway? You work with Gil Grissom on this case. The suspects involved are the circus ringleader, a missing security guard, a funeral director, a local doctor and a retired Ukrainian air-force pilot.
Reception
Critical reviews
The PC version received "mixed" reviews according to the review aggregation website Metacritic.
Sales
In the United States, the PC version sold between 100,000 and 250,000 copies by August 2006, but was outsold by its predecessor, CSI: Crime Scene Investigation. It also received a "Silver" sales award from the Entertainment and Leisure Software Publishers Association (ELSPA), indicating sales of at least 100,000 copies in the United Kingdom. By August 2006, combined sales of computer versions of the CSI game franchise had reached 250,000 units in the United States alone. Global sales of the series totaled roughly 2.4 million copies across all platforms by that December, at the time of the fourth entry's announcement.
References
Notes
Citations
External links
CSI: Dark Motives Gam
|
https://en.wikipedia.org/wiki/Gu%C3%B0r%C3%BAnarkvi%C3%B0a%20III
|
Guðrúnarkviða III, The Third Lay of Gudrun, is a short Old Norse poem that is part of the Poetic Edda. It has not left any traces in Völsunga saga and was probably not known by its compilers.
It is dated to the early 11th century, because that was the time when the ordeal by boiling water made its appearance in Scandinavia and the poet speaks of it as a practice of foreign origin. According to Henry Adams Bellows, the poem is based on material that came from northern Germany, where the ordeal by boiling water had long been current. He adds that it has so little local colour that it was probably composed based on a story that the poet had heard from a German.
The Guðrún lays show that the hard-boiled heroic poetry of the Poetic Edda also had a place for the hardships of women.
Synopsis
Herkja, one of Atli's former concubines, was serving as a maid at his court. She reported to Atli that she had seen Guðrún together with King Þjóðrekr, which made Atli very angry. He approached Guðrún and she asked him what was the matter.
Guðrún answered that she was innocent and could swear on the sacred white stone that she had not been with Þjóðrekr in that way. She had only talked with Þjóðrekr about their sorrows in secret. Þjóðrekr had arrived with thirty warriors and he had lost all of them, while Atli, her husband, had murdered all her brothers and all the men of her people. Gunnarr could no longer come, and she could no longer greet Högni. She had lost both her beloved brothers and she would like to avenge Högni with her sword. She declared that she wanted payment for her sorrows and she suggested the ordeal of boiling water, for which Atli should summon Saxi, the king of the Southrons, who could hallow the kettle. Then, the poem passes to the execution of the ordeal and what happened to Herkja:
Notes
References
The Third Lay of Guthrun, Henry Adams Bellows' translation and commentary
The Third Lay of Gudrún, Benjamin Thorpe's translation
The Third Lay of Guthrún, Lee M. Hollander's translation
Guðrúnarkviða hin þriðja Sophus Bugge's edition of the manuscript text
Guðrúnarkviða in þriðja, Guðni Jónsson's edition with normalised spelling
11th-century poems
Eddic poetry
Nibelung tradition
Völsung cycle
|
https://en.wikipedia.org/wiki/Drew%20Major
|
Drew Major (born June 17, 1956) is a computer scientist and entrepreneur. He is best known for his role as one of the principal engineers of the Novell NetWare operating system from early in Novell's history.
Major received a Bachelor of Science degree from Brigham Young University in 1980, and graduated with honors in mathematics and computer science. He was born in California but has lived most of his life in Utah.
SuperSet Software
SuperSet Software was a group founded by friends and former Eyring Research Institute (ERI) co-workers Drew Major, Dale Neibaur, Kyle Powell, and later joined by Mark Hurst. Their work was based on classwork that they started in October 1981 at Brigham Young University, Provo, Utah, USA, and upon previous work experiences at Eyring Research Institute working with the Xerox Network Systems (XNS) protocol which led to the development of the Novell IPX and SPX networking protocols, and the NetWare operating system.
In 1983, Ray Noorda took over leadership of Novell and engaged the SuperSet group to work on networking products. The team was originally assigned to create a CP/M disk sharing system to help network the CP/M hardware that Novell was selling at the time. Under Ray Noorda's leadership, the group developed a successful file sharing system for the newly introduced IBM-compatible PC.
The group also wrote a text-mode game called Snipes and used it to test the new network and demonstrate its capabilities.
Novell
Major joined Novell in 1983, and his partners Kyle Powell, Dale Neibaur, and Mark Hurst began to work in enabling PCs to share files and other resources via a local area network (LAN). Major was the lead architect and developer of the NetWare operating system for over 15 years. Major left Novell in 2003.
Move Networks
After leaving Novell, Major co-founded video networking company Move Networks, Inc. The company began to experience financial problems in 2010 for failing to deliver on key technologies, which resulted in some of its larger customers abandoning the company's technology. The company was subsequently acquired for 45 million dollars by EchoStar, Inc. in January 2011.
References
1956 births
Living people
American Latter Day Saints
Brigham Young University alumni
Novell people
|
https://en.wikipedia.org/wiki/Trams%20in%20Oslo
|
The Oslo tram network (, short from , 'electric') is the tram system in Oslo, Norway. It consists of six lines with 99 stops and has a daily ridership of 132,000. It is operated by , a subsidiary of the municipally-owned who maintain the track and 72 tram vehicles on contracts with the public transport authority . The system operates on standard gauge and uses 750 V DC overhead. Depot, workshops and headquarters are at (at the terminus of lines 17 and 18). There is also a depot at (along lines 13 and 19) that is home to the technical company InfraPartner, which maintains the track for the tram and metro systems in Oslo, and a small office building for .
History
The first tram in Oslo was opened in 1875 with a short line between Homansbyen west of the city centre, Oslo West Railway Station and a sideline to Grønland, east of the city centre. The first "trams" were in fact horse-drawn vehicles on flanged steel wheels. The first expansion of the line came in 1878 with a line to Grünerløkka just north-east to the city center.
Electric tram service was initiated in 1894 with a line over Briskeby to Majorstuen, a route south of the original Homansbyen line. Horsedrawn service was entirely replaced with electric service in 1900. For a long time, there were two tram companies operating in Oslo, "Grønntrikken" ("The Green Trams" with a green and yellow livery) and "Blåtrikken" ("The Blue Trams" with a blue livery). These companies were merged in 1924. During the 1910s, 1920s and 1930s, the network continued to expand, with the most notable addition being the construction of Ekebergbanen, a line up along the hill along the east side of the Oslo Fjord, south of the city. It was operated by a separate company. It was originally built to Sæter in 1917, the line was completed to Ljabru in 1941. The tram network reached its greatest extent in 1939 with the opening of the northeastern line to Sinsen.
After World War II, the tram network started being gradually being replaced with diesel buses, closures started in 1947, and in 1960, the city council decided to aim for a complete dismantlement of the entire tram system. A number of lines had been replaced with the T-bane subway system, and the versatility of buses was attractive to the local politicians. However, in 1977, the city council rescinded its decision to close the tram system. An order was made for a set of new articulated trams to supplement the aging fleet. The first of these trams, the SL79 was delivered in 1982.
The tram network was expanded slightly in the 1990s. A line over Aker Brygge was added in 1995, and in 1999 an extension of the northwestern Ullevål line was extended past the University of Oslo campus, to the new Rikshospitalet national hospital. A further renewal of the tram fleet by the addition of Italian double-articulated SL95 cars was also started. In 2002 the tram appeared to fall on hard times again. Oslo Sporveier was strapped for cash, and the board passed a decision to clos
|
https://en.wikipedia.org/wiki/Defense%20Information%20System%20Network
|
The Defense Information System Network (DISN) has been the United States Department of Defense's enterprise telecommunications network for providing data, video, and voice services for 40 years.
The DISN end-to-end infrastructure is composed of three major segments:
The sustaining base (I.e., base, post, camp, or station, and Service enterprise networks). The Command, Control, Communications, Computers and Intelligence (C4I) infrastructure will interface with the long-haul network to support the deployed warfighter. The sustaining base segment is primarily the responsibility of the individual Services.
The long-haul transport infrastructure, which includes the communication systems and services between the fixed environments and the deployed Joint Task Force (JTF) and/or Coalition Task Force (CTF) warfighter. The long-haul telecommunications infrastructure segment is primarily the responsibility of DISA.
The deployed warfighter, mobile users, and associated Combatant Commander telecommunications infrastructures are supporting the Joint Task Force (JTF) and/or Coalition Task Force (CTF). The deployed warfighter and associated Combatant Commander telecommunications infrastructure is primarily the responsibility of the individual Services.
The DISN provides the following multiple networking services:
Global Content Delivery System (GCDS)
Data Services
Sensitive but Unclassified (NIPRNet)
Secret Data Services (SIPRNet)
Multicast
Organizational Messaging
The Organizational Messaging Service provides a range of assured services to the customer community that includes the military services, DoD agencies, combatant commands (CCMDs), non-DoD U.S. government activities, and the Intelligence Community (IC). These services include the ability to exchange official information between military organizations and to support interoperability with allied nations, non-DoD activities, and the IC operating in both the strategic/fixed-base and the tactical/deployed environments. Organizational Messaging supports the assured secure delivery of organizational messages within strict service parameters. This includes delivery times of three minutes or less for high precedence (flash and above) messages across the DISA-provided infrastructure. Additionally, information confidentiality and integrity are guaranteed through the use of NSA-approved Fortezza-based encryption and signature between the Automated Message Handling Systems (AMHSs) operated/maintained by the Services/agencies/COCOMs.
Satellite
Commercial Satellite (COMSATCOM)
Distributed Tactical Communications System (DTCS)
International Maritime Satellite (INMARSAT)
Joint Internet Protocol Modem (JIPM)
Transport
Dedicated service is a private-line-transport service that provides point-to-point connectivity to mission partner locations.
DISA mission partners require dedicated point-to-point layer 1 and layer 2 circuits because of the inherent simplicity and security. To satisfy this demand
|
https://en.wikipedia.org/wiki/Piping%20guan
|
The piping guans are a bird genus, Pipile, in the family Cracidae. A recent study, evaluating mtDNA, osteology and biogeography data concluding that the wattled guan belongs in the same genus as these and is a hypermelanistic piping guan. Thus, Pipile became a junior synonym of Aburria, though this conclusion was not accepted by the South American Checklist Committee, or evaluated by the IOC, so the classification remains in Pipile.
The same results also showed that the light-faced taxa pipile, cumanensis and cujubi are not, as was sometimes suggested, conspecific. However, free interbreeding between A. cujubi and A. cumanensis grayi in eastern Bolivia, creating a "hybrid swarm", casts doubt on this conclusion for the two species named.
It was possible to confidently resolve that the white-faced species form a clade, whereas the more basal black-faced forms are of less certain relationship. Possibly, the black-fronted piping guan is the basalmost taxon, but the placement of the wattled guan in regard to its congeners is not all too well resolved. Blue wattles evolved only once, in a lineage which seems to have originated north of the Amazon River. The piping guans' radiation began in the latter half of the Early Pliocene, roughly 4–3.5 mya. The white-faced lineage emerged around 3 mya and its present diversity began to evolve around the Pliocene-Pleistocene boundary, when the ancestors of the red-throated piping guan and the blue-wattled taxa split. Due to not being calibrated by material evidence such as fossils, the divergence times cannot be estimated with a high confidence.
The origin of the genus was possibly in the general area of eastern Bolivia, at the very margin of its current range. From the phylogeny outlined above, the piping guans would be expected to have originated in the southern Brazilian lowlands. However, although the relationships of the genera of guans are not entirely clear, it seems most likely that the group originated in the northern Andes region: The northernmost guan genera Chamaepetes and Penelopina appear to be basal divergences, and Pipile is most likely closer to Penelope (which represents a generally southward radiation out of the northern Andes) than to these.
Thus it appears most likely that the present genus diverged in the eastern foothills of the Andes somewhere in the vicinity of Bolivia, far to the northwest from where its origin would be presumed from the phylogeny and present-day distribution of Pipile alone. Two considerations are worthy of note: First, the time at which the ancestor of the piping guans diverged from Penelope has been roughly dated to the Burdigalian, some 20-15 mya, which leaves a considerable gap during which no surviving piping guan lineage evolved. Secondly, it is notable that in the Late Pliocene, rising sea levels transformed much of the South American lowlands into brackish lagoon habitat unsuitable for piping guans. Thus, the present distribution is apparently a relict, and
|
https://en.wikipedia.org/wiki/PBN
|
PBN may refer to:
PBN (producer), aka Panjabi By Nature, UK-based South Asian music producer
PBN Broadcasting Network, a media network in Bicol Region, Philippines
Providence Business News, a weekly business journal in Rhode Island
Pegboard Nerds, an electronic music group
Abbreviations
Paris by Night, a Vietnamese music variety show
Parabrachial nuclei
PBN file extension – "portable bridge notation" (".pbn") files that are interchangeable with other applications.
Consolidated PBY Catalina, an aircraft
PbNation, an internet forum
Paint by numbers, a common name for nonogram puzzles
Performance-based navigation
Private blog network, an SEO technique
Product batch number
Pyrolytic boron nitride
N-tert-butyl-α-phenylnitrone [3376-24-7], a Spin trap compound
|
https://en.wikipedia.org/wiki/Hybrid%20drive
|
In computing, a hybrid drive (solid state hybrid drive – SSHD) is a logical or physical storage device that combines a faster storage medium such as solid-state drive (SSD) with a higher-capacity hard disk drive (HDD). The intent is adding some of the speed of SSDs to the cost-effective storage capacity of traditional HDDs. The purpose of the SSD in a hybrid drive is to act as a cache for the data stored on the HDD, improving the overall performance by keeping copies of the most frequently used data on the faster SSD drive.
There are two main configurations for implementing hybrid drives: dual-drive hybrid systems and solid-state hybrid drives. In dual-drive hybrid systems, physically separate SSD and HDD devices are installed in the same computer, having the data placement optimization performed either manually by the end user, or automatically by the operating system through the creation of a "hybrid" logical device. In solid-state hybrid drives, SSD and HDD functionalities are built into a single piece of hardware, where data placement optimization is performed either entirely by the device (self-optimized mode), or through placement "hints" supplied by the operating system (host-hinted mode).
Types
There are two main "hybrid" storage technologies that combine NAND flash memory or SSDs, with the HDD technology: dual-drive hybrid systems and solid-state hybrid drives.
Dual-drive hybrid systems
Dual-drive hybrid systems combine the usage of separate SSD and HDD devices installed in the same computer. Performance optimizations are managed in one of three ways:
By the computer user, who manually places more frequently accessed data onto the faster drive.
By the computer's operating system software, which combines SSD and HDD into a single hybrid volume, providing an easier experience to the end-user. Examples of hybrid volumes implementations in operating systems are ZFS' "hybrid storage pools", bcache and dm-cache on Linux, Intel's Hystor and Apple's Fusion Drive, and other Logical Volume Management based implementations on OS X.
By chipsets external to the individual storage drives. An example is the use of flash cache modules (FCMs). FCMs combine the use of separate SSD (usually an mSATA SSD module) and HDD components, while managing performance optimizations via host software, device drivers, or a combination of both. One example is Intel Smart Response Technology (SRT), which is implemented through a combination of certain Intel chipsets and Intel storage drivers, is the most common implementation of FCM hybrid systems today. What distinguished this dual-drive system from an SSHD system is that each drive maintains its ability to be addressed independently by the operating system if desired.
Solid-state hybrid drive
Solid-state hybrid drive (also known by the initialism SSHD) refers to products that incorporate a significant amount of NAND flash memory into a hard disk drive (HDD), resulting in a single, integrated device. The term S
|
https://en.wikipedia.org/wiki/PC%20Accelerator
|
PC Accelerator (PCXL) was an American personal computer game magazine that was published by Imagine Media (currently a subsidiary of Future plc). It was known for its Maxim-like humor and photography.
History and profile
PC Accelerator was started by Imagine Media in 1998. The first issue was published in September 1998. The magazine was published on a monthly basis. Its last issue was dated June 2000.
After the split up of the magazine, editor-in-chief Mike Salmon went on to start the Official Xbox Magazine. While some of the staff was sent to PC Gamer, others went on to work for Daily Radar. In September 2007, a special Fall issue of PCXL was released to newsstands only. This issue was primarily written by the current staff of PC Gamer with contributions by former PCXL staff including Rob Smith and Dan Egger.
Format
Games were reviewed on a scale of 0-10. Half-Life was the only game to receive an 11 (in the February 1999 issue).
Staff
Mike Salmon: Editor in Chief and writer.
Rob Smith: Executive Editor who went on to helm PC Gamer.
Ed Lee: Writer who eventually left to enter law school.
Chuck Osborn: A native of Austin, Texas. Chuck went on to work for PC Gamer.
Matt Holmes: associate editor.
Eric Smith: Asst. Art Director, then Art Director after Kyle departed.
Dan Egger: A junior editor for the magazine.
Carrie Shepherd: The managing editor for the publication.
Quinton Doroquez aka "Q": Original Art Director who designed the layout for the magazine.
Kyle LeBoeuf: Asst. Art Director, then Art Director after Quinton departed.
Erik Piller: Marketing Manager / Webmaster.
Caroline Simpson-Bint: Publisher.
Caitlyn Meeks: CD-ROM designer, also worked for PC Gamer.
There were more editors and artists that followed.
Characters
"Hector the Scarecrow" - Crafted from a coatrack and gas mask. Hector was dangled from the sprinkler system to appear more lifelike and eventually made a fire inspector very angry. Hector appeared in six issues.
"Gia DeCarlo" - An intern who worked at the magazine.
"Limey the Lima Bean" - Says "Screw you" to everyone.
"Quake Guy" - Frequent hero of Ed Lee Comic Strips.
"Laura"
"Future Guy" - Future Guy lived one year in the future and knew a year in advance that PCXL was going to get canned.
Easter Eggs
There was a game reviewed in the magazine that never existed... and was completely fabricated including screenshots, developer interviews, company website and a developer company front.
PC Gamer Versus PCXL matches
Every night, the staffs of PC Gamer and PCXL would challenge each other to massive team on team Rainbow Six battles.
References
External links
PCXL.com (ARCHIVED)
Interview with former associate editor Matt Holmes
Ars Technica homage to PC Accelerator
Monthly magazines published in the United States
Video game magazines published in the United States
Defunct computer magazines published in the United States
Magazines established in 1998
Magazines disestablished in 2000
Home computer magazines
|
https://en.wikipedia.org/wiki/SoundTeMP
|
SoundTeMP is a Korean team of video game music composers. Formed in 1992, they have been creating soundtracks for MMORPG computer games. By 2002, their work in Ragnarok Online (a highly acclaimed early MMORPG) made them famous. Their most recent work is in the MMORPG Tree of Savior.
Another international MMORPG using game music from SoundTeMP since 2003 is FlyFF, which comes from Korea as well.
SoundTeMP Members
Lee Seock-Jin (BlueBlue)
Kwon Goo-Hee (Goopal)
Kwak Dong-Il (Sevin) (1993–2004)
Jang Seong-Woon (Nikacha)
Park Jin-Bae (Silhouetti, ESTi)
Park Soo-Il
Nam Goo-Min (Nauts)
List of MMORPGs featuring music from SoundTeMP
Flyff
Granado Espada
Ragnarok Online
Neo Steam: The Shattered Continent
4leaf (2000・SOFTMAX)
Talesweaver
La Tale
Tree of Savior
Seal Online
Corum Online (2003・Netclue)
Yogurting (2004・Neowiz)
Silkroad Online (2004・Joymax)
RF Online (RF Online, 2004・CCR)
List of other games featuring music from SoundTeMP
Ys II Special (1994・Mantra, arrange)
Lychnis (1994・Softmax, arrange)
Genocide 2 (1995・Mantra, arrange)
Astrocounter of CRESCENTS (1996・S&T On-Line/Samsung)
Icekiss (1997・Object Square, freeware)
The Rhapsody of Zephyr (1998・Softmax)
Ant Man 2 (1998・Gravity)
Merturl Wizard (1998・OSC)
Leithian (1999・Kama Digital Entertainment)
The War of Genesis III (1999・Softmax)
Fortress series (CCR)
Arcturus (2000・Sonnori/Gravity)
Narsillion (2002・Grigon Entertainment)
Dream Chaser (2002・SOFTMAX)
Cheollang Yeoljeon (2003・Grigon Entertainment)
Magna Carta (2004・SOFTMAX)
PangYa (2004・Ntreev Soft)
DJ MAX / DJ MAX online
Princess Maker series
Musical style
Their soundtracks in MMORPG ranged from trance/techno, electronic to instrumental, ambient and new-age. SoundTeMP are often acclaimed for their wide experimentation with game audio styles, mixing various genres together to produce unique tracks.
References
External links
Misc info about SoundTeMP (JP)
www.last.fm information
1992 establishments in South Korea
Video game composers
Video game musicians
|
https://en.wikipedia.org/wiki/High-availability%20cluster
|
High-availability clusters (also known as HA clusters, fail-over clusters) are groups of computers that support server applications that can be reliably utilized with a minimum amount of down-time. They operate by using high availability software to harness redundant computers in groups or clusters that provide continued service when system components fail. Without clustering, if a server running a particular application crashes, the application will be unavailable until the crashed server is fixed. HA clustering remedies this situation by detecting hardware/software faults, and immediately restarting the application on another system without requiring administrative intervention, a process known as failover. As part of this process, clustering software may configure the node before starting the application on it. For example, appropriate file systems may need to be imported and mounted, network hardware may have to be configured, and some supporting applications may need to be running as well.
HA clusters are often used for critical databases, file sharing on a network, business applications, and customer services such as electronic commerce websites.
HA cluster implementations attempt to build redundancy into a cluster to eliminate single points of failure, including multiple network connections and data storage which is redundantly connected via storage area networks.
HA clusters usually use a heartbeat private network connection which is used to monitor the health and status of each node in the cluster. One subtle but serious condition all clustering software must be able to handle is split-brain, which occurs when all of the private links go down simultaneously, but the cluster nodes are still running. If that happens, each node in the cluster may mistakenly decide that every other node has gone down and attempt to start services that other nodes are still running. Having duplicate instances of services may cause data corruption on the shared storage.
HA clusters often also use quorum witness storage (local or cloud) to avoid this scenario. A witness device cannot be shared between two halves of a split cluster, so in the event that all cluster members cannot communicate with each other (e.g., failed heartbeat), if a member cannot access the witness, it cannot become active.
Application design requirements
Not every application can run in a high-availability cluster environment, and the necessary design decisions need to be made early in the software design phase. In order to run in a high-availability cluster environment, an application must satisfy at least the following technical requirements, the last two of which are critical to its reliable function in a cluster, and are the most difficult to satisfy fully:
There must be a relatively easy way to start, stop, force-stop, and check the status of the application. In practical terms, this means the application must have a command line interface or scripts to control the applicati
|
https://en.wikipedia.org/wiki/TNTmips
|
TNTmips is a geospatial analysis system providing a fully featured GIS, RDBMS, and automated image processing system with CAD, TIN, surface modeling, map layout and innovative data publishing tools. TNTmips has a single integrated system with an identical interface, functionality, and geodata structure for use on Mac and Windows operating systems. The interface, database text content, messages, map production, and all other internal aspects of TNTmips have been localized for use in many languages, including, for example Arabic, Thai, and all romance languages. The professional version of TNTmips is in use in over 120 nations while the TNTmips Free version (restricted in project size) is used worldwide for educational, self learning, and small projects (e.g., archaeological sites, neighborhood planning, and precision farming).
History
TNTmips was initially branded MIPS from its creation in 1986 until 2022.
General information
TNTmips is a system for fully integrated GIS, CAD, with integrated geospatial database management.
License levels
TNTmips Pro (professional license),
TNTmips Basic (low cost license),
TNTmips Free (freeware).
Special Academic License (SAL)
The TNT products include: TNTmips, TNTedit, TNTview, TNTatlas and TNTsdk. There is no distinction between TNTmips and TNT products with regards to license levels.
All TNT products are available for Windows and Macintosh computers in a growing number of international languages.
References
Footnotes
Sources
External links
MicroImages
GIS Team Germany Reseller for TNTproducts
GIS software
Remote sensing software
|
https://en.wikipedia.org/wiki/Journal%20of%20Artificial%20Intelligence%20Research
|
The Journal of Artificial Intelligence Research (JAIR) is an open access peer-reviewed scientific journal covering research in all areas of artificial intelligence.
History
It was established in 1993 as one of the first scientific journals distributed online. Paper volumes are printed by the AAAI Press. The Journal for Artificial Intelligence Research (JAIR) is one of the premier publication venues in artificial intelligence. JAIR also stands out in that, since its launch in 1993, it has been 100% open-access and non-profit.
Content
The Journal of Artificial Intelligence Research (JAIR) is dedicated to the rapid dissemination of important research results to the global artificial intelligence (AI) community. The journal's scope encompasses all areas of AI, including agents and multi-agent systems, automated reasoning, constraint processing and search, knowledge representation, machine learning, natural language, planning and scheduling, robotics and vision, and uncertainty in AI.
Abstracting and indexing
The journal is abstracted and indexed by Inspec, Science Citation Index, and MathSciNet. According to the Journal Citation Reports, the journal has a 2019 impact factor of 2.441.
According to the SciMago Journal and Country Rank, the journal is ranked 8th among all open access computer science journals with an H-index of 112.
However, according to Google Scholar in 2021 it only has an h5-index of 38, which suggests some potential issues in measuring its impact.
References
External links
Computer science journals
Open access journals
Academic journals established in 1993
English-language journals
Artificial intelligence publications
|
https://en.wikipedia.org/wiki/FreeBSD%20jail
|
The jail mechanism is an implementation of FreeBSD's OS-level virtualisation that allows system administrators to partition a FreeBSD-derived computer system into several independent mini-systems called jails, all sharing the same kernel, with very little overhead. It is implemented through a system call, jail(2), as well as a userland utility, jail(8), plus, depending on the system, a number of other utilities. The functionality was committed into FreeBSD in 1999 by Poul-Henning Kamp after some period of production use by a hosting provider, and was first released with FreeBSD 4.0, thus being supported on a number of FreeBSD descendants, including DragonFly BSD, to this day.
History
The need for the FreeBSD jails came from a small shared-environment hosting provider's (R&D Associates, Inc.'s owner, Derrick T. Woolworth) desire to establish a clean, clear-cut separation between their own services and those of their customers, mainly for security and ease of administration (jail(8)). Instead of adding a new layer of fine-grained configuration options, the solution adopted by Poul-Henning Kamp was to compartmentalize the system – both its files and its resources – in such a way that only the right people are given access to the right compartments.
Jails were first introduced in FreeBSD version 4.0, that was released on . Most of the original functionality is supported on DragonFly, and several of the new features have been ported as well.
Goals
FreeBSD jails mainly aim at three goals:
Virtualization: Each jail is a virtual environment running on the host machine with its own files, processes, user and superuser accounts. From within a jailed process, the environment is almost indistinguishable from a real system.
Security: Each jail is sealed from the others, thus providing an additional level of security.
Ease of delegation: The limited scope of a jail allows system administrators to delegate several tasks which require superuser access without handing out complete control over the system.
Unlike chroot jail, which only restricts processes to a particular view of the filesystem, the FreeBSD jail mechanism restricts the activities of a process in a jail with respect to the rest of the system. In effect, jailed processes are sandboxed. They are bound to specific IP addresses, and a jailed process cannot access divert or routing sockets. Raw sockets are also disabled by default, but may be enabled by setting the security.jail.allow_raw_sockets sysctl option. Additionally, interaction between processes that are not running in the same jail is restricted.
The utility and system call first appeared in FreeBSD 4.0. New utilities (for example to list jails) and system calls (for example to attach a new process to a jail) that render jail management much easier were added in FreeBSD 5.1. The jail subsystem received further significant updates with FreeBSD 7.2, including support for multiple IPv4 and IPv6 addresses per jail and support for b
|
https://en.wikipedia.org/wiki/Wizard%20of%20Oz%20experiment
|
In the field of human–computer interaction, a Wizard of Oz experiment is a research experiment in which subjects interact with a computer system that subjects believe to be autonomous, but which is actually being operated or partially operated by an unseen human being.
Concept
The phrase Wizard of Oz (originally OZ Paradigm) has come into common usage in the fields of experimental psychology, human factors, ergonomics, linguistics, and usability engineering to describe a testing or iterative design methodology wherein an experimenter (the “wizard”), in a laboratory setting, simulates the behavior of a theoretical intelligent computer application (often by going into another room and intercepting all communications between participant and system). Sometimes this is done with the participant's prior knowledge and sometimes it is a low-level deceit employed to manage the participant's expectations and encourage natural behaviors.
For example, a test participant may think they are communicating with a computer using a speech interface, when the participant's words are actually being covertly entered into the computer by a person in another room (the “wizard”) and processed as a text stream, rather than as an audio stream. The missing system functionality that the wizard provides may be implemented in later versions of the system (or may even be speculative capabilities that current-day systems do not have), but its precise details are generally considered irrelevant to the study. In testing situations, the goal of such experiments may be to observe the use and effectiveness of a proposed user interface by the test participants, rather than to measure the quality of an entire system.
Origin
The name of the experiment comes from The Wonderful Wizard of Oz story, in which an ordinary man hides behind a curtain and pretends, through the use of "amplifying" technology, to be a powerful wizard.
John F. (“Jeff”) Kelley coined the phrases “Wizard of OZ” and “OZ Paradigm” for this purpose circa 1980 to describe the method he developed during his dissertation work at Johns Hopkins University. (His dissertation adviser was the late professor Alphonse Chapatis, the “Godfather of Human Factors and Engineering Psychology”.) Amusingly enough, in addition to some one-way mirrors and such, there literally was a blackout curtain separating Jeff, as the “Wizard”, from view by the participant during the study.
The “Experimenter-in-the-Loop” technique had been pioneered at Chapatis’ Communications Research Lab at Johns Hopkins as early as 1975 (J. F. Kelley arrived in 1978). W. Randolph Ford used the experimenter-in-the-loop technique with his innovative CHECKBOOK program wherein he obtained language samples in a naturalistic setting. In Ford's method, a preliminary version of the natural language processing system would be placed in front of the user. When the user entered a syntax that was not recognized, they would receive a “Could you rephrase that?” pr
|
https://en.wikipedia.org/wiki/Robert%20J.%20Mical
|
Robert J. "RJ" Mical (born 26 January 1956) is an American computer programmer and hardware designer who has primarily worked in video games. He is best known for creating the user interface, Intuition, for Commodore's Amiga personal computer (1985), contributing to the design of the Amiga hardware, and co-designing, with Dave Needle, the Atari Lynx color handheld (1989) and the 3DO Interactive Multiplayer (1993).
He also worked on arcade games at Williams Electronics, was the chief architect of the Fathammer mobile game engine, and was at Sony Computer Entertainment from 2005 to 2011 as a senior manager on the PlayStation product line. In 2012 he was hired by Google.
A 1995 article in Next Generation commented "It's true that of the machines that Mical and Needle have created, only the Amiga has been a true global mass market hit ... But it's only fair to put forward the argument that this is down to the marketing of the machines rather than the quality of the product."
Biography
Robert J. Mical graduated in 1979 from the University of Illinois with dual degrees in Computer Science and English and a minor in Philosophy.
From 1983 to 1984, Mical was software engineer at arcade video game and pinball creator Williams Electronics. He worked on special effects for Sinistar (1983) and coordinated the Star Rider LaserDisc racing project.
From 1984 to 1986, Mical worked for Amiga Corporation and then Commodore International on the development of the Amiga 1000 and later models. He created various development tools and the animation system software. He developed Intuition, the Amiga user interface system software.
From 1987 to 1989 he was vice-president of game technology at Epyx, reuniting with two ex-Amiga employees: Dave Needle and Dave Morse. He co-developed the first color handheld console, internally named "Handy." He was the co-designer of the hardware and put together run-time libraries, a debugger, art and audio tools, and an emulator. The system was acquired by Atari Corporation and brought to market as the Atari Lynx in 1989. He did some design for the launch titles Blue Lightning and Electrocop.
In 1990, Mical co-founded New Technologies Group (NTG), a company established to create a new game system, working again with Needle and Morse. Mical co-designed the hardware and headed the creation of the system's multitasking operating system, Portfolio. The company later merged with The 3DO Company and their technology became the base of the 32-bit console 3DO Interactive Multiplayer.
From 1996 to 2005, Mical worked on mobile and online projects. In 1996 and 1997, Mical was part of the creation of a joint company effort, joining Prolific and founding Glassworks, which developed online games. In 1998 and 1999, he was as consultant for Rjave. In 2000 and 2001, he was vice president of software at Red Jade which was developing a handheld console. In 2001 and 2002, he was chief architect of Fathammer, a company which provided software developm
|
https://en.wikipedia.org/wiki/MadSci%20Network
|
The Madsci Network is a website known primarily for its Ask-A-Scientist forum where users can ask questions to a panel of volunteer scientists. Each question, submitted via a Web interface, is reviewed by a volunteer moderator. If the question is intelligible, not a homework assignment, and has not been answered previously, it may be answered directly by the moderator, or forwarded to one of hundreds of volunteer scientists and professionals. The moderators match each question to a volunteer's area of expertise. After answering the question, the volunteer sends it back to the moderators who then review the answer prior to posting it on the web site. The moderator may ask the scientist to edit the answer or provide references for information. Thereafter, the majority of questions and answers are made publicly available in the extensive archives, which date back to 1996.
The Madsci Network hosts the Edible and Inedible Experiments Archive, a unique collection of easy science demos, and a guided tour of data from the Visible Human Project.
The Madsci Network gets approximately 600,000 unique visitors and roughly 3 million page views per month. It is a non-profit ask-a-scientist site with over 700 scientists distributed globally and has been cited in academic publications, web awards, sites/portals like yahoo.com, etc. The principals are: Founder and Executive Director, Dr. Lynn Bry, and Director of Research, Dr. Ricky J Sethi. Notable scientists who have answered questions on the website include Dr. Samuel Conway.
References
External links
The Madsci Network
American science websites
Question-and-answer websites
|
https://en.wikipedia.org/wiki/Zotob
|
"The Zotob worm and several variations of it, known as Rbot.cbq, SDBot.bzh and Zotob.d, infected computers at companies such as ABC, CNN, The Associated Press, The New York Times, and Caterpillar Inc." — Business Week, August 16, 2005.
Zotob is a computer worm which exploits security vulnerabilities in Microsoft operating systems like Windows 2000, including the MS05-039 plug-and-play vulnerability. This worm has been known to spread on Microsoft-ds or TCP port 445.
It was declared that the Zotob worms cost an average of $97,000 as well as 80 hours of cleanup per company affected.
Rbot variant
Zotob was derived from the Rbot worm. Rbot can force an infected computer to continuously restart. Its outbreak on August 16, 2005, was covered "live" on CNN television, as the network's own computers got infected. Zotob would self-replicate each time the computer rebooted, resulting in each computer having numerous copies of the file by the time it was purged. This is similar to the Blaster (Lovesan) worm.
Sequence of events
August 9, 2005: Security advisory"On August 9th, Microsoft released critical security advisory MS05-039 which revealed a vulnerability in the Plug-and-Play component of Windows 2000. Code to patch the loophole was also made available."
Virus writing"In the days since Microsoft's announcement, virus writers have released several variants of both Zotob and RBot, along with updated versions of older worms named SD-Bot and IRC-Bot, designed to take advantage of the newly discovered flaw."
August 13, 2005: Emerged on Saturday"The worms, called Zotob and Rbot, and variants of them, started emerging Saturday, computer security specialists said, and continued to propagate as corporate networks came to life at the beginning of the week."
August 16, 2005: Took down CNN live"Around 5 p.m. problems began at CNN facilities in New York and Atlanta before being cleared up about 90 minutes later.""CNN, breaking into regular programming, reported on air that personal computers running Windows 2000 at the cable news network were affected by a worm that caused them to restart repeatedly.""The Internet Storm Center, which tracks the worldwide impact of computer worms, indicated on its Web site that no major Internet attack was underway. Likely this is an isolated event, which became newsworthy because CNN got infected. We do not see any new threats at this point, the site read."
August 17, 2005: CIBC and other banks, companies affected"CIBC says the Zotob worm caused some isolated outages, but did not affect ATMs, Internet or phone banking. The virus also hit other Canadian businesses but has not caused widespread shutdowns."
August 26, 2005: A suspect is arrested in Morocco "Under the request of the FBI, Moroccan police arrests 18-year-old Farid Essebar, a Moroccan, suspected for being behind the spread of the virus."
September 16, 2006: Sentencing"The creators of the Zotob Windows worm Farid Essabar and his friend Achraf Bahloul were senten
|
https://en.wikipedia.org/wiki/Channel%20I/O
|
In computing, channel I/O is a high-performance input/output (I/O) architecture that is implemented in various forms on a number of computer architectures, especially on mainframe computers. In the past, channels were generally implemented with custom devices, variously named channel, I/O processor, I/O controller, I/O synchronizer, or DMA controller.
Overview
Many I/O tasks can be complex and require logic to be applied to the data to convert formats and other similar duties. In these situations, the simplest solution is to ask the CPU to handle the logic, but because I/O devices are relatively slow, a CPU could waste time waiting for the data from the device. This situation is called 'I/O bound'.
Channel architecture avoids this problem by processing some or all of the I/O task without the aid of the CPU by offloading the work to dedicated logic. Channels are logically self-contained, with sufficient logic and working storage to handle I/O tasks. Some are powerful or flexible enough to be used as a computer on their own and can be construed as a form of coprocessor, for example, the 7909 Data Channel on an IBM 7090 or IBM 7094; however, most are not. On some systems the channels use memory or registers addressable by the central processor as their working storage, while on other systems it is present in the channel hardware. Typically, there are standard interfaces between channels and external peripheral devices, and multiple channels can operate concurrently.
A CPU typically designates a block of storage as, or sends, a relatively small channel program to the channel in order to handle I/O tasks, which the channel and controller can, in many cases, complete without further intervention from the CPU (exception: those channel programs which utilize 'program controlled interrupts', PCIs, to facilitate program loading, demand paging and other essential system tasks).
When I/O transfer is complete or an error is detected, the controller typically communicates with the CPU through the channel using an interrupt. Since the channel normally has direct access to the main memory, it is also often referred to as a direct memory access (DMA) controller.
In the most recent implementations, the channel program is initiated and the channel processor performs all required processing until either an ending condition or a program controlled interrupt (PCI). This eliminates much of the CPU—Channel interaction and greatly improves overall system performance. The channel may report several different types of ending conditions, which may be unambiguously normal, may unambiguously indicate an error or whose meaning may depend on the context and the results of a subsequent sense operation. In some systems an I/O controller can request an automatic retry of some operations without CPU intervention. In earlier implementations, any error, no matter how small, required CPU intervention, and the overhead was, consequently, much higher. A program-controlled interrup
|
https://en.wikipedia.org/wiki/List%20of%20Baltimore%20Orioles%20broadcasters
|
Television
Radio
References
Baltimore Orioles
Broadcasters
Westinghouse Broadcasting
CBS Sports
CBS Radio Sports
Mid-Atlantic Sports Network
|
https://en.wikipedia.org/wiki/John%20Platt%20%28computer%20scientist%29
|
John Carlton Platt (born 1963) is an American computer scientist. He is currently a distinguished scientist at Google. Formerly he was a deputy managing director at Microsoft Research Redmond Labs. Platt worked for Microsoft from 1997 to 2015. Before that, he served as director of research at Synaptics.
Life and work
Platt was born in Elgin, Illinois, and matriculated at California State University, Long Beach, at the age of 14. After graduating from CSULB at the age of 18, he enrolled in a computer science PhD program at California Institute of Technology.
While a student at Caltech under astronomer Gene Shoemaker, he discovered two asteroids, 3259 Brownlee and 3237 Victorplatt at Palomar Observatory on 25 September 1984. The latter he named after his father Victor Platt, while the former was named by Gene Shoemaker. Shoemaker allowed Platt to name one of his discoveries, 3927 Feliciaplatt, which he named after his mother.
In August 2005, Apple Computer had its application for a patent on the interface of the popular iPod music player rejected by the United States Patent and Trademark Office. The reason appears to be that Platt had submitted a patent application for a similar interface design five months prior to Apple's claim.
Platt shared a 2005 Scientific and Technical Achievement Oscar from the Academy of Motion Picture Arts and Sciences with Demetri Terzopoulos for their pioneering work in physically-based computer-generated techniques used to simulate realistic cloth in motion pictures.
Platt invented sequential minimal optimization, a widely used method for training support vector machines, as well as Platt scaling, a method to turn SVMs (and other classifiers) into probability models.
References
External links
Asteroids discovered by John Platt
Machine Learning for Dummies
1963 births
California Institute of Technology alumni
California State University, Long Beach alumni
Discoverers of minor planets
Living people
Microsoft employees
People from Elgin, Illinois
Google employees
|
https://en.wikipedia.org/wiki/Intellisync
|
Intellisync Corporation was a provider of data synchronization software for mobile devices, such as mobile phones and personal digital assistants (PDAs). The company was acquired in 2006 by Nokia.
History
Puma Technology (known as Pumatech) was based in San Jose, California.
It was founded in August 1993 by Princeton classmates Bradley A. Rowe and Stephen A. Nicol.
The company was a pioneer in the development of mobile device data synchronization software in the early day of mobile device computing, with 36 total U.S. patents awarded. Three rounds of venture capital included investors Greylock Partners CSK Venture Capital, and Intel. In April 1996, Pumatech acquired IntelliLink Corporation, based in Nahsua, New Hampshire for $3.5 million.
It announced an initial public offering on the NASDAQ on 6 December 1996.
It raised about $37 million and was traded under the symbol PUMA.
Pumatech acquired SoftMagic in July 1998, ProxiNet in October 1999, NetMind in February 2000, Dry Creek Software in July 2000, and The Windward Group in October 2000.
In March 2003, it acquired the Starfish Software division of Motorola.
Pumatech acquired the Alpharetta, Georgia based Synchrologic in late 2003 and renamed itself Intellisync Corporation (after its IntelliSync product family) in 2004. It was traded under the symbol SYNC.
On 31 January 2006, stockholder approval was secured for Intellisync to be acquired by Nokia. On 10 February 2006, Nokia completed its acquisition.
In November 2006 Nokia announced integration with Exchange ActiveSync and its Eseries products.
After the Nokia acquisition, the Intellisync headquarters in San Jose closed and all employees moved to the Nokia office in Mountain View, California. The company had development offices in Alpharetta, Georgia, Bulgaria, New Delhi, Tokyo and Cluj-Napoca.
Nokia announced that the IntelliSync Desktop product was discontinued and the last date available to order the product was 19 July 2008. Product support was provided through 19 July 2010.
On 29 September 2008 Nokia announced it planned to cease developing or marketing its own behind-the-firewall business mobility software(Intellisync Mobility Product Suite). The appropriate technologies and expertise would reallocate to Nokia's consumer push e-mail service.
Nokia said it would integrate devices with software from vendors such as Microsoft, IBM, Cisco Systems and others.
Products
Pumatech's first product, released in 1997, was called TranXit. TranXit provided automatic file synchronization between two Windows-based PCs, directly competing with a then popular product called LapLink from Traveling Software, Inc. While LapLink was predominantly sold as a boxed retail product, Pumatech marketed TranXit directly to PC manufacturers who pre-installed the software on their systems. The company signed license agreements with IBM (ThinkPad), Compaq, Toshiba, Acer, Canon, NEC, Epson, and approximately 20 other PC manufacturers.
After the Intellilink
|
https://en.wikipedia.org/wiki/Security%20hacker
|
A security hacker is someone who explores methods for breaching defenses and exploiting weaknesses in a computer system or network. Hackers may be motivated by a multitude of reasons, such as profit, protest, information gathering, challenge, recreation, or evaluation of a system weaknesses to assist in formulating defenses against potential hackers.
Longstanding controversy surrounds the meaning of the term "hacker." In this controversy, computer programmers reclaim the term hacker, arguing that it refers simply to someone with an advanced understanding of computers and computer networks, and that cracker is the more appropriate term for those who break into computers, whether computer criminals (black hats) or computer security experts (white hats). A 2014 article noted that "the black-hat meaning still prevails among the general public". The subculture that has evolved around hackers is often referred to as the "computer underground".
History
Birth of subculture and entering mainstream: 1960s-1980s
The subculture around such hackers is termed network hacker subculture, hacker scene, or computer underground. It initially developed in the context of phreaking during the 1960s and the microcomputer BBS scene of the 1980s. It is implicated with 2600: The Hacker Quarterly and the alt.2600 newsgroup.
In 1980, an article in the August issue of Psychology Today (with commentary by Philip Zimbardo) used the term "hacker" in its title: "The Hacker Papers." It was an excerpt from a Stanford Bulletin Board discussion on the addictive nature of computer use. In the 1982 film Tron, Kevin Flynn (Jeff Bridges) describes his intentions to break into ENCOM's computer system, saying "I've been doing a little hacking here." CLU is the software he uses for this. By 1983, hacking in the sense of breaking computer security had already been in use as computer jargon, but there was no public awareness about such activities. However, the release of the film WarGames that year, featuring a computer intrusion into NORAD, raised the public belief that computer security hackers (especially teenagers) could be a threat to national security. This concern became real when, in the same year, a gang of teenage hackers in Milwaukee, Wisconsin, known as The 414s, broke into computer systems throughout the United States and Canada, including those of Los Alamos National Laboratory, Sloan-Kettering Cancer Center and Security Pacific Bank. The case quickly grew media attention, and 17-year-old Neal Patrick emerged as the spokesman for the gang, including a cover story in Newsweek entitled "Beware: Hackers at play", with Patrick's photograph on the cover. The Newsweek article appears to be the first use of the word hacker by the mainstream media in the pejorative sense.
Pressured by media coverage, congressman Dan Glickman called for an investigation and began work on new laws against computer hacking.
Neal Patrick testified before the U.S. House of Representatives on September
|
https://en.wikipedia.org/wiki/User%20interface%20management%20system
|
A User Interface Management System (UIMS) is a mechanism for cleanly separating process or business logic from Graphical user interface (GUI) code in a computer program. UIMS are designed to support N-tier architectures by strictly defining and enforcing the boundary between the business logic and the GUI. A fairly rigid Software architecture is nearly always implied by the UIMS, and most often only one paradigm of separation is supported in a single UIMS. A UIMS may also have libraries and systems such as graphical tools for the creation of user interface resources or data stores.
Generally, you cannot easily use multiple UIMS systems at the same time, so choosing the correct model for your UIMS is a critical design decision in any project. The choice of system is dependent upon the system(s) you wish to create user interfaces for, and the general style of your application. For example, if you want to create a web based front end, or just a standalone application or both that would be an important factor in choosing. If you want to deploy to the Macintosh, Windows and Linux, that would further influence your choice of a UIMS system.
There are many UIMS approaches described in research papers. However, there are not very many systems available commercially or through open source.
Models
In a frequently cited body of work, Foley and Wallace describe a "linguistic model" for user interface management consisting of a Presentation Layer, a Dialog Control layer and an Application layer. These layers correspond to the lexical, syntactic and semantic layers from formal language theory. While Foley's model is theoretically enlightening, it does not propose a specific practical system for separating code. There are also many interesting border cases that don't fall cleanly into one of these layers.
A more directly applicable theory of user interface management is the model–view–controller design pattern, which is described in detail in its own article. A recent variant of MVC is the model–view–presenter model which is similar to MVC, but has some interesting insights into the problem.
Implementations
A functional based system approaches all user interface actions as interfaces for functions. Dialogs exist solely to collect parameters for functions that are called when the dialog is closing. Menu Trees are one family of model implementations that follow this pattern.
Grammar based UIMS provide a specialized language for describing the user interface. Usually, this is a special language designed specifically for the presentation of user interface elements.
The Editing Model is a specialization of grammar based UIMS. They present all interaction as direct presentations of underlying presentation objects. Essentially, using the grammar of the programming language as the grammar for the GUI. A scroll bar may present an integer, a check box may present a boolean, a function is presented as a button or menu item. A dialog box or a menu is a presentation
|
https://en.wikipedia.org/wiki/High%20Seas%20Havoc
|
High Seas Havoc, known in Japan as and in Europe as Capt'n Havoc, is a video game that was made for the Sega Mega Drive/Genesis by Data East. It was also released in the arcades running on a Sega Mega Drive/Genesis based arcade cabinet.
Plot
The story is about an anthropomorphic pirate seal named Havoc (Lang in the Japanese version), his young sidekick Tide (Land in the Japanese version), a girl named Bridget, and an evil walrus pirate named Bernardo. Bernardo is looking for Emeralda, a gem with powers that can cause whole armies to be toppled. A map shows where Emeralda is located, and Bernardo is looking for the map. Havoc and Tide discover Bridget unconscious at a beach. When she wakes up in a dwelling, she instructs Havoc to keep her and the map safe. Havoc hides the map in a cliff. After Bernardo's henchmen kidnaps Bridget and Tide, Havoc sets off to rescue them.
Gameplay
Each level apart from the first two and last one have two acts. The Cape Sealph level was removed from the European version.
Development
Reception
High Seas Havoc received generally positive reviews.
Tony Ponce for Destructoid called the game a rip-off of Sonic the Hedgehog.
References
External links
Mainichi Interactive page on Captain Lang
Fictional pirates
Fictional pinnipeds
1993 video games
Sega Genesis games
Arcade video games
Data East video games
Video games developed in Japan
Video games about pirates
Data East arcade games
|
https://en.wikipedia.org/wiki/Ben%20Lomond%20%28Tasmania%29
|
{
"type": "ExternalData",
"service": "geoshape",
"ids": "Q816402",
"properties": {
"title": "Ben Lomond National Park",
"fill": "#447F06",
"stroke-width": 0
}
}
Ben Lomond is a mountain in the north-east of Tasmania, Australia.
The mountain is composed of a central massif with an extensive plateau above and high outlier peaks projecting from the mountain. The highest feature on the plateau is the unimposing summit of Legges Tor, at 1572 m, on the northern aspect of the plateau. The southern end of the plateau is dominated by Stacks Bluff, , which is an imposing feature that drops away to a cliffline above the surrounding foothills. The prominent outlier peaks of Ragged Jack (), Mensa Moor () and Tower Hill () surround the plateau.
Ben Lomond is east of Launceston in the Ben Lomond National Park. Tasmania's premier Alpine skiing operations are located at Ben Lomond with downhill skiing facilities in the State.
Its accessibility from Launceston, together with the existence of a ski village on the plateau make Ben Lomond an all year round favourite for tourists and hikers. Access to the village and summit can be made via several walking tracks or via a zig-zag road known as "Jacobs Ladder".
The locality of Ben Lomond is in the local government area of Northern Midlands in the Central region of Tasmania. The locality is about east of the town of Longford.
Nomenclature
The Tasmanian Aboriginal palawa kani name for Ben Lomond is and was recorded in various word lists as , toorbunna or . The meaning of this name is uncertain, but the suffix bunna/pina is thought to denote tableland or plateau and linguistic research suggests that the stem tur/tura means bluff or precipitous cliffs.
Modern etymological researchers of the Palawa lexicon assert that, in addition to , there were several names related to Ben Lomond:
- the plateau between the Nile River valley (Lake Youl) and Stacks Bluff
- a name recorded by John Glover - Taylor asserts that equates to the locality and = bluff- probably Stacks Bluff
- cf (i.e. - South Esk River) a contraction for the plains to the south of Stacks Bluff - Fingal Valley
- another name for a bluff at Ben Lomond (cf = bluff/cliffs)
Most of the Aboriginal names for Ben Lomond probably refer to Stacks Bluff or the southern division of the massif - as the toponym Ben Lomond was usually applied to the southern half of the mountain in 1800s Tasmania, when these words were recorded.
The lake on the southern aspect of the plateau, now known as Lake Youl, was known to the Aboriginal people as minamata, the prefix mena/miena being the aboriginal word for lake or lagoon and the suffix mata possibly referring to the surrounding topography. This name survives on modern maps as the toponym for the small lakes on the north-western aspect of the plateau - the Menamatta Tarns. One of the few examples in Tasmania of a land feature retaining its traditional name.
The South Esk River, which encir
|
https://en.wikipedia.org/wiki/Digital%20Accessible%20Information%20System
|
Digital accessible information system (DAISY) is a technical standard for digital audiobooks, periodicals, and computerized text. DAISY is designed to be a complete audio substitute for print material and is specifically designed for use by people with "print disabilities", including blindness, impaired vision, and dyslexia. Based on the MP3 and XML formats, the DAISY format has advanced features in addition to those of a traditional audio book. Users can search, place bookmarks, precisely navigate line by line, and regulate the speaking speed without distortion. DAISY also provides aurally accessible tables, references, and additional information. As a result, DAISY allows visually impaired listeners to navigate something as complex as an encyclopedia or textbook, otherwise impossible using conventional audio recordings.
DAISY multimedia can be a book, magazine, newspaper, journal, computerized text, or a synchronized presentation of text and audio. It provides up to six embedded "navigation levels" for content, including embedded objects such as images, graphics, and MathML. In the DAISY standard, navigation is enabled within a sequential and hierarchical structure consisting of (marked-up) text synchronized with audio. The original DAISY 2 specification (1998) was based on HTML and SMIL. The DAISY 2.02 revision (2001) was based on XHTML and SMIL. DAISY 3 (2005) is based on XML and is standardized as ANSI/NISO Z39.86-2005.
The DAISY Consortium was founded in 1996 and consists of international organizations committed to developing equitable access to information for people who have a print disability. The consortium was selected by the National Information Standards Organization (NISO) as the official maintenance agency for the DAISY/NISO Standard.
Specification
A Digital Talking Book (DTB) is a collection of electronic files arranged to present information to the target population via alternative media, namely, human or synthetic speech, refreshable Braille, or visual display, e.g., large print. The DTB files comprising the DAISY format is
Package File: A set of metadata describing the DTB
Textual content file: Contains the text of the document in XML
Audio Files: human or synthetic speech MP3 recordings
Image files: for visual displays
Synchronization files: synchronizes the different media files of the DTB during playback
Navigation control file: for viewing the document's hierarchical structure
Bookmark/Highlight file: support to user-set highlights
Resource file: for playback management
Distribution Information File: maps each SMIL file to a specific media unit
Access to materials
Since DAISY is often used by people with disabilities, many of the existing organizations which produce accessible versions of copyrighted content are moving to the DAISY standard, and slowly moving away from more traditional methods of distribution such as cassette tape.
In the United States, Learning Ally, AMAC Accessibility, Bookshare, the Int
|
https://en.wikipedia.org/wiki/AdventHealth%20Orlando
|
AdventHealth Orlando is a non-profit hospital owned by AdventHealth and is the largest in the hospital network. The hospital is a tertiary, research and academic medical center located in Orlando, Florida, servicing Central Florida and the Orange county region. It is the second largest hospital in Florida and the largest in Central Florida. AdventHealth Orlando is the 3rd largest hospital in the United States in 2023. AdventHealth Orlando is the oldest Seventh-day Adventist Hospital in the state of Florida.
History
In October 1908, Florida Sanitarium was founded when Seventh-day Adventists bought a farmhouse for $9,000. It had formerly been a tuberculosis sanitorium and was located between two lakes in the community of Formosa north of Orlando. Florida Sanitarium opened with 20 beds, two physicians, a dairy cattle and four patients.
In 1912, a building made of concrete was constructed across the farmhouse. In 1918, a third story was added to the sanitarium increasing the capacity to 60 beds. In 1925, a new wing was constructed connecting the farmhouse to the concrete building.
Beginning in the 1940s, Florida Sanitarium began using modern medicines, molecular diagnostic and surgical procedures. It also constructed new buildings to replace the old buildings.
In March 1969, Florida Sanitarium built a helipad.
In 1970, Florida Sanitarium changed its name to Florida Hospital Orlando.In 1986, Florida Hospital Orlando bought a helicopter and it was stationed at the hospital.
On January 2, 2019, Florida Hospital Orlando changed its name to AdventHealth Orlando. On March 11, 2019, AdventHealth Orlando filed with the city of Orlando to expand its emergency department by 45,000 square feet.
On October 21, 2020, 1,800 solar panel carport was installed at AdventHealth Orlando on top of its McRae parking garage. It can charge over thirty-two electric cars. It will create 1.3 million kilowatts yearly and will save over $4.6 million in energy costs. On October 12, 2021, a construction crane collapsed onto a parking garage that was being built at the AdventHealth Orlando campus. One construction worker was taken to Orlando Regional Medical Center with traumatic injuries.
In May 13, 2022, AdventHealth Orlando bought a second helicopter, they are both stationed in a 7,000 square foot hangar that is being leased at Orlando Executive Airport. It is also renovated an adjacent 10,000 square foot building to be used as an office for the Flight 1 programme and a simulator for training the flight and ground rescue fleets. The renovations were finished in 2023. The reason for adding a second helicopter in 2022, Flight 1 transported 1,000 patients to AdventHealth hospitals in florida in 2021.
In early February 2023, Loma Linda University School of Medicine partnered with AdventHealth Orlando, which will allow students to complete their third and fourth years at the hospital.
Services
On November 20, 2019, AdventHealth Orlando announced that it would stop paying l
|
https://en.wikipedia.org/wiki/Token%20passing
|
On a local area network, token passing is a channel access method where a packet called a token is passed between nodes to authorize that node to communicate. In contrast to polling access methods, there is no pre-defined "master" node. The most well-known examples are IBM Token Ring and ARCNET, but there were a range of others, including FDDI (Fiber Distributed Data Interface), which was popular in the early to mid 1990s.
Token passing schemes degrade deterministically under load, which is a key reason why they were popular for industrial control LANs such as MAP, (Manufacturing Automation Protocol). The advantage over contention based channel access (such as the CSMA/CD of early Ethernet), is that collisions are eliminated, and that the channel bandwidth can be fully utilized without idle time when demand is heavy. The disadvantage is that even when demand is light, a station wishing to transmit must wait for the token, increasing latency.
Some types of token passing schemes do not need to explicitly send a token between systems because the process of "passing the token" is implicit. An example is the channel access method used during "Contention Free Time Slots" in the ITU-T G.hn standard for high-speed local area networking using existing home wires (power lines, phone lines and coaxial cable).
See also
Cambridge Ring
HP Interface Loop (HP-IL)
Ring network
References
Channel access methods
|
https://en.wikipedia.org/wiki/MultiNet
|
Multilayered extended semantic networks (MultiNets) are both a knowledge representation paradigm and a language for meaning representation of natural language expressions that has been developed by Prof. Dr. Hermann Helbig on the basis of earlier Semantic Networks. It is used in a question-answering application for German called InSicht. It is also used to create a tutoring application developed by the university of University of Hagen to teach MultiNet to knowledge engineers.
MultiNet is claimed to be one of the most comprehensive and thoroughly described knowledge representation systems. It specifies conceptual structures by means of about 140 predefined relations and functions, which are systematically characterized and underpinned by a formal axiomatic apparatus. Apart from their relational connections, the concepts are embedded in a multidimensional space of layered attributes and their values. Another characteristic of MultiNet distinguishing it from simple semantic networks is the possibility to encapsulate whole partial networks and represent the resulting conceptual capsule as a node of higher order, which itself can be an argument of relations and functions. MultiNet has been used in practical NLP applications such as natural language interfaces to the Internet or question answering systems over large semantically annotated corpora with millions of sentences. MultiNet is also a cornerstone of the commercially available search engine SEMPRIA-Search, where it is used for the description of the computational lexicon and the background knowledge, for the syntactic-semantic analysis, for logical answer finding, as well as for the generation of natural language answers.
MultiNet is supported by a set of software tools and has been used to build large semantically based computational lexicons. The tools include a semantic interpreter WOCADI, which translates natural language expressions (phrases, sentences, texts) into formal MultiNet expressions, a workbench MWR+ for the knowledge engineer (comprising modules for automatic knowledge acquisition and reasoning), and a workbench LIA+ for the computer lexicographer supporting the creation of large semantically based computational lexica.
References
Hermann Helbig, Die semantische Struktur natürlicher Sprache - Wissensrepräsentation mit MultiNet. Springer, Heidelberg, 2001.
Hermann Helbig. Knowledge Representation and the Semantics of Natural Language, (2006) Springer, Berlin
Sven Hartrumpf, Hermann Helbig, Johannes Leveling, Rainer Osswald. An Architecture for Controlling Simple Language in Web Pages, eMinds: International Journal on Human-Computer Interaction, 1(2), 2006.
Sven Hartrumpf, Hermann Helbig, Tim vor der Brück, Christian Eichhorn: SemDupl: Semantic-based Duplicate Identification (2011)
External links
MultiNet and its software environment
Semantic Web
Knowledge representation
Footnotes
|
https://en.wikipedia.org/wiki/Radio%20JXL%3A%20A%20Broadcast%20from%20the%20Computer%20Hell%20Cabin
|
Radio JXL: A Broadcast from the Computer Hell Cabin is the third studio album by Dutch electronic music producer Junkie XL. Released in 2003, the double album features collaborations with a number of other artists. The songs on the first disc ("3PM") are generally short and vocally-driven much like modern pop, though many of them are more upbeat, with JXL relying on the more heavier electronic genres, including big beat and house. The second disc ("3AM") consists mostly of progressive house songs. Disc one is available in Australia as a single disc version with the same name as the double-disc version. On the CD, it has "3PM". The cover artwork is the same as the double disc version. This single disc version of "3PM" is the British/European version, containing a total of 19 tracks, instead of the US release of 17 tracks. Two additional albums were released from the website radiojxl.com, which has since been repurposed. These albums were entitled 7AM Ambient and 7AM Dance.
Track listing
CD version – "3AM" and "3PM"
Disc one
"Intro 3PM"
"Tennis"
"Crusher"
"Don't Wake Up Policeman"
"Reload"
"Spirits"
"Angels"
"Perfect Blue Sky"
"Between These Walls"
"Access to the Excess"
"Catch Up to My Step"
"Never Alone"
"Configuring Audio System"
"A Little Less Conversation"
"Beauty Never Fades"
"Broken"
"JXL Radio Technical Support"
Disc two
"Intro 3AM"
"Chilled"
"Dubzilla"
"Casio"
"Angels"
"Breezer"
"Nudge"
"Red"
"Beauty Never Fades"
"Cosmic Cure"
"Reshurc"
Note: These track lists refer to the US version. For the British or European version, see Discogs.
Downloadable "7AM" albums
7AM – Ambient
"Reload (7AM remix)"
"Talk Tonight"
"Streets"
"Twilight"
"Rivers"
"Tommy Dub"
"Sphere"
"All I Want"
"Mogwai"
7AM – Dance
"Tennis"
"Electro"
"Angels (7AM Surreal mix)"
"Techno Ibiza"
"Drubba Drub"
"Destiny"
"Egypt"
"Heat"
"Groovy"
"See the Light"
Singles
"Beauty Never Fades"
"Breezer"
"Catch Up to My Step"
"Don't Wake Up Policeman"
"Between These Walls"
References
Junkie XL albums
2003 albums
Universal Records albums
Roadrunner Records albums
|
https://en.wikipedia.org/wiki/Total%20sum%20of%20squares
|
In statistical data analysis the total sum of squares (TSS or SST) is a quantity that appears as part of a standard way of presenting results of such analyses. For a set of observations, , it is defined as the sum over all squared differences between the observations and their overall mean .:
For wide classes of linear models, the total sum of squares equals the explained sum of squares plus the residual sum of squares. For proof of this in the multivariate OLS case, see partitioning in the general OLS model.
In analysis of variance (ANOVA) the total sum of squares is the sum of the so-called "within-samples" sum of squares and "between-samples" sum of squares, i.e., partitioning of the sum of squares.
In multivariate analysis of variance (MANOVA) the following equation applies
where T is the total sum of squares and products (SSP) matrix, W is the within-samples SSP matrix and B is the between-samples SSP matrix.
Similar terminology may also be used in linear discriminant analysis, where W and B are respectively referred to as the within-groups and between-groups SSP matrices.
See also
Squared deviations from the mean
Sum of squares (statistics)
Lack-of-fit sum of squares
Expected mean squares
References
Least squares
|
https://en.wikipedia.org/wiki/Ghetto%20Blaster%20%28video%20game%29
|
"Ghetto Blaster" is a computer game that was released for the Commodore 64 in 1985. It was developed by two former employees of Taskset, a software house, Tony Gibson and Mark Harrison.
Gameplay and Story
Rockin' Rodney is the player character and protagonist of the game, and has been employed as a courier for the fictional record company Interdisc. The player must find and collect batteries for their ghetto blaster and afterwards locate ten cassette tape demos of dance music. When this is done, the player must get people to dance to the tape demos by listening to them on their boombox. The main aim of the game is to deliver the tapes to Interdisc by navigating through a maze of streets, alleyways, and cul-de-sacs, which are laid out and populated by various characters.
The street names are named after famous songs (e.g. "Blackberry Way", "Desolation Row"). A map is provided in the cassette inlay, and some of the characters reference others.
Reception
Zzap!64 praised the game's music and gameplay, but criticized its repetitive nature and lack of a real scoring system, which removes any potential replay value.
References
1985 video games
Action games
Commodore 64 games
Commodore 64-only games
Dance video games
Video games developed in the United Kingdom
Video games featuring black protagonists
Single-player video games
|
https://en.wikipedia.org/wiki/Pcap
|
In the field of computer network administration, pcap is an application programming interface (API) for capturing network traffic. While the name is an abbreviation of packet capture, that is not the API's proper name. Unix-like systems implement pcap in the libpcap library; for Windows, there is a port of libpcap named WinPcap that is no longer supported or developed, and a port named Npcap for Windows 7 and later that is still supported.
Monitoring software may use libpcap, WinPcap, or Npcap to capture network packets traveling over a computer network and, in newer versions, to transmit packets on a network at the link layer, and to get a list of network interfaces for possible use with libpcap, WinPcap, or Npcap.
The pcap API is written in C, so other languages such as Java, .NET languages, and scripting languages generally use a wrapper; no such wrappers are provided by libpcap or WinPcap itself. C++ programs may link directly to the C API or make use of an object-oriented wrapper.
Features
libpcap, WinPcap, and Npcap provide the packet-capture and filtering engines of many open-source and commercial network tools, including protocol analyzers (packet sniffers), network monitors, network intrusion detection systems, traffic-generators and network-testers.
libpcap, WinPcap, and Npcap also support saving captured packets to a file, and reading files containing saved packets; applications can be written, using libpcap, WinPcap, or Npcap, to be able to capture network traffic and analyze it, or to read a saved capture and analyze it, using the same analysis code. A capture file saved in the format that libpcap, WinPcap, and Npcap use can be read by applications that understand that format, such as tcpdump, Wireshark, CA NetMaster, or Microsoft Network Monitor 3.x.
The MIME type for the file format created and read by libpcap, WinPcap, and Npcap is application/vnd.tcpdump.pcap. The typical file extension is .pcap, although .cap and .dmp are also in common use.
History
libpcap was originally developed by the tcpdump developers in the Network Research Group at Lawrence Berkeley Laboratory. The low-level packet capture, capture file reading, and capture file writing code of tcpdump was extracted and made into a library, with which tcpdump was linked. It is now developed by the same tcpdump.org group that develops tcpdump.
pcap libraries for Windows
While libpcap was originally developed for Unix-like operating systems, a successful port for Windows was made, called WinPcap. It has been unmaintained since 2013, and several competing forks have been released with new features and support for newer versions of Windows.
WinPcap
WinPcap consists of:
x86 and x86-64 drivers for the Windows NT family (Windows NT 4.0, 2000, XP, Server 2003, Vista, 7, 8, and 10), which use Network Driver Interface Specification (NDIS) 5.x to read packets directly from a network adapter;
implementations of a lower-level library for the listed operating systems
|
https://en.wikipedia.org/wiki/Anything%20In%20Anything
|
Anything In Anything (AYIYA) is a computer networking protocol for managing IP tunneling protocols in use between separated Internet Protocol networks.
It is most often used to provide IPv6 transit over an IPv4 network link when network address translation masquerades a private network with a single IP address that may change frequently because of DHCP provisioning by Internet service providers.
Features
The protocol has the following features:
Tunneling of networking protocols within another IP protocol
Network security is provided by preventing tunneled packets to be spoofable or replayable
Transparent handling of network address translation
The endpoint of at least one of the two tunnel endpoints should be able to change to provide mobility features.
Tunnel brokers
Many consumer networks are provisioned by Internet service providers using network address translation (NAT) which precludes the usage of IP protocol 41 tunnels (IPv6 tunnelled in IPv4, either RFC 4213 or RFC 3056) unless they manually reconfigure their NAT setup. In some cases, this is impossible as the NAT cannot be configured to forward protocol 41 to a specific host. There might also be cases when multiple endpoints are behind the same NAT, when multiple NATs are used, or when the user has no control at all over the NAT setup. This is an undesired situation as it limits the deployment of IPv6, which was meant to solve the problem of the disturbance in end to end communications caused by NATs, which were created because of limited address space in the first place.
This problem can be solved by tunneling the IPv6 packets over either User Datagram Protocol (UDP), Transmission Control Protocol (TCP) or the Stream Control Transmission Protocol (SCTP). Taking into consideration that multiple separate endpoints could be behind the same NAT or that the public endpoint receives a new IP address, there is a need to identify the endpoint that certain packets are coming from and endpoints need to be able to change e.g. source addresses of the transporting protocol on the fly while still being identifiable as the same endpoint. The protocol described in this document is independent of the transport and payload's protocol. An example is IPv6-in-UDP-in-IPv4, which is a typical setup that can be used by IPv6 tunnel brokers.
Mobility
AYIYA may be used to provision mobile hosts by tunneling traffic from the Home Address to the Home Agent over an underlying network. Any remote host that the mobile host communicates with does not need AYIYA support. When the remote host does support AYIYA, it could also directly set up a tunnel with the mobile host establishing a direct tunnel. The remote host can determine whether a host supports AYIYA by querying for Domain Name System records and use a public/private key algorithm to authenticate the packets.
+-------------+ +------------+ ,--------. +-------------+
| Mobile Host | <--AYIYA--> | Home Agent | <----> { Intern
|
https://en.wikipedia.org/wiki/Keypad
|
A keypad is a block or pad of buttons set with an arrangement of digits, symbols, or alphabetical letters. Pads mostly containing numbers and used with computers are numeric keypads. Keypads are found on devices which require mainly numeric input such as calculators, television remotes, push-button telephones, vending machines, ATMs, point of sale terminals, combination locks, safes, and digital door locks. Many devices follow the E.161 standard for their arrangement.
Uses and functions
A computer keyboard usually has a small numeric keypad on the side, in addition to the other number keys on the top, but with a calculator-style arrangement of buttons that allow more efficient entry of numerical data. This number pad (commonly abbreviated to numpad) is usually positioned on the right side of the keyboard because most people are right-handed.
Many laptop computers have special function keys that turn part of the alphabetical keyboard into a numerical keypad as there is insufficient space to allow a separate keypad to be built into the laptop's chassis. Separate external plug-in keypads can be purchased.
Keypads for the entry of PINs and for product selection appear on many devices including ATMs, vending machines, point of sale payment devices, time clocks, combination locks and digital door locks.
In 1984, the first projected capacitance keypad was used to sense through the shop window of a travel agency (see projected capacitance/window keypad image). Later, they were installed in many Tourist Information shop windows throughout the UK. Due to their ability to operate through thick glass, and be unaffected by spilt beer, in 1990 projected capacitance keypads were used by MHG (Music Hire Group) to replace the selection keys in Pub Juke Boxes.
Key layout
The first key-activated mechanical calculators and many cash registers used "parallel" keys with one column of 0 to 9 for each position the machine could use. A smaller, 10-key input first started on the Standard Adding Machine in 1901. The calculator had the digit keys arranged in one row, with zero on the left, and 9 on the right. The modern four-row arrangement debuted with the Sundstrand Adding Machine in 1911.
There is no standard for the layout of the four arithmetic operations, the decimal point, equal sign or other more advanced mathematical functions on the keypad of a calculator.
The invention of the push-button telephone keypad is attributed to John E. Karlin, an industrial psychologist at Bell Labs in Murray Hill, New Jersey. On a telephone keypad, the numbers 1 through 9 are arranged from left to right, top to bottom with 0 in a row below 789 and in the center. Telephone keypads also have the special buttons labelled * (star) and # (octothorpe, number sign, "pound", "hex" or "hash") on either side of the zero key. The keys on a telephone may also bear letters which have had several auxiliary uses, such as remembering area codes or whole telephone numbers.
Origin of the order
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.