source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/ETen%20Chinese%20System | ETen Chinese System (倚天中文系統) was the most popular DOS-compatible traditional Chinese operating system before Chinese Windows 95.
DOS did not support Chinese characters, which are not in Extended ASCII. Many companies in Taiwan developed their own IBM PC compatible traditional Chinese operating system running on DOS, which were mutually incompatible between the OS, such as Kuo Chiao (國喬) and Acer.
The developer of the Eten OS, E-TEN, earned their early profits from sales of their hardware based plug-in card based Chinese system products. Their software (only) Chinese systems were widely copied by many traditional Chinese users and software pirates, but this was difficult for E-TEN to control. Most traditional Chinese products were compatible with the Eten OS at that time.
When Microsoft developed the Chinese Windows 3.1 and Windows 95, traditional Chinese software developer and users shifted to Windows from DOS. The last version of the Eten OS was a Chinese Windows-compatible version. The Eten and other traditional Chinese OS are now used in a few DOS based POS systems.
References
External links
E-TEN corporate website
E-TEN Chinese system website
DOS on IBM PC compatibles |
https://en.wikipedia.org/wiki/Meanings%20of%20minor%20planet%20names%3A%20188001%E2%80%93189000 |
188001–188100
|-id=061
| 188061 Loomis || || Craig P. Loomis (born 1961), an American computing engineer with the Sloan Digital Sky Survey ||
|}
188101–188200
|-id=139
| 188139 Stanbridge || || Dale R. Stanbridge (born 1962), a senior engineer at KinetX who worked as a Navigation Team Member for the New Horizons mission to Pluto ||
|}
188201–188300
|-id=256
| 188256 Stothoff || || Maria M. Stothoff (born 1966), a Public Affairs Deputy Chief at the Southwest Research Institute who worked for the New Horizons mission to Pluto ||
|}
188301–188400
|-bgcolor=#f2f2f2
| colspan=4 align=center |
|}
188401–188500
|-id=446
| 188446 Louischevrolet || || Louis Chevrolet (1878–1941), a Swiss race car driver and co-founder of the Chevrolet Motor Car Company in 1911 ||
|}
188501–188600
|-id=502
| 188502 Darrellstrobel || || Darrell F. Strobel (born 1942), a research scientist at Johns Hopkins University who worked as a Co-Investigator for atmospheric science for the New Horizons mission to Pluto ||
|-id=534
| 188534 Mauna Kea || || Mauna Kea (4,207 m; meaning "White Mountain"), a dormant volcano on the island of Hawaii ||
|-id=576
| 188576 Kosenda || || Setsuo Kosenda (born 1955) established the Mikawa Astronomical Observatory, located in the Niigata region of Japan ||
|}
188601–188700
|-id=693
| 188693 Roosevelt || || Theodore Roosevelt (1858–1919) was the 26th President of the United States and is one of the most admired leaders in American history. Among his many accomplishments he is well known for his conservationism, having established the US Forest Service, five National Parks, 18 National Monuments, and 150 National Forests. ||
|}
188701–188800
|-bgcolor=#f2f2f2
| colspan=4 align=center |
|}
188801–188900
|-id=847
| 188847 Rhipeus || || Rhipeus (Ripheus), from Classical mythology. The Trojan warrior died fighting alongside his comrade Aeneas during the Trojan War. Rhipeus, the most just of the Trojans was not rewarded by the gods (Virgil). ||
|-id=867
| 188867 Tin Ho || || Tin Ho, or Tianhe District, is one of the fastest developing areas in Guangzhou, China. Many of Guangzhou's most iconic buildings are found in this district. Tin Ho is the Chinese name for the Milky Way. ||
|-id=894
| 188894 Gerberlouis || || Louis Gerber (1928–2021), a Swiss banker and amateur astronomer from Fribourg, who was the first treasurer of the Robert A. Naef Foundation, which operates the Observatory Naef Épendes, where this minor planet was discovered. ||
|}
188901–189000
|-id=973
| 188973 Siufaiwing || || Siu Fai Wing (born 1946), a Chinese painter and sculptor ||
|-id=000
| 189000 Alfredkubin || || Alfred Kubin (1877–1959) is considered an important representative of expressionism ||
|}
References
188001-189000 |
https://en.wikipedia.org/wiki/Navibus | Navibus is a group of water bus routes in the French city of Nantes, operated as part of the Tan urban transit network that also includes buses and trams. Routes operate on both the River Loire and the River Erdre, and accept the full range of standard Tan tickets.
The current services date back to an initial trial service on the River Loire in 2005. Historically, services were operated on the River Loire between 1887 and 1958 by a flotilla of eight steam boats known as roquios.
Navibus routes
Three routes are operated:
The Navibus Loire that operates along the River Loire from the Gare Maritime, on the north bank close to the city centre and Tramway de Nantes line 1, to the fishing village of Trentemoult on the south bank of the river. This route is operated throughout the day by a single boat providing a 20 minute interval service, with an additional boat increasing the frequency to 10 minutes during peak periods.
The Navibus Erdre that operates from the southern entrance to Nantes railway station, through the 800m St Felix canal tunnel to a stop at St Mihiel, immediately adjacent to the stop of the same name on tram line 2, and up the River Erdre to a terminus at the Petit Port/Facultés, close to the campus of the University of Nantes. This service is operated by a single hybrid diesel electric boat on a 60 minute interval.
The Navibus Passeur de l'Erdre that crosses the River Erdre from the Petit Port/Facultés to Port Boyer on the opposite bank. This is operated by a single small boat on demand.
Navibus fleet
Five vessels operate, or have operated, on the various Navibus routes.
References
External links
Navibus page on Tan web site (in French)
Transport in Nantes
Ferry transport in France |
https://en.wikipedia.org/wiki/Prussian-Hessian%20Railway%20Company | The Royal Prussian and Grand-Ducal Hessian State Railways (German: Königlich Preußische und Großherzoglich Hessischen Staatseisenbahnen or K.P.u.G.H.St.E.) was a state-owned network of independent railway divisions in the German states of Prussia and Hesse in the early 20th century. It was not, as sometimes maintained, a single state railway company.
On 1 April 1897, the management of the Royal Prussian State Railways (Königlich Preußische Staatseisenbahnen) took over the operations of the railways within the Grand Duchy of Hesse under the initial name "Prussian-Hessian Railway Operation and Financial Association" (Preußisch-Hessische Eisenbahnbetriebs- und Finanzgemeinschaft). Ownership, sovereign rights, and profits remained with the state of Hesse in accordance with a state treaty of 23 June 1896. The headquarters of the railway division (Eisenbahndirektion) was at Mainz.
Hesse could also influence the selection of staff for managerial posts, but engineering and operating procedures followed Prussian regulations alone. All staff wore the Prussian uniform, although the Hessians were allowed to wear a Hessian insignia in addition.
The reason for this agreement was firstly the geographical situation of the state of Hesse — divided into two regions and tightly interlocked with areas of Prussia — and secondly the aim of both states to nationalize the last big private railway company, the Hessian Ludwig Railway (Hessische Ludwigsbahn). With 486,318 employees in 1907, Prussian-Hessian Railways was the largest company in the German Empire. The Prussian-Hessian Railway Company was renamed following World War I to the Prussian State Railway, but was absorbed in 1920 with other German state railways (Länderbahnen) into the Deutsche Reichsbahn.
See also
History of rail transport in Germany
Prussian state railways
Literature
M. Biermer: Die preußisch-hessische Eisenbahngemeinschaft = Sammlung nationalökonomischer Aufsätze und Vorträge in zwangloser Reihenfolge 2, Heft 8. Gießen, 1911.
Großherzogliches Ministerium der Finanzen (publ.): Die hessischen Eisenbahnen in der Preußisch-Hessischen Eisenbahn-Betriebs- und Finanz-Gemeinschaft vom 1. April 1897 bis zum 31. März 1907 (Denkschrift) = Parlamentsdrucksache No. 732 for the 23rd Landtag 1905–1908 of the Grand Duchy of Hesse, Second Chamber. Darmstadt, 1908.
Hager, Bernhard (2008). "Aufsaugung durch Preußen" oder "Wohltat für Hessen"? Die preußisch-hessische Eisenbahngemeinschaft von 1896/97. In Andreas Hedwig (ed.): "Auf eisernen Schienen, so schnell wie der Blitz". Regionale und überregionale Aspekte der Eisenbahngeschichte (Schriften des hessischen Staatsarchivs Marburg. Vol. 19). Hessian State Archives, Marburg, , .
Grand Duchy of Hesse
Transport in Hesse
Defunct railway companies of Germany |
https://en.wikipedia.org/wiki/Type%20aliasing | Type aliasing is a feature in some programming languages that allows the creation to refer to a type using another name. It does not create a new type hence does not increase type safety. It can be used to shorten a long name. Programing languages which allows type aliasing include C++, D, Dart, Elixir, Elm, F#, Go, Hack, Haskell, Julia, Kotlin, Nim, Python, Rust, Scala, Swift and TypeScript.
Example
C++
C++ features type aliasing using the using keyword.
using Distance = int;
D
D features type aliasing using the alias keyword.
alias Distance = int;
Dart
Dart features type aliasing using the typedef keyword.
typedef Distance = int;
Elixir
Elixir features type aliasing using @type.
@type Distance :: integer
Elm
Elm features type aliasing using type alias.
type alias Distance = Int
F#
F3 features type aliasing using the type keyword.
type Distance = int
Go
Go features type aliasing using the type keyword.
type Distance int
Hack
Hack features type aliasing using the newtype keyword.
newtype Distance = int;
Haskell
Haskell features type aliasing using the type keyword.
type Distance = Int;
Julia
Julia features type aliasing.
const Distance = Int
Kotlin
Kotlin features type aliasing using the typealias keyword.
typealias Distance = Int
Nim
Nim features type aliasing.
type
Distance* = int
Python
Python features type aliasing using the typealias keyword.
Vector = list[float]
Type aliases may be marked with TypeAlias to make it explicit that the statement is a type alias declaration, not a normal variable assignment.
from typing import TypeAlias
Vector: TypeAlias = list[float]
Rust
Rust features type aliasing using the type keyword.
type Point = (u8, u8);
Scala
Swift can create type aliases using opaque types.
object Logarithms:
opaque type Logarithm = Double
Swift
Swift features type aliasing using the typealias keyword.
typealias Distance = Int;
TypeScript
TypeScript features type aliasing using the type keyword.
type Distance = number;
References
Articles with example C++ code
Articles with example D code
Articles with example Haskell code
Articles with example Python (programming language) code
Articles with example Scala code
Programming constructs
Data types |
https://en.wikipedia.org/wiki/List%20of%20awards%20and%20nominations%20received%20by%20Twin%20Peaks | Twin Peaks is an American television serial drama, created by David Lynch and Mark Frost, that aired on the ABC network from April 8, 1990 to June 10, 1991. The series centers on the investigation into the murder of schoolgirl Laura Palmer in the small rural town in Washington state after which the series is named.
Since the broadcast of the pilot episode, Twin Peaks earned widespread critical acclaim. The first season earned thirteen Emmy Award nominations—of which it won two awards—a Directors Guild of America Award nomination, and won a Casting Society of America Award, two Golden Globe Awards and two Grammy Awards.
Lead actor Kyle MacLachlan was twice nominated for an Emmy Award for Outstanding Lead Actor in a Drama Series and won the Golden Globe Award for Best Actor in a Television Series Drama. Piper Laurie, who was nominated for two Emmy Awards—Outstanding Lead Actress in a Drama Series in 1990 and Outstanding Supporting Actress in a Drama Series in 1991—, won the Golden Globe Award for Best Supporting Actress in a Series, Miniseries or Television Film in 1990.
Brit Awards
|-
|1991
|Twin Peaks
|Soundtrack/Cast Recording
|
|}
Casting Society of America Awards
Directors Guild of America Awards
Emmy Awards
Awarded since 1949, the Primetime Emmy Award is an annual accolade bestowed by members of the Academy of Television Arts & Sciences recognizing outstanding achievements in American prime time television programming. Awards presented for more technical and production-based categories (like art direction, casting, and editing) are designated "Creative Arts Emmy Awards." Twin Peaks has been nominated for a total of twenty-seven awards and won two.
Primetime Emmy Awards
Primetime Creative Arts Emmy Awards
Golden Globe Awards
Golden Reel Awards
Grammy Awards
Satellite Awards
Saturn Awards
TCA Awards
Viewers for Quality Television Awards
References
Awards
Twin Peaks
Emmy Award-winning programs |
https://en.wikipedia.org/wiki/List%20of%20awards%20and%20nominations%20received%20by%20Six%20Feet%20Under | Six Feet Under is an American comedy-drama series that aired on premium cable network HBO from June 3, 2001, to August 21, 2005. It has been nominated for many different awards, including 44 Emmy Awards (with 9 wins), 8 Golden Globe Award nominations (including 3 wins), 3 Grammy Awards, 4 Writers Guild of America Awards, 4 Television Critics Association Awards, 4 Screen Actors Guild Awards (including 3 wins), 4 Satellite Awards, 4 PGA Awards, 5 GLAAD Media Awards (with 3 wins), 5 Directors Guild of America Awards and 4 ALMA Award nominations.
For the Golden Globe Awards, the series won for Best Drama Series in 2001, while receiving nominations in 2002 and 2003. Peter Krause was nominated for Best Actor in a Drama Series in 2001 and 2002. Rachel Griffiths won for Best Supporting Actress in a Series, Miniseries, or TV Film in 2001, and received a nomination in 2002 in the Lead Actress category. Frances Conroy won for Best Actress in a Drama Series in 2003. For the Screen Actors Guild Awards, the cast won for Outstanding Ensemble in a Drama Series in 2002 and 2003, while received nominations in 2001, 2004, and 2005. Peter Krause was nominated for Outstanding Male Actor in a Drama Series in 2001 and 2003. Frances Conroy won for Outstanding Female Actor in a Drama Series in 2003.
The series received 11 major Emmy nominations for its first two seasons and received 9 major nominations for the 2003 Primetime Emmy Awards for its third season, including a nomination for Outstanding Drama Series. The series received 2 major nominations at the 2005 Primetime Emmy Awards for its fourth season, for Outstanding Drama Series and Outstanding Lead Actress in a Drama Series for Frances Conroy. The series received 6 major nominations at the 2006 Primetime Emmy Awards for its fifth and final season, including a nomination for Outstanding Drama Series. Alan Ball was nominated for writing and directing for the series finale episode "Everyone's Waiting". The show, during its run, was nominated for 168 awards including 46 wins.
Emmy Awards
At the 2002 Primetime Emmy Awards, the series received 11 major nominations for its two first seasons, including a nomination for Outstanding Drama Series. Series creator Alan Ball won for Outstanding Directing for a Drama Series for the pilot episode and Patricia Clarkson won for Outstanding Guest Actress in a Drama Series. The rest of the ensemble cast, including Michael C. Hall, Peter Krause, Frances Conroy, Rachel Griffiths, Freddy Rodriguez, and Lauren Ambrose all received acting nominations. While guest actors Lili Taylor and Illeana Douglas received nominations in the guest acting category.
The series received 9 major nominations at the 2003 Primetime Emmy Awards for its third season, including a nomination for Outstanding Drama Series. Peter Krause, Frances Conroy, Lauren Ambrose, Rachel Griffiths, James Cromwell, and Kathy Bates all received acting nominations. Alan Poul was nominated for directing for the episode "Nobody |
https://en.wikipedia.org/wiki/Mandriva%20Directory%20Server | Mandriva Directory Server (MDS) is an LDAP server developed by Mandriva. This is similar to 389 Directory Server, Novell eDirectory etc. for managing resources & infrastructure within the network.
See also
Fedora Directory Server
Novell eDirectory
List of LDAP software
External links
Mandriva Directory Server
Directory services |
https://en.wikipedia.org/wiki/Auckland%20railway%20electrification | Auckland railway electrification occurred in phases as part of investment in a new infrastructure for Auckland's urban railway network. Electrification of the network had been proposed for several decades. Installation started in the late 2000s after funds were approved from a combination of regional (Auckland Regional Council, later Auckland Council) and central government (NZ Transport Agency) budgets.
In the 2007 budget, the government announced that Auckland suburban railway lines from Swanson in the west to Papakura in the south and including the Manukau and Onehunga branch lines would be electrified at . Diesel DMU services would remain for Waitakere and perhaps Huapai and Pukekohe. A 2013 announcement said that because of cost, bus services would remain between Waitakere and Swanson, and did not mention an extension to Huapai. The $80 million contract for the electrification infrastructure was awarded on 14 January 2010 to an Australian and New Zealand consortium (HILOR); Hawkins Infrastructure of Parnell and Laing O'Rourke of Australia. Between Papakura, Newmarket, Britomart and Swanson there were 196 single-track kilometres. The overhead infrastructure design was to be based on Balfour Beatty's 3B English design. The contract for 57 3-car EMUs was awarded on 6 October 2011 to Spanish manufacturer CAF.
The first public electric service was on 28 April 2014 on the Onehunga Line. Since July 2015, all services have been electric with the exception of Papakura to Pukekohe, which runs a diesel shuttle service, and Swanson to Waitakere, which runs a rail replacement bus service.
Electrification from Papakura to Pukekohe has long been proposed, but in the interim, Auckland Council intended to buy from CAF 17 EMUs equipped with batteries (BEMU) that would have extended electric unit services to Pukekohe. In November 2017, shortly after the change of government at the 2017 general election, it was announced that the proposed BEMU order had been cancelled in preference for 15 further AM class units. The rationale for this became clear in late April 2018 when electrification between Papakura and Pukekohe was announced as part of the $28 billion Auckland Transport Alignment Project. The New Zealand Upgrade Programme announced on 30 January 2020 includes $371 million for Papakura to Pukekohe electrification.
Specifications
Power supply
All four suburban lines between Swanson in the west and Papakura in the south are electrified at , the same voltage as the North Island Main Trunk between Te Rapa and Palmerston North. In contrast, the Wellington suburban network (electrified 1938–55) uses .
About 3,500 masts were installed as part of the project. The Onehunga Line was the first line to be commissioned.
The system is supplied by two connections to Transpower's 220 kV national grid, one at the former Southdown Power Station and the other at Transpower's Penrose substation. Both connections are duplicated (Penrose has limited duplication due to ha |
https://en.wikipedia.org/wiki/Watermelon%20Chess | Watermelon Chess is a two-player abstract strategy game from China where it is known as Xi Gua Qi. It is also known as The Surround Game and Globe. Played on a network of curved lines, players take turns to move a piece, capturing the opponent's pieces by surrounding them. The game is related to the Bear games of the ancient Romans, and uses the same board as some of them. The Go variant Sz'Kwa uses the same board.
Watermelon Chess is unrelated to the game of chess.
Equipment
The board is composed of a large circle with an inner middle circle. Four semicircles form a North, South, East, and West arrangement in the interior of the larger circle. The large circle and the smaller middle circle are divided equally into four pie slices. This creates for twenty-one intersection points where the pieces are played upon.
Each player has six pieces. One player plays the black pieces, and the other player plays the white pieces, however, any two colors or distinguishable objects will do.
Rules
Players decide what colors to play, and who starts first.
Each player's six pieces are initially placed on the six closest intersection points on their side of the board.
Players alternate their turns, and move one piece per turn. A piece can move one space per turn following the pattern on the board.
Enemy pieces can be captured if surrounded by the player's pieces so that it cannot move. Only one enemy piece can be captured per turn. Captured pieces are removed from the board.
The goal is to reduce the opponent's numbers to two pieces.
Comparison to bear games
The game is related to the Bear games of ancient Rome, and uses the same board as some of them. The difference is that in Watermelon Chess each player has six pieces, whereas in the Bear Games, there are three hunters played by one player, and one bear played by the other player. Furthermore, in the Bear games, only the hunters can surround and immobilize the movements of the one bear; the bear merely moves to avoid this as it is impossible for the bear itself to immobilize any of the hunters. In Watermelon Chess, every piece can participate in immobilizing the other player's pieces; furthermore, surrounded enemy pieces are captured.
External links
Abstract strategy games |
https://en.wikipedia.org/wiki/International%20Paderborn%20Computer%20Chess%20Championship | The International Paderborn Computer Chess Championship was an annual chess tournament for computer chess programs held from 1991 until 2007. It was organized by the University of Paderborn. The fifth edition in 1995 was also the 13th edition of the World Microcomputer Chess Championship.
Champions
{| class="sortable wikitable"
! # !! Year !! Program !! Champion
|-
| 1||1991||Zugzwang||Rainer Feldmann, Peter Mysliwietz, Heiner Matthias
|-
| 2||1992||Zugzwang||Rainer Feldmann, Peter Mysliwietz, Heiner Matthias
|-
| 3||1993||Bobby||Hans-Joachim Kraas, Günther Schrüfer
|-
| 4||1994||Schach 3.0||Matthias Engelbach, Thomas Kreitmair
|-
| 5||1995||MChess Pro 5.0||Martin Hirsch
|-
| 6||1997||Zugzwang||Rainer Feldmann, Peter Mysliwietz, Heiner Matthias
|-
| 7||1998||Nimzo98||Christian Donninger
|-
| 8||1999||P.ConNerS ||Ulf Lorenz
|-
| 9||2000||Shredder||Stefan Meyer-Kahlen
|-
| 10||2001||Shredder||Stefan Meyer-Kahlen
|-
| 11||2002||Shredder||Stefan Meyer-Kahlen
|-
| 12||2003||Fritz||Frans Morsch, Mathias Feist
|-
| 13||2004||Hydra||Christian Donninger, Alex Kure, Ulf Lorenz
|-
| 14||2005||Hydra||Christian Donninger, Alex Kure, Ulf Lorenz
|-
| 15||2005||Rybka||Vasik Rajlich
|-
| 16||2006||Rybka||Vasik Rajlich
|-
| 17||2007||HIARCS||Mark Uniacke
|}
References
Complete results and crosstables the CSVN:
Reports from Chessbase: 2002, 2003 and 2004
Results from TWIC: 2003, 2006
Program info from the ICGA:
Official homepage
Computer chess competitions |
https://en.wikipedia.org/wiki/Cic%C4%83ne%C8%99ti | Cicănești is a commune in Argeș County, Muntenia, Romania. It is composed of four villages: Bărăști, Cicănești, Mioarele, and Urechești.
Natives
Gheorghe Păun (born 1950), computer scientist
References
Communes in Argeș County
Localities in Muntenia |
https://en.wikipedia.org/wiki/Bayon%20Television | Bayon Television (Bayon TV; ) is a Cambodian free-to-air television network. Bayon TV broadcasts from 06:00 to midnight.
History
It was launched in 1998 by Hun Mana, oldest daughter of prime minister Hun Sen. It is the second private television station and the first UHF channel in Cambodia.
Brand
Logo history
Theme song
Cambodian national anthem
See also
List of television stations in Cambodia
Media of Cambodia
References
External links
Official website
Television stations in Cambodia
Mass media in Phnom Penh
Television channels and stations established in 1998
1998 establishments in Cambodia |
https://en.wikipedia.org/wiki/Median%20cut | Median cut is an algorithm to sort data of an arbitrary number of dimensions into series of sets by recursively cutting each set of data at the median point along the longest dimension. Median cut is typically used for color quantization. For example, to reduce a 64k-colour image to 256 colours, median cut is used to find 256 colours that match the original data well.
Implementation of color quantization
Suppose we have an image with an arbitrary number of pixels and want to generate a palette of 16 colors. Put all the pixels of the image (that is, their RGB values) in a bucket. Find out which color channel (red, green, or blue) among the pixels in the bucket has the greatest range, then sort the pixels according to that channel's values. For example, if the blue channel has the greatest range, then a pixel with an RGB value of is less than a pixel with an RGB value of , because . After the bucket has been sorted, move the upper half of the pixels into a new bucket. (It is this step that gives the median cut algorithm its name; the buckets are divided into two at the median of the list of pixels.) This process can be repeated to further subdivide the set of pixels: choose a bucket to divide (e.g., the bucket with the greatest range in any color channel) and divide it into two. After the desired number of buckets have been produced, average the pixels in each bucket to get the final color palette.
See also
k-d tree
References
External links
Image quantization
Median cut + variations
Image::Pngslimmer Perl module at CPAN
Color image quantization for frame buffer display
Sorting algorithms |
https://en.wikipedia.org/wiki/Comedy%20Central%20%28Italian%20TV%20channel%29 | Comedy Central is an Italian television channel broadcasting comedy-related programmes from the United States, the United Kingdom and Italy. It is owned by Paramount Networks EMEAA.
Programming
Shows
Amici @ Letto
Amici miei
Bastardi
Central Station
Comedy Tour
Comicittà
Crozza Italia (from La7)
Lo Zoo di 105 (recorded from Radio 105 Network)
Made in Sud
Markette (from La7)
Neurovisione
Salsa Rosa
Second Italy
The Ben Stiller Show
The Daily Show with Jon Stewart
The Sarah Silverman Program
Very Victoria
Cartoons
Beavis and Butt-head
The Boondocks
Creature Comforts
Drawn Together
Free For All
Happy Tree Friends
ILL-ustrated
Odd Job Jack
South Park
Sitcoms
Almost Perfect
Becker
Courting Alex
Family Business
Frasier
Love, Inc.
Normal, Ohio
Out of Practice
So Notorious
The Comeback
The King of Queens
TV series
Everybody Hates Chris
Everybody Loves Raymond
Dentro la TV
King of Queens
Last Man Standing
Related
Reno 911!
Rules of Engagement
Sex & The City
Slings and Arrows
Stella
The Robinsons
The War at Home
Worst Week
Vintage
Adult Information
Cheers
Family Ties
Get Smart
M*A*S*H
Mork & Mindy
Police Squad!
Roseanne
The Odd Couple
Sports
US Figure Skating
References
External links
Comedy Central
Italian-language television stations
Telecom Italia Media
Television channels in Italy
Television channels and stations established in 2004 |
https://en.wikipedia.org/wiki/Gare%20Saint-Jean%20tram%20stop | Gare Saint-Jean station is located on lines C and D of the Bordeaux tramway network. The station served as the terminus of the line C until 27 February 2008 when it was expanded to station Pyrénées (in Villenave-d'Ornon).
Situation
The station is located on Charles Domercq road in Bordeaux across from Gare de Bordeaux Saint-Jean.
Junctions
SNCF (train service)
Bordeaux Saint-Jean railway station
TGV, TER Aquitaine, Trains Grandes Lignes
TBC Network
Réseau -Bus-
Trans Gironde Network
Close by
Gare Saint-Jean SNCF
Parking Saint-Jean
See also
TBC
Tramway de Bordeaux
Bordeaux tramway stops
Tram stops in Bordeaux
Railway stations in France opened in 2004 |
https://en.wikipedia.org/wiki/CJTL-FM | CJTL-FM is a Canadian radio station that broadcasts First Nations and Christian radio programming at 96.5FM in Pickle Lake, Ontario, along with a radio translator CJTL-FM-1 at 98.1FM in Thunder Bay.
Licensed in 2008, the station is owned by the Native Evangelical Fellowship of Canada and broadcasts as the Wah-Ste-Win Aboriginal Radio Network (WARN), which broadcasts Christian programming for First Nations in Northwestern Ontario. WARN has plans to open a third transmitter in Winnipeg, pending CRTC approval and licensing.
References
External links
Native Evangelical Fellowship of Canada: WARN official site
Jtl
Jtl
Jtl
Cree language
Oji-Cree
Radio stations established in 2008
2008 establishments in Ontario |
https://en.wikipedia.org/wiki/Rai%20Sport | Rai Sport HD is an Italian sports TV channel, launched in 1999 by the state-owned RAI television network. It broadcast Italian and international sports events in Italy on DTT channel 58 on Rai Mux A from HDTV. It is also available on Sky Italia.
On 18 May 2010 a sister channel, Rai Sport 2 was launched. However the channel closed on 5 February 2017. Rai Sport + HD launched on 14 September 2015, reviving the Rai Sport + brand that was used from 2009 to 2010.
Logos and identities
Programming
The channel broadcasts three editions of the Tg Sport: the first at 9 am every day, with press review to touchscreen, the second to 2.30 pm from Monday to Saturday, the last at 11.30 pm from Monday to Friday.
A few programme include:
Lega Basket Serie A (LBA)
Campionato Nazionale Primavera
FIFA Futsal World Cup
FIFA U-17 World Cup
I-league
A Lyga
Italy national under-21
Lega Pro Prima Divisione
Lega Pro Seconda Divisione
Serie D
I-League
Coppa Italia Lega Pro
Coppa Italia Serie D
Coppa Italia Dilettanti
Diretta Azzurra
90° Minuto Champions
Magazine Champions
Magazine Europa
Magazine Europa Conference
Sabato Sprint
A tutta Coppa
Lega Pro
References
External links
Official website
Rai Sport Biss Code
Sport 1
Television channels and stations established in 1999
Sports television in Italy
Italian-language television stations
1999 establishments in Italy |
https://en.wikipedia.org/wiki/Tiger%20Road | is a hack and slash platform game originally released in 1987 as a coin-operated arcade video game.
Home computer versions were released in Europe by U.S. Gold for the Amiga, Amstrad CPC, Atari ST, Commodore 64, MS-DOS, and ZX Spectrum. An alternate version for the Commodore 64 was released in the United States by Capcom who also published an Amiga 500 port of the game in that region.
A remade version for the PC Engine/TurboGrafx 16 was released in 1990 in Japan and North America. The original arcade game is included in Capcom Classics Collection Vol. 2 for the PlayStation 2 and Xbox.
Plot
In Tiger Road, the player is placed in the shoes of a master of the Tiger Technique of Oh-Lin, Lee Wong. Before the start of the game, Lee's comrades were attacked by warriors of the Dragon God Ryuken, who kidnapped the children studying Oh-Lin. To win the game, the player must advance past five stages and retrieve scrolls through training areas (bonus stages) to acquire health and weapon power upgrades, and also the Double-Headed Tiger Fighting Technique ("Tora Kikou in-game) to defeat Ryuken, rescue the children, and reclaim his power.
Regional differences
The Japanese arcade release has additional sound hardware, allowing the game to play digital samples using an additional Z80 and MSM5205 digital sound chip.
The World and USA releases had this removed, and these releases do not play any samples, lowering the production cost of the PCB.
Reception
In Japan, Game Machine listed Tiger Road on their January 1, 1988 issue as being the eighth most-successful table arcade unit of the month. The game was reviewed in 1990 in Dragon #156 by Hartley, Patricia, and Kirk Lesser in "The Role of Computers" column. The reviewers gave the game 4 out of 5 stars.
References
External links
Tiger Road at IGN
Tiger Road Strategy Guide (TurboGrafx-16) at TurboPlay Magazine Archives
1987 video games
Capcom beat 'em ups
Hack and slash games
Platformers
Action games
Arcade video games
Capcom games
Commodore 64 games
DOS games
Amiga games
Amstrad CPC games
Atari ST games
Romstar games
TurboGrafx-16 games
U.S. Gold games
Video games developed in Japan
Video games scored by Harumi Fujita
ZX Spectrum games
Video games scored by Tamayo Kawamoto |
https://en.wikipedia.org/wiki/IBM%20Elastic%20Interface | Elastic interface buses, abbreviated as EI bus connections, can be generalized as bus connections which are high speed interfaces that send clock signals with data.
Description
The data bits that are sent through EI bus connections are aligned to the clock so that they latch to the data at the high speeds. EI bus connections require that the net topology and timing characteristics for each net on the bus are at least similar to each other in order to make lining up the edges of the data to the clock signals possible. In this environment, re-working connections in the connection module was not easily possible because all nets needed to have similar topology and timing characteristics. This increased the difficulty of a re-work solution or made it impossible and increased the modules that needed to be scrapped as unusable.
Repair
Elastic Interface repair involves a spare wire that is built into the bus interface in the connection module that has the same topology and characteristics of the rest of the nets in the bus. It includes hardware that is able to switch from the bad net in the interface to the spare net (as of now, this operation must be supported by the original manufacturer of the EI bus connector). The connection module is tested at several different process corners such as low and high temperature and low and high voltages. When a net on the interface is known to be bad, the spare net is used on the bus for testing and the bad net is not tested. When the bus does not have a defect, the spare net is tested with the functional nets. In the original design specification for the EI spare, the wire was driven with a constant zero when not used.
Applications
IBM, inventor of the elastic interface bus, uses it in many high end processors:
Elastic Interface (EI-1): POWER4, PowerPC 970 and Z900
Elastic Interface 2 (EI-2): POWER5 and Z9
Elastic Interface 3 (EI-3): POWER6, Z10, POWER7, PowerEN
Mai Logic was a licensee of the Elastic Interface technology for PowerPC 970 applications.
See also
HyperTransport
References
IBM computer hardware
Computer buses
Motherboard |
https://en.wikipedia.org/wiki/Penang%20Sentral | {
"type": "ExternalData",
"service": "geoshape",
"ids": "Q7162240",
"properties": {
"title": "Penang Sentral",
"description": "none",
}
}
Penang Sentral is an intermodal transit-oriented development in Butterworth, Penang, Malaysia. Proposed as the main transportation hub for the State of Penang, and by extension, Greater Penang, the first phase of the Penang Sentral project opened on 22 November 2018.
Modeled after KL Sentral in Kuala Lumpur, the first phase of Penang Sentral will serve as the terminal for both public and intercity buses, and is physically connected to the adjacent Butterworth railway station and the Penang Ferry terminal. The project will eventually comprise an integrated terminal for all bus, rail and sea transportation services within Penang. Future phases of the project also include commercial, retail and residential developments.
History
Touted as the gateway to northern Malaysia by its developers, the Penang Sentral project was announced by the then Malaysian Prime Minister, Abdullah Badawi in 2007. The project, covering a site in the heart of Butterworth, was to be jointly undertaken by Malaysian Resources Corporation Berhad (MRCB) and Perlaburan Hartanah Bumiputera Berhad.
Veritas Architects was put in charge of the design works of the proposed transit-oriented development, while the construction of Phase 1 was allocated to a subsidiary of MRCB, Penang Sentral Sdn Bhd. Penang Sentral was modeled after KL Sentral, which also incorporated commercial and residential elements. The entire project was divided into eight phases, of which the second, third and fourth phases comprised a shopping complex, three office blocks and a 36-storey hotel respectively.
However, since its launch in 2007, the Penang Sentral project has suffered repeated delays. Land acquisition became the main stumbling block, as the parcels of land earmarked for the development were owned by several parties, namely the Malaysian federal government, the Penang state government, highway concessionaires and Keretapi Tanah Melayu, the national railway operator. As a result, construction of Phase 1 of Penang Sentral only began in earnest in 2015.
Station layout
Gallery
References
External links
Penang Sentral Website
Transport in Penang |
https://en.wikipedia.org/wiki/Comparison%20of%20programming%20languages%20%28list%20comprehension%29 | List comprehension is a syntactic construct available in some programming languages for creating a list based on existing lists. It follows the form of the mathematical set-builder notation (set comprehension) as distinct from the use of map and filter functions.
Examples of list comprehension
Boo
List with all the doubles from 0 to 10 (exclusive)
doubles = [i*2 for i in range(10)]
List with the names of the customers based in Rio de Janeiro
rjCustomers = [customer.Name for customer in customers if customer.State == "RJ"]
C#
var ns = from x in Enumerable.Range(0, 100)
where x * x > 3
select x * 2;
The previous code is syntactic sugar for the following code written using lambda expressions:
var ns = Enumerable.Range(0, 100)
.Where(x => x * x > 3)
.Select(x => x * 2);
Ceylon
Filtering numbers divisible by 3:
value divisibleBy3 = { for (i in 0..100) if (i%3==0) i };
// type of divisibleBy3 is Iterable<Integer>
Multiple "generators":
value triples = { for (x in 0..20) for (y in x..20) for (z in y..20) if (x*x + y*y == z*z) [x,y,z] };
// type of triples is Iterable<Integer[3]>
Clojure
An infinite lazy sequence:
(for [x (iterate inc 0)
:when (> (* x x) 3)]
(* 2 x))
A list comprehension using multiple generators:
(for [x (range 20)
y (range 20)
z (range 20)
:when (== (+ (* x x) (* y y)) (* z z))]
[x y z])
CoffeeScript
largeNumbers = (number for number in list when number > 100)
Common Lisp
List comprehensions can be expressed with the loop macro's collect keyword. Conditionals are expressed with if, as follows:
(loop for x from 0 to 100 if (> (* x x) 3) collect (* 2 x))
Cobra
List the names of customers:
names = for cust in customers get cust.name
List the customers with balances:
names = for cust in customers where cust.balance > 0
List the names of customers with balances:
names = for cust in customers where cust.balance > 0 get cust.name
The general forms:
for VAR in ENUMERABLE [where CONDITION] get EXPR
for VAR in ENUMERABLE where CONDITION
Note that by putting the condition and expression after the variable name and enumerable object, editors and IDEs can provide autocompletion on the members of the variable.
Dart
[for (var i in range(0, 100)) if (i * i > 3) i * 2]
var pyth = [
for (var x in range(1, 20))
for (var y in range(x, 20))
for (var z in range(y, 20)) if (x * x + y * y == z * z) [x, y, z]
];
Iterable<int> range(int start, int end) =>
List.generate(end - start, (i) => start + i);
Elixir
for x <- 0..100, x * x > 3, do: x * 2
Erlang
L = lists:seq(0,100).
S = [2*X || X <- L, X*X > 3].
F#
Lazily-evaluated sequences:
seq { for x in 0 .. 100 do if x*x > 3 then yield 2*x }
Or, for floating point values
seq { for x in 0. .. 100. do if x**2. > 3. then yield 2.*x }
Lists and arrays:
[ for x in 0. .. 100. do if x**2. > 3. then yield 2.*x ]
[| for x in 0. .. 100. do if x**2. > 3. then yield 2.*x |]
List compreh |
https://en.wikipedia.org/wiki/Tu%20Vida%20es%20Mi%20Vida | Tu Vida es Mi Vida was Spanish language radio program hosted by award-winning motivational speaker Maria Marín and was produced by Cumulus Media Networks en Español (through Cumulus Media). It has aired on hundreds of Spanish radio affiliates throughout the United States. Tu Vida es Mi Vida came to an end in 2011.
Tu Vida es Mi Vida (Spanish for "Your Life is My Life") is a mix of romantic and inspirational music with various interviews and talk. Each episode explores hot topics relevant for Hispanic women today, including relationships, work, and inspirational stories of women who have achieved their dreams.
External links
ABC Radio en Español on ABC Radio Networks
Westwood One
Spanish radio programs
2011 radio programme endings |
https://en.wikipedia.org/wiki/Abare%20Hassh%C5%AB%20Goy%C5%8D%20Tabi | was a network prime-time television jidaigeki series in Japan from 1991 to 1994. It starred Teruhiko Saigō.
The series began in 1991 in the 9:00 p.m. time slot on the TV Tokyo network. Saigō created the role of Tōdō Heihachirō. The character was a , a law-enforcement official of the Tokugawa shogunate, with broad jurisdiction over the Kantō region surrounding the shogunal capital at Edo. A common alternative name for the post was Hasshū-mawari, alluding to the eight provinces (hasshū) of the region; the title incorporates this name. He traveled incognito, investigating the places he visited, and donned white costume for the finale, where he killed all the wrongdoers.
The cast included many other widely known entertainers. Jun'ichi Nitta had a repeating role as a doctor on Abarenbō Shōgun and appeared in Ultraman Dyna, Mito Kōmon, the NHK Taiga drama Dokuganryū Masamune, Chōshichirō Edo Nikki and other television series. Yōko Natsuki was a regular member of the original cast of Abarenbō Shōgun. Beat Kiyoshi is an owarai comic, formerly partner of Beat Takeshi. Tetsuo Kurata is known for his role in Kamen Rider Black and other tokusatsu productions. Daijirō Tsutsumi has risen to prominence in guest roles, and has had other regular parts. He joined the fire-fighting company as a bookkeeper in Abarenbō Shōgun, and portrays shogun Tokugawa Tsunayoshi on Mito Kōmon. Reiko Takashima has starred in many jidaigeki and present-day series. Raita Ryū, who played the bounty-hunter Yamasaki Tetsunosuke, has dozens of supporting and guest-star roles to his credit. Among them are Amari Torayasu in the 2007 taiga drama Fūrin Kazan.
The series was produced by TV Tokyo and Union Motion Picture. Shunsuke Kikuchi wrote the music for the show, and Saigō sang the theme songs.
The series has been rebroadcast many times. The first series of Abare Hasshū Goyō Tabi is available on DVD. The Jidaigeki Channel distributed it via satellite and cable in September 2008.
The production was in color. Episodes lasted 45 minutes within the time slot. TV Tokyo regularly broadcasts jidaigeki in the Friday 9:00–9:54 time slot.
Cast
Teruhiko Saigō as Tōdō Heihachirō
Raita Ryū as Tetsunosuke Yamazaki
Yōko Natsuki as Sayuri
Miyuki Kanō
Junichi Nitta
Reiko Takashima
Umenosuke Nakamura as Mizuno Tadakuni
References
Jidaigeki television series
Jidaigeki |
https://en.wikipedia.org/wiki/Computer%20Game%20Review | Computer Game Review was a print monthly magazine covering both computer gaming and video gaming. The magazine was started in 1991. Also known as Computer Game Review and 16-Bit Entertainment, and then later as Computer Game Review and CD-Rom Entertainment. The headquarters of the magazine which was part of Sendai Publication Group was in Lombard, Illinois.
Reviews typically consisted of a short, impartial synopsis of plot and gameplay, with separate scores assigned subjectively by each of three reviewers. Games were rated out of 100, and if the game received a high enough ranking it would receive either a Platinum or Golden Triad Award.
The magazine folded in 1996, when Sendai Media Group was bought by Ziff-Davis, owner of the competing Computer Gaming World.
References
Monthly magazines published in the United States
Video game magazines published in the United States
Defunct computer magazines published in the United States
Home computer magazines
Magazines established in 1995
Magazines disestablished in 1996
Magazines published in Illinois |
https://en.wikipedia.org/wiki/Traffic%20Safety%20and%20the%20Driver | Traffic Safety and the Driver is a book authored by Leonard Evans.
Reception
While the data presented is in some regards dated, the concepts apply now as they did then. This book has been repeatedly referred to as a classic in the fields of traffic safety, vehicle safety, and crash prevention. It has been positively reviewed by most of the world's most influential technical journals in relevant fields.
Traffic Safety and the Driver is now largely eclipsed by the author's more recent book Traffic Safety, which has received similarly enthusiastic reviews.
Chapter headings
The book was organized as follows:
Introduction
Effects of Sex and Age
An Overview of U.S. Traffic Fatalities
Engineering, Roadway and Environmental Factors
Driver Performance
Driver Behavior
Alcohol's Role in Traffic Crashes
Drunk Driving Countermeasures
Effectiveness of Occupant Protection Devices When Used
Restraint-Use Laws, Use Rates, and Field Effectiveness
User Responses to Changes in Traffic Systems
How You Can Reduce Your Risk
An Attempt to Estimate the Relative Importance of Factors
Traffic Safety in Broader Contexts
Conclusions
References
Further reading
Automotive safety
Handbooks and manuals
2004 non-fiction books |
https://en.wikipedia.org/wiki/Indian%20Telegraph%20Act%2C%201885 | The Indian Telegraph Act, 1885 is the enabling legislation in India which governs the use of wired and wireless telegraphy, telephones, teletype, radio communications and digital data communications. It gives the Government of India exclusive jurisdiction and privileges for establishing, maintaining, operating, licensing and oversight of all forms of wired and wireless communications within Indian territory. It also authorizes government law enforcement agencies to monitor/intercept communications and tap phone lines under conditions defined within the Indian Constitution. The act came into force on 1 October 1885. Since that time, numerous amendments have been passed to update the act to respond to changes in technology.
Background
The Indian Telegraph Act, passed in 1883, was intended to give the Central Government power to establish telegraph lines on private as well as public property. At the time the Act was conceived, India was still under the rule of the British Raj. Telegraph was first installed in 1851 and a trans-India telegraph was completed three years later in 1854. The telegraph had become, in the intervening thirty years, an important tool for British dominion over India by quelling rebellions and consolidating information. It was thus important for the British to have control of telegraphy and infrastructure across the subcontinent.
Legal interception of communications by law enforcement agencies
Indian laws do not allow disclosure of information pertaining to court authorised interception and communications data.
Miscellaneous
The ownership and operation of satellite communications systems and amateur radio equipment is strictly regulated in India.
Satellite phones
Satellite phones have to either be purchased in India from an authorized distributor or can be imported into India after receiving permission from the Department of Telecommunications (DoT).
Following the Mumbai terror attacks in 2011, the Directorate General of Shipping (DGS) banned the use of Thuraya and Iridium satellite phones and infrastructure in 2012; restrictions were already in place in 2010, for similar reasons, under provisions in the Indian Telegraph Act.
Passengers importing satellite telephone as baggage shall be required to declare the same to the Customs on arrival at immigration and customs checkpoints. Circular No.37 / 2010-Customs states that "satellite phone declared to Customs shall be allowed clearance subject to production of permission for use from DoT, Government of India." (...) "Satellite phones imported for use in India without a valid permission of DoT may be detained and appropriate action in accordance with the law may be initiated."
Indian media reports mention that National Technical Research Organisation (NTRO) has capability to detect, intercept and record phone communications using land and satellite-based communications link monitoring systems. Scientists at Indian Institutes of Technology (IIT) have cracked GEO-Mobile Radio I |
https://en.wikipedia.org/wiki/E3%20European%20long%20distance%20path | The E3 European long distance path, or just E3 path, is a long-distance footpath that is planned to run from the Portuguese coast to the Black Sea in Bulgaria. It is one of the network of European long-distance paths.
Route
The completed sections of the route pass through Spain, France, Luxembourg, Belgium, Germany, the Czech Republic, Slovakia, a short stretch in Poland, Hungary, Romania, and Bulgaria.
It is planned to extend the route into Portugal to end at Cape St. Vincent.
Spain
See Traildino
The Spanish portion of the E3 follows the Way of St. James, and specifically the French Way between Santiago de Compostela and France.
France
See Traildino
Luxembourg
See Traildino
Belgium
See Traildino
Germany
See Traildino
Czech Republic
See Traildino
Slovakia
See Traildino
In Slovakia, the path runs over the Malá Fatra and the Tatra Mountains.
Poland
See Traildino
Hungary
See Traildino
Bulgaria
See Traildino
In Bulgaria, the path follows the ridge of the Balkan Mountains from Kom Peak on the Serbian border to Cape Emine on the Black Sea and is locally famous as the Kom–Emine long-distance trail.
Romania
In Romania, the route includes the Carpathian Mountains
External links
E3 - map and information at European Ramblers' Association
Digitalized Slovak part of E3, GPX download included
Info about the Bulgarian part of E3
European long-distance paths
Hiking trails in Spain
Hiking trails in France
Hiking trails in Germany
Hiking trails in the Czech Republic
Hiking trails in Slovakia
Hiking trails in Bulgaria |
https://en.wikipedia.org/wiki/Comtex | Comtex News Network, Inc. is a distributor of news on the Internet, specializing in the business and financial market sectors. The company is a wholesaler of electronic real-time news and content gathered from thousands of sources, including national and international news bureaus, agencies and publications (including Business Wire, Dow Jones, McClatchy Information Services, PR Newswire and United Press International). Comtex enhances and standardizes the content received from such sources in order to provide editorially consistent and technically uniform products to its customers. Its processing includes adding stock ticker symbols, indexing by keyword and category and converting diverse publisher materials and formats into the industry standard delivery format NewsML, an XML derivative. The company slogan is "Relevant. Reliable. Real-Time."
Product areas
The company's product lines include CustomWires, subject-specific newswires including energy, finance, international and public company information; Comtex TopNews, comprising several categories of editorially selected news stories of the day; Publisher Full Feeds, which are deliveries from specific publishers providing their content offerings; and SmarTrend, based on proprietary time-series pattern recognition analysis. Comtex clients include information distributors such as MarketWatch, Factiva, Bloomberg, and Reuters, websites, corporate intranets and market data applications.
History
Comtex was incorporated in New York in 1980 and operated under the name Academic Micropublishing Company, Inc. until 1981, when the name was changed to Comtex Scientific Corporation. From 1989 until 1991 Infotechnology ("Infotech"), a Delaware business development corporation, then principally engaged in the information and communications business, acquired majority ownership of Comtex. From 1991 until 2006 AMASYS Corporation, a successor in interests to Infotech, held a majority ownership position, via a combination of stock and debt. In 2006 Comtex repaid all of its outstanding long-term debt and AMASYS sold all its shares. In late 1999 Comtex changed its name to Comtex News Network, Inc.
In 2004 Chip Brian joined Comtex as VP, Operations and was named President in 2005 and CEO in 2006. A new management team was charged with the reducing debt, strengthening the company's financial base and diversifying product lines.
Business structure
Consistent with standard practice in the information aggregation industry, Comtex generally has renewable long-term contractual relationships with those information providers and information distributors with which it does business. Comtex generates revenues primarily from charges to distributors for the licensing of enhanced content, including CustomWires, TopNews products and publishers' full feeds. Royalties are based upon the customers' business and revenue models such that success in their chosen markets generates increasing revenues for Comtex. Fees and royaltie |
https://en.wikipedia.org/wiki/GetBack%20%28website%29 | GetBack.com was a social networking and multi-media website based out of Los Angeles, CA that was active between 2007 and 2010. Its aim was to help baby boomers rediscover pop culture from past decades and interact with their peers.
About
In 2007, GetBack.Com was launched by executives from its sister company Shout! Factory along with veterans of IFILM and MTV.
The site collection of cultural media ranged from the 1960s through the 1990s. Users were able to watch music videos, TV clips, and interviews. There were also artist pages that include artist-related media as well as bios, timelines, "then and now" galleries, and comment boards.
Additionally, the site contained traditional social networking features such as profiles, chat, messaging and user-generated content uploads. Widgets and other elements were available, as well as early game classics such as Tetris, Frogger, and Super Mario Bros.
GetBack.com closed down in January 2010, with the intention of relaunching in March of that year. As of 2012, the site remains down, and its domain parked.
References
External links
Official website
Defunct social networking services
American entertainment websites
Internet properties established in 2007
Internet properties disestablished in 2010 |
https://en.wikipedia.org/wiki/XPL0 | {{DISPLAYTITLE:<span style = "font-family: Times New Roman">XPL0}}
XPL0 is a computer programming language that is essentially a cross between Pascal and C. It looks somewhat like Pascal but works more like C. It was created in 1976 by Peter J. R. Boyle who wanted a high-level language for his microcomputer and wanted something more sophisticated than BASIC, which was the dominant language for personal computers at the time.
XPL0 is based on PL/0, an example compiler in the book Algorithms + Data Structures = Programs by Niklaus Wirth. The first XPL0 compiler was written in ALGOL. It generated instructions for a pseudo-machine that was implemented as an interpreter on a Digital Group computer based on the 6502 microprocessor. The compiler was converted from ALGOL to XPL0 and was then able to compile itself and run on a microcomputer.
XPL0 soon proved its worth in a variety of products based on the 6502. These embedded systems would otherwise have had their code written in assembly language, which is much more tedious to do.
Boyle used XPL0 to write a disk operating system called Apex. Beginning in 1980 this was sold, along with XPL0, as an alternative to Apple DOS for the Apple II computer, which was based on the 6502.
Since those early years XPL0 has been implemented on a dozen processors, and many features have been added. There are now optimizing native code compilers with 32-bit integers in place of the original 16-bit versions. Open source compilers for Windows and MS-DOS on PCs and Linux on the Raspberry Pi are available from the link below.
Examples
This is how the traditional Hello World program is coded in XPL0:
code Text=12;
Text(0, "Hello World!")
Text is a built-in routine that outputs a string of characters. The zero (0) tells where to send the string. In this case it is sent to the display screen, but it could just as easily be sent to a printer, a file, or out a serial port by using a different number.
In XPL0 all names must be declared before they can be used. The command word code associates the name Text to built-in routine number 12, which is the one that outputs strings. There are about a hundred of these built-in routines that provide capabilities such as input and output, graphics, and trig functions.
The 32-bit versions of the compilers automatically insert code declarations, thus the program above can simply be written as:
Text(0, "Hello World!")
The TPK algorithm provides an example that can be compared to other languages:
func real F(T);
real T;
return sqrt(abs(T)) + 5.*Pow(T, 3.);
int I; real Y, A(11);
[for I:= 0 to 10 do A(I):= RlIn(0);
for I:= 10 downto 0 do
[Y:= F(A(I));
if Y > 400. then [IntOut(0, I); Text(0, " TOO LARGE")]
else [IntOut(0, I); RlOut(0, Y)];
CrLf(0);
];
]
Graphics has been a feature of XPL0 since its days on the Apple II comput |
https://en.wikipedia.org/wiki/Typeof | typeof, alternately also typeOf, and TypeOf, is an operator provided by several programming languages to determine the data type of a variable. This is useful when constructing programs that must accept multiple types of data without explicitly specifying the type.
In languages that support polymorphism and type casting, the typeof operator may have one of two distinct meanings when applied to an object. In some languages, such as Visual Basic, the typeof operator returns the dynamic type of the object. That is, it returns the true, original type of the object, irrespective of any type casting. In these languages, the typeof operator is the method for obtaining run-time type information.
In other languages, such as C# or D and, to some degree, in C (as part of nonstandard extensions and proposed standard revisions), the typeof operator returns the static type of the operand. That is, it evaluates to the declared type at that instant in the program, irrespective of its original form. These languages usually have other constructs for obtaining run-time type information, such as typeid.
Examples
In a non-standard (GNU) extension of the C programming language, typeof may be used to define a general macro for determining the maximum value of two parameters:#define max(a,b) ({ typeof (a) _a = (a); typeof (b) _b = (b); _a > _b ? _a : _b; })In C#:// Given an object, returns if it is an integer.
// The "is" operator can be also used to determine this.
public static bool IsInteger(object o)
{
return o.GetType() == typeof(int);
}
As of C23 typeof is a part of the C standard. The operator typeof_unqual was also added which is the same as typeof, except it removes cvr-qualification and atomic qualification.
In VB.NET, the C# variant of "typeof" should be translated into the VB.NET's GetType method. The TypeOf keyword in VB.NET is used to compare an object reference variable to a data type.
The following example uses TypeOf...Is expressions to test the type compatibility of two object reference variables with various data types.Dim refInteger As Object = 2
MsgBox("TypeOf Object[Integer] Is Integer? " & TypeOf refInteger Is Integer)
MsgBox("TypeOf Object[Integer] Is Double? " & TypeOf refInteger Is Double)
Dim refForm As Object = New System.Windows.Forms.Form
MsgBox("TypeOf Object[Form] Is Form? " & TypeOf refForm Is System.Windows.Forms.Form)
MsgBox("TypeOf Object[Form] Is Label? " & TypeOf refForm Is System.Windows.Forms.Label)
MsgBox("TypeOf Object[Form] Is Control? " & TypeOf refForm Is System.Windows.Forms.Control)
MsgBox("TypeOf Object[Form] Is IComponent? " & TypeOf refForm Is System.ComponentModel.IComponent)In JavaScript:function isNumber(n)
{
return ( typeof n === 'number' );
}
In TypeScript:
function (param: typeof existingObject) { ... }
let newObject: typeof existingObject;
See also
sizeof
decltype
Type introspection
References
Operators (programming) |
https://en.wikipedia.org/wiki/TERN | For the European road project, see Trans-European road network
The Terrestrial Ecosystem Research Network, or TERN by its acronym, is a research network that enables coordinated work across private research centres and Australian government agencies. TERN has also been described as "Australia’s terrestrial ecosystem observatory": it provides empirical data to Australian and foreign institutions. As of 2021, TERN boasted that its infrastructure has been instrumental in the publication of over 1,000 academic articles. NASA says it has used TERN data.
At launch in 2009, its funding included $55 million from the Australian government and $4 million in Queensland government funding. The partners include the University of Queensland, the Queensland University of Technology, Griffith University, CSIRO, the Queensland Department of Environment & Resource Management, and the University of Adelaide, all of which direct TERN.
As of 2021, TERN was funded by NCRIS, an Australian government initiative. TERN itself funds research infrastructure and data collection.
Infrastructure
TERN operates over 700 sites across Australia. As of 2013, TERN had installed 20 flux towers. The Daintree Rainforest Observatory (DRO), in Cape Tribulation, is monitored by TERN.
TERN provides three ranges of infrastructure: environmental monitoring at continental scale, a large collection of research plots, and a more limited collection of intensively monitored sites.
References
External links
Research in Australia
2009 establishments in Australia |
https://en.wikipedia.org/wiki/Video-ready%20access%20device | A video-ready access device (VRAD) provides digital subscriber line access and high-definition television programming to customers subscribed to IPTV services such as AT&T's U-verse, Bell Canada's Bell Fibe TV, Claro Puerto Rico's Claro TV, and Telus's Optik TV. VRAD equipment manufactured by Alcatel-Lucent can be configured to support between 48 and 864 lines per box. The VRAD boxes are composed of circuit boards providing service, fed by fiber-optic cable.
AT&T VRADs
There are 2 types of VRAD systems currently used by AT&T: FTTN (fiber to the node), and FTTP (fiber to the premises).
FTTN, widely used where copper facilities exist in established neighborhoods, uses an Alcatel-Lucent 7330 Intelligent Services Access Manager (ISAM) shelf, which uses the existing copper wiring to customers' homes, leading to distance limitations from the VRAD cabinet to the customer's home. The 7330 ISAM is an internet protocol DSL access multiplexer that supports VDSL and ADSL protocols.
The FTTP system uses an Alcatel-Lucent 7340 ISAM shelf, which is mostly used in areas such as new neighborhoods or large-scale developments where fiber can be run to the household, removing the distance limitations of copper. The 7340 then connects to a Primary Flexibility Point, which distributes service to homes in the neighborhood, via a dual strand fiber, which is then split into 32 customer fiber pairs. In FTTP systems, the fiber pairs are typically led into a customer's residence at the network interface device. In FTTD (fiber to the desk) systems, the fiber can continue to an equipment room or garage, then to a decoder box or residential gateway, then to the customer's TV, computer, and phone lines.
The VRAD typically connects upstream to an Alcatel-Lucent 7450 Ethernet service switch in the central office hub, then to the headend video hub office.
VRADs required for U-verse are around wide, tall, and deep. Size and graffiti risk have drawn complaints from homeowners. AT&T has sued competitor Comcast for Chicago ads against AT&T's "large and unsightly" VRADs. Four VRADs have exploded due to faulty lithium-ion batteries manufactured by Avestor (now bankrupt), at least one explosion sending parts "fifty feet throughout the neighborhood." AT&T replaced all 17,000 Avestor batteries used in its VRADs with safer Alcatel-Lucent-designed SAFT NiCad batteries, which have a 10-year life.
Other VRADs
Bell Canada's Bell Fibe TV and Telus's Optik TV also use VRADs in their networks. Bell Canada uses the Alcatel-Lucent 7330 and Ikanos Communications IKNS ISAMs, and provides Internet service via either FTTN to 50 Mbit/s, or FTTH (fibre to the home) to 1.5 Gbit/s.
Claro Puerto Rico is currently deploying VRADs to offer their IPTV and VDSL Internet service up to 50Mbit/s. There are 2 types of VRAD systems currently used by Claro: FTTN (fiber to the node), and FTTP (fiber to the premises). It is unknown the equipment they are using.
See also
Multi-service access node
References
|
https://en.wikipedia.org/wiki/Acando | Acando (previously AcandoFrontec) was a software, information technology, database and web design consulting firm based in Stockholm Sweden, also operating in Norway, Finland, Denmark and Germany. It counted around 4000 employees when it was acquired by CGI in 2019. The company was acquired on March 11, 2019 when CGI made a bid of SEK 4.3 billion (around €408 million).
History
Founded in 1999, Acando provides consultancy in information technology and Software as a Service (SaaS). As of March, 2008, AcandoFrontec services over 250 clients and employs over 30 people.
In 2004, AcandoFrontec acquired Edge Consulting. Edge Consulting was a software consulting firm founded in 1999, with 15 employees.
In 2006, Acando Frontec acquired Resco. The company renamed as Acando.
In 2014, Acando acquired Connecta with around 800 employees.
In 2019, Acando was acquired by CGI.
Services
Acando consulted with companies on information technology projects and Software-as-a-Service, and built software applications including web sites.
Acando was a reseller and integrator of NetSuite’s ERP/Customer Relationship Management (CRM) Software-as-a-Service applications. Acando was a Microsoft .NET solution provider and Oracle partner.
Acando provided consultancy in project leadership, analysis, design and development for software projects of any size. In addition to web design and software development, Explore also offers Business Intelligence (BI), Data Warehousing design and development and mobile systems design and development.
Awards and Industry Recognition
In 2007, Acando was named to the Inc. 5000, ranking 3,520 nationally, with a three-year average annual sales growth of 83.8%.
See also
AccuSystems
References
External links
Official website
Information technology consulting firms of Sweden
Software companies of Sweden
Companies based in Stockholm County |
https://en.wikipedia.org/wiki/Principle%20of%20orthogonal%20design | The principle of orthogonal design (abbreviated POOD) was developed by database researchers David McGoveran and Christopher J. Date in the early 1990s, and first published "A New Database Design Principle" in the July 1994 issue of Database Programming and Design and reprinted several times. It is the second of the two principles of database design, which seek to prevent databases from being too complicated or redundant, the first principle being the principle of full normalization (POFN).
Simply put, it says that no two relations in a relational database should be defined in such a way that they can represent the same facts. As with database normalization, POOD serves to eliminate uncontrolled storage redundancy and expressive ambiguity, especially useful for applying updates to virtual relations (e.g., view (database)). Although simple in concept, POOD is frequently misunderstood and the formal expression of POOD continues to be refined.
The principle is a restatement of the requirement that a database is a minimum cover set of the relational algebra. The relational algebra allows data duplication in the relations that are the elements of the algebra. One of the efficiency requirements of a database is that there be no data duplication. This requirement is met by the minimum cover set of the relational algebra.
Sources
Database Debunkings: The Principle of Orthogonal Design, Part I, by D. McGoveran and C. J. Date
Database Debunkings: The Principle of Orthogonal Design, Part II, by D. McGoveran and C. J. Date
Database theory |
https://en.wikipedia.org/wiki/National%20Cannabis%20Prevention%20and%20Information%20Centre | The National Cannabis Prevention and Information Centre (NCPIC) was established in 2008 in response to data published in the Pfizer Australia Health Report. NDARC and NCPIC have collaborated with Pfizer Australia to assist with educating the public about cannabis. Many in the Australian community are concerned that this collaboration and NCPIC involvement with GW Pharmaceutical and SATIVEX places NDARC and NCPIC in a position of conflicted interests. In 2016 it was announced that the Australian government would cut funding to the NCPIC at year's end.
While prevalence rates have markedly reduced over the past decade, cannabis is still widely used by young people, and the impacts on adolescent development remain an important issue.
The key goals of the Centre are:
providing the Australian community with cannabis information resources about cannabis
supporting service providers to respond to those experiencing problems related to cannabis
specifically engaging young people to reduce and prevent cannabis uptake
Rationale
The National Cannabis Prevention and Information Centre was established in response to data published in the Pfizer Australia Health Report. NDARC and NCPIC have collaborated with Pfizer Australia to assist with educating the public about cannabis. Many in the Australian community are concerned that this collaboration and NCPIC involvement with GW Pharmaceutical and SATIVEX places NDARC and NCPIC in a position of conflicted interests.
The NCPIC mission is to reduce the use of cannabis in Australia by preventing uptake and providing the community with evidence-based information and interventions. Despite this mission, NCPIC has been seen to publish fabricated and misleading cannabis information in the past.
The Centre closed its doors after losing Commonwealth funding in December 2016.
See also
Cannabis in Australia
Illicit drug use in Australia
References
External links
National Drug and Alcohol Research Centre
Cannabis research
2008 establishments in Australia
Cannabis in Australia
2008 in cannabis |
https://en.wikipedia.org/wiki/The%20Wing%20of%20Madoola | is a 1986 action-platform video game developed and published by Sunsoft for the Family Computer. It stars Lucia, a magic-wielding warrior chosen by the Rameru clan. Darutos, a descendant of the Rameru line, found the Wing of Madoola statue and used it to summon demons, taking over his family's castle and plans to conquer the world. Lucia must retrieve the wing and stop Darutos. Through the journey, the player explores and search for items and power-ups to increase Lucia's attributes, while fighting enemies and defeating bosses.
The Wing of Madoola was designed by Kenji Sada, being his first project at Sunsoft after joining the company in 1986, and developed over the course of six months. Sada acted as the game's main programmer, planner, and team lead. He intended to make an action game and choose a female lead for the game, a decision he felt gave character to the title. Artist Kenji "Moriken" Mori acted as character designer. The music was composed by Naoki Kodaka, with assistance by sound programmer Naohisa Morota.
The Wing of Madoola garnered mixed reception from critics and retrospective commentarists. The game was supplemented with manga adaptations and music albums. The character of Lucia would make appearances in other titles, including a doujinshi adventure game released for PC in 2009, and became a popular Sunsoft character among Japanese retro gaming fans.
Gameplay and premise
The Wing of Madoola is a side-scrolling action-platform game with role-playing elements, similar to Athena (1986). The story in set in the kingdom of Badham, which hosted a bird statue known as the Wing of Madoola. The wing grants power to rule the world to the one who possessed it, which caused many wars between nations to have control over it. A king of the Rameru family managed to obtain the wing, ordering to hide it to cease wars. Darutos, a descendant of the Rameru line, found the statue and used it to summon demons, taking over his family's castle and plans to conquer the world. Lucia, a magic-wielding warrior chosen by the Rameru clan, must retrieve the wing and stop Darutos.
The player controls Lucia and fights against enemies across 16 stages. The main objective of each stage is to locate and defeat a boss, and collect a crystal ball under their possession in order to gain entrance to the next stage. Lucia can jump, climb ladders, crouch, attack with her sword, and use magic. The player explores and searches for items and power-ups to increase Lucia's maximum health and attributes. These items and power-ups include boots which augment her overall speed and jumping abilities, swords to increase attack strength, health jars, and spell books. There are six types of magical attacks, ranging from flame swords to flash magic.
The game is considered to be difficult to beat. Enemies inflict large amounts of damage, and many continue to attack Lucia with multiple consecutive hits. Enemies can also withstand a tremendous amount of damage before being defea |
https://en.wikipedia.org/wiki/Japan%20FM%20League | The Japan FM League (JFL; ) is a Japanese commercial radio network. It is organised by J-Wave and was established on 1 October 1993.
JFL's main ideal is to respect the operation of each of its affiliates, letting each affiliate flourish under its own terms. The network is a co-operative, with each affiliate offering its resources when useful. So, for example, when J-Wave wants to air a concert or ask for interviews when a group tours in Nagoya, it can easily borrow the studios of Zip FM (the JFL affiliate there) to help produce what's needed.
List of affiliates
Former affiliate station
Programmes
Hot 100
References
External links
Japan FM League at J-Wave
Radio in Japan
Mass media in Tokyo
Japanese radio networks
Radio stations established in 1993 |
https://en.wikipedia.org/wiki/Transport%20in%20Hobart | The city of Hobart, Tasmania is served by a wide variety of transport. While the city's main form of transport is private transport on the road network, transport is also available by bus, ferry and aircraft. A suburban train service operated between Hobart and Brighton from the 1870s until 31 December 1974. There has been, however, talk in recent years of reinstating a train service in the northern suburbs.
Public transport
Public transport in Hobart has been provided exclusively by buses since 1968. Trams ran in Hobart from 1893 to 1960 and were briefly replaced by trolleybuses, from 1960 to 1968.
The low population density of Hobart has resulted in the creation of bus routes which cover a wide area and operate at a low frequency. The consequence is that bus travel is not competitive with travel by car, because routes are often lengthy and indirect, meaning that passengers can take a long time to reach their final destination. This has contributed to Hobart having the second-lowest public transport patronage in Australia.
Since the completion of the Brighton Transport Hub, the former rail line through inner Hobart has fallen into disuse. Serious constraints in the road network, along with low-frequency bus services, have led to ongoing discussion of introducing light rail to Hobart. It would make use of the rail corridor, creating a new express route to Hobart. The proposed light rail system is known as Riverline or the Northern Suburbs Railway.
Taxis and limousines operate with no ties to Metro. Taxi Combined and Yellow Cabs run the large fleets of taxicabs in Hobart.
Bicycle
There are many bike tracks in the greater Hobart area, one of the most notable being the intercity bike track which runs from Hobart 12 km north to Glenorchy along an unused rail line of the Hobart–Bridgewater rail corridor. Other bike routes travel through Mount Wellington and the waterfront of the River Derwent at various locations.
Road
The release of the Hobart Area Transportation Study in 1964 has influenced the use of cars as the dominant mode of transport in Hobart. The Davey/Macquarie couplet expand east-west along the southern fringe of the city centre connecting the three major highways; the Southern Outlet, the Tasman Highway and the Brooker Highway which expand out to the outer suburbs. These highways are in turn supported by secondary arterial roads; Goodwood, Sandy Bay and Main Roads as well as the East Derwent and South Arm Highways.
Water
Several private ferry operators run are based in Sullivans Cove for commuter, tourist and leisure purposes. Destinations include Port Arthur on the Tasman Peninsula, Peppermint Bay at Woodbridge, the eastern shore town centre of Bellerive, Wrest Point Casino in Sandy Bay, and Museum of Old and New Art in Berriedale.
Hobart has the second deepest natural port in the world, second to only Rio de Janeiro in Brazil. As a result, it sees an extensive cruise ship calendar, with approximately 30 ships berthing at S |
https://en.wikipedia.org/wiki/Uppsala%20Conflict%20Data%20Program | The Uppsala Conflict Data Program (UCDP) is a data collection program on organized violence, based at Uppsala University in Sweden. The UCDP is a leading provider of data on organized violence and armed conflict, and it is the oldest ongoing data collection project for civil war, with a history of almost 40 years. UCDP data are systematically collected and have global coverage, comparability across cases and countries, and long time series. Data are updated annually and are publicly available, free of charge. Furthermore, preliminary data on events of organized violence in Africa is released on a monthly basis.
The UCDP's data is published annually in the Journal of Peace Research. The UCDP also makes its data publicly available through its interactive website, UCDP website.
Background
The UCDP began recording information on ongoing violent conflicts in the 1980s. It became clear that more systematic and global data on armed conflicts was necessary for conducting research in the expanding academic discipline of peace and conflict studies.
Initially, the program collected data only on so-called "armed conflicts", defined as fighting exceeding 25 battle-related deaths between two actors of which at least one was a state. In later years, the data collection grew, and the program began collecting data on "non-state conflicts" (where neither actor is a state) and "one-sided violence" (where an organized actor attacks unarmed civilians).
One of the leading researchers associated with the UCDP is Professor Peter Wallensteen that founded and led the program since its initiation until 31 July 2015. After this Wallensteen continued to serve as a Senior Advisor for the UCDP.
Organization
The UCDP is based at the Department of Peace and Conflict Research of Uppsala University in Sweden. The program is led by Associate Professor Magnus Öberg, and employs approximately 10-15 research assistants and researchers. A number of scholars and Ph.D. candidates are also affiliated with the program. In addition to collecting data, the program disseminates knowledge on trends and dynamics of armed conflict to the public via lectures at academic and government forums, as well as through participating in conferences and exhibitions such as the Swedish Forum for Human Rights.
Cooperation
UCDP is part of several important collaborations, for instance the extensive and well-established collaborations with the Peace Research Institute Oslo (PRIO) in Norway. Additionally, UCDP works closely with the Violence Early-Warning System (ViEWS) project at Uppsala University, Sweden, as well as with Varieties of Democracy (V-Dem) and the Quality of Government Institute (QoG), both based at the University of Gothenburg, Sweden. UCDP was part of the European Network for Conflict Research (ENCoRE), a network funded by Cooperation in Science and Technology (COST) of the European Union, which included all the leading research institutes in Europe that conduct quantitative and data dr |
https://en.wikipedia.org/wiki/Diva%20Universal%20%28Italian%20TV%20channel%29 | Diva Universal was an Italian television channel owned by Universal Networks International Italia, and broadcast on SKY Italia Channel 128 (Entertainment package).
Until 31 March 2011, the channel was named Hallmark Channel.
Hallmark Channel was owned by the privately backed Sparrowhawk Media Group, until late 2007 when the company was bought by NBCUniversal.
On 30 June 2015, Diva Universal Italy was permanently discontinued at midnight.
Programmes
7th Heaven
A Touch of Frost
Agatha Christie's Poirot
Dallas
Dalziel and Pascoe
Diagnosis Murder
Doc Martin
Downton Abbey
Father Dowling Mysteries
Inspector Morse
Intelligence
Judging Amy
Kojak
L.A. Dragnet
Lewis
McLeod's Daughters
Ghost Squad
Miami Vice
Monk
Rain Shadow
Spooks
The 10th Kingdom
The Agency
Two Twisted
Wild at Heart
See also
Hallmark Channel
Hallmark Channel (International)
Hallmark Channel (UK)
References
External links
Official Site
Defunct television channels in Italy
Universal Networks International
Television channels and stations established in 2005
Television channels and stations disestablished in 2015
2005 establishments in Italy
2015 disestablishments in Italy
Italian-language television stations |
https://en.wikipedia.org/wiki/Jonathan%20Oxer | Jonathan Oxer (born 26 July 1970, London, England) is a computer programmer, Debian developer, author, entrepreneur, and Free Software activist. He lives in Melbourne, Australia with his wife and their two children.
Early life and education
Jonathan Oxer was born at St Mary Abbott's Hospital in London, England to Australian parents who were working in London at the time. In late 1970 his parents returned to Melbourne, Australia.
Oxer's primary education was at Blackwood Community School, a small alternative school created in the mid-1970s by a group of parents. The school was known for having an unstructured learning program that mixed students across all year levels and did not use scheduled class times.
Oxer's secondary education was at St Michael's Grammar School where he completed his Higher School Certificate (HSC) in 1989. In 1987 Oxer was one of a group of students from the school who conducted an extra-curricular project to use information published by researchers at IBM Zurich, the University of Alabama, and the University of Houston to create a sample of yttrium-barium-copper-oxide (YBCO) superconductor capable of exhibiting superconducting properties at the temperature of liquid nitrogen, which at the time was the highest-temperature superconductor yet created Oxer's contributions to the project included writing software to plot the optimum cooling curve of the material to maximise crystal alignment during the annealing process.
Career
In 1994 Oxer founded Mission Internet, one of the first companies in the world to specialise in connecting database content to the Internet. In 2000 Mission Internet's operations became part of Internet Vision Technologies, a company formed in partnership with Andrew Minett.
IVT was acquired by Advanced Solutions International (ASI) on 8 June 2017.
Oxer is currently Director at Freetronics.
Additionally, Oxer runs a site and YouTube channel SuperHouse featuring DIY video tutorials on home automation.
Free Software
Debian Project
Oxer was admitted to the Debian Project in August 2002. He subsequently convened the Debian Miniconf in a different city every year in conjunction with Linux.conf.au: Perth in 2003, Adelaide in 2004, Canberra in 2005, Dunedin (New Zealand) in 2006, Sydney in 2007, and Melbourne in 2008.
Linux Australia Inc
Oxer was elected President of Linux Australia on 25 January 2005, serving three consecutive terms. He was also nominated for the 2008 election but did not accept the nomination.
Early in his first term Oxer was the focus of controversy surrounding the application for a trademark in Australia for the term "Linux". In many countries the trademark "Linux" is registered by or on behalf of the Linux Mark Institute, an organisation which administers the trademark on behalf of Linus Torvalds. Following an attempt by an unassociated commercial entity known as Linux Australia Pty Ltd to register the trademark within Australia, Linux Australia agreed to act as an agent of Linu |
https://en.wikipedia.org/wiki/VNL | VNL may refer to:
Atomistix Virtual NanoLab
von Neumann-Landauer, see Reversible computing
Video Networks Limited (1992–2006), British company acquired by Tiscali in 2006
Victorian Netball League
VNL, a numerics library, part of the VXL collection
For the Netherlands (), Dutch political party established by Groep Bontes/Van Klaveren
Victor Nilsson Lindelöf, Swedish footballer currently playing for Manchester United
FIVB Volleyball Nations League (Men's) (Women's) |
https://en.wikipedia.org/wiki/Cyber%20Sunday%20%282008%29 | Cyber Sunday was the fifth annual and final Taboo Tuesday/Cyber Sunday professional wrestling pay-per-view (PPV) event produced by World Wrestling Entertainment (WWE). It was held for wrestlers from the promotion's Raw, SmackDown, and ECW brand divisions. The event took place on October 26, 2008, at the US Airways Center in Phoenix, Arizona. The theme of the event was that fans could vote on certain aspects of every match. While it was the fifth event in this interactive PPV's chronology, it was the third titled Cyber Sunday as the first two events were titled Taboo Tuesday. In 2009, Cyber Sunday was replaced by Bragging Rights.
Eight professional wrestling matches and one miscellaneous segment were featured on the event's card. The event received 153,000 pay-per-view buys, less than the previous year's event. It was also the first Cyber Sunday PPV broadcast in high definition.
Production
Background
Cyber Sunday, originally known as Taboo Tuesday, was an annual pay-per-view (PPV) event produced by World Wrestling Entertainment (WWE) since 2004. A unique feature of the event was the ability for fans to vote on certain aspects of every match. Because of this, the event was billed as an "interactive pay-per-view." The 2008 event was the third event to be titled Cyber Sunday, but the fifth overall in the Taboo Tuesday/Cyber Sunday chronology. It was held on October 26, 2008, at the US Airways Center in Phoenix, Arizona and featured wrestlers from the Raw, SmackDown, and ECW brands.
Storylines
Unlike other WWE events where the stipulations were determined by WWE's creative staff, stipulations for matches were determined by votes from WWE fans conducted on WWE's website and by text messaging. The event was scheduled to feature eight professional wrestling matches and one miscellaneous segment. Although the stipulations resulted from votes by WWE fans, different wrestlers were involved in pre-existing scripted feuds, plots and storylines, which led to scheduled matches in which WWE fans could vote upon stipulations. Wrestlers were portrayed as either villains or fan favorites as they followed a series of tension-building events. All wrestlers were from either the ECW, Raw, or SmackDown brands – a storyline division in which WWE assigned its employees to a different television program.
The main feud from the Raw brand was over the World Heavyweight Championship. On the October 6, 2008, episode of Raw, general manager Mike Adamle announced that World Heavyweight Champion Chris Jericho would defend his title against Batista in a standard wrestling match, also known as a singles match, in which a guest referee would be voted for by WWE fans; the candidates for the position were Randy Orton, Shawn Michaels, and Stone Cold Steve Austin. Earlier that night, it was also announced that Santino Marella would defend his WWE Intercontinental Championship against a former Intercontinental Champion voted for by the WWE fans; the candidates were Roddy Piper, Go |
https://en.wikipedia.org/wiki/Kenji%20Kasahara | is a Japanese entrepreneur who founded Mixi, a social networking site. He is ranked as the 37th richest Japanese person.
Timeline
1997: (21 years old)
Created the job information website Find Job!.
1999: (23 years old)
Founded eMercury Inc.
2004: (28 years old)
Launched the Social network service Mixi.
2008: (32 years old)
He climbed onto 37th of Japan's 40 Richest. Forbes reported Kasahara as having $740 million.
2015: (39 years old)
He launched FamilyAlbum, a Private Family Photo-Sharing App.
References
External links
Interview by CNN
Brand NEW!!!
Living people
Japanese businesspeople
People from Minoh, Osaka
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Sheffield%20Software%20Engineering%20Observatory | The Sheffield Software Engineering Observatory (Observatory) was founded in 2005 by an EPSRC grant at the University of Sheffield. The Observatory is a multi-disciplinary collaboration between the Department of Computer Science and the Institute of Work Psychology at the University of Sheffield.
Overview
Its aim is to understand the processes that makes for good software engineering practice, and how are these needs to combine human and technical factors.
The Software Engineering Observatory is an empirical software engineering research facility where researchers can use a variety of methodologies to study software developers working on real industrial projects. The software developers are students, both undergraduate and postgraduate and up to 20 group projects were undertaken each year. Thus, researchers can investigate how software developers work in teams, deal with industrial clients and handle the plethora of problems that arise in group projects with tight time-scales.
A key feature is that the Observatory allows multiple teams to work on identical projects concurrently in competition with each other, which allows comparisons to be made of different software development processes.
The Observatory enables researchers to gather data that are relevant to many of the key issues in contemporary software engineering, which will be of interest to both academics and practitioners. The implications of the results so far are that effective software managers must not just understand the technical aspects of the work that their staff are doing, but must also understand their staff as individuals and how they can best work together in teams.
Research areas
The Observatory’s research agenda includes:
Assessing, through controlled experiments, the relative merits of software development methods and methodologies in terms of both the quality of output and the well-being of the developers.
Devising empirically-based models of the processes that developers are observed to use
Identifying the factors that make for good team-based software development, including leadership, the personality, skill, gender and ethnic mix of teams, and how task conflict can contribute, constructively, to enhanced performance.
Investigating the relative importance of (a) the methodology adopted by the team and degree of fidelity to it, (b) the individual’s participant’s motivation and knowledge, and (c) team processes in accounting for variability in the performance of the group.
The data from these experiments will be made available to bona-fide researchers in empirical software engineering.
History
The Observatory was founded in 2005, however prior to that a number of PhD students designed experiments and collected data on the software engineering process. These were all based on the pioneering taught courses devised at the University of Sheffield
References
External links
Software Observatory homepage
epiGenesys - a University of Sheffield company
University |
https://en.wikipedia.org/wiki/Village%20Telco | Village Telco is an initiative to build low-cost community telephone network hardware and software. It is based on a suite of open-source applications that enable entrepreneurs to set up and operate a telephone service in a specific area or supporting the needs of a specific community.
The first Village Telco network was established by Dabba at Orange Farm, a township in the City of Johannesburg Metropolitan Municipality (South Africa). Users can make free local calls to other Dabba subscribers, as well as use pay-as-you-go vouchers to make calls to 'phones on other networks.
Technically, a Village Telco system consists of:
a mesh network made up of Wi-Fi mini-routers combined with an analogue telephone adaptor (aka 'Mesh Potato')
SIP phones
a pay-as-you-go billing and management system
a SIP/VOIP server
least cost routing equipment
These components together comprise an easy-to-use, standards-based, wireless, local, do-it-yourself, telephone company toolkit. The goal of bringing these together is to make local telephony in developing countries to be so cheap as to be virtually free. This has become possible thanks to advances in open source telephony software and the dramatic decrease in the cost of wireless broadband technology.
See also
Personal Telco Project, which is a wireless community network project running in Portland, Oregon.
South African wireless community networks: Orange Farm and the Mesh Potato
References
External links
Village Telco blog
Village Telco wiki
Village Telco Development Group
Telecommunications in South Africa
Economy of Johannesburg
Mesh networking |
https://en.wikipedia.org/wiki/Minimum%20weight | The minimum weight is a concept used in various branches of mathematics and computer science related to measurement.
Minimum Hamming weight, a concept in coding theory
Minimum weight spanning tree
Minimum-weight triangulation, a topic in computational geometry and computer science |
https://en.wikipedia.org/wiki/Inbi%20Line | The is a railway line operated by the West Japan Railway Company (JR West) between Tottori, Tottori Prefecture and Tsuyama, Okayama Prefecture, Japan.
Route data
Operating Company:
West Japan Railway Company (Services and tracks)
Distance:
Tottori — Tsuyama: 70.8 km (44.0 mi)
Gauge:
Stations: 19
Double-tracking: None
Electrification: Not electrified
Railway signalling:
Special automatic occlusive (track circuit detection type)
Stations
●: Stop ▲: Some services stop ｜: Pass
Rolling stock
Local
KiHa 47
KiHa 120
KiHa 121 and KiHa 126 series
Chizu Express HOT3500
Wakasa Railway WT3000 and WT3300
Limited Express
KiHa 187 series (Super Inaba)
Chizu Express HOT7000 series (Super Hakuto)
History
The Inbi Line was built by the Japanese Government Railway, with the first section opened from Tottori to Mochigase in 1919, extended to Chizu in 1923. The Tsuyama to Mimasaka-Kamo section, opened in 1928, was extended to Mimasaka-Kawai in 1931 and the line was completed with the opening of the section to Chizu (including a 3,077 m tunnel) in 1932.
CTC signalling was commissioned between Tottori and Chizu in 1994.
See also
List of railway lines in Japan
References
1067 mm gauge railways in Japan
Lines of West Japan Railway Company
Rail transport in Okayama Prefecture
Rail transport in Tottori Prefecture |
https://en.wikipedia.org/wiki/Computer%20graphics%20%28disambiguation%29 | Computer graphics are graphics created by computers and, more generally, the representation and manipulation of pictorial data by a computer.
Computer graphics may also refer to:
2D computer graphics, the application of computer graphics to generating 2D imagery
3D computer graphics, the application of computer graphics to generating 3D imagery
Computer animation, the art of creating moving images via the use of computers
Computer-generated imagery, the application of the field of computer graphics to special effects in films, television programs, commercials, simulators and simulation generally, and printed media
Computer graphics (computer science), a subfield of computer science studying mathematical and computational representations of visual objects
Computer Graphics (publication), the journal by ACM SIGGRAPH
Computer Graphics: Principles and Practice, the classic textbook by James D. Foley, Andries van Dam, Steven K. Feiner and John Hughes
See also
Display device, the hardware used to present computer graphics
Graphics hardware, the computer hardware used to accelerate the creation of images |
https://en.wikipedia.org/wiki/Daniel%20Gillespie | Daniel Thomas Gillespie ( ; 15 August 1938 – 19 April 2017) was a physicist who is best known for his derivation in 1976 of the stochastic simulation algorithm (SSA), also called the Gillespie algorithm. Gillespie's broader research has produced articles on cloud physics, random variable theory, Brownian motion, Markov process theory, electrical noise, light scattering in aerosols, and quantum mechanics.
Education
Born in Missouri, Gillespie grew up in Oklahoma where he graduated from Shawnee High School in 1956. In 1960 he received his B.A. (magna cum laude and Phi Beta Kappa) with a major in physics from Rice University.
Gillespie received his Ph.D. from Johns Hopkins University in 1968 with a dissertation in experimental elementary particle physics under Aihud Pevsner. Part of his dissertation derived procedures for stochastically simulating high-energy elementary particle reactions using digital computers, and Monte Carlo methodology would play a major role in his later work. During his graduate student years at JHU he was also a Jr. Instructor (1960–63) and an Instructor (1966-68) in the sophomore General Physics course.
Career
From 1968 to 1971, Gillespie was a Faculty Research Associate at the University of Maryland College Park's Institute for Molecular Physics. He did research in classical transport theory with Jan Sengers. In 1971 he was also an Instructor in the University's Physics Department.
From 1971 to 2001, Gillespie was a civilian scientist at the Naval Weapons Center in China Lake, California. Initially he was a Research Physicist in the Earth and Planetary Sciences Division. There his research in cloud physics led to a procedure for simulating the growth of raindrops in clouds, and that prompted his paper on the SSA. In 1981 he became Head of the Research Department's Applied Mathematics Research Group, and in 1994 he was made a Senior Scientist in the Research Department. He retired from China Lake in 2001.
From 2001 to 2015, Gillespie was a private consultant in computational biochemistry, working under contract for various periods of time with the California Institute of Technology, the Molecular Sciences Institute (in Berkeley), the Beckman Institute at Caltech, and the University of California, Santa Barbara. Most of this was in collaboration with the Linda Petzold research group in the Computer Sciences Department of UCSB.
Books by Gillespie
Was in print from 1970 to 1986 by International Textbook Co., International Textbook Co. Ltd, Halstead Press, and Editorial Reverte (Spanish translation).
A short biography of radio and television comedy writer Tom Koch, focusing mainly on his work for Bob and Ray.
An Errata List for this book, including a heavily revised Sec. 5.6, can be downloaded free from the book’s webpage on the publisher’s website.
References
External links
Institute for Physical Science and Technology
Jan V. Sengers
1938 births
2017 deaths
American physicists
Probability theorists
Ri |
https://en.wikipedia.org/wiki/Google%20Code%20Jam | Google Code Jam was an international programming competition hosted and administered by Google. The competition began in 2003. The competition consists of a set of algorithmic problems which must be solved in a fixed amount of time. Competitors may use any programming language and development environment to obtain their solutions. From 2003 to 2007, Google Code Jam was deployed on Topcoder's platform. Since 2008 Google has developed their own dedicated infrastructure for the contest.
Between 2015 and 2018, Google also ran Distributed Code Jam, with the focus on distributed algorithms. This was run in parallel with the regular Code Jam, with its own qualification and final round, for a top prize of $10,000, but was only open for people who qualified to Round 2 of Code Jam (up to 3000 people).
Several Google Code Jam problems have led to academic research.
On February 22, 2023, Google announced that Code Jam was to be discontinued alongside their other programming competitions, Hash Code and Kick Start. A series of four "farewell rounds" took place on April 15, 2023 from 14:00 until 18:00 UTC, with all rounds taking place at the same time. Login functionality for Google's programming competitions was disabled on June 1, 2023, followed by the shut down of the competitions' hosting platform exactly one month later, on July 1, 2023. A permanent archive of all Code Jam, Hash Code and Kick Start problems is available for download on GitHub.
Past winners
Google Code Jam
Distributed Code Jam
Results by country
See also
Google Code
Online judge
Topcoder Open
References
https://code.google.com/codejam/contest/7214486/scoreboard
https://code.google.com/codejam/contest/2437491/scoreboard?c=2437491
External links
Google – Code Jam
Code Jam
Programming contests |
https://en.wikipedia.org/wiki/Universal%20approximation%20theorem | In the mathematical theory of artificial neural networks, universal approximation theorems are results that put limits on what neural networks can theoretically learn, i.e. that establish the density of an algorithmically generated class of functions within a given function space of interest. Typically, these results concern the approximation capabilities of the feedforward architecture on the space of continuous functions between two Euclidean spaces, and the approximation is with respect to the compact convergence topology. What must be stressed, is that while some functions can be arbitrarily well approximated in a region, the proofs do not apply outside of the region, i.e. the approximated functions do not extrapolate outside of the region. That applies for all non-periodic activation functions, i.e. what's in practice used and most proofs assume.
However, there are also a variety of results between non-Euclidean spaces and other commonly used architectures and, more generally, algorithmically generated sets of functions, such as the convolutional neural network (CNN) architecture, radial basis functions, or neural networks with specific properties. Most universal approximation theorems can be parsed into two classes. The first quantifies the approximation capabilities of neural networks with an arbitrary number of artificial neurons ("arbitrary width" case) and the second focuses on the case with an arbitrary number of hidden layers, each containing a limited number of artificial neurons ("arbitrary depth" case). In addition to these two classes, there are also universal approximation theorems for neural networks with bounded number of hidden layers and a limited number of neurons in each layer ("bounded depth and bounded width" case).
Universal approximation theorems imply that neural networks can represent a wide variety of interesting functions with appropriate weights. On the other hand, they typically do not provide a construction for the weights, but merely state that such a construction is possible. To construct the weight, neural networks are trained, and they may converge on the correct weights, or not (i.e. get stuck in a local optimum). If the network is too small (for the dimensions of input data) then the universal approximation theorems do not apply, i.e. the networks will not learn. What was once proven about the depth of a network, i.e. a single hidden layer enough, only applies for one dimension, in general such a network is too shallow. The width of a network is also an important hyperparameter. The choice of an activation function is also important, and some work, and proofs written about, assume e.g. ReLU (or sigmoid) used, while some, such as a linear are known to not work (nor any polynominal).
Neural networks with an unbounded (non-polynomial) activation function have the universal approximation property.
The universal approximation property of width-bounded networks has been studied as a dual of classical univers |
https://en.wikipedia.org/wiki/Al%20Madrigal | Alessandro Liborio Madrigal (born July 4, 1971) is an American comedian, writer, actor and producer. He is a co-founder of the All Things Comedy podcast network, alongside Bill Burr. He rose to fame on The Daily Show with Jon Stewart as a regular correspondent for five seasons. Outside of the standup world, he is known for his co-starring roles in the film Night School, Showtime's dark comedy I'm Dying Up Here, NBC's About A Boy, as well as CBS sitcoms Gary Unmarried and Welcome to The Captain. He has also performed on Conan and The Tonight Show Starring Jimmy Fallon.
He appeared in the sports drama The Way Back, starring Ben Affleck and directed by Gavin O'Connor. He appears in the Sony's Spider-Man Universe film Morbius as Alberto "Al" Rodriguez.
Early life
Madrigal was born in San Francisco, California. He grew up in San Francisco's Inner Sunset District, where his neighbors included future comedians Mike Pritchard and Margaret Cho. His father is Mexican (from Tijuana) and his mother is Sicilian. He attended Ecole Notre Dame Des Victoires, a private Catholic school in San Francisco that emphasizes instruction of French language and culture. He attended St. Ignatius College Preparatory High School for the class of 1989. He then attended the University of San Francisco.
Madrigal worked for 10 years in a human resources staffing agency run by his family, where one of his main responsibilities was firing people. He often worked humor into the job. He credits his experiences at the staffing company with preparing him for stand-up comedy: "I was in so many scary situations ... by the time I got on stage, I had no stage fright. Speaking in front of a group was nothing." In 1998, he decided to pursue a full-time career in comedy.
Career
Stand-up comedy
Madrigal's stand-up comedy is story-based, centering on his personal life, family, and the confusion caused by his multiethnic background. Early in his comedy career, he was often pigeonholed as a "Latino comic." Madrigal says he has been criticized as not being Latino enough, such as for not speaking Spanish.
Madrigal began his career in San Francisco's comedy clubs, both as a solo performer and as a member of the sketch group Fresh Robots, which he co-founded. In 2002, he enjoyed his first major exposure in two comedy festivals: SF Sketchfest, as part of Fresh Robots, and the "New Faces" showcase of the Just for Laughs Festival in Montreal.
In 2004, Madrigal won a jury award for best stand-up comedian at the U.S. Comedy Arts Festival in Aspen, Colorado. After winning the award, he signed a talent holding deal with CBS.
Madrigal's Comedy Central Presents half-hour special premiered in July 2005. In April 2013, Madrigal's first one-hour special, "Why Is The Rabbit Crying?," also premiered on Comedy Central. The special was named one of the top 10 comedy specials of 2013 by both Westword and The Village Voice and was praised for "deconstructing stereotypes rather than enforcing them" and "milking |
https://en.wikipedia.org/wiki/Spr%C3%A5kf%C3%B6rsvaret | Språkförsvaret (, "the language defence") is a politically independent network working to strengthen the Swedish language in Sweden and Finland. It was established in 2005.
External links
Swedish language
Cultural organizations based in Sweden
2005 establishments in Sweden
Organizations established in 2005 |
https://en.wikipedia.org/wiki/Semantic%20mapping | Semantic mapping can refer to:
Semantic matching, in computer science, a matching to exchange information in a semantically sound manner, because of the semantic heterogeneity
Semantic mapping (statistics), a dimensionality reduction method in statistics
Semantic mapping (literacy), a technique in which graphical models are used to help school students learn vocabulary
Semantic mapping, the transformation of data elements from one namespace into another namespace on the Semantic Web, performed by a semantic mapper |
https://en.wikipedia.org/wiki/Catch%2021 | Catch 21 is an American game show broadcast by Game Show Network (GSN). Created by Merrill Heatter (who also produced the show's predecessor Gambit), the series follows three contestants as they play a card game centered on blackjack and trivia. The show is based on a popular online game from GSN's website and aired for four seasons from 2008 to 2011. It was hosted by Alfonso Ribeiro, with actress Mikki Padilla serving as the card dealer.
The show received positive critical reception as a whole, the series itself was hailed as "a fun game with a solid concept" while Ribeiro was praised as "hands-down, one of the best game show hosts out there." Additionally, the series was acquired by Bounce TV in 2013, with the network hopeful it could "add fuel" to the channel's growing momentum. GSN revived the series on October 14, 2019, with Ribeiro returning to host and Witney Carson as the card dealer. As of 2021, reruns air on its sister channel GetTV.
Gameplay
Main game
2008 version
Three contestants are each given a card to start a blackjack hand from a standard 52-card deck shuffled prior to taping. The host reads questions and the first contestant to answer correctly is dealt a card. The contestant who answers correctly can freeze their hand, preventing them from receiving additional cards or reveal the next card from the top of the deck.
After revealing the card, the contestant can either accept it for themselves or pass it to one of their opponents who has not yet frozen. If keeping a card, the contestant in control is given another chance to freeze. However, once a contestant has frozen, the remaining contestants must freeze at a score higher than that contestant, ties are not permitted. A contestant is eliminated from the round if their hand exceeds 21.
The process is repeated with additional questions and cards until two contestants have frozen or busted. A contestant whose score reaches 21 exactly instantly wins the round. Beginning in season two of the original series, a bonus prize is given to the contestant regardless of the outcome of the game. If two contestants bust, the remaining contestant automatically wins the round. If only one contestant has not yet frozen or busted, no additional questions are asked; the remaining contestant continues drawing cards until either beating the highest frozen hand or busting. The winner of the round receives a power chip to use in the bonus round, assuming that contestant gets that far. The original series used point scores in the first two rounds, with 100 points awarded for a correct answer, and 500 points for winning the hand. After two rounds, the contestant with the lowest score is eliminated.
If there is a tie for the lowest score, the players involved participate in a high-card draw. Each player is given the choice of taking the first or second card off the top of the deck, without being able to see either card before making their selection. The player who draws the higher card advances.
T |
https://en.wikipedia.org/wiki/Beijing%20Suburban%20Railway | BCR (Beijing City Rail) also known as Beijing Suburban Railway is a commuter rail service that connects urban Beijing with outlying districts beyond the reach of the city's Beijing Subway network. The suburban rail services run on existing China Railway lines.
The suburban rail services are managed by the China Railway Beijing Group, an agency of the Ministry of Railways that is not affiliated with the operators of Beijing Subway.
There are 4 suburban railway corridors currently in operation: Line S2, Sub-Central line, Huairou–Miyun line and Tongmi line.
In operation
History
6 August 2008: Line S2 opened.
21 December 2012: Line S2 (branch) opened
1 November 2016: Line S2 (main line and branch line) — was diverted from Beijingbei (North) to Huangtudian.
31 December 2017: Sub-Central line and Huairou–Miyun line opened.
30 April 2019: Huairou–Miyun line — Yanqihu station (formerly known as Fangezhuang) opened, and the northern destination was extended to Gubeikou.
20 June 2019: Sub-Central line — Eastern extension to Qiaozhuangdong (East).
30 December 2019: Huairou–Miyun line — was diverted from Huangtudian to Qinghe.
30 March 2020: Line S2 (main line) — shortened to Badaling railway station for Yanqing railway station renovation, free shuttle bus is offered to Yanqing urban area.
30 June 2020: Sub-Central line — Western extension to Liangxiang. Tongmi line opened.
1 August ~ 20 August 2020: Huairou–Miyun line — whole line stop service for the Beijing–Tongliao railway electrification project.
30 September 2020: Huairou–Miyun line — Southern extension to Beijingbei (North).
1 December 2020: Line S2 (main line) — Yanqing railway station reopened.
Short-term planning
See also
Beijing Subway
References
External links
Railway lines in China
Rail transport in Beijing |
https://en.wikipedia.org/wiki/Knowledge%20retrieval | Knowledge retrieval seeks to return information in a structured form, consistent with human cognitive processes as opposed to simple lists of data items. It draws on a range of fields including epistemology (theory of knowledge), cognitive psychology, cognitive neuroscience, logic and inference, machine learning and knowledge discovery, linguistics, and information technology.
Overview
In the field of retrieval systems, established approaches include:
Data retrieval systems, such as database management systems, are well suitable for the storage and retrieval of structured data.
Information retrieval systems, such as web search engines, are very effective in finding the relevant documents or web pages.
Both approaches require a user to read and analyze often long lists of data sets or documents in order to extract meaning.
The goal of knowledge retrieval systems is to reduce the burden of those processes by improved search and representation. This improvement is needed to leverage the increasing data volumes available on the Internet.
Comparison with data and information retrieval
Data Retrieval and Information Retrieval are earlier and more basic forms of information access.
Knowledge retrieval focuses on the knowledge level. We need to examine how to extract, represent, and use the knowledge in data and information. Knowledge retrieval systems provide knowledge to users in a structured way. Compared to data retrieval and information retrieval, they use different inference models, retrieval methods, result organization, etc. Table 1, extending van Rijsbergen's comparison of the difference between data retrieval
and information retrieval, summarizes the main characteristics of data retrieval, information retrieval, and knowledge retrieval. The core of data retrieval and information retrieval is retrieval subsystems. Data retrieval gets results through Boolean match. Information retrieval uses partial match and best match. Knowledge retrieval is also based on partial match and best match.
From an inference perspective, data retrieval uses deductive inference, and information retrieval uses inductive inference. Considering the limitations from the assumptions of different logics, traditional logic systems (e.g., Horn subset of first order logic) cannot reason efficiently. Associative reasoning, analogical reasoning and the idea of unifying reasoning and search may be effective methods of reasoning at the web scale.
From the retrieval perspective, knowledge retrieval systems focus on semantics and better organization of information. Data retrieval and information retrieval organize the data and documents by indexing, while knowledge retrieval organize information by indicating connections between elements in those documents.
Frameworks for knowledge retrieval systems
From computer science perspective, a logic framework concentrating on fuzziness of knowledge queries has been proposed and investigated in detail. Markup languages for knowl |
https://en.wikipedia.org/wiki/Gays.com | Gays.com is an LGBT social networking service and website launched on 17 May 2008, operated and privately owned by Gays.com Limited. Users must register before using the service, after which they may create a personal profile, add other users as friends and exchange messages.
The June 2008 issue of City Weekend magazine referred to Gays.com as "the gay Facebook".
History
In 2006, the purchase of the domain name for $500,000 by German entrepreneurs Julius and David Dreyer was a record sale for the year and one of the highlights of the domain name industry. The website launched as a closed beta in Shanghai on 17May 2008, and was timed to coincide with the fourth International Day Against Homophobia and Transphobia. Gays.com became open beta on 10 September 2008.
See also
Homosocialization
References
External links
Gays.com
2008 establishments in Germany
Gay men's websites
LGBT organisations in Germany
LGBT-related Internet forums
LGBT online dating services
Internet properties established in 2008
German social networking websites
Online dating services of Germany |
https://en.wikipedia.org/wiki/Group%20%28database%29 | Group is a name service database used to store group information on Unix-like operating systems. The sources for the group database (and hence the sources for groups on a system) are configured, like other name service databases, in nsswitch.conf.
Seeing available groups on a Unix system
The contents of the group database (and available groups) can be seen with a variety of tools:
Command line
The getent command can be used to fetch group information.
Fetching a list of all available groups
getent group
Fetching a specific group
For a specific group called 'users':
getent group users
Python
grp - The Group Database — a Python module
Unix authentication-related software |
https://en.wikipedia.org/wiki/Plurk | Plurk () is a free social networking and micro-blogging service that allows users to send updates (otherwise known as plurks) through short messages or links, which can be up to 360 text characters in length (as of 2016).
Updates are then shown on the user's home page using a timeline, which lists all the updates received in chronological order, and delivered to other users who have chosen to receive them. A unique feature of its timeline is horizontal scrolling which is unlike any other popular social networking or micro-blogging websites like Twitter or Facebook, where users can see more posts running horizontally across the screen, with previous plurks to the right. Each of the threads shows timestamps below the timeline frame, and a counter for the number of responses; a thread can have as many as 300 to a thousand responses. Users can respond to other users' updates from their timeline through the Plurk.com website, by private or instant messaging, or by text messaging via compatible third party applications.
History
After months of development, Plurk was launched on May 12, 2008.
The etymology of the name was explained by the developers as such:
abbreviation of 'people' and 'lurk'
portmanteau of 'play' and 'work'
acronym of peace, love, unity, respect, and karma
verb neologism, similar to how Google was eventually used as a verb
While it is difficult to track down the names of the creators of Plurk, and the "A-Team" link listed under "creator" leads to a page that lacks any real information, it is known that the current CEO is Alvin Woon. In January 2013, it was announced that the company has been headquartered in Taipei, Taiwan, while it has landed [an] undisclosed amount of funding."
Features and technology
Plurk's interface shows updates in horizontal form through a scrollable timeline written in JavaScript and updated through AJAX. Users can modify the interface using CSS and HTML scripts as well. Users can post new messages with optional 'qualifiers', which are one-word verbs used to represent a thought (e.g., 'feels', 'thinks', 'loves', etc.). There are also advanced features such as sending updates only to a subset of your friends, posting updates on events earlier in the day, and sharing images, videos, and other media. Followers are allowed, but only limited to accounts that are not set as private. Users can upload media files through YouTube, links and webcam or from their computer. Plurks can also be 'liked', as in other social sites. In addition, it has a birthday reminder feature that places a birthday cake sign on all the user's messages on his/her birthday. Every plurker has his/her own Karma value. It is recalculated based on your activities. Higher Karma can access to more emoticons.
Plurk also supports group conversations between friends and allows usage of emoticons together with the usual text micro-blogging. Plurk also supports the upload of users' own pictures as emoticons.
The Plurk.com developers allowed p |
https://en.wikipedia.org/wiki/Sidecar%20file | Sidecar files, also known as buddy files or connected files, are computer files that store data (often metadata) which is not supported by the format of a source file.
There may be one or more sidecar files for each source file. There may also be "metadata databases" where one database contains metadata for several source files.
In most cases the relationship between the source file and the sidecar file is based on the file name; sidecar files have the same base name as the source file, but with a different extension. The problem with this system is that most operating systems and file managers have no knowledge of these relationships, and might allow the user to rename or move one of the files thereby breaking the relationship.
Examples
Amiga Hunk metadata
In AmigaOS, a file with a extension contains metadata for a companion Amiga Hunk executable file.
Extensible Metadata Platform
Extensible Metadata Platform (XMP) metadata is stored in a sidecar file when either a file format does not support embedded XMP metadata or if the workflow requires this.
DxO sidecar
Similar to the XMP format, DOP sidecars store metadata and edits made through DxO PhotoLab and other DxO tools
Connected Web Files and Folders
A file system object that associated two or more files. The file system treats connected files as a unit for purposes of moving, copying, and deleting. Some versions of Internet Explorer and Microsoft Word can save an HTML and its hyperlinked assets as such a unit.
THM
Many digital cameras will store a (thumbnail) file alongside a recorded movie, with the same base filename as the movie file. These thumbnail files are JFIF-encoded image files. This system allows for quickly displaying a still preview of the movie, and storing camera data which is not supported by the AVI file format.
INF
Acorn filesystems support metadata such as load and execution addresses that may not be natively supported on other filesystems. A file is used to store this metadata in text format, stored in a file with the same base filename, e.g. Menu and , and .
JPEG + WAV
Some digital cameras allow for voice/audio annotations with photos. These are then stored as WAV audio files alongside the JPEG photo file, with the same base filename.
PDF + annotations
PDF viewers which allow the reader to annotate documents with comments and drawings may store these in a sidecar file, such as Xournal's files.
RunPacker
The MS-DOS-based self-extracting archive generator RunPacker relied heavily on sidecar files because the proprietary package format PFA (packfile archive) used in it did not natively store file attributes or timestamps. To address this limitation, a backward-compatible system of auxiliary files (as called in official documentation) was implemented to store aforementioned data in volumes without changing their format. These were added to the PFA volume the same way as ordinary files, except they were marked by special characters in their name, and software ma |
https://en.wikipedia.org/wiki/NGMN | NGMN may refer to:
the Next Generation Mobile Networks Alliance
next generation mobile networks in a broader sense, usually for the 4th generation 4G of mobile technology that follows after the 3G generation of standards
ICAO code for Makin Airport, Makin (islands), (IATA code MTK) |
https://en.wikipedia.org/wiki/The%20Arts%20Institute | The Arts Institute (formerly Peninsula Arts) operates from within the Faculty of Arts and serves as the Arts and Culture programming umbrella organisation for the University of Plymouth. The year round public programme includes exhibitions, music, film, talks and performing arts.
Its aim is to provide a prestigious and wide-ranging series of events which open up the arts and university to the people of Plymouth, the South West and visitors to the region.
The University of Plymouth Contemporary Music Festival is an annual event hosted with the University of Plymouth Interdisciplinary Centre for Computer Research, and occurs in February.
Venues and locations
The Levinsky Gallery is the main hub for The Arts Institute, and the largest contemporary art gallery in the south west of England. It is located inside the Roland Levinsky Building at the university. Admission is free but may be restricted during events.
The House is another building at the university located behind the Roland Levinsky Building, which is used for theatre and dance performances, and the Jill Graigie Cinema which is used for showing films and lectures at the university.
Notable performances
Rosemary Johnson, a disabled violinist played music using an EEG cap.
In 2015 a slime mould and a lecturer played a piano duet based on the mould's movements.
In 2018, brainwaves recorded during seizures were turned into music.
References
External links
The Arts Institute
Contemporary Music Festival Website
University of Plymouth |
https://en.wikipedia.org/wiki/KWS%20%28album%29 | KWS is the only album of British pop/rave band KWS. It was released under Network Records.
The album, released in 1992 is best known for the single "Please Don't Go" (a copy of Italian Eurodance group Double You's cover of the KC and the Sunshine Band song), which reached #1 on the UK Singles Chart and #6 on the Billboard Hot 100 on the year of its release.
Vocalists on the album include group member Delroy St. Joseph, Liz Leng, The Trammps and Vermetta Royster.
Track listing
"Please Don't Go" - 6:12
"Where Will You Go When the Party's Over" - 5:09
"Rock Your Baby" - 5:14
"A Different Man" - 3:44
"Keep It Comin' Love" - 3:38
"Hold Back the Night Pt. 1" - 3:25
"Young Hearts Run Free" - 6:23
"Reach for the Sky" - 4:57
"Love Attack" - 5:19
"This Time" - 5:30
"Rock Your Baby" (Andrew Komis K.O. Mix) - 6:27
"Hold Back the Night Pt. 2" (Joey Negro K.O.K Mix) - 7:42
"Please Don't Go" (KWS Naples Via Nottingham Remix) - 4:58
"Young Hearts Run Free" (Mark Gamble Remix) - 5:39
"Burn Baby Burn" - 5:19
References
1992 debut albums
KWS (band) albums |
https://en.wikipedia.org/wiki/Arkansas%20Radio%20Network | Arkansas Radio Network (ARN) was a statewide radio network serving radio stations in the state of Arkansas. ARN was headquartered in Little Rock, Arkansas operating from its flagship station KARN-FM and ended its existence under the ownership of Cumulus Media.
History
ARN began their broadcasting activities in 1967 and for 55 years provided affiliates in Arkansas top news headlines, agriculture business news, sports, and specialty programming.
The Network started as the Delta Farm Network, an early morning program by KARK Farm Director Bob Buice, who also appeared on KARK-TV. Known for his velvet-like voice, he also did a weekend program on the Network for many years called Uncle Bob's Stories from the Bible.
The network later expanded to include the AP&L (Arkansas Power and Light, later Entergy) Live Better Electrically Hour, a program of music played in the late morning and broadcast over KARK-FM's signal. Ted Snider purchased KARK AM-FM from Mullins Broadcasting and founded the Arkansas Radio Network with newscasts provided by KARK-TV Newscasters (Don Corbett and Les Bolton) and Sportscaster Jim Elder. KARK was distributed by KARK-FM or by relays through other FM stations (KNBY-FM in Newport to KRLW-Walnut Ridge as an example).
ARN's growth came in the early 1980s, when distribution moved to satellite, although the number of affiliates had been growing into the 1970s. ARN was a staple across the state in the 1980s and 1990s, with the newscast broadcast at :55 minutes past each hour. Bob Buice was succeeded as Ag Director by John Philpot, and later by Stewert Doan.
In mid-February 2022, Cumulus Media (which acquired ARN through its 2011 acquisition of Citadel Broadcasting) informed ARN's eighteen remaining affiliates that it planned to suspend the network's operations effective March 20.
See also
KARN-FM
References
External links
American radio networks
Mass media in Arkansas
Cumulus Media radio stations |
https://en.wikipedia.org/wiki/Fox%20%28Italian%20TV%20channel%29 | Fox was an Italian television channel, owned by Fox Networks Group Italy and broadcast in Italy by Sky Italia on Channel 112. Launched on July 31, 2003, coinciding with the launch of Sky Italy, it broadcast its programs in Italian and English.
In 2009, it started broadcasting in HD.
The channel ceased broadcasting on June 30, 2022, with Nat Geo/Wild and Baby TV remaining on air, until these channels closed on 1 October 2022, ending Disney Italia's distribution of networks through cable and satellite. Most of the channel's programming moved to Disney+'s Star hub.
Programming
References
External links
Official website
Italy
Italian-language television stations
Defunct television channels in Italy
Television channels and stations established in 2003
Television channels and stations disestablished in 2022
Former subsidiaries of The Walt Disney Company
2003 establishments in Italy
2022 disestablishments in Italy |
https://en.wikipedia.org/wiki/CODESYS | Codesys (spelled “CODESYS” by the manufacturer, previously “CoDeSys”) is an integrated development environment for programming controller applications according to the international industrial standard IEC 61131-3.
CODESYS is developed and marketed by the CODESYS Group that is headquartered in Kempten. The company was founded in 1994 under the name 3S-Smart Software Solutions. It was renamed in 2018 and 2020 to Codesys Group / Codesys GmbH. Version 1.0 of CODESYS was released in 1994. Licenses of the CODESYS Development System are free of charge and can be installed legally without copy protection on further workstations.
Integrated use cases
The tool covers different aspects of industrial automation in one surface:
Engineering
The five programming languages for application programming defined in the IEC 61131-3 are available in the CODESYS development environment.
IL (instruction list) is an assembler-like programming language. The IEC 61131-3 user organization PLCopen has declared this language as “deprecated”, which means it shall not be used for new projects anymore.
ST (structured text) is similar to programming in Pascal or C
LD (ladder diagram) enables programmers to virtually combine relay contacts and coils
FBD (function block diagram) enables users to rapidly program both Boolean and analog expressions
SFC (sequential function chart) is convenient for programming sequential processes and flows
Additional graphical editor available in CODESYS:
CFC (Continuous Function Chart) is a sort of freehand FBD editor. While the FBD editor works in a network-oriented way and arranges the function blocks automatically, in CFC it is possible to place all function blocks freely and thus also to realize feedback without intermediate variables. Therefore, this language is also particularly suitable for the overview representation of an application.
Integrated compilers transform the application code created by CODESYS into native machine code (binary code) which is then downloaded onto the controller. The most important 32- and 64-bit CPU families are supported, such as TriCore, 80x86/iX, ARM/Cortex, PowerPC, SH or BlackFin.
Once CODESYS is connected with the controller, it offers an extensive debugging functionality such as variable monitoring/writing/forcing by setting breakpoints/performing single steps or recording variable values online on the controller in a ring buffer (Sampling Trace) as well as core dumps during exceptions.
CODESYS V3.x is based on the so-called CODESYS Automation Platform, an automation framework device manufacturers can extend by their own plug-in modules.
The CODESYS Professional Developer Edition offers the option to add components to the tool which are subject to licensing, e.g. integrated UML support, a connection to the Apache Subversion version control system, online runtime performance analysis ("Profiler"), static code analysis of the application code or script-based automated test execution. A Git |
https://en.wikipedia.org/wiki/International%20Network%20for%20Environmental%20Compliance%20and%20Enforcement | The International Network for Environmental Compliance and Enforcement (INECE) is a global network of environmental compliance and enforcement practitioners dedicated to raising awareness of compliance and enforcement across the regulatory cycle; developing networks for enforcement cooperation; and strengthening capacity to implement and enforce environmental requirements.
Founded in 1989 by The Netherlands Ministry of Housing, Spatial Planning and the Environment and by the United States Environmental Protection Agency (US EPA), INECE links the environmental compliance and enforcement efforts of more than 4,000 practitioners - inspectors, prosecutors, regulators, parliamentarians, judges, international organizations, and non-governmental organizations - from 120 countries.
Organizational structure
INECE's organizational structure consists of its Executive Planning Committee, its implementing Secretariat, and its participants.
The Executive Planning Committee, as the governing body of INECE, defines INECE's cooperative efforts and makes decisions to realize the INECE mission. It is co-chaired by representatives of the U.S. Environmental Protection Agency (USEPA), the Netherlands Ministry of Environment, Housing and Urban Development, and the Brazil Supreme Court. The INECE Secretariat provides technical, administrative, and communications support for Executive Planning Committee functions and helps to implement the INECE work program. Durwood Zaelke, President of the Institute for Governance and Sustainable Development, is the current Director of the INECE Secretariat.
INECE participants include inspectors, prosecutors, regulators, parliamentarians, judges, other governmental officials, and members of international and non-governmental organizations. INECE is an informal network, and any environmental compliance and enforcement practitioners may join the network by registering through the INECE Web site. INECE participants support the mission and objectives of the network, and may carry out these activities on an individual, organizational, bilateral, and/or multilateral basis as appropriate.
Major Projects and Activities
International Conference
INECE conferences bring together enforcement officials from both developed and developing countries all over the world to share experiences and make plans to take environmental compliance and enforcement efforts to the next level. INECE has hosted eight international conferences since 1990:
8th International Conference, Cape Town, South Africa - April 2008;
7th International Conference, Marrakesh, Morocco - April 2005;
6th International Conference, San Jose, Costa Rica - April 2002;
5th International Conference, Monterey, California, USA - November, 1998;
4th International Conference, Chiang Mai, Thailand - April, 1996;
3rd International Conference, Oaxaca, Mexico - April, 1994;
2nd International Conference, Budapest, Hungary - September, 1992;
1st International Enforcement Workshop, Utre |
https://en.wikipedia.org/wiki/LARS | LARS may refer to:
L.A.R.S. (Last American Rock Stars), a rap group
Launch and recovery system (diving)
Least-angle regression, a regression algorithm for high-dimensional data
Lesotho Amateur Radio Society
Leucyl-tRNA synthetase, a human gene
Light Artillery Rocket System
Long Ashton Research Station
Lower anterior resection syndrome
See also
Lars, a given name |
https://en.wikipedia.org/wiki/SNPedia | SNPedia (pronounced "snipedia") is a wiki-based bioinformatics web site that serves as a database of single nucleotide polymorphisms (SNPs). Each article on a SNP provides a short description, links to scientific articles and personal genomics web sites, as well as microarray information about that SNP. Thus SNPedia may support the interpretation of results of personal genotyping from, e.g., 23andMe and similar companies.
SNPedia is a semantic wiki, powered by MediaWiki and the Semantic MediaWiki extension.
SNPedia was created, and is run by, geneticist Greg Lennon and programmer Mike Cariaso, who at the time of the site's founding were both located in Bethesda, Maryland.
, the website has 537 medical conditions and 109,729 SNPs in its database. The number of SNPs in SNPedia has doubled roughly once every 14 months since August 2007.
On 7 September 2019, MyHeritage announced that they acquired both SNPedia and Promethease. All non-European raw genetic data files previously uploaded to Promethease, and not deleted by users by 1 Nov 2019, are to be copied to MyHeritage and the users will receive a free MyHeritage account with paid level of services, including Cousin Matching and Ethnicities.
Promethease
An associated computer program called Promethease, also developed by the SNPedia team, allows users to compare personal genetics results against the SNPedia database, generating a report with information about a person's attributes, such as propensity to diseases, based on the presence of specific SNPs within their genome.
In May 2008 Cariaso, using Promethease, won an online contest sponsored by 23andMe to determine as much information as possible about an anonymous woman based only on her genome. Cariaso won in all three categories of "accuracy, creativity and cleverness". In 2009, the anonymous woman ("Lilly Mendel") was revealed to be 23andMe co-founder Linda Avey, allowing a direct comparison between her actual traits and those predicted by Promethease a year earlier.
Reception
In a June 2008 article on personal genomics, a doctor from the Southern Illinois University School of Medicine said:
In January 2011, technology journalist Ronald Bailey posted the full result of his Promethease report online. Writing about his decision in Reason magazine, he stated:
Members of the medical community have criticised Promethease for technical complexity and a poorly defined "magnitude" scale that causes misconceptions, confusion and panic among its users.
See also
dbSNP
Online Mendelian Inheritance in Man
Full Genome Sequencing
Predictive Medicine
References
External links
Michael Cariaso - Next-Gen Sequencing, Wikis and SNPedia, Webcast from Bio-ITWorld.com.
Biological databases
Genomics companies
MediaWiki websites
Semantic wikis
Mutation
Single-nucleotide polymorphisms |
https://en.wikipedia.org/wiki/Roberto%20Merlin | Roberto D. Merlin is an Argentine physicist and Peter A. Franken Collegiate Professor of Physics and Professor of Electrical Engineering and Computer Science at the University of Michigan. He is known, among other things, for his work on quasiperiodic superlattices, squeezed phonons, and, most recently, for the discovery of "superfocusing", a method for creating lenses that can surpass the diffraction limit without using negative refraction materials.
Roberto Merlin was born in Buenos Aires, Argentina. He received his master's degree from the University of Buenos Aires in 1973 and his doctorate from the University of Stuttgart in 1978. His graduate advisor was Professor Manuel Cardona. After a postdoctoral position in the group of Professor Miles V. Klein at the University of Illinois at Urbana-Champaign, he joined the Physics faculty of the University of Michigan in 1980.
In 1985 he was promoted to associate professor, and then professor in 1989. From 1993 to 1996, Merlin served as Associate Chair for Research and Facilities of the Department of Physics. In 2000, he received a joint appointment to the Department of Electrical Engineering and Computer Science. He is now the director of the Optical Physics Interdisciplinary Laboratory.
Merlin is a fellow of the American Physical Society, the Optical Society of America, the von Humboldt Foundation, and the John Simon Guggenheim Memorial Foundation. In 2006 he received the Frank Isakson Prize for Optical Effects in Solids from the American Physical Society.
Merlin does a variety of interdisciplinary work, mostly related to condensed matter physics. He has done research on Raman spectroscopy, rare-earth magnet semiconductors, superconductors, superlattices, ultrafast lasers, intercalated graphite, and negative refraction.
Selected publications
External links
New superlens could run rings around the rest, New Scientist, July 12, 2007
Simple 'superlens' sharpens focusing power, New Scientist, April 24, 2008
References
Argentine physicists
University of Michigan faculty
Living people
Year of birth missing (living people)
Rare earth scientists |
https://en.wikipedia.org/wiki/Yale%20Cancer%20Center | Yale Cancer Center (YCC) was founded in 1974 as a result of an act of Congress in 1971, which declared the nation's "war on cancer". It is one of a network of 54 Comprehensive Cancer Centers designated by the National Cancer Institute (NCI). Currently directed by Dr. Eric Winer, the Cancer Center brings together the resources of the Yale School of Medicine (YSM), Yale New Haven Hospital (YNHH), and the Yale School of Public Health (YSPH).
Overview and history
In 1942, Louis S. Goodman, M.D., and Alfred Gilman, Ph.D., in the Yale Department of Pharmacology were the first scientists to use nitrogen mustard, the first alkylating anticancer agent, as chemotherapy to treat cancer in a patient.
During a talk for the Beaumont Medical Club in March 2005, David S. Fischer, M.D. clinical professor of medicine, said, "This was the first patient in the world treated by chemotherapy ... This was proof that cancer could be treated by chemicals."
This initial success led to the development of the world's first multi-center clinical trials in cancer chemotherapy.
Clinical care
Clinical care is led by Roy S. Herbst, Chief of Medical Oncology and Associate Director for Translational Research, Yale medical oncologists care for patients in Smilow Cancer Hospital. To organize patient care, Yale Cancer Center and Smilow Cancer Hospital have developed 13 multidisciplinary programs to provide physicians and specialists at Yale Cancer Center with the opportunity to focus their expertise on specific types of cancers.
Research
Yale School of Medicine was home to the country’s first university-based Medical Oncology Section, and its faculty has since pioneered many breakthrough cancer treatments.
Basic research in cancer is a hallmark of Yale Cancer Center, which draws approximately $96 million in cancer research funding to Yale every year.
The research portfolio of Yale Cancer Center comprises six research programs:
Cancer Immunology
Cancer Prevention and Control
Cancer Signaling Networks
Developmental Therapeutics
Genetics, Genomics, and Epigenetics
Radiobiology and Genome Integrity
References
External links
Cancer organizations based in the United States
1974 establishments in Connecticut
Medical research institutes in the United States
Yale University buildings
Yale School of Medicine
NCI-designated cancer centers
Research institutes in Connecticut |
https://en.wikipedia.org/wiki/Genedata | Genedata is a Swiss-headquartered bioinformatics company that provides enterprise software that support large-scale, experimental processes in life science research. The company focuses on automating data-rich, highly complex data workflows in biopharmaceutical R&D. It continuously develops and markets interoperable software that together comprises the Genedata Biopharma Platform.
Almost all the world's top 50 biopharmaceutical companies, including some of the most innovative R&D organizations developing groundbreaking therapies in fields such as cancer immunology, cell & gene therapy and vaccines, license at least one component of the Genedata Biopharma Platform. The company is headquartered in Basel, Switzerland with subsidiaries and offices in Germany, the United Kingdom, the United States, Singapore, and Japan.
Products
Genedata software captures, processes, and analyzes experimental data and drives the automation of complex experimental setups. The Genedata Biopharma Platform is a product portfolio comprising two main types of software products:
Genedata Data Analysis Systems
Genedata Workflow Systems
Genedata Expressionist
Streamlines biopharma mass spectrometry workflows across instruments and organizations.
Genedata Imagence
Automates high-content screening image analysis workflows based on a deep learning approach.
Genedata Screener
Captures, analyzes, and manages all screening data—automating even complex assays.
Genedata Selector
Streamlines NGS-based workflows from cell line development to biosafety.
Genedata Workflow Systems provide a backbone for managing R&D processes.
Genedata Biologics
Transforms discovery of biotherapeutics including mAbs, bispecifics, ADCs, TCRs, and CAR T cells.
Genedata Bioprocess
Designs manufacturing processes for cell line development, upstream and downstream processing, formulation, and analytics.
Genedata Profiler
Breaks down data silos and fosters data-informed decisions for successful clinical trials.
Genedata has been developing these platforms since 1997 and continues to develop its products, providing up to four software releases per year for each product to its customers under a software subscription license model. Services also offered include hosting under a Software as a Service (SaaS) model, operational IT services, integration and software customization, support and maintenance, as well as training and process consulting services.
Industries
Genedata has a presence in research & development laboratories, where large quantities of complex experimental data are generated. Within the biopharmaceutical industry, Genedata collaborates with biopharma organizations and biotechnology companies. Genedata also works with leading agriscience and other life science organizations that address nutritional and health-related challenges. Contract research organizations (CROs) and academic research institutions also use Genedata software and services.
Sites
Its offices are located in:
Switze |
https://en.wikipedia.org/wiki/Nextbio | NextBio is a privately owned software company that provides a platform for drug companies and life science researchers to search, discover, and share knowledge across public and proprietary data. It was co-founded by Saeid Akhtari, Ilya Kupershmidt, and Mostafa Ronaghi in 2004, and based in Cupertino, California, United States.
The NextBio Platform is an ontology-based semantic framework that connects highly heterogeneous data and textual information. The semantic framework is based on gene, tissue, disease, and compound ontologies. This framework contains information from different organisms, platforms, data types. and research areas that is integrated into and correlated within a single searchable environment using proprietary algorithms. It provides a unified interface for researchers to formulate and test new hypotheses across vast collections of experimental data.
According to the company, the enterprise version of the NextBio platform is being used in life science research and development and drug development by researchers and clinicians at: Merck Pharmaceutical, Johnson & Johnson Pharmaceutical Research & Development, L.L.C., Celgene, Genzyme, Eli Lilly and Company, and Regeneron Pharmaceuticals. This enterprise version allows internal, proprietary data to be uploaded and integrated into the NextBio database of publicly available data. According to the company, scientists are using NextBio to improve their ability to identify relevant prognostic and predictive molecular signatures which are significant in their research. In October 2013, Illumina acquired NextBio.
References
Internet search engines
Bioinformatics companies
Online databases
Health care companies established in 2004
Privately held companies based in California
Software companies established in 2004
Health care companies based in California |
https://en.wikipedia.org/wiki/Sun%20Open%20Storage | Sun Open Storage was an open source computer data storage platform developed by Sun Microsystems. Sun Open Storage was advertised as avoiding vendor lock-in.
Background
Prior to Open Storage, most storage products were based on customized operating systems running on specialist hardware. In many cases, the specialist hardware was based on old generation hardware, because the customized operating systems were behind in support for current processors and system architectures. During the 2000s, the phenomenal growth in processor performance and processor multithreading left these (often single threaded) storage products with a significant internal processing gap versus current industry standard computers.
Open Storage is the concept of building storage products on current industry standard hardware using standard operating systems which have a large enough user and support base to be tracking current hardware (processors, threading, memory, controllers, flash, etc.), avoiding the costs of specialist hardware and custom operating systems, and the performance penalty of not being able to use current generation technologies.
Sun's Open Storage products were a combination of their server technologies and software, starting with Solaris 10 6/06 ("Update 2") in June 2006, which included ZFS and the set of protocols to build NAS, SAN, and local storage servers. Core features provided by Solaris included the operating environment, the ZFS file-system, the Network File System (NFS) and SMB protocol interfaces, Solaris Fault Management Architecture, and other core features. Sun produced the 7000 series Storage Appliance range, based on the Open Storage platform with closed source parts added to create a complete integrated storage appliance. Other companies such as Greenplum, Nexenta, Delphix, etc. also used the Sun Open Storage platform to produce storage products/appliances with various specialities.
Statements by Sun around their Open Storage products indicated that products based on common hardware and open source Solaris, would remove vendor lock-in for customers.
In 2008 Sun estimated that open storage products and related services would gain 12 percent of the storage market by 2011. Storage solutions from other vendors are closed systems, in which all the components must come from the vendor.
The move to create storage products based on software personalities, running on standard hardware are also part of a broader move within the system and storage industries. Companies including Dell, EMC, HP, IBM, NetApp and numerous smaller vendors all have been moving towards storage products based upon standard server hardware and customized software.
Following the acquisition of Sun by Oracle in 2010, Oracle stopped using the Open Storage branding and stopped selling the Open Storage hardware products (Storage Servers and JBODs) related to it. Oracle continued manufacturing some of these products only for sale as part of the 7000 series, rebranding them |
https://en.wikipedia.org/wiki/Dust%20Networks | Dust Networks, Inc. is an American company specializing in the design and manufacture of wireless sensor networks for industrial applications including process monitoring, condition monitoring, asset management, Environment, Health and Safety (EHS) monitoring and power management. They were acquired by Linear Technology, Inc in December 2011, which in turn was acquired by Analog Devices, Inc in 2017. The Dust Networks product team operates in the IoT Networking Platforms group of Analog Devices.
Dust Networks works with industry and standards groups such as WirelessHART, IEEE and IETF to help drive the adoption of interoperable wireless sensor networking products.
Company history
In 1997, Kristofer S. J. Pister, a professor of electrical engineering and computer sciences at the University of California, Berkeley, conceived of and started the Smart Dust project with DARPA funding.
Smart Dust
The Smart Dust project attempted to demonstrate that a complete sensor/communication system could be made of sensors one cubic millimeter in size. This involved advances in miniaturization, integration, and energy management. The project focus was independent of any particular sensor, and looked at both commercial and military applications including:
Defense-related sensor networks such as battlefield surveillance, treaty monitoring, transportation monitoring, and scud hunting.
Virtual keyboard sensors: by attaching miniature remotes on each fingernail, accelerometers could then sense the orientation and motion of each fingertip, and communicate this data to a computer in a wristwatch.
Inventory control: by placing miniature sensors on each object in the inventory system (product package, carton, pallet, truck warehouse, internet), each component could "talk" to the next component in the system. This evolved into today's RFID inventory control systems.
Product quality monitoring: temperature and humidity monitoring of perishables such as meat, produce, and dairy.
Impact, vibration and temperature monitoring of consumer electronics, for failure analysis and diagnostic information, e.g. monitoring the vibration of bearings to detect frequency signatures that may indicate imminent failure.
The project led to the founding of Dust Networks, to provide commercial applications of the above.
Timeline
July 2002: Dust Networks founded by Pister, Tod Dykstra, Rob Conant and Brett Warneke
February 2004: Completes $7 million Series A financing from Foundation Capital, Institutional Venture Partners and In-Q-Tel
July 2004: First product delivered - SmartMesh shipping
February 2005: Completes $22 million Series B financing from Crescendo Ventures, Cargill Ventures and prior investors
March 2005: Launches products based on IEEE 802.15.4 standard in the 2.4 GHz ISM band
June 2006: Launches SmartMesh-XT wireless sensor networking system optimized for industrial applications
September 2007: WirelessHART standard ratified
October 2007: SmartMesh IA-500 family |
https://en.wikipedia.org/wiki/City%20Impact%20Church%20New%20Zealand | City Impact Church (CIC) is a pentecostal church based in Auckland, New Zealand. It operates a network of satellite churches across New Zealand, and in Canada, India, Mexico, the Philippines, and Tonga. It operates several community outreach programmes in New Zealand, including a school, a "Community Impact" support programme, and three childcare centres.
History
Formerly known as Bays Christian Fellowship, it was founded in 1982 by current senior pastors Peter Mortlock and his wife Bev Mortlock.
The church ran the television programme Impact For Life on TV channel Prime, as well as on Shine TV. The programme has been screened regularly on the Australian Christian Channel, United Christian Broadcast in UK, Power Vision in India, Cook Islands TV in Rarotonga, World Harvest Broadcasting network in Fiji and Daavo Christian Bible Channel in the Philippines.
City Impact Church operates a network of churches in Auckland (North Shore, Mount Wellington, Westgate, Botany), Tauranga, Queenstown, Invercargill, and Balclutha, and has satellite churches in Canada, India, Mexico, the Philippines, Fiji and Tonga.
In 2011, City Impact Church earned a revenue of $10,000,000 – roughly $6.9 million of that coming from donations.
Community outreach programmes
City Impact Church runs several community outreach programmes including a school, a "Community Impact" support programme, and three childcare centers in Auckland and Queenstown.
City Impact Church School
CIC founded City Impact Church School in 2004, where subjects include History, Geography and Doctrine, Language, Mathematics, Science, Art, Music, Drama, PE, and Kingdom Building, and teaches Years 0 through to 13 (Primary, Intermediate and Secondary school). It was temporarily closed in 2005 by the Ministry of Education because it was not a registered educational institution, but soon reopened once registration was complete. In 2015 a new classroom block was opened to accommodate growth.
Community Impact
The church runs a community support program called Community Impact, which involves over 700 church volunteers going to schools, hospitals and private homes to help clean, garden and maintain properties, as they seek to put biblical principles into practice. The church holds three or four Community Impact days a year, with volunteers reaching 150–200 homes across New Zealand. City Impact delivers over 1000 Christmas boxes every Christmas to underprivileged individuals and families as part of their Christmas community impact day. To help identify and support families City Impact works with numerous community organisations.
City Impact Childcare
The church has three childcare centres, two in Auckland and one in Queenstown. 80% of their teachers are qualified and they are open to both church members and not-church members. In 2014 one of their head teachers, Francesca Bunting, was awarded the NZ's Most Inspiring Teachers award in the Early Childhood category.
Activism and controversies
Opposition |
https://en.wikipedia.org/wiki/Jack%20Yang | Jack Y. Yang is an American computer scientist and biophysicist. As of 2011, he is the Editor-in-Chief of the International Journal of Computational Biology and Drug Design.
Biography
Yang received his Ph.D. and MS degrees from Purdue University, West Lafayette, under the supervision of Okan Ersoy (Computer Engineering) and Albert Overhauser (Biophysics), receiving the grade of summa cum laude and the award of Ph.D. thesis of the year in the USA. His post-doctoral training was from Harvard Medical School and Indiana University School of Medicine, and he received training in biostatistics and bioinformatics from Johns Hopkins University, and in computer science from University of Illinois at Urbana-Champaign. During this period he spent a few months at the CERN Institute. Yang was trained as a combined experimental and computer scientist with teaching, research, engineering, and in field practice in computer science, biomedical engineering and biophysics.
Yang works in engineering and translational medicine, with research interests ranging from cancer homeostasis, computational drug development, high throughput biology, database maintenance and microfluidomics applied to microarray proteomics. He is an honorary editor for the International Journal of Functional Informatics and Personalized Medicine and Editor-in-Chief of the International Journal of Computational Biology and Drug Design, together with partial appointments in Nature and Science, where he contributes regular revisions and comments. He has also been an editor of more than a dozen journals and proceedings books including the Journal of Supercomputing (Springer Science). He was the General Chair of the IEEE 7th International Conference on Bioinformatics and Bioengineering at Harvard Medical School and Co-PI of several grants form the National Science Foundation, Howard Hughes Medical Institute, and the National Institute of Health. He is also a consultant to Interlink Continental Journal Of Biological Sciences, MIR labs, and the International Conference on Bioinformatics and Computational Biology. Yang has delivered many invited talks including a number of keynote lectures to promote the emerging fields of functional informatics and personalized medicine and Applied binding-omics. He has published more than 100 peer reviewed papers and book chapters, especially in BMC Genomics. He specializes in cancer biology and artificial intelligence. He is a permanent candidate to the Millennium Technology Prize.
Yang completed a university speaking tour in Japan, and met with prime minister Yoshihiko Noda to discuss possible solutions to the Fukushima Daiichi nuclear disaster.
References
http://www.cs.uga.edu/~hra/
http://www.isibm.org/leadership.php
http://www.mirlabs.org
http://www.inderscience.com/ijfipm
http://www.inderscience.com/ijcbdd
http://www.biomedcentral.com/1471-2164/9/S1/I1
http://www.biomedcentral.com/1471-2164/9/S2/I1
http://www.biomedcentral.com/1471-2164/9/S1/S3
http://www. |
https://en.wikipedia.org/wiki/Roxy%20Bernstein | Allen Samuel "Roxy" Bernstein (born September 25, 1972) is an American sportscaster for ESPN, the Pac-12 Network, and the Oakland Athletics.
Early life and career
Bernstein was born in San Francisco and grew up on the Peninsula in the Bay Area.
After graduating from Pinewood School in Los Altos, California, Bernstein went on to the University of California, Berkeley and graduated with a degree in American Studies. While at Cal, Bernstein broadcast football, men's and women's basketball, and baseball and served as sports director of the student radio station, KALX (FM). Bernstein was hired by Cal at age 23 as the voice of Cal basketball after serving as the backup broadcaster and pregame and postgame host the previous season.
Broadcasting stops
, Bernstein is a play-by-play broadcaster of college basketball, NHL and football for ESPN, the Pac-12 Network, and the Oakland Athletics, and is the former broadcast voice for the California Golden Bears men's basketball team on the IMG Sports/Cal Basketball Radio Network. Bernstein had held the Cal position since 1997 and also did national college football play-by-play on the Touchdown Radio Network with 1992 Heisman Trophy winner and College Football Hall of Fame member Gino Torretta. He has been a part-time broadcaster for the Oakland Athletics since 2014; a talk show host for KGMZ 95.7 FM The Game in San Francisco, formerly hosted noon to 3pm on Xtra Sports 860/Sports Byline (KTRB) in San Francisco with J.J. Stokes and Geoff Sheen; and host of The Randy Bennett Radio Show, a weekly broadcast featuring St. Mary's College of California men's basketball coach Randy Bennett. In the winter of 2008–2009, Bernstein was one of two finalists to become the next San Diego Padres television play-by-play announcer, but did not get the job. In August 2009, Bernstein was emcee of the opening ceremonies for the San Francisco Maccabi Games; Bernstein played in the games as a youth, 21 years earlier.
Bernstein spent three years as a broadcaster with the Florida Marlins (2005–2007), teaming with 2011 Ford C. Frick Award Winner Dave Van Horne, but left the Marlins to return to the Bay Area full-time. Prior to his stint with the Marlins, Bernstein called games for the San Francisco Giants and Montreal Expos in Major League Baseball. He also worked for numerous minor league baseball clubs, including the Sonoma County Crushers, Solano Steelheads, High Desert Mavericks, and Tacoma Rainiers. Bernstein has shown his versatility by providing play-by-play for the San Jose Sharks, California Golden Bears football, San Francisco Demons, Oakland Athletics, ESPN Radio, NHL Radio, Westwood One, and the NFL on Sports USA Radio Network, as well as numerous events on television for Fox Sports Net and Comcast Sports Net.
References
External links
1972 births
Living people
American radio sports announcers
American television sports announcers
California Golden Bears football announcers
California Golden Bears men's basketball anno |
https://en.wikipedia.org/wiki/Ocarina%20Networks | Ocarina Networks was a technology company selling a hardware/software solution designed to reduce data footprints with file-aware storage optimization. A subsidiary of Dell, their flagship product, the Ocarina Appliance/Reader, released in April 2008, uses patented data compression techniques incorporating such methods as record linkage and context-based lossless data compression. The product includes the hardware-appliance-based compressor, the Ocarina Optimizer (Models 2400, 3400, 4600) and a real-time decompressor, the software-based Ocarina Reader.
History
Ocarina was founded by
Murli Thirumale, formerly a vice-president and general manager at Citrix Systems;
Carter George, formerly a vice-president and co-founder of PolyServe (acquired by HP); and
Goutham Rao, formerly Chief Technical Officer and Chief Architect for Advanced Solutions Group of Citrix Systems.
Its solution works by identifying redundancy at a global file system level, and applying specific algorithms for different data formats, such as algorithms specific to images, text, executables, seismic data, and other "unstructured data". Ocarina's Optimizers work with existing storage systems through standard network protocols such as NFS, or are directly integrated with partner vendors storage systems.
On July 19, 2010, Dell announced it plans to acquire Ocarina Networks. The transaction was completed on July 31, 2010. In late 2010, the original Ocarina Optimizer product family was removed from the market, enabling the Ocarina team to focus on the integration of dedupe and compression into Dell storage products. The most notable examples were the DR-family of deduplication appliances, launched in 2012, and integration of dedupe into Dell's Fluid File System.
Technology
The company's ECOsystem (Extract, Correlate, Optimize) provided data reduction technology, providing both deduplication and content-aware data compression in a reliable, scalable, policy-based package. ECOsystem consists of 3 primary components, an optimizer, a reader, and a management and reporting framework. These components were delivered in software or appliance form depending on customer, application, and underlying storage solution.
The standard ECOsystem workflow was a post-process. Files were first stored to disk in native form. Policies are used to specify which files were to be optimized (based on age, location, or file type), and what compression settings to use. Policies were commonly used to avoid optimization of files that are actively being modified. ECOsystem could also be configured to migrate optimized data to a secondary tier of lower-cost storage for disk-based archival applications.
Compression and deduplication algorithms
ECOsystem was content aware, with selection of compression solution based on the type of data being processed. This went beyond file-extension filtering. ECOsystem recursively decomposed compound files, until elemental text, media, or binary components are identified. |
https://en.wikipedia.org/wiki/VUK | VUK or Vuk may refer to:
Vuk (computer), Yugoslavian computer prototype
Vuk (film), an animated Hungarian movie
Vuk (novel), a 1965 novel by Istvan Fekete
Vuk (name), Slavic given name
Vuk, Ban of Bosnia
VUK-T (glider), often called VUK, a high-performance Yugoslavian sailplane
Vojvoda Vuk, Chetnik voivoda (duke)
Vuk Stefanović Karadžić (1787–1864), Serbian language reformer and folklorist, often referred to simply as Vuk
Vukićević
Volume Unique Key in the AACS, encryption system
Value Up Kit
Vuk, a character in the 2019 film Dark Phoenix
Vertical up-kicker, a pinball part |
https://en.wikipedia.org/wiki/SpecC | SpecC is a System Description Language (SDL), or System-level Design Language (SLDL), and is an extension of the ANSI C programming language. It is used to aid the design and specification of digital embedded systems, providing improved productivity whilst retaining the ability to change a design at functional and specification level, unlike HDLs like Verilog and VHDL. An architectural model can be created which allows other tools to directly map the design onto silicon or FPGA. The main aim is for the reuse, exchange and integration of IP at various levels of abstraction.
The language and design methodology were created by Rainer Dömer and Daniel Gajski at the Centre for Embedded Computer Systems at University of California, Irvine in 2001.
Similar projects and design methodologies include SystemC, an SDL based on C++. Although this rival language has seen much more widespread industry usage (although SpecC is popular in Japan), SpecC retains simplicity whilst also providing the vital features of any SDL, such as concurrency (SpecC provides pipelined and parallel flows), synchronisation, state transitions (not available in Verilog), and composite data types .
See also
Accellera
SystemC
SystemVerilog
External links
Technical Report, 2006 (PDF)
System description languages
Hardware description languages |
https://en.wikipedia.org/wiki/Algorist | Algorist may refer to:
A person skilled in the technique of performing basic decimal arithmetic, known as algorism
A person skilled in the design of algorithms
An algorithmic artist |
https://en.wikipedia.org/wiki/Artists%20Anonymous%20Theatre%20Network | Artists Anonymous Theatre Network is a networking organisation for theatre creators in the UK. As of May 2009 the network consisted of over 1,000 different groups and individuals with branches in London, Scotland and the South East. The organisation aims to open a social space for creators of theatre to meet, discuss and collaborate. Artists Anonymous also acts as an advocacy group for its members concerns; both organising events for the community to address its problems and lobbying on its behalf.
History
Artists Anonymous was founded in 2006 by Alexander Parsonage, artistic director of Finger in the Pie Theatre, with the aim of opening up social spaces for people involved with creating theatre in the capital.
Self Help Conference
On July 7, 2007 Artists Anonymous hosted an Open Space Conference on the subject of finding financial sustainability in the light of UK government cuts in arts funding as a result of their overspend on the 2012 Olympic Games. The conference was held at Middlesex University and attended by representatives of the Equity Actors Union, Independent Theatre Council and the Old Vic New Voices, as well as numerous theatre companies and individual practitioners. The conclusions of the conference were published by the Performance Initiative Network based at Brunel University.
2008 Relaunch
2008 saw an expansion of Artists Anonymous with Finger in the Pie project manager, Catherine Eccles appointed to run the organisation. PubClub was re-launched at the Phoenix Arts Club. Then Page to Stage, a script reading and development program, was launched to create a forum for developing new writing in collaboration with Jacksons Lane. Artists Anonymous also launched a series of master classes with the aim of bringing new skills into the network - as well as provide a networking environment based round specific interests.
2009 National Expansion
2009 saw the expansion of the network with franchises established in Scotland and the South East of England.
References
External links
Artists Anonymous Theatre Network
Theatre in London |
https://en.wikipedia.org/wiki/Sparse%20PCA | Sparse principal component analysis (SPCA or sparse PCA) is a technique used in statistical analysis and, in particular, in the analysis of multivariate data sets. It extends the classic method of principal component analysis (PCA) for the reduction of dimensionality of data by introducing sparsity structures to the input variables.
A particular disadvantage of ordinary PCA is that the principal components are usually linear combinations of all input variables. SPCA overcomes this disadvantage by finding components that are linear combinations of just a few input variables (SPCs). This means that some of the coefficients of the linear combinations defining the SPCs, called loadings, are equal to zero. The number of nonzero loadings is called the cardinality of the SPC.
There exist two different approaches to SPCA: conventional SPCA, based on Harold Hotelling's definition of PCA, by which the PCs are the linear combinations of the variables with unit norm and orthogonal loadings which sequentially have the largest variance (the norm of the SPCs); the second approach is Least Squares SPCA (LS SPCA), which is based on Karl Pearson's definition of PCA by which the SPCs are orthogonal and sequentially best approximate the data matrix in a least square sense. While the two definitions lead to the same PCA solution, when sparsity constraints are added this is no longer true.
Contemporary datasets often have the number of input variables () comparable with or even much larger than the number of samples (). It has been shown that if does not converge to zero, the classical PCA is not consistent.
But conventional SPCA can retain consistency even if
LS SPCA Variants
In optimal LS SPCA (USPCA, uncorrelated SPCA) the orthogonality constraints require that the cardinality of the solutions is not smaller than the order of the component, These constraints may also create numerical problems when computing components of order larger than two.
Correlated SPCA (CSPCA, correlated SPCA) is a variant of LS SPCA in which the orthogonality constraints are relaxed and the solutions are obtained iteratively by minimizing the norm of the approximation error from residuals orthogonal to the previously computed SPCs. Even though the resulting components are correlated (usually very mildly) , they have lower cardinality and in many cases explain more variance than the corresponding USPCA solutions.
The computation of the USPCA and CSPCA solutions is demanding when the data matrix is large. With Projection SPCA (PSPCA) approximate CSPCA solutions can computed much more efficiently by simply projecting the current first PC onto subsets of the variables. This means that the solutions can be computed with efficient linear regression routines. PSPCA is fast and can be shown to explain a proportion of the variance of the dataset comparable with that explained by CSPCA.
Mathematical formulation
Consider a data matrix, , where each of the columns represent an |
https://en.wikipedia.org/wiki/Pacific%20Pride | Pacific Pride Commercial Fueling (also known as PrideNet) is a network of membership-only fueling stations across the United States. It appeals to truckers and police forces. Its stations are franchised and are often combined with mainstream gas stations. Typically, Pacific Pride locations are independently operated commercial fueling providers offering access to a national network of fueling locations. Through its franchise locations and extended network, Pacific Pride franchisees are able to enable access to over 57,000 retail and standalone Pacific Pride locations throughout North America. The company offers fuel and no other services, unlike regular gas stations; Pacific Pride stations also have no staff of their own. Customers make all their transactions with a membership card, and the stations have emergency call boxes.
The commercial benefit of Pacific Pride compared to a credit card-based fuel card is cost and theft deterrence. Pacific Pride bills transactions on the Fleetcor network, which charges a per-event transaction fee, as opposed to a Visa percentage-of-transaction fee. This saves a substantial sum per gallon. To prevent theft, Pacific Pride has security features designed to manage drivers' fueling habits to the benefit of a fleet manager. Pacific Pride fleet cards enable a fleet manager to track fuel by the license plate of the vehicle, provide a unique PIN code for every driver, limit gallons per transaction, limit fuel types a driver can fuel with, limit the time of day the card will work, and limit zip codes fuel is allowed to be purchased in. Additionally, Pacific Pride can provide an electronic receipt to the dispatch center every time fuel is purchased in real time. This enables total control of fuel purchases by a fleet, with a level of transparency capable of deterring fuel theft by employees.
References
External links
Oil companies of the United States |
https://en.wikipedia.org/wiki/Computer%20graphics%20%28computer%20science%29 | Computer graphics is a sub-field of computer science which studies methods for digitally synthesizing and manipulating visual content. Although the term often refers to the study of three-dimensional computer graphics, it also encompasses two-dimensional graphics and image processing.
Overview
Computer graphics studies manipulation of visual and geometric information using computational techniques. It focuses on the mathematical and computational foundations of image generation and processing rather than purely aesthetic issues. Computer graphics is often differentiated from the field of visualization, although the two fields have many similarities.
Connected studies include:
Applied mathematics
Computational geometry
Computational topology
Computer vision
Image processing
Information visualization
Scientific visualization
Applications of computer graphics include:
Print design
Digital art
Special effects
Video games
Visual effects
History
There are several international conferences and journals where the most significant results in computer graphics are published. Among them are the SIGGRAPH and Eurographics conferences and the Association for Computing Machinery (ACM) Transactions on Graphics journal. The joint Eurographics and ACM SIGGRAPH symposium series features the major venues for the more specialized sub-fields: Symposium on Geometry Processing, Symposium on Rendering, Symposium on Computer Animation, and High Performance Graphics.
As in the rest of computer science, conference publications in computer graphics are generally more significant than journal publications (and subsequently have lower acceptance rates).
Subfields
A broad classification of major subfields in computer graphics might be:
Geometry: ways to represent and process surfaces
Animation: ways to represent and manipulate motion
Rendering: algorithms to reproduce light transport
Imaging: image acquisition or image editing
Geometry
The subfield of geometry studies the representation of three-dimensional objects in a discrete digital setting. Because the appearance of an object depends largely on its exterior, boundary representations are most commonly used. Two dimensional surfaces are a good representation for most objects, though they may be non-manifold. Since surfaces are not finite, discrete digital approximations are used. Polygonal meshes (and to a lesser extent subdivision surfaces) are by far the most common representation, although point-based representations have become more popular recently (see for instance the Symposium on Point-Based Graphics). These representations are Lagrangian, meaning the spatial locations of the samples are independent. Recently, Eulerian surface descriptions (i.e., where spatial samples are fixed) such as level sets have been developed into a useful representation for deforming surfaces which undergo many topological changes (with fluids being the most notable example).
Geometry subfields include:
Impl |
https://en.wikipedia.org/wiki/Computer%20graphics | Computer graphics deals with generating images and art with the aid of computers. Today, computer graphics is a core technology in digital photography, film, video games, digital art, cell phone and computer displays, and many specialized applications. A great deal of specialized hardware and software has been developed, with the displays of most devices being driven by computer graphics hardware. It is a vast and recently developed area of computer science. The phrase was coined in 1960 by computer graphics researchers Verne Hudson and William Fetter of Boeing. It is often abbreviated as CG, or typically in the context of film as computer generated imagery (CGI). The non-artistic aspects of computer graphics are the subject of computer science research.
Some topics in computer graphics include user interface design, sprite graphics, rendering, ray tracing, geometry processing, computer animation, vector graphics, 3D modeling, shaders, GPU design, implicit surfaces, visualization, scientific computing, image processing, computational photography, scientific visualization, computational geometry and computer vision, among others. The overall methodology depends heavily on the underlying sciences of geometry, optics, physics, and perception.
Computer graphics is responsible for displaying art and image data effectively and meaningfully to the consumer. It is also used for processing image data received from the physical world, such as photo and video content. Computer graphics development has had a significant impact on many types of media and has revolutionized animation, movies, advertising, and video games, in general.
Overview
The term computer graphics has been used in a broad sense to describe "almost everything on computers that is not text or sound". Typically, the term computer graphics refers to several different things:
the representation and manipulation of image data by a computer
the various technologies used to create and manipulate images
methods for digitally synthesizing and manipulating visual content, see study of computer graphics
Today, computer graphics is widespread. Such imagery is found in and on television, newspapers, weather reports, and in a variety of medical investigations and surgical procedures. A well-constructed graph can present complex statistics in a form that is easier to understand and interpret. In the media "such graphs are used to illustrate papers, reports, theses", and other presentation material.
Many tools have been developed to visualize data. Computer-generated imagery can be categorized into several different types: two dimensional (2D), three dimensional (3D), and animated graphics. As technology has improved, 3D computer graphics have become more common, but 2D computer graphics are still widely used. Computer graphics has emerged as a sub-field of computer science which studies methods for digitally synthesizing and manipulating visual content. Over the past decade, other specialized fie |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2043 | National Route 43 is a national highway of Japan connecting Nishinari-ku, Osaka, and Nada-ku, Kobe.
Route data
Length: 30.2 km (18.77 mi).
References
043
Roads in Osaka Prefecture
Roads in Hyōgo Prefecture |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2047 | National Route 47 is a national highway of Japan connecting Miyagino-ku, Sendai and Sakata, Yamagata.
Route data
Length: 173.6 km (107.87 mi).
History
Route 47 was originally designated on 18 May 1953 as a section of Route 108; this was redesignated as Route 47 when the route was promoted to a Class 1 highway.
References
047
Roads in Miyagi Prefecture
Roads in Yamagata Prefecture |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2050 | National Route 50 is a national highway of Japan connecting Maebashi, Gunma and Mito, Ibaraki.
Route data
Length: 144.2 km (89.6 mi).
History
Route 50 was designated on 18 May 1953 on the current route as National Route 122, and this was redesignated as Route 50 on 1 April 1963 when the route was promoted to a first-class highway.
References
050
Roads in Gunma Prefecture
Roads in Ibaraki Prefecture
Roads in Tochigi Prefecture |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2051 | National Route 51 is a national highway of Japan connecting Chūō-ku, Chiba and Mito, Ibaraki.
Route data
Length: 124 km (77.05 mi).
History
Route 51 was originally designated National Route 123 on 18 May 1953 as , and then was redesignated Route 51 when the route was promoted to a Class 1 highway.
References
051
Roads in Chiba Prefecture
Roads in Ibaraki Prefecture |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2052 | National Route 52 is a national highway of Japan connecting Shimizu-ku, Shizuoka and Kōfu, Yamanashi.
Route data
Length: 100.1 km (62.2 mi).
History
Route 52 was originally designated on 18 May 1953 as a section of National Route 141. After it was extended to Kōfu, this section was redesignated as Route 52 when the route was promoted to a Class 1 highway.
References
052
Roads in Shizuoka Prefecture
Roads in Yamanashi Prefecture |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2053 | National Route 53 is a national highway of Japan connecting Okayama, Okayama and Tottori, Tottori.
Route data
Length: 138.5 km (86.06 mi).
References
053
Roads in Okayama Prefecture
Roads in Tottori Prefecture |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2054 | National Route 54 is a national highway of Japan connecting Naka-ku, Hiroshima and Matsue, Shimane.
Route data
Length: 174.5 km (108.43 mi).
References
054
Roads in Hiroshima Prefecture
Roads in Shimane Prefecture |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2055 | National Route 55 is a national highway of Japan connecting the cities of Tokushima and Kōchi on the island of Shikoku.
Route data
Length: 210.2 km (130.61 mi).
See also
Kōchi-Tōbu Expressway
References
055
Roads in Kōchi Prefecture
Roads in Tokushima Prefecture |
https://en.wikipedia.org/wiki/Japan%20National%20Route%2056 | National Route 56 is a national highway of Japan connecting Kōchi, Kōchi and Matsuyama, Ehime.
Route data
Length: 300.2 km (186.54 mi).
References
056
Roads in Ehime Prefecture
Roads in Kōchi Prefecture |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.