Split (1)

train · 97.6k rows

source stringlengths 32 199	text stringlengths 26 3k
https://en.wikipedia.org/wiki/Lufthansa%20Regional	Lufthansa Regional is an operational entity for regional and feeder flights performed by two regional airlines owned by Lufthansa within its route network. As part of Lufthansa's rebranding, the Lufthansa Regional brand name has gradually been removed from the public eye since early 2018. The repainted aircraft no longer wear Lufthansa Regional titles. Overview Lufthansa Regional was founded as the successor of similar Team Lufthansa, which consisted of predominantly independent airlines contracted by Lufthansa. As of January 2018, Lufthansa Regional consists of two members, Air Dolomiti and Lufthansa CityLine, which are both fully owned by Lufthansa. They are based at Lufthansa's hubs at Frankfurt Airport and Munich Airport and carry 10.5 million passengers a year mostly to minor domestic and European destinations. As part of Lufthansa's new corporate design introduced in early 2018, Lufthansa Regional aircraft operated by Lufthansa CityLine are also receiving the new livery with the "Lufthansa." "Regional" titles are being removed from the fuselages of Lufthansa Regional aircraft and replaced by "Lufthansa" titles. As of March 2020, one sole route remained as operated by Air Dolomiti under the Lufthansa brand while all other of their operations are codeshared using their own brand name. Lufthansa Regional before 2004 Team Lufthansa was founded in 1996 by Lufthansa in the wake of the deregulation of the airline market as new competitors like Deutsche BA challenged established airlines. Besides connecting point-to-point destinations, the alliance also provided Lufthansa flights on niche routes from Frankfurt and Munich. The founding members were later expanded by the accession of Rheintalflug, Air Littoral and Cirrus Airlines. The alliance ceased to exist in 2004, when Lufthansa reorganized its regional network as Lufthansa Regional. Member airlines Current members Lufthansa Regional flights are operated by two partner airlines based at Lufthansa's hub airports in Frankfurt and Munich. Air Dolomiti (also operates some routes under their own brand) Lufthansa CityLine Former members Augsburg Airways (ceased operations by October 2013 as the contract with Lufthansa wasn't renewed) Contact Air (ceased operations by October 2012 as the contract with Lufthansa wasn't renewed, remaining assets taken over by now defunct OLT Express Germany) Eurowings (until 25 October 2014 when Eurowings started flying exclusively on behalf of Germanwings) Fleet Current fleet As of December 2022, the combined fleet of both airlines operating for Lufthansa Regional consists of the following aircraft: Historical fleet Current members historical fleet Air Dolomiti For all of the historical fleet of Air Dolomiti, see: Air Dolomiti § Historic fleet Lufthansa Cityline For the other Lufthansa Cityline historical operations, see: Lufthansa CityLine § Historical fleet Former members historical fleet Augsburg Airways Only showing aircraft that we
https://en.wikipedia.org/wiki/Silesian%20Air	Silesian Air is a defunct scheduled, passenger and cargo airline, formerly based in Poland. Its main base was at Katowice International Airport. Code data ICAO Code: LSN (not current) Callsign: SILESIAN (not current) History The airline was established in 2001 and started operations were started in 2003. Silesian Air was 100% owned by GTL. It has flown since 2005. Fleet The Silesian Air fleet consisted of 1 ATR 42-300 aircraft (at January 2005). Defunct airlines of Poland Airlines established in 2001 Airlines disestablished in 2005 2001 establishments in Poland 2005 disestablishments in Poland
https://en.wikipedia.org/wiki/Launchd	launchd is an init and operating system service management daemon created by Apple Inc. as part of macOS to replace its BSD-style init and SystemStarter. There have been efforts to port launchd to FreeBSD and derived systems. Components There are two main programs in the launchd system: launchd and launchctl. launchd manages the daemons at both a system and user level. Similar to xinetd, launchd can start daemons on demand. Similar to watchdogd, launchd can monitor daemons to make sure that they keep running. launchd also has replaced init as PID 1 on macOS and as a result it is responsible for starting the system at boot time. Configuration files define the parameters of services run by launchd. Stored in the LaunchAgents and LaunchDaemons subdirectories of the Library folders, the property list-based files have approximately thirty different keys that can be set. launchd itself has no knowledge of these configuration files or any ability to read them - that is the responsibility of "launchctl". launchctl is a command line application which talks to launchd using IPC and knows how to parse the property list files used to describe launchd jobs, serializing them using a specialized dictionary protocol that launchd understands. launchctl can be used to load and unload daemons, start and stop launchd controlled jobs, get system utilization statistics for launchd and its child processes, and set environment settings. launchd launchd has two main tasks. The first is to boot the system, and the second is to load and maintain services. Here is a simplified view of the Mac OS X Tiger system startup on a PowerPC Mac (on an Intel Mac, EFI replaces Open Firmware and boot.efi replaces BootX): Open Firmware activates, initializes the hardware, and then loads BootX. BootX loads the kernel, spins the pinwheel cursor, and loads any needed kernel extensions (kexts). The kernel loads launchd. launchd runs /etc/rc, various scripts which scan through /System/Library/LaunchDaemons and /Library/LaunchDaemons, calling launchctl on the plists as needed, then launchd starts the login window. In step 4, the startup scripts scan through a few different directories for jobs to run. There are two different directories that are scanned: The LaunchDaemons directories contain items that will run as root, generally background processes. The LaunchAgents directories contain jobs, called agent applications, that will run as a user or in the context of userland. These may be scripts or other foreground items, and they can even include a user interface. These directories are all kept in the typical Library directories of Mac OS X. launchd is very different from SystemStarter in that it may not actually launch all the daemons at boot time. Key to launchd, and similar to xinetd, is the idea of launch-on-demand daemons. When launchctl scans through the job plists at boot time, it asks launchd to reserve and listen on all of the ports requested by those jobs. If so indicat
https://en.wikipedia.org/wiki/InnoDB	InnoDB is a storage engine for the database management system MySQL and MariaDB. Since the release of MySQL 5.5.5 in 2010, it replaced MyISAM as MySQL's default table type. It provides the standard ACID-compliant transaction features, along with foreign key support (Declarative Referential Integrity). It is included as standard in most binaries distributed by MySQL AB, the exception being some OEM versions. Description InnoDB became a product of Oracle Corporation after its acquisition of the Finland-based company Innobase in October 2005. The software is dual licensed; it is distributed under the GNU General Public License, but can also be licensed to parties wishing to combine InnoDB in proprietary software. InnoDB supports: Both SQL and XA transactions Tablespaces Foreign keys Full text search indexes, since MySQL 5.6 (February 2013) and MariaDB 10.0 Spatial operations, following the OpenGIS standard Virtual columns, in MariaDB See also Comparison of MySQL database engines References External links Mysqltutorial.org, InnoDB and other table types in MySQL The InnoDB Storage Engine, in the MySQL manual. Database engines MySQL MariaDB Oracle software
https://en.wikipedia.org/wiki/Wendell%20Goler	Wendell Goler (July 26, 1949 – March 3, 2020) was the Senior White House and Foreign Affairs correspondent for Fox News Channel, joining the network on its inception in 1996. He retired on December 3, 2014. During his time at the network, he covered several major political stories, including the impeachment of President Bill Clinton and President Bush's post-September 11, 2001 policy initiatives. Early life and education Goler was a native of Jackson, Michigan, and attended the University of Michigan. Career In June 2011, Goler was moved from the White House correspondent position to an expanded role as part of changes in FNC's Washington Bureau. He was replaced by Ed Henry, who moved to FNC from Cable News Network. Before joining FNC, Goler served as a White House correspondent for Associated Press Broadcast Services. Responsible for all radio and television network coverage of domestic and foreign presidential activities, Goler anchored all presidential news conferences for the service. Previously, he was a reporter for several Washington, D.C., stations, including WJLA-TV and WRC-TV, and was the afternoon drive anchor at WRC-AM. Death Goler died on March 3, 2020, due to kidney failure. References External links Bio on FOXNews.com 1949 births 2020 deaths American political journalists American television reporters and correspondents Fox News people Associated Press reporters African-American journalists University of Michigan alumni Journalists from Washington, D.C. Radio personalities from Washington, D.C. Television personalities from Detroit Journalists from Michigan People from Jackson, Michigan 20th-century African-American people 21st-century African-American people
https://en.wikipedia.org/wiki/List%20of%20Michigan%20locations%20by%20per%20capita%20income	Michigan has an estimated per capita income of $27,549 and median household income of $50,803 Michigan counties by per capita income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. References Michigan Income income
https://en.wikipedia.org/wiki/List%20of%20Minnesota%20locations%20by%20per%20capita%20income	Minnesota is the tenth richest state in the United States of America, with a per capita income of $23,198 (2000). Minnesota Counties Ranked by Per Capita Income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. Minnesota Places Ranked by Per Capita Income Woodland, Minnesota – $95,495 Minnetonka Beach, Minnesota – $91,844 Sunfish Lake, Minnesota – $82,347 North Oaks, Minnesota – $72,686 Orono, Minnesota – $65,825 Wayzata, Minnesota – $63,859 Greenwood, Minnesota – $63,200 Dellwood, Minnesota – $61,592 Deephaven, Minnesota – $58,544 Tonka Bay, Minnesota – $50,825 Mendota Heights, Minnesota – $49,589 Medina, Minnesota – $49,127 Medicine Lake, Minnesota – $45,942 Grant, Minnesota – $44,486 Shorewood, Minnesota – $44,425 Edina, Minnesota – $44,195 Lilydale, Minnesota – $42,724 Minnetonka, Minnesota – $40,410 Minnetrista, Minnesota – $40,217 Birchwood Village, Minnesota – $40,102 Wacouta, Minnesota – $39,709 Minneiska, Minnesota – $39,223 Victoria, Minnesota – $38,929 Eden Prairie, Minnesota – $38,854 Pine Springs, Minnesota – $38,383 St. Marys Point, Minnesota – $36,905 Afton, Minnesota – $36,338 Plymouth, Minnesota – $36,309 Chanhassen, Minnesota – $36,008 Northrop, Minnesota – $35,785 Independence, Minnesota – $35,753 Forest Lake, Minnesota - $35,334 Tamarack, Minnesota – $35,197 Golden Valley, Minnesota – $34,094 Lake Shore, Minnesota – $33,387 Lake Elmo, Minnesota – $33,007 Woodbury, Minnesota – $32,606 Shoreview, Minnesota – $32,399 Marine on St. Croix, Minnesota – $32,383 Prior Lake, Minnesota – $32,089 Vadnais Heights, Minnesota – $30,891 Maple Grove, Minnesota – $30,544 Mound, Minnesota – $30,309 Spring Park, Minnesota – $30,290 Long Beach, Minnesota – $30,207 Eagan, Minnesota – $30,167 Lakeland, Minnesota – $30,019 Lakeland Shores, Minnesota – $29,789 Bloomington, Minnesota – $29,782 Arden Hills, Minnesota – $29,609 Apple Valley, Minnesota – $29,477 Corcoran, Minnesota – $29,467 Greenfield, Minnesota – $29,270 Manhattan Beach, Minnesota – $29,268 Excelsior, Minnesota – $29,127 St. Louis Park, Minnesota – $28,970 Mahtomedi, Minnesota – $28,930 Pleasant Lake, Minnesota – $28,811 Gem Lake, Minnesota – $28,750 Long Lake, Minnesota – $28,385 St. Rosa, Minnesota – $28,282 Oronoco, Minnesota – $27,965 Hanover, Minnesota – $27,826 Dayton, Minnesota – $27,756 Roseville, Minnesota – $27,755 New Brighton, Minnesota – $27,574 Loretto, Minnesota – $27,443 East Gull Lake, Minnesota – $27,329 Crosslake, Minnesota – $27,227 Stillwater, Minnesota – $27,163 Burnsville, Minnesota – $27,093 Waconia, Minnesota – $26,996 Savage, Minnesota – $26,858 Hopkins, Minnesota – $26,759 Mendota, Minnesota – $26,745 Regal, Minnesota – $26,710 Longville, Minnesota – $26,524 Lakeville, Minnesota – $26,492 Andover, Minnesota – $26,317 Saint Anthony Village, Minnesota – $26,290 Nisswa, Minnesota – $26,265 Ramsey, Minnesota – $2
https://en.wikipedia.org/wiki/List%20of%20Mississippi%20locations%20by%20per%20capita%20income	Mississippi is the poorest state in the United States of America, with a per capita income of $20,670 (2012). Mississippi counties ranked by per capita income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. References Economy of Mississippi Mississippi Income
https://en.wikipedia.org/wiki/List%20of%20Missouri%20locations%20by%20per%20capita%20income	Missouri is the 30th richest state in the United States of America, with a per capita income of $19,936 (2000). Missouri counties ranked by per capita income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. References Missouri Economy of Missouri Income
https://en.wikipedia.org/wiki/List%20of%20Montana%20locations%20by%20per%20capita%20income	Montana is the forty-sixth richest state in the United States of America, with a per capita income of $17,151 (2000). Montana counties ranked by per capita income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. Montana places ranked by per capita income Cooke City-Silver Gate, Montana – $31,618 Big Sky, Montana – $31,492 Rollins, Montana – $27,255 Jette, Montana – $25,808 West Havre, Montana – $24,823 Opheim, Montana – $24,680 Whitefish, Montana – $23,098 Joplin, Montana – $22,014 Saddle Butte, Montana – $22,768 Clancy, Montana – $22,492 Kings Point, Montana – $22,827 Jefferson City, Montana – $21,953 Montana City, Montana – $21,774 Wye, Montana – $21,553 Frenchtown, Montana – $21,225 Absarokee, Montana – $20,677 Colstrip, Montana – $20,336 Bigfork, Montana – $20,314 Helena Valley Northeast, Montana – $20,283 Neihart, Montana – $20,266 Helena, Montana – $20,020 Finley Point, Montana – $19,575 Beaver Creek, Montana – $19,566 Westby, Montana – $19,438 Carter, Montana – $19,397 Billings, Montana – $19,207 Virginia City, Montana – $19,182 West Yellowstone, Montana – $19,136 Red Lodge, Montana – $19,090 Helena Valley West Central, Montana – $18,920 Winston, Montana – $18,846 Seeley Lake, Montana – $18,825 Coram, Montana – $18,799 Flaxville, Montana – $18,567 Lakeside, Montana – $18,533 Custer, Montana – $18,532 Dayton, Montana – $18,501 Lolo, Montana – $18,369 Helena West Side, Montana – $18,299 Black Eagle, Montana – $18,269 Four Corners, Montana – $18,185 Wisdom, Montana – $18,172 Wibaux, Montana – $18,105 Great Falls, Montana – $18,059 Forsyth, Montana – $17,994 Fort Peck, Montana – $17,943 Helena Valley Northwest, Montana – $17,910 Orchard Homes, Montana – $17,885 Gardiner, Montana – $17,810 Columbus, Montana – $17,689 Gildford, Montana – $17,648 Florence, Montana – $17,626 Victor, Montana – $17,599 Rocky Point, Montana – $17,576 Big Timber, Montana – $17,569 Baker, Montana – $17,461 Jordan, Montana – $17,426 Fort Shaw, Montana – $17,381 East Glacier Park Village, Montana – $17,318 Ennis, Montana – $17,310 Missoula, Montana – $17,166 Scobey, Montana – $17,150 Butte-Silver Bow (balance), Montana – $17,068 Bridger, Montana – $17,060 Manhattan, Montana – $17,024 Laurel, Montana – $16,953 Park City, Montana – $16,912 Sidney, Montana – $16,911 Rudyard, Montana – $16,889 Lewistown, Montana – $16,817 Amsterdam-Churchill, Montana – $16,767 Ballantine, Montana – $16,707 Livingston, Montana – $16,636 Big Arm, Montana – $16,620 Power, Montana – $16,527 Hingham, Montana – $16,525 Kicking Horse, Montana – $16,524 Elliston, Montana – $16,501 Miles City, Montana – $16,449 Dillon, Montana – $16,432 Saco, Montana – $16,421 Malta, Montana – $16,405 Medicine Lake, Montana – $16,405 Reed Point, Montana – $16,389 St. Marie, Montana – $16,314 Alder, Montana – $16,300 Glasgow, Montana – $16,246 Kalispell, Montana
https://en.wikipedia.org/wiki/List%20of%20New%20York%20locations%20by%20per%20capita%20income	New York is the sixth richest state in the United States of America, with a per capita income of $40,272.29 (2004). New York counties ranked by per capita income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. References New York Economy of New York (state) Income
https://en.wikipedia.org/wiki/List%20of%20North%20Carolina%20locations%20by%20per%20capita%20income	North Carolina is the twenty-eighth richest state in the United States of America, with a per capita income of $20,307 (2000). North Carolina Counties Ranked by Per Capita Income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. References United States locations by per capita income Economy of North Carolina Income
https://en.wikipedia.org/wiki/Instance%20%28computer%20science%29	When a computer system creates a new context based on a pre-existing model or scheme, the model is said to have been instantiated. The encapsulated context that results from this instantiation process is referred to as an instance of the model or scheme. This general concept applies specifically across computer science in several ways. Object-oriented programming Typically, OOP object instances share a data layout scheme in common with numerous other runtime instances—particularly those of the same or similar data type. In order to ensure that the values stored in each instance are kept separate for the duration of their lifetimes, the system must allocate—and privately associate with each respective new context—a distinct copy of this layout image. This prevents the values in one instance from interfering with the values in any other. Machine identity A computer instance can be a software state which exposes an operating system or other hosting environment. Available resources in this virtual machine typically include access to storage, a CPU, and GPU, for example. Computer graphics In computer graphics, a polygonal model can be instantiated in order to be drawn several times in different locations in a scene. This is a technique that can be used to improve the performance of rendering, since a portion of the work needed to display each instance is reused. Operating systems In the context of POSIX-oriented operating systems, the term "(program) instance" typically refers to any executing process instantiated from that program (via system calls, e.g. fork() and exec()); that is, each executing process in the OS is an instance of some program which it has been instantiated from. References Object (computer science)
https://en.wikipedia.org/wiki/Poul-Henning%20Kamp	Poul-Henning Kamp (; born 1966) is a Danish computer software developer known for work on various projects including FreeBSD and Varnish. He currently resides in Slagelse, Denmark. Involvement in the FreeBSD project Poul-Henning Kamp has been committing to the FreeBSD project for most of its duration. He is responsible for the widely used MD5crypt implementation of the MD5 password hash algorithm, a vast quantity of systems code including the FreeBSD GEOM storage layer, GBDE cryptographic storage transform, part of the UFS2 file system implementation, FreeBSD Jails, malloc library, and the FreeBSD and NTP timecounters code. Varnish cache He is the lead architect and developer for the open source Varnish cache project, an HTTP accelerator. Dispute with D-Link In 2006, Kamp had a dispute with electronics manufacturer D-Link in which he claimed they were committing NTP vandalism by embedding the IP address of his NTP servers in their routers. The dispute was resolved in April 2006. Other A post by Kamp on the FreeBSD mailing lists is responsible for the popularization of the term bike shed discussion, and the derived term bikeshedding, to describe Parkinson's law of triviality in open source projects - when the amount of discussion that a subject receives is inversely proportional to its importance. Poul-Henning Kamp is known for his preference of a Beerware license to the GNU General Public License (GPL). Publications Poul-Henning Kamp has published a substantial number of articles over the years in publications like Communications of the ACM and ACM Queue mostly on the topics of computing and time keeping. A selection of publications: USENIX ATC 1998 FREENIX track, "malloc(3) Revisited" USENIX BSDCon 2003, GBDE-GEOM Based Disk Encryption USENIX BSDCon 2002, Rethinking /dev and devices in the UNIX kernel ACM Queue: Building Systems to be Shared Securely ACM Queue: You're doing it wrong ACM Queue: A Generation Lost in the Bazaar Communications of the ACM 2011: The Most Expensive One-Byte Mistake Communications of the ACM 2011: The One-Second War References External links people.freebsd.org homepage phk.freebsd.dk homepage Blog in Danish Another blog in Danish Resolution of D-Link Dispute Varnish cache 1966 births Living people Danish computer programmers Danish computer scientists Free software programmers FreeBSD people Articles containing video clips People from Slagelse
https://en.wikipedia.org/wiki/Harvard%20Library	Harvard Library is the network of Harvard University's libraries and services. It is the oldest library system in the United States and both the largest academic library and largest private library in the world. Its collection holds over 20 million volumes, 400 million manuscripts, 10 million photographs, and one million maps. Harvard Library holds the third largest collection of all libraries in the nation after the Library of Congress and Boston Public Library. Based on the number of items held, it is the fifth largest library in the United States. Harvard Library is a member of the Research Collections and Preservation Consortium (ReCAP); other members include Columbia University Libraries, Princeton University Library, New York Public Library, and Ivy Plus Libraries Confederation, making over 90 million books available to the library's users. The library is open to current Harvard affiliates, and some events and spaces are open to the public. The largest and most recognized building in the Harvard Library system is Widener Library in Harvard Yard. History Harvard's library system grew primarily from personal donations, including from John Harvard and John Hull. John Harvard was a Puritan minister who accumulated 400 books spreading word of his faith. These volumes were left to Harvard, initiating the library's collection. The works in this collection soon became obsolete, as Harvard Library quickly changed to an academic institute and found little need for the theological titles. Until 1676, the library was based in Old College building. That year, it moved to Harvard Hall, where it remained until 1764 when the building and the library's entire collection was destroyed in a fire. The collection had 5,000 titles and was the largest collection in British America before the fire. By 1764 it was the largest library in British America, with 5,000 volumes, but disaster struck that year when the library was destroyed by fire. A new Harvard Hall was built, and 15,000 books were collected to create the new library. After the fire, readers in the library were not allowed candles or lamps and if there was a fire burning in the hearth, a librarian or assistant had to be present. Patrons were allowed to borrow and return up to three books at a time on Friday mornings and were allowed to keep them for up to six weeks. Thomas Hollis V, great-nephew of one of the university's early benefactors, began shipping thousands of specially chosen volumes to the library. Hollis continued to send books regularly until his death in 1774, and he bequeathed £500 for the university to continue acquiring books. This became Harvard's first endowed book fund, and the fund has grown annually since. Harvard Library's online catalog, HOLLIS, a bacronym for "Harvard On-Line Library Information System", is named after him. In 1841, with space limited in Harvard Hall, the library was moved to Gore Hall in 1841. In 1912, the library moved again after Gore Hall became u
https://en.wikipedia.org/wiki/Cordillera	A cordillera is an extensive chain and/or network system of mountain ranges, such as those in the west coast of the Americas. The term is borrowed from Spanish, where the word comes from , a diminutive of ('rope'). The term is most commonly used in physical geography and is particularly applied to the various large mountain systems of the American Cordillera, such as the Andes of South America, and less frequently to other mountain ranges in the "ridge" that rims the Pacific Ocean. In Colombia and Venezuela, cordilleras are named according to their position: Cordillera Occidental, Central, and Oriental. Various local names are used for the cordilleras in Ecuador, Peru, Bolivia, Chile and Argentina. Such mountain systems have a complex structure, which is usually the result of folding and faulting accompanied by volcanic activity. In South America, the ranges include numerous volcanic peaks. The Andes cordillera has Ojos del Salado, the highest active volcano in the world and second-highest point in the Western Hemisphere (though not itself a volcano, Argentina's Aconcagua, at , is the highest point in the Western Hemisphere). Some of the volcanoes have been active in historical times. Aside from the volcanic peaks, the cordilleran crests include many narrow ridges, some of which reach into the zone of permanent snow. Between the ranges are numerous inhabited valleys, basins and low plateaus, with a wide range of elevations. Notable cordilleras Alborz Cordillera, northern Iran (also written as Elburz) American Cordillera, the mountain ranges forming the western backbone of North America and South America North American Cordillera (also called Pacific Cordillera or Western Cordillera of North America), comprising the mountain ranges of western North America Cordillera Central, Costa Rica Cordillera Central, Dominican Republic on the island of Hispaniola Cordillera Central, Puerto Rico Cordillera Neovolcánica, an active volcanic belt in Mexico Mexican Cordillera, consisting of the Juarez Segment, the Huayacocotla Segment, the Victoria Segment, and the Nuevoleones Cordillera Cordillera de los Andes (also called the Andes Mountains or South American Cordillera), comprising the mountain ranges of western South America Cordillera Blanca, in Peru Cordillera de Mérida, in Venezuela Cordillera Central, Andes (Spanish: "central mountains"), several mountain ranges share the name, such as the one in Bolivia, Colombia, Ecuador and Peru Cordillera Occidental ("western mountains"), several mountain ranges share the name, such as the one in Bolivia, Colombia, Ecuador and Peru Cordillera Oriental ("eastern mountains"), several mountain ranges share the name, such as the one in Bolivia, Colombia, Ecuador and Peru Cordillera de la Costa ("coastal mountains") of Chile Cordillera Paine, in Torres del Paine National Park in Chilean Patagonia Cordillera de la Costa of Venezuela Annamese Cordillera (Annamite Range), in Laos and Vietnam Arctic Co
https://en.wikipedia.org/wiki/A%20Rape%20in%20Cyberspace	"A Rape in Cyberspace, or How an Evil Clown, a Haitian Trickster Spirit, Two Wizards, and a Cast of Dozens Turned a Database into a Society" is an article written by freelance journalist Julian Dibbell and first published in The Village Voice in 1993. The article was later included in Dibbell's book My Tiny Life on his LambdaMOO experiences. Lawrence Lessig has said that his chance reading of Dibbell's article was a key influence on his interest in the field. Sociologist David Trend called it "one of the most frequently cited essays about cloaked identity in cyberspace". History Julian Dibbell's journalism career began in the music industry, though his writings eventually came to focus mainly the Internet, including various subcultures such as LambdaMOO, a MUD, which itself was further divided into subcultures, a phenomena he inadvertently encountered through his girlfriend. One day, when he was having difficulty contacting her by phone, he searched for her in LambdaMOO because he knew she was a visitor. When he found her, she had been in a meeting regarding how to resolve the issue of Mr. Bungle. "A Rape in Cyberspace" describes a "cyberrape" that took place on a Monday night in March 1993 and discusses the repercussions of this act on the virtual community and subsequent changes to the design of the MUD program. LambdaMOO allows players to interact using avatars. The avatars are user-programmable and may interact automatically with each other and with objects and locations in the community. Users interacted through script, as there were no graphics or images on the MUD at the time. The "cyberrape" itself was performed by a player named Mr. Bungle, who leveraged a "voodoo doll" subprogram that allowed him to make actions that were falsely attributed to other characters in the virtual community. The "voodoo doll" subprogram was eventually rendered useless by a character named Zippy. These actions, which included describing sexual acts that characters performed on each other and forcing the characters to perform acts upon themselves, went far beyond the community norms to that point and continued for several hours. They were interpreted as sexual violation of the avatars who were made to act sexually, and incited outrage among the LambdaMOO users, raising questions about the boundaries between real-life and virtual reality, and how LambdaMOO should be governed. Following Mr. Bungle's actions, several users posted on the in-MOO mailing list, *social-issues, about the emotional trauma caused by his actions. One user whose avatar was a victim, called his voodoo doll activities "a breach of civility" while, in real life, "post-traumatic tears were streaming down her face". However, despite the passionate emotions including anger voiced by many users on LambdaMOO, none were willing to punish the user behind Mr. Bungle through real-life means. Three days after the event, the users of LambdaMOO arranged an online meeting, which Dibbell attended
https://en.wikipedia.org/wiki/PDFCreator	PDFCreator is an application for converting documents into Portable Document Format (PDF) format on Microsoft Windows operating systems. It works by creating a virtual printer that prints to PDF files, and thereby allows practically any application to create PDF files by choosing to print from within the application and then printing to the PDFCreator printer. In addition to PDFCreator Free, there are three business editions with additional features: PDFCreator Professional, PDFCreator Server and PDFCreator Terminal Server. Since 2009, PDFCreator has included closed source adware, toolbars and other software that is installed by default. Implementation The application is written in Microsoft C# and released to the public at no charge. It works with 64-bit and 32-bit Windows versions including Windows 11. The actual PDF generation is handled by Ghostscript, which is included in the setup packages. Besides being installed as a virtual printer, PDFCreator can be associated with .ps files to manually convert PostScript to PDF format. PDFCreator can convert to the following file formats: PDF (including PDF/A (PDF/A-1b, PDF/A-2b and PDF/A-3b) and PDF/X (X-3:2002, X-3:2003 and X-4)), PNG, JPEG, TIFF, TXT. It also allows to digitally sign PDF documents. PDFCreator allows any COM enabled application to make use of its functionality. The business editions of PDFCreator allow users to write their own C# scripts with access to the entire job data. These custom scripts can be integrated directly before and after the conversion. They have full access to the .NET-framework and can reference compatible external libraries. PDFCreator allows the user to disable printing, copying of text or images and modifying the original document. The user can also choose between two types of passwords, user and owner, to restrict PDF files in several ways. The former is required to open the PDF file, while the latter is necessary in order to change permissions and password. Encryption can be either Low (128 Bit), Medium (128 Bit AES) or High (256 Bit AES), with the latter only being available in the PDFCreator Business editions. PDFCreator provides the possibility for automating certain tasks, for example with the help of user tokens. These placeholders for values, like today’s date, username, or e-mail address can be helpful when printing many similar files like invoices. With PDFCreator users can verify their authorship of a document with digital signatures. This feature is part of all PDFCreator editions, including PDFCreator Free. Starting with version 0.9.6, there is full support for Windows Vista and version 0.9.7 provides support for Windows 7. Starting with version 3.0.0, PDFCreator ended support for Windows XP. Starting with version 4.4.0 there is full support for Windows 11. Editions PDFCreator is open source and freeware. The code can be downloaded and modified. In addition to PDFCreator Free there are three commercial editions. All of them allow admi
https://en.wikipedia.org/wiki/Percent-encoding	URL encoding, officially known as percent-encoding, is a method to encode arbitrary data in a Uniform Resource Identifier (URI) using only the limited US-ASCII characters legal within a URI. Although it is known as URL encoding, it is also used more generally within the main Uniform Resource Identifier (URI) set, which includes both Uniform Resource Locator (URL) and Uniform Resource Name (URN). As such, it is also used in the preparation of data of the application/x-www-form-urlencoded media type, as is often used in the submission of HTML form data in HTTP requests. Percent-encoding in a URI Types of URI characters The characters allowed in a URI are either reserved or unreserved (or a percent character as part of a percent-encoding). Reserved characters are those characters that sometimes have special meaning. For example, forward slash characters are used to separate different parts of a URL (or more generally, a URI). Unreserved characters have no such meanings. Using percent-encoding, reserved characters are represented using special character sequences. The sets of reserved and unreserved characters and the circumstances under which certain reserved characters have special meaning have changed slightly with each revision of specifications that govern URIs and URI schemes. Other characters in a URI must be percent-encoded. Reserved characters When a character from the reserved set (a "reserved character") has a special meaning (a "reserved purpose") in a certain context, and a URI scheme says that it is necessary to use that character for some other purpose, then the character must be percent-encoded. Percent-encoding a reserved character involves converting the character to its corresponding byte value in ASCII and then representing that value as a pair of hexadecimal digits (if there is a single hex digit, a leading zero is added). The digits, preceded by a percent sign (%) as an escape character, are then used in the URI in place of the reserved character. (For a non-ASCII character, it is typically converted to its byte sequence in UTF-8, and then each byte value is represented as above.) The reserved character /, for example, if used in the "path" component of a URI, has the special meaning of being a delimiter between path segments. If, according to a given URI scheme, / needs to be in a path segment, then the three characters %2F or %2f must be used in the segment instead of a raw /. Reserved characters that have no reserved purpose in a particular context may also be percent-encoded but are not semantically different from those that are not. In the "query" component of a URI (the part after a ? character), for example, / is still considered a reserved character but it normally has no reserved purpose, unless a particular URI scheme says otherwise. The character does not need to be percent-encoded when it has no reserved purpose. URIs that differ only by whether a reserved character is percent-encoded or appears literally a
https://en.wikipedia.org/wiki/Subsystem%20number	Signalling Connection Control Part (SCCP) subsystem numbers are used to identify applications within network entities which use SCCP signalling. GSM and UMTS SSNs In Global System for Mobile Communications (GSM) and Universal Mobile Telecommunications System (UMTS), subsystem numbers may be used between Public land mobile networks (PLMNs), in which case they are taken from the globally standardized range (1 - 31) or the part of the national network range (129 - 150) reserved for GSM/UMTS use between PLMNs. For use within a PLMN, numbers are taken from the part of the national network range (32 - 128 & 151 - 254) not reserved for GSM/UMTS use between PLMNs. The following globally standardized subsystem numbers have been allocated for use by GSM/UMTS: 0 Not used/Unknown 1 SCCP MG 6 HLR (MAP) 7 VLR (MAP) 8 MSC (MAP) 9 EIR (MAP) 10 is allocated for evolution (possible Authentication Centre). The following national network subsystem numbers have been allocated for use within GSM/UMTS networks: 249 PCAP 250 BSC (BSSAP-LE) 251 MSC (BSSAP-LE) 252 SMLC (BSSAP-LE) 253 BSS O&M (A interface) 254 BSSAP (A interface) The following national network subsystem numbers have been allocated for use within and between GSM/UMTS networks: 142 RANAP 143 RNSAP 145 GMLC (MAP) 146 CAP 147 gsmSCF (MAP) or IM-SSF (MAP) 148 SIWF (MAP) 149 SGSN (MAP) 150 GGSN (MAP) 241 INAP North American (ANSI) SSNs 232 CNAM (Calling Name) 247 LNP 248 800 number translation (AIN0.1) 254 800 number translation (TCAP) References CAP SCCP SSN reallocation (PDF) 3GPP TS 23.003 (HTML) Signaling System 7
https://en.wikipedia.org/wiki/Alan%20Leo	Alan Leo, born William Frederick Allan, (Westminster, 7 August 1860 – Bude, 30 August 1917) was an English astrologer, author, publisher, astrological data collector and theosophist. He is often referred to as "the father of modern astrology". His work stimulated a revival of astrology in the Western world after its decline at the end of the 17th century. Leo was a devout theosophist and he worked many of its religious concepts such as karma and reincarnation into his astrology. He used the Theosophical Society's vast international connections to publish, translate and disseminate his work across Europe and America. Astrological technique and influence Leo, who took the name of his sun-sign as a pseudonym, is credited with starting the movement towards a more psychologically-oriented horoscope analysis in astrology, being the first astrologer to argue for a loose interpretation of possible trends of experience rather than the specific prediction of events. His influence has been described as marking a 'turning point' in horoscope delineation, because, as astrological historian James Holden explains: In 1890, Leo invited George R.S. Mead to found an occult lodge in Brixton, South London. Towards the end of his life, in 1909, and again in 1911, Leo travelled with his wife Bessie Leo to India where he studied Indian astrology. As a result of his studies in India, he later attempted to incorporate portions of Indian astrology into the western astrological model. Leo's book The Art of Synthesis (1912) was a probable influence on Gustav Holst's work The Planets. In this book, Leo gave the planets descriptions such as "Mars the Energiser". Leo was a non-smoker, teetotaller and vegetarian. In 1915, Leo founded the Astrological Lodge of London. Legal controversies and death In 1914, aged 54, Leo faced prosecution against the charge that he "did unlawfully pretend to tell fortunes" through astrology. The case was dismissed for lack of evidence, but it led to Leo's belief that astrology needed to be revised to be legitimised. His advice to fellow astrologers was: In 1917 Leo stood trial again on a similar charge. Despite his insistence that he told only "tendencies" and not "fortunes", he lost his case and was fined £5 plus costs. Leo was convicted of fortune-telling on 16 July 1917. He died a few weeks later from an apoplexy (cerebral haemorrhage), at 10:00 am on 30 August 1917, whilst on a holiday at Bude in Cornwall, which was intended to restore his health after the ordeals of the trial. He had used the 'holiday' as a period in which he rewrote hundreds of pages of astrological text to "recast the whole system and make it run more along the lines of character reading and less as the assertion of an inevitable destiny", despite being warned by his wife that "he needed rest badly after the worry and anxiety of the law case", and was overworking himself and heading for a breakdown. After his sudden death the rewriting of his work was completed b
https://en.wikipedia.org/wiki/RANAP	In telecommunications networks, RANAP (Radio Access Network Application Part) is a protocol specified by 3GPP in TS 25.413 and used in UMTS for signaling between the Core Network, which can be a MSC or SGSN, and the UTRAN. RANAP is carried over Iu-interface. RANAP signalling protocol resides in the control plane of Radio network layer of Iu interface in the UMTS (Universal Mobile Telecommunication System) protocol stack. Iu interface is the interface between RNC (Radio Network Controller) and CN (Core Network). nb. For Iu-ps transport RANAP is carried on SCTP if IP interface used on this. RANAP handles signaling for the Iu-PS - RNC and 3G SGSN and Iu-CS - RNC and 3G MSC . It also provides the signaling channel to transparently pass messages between the User Equipment (UE) and the CN. In LTE, RANAP has been replaced by S1AP. In SA (standalone) installations of 5G, S1AP will be replaced by NGAP. Functionality Over the Iu interface, RANAP is used to: - Facilitate general UTRAN procedures from the core network such as paging - Separate each User Equipment (UE) on protocol level for mobile-specific signaling management - Transfer transparently non-access signaling - Request and manage various types of UTRAN radio access bearers - Perform the Serving Radio Network Subsystem (SRNS) relocation See also GPRS Tunnelling Protocol (GTP) References 3GPP standards Mobile telecommunications standards Network protocols
https://en.wikipedia.org/wiki/Gerald%20Weinberg	Gerald Marvin Weinberg (October 27, 1933 – August 7, 2018) was an American computer scientist, author and teacher of the psychology and anthropology of computer software development. His most well-known books are The Psychology of Computer Programming and Introduction to General Systems Thinking. Biography Gerald Weinberg was born and raised in Chicago. He attended Omaha Central High School in Omaha, Nebraska. In 1963 he received a PhD in Communication Sciences from the University of Michigan. Weinberg started working in the computing business at IBM in 1956 at the Federal Systems Division Washington, where he participated as Manager of Operating Systems Development in the Project Mercury (1959–1963), which aimed to put a human in orbit around the Earth. In 1960 he published one of his first papers. Since 1969 was consultant and Principal at Weinberg & Weinberg. Here he conducted workshops such as the AYE Conference, The Problem Solving Leadership workshop since 1974, and workshops about the Fieldstone Method. Further Weinberg was an author at Dorset House Publishing since 1970, consultant at Microsoft since 1988, and moderator at the Shape Forum since 1993. Weinberg was a visiting professor at the University of Nebraska-Lincoln, Binghamton University, and Columbia University. He was a member of the Society for General Systems Research since the late 1950s. He was also a Founding Member of the IEEE Transactions on Software Engineering, a member of the Southwest Writers and the Oregon Writers Network, and a Keynote Speaker on many software development conferences. In 1993 he was the Winner of The J.-D. Warnier Prize for Excellence in Information Sciences, the 2000 Winner of The Stevens Award for Contributions to Software Engineering, the 2010 Software Test Professionals first annual Luminary Award and the European Testing Excellence Award at the EuroSTAR Conference in 2013. Weinberg died on August 7, 2018. Work His most well-known books are The Psychology of Computer Programming and Introduction to General Systems Thinking, both of which are considered to be classics, having been re-issued by the publisher in "Silver Editions". He also shared his use of his personal form of the card file approach to collecting ideas for writing in the book Weinberg on Writing: The Fieldstone Method. Weinberg's writing calls upon his own humorous aphorisms, such as his Law of Twins, which states that most of the time, no matter how much effort one expends, no event of any great significance will result. He described it in his book The Secrets of Consulting (1985), in which he explains the origin of its name. He reported that, while riding a bus in New York City, he observed a mother with eight small children embark. She asked the driver the amount of the fare; he told her that the cost was thirty-five cents, but that children under the age of five could ride for free. When the woman deposited only thirty-five cents into the payment slot, the driver was
https://en.wikipedia.org/wiki/Plus%20%28telecommunications%20Poland%29	Plus (formerly Plus GSM) is the brand name of Poland's mobile phone network operator, Polkomtel Sp. z o.o. The company is entirely owned by Cyfrowy Polsat S.A. and is part of Grupa Polsat Plus. It operates GSM (900/1800 MHz), UMTS, LTE, 5G NR (2600 MHz TDD) and WLAN networks in Poland. It was founded in 1995. At the end of September 2021, Plus had 13.045 million active SIM cards, including 2.486 million (19%) using the prepaid system. In July 2011, Zygmunt Solorz-Żak agreed to buy Polkomtel SA for 15.1 billion PLN ($5.5 billion). External links https://www.plus.pl/news/aboutcompany Polkomtel Sp. z o.o. Corporate Website References Mobile phone companies of Poland Companies based in Warsaw Telecommunications companies established in 1995 Polish brands
https://en.wikipedia.org/wiki/KITT	KITT or K.I.T.T. is the short name of two fictional characters from the adventure franchise Knight Rider. In both instances, KITT is an artificially intelligent electronic computer module in the body of a highly advanced, very mobile, robotic automobile. The original KITT is known as the Knight Industries Two Thousand, which appeared in the original TV series Knight Rider as a 1982 Pontiac Firebird Trans Am. The second KITT is known as the Knight Industries Three Thousand, which appeared first in the two-hour 2008 pilot film for a new Knight Rider TV series and then the new series itself, and appeared as a 2008–2009 Ford Shelby GT500KR. During filming, KITT was voiced by a script assistant, with voice actors recording KITT's dialog later. David Hasselhoff and original series voice actor William Daniels first met each other six months after the series began filming. KITT's evil twin is KARR, whose name is an acronym of Knight Automated Roving Robot. KARR was voiced first by Peter Cullen and later by Paul Frees in seasons one and three, respectively, of the NBC original TV series Knight Rider. A 1991 sequel film, Knight Rider 2000, is centered on KITT's original microprocessor unit transferred into the body of the vehicle intended to be his successor, the Knight Industries Four Thousand (Knight 4000), voiced by Carmen Argenziano and William Daniels. Val Kilmer voiced KITT in the 2008–2009 Knight Rider series. Knight Industries Two Thousand (KITT) In the original Knight Rider series, the character of KITT (Knight Industries Two Thousand) was physically embodied as a modified 1982 Pontiac Trans Am. KITT was designed by customizer Michael Scheffe. The convertible and super-pursuit KITTs were designed and built by George Barris. Development In the history of the television show, the first KITT, voiced by William Daniels, was said to have been designed by the late Wilton Knight, a brilliant but eccentric billionaire, who established the Foundation for Law And Government (FLAG) and its parent Knight Industries. The 2008 pilot film implied that Charles Graiman, creator of the Knight Industries Three Thousand, also had a hand in designing the first KITT. An unknown number of KITT's systems were designed at Stanford University. KITT's total initial production cost was estimated at $11,400,000 in 1982 (Episode 5, "Just My Bill"). The 1991 movie Knight Rider 2000 saw the first KITT (Knight Industries Two Thousand) in pieces, and Michael Knight himself reviving the Knight 2000 microprocessor unit, which is eventually transferred into the body of the vehicle intended to be the original KITT's direct successor, the Knight 4000. The new vehicle was a modified 1991 Dodge Stealth, appearing similar to the Pontiac Banshee prototype. In the 1997–1998 spin-off series Team Knight Rider, KITT is employed as a shadow advisor. It is later revealed that "The Shadow" is actually a hologram run by KITT. In "Knight of the Living Dead", Graiman states a third KITT e
https://en.wikipedia.org/wiki/Dar%20%28disk%20archiver%29	dar (disk archive) is a computer program, a command-line archiving tool intended as a replacement for tar in Unix-like operating systems. Features Support for slices, archives split over multiple files of a particular size Option of deleting files from the system which are removed in the archive Full backup Differential backup Incremental backup, Decremental backup Takes care of any type of inode (directory, plain files, symlinks, special devices, named pipes, sockets, doors, ...) Takes care of hard-linked inodes (hard-linked plain files, char devices, block devices, hard-linked symlinks) Takes care of sparse files Takes care of Linux file Extended Attributes, Takes care of Linux file ACL Takes care of Mac OS X file forks Takes care of some filesystem specific attributes like Birthdate of HFS+ filesystem and immutable, data-journaling, secure-deletion, no-tail-merging, undeletable, noatime attributes of ext2/3/4 filesystem. Per-file compression with gzip, bzip2, lzo, xz or lzma (as opposed to compressing the whole archive). An individual can choose not to compress already compressed files based on their filename suffix. Fast-extracting of files from anywhere in the archive Fast listing of archive contents through saving the catalogue of files in the archive Optional Blowfish, Twofish, AES, Serpent, Camellia encryption Optional public key encryption and signature (OpenPGP) Live filesystem backup: detects when a file has been modified while it was read for backup and can retry saving it up to a given maximum number of retries Hash file (MD5, SHA1 or SHA-512) generated on-fly for each slice, the resulting file is compatible with md5sum or sha1sum, to be able to quickly check each slice's integrity Filesystem independent: it may be used to restore a system to a partition of a different size and/or to a partition with a different filesystem Frontends There are GUI frontends for dar called: Kdar for Linux, specifically KDE, DarGUI for Linux and Windows, gdar for Linux. A text-mode browser/extractor: plugin for dar files in mc (Midnight Commander). A scheduler / command-line frontend known as SaraB allows the Towers of Hanoi, Grandfather-Father-Son, or any custom backup rotation strategy, and modifications are available for PAR file support. Extended versions known as bzSaraB and baras are also available. See also FSArchiver List of file archivers List of archive formats Comparison of archive formats References External links Homepage of dar 2002 software Free data compression software Free backup software
https://en.wikipedia.org/wiki/PacketCable	PacketCable network is a technology specification defined by the industry consortium CableLabs for using Internet Protocol (IP) networks to deliver multimedia services, such as IP telephony, conferencing, and interactive gaming on a cable television infrastructure. The PacketCable technology is based on the DOCSIS base with extensions that enable cable operators to deliver data and voice traffic efficiently using a single high-speed, quality-of-service (QoS)-enabled broadband (cable) architecture. The PacketCable effort dates back to 1997 when cable operators identified the need for a real-time multimedia architecture to support the delivery of advanced multimedia services over the DOCSIS architecture. The original PacketCable specifications were based on the physical network characteristics of operators in the U.S. For the European market, Cable Europe Labs, maintains a separate, but equivalent effort, EuroPacketCable, based on European network implementations. Technical overview PacketCable interconnects three network types: Hybrid Fibre Coaxial (HFC) access network Public switched telephone network (PSTN) TCP/IP Managed IP networks Protocols DOCSIS (Data Over Cable Service Interface Specification) - standard for data over cable and details mostly the RF band Real-time Transport Protocol (RTP) & Real Time Control Protocol (RTCP) required for media transfer PSTN Gateway Call Signaling Protocol Specification (TGCP) which is an MGCP extension for Media Gateways Network-Based Call Signaling Protocol Specification (NCS) which is an MGCP extension for analog residential Media Gateways - the NCS specification, which is derived from the IETF MGCP RFC 2705, details VoIP signalling. Basically the IETF version is a subset of the NCS version. The Packet Cable group has defined more messages and features than the IETF. Common Open Policy Service (COPS) for quality of service PacketCable voice coders The required coders are: ITU G.711 (both μ-law and a-law algorithm versions) - for V1.0 & 1.5 iLBC - for V1.5 BV16 - for V1.5 In addition the specifications recommended the following: ITU G.728 ITU G.729 Annex E PacketCable 1.0 PacketCable 1.0 comprises eleven specifications and six technical reports which define call signaling, quality of service (QoS), codec usage, client provisioning, billing event message collection, public switched telephone network (PSTN) interconnection, and security interfaces for implement a single-zone PacketCable solution for residential Internet Protocol (IP) voice services. PacketCable 1.5 PacketCable 1.5 contains additional capabilities over PacketCable 1.0. It superseded previous versions (1.1, 1.2, and 1.3). The standard covers 21 specifications and one technical report which together define call signaling, quality of service (QoS), coders, client provisioning, billing event message collection, PSTN interconnection, and security interfaces for implementing a single-zone or multi-zone PacketCable solution for resi
https://en.wikipedia.org/wiki/Iterative%20closest%20point	Iterative closest point (ICP) is an algorithm employed to minimize the difference between two clouds of points. ICP is often used to reconstruct 2D or 3D surfaces from different scans, to localize robots and achieve optimal path planning (especially when wheel odometry is unreliable due to slippery terrain), to co-register bone models, etc. Overview The Iterative Closest Point algorithm keeps one point cloud, the reference or target, fixed, while transforming the other, the source, to best match the reference. The transformation (combination of translation and rotation) is iteratively estimated in order to minimize an error metric, typically the sum of squared differences between the coordinates of the matched pairs. ICP is one of the widely used algorithms in aligning three dimensional models given an initial guess of the rigid transformation required. The ICP algorithm was first introduced by Chen and Medioni, and Besl and McKay. The Iterative Closest Point algorithm contrasts with the Kabsch algorithm and other solutions to the orthogonal Procrustes problem in that the Kabsch algorithm requires correspondence between point sets as an input, whereas Iterative Closest Point treats correspondence as a variable to be estimated. Inputs: reference and source point clouds, initial estimation of the transformation to align the source to the reference (optional), criteria for stopping the iterations. Output: refined transformation. Essentially, the algorithm steps are: For each point (from the whole set of vertices usually referred to as dense or a selection of pairs of vertices from each model) in the source point cloud, match the closest point in the reference point cloud (or a selected set). Estimate the combination of rotation and translation using a root mean square point to point distance metric minimization technique which will best align each source point to its match found in the previous step. This step may also involve weighting points and rejecting outliers prior to alignment. Transform the source points using the obtained transformation. Iterate (re-associate the points, and so on). Zhang proposes a modified k-d tree algorithm for efficient closest point computation. In this work a statistical method based on the distance distribution is used to deal with outliers, occlusion, appearance, and disappearance, which enables subset-subset matching. There exist many ICP variants, from which point-to-point and point-to-plane are the most popular. The latter usually performs better in structured environments. Implementations MeshLab an open source mesh processing tool that includes a GNU General Public License implementation of the ICP algorithm. CloudCompare an open source point and model processing tool that includes an implementation of the ICP algorithm. Released under the GNU General Public License. PCL (Point Cloud Library) is an open-source framework for n-dimensional point clouds and 3D geometry processing. It includes sev
https://en.wikipedia.org/wiki/Motorola%2068881	The Motorola 68881 and Motorola 68882 are floating-point units (FPUs) used in some computer systems in conjunction with Motorola's 32-bit 68020 or 68030 microprocessors. These coprocessors are external chips, designed before floating point math became standard on CPUs. The Motorola 68881 was introduced in 1984. The 68882 is a higher performance version produced later. Overview The 68020 and 68030 CPUs were designed with the separate 68881 chip in mind. Their instruction sets reserved the "F-line" instructions – that is, all opcodes beginning with the hexadecimal digit "F" could either be forwarded to an external coprocessor or be used as "traps" which would throw an exception, handing control to the computer's operating system. If an FPU is not present in the system, the OS would then either call an FPU emulator to execute the instruction's equivalent using 68020 integer-based software code, return an error to the program, terminate the program, or crash and require a reboot. Architecture The 68881 has eight 80-bit data registers (a 64-bit mantissa plus a sign bit, and a 15-bit signed exponent). It allows seven different modes of numeric representation, including single-precision floating point, double-precision floating point, extended-precision floating point, integers as 8-, 16- and 32-bit quantities and a floating-point Binary-coded decimal format. The binary floating point formats are as defined by the IEEE 754 floating-point standard. It was designed specifically for floating-point math and is not a general-purpose CPU. For example, when an instruction requires any address calculations, the main CPU handles them before the 68881 takes control. The CPU/FPU pair are designed such that both can run at the same time. When the CPU encounters a 68881 instruction, it hands the FPU all operands needed for that instruction, and then the FPU releases the CPU to go on and execute the next instruction. 68882 The 68882 is an improved version of the 68881, with better pipelining, and eventually available at higher clock speeds. Its instruction set is exactly the same. Motorola claimed in some marketing literature that it executes some instructions 40% faster than a 68881 at the same clock speed, though this did not reflect typical performance, as seen by its more modest improvement in the table below. The 68882 is pin compatible with the 68881 and can be used as a direct replacement in most systems. The most important software incompatibility is that the 68882 uses a larger FSAVE state frame, which affects UNIX and other preemptive multitasking OSes that had to be modified to allocate more space for it. Usage The 68881 or 68882 were used in the Sun Microsystems Sun-3 workstations, IBM RT PC workstations, Apple Computer Macintosh II family, NeXT Computer, Sharp X68000, Amiga 3000, Convergent Technologies MightyFrame, Atari Mega STE, TT, and Falcon. Some third-party Amiga and Atari products used the 68881 or 68882 as a memory-mapped peripheral
https://en.wikipedia.org/wiki/4B5B	In telecommunication, 4B5B is a form of data communications line code. 4B5B maps groups of 4 bits of data onto groups of 5 bits for transmission. These 5-bit words are pre-determined in a dictionary and they are chosen to ensure that there will be sufficient transitions in the line state to produce a self-clocking signal. A collateral effect of the code is that 25% more bits are needed to send the same information. An alternative to using 4B5B coding is to use a scrambler. Some systems use scramblers in conjunction with 4B5B coding to assure DC balance and improve electromagnetic compatibility. Depending on the standard or specification of interest, there may be several 5-bit output codes left unused. The presence of any of the unused codes in the data stream can be used as an indication that there is a fault somewhere in the link. Therefore, the unused codes can be used to detect errors in the data stream. Applications 4B5B was popularized by Fiber Distributed Data Interface (FDDI) in the mid-1980s. It was adopted for digital audio transmission by MADI in 1989. and by Fast Ethernet in 1995. The name 4B5B is generally taken to mean the FDDI version. Other 4-to-5-bit codes have been used for magnetic recording and are known as group coded recording (GCR), but those are (0,2) run-length limited codes, with at most two consecutive zeros. 4B5B allows up to three consecutive zeros (a (0,3) RLL code), providing a greater variety of control codes. On optical fiber, the 4B5B output is NRZI-encoded. FDDI over copper (CDDI) uses MLT-3 encoding instead, as does 100BASE-TX Fast Ethernet. The 4B5B encoding is also used for USB Power Delivery communication, where it is sent over the USB-C CC pin (further encoded using biphase mark code) or the USB-A/B power lines (further encoded using frequency-shift keying). Clocking 4B5B codes are designed to produce at least two transitions per 5 bits of output code regardless of input data. The transitions provide necessary transitions for the receiver to perform clock recovery. For example, a run of 4 bits such as 0000 using NRZI encoding contains no transitions and that may cause clocking problems for the receiver. 4B5B solves this problem by assigning the 4-bit block a 5-bit code, in this case, 11110. Encoding table Three consecutive zero bits only appear in normal data when a code ending with two 0 bits (2, E) is followed by a code beginning with a 0 bit (1, 4, 5, 6, 7), so will always appear separated by multiples of the 5-bit encoded symbol length (and never separated by a single symbol). Violations of this property are used for special synchronization codes. Command characters The following codes are sometimes referred to as command characters. They are commonly used in pairs, although USB-PD uses 4-symbol sequences to begin its packets. See also GCR 4B-5B encoding References External links Simulator - 4B/5B Encoder line written in Matlab CodSim 2.0: Open source simulator for Digital Data
https://en.wikipedia.org/wiki/BT%2021CN	The 21st Century Network (21CN) programme is the data and voice network transformation project, under way since 2004, of the UK telecommunications company BT Group plc. It was intended to move BT's telephone network from the AXE/System X Public Switched Telephone Network (PSTN) to an Internet Protocol (IP) system. As well as switching over the PSTN, BT planned to deliver many additional services over their new data network, such as on-demand interactive TV services. BT originally stated that it would accrue annual savings of £1 billion when the transition to the new network was completed, and hoped to have over 50% of its customers transferred by 2008 (see External links below for current progress on the roll-out of optical fibre by Openreach). Capital expenditure was put at £10 billion over five years, this being 75% of BT's total capital spending plans in that period. Architecture The new network is based on an architectural model of five classes of network nodes. These are: Premises Access (MSAN) Metro Core iNode Premises Premises nodes includes residential, small-medium enterprise (SME) and enterprise. The presumption is that all these will have high speed connections to the network, delivered over copper (in the form of ADSL or other DSL technologies) or over fibre, as either PON or direct fibre in the case of large enterprises. The sole exception to this presumption is for legacy PSTN, where provision will continue to be made for analogue voice. Access node 21CN introduced the concept of the multi-service access node (MSAN). This logical node takes the various access technologies (mentioned above) and, where possible, aggregates these onto a single backhaul network technology. This includes converting analogue voice into voice over IP (VoIP) using the MSAN as a media gateway (MGW). The aim is to implement a few hundred access nodes. Note that these will not have any IP routing capability, but will essentially be layer 2 Ethernet devices. Metro node The backhaul network will terminate on the metro nodes. At this point the IP-based services will be implemented, and the metro nodes are the first location where IP traffic is routed. Call control (via a softswitch or an IMS CSCF) will be implemented here, although the softswitches and the IMS components won't be described as a part of the metro node – they are parts of the iNode. The metro nodes are also provider edge (PE) routers in MPLS terminology, encapsulating the IP traffic in MPLS tunnels for transmission over the core. The aim is to implement around 100 metro nodes. Core node The core nodes are MPLS switches, with the MPLS traffic carried over optical (DWDM) transport. They are completely unaware of customer IP traffic, and only switch based on MPLS tags (all customer IP traffic is encapsulated with an MPLS header by the metro node PEs). Native IP is only used by the core nodes for protocols such as MP-BGP, an IGP, LDP, and RSVP to exchange routing and label in
https://en.wikipedia.org/wiki/Ulead%20Systems	Ulead Systems () is a Taiwanese computer software company headquartered in Neihu district in Taipei, Taiwan. It is a subsidiary of Alludo. History Ulead was founded on 5 August 1989 by Lotus Chen, Lewis Liaw and Way-Zen Chen. They founded Ulead with the support of Microtek after leaving Taiwan's Institute for Information Industry in order to further develop and commercialize their first true color image editing software, PhotoStyler, on the Windows platform. Ulead sold PhotoStyler through Aldus Corporation as a software developer. However, Aldus merged into Adobe Systems in 1994 and PhotoStyler is no longer available. Ulead then continued to develop PhotoImpact 3 as its flagship image editor and sell PhotoImpact by itself. Ulead Systems then extended its development of multimedia software in various areas such as video editing, media management, web utility, DVD authoring and digital home. On 17 September 2001, Ulead was listed on the Taiwan Stock Exchange as 2487.TW. On 13 April 2005, InterVideo acquired Ulead Systems for approximately $68 million. On 9 July 2006, InterVideo announced its merger with Ulead to be completed on 28 December 2006. On 28 August 2006, Corel announced that it would acquire InterVideo for about $196 million. On 24 October 2006, Ulead was unlisted on the Taiwan Stock Exchange. On 12 December 2006, Corel announced the acquisition of InterVideo and Ulead had been completed. Products Video VideoStudio MediaStudio Pro/VideoGraphics Lab VideoTool Box COOL 3D, COOL 3D Production Studio DVD Burn.Now DVD MovieFactory DVD PictureShow DVD WorkShop Image COOL 360 COOL 3D PhotoImpact IPhoto Plus Photo Explorer Photo Express My Scrapbook Web Utility GIF Animator GIF-X.Plug-in Menu.Applet SmartSaver Pro Pocket Software Pocket SlideShow Pocket DV Show Digital home InstaMedia See also List of companies of Taiwan InterVideo Corel References External links Ulead Systems Ulead Systems Germany First Look at Ulead Videostudio 11 Software companies of Taiwan Software companies established in 1989 Companies listed on the Taiwan Stock Exchange Companies based in Taipei Taiwanese companies established in 1989 2006 mergers and acquisitions Taiwanese brands Corel
https://en.wikipedia.org/wiki/This%20Week%20in%20Tech	This Week in Tech–casually referred to as TWiT, and briefly known as Revenge of the Screen Savers–is the weekly flagship podcast and namesake of the TWiT.tv network. It is hosted by Leo Laporte and many other former TechTV employees and currently produced by Jason Howell. It features round-table discussions and debates surrounding current technology news and reviews, with a particular focus on consumer electronics and the Internet. TWiT is produced in the TWiT "eastside" studios in Petaluma, California, United States, since 2016, a few miles away from the former "brickhouse" studios where it had been produced for 5 years, and earlier TWiT "cottage", where it was produced for over 6 years. The podcast is streamed live on Sundays at 2:15 P.M. PST. Format Leo Laporte typically begins an episode of TWiT by stating the show's number, title, sponsors and playing the theme tune, then introducing the week's panelists and guests. The persons hail in either live or remotely and take turns discussing their recent projects or work. The main portion of the show consists of a round-table discussion and debate, pegged loosely to a selection of the week's major technology headlines. The format of the show encourages spontaneity and the conversation often diverges wildly from technology topics. This causes the length of each episode to vary, sometimes considerably, from show to show, although most episodes run approximately two hours. Each episode typically features three or four commercial breaks, usually in the form of a "live read" from Laporte that may include interaction with the panelists (e.g., Laporte usually prompts guests for recommended audiobooks during spots for frequent advertiser Audible.com). The show closes with each panelist giving a personal "plug" for their affiliated website or Twitter account. Panelists The most frequently recurring guests on TWiT included John C. Dvorak, Patrick Norton, Wil Harris, Kevin Rose, Robert Heron, David Prager, Tom Merritt, Roger Chang, and Jason Calacanis. Futurist Amy Webb and journalists Iain Thomson, Alex Wilhelm, and Dwight Silverman are among the frequent panelists in more recent years. Other guests include Becky Worley, Steve Gibson, Xeni Jardin, Alex Lindsay, Owen Stone, Veronica Belmont and Molly Wood. The show has had a number of famous guests, including Steve Wozniak, Kevin Mitnick, John Hodgman, Lawrence Lessig, artist Roger McGuinn, as well as Star Trek: The Next Generation cast members LeVar Burton (Geordi La Forge) and Wil Wheaton (Wesley Crusher). In September 2015, Leo Laporte famously "banned" his long-time friend and frequent TWiT guest John C. Dvorak from the show for various comments Dvorak made on Twitter. In reply to Dvorak's comments that Laporte was biased, Laporte told Dvorak "you won't ever have to worry about it again", insinuating that he never wanted Dvorak back on TWiT. Laporte apologized a few days later, but continued to berate Dvorak publicly. Dvorak returned to TWiT on Decem
https://en.wikipedia.org/wiki/Robert%20Watson%20%28computer%20scientist%29	Robert Nicholas Maxwell Watson (born 3 May 1977) is a FreeBSD developer, and founder of the TrustedBSD Project. He is currently employed as a Professor of Systems, Security, and Architecture in the Security Research Group at the University of Cambridge Computer Laboratory. Education Watson graduated in computer science from Carnegie Mellon University and has attained a PhD from University of Cambridge. As well as Cambridge, he has worked at the National Institutes of Health, Carnegie Mellon University, Trusted Information Systems, Network Associates, McAfee, and SPARTA. He obtained a PhD in computer security from the University of Cambridge Computer Laboratory, supervised by Ross Anderson and sponsored by Google. Research Watson's work has been supported by DARPA, Apple Computer, the Navy, and other US government agencies. His main research interests are network security and operating system security. His main open source software contributions include his work in developing the multi-threaded and multi-processor FreeBSD network stack, the TrustedBSD project, and OpenBSM. His writing has been featured in forums such as ACM's Queue Magazine, the USENIX Annual Technical Conference, BSDCon, and a Slashdot interview. He was also a FreeBSD Core Team member from 2000 to 2012. Watson is coauthor of the standard textbook The Design and Implementation of the FreeBSD Operating System (2nd ed., 2015) by Marshall Kirk McKusick. References Free software programmers Living people FreeBSD people People from Harrow, London 1977 births British computer scientists Members of the University of Cambridge Computer Laboratory Fellows of St John's College, Cambridge
https://en.wikipedia.org/wiki/Switch%20statement	In computer programming languages, a switch statement is a type of selection control mechanism used to allow the value of a variable or expression to change the control flow of program execution via search and map. Switch statements function somewhat similarly to the if statement used in programming languages like C/C++, C#, Visual Basic .NET, Java and exist in most high-level imperative programming languages such as Pascal, Ada, C/C++, C#, Visual Basic .NET, Java, and in many other types of language, using such keywords as switch, case, select or inspect. Switch statements come in two main variants: a structured switch, as in Pascal, which takes exactly one branch, and an unstructured switch, as in C, which functions as a type of goto. The main reasons for using a switch include improving clarity, by reducing otherwise repetitive coding, and (if the heuristics permit) also offering the potential for faster execution through easier compiler optimization in many cases. History In his 1952 text Introduction to Metamathematics, Stephen Kleene formally proved that the CASE function (the IF-THEN-ELSE function being its simplest form) is a primitive recursive function, where he defines the notion definition by cases in the following manner: "#F. The function φ defined thus φ(x1 , ... , xn ) = φ1(x1 , ... , xn ) if Q1(x1 , ... , xn ), . . . . . . . . . . . . φm(x1 , ... , xn ) if Qm(x1 , ... , xn ), φm+1(x1 , ... , xn ) otherwise, where Q1 , ... , Qm are mutually exclusive predicates (or φ(x1 , ... , xn) shall have the value given by the first clause which applies) is primitive recursive in φ1, ..., φm+1, Q1, ..., Qm+1. Kleene provides a proof of this in terms of the Boolean-like recursive functions "sign-of" sg( ) and "not sign of" ~sg( ) (Kleene 1952:222-223); the first returns 1 if its input is positive and −1 if its input is negative. Boolos-Burgess-Jeffrey make the additional observation that "definition by cases" must be both mutually exclusive and collectively exhaustive. They too offer a proof of the primitive recursiveness of this function (Boolos-Burgess-Jeffrey 2002:74-75). The IF-THEN-ELSE is the basis of the McCarthy formalism: its usage replaces both primitive recursion and the mu-operator. Typical syntax In most languages, programmers write a switch statement across many individual lines using one or two keywords. A typical syntax involves: the first select, followed by an expression which is often referred to as the control expression or control variable of the switch statement subsequent lines defining the actual cases (the values), with corresponding sequences of statements for execution when a match occurs In languages with fallthrough behaviour, a break statement typically follows a case statement to end said statement. [Wells] In some languages, e.g., PL/I, the control expression is optional; if there is no control expression then each alternative begins with a WHEN clause containing a boolean express
https://en.wikipedia.org/wiki/IEEE%20802.21	The IEEE 802.21 refers to Media Independent Handoff (MIH) and is an IEEE standard published in 2008. The standard supports algorithms enabling seamless handover between wired and wireless networks of the same type as well as handover between different wired and wireless network types also called Media independent handover (MIH) or vertical handover. The vertical handover was first introduced by Mark Stemn and Randy Katz at U C Berkeley. The standard provides information to allow handing over to and from wired 802.3 networks to wireless 802.11, 802.15, 802.16, 3GPP and 3GPP2 networks through different handover mechanisms. The IEEE 802.21 working group started work in March 2004. More than 30 companies have joined the working group. The group produced a first draft of the standard including the protocol definition in May 2005. The standard was published in January 2009. Reasons for 802.21 Cellular networks and 802.11 networks employ handover mechanisms for handover within the same network type (aka horizontal handover). Mobile IP provides handover mechanisms for handover across subnets of different types of networks, but can be slow in the process. Current 802 standards do not support handover between different types of networks. They also do not provide triggers or other services to accelerate mobile IP-based handovers. Moreover, existing 802 standards provide mechanisms for detecting and selecting network access points, but do not allow for detection and selection of network access points in a way that is independent of the network type. Some of the expectations Allow roaming between 802.11 networks and 3G cellular networks. Allow users to engage in ad hoc teleconferencing. Apply to both wired and wireless networks, likely the same list as IEEE P1905 specifies to cooperate in software-defined networking (see also OpenFlow) Allow for use by multiple vendors and users. Compatibility and conformance with other IEEE 802 standards especially 802.11u unknown user authentication and 802.11s ad hoc wireless mesh networking. Include definitions for managed objects that are compatible with management standards like SNMP. Although security algorithms and security protocols will not be defined in the standard, authentication, authorization, and network detection and selection will be supported by the protocol. Implementation and Issues Implementation is still in progress. Current technologies such as 802.11 that accomplish handover use software to accomplish handovers and suggest that software will also be the way that handover will be implemented by 802.21. The use of software as a means to implement 802.21 should not cause large increases in the cost of networking devices. An open-source software implementation is provided by ODTONE. Crossing different administrative connectivity domains will require agreements among different network operators. Currently, such agreements are still not in place. In smartphones today, a user can manually select
https://en.wikipedia.org/wiki/Heroes%20of%20Might%20and%20Magic%20IV	Heroes of Might and Magic IV is a turn-based strategy game developed by Gus Smedstad through New World Computing and published by the 3DO Company for Microsoft Windows-based personal computers in 2002. A Macintosh port was subsequently developed by Contraband Entertainment and released by the 3DO Company. The fourth installment of the popular Heroes of Might and Magic franchise, it is the sequel to Heroes of Might and Magic III, and was the last to be developed by New World Computing. Gameplay Heroes of Might and Magic IV introduced a number of major changes to the series. Heroes Unlike previous games, where they had little active role in combat, heroes became present on the battlefield with their troops. They can attack, and be attacked. If a hero is killed in combat he/she must be brought to a friendly town to be revived. It is possible to have armies with more than one hero, or with no heroes at all, although armies without a hero are incapable of performing certain tasks, such as capturing enemy towns or structures. The skill system also underwent a significant overhaul, and all Heroes of a given class start out with the same skills. The player has significantly more control over the development of the Hero than in previous games in the series, and Heroes "evolve" into over 40 different specialized classes. A Hero can select up to five of the nine available primary skills, and each primary skill makes available three secondary skills. Each of these 36 skills have five levels of progression as opposed to the three levels in the previous games. Combat Both the adventure and combat maps were converted to a fixed-view isometric 3D display. The traditional hexagon-based battle grid was converted into a much higher-resolution square-based grid, making it easier to feature units of different sizes. Non-hero spellcasting units were given proper spell selections. Retaliation was allowed simultaneously with the attack, and ranged units were given the capability to retaliate against ranged attacks. Projectile attacks and spells now required direct line of sight to the target. World map Each individual troop unit was given its own movement allowance on the adventure map, with units possessing the ability to split off independently of the main army; however, the troops can no longer be "shuttled" from hero to hero to move an army large distances in a single turn. Logistics were restricted by eliminating or weakening travel spells. This, in turn, was partially compensated for by the elimination of the need to revisit resource-producing structures each week, and the introduction of caravans, which can quickly and safely transport heroes and remotely recruit troops from external dwellings. Units A small number of these skills are shared with earlier games, and some of the new skills can dramatically affect strategy (e.g., a Hero with Grandmaster Stealth is invisible to all non-allied units). Troop units may no longer be upgraded, and there are fou
https://en.wikipedia.org/wiki/PEPA	Performance Evaluation Process Algebra (PEPA) is a stochastic process algebra designed for modelling computer and communication systems introduced by Jane Hillston in the 1990s. The language extends classical process algebras such as Milner's CCS and Hoare's CSP by introducing probabilistic branching and timing of transitions. Rates are drawn from the exponential distribution and PEPA models are finite-state and so give rise to a stochastic process, specifically a continuous-time Markov process (CTMC). Thus the language can be used to study quantitative properties of models of computer and communication systems such as throughput, utilisation and response time as well as qualitative properties such as freedom from deadlock. The language is formally defined using a structured operational semantics in the style invented by Gordon Plotkin. As with most process algebras, PEPA is a parsimonious language. It has only four combinators, prefix, choice, co-operation and hiding. Prefix is the basic building block of a sequential component: the process (a, r).P performs activity a at rate r before evolving to behave as component P. Choice sets up a competition between two possible alternatives: in the process (a, r).P + (b, s).Q either a wins the race (and the process subsequently behaves as P) or b wins the race (and the process subsequently behaves as Q). The co-operation operator requires the two "co-operands" to join for those activities which are specified in the co-operation set: in the process P < a, b> Q the processes P and Q must co-operate on activities a and b, but any other activities may be performed independently. The reversed compound agent theorem gives a set of sufficient conditions for a co-operation to have a product form stationary distribution. Finally, the process P/{a} hides the activity a from view (and prevents other processes from joining with it). Syntax Given a set of action names, the set of PEPA processes is defined by the following BNF grammar: The parts of the syntax are, in the order given above action the process can perform an action a at rate and continue as the process P. choice the process P+Q may behave as either the process P or the process Q. cooperation processes P and Q exist simultaneously and behave independently for actions whose names do not appear in L. For actions whose names appear in L, the action must be carried out jointly and a race condition determines the time this takes. hiding the process P behaves as usual for action names not in L, and performs a silent action for action names that appear in L. process identifier write to use the identifier A to refer to the process P. Tools PEPA Plug-in for Eclipse ipc: the imperial PEPA compiler GPAnalyser for fluid analysis of massively parallel systems References External links PEPA: Performance Evaluation Process Algebra Process calculi Theoretical computer science
https://en.wikipedia.org/wiki/Hi-Octane	Hi-Octane is a vehicular combat and racing video game published in 1995 for MS-DOS compatible operating systems, PlayStation, and Sega Saturn. It was developed by Bullfrog Productions based upon their earlier Magic Carpet game code. The tracks are wider and more open than most racing games. Hi-Octane was not as well received as the thematically similar Wipeout by Psygnosis and was criticized for the short view distance. Bullfrog released an expansion pack with three new tracks and new game modes. Gameplay The game offers a choice of six hovercraft vehicles differentiated by their top speed, armour, firepower, weight and appearance: KD-1 Speeder, Berserker, Jugga, Vampire, Outrider, and Flexiwing. There are six tracks to race on, with names like New Chernobyl which hint at a dystopian futuristic world (although the game does not feature a backstory). The tracks offer different difficulties, various textures and types of landscape like wastelands and city streets. Certain parts of the track allow to recharge vehicle's fuel, shields or ammo, although the vehicle has to slow down in order to fully benefit of the recharge. There are also power-ups on the tracks, recharging fuel/shield/ammo (10, 100 or 200%) or upgrading the car's minigun, missile or booster, for more power. Other parts of the tracks changed in the course of racing, opening shortcuts or places with scattered upgrades for a short time. The different vehicles display different handling values in the front end but these are just for show, the underlying stats are the same for all the vehicles. Due to the dimensions of models the vehicles appear different sizes but in fact the collision volumes are all identical meaning that you are just as likely to hit something with the Outrider as you are with the Jugga. There are four camera views, switched while playing: three of them are from behind the vehicle with one being further away than the other, and the fourth view is from the front of the car, with no parts of the car obscuring the sight. Development Developer Peter Molyneux stated that in May 1995, EA set Bullfrog under pressure to release Dungeon Keeper in six and a half weeks. "Because I wasn't prepared to sacrifice Dungeon Keeper, I wrote and designed a game from scratch in six weeks: Hi-Octane," Molyneux recounted. To allow the development of the game in such a short time, the Magic Carpet engine was used. Producer Sean Cooper's account is slightly different, stating that the game was developed in eight weeks, as a way to "fill a quarter that didn't have enough revenue". Due to time constraints, all the vehicles actually have the same speed, despite what their stats say in the game. Reception Mark LeFebvre of Electronic Gaming Monthly gave the PC version an 8.2, praising the selection of vehicles, the well-balanced challenge, the secret areas, and the networked eight-player racing, though he did remark that there should have been more than six tracks. A critic for Next Genera
https://en.wikipedia.org/wiki/Sniz%20%26%20Fondue	Sniz & Fondue is a series of animated shorts originally appearing on the first three seasons of the animation-anthology series KaBlam! on the American cable television network Nickelodeon. Premise The series is about the day-to-day lives and zany hijinks of two ferret roommates, Sniz and Fondue. Sniz is hyperactive and playfully impulsive, traits that resulted in trouble for himself and his roommate, Fondue. Sniz sports a lime-green Mohawk haircut. Fondue was generally nervous as a result of Sniz's rambunctiousness, which resulted in him being on his guard. Fondue sports a blue chef's hat. They live with two other roommates, Snuppa and Bianca. Production Created by Mike R. Brandon (credited as Michael Pearlstein at the time of the cartoon's premiere), Sniz & Fondue was inspired and derived from characters of his short-lived comic series for a small comic book publishing company Northstar called "Puppy Action!". He later received a phone call from Linda Simensky, the head of Nickelodeon's programming at the time, who had found the first issue of "Puppy Action!" and asked him if he'd be interested in creating a pilot for a potential series. So, he produced the 1992 pilot "Psyched for Snuppa" by Stretch Films and Jumbo Pictures, under the self-proclaimed disliked direction of John R. Dilworth, creator of Cartoon Network's Courage the Cowardly Dog. Although the pilot was passed by Nickelodeon in favor of Trash-O-Madness, the pilot of Rocko's Modern Life, the Nickelodeon team liked Sniz and Fondue so much that they spun the characters into a series of segments for KaBlam!. John R. Dilworth, Jim Jinkins, and David Campbell were only involved in the pilot and had no involvement with the rest of Sniz & Fondue when it became a part of KaBlam! (Jim Jinkins and David Campbell had officially moved their jobs to Disney Enterprises when they purchased Jumbo Pictures). Dilworth was asked by the board to direct the Sniz & Fondue series in New York City, but he declined due to other interests. Brandon was in charge of writing, storyboarding, character designing, creating the title cards and doing additional voices. The first season oversaw the animation at Israeli animation studio Pitchi Poy Animation Productions, which Brandon despised due to how off-model the characters ended up being. They also mostly used stock music from Associated Production Music. The cue used for the show's title card was "Toys for Boys", composed by Boris Schoska. Eventually for the second and third season, they switched the oversea animation to Funbag Animation Studios in Canada with most of the animation and writing done in New York City, as well as going back to using original music cues with new title cards. Originally, Viacom was considering having the second and third season be animated at Spümcø in California, but Brandon convinced them to have it done closely to his friends and family in New York. One of the show's trademarks is that the characters (mostly Sniz) often sing or
https://en.wikipedia.org/wiki/BBC%20One%20%22Balloon%22%20idents	The BBC One Balloon idents were a series of idents (station identifications) used on the British TV channel BBC One from 4 October 1997 to 28 March 2002. The balloon theme replaced the computer-generated spinning globe that had been used as the main ident on the channel since 1991, and marked a radical departure from the traditional spinning globe which had been the channel's primary identity since 1963. It launched on the same day as a BBC-wide rebrand, and thus the new idents also carried the new BBC logo. The channel's name also changed from BBC1 to BBC One. This was the last ident set used by the channel when it fully closed down; the last proper closedown took place in the evening hours of 8 November 1997. Starting the following evening, BBC News 24 (now the BBC News Channel) would broadcast on BBC One during closedown, which continues today. The hot air balloon featured in the idents was filmed on location. The balloon was built by Cameron Balloons in 1997 and made its first flight that year, flying from the Bristol International Balloon Fiesta. It made its final flight in August 2002, also at the Bristol International Balloon Fiesta, and was subsequently retired and placed into storage. The balloon's flight certificate from the Civil Aviation Authority expired on 17 July 2003. In March 2023, the balloon was taken out of storage, restored and reinflated. On 2 June, it was flown at the Midlands Air Festival in Warwickshire. Launch As part of a large relaunch of the BBC's corporate logo and the ident packages of BBC One and BBC Two, these new idents replaced the old virtual globe ident. London-based design agency Lambie-Nairn proposed new idents showcasing the balloons with the familiar globe design that would serve as "a visual metaphor underpinning the core thought: BBC One – bringing the whole world to every corner of the Nation." The balloon idents were designed by Lambie-Nairn and the balloon was made in Bristol by Cameron Balloons. Its aircraft registration was "G-IBBC". Components of idents The idents featured a predominantly red balloon emblazoned with an orange world map and white clouds floating over various scenes of the British landscape. These colors were chosen because a balloon mimicking a traditional map's blue oceans and green land would have been more difficult to see against the natural scenery. The size of the balloon was originally proposed to be 100 ft. but was reduced to 60 ft. upon construction. The idents featured a soundtrack of ambient music, with livelier versions being used for more industrial or recreational settings. The soundtrack was composed by English musician Phil Sawyer. This score made these idents the first regular BBC One idents to use music since Abram Games's "Bat's Wings" ident. The new BBC logo, along with the channel name "ONE" immediately to its right, was overlaid at the bottom of the screen. The new logo design was an attempt to unify all the BBC's services and brands under a single logo d
https://en.wikipedia.org/wiki/Don%27t%20Fear%20the%20Roofer	"Don't Fear the Roofer" is the sixteenth episode of the sixteenth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on May 1, 2005, and guest-stars comedian Ray Romano and physicist Stephen Hawking. The episode is a parody of the 2001 film A Beautiful Mind. Plot A major thunderstorm hits Springfield, and Marge demands that Homer fix their leaking roof. Homer attempts to solve the problem by using Hot Wheels ramps to transport all the draining water from the roof to the front yard through the hallway, the stairway and the mail slot on the front door. Though this plan seems to work well, Lisa's hamster slides down the ramps to the front yard by accident. Shocked, Lisa opens the front door to save her hamster, breaking all the ramps, and leaving the house all wet, ruining Bart's preparations for the homework party and leaving Maggie's teddy bear ringing wet. Marge berates Homer for not providing a more sensible solution to fix the roof. Angered, Homer decides to go to Moe's Tavern, but is kicked out when he ruins Lenny's surprise birthday party and sits on his birthday cake by accident, shaped in the form of Lenny's favourite bar stool. Feeling depressed, Homer finds another bar, "Knockers" (a parody of the restaurant Hooters), where he meets a friendly man named Ray Magini. The two talk, and Homer finds out that Ray is a roofer, so Homer asks him to fix his leak. Ray agrees. The next day, Homer assures Marge that his new friend will be taking care of the roof. Ray, however, does not arrive until everyone else has left. The two of them get up on the roof and use nail guns to nail the boards onto the roof, but they start shooting nails at each other, some hitting Ned Flanders' ride-on lawn mower next door. Ray leaves later and, as Homer runs on the roof to see him off, he crashes through the small part of the roof that they fixed, making the hole bigger. Meanwhile, Marge and the kids leave Santa's Little Helper with Grampa and the Springfield Retirement Home residents, because they seem to like him. When Marge sees the hole, she tells Homer to fix it himself, because she sees no reason to believe that his friend will. The next day, Bart and Homer go to the Builder's Barn, and Homer meets Ray there. Ray apologizes to Homer for having not finished the job and promises he will stop by soon to work on the roof. Lisa, Marge, and Maggie arrive back at the retirement home, only to discover that Santa's Little Helper has become one of the old people. After Lisa succumbs to the same effect, they permanently take him back home. After waiting a long while for Ray to show on the roof, Marge becomes worried about Homer, and tells him that Ray is just a figment of his imagination. When Homer refuses to believe it, he falls off the roof and is knocked unconscious. The next day, Homer awakens inside Calmwood Mental Hospital, having been admitted there by Marge. Dr. Hibbert tells him that Ray do
https://en.wikipedia.org/wiki/Ben%20Shneiderman	Ben Shneiderman (born August 21, 1947) is an American computer scientist, a Distinguished University Professor in the University of Maryland Department of Computer Science, which is part of the University of Maryland College of Computer, Mathematical, and Natural Sciences at the University of Maryland, College Park, and the founding director (1983-2000) of the University of Maryland Human-Computer Interaction Lab. He conducted fundamental research in the field of human–computer interaction, developing new ideas, methods, and tools such as the direct manipulation interface, and his eight rules of design. Early life and education Born in New York, Shneiderman, attended the Bronx High School of Science, and received a BS in Mathematics and Physics from the City College of New York in 1968. He then went on to study at the State University of New York at Stony Brook, where he received an MS in Computer Science in 1972 and graduated with a PhD in 1973. Career Shneiderman started his academic career at the State University of New York at Farmingdale in 1968 as instructor at the Department of Data Processing. In the last year before his graduation he was an instructor at the Department of Computer Science of Stony Brook University (then called State University of New York at Stony Brook). In 1973 he was appointed assistant professor at the Indiana University, Department of Computer Science. In 1976 he moved to the University of Maryland. He started out as assistant professor in its Department of Information Systems Management, and became associate professor in 1979. In 1983 he moved to its Department of Computer Science as associate professor, and was promoted to full professor in 1989. In 1983 he was the Founding Director of its Human-Computer Interaction Lab, which he directed until 2000. In 2002 his book Leonardo's Laptop: Human Needs and the New Computing Technologies was Winner of an IEEE-USA Award for Distinguished Contributions Furthering Public Understanding of the Profession. His 2016 book, The New ABCs of Research: Achieving Breakthrough Collaborations, encourages applied and basic research to be combined. In 2019, he published Encounters with HCI Pioneers: A Personal History and Photo Journal, and Human-Centered AI in 2022. Awards and honors Shneiderman was inducted as a Fellow of the Association for Computing Machinery in 1997, a Fellow of the American Association for the Advancement of Science in 2001, a Member of the National Academy of Engineering in 2010, an IEEE Fellow in 2012, and a Fellow of the National Academy of Inventors in 2015. He is an ACM CHI Academy Member and received their Lifetime Achievement Award in 2001. He received the IEEE Visualization Career Award in 2012 and was inducted into the IEEE VIS Academy in 2019. In 2021 he received the InfoVis Conference Test of Time Award with co-authors Ben Bederson and Martin M. Wattenberg. He received Honorary Doctorates from the University of Guelph (Canada) in 1995, the U
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Hawaii	The following is a list of FCC-licensed radio stations in the U.S. state of Hawaii which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats. In addition, several stations in Honolulu also transmit their audio broadcasts on Spectrum Digital Cable for the entire state of Hawaii through local agreements. List of radio stations Defunct KCOF-LP KCSK-LP KVOK-FM KWAI References Hawaii Radio
https://en.wikipedia.org/wiki/VSAN	A virtual storage area network (virtual SAN, VSAN or vSAN) is a logical representation of a physical storage area network (SAN). A VSAN abstracts the storage-related operations from the physical storage layer, and provides shared storage access to the applications and virtual machines by combining the servers' local storage over a network into a single or multiple storage pools. The use of VSANs allows the isolation of traffic within specific portions of the network. If a problem occurs in one VSAN, that problem can be handled with a minimum of disruption to the rest of the network. VSANs can also be configured separately and independently. Technology Operation A VSAN operates as a dedicated piece of software responsible for storage access, and depending on the vendor, can run either as a virtual storage appliance (VSA), a storage controller that runs inside an isolated virtual machine (VM) or as an ordinary user-mode application, such as StarWind Virtual SAN, or DataCore SANsymphony. Alternatively it can be implemented as a kernel-mode loadable module, such as VMware vSAN, or Microsoft Storage Spaces Direct (S2D). A VSAN can be tied to a specific hypervisor, known as hypervisor-dedicated, or it can allow different hypervisors, known as hypervisor-agnostic. Different vendors have different requirements for the minimum number of nodes that participate in a resilient VSAN cluster. The minimum requirement is to have at least 2 for high availability. All-flash versus hybrid VSAN Data center operators can deploy VSANs in an all-flash environment or a hybrid configuration, where flash is only used at the caching layer, and traditional spinning disk storage is used everywhere else. All-flash VSANs are higher performing, but as of 2019 were more expensive than hybrid networks. Protocols For sharing storage over a network, VSAN utilizes protocols including Fibre Channel (FC), Internet Small Computer Systems Interface (iSCSI), Server Message Block (SMB), and Network File System (NFS), as well as proprietary protocols. Applications A VSAN fills a similar role as physical SAN infrastructure, but is also used for workload virtualization which can include databases, virtual desktop infrastructure (VDI) environments, file servers, CRM systems, and other enterprise applications. VSANs can be used for remote branch office networks, using low-cost commodity hardware. There are also applications with DMZ, an isolated network that sits outside a company's firewall, and areas with space constraints, such as vessels, where a reduced hardware footprint 2-3 node deployment has a better chance of fitting. By being able to work on top of commodity hardware, a VSAN is often used for building highly available networks across two or more sites that are combined in a single cluster, a type of deployment known as stretched clustering. A VSAN can also create highly available hybrid cloud environments by combining existing on-premises resources with public cloud en
https://en.wikipedia.org/wiki/Load%20factor	Load factor may refer to: Load factor (aeronautics), the ratio of the lift of an aircraft to its weight Load factor (computer science), the ratio of the number of records to the number of addresses within a data structure Load factor (electrical), the average power divided by the peak power over a period of time Capacity factor, the ratio of actual energy output to the theoretical maximum possible in a power station Passenger load factor, the ratio of revenue passenger miles to available seat miles of a particular transportation operation (e.g. a flight) Factor loadings in statistics, the exposure to specific factors or components in Factor Analysis or Principal Component Analysis See also Add-on factor - sometimes called load factor
https://en.wikipedia.org/wiki/Lawful%20interception	Lawful interception (LI) refers to the facilities in telecommunications and telephone networks that allow law enforcement agencies with court orders or other legal authorization to selectively wiretap individual subscribers. Most countries require licensed telecommunications operators to provide their networks with Legal Interception gateways and nodes for the interception of communications. The interfaces of these gateways have been standardized by telecommunication standardization organizations. As with many law enforcement tools, LI systems may be subverted for illicit purposes. With the legacy public switched telephone network (PSTN), wireless, and cable systems, lawful interception (LI) was generally performed by accessing the mechanical or digital switches supporting the targets' calls. The introduction of packet switched networks, softswitch technology, and server-based applications during the past two decades fundamentally altered how LI is undertaken. Lawful interception differs from the dragnet-type mass surveillance sometimes done by intelligence agencies, where all data passing a fiber-optic splice or other collection point is extracted for storage or filtering. It is also separate from the data retention of metadata that has become a legal requirement in some jurisdictions. Terminology Lawful interception is obtaining communications network data pursuant to lawful authority for the purpose of analysis or evidence. Such data generally consist of signalling or network management information or, in fewer instances, the content of the communications. If the data are not obtained in real-time, the activity is referred to as access to retained data (RD). There are many bases for this activity that include infrastructure protection and cybersecurity. In general, the operator of public network infrastructure can undertake LI activities for those purposes. Operators of private network infrastructures in the United States have an inherent right to maintain LI capabilities within their own networks unless otherwise prohibited. One of the bases for LI is the interception of telecommunications by law enforcement agencies (LEAs), regulatory or administrative agencies, and intelligence services, in accordance with local law. Under some legal systems, implementations—particularly real-time access to content—may require due process and receiving proper authorization from competent authorities—an activity that was formerly known as "wiretapping" and has existed since the inception of electronic communications. The material below primarily treats this narrow segment of LI. Technical description Almost all countries have lawful interception capability requirements and have implemented them using global LI requirements and standards developed by the European Telecommunications Standards Institute (ETSI), Third Generation Partnership Project (3GPP), or CableLabs organizations—for wireline/Internet, wireless, and cable systems, respectively. In
https://en.wikipedia.org/wiki/Virtual%20desktop	In computing, a virtual desktop is a term used with respect to user interfaces, usually within the WIMP paradigm, to describe ways in which the virtual space of a computer's desktop environment is expanded beyond the physical limits of the screen's display area through the use of software. This compensates limits of the desktop area and is helpful in reducing clutter of running graphical applications. There are two major approaches to expanding the virtual area of the screen. Switchable virtual desktops allow the user to make virtual copies of their desktop view-port and switch between them, with open windows existing on single virtual desktops. Another approach is to expand the size of a single virtual screen beyond the size of the physical viewing device. Typically, scrolling/panning a subsection of the virtual desktop into view is used to navigate an oversized virtual desktop. Overview Switching desktops Switchable desktops were designed and implemented at Xerox PARC as "Rooms" by Austin Henderson and Stuart Card in 1986 and (unknowingly to the authors until their publication) was conceptually similar to earlier work by Patrick Peter Chan in 1984. This work was covered by a US patent. Switchable desktops were introduced to a much larger audience by Tom LaStrange in swm (the Solbourne Window Manager, for the X Window System) in 1989. ("Virtual Desktop" was originally a trademark of Solbourne Computer.) Rather than simply being placed at an x, y position on the computer's display, windows of running applications are then placed at x, y positions on a given virtual desktop “context”. They are then only accessible to the user if that particular context is enabled. A switching desktop provides a pager for the user to switch between "contexts", or pages of screen space, only one of which can be displayed on the computer's display at any given time. Several X window managers provide switching desktops. Oversized desktops Other kinds of virtual desktop environments do not offer discrete virtual screens, but instead make it possible to pan around a desktop that is larger than the available hardware is capable of displaying. This facility is sometimes referred to as panning, scrolling desktops or view-port. For example, if a graphics card has a maximum resolution that is higher than the monitor's display resolution, the virtual desktop manager may allow windows to be placed "off the edge" of the screen. The user can then scroll to them by moving the mouse pointer to the edge of the display. The visible part of the larger virtual screen is called a viewport. Implementation Virtual desktop managers are available for most graphical user interface operating systems and offer various features, such as placing different wallpapers for each virtual desktop and use of hotkeys or other convenient methods to allow the user to switch amongst the different screens. Amiga The first platform to implement multiple desktop display as a hardware featur
https://en.wikipedia.org/wiki/Electronic%20Life	Electronic Life is a 1983 nonfiction book by Michael Crichton, an author better known for his novels. It is his third non-fiction book. Description Crichton owned several computers, and he wrote articles and computer programs in the programming language BASIC for Creative Computing magazine. He was inspired to write Electronic Life because so many of his friends would call him asking for advice on computers. The book was intended to introduce the idea of personal computers to a reader who might be faced with them at work or at home for the first time. It defined basic jargon and assured readers that they could master the machine when it inevitably arrived. Electronic Life is written as a glossary, with entries like "Afraid of Computers (everybody is)", "Buying a Computer", and "Computer Crime". Entries consist mainly of Crichton's musings on these topics, and few of the entries reflect any research. The computer crime entry, for example, is three pages long and contains only four hard facts—specifically, that institutions were then losing $5 billion to $30 billion a year on computer crime, that Citibank processed $30 billion a day in customer transactions using computers, that American banks as a whole were moving $400 billion a year in the U.S., and that the Stanford public key code (not otherwise described) had been broken in 1982. No examples of computer crime are given, though by 1983 such accounts were appearing in the mainstream press, and dedicated books on the topic had been around for at least a decade. Some portions of the book are dated. On page 140, Crichton points out that if you ask your computer to compute 5.015.02-5.03/2.04100.5+3.06+20.07-200.08+300.09/1.10, there will be a noticeable delay as it works out the answer. Later he suggests that a user would do well to buy a CP/M-based system, because of all the excellent applications for that platform. In the book, Crichton correctly predicts that computer networks would increase in importance. He saw this as a matter of convenience—computers can share pictures, which you can't do with a verbal phone call, and computer networks can operate asynchronously, so you can leave information for somebody and have them pick it up at their convenience. He also comments on games that are played on computers, saying "Arcade games are the hula hoops of the '80s, and already there are indications that the mania for twitch games (another name for arcade games) may be fading... However, unlike hula hoops, the present generation of computer games represents a transitional phenomenon on the way to a permanent alteration of our world. Computers are the most compelling toy ever invented ... Ever more elaborate and challenging games will be played on computers in the future. Why not? It's a way of making friends with the machine." In a section called "Microprocessors, or how I flunked biostatistics at Harvard", Crichton lashes out at a medical school teacher who had given him a 'D' fifteen years
https://en.wikipedia.org/wiki/Graphics%20device%20interface	A graphics device interface is a subsystem that most operating systems use for representing graphical objects and transmitting them to output devices such as monitors and printers. In most cases, the graphics device interface is only able to draw 2D graphics and simple 3D graphics, in order to make use of more advanced graphics and keep performance, an API such as DirectX or OpenGL needs to be installed. In Microsoft Windows, the GDI functionality resides in gdi.exe on 16-bit Windows, and gdi32.dll on 32-bit Windows. Operating system technology
https://en.wikipedia.org/wiki/Nassi%E2%80%93Shneiderman%20diagram	A Nassi–Shneiderman diagram (NSD) in computer programming is a graphical design representation for structured programming. This type of diagram was developed in 1972 by Isaac Nassi and Ben Shneiderman who were both graduate students at Stony Brook University. These diagrams are also called structograms, as they show a program's structures. Overview Following a top-down design, the problem at hand is reduced into smaller and smaller subproblems, until only simple statements and control flow constructs remain. Nassi–Shneiderman diagrams reflect this top-down decomposition in a straightforward way, using nested boxes to represent subproblems. Consistent with the philosophy of structured programming, Nassi–Shneiderman diagrams have no representation for a GOTO statement. Nassi–Shneiderman diagrams are only rarely used for formal programming. Their abstraction level is close to structured program code and modifications require the whole diagram to be redrawn, but graphic editors removed that limitation. They clarify algorithms and high-level designs, which make them useful in teaching. They were included in Microsoft Visio and dozens of other software tools, such as the German EasyCODE. In Germany, Nassi–Shneiderman diagrams were standardised in 1985 as DIN 66261. They are still used in German introductions to programming, for example Böttcher and Kneißl's introduction to C, Baeumle-Courth and Schmidt's introduction to C and Kirch's introduction to C#. Nassi–Shneiderman diagrams can also be used in technical writing. Diagrams Process blocks: the process block represents the simplest of steps and requires no analysis. When a process block is encountered, the action inside the block is performed and we move onto the next block. Branching blocks: there are two types of branching blocks. First is the simple True/False or Yes/No branching block which offers the program two paths to take depending on whether or not a condition has been fulfilled. These blocks can be used as a looping procedure stopping the program from continuing until a condition has been fulfilled. The second type of branching block is a multiple branching block. This block is used when a select case is needed in a program. The block usually contains a question or select case. The block provides the program with an array of choices and is often used in conjunction with sub process blocks to save space. Testing loops: this block allows the program to loop one or a set of processes until a particular condition is fulfilled. The process blocks covered by each loop are subset with a side-bar extending out from the condition. There are two main types of testing loops, test first and test last blocks. The only difference between the two is the order in which the steps involved are completed. In the test first situation, when the program encounters the block it tests to see if the condition is fulfilled, then, if it is not completes the process blocks and then loops back. The test is
https://en.wikipedia.org/wiki/XDR%20DRAM	XDR DRAM (extreme data rate dynamic random-access memory) is a high-performance dynamic random-access memory interface. It is based on and succeeds RDRAM. Competing technologies include DDR2 and GDDR4. Overview XDR was designed to be effective in small, high-bandwidth consumer systems, high-performance memory applications, and high-end GPUs. It eliminates the unusually high latency problems that plagued early forms of RDRAM. Also, XDR DRAM has heavy emphasis on per-pin bandwidth, which can benefit further cost control on PCB production. This is because fewer lanes are needed for the same amount of bandwidth. Rambus owns the rights to the technology. XDR is used by Sony in the PlayStation 3 console. Technical specifications Performance Initial clock rate at 400 MHz. (ODR): Eight bits per clock cycle per lane. Each chip provides 8, 16, or 32 programmable lanes, providing up to 230.4 Gbit/s (28.8 GB/s) at 900 MHz (7.2 GHz effective). Features Bi-directional differential Rambus Signalling Levels (DRSL) This uses differential open-collector driver, voltage swing 0.2V. It is not the same as LVDS. Programmable on-chip termination Adaptive impedance matching Eight bank memory architecture Up to four bank-interleaved transactions at full bandwidth Point-to-point data interconnect Chip scale package packaging Dynamic request scheduling Early-read-after-write support for maximum efficiency Zero overhead refresh Power requirements 1.8 V Vdd Programmable ultra-low-voltage DRSL 200 mV swing Low-power PLL/DLL design Power-down self-refresh support Dynamic data width support with dynamic clock gating Per-pin I/O power-down Sub-page activation support Ease of system design Per-bit FlexPhase circuits compensate to a 2.5 ps resolution XDR Interconnect uses minimum pin count Latency 1.25/2.0/2.5/3.33 ns request packets Protocol An XDR RAM chip's high-speed signals are a differential clock input (clock from master, CFM/CFMN), a 12-bit single-ended request/command bus (RQ11..0), and a bidirectional differential data bus up to 16 bits wide (DQ15..0/DQN15..0). The request bus may be connected to several memory chips in parallel, but the data bus is point to point; only one RAM chip may be connected to it. To support different amounts of memory with a fixed-width memory controller, the chips have a programmable interface width. A 32-bit-wide DRAM controller may support 2 16-bit chips, or be connected to 4 memory chips each of which supplies 8 bits of data, or up to 16 chips configured with 2-bit interfaces. In addition, each chip has a low-speed serial bus used to determine its capabilities and configure its interface. This consists of three shared inputs: a reset line (RST), a serial command input (CMD) and a serial clock (SCK), and serial data in/out lines (SDI and SDO) that are daisy-chained together and eventually connect to a single pin on the memory controller. All single-ended lines are active-low; an asserted signal
https://en.wikipedia.org/wiki/Access%20Point%20Name	An Access Point Name (APN) is the name of a gateway between a mobile network (GSM, GPRS, 3G, 4G and 5G) and another computer network, frequently the public Internet. A mobile device making a data connection must be configured with an APN to present to the carrier. The carrier will then examine this identifier to determine what type of network connection should be created, for example: which IP addresses should be assigned to the wireless device, which security methods should be used, and how, or if, it should be connected to some private customer network. More specifically, the APN identifies the packet data network (PDN) that a mobile data user wants to communicate with. In addition to identifying a PDN, an APN may also be used to define the type of service, (e.g. connection to Wireless Application Protocol (WAP) server, Multimedia Messaging Service (MMS)) that is provided by the PDN. APN is used in 3GPP data access networks, e.g. General Packet Radio Service (GPRS), evolved packet core (EPC). Structure of an APN A structured APN consists of two parts as shown in the accompanying figure. Network Identifier: Defines the external network to which the Gateway GPRS Support Node (GGSN) is connected. Optionally, it may also include the service requested by the user. This part of the APN is mandatory Operator Identifier: Defines the specific operator's packet domain network in which the GGSN is located. This part of the APN is optional. The MCC is the mobile country code and the MNC is the mobile network code which together uniquely identify a mobile network operator. Examples of APN are: (Note: This example APN uses a domain name from the DNS which belongs to the operator) (Note: This APN example does not contain an operator) (Note: Does not contain an operator, however in practice it is AT&T Mobility's LTE APN) (Note: No operator, but the APN name clearly identifies Verizon Wireless) (Note: APN name clearly identifies operator Mobitel) (Note: APN name clearly identifies operator Jio) (Tethering service by Dish Network) LTE networks use APN-FQDN format, which differs from the 2G/3G format described above as follows. "apn.epc." is inserted before "mnc", and the ".gprs" at the end becomes ".3gppnetwork.org" For example: the 2G/3G internet.mnc012.mcc345.gprs becomes internet.apn.epc.mnc012.mcc345.3gppnetwork.org . KPN Incident In 2023, an incident was discovered where choosing the advancedinternet APN from the ISP KPN drained the battery of smartphones significantly faster. This APN was designed to give internet access without a firewall and public IP adresses. References External links Mobile telecommunications standards 3GPP standards GSM standard
https://en.wikipedia.org/wiki/Rogue%20Entertainment	Rogue Entertainment was an American computer game developer based in Dallas, Texas, which was active in the late 1990s. It was founded by Rich Fleider, Steve Maines, and Jim Molinets in 1994. Rogue Entertainment's office was in the same building as id Software, all of their games used game engines created by id Software, and two of their games were expansions for id Software's Quake series of games. The company's first game, Strife: Quest for the Sigil, was released as shareware on February 23, 1996, with the retail version later being released on May 31, 1996. Many former Rogue Entertainment employees moved to Nerve Software after Rogue Entertainment shut down. Games developed by Rogue Entertainment Strife (1996) (PC) Quake Mission Pack No. 2: Dissolution of Eternity (1997) (PC) Quake II Mission Pack: Ground Zero (1998) (Windows) Quake II (1999) (Nintendo 64) American McGee's Alice (2000) (Windows) Counter-Strike: Condition Zero (never published, development passed back to Valve, later to Gearbox Software) References External links Official website via Internet Archive Rogue Entertainment at MobyGames 1994 establishments in Texas 2001 disestablishments in Texas Companies based in Dallas Defunct companies based in Texas Video game companies established in 1994 Video game companies disestablished in 2001 Defunct video game companies of the United States Video game development companies
https://en.wikipedia.org/wiki/Cyclanthera%20pedata	Cyclanthera pedata, known as caigua, is a herbaceous vine grown for its edible fruit, which is predominantly used as a vegetable. It is known from cultivation only, and its use goes back many centuries as evidenced by ancient phytomorphic ceramics from Peru depicting the fruits. Origin and distribution Not known in the wild, but presumably native to the Andes where it has been traditionally cultivated. Description Cyclanthera pedata is a vine that can be 12 m long; the stems are thin; and the leaves can be up to 24 cm long, palmate or pedate in shape. The small flowers can be greenish or white and are borne in racemes. The fruit is light green, ovoid, curved, up to 15 cm long, almost hollow (except for the seeds and a thin flesh layer), with smooth skin or sometimes covered in soft spines; the seeds are black. Cultivation Cyclanthera pedata is grown at small scale farming in mountain areas of Mexico, Central America and South America. It is sometimes cultivated in Asia. This species can be grown in mountain areas up to 2000, being adapted to cool temperatures. Vernacular names Known in the Andes as caigua or caihua (possibly from Quechua kaywa); also as achocha (possibly from Quechua achuqcha). In English it is named stuffing cucumber or slipper gourd. In Costa Rica it is called Jaiva. In Darjeeling, India, it is called Chuchay Karela. In Chinese, it is known as 小雀瓜. Uses Food The fruits are eaten after removing the seeds and stuffing them with other foods like rice or meat, and then cooking them. Young shoots and leaves can also be eaten as greens. The fruits are a source of potassium, magnesium and phosphorus. Fruit flavor is similar to cucumber crossed with green bean or otherwise tasteless. Chemistry The fruits contain flavonoid glycosides of which four show an antioxidant effect. Caigua fruits generally exhibit high antioxidant activity but a low total phenolic content, which indicates that non-phenolic water-soluble compounds might be involved. Flavonoids are present in this cyclanthera species, which have antioxidant properties as well and were shown that with a high intake are correlated to a decrease in heart disease. Dried samples of caigua showed α-amylase inhibition and relevant ACE inhibitory activities. A negative aspect of caigua is, that the seeds contain a group of trypsin inhibitors, which negatively affect protein absorption. Other chemicals in the Caigua include triterpenoid saponins and the seeds have been reported with six cucurbitacin glycosides. as well as 28-30 amino acids. Archaeology The Moche culture often depicted this species in their ceramics. Remains of this species have also been found buried in archaeological sites on the Peruvian coast. References pedata Fruit vegetables Crops originating from Peru Plants described in 1753 Taxa named by Carl Linnaeus
https://en.wikipedia.org/wiki/B4U%20%28network%29	B4U is a television network focused on Bollywood based entertainment. The network operates the six channels B4U Music, B4U Movies, B4U Kadak, B4U Bhojpuri, B4U Aflam and B4U Plus which are at present available on more than 8 different satellites, in more than 100 countries in the Americas, Europe, Middle East, Africa, and Asia. In addition, the company operates B4U Motion Pictures, which is a media and entertainment production subsidiary. Company history In 1999, the newly formed network launched B4U Movies and B4U Music in the UK on the Sky Digital platform as a subscription package along with Sony Entertainment Television. The launch was surrounded by controversy, with rival network Zee TV claiming that B4U had stolen its database of subscribers in the UK. The B4U management claimed that they had got hold of the database from ex-employees and have been using it to send mailers promoting its service. In 2001, the network went on to launch the channels in the United States and Canada and the Middle East by the end of the year. By 2000, B4U had established itself as a leading brand in Bollywood entertainment for the Indian Diaspora. B4U signed a deal with FTV to broadcast Indian fashion shows throughout the world as well as more local events. In 2001, the network won 9 Promax Awards. The network then ventured into movie production in 2002, co-producing all films produced by iDream. Television channels B4U Today The network was the media sponsor Mayor of London's 2007 Diwali Festival in Trafalgar Square. B4U Films B4U Films (alternatively named, B4U Productions Plc.) is a wholly owned subsidiary of B4U TV Ltd. (B4U), Mumbai based media and entertainment production company. It was started in 1997, and handles the motion picture production and distribution of B4U. B4U Films produces films in Bollywood as well as in Punjab, where it partners with other leading film studios. They distribute Lollywood movies as well. It first produced Bhai, which starred Suniel Shetty, Kader Khan and Kunal Khemu. In 2015 they started distributing Pakistani films by distributing Karachi Se Lahore worldwide. The latest film, they had distributed was Mahira Khan starred Pakistani romantic comedy film 7 Din Mohabbat In. List of B4U films References External links B4U official site B4U group site Foreign television channels broadcasting in the United Kingdom Television stations in India British Indian mass media Television channels and stations established in 1999 Hindi cinema 1999 establishments in the United Kingdom Television broadcasting companies of India Mass media companies of India Television networks in India Broadcasting
https://en.wikipedia.org/wiki/Remote%20digital%20terminal	In telecommunications, a remote digital terminal (RDT) typically accepts E1, T1 or OC-3 digital lines to communicate with a telephone Access network (AN) or telephone exchange (Local Digital Switch, LDS) on one side, and forms a local exchange (LE) on the other, which is connected to "plain old telephone service" (POTS) lines. See also Distributed switching Remote concentrator Digital access carrier system References Local loop
https://en.wikipedia.org/wiki/Louis%20Couffignal	Louis Pierre Couffignal (16 March 1902 – 4 July 1966) was a French mathematician and cybernetics pioneer, born in Monflanquin. He taught in schools in the southwest of Brittany, then at the naval academy and, eventually, at the Buffon School. Biography After joining the school, Couffignal hesitated to write a thesis on Symbolic Logic but after his meetings with Philbert Maurice d'Ocagne, he decided to focus on machines and on Mechanical Logic. He published a variety of notes at the Academy of Sciences, with a focus on using binary computation by machines to solve new problems. Following Leibniz, he promoted binary numbers as the basis of calculating machines. Couffignal received his Doctorate of Sciences in 1938 with his thesis on Mechanical Analysis, demonstrating applications for machines to calculate celestial mechanics. Couffignal took on an interest in Cybernetics, influenced by his meetings with Louis Lapicque in 1941 and the cyberneticist Norbert Wiener in 1946. With Lapicque, Couffignal compared the functioning of the nervous system and that of machines, as Wiener prepared his book Cybernetics, the book that established the foundations for the subject. Between 1938 and 1960, Couffignal was the director of the Blaise Pascal Calculation Center. In 1945, he was named Inspector General of Public Teaching. In 1951, Couffignal prepared an international conference on thinking machines to bring together the greatest specialists in this new science, including Norbert Wiener, W. Ross Ashby, Warren McCulloch, etc. As Inspector General, he created the first BTS teaching degree in France. Publications Couffignal wrote several books and articles. A selection: Les machines à calculer. Leurs principes. Leur évolution. 1952, Les machines à penser. Couffignal Éditions de Minuit. 1956, "Essai d’une définition générale de la cybernétique", The First International Congress on Cybernetics, Namur, Belgium, June 26–29, 1956, Gauthier-Villars, Paris, 1958, pp. 46–54 1968, Le dossier de la cybernétique – Marabout Université 1968 1972, La cybernétique et ses théoriciens – Delpech J.L Ed. Casterman. 1978, ''La cybernétique, Presses Universitaires France. See also Cybernetics External links Louis Couffignal: Trait d'union entre bastide et cybernétique by Patrick Saint-Jean (French) 1902 births 1966 deaths People from Monflanquin 20th-century French mathematicians Cyberneticists Place of death missing Officers of the Legion of Honour
https://en.wikipedia.org/wiki/Stack-based%20memory%20allocation	Stacks in computing architectures are regions of memory where data is added or removed in a last-in-first-out (LIFO) manner. In most modern computer systems, each thread has a reserved region of memory referred to as its stack. When a function executes, it may add some of its local state data to the top of the stack; when the function exits it is responsible for removing that data from the stack. At a minimum, a thread's stack is used to store the location of a return address provided by the caller in order to allow return statements to return to the correct location. The stack is often used to store variables of fixed length local to the currently active functions. Programmers may further choose to explicitly use the stack to store local data of variable length. If a region of memory lies on the thread's stack, that memory is said to have been allocated on the stack, i.e. stack-based memory allocation (SBMA). This is contrasted with a heap-based memory allocation (HBMA). The SBMA is often closely coupled with a function call stack. Advantages and disadvantages Because the data is added and removed in a last-in-first-out manner, stack-based memory allocation is very simple and typically much faster than heap-based memory allocation (also known as dynamic memory allocation) e.g. C's . Another feature is that memory on the stack is automatically, and very efficiently, reclaimed when the function exits, which can be convenient for the programmer if the data is no longer required. (The same applies to longjmp if it moved to a point before the call to happened.) If, however, the data needs to be kept in some form, then it must be copied from the stack to the heap before the function exits. Therefore, stack based allocation is suitable for temporary data or data which is no longer required after the current function exits. A thread's assigned stack size can be as small as only a few bytes on some small CPUs. Allocating more memory on the stack than is available can result in a crash due to stack overflow. This is also why functions that use are usually prevented from being inlined: should such a function be inlined into a loop, the caller would suffer from an unanticipated growth in stack usage, making an overflow much more likely. Stack-based allocation can also cause minor performance problems: it leads to variable-size stack frames, so that both stack and frame pointers need to be managed (with fixed-size stack frames, the stack pointer is redundant due to multiplying the stack frame pointer by the size of each frame). This is usually much less costly than calling and anyway. In particular, if the current function contains both calls to alloca and blocks containing variable-length local data then a conflict occurs between alloca's attempts to increase the current stack frame until the current function exits versus the compiler's need to place local variables of variable length in the same location in the stack frame. This conflict is
https://en.wikipedia.org/wiki/Hoard%20memory%20allocator	The Hoard memory allocator, or Hoard, is a memory allocator for Linux, OS X, and Microsoft Windows. Hoard is designed to be efficient when used by multithreaded applications on multiprocessor computers. Hoard is distributed under the Apache License, version 2.0. History In 2000, its author Emery Berger benchmarked some famous memory allocators and stated Hoard improves the performance of multithreaded applications by providing fast, scalable memory management functions (malloc and free). In particular, it reduces contention for the heap (the central data structure used in dynamic memory allocation) caused when multiple threads allocate or free memory, and avoids the false sharing that can be introduced by memory allocators. At the same time, Hoard has strict bounds on fragmentation. Hoard continues to be maintained and improved, and is in use by a number of open source and commercial projects. It has also inspired changes to other memory allocators such as the one in OS X since February 2008 (first released in Mac OS X Snow Leopard). See also C dynamic memory allocation Manual memory management Dynamic memory allocation mimalloc References External links The Hoard web page. Emery Berger, Hoard's author and a professor at the University of Massachusetts Amherst. Memory management Memory management software
https://en.wikipedia.org/wiki/Schwein	Schwein (German for pig as well as pork) is a music group comprising members of Buck-Tick, KMFDM, and PIG. Members Raymond Watts (vocals, programming, guitar) and Hisashi Imai (Buck-Tick; guitar and noise), both having worked together in Schaft, were joined by Atsushi Sakurai (Buck-Tick; vocals), Sascha Konietzko (KMFDM; vocals and programming) and Lucia Cifarelli (KMFDM; vocals). In 2001 Schwein released an album, Schweinstein, followed by the remix album Son of Schweinstein. Schwein toured Japan in the summer of 2001. However, Konietzko did not tour with them, citing illness and a desire to focus on KMFDM. Discography Studio album Schweinstein (2001) Remixed album Son of Schweinstein (2001) Members Official members Raymond Watts - guitars, programming, vocals (PIG, Schaft, KMFDM) Atsushi Sakurai - vocals (Buck-Tick) Hisashi Imai - guitars, noises (Buck-Tick, Schaft) Sascha Konietzko - programming, vocals, percussion (KMFDM) Guest musicians Lucia Cifarelli - vocals (KMFDM) Jules Hodgson - guitars, bass, programming (KMFDM) Chris Ignatiou - guitars (One Minute Silence) Kazutoshi Yokoyama - Manipulate, Additional programming (Buck-Tick touring member) Julian Beeston - Additional programming Touring members Bryan Black - keyboards Arianne Schreiber - backing vocals Andy Selway - drums (KMFDM) References KMFDM Japanese supergroups Japanese industrial music groups German industrial music groups Musical groups established in 2001
https://en.wikipedia.org/wiki/SAGA%20GIS	System for Automated Geoscientific Analyses (SAGA GIS) is a geographic information system (GIS) computer program, used to edit spatial data. It is free and open-source software, developed originally by a small team at the Department of Physical Geography, University of Göttingen, Germany, and is now being maintained and extended by an international developer community. SAGA GIS is intended to give scientists an effective but easily learnable platform for implementing geoscientific methods. This is achieved by the application programming interface (API). SAGA has a fast-growing set of geoscientific methods, bundled in exchangeable module libraries. The standard modules are: File access: interfaces to various table, vector, image and grid file formats, including shapefiles, Esri grids (ASCII and binary), and many grid file formats supported by the Geospatial Data Abstraction Library (GDAL), along with the native SGRD format of SAGA GIS. Filter for grids: Gaussian, Laplacian, multi-directional Lee filter. Gridding: interpolation from vector data using triangulation, nearest neighbour, inverse distance. Geostatistics: residual analysis, ordinary and universal kriging, single and multiple regression analysis, variance analysis. Grid calculator: combine grids through user defined functions. Grid discretisation: skeletonisation, segmentation. Grid tools: merging, resampling, gap filling. Image classification: cluster analysis, box classification, maximum likelihood, pattern recognition, region growing. Projections: various coordinate transformations for vector and grid data (using Proj4 and GeoTrans libraries), georeferencing of grids. Simulation of dynamic processes: TOPMODEL, nitrogen distributions, erosion, landscape development. Terrain analysis: geomorphometric calculations such as slope, aspect, curvatures, curvature classification, analytical hillshading, sink elimination, flow path analysis, catchment delineation, solar radiation, channel lines, relative altitudes. Vector tools: polygon intersection, contour lines from grid. SAGA GIS is an effective tool with user friendly graphical user interface (GUI) that requires only about 10 MB disk space. No installation is needed, since SAGA GIS can be run directly from a USB thumb drive if desired. SAGA GIS is available for Windows, Linux, and FreeBSD. SAGA GIS can be used together with other GIS software like Kosmo and QGIS in order to obtain enhanced detail in vector datasets as well as higher-resolution map-production capabilities. SAGA GIS modules can be executed from within the statistical data analysis software R, in order to integrate statistical and GIS analyses. References Böhner, J., McCloy, K.R., Strobl, J. [eds.] (2006): SAGA - Analysis and Modelling Applications. Göttinger Geographische Abhandlungen, Vol.115, 130pp. Böhner, J., Blaschke, T., Montanarella, L. [eds.] (2008): SAGA - Seconds Out. Hamburger Beiträge zur Physischen Geographie und Landschaftsökologie, Vol.1
https://en.wikipedia.org/wiki/LandSerf	LandSerf is a free geographic information system for editing, processing and visualizing spatial data. It is particularly suited to handling Digital Elevation Models (DEMs) and other surface models. It is written in Java and runs on Windows, Mac OS and Linux platforms. History The first version of LandSerf was written in 1996 as a platform for performing scale-based analysis of Digital Elevation Models. It implemented the idea of multiscale surface characterisation proposed by Jo Wood where characteristics such as slope, curvature and feature type could be measured over a range of spatial scales. Subsequent releases of the software have enhanced its visualization capabilities (for example, 3d real-time flythroughs using OpenGL) and the range of file formats it can import and export. With the addition of Vector handling (1998), attribute tables (2003) and raster and Vector overlay (2004), LandSerf can be regarded as an example of a Geographic Information System (GIS). Applications LandSerf has been used in a range of application areas including landscape visualization, geomorphology, ecology, archaeology, 3d gaming, GPS mapping and file format conversion. Availability LandSerf is not open source, but it is freely available and has a documented API to allow Java programmers to customise and enhance the software. External links LandSerf homepage GIS software
https://en.wikipedia.org/wiki/Sparse%20conditional%20constant%20propagation	In computer science, sparse conditional constant propagation (SCCP) is an optimization frequently applied in compilers after conversion to static single assignment form (SSA). It simultaneously removes some kinds of dead code and propagates constants throughout a program. Moreover, it can find more constant values, and thus more opportunities for improvement, than separately applying dead code elimination and constant propagation in any order or any number of repetitions. The algorithm operates by performing abstract interpretation of the code in SSA form. During abstract interpretation, it typically uses a flat lattice of constants for values and a global environment mapping SSA variables to values in this lattice. The crux of the algorithm comes in how it handles the interpretation of branch instructions. When encountered, the condition for a branch is evaluated as best possible given the precision of the abstract values bound to variables in the condition. It may be the case that the values are perfectly precise (neither top nor bottom) and hence, abstract execution can decide in which direction to branch. If the values are not constant, or a variable in the condition is undefined, then both branch directions must be taken to remain conservative. Upon completion of the abstract interpretation, instructions which were never reached are marked as dead code. SSA variables found to have constant values may then be inlined at (propagated to) their point of use. Notes References Cooper, Keith D. and Torczon, Linda. Engineering a Compiler. Morgan Kaufmann. 2005. Compiler optimizations
https://en.wikipedia.org/wiki/Morecambe%20railway%20station	Morecambe is a railway station on the Morecambe Branch Line, which runs between and . The station, situated west of Lancaster, serves the town of Morecambe in Lancashire. It is owned by Network Rail and managed by Northern Trains. The current truncated two-platform station was opened on 29 May 1994, replacing the Midland Railway's earlier terminus, , which was situated some further west, closer to the town's seafront. The old station building remains in use as a pub and restaurant, but its platforms have been demolished and the site is now occupied by a cinema and the Morecambe indoor market. That station was itself a replacement for the North Western Railway's original two-platform terminus at Northumberland Street, which opened in 1851 and closed in March 1907. It was located almost exactly on the same site as the current station and ticket office. Facilities Services are operated by a variety of diesel multiple units, including Class 150, Class 156 and Class 158 sets. Terminating passenger services usually run into Platform 1. However, trains to/from Heysham must use the Platform 2 line in order to reverse and gain access to the single track Heysham branch. The lines to Platforms 1 and 2 connect away at a junction east of station. Heysham services (currently one return trip to Lancaster Mondays-Saturdays, and one return trip to Leeds on Sundays) access the Heysham section by means of a ground frame at the junction which is released by Preston signalling centre (which has supervised the branch since the closure of Bare Lane signal box in December 2012) and operated by the train crew. The ticket office is staffed from the early morning until mid-afternoon, six days per week (closed Sundays). Passengers can purchase tickets (or a permit to travel) from a ticket vending machine at the station at other times. A waiting shelter is provided, along with a P.A system and digital information screens. There is step-free access to the platform from the station entrance and ticket office. Services The station is served by Northern local services, which operate as a regular Lancaster-Morecambe shuttle. There are also five daily longer-distance services from Morecambe to and via the Leeds to Morecambe Line. Additionally, there is a limited service (one each way all week) to Heysham, connecting with the ferry to the Isle of Man. Trains for Heysham must reverse at Morecambe. The token direct trains to Carnforth that ran up until the summer 2019 timetable change (one early morning Lancaster - Morecambe - train, plus one weekday and three Sunday services to Leeds) have now been withdrawn. The Parliamentary train legal minimum service for the Bare Lane to Hest Bank North Junction chord is now provided by an early morning train from Lancaster, which runs via Carnforth (reverse) and the curve in question. Future improvements Northern's franchise agreement (started on 1 April 2016) includes provision for additional trains on the Leeds route - thr
https://en.wikipedia.org/wiki/Copy%20propagation	In compiler theory, copy propagation is the process of replacing the occurrences of targets of direct assignments with their values. A direct assignment is an instruction of the form x = y, which simply assigns the value of y to x. From the following code: y = x z = 3 + y Copy propagation would yield: z = 3 + x Copy propagation often makes use of reaching definitions, use-def chains and def-use chains when computing which occurrences of the target may be safely replaced. If all upwards exposed uses of the target may be safely modified, the assignment operation may be eliminated. Copy propagation is a useful "clean up" optimization frequently used after other compiler passes have already been run. Some optimizations—such as classical implementations of elimination of common sub expressions—require that copy propagation be run afterwards in order to achieve an increase in efficiency. See also Copy elision Constant folding and constant propagation References Further reading Muchnick, Steven S. Advanced Compiler Design and Implementation. Morgan Kaufmann. 1997. Compiler optimizations
https://en.wikipedia.org/wiki/America%27s%20Talking	America's Talking was an American short-lived cable television channel focused mainly on talk based programming, created by NBC and spun off from economic channel CNBC. It was launched on July 4, 1994, and was carried in 10 million American households upon launch. The headquarters were in an office building in Fort Lee, New Jersey, two floors below CNBC's original studios, on Fletcher Avenue. It was shuttered on July 15, 1996, and its transponder space was replaced by MSNBC. Programming The programming was mainly focused on low-budget talk shows, and included the following lineup: America's Talking A.M. - A morning talk show, hosted by Steve Doocy and Kai Kim, with Tony Morelli as "the Prodigy Guy". Am I Nuts? - (later named State of Mind) hosted by psychologist Bernie Katz and behavioral therapist Cynthia Richmond. What's New? - The latest hot gadgets, hosted by Mike Jerrick and later Brian Tracey. Break A Leg with Bill McCuddy - Mid-afternoon chatfest hosted by the winner of a CNBC-sponsored talent contest, Bill McCuddy. Featured celebrities and musical acts. Alive and Wellness - Healthy living by holistic methods, hosted by Carol Martin. Ask E. Jean - A call-in advice show hosted by writer E. Jean Carroll. Have a Heart - A talk/news show discussing the brighter side of the news and show-arranged charitable situations, hosted by Lu Hanessian. Pork - A political talk show focusing on government waste hosted by John David Klein. The executive producers were Robin Gellman and Dennis Sullivan. AT In-Depth - A two-hour news/talk show focusing on the day's top stories, co-hosted by Terry Anzur in Fort Lee and Chris Matthews in Washington. Matthews later got his own show (see below) and the show became In Depth Coast to Coast with Anzur in Burbank, CA, and John Gibson in Fort Lee. Straight Forward - A celebrity hour-long talk show, hosted by the President of the network, Roger Ailes. Bugged! - A comedic look at what bugs people, hosted by Brian O'Connor with Bill Gulino. R&R with Roger Rose - A late-night themed talk show featuring the latest music and celebrities. After Hours - This show replaced R&R, was basically the same format, hosted by Brian Tracy and Bill Gulino. The show was eventually moved over to CNBC where it was hosted by Mike Jerrick. Politics with Chris Matthews - After moving over to CNBC during the rampdown of America's Talking, the show was renamed Hardball with Chris Matthews and eventually moved to MSNBC, where it aired nightly at 7 p.m. until March 2, 2020, when Mathews announced his retirement at the top of his final program. Following a commercial break, Steve Kornacki took over for the rest of that episode. Cable Crossings - A minute-long serial that aired between programs, written by Marv Himelfarb, featuring Brian Fraley, and Kim Gregory. Music written by Bill Gulino. Demise While America's Talking had something of a following, it was not successful in the ratings and was picked up by few cable providers. In January 1996,
https://en.wikipedia.org/wiki/FringeWare%20Review	FringeWare Review was a magazine about subculture (predominantly cyberculture) published in Austin, Texas. Many of the publication's writers and editors were associated with other publications such as Boing Boing, Mondo 2000, Whole Earth Review, and Wired. The last issue of the magazine was #14, published in 1998. The magazine had an international circulation, distributed primarily by Fine Print, an Austin-based company that focused on 'zine distribution. History FringeWare Review was established in 1994. The publication was co-founded by Jon Lebkowsky and Paco Nathan, with art director Monte McCarter and assistant editor Tiffany Lee Brown. The magazine's parent company, FringeWare, Inc., was the first company built on Internet community (the FringeWare email list, later referred to as the FringeWare News Network), and probably the first to use web technology when it appeared. FringeWare also had presences on The WELL and on Illuminati Online's Metaverse, which was conceived as a commercial multiuser object-oriented environment (MOO). Fringe Ware quickly built an international reputation through the Internet and the magazine. As online communities and the Internet spread in popularity during the 1990s, Fringe Ware became known as an early forebear to online commerce sites such as Amazon and to magazines such as Wired, which named Fringe Ware Review in its Top 10 List. The company also owned an independent bookstore in Austin, Texas, that was an underground culture-hub for the city of Austin. Many performances and events were held at the bookstore, for example the first US performance of Austrian art pranksters monochrom in 1998. FringeWare was one of many independent businesses to disappear from Austin during the late 1990s. Lebkowsky and Nathan, who met as Austin-based associate editors of the print version of bOING bOING, originally conceived the company as a way to bring micro producers of cool software and gadgets to market via ecommerce. They began with an email list, which had high adoption among an international set of technoculture mavens and Internet early adopters, and later became known as the FringeWare News Network. Nathan built a web site in 1992, creating an early custom content management system and online catalog of products. This would have become the first instance of ecommerce on the Internet, however credit card companies pre-SSL prohibited online sales, so the alternative was mail-order, and this required a print catalog. While hashing out plans for a FringeWare catalog, the two decided to create a magazine, inspired by Boing Boing and Whole Earth Review/Coevolution Quarterly, with a catalog in the back pages. Mark Frauenfelder of Boing Boing referred to the publication as a "magalog." See also Jon Lebkowsky Paco Nathan Clayton Counts Erik Davis Robby Garner John Shirley Don Webb Wiley Wiggins References Further reading External links FringeWare.com archive at Internet Archive Fringeware timeline at Laughingbone.com
https://en.wikipedia.org/wiki/Reaching%20definition	In compiler theory, a reaching definition for a given instruction is an earlier instruction whose target variable can reach (be assigned to) the given one without an intervening assignment. For example, in the following code: d1 : y := 3 d2 : x := y d1 is a reaching definition for d2. In the following, example, however: d1 : y := 3 d2 : y := 4 d3 : x := y d1 is no longer a reaching definition for d3, because d2 kills its reach: the value defined in d1 is no longer available and cannot reach d3. As analysis The similarly named reaching definitions is a data-flow analysis which statically determines which definitions may reach a given point in the code. Because of its simplicity, it is often used as the canonical example of a data-flow analysis in textbooks. The data-flow confluence operator used is set union, and the analysis is forward flow. Reaching definitions are used to compute use-def chains. The data-flow equations used for a given basic block in reaching definitions are: In other words, the set of reaching definitions going into are all of the reaching definitions from 's predecessors, . consists of all of the basic blocks that come before in the control-flow graph. The reaching definitions coming out of are all reaching definitions of its predecessors minus those reaching definitions whose variable is killed by plus any new definitions generated within . For a generic instruction, we define the and sets as follows: , a set of locally available definitions in a basic block , a set of definitions (not locally available, but in the rest of the program) killed by definitions in the basic block. where is the set of all definitions that assign to the variable . Here is a unique label attached to the assigning instruction; thus, the domain of values in reaching definitions are these instruction labels. Worklist algorithm Reaching definition is usually calculated using an iterative worklist algorithm. Input: control-flow graph CFG = (Nodes, Edges, Entry, Exit) // Initialize for all CFG nodes n in N, OUT[n] = emptyset; // can optimize by OUT[n] = GEN[n]; // put all nodes into the changed set // N is all nodes in graph, Changed = N; // Iterate while (Changed != emptyset) { choose a node n in Changed; // remove it from the changed set Changed = Changed -{ n }; // init IN[n] to be empty IN[n] = emptyset; // calculate IN[n] from predecessors' OUT[p] for all nodes p in predecessors(n) IN[n] = IN[n] Union OUT[p]; oldout = OUT[n]; // save old OUT[n] // update OUT[n] using transfer function f_n () OUT[n] = GEN[n] Union (IN[n] -KILL[n]); // any change to OUT[n] compared to previous value? if (OUT[n] changed) // compare oldout vs. OUT[n] { // if yes, put all successors of n into the changed set for all nodes s in successors(n) Changed = Changed U { s }; } } See also Dead-code elimination Loop-invaria
https://en.wikipedia.org/wiki/Loop%20optimization	In compiler theory, loop optimization is the process of increasing execution speed and reducing the overheads associated with loops. It plays an important role in improving cache performance and making effective use of parallel processing capabilities. Most execution time of a scientific program is spent on loops; as such, many compiler optimization techniques have been developed to make them faster. Representation of computation and transformations Since instructions inside loops can be executed repeatedly, it is frequently not possible to give a bound on the number of instruction executions that will be impacted by a loop optimization. This presents challenges when reasoning about the correctness and benefits of a loop optimization, specifically the representations of the computation being optimized and the optimization(s) being performed. Optimization via a sequence of loop transformations Loop optimization can be viewed as the application of a sequence of specific loop transformations (listed below or in Compiler transformations for high-performance computing) to the source code or intermediate representation, with each transformation having an associated test for legality. A transformation (or sequence of transformations) generally must preserve the temporal sequence of all dependencies if it is to preserve the result of the program (i.e., be a legal transformation). Evaluating the benefit of a transformation or sequence of transformations can be quite difficult within this approach, as the application of one beneficial transformation may require the prior use of one or more other transformations that, by themselves, would result in reduced performance. Common loop transformations include: Fission or distribution – loop fission attempts to break a loop into multiple loops over the same index range, but each new loop takes only part of the original loop's body. This can improve locality of reference, both of the data being accessed in the loop and the code in the loop's body. Fusion or combining – this combines the bodies of two adjacent loops that would iterate the same number of times (whether or not that number is known at compile time), as long as they make no reference to each other's data. Interchange or permutation – these optimizations exchange inner loops with outer loops. When the loop variables index into an array, such a transformation can improve locality of reference, depending on the array's layout. Inversion – this technique changes a standard while loop into a do/while (a.k.a. repeat/until ) loop wrapped in an if conditional, reducing the number of jumps by two for cases where the loop is executed. Doing so duplicates the condition check (increasing the size of the code) but is more efficient because jumps usually cause a pipeline stall. Additionally, if the initial condition is known at compile-time and is known to be side-effect-free, the initial if-guard can be skipped. Loop-invariant code motion – this can vas
https://en.wikipedia.org/wiki/Loop%20interchange	In compiler theory, loop interchange is the process of exchanging the order of two iteration variables used by a nested loop. The variable used in the inner loop switches to the outer loop, and vice versa. It is often done to ensure that the elements of a multi-dimensional array are accessed in the order in which they are present in memory, improving locality of reference. For example, in the code fragment: for i from 0 to 10 for j from 0 to 20 a[i,j] = i + j loop interchange would result in: for j from 0 to 20 for i from 0 to 10 a[i,j] = i + j On occasion, such a transformation may create opportunities to further optimize, such as automatic vectorization of the array assignments. The utility of loop interchange The major purpose of loop interchange is to take advantage of the CPU cache when accessing array elements. When a processor accesses an array element for the first time, it will retrieve an entire block of data from memory to cache. That block is likely to have many more consecutive elements after the first one, so on the next array element access, it will be brought directly from cache (which is faster than getting it from slow main memory). Cache misses occur if the contiguously accessed array elements within the loop come from a different cache block, and loop interchange can help prevent this. The effectiveness of loop interchange depends on and must be considered in light of the cache model used by the underlying hardware and the array model used by the compiler. In C programming language, array elements in the same row are stored consecutively in memory (a[1,1], a[1,2], a[1,3]) ‒ in row-major order. On the other hand, FORTRAN programs store array elements from the same column together (a[1,1], a[2,1], a[3,1]), using column-major. Thus the order of two iteration variables in the first example is suitable for a C program while the second example is better for FORTRAN. Optimizing compilers can detect the improper ordering by programmers and interchange the order to achieve better cache performance. Caveat Loop interchange may lead to worse performance because cache performance is only part of the story. Take the following example: do i = 1, 10000 do j = 1, 1000 a[i] = a[i] + b[j,i] * c[i] end do end do Loop interchange on this example can improve the cache performance of accessing b(j,i), but it will ruin the reuse of a(i) and c(i) in the inner loop, as it introduces two extra loads (for a(i) and for c(i)) and one extra store (for a(i)) during each iteration. As a result, the overall performance may be degraded after loop interchange. Safety It is not always safe to exchange the iteration variables due to dependencies between statements for the order in which they must execute. To determine whether a compiler can safely interchange loops, dependence analysis is required. See also Loop splitting Loop skewing Loop fission and fusion Loop unrolling References Further reading Compiler o
https://en.wikipedia.org/wiki/Rosevelt%20Colvin	Rosevelt Colvin, III (born September 5, 1977) is a former American football linebacker, who formerly worked as a football analyst for the Big Ten Network. Drafted by the Chicago Bears in the fourth round of the 1999 NFL Draft, he played college football at Purdue. Colvin played for the Chicago Bears between 1999 and 2002. Colvin has earned two Super Bowl rings with the New England Patriots and has also been a member of the Houston Texans. Early years Colvin attended Broad Ripple High School in Indianapolis. He earned Second Team All-State honors as a junior, and recorded a school-record 219 tackles as a senior. In that final season at Broad Ripple, Colvin earned honors as an All-Marion County Player, the Indianapolis News Defensive Player of the Year, an All-Metro Player, and was a First Team All-State selection. He also played basketball in high school. While at Purdue, Colvin was selected to the All-Big Ten teams in 1997 and 1998. The Boilermakers went 18-7 in his final two seasons in West Lafayette. Professional career Chicago Bears Colvin was drafted by the Chicago Bears in the fourth round of the 1999 NFL Draft. He became the first Bear to post double-digit sacks in consecutive years, 2001–2002, since Richard Dent. Colvin was named to the Bears' All-Decade Defense team along with fellow linebackers Brian Urlacher and Lance Briggs. First stint with Patriots After playing for the Bears, Colvin was signed by the New England Patriots in 2003. Early in his first season with New England, Colvin suffered a shattered socket in his left hip. It took Colvin a year to recover, while the Patriots won back-to-back Super Bowls. Colvin did not start again until 2005, and in 2006, he was a full-time starter at outside linebacker for the Patriots. He was placed on injured reserve by the Patriots on November 27, 2007. On February 26, 2008, the Patriots released Colvin after he failed a physical with the team. He had one year left on his contract with a $5.5 million base salary. Houston Texans On June 16, 2008, Colvin signed with the Houston Texans. On August 29, 2008, the Texans released Colvin during final roster cuts. Second stint with Patriots Colvin was re-signed by the New England Patriots on December 3, 2008 after cornerback Jason Webster was placed on injured reserve. Personal life As a teenager, he worked at a concession stand in the RCA Dome in Indianapolis. Colvin and his wife Tiffany reside in Indianapolis. Colvin owns five UPS stores in the area, as well as a cupcake shop called "SweeTies Gourmet Treats" that has two Indy based locations. They also run youth NFL FLAG leagues and the Indy Nets Basketball Club, www.r59.com. He and his wife have four children, Xavier, Nijah, Raven, and Myles. His daughter, Raven, plays volleyball for Purdue university. His son, Myles, a rising HS senior, is a four-star basketball recruit committed to Matt Painter's Purdue team. The family attends New Horizons Church in Indianapolis, pastored by Eric Wi
https://en.wikipedia.org/wiki/KDAF	KDAF (channel 33) is a television station licensed to Dallas, Texas, United States, serving as the Dallas–Fort Worth metroplex's outlet for The CW. It is owned and operated by network majority owner Nexstar Media Group (based in nearby Irving), although it is not considered the company's flagship station. KDAF's studios are located off the John W. Carpenter Freeway (State Highway 183) in northwest Dallas, and its transmitter is located in Cedar Hill, Texas. KDAF launched in 1980 as KNBN-TV, which aired several types of specialty programs, including business news, subscription television, and Spanish-language programming. Metromedia acquired the station in 1984, converted it to an English-language independent station as KRLD-TV, and made the first of several efforts at local news. When Metromedia's television stations were purchased in 1986, KRLD-TV became KDAF and the Dallas–Fort Worth outlet of Fox; this continued until 1995, when a major realignment of affiliations saw Fox partner with another station and sell off channel 33. Tribune Broadcasting owned the station from 1996 to 2019; during this time, it was one of the most successful affiliates of The WB in the late 1990s and resumed local news production, which continued in some form for nearly two decades. Prior history of channel 33 in Dallas Channel 33 was allocated to Dallas in 1966 as part of a settlement between two applicants that had been competing for channel 29: Maxwell Electronics Corporation and Overmyer Communications. In order to give each applicant a channel, Overmyer suggested moving channel 27 from Tyler to Dallas and substituting 33 for 29, with Overmyer taking 27 and Maxwell taking 33. While the Overmyer application ultimately was dropped, Maxwell's channel 33 went ahead, launching as independent station KMEC-TV on October 1, 1967. It was one of three new UHF independent stations in the Metroplex in six months (KFWT-TV channel 21 had signed on September 19 and KDTV channel 39 would debut in February 1968), and it was the first to fold. On October 25, 1968, Maxwell announced it was taking KMEC-TV dark and selling the station to Evans Broadcasting Company. Evans did not restore KMEC-TV to operational status. Instead, it sold the construction permit in 1971 to Berean Fellowship International, which returned channel 33 to air as KBFI-TV on February 21, 1972. Berean, a locally based Christian ministry, operated the station as a family-oriented, general-entertainment independent with weekend religious programming. KBFI-TV lasted 10 months, closing on Christmas Eve. The Portsmouth, Virginia-based Christian Broadcasting Network (CBN) purchased the license and returned channel 33 to the air on April 16, 1973, as KXTX-TV. It was CBN's third operating television station, after WYAH-TV in Portsmouth, and WANX-TV in Atlanta. As did CBN's other independent stations (and KBFI-TV), it maintained a general entertainment and religious format. However, just two months later, Doubleday Bro
https://en.wikipedia.org/wiki/Dependence%20analysis	In compiler theory, dependence analysis produces execution-order constraints between statements/instructions. Broadly speaking, a statement S2 depends on S1 if S1 must be executed before S2. Broadly, there are two classes of dependencies--control dependencies and data dependencies. Dependence analysis determines whether it is safe to reorder or parallelize statements. Control dependencies Control dependency is a situation in which a program instruction executes if the previous instruction evaluates in a way that allows its execution. A statement S2 is control dependent on S1 (written ) if and only if S2s execution is conditionally guarded by S1. S2 is control dependent on S1 if and only if where is the post dominance frontier of statement . The following is an example of such a control dependence: S1 if x > 2 goto L1 S2 y := 3 S3 L1: z := y + 1 Here, S2 only runs if the predicate in S1 is false. See data dependencies for more details. Data dependencies A data dependence arises from two statements which access or modify the same resource. Flow(True) dependence A statement S2 is flow dependent on S1 (written ) if and only if S1 modifies a resource that S2 reads and S1 precedes S2 in execution. The following is an example of a flow dependence (RAW: Read After Write): S1 x := 10 S2 y := x + c Antidependence A statement S2 is antidependent on S1 (written ) if and only if S2 modifies a resource that S1 reads and S1 precedes S2 in execution. The following is an example of an antidependence (WAR: Write After Read): S1 x := y + c S2 y := 10 Here, S2 sets the value of y but S1 reads a prior value of y. Output dependence A statement S2 is output dependent on S1 (written ) if and only if S1 and S2 modify the same resource and S1 precedes S2 in execution. The following is an example of an output dependence (WAW: Write After Write): S1 x := 10 S2 x := 20 Here, S2 and S1 both set the variable x. Input dependence A statement S2 is input dependent''' on S1 (written ) if and only if S1 and S2 read the same resource and S1 precedes S2 in execution. The following is an example of an input dependence (RAR: Read-After-Read): S1 y := x + 3 S2 z := x + 5 Here, S2 and S1'' both access the variable x. This dependence does not prohibit reordering. Loop dependencies The problem of computing dependencies within loops, which is a significant and nontrivial problem, is tackled by loop dependence analysis, which extends the dependence framework given here. See also Program analysis (computer science) Automatic parallelization Automatic vectorization Loop dependence analysis Frameworks supporting the polyhedral model Hazard (computer architecture) Program slicing Dead code elimination Further reading Static program analysis
https://en.wikipedia.org/wiki/Pacific%20General	Pacific General is a computer wargame depicting famous battles of the World War II Pacific campaigns. It was published by Strategic Simulations in 1997 using the same game engine of the earlier and successful Panzer General for Windows 95. It was re-released on GOG.com in May 2015. Gameplay Pacific General (also known as "PacGen") is played on a hex map with icons representing aircraft, warships, tanks, and groups of soldiers. The turn-based style allows each player to strategize their next move. Combat involves various factors, like critical hits, surprise, and terrain. Particular attention is spent on naval warfare, where ships can sustain critical hits to ship systems and submarines can submerge to launch stealth attacks. The weather and time of day are also important factors to consider: darkness can obscure troop movements and rain can prevent airstrikes. Troops can sustain suppression from enemy fire, inhibiting their offensive and defensive abilities, and they can also entrench themselves, enhancing their defensive strength. Players win by amassing victory points that are gained by occupying specific objective hexes. The side with the most victory points is declared the winner. Like role-playing games, the player can upgrade or add units to his core force, with the unit's experience carrying on to the next battle. He also must be aware of each unit's fuel and ammunition levels, and also the fog of war, the collective vision of all units under his control. Prestige is the currency of the game. Prestige is gained by destroying enemy units and lost when a player buys or upgrades his units. Prestige is also available at the start of a new scenario before any combat begins. Whereas the first Panzer General targeted DOS, Pacific General was made for Windows. Pacific General utilize interface and share an underlying file system that differs from the original Panzer General. Fans created a version of Pacific General, based on its own DOS version, that borrows interface features from the original Panzer General. Called Pacific Panzer General (PacPG), it includes all scenarios and campaigns from the original, as well as bugfixes. The player can choose between the Allied and Axis sides in both real and hypothetical scenarios, like the Battle of Midway and Operation Downfall. Thirty-one countries are represented, including the United States, Japan, Germany, the United Kingdom, Australia, and the Soviet Union but only United States and Japan have campaign modes. Each nation has historical weapons available. There are several types of unit categories: tanks, infantry, artillery, fighter aircraft, bombers, aircraft carriers, battleships, forts, etc. Infantry and towed weapons may have attached trucks or half-track transports and land units can be moved around the map on cargo ships or cargo planes. Most nations have several units in each category, and many are unique to each nation; the Japanese have kamikazes at their disposal. Each unit has spe
https://en.wikipedia.org/wiki/Loop%20dependence%20analysis	In computer science, loop dependence analysis is a process which can be used to find dependencies within iterations of a loop with the goal of determining different relationships between statements. These dependent relationships are tied to the order in which different statements access memory locations. Using the analysis of these relationships, execution of the loop can be organized to allow multiple processors to work on different portions of the loop in parallel. This is known as parallel processing. In general, loops can consume a lot of processing time when executed as serial code. Through parallel processing, it is possible to reduce the total execution time of a program through sharing the processing load among multiple processors. The process of organizing statements to allow multiple processors to work on different portions of a loop is often referred to as parallelization. In order to see how we can exploit parallelization, we have to first analyze the dependencies within individual loops. These dependencies will help determine which statements in the loop need to be completed before other statements can start, and which statements in the loop can be executed in parallel with respect to the other statements in the loop. Two general categories of dependencies that will be analyzed in the loop are data dependencies and control dependencies. Description Loop dependence analysis occur on a normalized loop of the form: for i1 until U1 do for i2 until U2 do ... for in until Un do body done ... done done where body may contain: S1 a[f1(i1, ..., in), ..., fm(i1, ..., in)] := ... ... S2 ... := a[h1(i1, ..., in), ..., hm(i1, ..., in)] Where a is an m-dimensional array and fn, hn, etc. are functions mapping from all iteration indexes (in) to a memory access in a particular dimension of the array. For example, in C: for (i = 0; i < U1; i++) for (j = 0; j < U2; j++) a[i+4-j] = b[2i-j] + ij; f1 would be i+4-j, controlling the write on the first dimension of a and h2 would be 2*i-j, controlling the read on the first dimension of b. The scope of the problem is to find all possible dependencies between S1 and S2. To be conservative, any dependence which cannot be proven false must be assumed to be true. Independence is shown by demonstrating that no two instances of S1 and S2 access or modify the same spot in array a. When a possible dependence is found, loop dependence analysis usually makes every attempt to characterize the relationship between dependent instances, as some optimizations may still be possible. It may also be possible to transform the loop to remove or modify the dependence. In the course of proving or disproving such dependencies, a statement S may be decomposed according to which iteration it comes from. For instance, S[1,3,5] refers to the iteration where i1 = 1, i2 = 3 and i3 = 5. Of course, references to abstract iterations, such as S[d1+1,d2,d3], are both permi
https://en.wikipedia.org/wiki/CAL%20%28programming%20language%29	CAL, short for Conversational Algebraic Language, was a programming language and system designed and developed by Butler Lampson at Berkeley in 1967 for the SDS 940 mainframe computer. CAL is a version of the seminal JOSS language with several cleanups and new features to take advantage of the SDS platform. The Berkeley SDS was used for the development of the Tymshare commercial time-sharing platform and an improved version of CAL was offered as a programming environment to its customers in 1969. Although CAL saw "almost no use", it had a lasting impact by influencing the design of Tymshare SUPER BASIC which copied a number of its features. Some of those features, in turn, appeared in BASIC-PLUS on the PDP-11, which is the direct ancestor of Microsoft BASIC. Description Basic concepts JOSS had been designed to be used by non-programmers in the US Air Force and within Rand Corporation, and to aid with that, Rand designed to custom computer terminals that were easier to set up and use. These terminals, based on the IBM Selectric typewriter, also included a custom character set that implemented common mathematical symbols like and . To a large degree, CAL was a version of JOSS that replaced these sorts of customizations with more common solutions like and so they could run on common terminals. The other noticeable differences were that CAL was all upper-case, as opposed to sentence casing in JOSS, and it did not require a period at the end of the line. The commands were otherwise almost identical and the overall structure and syntax were the same. As with JOSS, CAL had an interactive user interface that allowed the user to type in statements in "direct mode" or programs to be run in "indirect mode". In BASIC, the former is more commonly referred to as "immediate mode". Both CAL and JOSS used a two-part line number, known as the part and step, separated by a period, for instance, for part 1 step 100. Parts were generally used to group related statements into subroutines. In CAL, the part number could be between 0 and 999999, and the step from 0 to 99999. There were two main versions of CAL, released in 1967 and 1969. The following description will be based primarily on the former version unless otherwise noted. Jumps and subroutines As in JOSS, CAL supported the command to branch to a provided part or step, as in or , and for subroutine calls, as in to perform the entire part, or to run that single step and then return. The later syntax was useful when there were many small subroutines as they could be implemented on a single line without an associated or similar concept. Conditional branching and assignment One of the more notable syntactic features of JOSS was the concept of "statement modifiers" which controlled the operation of other statements. JOSS used this for conditional branching. In most languages, one would write something to the effect of "If this expression is true, then do this...". In JOSS, this order was reversed,
https://en.wikipedia.org/wiki/KABB	KABB (channel 29) is a television station in San Antonio, Texas, United States, affiliated with the Fox network. It is owned by Sinclair Broadcast Group alongside dual NBC/CW affiliate WOAI-TV (channel 4); Sinclair also provides certain services to Kerrville-licensed Dabl affiliate KMYS (channel 35) under joint sales and shared services agreements (JSA/SSA) with Deerfield Media. The three stations share studios between Babcock Road and Sovereign Drive (off Loop 410) in northwest San Antonio, while KABB's transmitter is located in northwest Wilson County (near Elmendorf). History KABB first signed on the air on December 16, 1987, as the first independent station in the San Antonio market since KRRT (channel 35, now Dabl affiliate KMYS)—which by that point, was the market's original Fox affiliate—debuted in November 1985. Channel 29 was originally owned by the Alamo Broadcasting Corporation, from which its call letters were taken. Alamo Broadcasting sold the station to River City Broadcasting in 1989. In 1994, Paramount Pictures, then-owners of KRRT through its Paramount Stations Group subsidiary, entered into a partnership with Chris-Craft Industries—which owned NBC affiliate KMOL-TV (channel 4, now WOAI-TV) at the time—to create the United Paramount Network (UPN), with KRRT serving as the network's San Antonio affiliate. River City subsequently signed an affiliation agreement with Fox for KABB to become the network's new area affiliate; on January 16, 1995, KRRT dropped Fox programming to become the market's original affiliate of UPN, with KABB assuming the Fox affiliation, thus ending the latter's status as the longest serving independent television outlet in San Antonio after over seven years. Shortly afterward, KRRT entered into a local marketing agreement (LMA) with KABB after Paramount sold channel 35 to Jet Broadcasting. In 1996, the Sinclair Broadcast Group acquired River City Broadcasting's television stations. The following year, Glencairn, Ltd. (which evolved into Cunningham Broadcasting) bought KRRT; the family of Sinclair Broadcast Group founder Julian Sinclair Smith owned 97% of Glencairn's stock (Glencairn was, in turn, to be paid with Sinclair stock for the purchases), effectively making KABB and KRRT a duopoly in violation of Federal Communications Commission (FCC) rules of the period. Glencairn had owned eleven television stations nationwide that Sinclair operated under LMAs; a later plan to sell five of its stations to Sinclair outright prompted the Rainbow/PUSH coalition (headed by Jesse Jackson) to file challenges, citing concerns over a single company holding two broadcast licenses in one market and arguing that Glencairn passed itself off as a minority-owned company (its president, former Sinclair executive Edwin Edwards, is African American) when it was really an arm of Sinclair, and used the LMA to gain control of the station. The FCC levied a $40,000 fine against Sinclair in 2001 for illegally controlling Glencairn. S
https://en.wikipedia.org/wiki/KMYS	KMYS (channel 35) is a television station licensed to Kerrville, Texas, United States, serving the San Antonio area as an affiliate of the digital multicast network Dabl. It is owned by Deerfield Media, which maintains joint sales and shared services agreements (JSA/SSA) with Sinclair Broadcast Group, owner of dual NBC/CW affiliate WOAI-TV (channel 4) and Fox affiliate KABB (channel 29), for the provision of certain services. The stations share studios between Babcock Road and Sovereign Drive (off Loop 410) in northwest San Antonio, while KMYS's transmitter is located in rural southeastern Bandera County (near Lakehills). Channel 35 began broadcasting in November 1985 as KRRT, the first independent station serving San Antonio and the first new commercial TV station in the San Antonio market in 28 years. It was owned in part, and eventually entirely, by TVX Broadcast Group, a Virginia-based group of independent stations. KRRT served as San Antonio's first affiliate of Fox when the network launched in 1986. TVX was acquired by Paramount Pictures in two stages between 1989 and 1991. The Paramount Stations Group sold KRRT in 1994 to Jet Broadcasting of Erie, Pennsylvania. Jet then contracted with River City Broadcasting, owner of KABB, to run the station. The Fox affiliation moved to KABB, which was starting a news department; KRRT then became a UPN affiliate, and it also inherited San Antonio Spurs telecasts from KABB. After River City merged into Sinclair in 1996, KABB and other Sinclair-owned UPN stations switched to The WB in a major group deal that took effect in January 1998. KRRT became KMYS, an affiliate of MyNetworkTV, in 2006; it then became the CW affiliate in 2010, replacing KCWX. In September 2021, the programming that had been airing on KMYS became the "CW 35" subchannel of WOAI-TV; KMYS itself began exclusively airing diginets ahead of conversion to ATSC 3.0. History Early years In December 1980, Hubbard Broadcasting petitioned the Federal Communications Commission (FCC) to add channel 35 to its table of allotments at Kerrville. The commission made the assignment effective January 1982, and three applications were received from Commanche Broadcasting; Hispanic American Broadcasting; and Tierra del Sol Broadcasting Corporation, owner of the recently built KVEO-TV in Brownsville. The commission selected Hispanic American Broadcasting—whose primary owner was communications attorney Raul Robert Tapia—over Commanche Broadcasting, a decision affirmed by the FCC's review board in 1984. Tapia changed the name of his company to Republic Communications Corporation, for the Republic of Texas, and began building the station as KRRT (for his initials). He sold 49 percent to TVX Broadcast Group, a Virginia-based chain of independent stations, with TVX holding an option to acquire another 31 percent. The station went on the air from studios in San Antonio—located along Loop 410, near Ingram Park Mall, on the northwest side of the city—and a tow
https://en.wikipedia.org/wiki/Super-seeding	In file sharing, super-seeding is an algorithm developed by John Hoffman for the BitTorrent communications protocol that helps downloaders become uploaders more quickly, but it introduces the danger of total seeding failure if there is only one downloader. The algorithm applies when there is only one seed in the swarm. By permitting each downloader to download only specific parts of the files listed in a torrent, it allows peers to start seeding more quickly. Peers attached to a seed with super-seeding enabled therefore distribute pieces of the torrent file much more readily before they have completed the download themselves. In 2003, BitTornado became the first BitTorrent client to implement the algorithm. Effects Testing by one group found that super seeding can help save an upload ratio of around 20%. It works best when the upload speed of the seed is greater than that of individual peers. Super seeding transfers stall when there is only one downloading client. The seeders will not send more data until a second client receives the data. To avoid this, rTorrent continues to offer more pieces to the peers without waiting for confirmation, until it is uploading at its configured capacity. Supporting clients References External links Description of original super-seed algorithm in BitTornado Report by Robb Toploski (Issue #4 & 5 are regarding Super Seeding) BitTorrent de:BitTorrent#Superseeding
https://en.wikipedia.org/wiki/ProTERM	ProTERM is a terminal emulator and modem program for the Apple II and Macintosh lines of personal computers, published by Intrec Software. Most popular in the late 1980s and 1990s, it was most commonly used for calling bulletin board systems (BBSes) via a computer's modem, experienced users could also Telnet into Unix server and shell account thereon and FTP and tunneling to various destinations therefrom, and once logged into a Unix shell account, other forms of telecom all across the pre-Web Internet; via VT100 terminal emulator or ANSI art, this later ushered in Graphics to the scene. The macro Language automated a lot of this process and the ProTERM user could code macros to log in and perform Unix functions in Bash or Bourne shell making this a very powerful terminal emulator, capable of manipulating mainframes and "hacking" into the heart of the internet at low and high levels. ProTERM was rich in features such as an extensive "scrollback" buffer limited only by the computer's memory, an optional mouse-based interface in the Apple II version (standard on the Mac), an easy-to-use and very powerful text editor, auto learning macros, and a variety of terminal emulations such as VT100, ANSI and the powerful but proprietary "ProTERM Special Emulation" (also referred to as: PSE or PTSE) which used Apple's semi graphical MouseText character set. Supported file transfer protocols ranged from Kermit and Xmodem to Ymodem (Batch, 4K and G) and Zmodem (Batch Selections). One feature of ProTERM Mac was the C-like scripting or macro language embedded inside ProTERM, allowing users to code and run ProTERM automatically. ProTERM could also be programmed to log in and execute command-line interface commands on the host machine, effectively controlling it remotely. The latest published versions of ProTERM were v3.1 for the Apple II and v1.5 for the Macintosh. On January 3, 2009, the most recent Apple II version, 3.1, was relicensed as freeware and is now available for download . References Apple II software Classic Mac OS software Terminal emulators Freeware
https://en.wikipedia.org/wiki/Dash%207	Dash 7 may refer to: DASH7, a wireless sensor and actuator network protocol De Havilland Canada Dash 7, aircraft manufactured by De Havilland Canada GE Dash 7 Series, railway locomotive manufactured by GE Transportation Systems Dash 7, a song directly referencing the aircraft, by the American alt-country band Wilco, on the album A.M. (1995)
https://en.wikipedia.org/wiki/Titan%20%281963%20computer%29	Titan was the prototype of the Atlas 2 computer developed by Ferranti and the University of Cambridge Mathematical Laboratory in Cambridge, England. It was designed starting in 1963, and in operation from 1964 to 1973. History In 1961, the University of Cambridge found itself unable to fund a suitably powerful computer for its needs at the time, so the university purchased from Ferranti the main Atlas processing units and then jointly designed the memory and peripheral equipment. The joint effort led to a cheaper and simpler version of the Atlas that Ferranti could market, leaving Cambridge with the prototype version, named Titan. The Atlas hardware arrived in Cambridge in 1963, although software design was already underway. David Wheeler was in charge of the joint effort between the university and Ferranti. In 1965 the Cambridge side of the team decided to add a time-sharing facility for Titan, necessitating the acquisition of additional hardware. When Titan came into full service in 1966, time sharing was available for all staff. Titan was finally switched off in October 1973. Ferranti, by then a division of International Computers and Tabulators (ICT), marketed the Titan as the Atlas 2. Although intended to be more affordable than the Atlas, its price was still over £1 million. A second Atlas 2 was built in Manchester, and was installed at the Computer-Aided Design Centre (CADCentre) on Madingley Road together with the Cambridge Titan supervisor. This machine, the last Atlas, was finally switched off on 21 December 1976. A third Atlas 2 was ordered by the UK's Atomic Weapons Research Establishment (AWRE) at Aldermaston. It replaced the faster and much more expensive IBM 7030 Stretch which had been leased from IBM. Hardware Titan differed from the original Manchester Atlas by having a real, but cached, main memory, rather than the paged (or virtual) memory used in the Manchester machine. It initially had 28K of memory, but this was expanded first to 64K and later to 128K. The Titan's main memory had 128K of 48-bit words and was implemented using ferrite core store rather than the part core, part rotating drum-store used on the Manchester Atlas. Titan also had two large hard-disk drives and several magnetic tape decks. As with the Manchester Atlas, it used discrete components, in particular germanium transistors. Some of these components can be seen in the online relics collection of the University of Cambridge Computer Laboratory. Uses Titan was the computer on which a team from Ferranti based in Bracknell working with David Barron, David Hartley, Roger Needham and Barry Landy of Cambridge University Maths Lab developed the early multi-user time-sharing operating system called Titan Supervisor. This was arguably the world's first commercially sold time-sharing operating system. Other experiments in time-sharing, such as CTSS and PLATO in the US, were one-of-a-kind research projects. One of Titan's most intensive uses was to compute the
https://en.wikipedia.org/wiki/QID	QID is an acronym and may refer to: in die (q.i.d.), a medical abbreviation meaning "four times each day" Queen's Indian Defense, a chess opening Q-identifier, used in Wikidata
https://en.wikipedia.org/wiki/Record-oriented%20filesystem	In computer science, a record-oriented filesystem is a file system where data is stored as collections of records. This is in contrast to a byte-oriented filesystem, where the data is treated as an unformatted stream of bytes. There are several different possible record formats; the details vary depending on the particular system. In general the formats can be fixed-length or variable length, with different physical organizations or padding mechanisms; metadata may be associated with the file records to define the record length, or the data may be part of the record. Different access methods for records may be provided, for example records may be retrieved in sequential order, by key, or by record number. Origin and characteristics Record-oriented filesystems are frequently associated with mainframe operating systems, such as OS/360 and successors and DOS/360 and successors, and midrange operating systems, such as RSX-11 and VMS. However, they originated earlier in software such as Input/Output Control System (IOCS). Records, sometimes called logical records, are often written together in blocks, sometimes called physical records; this is the norm for direct access and tape devices, but files on unit record devices are normally unblocked, i.e., there is only one record per block. Record-oriented filesystems can be supported on media other than direct access devices. A deck of punched cards can be considered a record-oriented file. A magnetic tape is an example of a medium that can support records of uniform length or variable length. In a record file system, a programmer designs the records that may be used in a file. All application programs accessing the file, whether adding, reading, or updating records share an understanding of the design of the records. In DOS/360, OS/360, and their successors there is no restriction on the bit patterns composing the data record, i.e. there is no delimiter character; this is not always true in other software, e.g., certain record types for RCA File Control Processor (FCP) on the 301, 501, 601 and 3301. The file comes into existence when a file create request is issued to the filesystem. Some information about the file may be included with the create request. This information may specify that the file has fixed-length records (all records are the same size) along with the size of the records. Alternatively, the specification may state that the records are of variable length, along with the maximum record length. Additional information including blocking factor, binary vs. text and the maximum number of records may be specified. It may be permitted to read only the beginning of a record; the next sequential read returns the next collection of data (record) that the writer intended to be grouped together. It may also be permitted to write only the beginning of a record. In these cases, the record is padded with binary zeros or with spaces, depending on whether the file is recognized as a binary file o
https://en.wikipedia.org/wiki/EUREF%20Permanent%20Network	EUREF Permanent Network (EPS) is a European network of more than 300 continuously operating GNSS reference stations with precisely known coordinates referenced to the ETRS89. EPS is the key instrument in the maintenance of ETRS89 geodetic datum. The EPN stations collect continuously the observation data from high accuracy multi-GNSS receivers. The data is processed in the centralized way in a few data processing centres. EPS is created and maintained by a voluntary agreement of about 100 European agencies and universities. EPS activities are coordinated by EUREF. Structure The EPS consists of the following components: Tracking Stations include GNSS tracking receivers and antennae on suitable geodetic markers. Operational Centres perform data validation, conversion of raw data to the RINEX format, data compression, and upload to Local Data Centres. Local Data Centres store the data of Tracking Stations and disseminate them via the Internet. Local Analysis Centres process a subnetwork of EPS stations and deliver weekly subnetwork solutions to Combination Centres. Combination Centres combine subnetwork solutions into one official EPS solution, which is weekly sent to the IGS for the integration in the global GNSS network solution. Central Bureau manages day-to-day the activities of EPS. It is located at the Royal Observatory of Belgium in Brussels. Data and products EPS data are raw multi-GNSS pseudorange and phase observations, broadcast ephemerides, and supporting types of raw data (such as meteorological) as they are gathered by the Tracking Stations. The EPS data is available in daily, hourly, 15-min RINEX-formatted files, and for many stations as a real-time data stream via NTRIP. EPS products include best-known coordinates of the Tracking Stations in both ETRS89 and ITRS geodetic datums; time series of the coordinates of the Tracking Stations; tropospheric zenith path delays at all the Tracking Stations. References External links EPN home page EPN flyer (quick reference card) ETRS89 and ITRS Reference coordinates of EPN stations Time series of the coordinates of the EPN stations List of all the analysis centres EPN data and products at BKG historical EPN data at ROB BKG NTRIP broadcaster of real-time EPN data ROB NTRIP broadcaster of real-time EPN data Geodesy organizations Satellite navigation Information technology organizations based in Europe
https://en.wikipedia.org/wiki/KBS	KBS may refer to: Places KBS Tuff, Kenyan archaeological site Kellogg Biological Station Kent Business School, University of Kent, UK Radio and television Kansas Broadcasting System, network of KWCH, Wichita, Kansas, US Korean Broadcasting System, South Korea Kyoto Broadcasting System, once Kinki Broadcasting System Transportation Kempegowda Bus Station Kankakee, Beaverville and Southern Railroad Kursbuchstrecke (timetabled routes), KBS codes given to scheduled railway routes in Germany Technology kB/s, kilobytes per second Knowledge-based systems, an application of artificial intelligence to solve reasoning problems Other uses Kansas Bankers Surety Company Founders Brewing Kentucky Breakfast Stout King Baudouin Foundation (Dutch: Koning Boudewijnstichting) See also KB (disambiguation) for the singular of KBs KBS 1 (disambiguation) KBS 2 (disambiguation) KBS 3 (disambiguation)
https://en.wikipedia.org/wiki/Logie%20Awards%20of%202003	The 45th Annual TV Week Logie Awards was held on Sunday 11 May 2003 at the Crown Palladium in Melbourne, and broadcast on the Nine Network. The ceremony was hosted by Eddie McGuire, and guests included Simon Baker and Dennis Haysbert. Winners and nominees In the tables below, winners are listed first and highlighted in bold. Gold Logie Acting/Presenting Most Popular Programs Most Outstanding Programs Performers Steve Irwin Delta Goodrem Bec Cartwright Sophie Monk Dannii Minogue Hall of Fame After several years on Australian television, Don Lane became the 20th inductee into the TV Week Logies Hall of Fame. References External links 2003 2003 television awards 2003 in Australian television 2003 awards in Australia
https://en.wikipedia.org/wiki/Virtual%20Theatre	The Virtual Theatre is a computer game engine designed by Revolution Software to produce adventure games for computer platforms. The engine allowed their team to script events, and move animated sprites against a drawn background with moving elements using a point-and-click style interface. Upon its first release, it rivaled competing engines like LucasArts' SCUMM and Sierra's Creative Interpreter, due to its then high level of artificial intelligence. The engine was first proposed in 1989, while the first game to use it, Lure of the Temptress, was released in 1992, followed by Beneath a Steel Sky (1994), Broken Sword: The Shadow of the Templars (1996) and Broken Sword II: The Smoking Mirror (1997). It allowed in-game characters to wander around the gameworld independently of each other, performing "everyday life" actions, which was not previously possible, and all characters and objects occupied space; consequently, non-player characters had to side-step the player's protagonist and any other object they came across, as well as the player having to side-step them, achieving a more realistic game world that previous engines were unable to provide, though non-player characters could unwittingly block a path as the player was traversing the game scene. Non-player characters performed much simpler tasks with each release due to size constraints. Two games (Broken Sword: The Shadow of the Templars and Broken Sword II: The Smoking Mirror) that use a Virtual Theatre variant engine can now be played on modern hardware using ScummVM, which as a result allows the engine to run on platforms where the titles were not officially released. In 2012, it was confirmed that the engine would be revived as "Virtual Theatre 7" for the fifth Broken Sword titled Broken Sword: The Serpent's Curse (2013). Development Charles Cecil and Tony Warriner had worked together at Artic Computing, an English video game development company. In 1990 they decided to set up their own video-game development company, together with David Sykes and Noirin Carmody. For their debut adventure game, Lure of the Temptress, released in 1992 for Amiga, Atari ST and PC, Cecil, Warriner, Sykes and Dan Marchant created the concept of the game engine titled "Virtual Theatre", which Warriner wrote. For Beneath a Steel Sky, released in 1994 for Amiga, and PC, Revolution used an updated version of Virtual Theatre, Virtual Theatre 2.0, written by Warriner and Sykes. However, because the game was six times the size of Lure of the Temptress, non-player characters had to perform much simpler tasks than in its predecessor. Broken Sword: The Shadow of the Templars, released in 1996 for PC, Mac and PlayStation, and its sequel, Broken Sword II: The Smoking Mirror, released in 1997 for PC and PlayStation, also used modified versions of the Virtual Theatre engine. The engine subsequently underwent various updates. For Broken Sword: The Serpent's Curse a brand-new engine (VT7) was developed in order to deal
https://en.wikipedia.org/wiki/Video%20game%20bot	In video games, a bot is a type of artificial intelligence (AI)–based expert system software that plays a video game in the place of a human. Bots are used in a variety of video game genres for a variety of tasks: a bot written for a first-person shooter (FPS) works very differently from one written for a massively multiplayer online role-playing game (MMORPG). The former may include analysis of the map and even basic strategy; the latter may be used to automate a repetitive and tedious task like farming. Bots written for first-person shooters usually try to mimic how a human would play a game. Computer-controlled bots may play against other bots and/or human players in unison, either over the Internet, on a LAN or in a local session. Features and intelligence of bots may vary greatly, especially with community created content. Advanced bots feature machine learning for dynamic learning of patterns of the opponent as well as dynamic learning of previously unknown maps – whereas more trivial bots may rely completely on lists of waypoints created for each map by the developer, limiting the bot to play only maps with said waypoints. Using bots is generally against the rules of current massively multiplayer online role-playing games (MMORPGs), but a significant number of players still use MMORPG bots for games like RuneScape. MUD players may run bots to automate laborious tasks, which can sometimes make up the bulk of the gameplay. While a prohibited practice in most MUDs, there is an incentive for the player to save time while the bot accumulates resources, such as experience, for the player character bot. Types Bots may be static, dynamic, or both. Static bots are designed to follow pre-made waypoints for each level or map. These bots need a unique waypoint file for each map. For example, Quake III Arena bots use an area awareness system file to move around the map, while Counter-Strike bots use a waypoint file. Dynamic bots learn the levels and maps as they play, such as RealBot for Counter-Strike. Some bots are designed using both static and dynamic features. See also Artificial intelligence in video games General game playing Non-player character References Internet bots Video game gameplay Video game development Cheating in video games
https://en.wikipedia.org/wiki/Computer%20rage	Computer rage refers to negative psychological responses towards a computer due to heightened anger or frustration. Examples of computer rage include cursing or yelling at a computer, slamming or throwing a keyboard or a mouse, and assaulting the computer or monitor with an object or weapon. Notable cases In April 2015, a Colorado man was cited for firing a gun within a residential area when he took his computer into a back alley and shot it eight times with a 9mm pistol. When questioned, he told police that he had become so frustrated with his computer that he had "reached critical mass," and stated that after he had shot his computer, "the angels sung on high." In 2007, a German man threw his computer out the window in the middle of the night, startling his neighbors. German police were sympathetic and did not press charges, stating, "Who hasn't felt like doing that?" In 2006, the staged surveillance video "Bad Day", showing a man assaulting his computer at work, became a viral hit on the Internet, reaching over two million views. Other instances of reported computer rage have ranged from a restaurant owner who threw his laptop into a deep fryer, to an individual who attempted to throw his computer out the window, but forgot that the window was closed. The Angry German Kid is a popular Internet meme that stems from a viral video from the mid-2000s where the protagonist screams at his computer for loading too slowly, and repeatedly hits the table with the keyboard, causing keys to fall off. Prevalence In 1999, it was speculated that computer rage had become more common than road rage in traffic, but in a 2015 study, it was found that reported rates of anger when using a computer were lower than reported rates of anger while driving. However, reports of anger while driving or using computers were found to be far more common than anger in other situations. In a 2013 survey of American adults, 36% of respondents who reported experiencing computer issues, also reported that they had screamed, yelled, cursed, or physically assaulted their computers within the last six months. In 2009, a survey was conducted with British computer users about their experiences with computers. This survey found that 54% of respondents reported verbally abusing their computers, and 40% reported that they had become physically violent toward their computers. The survey also found that most users experienced computer rage three to four times a month. Differences in types of computer rage have also been found between different geographical regions. For example, one survey found that individuals from London have been found to be five times more likely to physically assault their computers, while those from Yorkshire and the Humber were found to be more likely to yell at their computers. Differences have also been observed for age groups, as younger adults (18–24 years old) have reported more abusive behaviors in the face of computer frustration when compared to older
https://en.wikipedia.org/wiki/CPN	CPN may refer to: Calpine Corporation, New York Stock Exchange symbol CPN Canadian Perinatal Network Carnivorous Plant Newsletter Carpinteria (Amtrak station), California, Amtrak station code CPN Caspian Airlines (Iran), ICAO airline designator CPN Celiac plexus neurolysis, in medicine, the chemical ablation of the celiac plexus Central Park North (disambiguation) Central Pattana, Stock Exchange of Thailand symbol CPN Chlamydia pneumoniae, generally Cpn or CpN Citizen Potawatomi Nation, a federally recognized tribe of Potawatomi people located in Oklahoma Clapham North tube station, London, London Underground station code CPN Coloured Petri net Communist Party of Nepal Communist Party of the Netherlands Community psychiatric nurse Complex projective space, Confederation of the Polish Nobility Country and Progressive National Party, early 20th-century political party in Queensland, Australia Lysine carboxypeptidase, an enzyme Community Protection Notice in the United Kingdom
https://en.wikipedia.org/wiki/Genetic%20fuzzy%20systems	In computer science and operations research, Genetic fuzzy systems are fuzzy systems constructed by using genetic algorithms or genetic programming, which mimic the process of natural evolution, to identify its structure and parameter. When it comes to automatically identifying and building a fuzzy system, given the high degree of nonlinearity of the output, traditional linear optimization tools have several limitations. Therefore, in the framework of soft computing, genetic algorithms (GAs) and genetic programming (GP) methods have been used successfully to identify structure and parameters of fuzzy systems. Fuzzy systems Fuzzy systems are fundamental methodologies to represent and process linguistic information, with mechanisms to deal with uncertainty and imprecision. For instance, the task of modeling a driver parking a car involves greater difficulty in writing down a concise mathematical model as the description becomes more detailed. However, the level of difficulty is not so much using simple linguistic rules, which are themselves fuzzy. With such remarkable attributes, fuzzy systems have been widely and successfully applied to control, classification and modeling problems (Mamdani, 1974) (Klir and Yuan, 1995) (Pedrycz and Gomide, 1998). Although simplistic in its design, the identification of a fuzzy system is a rather complex task that comprises the identification of (a) the input and output variables, (b) the rule base (knowledge base), (c) the membership functions and (d) the mapping parameters. Usually the rule base consists of several IF-THEN rules, linking input(s) and output(s). A simple rule of a fuzzy controller could be: IF (TEMPERATURE = HOT) THEN (COOLING = HIGH) The numerical impact/meaning of this rule depends on how the membership functions of HOT and HIGH are shaped and defined. The construction and identification of a fuzzy system can be divided into (a) the structure and (b) the parameter identification of a fuzzy system. The structure of a fuzzy system is expressed by the input and output variables and the rule base, while the parameters of a fuzzy system are the rule parameters (defining the membership functions, the aggregation operator and the implication function) and the mapping parameters related to the mapping of a crisp set to a fuzzy set, and vice versa. (Bastian, 2000). Much work has been done to develop or adapt methodologies that are capable of automatically identifying a fuzzy system from numerical data. Particularly in the framework of soft computing, significant methodologies have been proposed with the objective of building fuzzy systems by means of genetic algorithms (GAs) or genetic programming (GP). Genetic algorithms for fuzzy system identification Given the high degree of nonlinearity of the output of a fuzzy system, traditional linear optimization tools do have their limitations. Genetic algorithms have demonstrated to be a robust and very powerful tool to perform tasks such as the ge
https://en.wikipedia.org/wiki/United%20Devices	United Devices, Inc. was a privately held, commercial volunteer computing company that focused on the use of grid computing to manage high-performance computing systems and enterprise cluster management. Its products and services allowed users to "allocate workloads to computers and devices throughout enterprises, aggregating computing power that would normally go unused." It operated under the name Univa UD for a time, after merging with Univa on September 17, 2007. History Founded in 1999 in Austin, Texas, United Devices began with volunteer computing expertise from distributed.net and SETI@home, although only a few of the original technical staff from those organizations remained through the years. In April 2001, grid.org was formally announced as a philanthropic non-profit website to demonstrate the benefits of Internet-based large scale grid computing. Later in 2002 with help from UD, NTT Data launched a similar Internet-based Cell Computing project targeting Japanese users. In 2004, IBM and United Devices worked together to start the World Community Grid project as another demonstration of Internet-based grid computing. In August 2005, United Devices acquired the Paris-based GridXpert company and added Synergy to its product lineup. In 2006, the company acknowledged seeing an industry shift from only using grid computing for compute-intensive applications towards data center automation and business application optimization. Partly in response to the market shifts and reorganization, grid.org was shut down on April 27, 2007, after completing its mission to "demonstrate the viability and benefits of large-scale Internet-based grid computing". On September 17, 2007, the company announced that it would merge with the Lisle, Illinois-based Univa and operate under the new name Univa UD. The combined company would offer open source solutions based around Globus Toolkit, while continuing to sell its existing grid products and support its existing customers. On June 26, 2008, United Devices client software on World Community Grid finished its role and completely relayed to BOINC's. Commercial products Grid MP — a job scheduler and application provisioning platform. It is offered in various editions, depending on the scalability needs of the customer. The company publishes a list of high-profile organizations using Grid MP on the United Devices website. MP Insight — allows customers to perform data analysis to determine if their grid computing resources are being effectively used. MP Synergy — a metascheduler based on Globus Toolkit technology that allows users to perform efficient scheduling within an organization that has multiple job schedulers already deployed and controlling independent clusters. Supported schedulers include Grid MP, Sun Grid Engine, Platform LSF, PBS, LoadLeveler, and Condor. Reliance — designed specifically for the datacenter to provide automated infrastructure management and to ensure application servic
https://en.wikipedia.org/wiki/Bully%20algorithm	In distributed computing, the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes. The process with the highest process ID number from amongst the non-failed processes is selected as the coordinator. Assumptions The algorithm assumes that: the system is synchronous. processes may fail at any time, including during execution of the algorithm. a process fails by stopping and returns from failure by restarting. there is a failure detector which detects failed processes. message delivery between processes is reliable. each process knows its own process id and address, and that of every other process. Algorithm The algorithm uses the following message types: Election Message: Sent to announce election. Answer (Alive) Message: Responds to the Election message. Coordinator (Victory) Message: Sent by winner of the election to announce victory. When a process recovers from failure, or the failure detector indicates that the current coordinator has failed, performs the following actions: If has the highest process ID, it sends a Victory message to all other processes and becomes the new Coordinator. Otherwise, broadcasts an Election message to all other processes with higher process IDs than itself. If receives no Answer after sending an Election message, then it broadcasts a Victory message to all other processes and becomes the Coordinator. If receives an Answer from a process with a higher ID, it sends no further messages for this election and waits for a Victory message. (If there is no Victory message after a period of time, it restarts the process at the beginning.) If receives an Election message from another process with a lower ID it sends an Answer message back and if it has not already started an election, it starts the election process at the beginning, by sending an Election message to higher-numbered processes. If receives a Coordinator message, it treats the sender as the coordinator. Analysis Safety The safety property expected of leader election protocols is that every non-faulty process either elects a process , or elects none at all. Note that all processes that elect a leader must decide on the same process as the leader. The Bully algorithm satisfies this property (under the system model specified), and at no point in time is it possible for two processes in the group to have a conflicting view of who the leader is, except during an election. This is true because if it weren't, there are two processes and such that both sent the Coordinator (victory) message to the group. This means and must also have sent each other victory messages. But this cannot happen, since before sending the victory message, Election messages would have been exchanged between the two, and the process with a lower process ID among the two would never send out victory messages. We have a contradiction, and hence our initial assumption that there are two lea
https://en.wikipedia.org/wiki/List%20of%20Ohio%20locations%20by%20per%20capita%20income	Ohio is the twenty-second-wealthiest state in the United States of America, with a per capita income of $21,003 (2000). Ohio counties ranked by per capita income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. See also Economy of Ohio References Ohio Economy of Ohio Income
https://en.wikipedia.org/wiki/List%20of%20South%20Carolina%20locations%20by%20per%20capita%20income	South Carolina is the thirty-seventh-richest state in the United States of America, with a per capita income of $18,795 (2000). South Carolina Counties Ranked by Per Capita Income Note: Data is from the 2010 United States Census Data and the 2006–2010 American Community Survey 5-Year Estimates. South Carolina Places Ranked by Per Capita Income References United States locations by per capita income Economy of South Carolina Income
https://en.wikipedia.org/wiki/List%20of%20Tennessee%20locations%20by%20per%20capita%20income	Tennessee is the thirty-fifth-richest state in the United States of America, with a per capita income of $28,764 (2017). Tennessee counties ranked by per capita income Note: Data is from the 2010 United States Census Data and the 2006–2010 American Community Survey 5-Year Estimates. References Tennessee Locations by income Locations by income Income
https://en.wikipedia.org/wiki/List%20of%20Texas%20locations%20by%20per%20capita%20income	Texas is ranked twenty-fifth among US states by median household income, with a per capita income of $19,617 (2000). Texas counties ranked by per capita income Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates. See also Highest-income counties in the United States Lowest-income counties in the United States References External links The Boom Areas of America - (CNN 2007) United States locations by per capita income Economy of Texas Income
https://en.wikipedia.org/wiki/List%20of%20West%20Virginia%20locations%20by%20per%20capita%20income	West Virginia is the third poorest state in the United States of America, with a per capita income of $23,450 (2015). West Virginia counties ranked by per capita income Note: County Data is from the 2011–2015 American Community Survey 5-Year Estimates. References United States locations by per capita income Economy of West Virginia Income Income

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.