source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Richard%20Dansky
|
Richard "Rich" Dansky is a writer and a designer of both computer games and role-playing games.
Early life and education
In the late 1980s and early 1990s Dansky attended Wesleyan University in Middletown, Connecticut.
Personal life
Dansky is an enthusiast of cryptids, and in particular of Sasquatch or Bigfoot. He lives in North Carolina "with an ever-changing number of bottles of single malt scotch and a cat named Goblin". He swears she was named that when he got her.
Career
Richard Dansky worked for four years as a game developer for White Wolf, Inc. where he worked on games such as Wraith: The Oblivion and Vampire: The Dark Ages. He also worked on the Mind's Eye Theatre, Kindred of the East, and Orpheus game lines. He has written, designed, or otherwise contributed to over a hundred role-playing sourcebooks. He is also credited with creating the humorous t-shirt which reads "Don't Tell Me About Your Character", a reference to the habit many role-playing game enthusiasts have of talking at length about their player characters. His writing has also appeared in sources such as the Green Man Review and Lovecraft Studies.
He lives in Durham, North Carolina where he works for Red Storm Entertainment as "Manager of Design" as well as serving as "Central Clancy Writer" for Ubisoft. He has contributed to video games in series including Splinter Cell: Double Agent and Rainbow Six: Black Arrow. He also contributed to Tom Clancy's Ghost Recon, Far Cry, and Blazing Angels, as well as helping to design the setting for the new Might and Magic universe.
Dansky has published four media tie-in novels through White Wolf, including Clan Novel Lasombra and the Trilogy of the Second Age for Exalted. His original fiction includes the novella Shadows In Green (Yard Dog Press, 2013); the novels Firefly Rain (Wizards of the Coast Discoveries, 2008), Vaporware (JournalStone, 2013), and Ghost of a Marriage (Crossroad Press, 2022); and the short story collection Snowbird Gothic (Crossroad Press, 2018). A former executive of the IGDA Game Writing Special Interest Group, he serves on the advisory board on the Game Narrative Summit at GDC. In 2007 he contributed the opening chapter to Game Writing: Narrative Skills for Videogames alongside other members of the IGDA Game Writing SIG.
His namesake, Rich Dansky, appears as a player character in the scenario "And I Feel Fine," by Geoffrey C. Grabowski, which was published in the One Shots sourcebook for Unknown Armies. The fictional version of Dansky is described as "a bohemian academic living the simple life of a trailer park manager." Another role-playing game author, Jenna K. Moran also appears as a player character in the same scenario.
References
External links
Interview with the Deadguy retrieved August 23, 2005.
Interview at FlamesRising
Richard Dansky: Gaming Guest of Honor orycon.org. retrieved August 23, 2005.
Richard Dansky's bio at Red Storm Entertainment. retrieved August 23, 2005
Pen & Paper listing f
|
https://en.wikipedia.org/wiki/NMDS
|
NMDS may refer to:
National Minimum Data Set for Social Care
Non-metric multidimensional scaling
Nursing Minimum Data Set
New Mexican Disaster Squad
|
https://en.wikipedia.org/wiki/Sheffer
|
Sheffer is a surname, and may refer to:
Alla Sheffer, Israeli-Canadian computer scientist
Craig Sheffer (born 1960), American actor
Daniel Sheffer (1783–1880), U.S. congressman
Doron Sheffer (born 1972), Israeli basketball player
Henry M. Sheffer (1882–1964), American logician
Hogan Sheffer (born 1958), American screenwriter
Isador M. Sheffer (1901–1992), American mathematician
Walter Sheffer (1918–2002), American photographer
|
https://en.wikipedia.org/wiki/Domain%20model
|
In software engineering, a domain model is a conceptual model of the domain that incorporates both behavior and data. In ontology engineering, a domain model is a formal representation of a knowledge domain with concepts, roles, datatypes, individuals, and rules, typically grounded in a description logic.
Overview
A domain model is a system of abstractions that describes selected aspects of a sphere of knowledge, influence or activity (a domain). The model can then be used to solve problems related to that domain.
The domain model is a representation of meaningful real-world concepts pertinent to the domain that need to be modeled in software. The concepts include the data involved in the business and rules the business uses in relation to that data. A domain model leverages natural language of the domain.
A domain model generally uses the vocabulary of the domain, thus allowing a representation of the model to be communicated to non-technical stakeholders. It should not refer to any technical implementations such as databases or software components that are being designed.
Usage
A domain model is generally implemented as an object model within a layer that uses a lower-level layer for persistence and "publishes" an API to a higher-level layer to gain access to the data and behavior of the model.
In the Unified Modeling Language (UML), a class diagram is used to represent the domain model.
See also
Domain-driven design (DDD)
Domain layer
Feature-driven development
Logical data model
OntoUML
References
Software requirements
Data modeling
|
https://en.wikipedia.org/wiki/Minification
|
Minification may refer to:
Magnification, by a factor of less than one, producing a smaller image
Minification (programming), a software coding technique
Minimisation (psychology), a form of cognitive distortion
See also
Minimization (disambiguation)
|
https://en.wikipedia.org/wiki/Frozen%20Television
|
Frozen Television was a television production company specializing in documentaries and entertainment programming. Frozen Television was founded by Burt Kearns and Brett Hudson and was affiliated with the motion picture production company, Frozen Pictures.
It closed in 2012. Kearns now runs productions through his Good Story Productions.
Projects
Adults Only: The Secret History of The Other Hollywood for Court TV
The Secret History of Rock 'n' Roll with Gene Simmons for Court TV
All The Presidents' Movies with Martin Sheen for Bravo
My First Time for Showtime
References
Television production companies of the United States
|
https://en.wikipedia.org/wiki/Genealogy%20software
|
Genealogy software is computer software used to record, organize, and publish genealogical data.
Features
At a minimum, genealogy software collects the date and place of an individual's birth, marriage, and death, and stores the relationships of individuals to their parents, spouses, and children. Some programs are more flexible than others in allowing for the input of children born out of wedlock or for varying types of spousal relationships. Additionally, most genealogy programs handle additional events in an individual's life, notes, photographs and multimedia, and source citations. Genealogy software programs can produce a variety of graphical charts and text reports, such as pedigree charts, ahnentafel reports, and Register reports. Some desktop applications generate HTML pages for web publishing; there are stand-alone web applications, as well. Most genealogy programs can import and export using the GEDCOM standard.
There are also some programs that allow users to create Genograms which can be used by scientists, social workers, doctors, and others to get a graphical view of additional information.
Some programs include additional fields relevant to particular religions. Others focus on certain geographical regions. For example, having a field for the family's coat of arms is only relevant if the family comes from a part of the world that uses them.
While most programs and applications are desktop-based, there are a number of web-based products in the genealogy software market.
Many genealogy applications focus on data management in that they allow users to manage all the information they collect on individuals, families, and events. Other tools available to the genealogist include research management tools, mapping tools, charting programs, and web-publishing programs.
Sharing
Most genealogy software allows export of data in GEDCOM format, which can then be shared with people using different genealogy software. Some genealogy applications use GEDCOM internally and therefore work directly with GEDCOM data. Certain programs allow the user to restrict what information is shared, usually by inhibiting export of some or all personal information about living people for privacy reasons.
See also
Comparison of genealogy software
Comparison of web-based genealogy software
List of genealogy databases
References
Smith, Drew. Organize Your Genealogy: Strategies and Solutions for Every Researcher (F+ W Media, Inc., 2016).
External links
Genealogy software reviews
|
https://en.wikipedia.org/wiki/Serial%20number%20arithmetic
|
Many protocols and algorithms require the serialization or enumeration of related entities. For example, a communication protocol must know whether some packet comes "before" or "after" some other packet. The IETF (Internet Engineering Task Force) attempts to define "serial number arithmetic" for the purposes of manipulating and comparing these sequence numbers. In short, when the absolute serial number value decreases by more than half of the maximum value (e.g. 128 in an 8-bit value), it is considered to be "after" the former, whereas other decreases are considered to be "before".
This task is rather more complex than it might first appear, because most algorithms use fixed-size (binary) representations for sequence numbers. It is often important for the algorithm not to "break down" when the numbers become so large that they are incremented one last time and "wrap" around their maximum numeric ranges (go instantly from a large positive number to 0 or a large negative number). Some protocols choose to ignore these issues and simply use very large integers for their counters, in the hope that the program will be replaced (or they will retire) before the problem occurs (see Y2K).
Many communication protocols apply serial number arithmetic to packet sequence numbers in their implementation of a sliding window protocol. Some versions of TCP use protection against wrapped sequence numbers (PAWS). PAWS applies the same serial number arithmetic to packet timestamps, using the timestamp as an extension of the high-order bits of the sequence number.
Operations on sequence numbers
Only addition of a small positive integer to a sequence number and comparison of two sequence numbers are discussed.
Only unsigned binary implementations are discussed, with an arbitrary size in bits noted throughout the RFC (and below) as "SERIAL_BITS".
Addition
Adding an integer to a sequence number is simple unsigned integer addition, followed by unsigned modulo operation to bring the result back into range (usually implicit in the unsigned addition, on most architectures):
s' = (s + n) modulo 2
Addition of a value below 0 or above 2 − 1 is undefined. Basically, adding values beyond this range will cause the resultant sequence number to "wrap", and (often) result in a number that is considered "less than" the original sequence number.
Comparison
A means of comparing two sequence numbers i and i (the unsigned integer representations of sequence numbers s1 and s2) is presented.
Equality is defined as simple numeric equality.
The algorithm presented for comparison is complex, having to take into account whether the first sequence number is close to the "end" of its range of values, and thus a smaller "wrapped" number may actually be considered "greater" than the first sequence number. Thus i is considered less than i only if
(i < i and i − i < 2) or
(i > i and i − i > 2)
Shortfalls
The algorithms presented by the RFC have at least one significant shortcoming
|
https://en.wikipedia.org/wiki/Hit%20List%20%28TV%20series%29
|
The Hit List (aka Hit List or YTV's Hit List) was a music video television program that aired on YTV, a Canadian specialty television network aimed at children. The series first started in 1991, hosted by Tarzan Dan and had 14 seasons in all. The first 6 seasons of The Hit List were hosted by "Tarzan" Dan Freeman, while there were numerous hosts to follow from Aashna Patel, Leslie Bosacki and Exan Auyoung to Rob Fournier and Danielle McGimsie. As of fall 2005, The Hit List went on an indefinite hiatus. On the air, it was claimed it was due to the increase in more mature music videos that they are unable to show, naming I'm a Slave 4 U, Cry Me a River (Justin Timberlake song) and Dirrty as examples. The show was later cancelled.
At The Hit List'''s peak, two compilation CDs were released by YTV and MCA in 1994 and 1996, each featuring pop, R&B, rap, and dance songs aired on the show's countdown. The later Big Fun Party Mix compilation album series, which debuted in 2000 through Universal, can be seen as a spiritual successor to the Hit List'' CDs.
The celebrities include "Weird Al" Yankovic, Backstreet Boys, Christina Aguilera, *NSYNC, Take That, The Smashing Pumpkins, Spice Girls, Five, No Doubt, Britney Spears, Blur, Kim Stockwood, The Moffatts, Hanson, O-Town, Eiffel 65, Aaron Carter, Shawn Desman, Lillix, Simple Plan, Avril Lavigne, Busted, Rachel Stevens, Clay Aiken, Alanis Morissette (back when she was Alanis) and many others.
References
External links
IMDb - YTV's Hit List
The Hit List (ARCHIVED April 1997-February 1998)
The Hit List (ARCHIVED April 1999-August 2002)
The Hit List (ARCHIVED October 2002-August 2005)
1990s Canadian children's television series
2000s Canadian children's television series
1990s Canadian music television series
2000s Canadian music television series
1991 Canadian television series debuts
2005 Canadian television series endings
Canadian children's musical television series
YTV (Canadian TV channel) original programming
Television shows filmed in Toronto
Television series by GRC Productions
Television series by Corus Entertainment
|
https://en.wikipedia.org/wiki/Casino%20Cinema
|
Casino Cinema is a Spike programming block hosted by Steve Schirripa and Beth Ostrosky. The show, which was played around the commercial breaks of a film, featured the hosts (plus a guest player) teaching the audience how to play a casino game.
Partial listing of guests featured on Casino Cinema
Criss Angel
Tobin Bell
Tom Berenger
Jordana Brewster
Christian Cage
Jessica Canseco
David Cross
Corey Feldman
Forrest Griffin
Artie Lange
Method Man
Jim Norton
Grace Park
Vincent Pastore
Natalie Portman
Dennis Rodman
Kurt Russell
M. Night Shyamalan
Kevin Smith
Shawnee Smith
Scott Stapp
Callie Thorne
Partial listing of the films featured on Casino Cinema
Bloodsport
The Cutter
Dr. No
Drop Zone
Fight Club
For Your Eyes Only
Ghost Ship
Hot Shots! Part Deux
Kickboxer
Lethal Weapon
Lethal Weapon 2
Point Break
Red Dawn
Rocky IV
Sin City
Sniper (1993)
Super Troopers
The Texas Chainsaw Massacre (2003)
Today You Die
Top Gun
See also
Dinner and a Movie (similar program on TBS)
References
External links
Casino Cinema on IMDb
Year of television series debut missing
2000s American television series
Spike (TV network) original programming
Television shows about gambling
American motion picture television series
English-language television shows
|
https://en.wikipedia.org/wiki/MacroML
|
MacroML is an experimental programming language based on the ML family, seeking to reconcile ML's static typing and the types of macro systems commonly found in dynamically typed languages like Scheme; this reconciliation is difficult since Turing-complete macro transformations can break type safety guarantees that static typing is supposed to provide.
External links
Some papers related to MacroML include:
"Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML" (citeseer)
Staged Notational Definitions (citeseer)
Experimental programming languages
ML programming language family
Metaprogramming
|
https://en.wikipedia.org/wiki/Negation%20as%20failure
|
Negation as failure (NAF, for short) is a non-monotonic inference rule in logic programming, used to derive (i.e. that is assumed not to hold) from failure to derive . Note that can be different from the statement of the logical negation of , depending on the completeness of the inference algorithm and thus also on the formal logic system.
Negation as failure has been an important feature of logic programming since the earliest days of both Planner and Prolog. In Prolog, it is usually implemented using Prolog's extralogical constructs.
More generally, this kind of negation is known as weak negation, in contrast with the strong (i.e. explicit, provable) negation.
Planner semantics
In Planner, negation as failure could be implemented as follows:
if (not (goal p)), then (assert ¬p)
which says that if an exhaustive search to prove p fails, then assert ¬p. This states that proposition p shall be assumed as "not true" in any subsequent processing. However, Planner not being based on a logical model, a logical interpretation of the preceding remains obscure.
Prolog semantics
In pure Prolog, NAF literals of the form can occur in the body of clauses and can be used to derive other NAF literals. For example, given only the four clauses
NAF derives , and as well as and .
Completion semantics
The semantics of NAF remained an open issue until 1978, when Keith Clark showed that it is correct with respect to the completion of the logic program, where, loosely speaking, "only" and are interpreted as "if and only if", written as "iff" or "".
For example, the completion of the four clauses above is
The NAF inference rule simulates reasoning explicitly with the completion, where both sides of the equivalence are negated and negation on the right-hand side is distributed down to atomic formulae. For example, to show , NAF simulates reasoning with the equivalences
In the non-propositional case, the completion needs to be augmented with equality axioms, to formalize the assumption that individuals with distinct names are distinct. NAF simulates this by failure of unification. For example, given only the two clauses
NAF derives .
The completion of the program is
augmented with unique names axioms and domain closure axioms.
The completion semantics is closely related both to circumscription and to the closed world assumption.
Autoepistemic semantics
The completion semantics justifies interpreting the result of a NAF inference as the classical negation of . However, in 1987, Michael Gelfond showed that it is also possible to interpret literally as " can not be shown", " is not known" or " is not believed", as in autoepistemic logic. The autoepistemic interpretation was developed further by Gelfond and Lifschitz in 1988, and is the basis of answer set programming.
The autoepistemic semantics of a pure Prolog program P with NAF literals is obtained by "expanding" P with a set of ground (variable-free)
|
https://en.wikipedia.org/wiki/Foundation%20Fieldbus
|
Foundation Fieldbus (styled Fieldbus) is an all-digital, serial, two-way communications system that serves as the base-level network in a plant or factory automation environment. It is an open architecture, developed and administered by FieldComm Group.
It is targeted for applications using basic and advanced regulatory control, and for much of the discrete control associated with those functions. Foundation Fieldbus technology is mostly used in process industries, but has recently been implemented in powerplants.
Two related implementations of Foundation Fieldbus have been introduced to meet different needs within the process automation environment. These two implementations use different physical media and communication speeds.
Foundation Fieldbus H1 - Operates at 31.25 kbit/s and is generally used to connect to field devices and host systems. It provides communication and power over standard stranded twisted-pair wiring in both conventional and intrinsic safety applications. H1 is currently the most common implementation.
HSE (High-speed Ethernet) - Operates at 100/1000 Mbit/s and generally connects input/output subsystems, host systems, linking devices and gateways. It doesn't currently provide power over the cable, although work is under way to address this using the IEEE802.3af Power over Ethernet (PoE) standard.
Foundation Fieldbus was originally intended as a replacement for the 4-20 mA standard, and today it coexists alongside other technologies such as Modbus, Profibus, and Industrial Ethernet. Foundation Fieldbus today enjoys a growing installed base in many heavy process applications such as refining, petrochemicals, power generation, and even food and beverage, pharmaceuticals, and nuclear applications. Foundation Fieldbus was developed over a period of many years by the International Society of Automation, or ISA, as SP50. In 1996 the first H1 (31.25 kbit/s) specifications were released. In 1999 the first HSE (High Speed Ethernet) specifications were released. The International Electrotechnical Commission (IEC) standard on field bus, including Foundation Fieldbus, is IEC 61158. Type 1 is Foundation Fieldbus H1, while Type 5 is Foundation Fieldbus HSE.
A typical fieldbus segment consists of the following components.
H1 card - fieldbus interface card (It is common practice to have redundant H1 cards, but ultimately this is application specific)
PS - Bulk power (Vdc) to Fieldbus Power Supply
FPS - Fieldbus Power Supply and Signal Conditioner (Integrated power supplies and conditioners have become the standard nowadays)
T - Terminators (Exactly 2 terminators are used per fieldbus segment. One at the FPS and one at the furthest point of a segment at the device coupler)
LD - Linking Device, alternatively used with HSE networks to terminate 4-8 H1 segments acting as a gateway to an HSE backbone network.
And fieldbus devices, (e.g. transmitters, transducers, etc.)
segment diagram on flickr
An explanation of how Foundation F
|
https://en.wikipedia.org/wiki/Bomb%20Jack
|
Bomb Jack is a platform game published by Tehkan for arcades in and later ported to home systems. The game was a commercial success for arcades and home computers. It was followed by several sequels: the console and computer game Mighty Bomb Jack, the arcade game Bomb Jack Twin, and Bomb Jack II which was licensed for home computers only.
Gameplay
Bomb Jack is a hero who can perform high jumps and float in the air. His goal is to collect all 24 red bombs on the screen. The game's antagonists are enemies such as birds and mummies which, once they drop in the bottom of the screen, can morph into enemies such as flying saucers and orbs that float around the screen, making Jack lose a life if he touches them.
Once one bomb is collected, bombs will light up in sequence; if one lit bomb is collected, another will light up. Collecting bombs will increase the bonus meter at the top of the screen (lit bombs increase it more). When the meter is completely filled up, a circular bouncing "P" appears, and when collected, it will turn all the enemies into bonus coins for a short period during which Jack may collect them. Other similar bonuses are the B (Bonus) which increases the score multiplier (up to 5x), the E (Extra) which gives an extra life, and the rare S (Special), which awards a free game. There are five different screens in the game, each featuring a distinct background and set of platforms (the fifth has no platforms at all). There is a special bonus for collecting 20, 21, 22, or 23 lit bombs at the end of a round.
Ports
1985: SG-1000, PC-88
1986: Amstrad CPC, Commodore 64, ZX Spectrum, Commodore 16
1988: Atari ST, Amiga
1992: Game Boy
1996: PC-98
2003: Java ME
The Commodore 64 version uses Jean-Michel Jarre's Magnetic Fields Part II.
Reception
In Japan, Game Machine listed Bomb Jack on their May 15, 1984 issue as being the third most-successful table arcade unit of the month. The game topped the UK all-formats software sales chart in April 1986. On the machine-specific charts the C64 version reached number 1, while the Spectrum version was kept off the top of the Spectrum charts by Green Beret. Two years later, Bomb Jack returned to the top of the UK all-formats sales chart when it was re-released on the Encore budget label.
Crash magazine gave the ZX Spectrum version a 92% rating with the comment "a great arcade conversion, don't miss it", while Zzap!64 was less enthusiastic for the Commodore 64 version giving it 47%. Commodore User gave the Amiga version 6 out of 10 citing that the Amiga should be well capable of doing better on a then four-year-old arcade game.
Legacy
Sequels
Bomb Jack II is a licensed follow-up developed for 8-bit home computers by the British games publisher Elite Systems in 1986. The game went to number 1 in the UK sales charts, before being replaced by Feud.
Mighty Bomb Jack was released in 1986. The game was largely identical to the original game in almost all factors, except that the same screen layouts
|
https://en.wikipedia.org/wiki/Isotopes%20of%20tennessine
|
Tennessine (117Ts) is the most-recently synthesized synthetic element, and much of the data is hypothetical. As for any synthetic element, a standard atomic weight cannot be given. Like all synthetic elements, it has no stable isotopes. The first (and so far only) isotopes to be synthesized were 293Ts and 294Ts in 2009. The longer-lived isotope is 294Ts with a half-life of 51 ms.
List of isotopes
|-
| 293Ts
| style="text-align:right" | 117
| style="text-align:right" | 176
| 293.20824(89)#
|
| α
| 289Mc
|
|-
| 294Ts
| style="text-align:right" | 117
| style="text-align:right" | 177
| 294.21046(74)#
|
| α
| 290Mc
|
Isotopes and nuclear properties
Nucleosynthesis
Target-projectile combinations leading to Z=117 compound nuclei
The below table contains various combinations of targets and projectiles that could be used to form compound nuclei with atomic number 117.
Hot fusion
249Bk (48Ca, xn)297−xTs (x=3,4)
Between July 2009 and February 2010, the team at the JINR (Flerov Laboratory of Nuclear Reactions) ran a 7-month-long experiment to synthesize tennessine using the reaction above.
The expected cross-section was of the order of 2 pb. The expected evaporation residues, 293Ts and 294Ts, were predicted to decay via relatively long decay chains as far as isotopes of dubnium or lawrencium.
The team published a paper in April 2010 (first results were presented in January 2010) that six atoms of the isotopes 294Ts (one atom) and 293Ts (five atoms) were detected. 294Ts decayed by six alpha decays down as far as the new isotope 270Db, which underwent apparent spontaneous fission. The lighter odd-even isotope underwent just three alpha decays, as far as 281Rg, which underwent spontaneous fission. The reaction was run at two different excitation energies, 35 MeV (dose 2×1019) and 39 MeV (dose 2.4×1019). Initial decay data was published as a preliminary presentation on the JINR website.
A further experiment in May 2010, aimed at studying the chemistry of the granddaughter of tennessine, nihonium, identified a further two atoms of 286Nh from decay of 294Ts. The original experiment was repeated successfully by the same collaboration in 2012 and by a joint German–American team in May 2014, confirming the discovery.
Chronology of isotope discovery
Theoretical calculations
Evaporation residue cross sections
The below table contains various targets-projectile combinations for which calculations have provided estimates for cross section yields from various neutron evaporation channels. The channel with the highest expected yield is given.
DNS = Di-nuclear system; σ = cross section
Decay characteristics
Theoretical calculations in a quantum tunneling model with mass estimates from a macroscopic-microscopic model predict the alpha-decay half-lives of isotopes of tennessine (namely, 289–303Ts) to be around 0.1–40 ms.
References
External sources
Isotope masses from:
Isotopic compositions and standard atomic masses from:
Tennessine
Tennessine
|
https://en.wikipedia.org/wiki/IP%20multicast
|
IP multicast is a method of sending Internet Protocol (IP) datagrams to a group of interested receivers in a single transmission. It is the IP-specific form of multicast and is used for streaming media and other network applications. It uses specially reserved multicast address blocks in IPv4 and IPv6.
Protocols associated with IP multicast include Internet Group Management Protocol, Protocol Independent Multicast and Multicast VLAN Registration. IGMP snooping is used to manage IP multicast traffic on layer-2 networks.
IP multicast is described in . IP multicast was first standardized in 1986. Its specifications have been augmented in to include group management and in to include administratively scoped addresses.
Technical description
IP multicast is a technique for one-to-many and many-to-many real-time communication over an IP infrastructure in a network. It scales to a larger receiver population by requiring neither prior knowledge of a receiver's identity nor prior knowledge of the number of receivers. Multicast uses network infrastructure efficiently by requiring the source to send a packet only once, even if it needs to be delivered to a large number of receivers. The nodes in the network (typically network switches and routers) take care of replicating the packet to reach multiple receivers such that messages are sent over each link of the network only once.
The most common transport layer protocol to use multicast addressing is User Datagram Protocol (UDP). By its nature, UDP is not reliable—messages may be lost or delivered out of order. Reliable multicast protocols such as Pragmatic General Multicast (PGM) have been developed to add loss detection and retransmission on top of IP multicast.
Key concepts in IP multicast include an IP multicast group address, a multicast distribution tree and receiver driven tree creation.
An IP multicast group address is used by sources and the receivers to send and receive multicast messages. Sources use the group address as the IP destination address in their data packets. Receivers use this group address to inform the network that they are interested in receiving packets sent to that group. For example, if some content is associated with group , the source will send data packets destined to . Receivers for that content will inform the network that they are interested in receiving data packets sent to the group . The receiver joins . The protocol typically used by receivers to join a group is called the Internet Group Management Protocol (IGMP).
With routing protocols based on shared trees, once the receivers join a particular IP multicast group, a multicast distribution tree is constructed for that group. The protocol most widely used for this is Protocol Independent Multicast (PIM). It sets up multicast distribution trees such that data packets from senders to a multicast group reach all receivers which have joined the group. There are variations of PIM implementations: Sparse Mode (SM),
|
https://en.wikipedia.org/wiki/Alfresco%20Software
|
Alfresco Software is a collection of information management software products for Microsoft Windows and Unix-like operating systems developed by Alfresco Software Inc. using Java technology. The software, branded as a Digital Business Platform is principally a proprietary & a commercially licensed open source platform, supports open standards, and provides enterprise scale. There are also open source Community Editions available licensed under LGPLv3.
History
John Newton (co-founder of Documentum) and John Powell (a former COO of Business Objects) founded Alfresco Software, Inc. in 2005.
In July 2005, Alfresco released the first version of their software.
Alfresco initially focused on document management, in May 2006, the company announced its intention to expand into web content management by acquiring senior technical and managerial staff from Interwoven; this included its VP of Web Content Management, two principal engineers, and a member of its user-interface team.
In October 2009, the 2009 Open Source CMS Market Share Report described Alfresco as a “leading Java-based open source web content management system”.
In 2010, Alfresco sponsored a new open-source BPM engine called Activiti.
In July 2011, Alfresco and Ephesoft announced a technology collaboration to offer document capture and Content Management Interoperability Services brought together for intelligent PDF capture and search and workflow development.
In January 2013, Alfresco appointed Doug Dennerline, former President of SuccessFactors, former EVP of Sales at Salesforce.com, and former CEO of WebEx, as its new CEO.
In September 2014, Alfresco 5 was released with new reporting and analytics features and an overhaul of its document search tool, moving from Lucene to Solr.
In November 2016, Alfresco launched an AWS Quickstart for building an Alfresco Content Services server cluster on the AWS Cloud.
In March 2017, Alfresco rebranded as the Digital Business Platform. This included the release of the Application Development Framework with reusable Angular JS(2.0) components.
On February 8, 2018, it was announced that Alfresco was acquired by the private equity firm Thomas H. Lee Partners, L.P.
On September 9, 2020, Alfresco was acquired again by Hyland Software from Thomas H. Lee Partners for an undisclosed amount.
Products and Services
Alfresco's core platform offering consists of three primary products. It is designed for clients who require modularity and scalable performance. It can be deployed on-premises on servers or in the cloud using an Amazon Web Services (AWS) Quick Start. A multi-tenant SaaS offering is also available.
Alfresco provides enterprise content management (ECM) services. This includes a content and metadata repository, a web interface named Share, the ability to define automated business rules, and text indexing. In addition, services that provide records management functionality to address information governance requirements are also provided by t
|
https://en.wikipedia.org/wiki/Class%20diagram
|
In software engineering, a class diagram in the Unified Modeling Language (UML) is a type of static structure diagram that describes the structure of a system by showing the system's classes, their attributes, operations (or methods), and the relationships among objects.
The class diagram is the main building block of object-oriented modeling. It is used for general conceptual modeling of the structure of the application, and for detailed modeling, translating the models into programming code. Class diagrams can also be used for data modeling. The classes in a class diagram represent both the main elements, interactions in the application, and the classes to be programmed.
In the diagram, classes are represented with boxes that contain three compartments:
The top compartment contains the name of the class. It is printed in bold and centered, and the first letter is capitalized.
The middle compartment contains the attributes of the class. They are left-aligned and the first letter is lowercase.
The bottom compartment contains the operations the class can execute. They are also left-aligned and the first letter is lowercase.
In the design of a system, a number of classes are identified and grouped together in a class diagram that helps to determine the static relations between them. In detailed modeling, the classes of the conceptual design are often split into subclasses.
In order to further describe the behavior of systems, these class diagrams can be complemented by a state diagram or UML state machine.
Members
UML provides mechanisms to represent class members, such as attributes and methods, and additional information about them like constructors.
Visibility
To specify the visibility of a class member (i.e. any attribute or method), these notations must be placed before the members' name:
A derived property is a property whose value (or values) is produced or computed from other information, for example, by using values of other properties.
A derived property is shown with its name preceded by a forward slash '/'.
Scope
The UML specifies two types of scope for members: instance and class, and the latter is represented by underlined names.
Instance members are scoped to a specific instance.
Attribute values may vary between instances
Method invocation may affect the instance's state (i.e. change instance's attributes)
Class members are commonly recognized as "static" in many programming languages. The scope end is the class itself.
Attribute values are equal for all instances
Method invocation does not affect the classifier's state
To indicate a classifier scope for a member, its name must be underlined. Otherwise, instance scope is assumed by default.
Relationships
A relationship is a general term covering the specific types of logical connections found on class and object diagrams. UML defines the following relationships:
Instance-level relationships
Dependency
A dependency is a type of association where there is a
|
https://en.wikipedia.org/wiki/Computer-aided%20facility%20management
|
Computer-aided facility management (CAFM) is the support of facility management by information technology. The supply of information about the facilities is the center of attention. The tools of the CAFM are called CAFM software, CAFM applications or CAFM systems. CAFM is often interchangeably with CMMS since both categories of software practically fulfill the same purposes.
History
The International Facility Management Association (IFMA) defines facility management as the practice of coordinating the physical workplace with the people and work of the organization. It integrates the principles of business administration, architecture and the behavioral and engineering sciences. As such, facility management has been practiced, whether specifically identified as its own discipline or not, since the inception of the business organization. It has evolved over the years through the development and codification of processes into a clearly defined field of expertise.
See also
1:5:200
Building information modeling (BIM)
Computerized maintenance management system (CMMS)
Integrated workplace management system (IWMS)
Property management system
References
Business software
Information technology management
Property management
|
https://en.wikipedia.org/wiki/John%20Rajchman
|
John Rajchman (born June 25, 1946) is a philosopher working in the areas of art history, architecture, and continental philosophy. Son of Jan A. Rajchman, a Polish-American computer scientist.
John Rajchman is an Adjunct Professor and Director of Modern Art M.A. Programs in the Department of Art History and Archaeology at Columbia University.
He has previously taught at Princeton University, Massachusetts Institute of Technology, Collège International de Philosophie in Paris, and The Cooper Union, among others.
He is a Contributing Editor for Artforum and is on the board of Critical Space.
John Rajchman received a B.A., from Yale University and Ph.D., from Columbia University.
Works
Michel Foucault: The Freedom of Philosophy (1985)
Post-analytic Philosophy (1985) editor with Cornel West
Le Savoir-faire avec l'inconscient : éthique et psychanalyse (1986)
Philosophical Events: Essays of the '80s (1991)
Truth and Eros, Foucault, Lacan and the Question of Ethics (1991)
The Identity in Question (1995) editor
Constructions (Writing Architecture) (1998)
The Deleuze Connections (2000)
Rendre la terre légère (2005)
French Philosophy Since 1945: Problems, Concepts, Inventions (2011) editor with Etienne Balibar
References
Living people
1946 births
20th-century American philosophers
21st-century American philosophers
Columbia University faculty
Yale University alumni
Columbia Graduate School of Arts and Sciences alumni
|
https://en.wikipedia.org/wiki/Stack%20Light%20Rifle
|
The Stack Light Rifle is a light gun that was manufactured by Stack Computer Services for use with the ZX Spectrum, Commodore 64, and VIC-20. It was released in 1983. The rifle is bundled with three games on tape: High Noon, Shooting Gallery, and Grouse Shoot for the Spectrum. Different games were offered for the Commodore 64 and VIC-20 versions (all the games for these two systems were included on one cassette).The Stack Light Rifle is differentiated from future light guns as being realistic looking.
The main pistol is attached to 12 feet of cable which ends in a dead-ended ZX81-size connector which plugs into the Spectrum's user port. A barrel, stock and telescopic sight can all be attached to the pistol. The barrel actually facilitated the gun's performance as it filtered out ambient light. These three parts combined to provide a reasonable – if not perfect – degree of accuracy, and allowed the user to effectively use the light gun from the comfort of an armchair. One can extrapolate that the multi-part design was later mimicked on the Sega Menacer.
Variants of the Light Rifle were available for the ZX Spectrum, VIC-20, and Commodore 64 and all perform the same function. Like the Atari XG-1 light gun, the Stack Light Rifle is treated by the hardware as a light pen. Due to lack of availability of software drivers for the Light Rifle, only the three games that came with the device were available. In April 1985, Sinclair User magazine reported that Stack Computer Services company disappeared.
Technical specifications
The main component of the Stack Light Rifle System is the electronic target pistol that is connected to the computer by a generous length of lead. At the computer end, depending on the version, there is a connector for the appropriate socket or edge connector. On the ZX Spectrum version the connector contains two chips and a couple of simple components to interface the main electronics inside the gun to the computer. To make the pistol more accurate and to turn it into a rifle – it is supplied with a shoulder stock that clips and secures to the rear of the pistol, a barrel and a make-believe telescopic sight.
The electronics inside the pistol consist of a light detector or photo-diode and a small amplifier and buffer. Light coming down the barrel is focused by a small plastic lens onto the photo-diode, and the device is sensitive enough to detect the changes in intensity of the picture. Once boosted by the amplifier, the signal is clipped to provide a digital pulse rather than an analogue waveform and is then fed to the computer via the switch. The screen position that is being scanned at that moment is the position the rifle is pointing at. As the computer receives the pulse from the Light Rifle it compares the value of its scan registers with the screen position of the target and, if a match is found, the played has scored a direct hit.
Supported Games
Commodore 64
Escape From Alcatraz
High Noon
Glorious 12th
Gallery
Crowshoo
|
https://en.wikipedia.org/wiki/Widget%20Workshop
|
Widget Workshop: A Mad Scientist's Laboratory is a hands-on science kit, for use on the computer and off. It was released in 1995 and is one of the more obscure Maxis products. It was designed by Lauren Elliott, co-author of the Where in the World is Carmen SanDiego game series.
The game has two main modes. Much like in The Incredible Machine, users can solve a variety of puzzles using a limited selection of parts or tinker with the freeform mode. Widget Workshop focuses more on the freeform mode than the other game.
Unlike the Rube Goldberg nature of The Incredible Machine, the parts in Widget Workshop are not restricted to the mechanical or physical. Items include display boxes, graphing windows, random number generators, and mathematical tools ranging from addition and subtraction to Boolean logic gates and trigonometric functions. The items can be connected in a manner similar to dataflow programming. While the arrangement of the items on screen does not matter, the connections do: a numerical constant box could be connected to a mathematical function; connected to a graph, which would display a horizontal line; input as a color value on an RGB monitor; or even used to trigger a sound effect.
External links
Widget Workshop at MobyGames
Promotional video (from the Internet Archive)
1995 video games
DOS games
Maxis games
Windows games
Science educational video games
Video games developed in the United States
Visual programming languages
Single-player video games
|
https://en.wikipedia.org/wiki/Punding
|
Punding is compulsive performance of repetitive, mechanical tasks, such as assembling and disassembling, collecting, or sorting objects. It can also apply to digital objects, such as computer files and data. The term was originally coined to describe complex, prolonged, purposeless, and stereotyped behaviour in phenmetrazine and chronic amphetamine users, by Swedish forensic psychiatrist G. Rylander, in 1968. It was later described in Parkinson's disease, but mainly in cases of patients being treated with dopaminergic drugs. It has also been described in methamphetamine and cocaine users, as well as in some patients with gambling addictions, and hypersexuality.
For example, punding may consist of activities such as collecting pebbles and lining them up as perfectly as possible; disassembling and reassembling wristwatches; or conducting extended monologues devoid of context.
People engaging in punding find immersion in such activities comforting, even when it serves no purpose, and generally find it very frustrating to be diverted from them. They are not generally aware that there is a compulsive element, but will continue even when they have good reason to stop. Rylander describes a burglar who started punding and could not stop, even though he was suffering from an increasing apprehension of being caught. Interrupting can lead to various responses, including anger or rage, sometimes to the point of violence.
Causes
Punding has been linked primarily to an overstimulation of the dopamine D1 receptors and, to a lesser extent, of D2 receptors, which has been proposed to lead to substantial changes in the striatum (especially its dorsal and ventral areas) and the nucleus accumbens, some of the main dopaminergic areas of the brain regulating psychomotoric functions and reward mechanisms. On the other hand, it has been noted that patients with Parkinson's disease treated with dopaminergic drugs that selectively activate only D3 receptors are the least likely to develop punding.
Treatment
Treatment is mostly the same as for the dopamine dysregulation syndrome, but will vary depending on the cause: for patients with Parkinson's disease, doses of dopaminergic drugs such as levodopa must be reduced; while people addicted to dopaminergic stimulants like cocaine or amphetamines should be counseled on their issues of addiction and referred to an appropriate drug rehabilitation program.
Medications that have proven effective in the treatment of punding are atypical antipsychotics like quetiapine or clozapine. Amantadine has also reported to be fairly effective, while memantine, an analog of amantadine with a more targeted pharmacological profile has not been evaluated but would presumably have similar efficacy to amantadine. Selective serotonin reuptake inhibitors have been found to be of virtually no use, although in a handful of cases they have led to the resolution of symptoms, especially sertraline but only in high doses (the fact that sertraline a
|
https://en.wikipedia.org/wiki/Wetware%20computer
|
A wetware computer is an organic computer (which can also be known as an artificial organic brain or a neurocomputer) composed of organic material "wetware" such as "living" neurons. Wetware computers composed of neurons are different than conventional computers because they use biological materials, and offer the possibility of substantially more energy-efficient computing. While a wetware computer is still largely conceptual, there has been limited success with construction and prototyping, which has acted as a proof of the concept's realistic application to computing in the future. The most notable prototypes have stemmed from the research completed by biological engineer William Ditto during his time at the Georgia Institute of Technology. His work constructing a simple neurocomputer capable of basic addition from leech neurons in 1999 was a significant discovery for the concept. This research acted as a primary example driving interest in the creation of these artificially constructed, but still organic brains.
Overview
The concept of wetware is an application of specific interest to the field of computer manufacturing. Moore’s law, which states that the number of transistors which can be placed on a silicon chip is doubled roughly every two years, has acted as a goal for the industry for decades, but as the size of computers continues to decrease, the ability to meet this goal has become more difficult, threatening to reach a plateau. Due to the difficulty in reducing the size of computers because of size limitations of transistors and integrated circuits, wetware provides an unconventional alternative. A wetware computer composed of neurons is an ideal concept because, unlike conventional materials which operate in binary (on/off), a neuron can shift between thousands of states, constantly altering its chemical conformation, and redirecting electrical pulses through over 200,000 channels in any of its many synaptic connections. Because of this large difference in the possible settings for any one neuron, compared to the binary limitations of conventional computers, the space limitations are far fewer.
Background
The concept of wetware is distinct and unconventional, and draws slight resonance with both hardware and software from conventional computers. While hardware is understood as the physical architecture of traditional computational devices, built from electrical circuitry and silicone plates, software represents the encoded architecture of storage and instructions. Wetware is a separate concept which utilizes the formation of organic molecules, mostly complex cellular structures (such as neurons), to create a computational device such as a computer. In wetware the ideas of hardware and software are intertwined and interdependent. The molecular and chemical composition of the organic or biological structure would represent not only the physical structure of the wetware but also the software, being continually reprogrammed by the d
|
https://en.wikipedia.org/wiki/Phoenix-RTOS
|
Phoenix-RTOS is a real-time operating system designed for Internet of Things appliances. The main goal of the system is to facilitate the creation of "Software Defined Solutions".
History
Phoenix-RTOS is the successor to the Phoenix operating system, developed from 1999 to 2001 by Pawel Pisarczyk at the Department of Electronics and Information Technology at Warsaw University of Technology. Phoenix was originally implemented for IA-32 microprocessors and was adapted to the ARM7TDMI processor in 2003, and the PowerPC in 2004. The system is available under the GPL license.
Phoenix-RTOS 2.0
The decision to abandon the development of Phoenix and write the Phoenix-RTOS from scratch was taken by its creator in 2004. In 2010, the Phoenix Systems company was established, aiming to commercialize the system.
Phoenix-RTOS 2.0 is based on a monolithic kernel. Initially versions for the IA-32 processor and configurable eSi-RISC were developed. In cooperation with NXP Semiconductors, Phoenix-RTOS 2.0 was also adapted to the Vybrid (ARM Cortex-A5) platform. This version is equipped with PRIME (Phoenix-PRIME) and the G3-PLC (Phoenix-G3) protocol support, used in Smart Grid networks.
Phoenix-RTOS runs applications designed and written for the Unix operating system.
Phoenix-RTOS 3.0
Phoenix-RTOS version 3.0 is based on a microkernel. It is geared towards measuring devices with low power consumption. The main problem with the first implementation was low kernel modularity and difficulties with the management process of software development (device drivers, file system drivers). It is an open source operating system (on BSD license), available on GitHub.
HaaS modules
The Phoenix-RTOS can be equipped with HaaS (Hardware as a Software) modules that allow the implementation of rich devices functionality, e.g. modems. Existing HaaS modules include:
Phoenix-PRIME - software implementation of PRIME PLC standard certified in 2014.
Phoenix-G3 - a software implementation of the G3-PLC standard.
Implementations
In 2016, Energa-Operator (based in Poland) installed 6.6k Data Concentrator Units with balancing meter functionality in its network, based on the Phoenix-RTOS. License agreements to use the system in the mass production of smart meters have been signed.
External links
Phoenix-RTOS vendor
PRIME Alliance
G3-PLC Alliance
References
Embedded operating systems
Real-time operating systems
|
https://en.wikipedia.org/wiki/David%20P.%20Anderson
|
David Pope Anderson (born 1955) is an American research scientist at the Space Sciences Laboratory, at the University of California, Berkeley, and an adjunct professor of computer science at the University of Houston. Anderson leads the SETI@home, BOINC, Bossa, and Bolt software projects.
Education
Anderson received a BA in mathematics from Wesleyan University, and MS and PhD degrees in mathematics and computer science from the University of Wisconsin–Madison. While in graduate school he published four research papers in computer graphics. His PhD research involved using enhanced attribute grammars to specify and implement communication protocols.
Career
From 1985 to 1992 he was an assistant professor in the UC Berkeley Computer Science Department, where he received the NSF Presidential Young Investigator and IBM Faculty Development awards. During this period he conducted several research projects:
FORMULA (Forth Music Language), a parallel programming language and runtime system for computer music based on Forth.
MOOD (Musical Object-Oriented Dialect), a parallel programming language and runtime system for computer music based on C++. A port for MS-DOS also exists.
DASH, a distributed operating system with support for digital audio and video.
Continuous Media File System (CMFS), a file system for digital audio and video
Comet, an I/O server for digital audio and video.
From 1992 to 1994 he worked at Sonic Solutions, where he developed Sonic System, the first distributed system for professional digital audio editing.
Inventions
In 1994 he invented "Virtual Reality Television", a television system allowing viewers to control their virtual position and orientation. He was awarded a patent for this invention in 1996.
In 1994 he developed one of the first systems for collaborative filtering, and developed a web site, rare.com, that provided movie recommendations based on the user's movie ratings.
From 1995 to 1998 he was chief technical officer of Tunes.com, where he developed web-based systems for music discovery based on collaborative filtering, acoustics, and other models.
In 1995 he joined David Gedye and Dan Werthimer in creating SETI@home, an early volunteer computing project. Anderson continues to direct SETI@home.
From 2000 to 2002, he served as CTO of United Devices, a company that developed software for distributed computing.
Berkeley Open Infrastructure for Network Computing
In 2002 he created the Berkeley Open Infrastructure for Network Computing project, which develops an open-source software platform for volunteer computing. The project is funded by NSF and is based at the UC Berkeley Space Sciences Laboratory. BOINC is used by about 100 projects, including SETI@home, Einstein@home, Rosetta@home, Climateprediction.net, and the IBM World Community Grid. It is used as a platform for several distributed applications in areas as diverse as mathematics, medicine, molecular biology, climatology, and astrophysics.
Ande
|
https://en.wikipedia.org/wiki/Interrupt%20request
|
In a computer, an interrupt request (or IRQ) is a hardware signal sent to the processor that temporarily stops a running program and allows a special program, an interrupt handler, to run instead. Hardware interrupts are used to handle events such as receiving data from a modem or network card, key presses, or mouse movements.
Interrupt lines are often identified by an index with the format of IRQ followed by a number. For example, on the Intel 8259 family of programmable interrupt controllers (PICs) there are eight interrupt inputs commonly referred to as IRQ0 through IRQ7. In x86 based computer systems that use two of these PICs, the combined set of lines are referred to as IRQ0 through IRQ15. Technically these lines are named IR0 through IR7, and the lines on the ISA bus to which they were historically attached are named IRQ0 through IRQ15 (although historically as the number of hardware devices increased, the total possible number of interrupts was increased by means of cascading requests, by making one of the IRQ numbers cascade to another set or sets of numbered IRQs, handled by one or more subsequent controllers).
Newer x86 systems integrate an Advanced Programmable Interrupt Controller (APIC) that conforms to the Intel APIC Architecture. These APICs support a programming interface for up to 255 physical hardware IRQ lines per APIC, with a typical system implementing support for only around 24 total hardware lines.
During the early years of personal computing, IRQ management was often of user concern. With the introduction of plug and play devices this has been alleviated through automatic configuration.
Overview
When working with personal computer hardware, installing and removing devices, the system relies on interrupt requests. There are default settings that are configured in the system BIOS and recognized by the operating system. These default settings can be altered by advanced users. Modern plug and play technology has not only reduced the need for concern for these settings, but has also virtually eliminated manual configuration.
x86 IRQs
Early PCs using the Intel 8086/8088 processors only had a single PIC, and are therefore limited to eight interrupts. This was expanded to two PICs with the introduction of the 286 based PCs.
Typically, on systems using the Intel 8259 PIC, 16 IRQs are used. IRQs 0 to 7 are managed by one Intel 8259 PIC, and IRQs 8 to 15 by a second Intel 8259 PIC. The first PIC, the master, is the only one that directly signals the CPU. The second PIC, the slave, instead signals to the master on its IRQ 2 line, and the master passes the signal on to the CPU. There are therefore only 15 interrupt request lines available for hardware.
On APIC with IOAPIC systems, typically there are 24 IRQs available, and the extra 8 IRQs are used to route PCI interrupts, avoiding conflict between dynamically configured PCI interrupts and statically configured ISA interrupts. On early APIC systems with only 16 IRQs or wi
|
https://en.wikipedia.org/wiki/WKOI-TV
|
WKOI-TV (channel 43) is a television station licensed to Richmond, Indiana, United States, broadcasting the Ion Television network to the Dayton, Ohio, area. The station is owned and operated by the Ion Media subsidiary of the E.W. Scripps Company. Transmission facilities are provided by unrelated NBC affiliate WDTN (channel 2), which shares its digital channel with WKOI-TV through a channel sharing agreement, along with WDTN's sister station, Springfield, Ohio–licensed CW affiliate WBDT (channel 26); the transmitter is located on Frytown Road in southwest Dayton. For the purposes of its FCC correspondence, WKOI's official 'studio' facility is located at Scripps Center in downtown Cincinnati (along with many other Ion stations).
History
WKOI-TV signed on May 11, 1982, as an independent station airing religious programming. In 1986, it was purchased by the Trinity Broadcasting Network (TBN). As a TBN O&O, the station cleared almost all of the network's programming, only breaking away from the network once a week for local community public affairs programming.
Until June 7, 2018, WKOI-TV's transmitter was located on SR 73 in Milford Township, Butler County, Ohio, near Collinsville, approximately halfway between Richmond and Cincinnati. It thus served as the TBN station for Northern Kentucky, East Central Indiana and a large swath of southwestern Ohio (Greater Cincinnati and the Miami Valley). Even though its transmitter was based within the Cincinnati television market, its city of license, Richmond, is in the Dayton market. Thus, Nielsen counted the station as part of the Dayton market.
TBN entered into an option agreement with Ion Media on November 14, 2017, which gave Ion the option to acquire the licenses of WKOI-TV and three other TBN stations that had sold their spectrum in the Federal Communications Commission (FCC)'s incentive auction; Ion exercised the option on May 24, 2018. The sale was completed on September 25, 2018.
Technical information
Subchannel
Analog-to-digital conversion
WKOI-TV (along with all other TBN-owned full-power stations) shut down its analog signal, over UHF channel 43, on April 16, 2009. The station's digital signal remained on its pre-transition UHF channel 39. Through the use of PSIP, digital television receivers display the station's virtual channel as its former UHF analog channel 43. The station's digital signal was multiplexed, carrying TBN on 43.1, The Church Channel on 43.2, JCTV on 43.3, Enlace on 43.4 and Smile of a Child on 43.5. Later, The Church Channel became Hillsong Channel, JCTV became JUCE TV and was combined on 43.3 with Smile, and TBN Salsa was added on 43.5.
Spectrum sale and channel sharing agreement
On April 14, 2017, it was reported that WKOI-TV's over-the-air spectrum had been sold in the FCC's spectrum reallocation auction, fetching just over $20 million, with the station expected to go off the air. On March 22, 2018, it was announced that WKOI-TV would share spectrum with unrelated NB
|
https://en.wikipedia.org/wiki/Barton%20Yarborough
|
William Barton Yarborough (October 2, 1900 – December 19, 1951) was an American actor who worked extensively in radio drama, primarily on the NBC Radio Network. He is famous for his roles in the Carlton E. Morse productions I Love a Mystery, in which he played Doc Long, and One Man's Family, spending 19 years portraying Clifford Barbour. In addition, Yarborough spent three years portraying Sgt. Ben Romero on Jack Webb's Dragnet.
Early years
He was born in Goldthwaite, Texas. As a youth, Yarborough ran away from home, attracted by the vaudeville stages, and he first worked in radio during the 1920s. After joining a touring musical comedy show, he progressed from bit parts to leading man as the troupe played in various places in Oklahoma and Texas. He attended college at the University of Nevada, Reno, and the University of Southern California, where in 1925 he became a member of Phi Sigma Kappa fraternity.
One of Yarborough's earliest reported activities in acting was in November 1922, when he was a member of the cast of a Rebekah and Odd Fellows lodges production of The Prince Chap in Reno, Nevada. He was active in dramatic productions at the University of California, including a one-act play on radio station KLX in 1924. His work on stage at UC ranged from drama (The Frogs) to farce (She Stoops to Conquer).
Career
After graduating from the University of California in 1925, Yarborough acted in London, New York, and California, having the leading-man role in Outward Bound. He was a member of the Eva Le Gallienne Civic Repertoire in New York City. Yarborough's NBC radio debut was in 1930, broadcasting from San Francisco.
In 1932, Yarborough began a long run as Clifford Barbour on the radio serial One Man's Family, continuing in the role throughout his life. Yarborough was probably best known for his roles as Doc Long in the West Coast cast of Carlton E. Morse's I Love a Mystery (and the subsequent I Love Adventure) and Sergeant Ben Romero, Joe Friday's original partner, on Dragnet.
Yarborough's other radio work includes the title role in Hawk Larabee, as well as the roles of Brazos John in Hawk Durango, Sleepy Stevens in Hashknife Hartley, Skip Turner in Adventures by Morse, also by Carlton E. Morse, and the title attorney's assistant in Attorney for the Defense.
Yarborough appeared as Doc Long in three feature films for Columbia Pictures, based on the radio series I Love a Mystery: I Love a Mystery in 1945, The Devil's Mask and The Unknown. Yarborough adopted a Southern accent for the Doc Long character, and would retain the dialect for Dragnet. (In private life Yarborough spoke without a trace of an accent, as evidenced in his motion picture appearances of the early 1940s.)
He started work on the Dragnet television series in 1951. However, the day after he filmed the second episode, he suffered a heart attack, and died four days later at age 51. After his death, his One Man's Family character was dropped without explanation while his
|
https://en.wikipedia.org/wiki/Lim%20Yo-hwan
|
Lim Yo-hwan (, born September 4, 1980), known online as SlayerS_'BoxeR' (usually shortened to BoxeR), is a former professional player of the real-time strategy computer game StarCraft. He is often referred to as The Terran Emperor, or simply The Emperor, and is widely considered to be one of the most successful players of the genre as well as a pop culture icon.
Lim won his first StarCraft: Brood War tournament in 1999. From 2001 to 2002, he won multiple major championships, including two OnGameNet Starleague titles and two World Cyber Games gold medals. In 2002, he also created the team Team Orion, which later became SK Telecom T1 (SKT T1) in 2004. He began his compulsory military service in 2006, where he played on South Korea's newly formed Air Force esports team Airforce Challenge E-sports. In late 2010, he retired from StarCraft: Brood War and founded the StarCraft II team SlayerS. He then briefly returned to SKT T1 as a coach in 2012 before retiring due to health related issues. Lim finished his playing career with a record of 603 wins and 430 losses (58.4%).
Following his retirement from esports, Lim became a professional poker player. He won his first Asian Poker Tour (APT) title in September 2018 and his second in January 2019.
Career
Early career (1998–2000)
In 1998, during his third year at Seongbo High School in Seoul, South Korea, Lim developed a passion for the video game StarCraft. Initially playing as the Protoss race, he later switched to the Terran race following a game patch implementation.
After the release of the StarCraft expansion, StarCraft: Brood War, Lim attempted to create a guild called Slayer. However, facing difficulties in establishing it, he adopted the Battle.net ID SlayerS_'BoxeR' instead. As he achieved high rankings on Battle.net, his ID gained widespread recognition. It was during this time, in August 1999, that Kim Yang-joong, the president of management company Sinabro, approached Lim while he was playing at a PC Bang. Kim offered him the opportunity to become a professional gamer. After accepting the offer, Lim had to seek his parents' approval, as pursuing a career in video gaming was an unconventional choice at the time. After considerable effort, Lim convinced his parents, allowing him to sign with Sinabro. In December 1999, Lim secured his first tournament victory at the SBS Multi-Game Championship. Almost a year later, in October 2000, he joined team IS, which later became known as Hwaseung OZ.
The first bonjwa (2001–2003)
The term "Royal Road" is used to describe a player's achievement of winning an OnGameNet Starleague (OSL) title in their rookie season. Despite the perceived weakness of the Terran race, Lim defied expectations and walked the Royal Road in the 2001 Hanbitsoft OSL. He advanced to the semifinals, where he faced and defeated Park "Kingdom" Yong-wook with a score of 2–1. In the grand finals, he went on to defeat Jang "JinNam" Jin-nam with a score of 3–0, becoming only the third p
|
https://en.wikipedia.org/wiki/List%20of%20Microsoft%20Windows%20versions
|
Microsoft Windows is a computer operating system developed by Microsoft. It was first launched in 1985 as a graphical operating system built on MS-DOS. The initial version was followed by several subsequent releases, and by the early 1990s, the Windows line had split into two separate lines of releases: Windows 9x for consumers and Windows NT for businesses and enterprises. In the following years, several further variants of Windows would be released: Windows CE in 1996 for embedded systems; Pocket PC in 2000 (renamed to Windows Mobile in 2003 and Windows Phone in 2010) for personal digital assistants and, later, smartphones; Windows Holographic in 2016 for AR/VR headsets; and several other editions.
Personal computer versions
A "personal computer" version of Windows is considered to be a version that end-users or OEMs can install on personal computers, including desktop computers, laptops, and workstations.
The first five versions of Windows–Windows 1.0, Windows 2.0, Windows 2.1, Windows 3.0, and Windows 3.1–were all based on MS-DOS, and were aimed at both consumers and businesses. However, Windows 3.1 had two separate successors, splitting the Windows line in two: the consumer-focused "Windows 9x" line, consisting of Windows 95, Windows 98, and Windows Me; and the professional Windows NT line, comprising Windows NT 3.1, Windows NT 3.5, Windows NT 3.51, Windows NT 4.0, and Windows 2000. These two lines were reunited into a single line with the NT-based Windows XP; this Windows release succeeded both Windows Me and Windows 2000 and had separate editions for consumer and professional use. Since Windows XP, multiple further versions of Windows have been released, the most recent of which is Windows 11.
Mobile versions
Mobile versions refer to versions of Windows that can run on smartphones or personal digital assistants.
Server versions
High-performance computing (HPC) servers
Windows Essential Business Server
Windows Home Server
Windows MultiPoint Server
Windows MultiPoint Server was an operating system based on Windows Server. It was succeeded by the MultiPoint Services role in Windows Server 2016 and Windows Server version 1709. It was no longer being developed in Windows Server version 1803 and later versions.
Windows Small Business Server
Device versions
ARM-based tablets
In 2012 and 2013, Microsoft released versions of Windows specially designed to run on ARM-based tablets; these versions of Windows, named "Windows RT" and "Windows RT 8.1," were based on Windows 8 and Windows 8.1, respectively. Upon the release of Windows 10 in 2015, the ARM-specific version for large tablets was discontinued; large tablets (such as the Surface Pro 4) were only released with x86 processors and could run the full version of Windows 10. Windows 10 Mobile had the ability to be installed on smaller tablets (up to nine inches); however, very few such tablets were released, and Windows 10 Mobile primarily ended up only running on smartphones until its
|
https://en.wikipedia.org/wiki/Tasair
|
Tasair was an airline based in Hobart and Devonport, Australia. It operated a regional network across Tasmania until it was placed in voluntary liquidation on 3 February 2012.
History
Tasair was established in 1965. It began as an air charter, maintenance, and flying school operation. Scheduled operations commenced on 27 March 1998 on a triangular service from Hobart to Devonport and Burnie, using a Piper PA-31-350 Chieftain and two Aero Commander 500S Shrike Commanders. Four months later operations from Devonport to King Island via Burnie commenced. In May 2010 Burnie was dropped from the structure of regular flights. Tasair's busiest sector was between Devonport and King Island. The company was placed in voluntary liquidation on 3 February 2012.
Legal Issues
In December 2009, Tasair was speculated to be involved in charter flights hired by a PR firm for Japan's 'Institute of Cetacean Research' whaling company to spy on anti-whaling vessels, an action later condemned by the Australian Government and deemed illegal under a 2008 Australian Court order preventing any assistance to whaling operations. Tasair has declined to comment on whether its planes or staff were involved in the flights. Managing director George Ashwood says that kind of information is commercial in confidence. The incident caused the Civil Aviation Safety Authority (CASA) to start a national investigation into companies conducting flights over water. Tasair incurred hefty legal bills dealing with the CASA probe and another by the Environmental Defender's Office that included demands that documents be surrendered. CASA boss John McCormick told the Senate committee Tasair's air operator's certificate covered domestic operations in Australia and it was technically in breach of regulations if it travelled beyond 12 nautical miles but admitted there was confusion within the industry and resulted in no action taken against the air charter operator.
Services
As of September 2011, Tasair operated scheduled passenger flights to the following destinations:
Hobart
Devonport
King Island
Burnie
It also offered bushwalking flights to Melaleuca in the Southwest National Park.
Regular freight services were conducted between Hobart, Devonport, King Island and Burnie. Night freight operations were also conducted from Hobart to Essendon via Devonport, returning to Hobart via Launceston.
Charter flights were also operated to many destinations throughout Tasmania and mainland Australia.
Tasair also operated scenic flights across Tasmania including Maria Island, the Tasman Peninsula, South West Wilderness, Bruny Island and Hobart.
Fleet
As of September 2011 the Tasair fleet consisted of the following:
1 British Aerospace 3107 Jetstream 31
4 Piper PA31-350 Chieftain
1 Aero Commander 500S Shrike Commander
2 Cessna U206 Stationair
4 Cessna 172 Skyhawk
The Chieftains were used on Tasair's scheduled services and for charters. The Cessnas were used to carry bushwalkers to remote locat
|
https://en.wikipedia.org/wiki/List%20of%20schools%20in%20Tanzania
|
The following is a list of notable schools in Tanzania.
Schools
Al Muntazir School Network, Dar es Salaam
Bethany Pre and Primary English Medium School, Kisongo, Arusha Region.
Goba Secondary School, Dar es Salaam
Haven of Peace Academy, Dar es Salaam
International School of Tanganyika, Dar es Salaam
International School of Zanzibar
Isamilo International School Mwanza, Mwanza
Jitegemee, Dar es Salaam
Kennedy House International School, Usa River, Meru District, Arusha Region.
Kibaha Secondary School, Kibaha, Pwani Region
Kings Secondary School, Dar es Salaam
Kishumundu Secondary School, Kilimanjaro Region.
Lady of mercy School, Arusha
Lumumba Secondary School, Zanzibar
Malangali Secondary School, Iringa
Montfort Agricultural Secondary School, Rujewa
Morogoro International School, Morogoro
Musoma Alliance Secondary School, Musoma
Mwananyamala, Dar es Salaam
Mwanza International School, Mwanza
Ngarenaro Secoundary School, Arusha
Popatlal Secondary School, Tanga
Pugu High School, Ilala
Pugu Secondary School, Dar es Salaam
Saint Mary Goreti Secondary School, Moshi
School of St Jude, Arusha, Tanzania
Shaaban Robert Secondary School, Dar es Salaam
Siha Secoundary School, Siha District, Kilimanjaro Region
St. Francis Girls' Secondary School, Mbeya
St. Mary's International Schools, Dar es Salaam, Dodoma, Mbeya, Morogoro
United World College East Africa
Utemini, Singida
Weruweru High School, Hai
Weruweru Secondary School, Kilimanjaro
See also
Education in Tanzania
Lists of schools
References
External links
Complete Tanzania School List
Schools
Schools
Tanzania
Tanzania
Schools
|
https://en.wikipedia.org/wiki/Switchblade%20II
|
Switchblade II is a 1991 side-scrolling action-platform run and gun video game originally developed and published by Gremlin Graphics in Europe for the Amiga home computers. It is the sequel to the original Switchblade, which was solely created by Simon Phipps at Core Design and released earlier in 1989 across multiple platforms. Despite being primarily developed in the UK, its graphics had a distinctly Japanese style similar to anime or manga.
Taking place several centuries after the events of the first game, the story follows a descendant of the original protagonist named Hiro, as he embarks on a journey to defeat Havok, the original main antagonist who has returned from his previous defeat in order to bring chaos upon the land of Cyberworld and its inhabitants after the Blade Knights ceased to exist. Its gameplay consists of run and gun action mixed with platforming and exploration elements, with a main single-button configuration. Originally released for the Amiga microcomputers, Switchblade II was later ported to the Atari ST in May 1991 and the Atari Lynx handheld in 1992, with the latter being published by Atari Corporation in North America and Europe.
Upon its original release on the Amiga, Switchblade II garnered very positive reception from critics who praised multiple aspects of the title such as the visuals, sound effects and gameplay. The Atari ST version also received positive reception from reviewers for its graphics and gameplay, while the Lynx version was met with a more mixed reception. Despite the positive reviews, programmer George Allan was criticized for the lack of enemies and as a result of this, Allan wanted to make a significantly faster title, which would eventually become the popular Zool.
Gameplay
Switchblade II is a side-scrolling action-platform game with run and gun elements similar to the original Switchblade where the player takes control of Hiro through six stages of varying thematic set in the land of Thraxx at Cyberworld infested with mechanoid, metal-clad enemies where the main objective is to fully destroy the returning Havok once and for all. All of the actions in the game are performed differently depending on the version, with one button and a joystick in the home computer versions, while the d-pad and two buttons are used in the Lynx port. The progression structure between levels is also different between each version, with the Amiga and Atari ST versions transitioning seamlessly, while the Lynx port is broken into several sections instead. Spread across the levels are portals that lead into a shop where items and weapons can be bought including a knife, homing missiles, laser beam, flamethrower and shurikens, in addition to ammunition for each of them. These items are bought with orbs left by enemies after destroying them. In some stages, levels are interconnected with a network of subterranean bases, where unexplored areas of the screen are obscured from view until the player's character enters th
|
https://en.wikipedia.org/wiki/Mail-11
|
Mail-11 was the native email transport protocol used by Digital Equipment Corporation's VMS operating system, and supported by several other DEC operating systems such as Ultrix.
It normally used the DECnet networking system as opposed to TCP/IP.
Similar to Internet SMTP based mail, Mail-11 mail had To: Cc: and Subj: headers
and date-stamped each message.
Mail-11 was one of the most widely used email systems of the 1980s, and was still in fairly wide use until as late as the mid-1990s. Messages from Mail-11 systems were frequently gatewayed out to SMTP, Usenet, and Bitnet systems, and thus are sometimes encountered browsing archives of those systems dating from when Mail-11 was in common use.
Several very large DECnet networks with Mail-11 service existed, most notably ENET, which was DEC's worldwide internal network. Another big user was HEPnet, a network for the high-energy physics research community that linked many universities and research labs.
Mail-11 used two colons (::) rather than an at sign (@) to separate user and hostname,
and hostname came first.
Some example headers
To: THEWAL::HARKAWIK
A message to user HARKAWIK on a machine or cluster of machines called THEWAL.
Note that under VMS, usernames were not case-sensitive and were usually shown in uppercase,
but under Ultrix, usernames were case-sensitive, and most sites followed the unix convention of using lower case usernames. Names of machines on a DECnet network were not case-sensitive. Thus, the header above implies that the mail is going to a VMS system, but the one following implies the user is on a Unix system.
To: DS5353::tabak
A message to user tabak on node DS5353. Probably an Ultrix system.
From: GUESS::YERAZUNIS "it's.. it's DIP !" 21-SEP-1989 10:28:38.87
To: DECWRL::"decvax!peregrine!dmi"
CC: YERAZUNIS
This message was sent to the gateway at DEC's Western Research Labs, one of DEC's main Internet gateways. From there, it was expected to travel via uucp, from host decvax to host peregrine to user dmi.
Since the timestamp is present, this must be a copy of a message that has already been sent, but since the From address is still in Mail-11 form, the text above must be copied from the local CC of the message rather than from the version that went through the gateway.
Unlike SMTP mail, mail readers did not support automatic signatures; many users developed the habit of changing their personal name setting to be some interesting or amusing quotation.
To: IN%"president@whitehouse.gov"
The message is to be gatewayed to another network, in this case to the Internet SMTP protocol, and then delivered to the user president at the domain whitehouse.gov
To: HEPNET::TUHEP::SLIWA
The message has to go through two machines. First, it is given to the node HEPNET,
which then passes the machine to the node TUHEP, where it is then delivered to the user SLIWA.
From: "TGV::MCMAHON"@yoyodyne.com
Mail from user MCMAHON on a machine or cluster named TGV,
|
https://en.wikipedia.org/wiki/Narrowcasting
|
Narrowcasting is the dissemination of information to a specialised audience, rather than to the broader public-at-large; it is the opposite of broadcasting. It may refer to advertising or programming, via radio or podcast, newspaper, television, or, increasingly in this digital age, via the Internet. The term "multicast" is sometimes used interchangeably, although strictly speaking this refers to the technology used, and narrowcasting to the business model. Narrowcasting is sometimes aimed at paid subscribers, such as in the case of cable television.
History and terminology
The evolution of narrowcasting came from broadcasting. In the early 20th century, Charles Herrold designate radio transmissions meant for a single receiver, distinguished from broadcasting, meant for a general audience. Merriam-Webster reports the first known use of the word in 1932. Broadcasting was revived in the context of subscription radio programs in the late 1940s, after which the term narrowcasting entered the common lexicon due to computer scientist and public broadcasting advocate J. C. R. Licklider, who in a 1967 report envisioned
The term "multicast" is sometimes used interchangeably, although strictly speaking this refers to the technology used, and narrowcasting to the business model. Narrowcasting is sometimes aimed at paid subscribers, such as in the case of cable television.
In television
In the beginning of the 1990s, when American television was still mainly ruled by three major networks (ABC, CBS and NBC), it was believed that the greatest achievement was to promote and create content that would be directed towards a huge mass of people, avoiding completely those projects that might appeal to only a reduced audience. That was mainly due to the fact that specially in the earlier days of television, there was not much more competition. Nevertheless, this changed once independent stations, more cable channels, and the success of videocassettes started increasing and rising, which gave the audiences the possibility of having more options. Thus, this previous mass-oriented point of view started to change towards one that was, obviously, narrower.
It was the arrival of cable television that allowed a much larger number of producers and programmers to aim at smaller audiences, such as MTV, which started off as the channel for those who loved music.
Narrowcasting has made its place in, for example, the way television networks schedule shows; while one night they might choose to stream shows directed at teenagers, a different night they might want to focus on another specific kind of audience, such as those interested in documentaries. In this way, they target what could be seen as a narrow audience, but collect their attention altogether as a mass audience on one night.
Uses
Advertising
Related to niche marketing or target marketing, narrowcasting involves aiming media messages at specific segments of the public defined by values, preferences, demograph
|
https://en.wikipedia.org/wiki/KPXG-TV
|
KPXG-TV (channel 22) is a television station licensed to Salem, Oregon, United States, broadcasting the Ion Television network to the Portland area. Owned and operated by the Ion Media subsidiary of the E.W. Scripps Company, the station has offices on Southwest Naito Parkway in downtown Portland, and its transmitter is located in the Sylvan-Highlands section of the city.
KPXG-TV was started as independent station KECH in 1981. Never truly successful, it filed for bankruptcy within two years. From 1987 to 1998, it primarily broadcast Home Shopping Network (HSN) programming before being purchased for the launch of Pax, predecessor to Ion.
History
KECH
Channel 22 in Salem was switched from a noncommercial to a commercial assignment in April 1979, when the Federal Communications Commission (FCC) approved a request to reclassify Salem's KVDO-TV (channel 3), a commercial station that had since been bought by state public broadcaster OEPBS, as a noncommercial station in preparation for its eventual move to Bend. A year later, an application for the channel was filed by a company known as Greater Willamette Vision. Its investors were Arnold Brustin and Chris Desmond, both formerly associated with CBS. The FCC granted the application on January 23, 1981; Brustin and Desmond then filed for subscription television (STV) authorization as well. After a $4 million investment, KECH ("KECH 22", said like Catch-22) began on November 21. Even though KECH was just the second independent serving the Portland market, a third planned station in Vancouver, Washington, had already tied up a significant quantity of syndicated programming and movies. KLRK, which signed on as KPDX in 1983, was being purchased in the middle of construction by Camellia City Telecasters of Sacramento, California, which already had experience in programming independent stations; by the time KECH was on the air, it already had spent $10 million on programming rights, leaving lesser shows for channel 22 to broadcast. When Larry Black, who also owned stakes in two Portland cable systems, and KECH filed a petition to deny the completion of the KLRK sale on the grounds that Camellia was involved before the sale's completion in contravention of FCC rules, Camellia countered that Black had attempted to undercut its bid to shareholders of the unbuilt Vancouver outlet and even had proposed that it operate as a repeater of KECH.
The subscription operation, broadcasting in evening hours, did not start at the same time as KECH's ad-supported programming. In January 1982, Willamette STV, a related company to Greater Willamette Vision, entered into a licensing agreement with Oak Communications, owners of the ON TV system, to start the eighth—and last—ON TV system to begin service. By June, it had 12,000 subscribers, making it the smallest ON TV-branded STV operation. Brustin and Desmond deepened their involvement in subscription television by acquiring a multipoint distribution system operation that del
|
https://en.wikipedia.org/wiki/Label%20printer
|
A label printer is a computer printer that prints on self-adhesive label material and/or card-stock (tags). A label printer with built-in keyboard and display for stand-alone use (not connected to a separate computer) is often called a label maker. Label printers are different from ordinary printers because they need to have special feed mechanisms to handle rolled stock, or tear sheet (fanfold) stock. Common connectivity for label printers include RS-232 serial, Universal Serial Bus (USB), parallel, Ethernet and various kinds of wireless. Label printers have a wide variety of applications, including supply chain management, retail price marking, packaging labels, blood and laboratory specimen marking, and fixed assets management.
Mechanisms
Label printers use a wide range of label materials, including paper and synthetic polymer ("plastic") materials. Several types of print mechanisms are also used, including laser and impact, but thermal printer mechanisms are perhaps the most common.
There are two common types of thermal printer.
Direct thermal printers use heat sensitive paper (similar to thermal fax paper). Direct thermal labels tend to fade over time (typically 6 to 12 months); if exposed to heat, direct sunlight or chemical vapors, the life is shortened. Therefore, direct thermal labels are primarily used for short duration applications, such as shipping labels.
thermal transfer printers use heat to transfer ink from ribbon onto the label for a permanent print. Some thermal transfer printers are also capable of direct thermal printing. Using a PVC vinyl can increase the longevity of the label life as seen in pipe markers and industrial safety labels found in much of the market place today.
There are three grades of ribbon for use with thermal transfer printers. Wax is the most popular with some smudge resistance, and is suitable for matte and semi-gloss paper labels. Wax/resin is smudge resistant, suitable for semi-gloss paper and some synthetic labels. Resin alone is scratch and chemical resistant, suitable for coated synthetic labels.
When printing on continuous label stock, there is a tendency for the print location to shift slightly from label to label. To ensure registration of the print area with the target media, many label printers use a sensor that detects a gap, notch, line or perforation between labels. This allows the printer to adjust the intake of label stock so that the print aligns correctly with the media.
Types
Label printer capabilities vary between home, corporate and industrial-oriented models.
Desktop label printers These are usually designed for light to medium-duty use with a roll of stock up to wide. They are quiet and inexpensive. Commercial label printers can typically hold a larger roll of stock up to wide and are geared for medium-volume printing.
Industrial label printers These are designed for heavy-duty, continuous operation in warehouses, distribution centers and factories. Additio
|
https://en.wikipedia.org/wiki/Pull%20up
|
Pull up may refer to:
Pull-up (exercise), an upper body exercise
Pull-up resistor, a technique in digital electronics
Pull up, a code refactoring technique used in object-oriented programming
Pull up, the process of changing a film from one frame rate to another - see telecine
Training pants, a form of diaper that is in one solid piece, in the same form as underwear, lacking taped sides
Pull-up jumper, a basketball move in which a player dribble drives, stops and shoots a jump shot
Pull up, to stop or slow a racehorse during or after a race or workout
"PULL UP", an audible warning given by the ground proximity warning systems of many fixed-wing aircraft
Music
"Pull Up" (KSI song), 2019
"Pull Up" (Wiz Khalifa song), 2016
"Pull Up", a song by Chris Brown from Heartbreak on a Full Moon, 2017
"Pull Up", a song by KSI from New Age, 2019
"Pull Up", a song by Lil Wayne from Free Weezy Album, 2015
"Pull Up", a song by Martin Jensen, 2018
"Pull Up", a song by Mr. Vegas, 2004
"Pull Up", a song by Rich Gang featuring Ralo Stylz, Jacquees and Birdman from Diary of the Streets 2, 2016
"Pull Up", a song by Toosii from Naujour, 2023
"Pull Up (WYA)", a song by DreamDoll, 2018
See also
Pulldown (disambiguation)
|
https://en.wikipedia.org/wiki/Cisco%20Heat
|
is a 1990 racing video game developed and published in arcades by Jaleco. Players control a police squad car racing against computer-controlled vehicles. The goal is to finish each race in first place. Players can take different routes to bypass certain portions of the course. Three cabinet types were created, a standard upright, a sit-down, and a motion-based "deluxe" machine; both of these could be connected, or "linked", together to enable multiplayer.
Cisco Heat was designed by many former employees of Sega, who had left the company to form BitBox, which developed Jaleco Rally: Big Run. After Jaleco absorbed the company, the team began work on a spiritual successor to Big Run, which became Cisco Heat. The game was ported to the Atari ST, Commodore 64, Amiga, ZX Spectrum, Amstrad CPC, and MS-DOS, all of which were published in Europe by Image Works. The arcade version of Cisco Heat was praised for its gameplay, presentation and controls, with one reviewer finding it to be a drastic improvement over Jaleco's previous arcade games. Home computer ports were met with a more negative reception for their poor quality.
Gameplay
In Cisco Heat, players control a police squad car through San Francisco in an attempt to win the "National Championship Police Car Steeplechase" in first place. Gameplay is similar to Out Run and Chase H.Q., where players must race against computer-controlled vehicles to the end of each section, taking place in a different area of San Francisco. Sections contain famous landmarks from the city, namely the Golden Gate Bridge, Alcatraz and tram cars, as well as several features such as steep dives, 90-degree turns and multiple selectable routes, which can allow players to bypass certain portions of the race and shortcut to another area. Players can select from two different police cars, both being based on the Cadillac Brougham and Nissan 300ZX Z32 respectively. Up to four Cisco Heat cabinets can be connected, or "linked", together to enable multiplayer play.
Development
Cisco Heat was developed and published by Jaleco, originally released in October 1990 in Japan. It was released in North America and Europe in November 1990. Most of the development staff who worked on the game were former members of Sega, who left the company to form the short-lived developer Bit Box, which created Jaleco Rally: Big Run (1989). After Jaleco absorbed the company in 1990, the development team became part of Jaleco and worked on a successor to Big Run, which later became Cisco Heat. For this reason, Cisco Heat bears several similarities to Big Run, and was even marketed as a conversion kit for older Big Run arcade units. In January 1991, Cisco Heat was exhibited at the Amusement Trades Exhibition International expo in the United Kingdom.
Three different cabinet types were produced for the game: standard upright, sit-down, and a "deluxe" unit with minor motion capabilities.
The soundtrack was composed by Yasuhiko Takashiba.
Ports
Home compute
|
https://en.wikipedia.org/wiki/Data%20element%20name
|
A data element name is a name given to a data element in, for example, a data dictionary or metadata registry. In a formal data dictionary, there is often a requirement that no two data elements may have the same name, to allow the data element name to become an identifier, though some data dictionaries may provide ways to qualify the name in some way, for example by the application system or other context in which it occurs.
In a database driven data dictionary, the fully qualified data element name may become the primary key, or an alternate key, of a Data Elements table of the data dictionary.
The data element name typically conforms to ISO/IEC 11179 metadata registry naming conventions and has at least three parts:
Object, Property and Representation term.
Many standards require the use of Upper camel case to differentiate the components of a data element name. This is the standard used by ebXML, GJXDM and NIEM.
Example of ISO/IEC 11179 name in XML
Users frequently encounter ISO/IEC 11179 when they are exposed to XML Data Element names that have a multi-part Camel Case format:
Object [Qualifier] Property RepresentationTerm
The specification also includes normative documentation in appendices.
For example, the XML element for a person's given (first) name would be expressed as:
John
Where Person is the Object=Person, Property=Given and Representation term="Name". In this case the optional qualifier is not used, in spite of being implicit in the data element name. This requires knowledge based on data element name, rather than use of structured data.
See also
Data dictionary
Data element
Data element definition
ISO/IEC 11179
Representation term
Semantic spectrum
ISO/IEC 11179
Metadata
Metadata registry
|
https://en.wikipedia.org/wiki/Moon%20Tycoon
|
Moon Tycoon is a city-building computer game released in 2001 by Anarchy Enterprises and Unique Entertainment. It is based on the creation of a lunar colony, or rather a lunar city. Anarchy Enterprises described it as the "first 3-D Sim game ever", and noted that it has similarities to SimCity (which at the time was 2-dimensional).
Gameplay
Moon Tycoon has three campaigns to play through, each with its own story-line and placed around the year 2021.
Campaign 1: Earth is in a global energy crisis, and the only thing that can stop it is a precious resource called helium-3 that can be found on the Moon in vast quantities.
Campaign 2: The energy crisis is over, but competition begins to heat up as corporations battle for lunar domination as space borne epidemics, discontent over living conditions and space disasters become more frequent.
Campaign 3: Mankind makes yet another leap as it begins the next stage of space exploration: the colonization of the asteroid belt.
Each campaign has ten levels to play through each with varied levels of difficulty. All three campaigns make up a larger story, so they can only be played in order and starting with the first. There is also a sandbox mode available, where the player can set the starting money, terrain type, ore quantity and average building life; it also lets the player select whether they want to play on the Moon or on an asteroid.
The game is played on the Play Area, on which both completed and under-construction structures are displayed. Players also use this screen to begin construction of buildings and alter the terrain. The play area is raised up from the surrounding view and can also have a grid.
The building menu display the various types of structures available for construction. These buildings are divided into different categories: Housing and Medical, Tourism, Research, Rewards (earned by different objectives), Utilities, and Industry.
Reception
Moon Tycoon was compared to SimCity, but praised for its innovative 3D graphics. Although Moon Tycoon was well received by US based game review website, GameZone, overseas it was not well reviewed scoring poorly by two foreign reviewers
Deep Sea Tycoon
The spiritual sequel, Deep Sea Tycoon, often confused with Atlantis Underwater Tycoon and titled Aquatic Tycoon in France, is a 2003 video game developed by Anarchy Enterprises and published by Unique Entertainment. This game involves you building an underwater city in 3D. It has a sequel, Deep Sea Tycoon 2, developed by Pixel after Pixel.
Gameplay
The gameplay of Deep Sea Tycoon involves choosing one of 24 different characters and creating an underwater city filled with different buildings and features, from Mermaid Palaces to Seafood Restaurants. Through the character they choose and the choices they make in their city, the player can become a ruthless business magnate or an environmentalist.
The gameplay is similar to Moon Tycoon. The player creates buildings on a flat piece of land, t
|
https://en.wikipedia.org/wiki/Moniac
|
MONIAC or Moniac may refer to:
MONIAC, a hydraulic economics computer
Moniac, Georgia, an unincorporated community
David Moniac (1802–1836), an American military officer
a fan of softball player Monica Abbott
See also
Moniak (disambiguation)
Moniack (disambiguation)
Monyak Hill, Antarctica
Monjack
|
https://en.wikipedia.org/wiki/IPFC
|
IPFC stands for Internet Protocol over Fibre Channel. It governs a set of standards created in January 2006 for address resolution (ARP) and transmitting IPv4 and IPv6 network packets over a Fibre Channel (FC) network. IPFC makes up part of the FC-4 protocol-mapping layer of a Fibre Channel system.
In IPFC, each IP datagram packet is wrapped into a FC frame, with its own header, and transmitted as a sequence of one or more frames. The receiver at the other end receives the frames, strips the FC headers and reassembles the IP packet. IP datagrams of up to 65,280 bytes in size may be accommodated. ARP packet transmission works in the same fashion. Each IP datagram exchange is unidirectional, although IP and TCP allow for bidirectional communication within their protocols.
IPFC is an application protocol that is typically implemented as a device driver in an operating system. IP over FC plays a less important role in storage area networking than SCSI over Fibre Channel or IP over Ethernet. IPFC has been used, for example, to provide clock synchronization via the Network Time Protocol (NTP).
See also
iFCP - Internet Fibre Channel Protocol
Fibre Channel over IP
References
External links
RFC 4338 - Transmission of IPv6, IPv4, and Address Resolution Protocol (ARP) Packets over Fibre Channel
RFC 5494 - An update of RFC 4338 specifying IANA guidelines for ARP
RFC 2625, RFC 3831 were older versions of IPFC obsoleted by RFC 4338
Internet protocols
Fibre Channel
|
https://en.wikipedia.org/wiki/Operation%3A%20Inner%20Space
|
Operation: Inner Space is an action game developed in 1992 and published in 1994 by Software Dynamics for Windows. The player's mission is to enter the computer (represented by "Inner Space") in a spaceship and recover the icons and resources that have been set loose by an invasion, and ultimately to destroy the "Inner Demon". The player interacts with other spacecraft along the way, and can compete in races for icons.
Software Dynamics' goals in creating the game were to have players interact with opponents rather than kill them and for players to have personalized worlds. The intention was to be funny, and the game features ships based on animals and military aircraft. The development focus was on gameplay, and the team tried to make the game run like a DOS game. The game includes a "Ship Factory", which allows the player to make and customize ships. Three add-ons were released that added ships and increased the Ship Factory's functionality. The game received highly positive reviews, with reviewers praising its artificial intelligence, replayability, and originality. The game is available for purchase on Software Dynamics's website, where the shareware version is available for download. A sequel, named Operation: Inner Space 2: Lightning was planned, but cancelled.
Plot
The Inner Demon and its viruses have invaded the player's computer and infected its icons. Then the Inner Demon set up a lair in a black hole which changes position. Guarding this lair are four dragons each holding one of the Inner Demon's powers. Using a spaceship, the player goes into the computer's "Inner Space" to collect the uninfected icons and stop the Inner Demon. Along the way, the player will improve their ship and maintain relationships with the population of Inner Space.
Gameplay
Each ship belongs to one of eight teams: the Avengers, Pirates, Predators, Enforcers, Renegades, Fuzzy Ones, Knights, and the Speed Demons. Each team has personality and behaviours; for example, the Knights tend to be helpful to their allies, whereas the Pirates enjoy looting other ships. The player can play as any ship from any team, except the Enforcers, who only police the levels as bots. Each team has pre-set relations with the other teams, which are not fixed and can easily change. Certain ships have special attributes, such as a cloak or shield.
Once the player has chosen a disk drive to "disinfect" and a ship (and therefore a team) to pilot, a directory to enter must be chosen. Once a directory has been chosen, the player is debriefed on the "wave", which includes which icons are present, which other ships are entering, and what hazards are present. Hazards include viruses, which infect icons, and turrets, which fire lasers or a specific type of weapon when a ship comes into close proximity. Upon entering a wave, the player's primary task is to collect each icon present. Icons are the game's currency used to purchase weapons and upgrades. Icons can be damaged (reducing their va
|
https://en.wikipedia.org/wiki/XUI
|
XUI may refer to:
X User Interface, a VMS Graphical user interface by DEC
XOS (operating system), formerly XUI
Xui (crater), on Mars
XUI, Standard Carrier Alpha Code for Xpress United Inc.
See also
Xiu, a Chinese e-commerce company
Xiu Xiu (disambiguation)
|
https://en.wikipedia.org/wiki/Jungle%20Run
|
Jungle Run is a British children's television adventure series that aired on CITV as part of the ITV network from 10 September 1999 to 29 November 2006. It was a game show similar to shows such as Fort Boyard and The Crystal Maze. The show has had three presenters, referred to as the "Jungle Guide": Dominic Wood from 1999 to 2000, Chris Jarvis from 2001 to 2002 and Michael Underwood from 2003 to 2006. It was recorded at the disused air base, RAF Newton, near Nottingham.
Format
A team of children come upon a mythical jungle ruled by the Jungle King, where the goal is to win treasure from the Temple of the Jungle King. On their way they compete in 5 challenges (3 or 4 in celebrity editions) to win time inside the temple to better their chance of winning the top prize. In the first 2 series, bananas win them time in the final challenge. However, from series 3 onward, these are replaced with silver monkey statues, each one giving them 10 seconds in the final challenge. There was also one golden banana worth 50 bananas, later replaced with a Ruby monkey worth 20 seconds, in each episode, with the total amount of possible time standing at 3:20.
Gameplay
Challenges took place in a variety of locations. Some were swamps or waterfalls; others were obstacle courses or mazes, and some were just places out in the open. The same location could be used for multiple challenges, but each task could only be played in one place.
Usually, 100 bananas or four to five statues were available in each of the challenges. Occasionally, members of the team could be trapped by running out of time in an obstacle course or failing to complete a game involving cages; the rest of the team would then decide if they wanted to forfeit 50 bananas/one (later two) statues to release them, or leave without them and lose no time. If multiple team members are trapped in the same game, one team member can be released for free while each additional team member must be bought out to be released. In some games, Sid and Elvis (a pair of monkeys loyal to the jungle king) would try to distract contestants by throwing coconuts or other objects in their direction.
Games took approximately two to three minutes each, and included challenges such as:
Capturing statues while going down a zipwire.
Discovering bananas/statues in a maze or obstacle course; usually one member of the team would complete the course while others would provide assistance by using tools on the other side of the wall, or provision of guidance from above.
Collecting bananas/statues hanging above a swamp, using lilypads or a bridge.
Climbing up a wall and collecting bananas/statues hidden in ridges.
Diving underwater to get statues hidden in treasure chests.
Filling shrines with water, so statues would float within reach.
Using bamboo poles to hook baskets containing statues.
Finding and using a series of keys to unlock cages where contestants were imprisoned. (Statues were released by using the same keys in a machine.)
Rem
|
https://en.wikipedia.org/wiki/PL/Perl
|
PL/Perl (Procedural Language/Perl) is a procedural language supported by the PostgreSQL RDBMS.
PL/Perl, as an imperative programming language, allows more control than the relational algebra of SQL.
Programs created in the PL/Perl language are called functions and can use most of the features that the Perl programming language provides, including common flow control structures and syntax that has incorporated regular expressions directly.
These functions can be evaluated as part of a SQL statement, or in response to a trigger or rule.
The design goals of PL/Perl were to create a loadable procedural language that:
can be used to create functions and trigger procedures,
adds control structures to the SQL language,
can perform complex computations,
can be defined to be either trusted or untrusted by the server,
is easy to use.
PL/Perl is one of many "PL" languages available for PostgreSQL
PL/pgSQL
PL/Java,
plPHP,
PL/Python,
PL/R,
PL/Ruby,
PL/sh,
and PL/Tcl.
References
PostgreSQL PL/Perl documentation
Data management
PostgreSQL
Data-centric programming languages
|
https://en.wikipedia.org/wiki/WKWO
|
WKWO (90.9 FM) is a radio station licensed to serve Wooster, Ohio. Owned by the Educational Media Foundation (EMF), it broadcasts EMF's Contemporary Christian programming service, K-Love.
The station operated from 1968 to 2019 as WCWS, the campus radio station of The College of Wooster, before the college transitioned it to online-only operation in April 2019. Sold to EMF the following year, WCWS was relaunched as WKWO, carrying K-Love for the Mid-Ohio region.
History
WCWS-FM at The College of Wooster
The College of Wooster's first venture into radio was the short-lived station WABW, which broadcast for one year in 1926. A carrier current outlet, "WCW", went on the air in 1950, and in 1956, the school struck a deal with commercial station WWST-FM in which the college received two hours of airtime a day.
The WWST-FM agreement ended in November 1966 as FM radio became a more profitable venture, prompting the college to apply for its own station. On September 12, 1967, the college filed for a construction permit of its own, which was granted on December 5. WCWS received its license on May 24, 1968, and it began regular operations that fall. The station broadcast the New York Metropolitan Opera and also was supplied with United Press International wire service.
In the mid-1980s, the station increased its effective radiated power to 890 watts and went stereo. In 1987, WCWS-FM changed frequencies to 90.9 MHz in order to reduce co-channel interference to WKCO at Kenyon College. However, an attempt to increase the station's power further caused unanticipated problems for the college physics department, requiring the transmitter to be moved off campus and to Back Orville Road in 1992.
In 2004, RB Schools, a Texas Christian radio group, challenged the licenses of WCWS-FM and 12 other radio stations during the FCC license renewal process in an attempt to enforce non-consensual time-sharing of the channel. Due to the efforts of the College of Wooster administration, Herman Gibbs, John Finn, and the student management, the FCC denied the challenge in May 2005. As a result, WCWS-FM was revamped as "WOO 91, Wooster's Sound Alternative", with a new image and improved sound; it also began broadcasting 24 hours a day.
In the fall of 2013, WCWS-FM moved out of Wishart Hall to Lowry Center, Wooster’s student center, increasing the visibility of the station on the college's campus.
Transition to online and sale to EMF
In August 2018, The College of Wooster announced that WOO 91 would become an online-only station, citing the burden of maintaining the facility and increased FCC reporting requirements; the school's dean of students said that the maintenance of the FM station was "no longer sustainable". WCWS-FM went silent on April 8, 2019.
On December 30, 2019, the College of Wooster filed to sell the WCWS-FM license to Educational Media Foundation for $170,000. As a condition of the asset purchase agreement, the transmitter will be relocated to a new site. T
|
https://en.wikipedia.org/wiki/Split%20screen
|
Split screen may refer to:
Split screen (computing), dividing graphics into adjacent parts
Split screen (video production), the visible division of the screen
Split Screen (TV series), 1997–2001
Split-Screen Level, a bug in the video game Pac-Man at Level 256
Split screen, a focusing screen in a system camera
Splitscreen, or Volkswagen Type 2, a light commercial vehicle 1950–1967
See also
Multi-screen (disambiguation)
Dual Screen (disambiguation)
bg:Split screen
de:Split Screen
fr:Split screen
|
https://en.wikipedia.org/wiki/Filter%20%28software%29
|
A filter is a computer program or subroutine to process a stream, producing another stream. While a single filter can be used individually, they are frequently strung together to form a pipeline.
Some operating systems such as Unix are rich with filter programs. Windows 7 and later are also rich with filters, as they include Windows PowerShell. In comparison, however, few filters are built into cmd.exe (the original command-line interface of Windows), most of which have significant enhancements relative to the similar filter commands that were available in MS-DOS. OS X includes filters from its underlying Unix base but also has Automator, which allows filters (known as "Actions") to be strung together to form a pipeline.
Unix
In Unix and Unix-like operating systems, a filter is a program that gets most of its data from its standard input (the main input stream) and writes its main results to its standard output (the main output stream). Auxiliary input may come from command line flags or configuration files, while auxiliary output may go to standard error. The command syntax for getting data from a device or file other than standard input is the input operator (<). Similarly, to send data to a device or file other than standard output is the output operator (>). To append data lines to an existing output file, one can use the append operator (>>). Filters may be strung together into a pipeline with the pipe operator ("|"). This operator signifies that the main output of the command to the left is passed as main input to the command on the right.
The Unix philosophy encourages combining small, discrete tools to accomplish larger tasks. The classic filter in Unix is Ken Thompson's , which Doug McIlroy cites as what "ingrained the tools outlook irrevocably" in the operating system, with later tools imitating it. at its simplest prints any lines containing a character string to its output. The following is an example:
cut -d : -f 1 /etc/passwd | grep foo
This finds all registered users that have "foo" as part of their username by using the cut command to take the first field (username) of each line of the Unix system password file and passing them all as input to grep, which searches its input for lines containing the character string "foo" and prints them on its output.
Common Unix filter programs are: cat, cut, grep, head, sort, tail, and uniq.
Programs like awk and sed can be used to build quite complex filters because they are fully programmable. Unix filters can also be used by Data scientists to get a quick overview about a file based dataset.
List of Unix filter programs
awk
cat
comm
compress
cut
expand
fold
grep
head
nl
paste
perl
pr
sed
sh
sort
split
strings
tac
tail
tee
tr
uniq
wc
zcat
DOS
Two standard filters from the early days of DOS-based computers are find and sort.
Examples:
find "keyword" < inputfilename > outputfilename
sort "keyword" < inputfilename > outputfilename
find /v "keyword" < inputfilename | sort > outputfile
|
https://en.wikipedia.org/wiki/Crystal%20Kingdom%20Dizzy
|
Crystal Kingdom Dizzy is an adventure video game featuring the character Dizzy released in December 1992 by Codemasters. The Oliver Twins—who were heavily involved in the design and programming of previous Dizzy games—had less involvement with this one.
The game was the last title in the core Dizzy series until the release of Wonderful Dizzy in 2020.
At £9.99, this was the first full-price Dizzy game released for home computers; previous games had been released at budget prices (£2-3). This elicited some criticism, as despite the much higher tag, the game was no bigger or more complex than its much lower-priced predecessors.
The Spectrum version of the game knocked Rainbow Islands from the top of the UK sales chart, and prevented Street Fighter II from being number one. This version was voted number 70 in the Your Sinclair Readers Top 100 Games of All Time.
The Commodore 64 and Amstrad CPC versions were the only core games in the series to be entirely coded for those platforms as opposed to porting over the graphic designs from the Spectrum versions as previously.
References
External links
Crystal Kingdom Dizzy at Amiga Hall of Light
Crystal Kingdom Dizzy at Atari Mania
1992 video games
Amiga games
Amstrad CPC games
Atari ST games
Amiga CD32 games
Codemasters games
Commodore 64 games
Dizzy (series)
Europe-exclusive video games
ZX Spectrum games
Video games developed in the United Kingdom
|
https://en.wikipedia.org/wiki/Timothy%20M.%20Chan
|
Timothy Moon-Yew Chan is a Founder Professor in the Department of Computer Science at the University of Illinois at Urbana–Champaign. He was formerly Professor and University Research Chair
in the David R. Cheriton School of Computer Science, University of Waterloo, Canada.
He graduated with BA (summa cum laude) from Rice University in 1992, and completed his Ph.D. in Computer Science at UBC in 1995 at the age of 19. His late mother, Miu Yung Chan, was a molecular physicist with a Ph.D. from Ohio State University.
He is currently an associate editor for SIAM Journal on Computing
and the International Journal of Computational Geometry and Applications. He is also a member of the editorial board of Algorithmica,
Discrete & Computational Geometry,
and Computational Geometry: Theory and Applications.
Chan has published extensively. His research covers data structures, algorithms, and computational geometry.
Recognition
He was awarded the Governor General's Gold Medal (as Head of Graduating Class in the Faculty of Graduate Studies at the University of British Columbia during convocation), the NSERC doctoral prize, and the Premier's Research Excellence Award (PREA) of Ontario, Canada.
He was elected as an ACM Fellow in 2019 "for contributions to computational geometry, algorithms, and data structures".
See also
Chan's algorithm, an output-sensitive algorithm for planar convex hulls
References
External links
Chan's web site at University of Illinois at Urbana-Champaign
Living people
University of Illinois Urbana-Champaign faculty
Academic staff of the University of Waterloo
Researchers in geometric algorithms
Rice University alumni
University of British Columbia alumni
1976 births
Fellows of the Association for Computing Machinery
|
https://en.wikipedia.org/wiki/Wumpa%27s%20World
|
Wumpa's World (; ) is a Canadian/Chinese television series for children which first aired on many networks including Treehouse TV, The Knowledge Channel, APTN, TFO, Télé-Québec, CCTV, TVB and TDM with 26 15-minute episodes from August 2001 to May 2002. The pilot episode aired in late 2000. Today, the show's episodes are only seen in reruns late during the night and earlier during the day. The characters are puppets.
Characters
Wumpa (; Lorne Cardinal) is a brown walrus who is a narrator that tells real-life stories which take place in the Arctic Circle. At the end of each show, Wumpa sings his very own "goodbye song" by playing a bass guitar that looks like a snowshoe. Most of the show's episodes end with Wumpa's goodbye song's most famous line, which is "Well, bye-bye, and don't forget, always keep your tusks shiny and your blubber clean". He only occasionally appears in the story itself.
Zig () and Zag () are two young snowmobiles. Zig is yellow and pink, while Zag is blue and orange. A bicycle bell is mounted on Zig's handlebars and a horn is mounted on Zag's.
Tiguak (; Tim Gosley) is a polar bear who lives in an igloo and mostly eats fish. He has a bed and a toy bear he calls "Mr. Snoozers".
Seeka (; Jani Lauzon) and Tuk (; Julie Burroughs) are snow hares who live in a den with two entrances – one for each of them.
References
External links
Wumpa's World website
2001 Canadian television series debuts
2002 Canadian television series endings
2001 Chinese television series debuts
2002 Chinese television series endings
2000s Canadian children's television series
Canadian children's fantasy television series
China Central Television original programming
Chinese children's television series
Chinese fantasy television series
Stereotypes of Inuit people
Canadian television shows featuring puppetry
Chinese television shows featuring puppetry
Treehouse TV original programming
TVB original programming
Fictional pinnipeds
Television series about bears
Television series about rabbits and hares
Canadian preschool education television series
2000s preschool education television series
|
https://en.wikipedia.org/wiki/INPADOC
|
INPADOC, which stands for International Patent Documentation, is a freely available international patent database. It is produced and maintained by the European Patent Office (EPO). INPADOC developed a patent families classification, which groups together patent applications (and issued patents) originating from the same priority document(s). It also provides data about the legal status (pending, issued, abandoned, expired) for patent documents in many countries and for large time periods. Although INPADOC is not comprehensive, it keeps expanding the breadth and the depth of its coverage.
Historic timeline
INPADOC was founded by the World Intellectual Property Organization (WIPO) and the government of Austria under an agreement on May 2, 1972. The original database was offered to users in microfiche format. Patent Family Service (PFS) grouping was introduced, where all the documents belonging to a specific patent family were identified, in 1973. Legal status information became available in 1978. INPADOC went on-line 1981.
In 1988 INPADOC officials claimed, that the database "covers more than 98 % of all patent documents published yearly worldwide and the total number of documents is more than 13 million." Luxembourg had the largest temporal coverage going back to 1945. The database provided bibliographic information from 55 patent issuing authorities (73 in 2023) and the legal status service from 12 as of 1990.
INPADOC was integrated into the European Patent Office (EPO) in 1991 with the Principal Directorate Patent Information of the EPO having been located in Vienna, Austria since.
In 2003 the backlog of the legal status database was cleared up, and the physical storage of electronic records was established in The Hague.
Approximately 130,000 bibliographic records from Indonesia, Malaysia, the Philippines, Vietnam, Singapore and Brunei covering years between 1990 and 2003 were added in 1991, albeit their availability was initially limited to CD-ROM format only.
Patent data from Brazil and 19 Spanish-language countries were added in 2004.
In 2005, the database provided bibliographic information from 73 patent issuing authorities and the legal status service from 44.
Also in 2005, several commercial database developers (e.g. Anacubis, Minesoft, PatentInformatics and Questel-Orbit) offered access to enhanced INPADOC data and search functionality for a fee.
Source:
See also
Espacenet
International Patent Classification
Patent classification
Derwent World Patents Index
FIZ Karlsruhe
Notes
References
External links
INPADOC page on the EPO web site
INPADOC content from STN.
Patent search services
|
https://en.wikipedia.org/wiki/Orange%20%28software%29
|
Orange is an open-source data visualization, machine learning and data mining toolkit. It features a visual programming front-end for explorative qualitative data analysis and interactive data visualization.
Description
Orange is a component-based visual programming software package for data visualization, machine learning, data mining, and data analysis.
Orange components are called widgets. They range from simple data visualization, subset selection, and preprocessing to empirical evaluation of learning algorithms
and predictive modeling.
Visual programming is implemented through an interface in which workflows are created by linking predefined or user-designed widgets, while advanced users can use Orange as a Python library for data manipulation and widget alteration.
Software
Orange is an open-source software package released under GPL and hosted on GitHub. Versions up to 3.0 include core components in C++ with wrappers in Python. From version 3.0 onwards, Orange uses common Python open-source libraries for scientific computing, such as numpy, scipy and scikit-learn, while its graphical user interface operates within the cross-platform Qt framework.
The default installation includes a number of machine learning, preprocessing and data visualization algorithms in 6 widget sets (data, transform, visualize, model, evaluate and unsupervised). Additional functionalities are available as add-ons (text-mining, image analytics, bioinformatics, etc.).
Orange is supported on macOS, Windows and Linux and can also be installed from the Python Package Index repository (pip install Orange3)
Features
Orange consists of a canvas interface onto which the user places widgets and creates a data analysis workflow. Widgets offer basic functionalities such as reading the data, showing a data table, selecting features, training predictors, comparing learning algorithms, visualizing data elements, etc. The user can interactively explore visualizations or feed the selected subset into other widgets.
Canvas: graphical front-end for data analysis
Widgets:
Data: widgets for data input, data filtering, sampling, imputation, feature manipulation and feature selection
Visualize: widgets for common visualization (box plot, histograms, scatter plot) and multivariate visualization (mosaic display, sieve diagram).
Classify: a set of supervised machine learning algorithms for classification
Regression: a set of supervised machine learning algorithms for regression
Evaluate: cross-validation, sampling-based procedures, reliability estimation and scoring of prediction methods
Unsupervised: unsupervised learning algorithms for clustering (k-means, hierarchical clustering) and data projection techniques (multidimensional scaling, principal component analysis, correspondence analysis).
Add-ons
Orange users can extend their core set of components with components in the add-ons. Supported add-ons include:
Associate: components for mining frequent itemsets and associ
|
https://en.wikipedia.org/wiki/Network-enabled%20capability
|
Network-enabled capability, or NEC, is the name given to the United Kingdom Ministry of Defence long-term intent to achieve enhanced military effect through the better use of information systems towards the goal of "right information, right place, right time – and not too much". NEC is envisaged as the coherent integration of sensors, decision-makers, effectors and support capabilities to achieve a more flexible and responsive military. This is intended to make commanders better aware of the evolving military situation and better able to react to events through communications.
Allied parallels
NEC is related to the US concept of network-centric warfare (NCW), which at the time was described as "translating an information advantage into a decisive warfighting advantage". This was later renamed "network-centric operations" (NCO), to encompass activities such as peacekeeping.
NEC is related to the Australian concept of Ubiquitous Command and Control (UC2), which includes network-enabled capability, military intent, and awareness. UC2 extends the "networking position" of NEC and NCW to include positions on decision devolution, seeking the ubiquity of available decision makers and using computing to achieve it, the necessary human-computer integration in decision making, decentralisation of intent and physical dispersion, social coordination protocols to unify intent, capability and awareness, and management levels to bound behaviours.
See also
Networked swarming warfare
British Armed Forces
Skynet
Bowman
References
Joint Services Publication 777 Edition 1, available online from the Ministry of Defence.
Understanding Network Enabled Capability
An Introductory Study to Cyber Security in NEC
External links
BAE Systems NEC
QinetiQ NEC
Roke Manor Research NEC
Systems Engineering & Assessment NEC
Thales group NEC
Ericsson white paper: C4ISR for Network-Oriented Defense
NECE 2008
Centric Labs
Net-centric
|
https://en.wikipedia.org/wiki/Relativity%20%28Star%20Trek%3A%20Voyager%29
|
"Relativity" is the 118th episode of the American science fiction television series Star Trek: Voyager airing on the UPN network. It is the 24th episode of the fifth season.
Set in the 24th century, the series follows the adventures of the Federation starship Voyager during its journey home to Earth, having been stranded tens of thousands of light-years away. In this episode, Seven of Nine (Jeri Ryan) is recruited from the future to prevent the present-time destruction of her ship. The episode also features a number of guest stars and a scene back at planet Earth.
This episode was written by Nick Sagan & Bryan Fuller & Michael Taylor, and directed by Allan Eastman.
Plot
A 29th century Starfleet vessel, the timeship Relativity, is attempting to stop the detonation of an explosive planted on Voyager during its travel through the Delta Quadrant in the 24th century, which is causing a time paradox. Captain Braxton (Bruce McGill) and his crew are unable to detect where on Voyager the explosive is located, so they recruit Seven of Nine, pulling her out of the time stream moments before Voyagers destruction, as her enhanced Borg visual sensors can aid in the device's detection. Seven is sent back in time, disguised as a Starfleet ensign, to the point where Voyager is still in drydock prior to her maiden voyage and being inspected by Captain Kathryn Janeway (Kate Mulgrew). Janeway detects Seven's anomalous presence just as Seven locates the bomb. Relativity recalls Seven before she is discovered, but the travel through time kills her on return.
Knowing where the bomb is located, Relativity recalls a slightly earlier version of Seven, and after explaining the scenario, send her back again, now to a point where Voyager has been pulled into the Delta Quadrant and fighting the Kazon, prior to when Seven had joined its crew. Seven's presence is discovered by Voyager, and she is captured; Janeway recognizes her from drydock. Seven explains the situation to Janeway, and together they locate the device, discovering that it was planted by a future version of Braxton himself.
Seven is able to jump back in time to try to stop Braxton from planting the device, but he escapes to the day that Voyager would be destroyed. Seven follows, but the stress of time travel has taken its toll on her body; nevertheless, she is able to warn the Voyager crew of the problem and to apprehend Braxton. The crew of the Relativity, having taken their Braxton into custody as well, recruit a version of Janeway like they did with Seven, and send her back to the past at the Kazon attack, where she is able to secure Braxton before he can plant the device. The crew of Relativity pull the time travelers back to their present, re-integrating the various copies with themselves. It is learned that Braxton, after the events of "Future's End", had to spend several years in rehabilitation before being reassigned for duty, and started to blame Voyager for all the problems that he encountered as
|
https://en.wikipedia.org/wiki/VP-Info
|
VP-Info is a database language and compiler for the personal computer. VP-Info was a competitor to the Clipper and dBase applications in the late 1980s and 1990s. VP-Info was originally intended to run on MS-DOS, DR-DOS and the PC-MOS/386 operating system, but now is run in the vDOS, Windows environment. The last release of VP-Info, a multi-tasking, multi-user version released in 1992 was named SharkBase, or simply "Shark".
Origin
In the early 1980s, David Clark met George Gratzer, a mathematics professor at the University of Manitoba, at ComputerLand in Winnipeg where Gratzer was looking for someone who could program in dBase. Clark had been using dBase II, but was frustrated by its limitations for reporting on more than 2 tables at a time. While working for Standard Knitting (a client of Gratzer's and Clark's), David wrote a report generator called dComp that would allow up to six related data files to be in use at one time and run faster than the slow, dBase II. Clark and Gratzer subsequently formed a partnership in a company called "Sub Rosa" that developed dComp into a full dBase II compatible language/database called Max that had more speed and "power tools" than even dBase III contained. Clark designed and developed the program while Gratzer wrote the reference and tutorial manuals. This product was published by Paperback Software and sold over 30,000 copies (worldwide) in 1987 alone. The published reference manual for VP-Info was over 900 pages and the program was distributed in an extra thick back cover which was an innovation for all Paperback Software products at that time.
For programmers, Max had several interesting capabilities, including the ability to change field names easily, to represent fields in array form, automatically execute code while moving from field to field and many tools like cross tabs. With its built-in editor, a programmer could go from edit to executing the program in 2 keystrokes and back to editing the program with just 2 more.
Marketing
Paperback Software International Ltd. acquired worldwide marketing rights to Max and launched it as VP-Info in 1986. Lotus Development Corp. objected to some of the features of VP-Planner 3D, a Lotus look-alike with a number of features beyond those of 1-2-3, and sued Paperback Software for copyright infringement in 1989. Though the lawsuit ultimately failed in the courts, Paperback Software eventually folded following the litigations.
Sub Rosa Inc. reacquired worldwide distribution rights to VP-Info shortly before it entered bankruptcy. Bursten and an associate, Bernie Melman of Toronto, established Sub Rosa Publishing Inc. in Toronto and Sub Rosa Corporation in Minneapolis and attempted to get VP-Info back into distribution. Since the name belonged to the bankrupt Paperback Software, however, they had to give it yet another name, and Shark (or Sharkbase) was introduced in 1992 as an upgrade to VP-Info.
Technical
VP-Info can read and write all the common dBase/Clipp
|
https://en.wikipedia.org/wiki/RBST
|
RBST or rBST may refer to:
Randomized binary search tree, a computer data structure
Rare Breeds Survival Trust, a UK charity
Recombinant bovine somatotropin (usually "rBST"), a synthetic growth hormone controversially used in dairy farming
|
https://en.wikipedia.org/wiki/XML%20Information%20Set
|
XML Information Set (XML Infoset) is a W3C specification describing an abstract data model of an XML document in terms of a set of information items. The definitions in the XML Information Set specification are meant to be used in other specifications that need to refer to the information in a well-formed XML document.
An XML document has an information set if it is well-formed and satisfies the namespace constraints. There is no requirement for an XML document to be valid in order to have an information set.
An information set can contain up to eleven different types of information items:
The Document Information Item (always present)
Element Information Items
Attribute Information Items
Processing Instruction Information Items
Unexpanded Entity Reference Information Items
Character Information Items
Comment Information Items
The Document Type Declaration Information Item
Unparsed Entity Information Items
Notation Information Items
Namespace Information Items
XML was initially developed without a formal definition of its infoset. This was only formalised by later work beginning in 1999, first published as a separate W3C Working Draft at the end of December that year.
Infoset recommendation Second Edition was adopted on 4 February, 2004. If a 2.0 version of the XML standard is ever published, it is likely that this would absorb the Infoset recommendation as an integral part of that standard.
Infoset augmentation
Infoset augmentation or infoset modification refers to the process of modifying the infoset during schema validation, for example by adding default attributes. The augmented infoset is called the post-schema-validation infoset, or PSVI.
Infoset augmentation is somewhat controversial, with claims that it is a violation of modularity and tends to cause interoperability problems, since applications get different information depending on whether or not validation has been performed.
Infoset augmentation is supported by XML Schema but not RELAX NG.
Serialization
Typically, XML Information Set is serialized as XML. There are also serialization formats for Binary XML, CSV, and JSON.
See also
XML Information Set instances:
Document Object Model
Xpath data model
SXML
References
External links
World Wide Web Consortium standards
XML-based standards
ja:Extensible Markup Language#XMLインフォメーションセット
|
https://en.wikipedia.org/wiki/Route%20poisoning
|
Route poisoning is a method to prevent a router from sending packets through a route that has become invalid within computer networks. Distance-vector routing protocols in computer networks use route poisoning to indicate to other routers that a route is no longer reachable and should not be considered from their routing tables. Unlike the split horizon with poison reverse, route poisoning provides for sending updates with unreachable hop counts immediately to all the nodes in the network.
When the protocol detects an invalid route, all of the routers in the network are informed that the bad route has an infinite (∞) route metric. This makes all nodes on the invalid route seem infinitely distant, preventing any of the routers from sending packets over the invalid route.
Some distance-vector routing protocols, such as RIP, use a maximum hop count to determine how many routers the traffic must go through to reach the destination. Each route has a hop count number assigned to it which is incremented as the routing information is passed from router to router. A route is considered unreachable if the hop count exceeds the maximum allowed. Route poisoning is a method of quickly forgetting outdated routing information from other router's routing tables by changing its hop count to be unreachable (higher than the maximum number of hops allowed) and sending a routing update. In the case of RIP, the maximum hop count is 15, so to perform route poisoning on a route its hop count is changed to 16, deeming it unreachable, and a routing update is sent.
If these updates are lost, some nodes in the network would not be informed that a route is invalid, so they could attempt to send packets over the bad route and cause a problem known as a routing loop. Therefore, route poisoning is used in conjunction with holddowns to keep update messages from falsely reinstating the validity of a bad route. This prevents routing loops, improving the overall efficiency of the network.
References
The TCP-IP Guide, RIP Special Features For Resolving RIP Algorithm Problems, by Charles M. Kozierok
RFC 1058: Routing Information Protocol, by C. Hedrick, Rutgers University (June 1988)
Internet Standards
Internet protocols
Routing protocols
|
https://en.wikipedia.org/wiki/Battle%20of%20the%20Network%20Reality%20Stars
|
Battle of the Network Reality Stars is an American television series that aired on the Bravo cable network from August 17 until September 21, 2005. Based on the popular 1970s and 1980s television competition Battle of the Network Stars, the show consisted of thirty-three competitors from several different reality television shows. Some of the better known contestants include Adam Mesh, from the Average Joe TV series, Richard Hatch, Survivor winner, Sue Hawk, (the Survivor player who gave the infamous "snakes and rats" speech) Ryan Starr and Nikki McKibbin of American Idol fame, Evan Marriott, of Joe Millionaire fame, and Will Kirby, winner of Big Brother season 2. Chip and Kim McAllister, winners of The Amazing Race 5, also participated. Veteran NBC sportscaster Mike Adamle hosted the show and featured reality reporters Trishelle Cannatella (The Real World: Las Vegas), Omarosa Manigault-Stallworth (The Apprentice – season 1), and Bob Guiney (The Bachelor – season 4). Austin Scarlett of Project Runway made fashion commentary in several episodes.
Teams
The competitors, as divided by team (per first episode structure):
Episode summary
Episode 1
Obstacle Course – Teams Red and Light Blue advanced to the finals – winner Team Red
Dunk Tank – Team Green wins with 9 points, followed by Teams Blue and Light Blue with 6, and Team Red with 1
Jousting – Team Light Blue wins (Jonathan beats Bradford to win the final point)
Eliminated – Teams Green, Red and Dark Blue are forced to vote off one member each. Kim and Heidi volunteer to leave due to physical weakness, and Charla is voted out.
Twist – Instead of leaving, they are forced to move to a new team based on the number they choose. Charla goes to Team Red, Kim stays at Team Green, Heidi moves to Team Dark Blue.
Episode 2
Simon Says (conducted by professional Simon Says caller Steve Max and refereed by Jimmie Walker of Good Times fame) – Team Light Blue is eliminated first, followed by Team Red; Nikki of Team Green and Richard of Team Dark Blue are the final 2 – Richard wins
Dodgeball – Teams Red and Green advance to the finals; Team Green wins
Swimming Relay (introduced by Darva Conger of Who Wants to Marry a Multimillionaire?) – Team Dark Blue wins, Team Light Blue second, Team Green third, Team Red last
Eliminated – Team Red has the lowest score of the day and must axe two players. Charla, who had volunteered to swim and then had to be replaced by Melissa at the last minute, agrees to leave; Duncan Nutter also volunteers to leave.
Twist – As the highest-scoring team of the day, Dark Blue get to choose which two players from another team will join Red. They pick Gervase (the leader of Light Blue) and Tina Fabulous (the "spirit" of Light Blue).
New arrivals – David Daskal (Average Joe – season 2) and Jerri Manthey (Survivor – Outback/All-Stars) replace Gervase and Tina for Light Blue. Light Blue was horrified that they had lost a great athlete (Gervase) and a solid competitor (Tina) in exch
|
https://en.wikipedia.org/wiki/British%20Tabulating%20Machine%20Company
|
The British Tabulating Machine Company (BTM) was a firm which manufactured and sold Hollerith unit record equipment and other data-processing equipment. During World War II, BTM constructed some 200 "bombes", machines used at Bletchley Park to break the German Enigma machine ciphers.
History
The company was formed in 1902 as The Tabulator Limited, after Robert Porter obtained the rights to sell Herman Hollerith's patented machines from the US Tabulating Machine Company (later to become IBM). By 1909, the company had been renamed the "British Tabulating Machine Company Limited". In 1920, the company moved from London to Letchworth, Hertfordshire; it was also at this point that it started manufacturing its own machines, rather than simply reselling Hollerith equipment.
Annual revenues were £6K in 1915, £122K in 1925, and £170K in 1937. In 1916 there were 45 staff; this increased to 132 in 1922, 326 in 1929 and 1,225 in 1939.
In return for the exclusive right to market Hollerith equipment in Britain and the Empire (excluding Canada), BTM paid 25% of its revenues to the American company by way of royalties. This became an ever-increasing burden as the years progressed; BTM attempted to renegotiate the agreement on several occasions, but it was only finally terminated in 1948.
During World War II, BTM was called upon to design and manufacture a machine to assist breaking the German Enigma machine ciphers. This machine, known as a bombe, was initially conceived by Alan Turing, but the actual machine was designed by BTM chief engineer Harold 'Doc' Keen, who had led the company's engineering department throughout the 1930s. The project was codenamed "CANTAB". The project was managed by computing pioneer Dora Metcalf until 1942. By the end of the European war, over two hundred bombes had been built and installed.
HEC computer
BTM built a valve based computer called the Hollerith Electronic Computer (HEC). The first model (HEC 1) was built in 1951, an example is held by the Birmingham Museum. BTM went on to develop the HEC 2, 2M and 4 models, eventually building more than 100. The machines had a 2 kilobyte drum memory and 1000 valves, and could use punched cards for input and output, or drive a printer.
Merger
In 1959 BTM merged with former rival Powers-Samas to become International Computers and Tabulators Limited (ICT). ICT later became part of International Computers Limited (ICL), which was later taken over by Fujitsu.
References
John Harper, BTM – British Tabulating Machine Company Limited .
John Keen, Harold 'Doc' Keen and the Bletchley Park Bombe, 2003, .
Martin Campbell-Kelly, ICL and the British computer industry, .
External links
Letchworth's Enigma
Details of the Bombe and BTMC history
Grace's Guide to British Industrial History – British Tabulating Machine Co
The BTM HEC Paperwork Collection at The ICL Computer Museum.
Defunct manufacturing companies of the United Kingdom
International Computers Limited
Cryptanalytic devices
|
https://en.wikipedia.org/wiki/Darwin%20%28programming%20game%29
|
Darwin was a programming game invented in August 1961 by Victor A. Vyssotsky, Robert Morris Sr., and M. Douglas McIlroy. (Dennis Ritchie is sometimes incorrectly cited as a co-author, but was not involved.) The game was developed at Bell Labs, and played on an IBM 7090 mainframe there. The game was only played for a few weeks before Morris developed an "ultimate" program that eventually brought the game to an end, as no-one managed to produce anything that could defeat it.
Description
The game consisted of a program called the umpire and a designated section of the computer's memory known as the arena, into which two or more small programs, written by the players, were loaded. The programs were written in 7090 machine code, and could call a number of functions provided by the umpire in order to probe other locations within the arena, kill opposing programs, and claim vacant memory for copies of themselves.
The game ended after a set amount of time, or when copies of only one program remained alive. The player who wrote the last surviving program was declared winner.
Up to 20 memory locations within each program (fewer in later versions of the game) could be designated as protected. If one of these protected locations was probed by another program, the umpire would immediately transfer control to the program that was probed. This program would then continue to execute until it, in turn, probed a protected location of some other program, and so forth.
While the programs were responsible for copying and relocating themselves, they were forbidden from altering memory locations outside themselves without permission from the umpire. As the programs were executed directly by the computer, there was no physical mechanism in place to prevent cheating. Instead, the source code for the programs was made available for study after each game, allowing players to learn from each other and to verify that their opponents hadn't cheated.
The smallest program that could reproduce, locate enemies and kill them consisted of about 30 instructions. McIlroy developed a 15-instruction program that could locate and kill enemies but not reproduce; while not very lethal, it was effectively unkillable, as it was shorter than the limit of 20 protected instructions. In later games the limit on protected instructions was lowered because of this.
The "ultimately lethal" program developed by Morris had 44 instructions, and employed an adaptive strategy. Once it successfully located the start of an enemy program, it would probe some small distance ahead of this location. If it succeeded in killing the enemy, it would remember the distance and use it on subsequent encounters. If it instead hit a protected location, then the next time it gained control it chose a different distance. Any new copies were initialized with a successful value. In this way, Morris's program evolved into multiple subspecies, each specifically adapted to kill a particular enemy.
See a
|
https://en.wikipedia.org/wiki/Firehouse%20Tales
|
Firehouse Tales is an American animated children's television series created by Sidney J. Bailey, produced by Warner Bros. Animation as the only original series for Cartoon Network's now-defunct Tickle-U preschool programming block. The series follows three anthropomorphic fire engines who attend firefighting school.
Characters
Red (voiced by Jesse Moss) is a red fire engine and the main character in the show who never gives up. He loves nature and the outdoors but most of all, he loves making new friends. Sometimes, he is the leader of the firetruck team. Red has an orange and yellow siren. The episode "New Truck On The Block" reveals his first day in Green Meadows. His catchphrase is, "The sirens say help's on the way!"
Petrol (voiced by Michael Adamthwaite) is an orange fire engine from Scotland who is sometimes afraid but manages to find the courage inside himself. According to his song "I'm Petrol the Fire Truck", he came before Crabby and Red did. Petrol has two blue sirens.
Crabby (voiced by Richard Cox) is a grumpy yellow fire engine who sometimes complains about his job and who likes the "great indoors" better than the outdoors but sometimes enjoys the outdoors. Crabby has two red sirens.
The Chief (voiced by Ron Halder) is the dark blue fire engine who is the leader of the three junior firetrucks (Red, Petrol, and Crabby). He tells them exactly what to do at any given time. He sometimes puts Red in charge of the team and sometimes leads the team whenever an emergency occurs.
Mayor Precious Primly (voiced by Ellen Kennedy) is the mayor who runs Green Meadows and works for The Chief.
Stinky Bins (voiced by David "Squatch" Ward) is the green garbage truck of Green Meadows. He is used to his own stench but sometimes takes a bath, resulting in pollution that has to be cleaned up by the firetrucks. He also likes telling jokes, as seen in "Stinky Bubbles".
Snooty-Tootie (voiced by Colin Murdock) is a black limo who carries the Mayor around Green Meadows. He once taught the junior firetrucks manners.
Spinner (voiced by David A. Kaye) is an orange helicopter who often doesn't take his job seriously.
Scoop is a white seaplane who carries water which she can use to douse fires.
Bubba (voiced by Blu Mankuma) is a yellow bulldozer who works outside the firehouse.
Milkie (voiced by Cathy Weseluck) is a white ice cream truck who likes to give ice cream to the children.
Wiser (voiced by French Tickner) is a dark red mobile crane who can lift people from fires. He first appeared in "Older But Wiser". He also narrates all the stories.
Tug (voiced by Michael Dobson) is a red and yellow fireboat who is ready to rescue.
Bulky (voiced by Terry Klassen) is a blue blimp who had been decorated for Halloween. He appeared in the episodes "Spinner Spins a Tale" and "Hoppin' Hoses".
Zoe is a red tow truck who likes helping other cars.
Lorrie is a light blue Land Rover who lives in the beach and is Petrol's old friend. She first appeared in "The Lor
|
https://en.wikipedia.org/wiki/One%20Must%20Fall%3A%202097
|
One Must Fall: 2097 is a fighting video game for all IBM-compatible computers on DOS, programmed by Diversions Entertainment, published by Epic MegaGames and released in October 1994. The game was later patched to include multiplayer support. In February 1999, the game was declared freeware by the developers. A sequel titled One Must Fall: Battlegrounds was released in 2003.
Gameplay
One Must Fall: 2097 replaces the human combatants typical of contemporary fighter video games with large Human Assisted Robots (HAR). These HARs are piloted through a physical and mental link to the human pilots; however, this is merely a plot concept and is never shown on-screen.
Eleven HARs and ten selectable pilots are available for play, along with five arenas and four tournaments. The pilots vary in strength, speed and endurance, thus the many HAR/pilot combinations allow for large replay value.
Unlike in most fighting games of its time, the arenas (except one, the Stadium) contain hazards. For instance, one arena features spikes coming out of the darkness that can damage a robot.
The game has two main play modes: One-Player Mode, in which the company that markets the robots, World Aeronautics and Robotics (WAR), is holding a competition among its employees to decide who will be selected to oversee the establishment of the first Earth base on Jupiter's moon, Ganymede. The second mode is Tournament Mode, where HAR battles have become the premier source of entertainment for Earth and the player as a new competitor, must win prize money to improve the machine and ultimately become the World Champion.
Each HAR has three special attacks that can be discovered (except for Shadow and Nova, who both have four), along with a "scrap" and "destruction" move (similar to fatalities in Mortal Kombat) that can earn bonus points and, in some cases, unlock secrets.
Using destruction moves in the tournament mode in the higher difficulty levels sometimes results in the player being challenged by an unranked opponent. Defeating that opponent and using a destruction move on their robot occasionally yields secret components which can be installed on the player's HAR, significantly improving the effectiveness of certain special moves and sometimes adding new ones.
History
Development
The game began development under the title of simply One Must Fall and the beta demo was released as freeware in May 1993. It featured two human fighters who resembled the karatekas of Karate Champ. The completed version was officially released in October 1994 by Epic MegaGames.
The music was composed by Kenny Chow of the demoscene group Renaissance using Scream Tracker 3.0.
Different versions of the game had varying AI flaws. For example, certain versions had all AI opponents not guarding themselves against the special moves of Shadow and Thorn.
The full retail version includes shareware versions of Radix: Beyond the Void, Tyrian and Jazz Jackrabbit, the last of which is referenced heavily i
|
https://en.wikipedia.org/wiki/Host%20signal%20processing
|
Host signal processing (HSP) is a term used in computing to describe hardware such as a modem or printer which is emulated (to various degrees) in software. Intel refers to the technology as native signal processing (NSP). HSP replaces dedicated DSP or ASIC hardware by using the general purpose CPU of the host computer.
Modems using HSP are known as winmodems (a term trademarked by 3COM / USRobotics, but genericized) or softmodems. Printers using HSP are known as GDI printers (after the MS Windows GDI software interface), winprinters (named after winmodems) or softprinters.
The Apple II Disk II floppy drive used the host CPU to process drive control signals, instead of a microcontroller. This instance of HSP predates the usage of the terms HSP and NSP.
In the mid- to late-1990s, Intel pursued native signal processing technology to improve multimedia handling. According to testimony by Intel, Microsoft opposed development of NSP because the technology could reduce the necessity of the Microsoft Windows operating system. Intel claims to have terminated development of NSP because of threats from Microsoft.
References
Computing terminology
Digital signal processing
|
https://en.wikipedia.org/wiki/26th%20Daytime%20Emmy%20Awards
|
The 26th Daytime Emmy Awards were held in 1999 to commemorate excellence in daytime television programming from the previous year (1998). The main ceremonies were held May 21, 1999, at The Theater in Madison Square Garden in New York City and were televised live by CBS.
Memorable moments that occurred at the ceremonies included the ABC soap opera General Hospital winning a record number of Daytime Emmys with a total of eight, and Susan Lucci's first-ever win in the Outstanding Lead Actress category after losing a total of 18 times.
Winners in each category are in bold.
Outstanding Drama Series
All My Children: Jean Dadario Burke
Days of Our Lives: Ken Corday
General Hospital: Wendy Riche
The Young and the Restless: William J. Bell & Edward Scott
Outstanding Lead Actor
Peter Bergman (Jack Abbott, The Young and the Restless)
Eric Braeden (Victor Newman, The Young and the Restless)
David Canary (Adam Chandler/Stuart Chandler, All My Children)
Anthony Geary (Luke Spencer, General Hospital)
Robert S. Woods (Bo Buchanan, One Life to Live)
Outstanding Lead Actress
Jeanne Cooper (Katherine Chancellor, The Young and the Restless)
Elizabeth Hubbard (Lucinda Walsh, As the World Turns)
Susan Lucci (Erica Kane, All My Children)
Melody Thomas Scott (Nikki Newman, The Young and the Restless)
Kim Zimmer (Reva Shayne, Guiding Light)
Outstanding Supporting Actor
Stuart Damon (Alan Quartermaine, General Hospital)
Michael E. Knight (Tad Martin, All My Children)
Christian LeBlanc (Michael Baldwin, The Young and the Restless)
Kristoff St. John (Neil Winters, The Young and the Restless)
Jerry verDorn (Ross Marler, Guiding Light)
Outstanding Supporting Actress
Jennifer Bassey (Marian Colby, All My Children)
Sharon Case (Sharon Newman, The Young and the Restless)
Beth Ehlers (Harley Cooper, Guiding Light)
Kathleen Noone (Bette Katzenkazrahi, Sunset Beach)
Kelly Ripa (Hayley Vaughan, All My Children)
Outstanding Younger Actor
Jensen Ackles (Eric Brady, Days of Our Lives)
Jason Winston George (Michael Bourne, Sunset Beach)
Jonathan Jackson (Lucky Spencer, General Hospital)
Bryant Jones (Nate Hastings, The Young and the Restless)
Joshua Morrow (Nicholas Newman, The Young and the Restless)
Jacob Young (Rick Forrester, The Bold and the Beautiful)
Outstanding Younger Actress
Sarah Brown (Carly Benson, General Hospital)
Camryn Grimes (Cassie Newman, The Young and the Restless)
Rebecca Herbst (Elizabeth Webber, General Hospital)
Ashley Jones (Megan Dennison, The Young and the Restless)
Sherri Saum (Vanessa Hart, Sunset Beach)
Heather Tom (Victoria Newman, The Young and the Restless)
Outstanding Drama Series Writing Team
All My Children
Days of Our Lives
General Hospital
Guiding Light
The Young and the Restless
Outstanding Drama Series Directing Team
All My Children
Days of Our Lives
General Hospital
The Young and the Restless
Outstanding Music Direction and Composition
Richard Stone, Steven Bernstein, Tim Kelly, Julie Berns
|
https://en.wikipedia.org/wiki/Zing%20Technologies
|
Zing Technologies is company that marketed a proprietary collaborative software system for meeting and learning. There are two versions of their software, Anyzing and Zingthing.
See also
Computer-supported collaboration
Online learning
References
Elliot, A., Findlay, J., Fitzgerald, R.N. & Forster, A. (2004). Transforming pedagogies using collaborative tools. World Conference on Educational Multimedia, Hypermedia and Telecommunications 2004(1), 2565-2569. .
Elliott, A. (2002). Scaffolding knowledge building strategies in teacher education settings. In Crawford, C., Willis, D., Carlsen, R., Gibson, I., McFerrin, K., Price, J., & Weber, R. (Eds.), Proceedings of Society for Information Technology and Teacher Education International Conference 2002 (pp. 827–829). Chesapeake, VA: AACE.
Fitzgerald, R.N., & Findlay, J. (2004). A computer-based research tool for rapid knowledge-creation. Cantoni, L. and McLoughlin, C. (eds) World Conference on Educational Multimedia, Hypermedia and Telecommunications 2004(1), 1979-1984. .
Moyle, Kathryn. (2006). Focus groups in educational research: using ICT to assist in meaningful data collection. AARE Conference Paper Abstracts - 2006,
Whymark, G., Callan, J., & Purnell, K. (2004, November 24). Online learning predicates teamwork: Collaboration underscores student engagement. Studies in Learning, Evaluation, Innovation and Development [Online], 1(2).
Willcox, J & Zuber-Skerritt, O. (2003). Using the Zing team learning system (TLS) as an electronic method for the Nominal Group Technique (NGT). ALAR Journal, 8(1), 61-75.
Groupware
|
https://en.wikipedia.org/wiki/25th%20Daytime%20Emmy%20Awards
|
The 25th Daytime Emmy Awards were held in 1998 to commemorate excellence in daytime programming from the previous year (1997).
Winners in each category are in bold. Just like the previous year, the 25th Daytime Emmy Awards were held at Radio City Music Hall in New York City.
Outstanding Drama Series
All My Children
Days of Our Lives
General Hospital
The Young and the Restless
Outstanding Lead Actor
Peter Bergman (Jack Abbott, The Young and the Restless)
Eric Braeden (Victor Newman, The Young and the Restless)
David Canary (Adam Chandler/Stuart Chandler, All My Children)
Anthony Geary (Luke Spencer, General Hospital)
Kin Shriner (Scott Baldwin, Port Charles)
Outstanding Lead Actress
Eileen Davidson (Kristen Blake, Days of Our Lives)
Susan Lucci (Erica Kane, All My Children)
Cynthia Watros (Annie Dutton, Guiding Light)
Jacklyn Zeman (Bobbie Spencer, General Hospital)
Kim Zimmer (Reva Shayne, Guiding Light)
Outstanding Supporting Actor
Grant Aleksander (Phillip Spaulding, Guiding Light)
Ian Buchanan (James Warwick, The Bold and the Beautiful)
Steve Burton (Jason Morgan, General Hospital)
Michael E. Knight (Tad Martin, All My Children)
Scott Reeves (Ryan McNeil, The Young and the Restless)
Outstanding Supporting Actress
Julia Barr (Brooke English, All My Children)
Amy Carlson (Josie Watts, Another World)
Amy Ecklund (Abigail Blume, Guiding Light)
Vanessa Marcil (Brenda Barrett, General Hospital)
Victoria Rowell (Drucilla Winters, The Young and the Restless)
Outstanding Younger Actor
Jensen Ackles (Eric Brady, Days of Our Lives)
Tyler Christopher (Nikolas Cassadine, General Hospital)
Jonathan Jackson (Lucky Spencer, General Hospital)
Bryant Jones (Nate Hastings, The Young and the Restless)
Kevin Mambo (Marcus Williams, Guiding Light)
Joshua Morrow (Nicholas Newman, The Young and the Restless)
Outstanding Younger Actress
Sarah Brown (Carly Benson, General Hospital)
Christie Clark (Carrie Brady, Days of Our Lives)
Camryn Grimes (Cassie Newman, The Young and the Restless)
Rhonda Ross Kendrick (Toni Burrell, Another World)
Heather Tom (Victoria Newman, The Young and the Restless)
Outstanding Drama Series Writing Team
All My Children
Days of Our Lives
General Hospital
The Young and the Restless
Outstanding Drama Series Directing Team
All My Children
Days of Our Lives
General Hospital
The Young and the Restless
Outstanding Talk Show
Leeza: Leeza Gibbons, Donna Harrison, Rudy Guido, Jill Mullikin-Bates, Kathy Giaconia, Shantel Klinger, Julie Laughlin, Tracy Mazuer, Julie Ross, Marilyn Zielinski
Live with Regis & Kathie Lee: Michael Gelman, Delores Spruell-Jackson, Joanne Saltzman, Barbara Fight, Cindy MacDonald, David Mullen, Dana Dodge, Mariann Sabol-Nieves
The Oprah Winfrey Show: Dianne Atkinson Hudson, Oprah Winfrey, David Boul, Alice McGee, Dana Newton, Ellen Rakieten, Mollie Allen, Kandi Amelon, Amy Craig, Katy Murphy Davis, Angie Kraus, Laura Grant Sillars, Jill Van Lokeren
The Rosie O'Donnell S
|
https://en.wikipedia.org/wiki/Toei%20Mita%20Line
|
The is a subway line of the Tokyo Metropolitan Bureau of Transportation (Toei) network in Tokyo, Japan. The line runs between Nishi-Takashimadaira in Itabashi and Meguro in Shinagawa. Trains continue with direct service into the Meguro Line of Tokyu Corporation for . The portion between and Meguro is shared with the Tokyo Metro Namboku Line.
The line was named after the Mita district in Minato, Tokyo, under which it passes. On maps and signboards, the line is shown in blue. Stations carry the letter "I" followed by a two-digit number.
Overview
Platforms on the Mita Line are equipped with chest-height automatic platform gates that open in sync with the train doors. The line was the first in the Tokyo subway system to have low barriers. The Tokyo Metro Namboku Line has used full-height platform screen doors since its opening. As of April 2022, the platform doors have been fully replaced for 8 car operations
The right-of-way and stations between Shirokane-Takanawa and Meguro are shared with the Tokyo Metro Namboku Line - a unique situation on the Tokyo subway where both operators share common infrastructure. Under an agreement of both parties, the fare for this section is calculated on the Toei system for passengers travelling to stations on the Mita Line past Shirokane-Takanawa, using the Tokyo Metro system for those travelling on the Namboku Line past Shirokane-Takanawa, and on the system "most beneficial to the passenger" (presently the Tokyo Metro schedule) for travel solely on the shared section.
According to the Tokyo Metropolitan Bureau of Transportation, as of June 2009, the Mita Line is the ninth most crowded subway line in Tokyo, running at 164% capacity between Nishi-Sugamo and Sugamo stations.
Station list
All stations are located in Tokyo.
Rolling stock
Present
Toei 6300 series 6-car sets(since 1993)
Toei 6500 series 8-car sets (since 14 May 2022)
Tokyu 3000 series 8-car sets (since 1999)
Tokyu 3020 series 8-car sets (since 2020)
Tokyu 5080 series 8-car sets (since 2003)
Sotetsu 21000 series 8-car sets (since 18 March 2023)
Former rolling stock
Toei 6000 series (from 1968 until 1999)
Toei 10-000 series (prototype for Shinjuku Line EMUs)
Maintenance facilities
Shimura Depot at Takashimadaira
History
The Mita Line was first envisioned in 1957 as a northern branch of Line 5 (the present Tōzai Line), serving the section between Ōtemachi and Itabashi. Under a revised proposal in 1962, the line was made independent and its construction was undertaken by the Tokyo Metropolitan Government. The new line (Line 6) was planned to run from Gotanda Station on the southwestern side of the Yamanote Line through central Tokyo, with its northern extensions via in Itabashi (near present ), diverting to and (present ). The southernmost portion, from to and Nishi-Magome depot, was to be shared with Line 1 (Asakusa Line); therefore, Line 6 would be gauge.
Due to political considerations, the design of the Mita Line changed severa
|
https://en.wikipedia.org/wiki/ADS%20%28TV%20station%29
|
ADS is an Australian television station based in Adelaide, South Australia. It is owned and operated by Paramount Networks UK & Australia through their Australian holdings Network 10.
History
ADS-10 began as ADS-7 on 24 October 1959, originally owned by The Advertiser newspaper, which was at the time controlled by The Herald and Weekly Times of Melbourne, founder of television station HSV-7. Therefore, ADS was originally associated with the channel 7 stations in the eastern states, forming the Australian Television Network, predeccesor to today's Seven Network. ADS used the national Seven Network logos and presentation in the 1970s and 1980s, and, along with HSV-7, used Frank Gari's Hello News campaign.
In the late 1980s ADS-7 was bought by media entrepreneur Kerry Stokes, who also owned CTC-7 in Canberra. In 1987, Stokes, with new regulations of the Broadcasting (Ownership and Control) Act, planned to buy the Seven Network from John Fairfax & Sons, which would have seen ADS-7 Adelaide and CTC-7 Canberra, along with a soon-to-be new station in Perth wich license was granted to a group participated by Stokes, align with ATN-7 Sydney and HSV-7 Melbourne. Stokes offered $100 million more than rival Christopher Skase for Seven, but was ultimately unsuccessful. Unable to build a metropolitan Seven television network, on 7 August 1987, Stokes sold ADS, CTC and his licence for what will become NEW-10 Perth to Northern Star Holdings, the then owners of Network 10.
This new ownership structure led to the unusual situation that two stations in Adelaide were owned by groups asociated with stations in other capital cities bearing the opposite channel numbers. To better align the Adelaide stations with its new sister stations and networks, ADS-7 and Adelaide's original Network Ten station SAS-10 (owned by Seven Network affiliate TVW-7 Perth starting in the 1970s, and that will be acquired the next year by Seven Network owner at the time, Skase's Qintex) agreed to switch affiliations and channel positions, ADS moving to channel 10 and thus becoming the oldest station of Network 10, the younger SAS moving to channel 7. The switch was effective on 27 December, 1987. The night before the swap, Seven National News reporter Alan Murrell reported about the pending changes on ADS-7, hours before the switch to Channel 10:
"Tonight will mark the end of the callsigns ADS-7 and SAS-10. Tomorrow, it'll be ADS-10 and SAS-7. It's the first time such a change has been made. The switch follows a media shake-up earlier this year, which left ADS in the hands of the owners of the Ten network. Already, the cosmetic changes are being made at Strangways Terrace and Gilberton. But viewers will notice little difference. They'll still turn the knob to 10 for Channel Ten programs, and to 7 for Seven programs."
"The only difference will be that the local personalities will be seen on different channels. So if you want to watch Steve Whitham and Caroline Ainslie reading the news t
|
https://en.wikipedia.org/wiki/Intel%20Viiv
|
Viiv (stylized as V//V) was a platform initiative from Intel similar to Intel's Centrino and vPro. Initially (through release 1.7), it was a collection of computer technologies with a particular combination of Intel ingredients to support a "media PC" concept. Intel also provided the Media Server as the core software stack on the PC to support "media" distribution through the home.
Marketing
Until 2007, Viiv was Intel's attempt to become the center of electronic-based home entertainment. Intel was repeating the marketing model for the very successful Centrino platform, which was their first branded platform. The Intel Viiv brand has been "de-emphasized" and comes after the CPU branding, similar to that of "Core 2 with Viiv inside", putting more focus on the CPU.
There will be no additional releases beyond 1.7.1 of the media server product.
Media discussion
News and reviews
PC Pro: behind the badge, conclusive look at Viiv 1.5
Slashdot: Viiv 1.5 May End Traditional Media PCs
Engadget: Intel VIIV says no thank you to DRM
Ars technica:Intel pimps Viiv with a baker's dozen of major partners
Digitimes: Intel looking to develop Linux version of Viiv to reduce costs
Criticism
Bit Tech: Why Intel's DRM strategy is flawed
Inquirer: Intel Viiv is stupid and broken
Inquirer: Intel's Viiv is an embarrassment
Intel corporate links
Intel's official Viiv (Core2 Processor with Viiv Technology) website
See also
Intel Core 2
Intel vPro
Centrino
Vixs
References
Viiv
Consumer electronics
Intel Viiv
|
https://en.wikipedia.org/wiki/Vazirani
|
Vazirani is an Indian (Sindhi Hindu) surname. Notable people with the surname include:
Vijay Vazirani (born 1957), Indian-born American computer scientist
Umesh Vazirani (born 1959), Indian-born American computer scientist, brother of Vijay
Reetika Vazirani (1962–2003), Indian-born American poet
Surnames of Indian origin
Sindhi-language surnames
Surnames of Hindu origin
|
https://en.wikipedia.org/wiki/GUID%20Partition%20Table
|
The GUID Partition Table (GPT) is a standard for the layout of partition tables of a physical computer storage device, such as a hard disk drive or solid-state drive, using universally unique identifiers, which are also known as globally unique identifiers (GUIDs). Forming a part of the Unified Extensible Firmware Interface (UEFI) standard (Unified EFI Forum-proposed replacement for the PC BIOS), it is nevertheless also used for some BIOSs, because of the limitations of master boot record (MBR) partition tables, which use 32 bits for logical block addressing (LBA) of traditional 512-byte disk sectors.
All modern personal computer operating systems support GPT. Some, including macOS and Microsoft Windows on the x86 architecture, support booting from GPT partitions only on systems with EFI firmware, but FreeBSD and most Linux distributions can boot from GPT partitions on systems with either the BIOS or the EFI firmware interface.
History
The Master Boot Record (MBR) partitioning scheme, widely used since the early 1980s, imposed limitations for use of modern hardware. The available size for block addresses and related information is limited to 32 bits. For hard disks with 512byte sectors, the MBR partition table entries allow a maximum size of 2 TiB (2³² × 512bytes) or 2.20 TB (2.20 × 10¹² bytes).
In the late 1990s, Intel developed a new partition table format as part of what eventually became the Unified Extensible Firmware Interface (UEFI). The GUID Partition Table is specified in chapter 5 of the UEFI 2.8 specification. GPT uses 64 bits for logical block addresses, allowing a maximum disk size of 264 sectors. For disks with 512byte sectors, the maximum size is 8 ZiB (264 × 512bytes) or 9.44 ZB (9.44 × 10²¹ bytes). For disks with 4,096byte sectors the maximum size is 64 ZiB (264 × 4,096bytes) or 75.6 ZB (75.6 × 10²¹ bytes).
In 2010, hard-disk manufacturers introduced drives with 4,096byte sectors (Advanced Format). For compatibility with legacy hardware and software, those drives include an emulation technology (512e) that presents 512byte sectors to the entity accessing the hard drive, despite their underlying 4,096byte physical sectors. Performance could be degraded on write operations, when the drive is forced to perform two read-modify-write operations to satisfy a single misaligned 4,096byte write operation. Since April 2014, enterprise-class drives without emulation technology (4K native) have been available on the market.
Readiness of the support for 4 KB logical sectors within operating systems differs among their types, vendors and versions. For example, Microsoft Windows supports 4K native drives since Windows 8 and Windows Server 2012 (both released in 2012) in UEFI.
Features
Like MBR, GPT uses logical block addressing (LBA) in place of the historical cylinder-head-sector (CHS) addressing. The protective MBR is stored at LBA 0, and the GPT header is in LBA 1, with a backup GPT header stored at the final LBA. The GPT header ha
|
https://en.wikipedia.org/wiki/Mixed%20threat%20attack
|
Regarding computer security, a mixed threat attack is an attack that uses several different tactics to infiltrate a computer user's environment. A mixed threat attack might include an infected file that comes in by way of spam or can be received by an Internet download. Mixed threat attacks try to exploit multiple vulnerabilities to get into a system. By launching multiple diverse attacks in parallel, the attacker can exploit more entry points than with just a single attack.
Because these threats are based on multiple single-attacks, they are much harder to detect. Firewalls can help with these types of attacks; if configured correctly, they are somewhat effective against this type of attack. However, if the attack is embedded inside an application, it is no longer able to prevent it. Typical techniques employed are to define the multiple access threat with a signature that can represent identification for the virus removal software. These types of techniques need to be employed on the host machine because sometimes the firewall or Intrusion Detection System is not able to detect the attack.
Nimda and Code Red are examples of computer worms that utilized mixed threat attacks.
See also
Computer Security
References
Computer security exploits
|
https://en.wikipedia.org/wiki/ArcSDE
|
ArcSDE (SDE for Spatial Database Engine) is a server-software sub-system (produced and marketed by Esri) that aims to enable the usage of Relational Database Management Systems for spatial data. The spatial data may then be used as part of a geodatabase.
History
Geographic Technologies Incorporated (GTI) in Australia originally designed the database software, named Spatial DataBase Engine (SDBE). Development shifted to Salamanca Software Pvt Ltd., which developed the first production version. SDBE originally used the InterBase DBMS. The president of Esri, Jack Dangermond, announced SDE at the GIS'95 conference in Vancouver, British Columbia, and Esri purchased Salamanca Software in 1996. Esri rebranded the software as "ArcSDE" to follow the naming convention of other products.
ArcSDE grew to meet the need of users of geographic data for robust multi-user editing, storage and access of extremely large geospatial databases. ArcSDE supports the Esri geodatabase implementation.
The product began as stand-alone software: Esri integrated it into ArcGIS version 9.2.
In 2013 ESRI announced plans to deprecate the ArcSDE command line tools and the ArcSDE application server following the forthcoming release of ArcGIS 10.2.
ArcSDE 10.1 and 10.2
with the release of 10.1, Esri sells ArcSDE as a component of ArcGIS Server - part of the ArcGIS family of software products which integrates geographic-information query, mapping, spatial analysis, and editing within a multi-user enterprise DBMS environment.
ArcSDE alternative tools
After 2010, there are some alternative tools for connecting ArcMap with DBMS Postgres, SQL Server.. such as ST-Links PgMap and Blue Spatial Server.
Functionality
ArcSDE enables organizations to move from a traditional approach — managing separate collections of geographic data files — to an integrated environment in which one can manage spatial data as a continuous database: accessible to the entire organization simultaneously and easily publishable on the Web. It stores spatial data using the Geodatabase data model and structure.
ArcSDE as an application server facilitates storing and managing spatial data (raster, vector, and survey)
in a DBMS and makes the data available to many applications. ArcSDE allows one to manage spatial data in any of four commercial databases (IBM Db2, Informix, Microsoft SQL Server and Oracle). Starting with the 9.3 release, Esri added support for the open-source PostgreSQL database.
ArcSDE serves data for the advanced ArcGIS Desktop products (ArcView, ArcEditor and ArcInfo); the ArcGIS development products (ArcGIS Engine and ArcGIS Server), ArcView 3.x as well as ArcIMS. It is a key component in managing a multi-user Esri-based GIS.
While traditional RDBMS software keeps track of the tables and records contained in the database, ArcSDE pushes the relational model higher so that client software can manage geographic data - which comprise several tables - seamlessly. The user need have no awar
|
https://en.wikipedia.org/wiki/Operation%20Neptune%20%28video%20game%29
|
Operation Neptune is an educational computer game produced in 1991 by The Learning Company. The goal of the game is to guide a small submarine through a variety of undersea caverns, collecting pieces of a ruined space capsule. Like other games by The Learning Company, Operation Neptune is educational and was intended for players age nine to fourteen (grades three through ten). It was released as part of the Super Solvers series for a time.
Plot
A team of astronauts and scientists have begun a secret research project on a distant planet. The research team's results were sent back to Earth on the "Galaxy space capsule", which malfunctioned, crashed into the ocean, and broke into many pieces. The capsule included several data canisters, each of which contains small snippets of the scientists' story, which is revealed to the player as the game progresses and data canisters are found. The capsule also contained some toxic chemicals, which have begun to leak out and threaten the health of the world's sea life. A recovery mission, code-named Operation Neptune, is sent to recover the pieces of the capsule.
Gameplay
The game consists of two campaigns, called Voyager Game and Expert Game; the player selects one when creating a new save file. In both campaigns, the player must complete sixteen levels, called Sectors, which are distributed across five Zones: Dragon Reef, Fossil Trench, Limestone Ridge, Sea Forest, and Hammerhead.
Piloting the Neptune
The game is action-oriented for the most part. In each Sector, the player's goal is to navigate a submarine (the Neptune) through maze-like passages, collect every data capsule, and reach the supply station at the end. The box cover illustration rendered by Marc Ericksen depicts the Neptune submarine recovery vehicle hovering above the basin of Fossil Trench recovering glowing toxic data capsules.
The levels are presented in a flip-screen fashion. Along the way the player will encounter various aggressive and/or territorial sea creatures, which usually move about the level and perform actions in predictable and repeating patterns, as well as non-living hazards like sharp rocks and undersea volcanoes. If the Neptune makes contact with an enemy or hazard, it will lose Oxygen.
The Neptune is capable of firing ink pellets to stun sea creatures and render them harmless to touch, in the manner of an octopus or squid. However, the functionality of ink pellets is limited; enemies stunned in this way will recover and resume their dangerous behavior after a few seconds. Furthermore, the ink pellets are fired in a straight line from the nose of the Neptune, so the player must carefully aim their shots at their intended targets. Finally, the player is limited to only 21 ink pellets per Sector, with no way to replenish their supply during the level. Thus, the player cannot rely on ink pellets to keep the Neptune out of danger, and should only use them in desperate situations. In the Final Sector of either campaign, ink
|
https://en.wikipedia.org/wiki/Dataindustrier%20AB
|
Dataindustrier AB (literal translation: computer industries shareholding company) or DIAB was a Swedish computer engineering and manufacturing firm, founded in 1970 by Lars Karlsson and active in the 1970s through 1990s. The company's first product was a board-based computer centered on a specific bus named Data Board 4680. This unit was used for automatic control in several Swedish industries as would be almost all of DIAB's computers. DIAB is mostly known for engineering the ABC 80, the first Swedish home computer, manufactured by Luxor AB.
They would subsequently develop all the ABC-models (ABC 800, ABC 1600 and ABC 9000) before rebranding their own make of the ABC 9000 as DIAB DS-90 and develop a series of Unix-compatible computers, using code licensed from AT&T Version 5 Unix release, but with a unique in-house kernel using the brand name DNIX. DIAB would continue to provide OEM services past Luxor AB, the most prominent probably being the entire Unix server product line from Cromemco.
The compiler technology developed by Tomas Evensen at DIAB was bought by Wind River Systems and was renamed to the "Wind River Compiler". Further information about the Wind River Compiler can be found at the Wind River Compiler product home page.
The Unix computer support and customers was acquired by Bull Computer in 1990 ending the history of the company.
Product line
Card-based microcomputers
1974: Data Board 4680 - the number is a short form of the three microprocessors supported by the bus of this system: Intel 4004, Motorola 6800 and Zilog Z80. Eventually only Z80 was ever used in this product.
Home and office computers
1977: 7S "Seven S" a combined monochrome terminal and computer built on the Data Board 4680 bus and a Z80 processor.
1978: ABC 80 a Z80-based monochrome home computer.
1983: ABC 800 an enhanced office and home computer, 32 KB RAM, also based on Z80, with color graphics.
1983: ABC 802 a variant of ABC 800 with 64 KB RAM whereof 32 KB were used as a RAM disk.
1983: ABC 806 a variant of ABC 800 with 160 KB RAM whereof 128 were used as a RAM disk.
Peripherals
1982: ABC 838 – 2× 8-inch 1 MB floppy drive
1982: ABC 830 – 2× 5.25-inch 160 kB floppy drive
1982: ABC 890 – 8× ABC-bus slot expansion
1982: ABC 815 – 14-inch monochrome screen
1983: ABC 812 – 14-inch colour screen
1983: ABC 850 – 10 MB hard disc and 640 kB floppy disc as well as 8× ABC-bus slots
1984: ABC 834 – 2× 5.25-inch 640 kB floppy drive, compact version. Introduction price at 12000 SEK.
1985: ABC 1656 – 40–80 MB hard disc and tape drive for backup
1985: ABC 1615 – 1024 × 768 pixel screen
ABC 820 – Compact Cassette storage (for ABC 80)
ABC 821 – Compact Cassette storage (for ABC 80, 800, 802)
ABC 22 – Function and numeric-only keyboard
ABC-55 – Keyboard
ABC-77 – Keyboard
ABC-99 – Keyboard
ABC R8 – Mouse
LUX-NET – 50 computer, 1000-meter range, 500 kbit/s, EIA-422 external networking adapter
UNIX computers
In 1983, DIAB independently developed the
|
https://en.wikipedia.org/wiki/List%20of%20railway%20lines%20in%20Finland
|
This is a list of railway lines on the Finnish rail network, including lists of stations on the most important lines. The lines and the stations are owned by the Finnish Transport Agency. VR Group has a monopoly on passenger transport. As of 2011, it is the only operator of freight trains as well even though freight transport is open for private companies.
Passenger lines
Line 1: Helsinki–Turku (Rantarata/Kustbanan)
Line 4: Helsinki–Pori
Helsinki Central
Pasila
Tikkurila
Riihimäki
Hämeenlinna
Toijala
Tampere
Nokia
Vammala
Kokemäki
Harjavalta
Pori
Line 5: Helsinki–Vaasa
Helsinki Central
Pasila
Tikkurila
Riihimäki
Hämeenlinna
Toijala
Tampere
Parkano
Seinäjoki
Ylistaro
Isokyrö
Tervajoki
Laihia
Vaasa
Line 7: Helsinki–Kemijärvi
Helsinki Central
Pasila
Tikkurila
Riihimäki
Hämeenlinna
Toijala
Tampere
Parkano
Seinäjoki
Lapua
Kauhava
Jakobstad-Pedersöre (formerly Bennäs)
Kokkola
Kannus
Ylivieska
Oulainen
Vihanti
Ruukki
Oulu
Kemi
Tervola
Muurola
Rovaniemi
Kemijärvi
Line 9: Turku–Pieksämäki
Turku Harbour
Turku Central
Loimaa
Humppila
Toijala
Tampere
Orivesi
Jämsä
Jyväskylä
Lievestuore
Hankasalmi
Pieksämäki
Line 10: Helsinki–Iisalmi
Helsinki Central
Pasila
Tikkurila
Mäntsälä
Lahti
Kouvola
Mäntyharju
Mikkeli
Haukivuori
Pieksämäki
Suonenjoki
Kuopio
Siilinjärvi
Lapinlahti
Iisalmi
Line 13: Helsinki–Kajaani
Helsinki Central
Pasila
Tikkurila
Lahti
Kouvola
Mäntyharju
Mikkeli
Pieksämäki
Suonenjoki
Kuopio
Siilinjärvi
Lapinlahti
Iisalmi
Sukeva
Kajaani
Line 14: Helsinki–Joensuu
Helsinki Central
Pasila
Tikkurila
Lahti
Kouvola
Lappeenranta
Joutseno
Imatra
Simpele
Parikkala
Kesälahti
Kitee
Joensuu
Line 15: Kouvola–Kotka
Kouvola
Myllykoski
Inkeroinen
Tavastila
Kymi
Kyminlinna
Paimenportti
Kotka (central)
Kotka Harbour
Line 16: Savonlinna–Parikkala
Savonlinna (old, closed)
Savonlinna (current)
Pääskylahti
Kerimäki
Retretti
Lusto
Punkaharju
Putikko (closed)
Kultakivi (closed)
Särkisalmi (closed)
Parikkala
International line A: Helsinki–Moscow
Helsinki Central
Pasila
Tikkurila
Lahti
Kouvola
Vainikkala
Vyborg
St Petersburg Finland terminal
St Petersburg Ladozhsky terminal
Tver
Moscow Leningradsky terminal
Other lines
Line 2: Karis–Hanko (Hanko–Hyvinkää railway)
Line 3: Helsinki–Tampere
Line 6: Helsinki–Tampere–Seinäjoki–Oulu–Kolari (Tampere-Seinäjoki railway, Seinäjoki–Oulu railway, Oulu–Tornio railway and Kolari railway)
Line 7: Helsinki–Tampere–Seinäjoki–Oulu–Kemijärvi
Line 7A: Kemijärvi–Rovaniemi
Line 9: Turku–Tampere–Jyväskylä–Joensuu
Line 11: Tampere–Haapamäki–Seinäjoki
Line 12: Helsinki–Kotka
Line 13: Helsinki–Kuopio–Oulu
Line 14A: Joensuu–Nurmes
Line 14A: Oulu–Kajaani (Oulu–Kontiomäki railway)
Line 18: Iisalmi–Ylivieska
See also: Lapponia (train)
Future lines
Arctic Railway
Helsinki City Rail Loop
Helsinki–Turku high-speed railway
Itärata
Lentorata
References
Literature
External links
Fin
|
https://en.wikipedia.org/wiki/HFT
|
HFT may refer to:
Hammerfest Airport, in Norway
Harbor Freight Tools, an American retailer
High-flow therapy, a method of delivering respiratory gases
High-frequency trading, type of algorithmic trading
Hoh Fuk Tong stop (MTR station code), in Hong Kong
Human Friendly Transmission, a motorcycle transmission
Hunter Field Target, a target shooting sport
hft a learning disability charity in the United Kingdom
Hardware Fault Tolerance in IEC 61508
Himalayan Frontal Thrust, a geologic fault
|
https://en.wikipedia.org/wiki/Silent%20Steel
|
Silent Steel is a 1995 submarine simulator computer game by Tsunami Games. It was created during the influx of interactive movies during the 1990s. The game is composed almost entirely of live-action full motion video, with sparse computer-generated graphics depicting external shots of the boat during torpedo attacks and atmospheric fly-bys. A version playable on DVD players was released in 1999, following from a DVD-ROM version in 1997. The DVD-ROM version was the first video game formatted for DVD.
A sequel, Silent Steel 2, was announced by Tsunami for release in 1997, but it was cancelled.
Gameplay
The gameplay consists of choosing from three options when the video pauses at certain points. Once the player chooses, the video resumes. This creates several possible plotlines and outcomes. Most of these result in the destruction of the player's submarine; only two distinct threads lead to victory.
Plot
The player commands USS Idaho, a fictional Ohio-class ballistic missile submarine. On a routine nuclear deterrence patrol, an encoded message is received from U.S. COMSUBLANT. The message reports that a stolen Libyan diesel sub has exited the Mediterranean Sea, possibly heading into Idahos area of operations. Idaho must evade the potentially hostile submarine, a problem that is quickly complicated by the fact that the enemy submarine is equipped with sound-generating equipment that allows her to mimic other classes of submarine, including those of American design. The rogue Kilo uses this tactic to launch a torpedo attack on the Idaho by pretending to be an allied Los Angeles-class sub, USS Biloxi.
After escaping the initial battle, a radio consultation with an American carrier battle group commander confirms that there are no other allied submarines operating in the area, and that a second hostile sub, a Russian Akula-class attack boat that has also gone rogue, is approaching the area. In addition to this, Idaho'''s sonar officer notices that Idaho seems to be emitting a low-frequency sonar signal that he cannot account for.
After a conference with Idahos executive officer and master chief, further engagements commence, where Idaho eventually triumphs through subterfuge and risk-taking. Taking advantage of the lull in combat before the Akula-class submarine comes into torpedo range, a search of Idahos outer hull reveals an act of sabotage instigated by one of the crew working for the enemy.
Engaging the Akula in a torpedo battle, Idaho'' gains the upper hand by the timely interference of an American ASW helicopter tracking the battle and manages to win the fight.
The game was directed by Tony Marks and the script was written by Chuck Pfarrer.
Production
Shooting locations
All sound stage studio filming was conducted in a modified warehouse on the former Charleston Naval Shipyard in North Charleston, South Carolina. All submarine and ship footage was shot aboard USS Clamagore (SS-343) submarine and USS Laffey (DD-724) destroyer which are b
|
https://en.wikipedia.org/wiki/English%20in%20computing
|
The English language is sometimes described as the lingua franca of computing. In comparison to other sciences, where Latin and Greek are often the principal sources of vocabulary, computer science borrows more extensively from English. In the past, due to the technical limitations of early computers, and the lack of international standardization on the Internet, computer users were limited to using English and the Latin alphabet. However, this historical limitation is less present today, due to innovations in internet infrastructure and increases in computer speed. Most software products are localized in numerous languages and the invention of the Unicode character encoding has resolved problems with non-Latin alphabets. Some limitations have only been changed recently, such as with domain names, which previously allowed only ASCII characters.
English is seen as having this role due to the prominence of the United States and the United Kingdom, both English-speaking countries, in the development and popularization of computer systems, computer networks, software and information technology.
History
Computer Science has an ultimately mathematical foundation which was laid by non-English speaking cultures. The first mathematically literate societies in the Ancient Near East recorded methods for solving mathematical problems in steps, The word 'algorithm' comes from the name of a famous medieval Arabic mathematician who contributed to the spread of Hindu-Arabic numerals, al-Khwārizmī, and the first systematic treatment of binary numbers was completed by Leibniz, a German mathematician. Leibniz wrote his treatise on the topic in French, the lingua franca of science at the time, and innovations in what is now called Computer hardware occurred outside of an English tradition, with Pascal inventing the first mechanical calculator, and Leibniz improving it.
Interest in building computing machines first emerged in the 19th century, with the coming of the Second Industrial Revolution. The origins of Computing in an English tradition began in this era with Charles Babbage's conceptualization of the Difference and Analytical Engine, George Boole's work on logic, and Herman Hollerith's invention of the tabulating machine for specific use in the 1890 United States census. At the time, Britain enjoyed near complete hegemonic power in the West at the height of the Pax Britannica, and America was experiencing an economic and demographic boom. By the time of the interwar period in the early 20th century, the most important mathematics related to the development of computing were being done in English, which was also beginning to become the new lingua franca of science.
Influence on other languages
The computing terminology of many languages borrows from English. Some language communities actively resist this trend, and in other cases English is used extensively and more directly. This section gives some examples of the use of English loans in other languages a
|
https://en.wikipedia.org/wiki/XNUMBERS
|
XNUMBERS is a multi-precision floating point computing and numerical methods library for Microsoft Excel. Xnumbers claims to be an open source Excel addin (xla), the license however is not an open source license. XNUMBERS performs multi-precision floating point arithmetic from 15 up to 200 significant digits. The version 5.6 as of 2008 is compatible with Excel 2003/XP and consists of a set of more than 300 functions for arithmetic, complex, trigonometric, logarithm, exponential calculus. The Foxes team members (around Leonardo Volpi) stopped their development efforts in 2008. Recently, an American astronomer had his brother John Beyers make the Italian versions compatible to recent versions of Microsoft Excel/Windows/VisualBasic. Several forked versions are made available in the last section of the astronomer's homepage, entitled "Downloads and links".
Screenshots
External links
XNUMBERS 6.0.5.6 for Excel - John Beyers, last update 11 Dec 2013
XNUMBERS 5.6 for Excel - Foxes Team
Microsoft Office
|
https://en.wikipedia.org/wiki/National%20Archive%20of%20Computerized%20Data%20on%20Aging
|
The National Archive of Computerized Data on Aging (NACDA), located within ICPSR, is funded by the National Institute on Aging (NIA). NACDA's mission is to advance research on aging by helping researchers to profit from the under-exploited potential of a broad range of datasets.
NACDA acquires and preserves data relevant to gerontological research, processing as needed to promote effective research use, disseminates them to researchers, and facilitates their use. By preserving and making available the largest library of electronic data on aging in the United States, NACDA offers opportunities for secondary analysis on major issues of scientific and policy relevance.
Description
A program within the Inter-university Consortium for Political and Social Research (ICPSR) at the University of Michigan. The NACDA collection consists of over sixteen hundred datasets relevant to gerontological research and represents the world's largest collection of publicly available research data on the aging lifecourse.
History
The NACDA Program on Aging began over 45 years ago under the sponsorship of the United States Administration on Aging (AoA). At that time NACDA was seen as a novel experiment - neither the concept of a research archive devoted to aging issues nor the idea of making research data freely available to the public were well established. Over the years, NACDA’s mission has changed both in scope and in direction. Originally conceived as a storehouse for data, NACDA has aggressively pursued a role of increasing involvement in the research community by actively promoting and distributing data. In 1984, the NIA became the sponsor of the National Archive of Computerized Data on Aging, and NACDA has flourished under its support. Over the years, NACDA has evolved and grown in response to changes in technology. In many instances, leading the pace of change in methodology related to the storage, protection, and distribution of data.
NACDA was one of the first organizations to develop and release studies on CD-ROM. NACDA was also one of the first archives to experiment with the idea of offering electronic research data as a public good, free to all interested individuals at no charge. The initial collection of 28 public use datasets first offered on the internet in 1992 has now expanded to over 1,600 datasets that are freely available to any researcher. The entire collection is stored online at the NACDA website, offering immediate access to gerontological researchers.
See also
National Institute on Aging (NIA)
United States Administration on Aging (AoA)
National Health and Nutrition Examination Survey
External links
NACDA
ICPSR
Databases in the United States
Gerontology
|
https://en.wikipedia.org/wiki/The%20Fourth%20Horseman%20%28Millennium%29
|
"The Fourth Horseman" is the twenty-second episode of the second season of the American crime-thriller television series Millennium. It premiered on the Fox network on May 8, 1998. The episode was written by Glen Morgan and James Wong, and directed by Dwight Little. "The Fourth Horseman" featured guest appearances by Kristen Cloke and Glenn Morshower.
In this episode, offender profiler Frank Black (Lance Henriksen) investigates the initial outbreak of a deadly virus, and discovers that his employers, the Millennium Group may pose a danger to his safety.
"The Fourth Horseman" was written under the belief that the series would soon be cancelled, and inspired in part by the outbreak of bovine spongiform encephalopathy in the United Kingdom. The episode has earned positive responses from critics, and was seen by approximately 4.61 million households during its initial broadcast.
Plot
On a farm in Baraboo, Wisconsin in 1986, a farmer finds his entire warehouse of chickens dead, the floor soaked in blood. He attempts to call for help, but quickly collapses, bleeding profusely and covered in dark lesions.
Twelve years later, Millennium Group member Frank Black (Lance Henriksen) is visited by a retired FBI agent, Richard Gilbert (Glenn Morshower). Gilbert hopes to headhunt Black, a former colleague, for his new private security firm, The Trust. Their meeting abruptly ends when Black receives word that his father has died. At the funeral, Black explains the notion of death to his daughter Jordan (Brittany Tiplady); later that day, he unsuccessfully tries to contact fellow Group member Lara Means (Kristen Cloke), with whom he has lost contact.
Black meets with another Group member, Peter Watts (Terry O'Quinn) to investigate the death of Jason Mogilny, who was found at a riverbank surrounded by six pints of spilt blood, with no evidence of murder. Black notices dead birds floating past in the river. A coroner determines that Mogilny drowned when his lungs filled with his own blood, surmising the cause to be a viral infection. Everyone who came into contact with the corpse is isolated in quarantine, waiting to be tested for exposure to any pathogen. While quarantined, Black accuses Watts and the Millennium Group of knowing more about the virus than is apparent; Watts frantically quotes the Bible's Book of Revelation in response. The pair are examined by mysterious doctors in protective suits; shortly afterwards, they are cleared to leave quarantine. Black contacts Gilbert and accepts his offer to join The Trust; however, he first wishes to "rescue" his friends within the Group and asks for Gilbert's help in locating Means.
In El Cajon, California, a family sit down to dinner for Mother's Day, before spontaneously collapsing and bleeding profusely. At home, Black's wife Catherine (Megan Gallagher) tells him that Jordan has been having vivid nightmares about the end of the world, in which she and her parents are isolated in a woodland cabin. Black admi
|
https://en.wikipedia.org/wiki/Company%20of%20Heroes%20%28video%20game%29
|
Company of Heroes is a 2006 real-time strategy video game developed by Relic Entertainment and published by THQ for Windows and OS X operating systems. It is the first installment of the Company of Heroes series, and was the first title to make use of the Games for Windows label.
Company of Heroes is set during the Second World War and contains two playable factions. Players aim to capture strategic resource sectors located around the map, which they use to build base structures, produce new units, and defeat their enemies. In the single-player campaign the player commands two U.S. military units during the Battle of Normandy (Operation Overlord) and the liberation of France (Operation Cobra). Depending on the mission, the player controls either Able Company of the 29th Infantry Division's 116th Infantry, or Fox Company of the 101st Airborne Division's 506th PIR.
Company of Heroes received widespread acclaim, winning multiple awards for the best strategy game of the year, and being considered one of the best video games ever made. Two expansions were released: Opposing Fronts in 2007 and Tales of Valor in 2009. A free-to-play massively multiplayer online version of the game, Company of Heroes Online, was briefly released as open beta in South Korea in April 2010, before being cancelled in March 2011.
An iPad version, developed and published by Feral Interactive, was released in February 2020. A version for Android and iOS mobile devices was released in September 2020. An Nintendo Switch version was released in October 12, 2023.
The success of the game led to a sequel, Company of Heroes 2, which was released in 2013. , the Company of Heroes series has sold more than 4 million copies. A film adaptation, also titled Company of Heroes, was released in 2013. The latest installment in the series, Company of Heroes 3, released in February 2023.
Gameplay
Multiplayer
Company of Heroes allows multiplayer matches of 1-8 players via LAN or the Internet. Company of Heroes allows players to fight as both the Allied and Axis forces in multiplayer matches.
For Company of Heroes, developer Relic Entertainment used a new online matchmaking system called Relic Online. Previous Relic games had used GameSpy Arcade or World Opponent Network services. This system includes many features that the previous systems did not have, including a built in automatch and ranking system.
Relic Online matchmaking has been shut down. In order to play multiplayer users must transfer the game to Steam. The Steam version does not allow for LAN matches.
Game modes
Victory Point Control
These games focus on controlling several victory points around the middle of the map. These victory points can be captured similarly to strategic points. When one side has more victory points under their control than another, the other side's "points" start to decrease. When one side's counter runs out of points, they lose. Alternatively, the player can simply destroy all enemy structures to win
|
https://en.wikipedia.org/wiki/Graphplan
|
Graphplan is an algorithm for automated planning developed by Avrim Blum and Merrick Furst in 1995. Graphplan takes as input a planning problem expressed in STRIPS and produces, if one is possible, a sequence of operations for reaching a goal state.
The name graphplan is due to the use of a novel planning graph, to reduce the amount of search needed to find the solution from straightforward exploration of the state space graph.
In the state space graph:
the nodes are possible states,
and the edges indicate reachability through a certain action.
On the contrary, in Graphplan's planning graph:
the nodes are actions and atomic facts, arranged into alternate levels,
and the edges are of two kinds:
from an atomic fact to the actions for which it is a condition,
from an action to the atomic facts it makes true or false.
the first level contains true atomic facts identifying the initial state.
Lists of incompatible facts that cannot be true at the same time and incompatible actions that cannot be executed together are also maintained.
The algorithm then iteratively extends the planning graph, proving that there are no solutions of length l-1 before looking for plans of length l by backward chaining: supposing the goals are true, Graphplan looks for the actions and previous states from which the goals can be reached, pruning as many of them as possible thanks to incompatibility information.
A closely related approach to planning is the Planning as Satisfiability (Satplan). Both reduce the automated planning problem to search for plans of different fixed horizon lengths.
References
A. Blum and M. Furst (1997). Fast planning through planning graph analysis. Artificial intelligence. 90:281-300.
External links
Avrim Blum's Graphplan home page
PLPLAN: A Java GraphPlan Implementation
NPlanner: A .NET GraphPlan Implementation
Emplan and JavaGP: C++ and Java implementations of Graphplan
MIT OpenCourseWare lecture on GraphPlan and making planning graphs
Automated planning and scheduling
Search algorithms
|
https://en.wikipedia.org/wiki/Static%20timing%20analysis
|
Static timing analysis (STA) is a simulation method of computing the expected timing of a synchronous digital circuit without requiring a simulation of the full circuit.
High-performance integrated circuits have traditionally been characterized by the clock frequency at which they operate. Measuring the ability of a circuit to operate at the specified speed requires an ability to measure, during the design process, its delay at numerous steps. Moreover, delay calculation must be incorporated into the inner loop of timing optimizers at various phases of design, such as logic synthesis, layout (placement and routing), and in in-place optimizations performed late in the design cycle. While such timing measurements can theoretically be performed using a rigorous circuit simulation, such an approach is liable to be too slow to be practical. Static timing analysis plays a vital role in facilitating the fast and reasonably accurate measurement of circuit timing. The speedup comes from the use of simplified timing models and by mostly ignoring logical interactions in circuits. This has become a mainstay of design over the last few decades.
One of the earliest descriptions of a static timing approach was based on the Program Evaluation and Review Technique (PERT), in 1966. More modern versions and algorithms appeared in the early 1980s.
Purpose
In a synchronous digital system, data is supposed to move in lockstep, advancing one stage on each tick of the clock signal. This is enforced by synchronizing elements such as flip-flops or latches, which copy their input to their output when instructed to do so by the clock. Only two kinds of timing errors are possible in such a system:
A Max time violation, when a signal arrives too late, and misses the time when it should advance. These are more commonly known as setup violations/checks which actually are a subset of max time violations involving a cycle shift on synchronous paths.
A Min time violation, when an input signal changes too soon after the clock's active transition. These are more commonly known as hold violations/checks which actually are a subset of min time violations in synchronous path.
The time when a signal arrives can vary due to many reasons. The input data may vary, the circuit may perform different operations, the temperature and voltage may change, and there are manufacturing differences in the exact construction of each part. The main goal of static timing analysis is to verify that despite these possible variations, all signals will arrive neither too early nor too late, and hence proper circuit operation can be assured.
Since STA is capable of verifying every path, it can detect other problems like glitches, slow paths and clock skew.
Definitions
The critical path is defined as the path between an input and an output with the maximum delay. Once the circuit timing has been computed by one of the techniques listed below, the critical path can easily be found by using a tracebac
|
https://en.wikipedia.org/wiki/Digital%20signage
|
Digital signage is a segment of electronic signage. Digital displays use technologies such as LCD, LED, projection and e-paper to display digital images, video, web pages, weather data, restaurant menus, or text. They can be found in public spaces, transportation systems, museums, stadiums, retail stores, hotels, restaurants and corporate buildings etc., to provide wayfinding, exhibitions, marketing and outdoor advertising. They are used as a network of electronic displays that are centrally managed and individually addressable for the display of text, animated or video messages for advertising, information, entertainment and merchandising to targeted audiences.
Roles and function
The many different uses of digital signage allow a business to accomplish a variety of goals. Some of the most common applications include:
Public information – news, weather, traffic and local (location specific) information, such as building directory with a map, fire exits and traveler information.
Internal information - corporate messages, such as health & safety items, news and so forth.
Product information – pricing, photos, raw materials or ingredients, suggested applications and other product information - especially useful in food marketing where signage may include nutritional facts or suggested uses or recipes.
Information to enhance the customer service experience - interpretive signage in museums, galleries, zoos, parks and gardens, exhibitions, tourist and cultural attractions.
Advertising and Promotion – promoting products or services, may be related to the location of the sign or using the screen's audience reach for general advertising.
Brand building – in-store digital sign to promote the brand and build a brand identity.
Influencing customer behavior – navigation, directing customers to different areas, increasing the "dwell time" on the store premises and a wide range of other uses in service of such influence.
Influencing product or brand decision-making - Signage at the point of sale designed to influence choice e.g. Signage to help shoppers to choose dresses inside a fashion store or devices that on a computerized shopping trolley helping the customer locate products, check prices, access product information and manage shopping lists.
Enhancing customer experience – applications include the reduction of perceived wait time in the waiting areas of restaurants and other retail operations, bank queues, and similar circumstances, as well as demonstrations, such as those of recipes in food stores, among other examples.
Navigation – with interactive screens (in the floor, for example, as with "informational footsteps" found in some tourist attractions, museums and the like) or with other means of "dynamic wayfinding".
Reservations – small, interactive screens on walls or desks that allow employees to reserve the space for a limited time and integrate with a room and resource scheduling platform.
Industry overview
Over 200 different companies world
|
https://en.wikipedia.org/wiki/Farid%20Essebar
|
Farid Essebar () (born in 1987, known as Diabl0) is a Moroccan black hat hacker. He was one of the two people (along with Turk Atilla Ekici) behind the spread of the Zotob computer worm that targeted Windows 2000 operating systems in 2005. Among the affected were CNN, ABC News, The New York Times, Caterpillar, United Parcel Service, Boeing and also the United States Department of Homeland Security.
Microsoft used 50 investigators and had put a $250,000 reward for the capture of the hacker(s). Microsoft's General counsel declared on August 26, 2005 that "The fact that we were able to see these arrests in less than two weeks and see them halfway around the world really drives that point home."
Essebar is a Russian citizen, also.
Arrest
Intentions
It is believed that his intention was to facilitate credit card forgery scams. The FBI believes that Atilla Ekici paid Farid Essebar to code the worm.
Other accusations
In July 2006, investigators stated that Essebar may have authored more than 20 viruses.
2014 Arrest
On 17 March 2014, Essebar was arrested in Thailand after a 2-year investigation by Thai police. The investigation was triggered by a complaint from Swiss authorities over an alleged infiltration of a Swiss bank that caused dozens of billions of dollars' damage.
Trial
On September 15, 2006, a Moroccan court sentenced Essebar to two years of prison. It was reduced to a year on December 15, 2006.
Notes
1987 births
Living people
Computer criminals
21st-century Moroccan criminals
|
https://en.wikipedia.org/wiki/Technology%20evangelist
|
A technology evangelist is a person who builds a critical mass of support for a given technology, and then establishes it as a technical standard in a market that is subject to network effects. The word evangelism is borrowed from the context of religious evangelism due to the similarity of sharing information about a particular concept with the intention of having others adopt that concept. This is typically accomplished by showcasing the potential uses and benefits of a technology to help others understand how they can use it for themselves.
Target areas
Platform evangelism is one target of technology evangelism, in which the vendor of a two-sided platform attempts to accelerate the production of complementary goods by independent developers (e.g., during its early years, Facebook worked on creating an ecosystem of 3rd party developers, encouraging them to create games or develop mobile apps that could enhance users' experiences with Facebook).
Professional technology evangelists are often employed by firms seeking to establish their technologies as de facto standards. Their work could also entail the training of personnel, including top managers so that they acquire skills and competencies necessary to adopt new technology or new technological initiative. There are even instances when technology evangelism becomes an aspect of a managerial position.
Open-source evangelists, on the other hand, operate independently. Evangelists also participate in defining open standards. Non-professional technology evangelists may act out of altruism or self-interest (e.g., to gain the benefits of early adoption or network effect).
History of term
In Christianity, the word evangelist comes from the Koine Greek word εὐαγγέλιον (transliterated as euangelion) via Latinised evangelium as used in the canonical titles of the Four Gospels, authored by (or attributed to) Matthew, Mark, Luke, and John (also known as the Four Evangelists). The concept that sharing particular established standards to help others to adopt them is similar in the technology-related field.
The term "software evangelist" was coined by Mike Murray of Apple Computer's Macintosh computer division in the early 1980s. It was part of Apple's drive to compete with IBM and it specifically described the initiative to win over third-party developers rhetorically to persuade them to develop software and applications for the Macintosh platform. In Guy Kawasaki's own words, it meant "using fervor and zeal (but never money) to convince software developers to create products for a computer with no installed base, 128K of RAM, no hard disk, no documentation, and no technical support, made by a flaky company that IBM was about to snuff out." The first so-identified technology evangelist was Mike Boich — who promoted the Macintosh computer. The job is often closely related to both sales and training but requires specific technology marketing skills. For example, convincing a potential buyer or user to ch
|
https://en.wikipedia.org/wiki/Bart%27s%20Girlfriend
|
"Bart's Girlfriend" is the seventh episode of the sixth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on November 6, 1994. The plot of the episode follows the secret romance of Bart and Jessica Lovejoy, Reverend Lovejoy's daughter. Bart tries to end the romance when he discovers that, behind her innocent façade as a preacher's kid, she is an even bigger troublemaker than he is. Jessica then steals the money from the church collection plate, leaving Bart to take the blame until Lisa exposes the truth.
The episode was written by Jonathan Collier and directed by Susie Dietter. Show runner David Mirkin originally came up with the idea of Bart having a girlfriend that was more evil than he was. Meryl Streep guest stars in the episode as Jessica Lovejoy. It features cultural references to films such as Planet of the Apes and The Silence of the Lambs.
Since airing, the episode has received acclaim from both critics and fans, and Entertainment Weekly named Meryl Streep's role as one of the best guest appearances on The Simpsons.
Plot
During a church sermon, Bart falls in love with Reverend Lovejoy's daughter, Jessica. When he approaches her to praise her sermon, she ignores him. Bart attends Sunday school the next week to convince Jessica that he is a saint, but she still ignores him. Frustrated, Bart plays a prank on Groundskeeper Willie and is punished with detention. Jessica expresses sympathy for Bart and invites him to her house for dinner.
During dinner with the Lovejoys, Bart's crude manner and foul language cause Reverend Lovejoy to forbid him from ever seeing Jessica again. She and Bart secretly date, bonding over their shared love of mischief while vandalizing the town. When Bart realizes that Jessica is more badly behaved than he is, he tries to reform her at the next church service. Undeterred, Jessica empties the money from the collection plate into her purse and abruptly leaves after forcing the empty plate into Bart's lap. The congregation mistakenly believes that Bart took the money when Helen Lovejoy calls their attention to the empty plate.
Homer assumes Bart is guilty, but Marge believes he is innocent. Reluctant to implicate Jessica, Bart visits her the next day and admits he does not like her after she refuses to confess. Upon learning the truth, Lisa is determined not to allow her brother to be blamed for something he did not do. After unsuccessfully attempting to convince Jessica to confess, Lisa tells the congregation that Jessica is the guilty party. The townspeople search Jessica's room and find the money hidden under her bed. After Reverend Lovejoy expresses shock at her actions, Jessica reminds him of her past incidents, which he willingly ignores. Jessica is punished by being forced to scrub the church steps, and Bart receives an apology from the congregation.
Later, Bart approaches Jessica at church and tells her what lesson he has learned. J
|
https://en.wikipedia.org/wiki/Telephone%20and%20Data%20Systems
|
Telephone and Data Systems, Inc. is a Chicago-based telecommunications service company providing wireless products and services; cable and wireline broadband, TV and voice services; and hosted and managed services to approximately 6 million customers nationwide through its business units TDS Telecom and U.S. Cellular () and OneNeck IT Solutions.
The company began as a rural phone company in Wisconsin in 1969. In 1983 it founded U.S. Cellular as a subsidiary. In 2001, it acquired Straus Printing Company and combined it with a previously acquired printing company, Suttle Press, to form Suttle-Straus as another subsidiary.
LeRoy T. Carlson, the founder of TDS, died in May 2016 at the age of 100.
References
External links
Telephone and Data Systems, Inc. website
Telecommunications companies of the United States
Telephony
Companies based in Chicago
Telecommunications companies established in 1969
Companies listed on the New York Stock Exchange
|
https://en.wikipedia.org/wiki/Synthetic%20intelligence
|
Synthetic intelligence (SI) is an alternative/opposite term for artificial intelligence emphasizing that the intelligence of machines need not be an imitation or in any way artificial; it can be a genuine form of intelligence. John Haugeland proposes an analogy with simulated diamonds and synthetic diamonds—only the synthetic diamond is truly a diamond. Synthetic means that which is produced by synthesis, combining parts to form a whole; colloquially, a human-made version of that which has arisen naturally. A "synthetic intelligence" would therefore be or appear human-made, but not a simulation.
Definition
The term was used by Haugeland in 1986 to describe artificial intelligence research up to that point, which he called "good old fashioned artificial intelligence" or "GOFAI". AI's first generation of researchers firmly believed their techniques would lead to real, human-like intelligence in machines. After the first AI winter, many AI researchers shifted their focus from artificial general intelligence to finding solutions for specific individual problems, such as machine learning, an approach to which some popular sources refer as "weak AI" or "applied AI."
The term "synthetic AI" is now sometimes used by researchers in the field to separate their work (using subsymbolism, emergence, Psi-Theory, or other relatively new methods to define and create "true" intelligence) from previous attempts, particularly those of GOFAI or weak AI.
Sources disagree about exactly what constitutes "real" intelligence as opposed to "simulated" intelligence and therefore whether there is a meaningful distinction between artificial intelligence and synthetic intelligence. Russell and Norvig present this example:
"Can machines fly?" The answer is yes, because airplanes fly.
"Can machines swim?" The answer is no, because submarines don't swim.
"Can machines think?" Is this question like the first, or like the second?
Drew McDermott firmly believes that "thinking" should be construed like "flying". While discussing the electronic chess champion Deep Blue, he argues "Saying Deep Blue doesn't really think about chess is like saying an airplane doesn't really fly because it doesn't flap its wings." Edsger Dijkstra agrees that some find "the question whether machines can think as relevant as the question whether submarines can swim."
John Searle, on the other hand, suggests that a thinking machine is, at best, a simulation, and writes "No one supposes that computer simulations of a five-alarm fire will burn the neighborhood down or that a computer simulation of a rainstorm will leave us all drenched." The essential difference between a simulated mind and a real mind is one of the key points of his Chinese room argument.
Daniel Dennett believes that this is basically a disagreement about semantics, peripheral to the central questions of the philosophy of artificial intelligence. He notes that even a chemically perfect imitation of a Chateau Latour is still a fake,
|
https://en.wikipedia.org/wiki/KCPW-FM
|
KCPW-FM (88.3 MHz) is a public radio station in Salt Lake City, Utah. It airs local news and music programming, as well as network shows from American Public Media, Public Radio International, the Canadian Broadcasting Corporation and the BBC. It broadcasts from studios at the Salt Lake City Public Library in Downtown Salt Lake City at Library Square.
KCPW-FM is owned by Wasatch Public Media. Its previous transmitter was located atop the Wells Fargo Center in downtown Salt Lake City for much of its history. It is currently located in the Oquirrh Mountains Range southwest of West Valley City. The 88.3 FM frequency does not broadcast in stereo audio, to improve reception in marginal signal areas. Due to other stations on 88.3 FM and adjacent frequencies in nearby cities, KCPW-FM has an effective radiated power of 450 watts. It cannot use as much power as most of the other Salt Lake City FM stations.
History
On August 9, 1991, Community Wireless of Park City, Inc., received a construction permit to build a new FM non-commercial station in Salt Lake City from the Federal Communications Commission. The FCC assigned it the call sign KBQA. Community Wireless already had an FM station on 91.9 MHz in Park City, Utah, a ski resort community about 50 miles east of Salt Lake City. It later added other stations around Utah simulcasting its programming. On November 1, 1992, the Salt Lake City station officially signed on the air, with the new call letters KCPW-FM.
In 2005, Community Wireless acquired an AM radio station licensed to Tooele, Utah, at 1010 kHz, which also took the call sign KCPW. The AM station is powered in the daytime at 50,000 watts, giving the station a much wider coverage area. But in January 2008, Community Wireless decided to sell the 1010 AM frequency. Programming was switched to airing the BBC World Service around the clock until a Catholic organization agreed to acquire the station for religious programming.
On March 28, 2008, Wasatch Public Media signed a letter of intent to purchase KCPW-FM. A sales contract was signed in June 2008. Had this not occurred, KCPW-FM would have instead been sold to the Educational Media Foundation for a national Christian contemporary format. KCPW's AM 1010 facility was separately sold to Immaculate Heart Radio. It became KIHU that August.
KCPW-FM ended its longtime National Public Radio (NPR) membership on June 24, 2013, allowing the station to reduce expenses as well as decrease duplication with the area's primary NPR network affiliate, 90.1 KUER-FM. KCPW continues to carry national programming supplied by Public Radio International, American Public Media, the Canadian Broadcasting Corporation and the BBC. The station also continues to produce its local programming. In June 2014, the station announced that it would need to raise $42,000 by July 3 in order to pay for its American Public Media programming; if the goal was not met, KCPW would have closed down and the money donated durin
|
https://en.wikipedia.org/wiki/DCE/RPC
|
DCE/RPC, short for "Distributed Computing Environment / Remote Procedure Calls", is the remote procedure call system developed for the Distributed Computing Environment (DCE). This system allows programmers to write distributed software as if it were all working on the same computer, without having to worry about the underlying network code.
History
DCE/RPC was commissioned by the Open Software Foundation in a "Request for Technology" (1993 David Chappell). One of the key companies that contributed was Apollo Computer, who brought in NCA - "Network Computing Architecture" which became Network Computing System (NCS) and then a major part of DCE/RPC itself. The naming convention for transports that can be designed (as architectural plugins) and then made available to DCE/RPC echoes these origins, e.g. ncacn_np (SMB Named Pipes transport); ncacn_tcp (DCE/RPC over TCP/IP) and ncacn_http to name a small number.
DCE/RPC's history is such that it's sometimes cited as an example of design by committee. It is also frequently noted for its complexity, however this complexity is often a result of features that target large distributed systems and which are often unmatched by more recent RPC implementations such as SOAP.
Software license
Previously, the DCE source was only available under a proprietary license. As of January 12, 2005, it is available under a recognized open source license (LGPL), which permits a broader community to work on the source to expand its features and keep it current. The source may be downloaded over the web. The release consists of about 100 ".tar.gz" files that take up 170 Megabytes. (Note that they include the PostScript of all the documentation, for example.)
The Open Group has stated it will work with the DCE community to make DCE available to the open source development community, as well as continuing to offer the source through The Open Group’s web site.
DCE/RPC's reference implementation (version 1.1) was previously available under the BSD-compatible (Free Software) OSF/1.0 license, and is still available for at least Solaris, AIX and VMS.
DCE is also still available under the previous non open-source license terms from the Open Group website.
Uses
It was used in the UK's National Insurance Recording System (NIRS/2).
It is used by:
Pennsylvania State University's student information portal, eLion
the older version of HP OpenView Operations for Unix/Windows Agents
Microsoft Exchange/Outlook (MAPI/RPC)
Call of Duty: Modern Warfare 2 for Multiplayer lobbies, making small clouds to decide on a host or lobby migration.
Alternate versions and implementations
FreeDCE is the DCE 1.1 reference implementation ported to Linux, supports 64-bit platforms, and is autoconf'd to make porting to further platforms much easier: a Win32 port is underway.
Entegrity Solutions licensed the OSF's entire DCE 1.2.2 source code and ported it to Win32, creating a product called PC/DCE - see https://web.archive.org/web/2006010
|
https://en.wikipedia.org/wiki/DCEThreads
|
DCEThreads is an implementation of POSIX Draft 4 threads. DCE Stands for "Distributed Computing Environment" DCEThreads allowed users to create multiple avenues of execution in a single process. It is based on pthreads interface.
History
DCE/RPC was under development, but the POSIX committee had not finalised POSIX threads at the time. The Open Group had to make a decision about which to use, and the final POSIX threads were different from their selection.
POSIX Draft 4 threads were limited to begin with (the final standard fixed these). Microsoft adopted DCE/RPC wholesale in Windows NT as MSRPC and also in DCOM. Most of the stability and reliability problems that programmers associate with DCOM services - especially memory leaks, exception handling problems and thread cancellation stability issues - can be traced back to the use of POSIX Draft 4 threads.
DCE/RPC is sufficiently complex that the issue of updating it to solve and modernise the POSIX Draft 4 threading problem requires highly skilled and highly specific programming knowledge. Consequently, despite its capacities, the reference implementation of DCE/RPC has been held up due to a lack of information and resources.
The key difference between POSIX Draft 4 threads and the final POSIX threads specification, aside from a number of functions being interruptible where others are not, is thread cancellation. DCE/RPC utilises thread cancellation to propagate signals across the "Remote" of RPC, such that for example a client application terminating a thread results in its corresponding thread on the server also being terminated in the same way. The final POSIX specification does not include such sophisticated cancellation methodology, and, given the difficulties that the Unix vendors had in correctly implementing the POSIX threads specification, it was removed.
Recent developments
Linux, since the introduction of NPTL and the Linux 2.6 kernel, has proper support for thread cancellation.
Current use
DCEThreads now only realistically exists as an emulation layer.
References
POSIX
|
https://en.wikipedia.org/wiki/Australia%27s%20Naughtiest%20Home%20Videos
|
Australia's Naughtiest Home Videos is an Australian television comedy programme that was broadcast on Nine Network on 3 September 1992. It was a one-off special spin-off of Australia's Funniest Home Video Show, depicting videos of sexual situations and other sexually explicit content. The program was notably taken off the air partway through the broadcast of its first and only episode on the order of then-network owner Kerry Packer.
Background
Australia's Funniest Home Video Show premiered in 1990, and was similar in concept to the 1989 American special (and later series) America's Funniest Home Videos: viewers would send in amateur-shot videos that were unintentionally humorous, and the video deemed the "funniest" by the studio audience was awarded a prize at the end of the show.
The producers often received racy or risque videos that could not be included into the programme due to its family-friendly nature, and since the show's policy stated that videos sent in by viewers could not be sent back, videos that did not make it onto the program were still kept by the station. The producers decided to compile these videos into a one-off special aimed at an adult audience.
It differed from Australia's Funniest Home Video Show in more than just the content of the videos. It had a different opening, a modified version of the Australia's Funniest Home Video Show theme song, and a slightly modified set. It was hosted by Australian radio personality Doug Mulray. Due to the difference in content, the show aired at 8:30 PM and was preceded by a short message warning viewers of the show's content, and informing them that it was a one-off special that was different from Australia's Funniest Home Video Show.
Content
The show followed the same structure of Australia's Funniest Home Video Show, in which the videos were shown in short blocks, interspersed with humorous monologues written and delivered by Mulray. Mulray often poked fun at the content of the videos, which he described as "The most sensational collection of home videos since Rodney King nicked out for a pizza recently." Mulray also did humorous voice overs as the videos were shown, similar to Danny McMaster's on Australia's Funniest Home Video Show.
The content of the videos included shots of animal genitalia, humans or animals humorously engaging in sexual intercourse, people who get accidentally and humorously disrobed, and other situations that often relied on ribald humour, including a child grabbing a kangaroo's testicles, a man lifting a barbell with his penis, a man getting his head squeezed between an erotic dancer's large breasts, an elderly woman removing an envelope from a stripper's undergarments with her dentures, two people running into water with flaming pieces of toilet paper hanging from their buttocks, and two people filmed having sex in the middle of a park.
Cancellation
Kerry Packer, the owner of the Nine Network at the time, was informed of the show's content by friend
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.