source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Provable%20prime
|
In number theory, a provable prime is an integer that has been calculated to be prime using a primality-proving algorithm. Boot-strapping techniques using Pocklington primality test are the most common ways to generate provable primes for cryptography.
Contrast with probable prime, which is likely (but not certain) to be prime, based on the output of a probabilistic primality test.
In principle, every prime number can be proved to be prime in polynomial time by using the AKS primality test. Other methods which guarantee that their result is prime, but which do not work for all primes, are useful for the random generation of provable primes.
Provable primes have also been generated on embedded devices.
See also
Probable prime
Primality test
References
Primality tests
Prime numbers
|
https://en.wikipedia.org/wiki/List%20of%20history%20journals
|
This list of history journals presents representative notable academic journals pertaining to the field of history and historiography. It includes scholarly journals listed by journal databases and professional associations such as: JSTOR, Project MUSE, the Organization of American Historians, the American Historical Association, Goedeken (2000), or are published by national or regional historical societies, or by major scholarly publishers (such as Cambridge University Press, Oxford University Press, the University of Chicago Press and Taylor & Francis). It does not include many of the world's 5000 journals devoted to local history or highly specialized topics. This list is a compilation and not one based on an exhaustive examination and judgment of quality.
General history
The American Historical Review
Annales. Histoire, Sciences sociales
Canadian Journal of History/Annales canadiennes d'histoire
The English Historical Review
The Historian
The Historical Journal
Historische Zeitschrift
History
History Compass
History Today
History Workshop Journal
Journal of Interdisciplinary History
Past & Present
Radical History Review
Revue historique
Rivista Storica Italiana
Studies in People's History
By period
Classical
Antiguo Oriente
Bryn Mawr Classical Review
Historia: Zeitschrift für Alte Geschichte – Revue d'Histoire Ancienne – Journal of Ancient History – Rivista di Storia Antica
The Journal of Hellenic Studies
Modern and contemporary
Eighteenth-Century Studies
The Historical Journal
Journal of Contemporary History
The Journal of Modern History
Comparative and world
Comparative Studies in Society and History
Journal of World History
By region
Africa
African Archaeological Review
African Economic History
African Historical Review
Afrique & Histoire
History in Africa
International Journal of African Historical Studies
The Journal of African History
Journal of Modern African Studies
Journal of Southern African Studies
Rhodesiana
South African Historical Journal
Zaïre. Revue Congolaise—Congoleesch Tijdschrift
Egypt
Journal of the American Research Center in Egypt
Studien zur Altägyptischen Kultur
Asia
Asian Survey
Central Asian Survey
Iranian Studies
Journal of American-East Asian Relations
Journal of the American Oriental Society
The Journal of Asian Studies
Journal of the Royal Asiatic Society
Modern Asian Studies
East Asia
Bulletin of the National Museum of Japanese History
Central Asian Survey
Chinese Historical Review
Early and Medieval Chinese History
Journal of Japanese Studies
Korean Studies
Late Imperial China
Monumenta Nipponica
Social Science Japan Journal
T'oung Pao: International Journal of Chinese Studies
South Asia
Indian Economic and Social History Review
Indian Historical Review
Southeast Asia
Brunei Museum Journal
Journal of the Malaysian Branch of the Royal Asiatic Society
Journal of Southeast Asian Studies
SOAS Bulletin of Burma Research
Journal of the Sia
|
https://en.wikipedia.org/wiki/Roman%20Danylo
|
Roman Danylo (born in Calgary, Alberta) is a Canadian comedian, improviser and actor based out of Vancouver, British Columbia. He is best known for his starring role in the CTV Television Network show Comedy Inc.
Career
As a teen, Danylo ran a weekly sketch review show as a student at Sir Winston Churchill High School in Calgary.
Roman then went on to study with Keith Johnstone at the Loose Moose Theatre in Calgary (Loose Moose is where Theatresports originated and is often credited as being one of the founding institutions of humorous improvisational theatre). He also worked in several local comedy clubs with friends Oldring, Albert Howell and Graeme Davies and performed with Theatre Calgary. He participated in various CBC Radio dramas as well.
He has performed at the HBO Comedy Festival in Aspen, Colorado and Montreal's Just for Laughs Festival and also starred in the UPN series Off Limits with Aisha Tyler. Danylo has been featured on NBC's Late Friday, Jeremiah, The Outer Limits and Sliders.
However, Roman is best known in Canada and has appeared in several Canadian series, including CBC's Comics, These Arms of Mine, Made in Canada with Rick Mercer, the Just For Laughs Improv Championships, Slightly Bent on The Comedy Network and Corner Gas on CTV with Brent Butt.
In 2002, Danylo joined fellow comedians Jessica Holmes and Kurt Smeaton as a writer and cast member on The Holmes Show. Following the show's cancellation, he was offered a starring role in Comedy Inc. while he was in Los Angeles during pilot season.
Some of his recurring characters include "Vlad, the Russian Romantic", "Tantric Sex Master" and "Ken Shawn of WFTO-TV News" (usually paired with Nikki Payne as WFTO's long-suffering weathergirl).
Co-stars on Comedy Inc. include Aurora Browne, Jen Goodhue, Terry McGurrin, Winston Spear, Jenn Robertson, Gavin Stephens, Ian Sirota and Albert Howell. The series recently won the Gold Medal Award for "Best TV Variety Program" at the New York Festivals for the second year in a row and was picked up by the U.S. cable network Spike TV in April 2005. Comedy Inc. was also nominated for a 2006 Canadian Comedy Award for best writing in a television series.
In 2012 he hosted a gag-comedy show called the Funny Pit with Ryan Steele and Amy Goodmurphy, which was produced by Thunderbird Films.
For his performance in CBC's Western Alienation Comedy Hour, Roman won a Leo Award in 2004 for excellence in British Columbia film and television. That same year, he was nominated for a Gemini for his work on Comedy Inc..
Danylo also performs with the Canadian improv troupe Urban Improv in Vancouver.
Selected filmography
References
External links
Official web site
Roman Danylo on ComedyNightLife.com
Comedy Inc. on The Comedy Network
Canoe JAM - Article about Roman Danylo.
Year of birth missing (living people)
Living people
Canadian male comedians
Canadian television personalities
Canadian male television actors
Canadian people of Ukrainian
|
https://en.wikipedia.org/wiki/Blue%20Night%20Network
|
The Blue Night Network is the overnight public transit service operated by the Toronto Transit Commission (TTC) in Toronto, Ontario, Canada. The network consists of a basic grid of 27 bus and 4 streetcar routes, distributed so that almost all of the city is within 2 km of at least one route. It is the largest and most frequent overnight network in North America.
Overview
Hours
The times of Blue Night service vary according to individual scheduling situations on each route. Most regular service bus and streetcar routes cease operations at approximately 1:30 a.m. If there is a Blue Night route on the same street, its first trip will then follow at a suitable interval after the last regular run.
On the subway system, the last trains on each line make a complete trip; the last trains running east, west, and north from Bloor–Yonge and St. George stations each leave at 1:50 a.m. or just after. Each station then closes as the last train departs.
In the morning, regular bus and streetcar service mostly takes over from the corresponding Blue Night routes around 5:30a.m, or 8:00a.m. on Sundays. The first trains on the subway then start from various positions along the routes, allowing all stations to open more or less simultaneously just before 6:00a.m., or 8:00a.m. on Sundays. The Blue Night routes that parallel the subway lines keep running until that time, and their last buses terminate service at a subway station to facilitate transfers to the trains.
Fares
Normal TTC fares apply on the Blue Night Network. Passengers can transfer to or from regular-service routes as usual. Additionally, the TTC's Presto day ticket is valid until 2:59a.m. on the day following the ticket's first use, rather than expiring at midnight.
Routes
Blue Night routes operate with frequencies of every 30 minutes or better. Blue Night routes are distinguished from regular routes by numbers in the 300 series. Numbering on these routes can correspond to a day route, such as 301 Queen being Blue Night for 501 Queen. Routings are often combinations of multiple-day routes or slight alterations to their corresponding day route.
Most routes are operated by TTC's fleet of low-floor buses, where applicable, making them fully accessible for handicapped and wheelchair users. Four routes operate with streetcars: the 301 Queen, the 304 King, the 306 Carlton, and the 310 Spadina. As of January 2020, all of these routes are operated with accessible Flexity Outlook streetcars.
History
Before the Blue Night Network
Toronto has had overnight streetcar service since the days of the Toronto Railway Company in the 1890s, and the TTC continued it when they took over in 1921. The routes selected for 24-hour service were those serving 24-hour employers such as factories, stockyards, and railway yards.
Over the years various streetcar routes were replaced by other modes, and where new subway lines replaced streetcars during regular hours, buses were put on overnight. But the overnight routings
|
https://en.wikipedia.org/wiki/Virtual%20tape%20library
|
A virtual tape library (VTL) is a data storage virtualization technology used typically for backup and recovery purposes. A VTL presents a storage component (usually hard disk storage) as tape libraries or tape drives for use with existing backup software.
Virtualizing the disk storage as tape allows integration of VTLs with existing backup software and existing backup and recovery processes and policies. The benefits of such virtualization include storage consolidation and faster data restore processes. For most mainframe data centers, the storage capacity varies, however protecting its business and mission critical data is always vital.
Most current VTL solutions use SAS or SATA disk arrays as the primary storage component due to their relatively low cost. The use of array enclosures increases the scalability of the solution by allowing the addition of more disk drives and enclosures to increase the storage capacity.
The shift to VTL also eliminates streaming problems that often impair efficiency in tape drives as disk technology does not rely on streaming and can write effectively regardless of data transfer speeds.
By backing up data to disks instead of tapes, VTL often increases performance of both backup and recovery operations. Restore processes are found to be faster than backup regardless of implementations. In some cases, the data stored on the VTL's disk array is exported to other media, such as physical tapes, for disaster recovery purposes (scheme called disk-to-disk-to-tape, or D2D2T).
Alternatively, most contemporary backup software products introduced also direct usage of the file system storage (especially network-attached storage, accessed through NFS and CIFS protocols over IP networks) not requiring a tape library emulation at all. They also often offer a disk staging feature: moving the data from disk to a physical tape for a long-term storage.
While a virtual tape library is very fast, the disk storage within is not designed to be removable, and does not usually involve physically removable external disk drives to be used for data archiving in place of tape. Since the disk storage is always connected to power and data sources and is never physically electrically isolated, it is vulnerable to potential damage and corruption due to nearby building or power grid lightning strikes.
History
The first VTL solution was introduced by Cybernetics in 1992 under the name HSTC (high speed tape cache). Later, IBM released a Virtual Tape Server (VTS) introduced in 1997. It was targeted for a mainframe market, where many legacy applications tend to use a lot of very short tape volumes. It used the ESCON interface, and acted as a disk cache for the IBM 3494 tape library. A competitive offering from StorageTek (acquired in 2005 by Sun Microsystems, then subsequently by Oracle Corporation) was known as Virtual Storage Manager (VSM) which leveraged the market dominant STK Powderhorn library as a back store. Each product line has bee
|
https://en.wikipedia.org/wiki/Include%20guard
|
In the C and C++ programming languages, an #include guard, sometimes called a macro guard, header guard or file guard, is a particular construct used to avoid the problem of double inclusion when dealing with the include directive.
The C preprocessor processes directives of the form #include <file> in a source file by locating the associated file on disk and transcluding ("including") its contents into a copy of the source file known as the translation unit, replacing the include directive in the process. The files included in this regard are generally header files, which typically contain declarations of functions and classes or structs. If certain C or C++ language constructs are defined twice, the resulting translation unit is invalid. #include guards prevent this erroneous construct from arising by the double inclusion mechanism.
The addition of #include guards to a header file is one way to make that file idempotent. Another construct to combat double inclusion is #pragma once, which is non-standard but nearly universally supported among C and C++ compilers.
Double inclusion
Example
The following C code demonstrates a real problem that can arise if #include guards are missing:
File "grandparent.h"
struct foo {
int member;
};
File "parent.h"
#include "grandparent.h"
File "child.c"
#include "grandparent.h"
#include "parent.h"
Result
struct foo {
int member;
};
struct foo {
int member;
};Here, the file "child.c" has indirectly included two copies of the text in the header file "grandparent.h". This causes a compilation error, since the structure type foo will thus be defined twice. In C++, this would be called a violation of the one definition rule.
Use of #include guards
Example
In this section, the same code is used with the addition of #include guards. The C preprocessor preprocesses the header files, including and further preprocessing them recursively. This will result in a correct source file, as we will see.
File "grandparent.h"
#ifndef GRANDPARENT_H
#define GRANDPARENT_H
struct foo {
int member;
};
#endif /* GRANDPARENT_H */
File "parent.h"
#include "grandparent.h"
File "child.c"
#include "grandparent.h"
#include "parent.h"
Result
struct foo {
int member;
};Here, the first inclusion of "grandparent.h" has the macro GRANDPARENT_H defined. When "child.c" includes "grandparent.h" at the second time (while including "parent.h"), as the #ifndef test returns false, the preprocessor skips down to the #endif, thus avoiding the second definition of struct foo. The program compiles correctly.
Discussion
Different naming conventions for the guard macro may be used by different programmers. Other common forms of the above example include GRANDPARENT_INCLUDED, CREATORSNAME_YYYYMMDD_HHMMSS (with the appropriate time information substituted), and names generated from a UUID. (However, names starting with one underscore and a capital letter or any name containing double underscore, such as _GRANDPARENT_
|
https://en.wikipedia.org/wiki/CEO%20%28Data%20General%29
|
Comprehensive Electronic Office, often referred to by its initialism CEO, was a suite of office automation software from Data General introduced in 1981. It included word processing, e-mail, spreadsheets, business graphics and desktop accessories. The software was developed mostly in PL/I on and for the AOS and AOS/VS operating systems.
Overview
CEO was considered office automation software, which was an attempt to create a paperless office. CEO has also been cited as an example of an executive information system and as a decision support system.
It included a main program known as the Control Program, which offered a menu driven interface on the assorted dumb terminals which existed at the time. The Control Program communicated with separate "Services" like the Mail Server, Calendar Server, File Server (for documents). There was also a Word Processor and a data management program which was also accessible from the Control Program. In 1985, Data General announced a complementary product, TEO (Technical Electronic Office), focused on the office automation needs of engineering professionals.
In later years, CEO offerings grew to include various products to connect to CEO from early personal computers. The first such product was called CEO Connection. Later a product named CEO Object Office shipped which repackaged HP NewWave (an object oriented graphical interface).
CEO code was heavily dependent on the INFOS II database. When Data General moved from the Eclipse MV platform to the AViiON, CEO was not ported to the new platform as the cost would have been prohibitive.
CEO was often compared with IBM's offering, commonly called PROFS.
CEO offered integration with DISOSS and SNADS. CEO also supported Xodiac, Data General's proprietary networking system. In 1989, Data General unveiled an email gateway product, Communications Server, which provided interoperability of CEO with X.400 email systems and X.500 directories.
One early CEO site, Deutsche Credit in Chicago, first installed CEO while it was under beta in 1980, and by 1986 had 80 users of the product.
Other users included the U.S. Forest Service, who installed CEO in 1983, and whose CEO system fell victim to a hacking attack in December 1984. CEO was also formerly used by Health and Welfare Canada as its departmental email system.
References
Office suites
Data General
Email systems
|
https://en.wikipedia.org/wiki/Troy%20Reeb
|
Troy Reeb (born November 6, 1969) is a Canadian media executive and former journalist who currently serves as executive vice president of broadcast networks for all Corus Entertainment properties, including the Global Television Network. Reeb was born in Toronto, Ontario and raised in Westlock, Alberta.
Career
As the head of broadcast networks, Reeb is responsible for all Corus TV, radio and digital properties, including Global TV and 37 specialty channels including W Network, HGTV Canada, Showcase, Food Network Canada and History Television. Additionally, he oversees all radio content and audio products for Corus. He was promoted in February 2019 from his former role as senior vice president of news, radio and station operations. In this role, his roster spanned the network's flagship newscast Global National, local operations from 15 television stations, 39 Corus Radio stations and a dozen Global News bureaus across Canada - with additional satellite bureaus in Washington and London.
Reeb was promoted to the Global Television Network's top news job in June 2008, after returning to the Toronto head office in September 2006. Previously, he served as an on-air correspondent, most notably as the Global News bureau chief in Washington, D.C. and as a political reporter in the network's Ottawa bureau.
Prior to joining the national news, Reeb was a political reporter and commentator for Global Ontario CIII-TV, where among other responsibilities he hosted Focus Ontario. Previous to that, he worked 10 years in radio, with approximately half that time spent in smaller cities such as Saskatoon and Yellowknife, and the other half covering national and international events for Broadcast News, the radio service of The Canadian Press.
In addition to serving as a backup anchor on Global National, other network programs Reeb hosted for Global included Global Sunday, and the short-lived Ottawa Inside-Out. In his executive role, Reeb in 2008 championed the launch of a new current affairs program on Global entitled "16x9 - The Bigger Picture."
Following Shaw's purchase of Global and other broadcast assets of the former Canwest in 2010, Reeb announced Shaw would be undertaking an aggressive expansion of Global News both on television and online, with the addition of local morning newscasts in six markets across Canada. He later announced the addition of a national morning show, a national political talk show, The West Block and Shaw's first regional all-news channel Global News: BC 1. On April 1, 2016, Shaw received approval to sell its media assets to Corus.
During his tenure as head of news and radio for Corus, Reeb has pioneered Global News' award-winning Multi-Market Content (MMC) broadcast model, led a digital strategy that has built Globalnews.ca into the largest, private-sector online news provider in Canada, oversaw the relaunch of eight Corus news-talk radio stations under the Global News Radio moniker, and successfully reformatted FM stations includ
|
https://en.wikipedia.org/wiki/Michael%20Martin%20Hammer
|
Michael Martin Hammer (April 13, 1948 – Sept 3, 2008) was a Jewish-American engineer, management author, and a former professor of computer science at the Massachusetts Institute of Technology (MIT), known as one of the founders of the management theory of Business process reengineering (BPR).
Biography
Early life and education
Hammer, the child of Holocaust survivors, grew up in Annapolis, Maryland. He earned BS, MS, and Ph.D. degrees in EECS from the Massachusetts Institute of Technology in 1968, 1970, and 1973 respectively.
Career
An engineer by training, Hammer was the proponent of a process-oriented view of business management. He was a professor at the Massachusetts Institute of Technology in the department of Computer Science and a lecturer in the MIT Sloan School of Management. Articles written by Hammer have been published in business periodicals, such as the Harvard Business Review and The Economist.
TIME named him as one of America's 25 most influential individuals, in its first such list. Forbes magazine ranked Hammer's book, Reengineering the Corporation, among the "three most important business books of the past 20 years".
Personal life
He and his wife, Phyllis Thurm Hammer, lived in Newton, Massachusetts with their four children, Jessica, Allison, Dana, and David.
Death
Hammer died suddenly from complications of a brain hemorrhage he suffered while on vacation, and he is buried in the Baker Street Jewish Cemeteries in Boston.
Publications
Reengineering the Corporation: A manifesto for Business Revolution (1993), which Hammer he co-authored with James A. Champy, was instrumental in capturing the focus of business community towards Business Process Reengineering (BPR). 2.5 million copies of the book were sold, and the book remained on the New York Times Best Seller list for more than a year.
The Reengineering Revolution (1995)
Beyond Reengineering (1996)
The Agenda (2001)
Faster, Cheaper, Better (2010), co-authored with Lisa Hershman
See also
Business Process
Business Process Improvement
References
External links
Hammer and Company — Official website of the company run by Michael Hammer
MIT Class of 1968 Tribute to Michael Hammer
1948 births
2008 deaths
American computer scientists
20th-century American engineers
20th-century American economists
MIT School of Engineering alumni
MIT School of Engineering faculty
MIT Sloan School of Management faculty
People from Newton, Massachusetts
|
https://en.wikipedia.org/wiki/Deep%20Core%20%28video%20game%29
|
Deep Core is a futuristic platform game developed by Dynafield Systems for the Amiga. It was published in 1993 by International Computer Entertainment. Captain Dawnrazer has been sent to save an underwater nuclear research base which has been invaded by strange aliens. Dawnrazer must work himself through nine levels (with additional sublevels and bonus levels). The game includes six weapon which can be upgraded via power-ups.
External links
Deep Core at Lemon Amiga
Amiga games
Amiga CD32 games
1993 video games
Platformers
Video games developed in Sweden
|
https://en.wikipedia.org/wiki/KDTV-DT
|
KDTV-DT (channel 14) is a television station licensed to San Francisco, California, United States, serving as the Spanish-language Univision network outlet for the San Francisco Bay Area. It is owned and operated by TelevisaUnivision alongside Vallejo-licensed UniMás outlet KFSF-DT (channel 66). Both stations share studios on Zanker Road near the North San Jose Innovation District in San Jose, while KDTV's transmitter is located on Mount Allison in Fremont.
KDTV-CD (channel 28) in Santa Rosa operates as a Class A translator of KDTV relaying the station's signal into the northern half of the market; this station's transmitter is located atop Mount Saint Helena.
History
The Bahía de San Francisco Television Company, owned by principals of the Spanish International Network including Rene Anselmo and Danny Villanueva, applied on July 20, 1973, for a construction permit to build a new television station on San Francisco's channel 60. The Federal Communications Commission (FCC) granted the application on November 13, 1974. Channel 60 had originally been assigned for noncommercial use in San Francisco, and KQED held a permit for it, but when that station accepted a gift from Metromedia of the facility for channel 32, the noncommercial reservation was switched to channel 32, changing channel 60 to commercial.
From studios on Palou Avenue in San Francisco and the former transmitting facilities of KBHK-TV on San Bruno Mountain, channel 60 made its debut on August 10, 1975. KDTV was the Bay Area's first full-time Spanish station; two other channels broadcast Spanish-language programs, KEMO channel 20 and KGSC channel 36.
KDTV did not remain on channel 60 for long. Desirous of a lower channel number, in early 1977, the station approached the College of San Mateo, which owned KCSM-TV, a small educational station in San Mateo. The trade, which the college approved that March, gave KDTV a lower channel number and KCSM-TV, then with anemic technical facilities, full-power coverage of the Bay Area and $400,000 in equipment. The swap took place on the morning of March 5, 1979.
The station grew in the 1980s with Emilio Nicolas Jr., son of Emilio Nicolas Sr., as general manager. Its relief efforts in the aftermath of the 1985 Mexico City earthquake won the station a Peabody Award and an Emmy nomination for community service, the first one for a Spanish-language TV station in the United States.
In 1997, prompted by the growing Hispanic population in the Bay Area and the need to expand, KDTV moved its studios and offices to the 41st floor of 50 Fremont Center in downtown San Francisco (today known as Salesforce West), a relocation that one Univision executive noted changed San Francisco from the worst facility in the network to its best. The station's current transmitter sites also took shape, with the opening of the then-KDTV-LP in Santa Rosa and the move of the main transmitter to Mount Allison that year. In 2001, Univision further expanded its Santa Rosa pr
|
https://en.wikipedia.org/wiki/Official%20Charts%20Company
|
The Official Charts Company (OCC or Official Charts; previously known as the Chart Information Network, CIN, and the Official UK Charts Company; legally known as the Official UK Charts Company Limited) is a British inter-professional organisation that compiles various official record charts in the United Kingdom, Ireland and France.
In the United Kingdom, its charts include ones for singles, albums and films, with the data compiled from a mixture of downloads, purchases (of physical media) and streaming. The OCC produces its charts by gathering and combining sales data from retailers through market researchers Kantar, and claims to cover 99% of the singles market and 95% of the album market, and aims to collect data from any retailer who sells more than 100 chart items per week.
The OCC is operated jointly by the British Phonographic Industry and the Entertainment Retailers Association (ERA) (formerly the British Association of Record Dealers (BARD)) and is incorporated as a private company limited by shares jointly owned by BPI and ERA. CIN took over as compilers of the official UK charts in 1990, and the company has continued in that role, as the OCC, since 1994. Before then, the charts were produced by a succession of market research companies, beginning with the British Market Research Bureau (BMRB) in 1969 and Gallup in 1983. Before the production of the "official" charts, various less comprehensive charts were produced, most notably by newspaper/magazine New Musical Express (NME) which began its chart in 1952. Some of these older charts (including NMEs earliest singles charts) are now part of the official OCC canon.
European charts
In 2017, the OCC made a five-year deal with the Irish Recorded Music Association (IRMA) to compile the Irish Singles Chart, Irish Albums Chart and other Irish charts on behalf of IRMA.
In December 2020, the OCC announced it was taking over the contract from German company GfK, in compiling the French music charts for Syndicat National de l'Édition Phonographique (SNEP)/National Union of Phonographic Producers (SCPP) with the OCC taking over on 1 January 2021.
Chart synopsis
All of the OCC's charts are published weekly on Friday nights, and cover sales for the preceding week, Friday to Thursday. From 3 August 1969 until 5 July 2015, the chart week ran from Sunday to Saturday. In the United Kingdom, genre-specific charts include Official Dance Singles Chart Top 40, Official Hip Hop and R&B Singles Chart Top 40, Official Rock & Metal Singles Chart Top 40, Official Progressive Albums Chart Top 30 and the Asian Music Chart Top 40. It also produces charts such as the Official Independent Singles Chart Top 50, which tracks the progress of records (singles and albums) released on independent record labels or distributed by independent companies (not WMG/Sony/UMG) regardless of the genre/music released.
The Official Scottish Albums Chart Top 100 appears in listings on the Official Charts Company's site alongside
|
https://en.wikipedia.org/wiki/NatureServe
|
NatureServe, Inc. is a non-profit organization based in Arlington County, Virginia, US, that provides proprietary wildlife conservation-related data, tools, and services to private and government clients, partner organizations, and the public. NatureServe reports being "headquartered in Arlington, Virginia, with regional offices in four U.S. locations and in Canada." In calendar year 2011 they reported having 86 employees, 6 volunteers, and 15 independent officers.
History
The Nature Conservancy reports that in 2000 it spun off its 85-center Natural Heritage Network "into a new independent organization, the Association for Biodiversity Information (later renamed NatureServe)." NatureServe reports that it was established in 1994 as the Association for Biodiversity Information. In 2001 the IRS approved a name change to NatureServe that was requested in 1999, while maintaining the organization's 501(c)(3) tax-exempt status granted in July 1995. NatureServe's website declares that it is a 501(c)(3) non-profit, tax-exempt corporation incorporated in 1999 as a Washington, DC Nonprofit Corporation.
Programs
NatureServe's programs focus on four main areas:
Documenting the conservation status and location of species and ecosystems
Producing analyses to guide conservation planning
Developing software tools to guide conservation planning
Managing natural heritage programs and conservation data centers
NatureServe partners with IUCN Red List, the accepted standard for worldwide imperiled species classification, providing coordination assistance and data from their own assessments to the IUCN's conservation assessments, and working together on ongoing assessments.
NatureServe Explorer is a web-based database provides public access to NatureServe's proprietary information on US and Canadian ecosystems and plant, animal, and fungus species. This includes ranked NatureServe conservation status assessment data on state, national, and global levels, considered a leading classification of imperiled species in the United States. Infonatura was a nearly identical service providing information on Latin American wildlife and ecosystems.
NatureServe maintains the National Vegetation Classification Standard for the United States as well as the International Classification of Ecological Communities, currently focused on the Western Hemisphere.
The NatureServe network
The natural heritage network now supported by NatureServe, began in 1974 with the creation of the South Carolina Heritage Trust. After working with Patrick Noonan, president of The Nature Conservancy (TNC), to arrange the donation of the Santee Coastal Reserve, Joseph Hudson, chairman of South Carolina’s Wildlife and Marine Resources Department, wanted to identify other preservation-worthy lands in the state. He provided TNC with initial funding to amass information that could inform conservation and land-use decision-making while accounting for impacts on biodiversity.
While establishing that f
|
https://en.wikipedia.org/wiki/C%20%28disambiguation%29
|
C is the third letter in the Latin alphabet.
C or c may also refer to:
Computing
C (programming language), developed at Bell Labs in 1972
C, a hexadecimal digit
C, a computable function, the set of all computable decision problems
C:, or "Drive C", the default drive letter assignment for the default hard drive in DOS and Windows
Measurement
°C, Celsius temperature scale
Carat (purity)
centi-, an SI prefix
Coulomb, the SI derived unit for electric charge
Cup (unit), a unit of volume
Science
Troponin C, one of the three troponins
Carbon, symbol C, a chemical element
Atomic carbon or C
ATC code C or cardiovascular system, a section of the Anatomical Therapeutic Chemical Classification System
Haplogroup C (mtDNA), a human mitochondrial DNA (mtDNA) haplogroup
Haplogroup C-M130 (Y-DNA), a Y-chromosomal DNA (Y-DNA) haplogroup once called simply C
Cytosine, nucleic acid
C (or Cys), an abbreviation for the amino acid cysteine
C, a prefix for astronomical objects listed in the Caldwell catalogue, ranging from C1 to C109
C, a prefix for astronomical star clusters, which follow the IAU's "Chhmm±ddd" format
c, the speed of light in vacuum
c, the speed of sound
c, the specific heat capacity of a substance
c, any constant
C, capacitance
C, symbol of coulomb
Charm quark ()
C-value, DNA contained within a haploid nucleus
Technology
C battery, a size of battery
Capacitor or C
C battery, a type of battery for vacuum tube radios
C or C-rate, a rate of charge and discharge of a battery
Mathematics
C, a digit meaning twelve in hexadecimal and other positional numeral systems with a radix of 13 or greater
C, the constant of integration
C, in Roman numerals, the symbol for 100
C, ℂ, or , the set of all complex numbers
ℭ or , the cardinality of the continuum
C, the set of continuous functions
The combination or "choose" function
c space, the space of all convergent sequences in functional analysis
Music
C (musical note), and keys based on it:
C major
C minor
C Album, an album by Kinki Kids
C major chord, a chord in popular music
, symbol used to designate common time
, symbol used to designate alla breve
"C", a composition by Francis Poulenc, one of Deux Poèmes de Louis Aragon
Literature
C (novel), a novel by Tom McCarthy
C, a 1924 novel by Maurice Baring
C Magazine, a magazine published by Cardinal Courier Media
"C" Is for Corpse, the third novel in Sue Grafton's "Alphabet mystery" series, published in 1986
C-lehti ('C-magazine'), a defunct Finnish computer magazine
Transportation
NZR C class (1873) train
NZR C class (1930) train
C, or 0-6-0 classification, a type of locomotive with three powered axles
C, the unofficial designation used by the U.S. Navy classification for Protected Cruisers and Peace Cruisers before the 1920 reclassification.
C (Los Angeles Railway)
C (S-train) a service on the S-train network in Copenhagen
C (New York City Subway service)
C Line (Los Angeles Metro)
Line C of the Buen
|
https://en.wikipedia.org/wiki/Puerta%20del%20Sol
|
The Puerta del Sol (, English: "Gate of the Sun") is a public square in Madrid, one of the best known and busiest places in the city. This is the centre (Km 0) of the radial network of Spanish roads. The square also contains the famous clock whose bells mark the traditional eating of the Twelve Grapes and the beginning of a new year. The New Year's celebration has been broadcast live since 31 December 1962 on major radio and television networks including Atresmedia and RTVE.
History
The Puerta del Sol originated as one of the gates in the city wall that surrounded Madrid in the 15th century. Outside the wall, medieval suburbs began to grow around the Christian Wall of the 12th century. The name of the gate came from the rising sun which decorated the entry, since the gate was oriented to the east.
Between the 17th and 19th centuries, the area was an important meeting place: as the goal for the couriers coming from abroad and other parts of Spain to the Post Office, it was visited by those eager for the latest news. The stairs to the Saint Philip church at the square were known as the Gradas de San Felipe, and were among the most prolific mentideros de la Corte (this Spanish idiom sounds as "lie-spreaders of the Court", but it is related with the verb mentar, "to say about someone", not mentir, "to lie", so it is more appropriately translated as "places of the City where people gossip").
The House of the Post Office was built by French architect Jacques Marquet between 1766 and 1768. The building was the headquarters of the Ministry of Interior and State Security in Francoist Spain. It is currently the seat of the Presidency of the Madrid Community.
Sol has seen protests against the March 11th 2004 attacks on commuter trains, and Spain's involvement in the Iraq War . In 2011, the square became established as a focal point and a symbol for the ongoing Spanish democracy demonstrations. The demonstrations included camping in the middle of the plaza (@acampadasol), which began on 15 May 2011 amidst the election campaign for city halls and Autonomous Communities governments and which was fueled by social media, particularly Twitter and Facebook. The demonstrations then spread to more than sixty other cities throughout Spain. Since 12 June 2011, the square has held a free-standing domed structure made from pallets, which served as an information point for the 15-M Movement. This continued throughout the summer of 2011 until the dawn of 2 August, when the national police decided to evict the structure and protestors. Currently, dozens of committees have their assemblies in the iconic square.
Despite once being the meeting point of the six major radial roads of Spain, in 2020 the square was pedestrianized and closed to most traffic. Exceptions are made for supplies to shops, emergency services and blood donation campaigns.
Famous buildings and landmarks
The Puerta del Sol contains a number of well known sights both domestically and internationall
|
https://en.wikipedia.org/wiki/Truncate%20%28SQL%29
|
In SQL, the TRUNCATE TABLE statement is a Data Manipulation Language (DML) operation that deletes all rows of a table without causing a triggered action. The result of this operation quickly removes all data from a table, typically bypassing a number of integrity enforcing mechanisms. It was officially introduced in the SQL:2008 standard, as the optional feature F200, "TRUNCATE TABLE statement".
TRUNCATE TABLE removes all rows from a table, but the table structure and its columns, constraints, indexes, and so on remain. To remove the table definition in addition to its data, use the DROP TABLE statement.
The TRUNCATE TABLE mytable statement is logically (though not physically) equivalent to the DELETE FROM mytable statement (without a WHERE clause). The following characteristics distinguish TRUNCATE TABLE from DELETE:
In the Oracle Database, TRUNCATE is implicitly preceded and followed by a commit operation. (This may also be the case in MySQL, when using a transactional storage engine.)
Typically, TRUNCATE TABLE quickly deletes all records in a table by deallocating the data pages used by the table. This reduces the resource overhead of logging the deletions, as well as the number of locks acquired. Records removed this way cannot be restored in a rollback operation. Two notable exceptions to this rule are the implementations found in PostgreSQL and Microsoft SQL Server, both of which allow TRUNCATE TABLE statements to be committed or rolled back transactionally.
It is not possible to specify a WHERE clause in a TRUNCATE TABLE statement.
TRUNCATE TABLE cannot be used when a foreign key references the table to be truncated, since TRUNCATE TABLE statements do not fire triggers. This could result in inconsistent data because ON DELETE/ON UPDATE triggers would not fire.
In some computer systems, TRUNCATE TABLE resets the count of an Identity column back to the identity's seed.
In Microsoft SQL Server 2000 and beyond in full recovery mode, every change to the database is logged, so TRUNCATE TABLE statements can be used for tables involved in log shipping.
References
SQL keywords
|
https://en.wikipedia.org/wiki/Overhead%20%28computing%29
|
In computer science, overhead is any combination of excess or indirect computation time, memory, bandwidth, or other resources that are required to perform a specific task. It is a special case of engineering overhead. Overhead can be a deciding factor in software design, with regard to structure, error correction, and feature inclusion. Examples of computing overhead may be found in Object Oriented Programming (OOP), functional programming, data transfer, and data structures.
Software design
Choice of implementation
A programmer/software engineer may have a choice of several algorithms, encodings, data types or data structures, each of which have known characteristics. When choosing among them, their respective overhead should also be considered.
Tradeoffs
In software engineering, overhead can influence the decision whether or not to include features in new products, or indeed whether to fix bugs. A feature that has a high overhead may not be included – or needs a big financial incentive to do so. Often, even though software providers are well aware of bugs in their products, the payoff of fixing them is not worth the reward, because of the overhead.
For example, an implicit data structure or succinct data structure may provide low space overhead, but at the cost of slow performance (space/time tradeoff).
Run-time complexity of software
Algorithmic complexity is generally specified using Big O notation. This makes no comment on how long something takes to run or how much memory it uses, but how its increase depends on the size of the input. Overhead is deliberately not part of this calculation, since it varies from one machine to another, whereas the fundamental running time of an algorithm does not.
This should be contrasted with algorithmic efficiency, which takes into account all kinds of resources – a combination (though not a trivial one) of complexity and overhead.
Examples
Computer programming (run-time and computational overhead)
Invoking a function introduces a small run-time overhead. Sometimes the compiler can minimize this overhead by inlining some of these function calls.
CPU caches
In a CPU cache, the "cache size" (or capacity) refers to how much data a cache stores. For instance, a "4 KB cache" is a cache that holds 4 KB of data. The "4 KB" in this example excludes overhead bits such as frame, address, and tag information.
Communications (data transfer overhead)
Reliably sending a payload of data over a communications network requires sending more than just payload itself. It also involves sending various control and signalling data (TCP) required to reach the destination. This creates a so-called protocol overhead as the additional data does not contribute to the intrinsic meaning of the message.
In telephony, number dialing and call set-up time are overheads. In two-way (but half-duplex) radios, the use of "over" and other signaling needed to avoid collisions is an overhead.
Protocol overhead can be expressed as a
|
https://en.wikipedia.org/wiki/WSNN-LD
|
WSNN-LD (channel 39) is a low-power television station in Sarasota, Florida, United States, affiliated with MyNetworkTV. Owned by Nexstar Media Group as sister to NBC affiliate WFLA-TV (channel 8) and CW owned-and-operated station WTTA (channel 38), the station's Suncoast News Network (SNN) service provides news coverage focusing primarily on the North Port–Bradenton–Sarasota Metropolitan Statistical Area (including Sarasota, Manatee, and Charlotte counties). SNN operates in conjunction with the Sarasota Herald-Tribune, and is headquartered in downtown Sarasota. The station's transmitter is located on Fruitville Road east of the city.
History
The SNN operation was launched on July 17, 1995, exclusively on Comcast. Over its history, it was branded as SNN Local News, SNN Local News 6, SNN News 6 and Six News Now, which were often used interchangeably. SNN received national attention in 2007, when a clip of chief meteorologist Justin Mosely (who worked with the channel from 2004 to 2013 and returned in March 2014) reacting frightened after a cockroach crawled up his leg during a live weather segment went viral after it was posted on various video websites including YouTube.
In November 2008, the Sarasota Herald-Tribune (then owned by The New York Times Company) announced that it would sell SNN News 6, and stop broadcasting at the end of December 2008. This deadline was extended after the company struck agreements with a group of investors, led by SNN general manager Linda DesMaris and her husband Doug Barker, to purchase the channel; however on January 25, 2009, one of the investors dropped out of the deal. On January 29, 2009, the Herald-Tribune announced that SNN News 6 would go dark, effective at midnight on January 29, 2009. The company would later find another investor in Phil Lombardo, CEO of the television station group Citadel Communications in Bronxville, New York. On February 26, 2009, after a four-week hiatus, SNN was back on the air under the management of LDB Media, LLC, with the majority of its former on-air staff. Since its inception, the channel was exclusively carried on Comcast's systems in Sarasota and Charlotte counties. In the summer of 2012, SNN struck a carriage deal with Verizon FiOS to add the channel; FiOS began carrying SNN in the Sarasota area at 2:00 a.m. Eastern Time on September 13, 2012. Over time, other cable systems were added, expanding coverage around the Sarasota–Manatee area.
In January 2014, Lombardo and Citadel Communications acquired a majority interest in the company. As a result, Citadel took over broadcast operations of SNN. During February 2014, the SNN studio facilities underwent a major remodeling. One month earlier on February 12, SNN debuted a new graphics package. weather graphics were rolled out on February 22. On March 2, the channel debuted a new logo (an "SNN" wordmark with a blue wave underneath) and rebranded as SNN - Suncoast News Network. The following day on March 3 at 5:00 p.m. Eastern,
|
https://en.wikipedia.org/wiki/SPARCstation%2010
|
The SPARCstation 10 (codenamed Campus-2) is a workstation computer made by Sun Microsystems. Announced in May 1992, it was Sun's first desktop multiprocessor (being housed in a pizza box form factor case). It was later replaced with the SPARCstation 20.
The 40 MHz SPARCstation 10 without external cache was the reference for the SPEC CPU95 benchmark.
Specifications
CPU support
The SPARCstation 10 (SS10) contains two MBus slots running at either 36 MHz (33 MHz for the earliest models) or 40 MHz (set via motherboard jumper). Each MBus slot can contain single or dual SPARC CPU modules, permitting expansion to up to four CPUs. Both SuperSPARC and hyperSPARC CPU modules were available. Single SuperSPARC modules without external cache were sold by Sun; they ran at the clock speed of the MBus (uniprocessor Models 20, 30 and 40; dual processor Model 402). Single and a few dual SuperSPARC modules with 1 MB external cache were also sold; they were independently clocked, and ran at a higher rate than the MBus, most commonly 40.3 MHz or 50 MHz (uniprocessor Models 41 and 51; multiprocessor Models 412, 512 and 514). Sun's dual 50 MHz SuperSPARC modules (the only dual MBus modules supported by Sun for this system) were double-width, physically occupying one SBus slot per module in addition to an MBus slot. SuperSPARC modules with and without external cache could not be mixed. SuperSPARC modules with external cache could be mixed, even with different clock speeds, but this was not a Sun-supported configuration.
Ross hyperSPARC modules were also available from third party vendors. The SS10 had reasonable cooling capacity given the cramped "pizzabox" case, but it was not designed for some of the higher-speed hyperSPARC modules, and so heat issues were common when these modules were used, particularly in four CPU configurations.
Memory
The SS10 can hold a maximum of 512 MB RAM in eight 200-pin DSIMM slots. 32 MB modules are not supported, though 16 MB and 64 MB are supported.
Disk drives
The SS10's enclosure can hold two 50-pin SCSI hard drives and a floppy disk drive. Other SCSI devices can be attached via the external SCSI port. There is no ATA disk support.
Network support
There is one onboard Ethernet interface, which can be accessed from a built-in 10BASE-T jack or via a special 26-pin port that provides both AUI and audio connections; only one of these network ports can be active at a time. A special cable or adapter is needed to convert the latter port to a standard DA-15 connector.
There are also two Basic Rate Interface (BRI) ISDN connectors; the system shipped with plastic blocking plugs inserted in these connectors.
Additional SBus network cards can also be added.
Graphics support
Most SPARCstation 10 systems lack integrated graphics. A very few, referred to as the SPARCstation 10SX, include the SX, or CG14, framebuffer used on the SPARCstation 20, requiring a 4 MB or 8 MB VSIMM to operate. All SPARCstation 10s seem to have the VSIMM slo
|
https://en.wikipedia.org/wiki/UNIGIS
|
UNIGIS is a worldwide network of universities cooperating since 1992 in the design, development and delivery of distance learning in Geographical Information Science and Systems (GIS). Members of the UNIGIS network offer Postgraduate Certificate, Diploma and Masters courses in GIS by open and distance learning, following the mission of Educating GIS Professionals Worldwide.
Members of the UNIGIS network also work together in research and curriculum development activities related to GIS education. Programmes and courses are under continuous development and are currently being offered in English, German, Hungarian, Portuguese, Spanish and Polish languages. UNIGIS each year enrolls more than 600 new students worldwide.
UNIGIS courses
UNIGIS courses are modular and flexible study programmes. The content varies to meet local student needs. Optional courses give the opportunity to tailor the programme to meet individual student needs, and residential workshops are offered to support areas of the courses. Topics covered in the UNIGIS courses include:
Spatial Data
Database Theory
Geodata Sources
GIS and Organisations
Spatial Thinking
Visualisation of Spatial Data
Project Management
Applications Development
Remote Sensing
GIS and Modelling
Environmental Impact Analysis
Students use digital and printed study materials including specially developed study notes, guided readings, and practical exercises. Professional GIS software to support practical work is provided at no cost to students. Students are encouraged to use their work experience in the course, and to apply their new knowledge from their study to their work situations.
Partner institutions
UNIGIS International Association
UNIGIS Amsterdam at the Vrije Universiteit Amsterdam
UNIGIS Central Asia at ACA*GIScience
UNIGIS Girona at the University of Girona
UNIGIS Hungary at the Óbuda University (Alba Regia Technical Faculty, Institute of Geoinformatics)
UNIGIS India
UNIGIS Kathmandu, jointly provided by the University of Salzburg and Kathmandu Forestry College
UNIGIS Latin America at Universidad San Francisco de Quito and the University of Belgrano
UNIGIS Lisbon at Universidade Nova de Lisboa
UNIGIS Poland at the Jagiellonian University in Kraków
UNIGIS Salzburg (German and English language) at the University of Salzburg
UNIGIS Zagreb at the University of Salzburg, delivered through Oikon
See also
Geographic Information System
Geographic Information Science
Geoinformatics
Social media
LinkedIn UNIGIS Alumni Worldwide
Blog UNIGIS News
References
International college and university associations and consortia
Information technology education
Information technology organizations
Geographic information systems organizations
|
https://en.wikipedia.org/wiki/Prova
|
Prova is an open source programming language that combines Prolog with Java.
Description
Prova is a rule-based scripting system that is used for middleware. The language combines imperative and declarative programming by using a prolog syntax that allows calls to Java functions. In this way a strong Java code base is combined with Prolog features such as backtracking.
Prova is derived from Mandarax, a Java-based inference system developed by Jens Dietrich. Prova extends Mandarax by providing a proper language syntax, native syntax integration with Java, agent messaging and reaction rules. The development of this language was supported by the grant provided within the EU projects GeneStream and BioGRID. In the project, the language is used as a rule-based backbone for distributed web applications in biomedical data integration, in particular, the GoPubMed system.
The design goals of Prova:
Combine declarative and object-oriented programming.
Expose logic and agent behavior as rules.
Access data sources via wrappers written in Java or command-line shells like Perl.
Make the Java API of various packages accessible as rules.
Run within the Java runtime.
Enable rapid prototyping of applications.
Offer a rule-based platform for distributed agent programming.
Prova aims to provide support for data integration tasks when the following is important:
Location transparency (local, remote, mirrors);
Format transparency (database, RDF, XML, HTML, flat files, computation resource);
Resilience to change (databases and web sites change often);
Use of open and open source technologies;
Understandability and modifiability by a non-IT specialist;
Economical knowledge representation;
Extensibility with additional functionality;
Leveraging ontologies.
Prova has been used as the key service integration engine in the Xcalia product where it is used for computing efficient global execution plans across multiple data sources such as Web services, TP monitors transactions like CICS or IMS, messages of MOM like MQ-Series, packaged applications with a JCA connector, legacy data sources on mainframes with a JCA connector, remote EJB Java objects considered as data providers or even local Java objects. Prova allows to deliver an innovative software platform for Service-oriented architecture implementations.
References
A. Kozlenkov and M. Schroeder. PROVA: Rule-based Java-Scripting for a Bioinformatics Semantic Web. In E. Rahm, editor, International Workshop on Data Integration in the Life Sciences, Leipzig, Germany, in Lecture Notes in Computer Science, Springer-Verlag, vol. 2994, pp. 17–30, 2004.
N. Combs and J.-L. Ardoint. Rules versus Scripts in Games Artificial Intelligence, AAAI 2004 Workshop on Challenges in Game AI, 2004.
J. Dietrich, A. Kozlenkov, M. Schroeder, and G. Wagner. Rule-based Agents for the Semantic Web, Electronic Commerce Research and Applications, vol. 2, no. 4, pp. 323–338, 2004.
A. Paschke, M. Bichler, and J. Dietrich. Contr
|
https://en.wikipedia.org/wiki/Pardus%20%28operating%20system%29
|
Pardus is a Linux distribution developed with support from the government of Turkey. Pardus' main focus is office-related work including use in Turkish government agencies. Despite that, Pardus ships in several languages. Its ease of use and availability free of charge has spawned numerous communities throughout the world.
Development
Pardus was started by Turkish National Research Institute of Electronics and Cryptology (UEKAE), a division of the Scientific and Technological Research Council of Turkey (TÜBİTAK), in 2003.
The first live CD version of Pardus was a fork of Gentoo Linux in 2005. The current version is a fork of Debian unstable, following a release process similar to that of Ubuntu.
Release history
PiSi package management
PiSi (; Packages Installed Successfully as Intended; also a Turkish word meaning "kitty", intended as a pun on the distribution's name, which is derived from pardus, the species name of the leopard.) is a package management system that was developed for Pardus. It was used in the initial versions of the distribution, but abandoned in favor of APT since the project moved to Debian base. Pardus 2011.2, released on September 19, 2011, was the last Pardus release that used PiSi.
PiSi stores and handles dependencies for various packages, libraries, and COMAR tasks. Some features of PiSi include:
Uses the LZMA compression algorithm
Written in Python
Package sources are written in XML and Python
Database access implemented with Berkeley DB
Integrates low-level and high-level package operations (dependency resolution)
Framework approach to build applications and tools upon
A community fork of the old Pardus with PiSi package management exists, called PiSi Linux. PiSi Linux's latest stable version is 2.3.4.
eopkg - the package manager of the Solus project, a rolling-release Linux distribution, is based on / derived from PiSi.
YALI
YALI (Yet Another Linux Installer) is the first Pardus software a user encounters. Basically, it recognizes the hardware and installs Pardus software from installation media (i.e. CD) to a user-selected hard disk partition. YALI can handle resizing of NTFS partitions found on the disk. A yalı is a waterside mansion common in the Bosphorus region.
This project is stopped and not being used since the migration to Debian-base.
KAPTAN
KAPTAN is a desktop greeter, which starts at the first start. It allows a user to change the desktop theme, mouse, keyboard and language settings, date and time, KDE menus, wallpaper, Package Manager settings, smolt, number of desktops. The word Kaptan means 'captain' in Turkish.
This project is stopped and not being used since the migration to Debian-base.
Reception
Ladislav Bodnar, the creator of DistroWatch, wrote in his round-up of Linux/*nix in 2006 that Pardus is one of the distros he was most impressed by that year "... thanks to unique package management ideas, innovative start-up sequence and general desktop polish ..."
Dmitri Popov, an
|
https://en.wikipedia.org/wiki/Whatever%20%28novel%29
|
Whatever (, literally "extension of the domain of struggle") is the debut novel of French writer Michel Houellebecq. The plot concerns a depressed and isolated computer programmer who tries to convince a colleague to murder a young woman who rejected the colleague's sexual advances. A major theme is that the sexual revolution of the 1960s extended capitalism to the sexual market, creating an unattractive sexual underclass. It was adapted into the 1999 film Whatever, directed by and starring Philippe Harel.
Plot
The unnamed first-person narrator is a 30-year-old analyst-programmer working for a Paris-based computer software company. He is lonely, subject to depression and has not had sex since be broke up with his girlfriend two years earlier. He also writes "animal stories", extracts from which are included in the novel.
He has dinner with a friend from his student days who is now a priest. His friend tells him that that the media exaggerates the role of sex in society and that this has led to "vital exhaustion". His friend advises him to re-find God or go into psychoanalysis. Later, the narrator muses that human relationships have become "increasingly impossible" as information technology has reduced them to an exchange of information.
The narrator learns that his company has sold a software program to the Ministry of Agriculture and that he will be required to train the client's staff in the software. His primary contact at the ministry is Catherine Lechardoy, a woman of about the narrator's age whom he describes as "not very attractive". At a social function at the ministry he contemplates making a sexual advance to her. He has no desire for sex with her but "feels up to making the necessary gestures." He decides against it because he doesn't think she would have accepted.
The narrator travels to Rouen with a male colleague named Tisserand in order to conduct training for the ministry staff there. The narrator notes that Tisserand is "extremely ugly. So ugly that his appearance repels women and he never gets to sleep with them." Tisserand tries to become friendly with an attractive female student in a train to Rouen, two "cuties" at the ministry and several women in a restaurant and a café but with no success. That night, the narrator is struck by acute pericarditis and is hospitalised for two weeks.
After recovering in Paris, the narrator leaves for La Roche-sur-Yon to train the ministry staff there. Tisserand tells him that he is 28-years-old and still a virgin. Later, the narrator muses that just as economic liberalism produces extremes of wealth and poverty, a society based on sexual liberalism also produces extremes of sexual gratification and sexual impoverishment. Economic liberalism and sexual liberalism both represent "extensions of the domain of the struggle". He reflects on his former girlfriend Véronique whom he regrets having ever met. He reflects that psychoanalysis turned her into a woman with a complete lack of moral sense
|
https://en.wikipedia.org/wiki/FTPFS
|
FTPFS refers to file systems that support access to a File Transfer Protocol (FTP) server through standard file system application programming interfaces (APIs).
The ftpfs command in Plan 9 was originated by Dennis Ritchie and was included in the first release of the system (1992). It arranged for a remote file system reachable via FTP to appear as part of the local file system.
In Linux systems, FTPFS was initially implemented as a Linux kernel module that allows the user to mount a FTP server onto the local filesystem but it was never seen as the perfect way to do it. By 2003, it has been converted to use LUFS, and later to FUSE. Now it is called CurlFtpFS because it uses the universal libcurl for FTP transactions and is becoming part of the major Linux distributions. There also exists LftpFS for smart mirroring of FTP sites.
In macOS, a read-only FTP file system is included that can be used either via the GUI (with ) or the command line (mount_ftp). The read-only limitation is noted in the man page for mount_ftp (on a macOS system, in Terminal.app, see "man mount_ftp"). However, the free application Macfusion includes a working implementation of FTPFS. Additionally, macOS Fuse is reported to enable this but the method to do so is undocumented (as of March 4, 2013) either via various obvious man page (e.g. sshfs) or in the macOS Fuse wiki.
For Windows XP, Windows 7 and other Windows operating systems, this functionality is partially provided by the "Network Places"/"Network Location" shell facility; a network place is a link to either an FTP server or a WebDAV server and can be accessed in Windows Explorer as just another network filesystem. This does not provide transparent access through the lowest-level Win32 file system APIs, however. Such functionality can be provided by third party programs such as WebDrive and FTPDrive.
See also
SSHFS
Dokan Library
References
External links
LftpFS
http://macfusionapp.org
File Transfer Protocol
Computer_file_systems
|
https://en.wikipedia.org/wiki/Systematized%20Nomenclature%20of%20Medicine
|
The Systematized Nomenclature of Medicine (SNOMED) is a systematic, computer-processable collection of medical terms, in human and veterinary medicine, to provide codes, terms, synonyms and definitions which cover anatomy, diseases, findings, procedures, microorganisms, substances, etc. It allows a consistent way to index, store, retrieve, and aggregate medical data across specialties and sites of care. Although now international, SNOMED was started in the U.S. by the College of American Pathologists (CAP) in 1973 and revised into the 1990s. In 2002 CAP's SNOMED Reference Terminology (SNOMED RT) was merged with, and expanded by, the National Health Service's Clinical Terms Version 3 (previously known as the Read codes) to produce SNOMED CT.
Versions of SNOMED released prior to 2001 were based on a multiaxial, hierarchical classification system. As in any such system, a disease may be located in a body organ (anatomy), which results in a code in a topography axis and may lead to morphological alterations represented by a morphology code.
In 2002 the first release of SNOMED CT adopted a completely different structure. A sub-type hierarchy, supported by defining relationships based on description logic, replaced the axes described in this article. Versions of SNOMED prior to SNOMED CT are planned to be formally deprecated from 2017. Therefore, readers interested in current information about SNOMED are directed to the article on SNOMED CT.
Purpose
SNOMED was designed as a comprehensive nomenclature of clinical medicine for the purpose of accurately storing and/or retrieving records of clinical care in human and veterinary medicine.
The metaphor used by Roger A. Côté, the first editorial chair, was that SNOMED would become the periodic table of elements of medicine because of its definitional organization beyond the hierarchical design. Indeed, diseases and procedures were ordered hierarchically and are further referenced back to more elementary terms (see Reference Ontology and Multi-Axial Design, below).
History
SNOMED was originally conceived by Côté as an extension of the design of the Systematized Nomenclature of Pathology (SNOP) applicable for all medicine. SNOP was originally designed by Arnold Pratt to describe pathological specimens according to their morphology and anatomy (topography). The ambitious development of SNOMED required many more axes (see multi-axial design, below). SNOMED was jointly proposed for development to the College of American Pathologists by Côté and Pratt. The former was appointed as editorial chair of the Committee on Nomenclature and Classification of Diseases of the CAP and developed the SNOMED from 1973 to 1997. In 1998, Kent Spackman was appointed to chair this committee and spearheaded the transformation of the multi-axis systems into a highly computable form (See SNOMED CT): a directed acyclic graph anchored in formal representation logic. In 2007, the newly formed International Health Terminology Standard
|
https://en.wikipedia.org/wiki/Denison%20Bollay
|
Denison Bollay (born 1952) is a software engineer working on programming languages and search algorithms, with applications for e-commerce and financial information.
History
In 1975, Bollay became an early quant (before the term was invented), computing real-time option pricing. Real-time stock and option data was so new, he had to design and build his own hardware to interface his Data General Eclipse computer with the Bunker Ramo machine and ticker.
Bollay is the author of ExperLogo and ExperLisp, the first incrementally compiled object-oriented programming languages for a personal computer, the Apple Macintosh. He introduced the world to the first Interface Builder in 1986, and the first dynamic interface building tool Action! in 1988. He was also the creator of DynamicDocuments in 1988, the first object-oriented, multimedia hypertext system (built in the language Lisp), WebBase, the first dynamic web server in 1995, and WebData (a database of databases web portal).
In 1999, he founded ExperClick, the first real-time internet auction market. The company's name was changed to AdECN in 2006. It was sold to Microsoft in August 2007.
He spun off a subsidiery, 3DStockCharts in 2000. It provided the first integrated real-time ECN stock market book in visual 3D graphics.
Bollay was awarded . He has many pending patents. He founded ExperTelligence in 1984, 3DStockCharts.com in 1999, ExperClick in 2000, and became Chairman of MicroMLS in 2004. He founded and still operates a wireless internet service provider Kiza, Inc. in Southern California in 2014.
He is also one of the authors (with Mel Beckman and Brian Fox) of the BuddyCast peer-to-peer streaming media protocol.
Computer Camp
In 1980, Denison Bollay created The Original Computer Camp, an outdoor tech camping experience for kids. It included horseback riding, campfires, and a hundred computers, including the Apple II, Atari 8-bit family, TRS-80, and TI-99/4A. There were robots, turtles (silicon based), and synthesized computer music. It was featured on the front page of The Wall Street Journal, launching a trend that encouraged thousands of children to become interested in software.
He graduated from Harvey Mudd College in 1974.
References
Harvey Mudd College alumni
Living people
1952 births
|
https://en.wikipedia.org/wiki/Long%20mode
|
In the x86-64 computer architecture, long mode is the mode where a 64-bit operating system can access 64-bit instructions and registers. 64-bit programs are run in a sub-mode called 64-bit mode, while 32-bit programs and 16-bit protected mode programs are executed in a sub-mode called compatibility mode. Real mode or virtual 8086 mode programs cannot be natively run in long mode.
Overview
An x86-64 processor acts identically to an IA-32 processor when running in real mode or protected mode, which are supported modes when the processor is not in long mode.
A bit in the CPUID extended attributes field informs programs in real or protected modes if the processor can go to long mode, which allows a program to detect an x86-64 processor. This is similar to the CPUID attributes bit that Intel IA-64 processors use to allow programs to detect if they are running under IA-32 emulation.
With a computer running legacy BIOS, the BIOS and the boot loader run in real mode. After execution passes to an operating system kernel which supports x86-64, the kernel verifies CPU support for long mode and then executes the instructions to enter it. With a computer running UEFI, the UEFI firmware (except CSM and legacy Option ROM), any UEFI boot loader, and the operating system kernel all run in Long mode.
Memory limitations
While register sizes have increased to 64 bits from the previous x86 architecture, memory addressing has not yet been increased to the full 64 bits. For the time being, it is impractical to equip computers with sufficient memory to require a full 64 bits. As long as that remains the case, load/store unit(s), cache tags, MMUs and TLBs can be simplified without any loss of usable memory. Despite this limitation, software is programmed using full 64-bit pointers, and will therefore be able to use progressively larger address spaces as they become supported by future processors and operating systems.
Current limits
The first CPUs implementing the x86-64 architecture, namely the AMD Athlon 64 / Opteron (K8) CPUs, had 48-bit virtual and 40-bit physical addressing.
The virtual address space of these processors is divided into two 47-bit regions, one starting at the lowest possible address, the other extending down from the largest. Attempting to use addresses falling outside this range will cause a general protection fault.
The limit of physical addressing constrains how much installed RAM is able to be accessed by the computer. On a ccNUMA multiprocessor system (Opteron) this includes the memory which is installed in the remote nodes, because the CPUs can directly address (and cache) all memory regardless if it is on the home node or remote. The 1 TB limit (40-bit) for physical memory for the K8 is huge by typical personal computer standards, but might have been a limitation for use in supercomputers. Consequently, the K10 (or "10h") microarchitecture implements 48-bit physical addresses and so can address up to 256 TB of RAM.
When there is nee
|
https://en.wikipedia.org/wiki/National%20rail%20network
|
In United States railroading, the term national rail network, sometimes termed "U.S. rail network", refers to the entire network of interconnected standard gauge rail lines in North America. It does not include most subway or light rail lines. Federal Railroad Administration regulations require passenger cars used on the national rail network to be heavy and strong enough to protect riders in case of collision with freight trains.
References
Rail transportation in the United States
|
https://en.wikipedia.org/wiki/Patton%20Versus%20Rommel
|
Patton vs. Rommel is a computer wargame designed and programmed by Chris Crawford for the Macintosh and published by Electronic Arts in 1986. Versions for MS-DOS compatible operating systems and Commodore 64 were developed by Sculptured Software and published in 1987.
Plot
Patton vs. Rommel is set in and around the Normandy beachhead shortly after the D-Day invasion of June, 1944. American, Canadian and British forces are placed in the correct positions as the Allied advance started to bog down. The German forces of Rommel are likewise in place defending Caen and other cities.
Gameplay
To win the game, the Allied player must advance farther and faster than the real-life Allied forces. For the Rommel-side player to win, he or she must defend more territory longer than the actual German defenders. If the German side can effectively counter and stall the Allied attacks and prevent a breakthrough, the Rommel player will usually win.
This creates a dynamic where the Patton player must look for a way to create a hole in the German lines wide enough to push one or more armored divisions through into the German rear area. Since almost all of the German forces are concentrated at the front, the principle of fog of war means that units that are not within sight of enemy units "disappear" from the game map – and from the thinking of the enemy. When they suddenly reappear in a surprise attack from the rear they have an overwhelming advantage over the units they are attacking. In this way an Allied player can roll up a major element of the German line and achieve a victory.
In real history the Allies eventually broke through and surrounded several German panzer and infantry divisions, which were decimated as they attempted to escape through the Falaise Gap. In the game this decisive victory requires practice and skill by the Allied player.
Development
After the success of Crawford's game Balance of Power, EA wanted to work with him, but could not acquire the rights to sequel the game from its publisher, Mindscape. Instead, they suggested he build on the tradition of his seminal Atari 8-bit game Eastern Front.
Crawford elected to focus the game's design on fog of war and the personalities of American general George Patton and the German field marshal Erwin Rommel. In real life the two were never involved together in a major confrontation, as Rommel was wounded in 1944 and later forced to commit suicide (due to his association with the anti-Hitler conspirators of the July 20 plot), before Patton had command in large-scale land operations. The game's AI, however, worked to be true to the strategies of each of the two generals.
Reception
Computer Gaming World described the game as "very playable", admiring its in-game advisors and simple movement scheme, even allowing units to queue actions that are remembered turn-to-turn. A 1991 survey of strategy and war games, however, gave it two and a half stars out of five, and a 1993 survey of wargames gave the ga
|
https://en.wikipedia.org/wiki/FuseDocs%20%28programming%29
|
FuseDocs is a program definition language created by Hal Helms in the late 1990s.
In its original form, FuseDocs used a proprietary vocabulary to define the responsibilities, properties, and I/O of code module in the ColdFusion programming language. In its second form (2.0), FuseDocs uses an XML vocabulary. In essence, FuseDocs forms a sort of work order, telling the programmer everything needed to write the module, and nothing more. A Fusebox architect is responsible for creating the FuseDocs for an application. A DTD for FuseDocs is available at fusebox.org.
Although FuseDocs was so named because of its creation within the Fusebox community, it is also used by developers who do not employ Fusebox as an application framework.
References
CFML programming language
XML
|
https://en.wikipedia.org/wiki/Lionel%20Tarassenko
|
Lionel Tarassenko, (born 17 April 1957) is a British engineer and academic, who is a leading expert in the application of signal processing and machine learning to healthcare. Tarassenko is President of Reuben College, Oxford.
He was previously Head of Department of Engineering Science (Dean of Engineering) at the University of Oxford, succeeded by Ronald A. Roy. Towards the end of his time as Dean, the Department rose to number 1 in the Times Higher Education World University Rankings.
Tarassenko was elected Professor of Electrical Engineering at the University of Oxford in 1997 and was a Professorial Fellow of St John's College, Oxford, from 1997 to 2019. In 2019 he was invited by the Vice-Chancellor Louise Richardson to oversee the development of Reuben College, the University's 39th college. He is also a Pro-Vice Chancellor and the Chair of the Management Committee of the Maison Française d’Oxford.
Tarassenko is the author of over 280 journal papers, 200 conference papers, 3 books and over 30 granted patents. He has supervised 65 doctoral students. He has been a founder director of four University spin-out companies, the latest being Oxehealth in September 2012. He was the R&D Director and Chair of the Strategic Advisory Board of Sensyne Health, an AIM-listed company from 2018 to 2022. He is a director of the University’s wholly owned Technology Transfer company, Oxford University Innovation. He was the editor-in-chief of the 2018 Topol Review of NHS Technology and its impact on the workforce.
Tarassenko was the driving force behind the creation of the Institute of Biomedical Engineering (IBME) at the University of Oxford, which he directed from its opening in April, 2008 to October, 2012. He established an £8m Centre of Excellence in Medical Engineering within the IBME, and led the Technology & Digital Health theme in the National Institute for Health and Care Research (NIHR) Oxford Biomedical Research Centre from its inception in 2007 until 2022. Under his leadership, the IBME grew from 110 to 220 academic researchers and it was awarded a Queen’s Anniversary Prize for Higher Education in 2015 for “new collaborations between engineering and medicine delivering benefit to patients”.
Education
Tarassenko completed his BA in Engineering Science in 1978 at Keble College, University of Oxford. Later he obtained his DPhil in 1985, also at the University of Oxford for his work on the early identification of brain haemorrhages in pre-term infants.
Career and Research
Together with Professor Alan Murray of University of Edinburgh, Tarassenko is the inventor of the pulse-stream technique for analogue implementation of massively parallel neural networks. He gradually moved away from designing neural network hardware to developing new machine learning algorithms and applying them to problems as diverse as the automated re-heating of food and drinks in a microwave oven (implemented in the Sharp LogiCook oven) and the analysis of sleep disorders
|
https://en.wikipedia.org/wiki/Reverse%20index
|
Database management systems provide multiple types of indexes to improve performance and data integrity across diverse applications. Index types include b-trees, bitmaps, and r-trees.
In database management systems, a reverse key index strategy reverses the key value before entering it in the index. E.g., the value 24538 becomes 83542 in the index. Reversing the key value is particularly useful for indexing data such as sequence numbers, where each new key value is greater than the prior value, i.e., values monotonically increase. Reverse key indexes have become particularly important in high volume transaction processing systems because they reduce contention for index blocks.
Creating data
Reversed key indexes use b-tree structures, but preprocess key values before inserting them. Simplifying, b-trees place similar values on a single index block, e.g., storing 24538 on the same block as 24539. This makes them efficient both for looking up a specific value and for finding values within a range. However, if the application inserts values in sequence, each insert must have access to the newest block in the index in order to add the new value. If many users attempt to insert at the same time, they all must write to that block and have to get in line, slowing down the application. This is particularly a problem in clustered databases, which may require the block to be copied from one computer's memory to another's to allow the next user to perform their insert.
Reversing the key spreads similar new values across the entire index instead of concentrating them in any one leaf block. This means that 24538 appears on the same block as 14538 while 24539 goes to a different block, eliminating this cause of contention. (Since 14538 would have been created long before 24538, their inserts don't interfere with each other.)
Querying data
Reverse indexes are just as efficient as unreversed indexes for finding specific values, although they aren't helpful for range queries. Range queries are uncommon for artificial values such as sequence numbers. When searching the index, the query processor simply reverses the search target before looking it up.
Deleting data
Typically, applications delete data that is older on average before deleting newer data. Thus, data with lower sequence numbers generally go before those with higher values. As time passes, in standard b-trees, index blocks for lower values end up containing few values, with a commensurate increase in unused space, referred to as "rot". Rot not only wastes space, but slows query speeds, because a smaller fraction of a rotten index's blocks fit in memory at any one time. In a b-tree, if 14538 gets deleted, its index space remains empty.
See also
Inverted index
Reverse dictionary
Footnotes
External links
Database index techniques
|
https://en.wikipedia.org/wiki/Partial%20index
|
In databases, a partial index, also known as filtered index is an index which has some condition applied to it so that it includes a subset of rows in the table.
This allows the index to remain small, even though the table may be rather large, and have extreme selectivity.
Suppose you have a transaction table where entries start out with STATUS = 'A' (active), and then may pass through other statuses ('P' for pending, 'W' for "being worked on") before reaching a final status, 'F', at which point it is no longer likely to be processed again.
In PostgreSQL, a useful partial index might be defined as:
create index partial_status on txn_table (status)
where status in ('A', 'P', 'W');
This index would not bother storing any of the millions of rows that have reached "final" status, 'F', and would allow queries looking for transactions that still "need work" to efficiently search via this index.
Similarly, a partial index can be used to index only those rows where a column is not null, which will be of benefit when the column usually is null.
create index partial_object_update on object_table (updated_on)
where updated_on is not null;
This index would allow the following query to read only the updated tuples:
select * from object_table
where updated_on is not null
order by updated_on;
It is not necessary that the condition be the same as the index criterion; Stonebraker's paper below presents a number of examples with indexes similar to the following:
create index partial_salary on employee(age)
where salary > 2100;
Support
In SQL Server, this type of index is called a filtered index.
Partial indexes have been supported in PostgreSQL since version 7.2, released in February 2002.
SQLite supports partial indexes since version 3.8.0.
MongoDB supports partial indexes since version 3.2.
References
External links
The Case For Partial Indexes
Database management systems
PostgreSQL
|
https://en.wikipedia.org/wiki/NRV
|
NRV may stand for:
Net realizable value of an asset
Norddeutscher Regatta Verein, a German yacht club
Not Really Vanished, computer compression algorithm in UPX
Valmet Nr I and Valmet Nr II Helsinki trams
Non Return Valve (check Valve)
Nutrient Reference Value, similar to Recommended Daily Allowance.
|
https://en.wikipedia.org/wiki/Craig%20McMahon
|
Craig McMahon is an Australian actor and television personality who has spent most of his working life within the Australian television industry.
He has worked as a presenter on the Network Ten's children's show Totally Wild and previously, with his wife Dominique, he co-hosted the children's TV series In the Box. He has worked on other shows including Neighbours, Fat Cow Motel and The Man From Snowy River.
He was nominated as a finalist for Cleo's Bachelor of the Year in 2000.
He and his wife Dominique co-founded the Film & Television Studio International, which runs acting classes in Brisbane and Melbourne. McMahon is the founder and artistic director whilst his wife is the co-founder and managing director.
McMahon also runs McMahon Management (MCM), an agency that represents Australian actors including Luke Mitchell, Esther Jackie Anderson, Gabrielle Fitzpatrick, Daniel Daperis, Glenda Linscott, Mauricio Merino Jr, Chris Milligan and Andrew James Morley.
External links
"Teacher Profiles", Film & Television Studio International, accessed 23 January 2008
Australian male television actors
Year of birth missing (living people)
Living people
|
https://en.wikipedia.org/wiki/Baptist%20Collegiate%20Network
|
The Baptist Collegiate Network (BCN) is a Baptist college-level organization that can be found on many college campuses in the United States and Canada; many of its collegiate ministries operate under the name Baptist Collegiate Ministry or the Baptist Student Union. The organization, while Baptist, functions as an interdenominational and coeducational fellowship, student society and service organization. Baptist Collegiate Network is primarily associated with the Southern Baptist Convention.
History
The organization was founded as Baptist Student Union in 1919 by the Baptist General Convention of Texas. Joseph P. Boone, a Baylor University graduate, was the first secretary. In 1920, the first state-wide convocation members was held at Howard Payne University in Brownwood, Texas. 300 students from 20 schools came for the development of programs.
Churches and state conventions have been deemed crucial to its growth.
According to Baptist Press in 2012, the network had more than 69,500 students actively involved in campus ministry through this organization and its affiliated state-level Baptist conventions.
References
External links
Baptist education
Student religious organizations in the United States
Student religious organizations in Canada
Fellowships
|
https://en.wikipedia.org/wiki/DNIC
|
DNIC can stand for:
Dirección Nacional de Inteligencia Criminal
Data Network Identification Code
Diffuse noxious inhibitory controls
In Christianity, Dominus Noster Iesus Christus (and other grammatical variants; "Our Lord Jesus Christ")
In biochemistry, dinitrosyl iron complex
Direcção nacional de investigação criminal (Angola)
DoD Network Information Center
pt:Polícia Nacional (Angola)#Órgãos centrais
|
https://en.wikipedia.org/wiki/Radio%202%20%28Australian%20radio%20station%29
|
Radio 2 was a narrowband Australian radio network owned and operated by WorldAudio Limited. The network was broadcast on frequencies between 1611 and 1629 kHz via a series of 50 AM transmitters across Australia, as well as by satellite (including through Austar and Foxtel) and through the network's website.
History
Radio 2 began in Blacktown in Western Sydney on 1611 AM in October 2001, broadcasting under a Section 40 licence - meaning it could only operate on narrowband AM frequencies (1611–1701 kHz), and with narrow spectrum - 5 kHz, rather than the full 9 kHz which other commercial radio stations use. Branded "The New Voice Of Western Sydney", the station focused on live and local content, similar to 2WS in its heyday.
In 2002, Radio 2 was a broadcast partner of the 2002 FIFA World Cup, broadcasting live coverage of matches, with the call led by Colin Turner. In 2003, Radio 2 was a broadcast partner of the AFL, hosting live coverage of Sydney Swans home games from the Sydney Cricket Ground and Stadium Australia.
National expansion
In November 2003, owners WorldAudio Limited acquired a series of 14 additional transmitters, forming a national commercial AM radio network. This did not come without drama - a legal battle had begun between owners WorldAudio and GB Radio in Melbourne, over the use of the 1620 AM licence - WorldAudio would eventually use 1629 AM in Melbourne instead. In April 2005, owners WorldAudio signed Mikey Robins and Ian Rogerson to host The Big Australian Breakfast, Nick Bennett to host the Nick's Nation drive show, and former Seven News presenter Ross Symonds to host Sunday morning business program The Bottom Line.
In May 2005, the station launched nationally to a network of 50 stations around the country, dropping the Western Sydney focus and moving to programming of national significance. At launch, WorldAudio CEO Andrew Peter Thompson boasted the station "[could] be picked up by 93% of all radio receivers." Additional programming included Sportswatch Australia with Colin Turner, She Said with Sophie Falkiner and Katrina Warren, and Politically Direct with Paul Makin. The network had an emphasis on sporting coverage, with coverage of A-League and English Premier League soccer, AFL (including Sydney Swans and Brisbane Lions games, plus the 2005 AFL Grand Final), and the NBL.
Downfall and closure
However, the network's success wasn't to be. A combination of minimal listenership and low advertising lead to a trading halt being placed on parent company WorldAudio, with the announcement that administrators had been appointed to the company a week later. Administrators halted all talk based content, leaving the station to broadcast non-stop music.
Radio 2's frequencies were later sold, either to Rete Italia, the start-up Vision Christian Radio, or to the similarly ill-fated Goanna country music network.
Availability (at time of closure)
References
Defunct radio stations in Australia
Radio stations established in 2001
Rad
|
https://en.wikipedia.org/wiki/Hamish%20%26%20Andy
|
Hamish & Andy are an Australian comedy duo formed in 2003 by Hamish Blake and Andy Lee. Best known for their various drive time radio programmes on the Hit Network, which aired in multiple formats until 2017, their shows gained consistently high market share and became the highest rated radio show in Australian history. Retiring after 14 years of broadcasting, the duo now produce a weekly self-titled podcast and occasionally publish a secondary programme, the Remembering Project, to revisit their old radio segments.
The duo have also worked extensively in television, known as correspondents on Rove and for their various seasons of Hamish & Andy's Gap Year which won multiple Logie Awards including Most Popular Light Entertainment Program in 2012, 2014 and 2015.
They have made numerous appearances hosting events, competing on game shows and in celebrity sporting events. They also performed in a touring rock cover band, Cool Boys and the Frontman, throughout 2016 and 2017. The pair were ranked the highest-paid commercial radio hosts in Australia, with individual salaries of A$4 million, as of 2014.
Background
Hamish Blake and Andy Lee met while both studying at the University of Melbourne in 2001. They entered comedy competitions together and just a year after meeting, they started their career in radio by hosting a show on community radio station SYN FM.
Radio career (2003–2017)
First radio programmes
The duo began presenting radio on the Student Youth Network, in the Friday afternoon drivetime slot. In 2003, soon after Hamish began writing for the Fox FM breakfast show (The Matt & Jo Show), the pair began hosting a Monday night late-night radio program called Almost Tuesday on the same station. The duo then hosted the Fox FM program Almost Midday on Saturday mornings, which was so successful it was syndicated nationally across the Today Network.
The duo presented two radio specials on BBC 6 Music in the United Kingdom on 21 December 2009 and 26 January 2010. On Friday 11 June, it was announced on the Christian O'Connell Breakfast Show that Hamish & Andy would be presenting three shows in London during July 2010 to cover O'Connell's holiday. Hamish and Andy signed a deal to present a series of shows to air on Absolute Radio Sunday evenings.
Drive time programme
The duo hosted a two-hour weekday radio show titled Hamish & Andy from 2006 to 2013. It was broadcast in all the seven major cities of Australia in the afternoon drive time slot. The show was the highest-rated radio series in Australian history, with approximately two million listeners daily. During its broadcast, the show had completed two domestic and two foreign caravan tours, a Bass Strait sailboat trip, and trips to Afghanistan, Beijing, Japan, India, and the US, recording live on location. They were also syndicated internationally, with a highlights package broadcast on BBC Radio 6 in December 2009. In 2010, they also presented three shows in London to cover Christian O'Conne
|
https://en.wikipedia.org/wiki/Ceramic%20forming%20techniques
|
Ceramic forming techniques are ways of forming ceramics, which are used to make everything from tableware such as teapots to engineering ceramics such as computer parts. Pottery techniques include the potter's wheel, slip casting and many others.
Methods for forming powders of ceramic raw materials into complex shapes are desirable in many areas of technology. For example, such methods are required for producing advanced, high-temperature structural parts such as heat engine components, recuperators and the like from powders of ceramic raw materials. Typical parts produced with this production operation include impellers made from stainless steel, bronze, complex cutting tools, plastic mould tooling, and others. Typical materials used are: wood, metal, water, plaster, epoxy and STLs, silica, and zirconia.
This production operation is well known for providing tools with dimensional stability, surface quality, density and uniformity. For instance, on the slip casting process the cast part is of high concentration of raw materials with little additive, this improves uniformity. But also, the plaster mould draws water from the poured slip to compact and form the casting at the mould surface. This forms a dense cast.
Slip casting
There are many forming techniques to make ceramics, but one example is slip casting. This is where slip or, liquid clay, is poured into a plaster mould. The water in the slip is drawn out into the walls of the plaster mould, leaving an inside layer of solid clay, which hardens quickly. When dry, the solid clay can then also be removed. The slip used in slip casting is often liquified with a substance that reduces the need for additional water to soften the slip (unless crazing is wanted); this prevents excessive shrinkage which occurs when a piece containing a lot of water dries; another approach is to dry items slowly.
Slip-casting methods provide superior surface quality, density and uniformity in casting high-purity ceramic raw materials over other ceramic casting techniques, such as hydraulic casting, since the cast part is a higher concentration of ceramic raw materials with little additives. A slip is a suspension of fine raw materials powder in a liquid such as water or alcohol with small amounts of secondary materials such as dispersants, surfactants and binders. Pottery slip casting techniques employ a plaster block or flask mould. The plaster mould draws water from the poured slip to compact and form the casting at the mould surface. This forms a dense cast removing deleterious air gaps and minimizing shrinkage in the final sintering process.
Additive manufacturing
For the production of complex shapes in small quantities, additive manufacturing (AM) represents an effective approach, and is the subject of significant research and development. Unlike the additive manufacturing of polymeric materials, the scope of AM of ceramics remains quite limited owing to materials processing challenges. Commercially avai
|
https://en.wikipedia.org/wiki/Antidesmateae
|
Antidesmateae is a tribe of the plant family Phyllanthaceae. It comprises 5 subtribes and 9 genera.
Subtribes and genera
, the Germplasm Resources Information Network (GRIN) accepted the following subtribes and genera:
Subtribe Antidesmatinae
Antidesma
Thecacoris
Subtribe Hieronyminae:
Hieronyma
Subtribe Hymenocardiinae:
Didymocistus
Hymenocardia
Subtribe Leptonematinae:
Leptonema
Subtribe Martretiinae:
Apodiscus
Martretia
Unplaced:
Chonocentrum
See also
List of Phyllanthaceae genera
References
Phyllanthaceae
Malpighiales tribes
|
https://en.wikipedia.org/wiki/PMI-80
|
The PMI-80 was a single-board microcomputer produced by Tesla Piešťany, Czechoslovakia, since 1982. It was based on the MHB 8080A CPU (a Tesla clone of the Intel 8080), clocked at 1.111 MHz. Instead of a raster graphic display output and classical keyboard, it had a calculator-style nine-digit seven-segment red LED display and a 25-key calculator-type keypad with hexadecimal and function keys (including hardware REset and Interrupt). The PMI-80 had 1 KiB of ROM (expandable to 2 KiB) and fixed 1 KiB of RWM. Eight (expandable to 32) I/O lines were provided for user along with complete system bus. Connected could be e.g., a card with a DAC of 0–12 V range.
External links
PMI-80 information – At the OLD-COMPUTERS.COM website
Early microcomputers
Science and technology in Czechoslovakia
|
https://en.wikipedia.org/wiki/DELNI
|
DELNI may refer to:
Department for Employment and Learning of Northern Ireland, a defunct government department in Northern Ireland
Digital Ethernet Local Network Interconnect, a multiport Ethernet transceiver manufactured by Digital Equipment Corporation in the 1980s.
|
https://en.wikipedia.org/wiki/David%20D.%20Clark
|
David Dana "Dave" Clark (born April 7, 1944) is an American computer scientist and Internet pioneer who has been involved with Internet developments since the mid-1970s. He currently works as a senior research scientist at MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL).
Education
He graduated from Swarthmore College in 1966. In 1968, he received his master's and engineer's degrees in electrical engineering from MIT, where he worked on the I/O architecture of Multics under Jerry Saltzer. He received his Ph.D. in electrical engineering from MIT in 1973.
Career
From 1981 to 1989, he acted as chief protocol architect in the development of the Internet, and chaired the Internet Activities Board, which later became the Internet Architecture Board. He has also served as chairman of the Computer Sciences and Telecommunications Board of the National Research Council.
In 1990 he was awarded the SIGCOMM Award in recognition of his major contributions to Internet protocol and architecture. Clark received in 1998 the IEEE Richard W. Hamming Medal.
In 1996, Clark was elected a member of the National Academy of Engineering for the design and development of efficient implementation techniques for Internet protocols. In 1998, he was elevated to Fellow of the IEEE for leadership in the engineering and deployment of the protocols that embody the Internet. In 2001, he was inducted as a Fellow of the Association for Computing Machinery.
Also in 2001, he was awarded the Telluride Tech Festival Award of Technology in Telluride, Colorado, and in 2011 the Internet & Society Lifetime Achievement Award from the Oxford Internet Institute at the Oxford University. In 2013, he was inducted into the Internet Hall of Fame.
His recent research interests include what the architecture of the Internet will look like in the post-PC era as well as "extensions to the Internet to support real-time traffic, explicit allocation of service, pricing and related economic issues, and policy issues surrounding local loop employment".
Legacy
Clark has been credited with a popular statement in the computer science realm:
In 1999, law professor Lawrence Lessig stated that "rough consensus and running code" had broad significance as "a manifesto that will define our generation.' Clark's new ethos of consensus has become a widely used methodology software development today and replaced a more top down approach that existed in the 80s.
Selected publications
David D. Clark, "An Input/Output Architecture for Virtual Memory Computer Systems", Ph.D. dissertation, Project MAC Technical Report 117, January 1974
L. W. McKnight, W. Lehr, David D. Clark (eds.), Internet Telephony, MIT Press, 2001,
David D. Clark, "The Design Philosophy of the DARPA Internet Protocols", Computer Communications Review 18:4, August 1988, pp. 106–114
R. Braden, David D. Clark, S. Shenker, and J. Wroclawski, "Developing a Next-Generation Internet Architecture", ISI white paper, 2000
David
|
https://en.wikipedia.org/wiki/Hubert%20Zimmermann
|
Hubert Zimmermann (15 November 1941 – 9 November 2012) was a French software engineer and a pioneer of computer networking.
Biography
Zimmermann was educated at École Polytechnique and École Nationale Supérieure des Télécommunications.
His career began at Institut National de Recherche en Informatique et Automatique (INRIA) in Rocquencourt from 1972 through 1979, where he led research into what became ChorusOS series of distributed operating systems. He worked for Louis Pouzin on the CYCLADES project and participated in the International Networking Working Group from 1972, initially chaired by Vint Cerf. He published several influential papers in the field of internetworking and was acknowledged by Cerf and Bob Kahn in their seminal 1974 paper, "A Protocol for Packet Network Intercommunication". In 1977, he was an early member of the International Organization for Standardization as it developed the Open Systems Interconnection protocols. He developed and promoted the OSI reference model which became a popular way to describe network protocols, and published a paper on the model in 1980 and one with John Day in 1983.
He then worked for France Télécom in 1980 through 1986.
Zimmerman was a founder of Chorus Systèmes SA in 1986, which commercialised the Chorus distributed microkernel operating system that had been created at INRIA. Chorus Systèmes was purchased by Sun Microsystems in 1997, where he was director of telecom software engineering for 5 years. Then he invested in entrepreneurial high-tech companies such as Arbor Venture Management, Boost Your StartUp, Gingko Networks and UDcast.
In 1991, Zimmermann was awarded the SIGCOMM Award for "20 years of leadership in the development of computer networking and the advancement of international standardization".
On 9 November 2012, Zimmermann died in France.
See also
Gérard Le Lann
History of the Internet
Internet in France
Rémi Després
References
1941 births
Place of birth missing
2012 deaths
French computer scientists
École Polytechnique alumni
20th-century French inventors
20th-century French engineers
Internet pioneers
|
https://en.wikipedia.org/wiki/Intertec%20Superbrain
|
The Intertec SuperBrain was an all-in-one commercial microcomputer that was first sold by Intertec Data Systems Corporation of Columbia, South Carolina, USA in 1979. The machine ran the operating system CP/M and was somewhat unusual in that it used dual Z80 CPUs, the second being used as a disk controller. In 1983, the basic machine sold for about .
There were several variants, including the SuperBrain II (released in 1982), SuperBrain II Jr., "QD" (quad density disk drives) and "SD" (super density) models.
Intertec also released a similar looking dumb terminal, the Intertube, and smart terminal, the Emulator.
The SuperBrain is notable for being at the user end of the first Kermit connection in 1981.
The machine was practical and useful in the office environment, but somewhat limited until the arrival of the first 5 MB hard drive in one of the floppy drive bays. This was soon replaced by the 10 MB hard drive.
Up to 255 CompuStar workstations could be daisy-chained together via DC-37 "Chaining Adaptor" parallel ports to share the "central disk system" (one of the three hard drive peripheral options below). Each computer, or VPU (Video Processing Unit), was assigned a unique number from 1 to 255 by setting an eight-position DIP switch.
Specifications
Peripherals
CompuStar DSS-10 10 MB Hard Drive (CompuStar Disk Storage System)
CDC 96 MB Hard Drive (80 MB fixed disk with 16 MB removable platter)
Priam 14" 144 MB Hard Drive
Applications
Microsoft BASIC
8080 Assembler
Microsoft COBOL 74
APL
In pop culture
The Superbrain can be seen in two episodes of Knight Rider: one in Season 1, Episode 10, "The Final Verdict" (1982), and the second in Season 1, Episode 18, "White Bird" (1983).
In John Carpenter’s The Thing, Dr. Blair uses a Superbrain to analyse samples from The Thing from which he estimates that it will take over the world in about three years.
References
External links
Intertec SuperBrain DAVES OLD COMPUTERS
Superbrain at Old Computer Museum
Marcus Bennett's Superbrain documentation
CP/M
Microcomputers
Computer-related introductions in 1979
|
https://en.wikipedia.org/wiki/Scott%20Shenker
|
Scott J. Shenker (born January 24, 1956 in Alexandria, Virginia) is an American computer scientist, and professor of computer science at the University of California, Berkeley. He is also the leader of the Extensible Internet Group at the International Computer Science Institute in Berkeley, California.
Over his career, Shenker has made research contributions in the areas of energy-efficient processor scheduling, resource sharing, and software-defined networking. In 2002, he received the SIGCOMM Award in recognition of his "contributions to Internet design and architecture, to fostering research collaboration, and as a role model for commitment and intellectual rigor in networking research".
Shenker is an ISI Highly Cited researcher. According to Google Scholar he is one of the five highest-ranked American computer scientists, with total citations exceeding 100,000.
Biography
Shenker received his Sc.B. in physics from Brown University in 1978, and his PhD in physics from University of Chicago in 1983. In 2007, he received an honorary doctorate from the same university.
After working as a postdoctoral associate at Cornell University, he joined the research staff at Xerox PARC. He left PARC in 1998 to help found the AT&T Center for Internet Research, which was later renamed the ICSI Center for Internet Research (ICIR).
In 1995, Shenker contributed to the field of energy-efficient processor scheduling, co-authoring a paper on deadline-based scheduling with Frances Yao and Alan Demers. From 1995 to 2001, while working at Xerox PARC and later ICSI, he was an adjunct associate professor at the University of Southern California.
In 2002, Shenker joined the Berkeley faculty and received the SIGCOMM Award in recognition of his "contributions to Internet design and architecture, to fostering research collaboration, and as a role model for commitment and intellectual rigor in networking research".
In 2006, he received the IEEE Internet Award for "contributions towards an understanding of resource sharing on the Internet."
He is a Fellow of the ACM and IEEE and a member of the National Academy of Engineering.
In 2016 he became a fellow of the American Academy of Arts and Sciences.
He is the brother of string theorist Stephen Shenker.
Shenker is a leader in the movement toward software-defined networking (SDN). He is the co-founder of the Open Networking Foundation and of Nicira Networks.
In June of 2021, Berkeley announced that Shenker had donated $25 million toward the university's computing and data science initiatives, making him and colleague Ion Stoica two of Berkeley's top benefactors.
Publications (selection)
H. Li, A. Ghodsi, M. Zaharia, S. Shenker, and I. Stoica, "Tachyon: Reliable, Memory Speed Storage for Cluster Computing Frameworks," in ACM Symposium on Cloud Computing, 2014.
M. Zaharia, T. Das, H. Li, T. Hunter, S. Shenker, and I. Stoica, "Discretized Streams: Fault-Tolerant Streaming Computation at Scale," in ACM Symposium on
|
https://en.wikipedia.org/wiki/Atari%20User
|
Atari User was a British computer magazine aimed at users of Atari home computers, and published by Database Publications (later known as Europress) between 1985 and 1988.
Atari User was a general-interest computer magazine, containing games reviews as well as type-in programs, tutorials and hardware projects. As with Database's other publications, its appearance was somewhat conservative in comparison with its more games-oriented contemporaries, such as Computer and Video Games (C&VG). The editorial style was equally restrained and relatively formal. Andre Willey was one of the early editors of this magazine after being promoted from Technical Editor.
History
Early editions primarily focused on the Atari 8-bit family (400/800/XL/XE) and the newly launched Atari ST range (although they included news of other Atari products such as the relaunched Atari 2600 and Atari 7800 consoles). As the popularity of the ST increased, it was given its own pull-out section called "Atari ST User". From the April 1987 issue onward, Atari ST User was spun off as a magazine in its own right and went on to outlive its parent by a number of years.
After the split, Atari User was almost entirely oriented towards the 8-bit computers. Until late 1987, when Page 6 magazine became available on newsstands, Atari User was the only British magazine with dedicated (or even significant) support for the 8-bit Atari line to be sold in shops.
Following publication of the final issue in November 1988, Database sold the 'Atari User' name (but not 'Atari ST User') to the publishers of Page 6 magazine, an independent rival. Page 6 was briefly renamed Page 6 Atari User,
before settling on New Atari User. Despite the name, New Atari User was to all intents and purposes the same magazine as Page 6; it had virtually no editorial continuity with the old Atari User.
See also
Antic
ANALOG Computing
References
External links
Archived Atari User magazines on the Internet Archive
1985 establishments in the United Kingdom
Defunct computer magazines published in the United Kingdom
Atari 8-bit computer magazines
Atari ST magazines
Magazines established in 1985
Magazines disestablished in 1988
Video game magazines published in the United Kingdom
|
https://en.wikipedia.org/wiki/Atari%20ST%20User
|
Atari ST User was a British computer magazine aimed at users of the Atari ST range. It started life as a pull-out section in Atari User magazine. From April 1987<http://www.atarimania.com/mags/hi_res/atari-st-user-vol-02-issue-02_5.jpg volume 2 issue 2</ref> onwards it became a magazine in its own right (as explained on page 5), outliving its parent by a number of years. It was published initially by Database Publications in Stockport, and later by Europress in London.
Although ST User did review games and carry demos, far more of the magazine was concerned with 'serious' issues such as hardware, programming, and music than its rivals ST Action and ST Format.
The Cover Disk that was supplied with issue 59, cover dated January 1991 had a boot sector computer virus which infected the memory of the Atari ST and was written to other disks that were not write-protected. Issue 60 had a free games cover disk as an apology, and was supplied with a virus killer. Source is http://www.atarimania.com/mags/hi_res/atari-st-user-issue-059_5.jpg
Towards the end of its print run, ST User merged with the game-oriented magazine ST Action, and publication finally ceased in November 1994, leaving ST Format as the only surviving Atari ST publication that was still widely available.
References
External links
Archived Atari ST User magazines on the Internet Archive
Atari ST magazines
Defunct computer magazines published in the United Kingdom
Magazines established in 1986
Magazines disestablished in 1994
Magazines published in London
Monthly magazines published in the United Kingdom
|
https://en.wikipedia.org/wiki/Kandiyanallur
|
Kandiyanallur is a village located south west of Chennai in Tamil Nadu, India. It is a part of Vandavasi Taluk in the district of Thiruvannamalai. According to the 2011 Government of India Census data, there are a total of 79 families residing in the village. The population is 270 of which 138 are male and 132 are female. The village is administrated by an elected Sarpanch. The primary occupation of the villagers is Agriculture.
Politics
Kandiyanallur comes under the Vandavasi Vidhan Sabha constituency of the State of Tamil Nadu. This seat is reserved for Scheduled Caste
The winner of the 2016 Vidhan Sabha election was Ambethkumar, S from DMK with 80206 votes and runner up was Meganathan, V from AIADMK with 62138 votes.
Previous results are listed below
Education
PUPS-KANDIYANALLUR is a Tamil medium co-educational school located in the village. School is approved for Primary level education and works under the management of Local body.
News
In 2010, seven ancient apparently Panchaloha idols were unearthed around an ancient Siva temple.
References
Villages in Tiruvannamalai district
|
https://en.wikipedia.org/wiki/International%20Computer%20Science%20Institute
|
The International Computer Science Institute (ICSI) is an independent, non-profit research organization located in Berkeley, California, United States. Since its founding in 1988, ICSI has maintained an affiliation agreement with the University of California, Berkeley, where several of its members hold faculty appointments.
Research areas
ICSI's research activities include Internet architecture, network security, network routing, speech and speaker recognition, spoken and text-based natural language processing, computer vision, multimedia, privacy and biological system modeling.
Research groups and leaders
The Institute's director is Dr. Lea Shanley.
SIGCOMM Award winner Professor Scott Shenker, one of the most-cited authors in computer science, is the Chief Scientist and head of the New Initiatives group.
SIGCOMM Award winner Professor Vern Paxson, who leads network security efforts and who previously chaired the Internet Research Task Force.
Professor Jerry Feldman is the head of the Artificial Intelligence Group.
Adjunct Professor Gerald Friedland is the head of the Audio and Multimedia Group.
Dr. Stella Yu is head of the Computer Vision Group.
Dr. Serge Egelman is head of the Usable Security and Privacy Group.
Dr. Steven Wegman is head of the Speech Group.
Notable members and alumni
Turing Award and Kyoto Prize winner Professor Richard Karp is an alumnus and former head of the Algorithms Group.
Professor Nelson Morgan is a former director and former head of the speech group.
Professor Trevor Darrell is an alumnus and former head of the Computer Vision Group.
Professor Krste Asanovic, an ACM Distinguished Scientist, is an alumna and former head of the Computer Architecture Group.
IEEE Internet Award winner Sally Floyd; connectionist pioneer Jerry Feldman; frame semantics and construction grammar pioneer Charles J. Fillmore and Collin F. Baker, who lead the FrameNet semantic parsing project; and Paul Kay, who published an influential study on the universality of color words.
IEEE Internet Award winner Mark Handley founded the XORP open source router software project while at ICSI.
References
External links
Web page
Research institutes in California
Academic computer network organizations
Software companies based in California
Research institutes in the San Francisco Bay Area
Scientific organizations established in 1988
Non-profit organizations based in the San Francisco Bay Area
Organizations based in Berkeley, California
Software companies of the United States
Computer science institutes in the United States
|
https://en.wikipedia.org/wiki/Page%206
|
Page 6 (subtitled Atari Users Magazine) was a British magazine aimed at users of the Atari 8-bit family and Atari ST home computers. The first issue was in 1982, and it was renamed to Page 6 Atari User and then New Atari User before ceasing publication in 1998.
History
The magazine had its origins in the newsletter of the Birmingham User's Group, an independent Atari club based in England. Les Ellingham was appointed to be the editor of the newsletter, but decided to produce a magazine with broader appeal instead. He remained editor of Page 6 throughout its entire run of 85 issues. Although subscription-only for most of its life, it was available through newsagents during the late 1980s and early 1990s.
When Database ceased publication of the original Atari User magazine in 1988, Page 6 bought the rights (and subscriber list), and renamed their magazine, firstly to Page 6 Atari User in February 1989 and then to New Atari User in June of the same year. The latter was simply Page 6 under a different (and more newsagent-friendly) name, and had next to no continuity with the original Atari User. The editor Les Ellingham had declined the offer to edit the original Atari User when approached by Database Publications in 1985.
Due to "high interest rate, reluctance of the news trade to support smaller circulation magazines and reducing advertising income", New Atari User had to be withdrawn from retail sales and become subscription-only with issue 59 (December-January 1993).
Title
The magazine was named after the area of memory in 8-bit Atari computers covering locations 1536–1791. Memory is divided into pages of 256 bytes (the first being page 0). The sixth page begins at 256×6, or 1536. Page 6 is neither used by the operating system nor by Atari BASIC and so can be used to safely store short machine language routines to speed up BASIC programs.
References
External links
The Page 6 Magazine Library at the Centre for Computing History
1982 establishments in the United Kingdom
1998 disestablishments in the United Kingdom
Atari 8-bit computer magazines
Atari ST magazines
Bi-monthly magazines published in the United Kingdom
Video game magazines published in the United Kingdom
Defunct computer magazines published in the United Kingdom
Home computer magazines
Magazines established in 1982
Magazines disestablished in 1998
Mass media in Birmingham, West Midlands
Mass media in Staffordshire
|
https://en.wikipedia.org/wiki/TelecityGroup
|
Telecity Group plc (formerly TelecityRedbus and before that Telecity), was a European carrier-neutral datacentre and colocation centre provider. It specialised in the design, build and management of datacentre space. It was listed on the London Stock Exchange until it was acquired by Equinix in January 2016.
History
Telecity Group plc was the result of the uniting of three separate companies – TeleCity Limited, Redbus Interhouse Limited and Globix Holdings (UK) Limited. TeleCity Limited was founded by Mike Kelly and Anish Kapoor from Manchester University in April 1998 and opened its first data centre in Manchester. At that time 3i Group made an investment of £24 million in the Company.
In July 1998, Redbus Interhouse Limited was incorporated, and commenced operations in its first data centre in London Docklands in July 1999. By March 2000, Redbus Interhouse Limited floated on the main market of the London Stock Exchange and in June 2000, TeleCity Limited’s parent company, TeleCity plc floated on the London Stock Exchange.
In September 2005, TeleCity plc was taken private by 3i and Oak Hill and by October of that year Telecity Group plc was incorporated and became the holding company of Telecity plc and its group companies in November 2005. In January 2006 Telecity Group acquired Redbus Interhouse plc, a rival business, resulting in the two business, TeleCity and Redbus, trading under the name of TelecityRedbus. Later in 2006 Telecity Group plc bought the European assets of the US-based Globix Corporation.
Following a rebranding exercise implemented in August 2007, TeleCity, Redbus and Globix (UK) began to trade under the name TelecityGroup. In October Telecity Group plc listed on the main market of the London Stock Exchange.
In August 2010, TelecityGroup acquired Internet Facilitators Limited (IFL), a provider of-carrier neutral data centres in Manchester. In August 2011 TelecityGroup acquired Data Electronics, which operates two carrier-neutral data centres in Dublin, and in September 2011 UK Grid, a carrier-neutral data centre operator in Manchester was acquired.
TelecityGroup has announced it is expanding its data centre capacity across Europe. At the end of 2011 the company had 68 MW of available customer power and this will be increased to 124 MW by 2016. As part of this expansion the first phase of a new 9 MW data centre was opened in Amsterdam (Southeast AMS 5) in early 2012, and on 2 July 2012 Ed Vaizey, UK Minister for Communications, officially opened the first phase of a 21 MW expansion at the company's London Powergate facility.
In August 2012, TelecityGroup acquired Tenue Oy, a provider of carrier-neutral data centres in Helsinki, Finland. In November 2012 TelecityGroup acquired Academica, a data centre and IT services operator, also active in Finland since 1996, giving the enlarged TelecityGroup Finland a total of three data centres and 2MW of operational capacity; 7MW of additional capacity will be opened in two new facilit
|
https://en.wikipedia.org/wiki/Highmark
|
Highmark is an American non-profit healthcare company and Integrated Delivery Network based in Pittsburgh, Pennsylvania, United States. It is a large individual not-for-profit health insurer in the United States, which operates several for-profit subsidiaries.
Locality
It is a health insurer in Pennsylvania, and through a purchase in 1996, an insurer in West Virginia and also later Delaware. As Highmark Blue Cross Blue Shield, it is primarily available in 29 counties of western Pennsylvania. As Highmark Blue Shield, it is available in 21 counties in Central Pennsylvania and the Lehigh Valley. It also has a presence in the border areas of eastern Ohio, and all of West Virginia through its subsidiary, Highmark Blue Cross Blue Shield West Virginia.
Highmark acquired Blue Cross of Northeastern Pennsylvania, BCNEPA, in June 2015.
Company history
Highmark was created in 1977 and in the 1990s by the consolidation of two Pennsylvania licensees of the Blue Cross and Blue Shield Association — Pennsylvania Blue Shield (now Highmark Blue Shield) based in suburban Harrisburg, and Blue Cross of Western Pennsylvania based in downtown Pittsburgh (now Highmark Blue Cross/Blue Shield).
The consolidated group is available in 62 of the state's 67 counties. In West Virginia, the company operates as Highmark Blue Cross Blue Shield West Virginia, and in Delaware, it operates as Highmark Blue Cross Blue Shield Delaware. The new company based its head offices in downtown Pittsburgh.
On March 28, 2007, Highmark announced it intended to consolidate with Independence Blue Cross of Philadelphia. The combination of the 2 insurers would have created a new company with over 18,000 employees, dual-headquarters in both Pittsburgh and Philadelphia and an economic impact of over $4 billion throughout the Commonwealth of Pennsylvania. On January 22, 2009, Highmark and Independence Blue Cross withdrew their applications to consolidate due to the unacceptability of conditions that the Pennsylvania Insurance Department was going to place upon the merger: to give up either of their well-known "Blue Cross" or "Blue Shield" trademarks.
In 2011 the company announced it would buy the financially troubled West Penn Allegheny Health System (WPAHS) for about $500 million, expanding from insurance into owning hospitals. This began a period of conflict between Highmark and UPMC, which had expanded from hospitals into insurance, and caused difficulties for patients to access care at the conflicting institutions. The conflict included a lawsuit by Highmark against UPMC alleging that UPMC over-billed it by $300 million for cancer drugs, arbitrators ordered Highmark to pay $188 million.
In 2014, a gay couple criticized Highmark for not providing family coverage to same-sex couples under the Affordable Care Act. Highmark later reversed their policy.
In January 2020, the company earned distinction as "Best Place to Work for LGBTQ Equality" from the Human Rights Campaign Foundation, receiv
|
https://en.wikipedia.org/wiki/Reliability%20%28computer%20networking%29
|
In computer networking, a reliable protocol is a communication protocol that notifies the sender whether or not the delivery of data to intended recipients was successful. Reliability is a synonym for assurance, which is the term used by the ITU and ATM Forum.
Reliable protocols typically incur more overhead than unreliable protocols, and as a result, function more slowly and with less scalability. This often is not an issue for unicast protocols, but it may become a problem for reliable multicast protocols.
Transmission Control Protocol (TCP), the main protocol used on the Internet, is a reliable unicast protocol; it provides the abstraction of a reliable byte stream to applications. UDP is an unreliable protocol and is often used in computer games, streaming media or in other situations where speed is an issue and some data loss may be tolerated because of the transitory nature of the data.
Often, a reliable unicast protocol is also connection oriented. For example, TCP is connection oriented, with the virtual-circuit ID consisting of source and destination IP addresses and port numbers. However, some unreliable protocols are connection oriented, such as Asynchronous Transfer Mode and Frame Relay. In addition, some connectionless protocols, such as IEEE 802.11, are reliable.
History
Building on the packet switching concepts proposed by Donald Davies, the first communication protocol on the ARPANET was a reliable packet delivery procedure to connect its hosts via the 1822 interface. A host computer simply arranged the data in the correct packet format, inserted the address of the destination host computer, and sent the message across the interface to its connected Interface Message Processor (IMP). Once the message was delivered to the destination host, an acknowledgment was delivered to the sending host. If the network could not deliver the message, the IMP would send an error message back to the sending host.
Meanwhile, the developers of CYCLADES and of ALOHAnet demonstrated that it was possible to build an effective computer network without providing reliable packet transmission. This lesson was later embraced by the designers of Ethernet.
If a network does not guarantee packet delivery, then it becomes the host's responsibility to provide reliability by detecting and retransmitting lost packets. Subsequent experience on the ARPANET indicated that the network itself could not reliably detect all packet delivery failures, and this pushed responsibility for error detection onto the sending host in any case. This led to the development of the end-to-end principle, which is one of the Internet's fundamental design principles.
Reliability properties
A reliable service is one that notifies the user if delivery fails, while an unreliable one does not notify the user if delivery fails. For example, Internet Protocol (IP) provides an unreliable service. Together, Transmission Control Protocol (TCP) and IP provide a reliable service, whereas Us
|
https://en.wikipedia.org/wiki/Unified%20Emulator%20Format
|
Unified Emulator Format (UEF) is a container format for the compressed storage of audio tapes, ROMs, floppy discs and machine state snapshots for the 8-bit range of computers manufactured by Acorn Computers. First implemented by Thomas Harte's ElectrEm emulator and related tools, it is now supported by major emulators of Acorn machines and carried by two online archives of Acorn software numbering thousands of titles.
UEF attempts to concisely reproduce media borne signals rather than simply the data represented by them, the intention being an accurate archive of original media rather than merely a capability to reproduce files stored on them. A selection of metadata can be included, such as compatibility ratings, position markers, images of packaging and the text of instruction manuals.
The Acorn machines implement the Kansas City standard (KCS) for tape data encoding and as a result the file format is suitable for creating backups of original media for several non-Acorn machines. As of version 0.10 the file format carries BASICODE signals as well.
TZX is a chunked format with similar scope for the ZX Spectrum series.
History
Before the development of the UEF, archives of Acorn computer software on the World Wide Web had adopted a convention of hosting ZIP archives of the raw files on a tape, each raw file accompanied by a sidecar file, with extension .inf, carrying the load and execution addresses from the file header. The INF convention, described and implemented by Wouter Scholten in bbcim (1995), extends the output format of the *INFO command (built into Acorn DFS and ADFS, which lists file lengths and other metadata attached to files on disc) to cover CRCs and the order of files on tape. While it works adequately for storing user files, it does not preserve the baud rate of the recording, precise timing information or the non-standard data streams used in copy protected titles.
In the case of disc-based software, it became increasingly convenient to send a sector dump of the disc instead, and by the time of the UEF's introduction the file extensions .ssd and .dsd were already established for single-sided and double-sided raw images of DFS discs, respectively. Distributed bare or in a ZIP archive, they remain popular on archive sites.
Aims
In a 2010 post to the Stardot forum, Harte explained at length his reasons for creating the format: being the first to address emulation of the Acorn Electron and its primary medium, tape, Harte wanted a fine-grained and technically optimal representation of media, compared to existing ad hoc formats; and to package the multiple media elements of a software release into a single file, so that downloading a UEF is "more like obtaining the original product". He went on to observe that it was the tools in use, and "user need", that determined the actual uses to which the UEF had been put.
Structure
A UEF file consists of a fixed length header that identifies itself, followed by a linked list of c
|
https://en.wikipedia.org/wiki/Personal%20Computer%20World
|
Personal Computer World (PCW) (February 1978 - June 2009) was the first British computer magazine.
Although for at least the last decade it contained a high proportion of Windows PC content (reflecting the state of the IT field), the magazine's title was not intended as a specific reference to this. At its inception in 1978 'personal computer' was still a generic term (the Apple II, PET 2001 and TRS-80 had been launched as personal computers in 1977.) The magazine came out before the Wintel (or IBM PC compatible) platform existed; the original IBM PC itself was introduced in 1981. Similarly, the magazine was unrelated to the Amstrad PCW.
History
PCW was founded by the Croatian-born Angelo Zgorelec in 1978, and was the first microcomputer magazine in Britain. PCW’s first cover model, in February 1978, was the Nascom-1, which also partly inspired Zgorelec to launch the magazine. Its August 1978 issue featured the colour capabilities of the Apple II.
PCW went monthly from the second edition. Zgorelec went into partnership with Felix Dennis who published his first issue in September 1979. before selling the title to VNU in 1982. The magazine was later owned by Incisive Media, which announced its closure on 8 June 2009.
As the magazine was launched four years before the first IBM PC (reviewed in the magazine in November 1981) the magazine originally covered early self-build microcomputers. It later expanded its coverage to all kinds of microcomputers from home computers to workstations, as the industry evolved. Regular features in the earlier years of the magazine were Guy Kewney's Newsprint section, Benchtests (in-depth computer reviews), Subset, covering machine code programming, type-in program listings, Bibliofile (book reviews), the Computer Answers help column, Checkouts (brief hardware reviews) TJ's Workshop (for terminal junkies), Screenplay for game reviews and Banks' Statement, the regular column from Martin Banks. In 1983 Jerry Sanders joined the staff as Features Editor and wrote the first published review of Microsoft Word 1.0 for the magazine.
The cover style, with a single photo or illustration dominating the page, was adopted soon after its launch and continued until the early 1990s. The cover photos were often humorous, such as showing each new computer made by Sinclair being used by chimpanzees, a tradition that started with the ZX81.
PCW eagerly promoted new computers as they appeared, including the BBC Micro. The magazine also sponsored the Personal Computer World Show, an annual consumer and trade fair held in London every September from 1978 to 1989.
The magazine underwent a major reader marketing push in 1992, resulting in its circulation figure rising from a middle-ranking 80,000 to more than 155,000 at a time when personal computing was becoming hugely popular thanks to Windows 3.1 and IBM PC clones flooding the market. PCW battled with rivals Computer Shopper, PC Direct, PC Magazine and PC Pro for several thousand pag
|
https://en.wikipedia.org/wiki/Wire%20protocol
|
In computer networking, a wire protocol refers to a way of getting data from point to point: A wire protocol is needed if more than one application has to interoperate. It generally refers to communication protocols higher than the physical layer. In contrast to transport protocols at the transport level (like TCP or UDP), the term wire protocol is used to describe a common way to exchange information at the application level. It refers to an application layer protocol and defines all the required attributes for the data exchange, like data types (units of data, message formats, etc.), communication endpoints and capabilities (such as delivery guarantees, direction of communication, etc.). Usually, the data is represented at the application level as a common infoset (e.g. XML, JSON, YAML) and requires a mechanism of data binding (using e.g. a common encoding scheme like XSD).
The wire protocol may be either text-based or a binary protocol. Although an important architectural decision, this is a separate matter from the distinction between wire protocols and programmatic APIs.
In electronics, a wire protocol is the mechanism used to transmit data from one point to another.
Functionality
A wire protocol provides the means for the interoperation of one or more applications in a network. They often refer to distributed object protocols, or they use applications that were designed to work together. As the name suggests, these distributed object protocols run in different processes in one or several computers that are connected over a network.
Types
Wire protocols provide the means for a program running under one operating system to communicate with a program running under some other operating system over a network such as an organization's intranet or the Internet. The protocol thus interconnects multiple platforms. Some wire protocols are language-independent, allowing the communication of programs written in different programming languages.
Examples of wire protocols include:
IIOP for CORBA
RTPS for DDS
Java Debug Wire Protocol (JDWP) for Java debugging
JRMP for RMI
SOAP for Web services
AMQP for message-oriented middleware
PostgreSQL wire protocol
See also
Line code
References
Application layer protocols
|
https://en.wikipedia.org/wiki/PyPy
|
PyPy () is an implementation of the Python programming language. PyPy often runs faster than the standard implementation CPython because PyPy uses a just-in-time compiler. Most Python code runs well on PyPy except for code that depends on CPython extensions, which either does not work or incurs some overhead when run in PyPy. Internally, PyPy uses a technique known as meta-tracing, which transforms an interpreter into a tracing just-in-time compiler. Since interpreters are usually easier to write than compilers, but run slower, this technique can make it easier to produce efficient implementations of programming languages. PyPy's meta-tracing toolchain is called RPython.
PyPy does not have full compatibility with more recent versions of the CPython ecosystem. While it claims compatibility with Python 2.7, 3.7, 3.8 and 3.9 ("a drop-in replacement for CPython"), it lacks some of the newer features and syntax in Python 3.10, such as syntax for pattern matching.
Details and motivation
PyPy aims to provide a common translation and support framework for producing implementations of dynamic languages, emphasizing a clean separation between language specification and implementation aspects. It also aims to provide a compliant, flexible and fast implementation of the Python programming language using the above framework to enable new advanced features without having to encode low-level details into it.
RPython
The PyPy interpreter itself is written in a restricted subset of Python called RPython (Restricted Python). RPython puts some constraints on the Python language such that a variable's type can be inferred at compile time.
The PyPy project has developed a toolchain that analyzes RPython code and translates it into a form of byte code, which can be lowered into C. There used to be other backends in addition to C: Java, C#, and Javascript, but those suffered from bitrot and have been removed. Thus, the recursive logo of PyPy is a snake swallowing itself since the RPython is translated by a Python interpreter. The code can also be run untranslated for testing and analysis, which provides a nice test-bed for research into dynamic languages.
It allows for pluggable garbage collectors, as well as optionally enabling Stackless Python features. Finally, it includes a just-in-time (JIT) generator that builds a just-in-time compiler into the interpreter, given a few annotations in the interpreter source code. The generated JIT compiler is a tracing JIT.
RPython is now also used to write non-Python language implementations, such as Pixie.
Project status
PyPy as of version 7.3.7 is compatible with three CPython versions: 2.7, 3.7 and 3.8. The first PyPy version compatible with CPython v3 is PyPy v2.3.1 (2014). The PyPy interpreter compatible with CPython v3 is also known as PyPy3.
PyPy has JIT compilation support on 32-bit/64-bit x86 and 32-bit/64-bit ARM processors. It is tested nightly on Windows, Linux, OpenBSD and Mac OS X. PyPy is able to run pure P
|
https://en.wikipedia.org/wiki/DAAS
|
DAAS, DaaS or Daas may refer to:
Data as a Service (DaaS), a model of delivering dynamic data
Desktop as a service (DaaS): "desktop" virtualization in computing
Daas (2005 film), an Indian Tamil-language romantic film
Daas (2011 film), a Polish film
Dad's Army Appreciation Society
The Doug Anthony All Stars (stylized as D⋆A†A☭S), an Australian musical comedy group (1984–1994, 2014–present)
Ain Arnat Airport (ICAO: DAAS) in Algeria
The Arabic acronym for Islamic State of Iraq and the Levant
Dismissive avoidant attachment style
See also
Dass (disambiguation)
Das (disambiguation)
Dasa (disambiguation)
|
https://en.wikipedia.org/wiki/WVRC%20Media
|
WVRC Media is a media corporation comprising radio stations and two radio networks based in the state of West Virginia. The company was known as the West Virginia Radio Corporation prior to a December 2021 rebranding.
The company is controlled by Greer Industries and its owners, the Raese family.
It was founded by Herbert and Agnes Greer, who signed on WAJR in 1940. Since 1972, John Raese and his two brothers have controlled the company; they are Herbert and Agnes' grandsons.
Radio markets
WVRC Media owns stations in seven separate areas in the state of West Virginia:
Charleston
Morgantown-Clarksburg-Fairmont
Elkins-Buckhannon-Weston
Cumberland-Keyser
Beckley
Martinsburg
Berkeley Springs
West Virginia MetroNews
WVRC Media owns and operates the West Virginia MetroNews Network. The network features 63 affiliates covering all 55 counties in West Virginia.
Stations owned by WVRC Media
Charleston
Morgantown-Clarksburg-Fairmont
Elkins-Buckhannon-Weston
Keyser-Cumberland
Beckley-Oak Hill
Martinsburg
Berkeley Springs
References
External links
Official Website of West Virginia Radio Corporation
West Virginia MetroNews
Privately held companies based in West Virginia
Radio broadcasting companies of the United States
Companies based in Morgantown, West Virginia
American companies established in 1940
1940 establishments in West Virginia
|
https://en.wikipedia.org/wiki/SFF
|
SFF can refer to:
Computing
Small form factor (desktop and motherboard), a term covering smaller-than traditional form factors for computer components
Standard flowgram format, a file generated by a 454 sequencing machine
Events
Sarajevo Film Festival, a premier annual film festival in the Balkans
Singapore Fireworks Festival
Sydney Film Festival
Military
Special Field Force, a Namibian paramilitary police unit
Special Frontier Force, an Indian paramilitary special force
Organizations and enterprises
The NYSE stock symbol for Santa Fe Energy
Science Festival Foundation
Shooters, Fishers and Farmers Party, an Australian political party
Small Form Factor Committee, a computer industry standards organization that creates standards for computer data storage systems (not related to SFF motherboards and cases)
Small Form Factor Special Interest Group, a computer industry standards organization that maintains standards for SFF motherboards and cases
Space Frontier Foundation, a space advocacy non-profit organization
Sports
Seychelles Football Federation
Somali Football Federation
Split-finger fastball, a pitch in baseball
Other uses
Felts Field (IATA: SFF), a public airport near Spokane, Washington
Safe failure fraction
Self forging fragment (see explosively formed penetrator), a type of shaped charge
SF&F, an acronym for science fiction and fantasy
Solid freeform fabrication
Spiritual Frontiers Fellowship
Subito fortissimo, a dynamic marking in music
See also
Small form factor (disambiguation)
|
https://en.wikipedia.org/wiki/StarStruck%20Kids
|
StarStruck Kids is the junior season of StarStruck, is a 2004 Philippine television reality talent competition show, was broadcast on GMA Network. Hosted by Jolina Magdangal, the segment hosts are the 14 finalists of StarStruck season 1: Mark Herras, Jennylyn Mercado, Rainier Castillo, Yasmien Kurdi, Nadine Samonte, Dion Ignacio, Christian Esteban, Katrina Halili, Tyron Perez, Sheena Halili, Jade Lopez, Anton dela Paz, Cristine Reyes and Alvin Aragon, all of whom serve as the junior hopefuls as they go through every phase of the competition. It premiered on March 20, 2004, replacing Search for a Star. The council was composed of Christopher de Leon, Janice de Belen and Aiza Seguerra. The season ended with 72 episodes on June 26, 2004, having Kurt Perez and Sam Bumatay as the junior Ultimate Survivors. It was replaced by Pinoy Pop Superstar in its timeslot.
Overview
The junior spin-off season of StarStruck was first announced by the hosts Dingdong Dantes and Nancy Castiglione after the season finale. This was an offshoot of the successful senior season, also announced on GMA Network program SOP, where the hosts invited kids from 5 to 7 years old to audition for the upcoming season. Most of the auditions were held at the GMA Network's headquarters and at SM Supermalls throughout the Philippines.
The pilot episode was aired on March 20, 2004. Like the senior version, the same rules were applied in selecting the Ultimate Survivors. This junior version of StarStruck is shown only on weekdays; Mondays to Thursdays would be tests and Fridays would be the elimination night. It became an emotional journey for the kids who had to leave the show. Nonetheless, they thoroughly enjoyed the workshops. The show held its the Final Judgment on June 26, 2004, at the Aliw Theater.
Selection process
In the spin-off year of the reality-talent search, out of hundreds who auditioned nationwide, only the top 100 were chosen for the first cut. From the top 100, it was trimmed down to the top 60, then to the top 30, and at last to the final 14 finalists.
The Final 14K underwent various workshops and training in order to develop their personalities, talents, and charisma. Every week, one or two hopefuls from the junior final 14 may have to say goodbye until only four remain. Those who were eliminated were dubbed as the juniors StarStruck Avengers.
The Final 4K will vie for the coveted the junior Ultimate Survivors titles, the juniors Ultimate Male Survivor and Ultimate Female Survivor, both of them would receive P1,000,000 pesos each plus an exclusive management contract from GMA Network.
The juniors Runners-up, both of them would receive P100,000 pesos each plus an exclusive management contract from the network. The juniors StarStruck Avengers (the losing contestants) also received an exclusive contract from the network.
Hopefuls
When the juniors Final 14K was chosen, they are assigned to different challenges every week that will show their acting, singing, and dan
|
https://en.wikipedia.org/wiki/CBC%20Radio%20Overnight
|
CBC Radio Overnight is a Canadian radio programming block, which airs nightly on CBC Radio One from 1:00 a.m. to 5:30 am (or 6:00 a.m., depending on the station). The program airs only on CBC Radio One's regional outlets; it does not air on the nationwide Sirius XM service.
The program, hosted by Jeff Goodes, presents a variety of information programs from international broadcasters around the world. At the top of each hour, a regular CBC news update is aired, lasting four and a half minutes. Previous hosts of the program included Cathy Haag, Bernie MacNamee, and Pep Philpott. However, apart from the news updates, the program's content consists primarily of complete programs produced by the CBC or other public broadcasters; the host's main role is to voice interstitial announcements of the next program coming to air.
History
The program premiered on May 1, 1995, with its programs sourced from the new World Radio Network. Prior to the program's launch, CBC Radio One signed off during the overnight hours. It had briefly experimented with a 24-hour schedule beginning in January 1991, with overnight programming consisting of repeats of its daytime programming, but this was discontinued by June of that year.
CBC Radio Overnight may, however, be preempted in some markets when the CBC needs to temporarily shut down a local transmitter for maintenance, as overnight transmitter repairs are less disruptive than a daytime shutdown.
Programming
Broadcasters whose programming has aired on Overnight included Radio Netherlands Worldwide, Radio Sweden, Radio Australia, Radio Prague, BBC World Service, Deutsche Welle, Radio Poland, Radio Romania International, and KBS World Radio.
On October 27, 2009, CBC changed the program's schedule, with all programming on weeknights coming from the BBC World Service and Radio Canada International; with the dissolution of Radio Canada International in 2012, The Link was replaced with Public Radio International's The World and a repeat airing of the previous day's edition of CBC Radio's morning show The Current. In 2013, the program added content from Monocle 24. The remainder of the block is filled with programs from Australia's ABC Radio National and the BBC World Service; some programming from RTÉ Radio 1 and Deutsche Welle also airs on weekends.
References
CBC Radio One programs
Canadian talk radio programs
1995 radio programme debuts
1990s Canadian radio programs
2000s Canadian radio programs
2010s Canadian radio programs
2020s Canadian radio programs
|
https://en.wikipedia.org/wiki/Chris%20Bombolas
|
Chris Bombolas (born 12 May 1960) (often known as Bomber) is a communications and media specialist, and a television and radio presenter. A former sports reporter for 21 years with the Nine Network in Brisbane. A former Australian politician, he served for one term as the Labor member for Chatsworth in the Legislative Assembly of Queensland from 2006 to 2009.
Bombolas was born in Newcastle, New South Wales. Whilst working for the Qld Police Dept he graduated from the Queensland University of Technology with a Bachelor of Business degree in Communications. He became a radio host and worked for 4BC, 4BK and Triple M, before joining the Channel Nine as a sports presenter.
In July 2006, Bombolas believed he could "make a difference in my community", and announced his intention to run for the Labor in the seat of Chatsworth in the 2006 election. Bombolas won the seat against the incumbent member Michael Caltabiano of the Liberal Party.
On 9 July 2007, Bombolas became Parliamentary Secretary for the Minister for Sport and Local Government, Andrew Fraser. Bombolas announced on 19 February 2009 that he would not contest the 2009 state election.
In June 2009, Bombolas became the Chairman of the A-league football club Brisbane Roar. His controversial decision to replace coach Frank Farina with Ange Postecoglou saw the Brisbane Roar win the record for the longest unbeaten run at the top level of any Australian football code, which stands at 36 league matches without defeat.[3] Brisbane Roar are also the first and only club to win back to back A-League Championships.[4]
In 2012, Bombolas was asked to join Hancock Coal/GVK as their External Affairs Advisor (Media & Corporate Communications Advisor).
He now works as a freelance Media and Communications Specialist, plus is a qualified Auctioneer.
References
1960 births
Living people
Australian Labor Party members of the Parliament of Queensland
Australian television presenters
Australian auctioneers
Australian people of Greek descent
Politicians from Brisbane
Politicians from Newcastle, New South Wales
Australian reporters and correspondents
Queensland University of Technology alumni
People educated at Brisbane State High School
21st-century Australian politicians
|
https://en.wikipedia.org/wiki/CJDC-TV
|
CJDC-TV (analogue channel 5) is a television station in Dawson Creek, British Columbia, Canada, airing CTV 2 programming. Owned and operated by Bell Media, it is part of the Great West Television system. CJDC-TV's studios are located on 102 Avenue and 9 Street in Dawson Creek, and its transmitter is located near 233 Road in Peace River.
History
CJDC first went on the air on January 15, 1959, and was originally owned by Mega Communications, the owner of CJDC radio. It was the Michaud family that introduced radio and television to the BC Peace River region. Henry and Mike Michaud, also known as Mike Laverne, started the station in 1959. Before CJDC-TV went to air Mike Laverne went to Toronto to visit advertising agencies and hire a news editor to run the radio and television news services. Mike was successful in getting some new national ads for CJDC-TV and hired Australian-born Val Wake as the first news editor of the station's newscast. At the start the only visuals used by the newscast were 35mm transparencies.
The station was originally part of a two-station "sub-network" called Northern Television (NTV) since the early 1990s, until 2002, when it was disbanded and re-launched as Great West Television (joined by CKPG-TV). NTV and GWTV's programming consisted of mainly American shows imported and aired on CHUM Limited's NewNet/A-Channel stations, mixed with CBC's own programming. Great West Television itself would later become virtually non-existent in October 2006, when the CBC expanded its programming schedule to 24 hours a day and the GWTV affiliates accordingly dropped all syndicated programming to accommodate the new CBC schedule, leaving only local news as the remaining parts of GWTV.
CJDC was owned by Standard Broadcasting from 2002 until the fall of 2007, when Astral Media acquired most of the company's assets.
On March 16, 2012, it was announced Bell Canada would be acquiring Astral Media for $3.38 billion. However, the deal was rejected by the Canadian Radio-television and Telecommunications Commission (CRTC) that fall. Bell submitted a revised takeover proposal in 2013, in which it will sell off a number of assets but keep CJDC. Bell has committed to maintaining the station's current conditions of license, including CBC affiliation, until the end of its license term in 2017. Bell owns two networks of its own, CTV and CTV 2, which compete with CBC. The deal was approved by the Competition Bureau in March 2013, and by the CRTC in June 2013.
On October 28, 2015, the CRTC made public an application by Bell to disaffiliate CJDC from CBC Television effective February 22, 2016, switching to CTV 2. Bell and the CBC agreed to an early termination of CJDC's affiliation agreement on October 5. Any TV service providers serving the region and not already carrying a CBC Television owned-and-operated station such as CBUT Vancouver (or potentially CBXT or CBRT from Alberta, in light of Dawson Creek being on Mountain Time) on their basic services
|
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Minnesota
|
The following is a list of FCC-licensed radio stations in the U.S. state of Minnesota, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
Beat Radio
KBJI-LP
KDXL
KFMX
KFNK
KLBB
KMAP
KPNP
KQEP-LP
KQRB
KQSP
KSJU
KYEJ-LP
WCAL
WEEP
References
Minnesota
Radio
|
https://en.wikipedia.org/wiki/48%20Hours%20%28TV%20program%29
|
48 Hours is an American documentary/news magazine television show broadcast on CBS. The show has been broadcast on the network since January 19, 1988 in the United States. The show airs Saturdays at 10:00 p.m. Eastern and Pacific Time, as part of the network's placeholder Crimetime Saturday block; as such, it is currently one of only two remaining first-run prime time shows (excluding sports) airing Saturday nights on the major U.S. broadcast television networks (along with Univision's Sabadazo). The show sometimes airs two-hour editions or two consecutive one-hour editions, depending on the subject involved or to serve as counterprogramming against other networks. Judy Tygard was named senior executive producer in January 2019, replacing Susan Zirinsky, who served as executive producer since 1996 until her early 2019 appointment as president of CBS News.
Reruns of 48 Hours are regularly broadcast on Investigation Discovery, the Oprah Winfrey Network and TLC as part of their daytime and/or weekend schedules, with varying titles based on the edition's subject matter (such as 48 Hours Hard Evidence, 48 Hours Investigates (a title that has also been used for the CBS broadcasts), 48 Hours on OWN or 48 Hours on ID).
Format
Original format
The program was created by former CBS News president Howard Stringer. It drew its title, inspiration and original format from the CBS News documentary 48 Hours on Crack Street, which aired in September 1986, centering on the drug crisis plaguing a number of U.S. neighborhoods. Like the original documentary, the program originally focused on showing events occurring within a 48-hour time span; this format was eventually phased out by the early 1990s.
One of the contributors to that program, CBS News correspondent Harold Dow, had been a member of the 48 Hours on-air staff since its premiere. Dan Rather, at the time also serving as anchor of the CBS Evening News, was the primary host of 48 Hours for its first 14 years on the air. In 1997, CBS aired a special episode of 48 Hours titled Property of 48 Hours, which focused on some of the stories over the program's first nine years.
After low ratings on Saturday nights, the show was moved to Wednesday nights, replacing the comedies Lenny and Doctor Doctor, and it was soon to be moved to the 10:00 p.m. slot.
Current format
In the mid-2000s, the program transitioned into its current format, originally known as 48 Hours Mystery although it has since reverted to its original title, which mainly presents "true crime" documentaries. On nights except Sundays where live primetime breaking news coverage from CBS News occurs, the timeslot of that coverage is branded as a special edition of 48 Hours, but is not part of the Saturday program's yearly ratings average and has little to no involvement from dedicated members of the 48 Hours production and on-air staff.
In 2009, the program featured interviews with Jodi Arias concerning the murder of her former boyfriend, Travis Alex
|
https://en.wikipedia.org/wiki/FedEx%20furniture
|
FedEx furniture is the artistic creation of computer programmer and creative consumer Jose Avila, III. In June 2005, Avila created a website, Fedexfurniture.com, to display photographs of a couch, bed, dining room table, and desk that he had constructed out of cartons obtained from overnight shipping giant FedEx Corporation (FedEx). FedEx attorneys used the takedown provisions of the Digital Millennium Copyright Act (DMCA) to force Avila's ISP to take the site offline, accusing Avila of infringing on FedEx's copyrights and trademarks, breaching his contract with FedEx by using the cartons for purposes other than shipping, and potentially misleading consumers into believing that FedEx approved or endorsed Avila's actions. Among attorneys and activist organizations concerned with the exercise of First Amendment rights on the Internet, FedEx's actions raised questions about the constitutionality of using the DMCA to censor unwanted speech. The Fedexfurniture.com website is down as of July 8th, 2017.
The story
In 2005, Avila moved to Tempe, Arizona with nothing more than clothes and work essentials. He was still stuck in a lease on his California apartment, and could barely afford his new apartment in Arizona.
After a bit of frustration over not having furniture, Avila remembered that a former roommate had solved a similar problem by constructing furniture using FedEx cartons. Using hundreds of FedEx boxes and materials that he "already had lying around" for shipping various items, Avila constructed every piece of furniture in his apartment. Avila's designs were sturdy and attractive. Friends urged Avila to put pictures of the furniture on a Web site. According to Avila, he did so in order to show that trying financial circumstances need not lead to despair; one can respond creatively, even artistically, by using "found" materials. The site's message was "It's OK to be ghetto".
The site subsequently attracted widespread attention, both from Web surfers and the press. Because the site was getting so much traffic, Avila placed a PayPal donation link on the page and asked for help to pay for the bandwidth charges. He also announced a plan to sell Fedexfurniture.com T-shirts, although Avila says that no T-shirts were ever sold.
On June 27, 2005, FedEx attorneys wrote to Avila's ISP. Citing the takedown provisions of the Digital Millennium Copyright Act (DMCA), they demanded that the ISP remove Avila's materials from the Web. They justified their request on two grounds:
Infringement of FedEx's intellectual property (specifically, copyrights and trademarks.)
Violation of FedEx's terms of use for packaging supplies.
In order to take advantage of the safe harbor provisions of the DMCA, Avila's ISP complied with the request and removed Avila's materials from the Web. Had the ISP not done so, it could have been held liable for contributory infringement (aiding and abetting the infringer) if Avila's materials were subsequently found to be infringing
|
https://en.wikipedia.org/wiki/Location%20information%20server
|
The location information server, or LIS is a network node originally defined in the National Emergency Number Association i2 network architecture that addresses the intermediate solution for providing e911 service for users of VoIP telephony. The LIS is the node that determines the location of the VoIP terminal.
Beyond the NENA architecture and VoIP, the LIS is capable of providing location information to any IP device within its served access network.
The role of the LIS
Distributed systems for locating people and equipment will be at the heart of tomorrow's active offices. Computer and communications systems continue to proliferate in the office and home. Systems are varied and complex, involving wireless networks and mobile computers. However, systems are underused because the choices of control mechanisms and application interfaces are too diverse. It is therefore pertinent to consider which mechanisms might allow the user to manipulate systems in simple and ubiquitous ways, and how computers can be made more aware of the facilities in their surroundings. Knowledge of the location of people and equipment within an organization is such a mechanism. Annotating a resource database with location information allows location-based heuristics for control and interaction to be constructed. This approach is particularly attractive because location techniques can be devised that are physically unobtrusive and do not rely on explicit user action. The article describes the technology of a system for locating people and equipment, and the design of a distributed system service supporting access to that information. The application interfaces made possible by or that benefit from this facility are presented
Location determination
The method used to determine the location of a device in an access network varies between the different types of networks. For a wired network, such as Ethernet or DSL a wiremap method is common. In wiremap location determination, the location of a device is determined by finding which cables are used to send packets to the device. This involves tracing data through aggregation points in the network (such as Ethernet switches, or DSL access nodes) and finding the port that packets for that device are sent to. This information is combined with data available to the LIS (usually extracted from a database) to determine a final location. How this tracing is done then depends on the type of network.
In wireless networks, a range of technologies can be applied to location determination, the most basic of which uses the location of the radio transmitter as an approximation. The actual method applied is similar to the wiremap method, if a radio transmitter can be identified, then the location of the device can be given as the position of the transmitter with a region of uncertainty.
Architecture and protocols
The IETF has defined an architecture and protocols for acquiring location information from a LIS. A LIS in the im
|
https://en.wikipedia.org/wiki/Southport%20railway%20station
|
Southport railway station serves the town of Southport, Merseyside, England. The station is the terminal of the Southport branch of the Northern Line of the electric Merseyrail network and the diesel-operated Manchester-Southport Line. It is the fourth busiest station on the Merseyrail network. The station and services to Liverpool and are operated by Merseyrail, with Manchester services operated by Northern Trains.
History
The Liverpool line was originally built in 1848 by the Liverpool, Crosby and Southport Railway to a temporary station at Eastbank Street, about half a mile short of the current terminus. The current station opened as Southport Chapel Street on 22 August 1851 and became the terminus for all trains in 1857, when passenger services were transferred from the adjacent .
From 1882 the West Lancashire Railway to Preston Fishergate Hill operated from Southport Derby Road (later known as Southport Central) outside Chapel Street Station.
In 1884, another line from Southport to Liverpool opened: the Cheshire Lines Committee's (CLC) North Liverpool Extension Line from Liverpool Central to Southport Lord Street. The West Lancashire Railway sponsored the Liverpool, Southport and Preston Junction Railway to provide a connection to the CLC line, joining it at . These lines ultimately proved uncompetitive, however, and the Southport services were withdrawn in January 1952.
In July 1897, both the West Lancashire and the Liverpool, Southport and Preston Junction Railways were absorbed into the Lancashire and Yorkshire Railway (L&Y). The L&Y had a large terminus at Southport Chapel Street and could see no sense in operating two termini at very close proximity. On 1 May 1901, the L&Y completed a remodelling of the approach lines to Southport Central to allow trains to divert onto the Manchester to Southport line and into Southport Chapel Street Station. Southport Central was closed to passengers, and it became a goods depot, eventually amalgamating with Chapel Street depot. It survived intact well into the 1970s. In 1904, the line from Liverpool was electrified by the L&YR, which also extended the third rail out as far as Crossens on the WLR line to Preston that year and out to in 1909.
The Preston line was closed to passengers on 7 September 1964, although a small section to Hesketh Park station was used for freight until 1967. This line had its electric local services to Crossens and its through steam services withdrawn on consecutive days immediately before the official closure date - the only such route to suffer that fate during the Beeching-era closures. Nowadays, the towns of Southport and Preston are linked only by the (largely dual-carriageway) A565 and A59 roads.
At its largest, Chapel Street station had eleven regular platforms and two excursion platforms. Now six truncated platforms are in use (platforms 1-3 for Liverpool trains & 4-6 for Manchester), the rest having been demolished and the land used for car parking. In 1970
|
https://en.wikipedia.org/wiki/Weekend%20Sunrise
|
Weekend Sunrise is an Australian breakfast television program, broadcast on the Seven Network and currently hosted by Monique Wright and Matt Doran.
History
In 2005 the Seven Network replaced its struggling Sunday morning program Sunday Sunrise with a program called Weekend Sunrise, as an extension of the weekday brand. It originally was an hour-long (8 am – 9 am). Hosted by Chris Reason and Lisa Wilkinson, the program was successful and various critiques at the time called for the program to be lengthened to two hours (7:00 am – 9:00 am) and be extended to Saturday mornings as well as Sunday. Head of Morning TV’s Adam Boland’s intention was always to have the show across both days (hence the name), but news boss Peter Meakin talked him into just starting with Sundays given families usually were out doing sport on Saturdays.
In 2006, Weekend Sunrise was extended from an hour to a two-hour show, running every Sunday from 8 am till 10 am. When Sportsworld returned for the football season Weekend Sunrise settled into a 90-minute format, 8:00 am – 9:30 am. After Sportsworld's series concluded, the show returned to a two-hour format. Andrew O'Keefe initially temporarily replaced host Chris Reason in 2006, but after improved ratings he was given the hosting position permanently. In 2007, Wilkinson moved to the Nine Network to host Today, and was replaced by Samantha Armytage. In 2008, Weekend Sunrise moved their start time 30 minutes earlier to 7:30 am, to match the new start time of Nine's Sunday program. The program continued to run through to 10:00 am, meaning the program had a two-and-a-half-hour running time.
In 2009, the program's start time was moved even earlier. Originally, it was announced that Today on Sunday (now Weekend Today), the replacement the long-running Nine's Sunday, would run from 7:30 to 9:00 am. But this was changed on 28 January 2009 to 7:00 am to 9:00 am. As result, Seven announced that Weekend Sunrise would also commence at 7:00 am and run through to 10:00 am, meaning the program would go for three hours, the same as the weekday version of Sunrise.
On 13 February 2010, Boland got his wish as Seven announced that Weekend Sunrise would extend to Saturdays to compete against Weekend Today. The Saturday edition airs in the same time slot as Weekend Today, i.e. 7:00 am – 10:00 am. Saturday Disney, which previously occupied the timeslot, immediately followed Weekend Sunrise, until in 2012 it was permanently moved to 7Two, airing in the same time as Weekend Sunrise. The original Saturday team consisted of Samantha Armytage co-hosting with Larry Emdur with Sarah Cumming presenting the news, Simon Reeve presenting sport and James Tobin presenting the weather.
In November 2011, Adam Boland was appointed executive producer of the program. Boland overhauled the program introducing a new format, a number of new segments and new regulars. These changes were scheduled to introduced on 5 November 2011, however due an apparent server cra
|
https://en.wikipedia.org/wiki/NCST
|
NCST may refer to:
National Community Stabilization Trust in the United States
National Centre for Software Technology in India, now Centre for Development of Advanced Computing (C-DAC)
National College of Science and Technology in the Philippines
New Castle School of Trades in the United States
National Construction Safety Team in the United States, fielded as needed by NIST
National Commission for Scheduled Tribes in India
|
https://en.wikipedia.org/wiki/Inter-working%20function
|
The inter-working function (IWF) is a method for interfacing a wireless telecommunication network with the public switched telephone network (PSTN). The IWF converts the data transmitted over the air interface into a format suitable for the PSTN.
IWF contains both the hardware and software elements that provide the rate adaptation and protocol conversion between PSTN and the wireless network.
Some systems require more IWF capability than others, depending on the network which is being connected. The IWF also incorporates a "modem bank", which may be used when, for example, the GSM data terminal equipment (DTE) exchanges data with a land DTE connected via analogue modem
The IWF provides the function to enable the GSM system to interface with the various
forms of public and private data networks currently available.
The basic features of the IWF are:
Data rate adaption
Protocol conversion
References
Wireless networking
Telephony
|
https://en.wikipedia.org/wiki/Traversal%20Using%20Relays%20around%20NAT
|
Traversal Using Relays around NAT (TURN) is a protocol that assists in traversal of network address translators (NAT) or firewalls for multimedia applications. It may be used with the Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). It is most useful for clients on networks masqueraded by symmetric NAT devices. TURN does not aid in running servers on well known ports in the private network through a NAT; it supports the connection of a user behind a NAT to only a single peer, as in telephony, for example.
TURN is specified by . The TURN URI scheme is documented in .
Introduction
Network address translation (NAT), a mechanism that serves as a measure to mitigate the issue of IPv4 address exhaustion during the transition to IPv6, is accompanied by various limitations. The most troublesome among these limitations is the fact that NAT breaks many existing IP applications, and makes it more difficult to deploy new ones. Guidelines have been developed that describe how to build "NAT friendly" protocols, but many protocols simply cannot be constructed according to those guidelines. Examples of such protocols include multimedia applications and file sharing.
Session Traversal Utilities for NAT (STUN) provides one way for an application to traverse a NAT. STUN allows a client to obtain a transport address (an IP address and port) which may be useful for receiving packets from a peer. However, addresses obtained by STUN may not be usable by all peers. Those addresses work depending on the topological conditions of the network. Therefore, STUN by itself cannot provide a complete solution for NAT traversal.
A complete solution requires a means by which a client can obtain a transport address from which it can receive media from any peer which can send packets to the public Internet. This can only be accomplished by relaying data through a server that resides on the public Internet. Traversal Using Relays around NAT (TURN) is a protocol that allows a client to obtain IP addresses and ports from such a relay.
Although TURN almost always provides connectivity to a client, it is resource intensive for the provider of the TURN server. It is therefore desirable to use TURN as a last resort only, preferring other mechanisms (such as STUN or direct connectivity) when possible. To accomplish that, the Interactive Connectivity Establishment (ICE) methodology can be used to discover the optimal means of connectivity.
Protocol
The process begins when a client computer wants to contact a peer computer for a data transaction, but cannot do so due to both client and peer being behind respective NATs. If STUN is not an option because one of the NATs is a symmetric NAT (a type of NAT known to be non-STUN compatible), TURN must be used.
First, the client contacts a TURN server with an "Allocate" request. The Allocate request asks the TURN server to allocate some of its resources for the client so that it may contact a peer. If allocation is possib
|
https://en.wikipedia.org/wiki/France%20Info%20%28radio%20network%29
|
France Info () is a radio network operated by the French public service radio broadcaster Radio France. It provides continuous live news and information.
Broadcasting on FM (as well as being streamed on the internet), France Info is receivable across France and audible too in the border regions of neighbouring countries, including southern parts of the United Kingdom, especially the southeastern coastal region of England.
History
France Info was founded in 1987 by Roland Faure and Jérôme Bellay. Year on year its audience has grown, notably after the social conflicts of 1995, 2003, and 2006. It is frequently estimated to be the fourth largest French radio network in terms of listener numbers, after RTL, NRJ and France Inter.
France Info has offices in Paris, Lyon, Marseille, and Toulouse, and also makes use of local-news input from the France Bleu network.
Journalists and presenters
David Abiker
Sophie Auvigne
Matthieu Beauval
Gilbert Chevalier
Jérôme Colombain
Olivier de Lagarde
Raphaëlle Duchemin
Olivier Émond
Jean-Pierre Gauffre
Anne-Élisabeth Lemoine
Chloé Leprince
Jean Leymarie (journalist)
Marie-Ève Malouines
Marie-Odile Monchicourt
Benjamin Muller
Grégory Philipps
Richard Place
Catherine Pottier
Bernard Thomasson
Philippe Vandel
Frequencies
FM
Main transmitters:
Bar-le-Duc (Willeroncourt) 104.5 MHz
Bastia (Serra di Pigno) 105.5 MHz
Bayonne (La Rhune) 105.5 MHz
Charleville-Mézières (Sury) 105.9 MHz
Clermont-Ferrand (Puy-de-Dôme) 105.5 MHz
Le Mans (Mayet) 105.5 MHz
Lille (Bouvigny le Mont) 105.2 MHz
Lyon (Mont Pilat) 103.4 MHz
Marseille (Petite Étoile) 105.3 MHz
Metz (Luttange) 106.8 MHz
Mulhouse (Belvédère) 105.5 MHz
Nice (Mont Chauve) 105.7 MHz
Paris (Tour Eiffel) 105.5 MHz
Perpignan (Pic de Neulos) 105.1 MHz
Reims (TDF Hautvillers) 105.5 MHz
Strasbourg (TDF Nordheim) 104.4 MHz
Vannes (Moustoir-Ac) 105.5 MHz
Former mediumwave frequencies
These frequencies were de-activated at midnight local time on the night of 31 December 2015, except for Lyon and Rennes: Rennes transmitter continued to broadcast until 2 January 2016 0900 UTC, while Lyon continued to broadcast until midnight on 4 January 2016, for the Holy Mass for the sick held by Notre Dame des Ondes on Sunday 3 January.
Bayonne (Camps de Prats) 1494 kHz ; Power : 4 kW
Lyon (Tramoyes) 603 kHz ; Power : 300 kW
Bordeaux (Néac) 1206 kHz ; Power : 100 kW
Brest (Quimerc'h) 1404 kHz ; Power : 20 kW
Clermont-Ferrand (Ennezat) 1494 kHz ; Power : 20 kW
Dijon (Couternon) 1404 kHz ; Power : 5 kW
Lille (Camphin-en-Carembault) 1377 kHz ; Power : 300 kW
Marseille (Réaltor) 1242 kHz ; Power : 150 kW
Nice (Fontbonne) 1557 kHz ; Power : 150 kW
Rennes (Thourie) 711 kHz ; Power : 300 kW
Logos and symbols
References
External links
France info transmitters map
France Info
France Info live streaming in mp3
Radio France
Radio stations established in 1987
|
https://en.wikipedia.org/wiki/Formal%20specification
|
In computer science, formal specifications are mathematically based techniques whose purpose are to help with the implementation of systems and software. They are used to describe a system, to analyze its behavior, and to aid in its design by verifying key properties of interest through rigorous and effective reasoning tools. These specifications are formal in the sense that they have a syntax, their semantics fall within one domain, and they are able to be used to infer useful information.
Motivation
In each passing decade, computer systems have become increasingly more powerful and, as a result, they have become more impactful to society. Because of this, better techniques are needed to assist in the design and implementation of reliable software. Established engineering disciplines use mathematical analysis as the foundation of creating and validating product design. Formal specifications are one such way to achieve this in software engineering reliability as once predicted. Other methods such as testing are more commonly used to enhance code quality.
Uses
Given such a specification, it is possible to use formal verification techniques to demonstrate that a system design is correct with respect to its specification. This allows incorrect system designs to be revised before any major investments have been made into an actual implementation. Another approach is to use probably correct refinement steps to transform a specification into a design, which is ultimately transformed into an implementation that is correct by construction.
It is important to note that a formal specification is not an implementation, but rather it may be used to develop an implementation. Formal specifications describe what a system should do, not how the system should do it.
A good specification must have some of the following attributes: adequate, internally consistent, unambiguous, complete, satisfied, minimal
A good specification will have:
Constructability, manageability and evolvability
Usability
Communicability
Powerful and efficient analysis
One of the main reasons there is interest in formal specifications is that they will provide an ability to perform proofs on software implementations. These proofs may be used to validate a specification, verify correctness of design, or to prove that a program satisfies a specification.
Limitations
A design (or implementation) cannot ever be declared “correct” on its own. It can only ever be “correct with respect to a given specification”. Whether the formal specification correctly describes the problem to be solved is a separate issue. It is also a difficult issue to address since it ultimately concerns the problem constructing abstracted formal representations of an informal concrete problem domain, and such an abstraction step is not amenable to formal proof. However, it is possible to validate a specification by proving “challenge” theorems concerning properties that the specification is expected to exhibit. I
|
https://en.wikipedia.org/wiki/Video%20recorder%20scheduling%20code
|
VCR Plus+, G-Code, VideoPlus+ and ShowView are different names for the same scheduling system for programming VCRs and digital video recorders. These names are all registered trademarks of Macrovision, whose corporate predecessor, Gemstar, developed these algorithms for use in integrated endecs.
History
Before the advent of on-screen displays, the only interface available for programming a home video recorder was a small VFD, LED or LCD panel and a small number of buttons. Correctly setting up a recording for a specific program was therefore a somewhat complex operation for many people. G-Code, VideoPlus+ and ShowView were introduced in the late 1980s to remove this difficulty.
Concept
The central concept of the system is a unique number, a PlusCode, assigned to each program, and published in television listings in newspapers and magazines (such as TV Guide). To record a program, the code number is taken from the newspaper and input into the video recorder, which would then record on the correct channel at the correct time. The code could also be entered into a dedicated remote control device that would then control the VCR. The number is generated by an algorithm from the date, time and channel of the program; as a result, it does not rely on an over-the-air channel to serve as a conduit to ensure the recording is properly timed. This means it will not compensate for a disrupted schedule due to live sporting events or bulletins for breaking news events, however many video recorders with these systems also incorporate Programme Delivery Control (PDC) and use that to alter times if possible.
Branding
The system has been licensed to television and VCR manufacturers in about 40 countries, but is branded under different names depending on the country. It is known as VCR Plus+, VCR Plus+ Silver and VCR Plus+ Gold in the United States and Canada; G-Code in Japan, China, New Zealand and Australia; VideoPlus+ in Ireland, the United Kingdom, and Japan; and ShowView in the rest of Europe as well as in South Africa. The system is branded as VideoPlus+/ShowView in Europe due to an existing trademark registration for "VCR" by Philips in that continent, and as G-Code (the "G" standing for the system's developer Gemstar) in Japan because VCR is not a common abbreviation there ("VTR," for videotape recorder, is used instead). Japan initially used the name Video Plus+ and later changed to G-Code, an example of this is the Victor (JVC) HR-880. Because television programming schedules are different, the coding has to be adjusted in each of the regions and recording equipment is not interchangeable.
Algorithms
The actual algorithms used to encode and decode the television guide values from and to their time representations were published in 1992, but only for six-digit codes or less.
Source code for seven and eight digit codes was written in C and Perl and posted anonymously in 2003.
See also
TrueCookPlus, a similar system for microwave oven cooking
Refer
|
https://en.wikipedia.org/wiki/Stroker%20%26%20Hoop
|
Stroker & Hoop is an American adult animated television series created by Casper Kelly and Jeffrey G. Olsen for Cartoon Network's late night programming block, Adult Swim. The series is a parody of buddy cop films and television series such as Starsky & Hutch, and stars the voices of Jon Glaser as Stroker and Timothy "Speed" Levitch as Hoop. It contains the talking car element of the 1982 series Knight Rider, in "C.A.R.R.", voiced by Paul Christie. The names of the lead characters may be based on two Burt Reynolds characters, from Stroker Ace and Hooper.
Stroker and Hoop premiered on August 1, 2004, and ended on December 25, 2005, with 13 episodes.
Plot
Stroker and Hoop are a pair of private investigators from Los Angeles, who act and dress as if it is still the 1970s. Despite their individual high opinions of themselves, both men are hopelessly inept at their job. Stroker fancies himself a suave ladies' man, but is generally unpopular and perceived by virtually every woman he meets as a repulsive chauvinist; and Hoop considers himself a crime-solving ace and master of disguise, when in fact he is a gullible nerd and all of his disguises are failures. Their only "advantage" over their competition is C.A.R.R., a talking AMC Pacer with its own neurotic personality. Because of their abysmal track record and less-than-stellar capabilities, the two men eke out livings solving crimes for people who cannot afford to hire more competent detectives. Invariably, their attempts to solve a crime result in bloodshed, violence, and thousands of dollars in property damage.
A recurring plot point of the series was to take myths and fantasies (such as mind control and Santa Claus) and make them real in an otherwise ordinary setting. Stroker often doubts the existence of these occurrences.
Characters
John Strockmeyer, aka Stroker (Jon Glaser) - An ex-mattress salesman turned private investigator, Stroker is largely apathetic to his job; he only enjoys it because it allows him to shoot people, and because it brings him into contact with dozens of promiscuous women on a daily basis (Although those women usually want nothing to do with him). Although he considers himself an excellent detective and suave ladies' man, Stroker is actually a failure and a deadbeat; his wife left him and gained sole custody of their son, Keith, and Stroker's own incompetence and negligence resulted in his former partner, Jermaine, getting killed while working a case (Stroker borrowed the magazine from Jermaine's gun and forgot to tell him). Once in a while, Stroker will have a moment of being a genuine detective (such as successfully deducing the plot behind the lottery ring run by the ghosts of Christmas past (Jermaine), present and future), although these moments are incredibly rare. An incompetent detective, Stroker often meets with opportunities while on a case that would provide a more lucrative career. An advertising campaign pitched for a fabric softener was chosen over others
|
https://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter%20algorithm
|
The Steinhaus–Johnson–Trotter algorithm or Johnson–Trotter algorithm, also called plain changes, is an algorithm named after Hugo Steinhaus, Selmer M. Johnson and Hale F. Trotter that generates all of the permutations of elements. Each permutation in the sequence that it generates differs from the previous permutation by swapping two adjacent elements of the sequence. Equivalently, this algorithm finds a Hamiltonian cycle in the permutohedron.
This method was known already to 17th-century English change ringers, and calls it "perhaps the most prominent permutation enumeration algorithm". A version of the algorithm can be implemented in such a way that the average time per permutation is constant. As well as being simple and computationally efficient, this algorithm has the advantage that subsequent computations on the permutations that it generates may be sped up because of the similarity between consecutive permutations that it generates.
Algorithm
The sequence of permutations generated by the Steinhaus–Johnson–Trotter algorithm has a natural recursive structure, that can be generated by a recursive algorithm. However the actual Steinhaus–Johnson–Trotter algorithm does not use recursion, instead computing the same sequence of permutations by a simple iterative method. A later improvement allows it to run in constant average time per permutation.
Recursive structure
The sequence of permutations for a given number can be formed from the sequence of permutations for by placing the number into each possible position in each of the shorter permutations. The Steinhaus–Johnson–Trotter algorithm follows this structure: the sequence of permutations it generates consists of blocks of permutations, so that within each block the permutations agree on the ordering of the numbers from 1 to and differ only in the position of . The blocks themselves are ordered recursively, according to the Steinhaus–Johnson–Trotter algorithm for one less element.
Within each block, the positions in which is placed occur either in descending or ascending order, and the blocks alternate between these two orders: the placements of in the first block are in descending order, in the second block they are in ascending order, in the third block they are in descending order, and so on.
Thus, from the single permutation on one element,
one may place the number 2 in each possible position in descending order to form a list of two permutations on two elements,
Then, one may place the number 3 in each of three different positions for these two permutations, in descending order for the first permutation 1 2, and then in ascending order for the permutation 2 1:
The same placement pattern, alternating between descending and ascending placements of , applies for any larger value of .
In sequences of permutations with this recursive structure, each permutation differs from the previous one either by the single-position-at-a-time motion of , or by a change of two smaller numbers
|
https://en.wikipedia.org/wiki/Jump%20search
|
In computer science, a jump search or block search refers to a search algorithm for ordered lists. It works by first checking all items Lkm, where and m is the block size, until an item is found that is larger than the search key. To find the exact position of the search key in the list a linear search is performed on the sublist L[(k-1)m, km].
The optimal value of m is , where n is the length of the list L. Because both steps of the algorithm look at, at most, items the algorithm runs in O() time. This is better than a linear search, but worse than a binary search. The advantage over the latter is that a jump search only needs to jump backwards once, while a binary can jump backwards up to log n times. This can be important if jumping backwards takes significantly more time than jumping forward.
The algorithm can be modified by performing multiple levels of jump search on the sublists, before finally performing the linear search. For a k-level jump search the optimum block size ml for the l th level (counting from 1) is n(k-l)/k. The modified algorithm will perform k backward jumps and runs in O(kn1/(k+1)) time.
Implementation
algorithm JumpSearch is
input: An ordered list L, its length n and a search key s.
output: The position of s in L, or nothing if s is not in L.
a ← 0
b ← ⌊√n⌋
while Lmin(b,n)-1 < s do
a ← b
b ← b + ⌊√n⌋
if a ≥ n then
return nothing
while La < s do
a ← a + 1
if a = min(b, n)
return nothing
if La = s then
return a
else
return nothing
See also
Skip list
Interpolation search
Linear search - runs in O(n) time, only looks forward
Binary search - runs in O(log n) time, looks both forward and backward
References
Ben Shneiderman, Jump Searching: A Fast Sequential Search Technique, CACM, 21(10):831-834, October 1978.
Search algorithms
|
https://en.wikipedia.org/wiki/Happy%20New%20Year%2C%20Charlie%20Brown%21
|
Happy New Year, Charlie Brown! is the 30th prime-time animated television special based upon the popular comic strip Peanuts, by Charles M. Schulz. It aired on the CBS network on January 1, 1986. The special focuses on Charlie Brown's difficulty finishing a book report over the holidays. It was the last film made by Bernard Gruver, following his death on June 14, 1985, and it was considered to be his posthumous farewell. Another New Year's special Snoopy Presents: For Auld Lang Syne was released on Apple TV+ on December 10, 2021.
Plot
While all the kids are happy that they get time off for Christmas vacation, Charlie Brown dreads how his teacher at the last minute assigned a book report on War and Peace by Leo Tolstoy. There is one major distraction on his mind, the big New Year's party all his friends are attending, with Peppermint Patty continuously convincing him to attend. Charlie tries inviting the object of his desires, the Little Red-Haired Girl, but gets his hand caught in the mail slot. With the party on his mind, he attempts to try to find another way to write the report, even going to a bookstore to find an audiobook and computer game of it, all to no avail. While at the party, he tries to finish the book on the front porch of the house, but falls asleep and misses the clock's striking of midnight but is more devastated when Linus reveals that he ended up dancing with the Little Red-Haired Girl, who showed up after all. At the end of the special, Charlie hands his book report to the teacher and gets a D minus. Despite the poor grade, Charlie Brown is proud that he made an honest effort and avoided an outright failure. However, the teacher announces that the entire class will be made to read and report on Fyodor Dostoevsky's Crime and Punishment, overwhelming him even more.
Cast
Chad Allen as Charlie Brown
Jeremy Miller as Linus van Pelt
Melissa Guzzi as Lucy van Pelt
Kristie Baker as Peppermint Patty
Elizabeth Lyn Fraser as Sally Brown
Aron Mandelbaum as Schroeder
Jason Mendelson as Marcie
Bill Melendez as Snoopy, Woodstock
Desirée Goyette as singer ("Slow Slow Quick Quick")
Note: Franklin, the Little Red-Haired Girl, Patty, Pig-Pen, Rerun, and Violet appear but are silent.
Home media
The special was released on VHS by Kartes Video Communications in 1987 and by Paramount Home Video on September 28, 1994. Paramount would re-release the VHS in clamshell packaging on October 1, 1996. Warner Home Video released the special on DVD on October 6, 2009 as a bonus feature for the Remastered Deluxe Edition of I Want a Dog for Christmas, Charlie Brown.
It was re-released as part of the box set Snoopy's Holiday Collection on October 1, 2013.
References
External links
Peanuts television specials
Television shows directed by Bill Melendez
Television shows directed by Sam Jaimes
1986 television specials
1980s American television specials
1980s animated television specials
New Year's television specials
Television shows written by Ch
|
https://en.wikipedia.org/wiki/Sony%20Pictures%20Digital
|
Sony Pictures Digital (previously known as Columbia TriStar Interactive, Sony Pictures Interactive Network, and Sony Pictures Digital Entertainment) is a subsidiary of Sony Group Corporation. Operating under the trade name Sony Pictures Digital Productions Inc., it is currently based in Japan, and was formerly based in Culver City, California, up until 2013. Bob Osher was the president of Sony Pictures Digital before he was fired in February 2015.
It oversees the digital production and online entertainment assets of Sony Pictures, consists of Sony Pictures Mobile, Sony Pictures Digital Networks, and others. It is known as the digital website interactive creator for SPE. Sony Pictures Digital designed websites for Sony Pictures, Screen Gems Network, SoapCity, Sony Pictures Imageworks, GSN, among others for SPE.
Columbia TriStar Interactive was formed in 1994. The first official website it launched was for Johnny Mnemonic in 1995. As well as building websites for films and TV shows, it also set up the Sony Studio Store in 1998 and went into partnership with 444-FILM selling movie tickets.
In 2005, the group's name was changed appeared in 2005 to Sony Pictures Digital Sales and Marketing and encompassed all areas of interactive media creation and marketing for SPE, including gaming, mobile, websites, design and sales.
The company is registered under the trade name Sony Pictures Digital Productions Inc., though it is known as Sony Pictures Digital appeared in 2006 longer variant in the copyright on most of the Sony Pictures sites. It is currently headed by Robert Osher, President of Digital Productions, and Chief Operating Officer of Columbia TriStar Motion Picture Group, Sony Pictures Entertainment.
The company was also a co-producer along with ShadowMachine, Seth Green's Stoopid Monkey production company, Williams Street, and Cartoon Network for the show, Robot Chicken until Season 5.
It also produce games that been given by Columbia Pictures like Qbert.
Its visual effects division Sony Pictures Imageworks provides visual effects for films produced not only by the divisions of the Sony Pictures Motion Picture Group, but also by other non-SPE studios.
References
Digital
Entertainment companies based in California
Entertainment companies established in 2005
2005 establishments in California
American companies established in 2005
|
https://en.wikipedia.org/wiki/Sun%20TV
|
Sun TV may refer to:
Sun TV (India), an Indian Tamil cable television channel owned by Sun TV Network
Sun TV Network, the company that owns the Tamil television channel
Sun TV (Hong Kong), a Mandarin satellite television channel based in Hong Kong
SUN TV (Turkey), a local TV in Mersin, Turkey
Sun News Network (2011–2015), a defunct Canadian news and opinion channel, originally proposed under the name "Sun TV News Channel"
CKXT-TV (2003–2011), a defunct independent television station in Toronto, Canada which used the on-air name SUN TV
Sun Television, a television station in Hyōgo Prefecture, Japan
Sun Television and Appliances, a defunct retailer of consumer electronics
Sun Sports, a Florida sports broadcasting network
SUN TV, the former names of iNews a private terrestrial television network in Indonesia
Lemar TV (Pashto for "Sun TV"), a television station based in Kabul, Afghanistan
|
https://en.wikipedia.org/wiki/Cliff%20Jones%20%28computer%20scientist%29
|
Clifford "Cliff" B. Jones (born 1 June 1944) is a British computer scientist, specializing in research into formal methods. He undertook a late DPhil at the Oxford University Computing Laboratory (now the Oxford University Department of Computer Science) under Tony Hoare, awarded in 1981. Jones' thesis proposed an extension to Hoare logic for handling concurrent programs, rely/guarantee.
Prior to his DPhil, Jones worked for IBM, between the Hursley and Vienna Laboratories. In Vienna, Jones worked with Peter Lucas, Dines Bjørner and others on the Vienna Development Method (VDM), originally as a method for specifying the formal semantics of programming languages, and subsequently for specifying and verifying programs.
Cliff Jones was a professor at the Victoria University of Manchester in the 1980s and early 1990s, worked in industry at Harlequin for a period, and is now a Professor of Computing Science at Newcastle University. He has been editor-in-chief of the Formal Aspects of Computing journal.
As well as formal methods, Jones also has interests in interdisciplinary aspects of computer science and the history of computer science.
Books
Jones has authored and edited many books, including:
Understanding Programming Languages, Jones, C.B. Springer, Cham. Print / online (2020).
Reflections on the Work of C.A.R. Hoare, Roscoe, A.W., Jones, C.B. and Wood, K. (eds.). Springer. (2010).
VDM: Une methode rigoureuse pour le development du logiciel, Jones, C.B. Masson, Paris. (1993).
MURAL: A Formal Development Support System, Jones, C.B., Jones, K.D., Lindsay, P.A. and Moore, R. (eds.). Springer-Verlag. (1991).
Systematic Software Development using VDM (2nd Edition), Jones, C.B. Prentice Hall International Series in Computer Science, Prentice Hall. , 1990
Case Studies in Systematic Software Development, Jones, C.B. and Shaw, R.C.F. (eds.). Prentice Hall International Series in Computer Science, Prentice Hall. (1989).
Essays in Computing Science, Hoare, C.A.R. and Jones, C.B. Prentice Hall International Series in Computer Science, Prentice Hall. (1989).
Systematic Software Development using VDM, Jones, C.B. Prentice Hall International Series in Computer Science, Prentice Hall. (1986).
Programming Languages and their Definition: Selected Papers of Hans Bekic (1936–1982), Jones, C.B. (editor). Lecture Notes in Computer Science, Volume 177, Springer-Verlag. (1984).
Formal Specification and Software Development, Bjørner, D. and Jones, C.B. Prentice Hall International Series in Computer Science, Prentice Hall. (1982).
Software Development: A Rigorous Approach, Jones, C.B. Prentice Hall International Series in Computer Science, Prentice Hall. (1980).
The Vienna Development Method: The Meta-Language, Bjørner, D. and Jones, C.B. (editors). Lecture Notes in Computer Science, Volume 61, Springer-Verlag. (1978).
References
External links
Home page
1944 births
Living people
Alumni of Wolfson College, Oxford
Members of the Depart
|
https://en.wikipedia.org/wiki/Opaque%20pointer
|
In computer programming, an opaque pointer is a special case of an opaque data type, a data type declared to be a pointer to a record or data structure of some unspecified type.
Opaque pointers are present in several programming languages including Ada, C, C++, D and Modula-2.
If the language is strongly typed, programs and procedures that have no other information about an opaque pointer type T can still declare variables, arrays, and record fields of type T, assign values of that type, and compare those values for equality. However, they will not be able to de-reference such a pointer, and can only change the object's content by calling some procedure that has the missing information.
Opaque pointers are a way to hide the implementation details of an interface from ordinary clients, so that the implementation may be changed without the need to recompile the modules using it. This benefits the programmer as well since a simple interface can be created, and most details can be hidden in another file. This is important for providing binary code compatibility through different versions of a shared library, for example.
This technique is described in Design Patterns as the Bridge pattern. It is sometimes referred to as "handle classes", the "Pimpl idiom" (for "pointer to implementation idiom"), "Compiler firewall idiom", "d-pointer" or "Cheshire Cat", especially among the C++ community.
Examples
Ada
package Library_Interface is
type Handle is limited private;
-- Operations...
private
type Hidden_Implementation; -- Defined in the package body
type Handle is access Hidden_Implementation;
end Library_Interface;
The type Handle is an opaque pointer to the real implementation, that is not defined in the specification. Note that the type is not only private (to forbid the clients from accessing the type directly, and only through the operations), but also limited (to avoid the copy of the data structure, and thus preventing dangling references).
package body Library_Interface is
type Hidden_Implementation is record
... -- The actual implementation can be anything
end record;
-- Definition of the operations...
end Library_Interface;
These types are sometimes called "Taft types"—named after Tucker Taft, the main designer of Ada 95—because they were introduced in the so-called Taft Amendment to Ada 83.
C
/* obj.h */
struct obj;
/*
* The compiler considers struct obj an incomplete type. Incomplete types
* can be used in declarations.
*/
size_t obj_size(void);
void obj_setid(struct obj *, int);
int obj_getid(struct obj *);
/* obj.c */
#include "obj.h"
struct obj {
int id;
};
/*
* The caller will handle allocation.
* Provide the required information only
*/
size_t obj_size(void) {
return sizeof(struct obj);
}
void obj_setid(struct obj *o, int i) {
o->id = i;
}
int obj_getid(struct obj *o) {
return o->id;
}
This example demonstrates a way to achieve the information hiding (encaps
|
https://en.wikipedia.org/wiki/Titan%20Rain
|
Titan Rain was a series of coordinated attacks on computer systems in the United States since 2003; they were known to have been ongoing for at least three years. The attacks originated in Guangdong, China. The activity is believed to be associated with a state-sponsored advanced persistent threat. It was given the designation Titan Rain by the federal government of the United States.
Titan Rain hackers gained access to many United States defense contractor computer networks, which were targeted for their sensitive information, including those at Lockheed Martin, Sandia National Laboratories, Redstone Arsenal, and NASA.
Attackers
The attacks are reported to be the result of actions by People's Liberation Army Unit 61398. These hackers attacked both the US government (Defense Intelligence Agency) and the UK government (Ministry of Defence). In 2006, an "organised Chinese hacking group" shut down a part of the UK House of Commons computer system. The Chinese government has denied responsibility.
Consequences
The U.S. government has blamed the Chinese government for the 2004 attacks. Alan Paller, SANS Institute research director, stated that the attacks came from individuals with "intense discipline" and that "no other organization could do this if they were not a military". Such sophistication has pointed toward the People's Liberation Army as the attackers.
Titan Rain reportedly attacked multiple organizations, such as NASA and the FBI. Although no classified information was reported stolen, the hackers were able to steal unclassified information (e.g., information from a home computer) that could reveal strengths and weaknesses of the United States.
Titan Rain has also caused distrust between other countries (such as the United Kingdom and Russia) and China. The United Kingdom has stated officially that Chinese hackers attacked its governmental offices. Titan Rain has caused the rest of the world to be more cautious of attacks not just from China but from other countries as well.
See also
Cyberwarfare by China
Red Apollo
Moonlight Maze
Operation Aurora
Shawn Carpenter
Stakkato
References
Hacker groups
Espionage scandals and incidents
Military intelligence
National security
Information sensitivity
Data security
21st-century conflicts
Electronic warfare
Cyberattacks
Cyberwarfare by China
Hacking in the 2000s
Chinese advanced persistent threat groups
Chinese information operations and information warfare
|
https://en.wikipedia.org/wiki/Spearhead%20%28TV%20series%29
|
Spearhead is a British television drama series. Produced by Southern Television and broadcast on the ITV network, it ran for a total of three series and 19 episodes from 18 July 1978 to 3 September 1981. It featured the daily lives of a group of soldiers in 'B' Company, 1st Battalion Royal Wessex Rangers, a fictional British Army infantry regiment.
Themes
The programme shows how, in the late 1970s, the British Army had the task of trying to keep the peace in Northern Ireland and also maintained garrisons in Germany and Hong Kong. It also dramatizes the inflexible class divisions in the army of the time. The 'glass ceiling' for even the most able soldiers of working-class origin, like Colour Sergeant Jackson, is shown to be a barrier to achieving advancement from non-commissioned to commissioned officer. Early episodes of the series show the army in an unfavourable light; two episodes deal with a petty thief who has a gambling habit, and another deals with an enlisted man going AWOL, until Jackson gets him back. Particularly controversial is an episode set in Northern Ireland, where some soldiers are portrayed as advocating a less aggressive campaign against all hostile civilians (including women and children).
Through the run of the series, the Royal Wessex Rangers were posted to a number of locations, including Northern Ireland, West Germany with British Army of the Rhine, and as the resident battalion in Hong Kong.
Episode guide
Series 1
The leading character in the first series is Colour Sergeant "Jacko" Jackson (Michael Billington). In the opening episode, the Royal Wessex Rangers are completing a tour of duty in Northern Ireland. Jackson is a member of the battalion's recce platoon charged with close reconnaissance of Provisional IRA terrorist suspects. When the battalion completes its tour, it returns to the mainland UK and is based at barracks in Tidworth, Wiltshire, where it is the British Army's "spearhead" battalion - an infantry battalion kept at short readiness for deployment worldwide. The battalion CO decides that each company in the battalion will have one platoon commanded by a non-commissioned officer. The OC of B Company, Major Taylor, accepts the recommendation of his 2ic, Captain Billings, to appoint Jackson as OC of 6 Platoon.
Series 2: Spearhead (in Germany ... still billed onscreen as just 'Spearhead')
Series 3: Spearhead in Hong Kong
Royal Wessex Rangers
The Royal Wessex Rangers is a fictional British infantry regiment portrayed in the series. It is portrayed as a standard infantry battalion in the British Army during the late 1970s. During the three-year run of the show, the regiment is shown in different roles on different postings; to begin with, the battalion is on an operational tour of Northern Ireland at the height of The Troubles as light infantry, during which one of the sergeants of the battalion's 'B' Company, Colour Sergeant 'Jacko' Jackson (played by Michael Billington) is chosen to become a platoon com
|
https://en.wikipedia.org/wiki/Universal%20Data%20Element%20Framework
|
The Universal Data Element Framework (UDEF) was a controlled vocabulary developed by The Open Group. It provided a framework for categorizing, naming, and indexing data. It assigned to every item of data a structured alphanumeric tag plus a controlled vocabulary name that describes the meaning of the data. This allowed relating data elements to similar elements defined by other organizations.
UDEF defined a Dewey-decimal like code for each concept. For example, an "employee number" is often used in human resource management. It has a UDEF tag a.5_12.35.8 and a controlled vocabulary description "Employee.PERSON_Employer.Assigned.IDENTIFIER".
UDEF has been superseded by the Open Data Element Framework (O-DEF).
Examples
In an application used by a hospital, the last name and first name of several people could include the following example concepts:
Patient Person Family Name – find the word “Patient” under the UDEF object “Person” and find the word “Family” under the UDEF property “Name”
Patient Person Given Name – find the word “Patient” under the UDEF object “Person” and find the word “Given” under the UDEF property “Name”
Doctor Person Family Name – find the word “Doctor” under the UDEF object “Person” and find the word “Family” under the UDEF property “Name”
Doctor Person Given Name – find the word “Doctor” under the UDEF object “Person” and find the word “Given” under the UDEF property “Name”
For the examples above, the following UDEF IDs are available:
“Patient Person Family Name” the UDEF ID is “au.5_11.10”
“Patient Person Given Name” the UDEF ID is “au.5_12.10”
“Doctor Person Family Name” the UDEF ID is “aq.5_11.10”
“Doctor Person Given Name” the UDEF ID is “aq.5_12.10”
See also
Data integration
ISO/IEC 11179
National Information Exchange Model
Metadata
Semantic web
Data element
Representation term
Controlled vocabulary
References
External links
UDEF Project of The Open Group
UDEF Frequently Asked Questions
Data management
Interoperability
Knowledge representation
Metadata
Open Group standards
Software that uses Motif (software)
Technical communication
|
https://en.wikipedia.org/wiki/Dines%20Bj%C3%B8rner
|
Professor Dines Bjørner (born 4 October 1937, in Odense) is a Danish computer scientist.
He specializes in research into domain engineering, requirements engineering and formal methods. He worked with Cliff Jones and others on the Vienna Development Method (VDM) at IBM Laboratory Vienna (and elsewhere). Later he was involved with producing the RAISE (Rigorous Approach to Industrial Software Engineering) formal method with tool support.
Bjørner was a professor at the Technical University of Denmark (DTU) from 1965–1969 and 1976–2007, before he retired in March 2007. He was responsible for establishing the United Nations University International Institute for Software Technology (UNU-IIST), Macau, in 1992 and was its first director. His magnum opus on software engineering (three volumes) appeared in 2005/6.
To support VDM, Bjørner co-founded VDM-Europe, which subsequently became Formal Methods Europe, an organization that supports conferences and related activities. In 2003, he instigated the associated ForTIA Formal Techniques Industry Association.
Bjørner became a knight of the Order of the Dannebrog in 1985. He received a Dr.h.c. from the Masaryk University, Brno, Czech Republic in 2004. In 2021, he obtained a Dr. techn. from the Technical University of Denmark, Kongens Lyngby, Denmark. He is a Fellow of the IEEE (2004) and ACM (2005). He has also been a member of the Academia Europaea since 1989.
In 2007, a Symposium was held in Macau in honour of Dines Bjørner and Zhou Chaochen. In 2021, Bjørner was elected to a Formal Methods Europe (FME) Fellowship.
Bjørner is married to Kari Bjørner, with two children and five grandchildren.
Selected books
Domain Science and Engineering: A Foundation for Software Development, Bjørner, D. Monographs in Theoretical Computer Science, An EATCS Series, Springer Nature. Hardcover ; softcover ; eBook (2021).
Software Engineering 1: Abstraction and Modelling, Bjørner, D. Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag. (2005).
Software Engineering 2: Specification of Systems and Languages, Bjørner, D. Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag. (2006).
Software Engineering 3: Domains, Requirements, and Software Design, Bjørner, D. Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag. (2006).
Formal Specification and Software Development, Bjørner, D. and Jones, C.B. Prentice Hall International Series in Computer Science, Prentice Hall. (1982).
The Vienna Development Method: The Meta-Language, Bjørner, D. and Jones, C.B. (editors). Lecture Notes in Computer Science, Volume 61, Springer-Verlag. (1978).
See also
International Journal of Software and Informatics
References
External links
Home page
Biographical information
RAISE information
1937 births
Living people
People from Odense
Technical University of Denmark alumni
Danish computer scientists
IBM employees
Academic staff of the Technical University of Denmark
A
|
https://en.wikipedia.org/wiki/Ponta%20Grossa
|
Ponta Grossa () is a municipality in the state of Paraná, southern Brazil. The estimated population is 355,336 according to official data from the Brazilian Institute of Geography and Statistics and it is the 4th most populous city in Paraná (76th in Brazil). It is also the largest city close to Greater Curitiba region, so within a radius of 186 miles (300 km) of Ponta Grossa.
It is also known as Princesa dos Campos (in English: Princess of the Fields) and Capital Cívica do Paraná (in English: Civic Capital of Paraná). The city is connected to the Caminho das Tropas (in English: Path of the Troops), being one of the network of routes used by drovers (tropeiros) in the middle of a high hill inside a grassy vegetation. The city is considered of average size, located around a central hill, while most of its growth occurred in the second half of the twentieth century with the weakening of the primary economy.
Ponta Grossa is one of the largest tourist destinations in the Paraná, especially because of the area of natural beauty, Vila Velha State Park which is located within the limits of the municipality. The cup of Vila Velha refers to its location in the collective imagination. The München Fest, a party dedicated to German culture and also known as the Festa Nacional do Chopp Escuro (in English: Dark Chopp National Party), is the biggest event in Paraná and usually lasts a week between November and December.
In this city, the industrial sector is fundamental (supported by agriculture). The city hosts the largest concentration of industry in the interior of Paraná. Agroindustry, lumber and metalworking are the major industries. The result is reflected in national GDP with the contribution from this city within the interior of Brazil, being only below Foz do Iguaçu. Municipal GDP increased over the state and national average between 2013 and 2019, this was also seen in the number of registered companies and employees.
Etymology
The place where it is located has a toponymia related to a hill seen long distance during trips to the Campos Gerais. The name would have originated from a high hill that stood out before the whole pastures landscape by its prominent height and the capo of bush that covers it. The tropeiros to refer to its location said that they were near Ponta Grossa. But other stories have the same idea, like that of the foreman when he tells the farmer the place chosen to establish his farm, "there at Ponta Grossa". Or even that the name had seen later when the owner ceded the lands for settlement.
Ponta Grossa was founded on the farm of Miguel da Rocha Ferreira Carvalhaes who chose it as favorable agricultural land. The farm still exists towards Castro. In 1871 the city came to be called Pitangui, but the following year it resumed its original name. Sometimes it is the target of malicious humor due to what its name can send like in Portuguese. One way or another describes the characteristics of the vegetation and the regional topog
|
https://en.wikipedia.org/wiki/F5%2C%20Inc.
|
F5, Inc. is a publicly-held American technology company specializing in application security, multi-cloud management, online fraud prevention, application delivery networking (ADN), application availability & performance, network security, and access & authorization.
F5 is headquartered in Seattle, Washington in F5 Tower, with an additional 75 offices in 43 countries focusing on account management, global services support, product development, manufacturing, software engineering, and administrative jobs. Notable office locations include Spokane, Washington; New York, New York; Boulder, Colorado; London, England; San Jose, California; and San Francisco, California.
F5's originally offered application delivery controller (ADC) technology, but expanded into application layer, automation, multi-cloud, and security services. As ransomware, data leaks, DDoS, and other attacks on businesses of all sizes are arising, companies such as F5 have continued to reinvent themselves. While the majority of F5's revenue continues to be attributed to its hardware products such as the BIG-IP iSeries systems, the company has begun to offer additional modules on their proprietary operating system, TMOS (Traffic Management Operating System.) These modules are listed below and include, but are not limited to, Local Traffic Manager (LTM), Advanced Web Application Firewall (AWAF), DNS (previously named GTM), and Access Policy Manager (APM). These offer organizations running the BIG-IP the ability to deploy load balancing, Layer 7 application firewalls, single sign-on (for Azure AD, Active Directory, LDAP, and Okta), as well as enterprise-level VPNs. While the BIG-IP was traditionally a hardware product, F5 now offers it as a virtual machine, which they have branded as the BIG-IP Virtual Edition. The BIG-IP Virtual Edition is cloud agnostic and can be deployed on-premises in a public and/or hybrid cloud environment.
F5's customers include Bank of America, Microsoft, Oracle, Alaska Airlines, Tesla, and Meta.
Corporate history
F5, Inc., originally named "F5 Labs" and formerly branded "F5 Networks, Inc." was established in 1996. Currently, the company's public-facing branding generally presents the company as just "F5."
In 1997, F5 launched its first product, a load balancer called BIG-IP. BIG-IP served the purpose of reallocating server traffic away from overloaded servers. In June 1999, the company had its initial public offering and was listed on the NASDAQ stock exchange with the symbol FFIV.
In 2017, François Locoh-Donou replaced John McAdam as president and CEO. Later in 2017, F5 launched a dedicated site and organization focused on gathering global threat intelligence data, analyzing application threats, and publishing related findings, dubbed “F5 Labs” in a nod to the company's history. The team continues to research application threats and publish findings every week. On May 3, 2017, F5 announced that it would move from its longtime headquarters on the waterf
|
https://en.wikipedia.org/wiki/Knights%20of%20Xentar
|
Knights of Xentar is an erotic role-playing video game published for MS-DOS compatible operating systems in North America by Megatech Software in 1995. It was originally published as Dragon Knight III (ドラゴンナイトIII) in Japan. It is part of the Dragon Knight series of games created by Japanese game developer ELF, who originally released the game for the NEC PC-9801 computer in 1991, followed by ports for the X68000 and PC Engine CD in 1992 and 1994. In addition to the regular version of the game, the PC port also have an "adult" version with more explicit nudity.
The game is a sequel of Dragon Knight and Dragon Knight II. Its gameplay system is different from that of previous installments of the Dragon Knight series, resembling this of the early Final Fantasy (even more in the PC version) series instead of first-person-view dungeon crawler, and enabling the player to explore the entire world of the game. Some of the characters were renamed in the English and German localized Knights of Xentar release, including the protagonist Takeru's name changed to Desmond.
Gameplay
The RPG system is completely different from that of the previous games in the Dragon Knight series. The player travels with a top-down view on the world map, visiting towns and dungeons (including Strawberry Fields and Phoenix from the first two games, Dragon Knight and Dragon Knight II respectively). The game's quest is nearly two times longer than the series' first episode.
The enemy encounters are random and the battles, depending on the version, are displayed either in a first-person perspective like in the previous games in the series (similar to these in Wizardry) or in a side-view style (like in many other Japanese RPGs from that era such as the early Final Fantasy entries). The battles are partially automated with the enemies and characters attacking each other in real-time. A battle can be paused at any time to cast a spell, use an item, or change attack style through a list of AI scripts. There are eight levels of attack strength, each with its advantages and disadvantages (for example, more powerful attack levels require more time).
The game features cartoonish cut scenes, many of which contain nude erotic images - the girls the main character encounters and helps will often feel grateful and award him with sexual favors. However, there are no explicit hardcore sex scenes in the game and the girls' genital areas are censored as in most eroge (the sound of a toilet flushing is played when the main character supposedly reaches his climax). Visiting a girl for a sexual encounter has the same effect as resting in an Inn for most traditional RPGs: HP and MP are restored. Crude erotic humour is combined with classical fairy takes; the hero for examples save Little Red Riding Hood from rape by the Wolf, and Snow White from rape by the seven dwarves.
Plot
The main character is a young wandering hero warrior named Desmond (タケル, Takeru). After liberating Strawberry Fields (n
|
https://en.wikipedia.org/wiki/Jos%C3%A9%20Mendes%20%28physicist%29
|
José F.F. Mendes (born in Porto) is a Portuguese physicist (statistical physics) and professor of physics, best known for his work and contributions to the field of network theory.Graduated from University of Porto in 1987. He earned a PhD in March 1995 from the same University under the direction of Eduardo Lage, the title of the thesis was "Dynamics of spins systems".
Mendes was head of the Physics Department from December 2004 to February 2010 at University of Aveiro. From October 2009 to February 2010 he was director of the Associated Laboratory of the Institute of Nanostructures, Nanomodelling and Nanofabrication (I3N) .
From February 2010 to February 2018 served as vice-rector for Research and Doctoral Studies at the University of Aveiro. Was the representative of the Portuguese universities in the Instituto do Petroleo e Gás (Galp) until 2018 .
He is currently the President of the Complex Systems Society (2021 - ...) and Director of the i3N-Aveiro since September 2023 .
Academic career
In 1983 he entered the University of Porto and graduated in physics in 1987. He gained his master's diploma in 1990. In 1987 he was an assistant in the Department of Physics, University of Porto. As a graduate student he visited as several universities as a researcher, including Oxford University, Geneva University, the City University of New York, and São Paulo. After finishing his Ph.D., he became an assistant professor in the same department. In 1996 he did a one year postdoctoral fellowship in Boston University under the supervision of Sid Redner. In 2002 did his "habilitation". In 2002, he became an associate professor at University of Aveiro and in 2005 professor. He was invited as professor by Henri Poincaré University (Nancy), Universidade Federal Minas Gerais (UFMG) and Visiting Researcher at Consiglio Nazionale Delle Ricerche (Pisa), Nanyang Technological University (NTU), École Polytechnique Fédérale de Lausanne (EPFL-Lausanne) and ETH Zurich (Zurich).
Research
Mendes is known for his research on complex networks, and in particular for work on random graph theory, phase transitions, multiplex networks, percolation theory, and network epidemiology. He proposed with collaborators the idea of aging on networks, generalization of preferential attachment, pseudo-fractal networks, hybrid phase transitions, explosive phase transition nature, spectral analysis, k-core, and random walks on networks.
Awards
Prize Gulbenkian Ciência Gulbenkian Prize (2004).
Inducted member of Academia Europaea in 2012.
Member of American Physical Society (APS) (2017).
Member of Sociedade Portuguesa de Fisica.
Member of The Complex Systems Society.
Fellow of the Network Science Society (2019): "For profound contributions to network science that includes elucidating the consequences of preferential attachment, node aging, eigenvalue spectra, and critical phenomena in complex networks."
Fellow of the American Physical Society in 2020.
Litoral Awards Prize "Research"
|
https://en.wikipedia.org/wiki/John%20McAdam%20%28businessman%29
|
John McAdam is a technology executive.
McAdam holds a B.Sc. in computer science from the University of Glasgow, Scotland.
From January 1995 until August 1999, he served as the president and chief operating officer of Sequent Computer Systems, a manufacturer of high-end open systems, which was sold to IBM in September 1999.
McAdam then served as general manager of the web server sales business at IBM.
He served as president, chief executive officer and a director of F5 Networks from July 2000 until June 30, 2015.
McAdam was re-appointed to the position on December 14, 2015, following the resignation of Manuel Rivelo.
In January 2017 F5 announced François Locoh-Donou would replace McAdam in April.
References
External links
F5 Leadership
Living people
Year of birth missing (living people)
|
https://en.wikipedia.org/wiki/Computational%20genomics
|
Computational genomics refers to the use of computational and statistical analysis to decipher biology from genome sequences and related data, including both DNA and RNA sequence as well as other "post-genomic" data (i.e., experimental data obtained with technologies that require the genome sequence, such as genomic DNA microarrays). These, in combination with computational and statistical approaches to understanding the function of the genes and statistical association analysis, this field is also often referred to as Computational and Statistical Genetics/genomics. As such, computational genomics may be regarded as a subset of bioinformatics and computational biology, but with a focus on using whole genomes (rather than individual genes) to understand the principles of how the DNA of a species controls its biology at the molecular level and beyond. With the current abundance of massive biological datasets, computational studies have become one of the most important means to biological discovery.
History
The roots of computational genomics are shared with those of bioinformatics. During the 1960s, Margaret Dayhoff and others at the National Biomedical Research Foundation assembled databases of homologous protein sequences for evolutionary study. Their research developed a phylogenetic tree that determined the evolutionary changes that were required for a particular protein to change into another protein based on the underlying amino acid sequences. This led them to create a scoring matrix that assessed the likelihood of one protein being related to another.
Beginning in the 1980s, databases of genome sequences began to be recorded, but this presented new challenges in the form of searching and comparing the databases of gene information. Unlike text-searching algorithms that are used on websites such as Google or Wikipedia, searching for sections of genetic similarity requires one to find strings that are not simply identical, but similar. This led to the development of the Needleman-Wunsch algorithm, which is a dynamic programming algorithm for comparing sets of amino acid sequences with each other by using scoring matrices derived from the earlier research by Dayhoff. Later, the BLAST algorithm was developed for performing fast, optimized searches of gene sequence databases. BLAST and its derivatives are probably the most widely used algorithms for this purpose.
The emergence of the phrase "computational genomics" coincides with the availability of complete sequenced genomes in the mid-to-late 1990s. The first meeting of the Annual Conference on Computational Genomics was organized by scientists from The Institute for Genomic Research (TIGR) in 1998, providing a forum for this speciality and effectively distinguishing this area of science from the more general fields of Genomics or Computational Biology. The first use of this term in scientific literature, according to MEDLINE abstracts, was just one year earlier in Nucleic Acids Re
|
https://en.wikipedia.org/wiki/Ricochet%20%281989%20video%20game%29
|
Ricochet is an action-adventure game for the BBC Micro and Acorn Electron home computers, published by Superior Software in 1989. It was written by Neil Davidson and David Williams with some graphics work and level design by Nik Weston and Guy Burt.
The object of the game is to retrieve five hourglasses from diverse scenarios to restore the flow of time. It features elements of both platform and puzzle games. The puzzles are mostly logical (keys unlock doors, gold placates a burglar), though there are exceptions.
Gameplay
While the game shares many elements made popular in earlier Superior arcade adventures such as Citadel, it has a unique feel due to the movement of the main character. The player controls a creature named "SPRAT" (Small Partially Robotic Alien Time-traveller), depicted as a red sphere wearing sunglasses. SPRAT moves by rolling but can only do so along level ground or down slopes. There are ladders to climb but many platforms require a special movement to be reached. By holding 'down' (SPRAT squashes himself) to build up potential energy, then releasing, SPRAT can bounce at either a 45 or 90 degree angle.
Legacy
Ricochet is one of a range of 1980s Superior games that was re-released for Microsoft Windows by Superior Interactive, with new graphics and added levels.
External links
Superior Software
1989 video games
BBC Micro and Acorn Electron games
Superior Software games
Video games developed in the United Kingdom
Video games scored by Rob Hubbard
Windows games
Single-player video games
|
https://en.wikipedia.org/wiki/Nello%20Cristianini
|
Nello Cristianini (born 1968) is a professor of Artificial Intelligence in the Department of Computer Science at the University of Bath.
Education
Cristianini holds a degree in physics from the University of Trieste, a Master in computational intelligence from the University of London and a PhD from the University of Bristol. Previously he has been a professor of Artificial Intelligence at the University of Bristol, an associate professor at the University of California, Davis, and held visiting positions at other universities.
Research
His research contributions encompass the fields of machine learning, artificial intelligence and bioinformatics. Particularly, his work has focused on statistical analysis of learning algorithms, to its application to support vector machines, kernel methods and other algorithms. Cristianini is the co-author of two widely known books in machine learning, An Introduction to Support Vector Machines and Kernel Methods for Pattern Analysis and a book
in bioinformatics, "Introduction to Computational Genomics".
Recent research has focused on the philosophical challenges posed by modern artificial intelligence, big-data analysis of newspapers content, the analysis of social media content. Previous research had focused on statistical pattern analysis; machine learning and artificial intelligence; machine translation; bioinformatics.
As a practitioner of data-driven AI and Machine Learning, Cristianini frequently gives public talks about the need for a deeper ethical understanding of the effects of modern data-science on society. His book "The Shortcut" is devoted to the philosophical foundations of Artificial Intelligence and its potential risks for individuals and society.
Awards and honours
Cristianini is a recipient of the Royal Society Wolfson Research Merit Award and of a European Research Council Advanced Grant.
In June 2014, Cristianini was included in a list of the "most influential scientists of the decade" compiled by Thomson Reuters (listing the top one per cent of scientists who are "the world’s leading scientific minds" and whose publications are among the most influential in their fields). In December 2016 he was included in the list of Top100 most influential researchers in Machine Learning by AMiner. In 2017, Cristianini was the keynote speaker at the Annual STOA Lecture at the European Parliament. From 2020 to 2024 he was a member of the International Advisory Board of STOA (Panel for the Future of Science and Technology of the European Parliament).
Books
2000: An Introduction to Support Vector Machines and Other Kernel-based Learning Methods, Nello Cristianini and John Shawe-Taylor
2004: Kernel Methods for Pattern Analysis, Nello Cristianini and John Shawe-Taylor
2006: Intro Computational Genomics, Matthew William Hahn and Nello Cristianini
2014: The Last Summer: Story of Lucy Christalnigg and the End of a World, Nello Cristianini
2023: The Shortcut: Why Intelligent Machines Do Not Think Like Us
|
https://en.wikipedia.org/wiki/Selma%27s%20Choice
|
"Selma's Choice" is the thirteenth episode of the fourth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on January 21, 1993. In the episode, Selma decides to have a baby, inspired by her late aunt's wish that she not spend her life alone. She experiences what life with children is like by taking Bart and Lisa to the Duff Gardens amusement park, which does not go as planned.
The episode was written by David M. Stern and directed by Carlos Baeza.
Plot
On the day that Homer, Bart, and Lisa plan to go to the amusement park Duff Gardens, Marge tells them that her aunt Gladys has died, and the family must attend Gladys's funeral instead. The family picks up Marge's sisters, Patty and Selma, and heads to the funeral home.
After the funeral, the family watches Gladys's video will, in which she advises Patty and Selma not to die alone, as she did. Selma is particularly affected and decides she wants a child. Attempting to find a suitable partner, Selma tries video dating, a love potion, and flirting with a teenage grocery store cashier before eventually going on a date with blind geriatric Hans Moleman. Unable to picture herself having Moleman's children, she considers artificial insemination.
When Homer gets food poisoning from eating a hoagie which had long since expired, Marge arranges for Selma to take Bart and Lisa to Duff Gardens while she stays home to look after Homer. At Duff Gardens, Bart and Lisa's hijinks wear Selma out and eventually land them in the park's security office. Meanwhile, Homer starts to feel better, and he and Marge enjoy their day alone. Returning Bart and Lisa home, Selma asks Homer how he manages to raise kids every day. Deciding she does not need to have children to be happy, Selma adopts Jub-Jub, Gladys' pet iguana, for companionship.
Production
Writer David Stern said he wanted to go back to a "Patty and Selma episode", because it was sustained so well when he wrote "Principal Charming". He thought it was important to "keep these characters (Patty and Selma) alive." The animators had trouble with the size of the characters' pupils during the season. In this episode, they are noticeably larger. When the family watches the video will, Julie Kavner did five voices in the scene. The scene of Great Aunt Gladys showing off her collection of potato chips was inspired by Myrtle Young, who appeared on The Tonight Show Starring Johnny Carson. During an interview with David Letterman, Young said she was working in quality control at a potato chip factory, and collected potato chips that looked like, amongst other things, celebrities. The scene where Homer ate a chip is a reference to the Johnny Carson appearance, where, whilst Young was looking away, Johnny ate a chip from a separate bowl (not of the collection) and Young, thinking Johnny had ate a chip from her collection, was shocked, before Johnny cleared up the misunderstanding. Jub-Jub made his deb
|
https://en.wikipedia.org/wiki/Joe%20Stoy
|
Joseph E. Stoy is a British computer scientist. He initially studied physics at Oxford University. Early in his career, in the 1970s, he worked on denotational semantics with Christopher Strachey in the Programming Research Group at the Oxford University Computing Laboratory (now the Oxford University Department of Computer Science). He was a Fellow of Balliol College, Oxford. He has also spent time at MIT in the United States. In 2003, he co-founded Bluespec, Inc.
His book Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics (MIT Press, 1977) is now a classic text.
Stoy married Gabrielle Stoy, a mathematician and Fellow of Lady Margaret Hall, Oxford.
References
External links
Program Verification and Semantics: The Early Work
Strachey and the Oxford Programming Research Group: a talk by Joe Stoy on Christopher Strachey and the Oxford Programming Research Group.
Year of birth missing (living people)
Living people
Alumni of the University of Oxford
English computer scientists
Members of the Department of Computer Science, University of Oxford
Fellows of Balliol College, Oxford
Massachusetts Institute of Technology faculty
Formal methods people
Programming language researchers
Computer science writers
British expatriates in the United States
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.