source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Bill%20Gropp | William Douglas Gropp is the director of the National Center for Supercomputing Applications (NCSA) and the Thomas M. Siebel Chair in the Department of Computer Science at the University of Illinois at Urbana–Champaign. He is also the founding Director of the Parallel Computing Institute. Gropp helped to create the Message Passing Interface, also known as MPI, and the Portable, Extensible Toolkit for Scientific Computation, also known as PETSc.
Gropp was awarded the Sidney Fernbach Award in 2008, "for outstanding contributions to the development of domain decomposition algorithms, scalable tools for the parallel numerical solution of PDEs, and the dominant HPC communications interface". In 2016, he was awarded the ACM/IEEE-CS Ken Kennedy Award "For highly influential contributions to the programmability of high-performance parallel and distributed computers, and extraordinary service to the profession."
In 2009, Gropp received an R&D 100 Award for PETSc. In February 2010, he was elected to the National Academy of Engineering, "For contributions to numerical software in the area of linear algebra and high-performance parallel and distributed computation." In March 2010, he was honored with the IEEE TCSC Medal for Excellence in Scalable Computing. He is a Fellow of ACM, IEEE, and SIAM, and an elected member of the National Academy of Engineering.
Gropp received his PhD at Stanford in 1982, under Joseph Oliger.
References
External links
Gropp's website
Living people
University of Illinois Urbana-Champaign faculty
Fellow Members of the IEEE
Fellows of the Society for Industrial and Applied Mathematics
Fellows of the Association for Computing Machinery
Members of the United States National Academy of Engineering
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Quadratic%20unconstrained%20binary%20optimization | Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide range of applications from finance and economics to machine learning. QUBO is an NP hard problem, and for many classical problems from theoretical computer science, like maximum cut, graph coloring and the partition problem, embeddings into QUBO have been formulated.
Embeddings for machine learning models include support-vector machines, clustering and probabilistic graphical models.
Moreover, due to its close connection to Ising models, QUBO constitutes a central problem class for adiabatic quantum computation, where it is solved through a physical process called quantum annealing.
Definition
The set of binary vectors of a fixed length is denoted by , where is the set of binary values (or bits).
We are given a real-valued upper triangular matrix , whose entries define a weight for each pair of indices within the binary vector.
We can define a function that assigns a value to each binary vector through
Intuitively, the weight is added if both and have value 1.
When , the values are added if , as for all .
The QUBO problem consists of finding a binary vector that is minimal with respect to , namely
In general, is not unique, meaning there may be a set of minimizing vectors with equal value w.r.t. .
The complexity of QUBO arises from the number of candidate binary vectors to be evaluated, as grows exponentially in .
Sometimes, QUBO is defined as the problem of maximizing , which is equivalent to minimizing .
Properties
Multiplying the coefficients with a positive factor scales the output of accordingly, leaving the optimum unchanged:
Flipping the sign of all coefficients flips the sign of 's output, making the binary vector that maximizes :
If all coefficients are positive, the optimum is trivially . Similarly, if all coefficients are negative, the optimum is .
If , i.e., the bits can be optimized independently, then the corresponding QUBO problem is solvable in , the optimal variable assignments simply being 1 if and 0 otherwise.
Applications
QUBO is a structurally simple, yet computationally hard optimization problem.
It can be used to encode a wide range of optimization problems from various scientific areas.
Cluster Analysis
As an illustrative example of how QUBO can be used to encode an optimization problem, we consider the problem of cluster analysis.
Here, we are given a set of 20 points in 2D space, described by a matrix , where each row contains two cartesian coordinates.
We want to assign each point to one of two classes or clusters, such that points in the same cluster are similar to each other.
For two clusters, we can assign a binary variable to the point corresponding to the -th row in , indicating whether it belongs to the first () or second cluster ().
Consequently, we have 20 binary variables, which form a binary vector |
https://en.wikipedia.org/wiki/Camera%20Image%20File%20Format | In digital photography, the Camera Image File Format (CIFF) file format is a raw image format designed by Canon, and also used as a container format to store metadata in APP0 of JPEG images. Its specification was released on February 12, 1997.
The CIFF standard consists of two parts, CIFF Specification on Image Data File (last revision: version 1.0 revision 4, dated 24 December 1997) and CIFF Specification on File/Directory organization and File Handling Protocol (last revision: version 1.0 revision 3, dated 9 February 1998). The format was developed and maintained by Canon with input from the CIFF Forum. The format is no longer used by Canon, having been superseded by the CR2 file format.
Digital cameras
The CRW format was supported by some earlier Canon digital cameras:
Canon EOS D30
Canon EOS D60
Canon EOS 10D
Canon EOS 300D
Canon Powershot Pro1
Canon Powershots G1-G6
Canon Powershots S30-S70
Software that supports CRW
Besides Canon's ZoomBrowser and Digital Photo Professional, several other software programs provide read support, and sometimes write support, for CRW files including:
Adobe Photoshop
Aperture
darktable
dcraw
ExifTool
LibRaw
Picasa
RawTherapee
See also
Raw image format
Comparison of image viewers
other digital negative formats
References
External links
CIFF specification
Canon CRW Specification
The Canon RAW (CRW) File Format
CR2 format
Canon's CR2 Raw File Format Specification
Graphics file formats
Digital photography |
https://en.wikipedia.org/wiki/List%20of%20the%20vascular%20plants%20in%20the%20Red%20Data%20Book%20of%20Russia | This is a complete and as of 2009 up-to-date list of vascular plants listed in the Red Data Book of the Russian Federation and protected in Russia at the federal level.
Pteridophyta
Aspleniaceae
Asplenium adiantum-nigrum L. - (rare)
Asplenium daghestanicum Christ - (rare)
Asplenium altajense (Kom.) Grub. - (rare)
Asplenium sajanense Gudoschn. et Krasnob. - (declining)
Asplenium nesii Christ. - (rare)
Athyriaceae
Athyriopsis japonica (Thunb.) Ching. - (endangered)
Athyrium wardii (Hook.) Makino. - (rare)
Lunathyrium henryi (Baker) Kurata - (rare)
Botrychiaceae
Botrychium simplex E. Hitchc. - (endangered)
Dryopteridaceae
Arachniodes mutica (Franch. et Savat.) Ohwi. - (declining)
Dryopteris chinensis (Baker) Koidz. - (endangered)
Leptorumohra miqueliana (Maxim. ex Franch. et Savat.) H. Ito - (endangered)
Hymenophyllaceae
Mecodium wrightii (Bsch) Copel. - (declining)
Marsileaceae
Marsilea aegyptica Willd. - (endangered)
Marsilea strigosa Willd. - (endangered)
Ophioglossaceae
Ophioglossum alascanum E. Britt. - (declining)
Ophioglossum thermale Kom. - (declining)
Osmundaceae
Osmunda japonica Thunb. - (rare)
Osmundastrum claytonianum L. Tagawa - (declining)
Plagiogyriaceae
Plagiogyria mutsumurana (Makino) Makino - (rare)
Polypodiaceae
Pyrrosia petiolosa (Christ et Baroni) Ching - (rare)
Sinopteridaceae
Cheilanthes kuhnii Milde - (rare)
Woodsiaceae
Woodsia fragilis (Trev.) Moore - (rare)
Lycopodiophyta
Isoetaceae
Isoetes lacustris L. - (rare)
Isoetes maritima Underw. - (declining)
Isoetes setacea Durieu - (declining)
Pinophyta
Cupressaceae
Juniperus conferta Parl. - (rare)
Juniperus excelsa Bieb. - (declining)
Juniperus foetidissima Willd. - (declining)
Juniperus rigida Siebold et Zucc. subsp. litoralis Urussov - (declining)
Juniperus sargentii (A. Henry) Takeda ex Koidz. - (rare)
Microbiota decussata Kom. - (declining)
Pinaceae
Larix olgensis A. Henry - (declining)
Picea glehnii (Fr. Schmidt) Mast. - (rare)
Pinus densiflora Siebold et Zucc. - (declining)
Pinus pallasiana D. Don. - (endangered)
Pinus pityusa Stev. - (declining)
Pinus sylvestris L. var. cretacea Kalenicz. ex Kom. - (rare)
Taxaceae
Taxus baccata L. - (declining)
Taxus cuspidata Siebold et Zucc. ex Endl. - (rare)
Magnoliophyta
Aceraceae
Acer japonicum Thunb. - (endangered)
Adoxaceae
Viburnum wrightii Miq. - (rare)
Alismataceae
Alisma wahlenbergii (Holmb.) Juz. - (endangered)
Caldesia parnassifolia (L.) Parl. - (endangered)
Alliaceae
Allium bellulum Prokh. - (rare)
Allium grande Lipsky - (declining)
Allium gunibicum Miscz. ex Grossh. - (rare)
Allium neriniflorum (Herb.) Backer - (declining)
Allium paradoxum (Bieb.) G. Don fil. - (rare)
Allium pumilum Vved. - (rare)
Allium regelianum A. Beck. - (declining)
Nectaroscordum tripedale (Trautv.) Grossh. - (endangered)
Amaryllidaceae
Galanthus angustifolius G. Koss - (declining)
Galanthus bortkewitschianus G. Koss - (endangered)
Galanthus caucasicus (Baker) Grossh. - (rare)
Galanthus lagodechianus Kem. - Nath. - (rare)
Gala |
https://en.wikipedia.org/wiki/Edlin%20%28disambiguation%29 | Edlin is a line editor included with MS-DOS and later Microsoft operating systems.
Edlin may also refer to:
Aaron Edlin, US economist
Robert Thomas Edlin, recipient of US Distinguished Service Cross |
https://en.wikipedia.org/wiki/R5%20Hastings%20St | The R5 Hastings St is an express bus service with bus rapid transit elements in Metro Vancouver, Canada. Part of TransLink's RapidBus network, it travels along Hastings Street, a major east–west route, and connects Simon Fraser University to the SkyTrain system's Burrard station on the Expo Line in Downtown Vancouver. It replaced the 95 B-Line route on January 6, 2020.
History
Originally known as the 95 B-Line, the route started service on December 19, 2016, shortly after the opening of the Millennium Line's Evergreen Extension earlier that month. The new B-Line service replaced route 135, which had operated service between Downtown Vancouver and Simon Fraser University since April 1997. Starting on January 1, 2018, passengers with Compass Cards or proof of payment are allowed to board from any of the three doors on the bus. Passengers who are paying cash must board through the front door. On July 23, 2019, TransLink announced plans to launch a new express bus route to rebrand the B-Line service. The upgrades were completed in early January 2020, with the first service on the new R5 Hastings St beginning January 6.
Stops and transfer points
The R5 Hastings St serves the following stops in Vancouver and Burnaby.
Vancouver
Burrard Station – Western terminus of the line connecting to the Expo Line and serving multiple bus routes traveling throughout Metro Vancouver to destinations including North Vancouver, Horseshoe Bay Ferry Terminal, University of British Columbia, and Richmond.
Granville Street/Waterfront station – Connects to the Expo Line, Canada Line, West Coast Express, and SeaBus. Serves the satellite campus of SFU Harbour Centre.
Cambie Street – Serves the Gastown neighbourhood, including SFU's School for the Contemporary Arts at Woodwards.
Main Street – Serves the Downtown Eastside neighbourhood and Vancouver's Chinatown.
Commercial Drive – Serves the Grandview–Woodland neighbourhood.
Nanaimo Street – Serves the eastern edge of the Grandview–Woodland neighbourhood and the western edge of the Hastings–Sunrise neighbourhood.
Renfrew Street – Serves the Pacific National Exhibition grounds and the Hastings–Sunrise neighbourhood.
Kootenay Loop – Transit exchange that serves routes to East Vancouver, Downtown Vancouver, Burnaby, North Vancouver and the Tri-Cities.
Burnaby
Gilmore Avenue – Serves the Burnaby Heights neighbourhood to the north and Willingdon Heights neighbourhood to the south.
Willingdon Avenue – Serves the eastern edges of the Burnaby Heights and Willingdon Heights neighbourhoods.
Hythe Avenue – Serves the Capitol Hill and Brentwood Park neighbourhoods.
Holdom Avenue – Serves the Capitol Hill neighbourhood
Kensington Avenue – Serves the Kensington Square Shopping Centre and Burnaby North Secondary School.
Duthie Avenue – Serves the Westridge neighbourhood and is the easternmost stop in Burnaby before entering Burnaby Mountain and Simon Fraser University.
SFU Transportation Centre – Transit exchange for Simo |
https://en.wikipedia.org/wiki/The%20Bridge%20%28Sirius%20XM%29 | The Bridge is on Sirius XM Radio channel 17 and Dish Network 6032. It is devoted to gold-based Classic Hits / News Radio The channel is programmed by Mary Sue Twohy. The channel plays mainly 1970s acts, such as Fleetwood Mac, James Taylor, Carole King, Jackson Browne, Elton John, Jim Croce, The Eagles, America, and Billy Joel, along with some later 1980s and 1990s artists like Sting, Bonnie Raitt, and others. It was basically the 1960s and 1970s counterpart of the former StarLite channel for the Sirius service before the Sirius/XM merger replaced StarLite with The Blend (which covers adult contemporary music from the 1970s-now).
The Bridge, originally on Sirius channel 10, has often been removed from the lineup when the service wants to devote a channel to a single artist for a period of time, such as The Rolling Stones or The Who. On September 27, 2007, it was displaced by E Street Radio, devoted to the music of Bruce Springsteen. The channel could still be heard on Sirius' internet stream, however. These frequent and long-lasting periods of preemption have angered many subscribers.
The Bridge returned to the Sirius satellites on June 24, 2008 on channel 12, forcing Super Shuffle to take the SIR-2 stream formerly used by The Bridge.
On November 1, 2008, channel 12 switched to Led Zeppelin Radio, with The Bridge moved to channel 33. On November 12, 2008, channel 12 became The Pulse as part of the Sirius/XM merger, moving Led Zeppelin Radio to channel 33 and forcing The Bridge to go on hiatus for the rest of the year. The Bridge returned to Sirius (and debuted on XM) on January 1, 2009. The Bridge is available on Dish Network channel 6032. Until February 9, 2010, it was heard on DirecTV channel 849, but all of the Sirius XM programming was dropped in favor of Sonic Tap by DMX.
From February 14-March 13, 2009, the channel was temporarily pre-empted for Fireman Radio, a channel devoted to the music of Paul McCartney. From October 15-October 22, 2010, it was again pre-empted for Elton!, a channel devoted to the music of Elton John. From November 29-December 26, 2010, The Bridge was again pre-empted for Band on the Run Radio, another Paul McCartney oriented format.
On June 18, 2020, The Bridge moved from channel 32 to channel 17, replacing PopRocks. U2 X Radio took over The Bridge's former slot.
Core artists
The Beatles
Elton John
Eagles
Fleetwood Mac
James Taylor
Billy Joel
Simon & Garfunkel
Jackson Browne
Van Morrison
Crosby, Stills, Nash & Young
Bonnie Raitt
Gordon Lightfoot
See also
List of Sirius Satellite Radio stations
References
External links
SiriusXM: The Bridge
Sirius Satellite Radio channels
XM Satellite Radio channels
Mainstream adult contemporary radio stations in the United States
Sirius XM Radio channels
Radio stations established in 2001 |
https://en.wikipedia.org/wiki/Los%20Angeles%20Lakers%20radio%20networks | The Los Angeles Lakers radio networks consist of two separate networks for the coverage of the National Basketball Association (NBA)'s Los Angeles Lakers basketball team. One is an English language network while the other is a Spanish language network. There are 17 total stations in four states (Arizona, California, Nevada, and New Mexico) between the two networks.
On-air personnel
Current announcers for the English-language network include John Ireland as the play-by-play announcer since 2011. The color commentator since 2004 is former Lakers player (with the team for their 1987 & 1988 championships) Mychal Thompson. Thompson, who originally worked with Spiro Deedes stayed on as an announcer when the broadcasts moved from KLAC to KSPN at the start of the 2009-2010 season.
Former on-air personnel for the network have included legendary play-by-play announcer Chick Hearn and former NBA player Stu Lantz as a color commentator. Pat Riley served as a color commentator for the network from 1977 until late 1979 when he became an assistant coach for the team.
English-language network
The English-language Los Angeles Lakers Radio Network is a three-state, 11-station network with KSPN ("710 ESPN") serving as the flagship. Starting with the 2009-2010 season, KSPN took over the flagship position under a five-year deal, thus ending the Lakers' three-decade relationship with KLAC. KLAC served as the Lakers' flagship station from 1977 to 2009.
Network affiliates
California
Hawaii
New Mexico
Spanish-language network
The Spanish-language network is a two-state, four-station network with KWKW serving as its flagship.
Network affiliates
California
Nevada
Former affiliates for either network
Arizona
California
Nevada
References
External links
L.A. Times blog: Lakers announce switch to 710 ESPN
Radio Network
National Basketball Association on the radio
Mass media in Los Angeles County, California
Sports radio networks in the United States |
https://en.wikipedia.org/wiki/Phasor%20%28sound%20synthesizer%29 | Phasor is a stereo music, sound and speech synthesizer created by Applied Engineering for the Apple II family of computers. Consisting of a sound card and a set of related software, the Phasor system was designed to be compatible with most software written for other contemporary Apple II cards, including the Sweet Micro Systems Mockingboard, ALF's Apple Music Synthesizer, Echo+ and Applied Engineering's earlier card Super Music Synthesizer.
References
Notes
Phasor Manual
External links
Applied Engineering 1986 Summer/Fall Catalog. Phasor appears on page 12
Applied Engineering 1987 Summer/Fall Catalog. Phasor appears on page 17
Applied Engineering 1988 Spring/Summer Catalog. Phasor appears on page 23
Applied Engineering 1989 Winter/Spring Catalog. Phasor appears on page 22
Wiki for Reactive Micro's modern reproductions
Apple II peripherals
Apple II software
Sound cards
Speech synthesis |
https://en.wikipedia.org/wiki/Infobase | Infobase is an American publisher of databases, reference book titles and textbooks geared towards the North American library, secondary school, and university-level curriculum markets. Infobase operates a number of prominent imprints, including Facts On File, Films for the Humanities & Sciences, Cambridge Educational, Chelsea House (which also serves as the imprint for the special collection series, "Bloom's Literary Criticism" under the direction of literary critic Harold Bloom), and Ferguson Publishing.
History
Facts On File has been publishing books since 1941. It was owned by CCH from 1965 to 1993. The publisher publishes general reference and trade books. Facts On File acquired Ferguson Publishing, which specializes in career education works, in 2003.
Chelsea House was founded in 1966. It is known for multi-volume reference works.
The private equity firm Veronis Suhler Stevenson bought Facts on File and Chelsea House in 2005. Infobase bought Films for the Humanities & Sciences in 2007 and the World Almanac in 2009. Infobase acquired Learn360 in 2012. In 2017, Infobase acquired The Mailbox lesson plans and Learning magazine. Veronis Suhler Stevenson sold Infobase to another private equity firm, Centre Lane Partners, in 2018.
Infobase acquired Credo Reference in 2018. The World Almanac was sold to SkyHorse Publishing in 2020. Infobase acquired careers website Firsthand (including Vault.com), in 2021. Infobase acquired Omnigraphics in 2022.
As well as nonfiction works in print, Infobase and its imprints publish a selection of works in digital, audiovisual and online database formats.
Imprints
Facts On File
Films for the Humanities & Sciences
Cambridge Educational
Chelsea House Publishing
Bloom's Literary Criticism
Ferguson Publishing
References
External links
Films for the Humanities available on the Internet Archive
Book publishing companies based in New York (state)
Private equity portfolio companies
Publishing companies established in 1941 |
https://en.wikipedia.org/wiki/Robbit%20Mon%20Dieu | , sometimes referred to as Jumping Flash! 3, is a 3D platform game for the Sony PlayStation. It was developed by Sugar & Rockets and published by Sony Computer Entertainment for the PlayStation in Japan on October 14, 1999. It is the third and final game in the Jumping Flash! series. The game was later released on the Japanese PlayStation Network on July 26, 2007.
Story
The inhabitants of planet Hananuma find themselves encountering numerous problems that they are unable to solve alone, and their call for help is answered by the Universal City Service, who send Robbit to Hananuma to rectify things and put the inhabitants at peace once again.
Gameplay
The gameplay controls are virtually identical to the two previous games, with the reduction of special weapons slots from three to one, and the addition of a slamming move after pressing the triangle button while in the air. Instead of roaming around worlds collecting Jet Pods or MuuMuus, the objective of each level varies from having to simply turn on four water wells to destroy thirteen ghosts in a graveyard to transporting somebody home.
Reception
Robbit Mon Dieu was given a 31 out of 40 by gaming publication Famitsu. The game was given a 5.4 out of 10 by the website GameSpot, citing it as a disappointing sequel to the series.
References
External links
Robbit Mon Dieu at MobyGames
1999 video games
3D platform games
Japan-exclusive video games
PlayStation (console) games
PlayStation (console)-only games
Sony Interactive Entertainment games
Video game sequels
Video games about rabbits and hares
Video games developed in Japan
Single-player video games |
https://en.wikipedia.org/wiki/Pocket%20MuuMuu | is a 3D action game for the Sony PlayStation. It was developed by Sugar and Rockets and published by Sony Computer Entertainment and released exclusively in Japan in 1999. It is a spin-off game in the Jumping Flash! series. The game makes use of the Sony PocketStation peripheral. PocketStation is not required to play.
Reception
Famitsu scored the game a 28 out of 40.
References
1999 video games
Action games
Japan-exclusive video games
PlayStation (console) games
PlayStation (console)-only games
Sony Interactive Entertainment games
Video games developed in Japan
Video game spin-offs
Single-player video games |
https://en.wikipedia.org/wiki/Victor%20Pan | Victor Yakovlevich Pan () is a Soviet and American mathematician and computer scientist, known for his research on algorithms for polynomials and matrix multiplication.
Education and career
Pan earned his Ph.D. at Moscow University in 1964, under the supervision of Anatoli Georgievich Vitushkin, and continued his work at the Soviet Academy of Sciences. During that time, he published a number of significant papers and became known informally as "polynomial Pan" for his pioneering work in the area of polynomial computations. In late 1970s, he immigrated to the United States and held positions at several institutions including IBM Research. Since 1988, he has taught at Lehman College of the City University of New York.
Contributions
Victor Pan is an expert in computational complexity and has developed a number of new algorithms. One of his notable early results is a proof that the number of multiplications in Horner's method is optimal.
In the theory of matrix multiplication algorithms, Pan in 1978 published an algorithm with running time . This was the first improvement over the Strassen algorithm after nearly a decade, and kicked off a long line of improvements in fast matrix multiplication that later included the Coppersmith–Winograd algorithm and subsequent developments. He wrote the text How to Multiply Matrices Faster (Springer, 1984) surveying early developments in this area. His 1982 algorithm still held the record in 2020 for the fastest "practically useful" matrix multiplication algorithm (i.e., with a small base size and manageable hidden constants). In 1998, with his student Xiaohan Huang, Pan showed that matrix multiplication algorithms can take advantage of rectangular matrices with unbalanced aspect ratios, multiplying them more quickly than the time bounds one would obtain using square matrix multiplication algorithms.
Since that work, Pan has returned to symbolic and numeric computation and to an earlier theme of his research, computations with polynomials. He developed fast algorithms for the numerical computation of polynomial roots,
and, with Bernard Mourrain, algorithms for multivariate polynomials based on their relations to structured matrices.
He also authored or co-authored several more books, on matrix and polynomial computation,
structured matrices, and on
numerical root-finding procedures.
Recognition
Pan was appointed Distinguished Professor at Lehman College in 2000.
In 2013 he became a fellow of the American Mathematical Society, for "contributions to the mathematical theory of computation".
Selected publications
Research papers
Books
References
External links
Profile in American Scientist
Year of birth missing (living people)
Living people
20th-century American mathematicians
21st-century American mathematicians
American computer scientists
Soviet emigrants to the United States
Soviet mathematicians
Soviet computer scientists
Theoretical computer scientists
Fellows of the American Mathematical Society
Leh |
https://en.wikipedia.org/wiki/Atlanta%20Braves%20Radio%20Network | The Atlanta Braves Radio Network is a 171-station network (66 A.M., 39 F.M. stations + 62 F.M. translators and 4 HD Channels) with terrestrial coverage in eleven states Southeastern United States that airs Major League Baseball games of the Atlanta Braves. The flagship station is WCNN in Atlanta, Georgia. The primary booth announcers are Ben Ingram and Joe Simpson, who alternate between play-by-play and color commentary on most game broadcasts, with Jim Powell also calling select games. Chris Dimino and Kevin McAlpin host the pregame and postgame shows. The engineer and game producer for Braves Network broadcasts is Jonathan Chadwick. Network producers include Chris Culwell, Cullen Madden, David Holloway, Brody King, and Brett Barney.
Due to the large geographic span of the Braves' territory, their radio network has the most affiliates of any team in Major League Baseball. The nearest teams to the north of Atlanta are the Cincinnati Reds, Washington Nationals, and the Baltimore Orioles. The nearest teams to the west are the St. Louis Cardinals, Houston Astros, and Texas Rangers, while the nearest teams to the south are the Tampa Bay Rays and Miami Marlins.
Flagship
Affiliates
Alabama
Florida
Georgia
Indiana
Kentucky
Mississippi
North Carolina
South Carolina
Tennessee
Virginia
Former flagships
See also
List of Sirius XM Radio channels
References
Major League Baseball on the radio
Sports radio networks in the United States
Radio networks |
https://en.wikipedia.org/wiki/Pride%20Week%201973 | Pride Week 1973 was a national LGBT rights event in Canada, which was held in August 1973. The event, which took place from August 19 to 26, was marked by LGBT-themed programming in several Canadian cities, including Vancouver, Toronto, Ottawa, Montreal, Saskatoon and Winnipeg. Programming included an art festival, a dance, picnic, a screening of a documentary and a rally for gay rights that occurred in all the participating cities.
The event was, however, a one-off event which did not directly result in the creation of an annual LGBT pride festival in any of the participating cities. Although all do now have annual pride festivals, each of those was created later on as a local initiative rather than evolving directly out of the 1973 program.
In Vancouver over 300 people attended the arts festival and dance of the first day of the week, and many of them attended the rally on the steps of the courthouse on the following day. The initial events are also said to have been attended by straight onlookers.
The rally on August 25 marked the protest aspect of the otherwise celebratory. The aim of the protest was to “hear something of the growth of the gay movement and to declare their determination to continue the struggle.” In general the week combined elements of commemoration, celebration and protest for further change.
The Pride Week of 1973 marks the shift in Vancouver from the homophile movement into the gay liberation movement. The essence of the homophile movement is that of assimilation into the general society as well as the creation of hidden network for gays and lesbians to meet one another and form a community. The gay liberation movement is more active and aims to achieve change through visibility and protest. Pride Week 1973 was clearly a visible event aiming for openness and change, it was also the first one of its kind and is therefore a tangible shift of the mentality of the gay rights movement.
This was the first large-scale event organized for the purpose of celebrating the community and actively pressing for change, thus it was a watershed event in the progression of gay liberation in Vancouver. Other cities, such as Toronto, had previously held similar events. For Vancouver, and others, it was a first.
Pride Week 1973 also marked the emergence of the concept of gay pride and the first Pride Parade like event in Vancouver. The rally was, although not flamboyantly colourful as pride parades are today, a typical parade of the time. It marked visibility and unity on part of the gay community, it celebrated the difference of the members of the community and aimed to incite change. However, it wasn't until 1978 that the pride parade was organized in and of itself.
Due to the collaboration of Toronto, Montreal, Vancouver and the other cities to organize Pride Week together, the event marks the unity, visibility and strength of the movement in Canada. It was a noticeable protest on a country wide basis. Thus this event is significant |
https://en.wikipedia.org/wiki/Molecular%20Conceptor | The Molecular Conceptor Learning Series is an interactive computer-based learning suite produced by Synergix Ltd. This suite of software utilises 3D technology and case studies to illustrate the principles and techniques of drug discovery. This software is primarily targeted at students and professionals in the drug discovery field.
.
Contents
The Molecular Conceptor Learning Series comprises five modules:
Medicinal chemistry
Drug design
Cheminformatics
Structural Bioinformatics
Practical Drug Discovery: Case Studies.
And is also divided into 10 volumes:
Drug Discovery
Analog Design and Molecular Mimicry
Synthesis and Library Design
Protein Structure and Modelling
Structure-Based Design
Cheminformatics
Ligand-Based Design
QSAR and Chemometrics
Molecular Basis of Drugs
Peptidomimetics
General Topics
References
External links
Molecular Conceptor Learning Series Website
Science education software
Molecular modelling software |
https://en.wikipedia.org/wiki/Sbrk | and are basic memory management system calls used in Unix and Unix-like operating systems to control the amount of memory allocated to the data segment of the process. These functions are typically called from a higher-level memory management library function such as . In the original Unix system, and were the only ways in which applications could acquire additional data space; later versions allowed this to also be done using the call.
Description
The brk and sbrk calls dynamically change the amount of space allocated for the data segment of the calling process. The change is made by resetting the program break of the process, which determines the maximum space that can be allocated. The program break is the address of the first location beyond the current end of the data region. The amount of available space increases as the break value increases. The available space is initialized to a value of zero, unless the break is lowered and then increased, as it may reuse the same pages in some unspecified way. The break value can be automatically rounded up to a size appropriate for the memory management architecture.
and were considered legacy even by 1997 standards (Single UNIX Specification v2 or POSIX.1-1998). They were removed in POSIX.1-2001.
Function signatures and behavior
#include <unistd.h>
int brk(void* end_data_segment);
void *sbrk(intptr_t increment);
is used to adjust the program break value by adding a possibly negative size, while is used to set the break value to the value of a pointer. Set parameter to zero to fetch the current value of the program break.
Upon successful completion, the subroutine returns a value of 0, and the subroutine returns the prior value of the program break (if the available space is increased then this prior value also points to the start of the new area). If either subroutine is unsuccessful, a value of is returned and the global variable is set to indicate the error.
Not every Unix-like system entertains the concept of having the user control the data segment. The Mac OS X implementation of is an emulation and has a maximum allocation of 4 megabytes. On first call an area of exactly this large is allocated to hold the simulated segment. When this limit is reached, −1 is returned and the is set to . always errors.
Error codes
The error is set and the allocated space remains unchanged if one or more of the following are true:
The requested change allocates more space than is allowed by a system-imposed maximum.
The requested change sets the break value to a value greater than or equal to the start address of any attached shared memory segment.
See also
Exec (computing)
References
Memory management
Operating system APIs |
https://en.wikipedia.org/wiki/Upper%20Windy%20Creek%20Ranger%20Cabin%20No.%207 | Upper Windy Creek Ranger Cabin No. 7, also known as the Upper Windy Patrol Cabin is a log shelter in the National Park Service Rustic style in Denali National Park. The cabin is part of a network of shelters for patrolling park rangers throughout the park. It is a standard design by the National Park Service Branch of Plans and Designs and was built in 1931.
References
External links
Buildings and structures in Denali Borough, Alaska
Park buildings and structures on the National Register of Historic Places in Alaska
Ranger stations in Denali National Park and Preserve
Log cabins in the United States
Rustic architecture in Alaska
Buildings and structures on the National Register of Historic Places in Denali Borough, Alaska
Log buildings and structures on the National Register of Historic Places in Alaska
1931 establishments in Alaska
National Register of Historic Places in Denali National Park and Preserve |
https://en.wikipedia.org/wiki/Multidimensional%20panel%20data | In econometrics, a multidimensional panel data is data of a phenomenon observed over three or more dimensions. This comes in contrast with panel data, observed over two dimensions (typically, time and cross-sections). An example is a data set containing forecasts of one or multiple macroeconomic variables produced by multiple individuals (the first dimension), in multiple series (the second dimension) at multiple times periods (the third dimension) and for multiple horizons (the fourth dimension).
Analysis of multidimensional panel data
A multidimensional panel with four dimensions can have the form
where i is the individual dimension, s is the series dimension, t is the time dimension, and h is the horizon dimension. A general multidimensional panel data regression model is written as
Complex assumptions can be made on the precise structure of the correlations among errors in this model. For example, serial correlation (error terms correlated across time) has multiple distinct meanings. Error terms can be correlated across time for the same series, individual, and horizon. They can be correlated across time and across series for the same individual and horizon, etc. Similarly, heteroskedasticity can be defined across individuals for the same series, time, and horizon, across individuals and different series for the same time and horizon, etc.
Data sets which have a multidimensional panel design
Blue Chip Survey of Professional Forecasters
Survey of Professional Forecasters (ASA-NBER)
See also
Panel analysis
References
Multivariate time series
Statistical data types
da:Paneldata
es:Datos de panel
fi:Paneeliaineisto |
https://en.wikipedia.org/wiki/ISO%208000 | ISO 8000 is the global standard for Data Quality and Enterprise Master Data. It describes the features and defines the requirements for standard exchange of Master Data among business partners. It establishes the concept of Portability as a requirement for Enterprise Master Data, and the concept that true Enterprise Master Data is unique to each organization.
Master Data is commonly used to manage critical business information about products, services and materials, constituents, clients and counterparties, and for certain immutable transactional and operational records. Application of this standard has already proven it can significantly reduce procurement costs, promote inventory rationalization, and deliver greater efficiency and cost savings in supply chain management.
The ISO 8000 standard was first proposed in 2002, and the first components were approved in 2009. Part 115, which describes "Quality Identifier Prefixes" for "Quality Identifiers," was approved in 2017. Several important enhancements are currently under development, including Part 116 (see the Key Concepts, below). Many successful organizations have already adopted Master Data, and its precursor, Reference Data, and the core elements of the maturing standard are quickly being adopted by many Fortune 500 corporations. Around the world, Government agencies in major economies involved in the supervision and regulation of financial and commodities markets, telecommunications, media, high technology and military have adopted a wide range of ISO 8000 Master Data strategies, and several are establishing audits and controls based upon ISO 8000.
ISO 8000 is one of the emerging technology standards that large and complex organizations are turning to in order to improve business processes and control operational costs. The standard is in the process of being published as a number of separate documents, which ISO calls "parts".
ISO 8000 is being developed by ISO technical committee TC 184, Automation systems and integration, sub-committee SC 4, Industrial data. Like other ISO and IEC standards, ISO 8000 is copyrighted and is not freely available. [Dead reference 404 Error]
Parts 1, 2 and 8 are ISO horizontal deliverables, identifying them as applicable to all sectors.
Key Concepts
Master Data Master data represents the business objects which are agreed on and shared across the enterprise. It can cover relatively static reference data, transactional, unstructured, analytical, hierarchical and metadata. It is the primary focus of the discipline of Master Data Management (MDM). This discipline used to be predominantly taken care of by Information Technology (IT) departments but can equally well be justified as a business function, with IT providing the required technology.
Quality Identifier A Quality Identifier is an internal product or services identifier or key that is issued and "owned" by an organization and used to resolve a product or service to the minimum ISO 8000 |
https://en.wikipedia.org/wiki/Studio%20Aperto | Studio Aperto (lit. Open Studio) is the brand for Italian TV channel of Mediaset network Italia 1's news programmes. Founded by Emilio Fede on 16 January 1991 with the beginning of Gulf War, it's shown domestically on Italia 1. Created by the editors of NewsMediaset, it is directed by Andrea Pucci, as editor-in-chief of NewsMediaset, assisted by Anna Broggiato as co-director.
Background
Italia 1 from 1982 until 1989 did not have television news because it was a channel dedicated to young people. However, from the end of November 1989 Italia 1 Speciale News was broadcast on the channel.
The programme is generally presented by a single newsreader. Most items will be made up of reports and are generally preceded and followed by the correspondent reporting live from the scene of the report.
Daily programme and presenters
12:20 : Presentres Program On Italia 1
18:00 :Laura Piva
18:35 :Giulia Ronchi
Both editions :Irene Tarantelli
21:25 :Stefania Cavallaro, Sabrina Pieragostini, Patrizia Caregnato, Monica Gasparini, Laura Piva, Giulia Ronch.
01:30 :Francesca Ambrosini, Maria Vittoria Corà, Eleonora Rossi Castelli, Elisa Triani, Stefania Cavallaro
Daily Programme and presenters On January 1995
12:25: Stefania Cavallaro, Sabrina Pieragostini, Patrizia Caregnato, Monica Gasparini, Laura Piva.
18:30: Francesca Ambrosini, Maria Vittoria Corà, Eleonora Rossi Castelli, Elisa Triani.
Both editions: Giulia Ronchi, Irene Tarantelli.
00:30: Laura Piva, Giulia Ronchi
02:30: Presentres Program On Italia 1 .
Criticism and controversy
Studio Aperto has long been accused of promoting right-wing positions, due to the ownership by Silvio Berlusconi.
Other critics are about the huge airing of crime news and soft news (gossip, animals and videos from the Web) subtracting time to more important news.
Editor-in-chief
1991-1993: - Emilio Fede
1993: - Vittorio Corona
1993-2000: - Paolo Liguori
2000-2007: - Mario Giordano
2007-2009: - Giorgio Mulè
2009-2010: - Mario Giordano
2010-2014: - Giovanni Toti
2014-present: - Anna Broggiato
References
External links
Official site
1991 Italian television series debuts
1990s Italian television series
2000s Italian television series
2010s Italian television series
Italian television news shows
R.T.I. - Mediaset
Italia 1 original programming |
https://en.wikipedia.org/wiki/Distributed%20transmission%20system | In North American digital terrestrial television broadcasting, a distributed transmission system (DTS or DTx) is a form of single-frequency network in which a single broadcast signal is fed via microwave, landline, or communications satellite to multiple synchronised terrestrial radio transmitter sites. The signal is then simultaneously broadcast on the same frequency in different overlapping portions of the same coverage area, effectively combining many small transmitters to generate a broadcast area rivalling that of one large transmitter or to fill gaps in coverage due to terrain or localised obstacles.
History
While the idea of a single-frequency network of multiple transmitters broadcasting the same programming on the same channel from multiple transmitter sites is not a new concept, the ATSC digital television standard in use in North America was not designed for this mode of operation and was poorly adapted to these applications. The restrictive timing requirements and poor multipath interference handling of early ATSC implementations would have precluded multiple synchronous transmitters on the same frequency at the time of the first wide-scale commercial ATSC deployment in 1998; these restrictions eased somewhat as receiver design advanced in subsequent years. By 2004, technology existed to provide digital television receivers with the means to detect static (not mobile or changing) multipath interference (subject to certain timing constraints) and compensate for its effects on the digital signal.
Tests have been run by various individual broadcasters or broadcast groups, including the Metropolitan Television Alliance (MTVA, a consortium of New York city television stations). A series of initial tests involving four distributed transmission sites and over 100 test measurement sites in NYC and New Jersey were completed in June 2008, along with smaller-scale tests in New York in 2007. The New York market is uniquely problematic for multipath reception due to the large number of man-made obstacles which prevent adequate digital coverage of the entire city from the main broadcast facilities atop the Empire State Building.
Technical issues
To the receiver, a signal from a single-frequency network appears as a single broadcast with strong multipath interference; in the worst case, it is detected as a main signal and a reflection both of equal strength as signals arrive from multiple transmitters to the same intermediate location at slightly different times.
The ATSC standard used for digital television in North America, unlike the DVB-T standard in Europe and other nations, uses 8VSB instead of OFDM—a modulation which allowed a station to transmit at lower peak power levels, but which historically has been far inferior in handling multipath reflections and RF interference.
The first widespread commercial deployment of US ATSC digital television began in 1998, with the first early adopters being stations in the largest markets (including |
https://en.wikipedia.org/wiki/National%20Microbial%20Pathogen%20Data%20Resource | The National Microbial Pathogen Data Resource was one of the eight Bioinformatics Resource Centers funded by the National Institutes of Allergy and Infectious Diseases, NIAID a component of the National Institutes of Health (NIH), which is an agency of the United States Department of Health and Human Services.
The NMPDR was funded for five years from 2004 through a grant to co-PI's Rick Stevens from the Computation Institute at the University of Chicago, and Ross Overbeek at the Fellowship for the Interpretation of Genomes.
The NMPDR was initially tasked with annotating and curating the genomes of five pathogenic species of Bacteria, (Campylobacter, Listeria, Staphylococcus, Streptococcus, and Vibrio). However, after four years, the team were asked to also oversee the curation and annotation of the genomes of seven additional bacterial species (Chlamydia, Chlamydophila, Haemophilus, Mycoplasma, Neisseria, Treponema, and Ureaplasma).
The flagship website, the National Microbial Pathogen Data Resource provides curated annotations in an environment for comparative analysis of genomes and biological subsystems.
In addition, the NMPDR team have also developed the Rapid Annotation using Subsystems Technology Server (RAST) for annotating and curating complete microbial genomes and the Metagenomics RAST for annotating metagenomes.
Note to NMPDR Users
As of January 2010, the bacterial organism originally covered by NMPDR under the BRC program have been transferred to PATRIC the Pathosystems Resource Integration Center.
Biology organizations |
https://en.wikipedia.org/wiki/World%20Register%20of%20Marine%20Species | The World Register of Marine Species (WoRMS) is a taxonomic database that aims to provide an authoritative and comprehensive list of names of marine organisms.
Content
The content of the registry is edited and maintained by scientific specialists on each group of organism. These taxonomists control the quality of the information, which is gathered from the primary scientific literature as well as from some external regional and taxon-specific databases. WoRMS maintains valid names of all marine organisms, but also provides information on synonyms and invalid names. It is an ongoing task to maintain the registry, since new species are constantly being discovered and described by scientists; in addition, the nomenclature and taxonomy of existing species is often corrected or changed as new research is constantly being published.
Subsets of WoRMS content are made available, and can have separate badging and their own home/launch pages, as "subregisters", such as the World List of Marine Acanthocephala, World List of Actiniaria, World Amphipoda Database, World Porifera Database, and so on. As of December 2018 there were 60 such taxonomic subregisters, including a number presently under construction. A second category of subregisters comprises regional species databases such as the African Register of Marine Species, Belgian Register of Marine Species, etc., while a third comprises thematic subsets such as the World Register of Deep-Sea species (WoRDSS), World Register of Introduced Marine Species (WRiMS), etc. In all of these cases, the base data are entered and held once only as part of the WoRMS data system for ease of maintenance and data consistency, and are redisplayed as needed in the context of the relevant subregister or subregisters to which they may also belong.
Certain subregisters expand content beyond the original "marine" concept of WoRMS by including freshwater or terrestrial taxa for completeness in their designated area of interest; such records can be excluded from a standard search of WoRMS by selecting appropriate options in the online search interface.
History
WoRMS was founded in 2008 and grew out of the European Register of Marine Species and the UNESCO-IOC Register of Marine Organisms (URMO), which was compiled by Jacob van der Land (and several colleagues) at the National Museum of Natural History, Leiden. It is primarily funded by the European Union and hosted by the Flanders Marine Institute (VLIZ) in Ostend, Belgium. WoRMS has established formal agreements with several other biodiversity projects, including the Global Biodiversity Information Facility and the Encyclopedia of Life. In 2008, WoRMS stated that it hoped to have an up-to-date record of all marine species completed by 2010, the year in which the Census of Marine Life was completed.
As of February 2018, WoRMS contained listings for 480,931 marine species names (including synonyms) of which 240,633 are valid marine species (95 % checked). Their goal is to |
https://en.wikipedia.org/wiki/Transport%20in%20Shanghai | Transport in Shanghai is provided by an extensive network of modes including metro, cycling, bus (incl. trolley bus) and taxis, as well as an expansive network of roadways, and airports. Shanghai has invested heavily in public transportation before and after the 2010 World Expo, including the construction of the Hongqiao transportation hub of high-speed rail, air, metro and bus routes.
Public transport is the major mode of transport in Shanghai as limitations on car purchases were introduced in 1994 in order to limit the growth of automobile traffic and alleviate congestion. New private cars cannot be driven without a license plate, which are sold in monthly license plate auctions which is only accessible for locally registered residents and those who have paid social insurance or individual income taxes for over three years. Around 9,500 license plates are auctioned each month, and the average price is about () in 2019. Shanghai (population of 25 million) has over four million cars on the road, the fifth-largest number of any Chinese city. Despite this the city remains plagued by congestion and vehicle pollution.
The coverage of operating costs from the ticket revenue of Shanghai metro lines 1 and 2 was over 100% in the years 2000 to 2003. In 2004, the average daily passenger flow of rail transit was 1.32 million trips, taking up 10.9% of the total public passenger traffic in the city, an increase of 6 percentage points from 3.8% in 2000.
The results of the "2011 Shanghai Public Transport Passenger Flow Survey" released by the Municipal Transportation and Port Bureau showed that the city's public transport travel time was gradually reduced. The average travel distance of public transport in 2011 was 8.5 kilometers, the travel time 50.8 minutes per trip and the travel cost of public transport is gradually reduced: in 2011, the cost of rail transit was 2.4 yuan per trip, down 14% from 2005; the cost of bus and tram trips was 1.8 yuan, down 5% from 2005. Metro accounted for 33% of the public transport passenger volume.
In 2018 the public transportation system handled a total of 16.05 million rides on average each day, among which 10.17 million (63%) were made via the Metro and 5.76 million (36%) via buses. Shanghai expressway traffic volume was 1.215 million vehicles on an average day.
Airports
Shanghai is served by two airports: Shanghai Hongqiao International Airport and Shanghai Pudong International Airport. Pudong International Airport is the primary international airport, while Hongqiao International Airport mainly operates domestic flights with limited short-haul international flights.
Shanghai Hongqiao International Airport opened in May 1923 and was the only primary airport of Shanghai. During the 1990s, the expansion of Hongqiao Airport to meet growing demand became impossible as the surrounding urban area was developing significantly, and an alternative to assume all international flights had to be sought.
Shanghai Pudong Internati |
https://en.wikipedia.org/wiki/Latin%20American%20Bibliography | The Latin American Bibliography refers to the set of databases and information services on academic journals from Latin America and the Caribbean created by the National Autonomous University of Mexico (UNAM) in the decade of the seventies.
Nowadays, the Latin-American Bibliography is composed by the following databases: CLASE (Latin-American Citations in Social Sciences and Humanities); PERIODICA (Index of Latin-American Journals in Science); Latindex (Regional Co-operative Information System for Scholarly Journals from Latin America, the Caribbean, Spain and Portugal).
These databases were created by a group of information professionals, who identified the need to register, preserve and give access to the Latin-American knowledge published in the main academic journals of the region. Within UNAM, the fostering institution of these information products was the Science and Humanities Information Center (CICH) created in 1971.
For the size of its collection of Latin-American journals, for the quantity of compiled records and for the duration and consistency of the project, the Latin-American Bibliography produced in the UNAM constitutes one of the most valuable resources for scholars and experts specializing in Latin-American affairs.
Products
Three databases are available through the web site of UNAM’s General Directorate for Libraries General Directorate for Libraries:
CLASE (Latin-American Citations in Social Sciences and Humanities). Bibliographical database, with more than 280,000 records, of which nearly 14,000 provide abstracts and links to the full text of the documents. It includes more than 1,400 journals specializing in Social Sciences, Humanities and Arts, from more than 20 countries of Latin America and the Caribbean. Documents not available in full text can be retrieved through the Document Supply Service of the Latin-American Serials Collection (Hemeroteca Latinoamericana) of the DGB.
PERIODICA (Index of Latin-American Journals in Science). Bibliographical database with more than 315,000 records, of which near 60,000 provide abstracts and links to the full text of the documents. The database indexes more than 1,500 journals specializing in Science and Technology, from more than 20 countries of Latin America and the Caribbean. Documents not available in full text can be retrieved through the Document Supply Service of the Latin-American Serials Collection (Hemeroteca Latinoamericana) of the DGB.
Latindex (Regional Co-operative Information System for Scholarly Journals from Latin America, the Caribbean, Spain and Portugal). This initiative provides relevant information and data of the scholarly journals edited in the Iberoamerican region. Three databases are produced through the collaborative work of the member institutions: Directory,: with more than 17,000 records; Catalogue, with more than 3,500 selected journals that fulfill international quality criteria and an Index of Electronic Journals, offering nearly 3,000 links to |
https://en.wikipedia.org/wiki/Lo%20Zoo%20di%20105 | Lo Zoo di 105 () is a radio program created by the Italian radio host Marco Mazzoli and broadcast on Radio 105 Network. The program is based on numerous impersonation of famous people and popular films and TV shows, prank calls and Dirty talk. The show was interrupted many times due to numerous complaints and the last time due to alleged "political pressure", later revealed false. According to an Il Sole 24 Ore survey, in 2004 was the most appreciated radio show from an audience between 12 and 29 years of age. In the spring of 2004, the Italian showgirl Elisabetta Canalis took part in several episodes of the radio broadcast. On 17 December 2009, the American actor Benjamin McKenzie and on 6 June 2014 David Hasselhoff, have participated in Lo Zoo di 105 as guest stars. In 2010 Lo Zoo di 105 started airing the longest prank call ever, named Alan in love. In this prank, Alan Caligiuri (a former host of the show) called several elderly people from all around Italy searching for love and he eventually found one. The prank is still ongoing.
In March 2016 was released a movie about the story of the show: "On Air - Storia di un successo"
References
Italian radio programs
External links
Official Website
Podcasting
Lo Zoo di 105 on YouTube |
https://en.wikipedia.org/wiki/Lower%20Toklat%20River%20Ranger%20Cabin%20No.%2018 | The Lower Toklat Ranger Cabin No. 18, also known as the Lower Toklat Patrol Cabin, is a log shelter in the National Park Service Rustic style in Denali National Park. The cabin is part of a network of shelters used by patrolling park rangers throughout the park. It is a standard design by the National Park Service Branch of Plans and Designs and was built in 1931. The cabin has twelve separate log dog kennels, also to a standard Park Service design.
Work began in the summer of 1931, with construction carried out by contracted carpenters, described as "two old Swedes". A ranger-built food cache and dog houses followed in 1933 and 1936.The design originated at Yellowstone National Park, adapted in this case with a somewhat larger size.
References
Buildings and structures in Denali Borough, Alaska
Ranger stations in Denali National Park and Preserve
Park buildings and structures on the National Register of Historic Places in Alaska
Log cabins in the United States
Rustic architecture in Alaska
National Register of Historic Places in Denali National Park and Preserve
Log buildings and structures on the National Register of Historic Places in Alaska
1931 establishments in Alaska
Buildings and structures on the National Register of Historic Places in Denali Borough, Alaska |
https://en.wikipedia.org/wiki/Riley%20Creek%20Ranger%20Cabin%20No.%2020 | The Riley Creek Ranger Cabin No. 20, also known as Riley Creek Patrol Cabin, is a log shelter in the National Park Service Rustic style in Denali National Park. The cabin is part of a network of shelters for patrolling park rangers throughout the park. It is a standard design by the National Park Service Branch of Plans and Designs and was built in 1931.
References
Buildings and structures in Denali Borough, Alaska
Ranger stations in Denali National Park and Preserve
Park buildings and structures on the National Register of Historic Places in Alaska
Log cabins in the United States
Rustic architecture in Alaska
National Register of Historic Places in Denali National Park and Preserve
Log buildings and structures on the National Register of Historic Places in Alaska
1931 establishments in Alaska
Buildings and structures on the National Register of Historic Places in Denali Borough, Alaska |
https://en.wikipedia.org/wiki/Nudi%20%28software%29 | Nudi is a computer program to type in Kannada script.
The Karnataka government had funded the development of Nudi vide G.O ITD 234 A da vi 2001 Bangalore, dated 27.12.2001. It was published by Kannada Ganaka Parishat, a non-profit organization. Up to version 5.0, it was developed based on the Monolingual font-encoding standard prescribed by the Government of Karnataka. From Nudi 6.0, it has been based on Unicode. Nudi 6.1 was developed using AutoHotKey scripting.
Nudi supports most Windows-based desktop applications.
References
External links
Kagapa - Kannada Computer Council
Typography software
Science and technology in Karnataka |
https://en.wikipedia.org/wiki/Upper%20Toklat%20River%20Cabin%20No.%2024 | Upper Toklat Ranger Station No. 24, also known as the Upper Toklat River Cabin is a log shelter in the National Park Service Rustic style in Denali National Park. The cabin is now part of a network of shelters for patrolling park rangers throughout the park. It is a standard design by the National Park Service Branch of Plans and Designs and was built in 1930. The cabin is one of five cabins originally built by the Alaska Road Commission to provide shelter to crews working on park roads. The Upper Toklat River cabin is centrally located and was a distribution point for supplies.
References
External links
Buildings and structures in Denali Borough, Alaska
Ranger stations in Denali National Park and Preserve
Park buildings and structures on the National Register of Historic Places in Alaska
Log cabins in the United States
Rustic architecture in Alaska
Buildings and structures on the National Register of Historic Places in Denali Borough, Alaska
Log buildings and structures on the National Register of Historic Places in Alaska
1930 establishments in Alaska
National Register of Historic Places in Denali National Park and Preserve |
https://en.wikipedia.org/wiki/Avsim.com | AVSIM is a nonprofit flight simulation social networking service that focuses on Microsoft Flight Simulator, Prepar3D, and X-Plane. It features a community forum, file library, and product reviews. The website is maintained by a group of volunteers. Bandwidth and equipment is paid for by donations and advertising. It is one of the world's largest flight simulation websites and provides users access to information and add-ons for the flight simulator series of games. On May 12, 2009, the website was attacked by a hacker which resulted in a catastrophic loss of data. AVSIM was able to fully recover from the hack with the help of IT support from around the world.
History
The publisher of AVSIM, Tom Allensworth, operated a Bulletin Board System from 1983 until approximately the fall of 1995. Initially named CAPENET because it was located in Cape Cod (a peninsula of Massachusetts) during the early 1980s, it was renamed The Vine (The Virginia Information and Network Exchange) when moved to central Virginia in 1987. These early forays into BBS systems, combined with an early exposure to aviation through flight lessons in the early 1970s, as well as Bruce Artwick's Flight Simulator 1.0, brought about the concept of developing an aviation-themed website in the closing months of 1996.
The initial concept for AVSIM was the provision of articles and capture images of the flight simulation genre, collated into HTML format as a monthly magazine and packaged into a zip file. This was then made available for download among the major library servers on the Internet, including the file library system run and maintained at the Indiana University of Pennsylvania, which was becoming one of the first major file libraries for flight simulation. The first issue was uploaded to the university and elsewhere on 1 March 1997. With the growth of the flight simulation community, the magazine moved into a continuously updated website in April 1997. The site began listing news items from the flight simulation industry in 1999, and has been doing so ever since.
Reception
The website is popular within the video game genre of flight simulation. Commentators within the flight simulation and aviation community identify the site as a key website within the genre, along with the similar website Flightsim.com. The Alexa traffic website lists Avsim.com as the highest rating flight simulation website on its network, which Avsim.com claim makes them the most visited flight simulation website on the internet.
Hacking case
On May 12, 2009, AVSIM was attacked by a hacker, resulting in a catastrophic loss of data from the website. Tom Allensworth, CEO and Publisher of AVSIM, explained that the site used two servers to back-up the site's data, but that the hacker deleted the content of both, destroying the ability to use one server to restore the data of the other. The site had not established an external backup system. After AVSIM went offline, Allensworth issued the following announc |
https://en.wikipedia.org/wiki/Neural%20network%20%28disambiguation%29 | Neural network refers to interconnected populations of neurons or neuron simulations that form the structure and architecture of nervous systems, in animals, humans, and computing systems:
Biological neural network (a.k.a. neural circuit), a collection of physically interconnected neurons that carry out a specific function together
Large scale brain networks, biological neural networks on a larger scale (i.e., interaction of multiple neural circuits)
Artificial neural network, a computing system inspired by the biological neural networks found in animal brains
Deep neural network, an artificial neural network with multiple layers between the input and output layers
Convolutional neural network, a class of deep neural networks, most commonly applied to analyzing visual imagery
Neural networks may also refer to:
Neural Networks (journal), peer-reviewed scientific journal
See also
Neutral network (evolution) |
https://en.wikipedia.org/wiki/Scott%20Knaster | Scott Knaster is an American technical writer who has written many books, mostly dealing with Macintosh programming and using the Macintosh. He has worked for such companies as Apple Inc., General Magic, Microsoft, Danger Inc., and Google.
Knaster was a Technical Writer while at Alphabet. From April 2011 through March 2014, he was the editor of the Google Developers Blog (formerly Google Code Blog).
Knaster's first books on Macintosh programming in the late 1980s and early 1990s were considered required reading for Macintosh programmers for many years.
In addition to writing books, Knaster writes for several periodicals and web sites including Macworld, MacTech, and O'Reilly Media's Mac Dev Center.
Knaster is a regular speaker at Macworld Expo, MacHack (until it ended), and sits on the panel of Apple's Stump the Experts.
Knaster was a guest on MacBreak Weekly episode 354, "Leave Cindy Alone!".
Knaster appeared on the October 14, 2010 episode of John Wants Answers to discuss baseball.
Knaster is a stage actor who has appeared in many musical productions and played the lead role of Tevye in Fiddler on the Roof, and has written and performed his own show Adjacent to Greatness.
Works
Cooking with Hypertalk 2.0
How to Write Macintosh Software: The Debugging Reference for Macintosh (2nd edition: 1988, ; 3rd edition: 1992, )
Macintosh Programming Secrets (1st edition: 1988) (2nd edition: 1992, )
Macworld Discover Internet Explorer 3 (1997, )
MSN the Everyday Web (2001, )
Mac Toys: 12 Cool Projects for Home, Office, and Entertainment (2004, )
Hacking iPod and iTunes (2004, )
Hacking Mac OS X Tiger: Serious Hacks, Mods and Customizations (2005, )
Take Control of Switching to the Mac (2008, )
Learn Objective-C on the Mac (2008, )
Knaster was also the series editor for Addison-Wesley's Macintosh Inside Out, a collection of 19 technical books published over a 3-year period in the 1990s.
References
Living people
American technology writers
Apple Inc. employees
Year of birth missing (living people)
Computer programmers
American bloggers
Writers from California
Microsoft employees
Google employees
21st-century American non-fiction writers |
https://en.wikipedia.org/wiki/Hot30%20Countdown | The Hot30 Countdown was an Australian radio show hosted by Mike Christian (MC) and Mel Greig. It was broadcast on the Today Network from the studios of 2Day FM in Sydney, New South Wales to every state and the Australian Capital Territory following The Dirt. It was cancelled on 10 December 2012, following the death of Jacintha Saldanha, and was replaced by The Bump.
History
Beginning in 1996, the show was first hosted by Ugly Phil and Jackie O under the name Ugly Phil's Hot 30. Brisbane-based announcer, Kyle Sandilands, was then moved in to host with Jackie O until the end of 2003. Labrat and Alexis took over the Hot30 Countdown from 2004 after Sandilands and Jackie O moved to the drive-time slot. A previously unknown announcer "Higgo" stepped in after Labrat took the morning shift on 2Day FM. Alexis and Higgo hosted the nightly show until 2005, when Craig Low came in to host the program until mid-2006. Low occasionally included Carla Bignasca as co-host who was the executive producer of the show from the middle of 2006.
Hot30 Countdown phased out the national promotion of the Black Thunders in early 2005, across the Today Network. Sam Mac and Bignasca hosted the show from late 2006 until early 2007. From early 2007 Tim Lee was announced as the permanent replacement to host the show with Bignasca. In February 2010, it was announced that Lee and Bignasca would be leaving the Hot30 Countdown, with Lee relocating to Fox FM in Melbourne, presenting Mornings; while Bignasca expected to focus on television opportunities. Lee and Bignasca presented their last show on 12 March 2010.
Austereo announced on 10 March 2010 that Charli Robinson and Chris Page would be the new hosts. They commenced on 15 March, subsequently introducing a new show at 7pm, The Dirt. Page left the Hot30 Countdown at the end of 2010, moving to Triple M's Grill Team in Sydney and Delaney became the first solo host of The Dirt nationally.
In February 2011, Austereo announced that Matty Acton and Maude Garrett would be the new hosts. From 5 September 2011, it was announced by Southern Cross Austereo, the Hot30 Countdown would broadcast into syndicated channels as well as additional Today Network regional channels and with the merger it changed their Australian studio line to 13 10 60. Acton and Garrett also hosted a weekend music show on Southern Cross Ten which was launched as Hot30 Countdown TV, airing Saturdays from 10am to 12noon and Sundays at 9am to 12noon.
On 31 January 2012 Garrett revealed on the show that she was leaving on 10 February and it was announced on Friday 9 March that Mel Greig (of Amazing Race Australia) would be the replacement co-host. In November Acton announced that he was leaving the show to work at Sea FM on the Gold Coast, Queensland with Fox FM morning presenter, Mike Christian (MC) replacing Acton in early December.
Timeline of hosts
Sam Mac covered the period between Craig Low's departure in November 2006 and Tim Lee's arrival in January 2007. S |
https://en.wikipedia.org/wiki/Marcel%20Francisci | Marcel Francisci (30 November 1919 – 16 January 1982) was a French politician and an alleged member of the Unione Corse who was accused of masterminding the French Connection drug network. As a young man, Francisci fought in World War II and was awarded the Croix de Guerre. Following the war, he developed a business empire that included casinos in Britain, France and Lebanon. Francisci served in the general council (conseil général) of the Corse-du-Sud (UDR) and was a member of the Civic Action Service (SAC), a Gaullist militia. He was assassinated in Paris in 1982.
Biography
Marcel Francisci was born in Ciamannacce in 1919. As a young man, he fought with the Free French Forces in Italy during World War II and was awarded four medals for acts of heroism, including the Croix de Guerre. After the armistice with Italy, he was recruited into the Corsican Mafia by Jo Renucci and began smuggling cigarettes and silk stockings between Tangiers and Marseilles. During this time, he also established narcotics contacts in various Arab countries.
In 1947 Renucci and Francisci became anti-Communist strongmen for the Rally of the French People (RDF), the forerunner of the present-day Gaullist Party (UDR). Seizing the opportunity, Francisci befriended members of the political coterie of Charles de Gaulle. Francisci's influence in the party grew with his bank account and he would later become a leader of the Gaullist Party in Corsica.
When Renucci died in November 1958, Francisci gained control of his criminal empire. Though Francisci was in charge, he returned to Paris and delegated authority of heroin distribution in Marseilles to underlings. In Paris, Francisci spent much of his time befriending politicians and investing his wealth in casinos. He was the owner of a lucrative international gambling syndicate with lavish casinos in Paris, London and Beirut. He ran the prestigious Cercle Hausmann in Paris.
Throughout the 1960s, Francisci was supposedly involved in gangland wars in southern France. The first war occurred in 1963. The second war occurred between 1965 and 1967 against the powerful Guérini clan. At that time, the Guérini clan was the ruling dynasty of the Corsican Mafia and had systematically organized the smuggling of opium from Turkey and other Middle Eastern countries. The Guérini clan was led by Marseilles mob boss Antoine Guérini and his underling Jean-Baptiste Andreani.
The latter gangland war was reportedly sparked by competition over casino revenues between Guérini and Francisci. The war silently continued for three years with little more than extended obituary notices in the French press. On 23 June 1967, two masked motorcyclists pumped eleven bullets into Antoine Guérini at a Marseilles gas station. Weeks later, Francisci was nearly killed by snipers while leaving an election rally in favor of John Bozzi, a Gaullist candidate, in Ajaccio, Corsica, but he managed to escape. According to the French weekly newspaper L'Express, on 14 Dece |
https://en.wikipedia.org/wiki/Dataquest | Dataquest is an Indian magazine focused on information technology related articles. The magazine is published monthly by Cyber Media India Ltd, South Asia's largest specialty media group. It was one of the first publications to champion energy/green issues and the application of IT in governance.
History and profile
Dataquest Magazine started as an industry publication in 1982 to address the information needs of the then nascent IT industry in India. In the 1990s, it strengthened that position while broadening its coverage to include technology policies, markets and resellers.
Between 2008 and 2011, the magazine transformed itself to a complete publication on IT targeting the enterprise IT users such as CIOs and IT managers. That is also the period when the magazine saw significant research-based content.
The magazine runs two special sections on these two areas: Green IT and eGovernance.
References
External links
Dataquest Website
1982 establishments in Delhi
English-language magazines published in India
Biweekly magazines published in India
Science and technology magazines published in India
Magazines established in 1982
Magazines published in Delhi |
https://en.wikipedia.org/wiki/VDPAU | Video Decode and Presentation API for Unix (VDPAU) is a royalty-free application programming interface (API) as well as its implementation as free and open-source library () distributed under the MIT License. VDPAU is also supported by Nvidia.
The VDPAU interface is to be implemented by device drivers, such as Nvidia GeForce driver, nouveau, amdgpu, to offer end-user software, such as VLC media player or GStreamer, a standardized access to available video decompression acceleration hardware in the form of application-specific integrated circuit (ASIC) blocks on graphics processing units (GPU), such as Nvidia's PureVideo or AMD's Unified Video Decoder and make use of it.
VDPAU is targeted at Unix-like operating systems (including Linux, FreeBSD, Solaris).
Functional range of the interface
VDPAU allows video programs to access the specialized video decoding ASIC on the GPU to offload portions of the video decoding process and video post-processing from the CPU to the GPU.
Currently, the portions capable of being offloaded by VDPAU onto the GPU are motion compensation (mo comp), inverse discrete cosine transform (iDCT), VLD (variable-length decoding) and deblocking for MPEG-1, MPEG-2, MPEG-4 ASP (MPEG-4 Part 2), H.264/MPEG-4 AVC and VC-1, WMV3/WMV9 encoded videos. Which specific codecs of these that can be offloaded to the GPU depends on the generation version of the GPU hardware.
History
VDPAU was originally designed by Nvidia for their PureVideo SIP block present on their GeForce 8 series and later GPUs.
On March 9, 2015, Nvidia released VDPAU version 1.0 which supports High Efficiency Video Coding (HEVC) decoding for the Main, Main 4:4:4, Main Still Picture, Main 10, and Main 12 profiles.
Device drivers and video controllers implementing VDPAU
VDPAU is implemented in X11 software device drivers, but relies on acceleration features in the hardware GPU.
All Nvidia graphic cards for which the driver implements VDPAU are listed in Nvidia PureVideo.
S3 Graphics added VDPAU to the Linux drivers of their Chrome 400 video cards. As of version 14.02.17 of its Linux device driver, VDPAU is available with the S3 Chrome 430 GT, S3 Chrome 440 GTX, S3 Chrome 530 GT and the S3 Chrome 540 GTX hardware.
ATI/AMD released an open source driver for Radeon HD 4000+ graphic cards featuring VDPAU acceleration.
Intel does not offer VDPAU drivers, they only support their VA-API. It is, however, possible to use Intel's VA-API drivers by way of libvdpau-va-gl.
Nvidia hopes other GPU designers will make their products compatible with the open source VDPAU library and provide drivers with VDPAU acceleration by mentioning example names of hardware specific drivers for Intel and ATI: libvdpau_intel.so and libvdpau_ati.so. Intel has stated they are considering VDPAU.
sunxi SoCs (Allwinner) have experimental VDPAU implementation.
Mesa as of v8.0 includes VDPAU for video cards that utilize Gallium3D.
Generic VDPAU driver
As of late 2013, there is an independently |
https://en.wikipedia.org/wiki/Engineering%20informatics | The term Engineering Informatics may be related to information engineering (differently understood information processing), computer engineering (development of computer hardware-software systems), or computational engineering (development of software for engineering purposes), among other meanings. This word is used with different context in different countries. In general, some people assume that the central area of interest in informatics is information processing within man-made artificial (engineering) systems, called also computational or computer systems. The focus on artificial systems separates informatics from psychology and cognitive science, which focus on information processing within natural systems (primarily people). However, nowadays these fields have areas where they overlap, e.g. in field of affective computing.
Computer Engineering as a discipline of field study
Computer-aided design (CAD), intelligent CAD, engineering analysis, collaborative design support, computer-aided engineering, and product life-cycle management are some of the terms that have emerged over the past decades of computing in engineering. Codification and automation of engineering knowledge and methods have had major impact on engineering practice. The use of computers by engineers has consistently tracked advancements in computer and information sciences. Computing, algorithms, computational methods, and engineering have increasingly intertwined themselves as developments in theory and practice in both disciplines influence each other. Therefore, it is now time to begin using the term “engineering informatics” to cover the science of the information that flows through these processes.
Informatics, with origins in the German word "Informatik" referring to automated information processing, has evolved to its current broad definition. The rise of the term informatics can be attributed to the breadth of disciplines that are now accepted and envisioned as contributing to the field of computing and information sciences. A common definition of informatics adopted by many departments/schools of informatics comes from the University of Edinburgh: "the study of the structure, behavior, and interactions of natural and artificial computational systems that store, process and communicate information.” Informatics includes the science of information, the practice of information processing, and the engineering of information systems.
The history of engineering and computers shows a trend of increasing sophistication in the type of engineering problems being solved. Early CAD was primarily geometry driven (using mathematics and computer science). Then came the engineering use of AI, driven by theories of cognitive science and computational models of cognition (logic and pattern based). More recently, models of collaboration and representation and acquisition of collective knowledge have been introduced, driven by fields of social sciences (ethnography, sociology of wo |
https://en.wikipedia.org/wiki/Correlated%20subquery | In a SQL database query, a correlated subquery (also known as a synchronized subquery) is a subquery (a query nested inside another query) that uses values from the outer query. Because the subquery may be evaluated once for each row processed by the outer query, it can be slow.
Examples
Here is an example for a typical correlated subquery. In this example, the objective is to find all employees whose salary is above average for their department.
SELECT employee_number, name
FROM employees emp
WHERE salary > (
SELECT AVG(salary)
FROM employees
WHERE department = emp.department);
In the above query the outer query is
SELECT employee_number, name
FROM employees emp
WHERE salary > ...
and the inner query (the correlated subquery) is
SELECT AVG(salary)
FROM employees
WHERE department = emp.department
In the above nested query the inner query has to be re-executed for each employee. (A sufficiently smart implementation may cache the inner query's result on a department-by-department basis, but even in the best case the inner query must be executed once per department.)
Correlated subqueries may appear elsewhere besides the WHERE clause; for example, this query uses a correlated subquery in the SELECT clause to print the entire list of employees alongside the average salary for each employee's department. Again, because the subquery is correlated with a column of the outer query, it must be re-executed for each row of the result.
SELECT employee_number,
name,
(SELECT AVG(salary)
FROM employees
WHERE department = emp.department) AS department_average
FROM employees emp
Correlated subqueries in the FROM clause
It is generally meaningless to have a correlated subquery in the FROM clause because the table in the FROM clause is needed to evaluate the outer query, but the correlated subquery in the FROM clause can't be evaluated before the outer query is evaluated, causing a chicken-and-egg problem. Specifically, MariaDB lists this as a limitation in its documentation.
However, in some database systems, it is allowed to use correlated subqueries while joining in the FROM clause, referencing the tables listed before the join using a specified keyword, producing a number of rows in the correlated subquery and joining it to the table on the left. For example, in PostgreSQL, adding the keyword LATERAL before the right-hand subquery, or in Microsoft SQL Server, using the keyword CROSS APPLY or OUTER APPLY instead of JOIN achieves the effect.
Computation of correlated subqueries
A commonly used computational method for a correlated subquery is to rewrite it into an equivalent flat query (a process known as flattening
). The algorithm development in this direction has an advantage of low complexity. Because this is a customized approach, existing database systems cannot flatten arbitrary correlated subqueries by following certain general rules. In addition, this ap |
https://en.wikipedia.org/wiki/List%20of%20insects%20in%20the%20Red%20Data%20Book%20of%20Russia | This is a list of insects in the Red Data Book of Russia. The Red Data Book of Russia is a state document established for documenting rare and endangered species of animals, plants and fungi, as well as some local subspecies (such as the Ladoga seal) that exist within the territory of the Russian Federation and its continental shelf and marine economic zone.
Odonata
Anax imperator (declining)
Orthoptera
Bradyporus multituberculatus (endangered)
Saga pedo (declining)
Coleoptera
Carabus caucasicus (declining)
Carabus gebleri (endangered)
Carabus avinovi (declining)
Carabus lopatini (declining)
Carabus constricticollis (declining)
Carabus rugipennis (declining)
Carabus jankowskii (declining)
Carabus constantinovi (declining)
Carabus riedeli (declining)
Carabus hungaricus (declining)
Carabus menetriesi (declining)
Carabus miroshnikovi (declining)
Calosoma maximowiczi (declining)
Calosoma sycophanta (declining)
Calosoma reticulatus (endangered)
Alaus parreyssi (endangered)
Ceruchus lignarius (declining)
Lucanus cervus (declining)
Osmoderma eremita (declining)
Osmoderma barnabita (declining)
Osmoderma opicum (declining)
Netocia aeruginosa (declining)
Netocia speciosa (declining)
Aphodius bimaculatus (declining)
Asmocia Ripteculatus(declining)
Callipogon relictus (declining)
Callipogon serricollis (declining)
Callipogon caucasicola (declining)
Callipogon nodulosus (declining)
Rosalia alpina (declining)
Rosalia coelestis (declining)
Chrysolina urjanchaica (declining)
Brachycerus sinuatus (endangered)
Otiorhynchus rugosus (endangered)
Omias verruca (endangered)
Euidosomus acuminatus (declining)
Stephanocleonus tetragrammus (declining)
Hymenoptera
Pleroneura dahli (declining)
Megaxyela gigantea (declining)
Orussus abietinus (declining)
Characopygus modestus (declining)
Acantholyda flaviceps (declining)
Caenolyda reticulata (declining)
Pseudoclavellaria semenovi (declining)
Orientabia egregia (declining)
Zaraea gussakovskii (declining)
Abia semenoviana (declining)
Apterogyna volgensis (declining)
Parnopes grandior (declining)
Xylocopa valga (declining)
Bombus paradoxus (declining)
Bombus anachoreta (declining)
Bombus unicus (declining)
Bombus proteus (declining)
Bombus armeniacus (declining)
Bombus czerskii (declining)
Bombus fragrans (declining)
Bombus mastrucatus (declining)
Apis cerana (endangered)
Liometopum orientale (declining)
Lepidoptera
Camptoloma interiorata (endangered)
Pallarctia mongolica (endangered)
Catocala kotshubeji (endangered)
Catocala moltrecht (endangered)
Catocala nagioides (declining)
Arcte coerula (endangered)
Mimeusemia persimilis (endangered)
Asteropetes noctuina (endangered)
Bombyx mandarina (endangered)
Numenes disparilis (endangered)
Numenes furva (endangered)
Rosama ornata (endangered)
Sphecodina caudata (endangered)
Clanis undulosa (endangered)
Bibasis aquilina (declining)
Coreana raphaelis (declining)
Chaetoprocta superans (endangered)
Chaetoprocta pacifica (endangered)
Neolycaena davidi (endangered)
Neolycaena rh |
https://en.wikipedia.org/wiki/BinTube | BinTube is a binary Usenet client for the Microsoft Windows operating system.
Features
BinTube streams video, audio and images directly from Usenet. Other features include SSL connections, automatic repair of downloaded data and OpenSearch search giving it the capability to find content on most web based Usenet search engines.
See also
List of Usenet newsreaders
Comparison of Usenet newsreaders
Notes
External links
Usenet clients
Shareware |
https://en.wikipedia.org/wiki/ZX%20Printer | The Sinclair ZX Printer is a spark printer which was produced by Sinclair Research for its ZX81 home computer. It was launched in 1981, with a recommended retail price of £49.95.
The ZX Printer used special wide black paper which was supplied coated with a thin layer of aluminium. To mark the paper, one of the printer's two styluses passed a current through a small area of the aluminium layer, causing the aluminium to evaporate and reveal the black under-surface. The printer's horizontal resolution was the same as the ZX81's video display, i.e. 256 dots (pixels) or 32 characters (using the standard character definition).
The ZX Printer was never intended for word processing purposes, instead being aimed at users who wanted to obtain program listings for reference purposes.
The ZX Printer was also compatible with the earlier ZX80 computer (when fitted with the 8kB ROM upgrade) and the later ZX Spectrum, and plugged directly into the expansion bus connector via a short cable. The expansion bus was duplicated on the outside of the printer's connector, allowing other peripherals to be connected concurrently. The printer drew its power directly from the expansion bus, and was sold with a larger (1-2A) power supply for the ZX81 to accommodate the additional power drain. The Spectrum's user manual noted that this was not needed for the Spectrum as its default 1.1A power supply was sufficient.
The peripheral was affectionately referred to during the 1980s by users in the UK home computing community (many of whom were teenagers) as 'The Astronaut's Bog Roll' ('bog roll' being common English vernacular for toilet paper, and the astronaut reference pertaining to the silvery, glittery appearance of the ZX Printer's paper). The printer itself also bore more than a passing resemblance to a 1980s-era toilet-roll dispenser, in terms of its visual design.
Competing printers
The Alphacom 32 was a thermal printer that used the same interface, and therefore could be driven by a ZX81 or Spectrum without additional software. Unlike the ZX Printer, it had a separate power supply, and made use of standard thermal paper rolls which remain widely available.
See also
ZX Spectrum
Sinclair Research
References
External links
Planet Sinclair: ZX Printer
Ian Adamson; Richard Kennedy. Sinclair and the 'Sunrise' Technology., Penguin Books, 1986
comp.sys.sinclair FAQ: Peripherals: Printers
Computer-related introductions in 1981
Home computer peripherals
Sinclair Research |
https://en.wikipedia.org/wiki/SQR%20%28disambiguation%29 | SQR may refer to:
Biochemistry
Succinate-Q reductase, an enzyme complex
sulfide:quinone oxidorreductase pathway, see Microbial oxidation of sulfur
Computing
SQR, a programming language
SQR codes, Secure Quick Response codes
Linguistics
Siculo-Arabic (ISO 639 language code: sqr)
Smiting-blade symbol (hieroglyph)
Mathematics
square (algebra) (sqr, sq)
square root (sqr, sqrt)
Transportation
Soroako Airport (IATA airport code SQR) Soroako, South Sulawesi, Indonesia
Alsaqer Aviation (ICAO airline code SQR) defunct Libyan airline, see List of airline codes (A)
Sultanpur Lodi (Indian rail code SQR), see List of railway stations in India
Other uses
SQR Department Store, see Downtown Anaheim
See also
Square (disambiguation) |
https://en.wikipedia.org/wiki/List%20of%20awards%20and%20nominations%20received%20by%20Moonlighting%20%28TV%20series%29 | Moonlighting is an American television series that aired on ABC from March 3, 1985, to May 14, 1989. The network aired a total of 66 episodes (67 in syndication as the pilot is split into two episodes). Starring Bruce Willis and Cybill Shepherd as private detectives, the show was a mixture of drama, comedy, and romance, and was considered to be one of the first successful and influential examples of comedy-drama, or "dramedy", emerging as a distinct television genre.
Awards and nominations
Notes
References
External links
Moonlighting |
https://en.wikipedia.org/wiki/Data%20source | A data source may refer to:
Database
Datasource, a special name for the connection set up to a database from a server in the Java software platform
Computer file
Data stream |
https://en.wikipedia.org/wiki/KDS | KDS may refer to:
KDS (company) (Klee Data System), a travel & expense management company
Conservative Democrats of Slovakia
Christian Democratic Party (Czech Republic), former political party in the Czech Republic
Christian Democrats (Sweden), a political party in Sweden
Khalsa Diwan Society Vancouver
Kinetic data structure, a data structure used to track an attribute of a geometric system that is moving continuously.
Committee for State Security (Bulgaria) (); abbreviated КДС or KDS |
https://en.wikipedia.org/wiki/Harwell%20computer | The Harwell computer, or Harwell Dekatron computer, later known as the Wolverhampton Instrument for Teaching Computing from Harwell (WITCH), is an early British computer of the 1950s based on valves and relays. From 2009 to 2012, it was restored at the National Museum of Computing. In 2013, for the second time, the Guinness Book of World Records recognised it as the world's oldest working digital computer, following its restoration. It previously held the title for several years until it was decommissioned in 1973. The museum uses the computer's visual, dekatron-based memory to teach schoolchildren about computers.
Construction and use at Harwell
The computer, which weighs , was built and used at the Atomic Energy Research Establishment in Harwell, Berkshire. Construction started in 1949, and the machine became operational in April 1951. It was handed over to the computing group in May 1952 and remained in use until 1957.
It used 828 dekatrons for volatile memory, similar to RAM in a modern computer, and paper tape for input and program storage. A total of 480 relays were used for sequence control and 199 valves(electronic vacuum tube) for calculations. The computer stands 2 meters high, 6 meters wide, and 1 meter deep with a power consumption of 1.5 kW. Output was to either a Creed teleprinter or to a paper tape punch. The machine was decimal and initially had twenty eight-digit dekatron registers for internal storage, which was increased to 40 which appeared to be enough for nearly all calculations. It was assembled from components more commonly found in a British telephone exchange. The man who led the effort to rebuild the machine (see below) put it in perspective to the BBC: "All together, the machine can store 90 numbers. The closest analogy is a man with a pocket calculator," Delwyn Holroyd, who led the restoration effort, tells the BBC in a video about the restoration. Although it could on occasions act as a true stored-program computer, that was not its normal mode of operation. It had a multiplication time of between 5 and 10 seconds, very slow for an electronic computer.
As Ted Cooke-Yarborough wrote of his design in 1953 "a slow computer can only justify its existence if it is capable of running for long periods unattended and the time spent performing useful computations is a large proportion of the total time available". The design was noted for its reliability because in the period from May 1952 until February 1953 it averaged 80 hours per week running time. Dr Jack Howlett, Director of the Computer Laboratory at AERE 1948–61, said it "could be left unattended for long periods; I think the record was over one Christmas-New Year holiday when it was all by itself, with miles of input data on punched tape to keep it happy, for at least ten days and was still ticking away when we came back." It was the machine's untiring durability, rather than its speed, that was its main feature. Human mathematicians (a job role called a "hand-com |
https://en.wikipedia.org/wiki/SHA-3 | SHA-3 (Secure Hash Algorithm 3) is the latest member of the Secure Hash Algorithm family of standards, released by NIST on August 5, 2015. Although part of the same series of standards, SHA-3 is internally different from the MD5-like structure of SHA-1 and SHA-2.
SHA-3 is a subset of the broader cryptographic primitive family Keccak ( or ), designed by Guido Bertoni, Joan Daemen, Michaël Peeters, and Gilles Van Assche, building upon RadioGatún. Keccak's authors have proposed additional uses for the function, not (yet) standardized by NIST, including a stream cipher, an authenticated encryption system, a "tree" hashing scheme for faster hashing on certain architectures, and AEAD ciphers Keyak and Ketje.
Keccak is based on a novel approach called sponge construction. Sponge construction is based on a wide random function or random permutation, and allows inputting ("absorbing" in sponge terminology) any amount of data, and outputting ("squeezing") any amount of data, while acting as a pseudorandom function with regard to all previous inputs. This leads to great flexibility.
NIST does not currently plan to withdraw SHA-2 or remove it from the revised Secure Hash Standard. The purpose of SHA-3 is that it can be directly substituted for SHA-2 in current applications if necessary, and to significantly improve the robustness of NIST's overall hash algorithm toolkit.
For small message sizes, the creators of the Keccak algorithms and the SHA-3 functions suggest using the faster function KangarooTwelve with adjusted parameters and a new tree hashing mode without extra overhead.
History
The Keccak algorithm is the work of Guido Bertoni, Joan Daemen (who also co-designed the Rijndael cipher with Vincent Rijmen), Michaël Peeters, and Gilles Van Assche. It is based on earlier hash function designs PANAMA and RadioGatún. PANAMA was designed by Daemen and Craig Clapp in 1998. RadioGatún, a successor of PANAMA, was designed by Daemen, Peeters, and Van Assche, and was presented at the NIST Hash Workshop in 2006. The reference implementation source code was dedicated to public domain via CC0 waiver.
In 2006, NIST started to organize the NIST hash function competition to create a new hash standard, SHA-3. SHA-3 is not meant to replace SHA-2, as no significant attack on SHA-2 has been demonstrated . Because of the successful attacks on MD5, SHA-0 and SHA-1,
NIST perceived a need for an alternative, dissimilar cryptographic hash, which became SHA-3.
After a setup period, admissions were to be submitted by the end of 2008. Keccak was accepted as one of the 51 candidates. In July 2009, 14 algorithms were selected for the second round. Keccak advanced to the last round in December 2010.
During the competition, entrants were permitted to "tweak" their algorithms to address issues that were discovered. Changes that have been made to Keccak are:
The number of rounds was increased from to to be more conservative about security.
The message padding was changed fro |
https://en.wikipedia.org/wiki/Analytic%20dissection | Analytic dissection is a concept in U.S. copyright law analysis of computer software. Analytic dissection is a tool for determining whether a work accused of copyright infringement is substantially similar to a copyright-protected work.
In analytic dissection, unprotectable elements of a work are dissected out and discarded before making any comparison of the two works. These unprotectable components include idea (as contrasted with expression), scènes à faire (conventional elements typical of a genre), material in the public domain, and functional aspects. As the Ninth Circuit explained in the 1988 Data East case, that such elements are common to two works does not create substantial similarity. Rather, infringing similarity must be based on the similarity of what remains after the unprotectable elements are dissected out.
Subsequently, in Computer Associates International, Inc. v. Altai, Inc., the Second Circuit applied this conceptual tool in determining whether two computer programs were substantially similar, under the name of the "Abstraction-Filtration-Comparison" test. As the Tenth Circuit concisely explained this test in Gates Rubber v. Bando Chemical Industries:
[A] court should dissect the program according to its varying levels of generality as provided in the abstractions test. Second, poised with this framework, the court should examine each level of abstraction in order to filter out those elements of the program that are unprotectable. Filtration should eliminate from comparison the unprotectable elements of ideas, processes, facts, public domain information, merger material, scènes à faire material, and other unprotectable elements suggested by the particular facts of the program under examination. Third, the court should then compare the remaining protectable elements with the allegedly infringing program to determine whether the defendants have misappropriated substantial elements of the plaintiff's program.
This legal test has generally "been applied in subsequent [copyright law] decisions, to the extent that it is recognised in the USA, and elsewhere, as the accepted standard."
Parallels in patent law
A conceptually similar approach has been applied at times in US, UK, and European patent law. In Neilson v. Harford, the Exchequer adopted a method of analyzing the patent-eligibility of inventions based on a natural principle or phenomenon of nature, in which the principle is treated as if part of the prior art and the remainder of the invention (i.e., the mechanical implementation of the principle) is evaluated for patentability under the usual tests (novelty, etc.). The US Supreme Court followed this approach in O'Reilly v. Morse and subsequent decisions including Parker v. Flook and Mayo v. Prometheus. A similar type of analysis of obviousness or inventive level has been used under the name of the "point of novelty" test, which is suggested by the use of a Jepson claim.
References
United States copyright law |
https://en.wikipedia.org/wiki/Belgian%20National%20Internet%20eXchange | The Belgian National Internet eXchange (BNIX) is an internet exchange point operated by the Belgian national research network BELNET. Created in 1995, it is one of the charter members of Euro-IX, the European Internet Exchange Association.
BNIX peering is available at a number of point of presence locations in Belgium:
Interxion, Zaventem
CenturyLink, Evere
LCL, Diegem
Previously Belnet also operated a pop in Brussels. This location was taken out of service at the end of 2008.
The three sites are connected via three 100 Gbit/s connections in a ring topology. BNIX carries IPv4, Multicast (since 1999) and IPv6 (since 2000) traffic.
BNIX charges connection fees and a monthly fee, depending on the type of connection.
See also
List of Internet exchange points
References
External links
BNIX site
Belnet site
Internet exchange points in Belgium
Internet in Belgium |
https://en.wikipedia.org/wiki/Mayabeque%20River | Mayabeque River (alternately Rio Mayabeque) () is a river of western Cuba, considered the largest in the southwestern watershed of Cuba, with an extensive fluvial network that encompasses the municipalities of Güines, San Jose de las Lajas, Jaruco, Madruga, and Melena del Sur. The old outlet in Melena del Sur (now connected with the main river only by irrigation canals) is named Antiguo Mayabeque. The Antiguo (ancient) Mayabeque is still navigable by small boats in the last .
Mayabeque was the largest river in the former province of Havana, and presently (2011) is the main river of the Mayabeque Province, named after the river. It runs from north to south and on its banks is the important and historic city of Güines. Its cold waters are a source of satisfaction for bathers in the summer time, ending at the shores of Mayabeque Beach in Melena del Sur.
Vegetation
Among the plants that grow on the banks of the river you can find plenty of trees and shrubs of different species as the mangrove which gives a remarkable average color red to its waters.
History
The earliest mention of river data Mayabeque 1509, just 17 years after the discovery of Cuba, where some Indians had been referred to the father Houses in a place farther west from where it was Panfilo de Narvaez with their archers, the people were Indian in which they were captives, some Spanish people, two women and one man. It is believed that the original Havana (San Cristóbal de La Habana) village was founded in 1514 or 1515 on the banks of the Mayabeque (most likely on the Antiguo Mayabeque) a few kilometers from the south coast.
Mayabeque National Camp School
In 1956, under the leadership of Serafín García Menocal, president of the Consejo Nacional Scouts de Cuba (National Council), the Scouts of Cuba bought the national training grounds Campo Escuela Nacional Mayabeque near Catalina de Güines within of the capital. The National Camp School was dedicated to the training of Scouters and for Scout camping. The Field School was abandoned in 1961, and at the moment is under the water of Pedroso reservoir.
Gallery
See also
Rivers of Cuba
References
The Columbia Gazetteer of North America. 2000.
External links
Rivers of Cuba
Geography of Mayabeque Province |
https://en.wikipedia.org/wiki/Friendly%20Fire%20%281979%20film%29 | Friendly Fire is an American television movie first broadcast on the ABC network on April 22, 1979. Watched that night by an estimated 64 million people, Friendly Fire went on to win four Emmy awards, including Outstanding Drama Special. The film was directed by David Greene.
The movie tells the real-life story of Peg Mullen (played by Carol Burnett), a woman from rural Iowa who with her husband works against government obstacles to uncover the actual details and facts about the death of their son Michael, an Army infantry soldier killed by "friendly fire" in February 1970 during the Vietnam War.
Her husband Gene, a World War II veteran, is played by Ned Beatty.
Sergeant Mullen was drafted in September 1968 after he graduated from college and sent to South Vietnam (Republic of Vietnam) assigned to the 198th Infantry Brigade, 23rd Infantry Division (Americal Division) in September 1969. He was listed as a non-battle casualty after being accidentally killed with another soldier from an exploding Army artillery shell burst fragment, while Mullen and most of his platoon were asleep at night on their hilltop position; the government did not report publicly the number of non-battle deaths or their names on its weekly casualty lists during the war.
Friendly Fire is adapted by Fay Kanin from C. D. B. Bryan's 1976 book of the same name. The book was adapted from a series of New Yorker magazine articles Bryan had written about the Mullens and their ordeal.
Cast
Carol Burnett as Peg Mullen
Ned Beatty as Gene Mullen
Sam Waterston as C. D. B. Bryan
Dennis Erdman as Michael E. Mullen
Timothy Hutton as John Mullen
Fanny Spiess as Mary Mullen
Sherry Hursey as Patricia Mullen
Michael Flanagan as Father Shimon
Hilly Hicks as Willis Huddleston
William Jordan as Col. Byron Schindler
Vernon Weddle as Col. Georgi
Jack Rader as Sgt. Fitzgerald
Robert Wahler as Alan Hulting
David Keith as Leroy Hamilton
See also
6th Infantry Regiment (United States)
Vietnam War casualties
References
External links
New York Times overview of Friendly Fire
1979 television films
1979 films
ABC network original films
American television films
Vietnam War films
Films scored by Leonard Rosenman
Films directed by David Greene
Films set in the 1970s
Films set in Iowa
Peabody Award-winning broadcasts |
https://en.wikipedia.org/wiki/Elizabeth%20Mynatt | Elizabeth D. "Beth" Mynatt (born July 12, 1966) is the Dean of the Khoury College of Computer Sciences at Northeastern University. She is former executive director of the Institute for People and Technology, director of the GVU Center at Georgia Tech, and Regents' and Distinguished Professor in the School of Interactive Computing, all at the Georgia Institute of Technology.
She is best known for her research in the fields of human-computer interaction, ubiquitous computing, health informatics, and assistive technology. She pioneered creating nonspeech auditory interfaces from graphical interfaces to enable blind computer users to work with modern computer applications. From 2001 to 2005, she was selected to be the associate director of the GVU Center at Georgia Tech, and in 2005 she was appointed director. Her current research explores the implications and opportunities stemming from the pervasive presence of computation in the informal activities of everyday life.
Early life and education
Mynatt was born in Knoxville, Tennessee. She attended North Carolina State University for her undergraduate studies, graduating summa cum laude with a Bachelor of Science degree in computer science in 1988. She received a master's degree in 1989 in Information and Computer Science at the Georgia Institute of Technology. Mynatt went on to receive a Ph.D. at the Georgia Institute of Technology in 1995 in Computer Science where she was advised by James D. Foley. Her thesis, "Audio GUIs: Transforming Graphical User Interfaces into Auditory Interfaces", was a system which transformed applications into auditory interfaces to enable people to experience what interacting with graphical interfaces might be like for a blind user.
Career
Upon graduation from Georgia Tech, Mynatt accepted a position as a member of the Research Staff at Xerox PARC. In 1998 she returned to Georgia Tech as an assistant professor and in 2002 became associate professor. From 2004 to 2005 she was director of the Aware Home Research Initiative and from 2006 to 2007 was the associate director of the Health Systems Institute.
Mynatt currently directs the GVU Center at Georgia Tech. She also directs the research program in Everyday Computing, examining the human-computer interface implications of having computation continuously present in many aspects of everyday life. Themes in her research include supporting informal collaboration and awareness in office environments, enabling creative work and visual communication, and augmenting social processes for managing personal information. Mynatt is one of the principal researchers in the Aware Home Research Initiative; investigating the design of future home technologies, especially those that enable older adults to continue living independently as opposed to moving to an institutional care setting.
In home environments, she is interested in using computing technology to increase the independence and capabilities of people and families for domains s |
https://en.wikipedia.org/wiki/Ontology%20engineering | In computer science, information science and systems engineering, ontology engineering is a field which studies the methods and methodologies for building ontologies, which encompasses a representation, formal naming and definition of the categories, properties and relations between the concepts, data and entities of a given domain of interest. In a broader sense, this field also includes a knowledge construction of the domain using formal ontology representations such as OWL/RDF.
A large-scale representation of abstract concepts such as actions, time, physical objects and beliefs would be an example of ontological engineering. Ontology engineering is one of the areas of applied ontology, and can be seen as an application of philosophical ontology. Core ideas and objectives of ontology engineering are also central in conceptual modeling.
Automated processing of information not interpretable by software agents can be improved by adding rich semantics to the corresponding resources, such as video files. One of the approaches for the formal conceptualization of represented knowledge domains is the use of machine-interpretable ontologies, which provide structured data in, or based on, RDF, RDFS, and OWL. Ontology engineering is the design and creation of such ontologies, which can contain more than just the list of terms (controlled vocabulary); they contain terminological, assertional, and relational axioms to define concepts (classes), individuals, and roles (properties) (TBox, ABox, and RBox, respectively). Ontology engineering is a relatively new field of study concerning the ontology development process, the ontology life cycle, the methods and methodologies for building ontologies, and the tool suites and languages that support them.
A common way to provide the logical underpinning of ontologies is to formalize the axioms with description logics, which can then be translated to any serialization of RDF, such as RDF/XML or Turtle. Beyond the description logic axioms, ontologies might also contain SWRL rules. The concept definitions can be mapped to any kind of resource or resource segment in RDF, such as images, videos, and regions of interest, to annotate objects, persons, etc., and interlink them with related resources across knowledge bases, ontologies, and LOD datasets. This information, based on human experience and knowledge, is valuable for reasoners for the automated interpretation of sophisticated and ambiguous contents, such as the visual content of multimedia resources. Application areas of ontology-based reasoning include, but are not limited to, information retrieval, automated scene interpretation, and knowledge discovery.
Ontology languages
An ontology language is a formal language used to encode the ontology. There are a number of such languages for ontologies, both proprietary and standards-based:
Common logic is ISO standard 24707, a specification for a family of ontology languages that can be accurately translated into eac |
https://en.wikipedia.org/wiki/Ginko%20Financial | Ginko Financial was an alleged Ponzi scheme on the social networking video game Second Life. It offered accounts denominated in Linden Dollars, which would be paid extremely high interest rates (at one point 0.145% per day or 69.7% per year), ostensibly funded by undisclosed investments.
Many of the bank's investments were believed to be in in-game casinos. In 2007, after Linden Labs placed restrictions on in-world gambling, there was a run on the bank which caused it to collapse. All remaining accounts (by then worth 200 million Linden Dollars) were compulsorily converted into perpetual bonds.
After the collapse, Linden Labs introduced a rule that interest-paying accounts in Second Life could only be offered by organisations with real-life banking licenses.
References
Second Life
Virtual economies |
https://en.wikipedia.org/wiki/S3%20Graphics%20Chrome%20400 | S3 Graphics Chrome 400 is a computer graphics chip made by VIA. It was the successor of S3 Chrome S20 series.
History
VIA planned the production of two new graphics chips, Chrome 440 and 430, by the end of 2007. The Chrome 460 supported DirectX 10 and adopted a 90 nanometer process, while the Chrome 430 was to support DirectX 10.1 using a 65 nanometer process. The Chrome 400 series was codenamed 'Destination'. Both chips were to be manufactured by Fujitsu. Volume production was expected to start before the end of the year.
The 430 GT was released on 2008-03-20 in the US market, while 440 GTX was released on 2008-05-30.
Features
The production models were made in 65 nm process, support DirectX 10.1, and use PCI Express 2.0 interface. Chrome engine supported variable-length decoding, and dual-stream Blu-ray playback (440 GTX). The display unit included two dual-link DVI transmitters with integrated HDMI (audio pass-through) and HDCP, an integrated dual-channel LVDS transmitter, an integrated TV/HDTV encoder, and support for two analog CRTs. 440 GTX ran at 725 MHz core speed.
Chrome 400 ULP
ULP was the mobile line for the Chrome 400. 430 ULP includes features in 430 GT, while 435 ULP and 440 ULP includes features in 440 GTX.
This product was released on 2008-09-24.
Reception
In TechPowerUp's review of the 800/800 MHz core/memory version of S3 Graphics Chrome 440 GTX 256 MB video card, its performance was observed to be in the range of Radeon 3450 and GeForce 8500 GT. At a 1024×768 resolution, it was slightly slower than GeForce 9400 GT. Performance per dollar was the lowest of the list. Power consumption is on par with those products.
References
External links
S3 Graphics Chrome 400 page
Graphics cards |
https://en.wikipedia.org/wiki/Amiga%20Walker | The Amiga Walker, sometimes incorrectly known as the Mind Walker, is a prototype of an Amiga computer developed and shown by Amiga Technologies in late 1995/early 1996. Walker was planned as a replacement for the A1200 with a faster CPU, better expansion capabilities, and a built-in CD-ROM. The Walker was never released; Escom and Amiga Technologies went bankrupt, and only two (three) prototypes were made.
The case is unique and radically different from computers before it. The intention was also to make the motherboard available without the case so users could put it into a standard PC case. There were a number of other potential case designs of different sizes, the Walker motherboard could fit all of them; this allowed for expandability tailored to the user's requirements.
When the Walker was announced, it was the subject of much discussion (and ridicule) within the Amiga user community, centering on the unconventional case design.
Technical information
Specifications
CPU:
Motorola 68030/33 MHz (in the prototype version)
Motorola 68030/40 MHz (compared to 68020/14 MHz in A1200)
Chipset: AGA
Memory:
1 MB Kickstart ROM (compared to 512 kB in the original Amiga 1200)
2 MB Chip RAM
4 MB Fast RAM (only in the production version)
Drives:
internal CD-ROM
1.44 MB internal floppy drive
Realtime clock onboard
Additional:
Amiga keyboard
See also
Power A5000
Amiga models and variants
References
External links
Short video of an Amiga Walker prototype on YouTube
Amiga
Vaporware |
https://en.wikipedia.org/wiki/Chase%20%281973%20TV%20series%29 | Chase is an American crime drama television series that aired on the NBC network from September 11, 1973, to April 10, 1974. The show was a production of Jack Webb's Mark VII Limited for Universal Television and marked the first show created by Stephen J. Cannell, who later became known for creating and/or producing his own programs, including NBC's The A-Team. Jack Webb directed the pilot, which aired March 24, 1973.
Overview
The show's title had a double meaning: it was at once the first name of the lead character, Chase Reddick (Mitchell Ryan), the leader of a special team of the Los Angeles Police Department that specialized in solving unusually difficult or violent cases, and indicative of the show's emphasis on the determined pursuit and undercover surveillance of hardened criminals. The unit, headquartered in an old firehouse, relied mainly on alternate/undercover means of transportation such as helicopters, motorcycles, custom vans, taxis, four-wheel-drive vehicles, sports and muscle cars, work trucks (vehicles from the Public Works Department, the telephone company, tow trucks and/or the Postal Service and civilian delivery services) and high-speed driving to apprehend its suspects.
For the first fourteen episodes, Reddick, an LAPD captain, was accompanied by K-9 Sergeant Sam MacCray (Wayne Maunder) and three young officers: Steve Baker (Michael Richardson), Norm Hamilton (Reid Smith), and Fred Sing (Brian Fong). In January 1974, Webb and Universal dropped all the regulars except Ryan and Maunder in favor of a new group of officers: Frank Dawson (Albert Reed), Ed Rice (Gary Crosby, who frequently appeared on the other Mark VII shows), and Tom Wilson (Craig Gardner). Never seen, but "appearing" in every episode was actual LAPD dispatcher Shaaron Claridge, who had worked on Dragnet and Adam-12; according to the pilot script, she was assigned especially to Chase.
NBC first scheduled the show on Tuesdays at 8 p.m. Eastern, opposite CBS' hit series Maude and Hawaii Five-O. At about the same time as the casting change, the network moved Chase to Wednesday nights at 8 p.m. against the Sonny and Cher Comedy Hour. Despite the declining appeal and ratings of the latter (and the couple's forthcoming divorce), Chase did no better there and ended after a one-season run. Cannell would re-use the format of a team of specialists in The A-Team, co-created with Frank Lupo a decade later. Robert A. Cinader, who also supervised Mark VII's Adam-12 and Emergency!, was executive producer of Chase.
Cast
Mitchell Ryan - Capt. Chase Reddick
Wayne Maunder - Sgt. Sam MacCray
Michael Richardson - Off. Steve Baker (episodes 1–14)
Brian Fong - Off. Fred Sing (episodes 1–14)
Reid Smith - Off. Norm Hamilton (episodes 1–14)
Craig Gardner - Tom Wilson
Albert Reed - Frank Dawson
Gary Crosby - Ed Rice
Shaaron Claridge
Episodes
Sources
Total Television: A Comprehensive Guide to Programming from 1948 to the Present, Alex McNeil, New York: Penguin, revised ed. |
https://en.wikipedia.org/wiki/Fianshruth | The title Fianṡruth (Find) refers to two alphabetically arranged Middle Irish lists of names associated with the Finn Cycle, preserved only in the Yellow Book of Lecan and probably datable to the twelfth century. The lists A and B are preceded by almost identical introductions. Many of the approximately 170 names do not occur elsewhere in the attested sources, while a number of familiar faces from later tales in the Finn Cycle, such as Fergus finnbél, are missing.
Manuscript sources
List A: YBL (p. 119a ff), headed “It e annso anmann muntire Find .i. fiandsroth fian Find u(i) Baiscne”
List B: YBL (p. 325a), headed “Fianruth Fiand inso”
Title
The title fian-ṡruth literally means ‘fian-stream’, which one may render as ‘fían-lore’. As observed by Stern, the word recurs in the Metrical Dindshenchas of Carmun as one of the literary genres to be recited at the Fair of Carmun:
Introduction from List B
Except in facsimile, the actual name-lists have not yet seen publication. Ludwig Stern's edition and German translation of the introduction are as follows (deviations in List A are indicated where necessary):
Notes
Sources
Atkinson, Robert. Yellow Book of Lecan. Dublin, 1896. Facsimile edition, pp. 119, 325.
Gwynn, Edward (ed. and tr.). The Metrical Dindshenchas. Vol. 3. Dublin: DIAS, 1906. Available online from CELT.
Meyer, Kuno (intro, ed. and tr.). Fíanaigecht, being a Collection of Hitherto Unedited Irish Poems and Tales Relating to Finn and his Fiana, with an English Translation. Todd Lecture Series 16. Dublin: Dublin Institute for Advanced Studies, 1910.
Stern, Ludwig Christian. “Fiannshruth.” Zeitschrift für celtische Philologie 1 (1897): 471–3.
Fenian Cycle
Early Irish literature
Irish language
Irish-language literature
Texts in Irish
Medieval literature |
https://en.wikipedia.org/wiki/Hint%20%28SQL%29 | In various SQL implementations, a hint is an addition to the SQL standard that instructs the database engine on how to execute the query. For example, a hint may tell the engine to use or not to use an index (even if the query optimizer would decide otherwise).
Implementation
Different database engines use different approaches in implementing hints.
MySQL uses its own extension to the SQL standard, where a table name may be followed by , or keywords.
Oracle implements hints by using specially-crafted comments in the query that begin with a symbol, thus not affecting SQL compatibility.
EDB Postgres Advanced Server (a proprietary version of PostgreSQL from EnterpriseDB) offers hints compatible with those of Oracle.
Microsoft SQL Server offers hints via the keyword
See also
Query optimizer
Query plan
References
SQL |
https://en.wikipedia.org/wiki/Lions%20%28surname%29 | Lions is a family name. Notable people with the family name include:
Jacques-Louis Lions (1928–2001), French mathematician
John Lions (1937–1998), Australian computer scientist
Pierre-Louis Lions (born 1956), French mathematician
See also
Lion (name)
Lyons (surname)
Surnames from nicknames |
https://en.wikipedia.org/wiki/Furtherfield | Furtherfield.org is an artist-led online community, arts organisation and online magazine. It creates and supports global participatory projects with networks of artists, theorists and activists. and offers "a chance for the public to present its own views and enter or alter various art discourses". Their lab-office and gallery currently operates out of in Finsbury Park in London, UK.
Furtherfield describes itself as:
History and background
Furtherfield was founded in Harringay, London, England, in 1996 by artist-theorists Ruth Catlow and Marc Garrett. Inspired by the cultural value of collaboration as opposed to the traditional myth of individual artistic genius, Furtherfield has focused on the development of "artware" – software platforms for creating art – that engages its users in collaborative creative endeavours.
In 2004, Furtherfield opened HTTP, a physical gallery space for networked media art in North London, and since that time it has received funding from the Arts Council of England to support its activities. As well as its own projects, Furtherfield has contributed to other initiatives such as Node.London, hosting exhibitions and events, and contributing to the resulting book, Media Mutandis: a NODE.London Reader; and the travelling exhibition Game/Play (2006–07), co-curated with Q Arts, Derby. In 2007, Furtherfield was ranked in Dazed & Confused's Digital Top 50.
Projects
Furtherfield's activities include artist presentations and exhibitions, residencies, reviews, theoretical texts, the Furtherfield blog, touring exhibitions, online exhibitions and events. All of these activities address the group's interest in collaborative, networked art, open source, media art ecologies and provocative media-art projects.
Specific projects that Furtherfield has developed include:
Artists Re-Thinking the Blockchain;
Artists Re-thinking Games;
Zero Dollar Laptop Workshops;
Media Art Ecologies;
Visitors Studio;
Rosalind – Upstart New Media Lexicon;
House of Technologically Termed Practice;
Furthernoise;
5+5=5 NetArtFilm;
Netbehaviour – new media art mailing list;
Do-It-With-Others (DIWO).
People
Approximately 600 people are regular contributors and collaborators in Furtherfield activities, with an estimated global readership of 26,000. The organisation is run by a core group of six "current grafters" comprising founders Catlow and Garrett (Co-Directors), Charlotte Frost (Executive Director), Neil Jenkins (Technical Director of Projects), Giles Pender (Technical, Network and Logistics’ guru), Michael Szpakowski (Outreach and Education), Olga Panades Massanet (Co-editor and Workshop Facilitator) and Lauren Wright (Co-producer and Coordinator). A "neighbourhood crew" and "now-sleeping Furtherfielders" are also listed on the organisation's website.
Notable artists and curators that Furtherfield has worked with, in various capacities, include Shu Lea Cheang, Thomson & Craighead, Ben Vickers, They Are Here, James Bridle, Katriona Beales, |
https://en.wikipedia.org/wiki/DC%20Streetcar | The DC Streetcar is a surface streetcar network in Washington, D.C. , it consists of only one line: a segment running in mixed traffic along H Street and Benning Road in the city's Northeast quadrant.
The streetcars are the first to run in the District of Columbia since the dismantling of the previous streetcar system in 1962. The District of Columbia began laying track in 2009, for two lines whose locations in Anacostia and Benning were chosen to revitalize blighted commercial corridors. The system is owned by the District of Columbia Department of Transportation (DDOT); the RATP Dev USA, the US arm of the French transportation company, RATP Dev, has been operating and managing the streetcar since its inception.
The system's H Street/Benning Road Line began public service on February 27, 2016. In , the line had a ridership of .
Development
First iteration of streetcars
Between 1862 and 1962, streetcars in Washington, D.C., were a common mode of transportation, but the system was dismantled in the early 1960s as part of a switch to bus service.
Second iteration of streetcars
In the late 1990s, Metro began considering a series of rapid bus, light rail, and streetcar projects throughout the Washington, D.C., metropolitan region as a means of providing intra-city and intra-regional mass transit and to meet the transit needs of the quickly growing population of the area. The first project was proposed for Alexandria, Virginia, in 1999. In January 2002, District of Columbia officials began studying the economic feasibility and costs of constructing a long system of streetcars throughout the city. The project received Metro's backing. DDOT studied the feasibility of both a citywide system and one or more "starter" lines. D.C. Council Member David Catania specifically requested that DDOT study adding streetcars in the Anacostia neighborhood.
First line proposal
DDOT issued a favorable report, and the D.C. Council approved an expenditure of $310 million for the streetcar project in September 2002. The first line to be built would be a "starter" streetcar line in Anacostia. The goal of the project was to bring light rail to Anacostia first (rather than last, as had happened with Metrorail), and to provide a speedier, more cost-effective way to link the neighborhood with the rest of the city.
Initially, the line was planned to run along the abandoned CSX railway tracks (known as the Shepherd Industrial Spur) from the Minnesota Avenue Metro station to the Anacostia Metro station, then cross the 11th Street Bridges before connecting with the and Metro stations. DDOT originally planned to purchase diesel multiple unit cars (self-propelled rail cars powered by diesel engines) from Colorado Railcar. Layton Lyndsey, reporting in The Washington Post, asserted the cars would be the first of their kind to be built in the United States and approved by the Federal Railroad Administration.
Financial problems
Financing for the plan proved problematic. |
https://en.wikipedia.org/wiki/Realsoft%203D | Realsoft 3D is a modeling and raytracing application created by Realsoft Graphics Oy. Originally called Real 3D, it was developed for the Amiga computer and later also for Linux, Irix, Mac OS X, and Microsoft Windows.
It was initially written in 1983 on Commodore 64 by two Finnish brothers, Juha and Vesa Meskanen. The development of Real 3D was really started in 1985, as Juha Meskanen started his studies at the Lahti University of Applied Sciences, Finland. Juha's brother Vesa joined the development and abandoned his university career to start the Realsoft company in 1989.
Versions history
Real 3D v1
The first commercial Real 3D version was released on Amiga.
It used IFF REAL for its objects.
It featured constructive solid geometry, support for smooth curved quadric surfaces and a ray-tracer for photo realistic rendering.
1.2 was released in 1990, was already distributed in several European countries.
1.3 was released early 1991.
1.4 was released in December 1991. It was the last version derived from the original Real3D design.
Despite small version number increments, v1, v1.2 and v 1.3 were all major releases, with new manuals and packaging.
Real 3D v2
It was released in 1993.
Version 2 was redesigned with a new source code base. It introduced groundbreaking features - booleans, CSG primitives, b-spline curves, physically based animation simulation, morph-based animation techniques and phenomenal rendered output. It took full advantage of the multi-tasking abilities of the Amiga - allowing the user to continue editing a scene on another window while it rendered.
Microsoft Windows version was released in 1994.
Real 3D v3
Version 3.5 was released in 1996.
It was the last version based on v2 architecture. Realsoft had started a new major development project around 1994. The project involved a complete software rewrite, new object-oriented source code, platform independent design, modularity, and adoption of several other state-of–art development methods.
Amiga version 3.5, which is also the last version for this system, is now freely available by AmiKit.
Realsoft 3D v4
Version 4 was released year 2000. Beginning with this release, Realsoft renamed the product to Realsoft 3D.
It was released on multiple platforms, including Microsoft Windows, Linux and SGI Irix.
4.1 trial version was released in 2001-02-21. Retail version was released in 2001-05-25.
4.2 upgrade was released in 2001-07-19.
Linux (Intel, AMD) and SGI Irix (MIPS) versions were released in 2001-07-24.
4.5 was released in 2002-10-23, which introduced for example caustics and global illumination rendering features. Linux version was released in 2002-11-03. Irix version of 4.5/SP1 (build 26.41b) was released in 2003-06-03.
Realsoft 3D v5
Windows version was released in 2004-11-15.
It expanded the feature set in all program areas. It was also an important visual leap forward supporting full-color 32 bit icons.
Service pack 1 (5.1) for Windows was released in 20 |
https://en.wikipedia.org/wiki/Geo-imputation | In data analysis involving geographical locations, geo-imputation or geographical imputation methods are steps taken to replace missing values for exact locations with approximate locations derived from associated data. They assign a reasonable location or geographic based attribute (e.g., census tract) to a person by using both the demographic characteristics of the person
and the population characteristics from a larger geographic aggregate area in which the person was geocoded (e.g., postal delivery area or county). For example, if a person's census tract was known and no other address information was available then geo-imputation methods could be used to probabilistically assign that person to a smaller geographic area, such as a census block group.
See also
Geocoding
Imputation (statistics)
Notes and references
Jones, S. G.; Ashby, A. J.; Momin, S. R.; Naidoo, A. (2010) "Spatial Implications Associated with Using Euclidean Distance Measurements and Geographic Centroid Imputation in Health Care Research", Health Services Research, 45 (1), 316–327
Geocodes
Geographic information systems
Missing data |
https://en.wikipedia.org/wiki/John%20H.%20Jessen | John H. Jessen is recognized internationally as an innovator in the fields of computer forensics and electronic evidence discovery. Jessen has been quoted in The Wall Street Journal, The New York Times, The Boston Globe, Le Monde, Newsweek, Forbes, Wired magazine, and on CBS’ 60 Minutes, ABC's 20/20 and the Discovery Channel. He has been called the "best of the breed" of electronic evidence experts by the American Bar Association (ABA) Journal and "the nation’s foremost authority on secret or deleted computer files" by Entrepreneur magazine.
EED Inc. founder Jessen is a technical advisor on electronic discovery to the Sedona Conference, the legal industry's premier forum dedicated to the advanced study of law and policy.
Jessen is the chairman of the Sedona Conference executive committee. He is also on the steering committee of and technical expert to the Sedona Conference Working Group on Electronic Document Retention and Production.
References
Year of birth missing (living people)
Living people
Scientists from Seattle
Digital forensics people
American forensic scientists |
https://en.wikipedia.org/wiki/Scott%20Aaronson | Scott Joel Aaronson (born May 21, 1981) is an American theoretical computer scientist and David J. Bruton Jr. Centennial Professor of Computer Science at the University of Texas at Austin. His primary areas of research are quantum computing and computational complexity theory.
Early life and education
Aaronson grew up in the United States, though he spent a year in Asia when his father—a science writer turned public-relations executive—was posted to Hong Kong. He enrolled in a school there that permitted him to skip ahead several years in math, but upon returning to the US, he found his education restrictive, getting bad grades and having run-ins with teachers. He enrolled in The Clarkson School, a gifted education program run by Clarkson University, which enabled Aaronson to apply for colleges while only in his freshman year of high school. He was accepted into Cornell University, where he obtained his BSc in computer science in 2000, and where he resided at the Telluride House. He then attended the University of California, Berkeley, for his PhD, which he got in 2004 under the supervision of Umesh Vazirani.
Aaronson had shown ability in mathematics from an early age, teaching himself calculus at the age of 11, provoked by symbols in a babysitter's textbook. He discovered computer programming at age 11, and felt he lagged behind peers, who had already been coding for years. In part due to Aaronson getting into advanced mathematics before getting into computer programming, he felt drawn to theoretical computing, particularly computational complexity theory. At Cornell, he became interested in quantum computing and devoted himself to computational complexity and quantum computing.
Career
After postdoctorates at the Institute for Advanced Study and the University of Waterloo, he took a faculty position at MIT in 2007. His primary area of research is quantum computing and computational complexity theory more generally.
In the summer of 2016 he moved from MIT to the University of Texas at Austin as David J. Bruton Jr. Centennial Professor of Computer Science and as the founding director of UT Austin's new Quantum Information Center. In summer 2022 he announced he would be working for a year at OpenAI on theoretical foundations of AI safety.
Awards
Aaronson is one of two winners of the 2012 Alan T. Waterman Award.
Best Student Paper Awards at the Computational Complexity Conference for the papers "Limitations of Quantum Advice and One-Way Communication" (2004) and "Quantum Certificate Complexity" (2003).
Danny Lewin Best Student Paper Award at the Symposium on Theory of Computing for the paper "Lower Bounds for Local Search by Quantum Arguments" (2004).
2009 Presidential Early Career Award for Scientists and Engineers
2017 Simons Investigator
He was elected as an ACM Fellow in 2019 "for contributions to quantum computing and computational complexity".
He was awarded the 2020 ACM Prize in Computing "for groundbreaking contributions to q |
https://en.wikipedia.org/wiki/One-class%20classification | In machine learning, one-class classification (OCC), also known as unary classification or class-modelling, tries to identify objects of a specific class amongst all objects, by primarily learning from a training set containing only the objects of that class, although there exist variants of one-class classifiers where counter-examples are used to further refine the classification boundary. This is different from and more difficult than the traditional classification problem, which tries to distinguish between two or more classes with the training set containing objects from all the classes. Examples include the monitoring of helicopter gearboxes, motor failure prediction, or the operational status of a nuclear plant as 'normal': In this scenario, there are few, if any, examples of catastrophic system states; only the statistics of normal operation are known.
While many of the above approaches focus on the case of removing a small number of outliers or anomalies, one can also learn the other extreme, where the single class covers a small coherent subset of the data, using an information bottleneck approach.
Overview
The term one-class classification (OCC) was coined by Moya & Hush (1996) and many applications can be found in scientific literature, for example outlier detection, anomaly detection, novelty detection. A feature of OCC is that it uses only sample points from the assigned class, so that a representative sampling is not strictly required for non-target classes.
Introduction
SVM based one-class classification (OCC) relies on identifying the smallest hypersphere (with radius r, and center c) consisting of all the data points. This method is called Support Vector Data Description (SVDD). Formally, the problem can be defined in the following constrained optimization form,
However, the above formulation is highly restrictive, and is sensitive to the presence of outliers. Therefore, a flexible formulation, that allow for the presence of outliers is formulated as shown below,
From Karush-Kuhn-Tucker (KKT) optimality conditions, we get
where the 's are the solution to the following optimization problem:
subject to,
The introduction of kernel function provide additional flexibility to the One-class SVM (OSVM) algorithm.
PU (Positive Unlabeled) learning
A similar problem is PU learning, in which a binary classifier is learned in a semi-supervised way from only positive and unlabeled sample points.
In PU learning, two sets of examples are assumed to be available for training: the positive set and a mixed set , which is assumed to contain both positive and negative samples, but without these being labeled as such. This contrasts with other forms of semisupervised learning, where it is assumed that a labeled set containing examples of both classes is available in addition to unlabeled samples. A variety of techniques exist to adapt supervised classifiers to the PU learning setting, including variants of the EM algorithm. PU learning |
https://en.wikipedia.org/wiki/Integrated%20Administration%20and%20Control%20System | Integrated Administration and Control System (IACS) makes it possible to develop direct and indirect (datawarehouse for animals, land, applicants, control and administration processes) system modules. It constitutes the basis for agricultural grants from the EU.
More info: The Integrated Administration and Control System
Institutions of the European Union |
https://en.wikipedia.org/wiki/The%20Swift%20Home%20Service%20Club | Swift Home Service Club is a 1947-1948 American television show, "credited with being the first sponsored daytime network TV show." Hosted by Tex McCrary and Jinx Falkenburg, it aired Monday through Friday at 1 p.m. ET.
Broadcast history
The show launched on NBC Television in May 1947, Mondays through Fridays at 1 p.m. ET. It started shortly after a previous show hosted by McCrary and Falkenburg, Bristol-Myers Tele-Varieties which debuted on the NBC network on January 5, 1947, and aired Sunday evenings from 8:15pm to 8:30 p.m. ET.
Format
Described as "a new daytime TV show that blended the homemaker, fashion, and talk shows", The Swift Home Service Club featured homemaker tips and interviews, with topics such as interior decorating, kitchen ideas, and cooking. Audience participation contests with guest judges were also included.
Personnel
In addition to Falkenberg and McCrary, regulars on the program included Sandra Gahle, Martha Logan, and Helen Carroll and the Escorts. Dan Seymour was the announcer. Lee Cooley was the producer, and Tom Hutchinson was the director.
Review
A review in the June 1, 1947, issue of Sponsor magazine pointed out several flaws in one episode:There can't be any question of the fact that Jinx Falkenberg is telegenic, but there also isn't any question but that she hadn't the slightest idea of what to do next on this show. Tex McCrary, the male half of the Jinx and Tex team, would have looked better with a hair cut and an established character ... Sandra Gahle, the interior decorator on the program, should look to her corseting, and the hat designer, Walter Florell, should realize that the television camera is not a mirror in which he's looking at himself and striking poses.
Preservation status
This show has one of the oldest live television episodes preserved, with a kinescope of a 1947 transmission in the collection of the Library of Congress. This program is also credited as one of the first television programs with a sustaining sponsor: Swift and Company, the meat and food products company. The series lasted only one season.
According to Library of Congress and concurrent press sources, the program debuted in May 1947 at 1pm ET. There is a 3-minute segment of a live broadcast captured on early kinescope in the Library of Congress archives as part of the Hubert Chain collection from October 31, 1947, one of the earliest surviving recordings of live television. This program, one of several concurrent programs on NBC telecast from NYC's WNBT-TV, may be the first NBC network daytime show, shown in only two markets originally.
References
Library of Congress catalogue
New York Times obituary for Tex McCrary (2003)
NBC Archives
Museum of Broadcasting reference library
See also
The Swift Show
1947–48 United States network television schedule (weekday)
1947 American television series debuts
1948 American television series endings
1940s American television series
NBC original programming |
https://en.wikipedia.org/wiki/Australian%20heritage%20places%20inventory | The Australian Heritage Places Inventory (AHPI) was an online database of information about Australian places listed in State, Territory and Commonwealth Heritage Registers. The database was supported by the Heritage, Reef and Marine Division of the Department of Agriculture, Water and the Environment, which withdrew support of the database in 2020, and the database was taken down.
Contributing heritage registers
ACT Heritage Register
Western Australian Register of Heritage Places
Northern Territory Heritage Register (NT)
New South Wales State Heritage Register
Queensland Heritage Register
Register of the National Estate
South Australian Heritage Register
Tasmanian Heritage Register
Victorian Heritage Register
See also
Australian Heritage Database
References
Nature conservation in Australia
Heritage registers in Australia |
https://en.wikipedia.org/wiki/Dancing%20with%20the%20Stars%20%28American%20season%208%29 | Season eight of Dancing with the Stars premiered on Monday, March 9, 2009, on the ABC network.
The show generally followed the format of previous seasons, with thirteen couples, although there were some changes, including two new dances, the Argentine tango and Lindy Hop, and an occasional dance-off between the bottom two couples, in order to determine who would be eliminated.
Olympic gymnast Shawn Johnson and Mark Ballas were crowned the champions, while Gilles Marini and Cheryl Burke finished in second place, and Melissa Rycroft and Tony Dovolani finished third.
Cast
Couples
This season featured thirteen celebrity contestants. This season was originally advertised as the first American season where a husband and wife would compete against each other: rodeo champion Ty Murray and singer-songwriter Jewel. However, Jewel fractured both of her tibiae and was unable to compete. She was replaced by Holly Madison. Murray chose to continue on the show, while Jewel appeared during the season as a special musical guest. Nancy O'Dell, then co-host of Access Hollywood, was also originally announced to be on the show, but was forced to withdraw from the competition due to a torn meniscus, which required surgery. She was replaced by Melissa Rycroft, who had won season 13 of The Bachelor.
Future appearances
Shawn Johnson, Gilles Marini, and Melissa Rycroft later competed in the All-Stars season, where Johnson was paired with Derek Hough, Marini was paired with Peta Murgatroyd, and Rycroft remained with Tony Dovolani.
Host and judges
The show was again co-hosted by Tom Bergeron and Samantha Harris. Len Goodman, Bruno Tonioli and Carrie Ann Inaba returned as judges.
Scoring chart
The highest score each week is indicated in with a dagger (), while the lowest score each week is indicated in with a double-dagger ().
Color key:
Notes
Weekly scores
Individual judges scores in charts below (given in parentheses) are listed in this order from left to right: Carrie Ann Inaba, Len Goodman, Bruno Tonioli.
Week 1
Each couple performed either the cha-cha-cha or waltz. Couples are listed in the order they performed.
Week 2
Each couple performed either the quickstep or salsa. The two couples in the bottom two competed against each other in a dance-off to determine which would also be eliminated. Couples are listed in the order they performed.
Due to an injury, Steve-O was unable to dance on the live show, so his rehearsal footage was shown and scored instead.
Week 3
Each couple performed either the foxtrot or samba. The two couples in the bottom two competed against each other in a dance-off to determine which would also be eliminated. Couples are listed in the order they performed.
Week 4
Each couple performed either the Argentine tango or Lindy Hop. Two couples were eliminated at the end of the night. Couples are listed in the order they performed.
Week 5
Each couple performed either the paso doble or Viennese waltz. The two couples in the bottom two comp |
https://en.wikipedia.org/wiki/Lowermoor%20Water%20Treatment%20Works | The Lowermoor Water Treatment Works supplies drinking water to the north Cornwall water distribution network. Raw water is obtained from the Crowdy Reservoir, which is 3/4 mile to the north east, and which is filled predominantly by run-off and drainage from surrounding moorland. The works were constructed in 1973.
At the time of the Camelford water pollution incident, water treatment was being carried out by South West Water.
References
Buildings and structures in Cornwall
Water supply and sanitation in England |
https://en.wikipedia.org/wiki/Knowledge%20broker | A knowledge broker is an intermediary (an organization or a person), that aims to develop relationships and networks with, among, and between producers and users of knowledge by providing linkages, knowledge sources, and in some cases knowledge itself, (e.g. technical know-how, market insights, research evidence) to organizations in its network.
While the exact role and function of knowledge brokers are conceptualized and operationalized differently in various sectors and settings, a key feature appears to be the facilitation of knowledge exchange or sharing between and among various stakeholders, including researchers, practitioners, and policy makers.
A knowledge broker may operate in multiple markets and technology domains.
The concept of knowledge brokers is closely related to the concept of knowledge spillovers.
In the fields of public health, applied health services research, and social sciences, knowledge brokers are often referred to as bridges or intermediaries that link producers of research evidence to users of research evidence as a means of facilitating collaboration to identify issues, solve problems, and promote evidence-informed decision making (EIDM), which is the process of critically appraising and incorporating the best available research evidence, along with evidence from multiple other sources into policy and practice decisions.
Using a knowledge broker to facilitate the exchange of knowledge and the adoption of insights is one strategy in the broader field of Knowledge Management.
Function
Knowledge brokers facilitate the transfer and exchange of knowledge from where it is abundant to where it is needed, thereby supporting co-development and improving the innovative capability of organizations in their network. In the field of public health, knowledge brokers facilitate the appropriate use of the best available research evidence in decision making processes, enhancing individual and organizational capacity to participate effectively in evidence-informed decision making. In this setting, knowledge brokers promote research use.
Knowledge brokers are typically involved in the following activities below:
Assessing barriers and establishing access to knowledge (i.e. screening and recognizing valuable knowledge across organizations and industries)
Learning (e.g. internalizing experiences from a diverse range of perspectives including those of industry, technology or health disciplines)
Linking of separate knowledge pools (e.g. through joint research, consulting services, and developing a mutual understanding of goals and cultures
Supporting knowledge and skill development
Facilitating individual/organizational capacity development for knowledge use (e.g., assessing current knowledge use, absorptive and receptive capacity, and readiness for change)
Implementing knowledge in new settings (e.g. combining existing knowledge in new ways)
Expertise
Knowledge brokers provide a link between the producers and users of kno |
https://en.wikipedia.org/wiki/List%20of%20laptop%20brands%20and%20manufacturers | This is a list of laptop brands and manufacturers.
Manufacturers
Major brands
Other brands
No longer manufacturing computers
Defunct brands
Original design manufacturers (ODMs)
The vast majority of laptops on the market are manufactured by a small handful of Taiwan-based original design manufacturers (ODM), although their production bases are located mostly in mainland China. Quanta Computer pioneered the contract manufacturing of laptops in 1988. By 1990, Taiwanese companies manufactured 11% of the world's laptops. That percentage grew to 32% in 1996, 50% in 2000, 80% in 2007 and 94% in 2011. The Taiwanese ODMs have since lost some market share to Chinese ODMs, but still manufactured 82.3% of the world's laptops in Q2 of 2019, according to IDC.
Major relationships include:
Quanta sells to (among others) HP, Lenovo, Apple, Acer, Dell, NEC, and Fujitsu
Compal sells to (among others) Acer, Dell, Lenovo and HP
Wistron (former manufacturing & design division of Acer) sells to Dell, Acer, Lenovo and HP
Inventec sells to HP, Dell and Lenovo;
Pegatron (in 2010, Asus spun off Pegatron) sells to Asus, Apple, Dell, Acer and Microsoft
Foxconn sells to Asus, Dell, HP and Apple
Flextronics (former Arima Computer Corporation notebook division) sells to HP
Clevo and Tongfang sell to different laptop manufacturers like Digital Storm, Eluktronics, Eurocom, Metabox, Sager, Schenker, System76, XMG, etc.
ODM laptop units sold and market shares
There is a discrepancy between the 2009 numbers due to the various sources cited; i.e. the units sold by all ODMs add up to 144.3 million laptops, which is much more than the given total of 125 million laptops. The market share percentages currently refer to those 144.3 million total. Sources may indicate hard drive deliveries to the ODM instead of actual laptop sales, though the two numbers may be closely correlated.
See also
List of computer hardware manufacturers
List of computer system manufacturers
Market share of personal computer vendors
Colorful laptops (Newegg)
References
Laptops
laptop
Lists of consumer electronics manufacturers
Laptop |
https://en.wikipedia.org/wiki/Clonal%20selection%20algorithm | In artificial immune systems, clonal selection algorithms are a class of algorithms inspired by the clonal selection theory of acquired immunity that explains how B and T lymphocytes improve their response to antigens over time called affinity maturation. These algorithms focus on the Darwinian attributes of the theory where selection is inspired by the affinity of antigen-antibody interactions, reproduction is inspired by cell division, and variation is inspired by somatic hypermutation. Clonal selection algorithms are most commonly applied to optimization and pattern recognition domains, some of which resemble parallel hill climbing and the genetic algorithm without the recombination operator.
Techniques
CLONALG: The CLONal selection ALGorithm
AIRS: The Artificial Immune Recognition System
BCA: The B-Cell Algorithm
See also
Artificial immune system
Biologically inspired computing
Computational immunology
Computational intelligence
Evolutionary computation
Immunocomputing
Natural computation
Swarm intelligence
Notes
External links
Clonal Selection Pseudo code on AISWeb
CLONALG in Matlab developed by Leandro de Castro and Fernando Von Zuben
Optimization Algorithm Toolkit in Java developed by Jason Brownlee which includes the following clonal selection algorithms: Adaptive Clonal Selection (ACS), Optimization Immune Algorithm (opt-IMMALG), Optimization Immune Algorithm (opt-IA), Clonal Selection Algorithm (CLONALG, CLONALG1, CLONALG2), B-Cell Algorithm (BCA), Cloning, Information Gain, Aging (CLIGA), Immunological Algorithm (IA)
AIRS in C++ developed by Andrew Watkins
BCA in C++ developed by Johnny Kelsey
Genetic algorithms
Artificial immune systems |
https://en.wikipedia.org/wiki/Compute%20Node%20Linux | Compute Node Linux (CNL) is a runtime environment based on the Linux kernel for the Cray XT3, Cray XT4, Cray XT5, Cray XT6, Cray XE6 and Cray XK6 supercomputer systems based on SUSE Linux Enterprise Server. CNL forms part of the Cray Linux Environment. systems running CNL were ranked 3rd, 6th and 8th among the fastest supercomputers in the world.
See also
INK (operating system)
References
External links
SUSE Linux Enterprise Server
Cray software
Linux kernel variant |
https://en.wikipedia.org/wiki/Sebastian%20J. | Sebastian Jacome, better known as Sebastian J., is a record producer, composer and songwriter who resides in Los Angeles, California.
Jacome's production, programming, arranging and remixing credits include artists such as: Alaya, Ozomatli, Huecco, The Cheetah Girls, Jorge Villamizar (Bacilos), Laura Pausini, Christian Chávez, Anahí, Heidi Montag, Paulina Rubio, Justin Bieber, LMFAO, Gloria Trevi, Enrique Iglesias, Demi Lovato and Alexandra Stan.
Jacome was one of the engineers nominated for a Grammy Award in 2008 for the album "Don't Mess with the Dragon" by Ozomatli.
References
Mix Online ,In Studio: Ozomatli.
Gibson.com ,Ines Gaviria Calienta Motores.
IMDB ,The Cheetah Girls: One World Soundtrack
Notes
Year of birth missing (living people)
Living people
Ecuadorian composers
Ecuadorian songwriters
Male songwriters
Ecuadorian record producers |
https://en.wikipedia.org/wiki/ABC%27s%20Wide%20World%20of%20Entertainment | ABC's Wide World of Entertainment is a late night television block of programs created by the ABC television network. It premiered on January 8, 1973, and ended three years later. The title was based on the long-running broadcast ABC's Wide World of Sports; there was also an ABC's Wide World of Mystery broadcast from 1973 to 1978.
Program schedule
Unable to find a single talk show to compete with NBC's highly successful The Tonight Show Starring Johnny Carson, the network aired a collection of comedy specials, documentaries, mystery movies, music concerts and talk shows with a variety of hosts. Included in the broadcasts were The Dick Cavett Show, Jack Paar Tonite, Good Night America (a news magazine hosted by Geraldo Rivera), the live concert series In Concert, the UK-originated anthology series Thriller, and Comedy News (a parody of Eyewitness News with an ensemble cast of comedians and satirists including Kenneth Mars, Marian Mercer, Robert Klein, Mort Sahl and Dick Gregory). Initially, Paar, Cavett, comedy specials and mystery movies were each given one week per month.
Two nights of music concerts, broadcast every other Friday on weeks where specials or movies were broadcast, completed the monthly schedule. The 1975 and 1976 editions of Dick Clark's New Year's Rockin' Eve were also broadcast as "Wide World Specials".
Monty Python broadcast
Monty Python's Flying Circus, the British comedy sketch television series, taped its last episode in December 1974 and was syndicated to American public broadcasting soon after. On October 3, 1975, ABC aired the first of two edited compilations of sketches from the series as one of its Wide World of Entertainment comedy specials. The Python group represented by Terry Gilliam, the group's only American-born member, sued ABC for copyright infringement.
Zapruder film
On the March 6, 1975, edition of Good Night America, Rivera had as his guests assassination of John F. Kennedy researchers Robert J. Groden and Dick Gregory, who presented the first-ever network television showing of the Zapruder film. The public's response and outrage to that television showing quickly led to the forming of the Hart-Schweiker investigation, contributed to the Church Committee Investigation on Intelligence Activities by the United States, and resulted in the United States House Select Committee on Assassinations investigation.
ABC Late Night
The comedy and variety specials proved to be unpopular and, along with most of the talk shows, were dropped by the summer of 1974. They were replaced with reruns of television films and the programming block was re-titled ABC Late Night on January 12, 1976. In addition to movies (which were seen under the ABC Movie of the Week banner), the network aired a variety of prime-time series reruns including Police Woman, Mannix, Starsky & Hutch, Soap, Barney Miller, Charlie's Angels and Fantasy Island, with the only first-run programming a series of specials hosted by Geraldo Rivera and t |
https://en.wikipedia.org/wiki/Supertoroid | In geometry and computer graphics, a supertoroid or supertorus is usually understood to be a family of doughnut-like surfaces (technically, a topological torus) whose shape is defined by mathematical formulas similar to those that define the superellipsoids. The plural of "supertorus" is either supertori or supertoruses.
The family was described and named by Alan Barr in 1994.
Barr's supertoroids have been fairly popular in computer graphics as a convenient model for many objects, such as smooth frames for rectangular things. One quarter of a supertoroid can provide a smooth and seamless 90-degree joint between two superquadric cylinders. However, they are not algebraic surfaces (except in special cases).
Formulas
Alan Barr's supertoroids are defined by parametric equations similar to the trigonometric equations of the torus, except that the sine and cosine terms are raised to arbitrary powers. Namely, the generic point P(u, v) of the surface is given by
where , , and the parameters u and v range from 0 to 360 degrees (0 to 2π radians).
In these formulas, the parameter s > 0 controls the "squareness" of the vertical sections, t > 0 controls the squareness of the horizontal sections, and a, b ≥ 1 are the major radii in the X and Y directions. With s=t=1 and a=b=R one obtains the ordinary torus with major radius R and minor radius 1, with the center at the origin and rotational symmetry about the Z axis.
In general, the supertorus defined as above spans the intervals in X, in Y, and in Z. The whole shape is symmetric about the planes X=0, Y=0, and Z=0. The hole runs in the Z direction and spans the intervals in X and in Y.
A curve of constant u on this surface is a horizontal Lamé curve with exponent 2/t, scaled in X and Y and displaced in Z. A curve of constant v, projected on the plane X=0 or Y=0, is a Lamé curve with exponent 2/s, scaled and horizontally shifted. If v is 0, the curve is planar and spans the interval in X, and in Z; and similarly if v is 90, 180, or 270 degrees. The curve is also planar if a = b.
In general, if a≠b and v is not a multiple of 90 degrees, the curve of constant v will not be planar; and, conversely, a vertical plane section of the supertorus will not be a Lamé curve.
The basic supertoroid shape defined above is often modified by non-uniform scaling to yield supertoroids of specific width, length, and vertical thickness.
Plotting code
The following GNU Octave code generates plots of a supertorus:
function supertoroid(epsilon,a)
n=50;
d=.1;
etamax=pi;
etamin=-pi;
wmax=pi;
wmin=-pi;
deta=(etamax-etamin)/n;
dw=(wmax-wmin)/n;
k=0;
l=0;
for i=1:n+1
eta(i)=etamin+(i-1)*deta;
for j=1:n+1
w(j)=wmin+(j-1)*dw;
x(i,j)=a(1)*(a(4)+sign(cos(eta(i)))*abs(cos(eta(i)))^epsilon(1))*sign(cos(w(j)))*abs(cos(w(j)))^epsilon(2);
y(i,j)=a(2)*(a(4)+sign(cos(eta(i)))*abs(cos(eta(i)))^epsilon(1))*sign(sin(w(j)))*abs(sin(w(j)))^epsilon(2);
z(i,j)=a(3)*sign(sin( |
https://en.wikipedia.org/wiki/Personal%20Trainer%3A%20Walking | Personal Trainer: Walking is a 2008 exergaming application developed by Nintendo Network Service Development (Nintendo NSD) and Creatures Inc. for the Nintendo DS. The pedometer accessory was developed in-house at Nintendo NSD, while the software portion was developed in conjunction with Nintendo NSD, Creatures Inc., and Engines.
It is part of both Nintendo's Touch! Generations brand and the Personal Trainer series. It is one of only five Nintendo DS titles to support Mii characters, three of which are Japan exclusives.
Overview
Personal Trainer: Walking allows up to four users to track their walking, jogging or running activities through a series of graphs, charts and statistics, as well as set goals for themselves. The game is packaged with two infrared pedometers that communicate to the game the user's walking data. Additional pedometers are sold separately.
The game uses Miis to track each user's progress, and allows users to either create a Mii in-game (A first for the Nintendo DS), or wirelessly transfer an existing Mii from a Wii console's Mii Channel to their Nintendo DS. The game also features a number of minigames to unlock, and users can also upload their data online via the Nintendo Wi-Fi Connection to add to weekly leaderboards and a world step count that plots a virtual trek across the Solar System.
Reception
Official Nintendo Magazine scored the game 75%, noting the health benefits of exercising and addictiveness of following statistics, but also noted the inherent pointlessness of the game.
The game sold 26,000 copies in its first week of release in Japan.
See also
List of Nintendo DS games
Personal Trainer: Cooking
Personal Trainer: Math
Brain Age: Train Your Brain in Minutes a Day!
Brain Age 2: More Training in Minutes a Day!
Notes
Known in Japan as
Known in Europe as Walk with me! Do you know your walking routine?
References
External links
Japanese site
Personal Trainer: Walking Site (US)
Fitness games
2008 video games
Nintendo DS games
Nintendo DS-only games
Touch! Generations
Video games developed in Japan
Games with Wii-DS connectivity
Single-player video games |
https://en.wikipedia.org/wiki/Quotation%20%28disambiguation%29 | Quotation is a reference to a previously known expression.
Quotation can also refer to:
Quote
Financial quote, market data relating to a security or commodity
Sales quote an offer price for goods or services
See also Quote (disambiguation)
Quotation marks
Meanings related to characters used for quotation are:
Quotation mark, usage in English language
International variation in quotation marks
String literal in programming languages
Quotation mark glyphs, various glyphs |
https://en.wikipedia.org/wiki/Storage%20area%20network | A storage area network (SAN) or storage network is a computer network which provides access to consolidated, block-level data storage. SANs are primarily used to access data storage devices, such as disk arrays and tape libraries from servers so that the devices appear to the operating system as direct-attached storage. A SAN typically is a dedicated network of storage devices not accessible through the local area network (LAN).
Although a SAN provides only block-level access, file systems built on top of SANs do provide file-level access and are known as shared-disk file systems.
Newer SAN configurations enable hybrid SAN and allow traditional block storage that appears as local storage but also object storage for web services through APIs.
Storage architectures
Storage area networks (SANs) are sometimes referred to as network behind the servers and historically developed out of a centralized data storage model, but with its own data network. A SAN is, at its simplest, a dedicated network for data storage. In addition to storing data, SANs allow for the automatic backup of data, and the monitoring of the storage as well as the backup process. A SAN is a combination of hardware and software. It grew out of data-centric mainframe architectures, where clients in a network can connect to several servers that store different types of data. To scale storage capacities as the volumes of data grew, direct-attached storage (DAS) was developed, where disk arrays or just a bunch of disks (JBODs) were attached to servers. In this architecture, storage devices can be added to increase storage capacity. However, the server through which the storage devices are accessed is a single point of failure, and a large part of the LAN network bandwidth is used for accessing, storing and backing up data. To solve the single point of failure issue, a direct-attached shared storage architecture was implemented, where several servers could access the same storage device.
DAS was the first network storage system and is still widely used where data storage requirements are not very high. Out of it developed the network-attached storage (NAS) architecture, where one or more dedicated file server or storage devices are made available in a LAN. Therefore, the transfer of data, particularly for backup, still takes place over the existing LAN. If more than a terabyte of data was stored at any one time, LAN bandwidth became a bottleneck. Therefore, SANs were developed, where a dedicated storage network was attached to the LAN, and terabytes of data are transferred over a dedicated high speed and bandwidth network. Within the SAN, storage devices are interconnected. Transfer of data between storage devices, such as for backup, happens behind the servers and is meant to be transparent. In a NAS architecture data is transferred using the TCP and IP protocols over Ethernet. Distinct protocols were developed for SANs, such as Fibre Channel, iSCSI, Infiniband. Therefore, SANs ofte |
https://en.wikipedia.org/wiki/International%20Forestry%20Students%27%20Association | The International Forestry Students’ Association (IFSA) is an international network of students in forestry-related sciences. It is a globally organized and locally operated student organisation connecting forest and related science students to peers, forest-related organisations, and policy platforms. The IFSA has 130 member associations (known as "local committees") in over 50 countries. IFSA is a non-political, non-profit, and non-religious organisation that is entirely run by students.
IFSA promotes global cooperation among students of forest sciences and provides a voice for youth in international forest policy processes. IFSA provides a platform for students to enrich their formal education, promote cultural understanding by encouraging collaboration with international partners and organisations, and gain practical experiences with a wider and more global perspective. Through its social network, IFSA encourages student meetings, enables participation in scientific debates, and supports the involvement of youth in decision-making processes and international forest and environmental policy.
IFSA is officially registered as a charity organisation, with its seat in Freiburg, Germany.
History
The organisation traces its roots to the International Forestry Students Symposium (IFSS), an annual meeting of forestry students that formed in 1973 in the United Kingdom. The event, which was hosted in the UK for 13 years, aimed to provide forestry students with a platform for meeting their counterparts from other countries, discussing ideas, and creating an atmosphere of solidarity and inspiration. The first accomplishment of these meetings was the creation of INFOCENTRE, an office established to coordinate the exchange of information among forestry students.
During the 18th IFSS in Lisbon, Portugal in 1990, the participants decided to expand the cooperation between forestry students beyond the annual symposium. At the constitutional assembly of IFSA, the founding member associations approved provisional statutes and elected the first representative organs. INFOCENTRE was re-designated as IFSA’s communicative and informational organ.
The following year, the 19th IFSS was organised in the Netherlands with 112 participants from 38 countries, the first time that students from all continents were represented. In the 20th IFSS held in Italy, the third general assembly designated a central organ (the Secretariat), to be responsible for the association’s bureaucratic tasks, internal communications, and all INFOCENTRE duties. The Secretariat thus fully assumed its role as IFSA's headquarters.
IFSA became a worldwide organization when the new statutes were finally approved in 1994 at the fifth general assembly during the 22nd IFSS in Switzerland. The association was officially registered as a charity organization with its seat in Göttingen, Germany. Five years later, with the adoption of the revised statutes, decrees, and by-laws, the general assembly m |
https://en.wikipedia.org/wiki/List%20of%20terrorist%20incidents%20in%20India | This is a list of terrorist incidents in India. In July 2016, the Government of India released data on a string of terror strikes in India since 2005 that claimed 707 lives and left over 3,200 injured.
List of Terror Attacks in India
Year, fatalities, and number of incidents
See also
Terrorism in India
Insurgency in Jammu and Kashmir
Insurgency in Northeast India
Insurgency in Punjab
Naxalite–Maoist insurgency
References
External links
South Asia Terrorism Portal
Terrorist incidents
Terrorist incidents
Terrorist incidents
India |
https://en.wikipedia.org/wiki/DPCP | DPCP may refer to:
Diphenylcyclopropenone
DisplayPort Content Protection
Data Protection Compliance Program |
https://en.wikipedia.org/wiki/C215%20Viaduct | C215 Viaduct is a long box girder bridge completed in 2003, with a cost of around US$40 million. It is located in Taiwan and is part of the Taiwan High Speed Rail network.
See also
Transportation in Taiwan
References
External links
http://en.structurae.de/structures/data/index.cfm?ID=s0004210
2005 establishments in Taiwan
Box girder bridges
Taiwan High Speed Rail
Viaducts in Taiwan |
https://en.wikipedia.org/wiki/Pure%20%28programming%20language%29 | Pure, successor to the equational language Q, is a dynamically typed, functional programming language based on term rewriting. It has facilities for user-defined operator syntax, macros, arbitrary-precision arithmetic (multiple-precision numbers), and compiling to native code through the LLVM. Pure is free and open-source software distributed (mostly) under the GNU Lesser General Public License version 3 or later.
Overview
Pure comes with an interpreter and debugger, provides automatic memory management, has powerful functional and symbolic programming abilities, and interfaces to libraries in C (e.g., for numerics, low-level protocols, and other such tasks). At the same time, Pure is a small language designed from scratch; its interpreter is not large, and the library modules are written in Pure. The syntax of Pure resembles that of Miranda and Haskell, but it is a free-format language and thus uses explicit delimiters (rather than off-side rule indents) to denote program structure.
The Pure language is a successor of the equational programming language Q, previously created by the same author, Albert Gräf at the University of Mainz, Germany. Relative to Q, it offers some important new features (such as local functions with lexical scoping, efficient vector and matrix support, and the built-in C interface) and programs run much faster as they are compiled just-in-time to native code on the fly. Pure is mostly aimed at mathematical applications and scientific computing currently, but its interactive interpreter environment, the C interface and the growing set of addon modules make it suitable for a variety of other applications, such as artificial intelligence, symbolic computation, and real-time multimedia processing.
Pure plug-ins are available for the Gnumeric spreadsheet and Miller Puckette's Pure Data graphical multimedia software, which make it possible to extend these programs with functions written in the Pure language. Interfaces are also provided as library modules to GNU Octave, OpenCV, OpenGL, the GNU Scientific Library, FAUST, SuperCollider, and liblo (for Open Sound Control (OSC)).
Examples
The Fibonacci numbers (naive version):
fib 0 = 0;
fib 1 = 1;
fib n = fib (n-2) + fib (n-1) if n>1;
Better (tail-recursive and linear-time) version:
fib n = fibs (0,1) n with
fibs (a,b) n = if n<=0 then a else fibs (b,a+b) (n-1);
end;
Compute the first 20 Fibonacci numbers:
map fib (1..20);
An algorithm for the n queens problem which employs a list comprehension to organize the backtracking search:
queens n = search n 1 [] with
search n i p = [reverse p] if i>n;
= cat [search n (i+1) ((i,j):p) | j = 1..n; safe (i,j) p];
safe (i,j) p = ~any (check (i,j)) p;
check (i1,j1) (i2,j2)
= i1==i2 || j1==j2 || i1+j1==i2+j2 || i1-j1==i2-j2;
end;
While Pure uses eager evaluation by default, it also supports lazy data structures such as streams (lazy lists). For instance, David Turner's algorithm for comput |
https://en.wikipedia.org/wiki/Turkey%20in%20the%20Eurovision%20Song%20Contest%201980 | Turkey took part in the Eurovision Song Contest 1980. The country was represented by Ajda Pekkan with the song "Pet'r Oil" written by Şanar Yurdatapan and composed by Attila Özdemiroğlu.
Before Eurovision
4. Eurovision Şarkı Yarışması Türkiye Finali
The final took place on 24 February 1980 at the TRT Studios in Ankara, hosted by Bülend Özveren. All songs were performed by Ajda Pekkan and the winning song was determined by an expert jury in two rounds. In the first round, the lowest-scoring song was eliminated. In the second round, "Pet'r Oil" was selected as the winning song.
At Eurovision
On the night of the contest Pekkan performed second in the running order following Austria and preceding Greece. At the close of the voting the song received 23 points, placing 15th in a field of 19 countries. This result was seen by disappointment both by Pekkan and the Turkish audience.
The Turkish jury awarded its 12 points to the Netherlands.
Voting
References
1980
Countries in the Eurovision Song Contest 1980
Eurovision |
https://en.wikipedia.org/wiki/Joose%20%28framework%29 | Joose is an open-source self-hosting metaobject system for JavaScript with support for classes, inheritance, mixins, traits and aspect-oriented programming.
The Joose meta-object system is multi-paradigm. It supports class-based and prototype-based programming styles as well as class-based inheritance and role-based extension. While other JavaScript frameworks often specialize on DOM-access and AJAX, Joose specializes solely on bringing successful programming techniques to the JavaScript scripting language. Joose is thus often used in conjunction with another DOM/Ajax JavaScript framework and is tested with jQuery, YUI, Dojo, ExtJS, Prototype, Mootools and PureMVC.
Joose was heavily inspired by Moose, the object system for Perl 5 which was itself inspired by the Perl 6 object system, but unlike Perl and Moose, Joose doesn't support multiple inheritance.
Example
Two classes written in Joose:
Class("Point", {
has: {
x: {is: "rw"},
y: {is: "rw"}
},
methods: {
clear: function () {
this.setX(0);
this.setY(0);
}
}
});
Class("Point3D", {
isa: Point,
has: {
z: {is: "rw"}
},
after: {
clear: function () {
this.setZ(0);
}
}
});
Point3D is a subclass of Point. It has another attribute defined and additional code to run after running the superclass clear() method. The "rw" means the attribute is readable and writable with a pair of get/set accessors generated automatically.
References
Ajaxian
Google Gears blog
External links
Official website
Official Joose 2 website
Joose Mailing List
Presentation: Software development with JavaScript and Joose
JavaScript libraries |
https://en.wikipedia.org/wiki/Taxi%21%21%21 | Taxi!!! is a 1978 American made-for-television drama film starring Martin Sheen and Eva Marie Saint. Directed by Joseph Hardy, it debuted on the NBC television network as a Hallmark Hall of Fame presentation on February 2, 1978.
Plot
A conversation develops between a down-to-earth taxi driver (Martin Sheen) and his passenger, a wealthy and restless matron (Eva Marie Saint) that forever changes their lives during a ride from a midtown Manhattan hotel to John F. Kennedy International Airport.
Cast
Martin Sheen as the Taxi Driver
Eva Marie Saint as the Passenger
External links
1978 drama films
1978 television films
1978 films
Hallmark Hall of Fame episodes
Films set in New York City
Films directed by Joseph Hardy (director) |
https://en.wikipedia.org/wiki/Mobil%20Showcase%20Network | The Mobil Showcase Network, also known as Mobil Showcase or Mobil Showcase Theatre, was an occasional television network from 1976 to 1984 with an ad hoc group of stations.
Background
A Mobil Oil media expert, Herb Schmertz, wrote canned paid "editorials" placed into newspapers like the New York Times opinion-editorial page. Schmertz also had Mobil underwriting Masterpiece Theatre to improve Mobil's image, which Mobil has been sole supporter since the beginning of the series. He also considered having the company buy a newspaper, the Long Island Press. He instead settled on a "sort of TV network" as Mobil and Schmertz were frustrated with the network-developed anti-oil-company news and documentaries.
History
Schmertz worked with SFM Media Service Corporation lining up 43 stations, primarily in the top 50 markets; half of these were network affiliates. Mobil paid $3.2 million to the stations for the 8 PM ET/PT Thursday time slot for 10 weeks. In the winter of 1976, Mobil launched its first show, Ten Who Dared, hosted by Anthony Quinn and adapted from a 1975 BBC documentary series, which was originally shown in the UK as The Explorers and presented by David Attenborough. The show dramatized the adventures of various explorers (including James Cook, Christopher Columbus, Roald Amundsen and Mary Kingsley), and was one of the highest budgeted BBC shows for its time. The commercials were exclusively for Mobil, with some of them in a "documentary" or reality-based format showing Mobil employees out in the field, and shown in a positive light. The show beat the networks in the ratings, defeating NBC's The Fantastic Journey, and even CBS's The Waltons. Based on the ratings, Mobil arranged for two more "'non-network' series."
In 1979, the Showcase featured Edward & Mrs. Simpson. For summer 1980, Mobil Showcase assembled a group of shows dubbed Summershow.
Programs
Ten Who Dared (1976), a BBC/Time-Life/West German TV series with Anthony Quinn hosting for the Mobil Showcase broadcast
January 13, 1977: Christopher Columbus' maiden voyage to the New World.
January 20, 1977: Francisco Pizarro and the Spanish conquest of the Inca Empire.
January 27, 1977: Captain James Cook's voyages to the Pacific Ocean.
February 3, 1977: Alexander von Humboldt's scientific exploration of Venezuela.
February 10, 1977: Jedediah Smith's transcontinental treks across America.
February 17, 1977: Attempt by Robert O'Hara Burke and William John Wills to cross Australia from south to north.
February 24, 1977: Henry Morton Stanley's first trans-Africa exploration.
March 3, 1977: Charles Montagu Doughty's attempt at participating in the Hajj.
March 10, 1977: Mary Kingsley's journeys to the west coast of Central Africa.
March 17, 1977: Roald Amundsen's South Pole expedition.
When Havoc Struck (1978)
Between the Wars (1978)
Edward & Mrs. Simpson (1979)
Summershow (Summer 1980)
A Party with Comden and Green
New York, New York
Bells are Ringing
The Party's Over
The America Game
The Li |
https://en.wikipedia.org/wiki/VoID | The Vocabulary of Interlinked Datasets (VoID) is an RDF vocabulary, and a set of instructions, that enables the discovery and usage of linked data sets. A linked dataset is a collection of data, published and maintained by a single provider, available as RDF on the Web, where at least some of the resources in the dataset are identified by dereferencable URIs. VoID is used to provide metadata on RDF datasets to facilitate query processing on a graph of interlinked datasets in the semantic web.
References
External links
Describing Linked Datasets with the VoID Vocabulary
Metadata
Semantic Web
Knowledge representation
XML-based standards |
https://en.wikipedia.org/wiki/Frances%20Yao | Frances Foong Chu Yao () is a Taiwanese-born American mathematician and theoretical computer scientist. She is currently a Chair Professor at the Institute for Interdisciplinary Information Sciences (IIIS) of Tsinghua University. She was Chair Professor and Head of the Department of computer science at the City University of Hong Kong, where she is now an honorary professor.
Life
After receiving a B.S. in mathematics from National Taiwan University in 1969, Yao did her Ph.D. studies under the supervision of Michael J. Fischer at the Massachusetts Institute of Technology, receiving her Ph.D. in 1973. She then held positions at the University of Illinois at Urbana-Champaign, Brown University, and Stanford University, before joining the staff at the Xerox Palo Alto Research Center in 1979 where she stayed until her retirement in 1999.
In 2003, she came out of retirement to become the Head and a Chair Professor of the Department of Computer Science at City University of Hong Kong, which she held until June 2011. She is a Fellow of the American Association for the Advancement of Science; in 1991, she and Ronald Graham won the Lester R. Ford Award of the Mathematical Association of America for their expository article, A Whirlwind Tour of Computational Geometry.
Yao's husband, Andrew Yao, is also a well-known theoretical computer scientist and Turing Award winner.
Much of Yao's research has been in the subject of computational geometry and combinatorial algorithms; she is known for her work with Mike Paterson on binary space partitioning, her work with Dan Greene on finite-resolution computational geometry, and her work with Alan Demers and Scott Shenker on scheduling algorithms for energy-efficient power management.
More recently she has been working in cryptography. Along with her husband Andrew Yao and Wang Xiaoyun, they found new attacks on the SHA-1 cryptographic hash function.
Selected publications
.
.
.
.
.
.
.
.
References
External links
20th-century American mathematicians
20th-century Chinese mathematicians
21st-century American mathematicians
21st-century Chinese mathematicians
American computer scientists
Brown University faculty
Chinese emigrants to the United States
Chinese women computer scientists
Academic staff of the City University of Hong Kong
Fellows of the American Association for the Advancement of Science
Living people
Massachusetts Institute of Technology alumni
National Taiwan University alumni
Researchers in geometric algorithms
Scientists at PARC (company)
Stanford University Department of Computer Science faculty
Academic staff of Tsinghua University
University of Illinois Urbana-Champaign faculty
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Quiz%20Show%20%28video%20game%29 | Quiz Show (onscreen title: "The Kee Games Quiz Show") is a two-player arcade game by Kee Games, a company originally established by Atari, Inc. The game was originally released in 1976. A computerized version of a quiz show, the game presents multiple choice answers to questions from a range of categories.
Gameplay
The game asks the player questions, with the player pressing the corresponding button to answer. Questions are multiple choice, chosen from a pool of 1000 questions in four categories: people, sports, movie, and potpourri. Categories are chosen prior to the game's start. Points are awarded for a correct answer, with point deductions for incorrect answers. Bonus points are also awarded, and are based on the length of time it takes to answer the question. At the end of game play, the player is given a rating of Dunce, Lucky, Smart, or Genius based on their score.
Technology
The game is housed in a custom cabinet that includes two sets (one set per player) of four buttons on each side of the monitor. The game PCB uses a Signetics 2650 CPU, with all questions and answers stored on a removable 8-track audio cassette tape that is streamed to the game.
Quiz Show is believed to be the first game to utilize the now well-known "arcade font". The 8×8 monospaced typeface was later used in Sprint 2, as well as in many arcade games by other manufacturers.
References
Arcade video games
Arcade-only video games
Quiz video games
1976 video games
Atari arcade games
Video games developed in the United States |
https://en.wikipedia.org/wiki/Xplora1%3A%20Peter%20Gabriel%27s%20Secret%20World | XPLORA1: Peter Gabriel's Secret World (or simply XPLORA1) is a musical computer game designed by musician Peter Gabriel.
Summary
The game was intended to promote his 1992 album, Us, and the success of Xplora1 would prompt him to release a similar musically themed interactive game entitled EVE in 1996 as the second of his post-WOMAD projects. The game was first released for Macintosh in 1993, followed by Windows in 1994 and CD-i in 1995, in which the project was completed in collaboration with Brilliant Media under Gabriel's own label Real World Records.
The game was conceived by Brilliant Media's Steve Nelson and pitched to Peter in 1990. The project was developed at Brilliant Media's offices in SOMA, San Francisco, CA. The design and coding for the initial release on Mac CDROM, was created in HyperCard. Footage included WOMAD and on location at the studio in Bath, UK. The branding, marketing and retail distribution was led by Jane Lalonde at Brian Fargo's Interplay Studios.
The gameplay consists of a number of sub-games such as scavenger hunts, sliding mixes, music, a secret world, puzzles, etc. In interactive mode the player may watch video interviews with Peter Gabriel, and can explore brief summaries of a number of musicians Gabriel has performed with in the past. As the player completes puzzles and accomplishes goals new areas of the CD are unlocked featuring new content for the player to explore.
Reception
Computer Gaming World said in March 1994 that while the backstage footage was interesting, "explorers will have the most fun remixing their own Peter Gabriel music videos and joining in on jam sessions. Multimedia is a much abused term, but this beautiful work deserves the title".
Xplora1 received 3 awards from the Academy of Interactive Arts & Sciences for:
Best Interactive Product of 1994,
Best Musical, and
Best use of Music
The game sold more than 100,000 copies globally and more than 2,000 copies in Australia.
See also
77 Million Paintings - A computer software program featuring music by Peter Gabriel's contemporary, Brian Eno, amongst artwork
MusicVR - A similar series of musical concept games designed by fellow musician, Mike Oldfield.
Prince Interactive - A similar game designed by the musician, Prince.
References
External links
1993 video games
CD-i games
Classic Mac OS games
Video games based on musicians
Peter Gabriel
Video games developed in the United Kingdom
Windows games |
https://en.wikipedia.org/wiki/Probabilistic%20data%20association%20filter | The Probabilistic Data Association Filter (PDAF) is a statistical approach to the problem of plot association (target-measurement assignment) in a target tracking algorithm. Rather than choosing the most likely assignment of measurements to a target (or declaring the target not detected or a measurement to be a false alarm), the PDAF takes an expected value, which is the minimum mean square error (MMSE) estimate. The PDAF on its own does not confirm nor terminate tracks.
Whereas the PDAF is only designed to track a single target in the presence of false alarms and missed detections, the Joint Probabilistic Data Association Filter (JPDAF) can handle multiple targets. The first real-world application of the PDAF was probably in the Jindalee Operational Radar Network, which is an Australian over-the-horizon radar (OTHR) network.
Implementations
Matlab: The PDAF and JPDAF algorithms are implemented in the singleScanUpdate function that is part of the United States Naval Research Laboratory's free Tracker Component Library.
Python: The PDAF and other data association methods are implemented in Stone-Soup. A tutorial demonstrates how the algorithms can be used.
References
Radar signal processing |
https://en.wikipedia.org/wiki/Joint%20Probabilistic%20Data%20Association%20Filter | The joint probabilistic data-association filter (JPDAF) is a statistical approach to the problem of plot association (target-measurement assignment) in a target tracking algorithm. Like the probabilistic data association filter (PDAF), rather than choosing the most likely assignment of measurements to a target (or declaring the target not detected or a measurement to be a false alarm), the PDAF takes an expected value, which is the minimum mean square error (MMSE) estimate for the state of each target. At each time, it maintains its estimate of the target state as the mean and covariance matrix of a multivariate normal distribution. However, unlike the PDAF, which is only meant for tracking a single target in the presence of false alarms and missed detections, the JPDAF can handle multiple target tracking scenarios. A derivation of the JPDAF is given in.
The JPDAF is one of several techniques for radar target tracking and for target tracking in the field of computer vision.
The Coalescence Problem
A common problem observed with the JPDAF is that estimates of closely spaced targets tend to coalesce over time. This is because the MMSE estimate is typically undesirable when target identity is uncertain.
Variants of the JPDAF algorithm have been made that try to avoid track coalescence. For example, the Set JPDAF uses an approximate minimum mean optimal sub pattern assignment (MMOSPA) instead of an approximate MMSE estimator. The JPDAF*, modifies how the target-measurement association probabilities are computed, and variants of the global nearest-neighbor JPDAF (GNN-JPDAF) (a best-hypothesis tracker) use the global nearest neighbor (GNN) estimate in place of the mean but compute the covariance matrix as in the normal JPDAF: as a mean-squared error matrix.
Implementations
Matlab: The PDAF, JPDAF, Set JPDAF, JPDAF*, GNN-JPDAF and multiple other exact and approximate variants of the JPDAF are implemented in the singleScanUpdate function that is part of the United States Naval Research Laboratory's free Tracker Component Library. The sample code in demo2DDataAssociation demonstrates how the algorithms can be used in a simple scenario.
Python: The PDAF, JPDAF and other data association methods are implemented in Stone-Soup. A tutorial demonstrates how the algorithms can be used.
References
Radar signal processing |
https://en.wikipedia.org/wiki/PDAF | PDAF may refer to:
Probabilistic data association filter, a statistical approach to the problem of plot association in a radar tracker
Priority Development Assistance Fund, a discretionary fund in the Philippines
Phase-detection autofocus, a type of autofocus used In some cameras |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.