source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Johnny%20Esaw | Johnny Esaw, CM (June 11, 1925 – April 6, 2013) was a Canadian of Assyrian descent, a sports broadcaster and television network executive. He was a pioneer of sports broadcasting in Canada, best known for his involvement with figure skating, football, and international hockey.
Early broadcasting career
Born in North Battleford, Saskatchewan, Esaw was unsuccessfully selling insurance in 1947 when Emile Francis hired him to cover semi-professional baseball games on radio station CJNB in North Battleford. In 1949, he moved to a bigger market in Regina, Saskatchewan at CKRM, where he worked until 1956. He provided play-by-play coverage of the 1951 Grey Cup game from Varsity Stadium in Toronto—the beginning of what would become a long affiliation with the Canadian Football League. In 1956, Esaw became sports director of Winnipeg's CKRC.
Moves to television
Esaw made the transition to television late in 1960, becoming sports director of CFTO-TV, Toronto's first privately owned TV station, as it prepared for launch. Foster Hewitt was an early investor in the station and helped persuade Esaw to move east. CFTO was part of the CTV Television Network, and Esaw headed negotiations for the broadcast rights for many prominent sports events. Under Esaw, figure skating received significant coverage on CFTO and across CTV, making national stars out of Canadian world champions Donald Jackson and Otto Jelinek & Maria Jelinek. Esaw worked with Roone Arledge, head of ABC Sports to secure North American rights to the world figure skating championships. CTV and ABC would also partner in bringing Wide World of Sports to Canada. Esaw also brought the 1964 Winter Olympics to CTV and bought the rights to the 1972 Canada-Russia Summit Series (the broadcasts ended up being shared with CBC Television). Esaw hosted the English-language telecasts and is best remembered for conducting the famous post-game interview with Phil Esposito following Game 4 in Vancouver, British Columbia. He was also the lead play-by-play man for the CFL on CTV from 1962 until 1973 and then the host from 1974 until 1986.
A network executive
In 1974, Esaw became vice-president of CTV Sports, a position he would hold until his retirement in 1990. He negotiated the host broadcasting rights to the 1988 Winter Olympics in Calgary.
After retiring from CTV, Esaw joined Houston Group as vice-president of broadcasting operations and remained in that role after Houston was acquired by Edelman, the world's largest public relations firm. With Edelman, Esaw worked on several sports events, including golf tournaments, tennis, and motor sports. He retired in 1996 at the age of 71. Esaw died in Toronto at age 87 on April 6, 2013, of respiratory problems.
Honours
Esaw was inducted into the Canadian Football Reporters Hall of Fame (1984), the Canadian Olympic Hall of Fame (1991), Canada's Sports Hall of Fame (1991), the Canadian Amateur Sports Hall of Fame (1991), the North Battleford Sports Hall of Fame (1992), |
https://en.wikipedia.org/wiki/A%20Change%20in%20the%20Weather | A Change in the Weather is a 1995 interactive fiction (IF) video game.
Developed by Andrew Plotkin, the game is written in version five of the Inform programming language, and compiled for the Z-machine, a virtual machine that allows interactive fiction to be played on a variety of platforms. On June 24, 2014, Plotkin shared A Change in the Weather source code for "personal, educational use only."
The game tied for first place in the Inform category of the 1995 Interactive Fiction Competition.
As one of six IF games recommended by CU Amiga in 1998, Jason Compton called A Change in the Weather "Very, very hard, it challenges IF conventions and makes you think (and save your game) quite a lot." Interactive fiction scholar Nick Montfort called it "remarkable ... for its attempts to integrate the typical sorts of adventure-game puzzles with the description of landscape, the simulation of an animal character, and the emotional situation of the 'adventurer' player character".
A Change in the Weather is included in the game collection that comes with the popular IF interpreter Frotz for the iPhone.
References
External links
Video games with available source code
1990s interactive fiction
1995 video games |
https://en.wikipedia.org/wiki/LOGML | LOGML is an XML 1.0–based markup language for web server log reports, that allows automated data mining and report generation. LOGML is based on XGMML for graph description.
See also
XGMML
List of markup languages
External links
Cover Pages: Log Markup Language (LOGML)
XML markup languages
Computer file formats |
https://en.wikipedia.org/wiki/Gaze-contingency%20paradigm | Within computer technology, the gaze-contingency paradigm is a general term for techniques allowing a computer screen display to change in function depending on where the viewer is looking. Gaze-contingent techniques are part of the eye movement field of study in psychology.
From a system analysis point of view, eye-tracking applications should be distinguished from diagnostic or interactive system. In diagnostic mode, the eye tracker provides data about the observer’s visual search and attention processes. In interactive mode, the eye-tracker is used as an input device. From a general point of view, an interactive system responds to the observer’s actions and interacts with them. Because the display updates in response to the observer's eye movements, the gaze-contingency paradigm can be classified an interactive eye-tracking application.
Background
Over the past century, the way the eyes move in human activities as diverse as playing sport, viewing works of art, piloting aircraft, exploring visual scenes, recognizing face or facial expressions, reading language, and sight-reading of music, has revealed some of the ocular and psychological mechanisms involved in the visual system.
The gaze-contingent techniques aim to overcome limitations inherent to simple eye-movement recording. Indeed, due to an imperfect coupling between overt and covert attention, it is not possible to exactly know which visual information the viewer is processing based on the fixation locations. By controlling precisely the information projected in different parts of the visual field, the gaze-contingent techniques permit to disentangle what is fixated and what is processed.
The technical principle of the paradigm involves a computer interfaced with both an eye-movement tracking system (eye-tracker) and a display of the visual stimulus. Successful gaze-contingency requires a fast computer, a display with a high refresh rate, and an eye tracker with low latency. In gaze-contingent displays, the stimulus is continuously updated as a function of the observers' current gaze position; for instance, in the moving window paradigm, observers can see the scene only through a central hole, giving the sensation of seeing through a telescope.
Therefore, the gaze-contingent technique is a powerful method to control for the visual information feeding the visual system and to isolate information use.
Techniques
The gaze-contingent technique is the basis of various experimental paradigms, each of them allowing to investigate specific cognitive processes.
In the moving window paradigm only the part of the visual field around the gaze location (foveal information) is displayed normally, the surrounding part of the visual field (extrafoveal and peripheral information) being altered (removed for visual scenes or replaced by chains of X in reading).
The moving mask paradigm is a reverse technique in comparison with the moving window paradigm. It dynamically obscures central vision (or re |
https://en.wikipedia.org/wiki/Icemat | Icemat is a manufacturer, distributor and online retailer of a line of products targeted primarily at computer gamers. The company was founded in 2001 as a producer of mousing surfaces made of frosted glass. They have since expanded their product line to include headphones, sound cards and apparel. Icemat was seen often to produce partnerships with professional gaming teams and to sponsor events and individual players.
Icemat is now known as SteelSeries, and Icemat's website now redirects there. In 2007, SteelSeries decided to merge both brands. The SteelSeries Experience I-2 is the newest generation of the original glass Icemats.
In popular culture
The Icemat Siberia headphones are featured in the Basshunter music video "Vi sitter i Ventrilo och spelar DotA".
References
External links
Review of the Icemat Original
Review of the Icemat 2nd Edition
New edition of the glas-pad
Computer peripheral companies
Electronics companies of Denmark
Retail companies established in 2001
Companies based in Copenhagen |
https://en.wikipedia.org/wiki/Oregon%20Railroad%20and%20Navigation%20Company | The Oregon Railroad and Navigation Company (OR&N) was a railroad that operated a rail network of running east from Portland, Oregon, United States, to northeastern Oregon, northeastern Washington, and northern Idaho. It operated from 1896 as a consolidation of several smaller railroads.
OR&N was initially operated as an independent carrier, but Union Pacific (UP) purchased a majority stake in the line in 1898. It became a subsidiary of UP titled the Oregon–Washington Railroad and Navigation Company in 1910. In 1936, Union Pacific formally absorbed the system, which became UP's gateway to the Pacific Northwest.
Predecessors
The OR&N was made up of several railroads:
Columbia Southern Railway from Biggs to Shaniko, Oregon.
Oregon Railway and Navigation Company traces its roots back as far as 1860. It was incorporated in 1879 in Portland, Oregon and operated between Portland and eastern Washington and Oregon until 1896, when it was reorganized into the Oregon Railroad and Navigation Company. The Oregon Railway and Navigation Company was the core of the OR&N. Its route eventually became the backbone of Union Pacific Railroad's mainline from Utah to the Pacific Northwest.
Columbia and Palouse Railroad was incorporated in 1882 and built of track. The track ran from Connell, Washington, where it interchanged with the Northern Pacific Railway and ran east through Hooper, La Crosse, Winona and Colfax. At Colfax, one line ran northeast to Farmington, Washington, located on the Idaho state line. The other line ran southeast from Colfax to Moscow, Idaho. The railroad was a non-operating subsidiary of the OR&N in 1888 and was eventually sold to the OR&N in 1910.
Walla Walla and Columbia River Railroad was a wood-railed narrow-gauge railroad incorporated in 1868 at Walla Walla, Washington, and built of track from Wallula, Washington. The track went east from Wallula to Touchet, Frenchtown and Whitman. At Whitman, the line continued east to Walla Walla and a branch that was built in 1879 went south to Blue Mountain, Oregon via Barrett (Milton). The first took 6 years to build. In 1881 the railroad came under the control of the OR&N, and the narrow-gauge was converted to standard gauge. In 1910, the Walla Walla and Columbia River Railroad was consolidated into the OR&N.
Mill Creek Flume and Manufacturing was incorporated in 1880 as a narrow gauge lumber carrier operating of track between Walla Walla and Dixie. In 1903 the Mill Creek Flume and Manufacturing Company was purchased by the OR&N and renamed the Mill Creek Railroad. The track was standardized in 1905. After the track was standardized, the OR&N sold the Mill Creek Railroad and it was merged into the Washington and Columbia River Railway which became part of the Northern Pacific Railway in 1907.
Oregon Railway Extensions Company was incorporated in 1888 at Portland and built of track with two branches. One branch ran from La Grande, Oregon where it interchanged with the OR&N and then ran no |
https://en.wikipedia.org/wiki/William%20Whitaker%27s%20Words | William Whitaker's Words is a computer program that parses the inflection or conjugation of a Latin word, and also translates the root into English. Given an English word, the program outputs Latin translations. The software, written in Ada, is free for download but can be used online through several different hosts as well.
This program has gained popularity among Latinists because of its simple interface, high coverage of the Latin lexicon and mostly accurate results. Nevertheless, the user has to check the results, since WORDS uses a set of rules based on natural prefixation, suffixation, declension and conjugation to determine the possibility of an entry. As a consequence of this approach of analysing the structure of words, there is no guarantee that these words were ever used in Latin literature or speech, even if the program finds a possible meaning to a given word.
A few years after the original author's death, the software became the subject of digital preservation efforts.
Coverage
The dictionary consists of about 39,000 entries, which would result in hundreds of thousands of variations, counting declensions and conjugations.
Additionally, the dictionary contains prefixes and suffixes.
In comparison, the Oxford Latin Dictionary, considered to be the most complete Latin lexicon published in the English language, has about 34,000 entries, excluding proper names. The Oxford Latin Dictionary has fewer entries because it only contains entries from Classical Latin, whereas WORDS contains words from many time periods.
Parsing process
For instance, given the Latin verb form amābantur, WORDS analyzes it as:
amābantur = am + (ā + ba + nt + ur), where
am = amo, amare, amavi, amatus (English to love)
ā = theme vowel for indicative mood
ba = marker for the imperfect
nt = marker for third person plural number
ur = marker for passive voice
So amābantur is the passive, 3rd person, plural, imperfect, indicative form of the verb "to love", which would be translated "they were being loved".
About William Whitaker
William A. Whitaker (1936–2010) was a colonel in the United States Air Force. While at the Defense Advanced Research Projects Agency (DARPA), he chaired the High Order Language Working Group that recommended development of the computer language Ada, in which WORDS is written. An accomplished Latinist, he created the translation software called WORDS after his retirement from the forces.
See also
A Latin Dictionary
Notes
External links
Preservation effort
Words official site (archived)
Words online
Source code
Interpres Words for Mac OS X
Legible Latin Multi-Platform Words Program; Mac OS X, Windows, Linux.
A Digital Latin Dictionary: Whitaker's Words for Kindle.
Android Port of Words
Pedagogy
Online dictionaries
Latin dictionaries
1993 software
Free software programmed in Ada |
https://en.wikipedia.org/wiki/WLN | WLN or wln may refer to:
Walloon language (ISO 639-2 code)
Western Library Network, merged into Online Computer Library Center
West Lothian, council area in Scotland, Chapman code
Wiswesser Line Notation, system for describing chemical structures
Work and Learning Network, University of Alberta |
https://en.wikipedia.org/wiki/Differential%20backup | A differential backup is a type of data backup that preserves data, saving only the difference in the data since the last full backup. The rationale in this is that, since changes to data are generally few compared to the entire amount of data in the data repository, the amount of time required to complete the backup will be smaller than if a full backup was performed every time that the organization or data owner wishes to back up changes since the last full backup. Another advantage, at least as compared to the incremental backup method of data backup, is that at data restoration time, at most two backup media are ever needed to restore all the data. This simplifies data restores as well as increases the likelihood of shortening data restoration time.
Meaning
A differential backup is a cumulative backup of all changes made since the last full backup, i.e., the differences since the last full backup. The advantage to this is the quicker recovery time, requiring only a full backup and the last differential backup to restore the entire data repository. The disadvantage is that for each day elapsed since the last full backup, more data needs to be backed up, especially if a significant proportion of the data has changed, thus increasing backup time as compared to the incremental backup method.
It is important to use the terms "differential backup" and "incremental backup" correctly. The two terms are widely used in the industry, and their use is universally standard. A differential backup refers to a backup made to include the differences since the last full backup, while an incremental backup contains only the changes since the last incremental backup. (Or, of course, since the last full backup if the incremental backup in questions is the first incremental backup immediately after the last full backup.) All the major data backup vendors have standardized on these definitions.
Illustration
The difference between incremental and differential backups can be illustrated as follows:
Incremental backups:
The above assumes that backups are done daily. Otherwise, the “Changes since” entry must be modified to refer to the last backup (whether such last backup was full or incremental). It also assumes a weekly rotation.
Differential backups:
It is important to remember the industry standard meaning of these two terms because, while the terms above are in very wide use, some writers have been known to reverse their meaning. For example, Oracle Corporation uses a backward description of differential backups in their DB product as of May 14, 2015:
"Differential incremental backups - In a differential level 1 backup, RMAN backs up all blocks that have changed since the most recent cumulative or differential incremental backup, whether at level 1 or level 0. RMAN determines which level 1 backup occurred most recently and backs up all blocks modified after that backup. If no level 1 is available, RMAN copies all blocks changed since the level 0 backup."
|
https://en.wikipedia.org/wiki/1260%20%28computer%20virus%29 | 1260, or V2PX, was a demonstration computer virus written in 1989 by Mark Washburn that used a form of polymorphic encryption. Derived from Ralf Burger's publication of the disassembled Vienna Virus source code, the 1260 added a cipher and varied its signature by randomizing its decryption algorithm. Both the 1260 and Vienna infect .COM files in the current or PATH directories upon execution. Changing an authenticated executable file is detected by most modern computer operating systems.
References
DOS file viruses
Hacking in the 1990s
Hacking in the 1980s |
https://en.wikipedia.org/wiki/Wiswesser%20line%20notation | Wiswesser line notation (WLN), invented by William J. Wiswesser in 1949, was the first line notation capable of precisely describing complex molecules. It was the basis of ICI Ltd's CROSSBOW database system developed in the late 1960s. WLN allowed for indexing the Chemical Structure Index (CSI) at the Institute for Scientific Information (ISI). It was also the tool used to develop the CAOCI (Commercially Available Organic Chemical Intermediates) database, the datafile from which Accelrys' (successor to MDL) ACD file was developed. WLN is still being extensively used by BARK Information Services. Descriptions of how to encode molecules as WLN have been published in several books.
Examples
1H : methane
2H : ethane
3H : propane
1Y : isobutane
1X : neopentane
Q1 : methanol
1R : toluene
1V1 : acetone
2O2 : diethyl ether
1VR : acetophenone
ZR CVQ : 3-aminobenzoic acid
QVYZ1R : phenylalanine
QX2&2&2 : 3-ethylpentan-3-ol
QVY3&1VQ : 2-propylbutanedioic acid
L66J BMR& DSWQ IN1&1 : 6-dimethylamino-4-phenylamino-naphthalene-2-sulfonic acid
QVR-/G 5 : pentachlorobenzoic acid
References
External links
http://www.emolecules.com/doc/cheminformatics-101.htm
Everything Old is New Again: Wiswesser Line Notation (WLN)
Chemical nomenclature
Cheminformatics
Encodings |
https://en.wikipedia.org/wiki/CA/EZTEST | CA-EZTEST was a CICS interactive test/debug software package distributed by Computer Associates and originally called EZTEST/CICS, produced by Capex Corporation of Phoenix, Arizona with assistance from Ken Dakin from England.
The product provided source level test and debugging features for computer programs written in COBOL, PL/I and Assembler (BAL) languages to complement their own existing COBOL optimizer product.
Competition
CA-EZTEST initially competed with three rival products:
"Intertest" originally from On-line Software International, based in the United States. In 1991, Computer Associates International, Inc. acquired On-line Software and renamed the product CA-INTERTEST, then stopped selling CA-EZTEST.
OLIVER (CICS interactive test/debug) from Advanced Programming Techniques in the UK.
XPEDITER from Compuware Corporation who in 1994 acquired the OLIVER product.
Early critical role
Between them, these three products provided much needed third-party system software support for IBM's "flagship" teleprocessing product CICS, which survived for more than 20 years as a strategic product without any memory protection of its own. A single "rogue" application program (frequently by a buffer overflow) could accidentally overwrite data almost anywhere in the address space causing "down-time" for the entire teleprocessing system, possibly supporting thousands of remote terminals. This was despite the fact that much of the world's banking and other commerce relied heavily on CICS for secure transaction processing between 1970 and early 1990s. The difficulty in deciding which application program caused the problem was often insurmountable and frequently the system would be restarted without spending many hours investigated very large (and initially unformatted) "core dump"s requiring expert system programming support and knowledge.
Early integrated testing environment
Additionally, the product (and its competitors) provided an integrated testing environment which was not provided by IBM for early versions of CICS and which was only partially satisfied with their later embedded testing tool — "Execution Diagnostic Facility" (EDF), which only helped newer "Command level" programmers and provided no protection.
Supported operating systems
The following operating systems were supported:
IBM MVS
IBM XA
IBM VSE (except XPEDITER)
References
External links
IBM CICS official website
Xpediter — Interactive mainframe analysis and debugging
Xpeditor/CICS users guide for COBOL for OS/390 (Release 2.5 or above) and z/OS, September 2004
CA Inc. — product description for CA-Intertest
Software testing
Debuggers
CA Technologies
IBM mainframe software |
https://en.wikipedia.org/wiki/Capex%20Corporation | Capex Corporation was an American computer software company in existence from 1969 through 1982 and based in Phoenix, Arizona. It made a variety of software products, mostly system utilities for the IBM mainframe platform, and was known for its Optimizer add-on to the IBM COBOL compiler. Capex was acquired by Computer Associates in 1982.
Origins
The company was begun as a start-up in August 1969. In all there were eight original employees, with funding coming from venture capital. Some of the founders had been working for General Electric's computer division in Phoenix, on systems such as the GE-600 series. There, as a 1990 profile in the Phoenix Business Journal of one of them stated, they "encountered the types of limitations that would encourage him and countless other engineers and technical people to venture off and start their own businesses". Among these founders were A. LeRoy Ellison (1936–2017), who became president of the new company, and Harry N. Cantrell (1924–2004). Other original employees had been working on Univac systems.
In putting out mainframe computer systems, General Electric, like other hardware vendors of the time, was providing software without cost to its customers. The Capex founders thought that hardware companies failed to have a sufficient understanding of the software world and that, as a consequence, there was a viable market to be found for an independent software company. This was especially the case following
IBM's decision to unbundle software from its mainframes in 1969, which happened but two months after the founding of Capex. Capex became one of the first companies to capitalize on that change in the marketplace. Initially, they intended to offer products for multiple vendors' platforms but soon found that economically it made sense to focus only on the dominant IBM mainframe.
Early executives of Capex Corporation included
Russell E. Edwards and John J. Anderson. The office for the company was located on 3rd Street, in the Midtown Phoenix neighborhood near the Central Avenue Corridor. The company said that it became profitable during 1971.
Products
By 1976, Capex Corporation employed forty people, had sales offices in various cities in the United States and Canada, and had resellers overseas. Capex's products were focused on IBM's OS/MVS operating system and they benefited from having a sales force dedicated to selling on and for that platform. The company began to grow rapidly. By 1978, they had around 100 employees and began building a new $2 million, dedicated building for the company, with room to at least double its size. The new office, further north and east in Midtown at 14th Street and Indian School Road, replaced the 3rd Street office and a second facility on Thomas Road.
The company offered both system software products and application software products.
Optimizer
The Cobol Optimizer was first released in late 1970 and soon achieved visibility within the computing industry. The Optimize |
https://en.wikipedia.org/wiki/Georg%20Hajdu | Georg Hajdu (born 21 June 1960) is a German composer of Hungarian descent. His work is dedicated to the combination of music, science and computer technology. He is noted for his opera and the network music performance environment Quintet.net.
Biography
Hajdu was born in Göttingen to Hungarian parents who had fled their country in 1956. He grew up in Cologne where he obtained diplomas in molecular biology and musical composition from the University of Cologne and the Cologne Musikhochschule, resp. A stipend by the German Academic Exchange Service enabled him to enter the graduate program in composition at the University of California, Berkeley in 1990, working closely with the Center for New Music and Audio Technologies (CNMAT) and eventually obtaining a Ph.D. in 1994. His teachers include Georg Kröll, Johannes Fritsch, Krzysztof Meyer, Clarence Barlow, Andrew Imbrie, Jorge Liderman and David Wessel. He also audited classes with György Ligeti in Hamburg.
In 1996, following residencies at IRCAM and the ZKM, Karlsruhe, he co-founded the Ensemble WireWorks with his wife, pianist Jennifer Hymer—a group specializing in the performance of mixed-media composition. In 1999, he produced his full-length opera , for which author and film director Thomas Brasch wrote the libretto. In May 2002, his interactive networked performance environment was employed in a Munich Biennale opera performance.
In 2004, he instigated the development of the Bohlen–Pierce clarinet and in 2005 he co-founded the European Bridges Ensemble for networked music performance.
In addition to his compositions, which are characterized by a pluralistic attitude and have earned him several international prizes, the IBM-prize of the Ensemble Modern (1990) among them, Hajdu published articles on several topics on the borderline of music and science. His areas of interest include multimedia, microtonality, algorithmic, interactive and networked music performance. He has been directing a number of international projects with media centers and universities in Europe and the USA.
In 2010, he was visiting professor at Northeastern University and artist in residence at the Goethe-Institut in Boston.
Currently, Georg Hajdu is professor of multimedia composition and music theory at the Hamburg Hochschule of Music and Theater. He organized the Sound and Music Computing Conference and Summer School 2016.
Works
Compositions (selection)
Blueprint for soprano saxophone, electric guitar, double bass, piano, percussion, electronics and video (2009)
Radio Music (adaptation of John Cage's Radio Music for network ensemble008)
Beyond the Horizon for 2 Bohlen–Pierce clarinets and synthesizer (2008)
Ivresse '84 for violin and laptop quartet (2007)
Corpus Callosum for recorder, viola da gamba, bass clarinet and harpsichord (2006)
Tsunami for recorder or toy piano and live electronics (2006–8)
Light Blue for piano (2001–2004)
Dichrome Blue
Blue Marble
Kalim’balu
Mindtrip for Quintet.net (2000–)
|
https://en.wikipedia.org/wiki/Raffaele%20Cecco | Raffaele Cecco (born 10 May 1967) is a British video games developer who has created numerous video games since 1984, including Cybernoid and Exolon. He grew up in Tottenham in North London. Spurred by an interest in computers, he received his first computer, a Sinclair ZX81, as a birthday gift from his parents in 1981 and began programming simple games in BASIC.
Due to the popularity of Cecco's video games he was asked to write a monthly diary for CRASH magazine, the first installment being 15 April 1988. The diary documented the development of Stormlord.
Partial list of games
These are games that Cecco has developed or been closely associated with.
Equinox (1986, Mikro-Gen)
Exolon (1987, Hewson Consultants)
Cybernoid (1988, Hewson Consultants)
Stormlord (1989, Hewson Consultants)
Deliverance: Stormlord II (1990, Hewson Consultants)
First Samurai (1991, Vivid Image)
Second Samurai (1993, Vivid Image)
Street Racer (1994, Vivid Image)
Agent Armstrong (1997, King of the Jungle)
Invasion From Beyond (1998, King of the Jungle)
Galaga: Destination Earth (2000, King of the Jungle)
Championship Manager Quiz (2001, King of the Jungle)
Grooverider: Slot Car Thunder (2003, King of the Jungle)
A compilation of his games, Cecco's Collection, was released by Hewson in 1990, and included Exolon, Cybernoid, Cybernoid II, and Stormlord. Your Sinclair awarded this compilation 92%, describing it as a fine three-year collection of Cecco's achievements and a succinct history of Spectrum programming to that date. The reviewer, Andy Ide, also considered Cecco as one of the Spectrum's biggest stars.
References
External links
CRASH issue 59 at CRASH Online; Programmers on Programmers article
Amstrad Cent pour Cent issue 14; an interview
1967 births
British video game designers
British video game programmers
Living people |
https://en.wikipedia.org/wiki/Data%20deficient | A data deficient (DD) species is one which has been categorized by the International Union for Conservation of Nature (IUCN) as offering insufficient information for a proper assessment of conservation status to be made. This does not necessarily indicate that the species has not been extensively studied; but it does indicate that little or no information is available on the abundance and distribution of the species.
The IUCN recommends that care be taken to avoid classing species as "data deficient" when the absence of records may indicate dangerously low abundance: "If the range of a taxon is suspected to be relatively circumscribed, if a considerable period of time has elapsed since the last record of the taxon, threatened status may well be justified" (see also precautionary principle).
See also
IUCN Red List data deficient species
List of data deficient amphibians
IUCN Red List data deficient species (Annelida)
List of data deficient arthropods
List of data deficient birds
IUCN Red List data deficient species (Cnidaria)
List of data deficient fishes
List of data deficient insects
List of data deficient invertebrates
List of data deficient mammals
List of data deficient molluscs
List of data deficient plants
List of data deficient reptiles
References
External links
IUCN Red List
Biota by conservation status |
https://en.wikipedia.org/wiki/Kaissa | Kaissa () was a chess program developed in the Soviet Union in the 1960s. It was named so after Caissa, the goddess of chess. Kaissa became the first world computer chess champion in 1974 in Stockholm.
History
By 1967, a computer program by Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman and Anatoly Uskov on the M-2 computer in Alexander Kronrod’s laboratory at the Institute for Theoretical and Experimental Physics had defeated Kotok-McCarthy running on the IBM 7090 at Stanford University. By 1971, Mikhail Donskoy joined with Arlazarov and Uskov to program its successor on an ICL System 4/70 at the Institute of Control Sciences. In 1972 the program played a correspondence match against readers of popular Russian newspaper, Komsomolskaya Pravda. The readers won, 1½-½. It was the journalists of Komsomolskaya Pravda who gave the program its name, Kaissa.
Kaissa became the first world computer chess champion in 1974 in Stockholm. The program won all four games and finished first ahead of programs "Chess 4", "Chaos" and "Ribbit", which got 3 points. After the championship, Kaissa and Chess 4 played a game, which ended in a draw. The success of Kaissa can be explained by the many innovations it introduced. It was the first program to use bitboards. Kaissa contained an opening book with 10,000 moves and used a novel algorithm for move pruning. Also it could search during the opponent's move, used null-move heuristic and had sophisticated algorithms for time management. All this is common in modern computer chess programs, but was new at that time.
The last time when Kaissa participated in WCCC was its third championship, 1980 in Linz, where it finished tied for sixth to eleventh place in a field of eighteen competitors. The development of Kaissa was stopped after that due to a decision by Soviet government that the programmer's time was better spent working on practical projects.
An IBM PC version of Kaissa was developed in 1990. It took fourth place in the 2nd Computer Olympiad in London in 1990.
Notable games
The second computer chess championship in 1977 in Toronto, featured an unusual game by Kaissa. In the diagram at right, Kaissa (black) was well ahead of its opponent, DUCHESS from Duke University. Kaissa was well ahead on the chess clock, but it gave away a rook with 34...Re8 and lost afterwards. After programmers entered the obvious move 34...Kg7 into the program, Kaissa explained why it did not play it: 34...Kg7 35. Qf8+!! Kxf8 36. Bh6+ Bg7 37. Rc8+ and White checkmates in two moves. This caused a sensation and was published in many chess magazines of that time. None of the human spectators present saw this nice queen sacrifice. Despite this, Kaissa finished the tournament tied for second place with DUCHESS, behind Chess 4.6.
See also
Chess engine
References
External links
The chess games of Kaissa
Kaissa at Chess Programming Wiki
Photo: CHAOS vs Kaissa at the 1st World Computer Chess Championship in Stockholm,
Ph |
https://en.wikipedia.org/wiki/International%20Coordination%20Meeting%20of%20Youth%20Organisations | The International Coordination Meeting of Youth Organisations (ICMYO) is an international network for the world's largest youth movements and regional youth platforms. It was founded officially in 2004, and further strengthened in 2013. The network claims to:
The organization is aimed to unite and represent the diverse voices of youth-led organisations globally, by providing a platform for coordination and cooperation in order to have a stronger influence on global youth policy processes and to achieve full partnerships between youth organisations and relevant stakeholders.
The main objectives of ICMYO are:
- To represent the diverse voices of youth-led organisations globally
- Cooperation among youth-led organisations at regional and global levels
- Coordination of political inputs to global youth policy
Currently, the network meets once a year in an annual meeting which is organised by a task force elected the year before by the members.
Members
There are two types of full member and two types of associate membership (there are no associate members at the moment).
Regional Youth Platforms
International Non-Governmental Youth Organisations
See also
Youth voice
Youth participation
References
External links
ICMYO Website
Youth empowerment organizations
International nongovernmental youth organizations |
https://en.wikipedia.org/wiki/TWiT.tv | TWiT.tv, which is the operating trade name of TWiT LLC, is a podcast network that broadcasts many technology news podcasts, founded by technology broadcaster and author Leo Laporte in 2005, and run by his wife and company CEO Lisa Laporte. The network began operation in April 2005 with the launch of This Week in Tech. Security Now was the second podcast on the network, debuting in August of that year. The network hosts 28 podcasts (as of July, 2020) though the number had fallen in half to only 14 regularly scheduled shows by January 2021. Podcasts include The Tech Guy, This Week in Tech, This Week in Enterprise Tech, Security Now, FLOSS Weekly, and MacBreak Weekly. In addition to shows on technology news, TWiT also has podcasts like Hands-On Photography".
TWiT founder and owner Leo Laporte, in an October 2009 speech, stated that it grossed revenues of $1.5 million per year, while costs were around $350,000. In November 2014, during an interview with American Public Media's Marketplace Leo Laporte stated that TWiT makes $6 million in ad revenue a year from 5 million TWiT podcasts downloaded each month, mostly in the form of audio, and that 3,000 to 4,000 people watch its live-streamed shows. On March 18, 2015, prior to the filming of This Week in Google, Leo Laporte stated that TWiT expects to make $7 million in revenue in fiscal year 2015, and made "almost" $10 million in revenue in 2016.
TWiT gets its name from its first and flagship podcast, This Week in Tech. The logo design originated from a traditional logic gate symbol of an "AND gate" turned on its side. Voiceovers are provided by Jim Cutler.
Programming
TWiT's podcasts are centered around technology and technology news. Hosts of the shows are usually experts in certain fields, either by working in the field itself or by being a journalist covering the field.
As of August 2019, there are 17 podcasts produced by TWiT.
All the shows are available free to watch or download from the TWiT.tv website and are funded by cost per mille embedded sponsorship. Most of the shows are livestreamed from the TWiT studio in Petaluma, California. TWiT's servers host the network's chat rooms using the Internet Relay Chat.
On April 18, 2021, Leo Laporte announced a new paid tier called "Club TWiT" which allows access to member-only podcasts, ad-free podcast feeds, and a members-only Discord server.
Shows
The TWiT Network is host to the following shows
Retired Shows
The following are the shows that have been retired from the network:
Litigation
In May 2017, Twitter announced that it would deliver original video content on its platform. Lawyers from TWiT believed this violated a spoken agreement between Leo Laporte and Twitter co-founder Evan Williams made in 2009, and infringed on TWiT's trademark. TWiT tried to informally resolve the trademark issue, and in January 2018 filed a trademark infringement lawsuit against Twitter.
In March 2018 Twitter filed a motion to dismiss. On May 30, 2018, US Magi |
https://en.wikipedia.org/wiki/Spellbound%21 | Spellbound! is an educational computer game made and distributed by The Learning Company aimed at teaching spelling, vocabulary, and language development to children ages 7 to 12 years. The objective of the game is to play spelling-related games to qualify and compete for successively higher bracket spelling bees, concluding with the player competing in the national spelling bee. The original game, released in 1991, was compatible with computers running DOS 3.3 or higher. A 1993 CD release added spoken dialogue and was compatible with Windows 95 and Macintosh.
Plot
Morty Maxwell along with his robots are entering Shady Glen school's Spelling Bee in the hopes of outspelling everyone. The Super Solvers aim to sharpen their skills and beat Morty at his own game in Washington, D.C., with the aid of a Spellbinder computer.
Gameplay
Before starting the game, the player can choose which topics and word lists to use. Additionally, the player can create customized lists. Then the player can choose one of three difficulty levels, which affect how many spelling problems need to be solved throughout the game. To qualify for a spelling bee, the player must first earn a set number of points by playing spelling-related activities. These activities include:
Criss Cross (also called "Work it out!") – a crossword-type puzzle
Flash Cards (also called "Watch it Flash!") – where the player must recall the word shown
Word search (also called "Find them All!") – finding words hidden in a box of letters
Once in the spelling bee (also called "Take a Trip!"), the player will be contested by two other players and must correctly type words flashed out or vocally spoken to win the game. When the spelling bee is completed, the player moves on to the next level to prepare for another spelling bee. There are five levels of spelling bees in the game. As the levels get higher, the activities become harder.
Release
Spellbound! was released along with an Adlib Sound Card in "The Learning Company's Family Sound Value Pack".
Reception
Spellbound! was reviewed in the Oppenheim Toy Portfolio Guide Book where it was praised for its "state of the arts" graphics and sound support. The reviewers noted that it takes a lot to make learning how to spell fun, "but the Learning Company has done it!" Moderately well received, the game received two and a half stars out of five from Allgame.
References
External links
1991 video games
Apple II games
Children's educational video games
DOS games
Classic Mac OS games
North America-exclusive video games
Windows games
Spelling competitions
The Learning Company games
Video games developed in the United States
Single-player video games |
https://en.wikipedia.org/wiki/Minimum%20redundancy%20feature%20selection | Minimum redundancy feature selection is an algorithm frequently used in a method to accurately identify characteristics of genes and phenotypes and narrow down their relevance and is usually described in its pairing with relevant feature selection as Minimum Redundancy Maximum Relevance (mRMR).
Feature selection, one of the basic problems in pattern recognition and machine learning, identifies subsets of data that are relevant to the parameters used and is normally called Maximum Relevance. These subsets often contain material which is relevant but redundant and mRMR attempts to address this problem by removing those redundant subsets. mRMR has a variety of applications in many areas such as cancer diagnosis and speech recognition.
Features can be selected in many different ways. One scheme is to select features that correlate strongest to the classification variable. This has been called maximum-relevance selection. Many heuristic algorithms can be used, such as the sequential forward, backward, or floating selections.
On the other hand, features can be selected to be mutually far away from each other while still having "high" correlation to the classification variable. This scheme, termed as Minimum Redundancy Maximum Relevance (mRMR) selection has been found to be more powerful than the maximum relevance selection.
As a special case, the "correlation" can be replaced by the statistical dependency between variables. Mutual information can be used to quantify the dependency. In this case, it is shown that mRMR is an approximation to maximizing the dependency between the joint distribution of the selected features and the classification variable.
Studies have tried different measures for redundancy and relevance measures. A recent study compared several measures within the context of biomedical images.
References
External links
Peng, H.C., Long, F., and Ding, C., "Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy," IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 27, No. 8, pp. 1226–1238, 2005.
Chris Ding and Hanchuan Peng, "Minimum Redundancy Feature Selection from Microarray Gene Expression Data". 2nd IEEE Computer Society Bioinformatics Conference (CSB 2003), 11–14 August 2003, Stanford, CA, USA. Pages 523–529.
Penglab mRMR
Machine learning algorithms
zh:最小冗余特征选择 |
https://en.wikipedia.org/wiki/Warsaw%20Barbican | The Warsaw Barbican () is a barbican (semicircular fortified outpost) in Warsaw, Poland, and one of few remaining relics of the complex network of historic fortifications that once encircled Warsaw. Located between the Old and New Towns, it is a major tourist attraction.
History
The barbican was erected in 1540 in place of an older gate to protect Nowomiejska Street. It was designed by Jan Baptist the Venetian, an Italian Renaissance architect who lived and worked in the Mazowsze region of 16th century Poland and was instrumental in the redesign of the 14th-century city walls, which by that time had fallen into disrepair. The barbican had the form of a three-level semicircular bastion manned by fusiliers. It was 14 meters wide and 15 meters high from the bottom of the moat, which surrounded the city walls, and extended 30 meters from the external walls.
Almost immediately after its inception, the 4-tower barbican became an anachronism serving virtually no practical purpose. This was largely a result of the rapid advancement in artillery power. It was used in the defense of the city only once, during the Swedish invasion of Poland, on 30 June 1656, when it had to be recaptured by the Polish army of Polish king John II Casimir from the Swedes.
In the 18th century, the barbican was partially dismantled as its defensive value was negligible, and the city benefited more from a larger gate which facilitated movement of people and goods in and out of the city. In the 19th century, its remains were incorporated into newly built apartment buildings (kamienica). During the interwar period, in 1937–1938, Jan Zachwatowicz reconstructed part of the walls and the western part of the bridge, demolishing one of the newer buildings in the reconstruction process. However, a lack of funds delayed the barbican's planned complete reconstruction, and the 1939 invasion of Poland by Nazi Germany put the plans on hold.
During World War II, particularly the Siege of Warsaw (1939) and the Warsaw Uprising of 1944, the barbican was largely destroyed, as were most of the Old Town's buildings. It was rebuilt after the war, during 1952–1954, on the basis of 17th-century etchings, as the new government decided it would be cheaper to rebuild the barbican and the nearby city walls as a tourist attraction than to rebuild the tenements. In its reconstruction, bricks were used from historic buildings demolished in the cities of Nysa and Wrocław; most of the barbican was rebuilt, save for two exterior gates and the oldest tower on the side of the Old Town. It is currently a popular tourist attraction.
See also
Kraków Barbican: the largest barbican in Poland. (Warsaw's is the second-largest.)
External links
Barbican of Warsaw at www.virtualtourist.com
The Warsaw Barbican
History of Barbacan and archival photos
Buildings and structures in Warsaw
Barbicans |
https://en.wikipedia.org/wiki/Le%20Banquier | Le Banquier () was a Canadian game show and the Quebec adaptation of the international game show Deal or No Deal. It debuted on January 24, 2007 at 9 pm on the TVA network. The program, produced in Montreal, Quebec by JPL Production II Inc. and Endemol USA for TVA, is hosted by Julie Snyder. The show's main sponsors are Vidéotron, Hyundai, Maxi, Nissan, Capital One and Sunwing.
The show's first season ended on March 29, 2007. During the first season, episodes aired on Wednesdays at 9 pm and Thursdays at 8 pm. During the second season, episodes aired on Sundays at 7 pm and Thursdays at 8 pm.
Gameplay
As this version of the franchise is produced by the US arm of Endemol, the rules are played similar to the American version: the number of cases opened in each round starts with six cases in round one, then five in round two, and so on, all the way down to one case in round six and subsequent rounds. The game is practically the same as the American version, except that the largest cash prize is $500,000 (originally to have been $250,000) and it is tax-free Canadian money. Of the 26 models, 6 of them are men, holding cases 21 through 26. This is in contrast to the other versions airing in North America that use permanent models (Deal or No Deal, Vas o No Vas, Deal or No Deal Canada), where all models are women. (Note that the US daytime version, which closely resembles the British version, uses 22 cases held by the potential contestants.)
Like the US version, some of the offers may be prizes, in addition to, or instead of, a cash offer—as with the US show, the prizes tend to be what the contestant wants. For example: on the first episode on January 24, 2007, one contestant was offered $15,000, plus a mountain bike worth $1,000 (as there was an ET joke going on), plus tickets to see the Montreal Canadiens NHL hockey team play an upcoming game with the Carolina Hurricanes.
The highest amount won on the show thus far is $240,000, through a bank offer. On the final episode of the first season on March 29, 2007, the last contestant played for a top prize of $750,000 (replacing the $125,000). Before February 21, 2007, there was a $2,500 amount on the board which was then replaced with $125,000.
In addition, like in its US counterpart, there may also be some special prizes not attached to any offer. In the first episode, then-Canadiens' defenceman Sheldon Souray (now with the Edmonton Oilers) appeared in a video to wish a contestant luck and gave him an autographed hockey stick, not attached to any offer. Another example would be a contestant who was offered a trip for 5 people to Las Vegas, tickets to see Celine Dion's show and the chance to meet Celine in person. A premise unique to this version is that if an offer with a prize attached is rejected by the contestant, then a member of the audience (via random draw) will win the prize. Le Banquier was also used as a venue to propose a marriage: during the second offer of the second game on the debut Jan |
https://en.wikipedia.org/wiki/Aubrey%20%28The%20X-Files%29 | "Aubrey" is the twelfth episode of the second season of the American science fiction television series The X-Files, and the thirty-sixth episode overall. It premiered on the Fox network in the United States on . It was written by Sara B. Charno and directed by Rob Bowman. The episode is a "Monster-of-the-Week" story, unconnected to the series' wider mythology. "Aubrey" received a Nielsen rating of 10.2 and was watched by 9.7 million households. The episode received mixed to positive reviews from television critics.
The show centers on FBI special agents Fox Mulder (David Duchovny) and Dana Scully (Gillian Anderson) who work on cases linked to the paranormal, called X-Files. Mulder is a believer in the paranormal, while the skeptical Scully has been assigned to debunk his work. In the episode, Mulder and Scully believe that a serial killer from the 1940s passed his genetic trait of violence to his grandchild after a detective, BJ Morrow (Deborah Strang) mysteriously uncovers the remains of an FBI agent who disappeared almost fifty years before while investigating a modern-day murder case similar to the older cold case.
Although "Aubrey" was written by Charno, Glen Morgan and James Wong, who had written for The X-Files before, provided additional contributions to the story. The story for the episode developed around the concept of 50-year-old murders and the transfer of genetic memory. This was later combined with a separate concept about a female serial killer. Terry O'Quinn, who guest stars in the episode, would later play roles in the 1998 feature film, the ninth season episode "Trust No 1", become a recurring character as Peter Watts on Millennium, and appear on the short-lived series Harsh Realm. Strang's work on the episode was submitted for Emmy consideration.
Plot
In the town of Aubrey, Holt County, Missouri, local detective Betty June "B.J." Morrow tells Lt. Brian Tillman (Terry O'Quinn) that she has gotten pregnant from their affair. He requests her to meet him at a motel later that night. While waiting for him, B.J. has a vision that leads her to a field where she digs up the skeletal remains of an FBI agent.
Agents Fox Mulder (David Duchovny) and Dana Scully (Gillian Anderson) head to Aubrey, where the remains are identified as belonging to Agent Sam Chaney, who disappeared in the area with his partner, Tim Ledbetter, in 1942. The agents find discrepancies in B.J.'s story, but Tillman comes to her defense. Mulder tells Scully of the case Chaney and Ledbetter were investigating, which involved the rapes and murders of three women with the word "Sister" slashed on their chest. Discovering similar cuts on Chaney's chest during the autopsy, B.J. instinctively realizes that the cuts spell the word "Brother." B.J. admits her affair and pregnancy to Scully.
Tillman reveals that a new murder has occurred where a woman had the word "Sister" slashed on her chest. B.J. claims to have seen the victim in her dreams, which involve a man with a |
https://en.wikipedia.org/wiki/Gran%20Turismo%20%282009%20video%20game%29 | is a 2009 racing video game developed by Polyphony Digital and published by Sony Computer Entertainment for the PlayStation Portable. The game was announced at Sony's E3 press conference on May 11, 2004, alongside the original PSP. Following five years of delays and speculation, during which it was variously known as Gran Turismo Portable, Gran Turismo 4 Mobile, Gran Turismo 5 Mobile and Gran Turismo 4.5, it made a reappearance at E3 on June 2, 2009, in playable form. It was released on October 1, 2009, as one of the launch titles for the new PSP Go. As of September 2017, Gran Turismo has sold 4.67 million units, making it one of the best-selling PSP games. On June 1, 2010, the game was re-released as part of Sony's Greatest Hits budget line of video games.
Gameplay
The game is centered on an open-ended design. The single player menu presents players with three variables: mode (Time Trial, Single Race, and Drift Trial), car, and track selection. Rewards such as credits and cars earned based on the difficulty, performance and number of laps they have chosen. Players can select from one to 99 laps. Gran Turismo is centered on completing driving missions in order to advance in the game, unlike Gran Turismo 4'''s open-ended map. The game uses a new trading system to allow players to acquire cars.
There are 45 tracks (including layout variations) plus the added bonus of reverse on most tracks, which takes the track number to 72. For the first time in the series, the game features the use of custom soundtracks that enables players to play their own songs while racing, but this option must first be unlocked by completing section B or C of the Driving Challenges. The music tracks can be used for offline or online races. There are some hidden tracks which are removed prior to release (notably Smokey Mountain and Tahiti Circuit from Gran Turismo 3: A-Spec - both which initially debuted in Gran Turismo 2 with some differences). These tracks are only accessible on systems with modified firmware and running Gameshark-like programs, and some issues have been reported with them. During an interview at E3, it was revealed that tracks featured in the game (such as Valencia Ricardo Tormo) are directly sourced from Gran Turismo 4 and Tourist Trophy, while the game's physics engine is based on Gran Turismo 5 Prologue.Gran Turismo features 833 vehicles, each modeled accurately and statistics derived from their real life counterparts. The exotic car manufacturer Ferrari is featured, and for the first time in the main Gran Turismo series, Lamborghini, Bugatti and various other cars were introduced and fully licensed. There is no damage model in the game. Players begin with a low-powered car, but can upgrade to better cars as they progress through the game. The dealerships available change after every other race, so players will not always be able to buy what they are looking for.
Four cars are featured in a race at any one time, the player car and three opponents |
https://en.wikipedia.org/wiki/UDP-Lite | UDP-Lite (Lightweight User Datagram Protocol) is a connectionless protocol that allows a potentially damaged data payload to be delivered to an application rather than being discarded by the receiving station. This is useful as it allows decisions about the integrity of the data to be made in the application layer (application or the codec), where the significance of the bits is understood. UDP-Lite is described in .
Protocol
UDP-Lite is based on User Datagram Protocol (UDP), but unlike UDP, where either all or none of a packet is protected by a checksum, UDP-Lite allows for partial checksums that only covers part of a datagram (an arbitrary count of octets at the beginning of the packet), and will therefore deliver packets that have been partially corrupted. It is designed for multimedia protocols, such as Voice over IP (VoIP) or streamed video, in which receiving a packet with a damaged payload is better than receiving no packet at all. For conventional UDP and Transmission Control Protocol (TCP), a single bit in error will cause a "bad" checksum, meaning that the whole packet must be discarded: in this way, bit errors are "promoted" to entire packet errors even where the damage to the data is trivial. For computing the checksum UDP-Lite uses the same checksum algorithm used for UDP (and TCP).
Modern multimedia codecs, like G.718 and Adaptive Multi-Rate (AMR) for audio and H.264 and MPEG-4 for video, have resilience features already built into the syntax and structure of the stream. This allows the codec to (a) detect errors in the stream and (b) potentially correct, or at least conceal, the error during playback. These codecs are ideal partners for UDP-Lite, since they are designed to work with a damaged data stream, and it is better for these codecs to receive perhaps 200 bytes where a few bits are damaged rather than have to conceal the loss of an entire packet that was discarded due to a bad checksum. The application layer understands the significance of the data, where the transport only sees UDP packets. This means that error protection can be added if necessary at a higher layer, for example with a forward error correction scheme. The application is the best place to decide which parts of the stream are most sensitive to error and protect them accordingly, rather than have a single "brute force" checksum that covers everything equally. An example of this can be seen in research by Hammer et al. where UDP-Lite is coupled with the AMR codec to give improved speech quality in lossy network conditions.
Since most modern link layers protect the carried data with a strong cyclic redundancy check (CRC) and will discard damaged frames, making effective use of UDP Lite requires the link layer to be aware of the network layer data being carried. Since no current IP stacks implement such cross-layer interactions, making effective use of UDP-Lite currently requires specially modified device drivers.
The IP protocol identifier is 136. UDP-Lite us |
https://en.wikipedia.org/wiki/Fresh%20Bones | "Fresh Bones" is the fifteenth episode of the second season of the science fiction television series The X-Files. It premiered on the Fox network on February 3, 1995. It was written by Howard Gordon, directed by Rob Bowman, and featured guest appearances by Kevin Conway, Daniel Benzali, and Matt Hill. The episode is a "Monster-of-the-Week" story, unconnected to the series' wider mythology. "Fresh Bones" earned a Nielsen household rating of 11.3, being watched by 10.8 million households in its initial broadcast. The episode received mixed to positive reviews from critics.
The show centers on FBI special agents Fox Mulder (David Duchovny) and Dana Scully (Gillian Anderson) who work on cases linked to the paranormal, called X-Files. In the episode, Mulder and Scully discover a voodoo symbol drawn on a tree after a soldier, Private Jack McAlpin, crashes his car into it following two separate hallucinatory incidents. This leads the two to a processing center for Haitian refugees where suspicion falls on one of the Haitians identified by the colonel in charge.
Howard Gordon was inspired to write the episode after reading two articles involving suicides of servicemen in Haiti. The Haitian refugee camp was shot in a derelict building in a North Vancouver shipyard; originally, the producers wanted to set the episode in Haiti and actually film in the country. This endeavor, however, proved unsuccessful.
Plot
In Folkstone, North Carolina, Jack McAlpin, an agitated Marine Corps private, drives his car into a tree after several hallucinatory episodes and is apparently killed. On the tree is a veve, a drawn voodoo religious symbol.
McAlpin is the second purported suicide among troops stationed at an INS compound processing refugees from Haiti. Fox Mulder and Dana Scully visit the compound to investigate McAlpin's death. There, a young boy named Chester Bonaparte sells a good luck charm to Mulder. After meeting with Colonel Wharton, head of the compound, Mulder meets with an imprisoned refugee, Pierre Bauvais, and an associate of McAlpin's, Harry Dunham. When Scully attempts to perform an autopsy on McAlpin's body, she finds a dog carcass in its place at the morgue.
While driving down the road, Mulder and Scully discover a still-living McAlpin, who doesn't remember what has happened to him. Tetrodotoxin, a chemical Mulder believes is part of Haitian zombification rituals, is found in McAlpin's blood. The agents go to the local graveyard to investigate the corpse of the other dead soldier, but find the grave robbed. They also find Chester, who collects frogs at the cemetery and sells them to Bauvais. Dunham approaches Mulder, telling him that Wharton has begun abusing the refugees as a means of retaliation against Bauvais; Wharton denies the accusations, but later has Bauvais beaten to death.
Scully cuts her hand on the thorn of a twig left in her car. When she drives off, a veve is seen on the ground under her car. Mulder has a meeting with X, who tells |
https://en.wikipedia.org/wiki/Steve%20Clark%20%28animator%29 | Steve Clark is a cartoon animator and director. His first credit was The Dick Tracy Show.
External links
Steve Clark at the Internet Movie Database
American animators
American animated film directors
Possibly living people
Place of birth missing
Year of birth missing |
https://en.wikipedia.org/wiki/Assortativity | Assortativity, or assortative mixing, is a preference for a network's nodes to attach to others that are similar in some way. Though the specific measure of similarity may vary, network theorists often examine assortativity in terms of a node's degree. The addition of this characteristic to network models more closely approximates the behaviors of many real world networks.
Correlations between nodes of similar degree are often found in the mixing patterns of many observable networks. For instance, in social networks, nodes tend to be connected with other nodes with similar degree values. This tendency is referred to as assortative mixing, or assortativity. On the other hand, technological and biological networks typically show disassortative mixing, or disassortativity, as high degree nodes tend to attach to low degree nodes.
Measurement
Assortativity is often operationalized as a correlation between two nodes. However, there are several ways to capture such a correlation. The two most prominent measures are the assortativity coefficient and the neighbor connectivity. These measures are outlined in more detail below.
Assortativity coefficient
The assortativity coefficient is the Pearson correlation coefficient of degree between pairs of linked nodes. Positive values of r indicate a correlation between nodes of similar degree, while negative values indicate relationships between nodes of different degree. In general, r lies between −1 and 1. When r = 1, the network is said to have perfect assortative mixing patterns, when r = 0 the network is non-assortative, while at r = −1 the network is completely disassortative.
The assortativity coefficient is given by . The term is the distribution of the remaining degree. This captures the number of edges leaving the node, other than the one that connects the pair. The distribution of this term is derived from the degree distribution as . Finally, refers to the joint probability distribution of the remaining degrees of the two vertices. This quantity is symmetric on an undirected graph, and follows the sum rules and .
In a Directed graph, in-assortativity () and out-assortativity () measure the tendencies of nodes to connect with other nodes that have similar in and out degrees as themselves, respectively. Extending this further, four types of assortativity can be considered (see ). Adopting the notation of that article, it is possible to define four metrics , , , and . Let , be one of the in/out word pairs (e.g. ). Let be the number of edges in the network. Suppose we label the edges of the network . Given edge , let be the -degree of the source (i.e. tail) node vertex of the edge, and be the -degree of the target (i.e. head) node of edge . We indicate average values with bars, so that , and are the average -degree of sources, and -degree of targets, respectively; averages being taken over the edges of the network. Finally, we have
Neighbor connectivity
Another means of capturing the degre |
https://en.wikipedia.org/wiki/Multi-master%20bus | A multi-master bus is a computer bus in which there are multiple bus master nodes present on the bus.
This is used when multiple nodes on the bus must initiate transfer.
For example, direct memory access (DMA) is used to transfer data between peripherals and memory without the need to use the central processing unit (CPU).
Some buses like I²C use multi-mastering inherently to allow any node to initiate a transfer with another node.
Computer buses
References |
https://en.wikipedia.org/wiki/Gradient%20network | In network science, a gradient network is a directed subnetwork of an undirected "substrate" network where each node has an associated scalar potential and one out-link that points to the node with the smallest (or largest) potential in its neighborhood, defined as the union of itself and its neighbors on the substrate network.
Definition
Transport takes place on a fixed network called the substrate graph. It has N nodes, and the set
of edges . Given a node i, we can define its set of neighbors in G by Si(1) = {j ∈ V | (i,j)∈ E}.
Let us also consider a scalar field, h = {h0, .., hN−1} defined on the set of nodes V, so that every node i has a scalar value hi associated to it.
Gradient ∇hi on a network: ∇hi(i, μ(i))
i.e. the directed edge from i to μ(i), where μ(i) ∈ Si(1) ∪ {i}, and hμ has the maximum value in .
Gradient network : ∇ ∇
where F is the set of gradient edges on G.
In general, the scalar field depends on time, due to the flow, external sources and sinks on the network. Therefore, the gradient network ∇ will be dynamic.
Motivation and history
The concept of a gradient network was first introduced by Toroczkai and Bassler (2004).
Generally, real-world networks (such as citation graphs, the Internet, cellular metabolic networks, the worldwide airport network), which often evolve to transport entities such as information, cars, power, water, forces, and so on, are not globally designed; instead, they evolve and grow through local changes. For example, if a router on the Internet is frequently congested and packets are lost or delayed due to that, it will be replaced by several interconnected new routers.
Moreover, this flow is often generated or influenced by local gradients of a scalar. For example: electric current is driven by a gradient of electric potential. In information networks, properties of nodes will generate a bias in the way of information is transmitted from a node to its neighbors. This idea motivated the approach to study the flow efficiency of a network by using gradient networks, when the flow is driven by gradients of a scalar field distributed on the network.
Recent research investigates the connection between network topology and the flow efficiency of the transportation.
In-degree distribution of gradient networks
In a gradient network, the in-degree of a node i, ki (in) is the number of gradient edges pointing into i, and the in-degree distribution is .
When the substrate G is a random graph and each pair of nodes is connected with probability P (i.e. an Erdős–Rényi random graph), the scalars hi are i.i.d. (independent identically distributed) the exact expression for R(l) is given by
In the limit and , the degree distribution becomes the power law
This shows in this limit, the gradient network of random network is scale-free.
Furthermore, if the substrate network G is scale-free, like in the Barabási–Albert model, then the gradient network also follow the power-law with the same exponent a |
https://en.wikipedia.org/wiki/Colony%20%28The%20X-Files%29 | "Colony" is the sixteenth episode of the second season of the American science fiction television series The X-Files. It premiered on the Fox network on . It was directed by Nick Marck, and written by series creator Chris Carter based on a story developed by Carter and lead actor David Duchovny. "Colony" featured guest appearances by Megan Leitch, Peter Donat and Brian Thompson. The episode helped explore the series' overarching mythology. "Colony" earned a Nielsen household rating of 10.3, being watched by 9.8 million households in its initial broadcast. "Colony" is a two-part episode, with the plot continuing in the next episode, "End Game".
The show centers on FBI special agents Fox Mulder (Duchovny) and Dana Scully (Gillian Anderson) who work on cases linked to the paranormal, called X-Files. In this episode, Mulder and Scully investigate the murders of human clones working in abortion clinics at the hands of a shapeshifting assassin (Thompson). Mulder receives news that his younger sister Samantha (Leitch), who had been abducted as a child, may have returned.
"Colony" introduced the recurring role of the Alien Bounty Hunter. Actor Brian Thompson auditioned and later won the role. Frank Spotnitz and Carter did not have much time to cast this character, but they knew this casting would be important since he was intended to be a recurring character. Thompson was chosen according to Spotnitz because he had a very "distinctive look" about him, most notably his face and mouth.
Plot
The episode opens in medias res with Fox Mulder in a field hospital in the Arctic. As Mulder is lowered into a tub of water, Dana Scully bursts in and tells the doctors that the cold is the only thing keeping him alive. Suddenly, Mulder's heart monitor flatlines.
Two weeks earlier, in the Beaufort Sea, crewmen on a ship spot a light in the sky that soon crashes into the sea. A body is retrieved from the crash, revealed to be an Alien Bounty Hunter. Two days later, the Bounty Hunter arrives at an abortion clinic in Scranton, Pennsylvania, and kills a doctor by stabbing him in the back of the neck with a stiletto weapon, then sets the building on fire and escapes. Mulder receives emails containing the doctor's obituary along with two other identical doctors. After interviewing a pro-life priest who had threatened one of the doctors, they are able to use a newspaper advertisement looking for one of the men to track another one, Aaron Baker, to Syracuse, New York.
Mulder has a fellow FBI agent, Barrett Weiss, visit Baker's residence. Weiss and Baker are both killed by the Bounty Hunter, who impersonates Weiss and tells Mulder and Scully that no one is home. After Walter Skinner hears of Weiss' death and closes the case, the agents meet CIA official Ambrose Chapel, who tells them that the doctors are clones from a Soviet genetics program and are being systematically killed by the Russian and U.S. governments. Mulder, Scully, and Chapel head to pick up another doctor n |
https://en.wikipedia.org/wiki/Fractal%20dimension%20on%20networks | Fractal analysis is useful in the study of complex networks, present in both natural and artificial systems such as computer systems, brain and social networks, allowing further development of the field in network science.
Self-similarity of complex networks
Many real networks have two fundamental properties, scale-free property and small-world property. If the degree distribution of the network follows a power-law, the network is scale-free; if any two arbitrary nodes in a network can be connected in a very small number of steps, the network is said to be small-world.
The small-world properties can be mathematically expressed by the slow increase of the average diameter of the network, with the total number of nodes ,
where is the shortest distance between two nodes.
Equivalently, we obtain:
where is a characteristic length.
For a self-similar structure, a power-law relation is expected rather than the exponential relation above. From this fact, it would seem that the small-world networks are not self-similar under a length-scale transformation.
Self-similarity has been discovered in the solvent-accessible surface areas of proteins. Because proteins form globular folded chains, this discovery has important implications for protein evolution and protein dynamics, as it can be used to establish characteristic dynamic length scales for protein functionality.
The methods for calculation of the dimension
Generally we calculate the fractal dimension using either the box counting method or the cluster growing method.
The box counting method
Let be the number of boxes of linear size , needed to cover the given network. The fractal dimension is then given by
This means that the average number of vertices within a box of size
By measuring the distribution of for different box sizes or by measuring the distribution of for different box sizes, the fractal dimension can be obtained by a power law fit of the distribution.
The cluster growing method
One seed node is chosen randomly. If the minimum distance is given, a cluster of nodes separated by at most from the seed node can be formed. The procedure is repeated by choosing many seeds until the clusters cover the whole network. Then the dimension can be calculated by
where is the average mass of the clusters, defined as the average number of nodes in a cluster.
These methods are difficult to apply to networks since networks are generally not embedded in another space. In order to measure the fractal dimension of networks we add the concept of renormalization.
Fractal scaling in scale-free networks
Box-counting and renormalization
To investigate self-similarity in networks, we use the box-counting method and renormalization. Fig.(3a) shows this procedure using a network composed of 8 nodes.
For each size lB, boxes are chosen randomly (as in the cluster growing method) until the network is covered, A box consists of nodes all separated by a distance of l < lB, that |
https://en.wikipedia.org/wiki/Spin%20qubit%20quantum%20computer | The spin qubit quantum computer is a quantum computer based on controlling the spin of charge carriers (electrons and electron holes) in semiconductor devices. The first spin qubit quantum computer was first proposed by Daniel Loss and David P. DiVincenzo in 1997, also known as the Loss–DiVincenzo quantum computer. The proposal was to use the intrinsic spin-½ degree of freedom of individual electrons confined in quantum dots as qubits. This should not be confused with other proposals that use the nuclear spin as qubit, like the Kane quantum computer or the nuclear magnetic resonance quantum computer.
Spin qubits so far have been implemented by locally depleting two-dimensional electron gases in semiconductors such a gallium arsenide, silicon and germanium. Spin qubits have also been implemented in graphene.
Loss–DiVicenzo proposal
The Loss–DiVicenzo quantum computer proposal tried to fulfill DiVincenzo's criteria for a scalable quantum computer, namely:
identification of well-defined qubits;
reliable state preparation;
low decoherence;
accurate quantum gate operations and
strong quantum measurements.
A candidate for such a quantum computer is a lateral quantum dot system. Earlier work on applications of quantum dots for quantum computing was done by Barenco et al.
Implementation of the two-qubit gate
The Loss–DiVincenzo quantum computer operates, basically, using inter-dot gate voltage for implementing swap operations and local magnetic fields (or any other local spin manipulation) for implementing the controlled NOT gate (CNOT gate).
The swap operation is achieved by applying a pulsed inter-dot gate voltage, so the exchange constant in the Heisenberg Hamiltonian becomes time-dependent:
This description is only valid if:
the level spacing in the quantum-dot is much greater than ;
the pulse time scale is greater than , so there is no time for transitions to higher orbital levels to happen and
the decoherence time is longer than
is the Boltzmann constant and is the temperature in Kelvin.
From the pulsed Hamiltonian follows the time evolution operator
where is the time-ordering symbol.
We can choose a specific duration of the pulse such that the integral in time over gives and becomes the swap operator
This pulse run for half the time (with ) results in a square root of swap gate,
The "XOR" gate may be achieved by combining operations with individual spin rotation operations:
The operator is a conditional phase shift (controlled-Z) for the state in the basis of . It can be made into a CNOT gate by surrounding the desired target qubit with Hadamard gates.
See also
Kane quantum computer
Quantum dot cellular automaton
References
External links
QuantumInspire online platform from Delft University of Technology, allows building and running quantum algorithms on "Spin-2" a 2 silicon spin qubits processor.
Quantum information science
Quantum dots |
https://en.wikipedia.org/wiki/Interpolation%20%28computer%20graphics%29 | In the context of live-action and computer animation, interpolation is inbetweening, or filling in frames between the key frames. It typically calculates the in-between frames through use of (usually) piecewise polynomial interpolation to draw images semi-automatically.
For all applications of this type, a set of "key points" is defined by the graphic artist. These are values that are rather widely separated in space or time, and represent the desired result, but only in very coarse steps. The computed interpolation process is then used to insert many new values in between these key points to give a "smoother" result.
In its simplest form, this is the drawing of two-dimensional curves. The key points, placed by the artist, are used by the computer algorithm to form a smooth curve either through, or near these points. For a typical example of 2-D interpolation through key points see cardinal spline. For examples which go near key points see nonuniform rational B-spline, or Bézier curve. This is extended to the forming of three-dimensional curves, shapes and complex, dynamic artistic patterns such as used in laser light shows.
The process can be extended to motions. The path of an object can be interpolated by providing some key locations, then calculating many in between locations for a smooth motion. In addition to position, the speed or velocity, as well as accelerations along a path, can be calculated to mimic real-life motion dynamics. Where the subjects are too large or complex to move, the camera position and orientation can be moved by this process. This last is commonly called motion control.
Going further, orientations (rotations) of objects and parts of objects can be interpolated as well as parts of complete characters. This process mimics that used in early cartoon films. Master animators would draw key frames of the film, then, junior animators would draw the in-between frames. This is called inbetweening or tweening and the overall process is called "key frame animation". To make these motions appear realistic, interpolation algorithms have been sought which follow, or approximate real life motion dynamics. This applies to things such as the motion of arms and legs from frame to frame, or the motion of all parts of a face, given the motion of the important, key points of the face. Defining the motion of key strands of hair, spread around an animal, can be made into full fur. Using custom algorithms, motions with unique, unnatural and entertaining visual characteristics can be formed. The color of an object can be defined by key color-locations or frames allowing the computation of smooth color gradients around an object or varying in time. Algorithms such as the Kochanek–Bartels spline provide additional adjustment parameters which allow customizing the in-between behavior to suit a wide variety of situations.
Another important area of this subject is the computational burden of these algorithms. Algorithms w |
https://en.wikipedia.org/wiki/FIAN | FIAN can stand for:
Food First Information and Action Network, an international organisation;
FIAN, a common abbreviation for the Lebedev Physical Institute in Moscow.
Fian, small warrior bands in Irish and Scottish mythology (pl Fianna ) |
https://en.wikipedia.org/wiki/ISO/IEC%209995 | ISO/IEC 9995 Information technology — Keyboard layouts for text and office systems is an ISO/IEC standard series defining layout principles for computer keyboards. It does not define specific layouts but provides the base for national and industry standards which define such layouts.
The project of this standard was adopted at ISO in Berlin in 1985 under the proposition of Dr Yves Neuville. The ISO/IEC 9995 standard series dates to 1994 and has undergone several updates over the years.
Parts
The ISO/IEC 9995 standard series currently (as of September 2015) consists of the following parts:
ISO/IEC 9995-1:2009 General principles governing keyboard layouts
ISO/IEC 9995-2:2009 Alphanumeric section with Amendment 1 (2012) Numeric keypad emulation
ISO/IEC 9995-3:2010 Complementary layouts of the alphanumeric zone of the alphanumeric section
ISO/IEC 9995-4:2009 Numeric section
ISO/IEC 9995-5:2009 Editing and function section
ISO/IEC 9995-7:2009 Symbols used to represent functions with Amendment 1 (2012)
ISO/IEC 9995-8:2009 Allocation of letters to the keys of a numeric keypad
ISO/IEC 9995-9:2016 Multilingual-usage, multiscript keyboard group layouts
ISO/IEC 9995-10:2013 Conventional symbols and methods to represent graphic characters not uniquely recognizable by their glyph on keyboards and in documentation
ISO/IEC 9995-11:2015 Functionality of dead keys and repertoires of characters entered by dead keys
(ISO 9995-6:2006 Function section was withdrawn 2009-10-08.)
ISO/IEC 9995-1
ISO/IEC 9995-1 provides a fundamental description of keyboards suitable for text and office systems, and defines several terms which are used throughout the ISO/IEC 9995 standard series.
Physical division and reference grid
The figure shows the division of a keyboard into sections, which are subdivided into zones.
alphanumeric section
alphanumeric zone (indicated by green coloring)
function zones (indicated by blue coloring)
numeric section
numeric zone (indicated by darker red coloring)
function zone (indicated by lighter red coloring)
editing and function section (in fact covering all parts of the keyboard which do not belong to the alphanumeric or numeric section)
cursor key zone (indicated by darker grey coloring)
editing function zone (indicated by lighter grey coloring)
The presence of a numeric section is not required by the standard. Also, the standard does not prevent a numeric section to be placed left of the alphanumeric section.
By means of the reference grid, each key can be identified by a unique combination of a letter (indicating the row) and a sequence of two digits (indicating the column). E.g., the key containing the digit one on several layouts is identified as “Key E01”. The labeling rules do allow for function keys to be arranged other than above of the alphanumeric section, or to be arranged in more than one row (thus, e.g. an AT keyboard is compliant to the standard):
Columns containing editing or function keys are to be num |
https://en.wikipedia.org/wiki/Semtech | Semtech Corporation is a supplier of analog and mixed-signal semiconductors and advanced algorithms for consumer, enterprise computing, communications and industrial end-markets. It is based in Camarillo, Ventura County, Southern California. It was founded in 1960 in Newbury Park, California. It has 32 locations in 15 countries in North America, Europe, and Asia.
Semtech is the developer of LoRa, a long-range networking initiative for the Internet of Things. As of March 2021, over 178 million devices use LoRa worldwide. LoRa has been used in satellites, tracking of animals, UAV radio control, and natural disaster prediction,
Semtech has been publicly traded since 1967. In 1995, Semtech ranked fifth on the Bloomberg 100 list of top-performing stocks of 1995 on the New York and American stock exchanges and the NASDAQ National Market.
Products
Semtech offers a variety of products, including LoRa, a long-range, low-power networking platform; receivers and transmitters; touch and proximity devices; wireless charging; and power management solutions.
Acquisitions
In December 1999, Semtech bought USAR Systems Inc., a maker of embedded devices for handheld and notebook computers, for $26.7 million in stock.
In March 2012, it bought Gennum Corporation, a supplier of high-speed analog semiconductors, for approximately million (million). In the same month, they acquired Cycleo SAS, a supplier of wireless semiconductor products, for $5 million in cash.
In August 2022, Semtech agreed to buy Canadian Internet of things (IoT) technology company Sierra Wireless in an all-cash transaction valued at US$1.2 billion including debt. The acquisition completed in January 2023.
References
External links
Semiconductor companies of the United States
Fabless semiconductor companies
Manufacturing companies based in California
Technology companies based in Greater Los Angeles
Companies based in Ventura County, California
Camarillo, California
Electronics companies established in 1960
Technology companies established in 1960
1960 establishments in California
Companies listed on the Nasdaq
1960s initial public offerings |
https://en.wikipedia.org/wiki/Flanders%20DRIVE | Flanders’ DRIVE is a Flemish non-profit organization. The aim of the organization is to support the vehicle suppliers with know-how through the Flanders’ DRIVE Network, and to provide infrastructure for the automotive industry through the Flanders’ DRIVE Engineering Centre.
In 2014, Flanders DRIVE, Flanders' Mechatronics Technology Centre (FMTC) and laboratories of the 5 Flemish universities merged into Flanders Make.
See also
Agoria
Automotive Cluster of Wallonia
External links
Flanders’ DRIVE
Flanders Make
Organisations based in Belgium
Science and technology in Belgium
Flanders |
https://en.wikipedia.org/wiki/Outernet%20%28network%29 | Outernet is a wireless community network based in Poland, in which everyone owns their own node's hardware configured in a mesh network managed by OLSR. Participants must permit routing of other node's data through their routers, which allows building a large maintenance-free and low-cost network infrastructure which is a personal property of its users.
See also
B.A.T.M.A.N.
External links
Outernet project page
Free Networks list
node map
Google group
Wireless network organizations |
https://en.wikipedia.org/wiki/Integrated%20modular%20avionics | Integrated modular avionics (IMA) are real-time computer network airborne systems. This network consists of a number of computing modules capable of supporting numerous applications of differing criticality levels.
In opposition to traditional federated architectures, the IMA concept proposes an integrated architecture with application software portable across an assembly of common hardware modules. An IMA architecture imposes multiple requirements on the underlying operating system.
History
It is believed that the IMA concept originated with the avionics design of the fourth-generation jet fighters. It has been in use in fighters such as F-22 and F-35, or Dassault Rafale since the beginning of the '90s. Standardization efforts were ongoing at this time (see ASAAC or STANAG 4626), but no final documents were issued then.
Architecture
IMA modularity simplifies the development process of avionics software:
As the structure of the modules network is unified, it is mandatory to use a common API to access the hardware and network resources, thus simplifying the hardware and software integration.
IMA concept also allows the Application developers to focus on the Application layer, reducing the risk of faults in the lower-level software layers.
As modules often share an extensive part of their hardware and lower-level software architecture, maintenance of the modules is easier than with previous specific architectures.
Applications can be reconfigured on spare modules if the primary module that supports them is detected faulty during operations, increasing the overall availability of the avionics functions.
Communication between the modules can use an internal high speed Computer bus, or can share an external network, such as ARINC 429 or ARINC 664 (part 7).
However, much complexity is added to the systems, which thus require novel design and verification approaches since applications with different criticality levels share hardware and software resources such as CPU and network schedules, memory, inputs and outputs. Partitioning is generally used in order to help segregate mixed criticality applications and thus ease the verification process.
ARINC 650 and ARINC 651 provide general purpose hardware and software standards used in an IMA architecture. However, parts of the API involved in an IMA network has been standardized, such as:
ARINC 653 for the software avionics partitioning constraints to the underlying Real-time operating system (RTOS), and the associated API
Certification considerations
RTCA DO-178C and RTCA DO-254 form the basis for flight certification today, while DO-297 gives specific guidance for Integrated modular avionics. ARINC 653 contributes by providing a framework that enables each software building block (called a partition) of the overall Integrated modular avionics to be tested, validated, and qualified independently (up to a certain measure) by its supplier.
The FAA CAST-32A position paper provides information (no |
https://en.wikipedia.org/wiki/Magnetic%20memory | Magnetic memory may refer to:
Magnetic storage, the storage of data on a magnetized medium
Magnetic-core memory, an early form of random-access memory
Remanence, or residual magnetization, the magnetization left behind in a ferromagnet after an external magnetic field is removed
Rock magnetism, the study of the magnetic properties of rocks, sediments and soils |
https://en.wikipedia.org/wiki/Sweep%20and%20prune | In physical simulations, sweep and prune is a broad phase algorithm used during collision detection to limit the number of pairs of solids that need to be checked for collision, i.e. intersection. This is achieved by sorting the starts (lower bound) and ends (upper bound) of the bounding volume of each solid along a number of arbitrary axes. As the solids move, their starts and ends may overlap. When the bounding volumes of two solids overlap in all axes they are flagged to be tested by more precise and time-consuming algorithms.
Sweep and prune exploits temporal coherence as it is likely that solids do not move significantly between two simulation steps. Because of that, at each step, the sorted lists of bounding volume starts and ends can be updated with relatively few computational operations. Sorting algorithms which are fast at sorting almost-sorted lists, such as insertion sort, are particularly good for this purpose.
According with the type of bounding volume used, it is necessary to update the bounding volume dimensions every time a solid is reoriented. To circumvent this, temporal coherence can be used to compute the changes in bounding volume geometry with fewer operations. Another approach is to use bounding spheres or other orientation independent bounding volumes.
Sweep and prune is also known as sort and sweep, referred to this way in David Baraff's Ph.D. thesis in 1992. Later works like the 1995 paper about I-COLLIDE by Jonathan D. Cohen et al. refer to the algorithm as sweep and prune.
See also
Collision detection
Bounding volume
Physics engine
Game physics
References
External links
Bullet user manual
Computational physics
Computer physics engines |
https://en.wikipedia.org/wiki/Anthony%20Barr | Anthony Barr or Tony Barr may refer to:
Anthony Barr (American football) (born 1992), American linebacker
Anthony James Barr (born 1940), American programming language designer, software engineer, and inventor
Anthony Barr (judge) (born 1961), Irish judge
Tony Barr (Pennsylvania politician) |
https://en.wikipedia.org/wiki/Jim%20Kurose | Jim Kurose (born 1956) is a Distinguished University Professor in the College of Information and Computer Sciences at the University of Massachusetts Amherst.
He was born in Greenwich, Connecticut, USA. He received his B.A. degree from Wesleyan University (physics) and, in 1984, his Ph.D. degree from Columbia University (computer science). Kurose's main area of teaching is computer networking. He is a coauthor of the well-known textbook Computer Networking: A Top-Down Approach.
In 2020, he was elected a member of the National Academy of Engineering for contributions to the design and analysis of network protocols for multimedia communication.
Career
Kurose became a faculty member of Computer Science in University of Massachusetts Amherst after he finished his doctoral degree in 1984. Kurose was a visiting scientist at the University Paris, Institut Eurecom, INRIA, Technicolor and IBM Research. He has been a member of the Scientific Council of Institute IMDEA Networks since 2007, and a member of the Board of Directors of the Computing Research Association.
Since January 2015, Dr. Kurose has been on leave from the University of Massachusetts, serving as the Assistant Director of the National Science Foundation (NSF) for Computer and Information Science and Engineering (CISE). He leads the CISE Directorate, with an annual budget of more than $900 million. Dr. Kurose also serves as co-chair of the Networking and Information Technology Research and Development Subcommittee of the National Science and Technology Council Committee on Technology, facilitating the coordination of networking and information technology research and development efforts across federal agencies.
Awards
Dr. Kurose has received the following awards:
IEEE fellow in the year 1997 for contributions to the design of real-time communication protocols.
Taylor Booth Award of the IEEE in 2001
IEEE Communications Society INFOCOM 2013 Achievement Award
ACM Sigcomm Special Interest Group (SIG) Lifetime achievement award in 2016
References
University of Massachusetts Amherst faculty
1956 births
Living people
Wesleyan University alumni
Columbia University alumni
Fellows of the Association for Computing Machinery
Fellow Members of the IEEE |
https://en.wikipedia.org/wiki/ATN%20Punjabi | ATN Alpha ETC Punjabi (or simply ATN Punjabi) is a Canadian Punjabi-language specialty channel owned by Asian Television Network. It broadcasts programming from India and Canadian content in the form of movies, news, dramas, comedies, and talk shows.
As of August 2009, ATN Alpha ETC Punjabi no longer broadcasts Shabad Gurbani from the Harimandir Sahib in Amritsar, Punjab in Canada as ATN no longer has the rights for the Gurbani. Gurbani from the Harimandir Sahib now airs on PTC Punjabi Canada.
History
On November 24, 2000, ATN was granted approval from the Canadian Radio-television and Telecommunications Commission (CRTC) to launch a television channel called Punjabi Channel, described as "The licensee shall provide a national ethnic Category 2 specialty television service targeting the Punjabi-speaking community."
On August 30, 2013, the CRTC approved Asian Television Network's request to convert ATN Alpha ETC Punjabi from a licensed Category B specialty service to an exempted Cat. B third language service.
On April 1, 2019, ATN Alpha ETC Punjabi was renamed 'ATN Punjabi' due to loss of programming from Alpha ETC Punjabi.
References
External links
Digital cable television networks in Canada
Punjabi-language television channels
Punjabi-language television in Canada |
https://en.wikipedia.org/wiki/Diploma%20in%20Computer%20Science | The Diploma in Computer Science is a diploma offered by several post-secondary institutions:
Cambridge Diploma in Computer Science – this University of Cambridge course was the world's first computer science course, first offered in 1953
University of Kent in Canterbury
University of British Columbia
The diploma is also provided in various other universities all around the world.
History, Definition
Computer Science is a major or specific interest that students can take at college and university level. Nearly each undergraduate institution in the United States provides a computer science major, and more than 100 colleges offer computer science PhD programmes. Numerous new institutions have been established in Egypt to provide a specialization in computer sciences and information systems. In 2001, the existing system for collegiate computer science majors was published. All computer science major programmes should cover the following 'fundamental' disciplines in 13 different areas, it includes: algorithms and complexity, architecture, discrete structures, HCI, information management, intelligent systems, net-centric computing, and many more, according to research done by Mahmoud M. El-Khouly in 2007.
The study of computers and computational systems is known as computer science. Computer scientists work primarily with software and software systems, including their theory, design, development, and implementation. Logic, more than any other branch of mathematics, is becoming increasingly important in computer technology. However, we feel that the new applications necessitate fresh breakthroughs in logic itself. The traditional generalisations of first-order predicate calculus are insufficient to support the new applications. New developments, on the other hand, will most likely build on previous logic triumphs.
Graduate diplomas are currently widespread in New Zealand's higher education institutions based on Dr Theresa McLennan's data. For instance, the Graduate Diploma in Applied Computing at Lincoln University was established in 1999 to provide a pathway into a computing job for those who already have a bachelor's degree in another field.
Computer science is a form of a distinctive and compelling mixture that includes science, engineering, and mathematics. Experimental algorithms, experimental computer science, and computational science are examples of Computer Science operations that are largely science. Design, development, software engineering, and computer engineering are examples of engineering-based jobs. Computational complexity, mathematical software, and numerical analysis are examples of pure mathematics. The majority, however, are combinations. All three events are based on the same principles. Instead of saying "computer science, mathematics, and engineering," scientists and individuals used the phrase "computing" in 1989. Computing science, engineering, mathematics, art, and their various combinations are now collectively refer |
https://en.wikipedia.org/wiki/Christmas%20Do-Over | Christmas Do-Over is a 2006 Christmas television film starring Jay Mohr and Daphne Zuniga. It premiered on ABC Family in 2006 on their 25 Days of Christmas programming block. It is a remake of a previous 1996 television film, Christmas Every Day, but with an adult as the protagonist.
Plot
Kevin, a lazy and selfish music composer, is a father divorced from his wife, Jill, but still obliged to celebrate Christmas with his former in-laws, especially Jill's father who never liked him to begin with. Shopping for a gift for his son at the last second, Kevin makes a purchase without even knowing what the gift is. He arrives at Jill's family's home to a mixed reception, welcomed only by his son Ben and Jill's Granny Conlon. Matters worsen as it is revealed that the gift he purchased for his son is an "easy bake oven." Jill's new boyfriend, Todd, a cardiologist, outshines him at every opportunity, dressing as Santa (which Kevin usually does every Christmas), providing Ben a better gift, and giving Jill a new car. Feeling depressed, Kevin tries to leave town, but finds his only route now blocked by a giant boulder. The family goes to the town's annual Christmas fair at which Jill's father, Arthur, once again loses a competition to his neighbor rivals, the Hendersons. Following the fair, the family sits down for dinner, and after various altercations between the adults, Ben wishes it was Christmas every day. Following this, the family, including a reluctant Kevin, go caroling, and afterwards, Todd proposes to Jill who accepts. The whole family celebrates, except for Kevin, who is too saddened by the events from the day, and for Ben who had held out hope that his parents would get back together. At the stroke of midnight, Kevin finds himself back at the front door on Christmas morning.
Kevin finds he is repeating the same Christmas Day over and over again. He attempts to explain this to Jill but she doesn't believe him. He makes multiple attempts to escape town only to be blocked by the giant boulder every time. Eventually, Kevin realizes his actions have no seeming long-term consequences as each day resets, and he chooses a selfish and immature approach to the day. His anger at the circumstances of the day gets the better of him and he starts a fight at the Christmas Fair, deeply upsetting Ben and Jill with his selfish behavior. Jill confronts him with this. However, Kevin lets his own feelings known when he points out that when he tried to further his music career, it backfired greatly, resulting in Jill ditching out on him. Jill ends it in a huff since Kevin is clearly too selfish to ever see his own faults. But when Kevin hears her defending and explaining his anger to Ben, Kevin's conscience is pricked and he starts to realize his faults. After a heart-to-heart talk with Granny about his choices in life, Kevin admits he really wants to have his family back the way it was before the divorce.
Kevin relives Christmas Day while trying, with mixed resul |
https://en.wikipedia.org/wiki/End%20Game%20%28The%20X-Files%29 | "End Game" is the seventeenth episode of the second season of the American science fiction television series The X-Files. It premiered on the Fox network on . It was directed by Rob Bowman, and written by Frank Spotnitz. "End Game" featured guest appearances by Megan Leitch, Peter Donat, Brian Thompson and saw Steven Williams reprise his role as X. The episode helped explore the series' overarching mythology. "End Game" earned a Nielsen household rating of 11.2, being watched by 10.7 million households in its initial broadcast. It received positive reviews from critics.
The show centers on FBI special agents Fox Mulder (David Duchovny) and Dana Scully (Gillian Anderson) who work on cases linked to the paranormal, called X-Files. In this episode, Scully is kidnapped by an alien bounty hunter and Mulder offers his sister Samantha (Leitch) forward as ransom. However, Samantha is merely one of several clones created as part of a human-alien hybrid project, leading Mulder to pursue the bounty hunter for the truth about her disappearance. "End Game" is a two-part episode, continuing the plot from the previous episode, "Colony".
"End Game" was the first episode of the series written by Spotnitz, who eventually went on to become one of the series' executive producers.
Plot
USS Allegiance, an American nuclear submarine, is patrolling the Beaufort Sea off the coast of Alaska when it comes across a craft below the ice that is emitting a radio signal. Allegiance is ordered to fire upon the craft by Pacific Command. However, the craft manages to disable the sub using a high-pitched frequency, stranding it far below the ice.
Continuing from the cliffhanger ending in "Colony", Dana Scully (Gillian Anderson) is beaten and kidnapped by "Mulder", who is really the Bounty Hunter in disguise. When the real Mulder (David Duchovny) finds the wrecked hotel room, his sister Samantha explains that the Bounty Hunter will set up a hostage exchange to swap Scully for her. She further explains that the Bounty Hunter can only be killed by piercing the base of his neck and that his toxic alien blood is deadly to humans. Finally, Samantha reveals that the clones are the progeny of two original aliens, and worked at abortion clinics to gain access to fetal tissue. Their objective was to set up an extraterrestrial colony on Earth, an effort that has gone as far back as the 1940s. However, because the clones' experiments were considered to have tainted their alien race, the Bounty Hunter was sent to kill them.
Walter Skinner meets Mulder and Samantha at Mulder's apartment, telling them that the remaining clones are missing. Mulder receives a call from Scully, who tells him that the Bounty Hunter seeks an exchange for Samantha. Mulder and Samantha are sent to a bridge near Bethesda while Skinner hides nearby with a sharpshooter. After the exchange takes place, Samantha attacks the Bounty Hunter. During the struggle, the sharpshooter fires upon the Bounty Hunter, and both he |
https://en.wikipedia.org/wiki/Mart%C3%ADn%20Abadi | Martín Abadi (born 1963) is an Argentine computer scientist, working at Google . He earned his Doctor of Philosophy (PhD) in computer science from Stanford University in 1987 as a student of Zohar Manna.
He is well known for his work on computer security and on programming languages, including his paper (with Michael Burrows and Roger Needham) on the Burrows–Abadi–Needham logic for analyzing authentication protocols, and his book (with Luca Cardelli) A Theory of Objects, laying out formal calculi for the semantics of object-oriented programming languages.
In 1993, he published the programming language Baby Modula-3, a safe subset or sublanguage of Modula-3, based on functional programming and set theory ideals. Abadi is a core developer for the machine learning framework Tensorflow.
He is a 2008 Fellow of the Association for Computing Machinery. In 2011, he was a temporary professor at the Collège de France in Paris, teaching computer security. He was elected a member of the National Academy of Engineering in 2018 for contributions to the formal theory of computer security.
He is related to Moussa Abadi, a member of the French Resistance of World War II, and to investment banker and philanthropist Carlos Abadi.
References
External links
, UCSC
1963 births
Living people
American computer scientists
Computer security academics
Stanford University School of Engineering alumni
University of California, Santa Cruz faculty
Fellows of the Association for Computing Machinery
Google people
Members of the United States National Academy of Engineering
Argentine expatriates in the United States
21st-century Mizrahi Jews |
https://en.wikipedia.org/wiki/Srully%20Blotnick | Srully Blotnick ( – ) was an American author and journalist. Notable books include Getting Rich Your Own Way, Computers Made Ridiculously Easy, The Corporate Steeplechase: Predictable Crises in a Business Career, Otherwise Engaged: The Private Lives of Successful Career Women, and Ambitious Men: Their Drives, Dreams and Delusions.
Education
An expert swimmer, Blotnick first attended the University of Miami, but he later transferred to Rensselaer Polytechnic Institute for math. After receiving his BS degree, he attended the University of California, Berkeley, and then Princeton University, where he received his MA in math and physics, with honors. His interest in mathematical models in sociology took him to Columbia University where a survey was being conducted, funded by the National Science Foundation and he joined a team of researchers. The head of the project died suddenly and the team was left leaderless, unfunded, so Blotnick joined a Wall Street firm for the next 7 years as a research analyst, but his interest in the study continued and he began to write books on the topics. He became a business psychology columnist for Forbes magazine and began writing social science books.
Later life
Srully was admitted as a graduate student to the cell biology program at Harvard Medical School, the oldest graduate student ever accepted, and received his PhD in cell biology in 1994. While there he published several peer-reviewed contributions to the biomedical field, and subsequently was a post-doctoral fellow.
Blotnick died of pulmonary fibrosis in 2004, in Cambridge, Massachusetts.
References
External links
Review of Srully Blotnick's books by Harley Hahn.
1941 births
2004 deaths
University of Miami alumni
Rensselaer Polytechnic Institute alumni
University of California, Berkeley alumni
Princeton University alumni
Columbia University staff
Harvard Medical School alumni
20th-century American male writers |
https://en.wikipedia.org/wiki/ABC%20Daytime | ABC Daytime (sometimes shortened to ABC-D or ABCD) is a division responsible for the daytime television programming block on the ABC Network and syndicated programming. The block has historically encompassed soap operas, game shows and talk shows.
History
ABC Daytime is the daytime programming division of the American Broadcasting Company (ABC) television network, which has been in operation since 1948. ABC Daytime originally began as a block of programming featuring game shows and soap operas, and it quickly became a popular destination for viewers during the daytime hours.
Brian Frons became president of ABC Daytime in 2002.
When Megan McTavish returned as Head Writer of All My Children in July 2003, she faced criticism for a story that depicted the rape of a lesbian character, Bianca Montgomery. The show also faced opposition to a story of a transgender character in 2006.
The Writers Guild of America East filed arbitration suits against ABC Daytime, claiming that they violated the strike-termination agreement by retaining replacement writers (those who choose Financial Core Status) who filled in during the strike (including Frons) on All My Children instead of bringing back the writers who had been on strike. "The strike-termination agreement does not allow the retention of replacement writers in lieu of allowing striking writers to return to their jobs. [ABC Daytime] are clearly violating this agreement," said Ira Cure, senior counsel for the Writers Guild of America, East, in a statement. "They have left us no other option but to file arbitrations to ensure that our members will be afforded their rights outlined under this agreement."
In May 2006, ABC Daytime was enlarged with the addition of Soapnet and ABC Media Productions. ABC Daytime was criticized by Susan Lucci for putting profits above their legacy for the 2011 cancellations of All My Children and One Life to Live in favor of lower-cost talk programming such as The Chew. ABC Daytime was folded into ABC Entertainment in 2011.
Times Square Studios (TSS) was created on December 2, 2011 under Vicki Dummer to oversee operations of ABC Daytime and the syndication programs replacing separate daytime and syndicated units. Times Square took over ABC Daytime when Frons' employment contract ended in January 2012. Except for Live with Kelly and Ryan, Times Square took over their remaining soap, all ABC syndicated and lifestyle shows. On October 30, 2014, The View talk show was transferred into Lincoln Square Productions, an ABC News subsidiary, from ABC Entertainment after struggling in ratings and a change in hosts.
One of the earliest and most popular shows in the ABC Daytime lineup was the game show Who Wants to Be a Millionaire which debuted in 1999 and quickly became a cultural phenomenon. The show's popularity helped to revitalize ABC's daytime programming and drew in a large audience of viewers.
Another popular show in the ABC Daytime lineup was the soap opera All My Children whi |
https://en.wikipedia.org/wiki/Chuckie | Chuckie may refer to:
Chuckie (name)
"Chuckie", a track on the 1991 album We Can't Be Stopped by Geto Boys
Chuckie Egg, a 1983 home computer video game
Chuckie Egg 2, its 1985 sequel
See also
Chucky (disambiguation)
"Chuck E.'s In Love", 1979 Rickie Lee Jones song
Nicknames
Hypocorisms |
https://en.wikipedia.org/wiki/Cleo%20Odzer | Cleo Odzer ( Sheila Lynne Odzer, April 6, 1950 – March 26, 2001) was an American writer who authored books on prostitution in Thailand, the hippie culture of Goa, India, and cybersex.
Childhood and time as a groupie
Cleo Odzer grew up in Manhattan, New York City, the daughter of Rena Abelson Odzer and Harry Odzer. Her father, president of a textile company, died when she was 16 years old. She attended Franklin School (now Dwight School) and Quintano's School for Young Professionals, graduating from the latter in 1968. At about that time, she began writing about the music scene for a small Greenwich Village newspaper. Odzer met Keith Emerson, then member of the rock band the Nice and later of Emerson, Lake & Palmer, at The Scene nightclub. After receiving a Christmas gift from Emerson in 1968, she reported to the press that they were engaged. According to Keith Emerson's account in his 2003 autobiography Pictures of an Exhibitionist, there was no actual engagement and Emerson learned about the "engagement" from the same February 1969 Time magazine article that published her photo and described her as a "Super Groupie". Odzer later claimed that the article was the reason for breaking off the "engagement".
Shortly thereafter in 1969, Odzer recorded an album called The Groupies, produced by Alan Lorber, which essentially consisted of interviews with Cleo and some friends describing their adventures meeting (and sleeping with) rock musicians.
Hippie years in Goa
In the early 1970s, Odzer traveled in Europe and the Middle East and worked as a model. She spent the late 1970s in the hippie culture of Anjuna, Goa in India. Her experiences there, including heavy use of cocaine and heroin, the international drug smuggling used to finance the stay, and her subsequent two-week incarceration, would later form the basis of her second book, Goa Freaks: My Hippie Years in India (1995, ). For a time she followed the teachings of Bhagwan Shree Rajneesh in India.
Return to U.S.; research in Thailand
After her return to the United States in the late 1970s, Odzer underwent drug treatment at Daytop in New York. She entered college, then graduate school, and in 1990 obtained a Ph.D. in anthropology from the New School for Social Research in New York City with a thesis on prostitution in Thailand. Beginning in 1987, she had spent three years in Thailand to research this topic. In her dissertation, she describes case studies of 17 people connected to the sex industry in Patpong. She concludes that the economic opportunities provided by sex work do not translate into a higher status of women, because of persistent stigma and ideas about gender inequality in Thai society. Her experiences in Thailand were described in her first book, Patpong Sisters: An American Woman's View of the Bangkok Sex World (1994, ). In this work she describes the Thai prostitutes she got to know as quick-witted entrepreneurs rather than exploited victims, sometimes revered in their poor home vi |
https://en.wikipedia.org/wiki/Spokeo | Spokeo is a people search website that aggregates data from online and offline sources.
History
Spokeo was founded in 2006 by four graduates from Stanford University—Mike Daly, Harrison Tang, Ray Chen, and Eric Liang. The original idea of aggregating social media results came from Tang. The four founders developed the idea in early 2006, using Tang's parents’ basement. On November 5, 2006, the site officially launched, after attracting an initial round of angel investment in the "low hundreds of thousands" according to co-founder Ray Chen.
The site has evolved to become an information-gathering website that offers various options for finding information about people. It purports to know, among other things, one's income, religion, spouse's name, credit status, the number of people in the household, a satellite shot of the house and its estimated value. The company's revenues for 2014 were $57 million, and as of 2015, the site had 18 million users.
Technology
Spokeo utilizes deep web crawlers to aggregate data. Searches can be made for a name, email, phone number, username or address. The site allows users to remove information about themselves through an "opt-out" process that requires the URL of the listing and a valid email address. The firm aggregates information from public records and does not do original research into personal data. It aggregates marketing data approximations into the data it finds from social media and online registry sites. The company gives users access to 12 billion public records. From the Spokeo main landing page, typing in any reverse-search email address - even a completely made up one will result in a suggestion that information has been found, and the searcher will be invited to take out a subscription to see the search results.
Privacy complaints and legal troubles
Larry Ponemon has raised concerns about the general practice of gathering personal data and the potential for identity theft. When Spokeo released version 4 of its website, KGPE-TV aired a piece on Spokeo outlining local law enforcement agencies' concerns that the site would enable cyberstalking. They reported that credit information was being included in some online profiles and that Spokeo had a feature that provided photos of private residences. Search results on Spokeo offered to provide a "credit estimate" and "wealth level" information, as well as information about a target's mortgage value, estimated income, and investments. Spokeo CEO Harrison Tang has said that credit information is not actually available through Spokeo.
The Federal Trade Commission (FTC) fined Spokeo $800,000 for marketing information to human resource departments for employment screening without adhering to consumer protection provided by the Fair Credit Reporting Act (FCRA)—the first FTC fine involving personal data collected online and sold to potential employers. Under the settlement, in addition to the $800,000 fine for Spokeo's FCRA and FTC violations, the firm is |
https://en.wikipedia.org/wiki/DXNP-TV | DXNP-TV (channel 11) is a television station in Metro Davao, Philippines, serving as the Mindanao flagship of the government-owned People's Television Network. The station maintains studios at the Mindanao Media Hub, Carlos P. Garcia Highway, Bangkal, Davao while its transmitter is located along Broadcast Ave., Shrine Hills, Brgy. Matina Crossing, Davao.
History
1962 - DXRH-TV channel 11 was launched by Manila Broadcasting Company until the declaration of Martial Law by President Ferdinand Marcos in 1972.
1974 - During the Martial Law era, the station reopened as DXAW-TV and became an owned-and-operated station of the National Media Production Center as Government Television (GTV) under Lito Gorospe and later by then-Press Secretary Francisco Tatad. It was originally broadcast on Channel 2 and it is the first television station in Mindanao.
1992 - Channel 11 was later relaunched as the local station of the Southern Broadcasting Network, with call sign changed to DXNP-TV.
1994 - After 8 years of being silence of the original channel 2 (eventually, it is now owned and handled by The 5 Network), the station was launched by People's Television Network, Inc. (PTNI).
July 16, 2001 - Under the new management appointed by President Gloria Macapagal Arroyo, PTNI adopted the name National Broadcasting Network (NBN) carrying new slogan "One People. One Nation. One Vision." for a new image in line with its new programming thrusts, they continued the new name until the Aquino administration in 2010. It became an originating station in Mindanao.
October 6, 2011 - People's Television Network, Inc. (PTNI) became a primary brand and the branding National Broadcasting Network was retired.
June 2017 - PTV Davao resumed its operations as PTVisMin, with the airing of the first Visayan hourly newsbreak, PTVismin Newsbreak anchored by former ABS-CBN Davao reporter Elric Ayop. The program also aired on the national feed of PTV since October 2017.
October 16, 2017 - PTV Davao launched its own 45-minute local newscast PTV News Mindanao with Jay Lagang and Hannah Salcedo as anchors.
March 5, 2018 - PTV Davao started digital test broadcasts on UHF Channel 45.
December 5, 2020 - PTV Davao Studios and Offices transferred to the new home at the new Mindanao Media Hub in Bangkal, Davao City. Prior to this, in May 2018, the network was ground breaking for the construction of the new Mindanao Media Hub which houses for PCOO's satellite offices along with its attached agencies including PTV Davao and Radyo Pilipinas Davao and the building was finished in the end of November of the same year.
Current programs
PTV News Mindanao (afternoon local newscast)
Madayaw Davao
Digital television
Digital channels
UHF Channel 45 (659.143 MHz)
Areas of coverage
Primary areas
Davao City
Davao del Sur
Davao del Norte
Secondary areas
Portion of Davao de Oro
See also
People's Television Network
List of People's Television Network stations and channels
DWGT-TV - the network's flagship |
https://en.wikipedia.org/wiki/Fearful%20Symmetry%20%28The%20X-Files%29 | "Fearful Symmetry" is the eighteenth episode of the second season of the American science fiction television series The X-Files. It premiered on the Fox network on . It was written by Steve De Jarnatt and directed by James Whitmore Jr. The episode is a "Monster-of-the-Week" story, only loosely connected to the series' wider mythology. "Fearful Symmetry" received a Nielsen rating of 10.1 and was watched by 9.6 million households. The episode received mixed reviews from critics but later won an EMA Award.
The show centers on FBI special agents Fox Mulder (David Duchovny) and Dana Scully (Gillian Anderson) who work on cases linked to the paranormal, called X-Files. Mulder is a believer in the paranormal, while the skeptical Scully has been assigned to debunk his work. In this episode, Mulder and Scully investigate the death of a federal construction worker and the destruction of various property that can only be tied to an escaped elephant. Unfortunately, the only witnesses claim to have seen no animals which might have caused the turmoil. Soon, Mulder and Scully discover the local zoo whose claim to fame is that they've never had a successful animal birth.
"Fearful Symmetry" takes its title from a line in the William Blake poem "The Tyger". Filming for the episode faced several hurdles. Live elephants and tigers were used. Co-Producer J.P. Finn claimed that the hardest part of filming the episode was getting an elephant. The biggest hurdle when filming scenes with the tiger were keeping it "calm and warm", due to the cool nature of Vancouver.
Plot
In Fairfield, Idaho, two janitors witness an invisible force storm down a city street; a road worker is later killed by the force on the highway. The next day, an elephant suddenly materializes in front of an oncoming big rig. The driver manages to stop in time, but the elephant soon collapses and dies, over forty miles away from where it disappeared the night before at the Fairfield Zoo.
Fox Mulder (David Duchovny) and Dana Scully (Gillian Anderson) survey the damage in the city, which appears to have been caused by an elephant even though none was seen. Ed Meecham, an animal handler at the zoo, recounts how he came to the elephant's locked cage to find it empty. His boss, Willa Ambrose, tells the agents that the zoo is in danger of closing due to other animal disappearances. She blames the zoo's decline on an animal rights group which is known to free captive animals. The group's leader, Kyle Lang, denies any involvement in the elephant's release. Lang tells them that Ambrose is being sued by the Malawi government over a lowland gorilla she took from their country ten years prior.
Mulder contacts Frohike and Byers, who say that Fairfield is known for its animal disappearances and UFO sightings. They also mention Ambrose's gorilla, who is known to communicate using American Sign Language. Meanwhile, Scully follows one of Lang's activists as he sneaks into the zoo, running into Meecham inside. The |
https://en.wikipedia.org/wiki/D%C3%B8d%20Kalm | "Død Kalm" is the nineteenth episode of the second season of the American science fiction television series The X-Files. It premiered on the Fox network on March 10, 1995. The story was written by Howard Gordon, the teleplay was written by Gordon and Alex Gansa, and the episode was directed by Rob Bowman. The episode is a "Monster-of-the-Week" story, unconnected to the series' wider mythology. "Død Kalm" earned a Nielsen household rating of 10.7, being watched by 10.2 million households in its initial broadcast. The episode received mostly mixed-to-positive reviews.
The show centers on FBI special agents Fox Mulder (David Duchovny) and Dana Scully (Gillian Anderson) who work on cases linked to the paranormal, called X-Files. In the episode, Mulder and Scully are called in when a boatload of survivors from a U.S. Navy destroyer escort are found. What particularly catches Agent Mulder's attention is that all of these sailors appear to have aged many decades in the course of a few days. Mulder and Scully travel to Norway where they find a civilian fisherman who is willing to take them to the ship's last known position.
"Død Kalm" was written to make use of the show's access to a navy destroyer that had previously featured in "Colony" and "End Game." The episode was originally intended as a way to give the production crew a rest after several demanding episodes had been shot, but the episode became one of the more difficult to film during the second season. The episode's title evokes that of the suspense film Dead Calm in a Norwegian-inspired form, joining the Norwegian død (dead) with a recognizable but Norwegian-styled respelling of the word "calm".
Plot
In the Norwegian Sea, chaos erupts on board the USS Ardent, an American destroyer escort. Due to mysterious yet unspecified events, half of Ardents crew board lifeboats and abandon ship against the captain's orders. Eighteen hours later, they are spotted by a Canadian fishing vessel; however, in that short span of time, the young crew members have undergone rapid aging.
Dana Scully (Gillian Anderson) and Fox Mulder (David Duchovny) visit the ship's sole surviving crew member, Lt. Harper, who has been quarantined at the Bethesda Naval Hospital. Scully finds that Harper, despite being in his twenties, has aged to the point of being unrecognizable. Mulder explains that Ardent vanished at the 65th parallel, a location with a history of ship disappearances. Mulder believes that a "wrinkle in time" exists there, and that Ardent was the subject of government experimentation related to the Philadelphia Experiment from World War II.
In Norway, Mulder and Scully get Henry Trondheim (John Savage), a naval trawler captain, to take them to Ardent'''s last known location. After crashing into the bow of Ardent, Mulder, Scully, and Trondheim find signs of advanced corrosion, even though the warship is only a few years old. Below decks, the party finds the mummified remains of several crew members. They also f |
https://en.wikipedia.org/wiki/Chris%20Hughes | Chris Hughes (born November 26, 1983) is an American entrepreneur and author who co-founded and served as spokesman for the online social directory and networking site Facebook until 2007. He was the publisher and editor-in-chief of The New Republic from 2012 to 2016.
Hughes co-founded the Economic Security Project (ESP) in 2016. In 2018, he published Fair Shot: Rethinking Inequality and How We Earn.
Early life and education
Hughes grew up in Hickory, North Carolina, as the only child of Arlen "Ray" Hughes, an industrial paper salesman, and Brenda Hughes, a mathematics teacher. He was raised as an evangelical Lutheran. He graduated from Phillips Academy in Andover, Massachusetts, before earning a Bachelor of Arts in History and English Literature, magna cum laude, from Harvard College.
In February 2020, it was reported that Hughes was in the process of earning his Master of Arts in Economics from The New School for Social Research in New York City.
Career
Facebook
Hughes is a co-founder of Facebook. At Harvard, Hughes met and was recruited by Mark Zuckerberg, who at the time was still working in the early stages of the website. During their summer break in 2004, Hughes and Zuckerberg traveled to Palo Alto, California. While Zuckerberg decided to remain in Palo Alto after the break, Hughes decided to return to Harvard to continue his studies. In 2006, after graduating from Harvard, Hughes relocated to Palo Alto to rejoin Zuckerberg and became involved in Facebook again.
Hughes was unofficially responsible for beta testing and product suggestions. When the group had the idea to open Facebook to other schools, Hughes argued that schools should have their own networks to maintain the intimacy. He was also a key driver in developing many of Facebook's popular features, which led to the opening of Facebook to the outside world.
Hughes left Facebook in 2007.
When Facebook's initial public offering took place in 2012, Hughes made $500 million.
After Facebook
In March 2009, Hughes was named Entrepreneur in Residence at General Catalyst, a Cambridge, Massachusetts, venture-capital firm.
Hughes was the executive director of Jumo, a non-profit social network organization which he founded in 2010, which "aims to help people find ways to help the world". In July 2010, UNAIDS (Joint United Nations Programme on HIV/AIDS) appointed him to a 17-member "High Level Commission" of renowned politicians, business leaders, human rights activists, and scientists tasked with spearheading a "social and political action campaign over the coming year aimed at galvanizing support for effective HIV prevention programmes."
The New Republic
In March 2012, Hughes purchased a majority stake in The New Republic magazine. He became the publisher and executive chairman, and also served as editor-in-chief of the magazine. In December 2014, shortly after the magazine's centennial celebration, editor Franklin Foer and literary editor Leon Wieseltier were "driven out" and do |
https://en.wikipedia.org/wiki/Nickelodeon%20in%20amusement%20parks | Since the 1990s, Nickelodeon, a worldwide children's television network and franchise, owned by Paramount Global, has had an involvement in the creation and theming of amusement parks rides.
Several amusement parks have featured themed areas entirely devoted to the Nickelodeon brand whilst others have featured standalone attractions. Nickelodeon attractions currently exist at Movie Park Germany, Pleasure Beach Blackpool, Mall of America, Sea World, and American Dream Meadowlands. Attractions previously existed at California's Great America, Canada's Wonderland, Carowinds, Dreamworld, Kings Dominion, Kings Island, Universal Studios Florida, Universal Studios Hollywood and WhiteWater World.
History
On June 7, 1990, Universal Studios Florida opened with an attraction named Nickelodeon Studios. It was a television taping studio for the cable television channel Nickelodeon.
In 1995, Nickelodeon Splat City opened at three former Paramount Parks: California's Great America, Kings Dominion and Kings Island. These attractions were inspired by the game shows that aired on the television network and generally involved slime. In 1999, Kings Dominion closed Nickelodeon Splat City in preparation for the opening of its 2000 attraction, Nickelodeon Central. Nickelodeon Central brought a retheme of many of the park's children's rides as well as the addition of new ones. Kings Island followed suit, closing its Splat City in 2000 and opening Nickelodeon Central in 2001. This area would later be expanded and renamed Nickelodeon Universe in 2006.
In 2002, Australian theme park Dreamworld opened Nickelodeon Central. In 2003, Nickelodeon Central opened at California's Great America, Canada's Wonderland and Carowinds, and Jimmy Neutron's Nicktoon Blast opened in Universal Studios Florida. Expansions of these areas took place in 2005, 2006 and 2008 for Carowinds, Kings Island and Dreamworld, respectively. The Kings Island area was also renamed to Nickelodeon Universe at the same time. In 2007, Movie Park Germany opened a similar area entitled Nickland. In 2007, it was announced that Nickelodeon Universe would be opening in Mall of America in 2008, replacing Camp Snoopy. In 2009 and 2010, Cedar Fair terminated their contract with Nickelodeon resulting in all of the areas being rethemed to Planet Snoopy. In early 2011, at a cost of million, Pleasure Beach Blackpool opened Nickelodeon Land. By mid-2011, Dreamworld had closed their Nickelodeon Central and rethemed it to the generic Kid's World theme (it was later revealed that the park had struck a deal with DreamWorks Animation). In 2012, Universal's Superstar Parade had its first performance which features floats based on SpongeBob SquarePants and Dora the Explorer and later opened a SpongeBob gift shop in Woody Woodpecker's Kidzone. In September 2016, it was announced that a new Nickelodeon Universe would open in the upcoming American Dream Meadowlands mall and entertainment complex owned by the Triple Five Group, wh |
https://en.wikipedia.org/wiki/Gravity%20%28Star%20Trek%3A%20Voyager%29 | "Gravity" is the 107th episode of the American science fiction television series Star Trek: Voyager originally airing on the UPN network, the 13th episode of the fifth season. Lori Petty guest stars as the alien Noss. Joseph Ruskin, who played Galt in the original Star Trek episode "The Gamesters of Triskelion", is the Vulcan Master in this episode of Voyager.
This episode originally aired on UPN on February 3, 1999.
Plot
Tuvok, Tom Paris, and the Doctor are stranded on a planet where (unknown to them) time is moving faster than it is in the rest of the universe. While Tuvok searches the surrounding area, Paris remains behind to try to establish communications with Voyager which they increasingly expect to be long gone. An alien female robs them of much needed equipment and leaves, but is quickly attacked by a small hunting group of another species. Tuvok disarms the group and brings the female back to the damaged shuttle for medical attention. With the assistance of the Doctor, Paris and Tuvok learn to communicate with the woman, named Noss, who has been trapped on the planet for "14 seasons".
Meanwhile, the crew of the Voyager finds the gravimetric distortion that the away team's shuttle went into. A probe is launched to determine if contact could be made, however the situation is complicated by the arrival of an alien salvage team bent on closing the distortion, an action which would crush everything within it - including Tuvok, Paris and Noss.
During their time on the planet, Noss develops an attraction to Tuvok. He initially ignores the attraction due to an incident with another female years ago that forced him to retreat to a Vulcan master in an attempt to purge his emotions. The lack of mutual attraction angers Noss.
Janeway and the crew determine that by using the probe's relays, a signal can be sent to the emergency beacon Paris activated and use it as a transporter link. They also determine that a temporal disruption in the sinkhole causes time to pass quickly for the away team. For every 0.4744 of a second for the Voyager crew, a minute would pass for Tuvok and Paris. With the aliens ahead of schedule in their efforts to close the sinkhole, Janeway orders a message sent to the beacon with beam out instructions.
Staged at a damaged spacecraft used by Noss, the stranded officers receive the message. Despite a last minute attack by a large group of aliens, everyone is able to be beamed off the planet and out of the sinkhole. It is the first time they had set foot on the ship in over two months. From Janeway and the others' point of view, they were only missing for two days.
Before Noss returns to her homeworld, she and Tuvok privately conduct a mind-meld, silently and telepathically sharing their feelings for each other.
Reception
In 2012, Den of Geek listed this as an honorable mention for their ranking of the top ten episodes of Star Trek: Voyager. TV Guide noted the guest star role of actress Lori Petty, known for starring in |
https://en.wikipedia.org/wiki/Office%20of%20the%20Information%20Commissioner | Office of the Information Commissioner may refer to:
Information Commissioner's Office, the UK non-departmental public body and regulator for data protection
Office of the Information Commissioner of Canada
Office of the Information Commissioner (New South Wales), the New South Wales government agency within the Office of the Information and Privacy Commission (New South Wales)
Office of the Information Commissioner Queensland, an agency of the Department of Justice and Attorney-General
Office of the Information Commissioner (Oifig an Choimisinéara Faisnéise) is the official charged with regulating the Irish Freedom of Information Act. |
https://en.wikipedia.org/wiki/Gladiators%20%281995%20Australian%20TV%20series%29 | Gladiators is an Australian television series which aired on Saturday nights on the Seven Network from 29 April 1995 until 12 October 1996 almost consecutively for eighteen months. It was based on the popular franchise of the same name, which started with American Gladiators in 1989. However the Australian show was more heavily based on the British version of the 1990s with events, format and even music being used from that show.
All three series of the show were filmed at the Brisbane Entertainment Centre in 1995, and was hosted by Kimberley Joseph and Aaron Pedersen, with Mike Hammond replacing Pedersen after the first series. The show was refereed by John Alexander in the first series, and Mike Whitney thereafter. John Forsythe served as assistant referee.
A short-lived revival of the show aired in 2008. In July 2023, following the BBC’s revival of the British version, the show was confirmed to return for the second time, set to be revived by Warner Bros. Television Studios and is set to premiere on Network Ten in 2024, hosted by Beau Ryan and Liz Ellis.
Format
The premise of the show involves permanent competitors called "Gladiators" being put up against one-time-only "Challengers" in several different events which tests both physical and mental capabilities. In a typical episode, two men and two women compete for points against the Gladiators across four different events, with separate events for males and females. After this, each pair then competes against each other in The Eliminator, an obstacle course, of which any points they have won previously go towards time for a head start on their opponent. The winner of this is dubbed the champion of the episode. The episode champions then compete in the finals series.
Events
Each episode features four events chosen at random, followed by the final round, the Eliminator.
The first series of Gladiators featured many events that continued to run for the following series. The events featured in the first series were Atlaspheres, Duel, Gauntlet, Hang Tough, Hit & Run, Powerball, Pyramid, Suspension Bridge, Tilt, and the Wall. The second series introduced a few new events; Pursuit, Swingshot and Whiplash. The third series introduced further events; Joust and Skytrak. In all series, The Eliminator is played at the end of every episode.
Events
Atlaspheres
The two challengers and the two gladiators are caged in large Atlaspheres (spherical metal cages) that they have to propel themselves from within. The challengers' task is to roll the spheres onto any of four scoring pods, each pod scoring two points. They are given 60 seconds to score as many points as they can in this fashion, whilst the gladiators must block the challengers from scoring.
Duel
The challenger and a gladiator are each placed atop of an elevated platform with a short distance apart. Armed with a pugil stick, they would attempt to cause the other to fall from their platform within 30 seconds. This could be achieved with either a |
https://en.wikipedia.org/wiki/List%20of%20Press%20Gang%20episodes | This is a list of television episodes from the British television show Press Gang. Press Gang was produced by Richmond Film & Television for Central, and screened on the ITV network in its regular weekday afternoon children's strand, Children's ITV. All 43 episodes across five series were written by Steven Moffat. The first episode was transmitted on 16 January 1989, and the final transmitted on 21 May 1993. The show gained an adult audience in an early evening slot when repeated on Sundays on Channel 4.
The show was based on the activities of the staff of the Junior Gazette, a children's newspaper initially produced by pupils from the local comprehensive school. The main story arc was the on-off romance between the newspaper's editor Lynda Day (Julia Sawalha) and Spike Thomson (Dexter Fletcher). The other main characters were assistant editor Kenny Phillips (Lee Ross), Sarah Jackson (Kelda Holmes), the paper's enterprising accountant Colin Mathews (Paul Reynolds) and Frazz Davies (Mmoloki Chrystie).
In June 2007, The Stage reported that Moffat and Sawalha are interested in reviving Press Gang. He said: "I would revive that like a shot. I would love to do a reunion episode—a grown-up version. I know Julia Sawalha is interested—every time I see her she asks me when we are going to do it. Maybe it will happen—I would like it to."
Series overview
Episodes
Series 1 (1989)
Most of the episodes in the first and second series had closing voice-overs featuring typically two characters. These are noted with each episode synopsis. The voice-overs were dropped for the third series onwards, as Moffat felt they were not working as well any more. Producer Sandra C. Hastie recalls that Moffat was "extremely angry" that Drop the Dead Donkey had adopted the style.
The first series established the characters and the style of the series. The first two episodes were directed by Colin Nutley. However, he was unhappy with the final edit and requested that his name be removed from the credits. Bob Spiers, who writer Moffat credits as setting the visual style, made his Press Gang directorial debut with "One Easy Lesson".
The show addressed its first serious issue in the two part story "How to Make a Killing", in which the team expose shopkeepers who sell solvents to underage customers. The penultimate episode, "Monday-Tuesday", sees a character commit suicide after being rejected from the writing team and told some home truths by Lynda. However, the series also features many comedic elements, some of which are referred to in later years. Colin's inadvertent attendance at a funeral dressed as a pink rabbit in "A Night In" is referenced in "Something Terrible: Part 2".
Series 2 (1990)
Moffat was impressed with Lucy Benjamin's performance as Julie, and expanded her character for the second series. However she had committed herself to roles in the LWT sitcom Close to Home and Jupiter Moon, so the character was replaced by Sam Black (Gabrielle Anwar). The replacement |
https://en.wikipedia.org/wiki/Jonathan%20Crowther | Jonathan Crowther is a British crossword compiler who has for over 50 years composed the Azed cryptic crossword in The Observer Sunday newspaper. He was voted "best British crossword setter" in a poll of crossword setters conducted by The Sunday Times in 1991 and in the same year was chosen as "the crossword compilers' crossword compiler" in The Observer Magazine "Experts' Expert" feature.
Career
He was born in Liverpool on 24 September 1942, the son of a doctor, and grew up in Kirkby Lonsdale in the Lake District. He was educated at Rugby School before going on to read classics and classical philology at Corpus Christi College, Cambridge. From there, in 1964, he joined Oxford University Press and he worked for them, in India, London, and Oxford, until his retirement in early 2000. His final position was as a lexicographer writing dictionaries for foreign students of English. Married with two sons, he lives in Oxford.
Encouraged by his father, Jonathan enjoyed solving crosswords from an early age. He caught the Ximenes bug while still at Rugby and "just lived for Sundays" thereafter. His first puzzles to be published were in the university weekly, Varsity, under the pseudonym Gong and after leaving university he started submitting to The Listener. They published sixteen Gong puzzles between June 1965 and February 1972. He continued to be a Ximenes competitor until Ximenes' death in 1971.
Appointed as Ximenes' successor, he cast around for a new pseudonym. His two predecessors had taken theirs from Spanish inquisitors-general but none of the names remaining seemed suitably impressive. However, reversing the last name of one, Diego de Deza, gives (to British ears at least) the first and last letters of the alphabet. Letter manipulation and word reversal are integral parts of a cryptic crossword: thus Azed was born. Azed No. 1 appeared in The Observer in March 1972 and monthly clue-writing competitions à la Ximenes resumed. These still continue and in the monthly "slip", he gives details of each competition and discusses points of technique and more general interest relating to his puzzles. He relishes the dialogue the competitions generate and many regular solvers have become his friends. Among the technical comments can sometimes be found glimpses into his private life – he is very interested in cricket and less so in football ... he took part in a performance of Haydn's Nelson Mass at Radley College ... one of his sons is a rock musician. Interesting in their own right, these snippets are seized on by the more cunning competitors as ways to make their clues more appealing to the judge and so increase their chances of success.
Tastes and technique
Proudly Ximenean in his crossword philosophy, he favours puzzles whose setters have similar ideas (Dimitry, Duck and Phi, for example). Though he may not always approve of some accompanying clues, he praises the ingenuity of construction of the specialised thematic crosswords in the Times List |
https://en.wikipedia.org/wiki/Blast%20Factor | Blast Factor is a downloadable game developed by Bluepoint Games and published by Sony Computer Entertainment for the PlayStation 3, Notable for being the first game on the console running at a resolution of 1080p and a framerate of 60 alongside being one of its first digital-only games, it is the only game developed by Bluepoint Games that is not a remaster, remake or port.
Gameplay
In Blast Factor the player pilots a microscopic craft through a series of infected cells and use the craft's weaponry to rid the cell of various infections.
The left analog stick moves the craft and the right fires the weapon. Additionally, the player can violently tilt the Sixaxis controller to the left or right to slosh the playing field to one side or the other, resulting in the infections being forced to one side, often grouping them for easier elimination. The player also has use of a Bio Magnetic Repulsor (B.M.R.) that triggers a time dilation effect and a force field that can be used to push away enemies. The B.M.R. recharges every 2 seconds in single player mode.
Each cell the player enters will have several infections appear. The objective to destroy all of the infections. The types and behaviors of the infections vary as the game progresses.
The player must cleanse 8 cells (or waves) in a specimen (or game level) to move on to the next specimen. There are various powerups to be gained, such as a Multi-Shot, Homing Super, and Super B.M.R.. The latter power up triggers a disruptive blast that destroys all enemies within range.
The player can increase their score by using the 'Blast Factor' of enemy explosions. Enemies caught in the destructive radius of an explosion will themselves be destroyed, giving an additional score bonus to the player. The score multiplier increases with each enemy destroyed in a chain of explosions.
The game has a self-modifying difficulty level based on the skill of the player. The difficulty is determined by changing the path of cells through each specimen. If the player does not die and completes the current cell within the specified time limit, the player is moved to the harder cell on completion. If the player dies, or does not finish the cell within the specified time limit, the player is moved to the easier cell. More points are awarded for completion of hard cells.
Trophies were made available via patch v2.01 on December 4, 2008 in North America and June 29, 2009 in Europe.
Multiplayer Pack
Blast Factor Multiplayer Pack was released on February 1, 2007. The multiplayer is restricted to the local console only, one to four players. The multiplayer pack includes 2 new game modes, Co-op where 2-4 players each control a ship and work together to complete specimens, and a Grudge Match mode where 2-4 players compete to eliminate each other with the last player remaining winning the round.
The expansion also allows the single player and multiplayer games to be played with two new speed modes: AT (Accelerated Time, 15% |
https://en.wikipedia.org/wiki/Odd%20Man%20Out%20%28American%20TV%20series%29 | Odd Man Out is an American sitcom that aired on the ABC television network as a part of the TGIF lineup. It aired from September 24, 1999, to January 7, 2000. This show was created by Ed Decter and John J. Strauss.
Synopsis
Set in Miami, the show revolved around 15-year-old Andrew Whitney (Erik von Detten), the only male in a house full of women. He is constantly surrounded by his three sisters (Val, Paige, and Elizabeth), Aunt Jordan, and widowed mom, Julia. The episodes mostly revolved around Andrew's lack of privacy and dealing with his best friend Keith's crush on his unresponsive older sister, Paige.
Cast
Erik von Detten as Andrew Whitney
Natalia Cigliuti as Paige Whitney
Vicki Davis as Valerie "Val" Whitney
Marina Malota as Elizabeth Whitney
Trevor Fehrman as Keith Carlson
Jessica Capshaw as Aunt Jordan
Markie Post as Julia Whitney
Production
The show was heavily promoted in the summer of 1999, primarily as a last-ditch effort to save the faltering TGIF block, which had been in severe decline since The Walt Disney Company took over the block in 1997. ABC commercials showing teenage girls screaming "EVD!" (the initials of star Erik von Detten) were prominent; at the time, this was the peak of the boy band craze, and this was a common practice. The commercials mentioned very little about the show itself, and did not even mention the name until a few weeks before the show was to debut: a typical advertisement, following clips of girls screaming "EVD!" would follow a shadow of von Detten with a question mark and a voiceover stating "What is EVD? Find out Fridays this fall on ABC." This type of mysterious promotion did little to hold interest in the show once it debuted. The series was canceled after 13 episodes and replaced with the reality show Making the Band; it was the last new sitcom to debut on TGIF in its original form, and TGIF would itself end at the end of the season.
Von Detten would later go on to co-star in another series, Complete Savages, during a TGIF revival in 2004. That series had an opposite premise in that Von Detten was but one member of an all-male family.
Episodes
External links
Odd Man Out (1999 - 2000) at rottentomatoes.com
Odd Man Out - Full Cast & Crew at tvguide.com
1990s American teen sitcoms
2000s American teen sitcoms
1999 American television series debuts
2000 American television series endings
American Broadcasting Company original programming
English-language television shows
Television series about families
Television series about teenagers
Television shows set in Miami
Television series by Warner Bros. Television Studios
TGIF (TV programming block) |
https://en.wikipedia.org/wiki/European%20route%20E9 | The European route E9 is part of the United Nations international E-road network. It starts at Orléans, France, and goes south to Barcelona, Spain.
France
In France, the E9 follows these roads:
: Orléans - Vierzon
: Vierzon - Châteauroux - Limoges - Cahors - Montauban - Toulouse
: Toulouse - A66 Junction
: A66 Junction - Foix
: Foix - Ax-les-Thermes - Spain
Spain
In Spain, the E9 follows these roads:
: France — Puigcerdà
: Puigcerdà — Queixans
: Queixans — Riu de Cerdanya
: Riu de Cerdanya - Berga - Manresa - Terrassa - Barcelona
External links
UN Economic Commission for Europe: Overall Map of E-road Network (2007)
E009
E009
09 |
https://en.wikipedia.org/wiki/Computer%20Laboratory | Computer Laboratory or Computing Laboratory may refer to:
A computer lab, a room containing one shared mainframe or multiple workstations for an organisation or community.
The Department of Computer Science and Technology at the University of Cambridge, formerly the Computer Laboratory
The Department of Computer Science, at the University of Oxford, formerly the Computing Laboratory |
https://en.wikipedia.org/wiki/Up%20Close | Up Close is an American sports interview show that aired on ESPN+ in 2021 and had aired on ESPN from 1981–2001.
History
Early years
The program debuted in 1981 on USA Network and was created by the advertising agency Foote, Cone and Belding to advertise one of its clients, Mazda cars. Mazda SportsLook moved to ESPN in 1982 and was subsequently rechristened Up Close.
Time slots
Once it arrived at ESPN, SportsLook was slotted before SportsCenter. The show aired at 6 p.m. Eastern time, followed by SportsCenter at 6:30. The show remained in that slot until September 1999, when SportsCenter was expanded to an hour and Up Close, as it was then renamed, moved to 5:30 p.m.
Hosts
The original host of Up Close was Roy Firestone, who served as host for 13 years. During this time, both Firestone and the show won many CableACE Awards, then the gold standard for cable television programming. When Firestone left in 1994, Chris Myers became the new host; he stayed there until 1998 and enjoyed the highest ratings in the history of the program. Gary Miller was the show's host when Up Close signed off in 2001. Sage Steele became the host when the show was brought back in 2021.
Notable interviews
Roy Firestone was the subject of extensive criticism regarding what has been characterized as a "softball" and "chummy" 1992 ESPN interview with O. J. Simpson (or, as he called Simpson in the interview, "Juice") during which he asserted that Simpson's January 1989 arrest and subsequent conviction for beating his wife, Nicole, unfairly distorted Simpson's reputation to the point that Simpson was portrayed by the press as "the bad guy" merely for having "a little bit too much to drink." He further expressed his annoyance with the press' reports of Simpson's arrest and conviction for beating Nicole because the press, in reporting the facts, had the temerity to portray Simpson as "a wife beater" (the offense for which he was convicted). He then gave Simpson a free pass to downplay the criminal beating of Nicole and characterize it as an argument that got a "little loud," asserting that he and Nicole were "both guilty." These assertions, which were contrary to the public record, were not only unchallenged by Firestone, but were actively encouraged and endorsed by him. This criticism was renewed upon the release of the documentary OJ: Made In America which included an excerpt from the interview in which Firestone expresses these sentiments and where the "chumminess" is apparent. Firestone has recently expressed remorse for how he handled the interview, stating, "The Simpson interview is one of the most tragic examples of how the media (including me) and the public trusted and accommodated their heroes, believing their mythology and perpetuating their deification."
Chris Myers would later also interview O. J. Simpson live in November 1995; this was Simpson's first full-length interview since he was acquitted in the "trial of the century" a month earlier.
Some interview |
https://en.wikipedia.org/wiki/The%20Calusari | "The Calusari" is the twenty-first episode of the second season of the American science fiction television series The X-Files. It originally aired on the Fox network on April 14, 1995. It was written by Sara B. Charno and directed by Michael Vejar. "The Căluşari" is a "Monster-of-the-Week" story, unconnected to the series' wider mythology, or fictional history. It earned a Nielsen household rating of 8.3, being watched by 7.9 million households in its initial broadcast. Due to perceived inconsistencies in the plot, "The Căluşari" received mixed reviews from television critics.
The show centers on FBI special agents Fox Mulder (David Duchovny) and Dana Scully (Gillian Anderson) who work on cases linked to the paranormal, called X-Files. In this episode, a photograph taken just before the death of a two-year-old boy yields evidence of some supernatural intervention which piques Mulder and Scully's curiosity. When another death in the family occurs, the grandmother of the remaining child requests the aid of some Romanian ritualists, named the Calusari, in order to cleanse the home of evil.
The script for "The Calusari" was inspired by Charno's experience as a doctor of Eastern medicine. The inspiration for the entry came from an idea series creator Chris Carter had involving someone getting hanged with a garage-door opener. Because "The Calusari" was heavy in terms of violence, Fox's standards and practices department took issues with several scenes. In addition, Carter re-cut the episode after it was completed in order to make it scarier.
Plot
In Murray, Virginia, Maggie and Steve Holvey's' family visits a local amusement park. When the youngest child, Teddy, lets his balloon fly away, his father, Steve, gives him the balloon that belongs to his older brother, Charlie (Joel Palmer). When the boys' mother, Maggie (Helene Clarkson), is in the bathroom, the strap in Teddy's stroller comes undone. Teddy follows the balloon floating under its own power out of the restroom and onto the tracks of the park's tour train, leading to him getting killed by the train. Charlie is the only member of the Holvey family not to grieve Teddy's death at the scene.
Three months later, Fox Mulder (David Duchovny) shows Dana Scully (Gillian Anderson) a photo taken moments before Teddy's death. Mulder points out that a balloon does not stay close to the ground, nor does it blow sideways. After taking the photo to a lab, it is shown that a mysterious, electromagnetic force taking the form of a child was dragging the balloon. Mulder and Scully later visit the Holveys, and Mulder explains his seemingly asinine theory that Teddy was lured onto the tracks by some unseen force. As the Holveys push back against this idea, Scully notices an older woman (Lilyan Chauvin), who is Maggie's elderly Romanian mother named Golda, drawing a swastika on the boy's hand. Scully hypothesizes that the Holvey children may be victims of Munchausen by proxy, perpetrated by their grandmother. |
https://en.wikipedia.org/wiki/The%20Dirtiest%20Show%20in%20Town | The Dirtiest Show in Town is a musical revue with a book and lyrics by Tom Eyen and music by Jeff Barry.
Overview
An attack on air pollution, the Vietnam War, urban blight and computerized conformity, the show is filled with sex, nudity, and strong lesbian and gay male characters. The show culminates in a massive orgy, with the entire naked cast writhing on the floor. The Dirtiest Show in Town is distinguished from a raunchy sex show by Eyen's clever dialogue and witty observations, which impressed even mainstream critics when the show was first staged near the end of the sexual revolution of the 1960s.
Productions
Directed by Eyen, The Dirtiest Show in Town was initially produced Off-Off Broadway at La MaMa Experimental Theatre Club in spring, 1970. It then opened Off-Broadway on June 27, 1970, at the Astor Place Theatre, and closed on September 19, 1971 after 509 performances. The cast featured R. A. Dow, Paul Matthew Eckhart, and Ellen Gurin.
It subsequently toured and was then staged at the Duchess Theatre in London's West End in May 1971, where it ran to March 1973 for nearly 800 performances.
Another production opened at the Ivar Theater in Los Angeles in 1971, starring Michael Kearns and Eyen's muse Sharon Barr. In 1975, Eyen and Henry Krieger created a version of the show called The Dirtiest Musical in Town, starring Nell Carter.
Film
In 1980, Eyen directed a film version of the show for Showtime, making it the first made-for-TV movie ever produced for cable. The updated storyline for the film version begins with members of a New York City gym obsessing about their life situations, eventually leading up to the gay and straight characters writhing together in an orgy. It stars Sharon Barr and a young John Wesley Shipp.
References
External links
Review in TIME magazine, subscription required
The Dirtiest Show in Town on ITDB
Analysis of 1970s "adult musicals" on furious.com
1970 musicals
Off-Broadway musicals
West End musicals
Revues |
https://en.wikipedia.org/wiki/Society%20for%20International%20Development | The Society for International Development (SID) was founded in Washington, D.C., United States, in 1957.
SID has a network of individual and institutional members, local chapters and partner organisations, in more than 80 countries. It works with more than 100 associations, networks and institutions involving academia, parliamentarians, students, political leaders and development experts, both at local and international level.
Secretariat
The SID Secretariat has been based in Rome since 1979. Additionally, SID opened a Regional Office for Eastern and Southern Africa in Nairobi in 2003.
Governing Council
SID members elect the SID Governing Council via a mail ballot every four years. The current council for the 2012–2015 period is:
President: Juma Volter Mwapachu, Society for International Development, Tanzania
Vice President: Jean Gilson, Senior Vice President, Strategy and Information Technology at DAI
Treasurer: René Grotenhuis, Chief Executive Officer Cordaid, The Netherlands
Managing Director: Stefano Prato, Society for International Development
SID Journal Development
Development (, eISSN: ) is the quarterly journal of the Society for International Development (SID), published by the Palgrave Macmillan press.
The ISO 4 abbreviation for the journal is Development (Rome), but it is also cited as Development (Washington).
Membership
Most SID members are organised into local chapters through which they have the opportunity to engage in development initiatives and events (such as conferences, seminars, lecture series, round tables, advocacy campaigns, charity events) in their locale maintaining a strong link with the territory.
Washington Chapter
The Washington Chapter is the largest and most active chapter of the Society for International Development, with 150 member organizations and over a thousand individual members.
SID-Washington is committed to three principal objectives:
Stimulating dialogue and cooperation on global development issues
Enhancing skills, knowledge and understanding among development practitioners
Providing a network for individuals and organizations working in various sectors of international development
Notable event speakers
J. Brian Atwood, former Administrator of USAID and Dean of the Hubert H. Humphrey Institute of Public Affairs
Paul Collier, CBE, Director of the Centre for the Study of African Economies and author of The Bottom Billion: Why the Poorest Countries are Failing and What Can Be Done about It
Amb. John J. Danilovich, Chief Executive Officer, Millennium Challenge Corporation
Dr. Kemal Derviş, former Administrator of the UNDP and currently Director of the Global Economy and Development Program at the Brookings Institution
Dr. William Easterly, author of The White Man's Burden: Why the West's Efforts to Aid the Rest Have Done So Much Ill and So Little Good
Michael Fairbanks, Co-Founder of SEVEN and co-author of Plowing the Sea, Nurturing the Hidden Sources of Advantage in Developing Nations
Ri |
https://en.wikipedia.org/wiki/Where%27s%20Waldo%20at%20the%20Circus | Designed for "children ages 4 through 8", Where's Waldo at the Circus is a computer video game that immerses the player in a rich interactive environment complete with music, sound, and animation. A team of educators assisted with the game design, and the exercises within it conform to the guidelines of the National Council of Teachers of Mathematics and the California Department of Education.
The game is introduced by Waldo asking the player's name. After answering, the player goes to the Big Top to meet Wizard Whitebeard, who gives options of hearing the story behind the game or jumping right in.
Plot
Ringmaster Piccalilli has lost his magic golden whistle, and without it the circus cannot go on. Piccalilli asks the player to aid in its recovery. First the player has to find Waldo, who will help with the search.
Gameplay
The detailed virtual Where's Waldo? spreads page are four times the size of the screen and fully scrollable, packed with point-and-click characters and activity. The player can find the many hidden trigger spots, or just seek out Waldo right away. Once he is found, the story continues.
Along the bottom of the screen there are access buttons to Wizard Whitebeard, who holds the activity checklist, Senor Piccalilli, who returns the player to the main storyline, and the "Quit" icon.
Aside from spotting Waldo, the game has many mini-games and puzzles, including identifying and matching shapes, placing band members in order by height and by instrument pitch, and more.
By proceeding through the game's environments and activities collecting clues along the way, players eventually enters the Wizard's Den, where they can assemble the collected evidence, review it with help from Waldo and the Wizard, identify the culprit and retrieve the whistle.
All of the features in the game are designed for variable outcomes, with everything from the actual thief to Waldo's location in each screen being randomly determined each time through. This allows the player to play multiple times without repeating the past experience.
1995 video games
Children's educational video games
Windows games
Windows-only games
North America-exclusive video games
Video games based on Where's Waldo?
Video games developed in the United States
Hidden object games
Single-player video games |
https://en.wikipedia.org/wiki/Software%20modernization | Legacy modernization, also known as software modernization or platform modernization, refers to the conversion, rewriting or porting of a legacy system to modern computer programming languages, architectures (e.g. microservices), software libraries, protocols or hardware platforms. Legacy transformation aims to retain and extend the value of the legacy investment through migration to new platforms to benefit from the advantage of the new technologies.
As a basis and first step of software modernization initiatives, the strategy, the risk management, the estimation of costs, and its implementation, lies the knowledge of the system being modernized. The knowledge of what all functionalities are made for, and the knowledge of how it has been developed. As the subject-matter experts (SMEs) who worked at the inception and during all evolutions of the application are no-longer available or have a partial knowledge, and the lack of proper and up-to-date documentation, modernization initiatives start with assessing and discovering the application using Software intelligence.
Strategies
Making of software modernization decisions is a process within some organizational context. “Real world” decision making in business organizations often has to be made based on “bounded rationality”. Besides that, there exist multiple (and possibly conflicting) decision criteria; the certainty, completeness, and availability of useful information (as a basis for the decision) is often limited.
Legacy system modernization is often a large, multi-year project. Because these legacy systems are often critical in the operations of most enterprises, deploying the modernized system all at once introduces an unacceptable level of operational risk. As a result, legacy systems are typically modernized incrementally. Initially, the system consists completely of legacy code. As each increment is completed, the percentage of legacy code decreases. Eventually, the system is completely modernized. A migration strategy must ensure that the system remains fully functional during the modernization effort.
Modernization strategies
There are different drivers and strategies for software modernization:
Architecture Driven Modernization (ADM) is the initiative to standardize views of the existing systems in order to enable common modernization activities like code analysis and comprehension, and software transformation.
Business-Focus Approach: The modernization strategy is tied to the business value added by the modernization. It implies defining the intersection of the criticality to the business of an applications with its technical quality. This approach pushed by Gartner puts the Application Portfolio Analysis (APA) as a prerequisite of modernization decisions for an application portfolio to measures software health, risks, complexity and cost providing insight into application strengths and weaknesses.
Model Driven Engineering (MDE) is being investigated as an approach for re |
https://en.wikipedia.org/wiki/Toshiba%20T1100 | The Toshiba T1100 is a laptop manufactured by Toshiba in 1985, and has subsequently been described by Toshiba as "the world's first mass-market laptop computer". Its technical specifications were comparable to the original IBM PC desktop, using floppy disks (it had no hard drive), a 4.77 MHz Intel 80C88 CPU (a lower-power variation of the Intel 8088), 256 KB of conventional RAM extendable to 512 KB, and a monochrome LCD capable of displaying 80x25 text and 640x200 CGA graphics. Its original price was 1899 USD.
The T1100 PLUS is a later model of this laptop, released to the market in 1986. Some significant differences to the T1100 are: 16-bit data bus 80C86 CPU, 7.16 MHz or 4.77 MHz operation, 256 KB of conventional RAM (16-bit) extendable to 640 KB, and two internal 720 KB 3.5" diskette drives.
The T1100 was named an IEEE Milestone in 2009.
Clones
Toshiba T1100 PLUS was cloned in the USSR as Electronika MS 1504 in 1991.
See also
Toshiba T1000
Toshiba T1200
Toshiba T3100
References
External links
T1100 information at minuszerodegrees.net
360 degree view of T1100 at Russian Vintage Laptop Museum
360 degree view of T1100 PLUS at Russian Vintage Laptop Museum
Products introduced in 1985
Computer-related introductions in 1985
T1100
Early laptops |
https://en.wikipedia.org/wiki/Standard%20RAID%20levels | In computer storage, the standard RAID levels comprise a basic set of RAID ("redundant array of independent disks" or "redundant array of inexpensive disks") configurations that employ the techniques of striping, mirroring, or parity to create large reliable data stores from multiple general-purpose computer hard disk drives (HDDs). The most common types are RAID 0 (striping), RAID 1 (mirroring) and its variants, RAID 5 (distributed parity), and RAID 6 (dual parity). Multiple RAID levels can also be combined or nested, for instance RAID 10 (striping of mirrors) or RAID 01 (mirroring stripe sets). RAID levels and their associated data formats are standardized by the Storage Networking Industry Association (SNIA) in the Common RAID Disk Drive Format (DDF) standard. The numerical values only serve as identifiers and do not signify performance, reliability, generation, or any other metric.
While most RAID levels can provide good protection against and recovery from hardware defects or defective sectors/read errors (hard errors), they do not provide any protection against data loss due to catastrophic failures (fire, water) or soft errors such as user error, software malfunction, or malware infection. For valuable data, RAID is only one building block of a larger data loss prevention and recovery scheme – it cannot replace a backup plan.
RAID 0
RAID 0 (also known as a stripe set or striped volume) splits ("stripes") data evenly across two or more disks, without parity information, redundancy, or fault tolerance. Since RAID 0 provides no fault tolerance or redundancy, the failure of one drive will cause the entire array to fail; as a result of having data striped across all disks, the failure will result in total data loss. This configuration is typically implemented having speed as the intended goal. RAID 0 is normally used to increase performance, although it can also be used as a way to create a large logical volume out of two or more physical disks.
A RAID 0 setup can be created with disks of differing sizes, but the storage space added to the array by each disk is limited to the size of the smallest disk. For example, if a 120 GB disk is striped together with a 320 GB disk, the size of the array will be 120 GB × 2 = 240 GB. However, some RAID implementations would allow the remaining 200 GB to be used for other purposes.
The diagram in this section shows how the data is distributed into stripes on two disks, with A1:A2 as the first stripe, A3:A4 as the second one, etc. Once the stripe size is defined during the creation of a RAID 0 array, it needs to be maintained at all times. Since the stripes are accessed in parallel, an -drive RAID 0 array appears as a single large disk with a data rate times higher than the single-disk rate.
Performance
A RAID 0 array of drives provides data read and write transfer rates up to times as high as the individual drive rates, but with no data redundancy. As a result, RAID 0 is primarily used in ap |
https://en.wikipedia.org/wiki/Range%20%28computer%20programming%29 | In computer science, the term range may refer to one of three things:
The possible values that may be stored in a variable.
The upper and lower bounds of an array.
An alternative to iterator.
Range of a variable
The range of a variable is given as the set of possible values that that variable can hold. In the case of an integer, the variable definition is restricted to whole numbers only, and the range will cover every number within its range (including the maximum and minimum). For example, the range of a signed 16-bit integer variable is all the integers from −32,768 to +32,767.
Range of an array
When an array is numerically indexed, its range is the upper and lower bound of the array. Depending on the environment, a warning, a fatal exception, or unpredictable behavior will occur if the program attempts to access an array element that is outside the range. In some programming languages, such as C, arrays have a fixed lower bound (zero) and will contain data at each position up to the upper bound (so an array with 5 elements will have a range of 0 to 4). In others, such as PHP, an array may have holes where no element is defined, and therefore an array with a range of 0 to 4 will have up to 5 elements (and a minimum of 2).
Range as an alternative to iterator
Another meaning of range in computer science is an alternative to iterator. When used in this sense, range is defined as "a pair of begin/end iterators packed together". It is argued that "Ranges are a superior abstraction" (compared to iterators) for several reasons, including better safety.
In particular, such ranges are supported in C++20, Boost C++ Libraries and the D standard library.
See also
Interval
References
Programming constructs
Arrays |
https://en.wikipedia.org/wiki/Odd%20greedy%20expansion | In number theory, the odd greedy expansion problem asks whether a greedy algorithm for finding Egyptian fractions with odd denominators always succeeds. , it remains unsolved.
Description
An Egyptian fraction represents a given rational number as a sum of distinct unit fractions. If a rational number is a sum of unit fractions with odd denominators,
then must be odd. Conversely, every fraction with odd can be represented as a sum of distinct odd unit fractions. One method of finding such a representation replaces by where for a sufficiently large , and then expands as a sum of distinct divisors of .
However, a simpler greedy algorithm has successfully found Egyptian fractions in which all denominators are odd for all instances (with odd ) on which it has been tested: let be the least odd number that is greater than or equal to , include the fraction in the expansion, and continue in the same way (avoiding repeated uses of the same unit fraction) with the remaining fraction . This method is called the odd greedy algorithm and the expansions it creates are called odd greedy expansions.
Stein, Selfridge, Graham, and others have posed the question of whether the odd greedy algorithm terminates with a finite expansion for every with odd. , this question remains open.
Example
Let = 4/23.
23/4 = 5; the next larger odd number is 7. So the first step expands
161/5 = 32; the next larger odd number is 33. So the next step expands
5313/4 = 1328; the next larger odd number is 1329. So the third step expands
Since the final term in this expansion is a unit fraction, the process terminates with this expansion as its result.
Fractions with long expansions
It is possible for the odd greedy algorithm to produce expansions that are shorter than the usual greedy expansion, with smaller denominators. For instance,
where the left expansion is the greedy expansion and the right expansion is the odd greedy expansion. However, the odd greedy expansion is more typically long, with large denominators. For instance, as Wagon discovered, the odd greedy expansion for 3/179 has 19 terms, the largest of which is approximately 1.415×10439491. Curiously, the numerators of the fractions to be expanded in each step of the algorithm form a sequence of consecutive integers:
A similar phenomenon occurs with other numbers, such as 5/5809 (an example found independently by K. S. Brown and David Bailey) which has a 27-term expansion. Although the denominators of this expansion are difficult to compute due to their enormous size, the numerator sequence may be found relatively efficiently using modular arithmetic. describes several additional examples of this type found by Broadhurst, and notes that K. S. Brown has described methods for finding fractions with arbitrarily long expansions.
On even denominators
The odd greedy algorithm cannot terminate when given a fraction with an even denominator, because these fractions do not have finite representations wit |
https://en.wikipedia.org/wiki/FireWave | The FireWave is a device that is, essentially, an external FireWire soundcard made by Griffin Technology as a third party accessory for Apple Inc.'s line of personal computers.
FireWave uses the FireWire (IEEE 1394) port of the Mac as an audio output to its Dolby Digital sound processing hardware, effectively acting as an external soundcard.
Griffin Technology's product website explains that FireWave uses the Dolby processors to allow the user to connect a 5.1 surround sound system. Speakers are then connected directly to FireWave's speaker terminals. Many different sound setups and configurations are possible, using a combination of Griffin's included FireWave software and Apple's "Audio MIDI Setup" utility.
Griffin Technology's website lists the Griffin FireWave as a discontinued item.
Technical
FireWave has six output channels through three 1/8” (3.5 mm) stereo mini-jacks: Left/Right, Center/Subwoofer and Right Surround/Left Surround. There is also a passthrough FireWire port to allow for chaining more FireWire devices.
FireWave supports Dolby Digital and Dolby Pro Logic II, and has a frequency response of 20-20,000 Hz.
Compatibility: The FireWave is listed as being compatible with Mac OS X version 10.4.6 (Tiger.) Officially, Griffin Technology does not support the FireWave under OS X 10.5.x (Leopard), however version 1.0 of the FireWave software does work with Leopard.
Griffin has announced the discontinuation of this product, so it is unlikely that Leopard-specific drivers will be released.
External links
FireWave product info page by Griffin Technology
Macintosh internals
Sound cards |
https://en.wikipedia.org/wiki/Lisa%20Connor | Lisa Connor is an American soap opera writer, producer, and director. She is a writer on the ABC Daytime and The Online Network serial drama All My Children.
In 2020 she was one of the recruits for a fiction app named "Radish" which had $63m of funding and it was opening an office in LA. The soap writers recruited included Janet Iacobuzio, Addie Walsh, Leah Laiman, and Jean Passanante.
Positions held
All My Children
Co-Head Writer: May 29, 2013 - September 2013 (hired by Prospect Park)
Script Editor: Jan 29, 2013 - September 2013 (hired by Ginger Smith)
Script Writer: May 3, 2010 - December 2010 (hired by Lorraine Broderick)
Breakdown Writer: April 2002 - January 5, 2005; January 6, 2011 - September 23, 2011 (hired by Richard Culliton)
Supervising Producer: 1999 - March 2002 (hired by Jean Dadario Burke)
As the World Turns
Script Writer: June 30, 2008 - December 2008
Breakdown Writer: 1997 - 1999; March 3, 2005 - January 24, 2008; April 18, 2008 - June 27, 2008
Days of Our Lives
Breakdown Writer: May 22, 2012 - August 13, 2012
Script Writer: September 26, 2016 – present
General Hospital
Occasional Script Writer: October 20, 2011; December 6, 2011; December 8, 2011
Occasional Breakdown Writer: January 6, 2012
Guiding Light
Script Writer: 1994
Associate Director: 1992 - 1994
Production Coordinator: 1980s
One Life to Live (hired by Michael Malone)
Script Writer: 1995 - 1996
The Young and the Restless (hired by Maria Arena Bell and Hogan Sheffer)
Script Writer (April 30, 2009 - March 25, 2010)
Breakdown Writer (March 30, 2009 - August 4, 2009)
Awards and nominations
Daytime Emmy Awards
Nominations
2003–2004, 2006: Best Writing, As The World Turns
2001 & 2002: Best Drama Series, All My Children
2000: Best Writing, As The World Turns
1996: Best Writing, One Life To Live
1993: Best Directing;, Guiding Light
Wins
1994: Best Directing, Guiding Light
Writers Guild of America Award
Nominations
1997, 1998, 2005 & 2006 seasons: As The World Turns
Wins
2003 season: All My Children
References
External links
American soap opera writers
American television directors
American women television directors
Daytime Emmy Award winners
Living people
Soap opera producers
Writers Guild of America Award winners
Place of birth missing (living people)
Year of birth missing (living people)
American women television producers
American women television writers
Women soap opera writers
21st-century American women |
https://en.wikipedia.org/wiki/Muppets%20Inside | The Muppet CD-ROM: Muppets Inside is a PC computer game based on The Muppets franchise produced by Starwave in 1996. The title is a play on Intel's advertising slogan, "Intel Inside." The game's plot consists of several Muppets characters getting trapped inside a computer, and Bunsen sending Kermit and Fozzie Bear into the computer to rescue them.
Gameplay
As players rescue the Muppets, they encounter seven "Muppetized" games:
Kitchens of Doom: A parody of Doom, with the Swedish Chef fighting giant vegetables in a crypt-like kitchen.
Beaker's Brain: The player helps Bunsen unscramble Beaker's memories of Muppet Show clips.
Statler and Waldorf: Two Thumbs Down: The player rotates boxes to unscramble Statler and Waldorf's video clip.
Wocka on the Wild Side: In a parody of Missile Command, the player shoots down flying tomatoes that the audience throws at Fozzie Bear as he crosses the Muppet Theater stage.
Death-Defying Acts of Culture: The player positions Gonzo's cannon so he flies through a target.
Scope That Song: Clifford hosts a version of Name That Tune, with the songs played by Lew Zealand's fish or Marvin Suggs and the Muppaphone.
Trivial But True!: A Hollywood Squares game, with Fozzie Bear as the center square.
Additional content
Muppets Inside's gameplay contains over an hour of new audio and video footage, as well as five new songs and classics from The Muppet Show. The game also contains a bonus "Muppetizer'" feature that provides custom cursors, sounds and wallpapers. The game's CD-ROM also came packaged with a 6x6 inch, 30-page booklet with Henson history, character profiles, game instructions, and credits.
Cast
Steve Whitmire as Kermit the Frog, Rizzo the Rat, Beaker
Dave Goelz as Gonzo the Great, Waldorf, Dr. Bunsen Honeydew
Jerry Nelson as Statler, Lew Zealand, Floyd Pepper, The Muppet Newsman, Announcer, Crazy Harry
Frank Oz as Miss Piggy, Fozzie Bear, Sam the Eagle, Animal, Marvin Suggs
Kevin Clash as Clifford
Bill Barretta as The Swedish Chef
Reception
The editors of Computer Games Strategy Plus nominated Muppets Inside as their pick for 1996's best "traditional" game, but the award ultimately went to Power Chess.
In a retrospective review, PC Gamer praised the humor of the videos and game concepts, while criticizing the tedium of the small number of games.
References
External links
Muppets Inside FAQ
Muppets Inside on GameFAQs
1996 video games
North America-exclusive video games
Windows games
Windows-only games
The Muppets video games
Video games about amphibians
Video games about pigs
Video games about bears
Video games about mice and rats
Video games developed in the United States |
https://en.wikipedia.org/wiki/STUDENT%20%28computer%20program%29 | STUDENT is an early artificial intelligence program that solves algebra word problems. It is written in Lisp by Daniel G. Bobrow as his PhD thesis in 1964 (Bobrow 1964). It was designed to read and solve the kind of word problems found in high school algebra books. The program is often cited as an early accomplishment of AI in natural language processing.
Technical description
In the 1960s, mainframe computers were only available within a research context at the university. Within Project MAC at MIT, the STUDENT system was an early example of a question answering software, which uniquely involved natural language processing and symbolic programming. Other early attempts for solving algebra story problems were realized with 1960s hardware and software as well: for example, the Philips, Baseball and Synthex systems.
STUDENT accepts an algebra story written in the English language as input, and generates a number as output. This is realized with a layered pipeline that consists of heuristics for pattern transformation. At first, sentences in English are converted into kernel sentences, which each contain a single piece of information. Next, the kernel sentences are converted into mathematical expressions. The knowledge base that supports the transformation contains 52 facts.
STUDENT uses a rule-based system with logic inference. The rules are pre-programmed by the software developer and are able to parse natural language.
More powerful techniques for natural language processing, such as machine learning, came into use later as hardware grew more capable, and gained popularity over simpler rule-based systems.
Example
(extracted from Norvig)
References
Natural Language Input for a Computer Problem Solving System, Bobrow's PhD thesis.
, p. 19
, pp. 76–79
History of artificial intelligence |
https://en.wikipedia.org/wiki/Ppoa | Ppoa or PPOA may refer to:
Point-to-Point Protocol over ATM, a network protocol
Linoleate 8R-lipoxygenase, an enzyme
9,12-octadecadienoate 8-hydroperoxide 8R-isomerase, an enzyme |
https://en.wikipedia.org/wiki/ONETEP | ONETEP (Order-N Electronic Total Energy Package) is a linear-scaling density functional theory software package able to run on parallel computers. It uses a basis of non-orthogonal generalized Wannier functions (NGWFs) expressed in terms of periodic cardinal sine (psinc) functions, which are in turn equivalent to a basis of plane-waves. ONETEP therefore combines the advantages of the plane-wave approach (controllable accuracy and variational convergence of the total energy with respect to the size of the basis) with computational effort that scales linearly with the size of the system. The ONETEP approach involves simultaneous optimization of the density kernel (a generalization of occupation numbers to non-orthogonal basis, which represents the density matrix in the basis of NGWFs) and the NGWFs themselves. The optimized NGWFs then provide a minimal localized basis set, which can be considerably smaller in size, but of equal or higher accuracy, than the unoptimized basis sets used in most linear-scaling approaches.
ONETEP has been developed by a UK-centric group of academics based at the universities of Cambridge, Southampton, Warwick, Imperial College London and Gdańsk University of Technology. It is available to academics at a reduced rate, and licenses can be obtained for non-academic usage from the developers or through Accelrys' Materials Studio package. The latest academic version 6.0 was released on 15 September 2020.
See also
Density functional theory
Quantum chemistry computer programs
External links
References
Computational chemistry software
Density functional theory software |
https://en.wikipedia.org/wiki/Session%20ID | In computer science, a session identifier, session ID or session token is a piece of data that is used in network communications (often over HTTPS) to identify a session, a series of related message exchanges. Session identifiers become necessary in cases where the communications infrastructure uses a stateless protocol such as HTTP. For example, a buyer who visits a seller's website wants to collect a number of articles in a virtual shopping cart and then finalize the shopping by going to the site's checkout page. This typically involves an ongoing communication where several webpages are requested by the client and sent back to them by the server. In such a situation, it is vital to keep track of the current state of the shopper's cart, and a session ID is one way to achieve that goal.
A session ID is typically granted to a visitor on their first visit to a site. It is different from a user ID in that sessions are typically short-lived (they expire after a preset time of inactivity which may be minutes or hours) and may become invalid after a certain goal has been met (for example, once the buyer has finalized their order, they cannot use the same session ID to add more items).
As session IDs are often used to identify a user that has logged into a website, they can be used by an attacker to hijack the session and obtain potential privileges. A session ID is usually a randomly generated string to decrease the probability of obtaining a valid one by means of a brute-force search. Many servers perform additional verification of the client, in case the attacker has obtained the session ID. Locking a session ID to the client's IP address is a simple and effective measure as long as the attacker cannot connect to the server from the same address, but can conversely cause problems for a client if the client has multiple routes to the server (e.g. redundant internet connections) and the client's IP address undergoes Network Address Translation.
Examples of the names that some programming languages use when naming their cookie include JSESSIONID (Java EE), PHPSESSID (PHP), and ASPSESSIONID (Microsoft ASP).
See also
Session management
External links
"PHP manual"
"ASP manual" at w3schools
Network protocols |
https://en.wikipedia.org/wiki/SLIB | SLIB is computer software, a library for the programming language Scheme, written by Aubrey Jaffer. It uses only standard Scheme syntax and thus works on many different Scheme implementations, such as Bigloo, Chez Scheme, Extension Language Kit 3.0, Gambit 3.0, GNU Guile, JScheme, Kawa, Larceny, MacScheme, MIT/GNU Scheme, Pocket Scheme, Racket, RScheme, Scheme 48, SCM, SCM Mac, and scsh. SLIB is used by GnuCash. Other implementations can support SLIB in a unified way through Scheme Requests for Implementation (SRFI) 96.
SLIB is a GNU package.
References
External links
Scheme (programming language)
GNU Project software |
https://en.wikipedia.org/wiki/Nokia%208800 | The Nokia 8800 (pronounced eighty-eight-hundred) is a luxury mobile phone produced by Nokia, based on the Nokia Series 40 operating system. The 8800 features a stainless-steel housing with a scratch-resistant screen and has a weight of 134 grams. According to Nokia, the 8800's "sophisticated slide mechanism uses premium ball bearings crafted by the makers of bearings used in high performance cars".
The Nokia 8800 was first introduced on 7 April 2005 and was commercially available in the United Kingdom in October 2005 on the O2 mobile phone network. The Nokia 8801 was introduced in North America and uses the frequencies predominant in North America of 850 MHz and 1900 MHz. In most respects the Nokia 8801 is identical to the Nokia 8800 other than the use of 850/1800/1900 MHz rather than 900/1800/1900 MHz on the Nokia 8800.
Features
Screen protected by scratch-resistant glass window.
Integrated SVGA camera, with Video recording (H.263 QCIF format) and streaming.
Active TFT display with 256K colors (208 x 208 pixels) with 3D image engine for enhanced graphics.
Digital music player; can play MP3 and AAC audio.
Device-to-device synchronization.
Sliding keypad and screen with bi-stable spring mechanism and ball bearing tracks.
Bluetooth wireless connectivity.
Built-in FM radio.
Can access EDGE networks.
Music by Brian Eno
The ringtones were composed by Ryuichi Sakamoto.
The 8800 comes with two BL-5X (600 mAh) batteries, with a manufacturer-specified talk time of up to 1.5–3 hours or up to 8 days standby time per battery. However, users found this was very optimistic and most users have to charge their phone several times a day.
Nokia 8800 Sirocco Edition
The Nokia 8800 Sirocco Edition (88 redesigned fascia and in "gold" and "queen black", was released in 2006. This version of the phone has a 2-megapixel camera and slightly updated keypad layout. The phone chassis was slightly modified to include the upgraded 700mAH BP-6X battery. It features ringtones composed by renowned electronic musician Brian Eno, who also composed the Windows 95 startup sound.
In early 2007 Nokia released the 24ct gold plated version of the 8800 Sirocco, which became the most expensive phone (RRP $2049.00) in Nokia's catalogue of cell phone models up until the newest generation of mobile phones.
The Sirocco namesake was later used by HMD Global in 2018 for the flagship Nokia 8 Sirocco phone.
Nokia 8800 Arte Edition (8800e)
The Nokia 8800 Arte is an updated version of the 8800. It features a 2.0 inch scratch resistant OLED screen, a 3.15 MP camera with autofocus, and comes in four different models:
As with previous editions, it continues the trend of having ringtones composed by popular electronic artists, with the ringtones being composed by Austrian downtempo duo Kruder & Dorfmeister. Visuals were created by Fritz Fitzke.
References
External links
Nokia 8800 Sirocco Edition Review
Nokia 8800 Review
8800
Mobile phones introduced in 2005
Slider phones |
https://en.wikipedia.org/wiki/EB-eye | The EB-eye, also known as EBI Search, is a search engine that provides uniform access to the biological data resources hosted at the European Bioinformatics Institute (EBI).
The EB-eye – the EBI search engine for biological data
The European Bioinformatics Institute is a non-profit academic organisation that forms part of the European Molecular Biology Laboratory (EMBL).
The EBI is a centre for research and services in bioinformatics. The Institute manages databases of biological data including nucleotide sequences, protein sequences and macromolecular structures.
The mission of the EBI
To provide freely available data and bioinformatics services to the scientific community in ways that promote scientific progress.
To contribute to the advancement of biology through basic investigator-driven research in bioinformatics.
To provide advanced bioinformatics training to scientists at all levels, from PhD students to independent investigators.
To help disseminate cutting-edge technologies to industry.
What is the EB-eye ?
The EB-eye is a fast and efficient search engine that currently provides easy and uniform access to biological data resources hosted at the EBI.
The project was started in August 2006 and is developed on top of the Apache Lucene technology. It is a Java framework that provides extremely powerful indexing and search capabilities.
The EB-eye presents the hits of a search in a very simple way and acts as a gateway to access biological entries and related information in dedicated portals. One of the key features of EB-eye is the capability to coherently display the relationships that exist between diverse databases allowing the user to navigate this network of cross-references.
The user can search globally across all EBI data resources through the "Global Search" box or even create more specific queries on targeted resources by using the EB-eye Query Builder.
EB-eye publicly exposes both a web and a Web services RESTful interface.
Access to the EB-eye
From the EBI web site
From https://www.ebi.ac.uk/ebisearch
From the RESTful Web services API
Global search
The global search is available on the EBI web site. You can simply type some query terms into the text search box there and press the search button (or press Enter). The system then displays a summary page with a list of various data sets and the number of matches found in each of them.
Global search examples
Search for insulin receptor
Search for p53
Search for web production team
Search for escherichia NOT coli
Search for C2H2 zinc finger family
Search for DNA binding
Query builder
The query builder allows users to create and save complex queries on the available data to get specific search results. See the complex query examples section.
What can the user search for?
Many resources at EBI are indexed within the search engine, but some are not.
The EB-eye can search only the information that gets indexed. This implies that other search engines o |
https://en.wikipedia.org/wiki/Multivariate%20optical%20computing | Multivariate optical computing, also known as molecular factor computing, is an approach to the development of compressed sensing spectroscopic instruments, particularly for industrial applications such as process analytical support. "Conventional" spectroscopic methods often employ multivariate and chemometric methods, such as multivariate calibration, pattern recognition, and classification, to extract analytical information (including concentration) from data collected at many different wavelengths. Multivariate optical computing uses an optical computer to analyze the data as it is collected. The goal of this approach is to produce instruments which are simple and rugged, yet retain the benefits of multivariate techniques for the accuracy and precision of the result.
An instrument which implements this approach may be described as a multivariate optical computer. Since it describes an approach, rather than any specific wavelength range, multivariate optical computers may be built using a variety of different instruments (including Fourier Transform Infrared (FTIR) and Raman).
The "software" in multivariate optical computing is encoded directly into an optical element spectral calculation engine such as an interference filter based multivariate optical element (MOE), holographic grating, liquid crystal tunable filter, spatial light modulator (SLM), or digital micromirror device (DMD) and is specific to the particular application. The optical pattern for the spectral calculation engine is designed for the specific purpose of measuring the magnitude of that multi-wavelength pattern in the spectrum of a sample, without actually measuring a spectrum.
Multivariate optical computing allows instruments to be made with the mathematics of pattern recognition designed directly into an optical computer, which extracts information from light without recording a spectrum. This makes it possible to achieve the speed, dependability, and ruggedness necessary for real time, in-line process control instruments.
Multivariate optical computing encodes an analog optical regression vector of a transmission function for an optical element. Light which emanates from a sample contains the spectral information of that sample, whether the spectrum is discovered or not. As light passes from a sample through the element, the normalized intensity, which is detected by a broad band detector, is proportional to the dot product of the regression vector with that spectrum, i.e. is proportional to the concentration of the analyte for which the regression vector was designed. The quality of the analysis is then equal to the quality of the regression vector which is encoded. If the resolution of the regression vector is encoded to the resolution of the laboratory instrument from which that regression vector was designed and the resolution of the detector is equivalent, then the measurement made by Multivariate Optical Computing will be equivalent to that laboratory |
https://en.wikipedia.org/wiki/Intelligent%20database | Until the 1980s, databases were viewed as computer systems that stored record-oriented and business data such as manufacturing inventories, bank records, and sales transactions. A database system was not expected to merge numeric data with text, images, or multimedia information, nor was it expected to automatically notice patterns in the data it stored. In the late 1980s the concept of an intelligent database was put forward as a system that manages information (rather than data) in a way that appears natural to users and which goes beyond simple record keeping.
The term was introduced in 1989 by the book Intelligent Databases by Kamran Parsaye, Mark Chignell, Setrag Khoshafian and Harry Wong. The concept postulated three levels of intelligence for such systems: high level tools, the user interface and the database engine. The high level tools manage data quality and automatically discover relevant patterns in the data with a process called data mining. This layer often relies on the use of artificial intelligence techniques. The user interface uses hypermedia in a form that uniformly manages text, images and numeric data. The intelligent database engine supports the other two layers, often merging relational database techniques with object orientation.
In the twenty-first century, intelligent databases have now become widespread, e.g. hospital databases can now call up patient histories consisting of charts, text and x-ray images just with a few mouse clicks, and many corporate databases include decision support tools based on sales pattern analysis.
External links
Intelligent Databases, book
Databases
Artificial intelligence |
https://en.wikipedia.org/wiki/Multivariate%20optical%20element | A multivariate optical element (MOE), is the key part of a multivariate optical computer; an alternative to conventional spectrometry for the chemical analysis of materials.
It is helpful to understand how light is processed in a multivariate optical computer, as compared to how it is processed in a spectrometer. For example, if we are studying the composition of a powder mixture using diffuse reflectance, a suitable light source is directed at the powder mixture and light is collected, usually with a lens, after it has scattered from the powder surface. Light entering a spectrometer first strikes a device (either a grating or interferometer) that separates light of different wavelengths to be measured. A series of independent measurements is used to estimate the full spectrum of the mixture, and the spectrometer renders a measurement of the spectral intensity at many wavelengths. Multivariate statistics can then be applied to the spectrum produced.
In contrast, when using multivariate optical computing, the light entering the instrument strikes an application specific multivariate optical element, which is uniquely tuned to the pattern that needs to be measured using multivariate analysis.
This system can produce the same result that multivariate analysis of a spectrum would produce. Thus, it can generally produce the same accuracy as laboratory grade spectroscopic systems, but with the fast speed inherent with a pure, passive, optical computer. The multivariate optical computer makes use of optical computing to realize the performance of a full spectroscopic system using traditional multivariate analysis. A side benefit is that the throughput and efficiency of the system is higher than conventional spectrometers, which increases the speed of analysis by orders of magnitude.
While each chemical problem presents its own unique challenges and opportunities, the design of a system for a specific analysis is complex and requires the assembly of several pieces of a spectroscopic puzzle. The data necessary for a successful design are spectral characteristics of light sources, detectors and a variety of optics to be used in the final assemblage, dispersion characteristics of the materials used in the wavelength range of interest, and a set of calibrated sample spectra for pattern-recognition-based analysis. With these pieces assembled, suitable application specific multivariate optical computer designs can be generated and the performance accurately modeled and predicted.
See also
Optical computer
References
Spectroscopy |
https://en.wikipedia.org/wiki/Shosholoza%20%28disambiguation%29 | "Shosholoza" is a South African folk song. It can also refer to:
Shosholoza Meyl, a South African train network
Team Shosholoza, the South African entry in the 2007 America's Cup Challenge |
https://en.wikipedia.org/wiki/Matrix-free%20methods | In computational mathematics, a matrix-free method is an algorithm for solving a linear system of equations or an eigenvalue problem that does not store the coefficient matrix explicitly, but accesses the matrix by evaluating matrix-vector products. Such methods can be preferable when the matrix is so big that storing and manipulating it would cost a lot of memory and computing time, even with the use of methods for sparse matrices. Many iterative methods allow for a matrix-free implementation, including:
the power method,
the Lanczos algorithm,
Locally Optimal Block Preconditioned Conjugate Gradient Method (LOBPCG),
Wiedemann's coordinate recurrence algorithm, and
the conjugate gradient method.
Krylov subspace methods
Distributed solutions have also been explored using coarse-grain parallel software systems to achieve homogeneous solutions of linear systems.
It is generally used in solving non-linear equations like Euler's equations in computational fluid dynamics. Matrix-free conjugate gradient method has been applied in the non-linear elasto-plastic finite element solver. Solving these equations requires the calculation of the Jacobian which is costly in terms of CPU time and storage. To avoid this expense, matrix-free methods are employed. In order to remove the need to calculate the Jacobian, the Jacobian vector product is formed instead, which is in fact a vector itself. Manipulating and calculating this vector is easier than working with a large matrix or linear system.
References
Numerical linear algebra |
https://en.wikipedia.org/wiki/STklos | STklos is a Scheme implementation that succeeded STk. It is a bytecode compiler with an ad hoc virtual machine which aims to be fast as well as light.
STklos is free software, released under the GNU General Public License.
In addition to implementing most of R5RS, and a large part of R7RS, STklos supports:
an object system based on CLOS with multiple inheritance, generic functions, multimethods and a MOP
a module system
easy connection with the GTK toolkit
a low-level macro system that compiles macro expanders into bytecode (syntax-rules is also present as a high-level macro system)
a full Numerical tower implementation, as defined in R7RS
Unicode support
Perl compatible regular expressions via PCRE library
a simple foreign function interface via libffi
being compiled as a library and embedded in an application
native threads, using the libpthread library. The API conforms to SRFI-18
a number of SRFIs
easy access to SLIB
an HTTP client
Additional libraries are available through its package system ScmPkg.
References
External links
STklos home page
STklos documentation
Scheme (programming language) interpreters
Scheme (programming language) implementations |
https://en.wikipedia.org/wiki/Chez%20Scheme | Chez Scheme is a programming language, a dialect and implementation of the language Scheme which is a type of Lisp. It uses an incremental native-code compiler to produce native binary files for the x86 (IA-32, x86-64), PowerPC, and SPARC processor architectures. It has supported the R6RS standard since version 7.9.1. It is free and open-source software released under an Apache License, version 2.0. It was first released in 1985, by R. Kent Dybvig, originally licensed as proprietary software, and then released as open-source software on GitHub on 2016-05-13 with version 9.4.
Petite Chez Scheme is a sibling implementation which uses a threaded interpreter design instead of Chez Scheme's incremental native-code compiler. Programs written for Chez Scheme run unchanged in Petite Chez Scheme, as long as they do not depend on using the compiler (for example foreign function interface is only available in the compiler). Petite Chez Scheme was originally freely distributable and is now distributed open-source as part of Chez Scheme.
History
The first version of Chez Scheme was developed by R. Kent Dybvig and completed in 1984. Some copies of the original version were distributed in 1985.
Cadence Research Systems developed Chez Scheme until the company was purchased by Cisco Systems in 2011. Cisco open-sourced Chez Scheme in 2016.
Performance
In one series of benchmarks, Chez Scheme was among the fastest available Scheme implementations on the Sun SPARC processor architecture, while Petite Chez Scheme was among the slowest implementations on the more common x86 (Pentium 32-bit) processor architecture.
Libraries
Chez Scheme has a windowing system and computer graphics package called the Scheme Widget Library, and is supported by the portable SLIB library.. However the widget library is no longer maintained.
References
External links
The Development of Chez Scheme by R. Kent Dybvig
Chez Scheme formal project page on GitHub
Chez Scheme on the Scheme wiki
Formerly proprietary software
Scheme (programming language) compilers
Scheme (programming language) interpreters
Scheme (programming language) implementations
Software using the Apache license
R6RS Scheme |
https://en.wikipedia.org/wiki/Comparison%20of%20spreadsheet%20software | Spreadsheet is a class of application software design to analyze tabular data called "worksheets". A collection of worksheets is called a "workbook". Online spreadsheets do not depend on a particular operating system but require a standards-compliant web browser instead. One of the incentives for the creation of online spreadsheets was offering worksheet sharing and public sharing or workbooks as part of their features which enables collaboration between multiple users. Some on-line spreadsheets provide remote data update, allowing data values to be extracted from other users' spreadsheets even though they may be inactive at the time.
General
Operating system support
The operating systems the software can run on natively (without emulation). Android and iOS apps can be optimized for Chromebooks and iPads which run the operating systems ChromeOS and iPadOS respectively, the operating optimizations include things like multitasking capabilities, large and multi-display support, better keyboard and mouse support.
Supported file formats
This table gives a comparison of what file formats each spreadsheet can import and export. "Yes" means can both import and export.
Rows and Columns
-* 32-bit addressable memory on Microsoft Windows, i.e. ~2.5 GB.
See also
List of spreadsheet software
Comparison of word processors
Notes
References
Spreadsheets |
https://en.wikipedia.org/wiki/Jerry%20Levin | Jerry Levin may refer to:
Jerry Levin (journalist), CNN network journalist, kidnapped and held hostage by Hezbollah
Jerry W. Levin, American businessman, CEO, turnaround expert and mergers & acquisitions specialist
Gerald M. Levin, known as Jerry, American mass-media businessman |
https://en.wikipedia.org/wiki/Elliott%20803 | The Elliott 803 is a small, medium-speed transistor digital computer which was manufactured by the British company Elliott Brothers in the 1960s. About 211 were built.
History
The 800 series began with the 801, a one-off test machine built in 1957. The 802 was a production model but only seven were sold between 1958 and 1961. The short-lived 803A was built in 1959 and first delivered in 1960; the 803B was built in 1960 and first delivered in 1961.
Over 200 Elliott 803 computers were delivered to customers, at a unit price of about £29,000 in 1960 (roughly ). Most sales were of the 803B version with more parallel paths internally, larger memory and hardware floating-point operations.
The Elliott 803 was the computer used in the ISI-609, the world's first process or industrial control system, wherein the 803 was a data logger. It was used for this purpose at the US's first dual-purpose nuclear reactor, the N-Reactor.
A significant number of British universities had an Elliott 803.
Elliott subsequently developed (1963) the much faster, software compatible, Elliott 503.
Two complete Elliott 803 computers survive. One is owned by the Science Museum in London but it is not on display to the public. The second is owned by The National Museum of Computing (TNMoC) at Bletchley Park, is fully functional, and can regularly be seen in operation by visitors to that museum.
Hardware description
The 803 is a transistorised, bit-serial machine; the 803B has more parallel paths internally. It uses ferrite magnetic-core memory in 4096 or 8192 words of 40 bits, comprising 39 bits of data with parity. The central processing unit (CPU) is housed in one cabinet with a height, width, and depth, of . Circuitry is based on printed circuit boards with the circuits being rather simple and most of the signalling carried on wires. There is a second cabinet about half the size used for the power supply, which is unusually based on a large nickel–cadmium battery with charger, an early form of uninterruptible power supply. A third cabinet (the same size as the power cabinet) holds the extra working store on machines with 8192 word stores. There is an operator's control console, Creed teleprinter and high-speed paper punched tape reader and punch for input/output, using 5-track Elliott telecode code, not Baudot. Tape is read at 500 characters per second and punched at 100 cps.
The operator's console, about 60 inches long, allows low-level instructions to be entered manually to manipulate addresses and data and can start, stop and step the machine: there is a loudspeaker (pulsed by the top bit of the instruction register) which allows the operator to judge the status of a computation. The system requires air conditioning, drawing about 3.5 kW of power in a minimal configuration. A minimal installation weighed about .
Optional mass storage is available on an unusual magnetic tape system based on standard 35 mm film stock coated with iron oxide (manufactured by Kodak |
https://en.wikipedia.org/wiki/Extensible%20Forms%20Description%20Language | Extensible Forms Description Language (XFDL) is a high-level computer language that facilitates defining a form as a single, stand-alone object using elements and attributes from the Extensible Markup Language (XML). Technically, it is a class of XML originally specified in a World Wide Web Consortium (W3C) Note. See Specifications below for links to the current versions of XFDL. XFDL It offers precise control over form layout, permitting replacement of existing business/government forms with electronic documents in a human-readable, open standard.
In addition to precision layout control, XFDL provides multiple page capabilities, step-by-step guided user experiences, and digital signatures. XFDL also provides a syntax for in-line mathematical and conditional expressions and data validation constraints as well as custom items, options, and external code functions. Current versions of XFDL (see Specifications below) are capable of providing these interactive features via open standard markup languages including XForms, XPath, XML Schema and XML Signatures.
XFDL not only supports multiple digital signatures, but the signatures can apply to specific sections of a form and prevent changes to signed content.
These advantages to XFDL led large organizations such as the United States Army and Air Force to migrate to XFDL from using forms in other formats. Later, though, the lack of portable software capable of creating XFDL led them to investigate moving away from it. The Army migrated to Adobe fillable PDFs in 2014.
References
External links
Extensible Markup Language (XML) 1.0 (Fifth Edition), W3C Recommendation, 26 NOV 2008.
XML Coverpages
United States Army Publishing Directorate
USAF webpage with public downloadable XFDL reader: see "items of interest" link on right side of page for viewer download.
See also XML Paper Specification (XPS)
Specifications
Extensible Forms Description Language (XFDL) 8.0
Extensible Forms Description Language (XFDL) 7.7
Extensible Forms Description Language (XFDL) 4.0
Editors
IBM Forms Designer
See XML editor for XML editors and other editing tools.
XML markup languages
Markup languages
World Wide Web Consortium standards
Technical communication
Computer file formats
Open formats
Data modeling languages |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.