source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Calgary%20corpus | The Calgary corpus is a collection of text and binary data files, commonly used for comparing data compression algorithms. It was created by Ian Witten, Tim Bell and John Cleary from the University of Calgary in 1987 and was commonly used in the 1990s. In 1997 it was replaced by the Canterbury corpus, based on concerns about how representative the Calgary corpus was, but the Calgary corpus still exists for comparison and is still useful for its originally intended purpose.
Contents
In its most commonly used form, the corpus consists of 14 files totaling 3,141,622 bytes as follows.
There is also a less commonly used 18 file version which include 4 additional text files in UNIX "troff" format, PAPER3 through PAPER6. The maintainers of the Canterbury corpus website notes that "they don't add to the evaluation".
Benchmarks
The Calgary corpus was a commonly used benchmark for data compression in the 1990s. Results were most commonly listed in bits per byte (bpb) for each file and then summarized by averaging. More recently, it has been common to just add the compressed sizes of all of the files. This is called a weighted average because it is equivalent to weighting the compression ratios by the original file sizes. The UCLC benchmark by Johan de Bock uses this method.
For some data compressors it is possible to compress the corpus smaller by combining the inputs into an uncompressed archive (such as a tar file) before compression because of mutual information between the text files. In other cases, the compression is worse because the compressor handles nonuniform statistics poorly. This method was used in a benchmark in the online book Data Compression Explained by Matt Mahoney.
The table below shows the compressed sizes of the 14 file Calgary corpus using both methods for some popular compression programs. Options, when used, select best compression. For a more complete list, see the above benchmarks.
Compression challenge
The "Calgary corpus Compression and SHA-1 crack Challenge" is a contest started by Leonid A. Broukhis on May 21, 1996 to compress the 14 file version of the Calgary corpus. The contest offers a small cash prize which has varied over time. Currently the prize is US $1 per 111 byte improvement over the previous result.
According to the rules of the contest, an entry must consist of both the compressed data and the decompression program packed into one of several standard archive formats. Time and memory limits, archive formats, and decompression languages have been relaxed over time. Currently the program must run within 24 hours on a 2000 MIPS machine under Windows or Linux and use less than 800 MB memory. An SHA-1 challenge was later added. It allows the decompression program to output files different from the Calgary corpus as long as they hash to the same values as the original files. So far, that part of the challenge has not been met.
The first entry received was 759,881 bytes in September, 1997 by Malcolm Taylo |
https://en.wikipedia.org/wiki/Transportation%20in%20California | California's transportation system is complex and dynamic. Although known for its car culture and extensive network of freeways and roads, the state also has a vast array of rail, sea, and air transport. Several subway, light rail, and commuter rail networks are found in many of the state's largest population centers. In addition, with the state's location on the West Coast of the United States, several important ports in California handle freight shipments from the Pacific Rim and beyond. A number of airports are also spread out across the state, ranging from small general aviation airports to large international hubs like Los Angeles International Airport and San Francisco International Airport.
However, in a state with over 39 million people, rapid population expansion, and diverse terrain and weather, that system is under pressure to stay ahead of population growth and transportation needs.
Roads and highways
California is known for its car culture; by the end of 2010, the California Department of Motor Vehicles had 23,799,513 driver's licenses and a total of 31,987,821 registered vehicles on file. The state's residents typically take to the roads for their commutes, errands, and vacations, giving California's cities a reputation for severe traffic congestion.
California's vast terrain is connected by an extensive system of freeways, expressways, and highways, all maintained by the California Department of Transportation (Caltrans) and patrolled by the California Highway Patrol (CHP), except for the numbered expressways in Santa Clara County which were built and maintained by the county itself. The main north–south arteries are U.S. Route 101 (US 101), which travels close to the coast from Downtown Los Angeles, across the Golden Gate Bridge, and to the Oregon state line, and Interstate 5 (I-5), which travels inland from the Mexico–United States border to the Oregon state line, effectively bisecting the entire state. In addition, a major north–south artery is State Route 99 (SR 99), which travels from near Bakersfield to near Red Bluff; SR 99 is largely parallel to I-5, and connects the Central Valley cities not connected by the Interstate.
Perhaps it is a testament to California's sheer size that although it has one of the most extensive freeway systems in the United States, it contains many of the largest cities in the United States not served by an Interstate Highway, including the two largest, Fresno (pop. 471,479) and Bakersfield (pop. 247,057). These cities, along with Modesto and Visalia, are passed by as I-5 veers west to avoid the congestion of the populated eastern side of the Central Valley as it connects Sacramento and Los Angeles.
The state's freeway network has expanded ever since the Arroyo Seco Parkway, the first freeway in the Western United States, connecting Los Angeles and Pasadena, opened in 1940. However, the state is not immune to freeway revolts, such as those that have prevented a freeway in San Francisco between |
https://en.wikipedia.org/wiki/History%20News%20Network | History News Network (HNN) at George Washington University is a platform for historians writing about current events.
History
History News Network (HNN) is a non-profit corporation registered in Washington DC. HNN was founded by Richard Shenkman, the author of Legends, Lies & Cherished Myths of World History. Shenkman served as editor until his retirement in 2019. Historian Kyla Sommers is the current editor-in-chief. HNN sponsors several history-oriented blogs including Liberty and Power (coordinated by David T. Beito), and Jim Loewen.
HNN, originally hosted by George Mason University, moved to George Washington University in 2017.
Murray Polner was the long-time book editor for HNN.
In 2012, HNN celebrated the Fourth of July by holding a contest to select the worst books about American history every published. Nominees David Barton’s The Jefferson Lies, Michael Bellesiles’s Arming America, Gavin Menzies’s 1421 : The Year China Discovered America, Richard G. Williams’s 2006 book Stonewall Jackson: The Black Man’s Friend and A People’s History of the United States by Howard Zinn. Over 1000 HNN readers gave the nod to Barton and Zinn.
References
External links
George Washington University
Tertiary educational websites
Digital humanities
History organizations
History magazines published in the United States
Online magazines published in the United States
Political magazines published in the United States
Cultural magazines published in the United States
American political websites
Magazines published in Washington, D.C. |
https://en.wikipedia.org/wiki/IRSG | IRSG may refer to:
Information Retrieval Specialist Group, a specialist group of the British Computer Society promoting Information Retrieval
Internet Research Steering Group
International Regulatory Strategy Group A City of London group whose purpose is "to contribute to the shaping of the international regulatory regime, at global, regional and national levels" |
https://en.wikipedia.org/wiki/Chess%20%28Northwestern%20University%29 | Chess was a pioneering chess program from the 1970s, written by Larry Atkin, David Slate and Keith Gorlen at Northwestern University. Chess ran on Control Data Corporation's line of supercomputers. Work on the program began in 1968 while the authors were graduate students at the university. The first competitive version was Chess 2.0 which gradually evolved to Chess 3.6 and was rewritten as the 4.x series. It dominated the first computer chess tournaments, such as the World Computer Chess Championship and ACM's North American Computer Chess Championship. NWU Chess adopted several innovative or neglected techniques including bitboard data structures, iterative deepening, transposition tables, and an early form of forward pruning later called futility pruning. The 4.x versions were the first programs to abandon selective search in favor of full-width fixed-depth searching.
In 1976, Chess 4.5 won the Class B section of the Paul Masson American Class Championships, the first time a computer was successful in a human tournament. The performance rating was 1950.
In February 1977, Chess 4.6, the only computer entry, surprised observers by winning the 84th Minnesota Open against competitors just under Master level. It achieved a USCF rating close to or at Expert, higher than previous programs' Class C or D, by winning five games and losing none. Stenberg (rated 1969) became the second Class A player to lose to a computer in a tournament game, the first being Jola.
Because of its Minnesota victory, grandmaster Walter Browne invited Chess 4.6 on a CDC Cyber 176 to his simultaneous chess exhibition; to Browne and others' surprise, Chess 4.6 defeated the United States chess champion. Also in 1977, Chess 4.6 won the second World Computer Chess Championship in Toronto, ahead of 15 other programs including KAISSA; Chess 4 had finished in second place to KAISSA at the first tournament in 1974. The favorite to win the tournament, like all but one other entry Chess 4.6 ran on a computer located away from the tournament; despite losing 90 minutes to hardware failure at the start of its first match the program rapidly defeated its opponent in 27 moves, earlier than any other first-round match. Chess 4.6 was capable of defeating 99.5% of United States Chess Federation-rated players under tournament conditions, and was stronger in blitz chess.
In 1978, the improved Chess 4.7—which had by now achieved a 2030 rating after 31 tournament games—played against David Levy who, in 1968 had wagered that he would not be beaten by a computer within ten years. Whereas Chess 4.7 had beaten Levy under blitz conditions, the bet involved forty moves over a two-hour period, the computer's choices being relayed by telephone from Minnesota to the board. Levy won the bet convincingly, defeating Chess 4.7 in a six-game match by a score of 4.5-1.5, The computer scored a draw in game two after getting a completely winning position but being outplayed by Levy in the endgame, and a win i |
https://en.wikipedia.org/wiki/John%20Edgar%20Dick | John Edgar Dick (born in 1954) is Canada Research Chair in Stem Cell Biology, Senior Scientist at the Princess Margaret Cancer Centre, University Health Network and Professor in the Department of Molecular Genetics at the University of Toronto in Canada. Dick is credited with first identifying cancer stem cells in certain types of human leukemia. His revolutionary findings highlighted the importance of understanding that not all cancer cells are the same and thus spawned a new direction in cancer research. Dick is also known for his demonstration of a blood stem cell's ability to replenish the blood system of a mouse, his development of a technique to enable an immune-deficient mouse to carry and produce human blood, and his creation of the world's first mouse with human leukemia.
Early life and education
Dick was raised on a farm in southern Manitoba. His early education was gained in a one-room schoolhouse. Later he moved to Winnipeg to study to become an X-ray technician. There he noticed one of his roommates was attending university and studying biology. Dick realized he was more interested in biology and decided to switch pursuits.
Dick started off at the University of Manitoba specializing in microbiology and graduating with a Doctor of Philosophy degree in 1984.
Career and research
In 1984, he moved to Toronto. In order to support his wife and two children, Dick worked part-time at an X-ray lab while he finished his post-doctorate work in Alan Bernstein’s lab. Bernstein, a noted cancer researcher whose Ph.D. advisor was James Till at the Ontario Cancer Institute, guided Dick to research cancers of the blood.
Over the next five years, Dick developed an in vivo repopulation assay using the NOD/SCID mouse. This technique of using an immune-deficient mouse to generate human hematopoietic cells won Dick international recognition.
In 1994, Nature published his paper which described how cancer stem cells grow slowly. Dick explained, "Most kinds of chemotherapy are designed to kill fast-growing cancer cells. This is why leukemia can come back after treatment. To get rid of the cancer, you have to find ways of eliminating the stem cells." Many researchers dismissed Dick's discovery as interesting, but something not likely to apply to solid tumours.
In 1997, Dick reported the detection of cancer stem cells at the root of three other forms of leukemia. This time he presented it as the "cancer stem-cell hypothesis". His model stated that there are different cancer cells and amongst them there is a pecking order in which the abnormal stem cell, is both the key to forming and feeding a cancer. Therefore, without an abnormal stem cell, cancers will not grow. This time his report was considered a breakthrough.
Dick has transformed the study of human hematopoiesis and leukemogenesis, with his development of methodologies for transplanting human bone marrow into immune-deficient mice, with resultant multilineage repopulation of murine bone marrow |
https://en.wikipedia.org/wiki/Micro%20Focus%20SiteScope | Micro Focus SiteScope is agentless monitoring software focused on monitoring the availability and performance of distributed IT infrastructures, including Servers, Network devices and services, Applications and application components, operating systems and various IT enterprise components.
Micro Focus SiteScope was originally written by Freshwater Software in 1996, a company acquired by Mercury Interactive in 2001. Mercury Interactive was subsequently acquired by Hewlett-Packard (HP) in 2006. Version 10.10 was released in July 2009. The current version is 2018.08 (11.51). SiteScope is now marketed by the Micro Focus.
Micro Focus SiteScope tests a web page or a series of web pages using synthetic monitoring. However, it is not limited to web applications and can be used to monitor database servers (Oracle Database, Microsoft SQL Server, etc.), Unix servers, Microsoft Windows servers and many other types of hardware and software. It can export the collected data in real time to Micro Focus LoadRunner or it can be used in standalone mode.
Micro Focus SiteScope Monitor Types
Micro Focus SiteScope supports more than 100 types of application in physical and virtual environments and can monitor servers, databases, applications, networks, web transactions, streaming technology and integration technology, as well as generic elements including files, scripts and directories. Micro Focus SiteScope monitoring supports mid-tier processes, URLs, utilization of servers and response time of the mid-tier processes. Users can set thresholds for specific characteristics and be alerted for critical or warning conditions.
Latest Micro Focus SiteScope Version Information
HPE Software merged with Micro Focus in September 2017. The latest release of Micro Focus SiteScope is version 11.92.
Prepackaged Monitors
Prepackaged monitors include CPU Utilization Monitor, DNS Monitor, Directory Monitor, Disk Space Monitor, Log File Monitor, Memory Monitor, Network Monitor, Ping Monitor, Port Monitor, Script Monitor, Service Monitor, URL Monitor, URL List Monitor, URL Sequence Monitor, Web Server Monitor, WebLogic Application Server Monitor and threshold values.
Solution Templates
Micro Focus SiteScope comes with solution templates for monitoring IT infrastructure elements, including Oracle, Microsoft Exchange Server, SAP, WebLogic, and Unix and Linux operating systems. Solution templates are for rapidly deploying specific monitoring based on best practice methodologies.
Solution templates deploy a combination of standard SiteScope monitor types and solution-specific monitors with settings that are optimized for monitoring the availability, performance, and health of the target application or system. For example, the solutions for Microsoft Exchange monitoring include performance counter, event log, MAPI, and Exchange application specific monitor types.
Working with Solution Templates
The following is an overview of the steps for using Solution Templates in SiteSco |
https://en.wikipedia.org/wiki/Association%20of%20European%20Schools%20of%20Planning | The Association of European Schools of Planning (AESOP) is a network of European universities, their departments and affiliated schools that are engaged in teaching and research in the fields of urban and regional planning.
Foundation
The formal charter of the establishment of AESOP was signed in Dortmund, Germany in 1987. In 1992, it was formally registered as a non-profit association under Belgian law.
Aims
The association aims to promote the development of the teaching curricula and research among its member institutions through mutual dialogue, communication, exchange, and dissemination of research practices.
Presidents and Secretary Generals
See also
European Spatial Development Perspective
European Union
The European Spatial Development Planning network
References
Higher education organisations based in Europe
Organizations established in 1987
Urban planning organizations |
https://en.wikipedia.org/wiki/Geek%20Pride%20Festival | The Geek Pride Festival was the name of a number of events between 1998 and 2000, organised by Tim McEachern and devoted to computer geek activities and interests. The name of the festival is most often associated with the large event held on March 31 and April 1, 2000 at the Park Plaza Castle in Boston, United States.
Before that there were two events at the now closed Big House Brewery in Albany, New York. WAMC, the local NPR affiliate, sponsored the events which were organized by Tim McEachern.
2000 event
The 2000 event was a major production, organised with the help of Susan Kaup, Chris O'Brien and many volunteers.
The event began Friday night, with a swap meet / social event at the Modern Lounge in Boston's Landsdowne Street nightclub district. Drink tickets were offered at the door, and the DJ played computer-themed music.
On Saturday, the main event occurred at the Castle, where admission was free. The middle of the floor held the "Email Garden", comprising about a dozen tables with PCs running Red Hat Linux, in a wired LAN network and providing email, Web, and general Internet access. At the front of the hall was a stage, which hosted a number of invited guests, including Rob Malda of Slashdot, Eric S. Raymond, the video game cover band Everyone. The stage was also host to the final round of a Quake III tournament, held in a back room, displayed on the stage's projection screen, as well as the final round of "Stump the Geek", a geek trivia contest.
Aside from the main events, the main floor had computer workstations displaying live webcam feeds of "satellite" Festivals in remote locations. A live Shoutcast feed was also provided of the Boston event. A poll for "greatest geek hero" was also held; the official winner was Alan Turing.
According to Science/AAAS magazine, 2,000 people attended, though the open-door free admission made an official count impossible.
Corporate sponsors
VA Linux (now SourceForge, Inc.)
Andover.net ( now OSTG, part of SourceForge)
SwitcHouse (now Nintari)
Addison-Wesley
Newstrolls.com ( now defunct)
Speakers
Alex Pentland
Rob Malda
Keith Dawson, editor of Tasty Bits from the Technology Front
Eric S. Raymond
The Cluetrain Manifesto authors Christopher Locke & David Weinberger
Micky Metts aka [Michele D. Metts]
Jeffrey Zeldman
Dave Green & Danny O'Brien of UK based ntk.net
Other events
The 2000 event is widely referred to as the "first annual" event, although McEachern organised at least one previous event named Geek Pride Festival (and/or Geek Pride Day) at a bar in Albany, New York. Some sources refer to the Boston event as the third annual.
McEachern planned another event to take place later the same year in San Francisco, but was never realised.
References
Notes
External links
Event photos taken by Gerald Oskoboiny
Computing culture
Recurring events established in 1998
Recurring events disestablished in 2000
Festivals in Boston
History of subcultures
Pride |
https://en.wikipedia.org/wiki/Thomas%20H.%20Davenport | Thomas Hayes "Tom" Davenport, Jr. (born October 17, 1954) is an American academic and author specializing in analytics, business process innovation, knowledge management, and artificial intelligence. He is currently the President’s Distinguished Professor in Information Technology and Management at Babson College, a Fellow of the MIT Initiative on the Digital Economy, Co-founder of the International Institute for Analytics, and a Senior Advisor to Deloitte Analytics.
Davenport has written, coauthored, or edited twenty books, including the first books on analytical competition, business process reengineering and achieving value from enterprise systems, and the best seller, Working Knowledge (with Larry Prusak), on knowledge management. He has written more than one hundred articles for such publications as Harvard Business Review, MIT Sloan Management Review, California Management Review, the Financial Times, and many other publications. Davenport has also been a columnist for The Wall Street Journal, CIO, InformationWeek, and Forbes magazines.
In 2003, Davenport was named one of the world’s 'Top 25 Consultants' by Consulting magazine, and in 2005 was named one of the world’s top three analysts of business and technology by readers of Optimize magazine. In 2012 he was named one of the world's "Top 50 Business School Professors" by Poets and Quants and Fortune Magazine.
One of his most popular books (coauthored with Jeanne Harris), Competing on Analytics: The New Science of Winning, provides guidelines for basing competitive strategies on the analysis of business data, and highlights several firms that do so.
One of his sons, Hayes Davenport, is a television comedy writer and podcaster living in Los Angeles.
His other son, Chase Davenport, makes surfboards and researches artificial intelligence in San Francisco.
Education
Davenport initially trained as a sociologist, with a BA in Sociology from Trinity University in 1976, a Master's degree in Sociology from Harvard in 1979, and a Ph.D. in Sociology from Harvard in 1980.
Career
After graduating with a Ph.D. in Sociology, Davenport worked as an academic before being offered a research and consulting job at Index by James Champy. Davenport became Director of research at Index, studying business process improvement. Part of this research was a multiclient research program that Index and Hammer operated across an industry research consortium called PRISM – Partnership for Research in Information Systems Management. Davenport was the program director. In 1988 PRISM interviewed 100 companies on the ways information technology could improve cross-functional processes, and Business process re-engineering emerged from this research.
Following CSC Index's work with business process engineering, Davenport made contributions to knowledge management and the attention economy before moving on to contribute in the areas of data analytics and artificial intelligence.
Davenport's career experience, in a |
https://en.wikipedia.org/wiki/Huey%27s%20Cooking%20Adventures | Huey's Cooking Adventures is an Australian television series featuring chef Iain Hewitson.
It screened at daytime on Monday to Friday throughout its run on Network Ten, including most recently at 4:00pm. It also airs on the subscription television channel Lifestyle Food, through Foxtel, Austar and Optus Television. The show began airing in 1997 on the Seven Network, before defecting to Ten soon after where the show has found popularity with daytime audiences. The program was replaced with a new, albeit similar, series Huey's Kitchen from March 2010.
Synopsis
The show ran for half an hour, with Iain Hewitson often cooking "away from home" using local produce and ingredients. The show provides modern food as well as classics with a "Huey" influence. He's also known for throwing in his stories and jokes.
Sponsors
In later seasons, major sponsors had a larger focus in the program, including an advertorial before the conclusion of each episode. These sponsors included:
Campbell's Real Stock
Viva Papertowels
Kikkoman
McKenzie's
Chemist Warehouse
Bi-Lo
See also
List of Australian television series
References
External links
Official Website
Official Page by Channel Ten
Seven Network original programming
Network 10 original programming
Australian cooking television series
1997 Australian television series debuts
2010 Australian television series endings
2000s Australian television series |
https://en.wikipedia.org/wiki/MSG%20Sportsnet | MSG Sportsnet (MSGSN, formerly MSG Plus) is an American regional sports network owned by MSG Entertainment; it operates as a sister channel to MSG Network. The network serves the New York City metropolitan area, whose reach expands to cover the entire state of New York, Northern New Jersey, Southwestern Connecticut and Northeastern Pennsylvania; MSG Sportsnet carries sports events from several of the New York area's professional sports franchises, as well as college sports events.
The channel was first established in 1976 by Cablevision as Cablevision Sports 3; the channel later rebranded as SportsChannel New York, and became the charter affiliate of an eponymous chain of regional sports networks. The channel became a sister to MSG Network in 1995 after Cablevision acquired the Madison Square Garden company. In 1998, the channel—along with the remainder of the SportsChannel chain—was relaunched as part of Fox Sports Networks, later becoming FSN New York. In March 2008, the channel rebranded as MSG Plus to closer align it with its parent channel; the service later dropped FSN programming.
History
SportsChannel New York
MSG+ originally launched in 1976 as Cablevision Sports 3, a local sports network owned by Cablevision and available to their subscribers on Long Island (the "3" referenced the network's channel slot on Cablevision, where it remained through the 1990s). When it debuted, the network had agreements to carry the home games of the New York Islanders and New York Nets. The service was renamed SportsChannel New York in March 1979. The next month, both the New York Yankees and New York Mets signed agreements with SportsChannel. SportsChannel would also gain the New Jersey Devils when the team relocated in 1982.
As the original SportsChannel was growing in popularity in New York City, Cablevision (through its then-broadcasting unit, Rainbow Media) eventually decided to form a new group of regional sports networks under the SportsChannel brand, with SportsChannel New York serving as the flagship charter affiliate. The expansion began with Cablevision's purchase of PRISM New England, a Boston-based premium channel previously owned by Spectacor, which was rechristened as SportsChannel New England on January 1, 1983. Other SportsChannel networks launched between throughout the 1980s and early 1990s in markets such as San Francisco, Chicago, Philadelphia and Los Angeles.
Throughout most of its history SportsChannel was operated as a joint-venture. The Washington Post became a partner in SportsChannel in 1983, gaining 50% interest in the networks. In 1984, CBS also entered the partnership in a deal that gave each of the three companies a one-third interest. The Washington Post and CBS sold back their shares to Rainbow in 1987.
In December 1988, Cablevision announced that it would form a joint venture with NBC to operate the cable networks owned by the respective companies, including SportsChannel. Through this partnership, SportsChannel acqu |
https://en.wikipedia.org/wiki/The%20Comedy%20Channel%20%28American%20TV%20channel%29 | The Comedy Channel was a short-lived American comedy-oriented cable television network owned by Home Box Office, Inc., a division of Time Warner (now Warner Bros. Discovery). It launched on November 15, 1989 at 6:00 p.m. Eastern Time. In 1991, HBO agreed to merge the channel with Viacom's competing channel, Ha!. The new network, CTV: The Comedy Network, premiered on April 1, 1991, but rebranded to Comedy Central on June 1, 1991.
Most of the Comedy Channel's original programs were produced in the HBO Downtown Studios on East 23rd Street in Manhattan.
Programming
The format prior to the merger included several original and unconventional programs such as Onion World with Rich Hall and Mystery Science Theater 3000, as well as laid-back variety/talk shows hosted by stand-up comedians, including The Sweet Life with Rachel Sweet; Tommy Sledge, Private Eye; Alan King: Inside the Comedy Mind; Night After Night with Allan Havey; Sports Monster; and The Higgins Boys and Gruber, the latter of whom performed sketches in between showings of vintage television serials Supercar, Clutch Cargo, and Bob and Ray. Commercial breaks often included "Deep Thoughts by Jack Handey," which would later be featured on Saturday Night Live.
Standard format
The standard format for these shows usually involved the various hosts introducing clips culled from the acts of stand-up comedians as well as classic comedies of the 1970s and 1980s, such as Young Frankenstein and Kentucky Fried Movie, presented in a style similar to music videos. In the early days, certain hours of the day when clips were shown without "host segments" were dubbed Short Attention Span Theater. In 1990, hosts Jon Stewart and Patty Rosborough were introduced under this title, and the show became one of the few that survived the network merger into CTV. Comedian Marc Maron later hosted the series.
In the final months before the merger, the channel developed an eight-hour programming block that was shown three times during a 24-hour period, which included reruns of Monty Python's Flying Circus.
Ha! and Comedy Channel merge to create Comedy Central
The Comedy Channel struggled both commercially and critically. Critics derided the hodgepodge of clips from comedy films and stand-up comedy acts that filled the long gaps between original programs.
In 1990, The Comedy Channel and Ha! agreed to merge their operations and form a channel called CTV: The Comedy Network, which debuted on April 1, 1991. Prior to the merger, each channel had fewer than ten million subscribers. In order to avoid trademark issues with Canadian broadcast network CTV, the name of the channel was subsequently changed to Comedy Central on June 1, 1991, with the name "Comedy Partners, Inc." appearing on the end credits of all shows produced by the new channel. The original Viacom which operated Ha! bought out the Time Warner half of the network (which operated The Comedy Channel and belonged to HBO) in 2003. Following the purchase, the |
https://en.wikipedia.org/wiki/The%20Comedy%20Channel%20%28British%20TV%20channel%29 | The Comedy Channel was a short-lived satellite television network owned by British Sky Broadcasting during the early 1990s.
History
The channel launched on 1 October 1991, soon after the merger of Sky Television plc and British Satellite Broadcasting. The merged company called British Sky Broadcasting, brought together comedy programming from its existing libraries – Sky having an archive of American imports (including Three's Company, I Love Lucy, Green Acres, The Beverly Hillbillies and Seinfeld) and BSB having obtained rights to a number of BBC sitcoms such as 'Allo 'Allo!, Steptoe and Son, Are You Being Served?, Porridge, Dad's Army and The Goodies.
The Comedy Channel existed in the days before the basic Sky Multichannels subscription package, so was made available as a premium service to subscribers of either Sky Movies or The Movie Channel. Listings for the channel were carried in Radio Times and other listings magazines.
The network lost its broadcasting rights following the expiry of the contract between the BBC and former BSB. Eventually the channel closed on 30 September 1992 to be replaced by Sky Movies Gold, a service dedicated to "classic movies". Following the end of the contract with Sky, the BBC's archive programming was subsequently used to launch UK Gold on satellite and cable from 1 November 1992.
Sky would not relaunch a comedy-based channel until the arrival of Sky Comedy on 27 January 2020, it retains a minority interest in the domestic version of ViacomCBS's Comedy Central.
Programming
American
The Abbott and Costello Show
The Addams Family
Ann Jillian
Babes
Barney Miller
The Beverly Hillbillies
The Bob Newhart Show
Car 54, Where Are You?
Comic Strip Live
Doctor Doctor
F Troop
Free Spirit
Gilligan's Island
Green Acres
Here's Lucy
Hogan's Heroes
Homeroom
The Honeymooners
I Love Lucy
In Living Color
It's Garry Shandling's Show
Leave It to Beaver
The Love Boat
The Lucy Show
The Lucy-Desi Comedy Hour
The Mary Tyler Moore Show
McHale's Navy
Mister Ed
The Monkees
Moonlighting
The Munsters
Night Court
Petticoat Junction
Rowan & Martin's Laugh-In
Seinfeld
The Sonny & Cher Comedy Hour
The Sunday Comics
Three's Company
Wings
Working It Out
Australian
The Comedy Company
Mother and Son
British
'Allo 'Allo!
Are You Being Served?
Dad's Army
The Good Life
The Goodies
Oh, Brother!
Porridge
Steptoe and Son
Till Death Us Do Part
The Young Ones
Canadian
The Kids in the Hall
Maniac Mansion
References
Defunct television channels in the United Kingdom
Sky television channels
Comedy television networks
1991 establishments in the United Kingdom
Television channels and stations established in 1991
Television channels and stations disestablished in 1992
1990s in the United Kingdom
1990s in British television
History of television in the United Kingdom |
https://en.wikipedia.org/wiki/Law%20of%20the%20Land%20%28TV%20series%29 | Law of the Land is an Australian television drama series that screened on the Nine Network from 1993–1999. The series was set in the fictional country town of Merringanee and centered on the unique way that locals dealt with and enforced the law. Storylines in Law of the Land were serialized, with one larger plot covering the season.
The series was created by Ro Hume and Sue Masters and produced by Bruce Best, Matt Carroll, Richard Clendinnen and Terrie Vincent.
Cast
Lisa Hensley – Kate Chalmers
David Roberts – Peter Lawrence
Wyn Roberts – Hamilton Chalmers
Richard Moir – Sergeant Clive O'Connor
David Walters – Sean O'Connor
Angelo D'Angelo – Sergeant Marc Rosetti
Debbie Byrne – Jean Jardine
Tamblyn Lord – David Jardine
Lindy Wallis – Trish Miles
Shane Connor – Harry Miles
Radha Mitchell – Alicia Miles
Abbie Holmes – Audrey O'Connor
Peter O'Brien – Andy Cochrane
Frances O'Connor – Marissa Green
Alexandra Fowler – Jacqui Rushcutter
Fiona Spence – Magistrate Maggie Mulcahy
Rebecca Frith – Alex Lentini
Tessa Humphries – Hannah Scott
Mike Bishop – Ray Richmond
Michael O'Neill – Michael Delaney
Sapidah Kian – Shirin Rasidi
Bruce Hughes – Nick Rogers
Karmen Raspovic – Heather Coleman
Episodes
Season One
Season Two
Season Three
Season Four
See also
Lex loci – the Legal Latin phrase for conflicts of law
List of Australian television series
References
External links
1990s Australian drama television series
Nine Network original programming
Australian legal television series
1993 Australian television series debuts
1999 Australian television series endings |
https://en.wikipedia.org/wiki/The%20%2420%20Challenge | The $20 Challenge was an Australian reality television series that was broadcast on the Network Ten in 2000. The show was hosted by Tim Bailey, and saw four Australians trying to survive in a foreign country with nothing but $20 to their name.
The eventual winner was Rhiannon Kelly-Pearce. The show was the first television role for James Mathison.
See also
List of Australian television series
List of Network Ten programs
References
2000s Australian reality television series
Network 10 original programming
2001 Australian television series debuts
2001 Australian television series endings |
https://en.wikipedia.org/wiki/Good%20Wilt%20Hunting | "Good Wilt Hunting" is a 44-minute long animated television film, starring the cast of Foster's Home for Imaginary Friends. It originally aired on Cartoon Network during Thanksgiving Day on November 23, 2006.
Plot
Every five years, Madame Foster arranges a reunion of the imaginary friends with their creators. Wilt, whose creator is unknown and has never come to the reunion, becomes unusually agitated, making Bloo very curious. The night after the first day of the reunion, Wilt runs away without telling anyone or leaving any clues. This results in a chase around the world, in which Bloo, Mac, Eduardo, Coco, and Frankie, joined by creators Douglas, Adam, and police officer Nina Valerosa attempt to bring Wilt back home.
Along the way, Wilt gets off track when he helps out a variety of individuals in a town. Eventually, Wilt gets arrested for accidentally assisting some burglars when they moved some furniture to their truck. While in prison, Wilt shares his history with the inmates; his creator imagined him to help him become a better basketball player and the two became undefeated, but a local bully imagined his own imaginary friend, Foul Larry, to beat them and they lost. The following morning, the Foster's gang checks out of a motel, and are about to give up on their mission and just hope that Wilt decides to come back in the near future. They discover the same three criminals trying to hijack the bus. After finding out that Wilt is in jail, the group head over there only to find out that Wilt was freed in return for mowing all of the lawns in a nearby suburban area during his journey. At this point, the group assumes that Wilt must be after his original creator, and Mac then discovers that Wilt's creator is in Japan.
Meanwhile, Wilt finally arrives at the basketball court he and his creator used to play at. There, he is greeted by an imaginary friend from his past: a basketball scoreboard friend named Stats. Wilt reveals that he is back for a rematch against Foul Larry, and that his deformities originated from him losing the game to save his creator from accidentally being crushed by Foul Larry, causing his creator to become upset and Wilt left believing it was his fault. Despite this, Wilt loses the match again when his creator pulls him out of the same situation Wilt saved him from. As Wilt lies down on the ground in defeat, he is greeted by his friends and his creator Jordan Michaels (a parody of Michael Jordan). Jordan explains to Wilt that he was never upset with Wilt, but only with himself. He stated that he looked for him everywhere after that game 30 years ago but was unable to find him, and explained how he not only made him a better basketball player, but made him a better person. In return, Jordan offers Wilt fame and a place to stay in his mansion. However, Wilt decides to stay back at Foster's so he could someday be adopted by another kid, and the film ends with Wilt and Jordan playing a lopsided game of one-on-one basketball at |
https://en.wikipedia.org/wiki/StarStruck%20%282005%20TV%20series%29 | StarStruck was a short-lived 2005 Australian television series, that screened on the Nine Network. It was hosted by Larry Emdur and Catriona Rowntree. It was based on the successful Stars in Their Eyes in the United Kingdom, which in turn was based on the Dutch TV show Soundmixshow. Contestants were introduced and then whisked away to be transformed into the star of their choice. They would emerge for their performance, supported by dancers, a choir and an orchestra.
Contestants were judged on their performances by Doug Mulray and Vanessa Amorosi.
The program debuted strongly winning the 7.30pm timeslot with an average of 1.58 million viewers across Australia.
See also
List of Australian television series
List of Nine Network programs
References
2005 Australian television series debuts
2005 Australian television series endings
2000s Australian reality television series
Nine Network original programming |
https://en.wikipedia.org/wiki/Tarjan%27s%20algorithm | Tarjan's algorithm may refer to one of several algorithms attributed to Robert Tarjan, including:
Tarjan's strongly connected components algorithm
Tarjan's off-line lowest common ancestors algorithm
Tarjan's algorithm for finding bridges in an undirected graph
Tarjan's algorithm for finding simple circuits in a directed graph
See also
List of algorithms
References
Algorithms
Mathematics-related lists |
https://en.wikipedia.org/wiki/TypeScript | TypeScript is a free and open-source high-level programming language developed by Microsoft that adds static typing with optional type annotations to JavaScript. It is designed for the development of large applications and transpiles to JavaScript. Because TypeScript is a superset of JavaScript, all JavaScript programs are syntactically valid TypeScript, but they can fail to type-check for safety reasons.
TypeScript may be used to develop JavaScript applications for both client-side and server-side execution (as with Node.js or Deno). Multiple options are available for transpilation. The default TypeScript Compiler can be used, or the Babel compiler can be invoked to convert TypeScript to JavaScript.
TypeScript supports definition files that can contain type information of existing JavaScript libraries, much like C++ header files can describe the structure of existing object files. This enables other programs to use the values defined in the files as if they were statically typed TypeScript entities. There are third-party header files for popular libraries such as jQuery, MongoDB, and D3.js. TypeScript headers for the Node.js library modules are also available, allowing development of Node.js programs within TypeScript.
The TypeScript compiler is itself written in TypeScript and compiled to JavaScript. It is licensed under the Apache License 2.0. Anders Hejlsberg, lead architect of C# and creator of Delphi and Turbo Pascal, has worked on the development of TypeScript.
History
TypeScript was released to the public in October 2012, with version 0.8, after two years of internal development at Microsoft. Soon after the initial public release, Miguel de Icaza praised the language itself, but criticized the lack of mature IDE support apart from Microsoft Visual Studio, which was not available on Linux and OS X at that time. As of April 2021 there is support in other IDEs and text editors, including Emacs, Vim, WebStorm, Atom and Microsoft's own Visual Studio Code. TypeScript 0.9, released in 2013, added support for generics.
TypeScript 1.0 was released at Microsoft's Build developer conference in 2014. Visual Studio 2013 Update 2 provides built-in support for TypeScript. Further improvement were made in July 2014, when the development team announced a new TypeScript compiler, asserted to have a five-fold performance increase. Simultaneously, the source code, which was initially hosted on CodePlex, was moved to GitHub.
On 22 September 2016, TypeScript 2.0 was released, introducing several features, including the ability for programmers to optionally enforce null safety, to mitigate what's sometimes referred to as the billion-dollar mistake.
TypeScript 3.0 was released on 30 July 2018, bringing many language additions like tuples in rest parameters and spread expressions, rest parameters with tuple types, generic rest parameters and so on.
TypeScript 4.0 was released on 20 August 2020. While 4.0 did not introduce any breaking changes, it added |
https://en.wikipedia.org/wiki/Big%20Brother%20%28Australian%20season%207%29 | Big Brother Australia 2007, also known as Big Brother 7, was the seventh season of the Australian reality television series Big Brother. Episodes were broadcast on Network Ten in Australia, and the first episode aired on 22 April 2007. Despite a drop in ratings compared to previous seasons, and a number of controversies, the then Big Brother executive producer Kris Noble considers the year's season a success. At the end of this season's finale broadcast 30 July 2007, it was announced by host Gretel Killeen that Big Brother would be returning for an eighth season in 2008. In the finale Aleisha Cowcher was announced winner of Big Brother Australia 2007. She won by the closest winning margin ever in the Australian version. The news the following day reported a margin of 51% versus 49% – a difference of 65 votes. This was the last season hosted by Gretel Killeen.
Development
During the sixth-season finale, a seventh season of the show was confirmed. Auditions were held throughout November and December 2006, taking place in Brisbane, Sydney, Melbourne, Adelaide, Perth, Hobart, and Darwin. The house this season was confirmed as to be having an 'eco-friendly' theme and style; It featured a pedal-powered washing machine, a rubber garden turf made from recycled car tyres and carpets made from goat hair. On 18 April 2007, after housemates were put into lockdown, it was revealed that there would be no prize money this season. The launch date of the seventh season was rumoured to be 22 April 2007. These rumours were later confirmed.
Changes to the format
Big Brother 2007 introduced several new elements not seen in previous seasons of the series.
Big Brother Starburst Golden Key
On 29 January 2007, Network Ten, Endemol Southern Star, and Masterfoods announced "Australia's biggest ever integrated television promotion", the Big Brother Starburst Golden Key, which would allow a member of the public to enter the Big Brother House as a housemate.
Unique alphanumeric codes were included in packs of Starburst, a confectionery manufactured by Masterfoods. One hundred codes gave the opportunity to audition for the BB season after it began. Of these people, one would become a housemate and be eligible to win the season and all prizes. The winner of this competition was selected during a special episode called "Golden Key". On Day 18, Nick Sady was announced the "Golden Key" winner and entered the Big Brother House.
Prize money
Big Brother originally informed the housemates that there was zero prize money. Later they were informed that they could earn prize money by completing various tasks (similar to that of The Mole).
Friday Night Live Changes
This year the winner of Friday Night Live was given a greater power in nominations. Replacing the Three Point Twist of previous seasons, the Friday Night Live winner each week this season was required to choose one nominated housemate to be removed from the nomination line-up, and to nominate another to replace them. |
https://en.wikipedia.org/wiki/Bangladesh%20Education%20and%20Research%20Network | Bangladesh Research And Education Network (BdREN) is a non-profitable government trust.
Previously it was an educational project governed by the University Grants Commission of Bangladesh and jointly financed by Bangladesh Government and World Bank aimed at constructing a cooperative network among the universities of Bangladesh for better research capability.
Bangladesh Research And Education Network was established in 2009. A trust was established in 2019. The trust has 78 private and state-owned universities as members. The network is financed by the Government of Bangladesh and the World Bank.
The central node of the network is in the premises of the BUGC situated at Agargaon, Sher-e-Bangla Nagar, Dhaka.
See also
University Grants Commission of Bangladesh (BUGC)
References
External links
Education in Bangladesh
Learned societies of Bangladesh
2009 establishments in Bangladesh
Organisations based in Dhaka
Education research institutes in Bangladesh |
https://en.wikipedia.org/wiki/PlayMotion | PlayMotion! is a company that produces a next generation videogame technology of the same name. Their product applies practical Computer Vision algorithms to the problem of gesture recognition in a wide array of environments, including Education and exergaming.
PlayMotion, in essence, "allows players to use the wall of the room as a videogame surface", while "a graphics engine and video projector turn your actions into digital shapes and patterns on a large screen."
PlayMotion was founded by designer Greg Roberts and noted computer vision scientist Matt Flagg in 2003.
The company has a partnership with Carnegie Mellon's Entertainment Technology Center (ETC) who uses the platform to create next generation videogame and novel live performance concepts.
PlayMotion builds upon the pioneering work done by visionary Myron Krueger in the 1970s and 1980s. Their internal Funlab is an R&D incubator allowing for free thought and autonomous action which has produced many games and technologies throughout the years, including a landmark 5-screen, 250 player experience at Disney's Epcot in Orlando, Florida.
In 2009, PlayMotion released version 1.0 of a comprehensive SDK based on the Python programming language, one of the first software development kits to focus specifically on computer vision for entertainment application design.
References
Further reading
WIRED Magazine, June 2005, "The Future of Play"
External links
Companies established in 2003
Privately held companies based in Georgia (U.S. state)
Video game companies of the United States
Companies based in Atlanta |
https://en.wikipedia.org/wiki/Out%20of%20wallet | Out of wallet (sometimes abbreviated as OOW) refers to private data used for authentication in activities such as telephone banking or internet banking to prevent identity theft. The practice may part of a knowledge-based authentication process.
Ideally, out-of-wallet information is easily recallable by a user but obscure to most other persons and difficult for them to uncover. Prompts for out-of-wallet questions are now often generated automatically through convergence of databases containing users' financial transactions, vehicle registrations, and other records.
Typical out-of-wallet questions a user may be asked include:
What was the color of your first car?
What is the name of the first school you attended?
What is the name of the hospital you were born in?
Such information is available to a database compiler but may not be readily available to criminals attempting to commit identity theft.
References
Banking technology |
https://en.wikipedia.org/wiki/Cerebellar%20model%20articulation%20controller | The cerebellar model arithmetic computer (CMAC) is a type of neural network based on a model of the mammalian cerebellum. It is also known as the cerebellar model articulation controller. It is a type of associative memory.
The CMAC was first proposed as a function modeler for robotic controllers by James Albus in 1975 (hence the name), but has been extensively used in reinforcement learning and also as for automated classification in the machine learning community. The CMAC is an extension of the perceptron model. It computes a function for input dimensions. The input space is divided up into hyper-rectangles, each of which is associated with a memory cell. The contents of the memory cells are the weights, which are adjusted during training. Usually, more than one quantisation of input space is used, so that any point in input space is associated with a number of hyper-rectangles, and therefore with a number of memory cells. The output of a CMAC is the algebraic sum of the weights in all the memory cells activated by the input point.
A change of value of the input point results in a change in the set of activated hyper-rectangles, and therefore a change in the set of memory cells participating in the CMAC output. The CMAC output is therefore stored in a distributed fashion, such that the output corresponding to any point in input space is derived from the value stored in a number of memory cells (hence the name associative memory). This provides generalisation.
Building blocks
In the adjacent image, there are two inputs to the CMAC, represented as a 2D space. Two quantising functions have been used to divide this space with two overlapping grids (one shown in heavier lines). A single input is shown near the middle, and this has activated two memory cells, corresponding to the shaded area. If another point occurs close to the one shown, it will share some of the same memory cells, providing generalisation.
The CMAC is trained by presenting pairs of input points and output values, and adjusting the weights in the activated cells by a proportion of the error observed at the output. This simple training algorithm has a proof of convergence.
It is normal to add a kernel function to the hyper-rectangle, so that points falling towards the edge of a hyper-rectangle have a smaller activation than those falling near the centre.
One of the major problems cited in practical use of CMAC is the memory size required, which is directly related to the number of cells used. This is usually ameliorated by using a hash function, and only providing memory storage for the actual cells that are activated by inputs.
One-step convergent algorithm
Initially least mean square (LMS) method is employed to update the weights of CMAC. The convergence of using LMS for training CMAC is sensitive to the learning rate and could lead to divergence. In 2004, a recursive least squares (RLS) algorithm was introduced to train CMAC online. It does not need to tune a learning |
https://en.wikipedia.org/wiki/Brazilian%20Computer%20Society | The Brazilian Computer Society () was established in 1978, as a scientific and educational organization dedicated to the advancement of computer science in Brazil and the associated technologies and applications. SBC is a leading forum for researchers, students and computing professionals working in the various fields of Computer Science and Information Technology, being the largest computer society in South America.
It is structurally organized as a board of directors, seven regional chapters and a network of 170 institutional representation offices in universities and research institutions throughout Brazil. Research activities are fostered by 27 special interest groups.
Newton Faller Award
The Newton Faller Award is awarded by the SBC to honor members who have distinguished themselves throughout their lives for services to the SBC.
The award is exclusive to current members and founders and is delivered during the opening ceremony of the SBC Congress. It is named in memory of Newton Faller (1947–1996), a Brazilian computer scientist and electrical engineer.
Recipients include:
Source: Brazilian Computer Society
2019: José Augusto Suruagy Monteiro (UFPE)
2018: José Palazzo Moreira de Oliveira (UFRGS)
2017: Paulo Roberto Freire Cunha (UFPE)
2016: Carlos Eduardo Ferreira (USP)
2015: Taisy Silva Weber (UFRGS)
2014: Ricardo Augusto da Luz Reis (UFRGS)
2013: Ricardo de Oliveiro Anido (UNICAMP)
2012: Philippe Alexandre Olivier Navaux (UFRGS)
2011: Daltro José Nunes (UFRGS)
2010: Therezinha Souza da Costa (PUC-Rio)
2009: Roberto da Silva Bigonha (UFMG)
2008: Tomasz Kowaltowski (UNICAMP)
2006: Luiz Fernando Gomes Soares (PUC-RJ)
2004: Flávio Rech Wagner (UFRGS)
2001: Siang Wun Song (IME-USP)
2000: Cláudia Maria Bauzer Medeiros (UNICAMP)
CSBC
Since 1980, the Congress of the Brazilian Computer Society, or CSBC, has been held annually, promoting the sharing of experiences in the computing area.
In 2022, the CSBC will take place from the 31st of July to the 5th of August and will have its theme, Digital Empowerment: The Role of Computing in Building an Inclusive and Democratic Society.
The event will be held on the premises of the Federal Fluminense University (Universidade Federal Fluminense or UFF) in Niterói, RJ.
References
External links
SBC Website
Computer science organizations
Scientific organisations based in Brazil |
https://en.wikipedia.org/wiki/Reference%20data%20%28financial%20markets%29 | Reference data is a catch all term used in the finance industry to describe counterparty and security identifiers used when making a trade. As opposed to market data the reference data is used to complete financial transactions and settle those transactions. The financial service industry and regulatory agencies have pursued a policy of standardizing the reference data that define and describe such transactions.
At its most basic level, reference data for a simple sale of a stock in exchange for cash on a highly liquid stock exchange that involves a standard label for the underlying security (e.g., its ISIN), the identity of the seller, the buyer, the broker-dealer(s), the price, etc. At its most complex, reference data covers all relevant particulars for highly complex transactions with multiple dependencies, entities, and contingencies.
History
Standardisation efforts
The background for this policy is the risk that transactions fail and are reversed because contractual terms were misunderstood or ambiguous. In addition, the lag between the trade and ultimate settlement of the transaction may include various events that affect various elements of the transaction.
Efforts to standardize reference data are complicated by a number of factors, including:
Semantic differences in common terminology
The sheer number of data elements that make up transactions
Rapidly changing markets, products, and underlying events
Static Data
Dynamic Data
Bounded Data
As a result, work to standardize reference data is broadly considered to be an ongoing effort rather than a series of discrete programs.
Types of Data
There are many fields included in reference data. Some of the most common include:
Instrument classification (e.g., large vs small, tenor, region, sector)
Sale information (e.g., ISIN, seller identity, buyer, price)
Market Identifier Codes (ISO 10383 MIC)
See also
Clearing house (finance)
Electronic trading platform
Financial Information eXchange
FpML
International Swaps and Derivatives Association
ISIN
Legal Entity Identifier
Market data
Same-day affirmation
Straight through processing
References
Financial markets
Financial metadata
Settlement (finance) |
https://en.wikipedia.org/wiki/A3010 | A3010 may refer to:
A3010 road, one of the A roads in Zone 3 of the Great Britain numbering scheme
Acorn Archimedes A3010 personal computer
OnePlus 3T A3010 smartphone
Shizuoka Railway A3000 series electrical multiple unit train A3010
GMDD GP40-2LW A3010, a locomotive of the Belfast and Moosehead Lake Railroad (1871–2007)
See also
3010 (disambiguation) |
https://en.wikipedia.org/wiki/Loft%20%283D%29 | Loft is a method to create complicated smooth 3D shapes in CAD and other 3D modeling software. Planar cross-sections of the desired shape are defined at chosen locations. Algorithms find a smooth 3D shape that fit these cross-sections. Designers can modify the shape through choice of fitting algorithm and input parameters. The method is used in packages such as Onshape, 3D Studio Max, Creo*, SolidWorks, NX, Autodesk Revit, and FreeCAD.
Consider lofting process in boat building, to visualise the process. The planar sections are defined by boat ribs spaced along its length. The final shape is produced by placing planks over the ribs to form a smooth skin.
In PTCs Creo and in Autodesk Revit it is referred to as a Blend or Swept Blend.
See also
Parallel transport
Lathe (graphics)
Examples (external links)
Modeling an irregular funnel with the loft tool
Computer-aided design |
https://en.wikipedia.org/wiki/Rose%20tree | In computing, a rose tree is a term for the value of a tree data structure with a variable and unbounded number of branches per node. The term is mostly used in the functional programming community, e.g., in the context of the Bird–Meertens formalism. Apart from the multi-branching property, the most essential characteristic of rose trees is the coincidence of bisimilarity with identity: two distinct rose trees are never bisimilar.
Naming
The name "rose tree" was coined by Lambert Meertens to evoke the similarly named, and similarly structured, common rhododendron.
We shall call such trees rose trees, a literal translation of rhododendron (Greek = rose, = tree), because of resemblance to the habitus of this shrub, except that the latter does not grow upside-down on the Northern hemisphere.
Recursive definition
Well-founded rose trees can be defined by a recursive construction of entities of the following types:
<li style="list-style-type:'(1) '">
A base entity is an element of a predefined ground set of values (the "tip"-values).
<li style="list-style-type:'(2) '">
A branching entity (alternatively, a forking entity or a forest entity) is either of the following sub-types:
<li style="list-style-type:'(a) '">
A set of entities.
<li style="list-style-type:'(b) '">
A sequence of entities.
<li style="list-style-type:'(c) '">
A partial map from a predefined set of names to entities.
Any of (a)(b)(c) can be empty. Note that (b) can be seen as a special case of (c) – a sequence is just a map from an initial segment of the set of natural numbers.
<li style="list-style-type:'(3) '">
A pairing entity is an ordered pair such that is a branching entity and is an element of a predefined set of "label" values.
Since a pairing entity can only contain a branching entity as its component, there is an induced division into sub-types (3a), (3b) or (3c) corresponding to sub-types of branching entities.
Typically, only some combinations of entity types are used for the construction. The original paper only considers 1+2b ("sequence-forking" rose trees) and 1+2a ("set-forking" rose trees).
In later literature, the 1+2b variant is usually introduced by the following definition:
data Tree a = Leaf a | Node [Tree a]
A rose tree [...] is either a
leaf containing a value, or a node that can have an arbitrary list of subtrees.
The most common definition used in functional programming (particularly in Haskell) combines 3+2b:
data Rose α = Node α [Rose α]
An element of Rose α consists of a labelled node together with a list of subtrees.
That is, a rose tree is a pairing entity (type 3) whose branching entity is a sequence (thus of type 2b) of rose trees.
Sometimes even the combination 1+3b is considered.
The following table provides a summary of the most established combinations of entities.
{|class="wikitable"
!Terminology
!Entities used
|-
|Well-founded set
|(2a)
|-
|Well-founded nested list value
|(2b)(1)
|-
|Well-founded nested dictionary |
https://en.wikipedia.org/wiki/Simile%20%28disambiguation%29 | A simile is a figure of speech making an explicit comparison.
Simile or Similes may also refer to:
A term in music,
Similes (album), by Matthew Cooper
Simile (computer virus), a Windows virus,
SIMILE (Semantic Interoperability of Metadata and Information in unLike Environments), a project to develop semantic web tools
See also
Bulbophyllum simile, an orchid
Caenocara simile, a puffball beetle
Lucifuga simile, a Cuban fish
Trillium simile, a Jeweled wakerobin
Zygophyllum simile, an Australian herb
Facsimile
Similarity (disambiguation)
Semele (disambiguation)
Smile (disambiguation) |
https://en.wikipedia.org/wiki/Law%20firm%20network | A law firm network (law firm association or legal network) is a membership organization consisting of independent law firms. These networks are one type of professional services networks similar to networks found in the accounting profession. The common purpose is to expand the resources available to each member for providing services to their clients. Prominent primary law firm networks include CICERO League of International Lawyers, First Law International, Alliott Group (multidisciplinary), Lex Mundi, World Services Group (multidisciplinary), TerraLex, Meritas, Multilaw, The Network of Trial Law Firms, Inc., the State Capital Group, and Pacific Rim Advisory Council. The largest networks have more than 10,000 attorneys located in hundreds of offices worldwide.
The firms who are part of the networks may be formally or informally linked to one another depending upon the purpose of the network.
History of law firm networks
There are two different reasons for networks developing in the legal profession. The first reason is that law firms needed international connections due to globalization in the 1990s. The second reason is the expansion of many large United States firms to become "national". Smaller firms or firms with a niche practice requested expertise from these networks.
The internationalization of the legal profession began later than that of the accounting profession. Unlike accounting firms that conducted worldwide audits, law firms in each country were able to deal with national client matters. This changed in 1949, when Baker & McKenzie began to expand to non-United States markets to assist U.S. clients that were expanding overseas following WWII.
Internationalization was slow because the legal profession was more restrictive than accounting in allowing foreign firms to enter and practice in other countries. One of the requirements is that the names of the partners should be present in the name of the firm.
In the late 1980s, U.S. and English firms began establishing branches in the primary commercial centers. This new competition in local markets had the immediate effect of forcing local firms to evaluate alternative ways of providing services to their international clients.
The first international networks, called clubs, generally consisted of ten firms in different countries. The typical format was to hold several meetings a year among managing partners, to compare notes on management-related issues. They were secretive networks because the members feared losing business from other firms. On the other hand, they would advertise to their clients that they had foreign connections and correspondents. Today the clubs are commonly known as "best friends networks". Examples today are Leading Counsel Network and Slaughter & May.
The clubs evolved into networks in the 1980s. The networks were not secretive and published directories, materials, and brochures (Interlaw being one of the first examples). The members met annually. Some f |
https://en.wikipedia.org/wiki/Sevvapet%20Road%20railway%20station | Sevvapet Road railway station is one of railway stations of Chennai Central–Arakkonam section of the Chennai Suburban Railway Network. It serves the neighbourhoods of Sevvapet, Thiruvur, and Thozhuvur and is located west of Chennai Central. It has an elevation of above sea level.
History
The first lines in the station were electrified on 29 November 1979, with the electrification of the Chennai Central–Tiruvallur section. An agriculture research centre was located near railway station.
Neighbourhoods
The station has two villages on either side of the railway track. The village on the northern side of the station is named Thiruvur, and the one on the other side is Thozhuvur, with chiefly agricultural fields.
See also
Chennai Suburban Railway
References
External links
Sevvapet Road station at Indiarailinfo.com
Stations of Chennai Suburban Railway
Railway stations in Tiruvallur district |
https://en.wikipedia.org/wiki/N-Step-SCAN | N-Step-SCAN (also referred to as N-Step LOOK) is a disk scheduling algorithm to determine the motion of the disk's arm and head in servicing read and write requests.
It segments the request queue into subqueues of length N. Breaking the queue into segments of N requests makes service guarantees possible. Subsequent requests entering the request queue won't get pushed into N sized subqueues which are already full by the elevator algorithm.
As such, starvation is eliminated and guarantees of service within N requests is possible.
Another way to look at N-step SCAN is this: A buffer for N requests is kept. All the requests in this buffer are serviced in any particular sweep. All the incoming requests in this period are not added to this buffer but are kept up in a separate buffer. When these top N requests are serviced, the IO scheduler chooses the next N requests and this process continues. This allows for better throughput and avoids starvation.
Analysis
N-Step-SCAN along with FSCAN prevents "arm stickiness" unlike
SSTF, SCAN, and C-SCAN.
See also
Other variations include:
SCAN - Elevator Algorithm
FSCAN
LOOK (and C-LOOK)
References
Disk scheduling algorithms |
https://en.wikipedia.org/wiki/HP%20Compaq%20tc4400 | The HP Compaq TC4400 is a tablet-style personal computer. It can be used in the position of a normal laptop or the screen can be turned and folded down for writing.
Specifications
As with many manufactured tablets, there are multiple pre-configured models with various options, as well as the ability to customize a model. The following is a list of common specs on current models:
Pricing
As of November 2006, prices on pre-configured models range from US$1,449 to US$1,849. Creating a custom model can bring the price over US$3,000.
Notes
Further reading
Laptop Magazine's Review
Use of the Compaq at a suburban intermediate school
References
Compaq TC1100
Microsoft Tablet PC |
https://en.wikipedia.org/wiki/2006%20BCS%20computer%20rankings | In American college football, the 2006 BCS computer rankings are a part of the Bowl Championship Series (BCS) formula that determines who plays in the BCS National Championship Game as well as several other bowl games. Each computer system was developed using different methods which attempts to rank the teams' performance. For 2006, the highest and lowest rankings for a team are dropped and the remaining four rankings are summed. A team ranked #1 by a computer system is given 25 points, #2 is given 24 points and so forth. The summed values are then divided by 100 (the maximum value a team can earn if they received four first place votes that were summed). The values are then ranked by percentage. This percentage ranking is then averaged with the Coaches Poll and Harris Poll average rankings, each receiving equal weight, and the results become the BCS Rankings.
BCS computer rankings average
For 2006, the rankings were released beginning with the eighth week of the season on October 14. Data taken from official BCS website. There are missing values in the table because the BCS Rankings only list the top 25 of the BCS Rankings, providing data on how those teams achieved their top 25 ranking. The computers ranking may include teams that do not make the top 25 BCS Rankings once averaged with the AP and Coaches Polls.
Anderson & Hester
Jeff Anderson and Chris Hester are the owners of this computer system that has been a part of the BCS since its inception. The Anderson & Hester Rankings claim to be distinct in four ways:
These rankings do not reward teams for running up scores. Teams are rewarded for beating quality opponents, which is the object of the game. Margin of victory, which is not the object of the game, is not considered.
Unlike the AP and Coaches Polls, these rankings do not prejudge teams. These rankings first appear after the season's fifth week, and each team's ranking reflects its actual accomplishments on the field, not its perceived potential.
These rankings compute the most accurate strength of schedule ratings. Each team's opponents and opponents' opponents are judged not only by their won-lost records but also, uniquely, by their conferences' strength (see #4).
These rankings provide the most accurate conference ratings. Each conference is rated according to its non-conference won-lost record and the difficulty of its non-conference schedule.
The margin of victory was once allowed by the BCS for the computers, but was removed following the 2004 season. Therefore, all six computer systems do not include margin of victory. However, this computer system has never included it in its formula. In addition, only human polls (specifically the AP Poll and Coaches Poll in this reference) "prejudge" teams by releasing pre-season polls with the expected rankings of teams before they have played any games. The last two claims are subjective opinions by the authors of this computer system.
Billingsley
Richard Billingsley is the owner |
https://en.wikipedia.org/wiki/EAFP | EAFP may refer to:
It is easier to ask forgiveness than it is to get permission
In programming, it refers to a practice of performing a possibly illegal operation without checking first whether this operation would succeed, and then handling the possible error, instead of checking ahead of time. This reduces the risk of time of check to time of use errors. In particular, this practice is encouraged in the Python programming language.
European Association of Faculties of Pharmacy; See Faculty of Pharmacy, University of Lisbon
See also
European Academy of Facial Plastic Surgery (EAFPS); See Alexander Berghaus |
https://en.wikipedia.org/wiki/GenePattern | GenePattern is a freely available computational biology open-source software package originally created and developed at the Broad Institute for the analysis of genomic data. Designed to enable researchers to develop, capture, and reproduce genomic analysis methodologies, GenePattern was first released in 2004. GenePattern is currently developed at the University of California, San Diego.
Functionality
GenePattern is a powerful scientific workflow system that provides access to hundreds of genomic analysis tools. Use these analysis tools as building blocks to design sophisticated analysis pipelines that capture the methods, parameters, and data used to produce analysis results. Pipelines can be used to create, edit and share reproducible in silico results.
Project Objectives
Accessibility: Run over 200 regularly updated analysis and visualization tools (that support data preprocessing, gene expression analysis, proteomics, Single nucleotide polymorphism (SNP) analysis, flow cytometry, and next-generation sequencing) and create analytic workflows without any programming through a point and click user interface.
Reproducibility: Automated history and provenance tracking with versioning so that any user can share, repeat and understand a complete computational analysis
Extensibility: Computational users can import their methods and code for sharing using tools that support easy creation and integration
Multiple interfaces: Web browser, application, and programmatic interfaces make analysis modules and pipelines available to a broad range of users; public hosted server
Features
A regularly updated repository of hundreds of computational analysis modules that support data preprocessing, gene expression analysis, proteomics, single nucleotide polymorphism (SNP) analysis, flow cytometry, and short-read sequencing.
A programmatic interface that makes analysis modules available to computational biologists and developers from Python, Java, MATLAB, and R.
The GenePattern Notebook Environment: Built on the Jupyter Notebook environment, GenePattern Notebook allows researchers to run GenePattern analyses within notebooks that interleave text, graphics, and executable code, creating a single "research narrative."
GParc: Repository and community for GenePattern users to share and discuss their own GenePattern modules
Availability
GenePattern is available:
As a free public web application, hosted on Amazon Web Services. Users can create accounts, perform analyses, and create pipelines on the server.
As open-source software that can be downloaded and installed locally.
Public web servers hosted by other organizations.
Notes
References
The GenePattern Notebook Environment] Reich M, Tabor T, Liefeld T, Thorvaldsdóttir H, Hill B, Tamayo P, Mesirov JP. Cell Syst. 2017 Aug 23;5(2):149-151.e1. . Epub 2017 Aug 16. ; .
Integrative genomic analysis by interoperation of bioinformatics tools in GenomeSpace Qu K, Garamszegi S, Wu F, Thorvaldsdottir H, L |
https://en.wikipedia.org/wiki/MIDletPascal | MIDletPascal is a Pascal compiler and IDE specifically designed to create software for mobiles. It generates Java bytecode that runs on any Java ME device. In September 2009, Niksa Orlic, who wrote MIDletPascal, transmitted the source code to the Russian Boolean.name development community for feature development. MIDletPascal is now open-source, and hosted at SourceForge.
On 2 February 2013, MIDletPascal 3.5 Final released.
Features
generates low-level, small and fast Java bytecode
full Pascal specification support
parts of code can be written directly in Java
SMS messaging
HTTP connectivity
user-interface (forms) support
multimedia support
user-friendly IDE
Hello World
Because it runs on mobiles that don't have a console, the Hello world program of MIDletPascal is quite different from a normal Pascal "Hello World".
program HelloWorld;
begin
DrawText ('Hello, World!', 0, 0);
Repaint;
Delay(2000);
end.
See also
Midlet
References
Free integrated development environments
Pascal (programming language) compilers
Pascal programming language family |
https://en.wikipedia.org/wiki/Broadcast%20storm | A broadcast storm or broadcast radiation is the accumulation of broadcast and multicast traffic on a computer network. Extreme amounts of broadcast traffic constitute a broadcast storm. It can consume sufficient network resources so as to render the network unable to transport normal traffic. A packet that induces such a storm is occasionally nicknamed a Chernobyl packet.
Causes
Most commonly the cause is a switching loop in the Ethernet network topology (i.e. two or more paths exist between switches). A simple example is both ends of a single Ethernet patch cable connected to a switch. As broadcasts and multicasts are forwarded by switches out of every port, the switch or switches will repeatedly rebroadcast broadcast messages and flood the network. Since the layer-2 header does not support a time to live (TTL) value, if a frame is sent into a looped topology, it can loop forever.
In some cases, a broadcast storm can be instigated for the purpose of a denial of service (DOS) using one of the packet amplification attacks, such as the smurf attack or fraggle attack, where an attacker sends a large amount of ICMP Echo Requests (ping) traffic to a broadcast address, with each ICMP Echo packet containing the spoof source address of the victim host. When the spoofed packet arrives at the destination network, all hosts on the network reply to the spoofed address. The initial Echo Request is multiplied by the number of hosts on the network. This generates a storm of replies to the victim host tying up network bandwidth, using up CPU resources or possibly crashing the victim.
In wireless networks a disassociation packet spoofed with the source to that of the wireless access point and sent to the broadcast address can generate a disassociation broadcast DOS attack.
Prevention
Switching loops are largely addressed through link aggregation, shortest path bridging or spanning tree protocol. In Metro Ethernet rings it is prevented using the Ethernet Ring Protection Switching (ERPS) or Ethernet Automatic Protection System (EAPS) protocols.
Filtering broadcasts by Layer 3 equipment, typically routers (and even switches that employ advanced filtering called brouters).
Physically segmenting the broadcast domains using routers at Layer 3 (or logically with VLANs at Layer 2) in the same fashion switches decrease the size of collision domains at Layer 2.
Routers and firewalls can be configured to detect and prevent maliciously inducted broadcast storms (e.g. due to a magnification attack).
Broadcast storm control is a feature of many managed switches in which the switch intentionally ceases to forward all broadcast traffic if the bandwidth consumed by incoming broadcast frames exceeds a designated threshold. Although this does not resolve the root broadcast storm problem, it limits broadcast storm intensity and thus allows a network manager to communicate with network equipment to diagnose and resolve the root problem.
MANET broadcast storms
In a mobile a |
https://en.wikipedia.org/wiki/Disk%20sector | In computer disk storage, a sector is a subdivision of a track on a magnetic disk or optical disc. For most disks, each sector stores a fixed amount of user-accessible data, traditionally 512 bytes for hard disk drives (HDDs) and 2048 bytes for CD-ROMs and DVD-ROMs. Newer HDDs and SSDs use 4096-byte (4 KiB) sectors, which are known as the Advanced Format (AF).
The sector is the minimum storage unit of a hard drive. Most disk partitioning schemes are designed to have files occupy an integral number of sectors regardless of the file's actual size. Files that do not fill a whole sector will have the remainder of their last sector filled with zeroes. In practice, operating systems typically operate on blocks of data, which may span multiple sectors.
Geometrically, the word sector means a portion of a disk between a center, two radii and a corresponding arc (see Figure 1, item B), which is shaped like a slice of a pie. Thus, the disk sector (Figure 1, item C) refers to the intersection of a track and geometrical sector.
In modern disk drives, each physical sector is made up of two basic parts, the sector header area (typically called "ID") and the data area. The sector header contains information used by the drive and controller; this information includes sync bytes, address identification, flaw flag and error detection and correction information. The header may also include an alternate address to be used if the data area is undependable. The address identification is used to ensure that the mechanics of the drive have positioned the read/write head over the correct location. The data area contains the sync bytes, user data and an error-correcting code (ECC) that is used to check and possibly correct errors that may have been introduced into the data.
History
The first disk drive, the 1957 IBM 350 disk storage, had ten 100 character sectors per track; each character was six bits and included a parity bit. The number of sectors per track was identical on all recording surfaces. There was no recorded identifier field (ID) associated with each sector.
The 1961 IBM 1301 disk storage introduced variable length sectors, termed records or physical records by IBM, and added to each record a record address field separate from the data in a record. All modern disk drives have sector address fields, called ID fields, separate from the data in a sector.
Also in 1961 Bryant with its 4000 series introduced the concept of zoned recording (ZBR) which allowed the number of sectors per track to vary as a function of the track's diameter – there are more sectors on an outer track than on an inner track. In the late 1980s ZBR was again used in disk drives then announced by Imprimis and Quantum and by 1997 its industry usage was ubiquitous.
The disk drives and other DASDs announced with the IBM System/360 in 1964 used self-formatting variable length sectors, termed records or physical records by IBM. They detected errors in all fields of their records with a cy |
https://en.wikipedia.org/wiki/Network%20address | A network address is an identifier for a node or host on a telecommunications network. Network addresses are designed to be unique identifiers across the network, although some networks allow for local, private addresses, or locally administered addresses that may not be unique. Special network addresses are allocated as broadcast or multicast addresses. These too are not unique.
In some cases, network hosts may have more than one network address. For example, each network interface controller may be uniquely identified. Further, because protocols are frequently layered, more than one protocol's network address can occur in any particular network interface or node and more than one type of network address may be used in any one network.
Network addresses can be flat addresses which contain no information about the node's location in the network (such as a MAC address), or may contain structure or hierarchical information for the routing (such as an IP address).
Examples
Examples of network addresses include:
Telephone number, in the public switched telephone network
IP address in IP networks including the Internet
IPX address, in NetWare
X.25 or X.21 address, in a circuit switched data network
MAC address, in Ethernet and other related IEEE 802 network technologies
References
External links
Telecommunications engineering |
https://en.wikipedia.org/wiki/Many-sorted%20logic | Many-sorted logic can reflect formally our intention not to handle the universe as a homogeneous collection of objects, but to partition it in a way that is similar to types in typeful programming. Both functional and assertive "parts of speech" in the language of the logic reflect this typeful partitioning of the universe, even on the syntax level: substitution and argument passing can be done only accordingly, respecting the "sorts".
There are various ways to formalize the intention mentioned above; a many-sorted logic is any package of information which fulfils it. In most cases, the following are given:
a set of sorts, S
an appropriate generalization of the notion of signature to be able to handle the additional information that comes with the sorts.
The domain of discourse of any structure of that signature is then fragmented into disjoint subsets, one for every sort.
Example
When reasoning about biological organisms, it is useful to distinguish two sorts: and . While a function makes sense, a similar function usually does not. Many-sorted logic allows one to have terms like , but to discard terms like as syntactically ill-formed.
Algebraization
The algebraization of many-sorted logic is explained in an article by Caleiro and Gonçalves, which generalizes abstract algebraic logic to the many-sorted case, but can also be used as introductory material.
Order-sorted logic
While many-sorted logic requires two distinct sorts to have disjoint universe sets, order-sorted logic allows one sort to be declared a subsort of another sort , usually by writing or similar syntax. In the above biology example, it is desirable to declare
,
,
,
,
,
,
and so on; cf. picture.
Wherever a term of some sort is required, a term of any subsort of may be supplied instead (Liskov substitution principle). For example, assuming a function declaration , and a constant declaration , the term is perfectly valid and has the sort . In order to supply the information that the mother of a dog is a dog in turn, another declaration may be issued; this is called function overloading, similar to overloading in programming languages.
Order-sorted logic can be translated into unsorted logic, using a unary predicate for each sort , and an axiom for each subsort declaration . The reverse approach was successful in automated theorem proving: in 1985, Christoph Walther could solve a then benchmark problem by translating it into order-sorted logic, thereby boiling it down an order of magnitude, as many unary predicates turned into sorts.
In order to incorporate order-sorted logic into a clause-based automated theorem prover, a corresponding order-sorted unification algorithm is necessary, which requires for any two declared sorts their intersection to be declared, too: if and are variables of sort and , respectively, the equation has the solution , where .
Smolka generalized order-sorted logic to allow for parametric polymorphism.
In his framework, sub |
https://en.wikipedia.org/wiki/System%20Management%20Controller | The System Management Controller (SMC) is a subsystem of Intel and Apple processor-based Macintosh computers. It is similar in function to the older SMU or PMU of non-Intel Macintosh computers.
Overview
The SMC has roles in controlling thermal and power management, battery charging, video mode switching, sleep and wake, hibernation, and LED indicators. It also enables enforcement of the macOS End User License, allowing macOS to identify when it is running on non-Apple hardware.
See also
Embedded controller (EC)
Power management integrated circuit (PMIC)
Power Management Unit (PMU)
System Management Unit (SMU)
Apple T2
References
External links
EFI and SMC firmware updates for Intel-based Macs
Products introduced in 2006
Macintosh computers
Apple Inc. hardware |
https://en.wikipedia.org/wiki/Kumon | Kumon Institute Education Co. Ltd. is an educational network based in Japan and created by Toru Kumon. It uses his Kumon Method to teach mathematics and reading primarily for young students.
History
Kumon was founded by Toru Kumon, a Japanese educator, in July 1958, when he opened the first Kumon Maths Centre in Moriguchi, Osaka. Prior to creating the Kumon franchise, Kumon taught at Kochi Municipal High School and Tosa Junior/Senior High School. Inspired by teaching his own son, Takeshi, Kumon developed a curriculum focused on rote memorization.
Kumon initially grew slowly, only gaining 63,000 students over its first 16 years. However, in 1974, Kumon published a book titled The Secret of Kumon Math, leading to a doubling of its size in the next two years. Kumon opened their first United States locations in 1983, and by 1985, Kumon reached 1.4 million students.
Kumon soon added more educational subjects, leading them to change their name from Kumon Institute of Mathematics to Kumon Institute of Education. At this point, the first Kumon Logo was created. In 1985, Kumon's success lead to an increase in enrollments.
Kumon attracted national attention in the United States after it was implemented at Sumiton Elementary School, in Sumiton, Alabama. This was the first instance in which an American school integrated the Kumon Math Method into the regular K–4 mathematics curriculum. Sumiton continued to use the Kumon program through 2001, and influenced other schools to also adopt the Kumon method in their curriculum.
As of 2008, Kumon had over 26,000 centers around the globe with over 4 million registered students. As of 2018, there were 410,000 students enrolled in 2,200 centers across the United States.
Kumon introduced "Baby Kumon" in Japan in 2012, a tutoring program targeted for children between 1 and 2 years old. Baby Kumon hasn't been utilized in most Kumon Centres in other countries outside Japan. In North America, Kumon began a "Junior Kumon" program in 2001, targeted at children aged 2–5 years old.
Kumon method of learning
Kumon is an enrichment or remedial program, where instructors and assistants tailor instruction for individual students.
All Kumon programs are pencil-and-worksheet-based, with a digital program starting in 2023. The worksheets increase in difficulty in small increments. The program recommends that students study 30 minutes per subject on their own for five days of the week, and visit their local Kumon Center or attend a virtual class the other two days.
Psychologist Kathy Hirsh-Pasek claims that using such techniques, when used in 2, 3, and 4-year-olds, "does not give your child a leg up on anything". However, studies have shown a high percentage of efficacy.
Programs
Mathematics program
As a high school mathematics teacher, Mr. Kumon understood that an understanding of calculus was essential for Japanese university entrance exams so in writing worksheets for his son, Mr. Kumon focused on all the topics needed fo |
https://en.wikipedia.org/wiki/Riverfront%20Bike%20Trail | The Roy A. Battagello River Walk Bike Trail is the current backbone of the "Windsor Loop" bike trail network in Windsor, Ontario. The bike trail travels from the foot of the Ambassador Bridge (at Peter Street and Huron Church Road), to traffic lights at Riverside Drive and Lincoln Avenue (continuing as bike lanes to George Avenue and Wyandotte Street, for a total distance of ). This makes the trail the second-longest trail in the City of Windsor (the longest being the mostly-unpaved West Windsor Recreationway), at 8.0 km.
The trail travels through Windsor's downtown, and many of its parks, such as Dieppe Gardens. Many cities across North America (such as Detroit, Michigan, Toledo, Ohio, Toronto, Ontario, New York City, New York, and San Francisco, California) have expressed interest in similar riverfront parkland and bike trails, and many (such as Detroit) have already started construction on their own parks and trails. Throughout its history, the trail was repeatedly widened and upgraded, and even is paved with the original asphalt and cement used on the Ambassador Bridge. The trail has a posted speed limit of 20 km/h.
Start and end points
The bike trail starts officially at Peter Street and Huron Church Road, across the street from the University of Windsor. It crosses several streets via traffic lights, and ends at Lincoln Avenue and Riverside Drive at another pair of stoplights. It provides a very efficient and quick way of walking or biking across the city (or even as a downtown bypass). It continues down Riverside Drive as a pair of Bike Lanes, towards Strabane Avenue. However, between Riverside Drive/Huron Church Road, and Lincoln Avenue, there are NO stoplights, providing a very quick and effective way of travelling across the city. One feature found only on River Walk Bike Trail and the Ganatchio Trail are that they are wide-enough for three "lanes" each way, meaning three bicycles can drive abreast in each direction without worrying about a collision. It is along this part of the bike trail that the Odette Sculpture Garden is located.
Service centers
The Riverfront Trail is unique among the City of Windsor's Bike Trails, in having service centers along its route. There are five service centers along the trail. One is located at the intersection of Riverside Drive and Huron Church Roads, one at the foot of Askin Avenue, one at Bridge Avenue, one situated in front of Caesars Windsor and Civic Terrace, and one along the park and trail near the Hiram Walker/Canadian Club Distillery.
Connections with other trails
The Riverfront Trail currently connects to the Russell Street Neighbourhood Trail and the College Avenue Recreationway via Bike-Friendly Routes (sign-designated residential streets used as connectors, where cyclists have more safety than on busy arterial roads). The Russell Street Neighbourhood Trail will have a direct connection to the Riverfront Trail within the next 10 years. See the Expansion section below for more inform |
https://en.wikipedia.org/wiki/The%20Hot%20Hits%20Live%20from%20LA | The Hot Hits Live from LA was an Australian radio program on the Today Network, Southern Cross Media's Hit Music Stream, Ace Radio Network's Hit Music Stream (except TRFM) and other stations around Australia.
History
Kyle and Jackie O were the inaugural hosts of the show until 28 November 2009.
In November 2009, it was announced that Günsberg would replace Kyle and Jackie O as host of a new show, "The Hot Hits Live from LA", from Los Angeles. Kyle and Jackie O presented their final show on 28 November, with Günsberg taking over on 6 December with guests Snoop Dogg and Jared Leto.
In December 2012, Andrew Günsberg announced that he would be leaving the show after hosting the show for three years. Maude Garrett was announced as his replacement in January 2013 and Dave Styles signed on to co-host in late January.
In January 2015, Southern Cross Austereo announced the end of The Hot Hits Live from LA with the show replaced by "Planet Vevo", hosted by Dan & Maz.
References
External links
Authentic Entertainment
Australian music radio programs
Music chart shows |
https://en.wikipedia.org/wiki/Apple%20Paladin | The Paladin was a conceptual combination of a computer, fax machine, scanner, and telephone all-in-one designed by Apple Computer as a single office solution for a small business, as well as for use in hotel rooms for business travelers. It also went under the code name "Project X" during 1995.
It had a monochrome LCD screen and a phone handset attached to it (which fell off its hook too readily). Very few were prototyped and they are a rare find.
The system ran software called "Complete Office", which allowed the change between fax, phone, and PC all with the press of a button on the keypad. It also allowed for the user dial without needing to switch through multiple manual software protocols. By 1995 the engineers who had worked on the customized version of the OS were no longer working on the project making stability a major impediment.
Substantial conceptual work was done by the product design firm IDEO.
References
External links
Apple Inc. hardware |
https://en.wikipedia.org/wiki/Jennifer%20Niederst%20Robbins | Jennifer Niederst Robbins has been a web designer since 1993. She designed the web's first commercial site, O'Reilly's Global Network Navigator (GNN).
A graduate of the University of Notre Dame, Robbins is the author of Web Design in a Nutshell, Learning Web Design, and HTML and XHTML Pocket Reference. She has also written corporate identity style guides for clients such as Harcourt Publishing, Americanexpress.com, and OrangeImagineering.
Since 2000, Robbins has lived in Providence, Rhode Island, where she has worked as a freelance designer, teacher, lecturer and consultant through her company Littlechair, Inc. According to the O'Reilly Community site, "She has spoken at major design and Internet events including SXSW Interactive, Seybold Seminars, the GRAFILL conference (Geilo, Norway), and one of the first W3C International Expos." She has taught at Johnson & Wales University and at the Massachusetts College of Art.
References
External links
Littlechair Design, Inc, Robbins' professional site
Robbins' personal site
The Cooking with Rockstars site
Year of birth missing (living people)
Living people
Massachusetts College of Art and Design faculty
Artists from Akron, Ohio
Artists from Providence, Rhode Island
University of Notre Dame alumni
Web designers
Internet pioneers
Johnson & Wales University faculty
Women Internet pioneers
American women artists |
https://en.wikipedia.org/wiki/Cash%20and%20Carry%20%28game%20show%29 | Cash and Carry is an American television game show hosted by Dennis James that ran on the then-both affiliates of the DuMont Television Network from June 20, 1946, to July 1, 1947. This made it not only the sole program aired on Thursday nights by the network (although it moved to Tuesday nights in April), but also the first "network" television game show (all previous television games and quizzes were aired on only one station).
This series was sponsored by Libby's Foods, and produced by Art Stark, later producer of The Tonight Show Starring Johnny Carson from 1962 to 1969. The show was set in a supermarket, with contestants taking cans, which had questions for them to answer, off the shelves.
Format
In his book, The Forgotten Network: DuMont and the Birth of American Television, David Weinstein described Cash and Carry as an "early television adaptation of Truth or Consequences". James asked contestants questions attached to cans of the sponsor's products, with correct answers worth $5, $10, or $15. Other tasks were stunts, such as a husband and wife having to work together for a common goal (such as the wife, blindfolded, having to feed her husband).
Home viewers could call in during the show to guess what was hidden under a barrel.
Episode status
No episodes are known to exist, as almost all television broadcasts from the first year of United States network television are lost due to a lack of means to preserve such content. The known exceptions are a few episodes of Kraft Television Theatre from early 1947 which were made to test the kinescope process which allowed television series to be preserved.
Even after the kinescope process was created, many shows were still not regularly preserved until the late 1960s.
See also
List of programs broadcast by the DuMont Television Network
List of surviving DuMont Television Network broadcasts
1946-47 United States network television schedule
Supermarket Sweep
Shop 'til You Drop
Bibliography
David Weinstein, The Forgotten Network: DuMont and the Birth of American Television (Philadelphia: Temple University Press, 2004)
Alex McNeil, Total Television, Fourth edition (New York: Penguin Books, 1980)
Tim Brooks and Earle Marsh, The Complete Directory to Prime Time Network TV Shows, Third edition (New York: Ballantine Books, 1964)
References
External links
DuMont historical website
DuMont Television Network original programming
1940s American game shows
1946 American television series debuts
1947 American television series endings
Black-and-white American television shows
English-language television shows
Lost television shows |
https://en.wikipedia.org/wiki/Face%20to%20Face%20%28game%20show%29 | Face to Face was an American television game show. It began broadcasting on the NBC Television network on June 9, 1946, and ran until January 26, 1947, on Sundays at 8:00 pm EST, immediately before Geographically Speaking.
Overview
The concept of the show was for a cartoonist to make a drawing of a person whom he had never seen, based on a description given by other people. Originally, the unseen person was in another room. Later in the show, the person was moved onto the stage, separated from the artist by a curtain. This allowed the audience to see the person's face as the drawing took shape.
There were also quiz questions, in which participants had to identify people based on clues.
The show featured Eddie Dunn as the interviewer and Bob Dunn as the cartoonist. During the show's run, a woman only identified as "Sugar" joined the cast as "a kind of emcee".
Originating at WNBT-TV in New York City, Face to Face was sponsored by Standard Brands.
See also
1946-47 United States network television schedule
References
External links
1946 American television series debuts
1947 American television series endings
1940s American game shows
Black-and-white American television shows
English-language television shows
Face to Face |
https://en.wikipedia.org/wiki/VMware%20Workstation | VMware Workstation Pro (known as VMware Workstation until release of VMware Workstation 12 in 2015) is a hosted (Type 2) hypervisor that only runs on x64 versions of Windows and Linux operating systems. There used to be an x86-32 version for earlier versions for the software. It enables users to set up virtual machines (VMs) on a single physical machine and use them simultaneously along with the host machine. Each virtual machine can execute its own operating system, including versions of Microsoft Windows, Linux, BSD, and MS-DOS. VMware Workstation is developed and sold by VMware, Inc. There is a free-of-charge version called VMware Workstation Player (known as VMware Player until release of VMware Workstation 12 in 2015), for non-commercial use. An operating systems license is needed to use proprietary ones such as Windows. Ready-made Linux VMs set up for different purposes are available from several sources.
VMware Workstation supports bridging existing host network adapters and sharing physical disk drives and USB devices with a virtual machine. It can simulate disk drives; an ISO image file can be mounted as a virtual optical disc drive, and virtual hard disk drives are implemented as .vmdk files.
VMware Workstation Pro can save the state of a virtual machine (a "snapshot") at any instant. These snapshots can later be restored, effectively returning the virtual machine to the saved state, as it was and free from any post-snapshot damage to the VM.
VMware Workstation includes the ability to group multiple virtual machines in an inventory folder. The machines in such a folder can then be powered on and powered off as a single object, useful for testing complex client-server environments.
2016 company changes and future development
VMware Workstation versions 12.0.0, 12.0.1, and 12.1.0 were released at intervals of about two months in 2015. In January 2016 the entire development team behind VMware Workstation and Fusion was disbanded and all US developers were immediately fired. The company said that "the restructuring activities will not impact the existence of any current product lines", that "roles and responsibilities associated with particular businesses will be moved to other regions and office locations", and that investment would continue "with emphasis on our growth products". The future of Workstation and Fusion became uncertain. On 24 April 2016 maintenance release 12.1.1 was released. In September, same year, the company announced that "we’re very much alive and well". Consequently, on September 13 Workstation 12.5 and Fusion 8.5 were released as free upgrades which added support for Windows 10 Anniversary edition and Windows Server 2016. Since then versions 14 (in 2017, skipping number 13), 15 (in 2018), 16 (in 2020) and 17 (in 2022) were released.
Version history
Host OS support
Variants
There was a free VMware Player distinct from Workstation, with similar but reduced functionality, until VMware Player v7, Workstation v11. |
https://en.wikipedia.org/wiki/VMware%20ESXi | VMware ESXi (formerly ESX) is an enterprise-class, type-1 hypervisor developed by VMware for deploying and serving virtual computers. As a type-1 hypervisor, ESXi is not a software application that is installed on an operating system (OS); instead, it includes and integrates vital OS components, such as a kernel.
After version 4.1 (released in 2010), VMware renamed ESX to ESXi. ESXi replaces Service Console (a rudimentary operating system) with a more closely integrated OS. ESX/ESXi is the primary component in the VMware Infrastructure software suite.
The name ESX originated as an abbreviation of Elastic Sky X. In September 2004, the replacement for ESX was internally called VMvisor, but later changed to ESXi (as the "i" in ESXi stood for "integrated").
Architecture
ESX runs on bare metal (without running an operating system) unlike other VMware products. It includes its own kernel. In the historic VMware ESX, a Linux kernel was started first and then used to load a variety of specialized virtualization components, including ESX, which is otherwise known as the vmkernel component. The Linux kernel was the primary virtual machine; it was invoked by the service console. At normal run-time, the vmkernel was running on the bare computer, and the Linux-based service console ran as the first virtual machine. VMware dropped development of ESX at version 4.1, and now uses ESXi, which does not include a Linux kernel at all.
The vmkernel is a microkernel with three interfaces: hardware, guest systems, and the service console (Console OS).
Interface to hardware
The vmkernel handles CPU and memory directly, using scan-before-execution (SBE) to handle special or privileged CPU instructions
and the SRAT (system resource allocation table) to track allocated memory.
Access to other hardware (such as network or storage devices) takes place using modules. At least some of the modules derive from modules used in the Linux kernel. To access these modules, an additional module called vmklinux implements the Linux module interface. According to the README file, "This module contains the Linux emulation layer used by the vmkernel."
The vmkernel uses the device drivers:
net/e100
net/e1000
net/e1000e
net/bnx2
net/tg3
net/pcnet32
scsi/adp94xx
scsi/aic7xxx
scsi/aic79xx
scsi/ips
scsi/lpfcdd-v732
scsi/megaraid2
scsi/mptscsi_2xx
scsi/qla2200-v7.07
scsi/megaraid_sas
scsi/qla4010
scsi/qla4022
scsi/aacraid_esx30
scsi/lpfcdd-v7xx
scsi/qla2200-v7xx
These drivers mostly equate to those described in VMware's hardware compatibility list. All these modules fall under the GPL. Programmers have adapted them to run with the vmkernel: VMware Inc. has changed the module-loading and some other minor things.
Service console
In ESX (and not ESXi), the Service Console is a vestigial general purpose operating system most significantly used as bootstrap for the VMware kernel, vmkernel, and secondarily used as a management interface. Both of these Console Oper |
https://en.wikipedia.org/wiki/Coded%20Illusions | Coded Illusions was a computer game development company based in the Netherlands, founded in August 2005 after being a two-year hobby project. The company was abolished in September 2008.
Products
Though the company hasn't made official announcements yet, it is known that the company is currently working on a third-person action/adventure game for next-gen video game consoles.
The company's website currently lists a project called Nomos but the link leads back to the front page. The company's profile on Gamasutra names the game Haven, but this profile is older than the project page on the Coded Illusions website.
While no further details have been released by Coded Illusions, it appears playtesting for the game has begun early 2008.
Abolition
In September 2008, it was announced that Coded Illusions was closing and their employees would be laid off.
Continuing development
After the closure of Coded Illusions in October 2008, some of its former employees founded a new studio : Vertigo Games based in Rotterdam, the Netherlands.
Comments have been made by Vertigo Games about the possibility of the Nomos project being picked up again in the future.
References
Video game development companies
Defunct video game companies of the Netherlands |
https://en.wikipedia.org/wiki/Radio%20Mindanao%20Network | Radio Mindanao Network, Inc. (RMN), d.b.a. RMN Networks or RMN Network, is a Filipino media company based in Makati, Philippines. It is primarily involved is one of the largest radio networks. Its corporate office is located at the 4th Floor State Condominium I Bldg, Salcedo St., Legaspi Village, Makati, and its main headquarters are located at the RMN Broadcast Center (Canoy Bldg.), Don Apolinario Velez St., Cagayan de Oro.
The network's first radio station was DXCC (which also serves as the network's flagship station) established in Cagayan de Oro in Mindanao on August 28, 1952. The callsign has been supposed as a reference to the surnames of the business' founders (Canoy and Cui) but, according to founder Henry Canoy in his memoir, was actually chosen to mean Cagayan de Oro City.
History
Sometime in 1948, Don Henry R. Canoy, together with Robin Cui and Vicente Rivera, set up two home-built tube radio receivers bought from Fideng Palacio of Puntod and placed them in an abandoned chicken poultry house situated at the corner of Velez and del Pilar streets in Cagayan de Oro for the purpose of listening to radio broadcasts from Manila. Canoy and friends ended up listening to radio broadcasts at night when reception was better. Eventually, the friends were all convinced to build a radio transmitter of their own. The group managed to assemble a 30-Watt radio transmitter from surplus parts bought at Raon Street in Quiapo, Manila. Henry Canoy broke the airwaves as a Pirate radio station in 1949, declaring "This is Cagayan de Oro calling...". Because the broadcast was not authorized by the Radio Control Office (RCO), it did not contain call letters.
In 1950 Canoy, at the insistence of his brother, lawyer Reuben R. Canoy, decided to establish a more powerful radio station and applied for a congressional franchise in Manila to support its lawful operation. In 1951, he set up the fledgling station in partnership with Robin Cui, Max Suniel, Oscar Neri and Andres Bacal as equity partners with P10,000 in capital. on June 23, 1952, he was granted a permit to maintain and operate the radio broadcasting station.
Using the Radio Amateur's Handbook as their guide and also with surplus parts bought from Raon in Quiapo, Manila, they built their own 500-watt AM transmitter with the assistance from Far East Broadcasting Company engineers, American Dick Rowland and Byrd Bruneimer. The transmitter was transported to Mindanao aboard the boat MV Snug Hitch. With only a telescopic steel pole as antenna borrowed from the Bureau of Telecom, the improvised horizontal radio antenna was mounted by the team which include Ongkoy Padero, former vice president for engineering of CEPALCO, attaching one end of a copper wire to the pole and the other end to a 30 meters coconut tree a block away . While their first “transmitter building” was financed with a P5,000 “duck farm” loan from the Philippine National Bank. The Radio Control Office (RCO) headed by Mr Jose Viado, assigned th |
https://en.wikipedia.org/wiki/History%20of%20CP/CMS | This article covers the History of CP/CMS — the historical context in which the IBM time-sharing virtual machine operating system was built.
CP/CMS development occurred in a complex political and technical milieu.
Historical notes, below, provides supporting quotes and citations from first-hand observers.
Early 60s: CTSS, early time-sharing, and Project MAC
The seminal first-generation time-sharing system was CTSS, first demonstrated at MIT in 1961 and in production use from 1964 to 1974. It paved the way for Multics, CP/CMS, and all other time-sharing environments. Time-sharing concepts were first articulated in the late 50s, particularly as a way to meet the needs of scientific computing. At the time, computers were primarily used for batch processing — where jobs were submitted on punch cards, and run in sequence. Time-sharing let users interact directly with a computer, so that calculation and simulation results could be seen immediately.
Scientific users quickly embraced the concept of time-sharing, and pressured computer vendors such as IBM for improved time-sharing capabilities. MIT researchers spearheaded this effort, launching Project MAC, which was intended to develop the next generation of time-sharing technology and which would ultimately build Multics, an extremely feature-rich time-sharing system that would later inspire the initial development of UNIX. This high-profile team of leading computer scientists formed very specific technical recommendations and requirements, seeking an appropriate hardware platform for their new system. The technical problems were awesome. Most early time-sharing systems sidestepped these problems by giving users new or modified languages, such as Dartmouth BASIC, which were accessed through interpreters or restricted execution contexts. But the Project MAC vision was for shared, unrestricted access to general-purpose computing.
Along with other vendors, IBM submitted a proposal to Project MAC. However, IBM's proposal was not well received: To IBM's surprise, MIT chose General Electric as the Multics system vendor. The fallout from this event led directly to CP/CMS.
IBM and the System/360
In the early 60s, IBM was struggling to define its technical direction. The company had identified a problem with its past computer offerings: incompatibility between the many IBM products and product lines. Each new product family, and each new generation of technology, forced customers to wrestle with an entirely new set of technical specifications. IBM products incorporated a wide variety of processor designs, memory architectures, instruction sets, input/output strategies, etc. This was not, of course, unique to IBM. All computer vendors seemed to begin each new system with a "clean sheet" design. IBM saw this as both a problem and an opportunity. The cost of software migration was an increasing barrier to hardware sales. Customers could not afford to upgrade their computers, and IBM wanted to change this.
|
https://en.wikipedia.org/wiki/Naoyuki%20It%C5%8D | is a Japanese animator, storyboard artist, and director. Some of his major works directed include the first Kanon series released in 2002, and Digimon Data Squad, the latter of which had a run of 48 episodes in 2006–07. In 2015, he directed the anime adaptation of the Overlord novel series.
Filmography
Anime
References
External links
Naoyuki Ito anime works at Media Arts Database
Anime directors
Living people
Year of birth missing (living people)
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/Tracey%20Spicer | Tracey Leigh Spicer is an Australian newsreader, Walkley Award-winning journalist and social justice advocate. She is known for her association with Network Ten as a newsreader in the 1990s and 2000s when she co-hosted Ten Eyewitness News in Brisbane, Queensland. She later went on to work with Sky News Australia as a reporter and presenter from 2007 to 2015. In May 2017 Spicer released her autobiography, The Good Girl Stripped Bare. She was appointed as a Member of the Order of Australia "For significant service to the broadcast media as a journalist and television presenter, and as an ambassador for social welfare and charitable groups".
Early life and education
Spicer was born in Brisbane.
From 1980 to 1984, Spicer attended the private Soubirous and Frawley Colleges in bayside Scarborough, north of Brisbane. In 1987, Spicer graduated from the Queensland Institute of Technology with a Bachelor of Business (Communications) with a major in journalism.
Career
Spicer began her career at Macquarie National News providing reports to the Brisbane station 4BH, before moving to Melbourne radio station 3AW as morning news editor. Spicer moved on to television: first for the rural network, Southern Cross Television, and the Nine Network. The Network Ten station in Melbourne later hired Spicer as a local correspondent and then co-host of the First at Five News in Brisbane (with Glenn Taylor and Geoff Mullins). In 1995 she moved to Sydney to present the National Weekend News bulletins, and late night news until it was taken off air in 2005. Spicer remained with Network Ten until the end of 2006.
In late 2006, after 14 years with the network, Spicer was dismissed after returning from maternity leave when her second child was two months old. In a 10-page letter of demand served to Network Ten, Spicer claimed she had been discriminated against since giving birth to her first child in 2004. The case garnered attention in the media, with speculation she was fired because of her age; Network Ten strongly denied allegations of discrimination and said it was related to ongoing restructuring of the news division and related cost efficiencies. Spicer threatened to take the case to the Federal Court, but eventually settled with the network. She signed off for the final time on New Year's Eve 2006, beginning work with Sky News Australia four days later. Spicer worked as a Sky News presenter until leaving in 2015.
Spicer has hosted the Ethnic Business Awards, which is a national business award that highlights and celebrates migrant and Indigenous excellence in business, for 11 years in a row (2008-2018).
Spicer writes the Mama Holiday column for Traveller Magazine’s Sunday edition, focusing on family holidays. Spicer was previously a weekly op ed columnist with Wendy Harmer's The Hoopla from 2011 to 2015 and travel writer and ambassador for Holiday with Kids Magazine from 2009 to 2014. She was a columnist with the Daily Telegraph newspaper.
Since August 2015, |
https://en.wikipedia.org/wiki/Switching%20loop | A switching loop or bridge loop occurs in computer networks when there is more than one layer 2 path between two endpoints (e.g. multiple connections between two network switches or two ports on the same switch connected to each other). The loop creates broadcast storms as broadcasts and multicasts are forwarded by switches out every port, the switch or switches will repeatedly rebroadcast the broadcast messages flooding the network. Since the layer-2 header does not include a time to live (TTL) field, if a frame is sent into a looped topology, it can loop forever.
A physical topology that contains switching or bridge loops is attractive for redundancy reasons, yet a switched network must not have loops. The solution is to allow physical loops, but create a loop-free logical topology using link aggregation, shortest path bridging, spanning tree protocol or TRILL on the network switches.
Broadcasts
In the case of broadcast packets over a switching loop, the situation may develop into a broadcast storm.
In a very simple example, a switch with three ports A, B, and C has a normal node connected to port A while ports B and C are connected to each other in a loop. All ports have the same link speed and run in full duplex mode. Now, when a broadcast frame enters the switch through port A, this frame is forwarded to all ports but the source port, i.e. ports B and C. Both frames exiting ports B and C traverse the loop in opposite directions and reenter the switch through their counterpart port. The frame received on port B is then forwarded to ports A and C, the frame received on port C to ports A and B. So, the node on port A receives two copies of its own broadcast frame while the other two copies produced by the loop continue to cycle. Likewise, each broadcast frame entering the system continues to cycle through the loop in both directions, rebroadcasting back to the network in each loop, and broadcasts accumulate. Eventually, the accumulated broadcasts exhaust the egress capacity of the links, the switch begins dropping frames, and communication across the switch becomes unreliable or even impossible.
MAC database instability
Switching loops can cause misleading entries in a switch's media access control (MAC) database and can cause endless unicast frames to be broadcast throughout the network. A loop can make a switch receive the same broadcast frames on two different ports, and alternatingly associate the sending MAC address with the one or the other port. It may then incorrectly direct traffic for that MAC address to the wrong port, effectively causing this traffic to be lost, and even causing other switches to incorrectly associate the sender's address with a wrong port as well.
Multiple frame transmissions
In a redundant switched network it is possible for an end device to receive the same frame multiple times.
TTL
Routing loops are tempered by a time to live (TTL) field in layer-3 packet header; Packets will circulate the routing loop un |
https://en.wikipedia.org/wiki/TVSN | TVSN (an acronym for "Television Shopping Network") is an Australian and New Zealand broadcast, cable television and satellite television network specializing in home shopping. It is owned by parent company Direct Group Pty Ltd, a home marketing and shopping company based in the Sydney suburb of Frenchs Forest, which also owns sister channel Expo.
The channel broadcasts live every day from 08:30 to 21:30 AEST.
History
TVSN began broadcasting in 1995 from their Lane Cove, Sydney headquarters. It was soon listed on the Australian Stock Exchange in 1999 after sustaining some growth.
In 2004, the network was acquired by Innovations Direct Group Pty Ltd, an Australian-based home shopping company which produces a number of direct catalogue publications, including Innovations and Homecare magazines. Channel operations soon moved to new facilities in Frenchs Forest alongside the parent company.
Channels and livestreaming
Some Australian pay television services carry TVSN as part of their basic subscription package. These services include Foxtel, Austar and Optus TV. It was previously carried by Neighbourhood Cable. The channel is also available free to air via the Optus C1 satellite. In addition, the company's website and their TVSN Now app for Android TV, Samsung, LG and Apple TV broadcasts a live video stream of the channel.
On 24 September 2012, TVSN became available to free-to-air to metropolitan viewers after Network Ten and TVSN partnered to broadcast the channel as a datacast service on LCN 14. From December 2012-July 2016, regional Network Ten affiliate Southern Cross Ten broadcast the channel to regional viewers on LCN 54. At the same time, Southern Cross Austereo also broadcast TVSN on LCN 64 in Tasmania and LCN 74 in Darwin.
On 1 July 2016, Southern Cross Ten became part of Southern Cross Nine affiliated to the Nine Network, while WIN Television became the Network 10 affiliate. Consequently, TVSN would be broadcast on LCN 84 in regional Queensland, Southern New South Wales and ACT, Griffith, regional Victoria, Mildura, Tasmania, Eastern South Australia and regional Western Australia via WIN. Southern Cross Austereo used their old TVSN channel space to broadcast a New Zealand-based shopping channel, Yesshop, in their regional areas. The Yesshop channel became available on 1 August 2016 in Queensland, Southern NSW, ACT and Victoria on LCN 55; Northern NSW, Spencer Gulf and Broken Hill on LCN 54; Tasmania on LCN 64 and Darwin on LCN 74. However, Yesshop's owner (Yes Retail) made the decision to cease trading on 29 September 2016 citing lack of funds to pay wages and the company's current losses of approximately 20 million dollars. Employees were terminated the same day, and the channels were removed on Freeview later that day. Northern New South Wales and the Gold Coast, Darwin, Broken Hill, and the Spencer Gulf, relaunched TVSN on 20 December 2016 on the LCNs 57 and 75. Yesshop's channel space was replaced by American religious channel So |
https://en.wikipedia.org/wiki/MIT/GNU%20Scheme | MIT/GNU Scheme is a programming language, a dialect and implementation of the language Scheme, which is a dialect of Lisp. It can produce native binary files for the x86 (IA-32, x86-64) processor architecture. It supports the R7RS-small standard. It is free and open-source software released under v2 or later of the GNU General Public License (GPL). It was first released by Guy Lewis Steele Jr. and Gerald Jay Sussman at the Massachusetts Institute of Technology in 1986, as free software even before the Free Software Foundation, GNU, and the GPL existed. It is now part of the GNU Project.
It features a rich runtime software library, a powerful source code level debugger, a native code compiler and a built-in Emacs-like editor named Edwin.
The books Structure and Interpretation of Computer Programs and Structure and Interpretation of Classical Mechanics include software that can be run on MIT/GNU Scheme.
Edwin
Edwin is a built-in Emacs-like editor that comes with MIT/GNU Scheme. Edwin normally displays the *scheme* data buffer, the mode line, and the mini-buffer when it starts. As in Emacs, the mode line gives information like the name of the buffer above it and whether that buffer is read-only, modified, or unmodified.
Latin Phrases
When the user exits the interpreter, an exit message is printed. Possible messages include the following.
Quote from developer on Savannah (Gnu's forum site):"Originally, there was just one Latin message: moriturus te saluto: "I who am about to die salute you." It was added by Guillermo Rozas in reference to the phrase morituri te saltamus, "we who are about to die salute you," shouted to the Roman emperor by gladiators before they began to fight in an arena (Wikipedia). The idea is that the Scheme process, singular, salutes the user before dying. Much later, there was debate over the correctness of the conversion from third person to first person: bug report. We changed the verb ending, but I'm still not sure whether that was necessary."
References
External links
MIT/GNU Scheme page at MIT's AI Lab
Scheme (programming language) compilers
Scheme (programming language) interpreters
Scheme (programming language) implementations
GNU Project Lisp programming language implementations |
https://en.wikipedia.org/wiki/List%20of%20Unix%20commands | This is a list of Unix commands as specified by IEEE Std 1003.1-2008, which is part of the Single UNIX Specification (SUS). These commands can be found on Unix operating systems and most Unix-like operating systems.
This is not a comprehensive list of all utilities that existed in the various historic Unix and Unix-like systems, as it excludes utilities that were not mandated by the aforementioned standard.
List
See also
List of GNU Core Utilities commands
GNOME Core Applications
List of GNU packages
List of KDE applications
List of Unix daemons
List of web browsers for Unix and Unix-like operating systems
Unix philosophy
Footnotes
External links
IEEE Std 1003.1,2004 specifications
IEEE Std 1003.1,2008 specifications
Rosetta Stone For *Nix – configurable list of equivalent programs for *nix systems.
The Unix Acronym List: Unix Commands – explains the names of many Unix commands.
Unix programs
System administration |
https://en.wikipedia.org/wiki/Designer%20Castles | Designer Castles was a software title for the BBC Micro and later Acorn Archimedes (RISC OS based) range of computers.
The software produced by Data Design in Barnsley, England, UK allowed its users to design a medieval style- castle by means of a WIMP based design environment. In the design environment a number of pre-defined components, (For example, towers, walls and keeps) could be linked and manipulated to form a castle design. The components of the castle could then be printed (along with wall elevations and plans) so that a card model of the designed castle could be assembled.
The paper, glue and model making tools required for assembly were not supplied with any version of the package, although assembly instructions for components were provided in the extensive manual.
BBC Micro version
Designer Castles was first released in 1988 for BBC B/Master 128. The WIMP environment supported keyboard input and also allowed use of the mouse (such as AMX Mouse). The package consisted of a software disc together with a ring bound manual and ROM cartridge containing WIMP and dot-matrix printer support routines. Data Design targeted with the application educational market. Review in BBC Acorn User magazine praised features of Designer Castles, but criticized its high price.
The support ROM was named the PRINTWARE Support ROM. The term PRINTWARE was created by Peter Downs as a trade mark to cover the concept of software that was developed to enable designs to be sent to printers as 'nets' that could be cut out and folded to construct models.
Acorn Archimedes (RISC OS) version
A version of Designer Castles was released in 1991 for the Acorn Archimedes systems using RISC OS. Unlike the BBC Micro version, the program utilizes the existing RISC OS Wimp environment and printer routines without need for a separate support module. Archimedes release also introduced several enhancements of the user interface (colourful environment instead of black and white), on the other hand it was no longer possible to print small simplified view of the castle like in the BBC Micro version.
Additional spin-off titles
As well as Castles, the design environment was later adapted in a separate software title "Medieval Villages" to allow construction of medieval villages. Castle designs could be added to designs produced by this program.
A second additional title "Designer Environment" utilized the design environment for modern buildings, although it was not possible to add Castle designs to "villages" created with this software.
Data Design also released "Designer Logic" for drawing of logic gates.
The people behind Designer Castles
The Designer Castles idea was the brainchild of Peter Downs and the late Keith Swift . The original idea was to develop a "design, print, cut-out and assemble gymkhana". since both Peter and Keith had daughters it seemed a great idea, when they presented the idea to a commercial software company they were told that girls didn't use c |
https://en.wikipedia.org/wiki/Anomaly%20detection | In data analysis, anomaly detection (also referred to as outlier detection and sometimes as novelty detection) is generally understood to be the identification of rare items, events or observations which deviate significantly from the majority of the data and do not conform to a well defined notion of normal behaviour. Such examples may arouse suspicions of being generated by a different mechanism, or appear inconsistent with the remainder of that set of data.
Anomaly detection finds application in many domains including cyber security, medicine, machine vision, statistics, neuroscience, law enforcement and financial fraud to name only a few. Anomalies were initially searched for clear rejection or omission from the data to aid statistical analysis, for example to compute the mean or standard deviation. They were also removed to better predictions from models such as linear regression, and more recently their removal aids the performance of machine learning algorithms. However, in many applications anomalies themselves are of interest and are the observations most desirous in the entire data set, which need to be identified and separated from noise or irrelevant outliers.
Three broad categories of anomaly detection techniques exist. Supervised anomaly detection techniques require a data set that has been labeled as "normal" and "abnormal" and involves training a classifier. However, this approach is rarely used in anomaly detection due to the general unavailability of labelled data and the inherent unbalanced nature of the classes. Semi-supervised anomaly detection techniques assume that some portion of the data is labelled. This may be any combination of the normal or anomalous data, but more often than not the techniques construct a model representing normal behavior from a given normal training data set, and then test the likelihood of a test instance to be generated by the model. Unsupervised anomaly detection techniques assume the data is unlabelled and are by far the most commonly used due to their wider and relevant application.
Definition
Many attempts have been made in the statistical and computer science communities to define an anomaly. The most prevalent ones include the following, and can be categorised into three groups: those that are ambiguous, those that are specific to a method with pre-defined thresholds usually chosen empirically, and those that are formally defined:
Ill defined
An outlier is an observation which deviates so much from the other observations as to arouse suspicions that it was generated by a different mechanism.
Anomalies are instances or collections of data that occur very rarely in the data set and whose features differ significantly from most of the data.
An outlier is an observation (or subset of observations) which appears to be inconsistent with the remainder of that set of data.
An anomaly is a point or collection of points that is relatively distant from other points in multi-dimensional spa |
https://en.wikipedia.org/wiki/Membrana%20granulosa | The larger ovarian follicles consist of an external fibrovascular coat, connected with the surrounding stroma of the ovary by a network of blood vessels, and an internal coat, which consists of several layers of nucleated cells, called the membrana granulosa. It contains numerous granulosa cells.
At one part of the mature follicle the cells of the membrana granulosa are collected into a mass which projects into the cavity of the follicle. This is termed the discus proligerus.
References
External links
- "Female Reproductive System: ovary, cumulus oophorus"
- "Female Reproductive System: ovary, membrana granulosa"
Description at okstate.edu
Mammal female reproductive system |
https://en.wikipedia.org/wiki/Conservation%20Ontario | ' Conservation Ontario is the network of Ontario’s 36 Conservation Authorities.
Conservation Authorities are local, watershed management agencies that deliver services and programs that protect and manage water and other natural resources in partnership with government, landowners and other organizations
The 1946 Conservation Authorities Act provides the means by which the province and municipalities of Ontario could join to form a conservation authority within a specific area - the watershed - to undertake programs of natural resource management.
Conservation authorities are mandated to ensure the conservation, restoration and responsible management of Ontario's water, land and natural habitats through programs that balance human, environmental and economic needs. There are currently 36 conservation authorities in Ontario. Most management programs occur in parks known as conservation areas''.
Key areas of Authority activity include:
Environmental protection — Conservation authorities protect local ecosystems and contribute to the quality of life in communities throughout the province.
Water Resource Management — Conservation authorities are Ontario's community-based environmental experts who use integrated, ecologically sound environmental practices to manage Ontario's water resources on a watershed basis, maintain secure supplies of clean water, protect communities from flooding and contribute to municipal planning processes (that protect water). The organization issues report cards detailing surface water quality, groundwater quality, and forest conditions.
Ontario Conservation Authorities
Ausable Bayfield Conservation Authority
Cataraqui Region Conservation Authority
Catfish Creek Conservation Authority
Central Lake Ontario Conservation Authority
Conservation Halton
Credit Valley Conservation
Crowe Valley Conservation Authority
Essex Region Conservation Authority
Ganaraska Region Conservation Authority
Grand River Conservation Authority
Grey Sauble Conservation
Hamilton Conservation Authority
Kawartha Conservation
Kettle Creek Conservation Authority
Lake Simcoe Region Conservation Authority
Lakehead Region Conservation Authority
Long Point Region Conservation Authority
Lower Thames Valley Conservation Authority
Lower Trent Conservation
Maitland Valley Conservation Authority
Mattagami Region Conservation Authority
Mississippi Valley Conservation
Niagara Peninsula Conservation Authority
Nickel District Conservation Authority
North Bay-Mattawa Conservation Authority
Nottawasaga Valley Conservation Authority
Otonabee Conservation
Quinte Conservation
Raisin Region Conservation Authority
Rideau Valley Conservation Authority
Saugeen Conservation
Sault Ste. Marie Region Conservation Authority
South Nation Conservation
St. Clair Region Conservation Authority
Toronto and Region Conservation Authority
Upper Thames River Conservation Authority
See also
Conservation authority
Essex Region Conservation Auth |
https://en.wikipedia.org/wiki/WLAB | WLAB (88.3 MHz) is a non-commercial, listener-supported FM radio station in Fort Wayne, Indiana. It is owned by the Star Educational Media Network and broadcasts a Contemporary Christian radio format. It holds periodic on-air fundraisers to support the broadcasts.
WLAB has an effective radiated power (ERP) of 7,500 watts. In addition to its main transmitter at 88.3, it has FM translators in Kendallville (89.7 MHz), Auburn (99.9 MHz) and Warsaw (90.9 MHz). The station also simulcasts its programming on 91.3 FM WCKZ in Orland, Indiana, which expands the station's coverage area to include Angola and LaGrange, Indiana, and in Michigan, into Coldwater and Sturgis.
History
WLAB began broadcasting on . It was owned by the Indiana District of the Lutheran Church–Missouri Synod for 23 years until 2009, when it was sold to Star Educational Media Network. The station is still located on the campus of Concordia Theological Seminary, an LCMS seminary.
Also in 2009, STAR 88.3 was awarded Station of the Year (Small Market) by the Gospel Music Association as well as the Rob Gregory Award for Community Service in Ft. Wayne.
Programming
"Conversations", with Melissa Montana, airs Monday through Friday at 12:20 pm. Topics of conversation are directed toward mothers and generally include tips on marriage and parenting. Local events are also discussed.
"Keep The Faith" is a Sunday programming block featured on several radio stations. It is branded all-day Sunday, and features live talks at 7:00 am and 7:00 pm. STAR 88.3 DJ Don Buettner is the Associate Producer
The morning show features STAR DJs Brant and Sherri.
References
External links
Star 88.3 WLAB
LAB
Lutheran Church – Missouri Synod
Radio stations established in 1976
1976 establishments in Indiana
LAB |
https://en.wikipedia.org/wiki/WFCV%20%28AM%29 | WFCV (1090 AM) is a radio station located in Fort Wayne, Indiana, United States. It is one of a network of stations owned and operated by the Bott Broadcasting Company.
WFCV broadcasts a Christian radio format as a member of the Bott Radio Network. The station was assigned the WFCV call sign by the Federal Communications Commission on May 2, 1980.
The station debuted in 1968 as WFWR with a middle of the road music format, which was changed in 1971 to become the market's first country music station. Following a sale in 1976, the country format was changed to easy listening music, which continued until 1980, when Bott Broadcasting purchased WFWR and changed the calls to WFCV.
History of frequency
The 1090 kHz frequency in Fort Wayne was previously assigned to WFTW, which was a 1 kW daytime AM station owned by Fort Wayne Broadcasting, Incorporated. It began broadcasting August 10, 1947, with studios in the Purdue University Building, 220 E. Jefferson Street in Fort Wayne.
References
External links
WFCV official website
Bott Radio Network
FCC History Cards for WFCV
FCV
FCV
Allen County, Indiana
Radio stations established in 1968
Moody Radio affiliate stations
Bott Radio Network stations
1968 establishments in Indiana
FCV |
https://en.wikipedia.org/wiki/Oracle%20OLAP | The Oracle Database OLAP Option implements On-line Analytical Processing (OLAP) within an Oracle database environment. Oracle Corporation markets the Oracle Database OLAP Option as an extra-cost option to supplement the "Enterprise Edition" of its database. (Oracle offers Essbase for customers without the Oracle Database or who require multiple data-sources to load their cubes.)
As of Oracle Database 11g, the Oracle database optimizer can transparently redirect SQL queries to levels within the OLAP Option cubes. The cubes are managed and can take the place of multi-dimensional materialized views, simplifying Oracle data-warehouse management and speeding up query response.
Logical components
The Oracle Database OLAP Option offers:
an OLAP analytic engine
workspaces
an analytic workspace manager (AWM)
a worksheet environment
OLAP DML for DDL and DML
an interface from SQL
an analytic workspace Java API
a Java-based OLAP API
Physical implementation
The Oracle database tablespace CWMLITE stores OLAPSYS schema objects and integrates Oracle Database OLAP Option with the Oracle Warehouse Builder (OWB).
The CWMLITE name reflects the use of CWM — the Common Warehouse Metamodel, which Oracle Corporation refers to as "Common Warehouse Metadata".
See also
Business intelligence
Comparison of OLAP servers
Essbase
External links
Oracle OLAP, retrieved 2023-05-28
References
Oracle software
Online analytical processing |
https://en.wikipedia.org/wiki/Philip%20Elmer-DeWitt | Philip Elmer-DeWitt (born September 8, 1949) is an American writer and editor. He was Time first computer writer—producing much of the magazine's early coverage of personal computers and the Internet—and for 12 years its science editor. He is currently writing a daily blog about Apple Inc. called Apple 3.0.
Background
Elmer-DeWitt was born in Boston and raised in the Six Moon Hill neighborhood of Lexington, Massachusetts. He graduated from Oberlin College and studied English literature at the University of California, Berkeley and journalism at Columbia University. He worked as a computer programmer and technical writer for Bolt Beranek and Newman in the late '60s, wrote mathematical games for McGraw-Hill in the early 1970s and copy-edited textbooks and scientific monographs for Academic Press in the late '70s.
Career highlights
In 1978, writing as a freelance under the byline Philip Faflick in the Village Voice, Elmer-DeWitt published the first interview with Jean-Michel Basquiat. He joined TIME in 1979 and wrote nearly 500 stories for the magazine, including a dozen cover stories. He launched two sections—Computers and Technology—before being made a senior editor. He edited more than 150 Time cover stories, including the issues that named AIDS researcher David Ho Time's 1996 Man of the Year and Albert Einstein the Person of the Century. His interviews include Steve Jobs, Bill Gates, William Gibson, Elmore Leonard, and Anita Roddick. He was also the author of the controversial Cyberporn cover story. In commenting on that episode, Declan McCullagh excoriated Elmer-DeWitt for multiple "misrepresentations and errors," "logical fallacies," reporting in a "deceptive manner," and "[refusing] to acknowledge the many errors" in the story.
Elmer-DeWitt helped start TIME.com, and organized TIME -sponsored scientific conferences on genetics (2003), obesity (2004) and global health.
In January 2007, he joined Josh Quittner at Business 2.0, another Time Inc. publication, as that magazine's executive editor. In February, he launched a blog called Apple 2.0: Mac news from outside the reality distortion field. When Time Inc. folded Business 2.0 in September 2007, he worked briefly for Fortune magazine before retiring from Time Inc. in May 2008 to write full-time for the web, first for Fortune.com, then for himself. In 2014 he moved to Greenfield, Massachusetts, married the architect Margo Jones and was elected to the city council of his new hometown. He launched Apple 3.0, a blog for Apple investors, on April 1, 2016.
Select works from Time
The Rio Earth Summit
Sex in America
Obesity
Infertility
Bards of the Net
Microsoft
The Internet
References
External links
Interview on NPR One with Roben Farzad
Interview on The Pipeline with Dan Benjamin
Interview on The Critical Path with Horace Dediu
Interview on The Distraction
LinkedIn Profile
The Navigator: Elmer-DeWitt at Business 2.0
1949 births
American science journalists
American male j |
https://en.wikipedia.org/wiki/Enhanced%20mini-USB | An enhanced mini-USB (EMU) connector is a type of hybrid electrical connector which carries Universal Serial Bus data and power as well as other connections such as bidirectional audio. It was invented for and is mainly used on mobile phones. Motorola, HTC Corporation, and other mobile phone manufacturers use EMU connectors. There is more than one standard for EMU connectors, which are incompatible between manufacturers, but all are physically and electrically compatible with standard mini-USB connectors. The EMU connector has five pins for USB on one side. While regular USB connectors are empty on the other side, EMU has more pins intended for headsets. In HTC's version, two pins are for the microphone, three are for stereo sound, and one is for the push-to-talk switch.
In the CEA-936-A standard, there are no extra pins — the USB data pins are also used for RS-232 transmit and receive, stereo audio left and right, or for microphone and speaker/earpiece. Devices select which function the pins perform depending on user settings or on the context or mode in which the device is being operated. Two different functions cannot be used at once.
Using the connector may require a breakout cable or special headset. Most often, the user must buy a special adapter or pigtail to make the correct connections to a 2.5 mm TRS connector for a monophonic headset or 3.5 mm for stereo headphones. True breakout cables which provide all connections are unavailable, thus a phone cannot be charged at the same time as a headset or headphones are inserted, even for EMUs with extra pins.
Some mobile phone companies have used the extra pin "X" to enforce the use of their own battery chargers. Verizon Wireless is the first company to require first-party battery chargers, having colluded with Motorola to put an arbitrary 1.4 volts on pin X. This voltage violates the USB-IF standards, as pin X should either be tied to ground or not connected at all. Without this connection, the phone will refuse to charge, displaying "unauthorized charger" despite receiving the proper current. The phone will charge while connected to a personal computer only if the PC is running a special device driver.
Extra pins in hybrid mini-USB connectors are used as non-standard compliant way to provide USB 3.0 SuperSpeed connectivity as alternative to standard SuperSpeed micro-B and USB-C connectors.
References
External links
USB
Electrical connectors |
https://en.wikipedia.org/wiki/AGG | Agg or AGG may refer to:
As an acronym:
Anti-Grain Geometry, computer graphics rendering library
Aesthetic group gymnastics, gymnastics In a group
Abnormal grain growth, materials science phenomenon
Art Gallery of Guelph
AGG (programming language)
Attorney General of the Gambia
Attorney General of Georgia
Attorney General of Ghana
Attorney General of Gibraltar
Attorney General of Grenada
Attorney General of Guam
Attorney General of Guatemala
Attorney General of Guyana
Auditor-General of Ghana
As another abbreviation or symbol:
Angor language (ISO 639-3 code)
Arginine, an amino acid with codon AGG
iShares Core Total US Bond Market ETF, an exchange-traded fund
Tirofiban, trade name Aggrastat, an antiplatelet drug
People:
Alfred John Agg (1830–1886), Australian colonial public servant
Antonio Gandy-Golden (born 1998), American football player
Lily Agg (born 1993), Irish professional footballer
See also
Species aggregate, abbreviated "agg." |
https://en.wikipedia.org/wiki/Zarf%20%28disambiguation%29 | A zarf is an ornamental holder for hot coffee cups.
Zarf may also refer to:
Andrew Plotkin (born 1970), nicknamed Zarf, American computer programmer and game designer
Zarf (AMC) or Zoe Luper, a character from the American soap opera All My Children
ZARF, a US Air Force tiger team project that tested Multics security in 1973 |
https://en.wikipedia.org/wiki/Adversary%20model | In computer science, an online algorithm measures its competitiveness against different adversary models. For deterministic algorithms, the adversary is the same as the adaptive offline adversary. For randomized online algorithms competitiveness can depend upon the adversary model used.
Common adversaries
The three common adversaries are the oblivious adversary, the adaptive online adversary, and the adaptive offline adversary.
The oblivious adversary is sometimes referred to as the weak adversary. This adversary knows the algorithm's code, but does not get to know the randomized results of the algorithm.
The adaptive online adversary is sometimes called the medium adversary. This adversary must make its own decision before it is allowed to know the decision of the algorithm.
The adaptive offline adversary is sometimes called the strong adversary. This adversary knows everything, even the random number generator. This adversary is so strong that randomization does not help against it.
Important results
From S. Ben-David, A. Borodin, R. Karp, G. Tardos, A. Wigderson we have:
If there is a randomized algorithm that is α-competitive against any adaptive offline adversary then there also exists an α-competitive deterministic algorithm.
If G is a c-competitive randomized algorithm against any adaptive online adversary, and there is a randomized d-competitive algorithm against any oblivious adversary, then G is a randomized (c * d)-competitive algorithm against any adaptive offline adversary.
See also
Competitive analysis (online algorithm)
K-server problem
Online algorithm
References
External links
Bibliography of papers on online algorithms
Analysis of algorithms
Online algorithms |
https://en.wikipedia.org/wiki/Managed%20DirectX | Managed DirectX (MDX) is Microsoft's deprecated API for DirectX programming on .NET Framework. MDX can be used from any language on .NET Framework (via the Common Language Runtime). MDX can be used to develop multimedia and interactive applications (e.g. games, compiled only to x86), enabling high performance graphical representation and enabling the programmer to make use of modern graphical hardware while working inside the .NET Framework.
Overview
Managed DirectX was first released in 2002 to allow less complicated access to the DirectX API through the .NET framework. The Managed DirectX SDK allows developers access to numerous classes which allow the rendering of 3D graphics (Direct3D) and the other DirectX API's in a much easier, object-oriented manner. MDX, however, does not support the newer APIs such as Direct3D 10, XInput, and XAudio 2.
MDX is deprecated in favor of XNA Game Studio Express. It is, however, possible to use some other, more direct APIs to the DirectX framework such as the open-source SlimDX and SharpDX project.
Versions
MDX 1.1
This was the first version available and still is the current stable version.
Can be used under .NET Framework versions 1.1 and 2.0.
Provides an object-oriented API that implements functionality very similar to DirectX 9.
MDX 2.0 beta
Was canceled while still in beta. Is no longer available.
MDX 2.0 was replaced by Microsoft XNA (DirectX New Architecture).
The API differed from MDX 1.1 in a number of places.
External links
Microsoft Development Centre DirectX
MDX info
Managed DirectX with IronPython tutorial
Video game development software
DirectX
Microsoft development tools
2002 software |
https://en.wikipedia.org/wiki/Competitive%20analysis%20%28online%20algorithm%29 | Competitive analysis is a method invented for analyzing online algorithms, in which the performance of an online algorithm (which must satisfy an unpredictable sequence of requests, completing each request without being able to see the future) is compared to the performance of an optimal offline algorithm that can view the sequence of requests in advance. An algorithm is competitive if its competitive ratio—the ratio between its performance and the offline algorithm's performance—is bounded. Unlike traditional worst-case analysis, where the performance of an algorithm is measured only for "hard" inputs, competitive analysis requires that an algorithm perform well both on hard and easy inputs, where "hard" and "easy" are defined by the performance of the optimal offline algorithm.
For many algorithms, performance is dependent not only on the size of the inputs, but also on their values. For example, sorting an array of elements varies in difficulty depending on the initial order. Such data-dependent algorithms are analysed for average-case and worst-case data. Competitive analysis is a way of doing worst case analysis for on-line and randomized algorithms, which are typically data dependent.
In competitive analysis, one imagines an "adversary" which deliberately chooses difficult data, to maximize the ratio of the cost of the algorithm being studied and some optimal algorithm. When considering a randomized algorithm, one must further distinguish between an oblivious adversary, which has no knowledge of the random choices made by the algorithm pitted against it, and an adaptive adversary which has full knowledge of the algorithm's internal state at any point during its execution. (For a deterministic algorithm, there is no difference; either adversary can simply compute what state that algorithm must have at any time in the future, and choose difficult data accordingly.)
For example, the quicksort algorithm chooses one element, called the "pivot", that is, on average, not too far from the center value of the data being sorted. Quicksort then separates the data into two piles, one of which contains all elements with value less than the value of the pivot, and the other containing the rest of the elements. If quicksort chooses the pivot in some deterministic fashion (for instance, always choosing the first element in the list), then it is easy for an adversary to arrange the data beforehand so that quicksort will perform in worst-case time. If, however, quicksort chooses some random element to be the pivot, then an adversary without knowledge of what random numbers are coming up cannot arrange the data to guarantee worst-case execution time for quicksort.
The classic on-line problem first analysed with competitive analysis is the list update problem: Given a list of items and a sequence of requests for the various items, minimize the cost of accessing the list where the elements closer to the front of the list cost less to access. (Typ |
https://en.wikipedia.org/wiki/Adleman%E2%80%93Pomerance%E2%80%93Rumely%20primality%20test | In computational number theory, the Adleman–Pomerance–Rumely primality test is an algorithm for determining whether a number is prime. Unlike other, more efficient algorithms for this purpose, it avoids the use of random numbers, so it is a deterministic primality test. It is named after its discoverers, Leonard Adleman, Carl Pomerance, and Robert Rumely. The test involves arithmetic in cyclotomic fields.
It was later improved by Henri Cohen and Hendrik Willem Lenstra, commonly referred to as APR-CL. It can test primality of an integer n in time:
Software implementations
UBASIC provides an implementation under the name APRT-CLE (APR Test CL extended)
A factoring applet that uses APR-CL on certain conditions (source code included)
Pari/GP uses APR-CL conditionally in its implementation of isprime().
mpz_aprcl is an open source implementation using C and GMP.
Jean Penné's LLR uses APR-CL on certain types of prime tests as a fallback option.
References
APR and APR-CL
Primality tests |
https://en.wikipedia.org/wiki/Belle%20Black | Belle Black is a fictional character from Days of Our Lives, an American soap opera on the NBC network. Created by the head writer James E. Reilly, she was born on October 21, 1993, as the only child of supercouple John Black and Marlena Evans. She is also one-half of the supercouple Shawn Brady and Belle Black. Initially portrayed by several child actors between 1993 and 1999, Belle was rapidly aged to a teenager when Kirsten Storms took over the role from 1999 to 2004. Charity Rahmer briefly portrayed Belle for a month before being replaced by Martha Madison, who played the character from August 2004 to March 2008, when Belle departed the show. Madison returned as Belle for the soap's 50th Anniversary Celebrations in 2015 but departed the following year. Belle then appeared for various stints of different lengths before rejoining the regular cast again in 2020.
Casting
Initially portrayed by several child actors between 1993 and 1999, Belle was rapidly aged to a teenager when Kirsten Storms was hired to portray the character from August 5, 1999, to July 16, 2004. Charity Rahmer briefly played the role from July 19 to August 9, 2004. Martha Madison appeared in the role from August 10, 2004, to March 21, 2008. In June 2015, Madison confirmed she would reprise the role of Belle in November, as part of the show's fiftieth anniversary celebration. In March 2016, it was revealed that Madison was among four actors who have been let go from the soap, with Belle departing on September 12. However, on September 7, 2016, it was confirmed that Madison had been re-hired shortly following her firing and would remain on the soap indefinitely. Madison returned on January 24, 2017 and departed on February 20, 2017.
In July 2017, it was announced that Madison would return to the series. Madison returned from December 4, 2017 to March 27, 2018. Madison then appeared from August 21 to November 8, 2018. Madison then aired from March 18 to July 9, 2019.
In November 2019, it was announced that Madison would again reprise the role for the digital series, Last Blast Reunion. It was then announced in May 2020 that the character would once again return during the summer, with her return airing on June 8, 2020. In August 2023, Madison announced she would again exit the role.
Storylines
Belle is the daughter of John Black (Drake Hogestyn) and Dr. Marlena Evans (Deidre Hall). Originally, she is believed to be the daughter of Marlena and her husband, Roman Brady (Wayne Northrop). Belle, however, is the product of an affair between Marlena and John. Roman and Marlena's daughter, Sami Brady (Alison Sweeney), becomes aware of the affair, and purposely changes the paternity test. After Belle is born, Sami kidnaps her and tries to sell her on the black market. John thwarts her, and rescues Belle. At Belle's christening, Marlena and John's affair is revealed, and Stefano DiMera (Joseph Mascolo) later reveals the truth of Belle's paternity through Sami's diary.
As a teen at |
https://en.wikipedia.org/wiki/DYXX | DYXX is a callsign once shared by two Philippines broadcast stations traditionally associated with GMA Network in Iloilo City:
DYXX, 1323 kHz AM, the original callsign for what is now radio station DYSI
DYXX-TV, TV channel 6 |
https://en.wikipedia.org/wiki/Christine%20L.%20Borgman | Christine L. Borgman is Distinguished Professor and Presidential Chair in Information Studies at UCLA. She is the author of more than 200 publications in the fields of information studies, computer science, and communication. Two of her sole-authored monographs, Scholarship in the Digital Age: Information, Infrastructure, and the Internet (MIT Press, 2007) and From Gutenberg to the Global Information Infrastructure: Access to Information in a Networked World (MIT Press, 2000), have won the Best Information Science Book of the Year award from the American Society for Information Science and Technology. She is a lead investigator for the Center for Embedded Networked Sensing (CENS), a National Science Foundation Science and Technology Center, where she conducts data practices research. She chaired the Task Force on Cyberlearning for the NSF, whose report, Fostering Learning in the Networked World, was released in July 2008. Prof. Borgman is a Fellow of the American Association for the Advancement of Science (AAAS), a Legacy Laureate of the University of Pittsburgh, and is the 2011 recipient of the Paul Evan Peters Award from the Coalition for Networked Information, Association for Research Libraries, and EDUCAUSE. The award recognizes notable, lasting achievements in the creation and innovative use of information resources and services that advance scholarship and intellectual productivity through communication networks. She is also the 2011 recipient of the Research in Information Science Award from the American Association of Information Science and Technology. In 2013, she became a fellow of the Association for Computing Machinery.
Borgman leads the Center for Knowledge Infrastructures (CKI) located in the UCLA Department of Information Studies. CKI conducts research on scientific data practices and policy, scholarly communication, and sociotechnical systems.
She is a member of the U.S. National Academies’ Board on Research Data and Information and the U.S. National CODATA (Committee on Data for Science and Technology), the Strategic Advisory Board to Thomson-Reuters Scholarly Research, the advisory board to the Electronic Privacy Information Center, and Member-at-Large for Section T (Information, Computing, and Communication) of the AAAS. At UCLA, she chairs the Information Technology Planning Board. Previous service includes chairing Section T of the AAAS, and membership on the Science Advisory Board to Microsoft Corporation, the Board of Directors of the Council on Library and Information Resources, and the advisory board to the Computer & Information Science & Engineering Directorate of the National Science Foundation, and the Association for Computing Machinery Public Policy Council.
Borgman is a frequent speaker at conferences and university events. Recent keynotes and plenary presentations include the Oxford Internet Institute's 10th anniversary conference, A Decade in Internet Time, the International Conference on Asian Digital Libra |
https://en.wikipedia.org/wiki/Internet%20Freedom%20and%20Nondiscrimination%20Act%20of%202006 | The Internet Freedom and Nondiscrimination Act of 2006 is a bill in the United States House of Representatives. It is one of several bills on the topic of network neutrality proposed as part of a major overhaul of the Telecommunications Act of 1996. The Act is sponsored by Rep. James Sensenbrenner (R-WI), Rep. John Conyers (D-MI), Rep. Rick Boucher (D-VA), Rep. Zoe Lofgren (D-CA), Rep. Robert Andrews (D-NJ), and Rep. Pete Visclosky (D-IN).
The legislation was approved 20-13 by the House Judiciary committee on May 25, 2006, but was never taken up on the floor of the U.S. House of Representatives, and therefore failed to become law.
Overview
The "Internet Freedom and Nondiscrimination Act of 2006" has the stated purpose of the promoting competition, facilitating trade, and ensuring competitive and non discriminatory access to the internet (see net neutrality). It proposes a change in the Clayton Antitrust Act to prohibit certain kinds of discrimination by broadband network providers. Specifically, the Act would make it unlawful for any broadband network provider to discriminate against any content, applications, or services, or to refuse to connect to other broadband providers. It would also make it unlawful for any broadband provider to restrict the sending or receiving of lawful conduct, to charge premiums for unrestricted access to lawful content, and to fail to disclose any terms, conditions, or limitations on the service it provides. Additionally, the Act would require any prioritization or enhanced quality of service to certain types of data to apply to all data of that type, regardless of the origin of such data, without imposing a surcharge for the enhanced service.
Notes
References
Library of Congress. House Report 109-541 – 29 June 2006
Library of Congress. H.R. 5417 – All Congressional Actions
External links
Full text of the “Internet Freedom and Nondiscrimination Act of 2006” (pdf)
WashingtonWatch.com page on H.R. 5417
Supporters
SavetheInternet.com
HearUsNow.org
Internet law in the United States
Net neutrality
Telecommunications in the United States
United States federal computing legislation
2006 in technology
Proposed legislation of the 109th United States Congress
May 2006 events in the United States |
https://en.wikipedia.org/wiki/Function%20representation | Function Representation (FRep or F-Rep) is used in solid modeling, volume modeling and computer graphics. FRep was introduced in "Function representation in geometric modeling: concepts, implementation and applications" as a uniform representation of multidimensional geometric objects (shapes). An object as a point set in multidimensional space is defined by a single continuous real-valued function of point coordinates which is evaluated at the given point by a procedure traversing a tree structure with primitives in the leaves and operations in the nodes of the tree. The points with belong to the object, and the points with are outside of the object. The point set with is called an isosurface.
Geometric domain
The geometric domain of FRep in 3D space includes solids with non-manifold models and lower-dimensional entities (surfaces, curves, points) defined by zero value of the function. A primitive can be defined by an equation or by a "black box" procedure converting point coordinates into the function value. Solids bounded by algebraic surfaces, skeleton-based implicit surfaces, and convolution surfaces, as well as procedural objects (such as solid noise), and voxel objects can be used as primitives (leaves of the construction tree). In the case of a voxel object (discrete field), it should be converted to a continuous real function, for example, by applying the trilinear or higher-order interpolation.
Many operations such as set-theoretic, blending, offsetting, projection, non-linear deformations, metamorphosis, sweeping, hypertexturing, and others, have been formulated for this representation in such a manner that they yield continuous real-valued functions as output, thus guaranteeing the closure property of the representation. R-functions originally introduced in V.L. Rvachev's "On the analytical description of some geometric objects", provide continuity for the functions exactly defining the set-theoretic operations (min/max functions are a particular case). Because of this property, the result of any supported operation can be treated as the input for a subsequent operation; thus very complex models can be created in this way from a single functional expression. FRep modeling is supported by the special-purpose language HyperFun.
Shape Models
FRep combines and generalizes different shape models like
algebraic surfaces
skeleton based "implicit" surfaces
set-theoretic solids or CSG (Constructive Solid Geometry)
sweeps
volumetric objects
parametric models
procedural models
A more general "constructive hypervolume" allows for modeling multidimensional point sets with attributes (volume models in 3D case). Point set geometry and attributes have independent representations but are treated uniformly. A point set in a geometric space of an arbitrary dimension is an FRep based geometric model of a real object. An attribute that is also represented by a real-valued function (not necessarily continuous) is a mathematical model of |
https://en.wikipedia.org/wiki/Riemann%20form | In mathematics, a Riemann form in the theory of abelian varieties and modular forms, is the following data:
A lattice Λ in a complex vector space Cg.
An alternating bilinear form α from Λ to the integers satisfying the following Riemann bilinear relations:
the real linear extension αR:Cg × Cg→R of α satisfies αR(iv, iw)=αR(v, w) for all (v, w) in Cg × Cg;
the associated hermitian form H(v, w)=αR(iv, w) + iαR(v, w) is positive-definite.
(The hermitian form written here is linear in the first variable.)
Riemann forms are important because of the following:
The alternatization of the Chern class of any factor of automorphy is a Riemann form.
Conversely, given any Riemann form, we can construct a factor of automorphy such that the alternatization of its Chern class is the given Riemann form.
References
Abelian varieties
Bernhard Riemann |
https://en.wikipedia.org/wiki/DBN | DBN may refer to:
Computer science
Deep belief network
Dynamic Bayesian network
Other uses
DBN (band), a German dance music trio
1,5-Diazabicyclo(4.3.0)non-5-ene, a chemical
See also
DBN1, a gene (and neuron growth protein) |
https://en.wikipedia.org/wiki/Judson%20Rosebush | Judson Rosebush (b. October 1, 1947, Wooster, Ohio) is a director and producer of multimedia products and computer animation, an author, artist and media theorist. He is the founder of Digital Effects Inc. and the Judson Rosebush Company. He is the former editor of Pixel Vision magazine, the serialized Pixel Handbook, and a columnist for CD-ROM Professional magazine. He has worked in radio and TV, film and video, sound, print, and hypermedia, including CD-ROM and the Internet. He has been an ACM National Lecturer since the late 1980s and is a recipient of its Distinguished Speaker Award.
Rosebush graduated from the College of Wooster in 1969 and received a Ph.D. from Syracuse University in 1984.
Career
.
Rosebush began working in computer animation in 1970, founding the company Digital Effects Inc. in New York City in 1978. As the first 3D digital computer animation company in New York, Digital Effects had to pioneer its own software. In 1986, two years after Digital Effects ceased operations, Rosebush founded the Judson Rosebush Company. Formerly located in Carnegie Hall, the company produces consumer CD-ROMs, business-to-business CD-ROMs and websites.
Rosebush's television credits include directing over 1000 commercials and logos for advertising agencies and networks worldwide; feature film credits include Walt Disney's Tron.
In the early 1990s, Rosebush co-authored and directed television programs on Volume Visualization and HDTV and the Quest for Virtual Reality. He participated on FCC working groups on HDTV. In the late 1990s, he was drafted to collect and write histories about computer graphics, including the feature film The Story of Computer Graphics.
Rosebush is a consultant for media technology companies in America, Europe, and Brazil. He assisted Hammond Map in designing their digital mapping system, worked with Oxberry Corporation to install the first digital motion picture scanners in New York and Beijing, and has performed expert witness work in Federal Court. He has also taught courses in computer graphics at Syracuse University, the School of Visual Arts, New York; Pratt Institute, Brooklyn; and Mercy College, Dobbs Ferry, New York.
Rosebush has exhibited computer-generated drawings and films in numerous museum shows, and the drawings have been reproduced in hundreds of magazines and books.
His most cited writings include "The Proceduralist Manifesto", a statement on computer art published in Leonardo; he is also known for his writings on computer graphics and new media. More popular credits include articles in The Village Voice and Rolling Stone Magazine.
Select published CDs
Isaac Asimov's The Ultimate Robot, published by Byron Preiss and Microsoft, 1993
Gahan Wilson's The Ultimate Haunted House, Microsoft, 1994
Ocean Voyager, The Smithsonian and Times Mirror Magazines, 1995
The War in Vietnam, a joint venture between CBS News and The New York Times, distributed by MacMillan Digital, 1996
Look What I See, the |
https://en.wikipedia.org/wiki/TI-990 | The TI-990 was a series of 16-bit minicomputers sold by Texas Instruments (TI) in the 1970s and 1980s. The TI-990 was a replacement for TI's earlier minicomputer systems, the TI-960 and the TI-980. It had several unique features, and was easier to program than its predecessors.
Among its core concepts was the ability to easily support multiprogramming using a software-switchable set of processor registers that allowed it to perform rapid context switches between programs. This was enabled through the use of register values stored in main memory that could be swapped by changing a single pointer.
TI later implemented the TI-990 in a single-chip implementation, the TMS9900, among the first 16-bit microprocessors. Intended for use in low-end models of the TI-990, it retained the 990's memory model and main memory register system. This design was ultimately much more widely used in the TI-99/4A, where details of its minicomputer-style memory model presented significant disadvantages.
Features
Workspaces
On the TI-990, registers are stored in memory and are referred to through a hard register called the Workspace Pointer. The concept behind the workspace is that main memory was based on the new semiconductor RAM chips that TI had developed and ran at the same speed as the CPU. This meant that it didn't matter if the "registers" were real registers in the CPU or represented in memory. When the Workspace Pointer is loaded with a memory address, that address is the origin of the "registers."
There are three hard registers in the 990; the Workspace Pointer (WP), the Program Counter (PC) and the Status register (ST). A context switch entailed the saving and restoring of only the hard registers.
Extended operation
The TI-990 had a facility to allow extended operations through the use of plug in hardware. If the hardware is not present the CPU traps to allow software to perform the function. The operation code (XOP) allowed for 15 attached devices on a system. Although, device 15 is reserved, by convention, to be used as the systems call entry for user programs to request systems services.
Orthogonal instruction set
The TI-990 used a fairly orthogonal instruction set. The basic instruction formats allowed for one, two and three word instructions. The model 990/12 CPU allowed for a four word instruction with the extended mode operations.
Architectural details
General register addressing modes
(R is a general register, 0 to 15.)
0. Register - the value is to or from a register: OPR R ; R contains operand
1. Indirect register - register is used as a memory address to read or write: OPR *R ; R contains address
2. Indexed: OPR @MEM(R); R contains index value, R0 is not used in indexing and allows direct memory addressing
3. Autoincrement: OPR *R+ ; R contains address of address, then increment R by the length of the operand type
Several registers had special usages that reserve their use, the register and their usages are:
R0 - shift counter, extended |
https://en.wikipedia.org/wiki/Telemetry%20intelligence | Telemetry intelligence (TELINT) is a subdiscipline of FISINT which is concerned with missiles and other remotely monitored devices sending back continuous streams of data about their location, speed, engine status and other metrics. This data can provide information on the performance of the missile and especially its throw-weight, i.e. the potential size of its warheads.
Strategic significance of TELINT
TELINT is one of the "national means of technical verification" mentioned, but not detailed, in the Strategic Arms Limitation Treaty (SALT) between the US and USSR. The SALT I treaty language "the agreements include provisions that are important steps to strengthen assurance against violations: both sides undertake not to interfere with national technical means of verification. In addition, both countries agree not to use deliberate concealment measures to impede verification." refers to, in part, a technical agreement not to encrypt strategic test telemetry and thus impede verification by TELINT.
See also
SIGINT
ELINT
COMINT
FISINT
References
Signals intelligence |
https://en.wikipedia.org/wiki/DX10 | DX10 was a general purpose international, multitasking operating system designed to operate
with the Texas Instruments 990/10, 990/10A and 990/12 minicomputers using the memory mapping feature.
The Disk Executive Operating System (DX10)
DX10 was a versatile disk-based operating system capable of supporting a wide
range of commercial and industrial applications.
DX10 was also a multiterminal system capable of making each of several users
appear to have exclusive control of the system.
DX10 was an international operating system designed to meet the commercial
requirements of the United States, most European countries, and Japan.
DX10 supported several models of video display terminals (VDTs), most of which
permit users to enter, view, and process data in their own language.
DX10 Capabilities
DX10 required a basic hardware configuration, but allows additional members of
an extensive group of peripherals to be included in the configuration.
During system generation, the user could configure DX10 to support peripheral devices
that are not members of the 990 family and devices that require realtime
support.
This capability required that the user also provide software control for these
devices.
The user communicated with DX10 easily through the System Command Interpreter (SCI).
SCI was designed to provide simple, convenient interaction between the user and
DX10 in a conversational format.
Through SCI the user had access to complete control of DX10.
SCI was flexible in its mode of communication.
While SCI is convenient for interactive communication through a data terminal,
SCI can be accessed in batch mode as well.
DX10 was capable of extensive file management.
The built-in file structures include key indexed files, relative record files,
and sequential files.
A group of file control utilities exists for copying and modifying files, and
controlling file parameters.
DX10 Features
DX10 offered a number of features that provide convenient use of the minicomputers system capabilities:
Easy system generation for systems with custom device configurations. With proper preparation, peripheral devices that are not part of the 990 computer family can be interfaced through DX10.
A macro assembler for translating assembly language programs into executable machine code.
A text editor for entering source code or data into accessible files.
Support of high-level languages, including Fortran, COBOL, Pascal, RPG II, and BASIC.
A link editor and extended debugging facilities are provided to further support program development.
References
External links
Dave Pitts' TI 990 page — Includes a simulator and DX10 Operating System images.
Proprietary operating systems
Texas Instruments |
https://en.wikipedia.org/wiki/Curtis%20Johnson | Curtis Johnson may refer to:
Curt Johnson (soccer) (born 1968), soccer manager
Curt Johnson, the creator of the Microsoft Minesweeper computer game
Curtis Johnson (cornerback) (born 1948), former cornerback
Curtis Johnson (linebacker) (born 1985), American football player
Curtis Johnson (politician) (born 1952), American politician
Curtis Johnson (American football coach) (born 1961), football coach
Curtis Johnson (athlete) (born 1973), American athlete
S. Curtis Johnson, business magnate
Dan Curtis Johnson, programmer and comic book writer
See also
Samuel Curtis Johnson (disambiguation)
Kirk Johnson (born 1972), Canadian boxer |
https://en.wikipedia.org/wiki/IP%20over%20DVB | IP over DVB implies that Internet Protocol datagrams are distributed using some digital television system, for example DVB-H, DVB-SH, DVB-T, DVB-S, DVB-C or their successors like DVB-T2, DVB-S2, and DVB-C2. This may take the form of IP over MPEG, where the datagrams are transferred over the MPEG transport stream, or the datagrams may be carried in the DVB baseband frames directly, as in GSE.
Application examples
Data broadcast (datacast), for example a data carousel sending programme information and media over and over again.
IP multicast, for sending media efficiently to a limited group of subscribing users, using only the transmitter towers where users for the moment are situated.
interactive TV services
To provide internet access by utilizing the DVB system as a broadband downlink, in combination with some narrow-band duplex system. Examples:
Satellite Internet access, e.g. to buildings in the countryside, using a telephone modem as the back-channel
Broadband Internet access to trains
Mobile broadband internet access to cellular phones including a mobile TV receiver, for example a DVB-H receiver.
Return channels
All services except the first requires some kind of return channel.
DVB-RCT (DVB Return Channel Terrestrial)
DVB-RCS (DVB Return Channel via Satellite)
Dial-up modems
ADSL
VDSL
Cable modems
2.5G
2.75G (also called E)
2.875G (also called E+)
3G
3G+ (also called H)
HSPA+ (also called H+)
4G
4G+
5G
Protocols for IP over DVB base band frames
Generic Stream Encapsulation (GSE), ETSI TS 102 606: "Digital Video Broadcasting (DVB); Generic Stream Encapsulation (GSE) Protocol", European Telecommunications Standard Institute (ETSI)
Protocols for IP over MPEG transport stream
MPEG Multiprotocol encapsulation (MPE), or ETSI-DAT. EN 301 192, "Specifications for Data Broadcasting", European Telecommunications Standards Institute(ETSI), 2004.
MPEG Unidirectional Lightweight Encapsulation (ULE) (RFC 4326)
Unidirectional link (UDE)
DVB-H IP datacasting IPDC
DVB-IPTV
DVB-IPTV is an open DVB standard that enables Audio/Video services to be delivered to and through the home via Internet Protocol networking. DVB-IPTV was formerly known as DVB-IPI.
See also
DVB-MHP (Multimedia Home Platform)
External links
DVB Specifications (Standards & BlueBooks)
Interactive television
Digital Video Broadcasting |
https://en.wikipedia.org/wiki/Chartplotter | A Chartplotter is a device used in marine navigation that integrates GPS data with an electronic navigational chart (ENC).
The chartplotter displays the ENC along with the position, heading and speed of the ship, and may display additional information from radar, automatic information systems (AIS) or other sensors.
As appropriate to particular marine applications, chartplotters may also display data from other sensors, such as echolocators or sonar.
Technology
Electronic chartplotters are by nature CPU (and GPU) intensive applications. Chartplotters need to retrieve the Navigation Signal (Galileo, GPS, GLONASS, WAAS etc.) and overlay that on a map. Map updates on dedicated hardware typically have screen refresh rates from 5 Hz to 30 Hz.
Some navigation software can run on standard computers (and mobile phones, etc.) but most higher end systems are dedicated hardware. Especially when the chartplotter generates three-dimensional displays, as used for fishing, considerable processing power and video memory may be required.
As with all marine systems, chart-plotters generally are not used alone. In commercial ships, they are integrated into a full system of marine instruments that can guide the ship under any conditions. These other instruments include Sonar transducers, integration with 2 Way Radio communication devices and emergency locators (EPIRB).
The integration of these devices is very important as it becomes quite distracting to look at several different screens. Therefore, displays can often overlay charting, radar, sonar into a single system. This gives the captain unprecedented instrumentation to maneuver the ship. With digital backbones, these devices have advanced greatly in the last years. For example, the newer ones have 3D displays that allow you to see above, below and all around the ship, including overlays of satellite imaging.
Electronic Charts
An individual electronic chart, or, more commonly, a database of charts, is the heart of a chartplotter. The chartplotter system can be no more accurate than its charts.
Without charts that are accredited by appropriate governmental organizations, a chartplotter is an example of an Electronic Charting System (ECS). When the charts meet the technical requirements of the International Maritime Organization (IMO) and national hydrographic bodies, the chartplotter can qualify as an Electronic Chart Display and Information System (ECDIS). ECDIS legally can be substituted for paper charts while navigating in active waterways, but vessels are required to maintain paper charts if their chartplotter does not use ECDIS.
ECDIS will use IMO-standardized formats, but some chartplotters require specific data formats. A charter may use one or both types of ENC:
Raster Charts: The chart plotter displays a "picture" of a paper chart or map which is referenced to geographic coordinates. A GPS position can be displayed upon the raster chart, but accuracy depends upon many factors including the |
https://en.wikipedia.org/wiki/S6%20%28Rhine-Ruhr%20S-Bahn%29 | Line S 6 is a S-Bahn line in the Rhein-Ruhr network. It calls, among others, at the cities of Essen, Düsseldorf and Cologne and was the first S-Bahn line in the Rhine-Ruhr network, becoming operational on 28 September 1967 between Ratingen Ost and Düsseldorf-Garath. It is operated at 20-minute intervals using coupled sets of class 422 four-car electrical multiple units.
Line S 6 runs over lines built by various railway companies:
from Essen Hauptbahnhof to Essen-Werden over the Essen-Werden–Essen railway, opened by the Bergisch-Märkische Railway Company in 1877,
from Essen-Werden to Düsseldorf Hauptbahnhof over the Ruhr Valley Railway, opened by the Bergisch-Märkische Railway Company in 1872 and 1874,
from Düsseldorf to Cologne over the Cologne–Duisburg railway, opened by the Cologne-Minden Railway Company in 1845 and
from Cologne to Köln-Nippes over the West Lower Rhine Railway opened by the Cologne-Crefeld Railway Company in 1855.
It was opened on 28 September 1967 between Ratingen Ost and Düsseldorf-Garath. It was extended from Ratingen Ost to Essen on 26 May 1968 and from Garath to on 12 December 1968, from Langenfeld to Köln Hansaring on 2 June 1991 and from Hansaring to on 13 June 2004.
References
S06
1967 establishments in West Germany |
https://en.wikipedia.org/wiki/Syncword | In computer networks, a syncword, sync character, sync sequence or preamble is used to synchronize a data transmission by indicating the end of header information and the start of data. The syncword is a known sequence of data used to identify the start of a frame, and is also called reference signal or midamble in wireless communications.
Prefix codes allow unambiguous identification of synchronization sequences and may serve as self-synchronizing code.
Examples
In an audio receiver receiving a bit stream of data, an example of a syncword is 0x0B77 for an AC-3 encoded stream.
An Ethernet packet with the Ethernet preamble, 56 bits of alternating 1 and 0 bits, allowing the receiver to synchronize its clock to the transmitter, followed by a one-octet start frame delimiter byte and then the header.
All USB packets begin with a sync field (8 bits long at low speed, 32 bits long at high speed) used to synchronize the receiver's clock to the transmitter's clock.
A receiver uses a physical layer preamble, also called a physical layer training sequence, to synchronize on the signal by estimating frequency and clock offsets.
Some documentation uses "preamble" to refer to a signal used to announce a transmission, to wake-up receivers in a low-power mode.
While some systems use exactly the same signal for both physical-layer training and wake-up functions, others use 2 different signals at 2 different times for these 2 functions, or have only one or the other of these signals.
The Bisync protocol of the 1960s used a minimum of two ASCII "SYN" characters (0x16…0x16) to achieve character synchronization in an undifferentiated bit stream, then other special characters to synchronize to the beginning of a frame of characters.
The syncwords can be seen as a kind of delimiter. Various techniques are used to avoid delimiter collision, orin other wordsto "disguise" bytes of data at the data link layer that might otherwise be incorrectly recognized as the syncword. For example, HDLC uses bit stuffing or "octet stuffing", while other systems use ASCII armor or Consistent Overhead Byte Stuffing (COBS).
Alternatives
In some communication systems, a receiver can achieve character synchronization from an undifferentiated bit stream, or start-of-header synchronization from a byte stream, without the overhead of an explicit syncword. For example, the FSK441 protocol achieves character synchronization by synchronizing on any "space" characters in the messagein effect, every "space" character in the message does double duty as a syncword. For example, CRC-based framing achieves character and start-of-header synchronization.
In a self-synchronizing code, every character is, in effect, a syncword, and can be used to achieve character synchronization in an undifferentiated bit stream.
Preamble
In digital communication, preamble is a sequence of known bits sent in each frame. It is used for frame synchronization such as in Ethernet frames, as well as for channe |
https://en.wikipedia.org/wiki/SCOLA%20%28TV%20service%29 | SCOLA is a non-profit educational organization that receives and re-transmits television programming from more than 140 countries in more than 170 native languages. These programs are available via Internet, satellite, and cable TV systems. SCOLA content reaches more than 20 million viewers worldwide. The service currently has one over-the-air affiliate, Miami, Florida's WLMF-LD, carrying its first channel, offering news and programming from Europe. SCOLA also has 11 different web services that provide language training resources.
History
SCOLA was started by Rev. Leland Lubbers, a Jesuit priest, on the campus of Creighton University. Inspiration was drawn from worldwide satellite television systems receiving programs from a myriad of countries. Lubbers proceeded to build a $750 satellite receiver in a garage on the Creighton campus. One year later, the campus was wired with a cable TV system featuring French and Mexican television broadcasts. The one channel created was originally known as Jay TV (named after the Creighton mascot). Assisted by future SCOLA CEO Frank Lajba, Lubbers developed a computer program tracking Soviet communications satellites.
SCOLA was broadcast on the local cable service in 1992; one year, it relocated to McClelland, Iowa, building a plot known as the SCOLA Antenna Farm. In spring 1994, the SCOLA World Conference was held in Taiyuan, China; about 40 American educators attended. In 1995, SCOLA partnered with China Yellow River Television (based in Taiyuan, China) to send Chinese news personnel to the US to broadcast news programs from the SCOLA antenna farm. On 27 June 2008, Lubbers died.
The company has 13 full and part-time employees.
SCOLA content is streamed on the Internet and is available on a variety of cable systems throughout North America.
SCOLA has eight channels:
Channel 1: News and variety programs mainly from Europe. The primary channel carried by cable systems offering SCOLA.
Channel 2: Programs from 11 Spanish-speaking regions and Portuguese-speaking countries
Channel 3 (the Confucius Institute Channel): Mandarin programs, including CYRTV and other Chinese networks.
Channel 4: Asian broadcasts
Channel 5: African programs
Channel 6: Middle East programs
Channel 7: Additional Asian/Near East programs
Channel 8: Eurasian programs
References
External links
SCOLA.org
Scolastory: Rev. Lubber's blog
Scola | Rating by Charity Navigator
Television networks in the United States
Commercial-free television networks
Educational and instructional television channels
Companies based in Iowa
Non-profit organizations based in the United States
Creighton University
Television channels and stations established in 1981 |
https://en.wikipedia.org/wiki/Patrick%20Cousot | Patrick Cousot (born 3 December 1948) is a French computer scientist, currently Silver Professor of Computer Science at the Courant Institute of Mathematical Sciences, New York University, USA. Before he was Professor at the École Normale Supérieure (ENS), Paris, France, the École Polytechnique, Palaiseau, France and the University of Metz, France and a Research Scientist at the French National Center for Scientific Research (CNRS) at the Joseph Fourier University, Grenoble, France.
Together with his wife Radhia Cousot (1947–2014), Patrick Cousot is the originator of abstract interpretation, an influential technique in formal methods. In the 2000s, he has worked on practical methods of static analysis for critical embedded software (Astrée), such as found in avionics.
In 1999 he received the CNRS Silver Medal and in 2006 the great prize of the EADS Foundation. In 2001, he was bestowed an honorary doctorate by Saarland University, Germany. With Radhia Cousot, he received the ACM SIGPLAN Programming Languages Achievement Award in 2013 and the IEEE Computer Society Harlan D. Mills award in 2014, "For the invention of 'abstract interpretation', development of tool support, and its practical application". He received a Humboldt Research Award in 2008 and the 2018 IEEE John von Neumann Medal "for introducing abstract interpretation, a powerful framework for automatically calculating program properties with broad application to verification and optimisation". In 2020 Cousot was recognized ACM Fellow "for contributions to programming languages through the invention and development of abstract interpretation". In 2022, Cousot was awarded an honorary doctorate from Ca' Foscari University of Venice. He received the 2022 EATCS award, which is given by EATCS to acknowledge extensive and widely recognized contributions to theoretical computer science over a life long scientific career. He is a knight (Chevalier) in the Ordre National du Mérite and the Ordre des Palmes académiques, member of the Academia Europaea, Informatics section (since 2006) and member of the Board of Trustees at the IMDEA Software Institute.
References
Short biography
External links
Patrick Cousot home page at NYU
Patrick Cousot home page at ENS
Patrick Cousot home page at MIT
1948 births
Living people
French computer scientists
Programming language researchers
Recipients of the Ordre des Palmes Académiques
Academic staff of École Polytechnique |
https://en.wikipedia.org/wiki/Intel%20C%2B%2B%20Compiler | Intel oneAPI DPC++/C++ Compiler and Intel C++ Compiler Classic (deprecated icc and icl is in Intel OneAPI HPC toolkit) are Intel’s C, C++, SYCL, and Data Parallel C++ (DPC++) compilers for Intel processor-based systems, available for Windows, Linux, and macOS operating systems.
Overview
Intel oneAPI DPC++/C++ Compiler is available for Windows and Linux and supports compiling C, C++, SYCL, and Data Parallel C++ (DPC++) source, targeting Intel IA-32, Intel 64 (aka x86-64), Core, Xeon, and Xeon Scalable processors, as well as GPUs including Intel Processor Graphics Gen9 and above, Intel Xe architecture, and Intel Programmable Acceleration Card with Intel Arria 10 GX FPGA. Like Intel C++ Compiler Classic, it also supports the Microsoft Visual Studio and Eclipse IDE development environments, and supports threading via Intel oneAPI Threading Building Blocks, OpenMP, and native threads.
DPC++ builds on the SYCL specification from The Khronos Group. It is designed to allow developers to reuse code across hardware targets (CPUs and accelerators such as GPUs and FPGAs) and perform custom tuning for a specific accelerator. DPC++ comprises C++17 and SYCL language features and incorporates open-source community extensions that make SYCL easier to use. Many of these extensions were adopted by the SYCL 2020 provisional specification including unified shared memory, group algorithms, and sub-groups.
Intel announced in August 2021 the complete adoption of LLVM for faster build times and benefits from supporting the latest C++ standards.
Intel C++ Compiler Classic is available for Windows, Linux, and macOS and supports compiling C and C++ source, targeting Intel IA-32, Intel 64 (x86-64), Core, Xeon, and Xeon Scalable processors. It supports the Microsoft Visual Studio and Eclipse IDE development environments. Intel C++ Compiler Classic supports threading via Intel oneAPI Threading Building Blocks, OpenMP, and native threads.
Architectures
According to Intel, starting with the 2023.0 release, Intel oneAPI DPC++/C++ Compiler supports all current Intel general-purpose x86-64 CPUs and GPUs including:
Processors:
Legacy Intel IA-32 and Intel 64 (x86-64) processors
Intel Core processors
Intel Xeon processor family
Intel Xeon Scalable processors
Intel Xeon Processor Max Series
GPUs:
Intel Processor Graphics Gen9 and above
Intel Xe architecture
Intel Programmable Acceleration Card with Intel 10 GX FPGA
Intel Data Center GPUs including Flex Series and Max Series
Intel FPGAs
Intel C++ Compiler Classic targets general-purpose Intel x86-64 architecture CPUs including:
Legacy Intel IA-32 and Intel 64 (x86-64) processors
Intel Core processors
Intel Xeon processor family
Intel Xeon Scalable processors
Toolkits
The Intel oneAPI DPC++/C++ Compiler is available either as a standalone component or as part of the Intel oneAPI Base Toolkit, Intel oneAPI HPC Toolkit, and Intel oneAPI IoT Toolkit.
The Intel C++ Compiler Classic is available either as a stand |
https://en.wikipedia.org/wiki/Abbe%20Raven | Abbe Raven is the Chairman Emeritus of A+E Networks. Raven previously retired from her role as chairman on February 2, 2015. She was asked to return in March 2018 upon the departure of the CEO, Nancy Dubuc. Raven is also the former President and CEO of A+E Networks. Raven is one of the original founders of the HISTORY brand and was one of the longest running employees at A+E Networks. She began her career in 1982 as a production assistant and rose through the ranks to become the second CEO and first Chairman in A+E Networks' history.
Background and education
Raven was born and raised in Queens, New York. In 1974, she received her B.A. in Theatre from the State University of New York at Buffalo. Raven received her M.A. in Theatre & Film from Hunter College. She was awarded Honorary Doctorates of Humane Letters from Hunter College, Florida Southern College and State University of New York at Buffalo.
Raven met her husband, Martin Tackel, while at the State University of New York at Buffalo. Tackel is an attorney and a commercial arbitrator.
Career
After graduating from the State University of New York at Buffalo, Raven was a stage manager for off-Broadway and regional theater. She took an opportunity to work for a company called DAYTIME that was just starting out. It later became the Arts & Entertainment Network. She was promoted to Senior Vice President and put in charge of all production, post-production and studio facilities. Raven then transferred to the HISTORY brand as the Executive Vice President and General Manager and was in charge of all programming. She was then promoted to President of A&E Network and The Biography Channel. In March 2005, Raven became the President & CEO of A+E Networks. In June 2013, she became Chairman of A+E Networks. Raven retired and became Chairman Emeritus of A+E Networks in February 2015. Upon the departure of CEO Nancy Dubuc in March 2018, Raven returned to A+E as Acting Chairman.
In October 2009, she was inducted into the Broadcasting & Cable Hall of Fame.
In 2010, she was named in The Hollywood Reporter'''s Women in Entertainment Power 100 list and named one of the top 5 most powerful women in entertainment.
She was Chairman of the board and now alumni Board Member of the Smithsonian National Museum of American History.
Raven was elected as Vice Chair of the inaugural Smithsonian American Women's History Museum Advisory Council
Raven is on the board of directors of the Breast Cancer Research Foundation.
She previously served on the board of directors of Pencil, a non-profit group that brings corporate know how to New York City public schools.
She is a director of the International Academy of Television Arts and Sciences and is on their executive committee.
In 2018, Raven was awarded an Honorary Doctorate in Humane Letters from the State University of New York at Buffalo. Hunter College, and Florida Southern College.
Raven was a co-producer of the Tony-nominated Broadway musical The Prom, which o |
https://en.wikipedia.org/wiki/IBM%20M44/44X | The IBM M44/44X was an experimental computer system from the mid-1960s, designed and operated at IBM's Thomas J. Watson Research Center at Yorktown Heights, New York. It was based on a modified IBM 7044 (the 'M44'), and simulated multiple 7044 virtual machines (the '44X'), using both hardware and software. Key team members were Dave Sayre and Rob Nelson. This was a groundbreaking machine, used to explore paging, the virtual machine concept, and computer performance measurement. It was purely a research system, and was cited in 1981 by Peter Denning as an outstanding example of experimental computer science.
The term virtual machine probably originated with the M44/44X project, from which it was later appropriated by the CP-40 team to replace their earlier term pseudo machine.
Unlike CP-40 and later CP/CMS control programs, M44/44X did not implement a complete simulation of the underlying hardware (i.e. full virtualization). CP-40 project leader Robert Creasy observed:
The M44/44X "was about as much of a virtual machine system as CTSS – which is to say that it was close enough to a virtual machine system to show that 'close enough' did not count. I never heard a more eloquent argument for virtual machines than from Dave Sayre."
M44/44X "implanted the idea that the virtual machine concept is not necessarily less efficient than more conventional approaches" – a core assumption in the CP/CMS architecture, and one that ultimately proved very successful.
References
R. J. Creasy, "The origin of the VM/370 time-sharing system", IBM Journal of Research & Development, Vol. 25, No. 5 (September 1981), pp. 483-490,– perspective on CP/CMS and VM history by the CP-40 project lead, also a CTSS author
Peter J. Denning, "Performance Modeling: Experimental Computer Science at its Best", Communications of the ACM, President's Letter (November 1981) – an influential survey paper, citing the following M44/44X papers:
L. Belady, "A study of replacement algorithms for virtual storage computers," IBM Systems Journal Vol. 5, No. 2 (1966), pp. 78-101
L. Belady and C. J. Kuehner, "Dynamic space sharing in computer systems," Communications of ACM Vol. 12 No. 5 (May 1969), pp. 282-288
L. Belady, R. A. Nelson, and G. S. Shedler, "An anomaly in the space-time characteristics of certain programs running in paging machines," Communications of the ACM Vol. 12, No. 6 (June 1969), pp. 349-353
– describes the M44/44X, reports performance measurements related to memory and paging, and discusses performance impact of multiprogramming and time-sharing
R. A. Nelson, "Mapping Devices and the M44 Data Processing System," Research Report RC 1303, IBM Thomas J. Watson Research Center (1964)– about the M44/44X
D. Sayre, On Virtual Systems, IBM Thomas J. Watson Research Center (April 15, 1966)– an early virtual machine paper describing multiprogramming with the M44/44X.
Melinda Varian, VM and the VM community, past present, and future, SHARE 89 Sessions 9059-9061, 1997– the |
https://en.wikipedia.org/wiki/McGill%20University%20School%20of%20Computer%20Science | The School of Computer Science (SOCS) is an academic department in the Faculty of Science at McGill University in Montreal, Quebec, Canada. The school is the second most funded computer science department in Canada. It currently has 34 faculty members, 60 Ph.D. students and 100 Master's students.
History
The creation of a Computer Science organization was led by Chair of Electrical Engineering (and later Dean of Engineering) George Lee (John) d'Ombrain. He is credited with bringing the first computer to McGill University in 1958. The first graduate student in computing at McGill University was Gerald Ratzer, who arrived from Cambridge in September 1964. There he pursued an M.Sc. in the Faculty of Graduate Sciences, under the supervision of David Thorpe, Director of the McGill Computing Centre. The School of Computer Science was formally created in 1969.
Computer Science was originally housed in Burnside Hall, which was built in 1970. It is notable for containing the Computing Centre, which contributed funds to Computer Science faculty such as Timothy Howard Merrett. The School moved into the McConnell Building in 1988.
The term "School" was used to reinforce the idea of independence from the Faculty of Engineering. Over the years, the School of Computer Science continued to face difficulties over sharing resources such as academic slots, teaching assistants, and space with their Engineering peers. This was partly due to cross-appointments of faculty from Electrical Engineering, leaving Computer Science understaffed. There were also concerns amongst engineers that Computer Science was not a professional discipline, and that students would choose Computer Science over Engineering, lowering the amount of funding available. This led to engineers pressuring the School not to have major and master's degrees for long. The minor in Computer Science was created in 1978 with the undergraduate program following in 1979; however, the major program was not created until 1990. Eventually, a heated debate between Dean Dealy of the Faculty of Engineering and Dean Shaver of the Faculty of Science in 1995 led to the School moving to Science in 1997.
Academics
Research
In 1984, McGill University owned the two USENET nodes in Quebec: one for Computer Science, and the other for Computer vision. Around 1992, McGill was also the main network hub for all of Quebec's academic networks In 1985, the McGill Research Centre for Intelligent Machines (McRCIM) was formed by four researchers – Martin Levine, Steve Zucker, Pierre Bélanger, and George Zames. Today, it is known as the Centre for Intelligent Machines, and seeks to advance the state of knowledge in such domains as robotics, automation, artificial intelligence, computer vision, systems and control theory, and speech recognition.
The first Internet Search Engine, Archie search engine, was written in 1989 by three McGill computer science students Alan Emtage, Bill Heelan, and J. Peter Deutsch. In September of th |
https://en.wikipedia.org/wiki/Stereo%20cameras | The stereo cameras approach is a method of distilling a noisy video signal into a coherent data set that a computer can begin to process into actionable symbolic objects, or abstractions. Stereo cameras is one of many approaches used in the broader fields of computer vision and machine vision.
Calculation
In this approach, two cameras with a known physical relationship (i.e. a common field of view the cameras can see, and how far apart their focal points sit in physical space) are correlated via software. By finding mappings of common pixel values, and calculating how far apart these common areas reside in pixel space, a rough depth map can be created. This is very similar to how the human brain uses stereoscopic information from the eyes to gain depth cue information, i.e. how far apart any given object in the scene is from the viewer.
The camera attributes must be known, focal length and distance apart etc., and a calibration done. Once this is completed, the systems can be used to sense the distances of objects by triangulation. Finding the same singular physical point in the two left and right images is known as the correspondence problem. Correctly locating the point gives the computer the capability to calculate the distance that the robot or camera is from the object. On the BH2 Lunar Rover the cameras use five steps: a bayer array filter, photometric consistency dense matching algorithm, a Laplace of Gaussian (LoG) edge detection algorithm, a stereo matching algorithm and finally uniqueness constraint.
Uses
This type of stereoscopic image processing technique is used in applications such as 3D reconstruction, robotic control and sensing, crowd dynamics monitoring and off-planet terrestrial rovers; for example, in mobile robot navigation, tracking, gesture recognition, targeting, 3D surface visualization, immersive and interactive gaming. Although the Xbox Kinect sensor is also able to create a depth map of an image, it uses an infrared camera for this purpose, and does not use the dual-camera technique.
Other approaches to stereoscopic sensing include time of flight sensors and ultrasound.
References
See also
Stereo camera (about a camera with two separated views)
Computer vision
Geometry in computer vision
Robotic sensing
Robot control
tr:Stereo kameralar |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.