source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Spatial%20Reuse%20Protocol | Spatial Reuse Protocol is a networking protocol developed by Cisco. It is a MAC-layer (a sublayer of the data-link layer (Layer 2) within the OSI Model) protocol for ring-based packet internetworking that is commonly used in optical fiber ring networks. Ideas from the protocol are reflected in parts of the IEEE 802.17 Resilient Packet Ring (RPR) standard.
Introduction
SRP was first developed as a data-link layer protocol to link Cisco's Dynamic Packet Transport (DPT) protocol (a method of delivering packet-based traffic over a SONET/SDH infrastructure) to the physical SONET/SDH layer. DPT cannot communicate directly with the physical layer, therefore it was necessary to develop an intermediate layer between DPT and SONET/SDH, SRP filled this role.
Analogy to POS
SRP behaves quite like the Point-to-Point Protocol (PPP) does in a Packet Over SONET (POS) environment. PPP acts as an abstraction layer between a higher level layer 2 technology such as POS and a layer 1 technology such as SONET/SDH. Layer 1 and high level layer 2 protocols cannot interact directly without having an intermediate low level layer 2 protocol, in the case of DPT the layer 2 protocol is SRP.
Spatial reuse capability
DPT environments contain dual, counter-rotating rings, somewhat like FDDI. SRP has a unique bandwidth efficiency mechanism which allows multiple nodes on the ring to utilize the entirety of its bandwidth, this mechanism is called the Spatial Reuse Capability. Nodes in an SRP environment can send data directly from source to destination. Consider the following environment: a ring with 6 routers (A through F sequentially) operating at OC-48c speed (2.5 Gbit/s). Routers A and D are sending data back and forth at 1.5 Gbit/s while routers B and C are sending data at 1 Gbit/s, this utilizes the entire 2.5 Gbit/s across routers A through D but still leaves routers F and E untouched. This means that routers F and E can be sending data at 2.5 Gbit/s between each other concurrently, resulting in the total throughput of the ring being 5 Gbit/s. The reason for this is the implementation of a method called "destination stripping". Destination stripping means that the destination of the data removes it from the ring network, this differs from "source stripping" in that the data is only present on the section of network between the source and destination nodes. In source stripping, the data is present all the way around the ring and is removed by the source node. FDDI and Token Ring networks use source stripping, whereas DPT and SRP use destination stripping. Again, consider the previous example of the OC-48c ring. In a source stripping (FDDI or Token Ring) environment, in the event that router A wanted to communicate with router D, the entire network would be taken up while the data was being transmitted because it would have to wait until it completed the loop and got back to router A before it was eliminated. In a destination stripping (DPT and SRP) environment, the dat |
https://en.wikipedia.org/wiki/Largest%20known%20prime%20number | The largest known prime number () is , a number which has 24,862,048 digits when written in base 10. It was found via a computer volunteered by Patrick Laroche of the Great Internet Mersenne Prime Search (GIMPS) in 2018.
A prime number is a natural number greater than 1 with no divisors other than 1 and itself. According to Euclid's theorem there are infinitely many prime numbers, so there is no largest prime.
Many of the largest known primes are Mersenne primes, numbers that are one less than a power of two, because they can utilize a specialized primality test that is faster than the general one. , the six largest known primes are Mersenne primes. The last seventeen record primes were Mersenne primes. The binary representation of any Mersenne prime is composed of all ones, since the binary form of 2k − 1 is simply k ones.
Current record
The record is currently held by with 24,862,048 digits, found by GIMPS in December 2018. The first and last 120 digits of its value are shown below:
This prime has been holding the record for 4 years and 9 months (as of October 2023), longer than any other record prime since M19937 (which held the record for 7 years, 1971–1978).
Prizes
There are several prizes offered by the Electronic Frontier Foundation (EFF) for record primes. A prime with one million digits was found in 1999, earning the discoverer a US$50,000 prize. In 2008, a ten-million digit prime won a US$100,000 prize and a Cooperative Computing Award from the EFF. Time called this prime the 29th top invention of 2008.
Both of these primes were discovered through the Great Internet Mersenne Prime Search (GIMPS), which coordinates long-range search efforts among tens of thousands of computers and thousands of volunteers. The $50,000 prize went to the discoverer and the $100,000 prize went to GIMPS. GIMPS will split the US$150,000 prize for the first prime of over 100 million digits with the winning participant. A further prize is offered for the first prime with at least one billion digits.
GIMPS also offers a US$3,000 research discovery award for participants who discover a new Mersenne prime of less than 100 million digits.
History of largest known prime numbers
The following table lists the progression of the largest known prime number in ascending order. Here is the Mersenne number with exponent p. The longest record-holder known was , which was the largest known prime for 144 years. No records are known prior to 1456.
GIMPS found the fifteen latest records (all of them Mersenne primes) on ordinary computers operated by participants around the world.
The twenty largest known prime numbers
A list of the 5,000 largest known primes is maintained by the PrimePages, of which the twenty largest are listed below.
See also
List of largest known primes and probable primes
References
External links
Press release about the largest known prime 282,589,933−1
Press release about the former largest known prime 277,232,917−1
Press release about |
https://en.wikipedia.org/wiki/List%20of%20Ion%20Television%20affiliates | Ion Television is a television network based in the United States made up of 44 owned-and-operated stations and 194 network affiliates, 164 of which broadcast as digital subchannels. The Ion-owned stations are a part of the Ion Media unit of Katz Broadcasting (d/b/a Scripps Networks), a wholly-owned subsidiary of the E. W. Scripps Company.
Stations are listed in alphabetical order by city of license.
A blue background indicates an affiliate originating as a digital subchannel.
A gray background indicates a low-power station or translator.
A lavender blue background indicates an affiliate originating as a digital subchannel of a low-power station.
(**) – Indicates station was built and signed on by either Ion Media or Paxson Communications.
Affiliate stations
Notes
License ownership/operational agreements
Primary and secondary affiliations
Satellites and semi-satellites
Miscellany
See also
Lists of The CW affiliates
List of MyNetworkTV affiliates
List of PBS member stations
Lists of Fox television affiliates
Lists of ABC television affiliates
Lists of CBS television affiliates
Lists of NBC television affiliates
References
External links
Ion Television |
https://en.wikipedia.org/wiki/Beam%20tracing | Beam tracing is an algorithm to simulate wave propagation.
It was developed in the context of computer graphics to render 3D scenes,
but it has been also used in other similar areas such as acoustics and
electromagnetism simulations.
Beam tracing is a derivative of the ray tracing algorithm that replaces rays, which have no thickness, with beams. Beams are shaped like unbounded pyramids, with (possibly complex) polygonal cross sections. Beam tracing was first proposed by Paul Heckbert and Pat Hanrahan.
In beam tracing, a pyramidal beam is initially cast through the entire viewing frustum. This initial viewing beam is intersected with each polygon in the environment, typically from nearest to farthest. Each polygon that intersects with the beam must be visible, and is removed from the shape of the beam and added to a render queue. When a beam intersects with a reflective or refractive polygon, a new beam is created in a similar fashion to ray-tracing.
A variant of beam tracing casts a pyramidal beam through each pixel of the image plane. This is then split up into sub-beams based on its intersection with scene geometry. Reflection and transmission (refraction) rays are also replaced by beams. This sort of implementation is rarely used, as the geometric processes involved are much more complex and therefore expensive than simply casting more rays through the pixel. Cone tracing is a similar technique using a cone instead of a complex pyramid.
Beam tracing solves certain problems related to sampling and aliasing, which can plague conventional ray tracing approaches. Since beam tracing effectively calculates the path of every possible ray within each beam (which can be viewed as a dense bundle of adjacent rays), it is not as prone to under-sampling (missing rays) or over-sampling (wasted computational resources). The computational complexity associated with beams has made them unpopular for many visualization applications. In recent years, Monte Carlo algorithms like distributed ray tracing (and Metropolis light transport?) have become more popular for rendering calculations.
A 'backwards' variant of beam tracing casts beams from the light source into the environment. Similar to photon mapping, backwards beam tracing may be used to efficiently model lighting effects such as caustics. Recently the backwards beam tracing technique has also been extended to handle glossy to diffuse material interactions (glossy backward beam tracing) such as from polished metal surfaces.
Beam tracing has been successfully applied to the fields of acoustic modelling and electromagnetic propagation modelling. In both of these applications, beams are used as an efficient way to track deep reflections from a source to a receiver (or vice versa). Beams can provide a convenient and compact way to represent visibility. Once a beam tree has been calculated, one can use it to readily account for moving transmitters or receivers.
Beam tracing is related in conce |
https://en.wikipedia.org/wiki/Cone%20tracing | Cone tracing and beam tracing are a derivative of the ray tracing algorithm that replaces rays, which have no thickness, with thick rays.
Principles
In ray tracing, rays are often modeled as geometric ray with no thickness to perform efficient geometric queries such as a ray-triangle intersection. From a physics of light transport point of view, however, this is an inaccurate model provided the pixel on the sensor plane has non-zero area.
In the simplified pinhole camera optics model, the energy reaching the pixel comes from the integral of radiance from the solid angle by which the sensor pixel sees the scene through the pinhole at the focal plane. This yields the key notion of pixel footprint on surfaces or in the texture space, which is the back projection of the pixel on to the scene. Note that this approach can also represent a lens-based camera and thus depth of field effects, using a cone whose cross-section decreases from the lens size to zero at the focal plane, and then increases.
Real optical system do not focus on exact points because of diffraction and imperfections. This can be modeled with a point spread function (PSF) weighted within a solid angle larger than the pixel.
From a signal processing point of view, ignoring the point spread function and approximating the integral of radiance with a single, central sample (through a ray with no thickness) can lead to strong aliasing because the "projected geometric signal" has very high frequencies exceeding the Nyquist-Shannon maximal frequency that can be represented using the uniform pixel sampling rate.
The physically based image formation model can be approximated by the convolution with the point spread function assuming the function is shift-invariant and linear. In practice, techniques such as multisample anti-aliasing estimate this cone-based model by oversampling the signal and then performing a convolution (the reconstruction filter). The backprojected cone footprint onto the scene can also be used to directly pre-filter the geometry and textures of the scene.
Note that contrary to intuition, the reconstruction filter should not be the pixel footprint (as the pinhole camera model would suggest), since a box filter has poor spectral properties. Conversely, the ideal sinc function is not practical, having infinite support with possibly negative values which often creates ringing artifacts due to the Gibbs phenomenon. A Gaussian or a Lanczos filter are considered good compromises.
Computer graphics models
Cone and Beam early papers rely on different simplifications: the first considers a circular section and treats the intersection with various possible shapes. The second treats an accurate pyramidal beam through the pixel and along a complex path, but it only works for polyhedrical shapes.
Cone tracing solves certain problems related to sampling and aliasing, which can plague conventional ray tracing. However, cone tracing creates a host of problems of its own. For exam |
https://en.wikipedia.org/wiki/Image%20plane | In 3D computer graphics, the image plane is that plane in the world which is identified with the plane of the display monitor used to view the image that is being rendered. It is also referred to as screen space. If one makes the analogy of taking a photograph to rendering a 3D image, the surface of the film is the image plane. In this case, the viewing transformation is a projection that maps the world onto the image plane. A rectangular region of this plane, called the viewing window or viewport, maps to the monitor. This establishes the mapping between pixels on the monitor and points (or rather, rays) in the 3D world. The plane is not usually an actual geometric object in a 3D scene, but instead is usually a collection of target coordinates or dimensions that are used during the rasterization process so the final output can be displayed as intended on the physical screen.
In optics, the image plane is the plane that contains the object's projected image, and lies beyond the back focal plane.
See also
Focal plane
Picture plane
Projection plane
Real image
References
External links
3D computer graphics
Planes (geometry) |
https://en.wikipedia.org/wiki/One%20Definition%20Rule | The One Definition Rule (ODR) is an important rule of the C++ programming language that prescribes that classes/structs and non-inline functions cannot have more than one definition in the entire program and template and types cannot have more than one definition by translation unit. It is defined in the ISO C++ Standard (ISO/IEC 14882) 2003, at section 3.2. Some other programming languages have similar but differently defined rules towards the same objective.
Summary
In short, the ODR states that:
In any translation unit, a template, type, function, or object can have no more than one definition. Some of these can have any number of declarations. A definition provides an instance.
In the entire program, an object or non-inline function cannot have more than one definition; if an object or function is used, it must have exactly one definition. You can declare an object or function that is never used, in which case you don't have to provide a definition. In no event can there be more than one definition.
Some things, like types, templates, and extern inline functions, can be defined in more than one translation unit. For a given entity, each definition must have the same sequence of tokens. Non-extern objects and functions in different translation units are different entities, even if their names and types are the same.
Some violations of the ODR must be diagnosed by the compiler. Other violations, particularly those that span translation units, are not required to be diagnosed.
Examples
In general, a translation unit shall contain no more than one definition of any class type. In this example, two definitions of the class type C occur in the same translation unit. This typically occurs if a header file is included twice by the same source file without appropriate header guards.
class C {}; // first definition of C
class C {}; // error, second definition of C
In the following, forming a pointer to S or defining a function taking a reference to S are examples of legal constructs, because they do not require the type of S to be complete. Therefore, a definition is not required.
Defining an object of type S, a function taking an argument of type S, or using S in a sizeof expression are examples of contexts where S must be complete, and therefore require a definition.
struct S; // declaration of S
S * p; // ok, no definition required
void f(S&); // ok, no definition required
void f(S*); // ok, no definition required
S f(); // ok, no definition required - this is a function declaration only!
S s; // error, definition required
sizeof(S); // error, definition required
More than one definition
In certain cases, there can be more than one definition of a type or a template. A program consisting of multiple header files and source files will typically have more than one definition of a type, but not more than one definition per translation unit.
If a program contains more than one definition of a type, the |
https://en.wikipedia.org/wiki/Geoffrey%20Fox | Geoffrey Fox may refer to:
Geoffrey Fox (died 1966), one of the police officers murdered in the Shepherd's Bush murders
Geoffrey C. Fox (born 1944), professor of informatics and computing at Indiana University
Geoff Fox (born 1950), American television meteorologist
Geoff Fox (footballer, born 1925) (1925–1994), English footballer
Geoff Fox (Australian footballer) (1910–1971), Australian footballer
Geoff Fox, CEO and founder of Fox Racing
See also
Jeffrey Fox, President and CEO of Convergys |
https://en.wikipedia.org/wiki/District%20heating | District heating (also known as heat networks or teleheating) is a system for distributing heat generated in a centralized location through a system of insulated pipes for residential and commercial heating requirements such as space heating and water heating. The heat is often obtained from a cogeneration plant burning fossil fuels or biomass, but heat-only boiler stations, geothermal heating, heat pumps and central solar heating are also used, as well as heat waste from factories and nuclear power electricity generation. District heating plants can provide higher efficiencies and better pollution control than localized boilers. According to some research, district heating with combined heat and power (CHPDH) is the cheapest method of cutting carbon emissions, and has one of the lowest carbon footprints of all fossil generation plants.
District heating is ranked number 27 in Project Drawdown's 100 solutions to global warming.
History
District heating traces its roots to the hot water-heated baths and greenhouses of the ancient Roman Empire. A hot water distribution system in Chaudes-Aigues in France is generally regarded as the first real district heating system. It used geothermal energy to provide heat for about 30 houses and started operation in the 14th century.
The U.S. Naval Academy in Annapolis began steam district heating service in 1853. MIT began coal-fired steam district heating in 1916 when it moved to Cambridge, Massachusetts.
Although these and numerous other systems have operated over the centuries, the first commercially successful district heating system was launched in Lockport, New York, in 1877 by American hydraulic engineer Birdsill Holly, considered the founder of modern district heating.
Generations of district heating
Generally, all modern district heating system are demand driven, meaning that the heat supplier reacts to the demand from the consumers and ensures that there is sufficient temperature and water pressure to deliver the demanded heat to the users. The five generations have defining features that sets them apart from the prior generations. The feature of each generation can be used to give an indication of the development status of an existing district heating system.
First generation
The first generation was a steam-based system fueled by coal and was first introduced in the US in the 1880s and became popular in some European countries, too. It was state of the art until the 1930s. These systems piped very high-temperature steam through concrete ducts, and were therefore not very efficient, reliable, or safe. Nowadays, this generation is technologically outdated. However, some of these systems are still in use, for example in New York or Paris. Other systems originally built have subsequently been upgraded.
Second generation
The second generation was developed in the 1930s and was built until the 1970s. It burned coal and oil, and the energy was transmitted through pressurized hot water as the hea |
https://en.wikipedia.org/wiki/University%20of%20the%20Air%20%28TV%20series%29 | University of the Air was a daily distance education television program seen early mornings on the CTV Television Network in Canada between October 11, 1965 and 1983; prior to the establishment of 24-hour broadcasting, in most regions it was the first program aired each day, usually at 5:30 or 6 a.m., though it would also turn up at other times. Each episode consisted of a lecture given by a university instructor. Individual episodes of this series were produced locally by CTV affiliates nationwide, for national broadcast on the CTV network under national co-ordinator Nancy Fraser.
Previous lectures of this series were also broadcast on TVO and CHCH-TV Hamilton, both as part of TVO's educational television schedule.
It was best remembered for its opening/closing title sequence, consisting of a black-bordered hexagonal kaleidoscope background and eerie electronic theme music.
In October 2014, the Dalhousie University Archives posted a number of complete episodes dating from 1976 to YouTube featuring Dalhousie lecturers.
See also
University of the Air (CBC radio series) - Similar, but unrelated, CBC Radio series
References
External links
A history of the CTV program University of the Air
University of Alberta Archives: Donald Murray Ross fonds - University of the Air episodes
The Canadian Encyclopedia: George Proctor (refers to "Canadian Music of the 20th Century" program episodes)
CTV Television Network original programming
Adult education television series
Distance education in Canada
1966 Canadian television series debuts
1983 Canadian television series endings
1980s Canadian documentary television series
Television series by Bell Media |
https://en.wikipedia.org/wiki/Service%20r%C3%A9gional%20d%27admission%20du%20Montr%C3%A9al%20m%C3%A9tropolitain | The Service régional d'admission du Montréal métropolitain (SRAM) is a network of Quebec CEGEPs, and handles their admissions process with a standardized application form.
Schools
Cégep de l'Abitibi-Témiscamingue
Collège Ahuntsic
Cégep André-Laurendeau
Collège de Bois-de-Boulogne
Champlain College Lennoxville
Cégep de Drummondville
Cégep Édouard-Montpetit
École nationale d'aérotechnique
Cégep Gérald-Godin
Cégep de Granby
Heritage College
John Abbott College
Cégep régional de Lanaudière à L'Assomption
Cégep régional de Lanaudière à Joliette
Cégep régional de Lanaudière à Terrebonne
Collège Lionel-Groulx
Collège de Maisonneuve
Cégep Marie-Victorin
Collège Montmorency
Cégep de l'Outaouais
Collège de Rosemont
Cégep de Saint-Hyacinthe
Cégep Saint-Jean-sur-Richelieu
Cégep de Saint-Jérôme
Cégep de Saint-Laurent
Collège Shawinigan
Cégep de Sherbrooke
Cégep de Sorel-Tracy
Cégep de Trois-Rivières
Collège de Valleyfield
Vanier College
Cégep du Vieux Montréal
Institut de technologie agroalimentaire, Campus de Saint-Hyacinthe
Institut de tourisme et d'hôtellerie du Québec
Macdonald College
Source:
References
External links
SRAM Website
Quebec CEGEP
Education in Montreal
Educational organizations based in Quebec |
https://en.wikipedia.org/wiki/ALTQ | ALTQ (ALTernate Queueing) is the network scheduler for Berkeley Software Distribution. ALTQ provides queueing disciplines, and other components related to quality of service (QoS), required to realize resource sharing. It is most commonly implemented on BSD-based routers. ALTQ is included in the base distribution of FreeBSD, NetBSD, and DragonFly BSD, and was integrated into the pf packet filter of OpenBSD but later replaced by a new queueing subsystem (it was deprecated with OpenBSD 5.5 release, and completely removed with 5.6 in 2014).
With ALTQ, packets can be assigned to queues for the purpose of bandwidth control. The scheduler defines the algorithm used to decide which packets get delayed, dropped or sent out immediately. There are five schedulers currently supported in the FreeBSD implementation of ALTQ:
— Class-based Queueing. Queues attached to an interface build a tree, thus each queue can have further child queues. Each queue can have a priority and a bandwidth assigned. Priority mainly controls the time packets take to get sent out, while bandwidth has primarily effects on throughput.
— Controlled Delay. Attempts to combat bufferbloat.
— Fair Queuing. Attempts to fairly distribute bandwidth among all connections.
— Hierarchical Fair Service Curve. Queues attached to an interface build a tree, thus each queue can have further child queues. Each queue can have a priority and a bandwidth assigned. Priority mainly controls the time packets take to get sent out, while bandwidth has primarily effects on throughput.
— Priority Queueing. Queues are flat attached to the interface, thus, queues cannot have further child queues. Each queue has a unique priority assigned, ranging from 0 to 15. Packets in the queue with the highest priority are processed first.
See also
Traffic shaping
KAME project
References
External links
ALTQ home
Configuring ALTQ in OpenBSD 5.4 and earlier
PF and ALTQ documentation by the FreeBSD project
pfSense Documentation ALTQ Scheduler Types on pfSense Firewall
Network performance
Network scheduling algorithms
Quality of service
Free software programmed in C
Operating system technology
I/O scheduling
BSD software
FreeBSD
NetBSD
DragonFly BSD |
https://en.wikipedia.org/wiki/Commercial%20Data%20Systems | Commercial Data Systems, Ltd. (CDS) was a software publisher and technology company based in Emerald Park, Saskatchewan.
In the 1980s, CDS was primarily involved in the production of computer games for 8-bit computers such as the Commodore 64. The best-known and most original of these was Frantic Freddie, which combined fast-paced arcade play with an addictive soundtrack of pop tunes arranged by Kris Hatlelid. Most of their other offerings were either sports simulations or clones of popular arcade games such as Joust (Pegasis) and Frogger (Froggee/Road Toad).
CDS stopped publishing games around 1990. As of the late 1990s, it shifted its business focus to consulting. The company was dissolved in May 2010.
Software releases
5-Pin Bowling (1984)
Frantic Freddie (1983)
Froggee (1982)
Motor Mouse
Pegasis (1983)
Witch Way (1983)
References
External links
Screenshots from some CDS games
Review of Frantic Freddie
Defunct video game companies of Canada
Canadian companies disestablished in 2010 |
https://en.wikipedia.org/wiki/CDS%20Software | CDS Software (also known as CDS Micro Systems for its earlier titles) was an independent publisher and developer of computer game software based in Doncaster, South Yorkshire, UK.
History
The company was founded by Ian Williams, a computer programmer from Doncaster who started developing games for the Sinclair ZX80 shortly after its launch. After the initial company success he employed Giles Hunter (A manager from Doncaster W.H Smiths) to help expand the business. He sold his company to Giles Hunter to pursue other interests in 1985.
In 1985, the company launched the Blue Ribbon budget label.
In 1988 CDS Software, under the CDS group of companies changed its name to Nimrod Holdings Ltd, also publishing games for the Amiga. Publishing continued under the CDS Software Label until the early 1990s.
Guildhall Leisure Services
The company operated as RHSCO One Limited between January 1994 and March 1994, and then as Guildhall Leisure Services between March 1994 and May 2002. As Guildhall, the company published games for the Amiga including the well-regarded title Gloom.
iDigicon
Subsequently the company operated as iDigicon Limited until its dissolution in May 2013.
Games
The first games released in 1982-3 were for the 16k ZX Spectrum consisting mainly of clones of arcade games. The company expanded to different formats with titles like Steve Davis Snooker and Colossus Chess seeing releases on most platforms of the day. The launch of the budget label Blue Ribbon saw simple arcade type games diverted to that label with CDS concentrating on full price titles, often incorporating tie-in licences such as Brian Clough's Football Fortunes and Sporting Triangles. They also released the computer game crossed with a board game, TankAttack. The Complete Home Entertainment Centre was a compendium of games that were later split and sold as stand alone titles by Blue Ribbon (such as Video Card Arcade and Dominoes).
In the early 90s, CDS re-issued or picked up UK distribution of games for companies such as D&H (e.g. Multi-Player Soccer Manager), MicroIllusions (e.g. Fire Power) and Artworx (e.g. the Strip Poker games).
8-bit games published
Gobble a Ghost (1982)
3D Painter (1983)
Bozy Boa (1983)
Catterpillar (1983)
Leapfrog (1983))
Magic Meanies (1983)
French is Fun (1983)
Othello (1983)
Pool (1983)
Reversi (1983)
Winged Warlords (1983)
German is Fun (1984)
Italian is Fun (1984)
Steve Davis Snooker (1984)
Timebomb (1984)
Spanish is Fun (1985)
Colossus Chess 4 (1986)
Colossus Bridge 4 (1986)
Brian Clough's Football Fortunes (1987)
Tank Attack (1988)
Video Card Arcade (1988)
Sporting Triangles (1989)
European Superleague (1990)
16-bit games published
As CDS:
Bravo Romeo Delta (1992), Frankenstein
Rugby Coach (1992), D&H Games
Colossus Bridge X (1992)
As Guildhall:
Xtreme Racing (1995), Silltunna
Fears (1995), Bomb
Gloom (1995), Black Magic Software
Legends (1996), Krisalis
Minskies Furballs (1997), Binary Emotions
Re-rele |
https://en.wikipedia.org/wiki/California%20Games | California Games is a 1987 sports video game originally released by Epyx for the Apple II and Commodore 64, and ported to other home computers and video game consoles. Branching from their Summer Games and Winter Games series, this game consists of a collection of outdoor sports purportedly popular in California. The game was successful and spawned a sequel, California Games II.
Gameplay
The events available vary slightly depending on the platform, but include all of the following:
Half-pipe
Footbag
Surfing (starring Rippin' Rick)
Roller skating
BMX
Flying disc
Development
Several members of the development team moved on to other projects. Chuck Sommerville, the designer of the half-pipe game in California Games, later developed the game Chip's Challenge, while Ken Nicholson, the designer of the footbag game, was the inventor of the technology used in Microsoft's DirectX. Kevin Norman, the designer of the BMX game, went on to found the educational science software company Norman & Globus, makers of the ElectroWiz series of products.
The sound design for the original version of California Games was done by Chris Grigg, member of the band Negativland.
Ports
Originally written for the Apple II and Commodore 64, it was eventually ported to Amiga, Apple IIGS, Atari 2600, Atari ST, MS-DOS, Genesis, Amstrad CPC, ZX Spectrum, Nintendo Entertainment System, MSX and Master System. The Atari Lynx version was the pack-in game for the system when it was launched in June 1989. An Atari XE version was planned and contracted out by Atari Corp. to Epyx in 1988 but no code was delivered by the publication deadline.
Reception
California Games was a commercial blockbuster. With more than 300,000 copies sold in the first nine months, it was the most-successful Epyx game, outselling each of the four previous and two subsequent titles in the company's "Games" series. CEO David Shannon Morse said that it was the first Epyx game to appeal equally to boys and girls during playtesting. The game topped 500,000 units sold by 1989, at which time Video Games & Computer Entertainment reported that sales were "still mounting".
Computer Gaming World recommended the game, calling it fun. Compute! called California Games "both inventive and charming". In a capsule review for STart, Clayton Walnum said California Games "isn't a bad package, especially since it comes free with the Lynx". He found the BMX and surfing events great fun but deemed the skateboarding event frustrating and said the foot-bag event is pleasant but quickly wears thin.
In 1996, Next Generation listed the "Games" series collectively as number 89 on its "Top 100 Games of All Time". The magazine stated that though the games had great graphics for their time, their most defining qualities were their competitive multiplayer modes and "level of control that has yet to be equaled". In 2004, the Atari Lynx version of California Games was inducted into GameSpot's list of the greatest games of all time.
L |
https://en.wikipedia.org/wiki/Steve%20Sohmer | Steve Sohmer (born June 26, 1941 in Savannah, Georgia) is a Shakespearean scholar, author of fiction and nonfiction books, television writer and producer, and former network television and motion picture studio executive.
In 1966, his first novel, The Way It Was was published by Robert Gottlieb of Simon & Schuster. The book received positive reviews and was chosen by The New York Times as one of the twenty best novels of the year. In 1967, Sohmer was named creative director of the Bureau of Advertising of the American Newspaper Publishers Association.
In 1972, Sohmer left the Bureau to establish his own media promotion firm in partnership with The Minneapolis Star and Tribune Company. For the next five years the New York-based company created slide and film sales presentations for media clients.
In 1977, Sohmer was named Vice President, Marketing and Promotion, of the CBS Television Network. Sohmer supervised the marketing of CBS Entertainment, CBS News and CBS Sports. Sohmer's promotion launched Dallas, The Dukes of Hazzard, The Incredible Hulk, Alice, and other long-running hits. His movie marketing campaigns brought viewers to Skokie, Playing for Time and Fallen Angel.
In 1982, Sohmer moved to NBC Television as executive vice president in charge of marketing and promotion, Saturday morning programming, specials and daytime television. Sohmer launched hit series including Cheers, Family Ties, The A-Team and Remington Steele.
Sohmer was named president and CEO of Columbia Pictures in 1985, but left the following year.
He was executive vice president at PAX TV and ABC Television. He created, and served as writer-producer, for the NBC miniseries Favorite Son and the award-winning NBC drama series Mancuso, F.B.I. starring Robert Loggia, both based on Sohmer's novel of the same title. Sohmer wrote and produced the NBC miniseries Tom Clancy's OP Center (1995) and created the drama series Twice in a Lifetime for PAX TV (1999).
In 1995, Sohmer earned a doctorate from Oxford University, specializing in Shakespeare studies. Since graduation, Sohmer has published in peer-reviewed journals as well as these scholarly books: Shakespeare's Mystery Play, Shakespeare for the Wiser Sort, and Reading Shakespeare's Mind, all from Manchester University Press.
Sohmer was married to soap opera star Deidre Hall for 15 years. They are divorced.
References
External links
Living people
1941 births
20th-century American novelists
American male novelists
American male screenwriters
American television executives
20th-century American male writers |
https://en.wikipedia.org/wiki/Rob%20Hartill | Robert Hartill (born 30 January 1969 in Pontypridd, Wales) is a computer programmer and web designer best known for his work on the Internet Movie Database website and the Apache web server and is notable for playing a key role in the initial growth of the World Wide Web.
Hartill grew up in Wales, and studied computer science at University of Wales College, Cardiff where he earned a BSc and PhD.
In 1993, he became involved with the rec.arts.movies database that went on to become the Internet Movie Database (IMDb). On 5 August 1993 he announced the first web version of the database.
In 1994, Hartill moved to Los Alamos in New Mexico to work at the Los Alamos National Laboratory on the ArXiv.org e-print archive with Paul Ginsparg. At the same time, he was a co-founder of the Apache Software Foundation, and made many contributions to the early development of the Apache HTTP Server. In 1994, Hartill was one of only six inductees in the World Wide Web Hall of Fame announced at the first international conference on the World Wide Web.
In 1996, the Internet Movie Database was founded, and Rob returned to Ogmore-by-Sea in Wales before leaving the IMDb in 2000 and emigrating to South Australia in May 2003. He's currently a volunteer fire-fighter with the Country Fire Service and a hobby farmer.
See also
Col Needham
References
External links
IMDb History
British computer programmers
People from Pontypridd
Alumni of Cardiff University
Living people
Hartill
Welsh emigrants to Australia
People educated at Ysgol Gyfun Garth Olwg
Los Alamos National Laboratory personnel |
https://en.wikipedia.org/wiki/Martin%20Allen%20%28entrepreneur%29 | Martin A. Allen (1931–2009) was the chairman, co-founder, president, and largest individual stockholder (2,272,866 shares) of Computervision Corp. Its first product, CADDS-1, was aimed at the printed circuit layout, and 2-D drafting markets.
Career
Computervision Corp.
Martin (Marty) A. Allen co-founded Computervision Corp. in 1969 with Philippe Villers in Boston, MA. In 1980 he lead an effort to create the first Graphics Processing Unit (GPU), build to handle 2-D and 3-D modeling.
Retirement
Allen netted $34 million when, at age 57, he sold Computervision Corp. to Prime Computer Inc. on 29 January 1988.
Early life and education
Born in Des Moines, Iowa, Allen was raised in California. He attended the University of California, Berkeley and obtained the degree in engineering.
References
1931 births
2009 deaths
20th-century American businesspeople
American computer businesspeople |
https://en.wikipedia.org/wiki/Tough%20Love%20with%20Mick%20Molloy | ToughLove was an Australian comedic radio talk program broadcast from Melbourne through the Triple M network from 12:00PM – 1:00PM AEST in Melbourne, Sydney, Brisbane and Adelaide.
It was hosted by long-time Australian comic, Mick Molloy and co-hosted by Robyn Butler and Mick's brother Richard Molloy aka 'Roo'. Panel operator Rosemary Walton was occasionally heard in the background laughing. In its first year (2004) the show ran for two hours (10:00AM – 12:00PM) and was also co-hosted by comedian/actor Alan Brough. During this time, a regular feature of the show was Robyn's fictional characters, including "Mrs. Yi" and "Rosita", however since the timeslot change, these characters appear to have been dropped. The show finished in 2006 when Mick Molloy decided to leave radio.
The ToughLove team
Segments
Regular segments include Bombshells, Stupid Behaviour, Zero Tolerance, The ToughLove Enshitelopedia and Bang Out Of Order.
Promotion
During 2004, as a promotion for the show, the station released a series of billboards in the style of Calvin Klein picturing Mick taking off his underpants adorning the phrase "Turn Me On And Dress Me Down". During September of that year, one of the billboards was auctioned on eBay with all proceeds going to the Lighthouse Foundation. A Melbourne man, Tim Dellar, unwittingly bid for the billboard and "won" the 41 square metre sign.
Podcast
Highlights of the show were made available as a weekly podcast downloadable from the Triple M website. Many of their various guests, callers, sketches, and segments were featured. There were a number of special podcasts made available following Mick and Roo's trip to London.
End of ToughLove
At the end of 2006, Mick Molloy decided to leave radio, which meant ToughLove did not return, as noted in a statement released by Triple M that announced the new program lineup for 2007. Tony Martin's Get This was moved from the 9am slot to the midday slot, thus replacing Tough Love. In the statement, Molloy said: "The relentless grind of a one-hour national radio show has finally taken its toll. The midday starts were also brutal, often playing havoc with my sleeping patterns. It's definitely a younger man's game".
References
Australian comedy radio programs
2000s Australian radio programs
Australian talk radio programs |
https://en.wikipedia.org/wiki/Melbourne%20tram%20route%2016 | Melbourne tram route 16 is operated by Yarra Trams on the Melbourne tram network from Melbourne University to Kew. The 20.2 kilometre route is operated out of Malvern depot with Z and D1 class trams.
History
Route 16 was first allocated to the line between the City (Swanston Street) and St Kilda Beach on 26 April 1936 following the electrification of the Brunswick cable tram line. Prior to that, trams on the northern section of Sydney Road would run via Swanston Street to the southern suburbs. Route 16 ran the service between Coburg and St Kilda Beach. After 1936, trams traditionally terminated at the Victoria Street terminus, but following an accident in 1991, trams instead terminated at the Queensberry Street crossover. Due to congestion during peak hours at the crossover, some trams continued north to Melbourne University. Finally on 17 January 1996, a permanent shunt was built at Melbourne University. From then on, route 16 trams were altered run full-time to Melbourne University. Traditionally, Route 16 ran between St Kilda Beach to a City terminus along Swanston Street, but most services would in fact continue north to Moreland as route 15. However, following the elimination of shared depot routes on 2 April 1995, route 15 was discontinued, and routes 16 and 22 were amended to run full-time. On 16 October 2004, route 16 was amalgamated with route 69 to run between Melbourne University and Kew (Cotham Road) via St Kilda Beach.
The origins of route 16 lie in separate tram lines. The section of track between Queensberry Street (Stop 4) and St Kilda Junction (Stop 30) is the oldest section of this route, dating back to the Brighton Road cable tram which opened on 11 October 1888 by the Melbourne Tramway & Omnibus Company. This cable tram line was electrified in stages by the Melbourne & Metropolitan Tramways Board. The section between Domain Interchange (Stop 20) and St Kilda Junction (Stop 30) was electrified on 27 December 1925. The section between Queensberry Street and City Road (near Stop 14) was electrified on the same day. The line between City Road and Domain Interchange was electrified on 24 January 1926. Meanwhile, the section between Luna Park (stop 138) and St Kilda Junction was originally the Windsor to St Kilda Beach cable tramway which opened on 27 October 1891. This line was electrified on 27 December 1925.
The line between Luna Park and the terminus at Cotham Road (Stop 80) was all constructed by the Prahran & Malvern Tramways Trust. The track between Wattletree Road (Stop 54) and High Street (Stop 57) was part of the original system which opened on 30 May 1910. The section of track between Hawthorn Road (Stop 48) and Wattletree Road opened on 16 December 1911 as part of the line to Windsor station. The section between Hawthorn Road and Luna Park opened on 12 April 1913, and the line from High Street to the Cotham Road terminus opened on 30 May 1913. Meanwhile, the Melbourne, Brunswick & Coburg Tramway Trust (MBCTT) construc |
https://en.wikipedia.org/wiki/Integrated%20Computer-Aided%20Manufacturing | Integrated Computer-Aided Manufacturing (ICAM) is a US Air Force program that develops tools, techniques, and processes to support manufacturing integration. It influenced the computer-integrated manufacturing (CIM) and computer-aided manufacturing (CAM) project efforts of many companies.
The ICAM program was founded in 1976 and initiative managed by the US Air Force at Wright-Patterson as a part of their technology modernization efforts. The program initiated the development a series of standards for modeling and analysis in management and business improvement, called Integrated Definitions, short IDEFs.
Overview
The USAF ICAM program was founded in 1976 at the US Air Force Materials Laboratory, Wright-Patterson Air Force Base in Ohio by Dennis E. Wisnosky and Dan L. Shunk and others. In the mid-1970s Joseph Harrington had assisted Wisnosky and Shunk in designing the ICAM program and had broadened the concept of CIM to include the entire manufacturing company. Harrington considered manufacturing a "monolithic function".
The ICAM program was visionary in showing that a new approach was necessary to achieve integration in manufacturing firms. Wisnosky and Shunk developed a "wheel" to illustrate the architecture of their ICAM project and to show the various elements that had to work together. Wisnosky and Shunk were among the first to understand the web of interdependencies needed for integration. Their work represents the first major step in shifting the focus of manufacturing from a series of sequential operations to parallel processing.
The ICAM program has spent over $100 million to develop tools, techniques, and processes to support manufacturing integration. The Air Force's ICAM program recognizes the role of data as central to any integration effort. Data must be common and shareable across functions. The concept still remains ahead of its time, because most major companies did not seriously begin to attack the data architecture challenge until well into the 1990s. The ICAM program also recognizes the need for ways to analyze and document major activities within the manufacturing establishment. Thus, from ICAM came the IDEFs, the standard for modeling and analysis in management and business improvement efforts. IDEF means ICAM DEFinition.
The impact
Standard data models
To extract real meaning from the data, we must also have formulated, and agreed on, a model of the world the data describes. We now understand that this actually involves two different kinds of model:
Static associations between data and real-world physical and conceptual objects it describes—called the information model
Rules for use and modification of the data, which derive from the dynamic characteristics of the objects themselves—called the functional model
The significance of these models to data interchange for manufacturing and materials flow was recognized early in the Air Force Integrated Computer Aided Manufacturing (ICAM) Project and gave rise to the ID |
https://en.wikipedia.org/wiki/Blobotics | Blobotics is a term describing research into chemical-based computer processors based on ions rather than electrons. Andrew Adamatzky, a computer scientist at the University of the West of England, Bristol used the term in an article in New Scientist March 28, 2005 .
The aim is to create 'liquid logic gates' which would be 'infinitely reconfigurable and self-healing'. The process relies on the Belousov–Zhabotinsky reaction, a repeating cycle of three separate sets of reactions. Such a processor could form the basis of a robot which, using artificial sensors, interact with its surroundings in a way which mimics living creatures.
The coining of the term was featured by ABC radio in Australia .
References
Motoike I., Adamatzky A. "Three-valued logic gates in reaction-diffusion excitable media." Chaos, Solitons & Fractals 24 (2005) 107-114
Adamatzky, A. "Collision-based computing in Belousov–Zhabotinsky medium." Chaos, Solitons & Fractals 21:(5), (2004), p1259-1264
Robotics
Classes of computers |
https://en.wikipedia.org/wiki/Heptaxodontidae | Heptaxodontidae, rarely called giant hutia, is an extinct family of large rodents known from fossil and subfossil material found in the West Indies. One species, Amblyrhiza inundata, is estimated to have weighed between , reaching the weight of an eastern gorilla. This is twice as large as the capybara, the largest rodent living today, but still much smaller than Josephoartigasia monesi, the largest rodent known. These animals were probably used as a food source by the pre-Columbian peoples of the Caribbean.
Heptaxodontidae contains no living species and the grouping seems to be paraphyletic and arbitrary, however. One of the smaller species, Quemisia gravis, may have survived as late as when the Spanish began to colonize the Caribbean.
Despite the vernacular name, heptaxodontids are not closely related to the extant hutias of the family Echimyidae; Heptaxodontids are thought to be more closely related to the chinchillas.
Taxonomy
Heptaxodontidae is divided into two subfamilies and contains six species in five genera.
Family Heptaxodontidae
Subfamily Heptaxodontinae
Genus Amblyrhiza
Amblyrhiza inundata from Anguilla and St. Martin
Genus Elasmodontomys
Elasmodontomys obliquus from Puerto Rico
Genus Quemisia
Quemisia gravis from Hispaniola
Genus Xaymaca
Xaymaca fulvopulvis from Jamaica
Subfamily Clidomyinae
Genus Clidomys
Clidomys osborni from Jamaica
See also
Island gigantism
References
Bibliography
Biknevicius, A. R.; McFarlane, Donald A. & MacPhee, R. D. E. (1993): Body size in Amblyrhiza inundata (Rodentia: Caviomorpha), an extinct megafaunal rodent from the Anguilla Bank, West Indies: estimates and implications. American Museum Novitates 3079: 1-26. PDF fulltext
MacPhee, R. D. E. & Flemming, C. (2003): A possible heptaxodontine and other caviidan rodents from the Quaternary of Jamaica. American Museum Novitates 3422: 1-42. PDF fulltext
Nowak, Ronald M. 1999. Walker's Mammals of the World, 6th edition. Johns Hopkins University Press, 1936
Woods, C. A. 1989. Biogeography of West Indian rodents. Pages 741–797 in Biogeography of the West Indies: Past Present and Future. Sandhill Crane Press, Gainesville.
Hystricognath rodents
Fossils of the Caribbean
Holocene extinctions
Pleistocene first appearances
Fossil taxa described in 1917
Prehistoric rodent families |
https://en.wikipedia.org/wiki/Derby%20railway%20station | Derby railway station (, also known as Derby Midland) is a main line railway station serving the city of Derby in Derbyshire, England. Owned by Network Rail and managed by East Midlands Railway, the station is also used by CrossCountry services.
It lies north of London St Pancras. It is situated to the south-east of Derby city centre, and is close to the west bank of the River Derwent.
Overview
The decision by the Midland Railway to have its headquarters in Derby made the town a busy node of the rail network. First opened in 1839, it was at the time one of the largest stations in the country, and was unusual for being shared by more than one company. Until its closure in 1990, Derby Railway Works, consisting of major carriage and locomotive workshops, as well as the Research Division in the Railway Technical Centre were housed there.
The station is an interchange point between the Midland Main Line from to and long-distance services on the Cross Country Route from through to or (the zero milepost on the latter route is at the south end of platform 1). Until the mid-twentieth century, the station was also served by through trains from Manchester and Glasgow to London.
Local services from to along the Derwent Valley Line serve the station, as well as local and semi-fast services to , , Birmingham and .
Derby station has six platforms in regular use, connected by a footbridge which is used as an exit to Pride Park and a car park.
In 2018, the station was remodelled and re-signalled as part of a major upgrade programme. A bay platform was removed and a new island platform built on the site of the former goods lines and carriage sidings. At the same time, the remaining platforms were straightened. The updated design has separated the London and Birmingham lines allowing more movements to pass through the station and has increased line speed through all the platforms. There is a service platform numbered as platform 7 which was used for passenger services during the initial phase of the project but is not used in regular service.
Facilities
Derby station has lifts providing step free access to all platforms from both ends of the station. Platform 1 is accessible directly from the main ticket hall. Alternatively there's also a subway tunnel running from platform 1 to the platform 4/5 island.
There are public toilets on all platforms, with male, female, disabled, and baby change facilities. Derby does not currently have a changing places toilet. There are no toilets accessible without passing the barriers.
In the main ticket hall there is a Costa Pronto outlet, a WHSmiths, and a Gregg's. There are ticket machines along the outside wall, and ticket collection machines located between the ticket office and the barriers. There are free cash points next to WHSmiths.
On the platform 4/5 island there is a Pumpkin Cafe outlet, and there is a Costa outlet on the platform 6/7 island.
Outside of the main entrance there is a bus stop served by |
https://en.wikipedia.org/wiki/CoCoA | CoCoA (Computations in Commutative Algebra)
is a free computer algebra system developed by the University of Genova, Italy, used to compute with numbers and polynomials. The CoCoA Library (CoCoALib)
is available under GNU General Public License. CoCoA has been ported to many operating systems including Macintosh on PPC and x86, Linux on x86, Unix x86-64 & PPC, Solaris on SPARC and Windows on x86.
CoCoA is mainly used by researchers (see citations at
and),
but can be useful even for "simple" computations.
CoCoA's features include:
Very big integers and rational numbers using the GNU Multi-Precision Library
Multivariate Polynomials
Gröbner basis
User interfaces: text; Emacs-based; Qt-based
It is able to perform simple and sophisticated operations on multivariate polynomials and on various data related to them (ideals, modules, matrices, rational functions). For example, it can readily compute Gröbner basis, syzygies and minimal free resolutions, intersection, division, the radical of an ideal, the ideal of zero-dimensional schemes, Poincaré series and Hilbert functions, factorization of polynomials, and toric ideals. The capabilities of CoCoA and the flexibility of its use are further enhanced by the dedicated high-level programming language.
Its mathematical core, CoCoALib, has been designed as an open source C++ library, focussing on ease of use and flexibility.
CoCoALib is based on GNU Multi-Precision Library.
CoCoALib is used by
ApCoCoA
and
NmzIntegrate
See also
List of computer algebra systems
Standard Template Library
References
External links
ApCoCoA, an extension of CoCoA
Computer algebra system software for Linux
Free computer algebra systems
Science software that uses Qt |
https://en.wikipedia.org/wiki/Malden%20Manor%20railway%20station | Malden Manor railway station, in the Royal Borough of Kingston upon Thames in south London is one of the stations on the Chessington Branch Line, part of the London suburban network of South Western Railway, and is in Travelcard Zone 4. It is down the line from .
Like all others on the branch, the station is built in the concrete style of the 1930s (see external link); it was designed by James Robb Scott and opened on 29 May 1938. South-west of the station is a three-span, 140 ft (42m) viaduct over the Hogsmill River, a tributary of the River Thames.
Both platforms were extended to take ten-coach trains on 8 May 2014.
Services
South Western Railway operate half-hourly services between London Waterloo and Chessington South.
Connections
London Buses route S3 and route K1 both serve this station.
References
Railway stations in the Royal Borough of Kingston upon Thames
Former Southern Railway (UK) stations
Railway stations in Great Britain opened in 1938
Railway stations served by South Western Railway
James Robb Scott buildings |
https://en.wikipedia.org/wiki/Simple%20Simpson | "Simple Simpson" is the nineteenth episode of the fifteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on May 2, 2004 and was the final episode to be directed by Jim Reardon.
Plot
After seeing a commercial where he could win a free tour of "Farmer Billy's Bacon" factory, Homer goes on a pursuit to find the golden ticket. He, however, only wins a silver ticket, which allows him to be the judge of the pig competition at the Springfield County Fair. At the fair, Lisa's entry in the place setting competition is wrecked by the Rich Texan, who then mocks her, which causes Homer to want to retaliate. Recalling a warning from Chief Wiggum that he will be arrested if he commits another assault felony, Homer disguises himself as a masked superhero, the "Pie Man", and throws a pie straight into the Rich Texan's face, leaving him humiliated and the crowd laughing. The next day, after Homer hears that the Comic Book Guy has ripped off Bart, he arrives as the Pie Man (with a newer look) and throws a pie in his face, humiliating him in front of Nichelle Nichols, whom the Comic Book Guy invited for tea and some chit chat, and then promptly leaves as soon as she sees his face with pie (saying she would not date William Shatner for the same reason).
As the days go by, the Pie Man becomes big news, pieing many of "Springfield's scoundrels". Springfield's citizens anticipate that the Pie Man will come to the opening ceremony for the new cosmetic surgery clinic, which Mayor Quimby has built in place of the previous occupant, the Springfield Children's Hospital. Chief Wiggum also has a trap planned for the Pie Man, who has been skipping "bike safety lectures". As expected, Pie Man arrives, but as the trap is sprung on him, Pie Man escapes, though not before being shot in the arm. He also saves Marge from being trampled by the panicking crowd and steals a kiss from her, which causes Marge to become infatuated with Pie Man. Returning home and after prying the bullet out of his arm, Homer is exposed as the Pie Man by Lisa, who had suspected him to be the Pie Man after repeatedly getting his mail. Homer reveals his secret life in the "Pie Cave", which is just the basement, where Lisa pleads with Homer to stop his Pie Man persona before he gets more seriously hurt. Homer promises to stop.
Yet the next day at the power plant, Homer cannot cope with Mr. Burns's bullying of him and his co-workers. After imagining a conversation with pies, Homer decides to be Pie Man one last time to get back at Burns. After pieing him, Homer tries to run off, but falls asleep on a couch right behind Burns and Smithers, who capture and expose him. Burns promptly blackmails Homer to be his "personal hitman", to pie those that Burns hates, or else be ratted out to the police and forced to do community service.
After pieing himself and later a Girl Scout selling cookies, Homer is tasked by Burns to pie Tibetan Bu |
https://en.wikipedia.org/wiki/Meta-process%20modeling | Meta-process modeling is a type of metamodeling used in software engineering and systems engineering for the analysis and construction of models applicable and useful to some predefined problems.
Meta-process modeling supports the effort of creating flexible process models. The purpose of process models is to document and communicate processes and to enhance the reuse of processes. Thus, processes can be better taught and executed. Results of using meta-process models are an increased productivity of process engineers and an improved quality of the models they produce.
Overview
Meta-process modeling focuses on and supports the process of constructing process models. Its main concern is to improve process models and to make them evolve, which in turn, will support the development of systems. This is important due to the fact that "processes change with time and so do the process models underlying them. Thus, new processes and models may have to be built and existing ones improved". "The focus has been to increase the level of formality of process models in order to make possible their enactment in process-centred software environments".
A process meta-model is a meta model, "a description at the type level of a process model. A process model is, thus, an instantiation of a process meta-model. [..] A meta-model can be instantiated several times in order to define various process models. A process meta-model is at the meta-type level with respect to a process."
There exist standards for several domains:
Software engineering
Software Process Engineering Metamodel (SPEM) which is defined as a profile (UML) by the Object Management Group.
Topics in metadata modeling
There are different techniques for constructing process models. "Construction techniques used in the information systems area have developed independently of those in software engineering. In information systems, construction techniques exploit the notion of a meta-model and the two principal techniques used are those of instantiation and assembly. In software engineering the main construction technique used today is language-based. However, early techniques in both, information systems and software engineering were based on the experience of process engineers and were, therefore, ad hoc in nature."
Ad hoc
"Traditional process models are expressions of the experiences of their developers. Since this experience is not formalised and is, consequently, not available as a fund of knowledge, it can be said that these process models are the result of an ad hoc construction technique. This has two major consequences: it is not possible to know how these process models were generated, and they become dependent on the domain of experience. If process models are to be domain independent and if they are to be rapidly generable and modifiable, then we need to go away from experience based process model construction. Clearly, generation and modifiability relate to the process management polic |
https://en.wikipedia.org/wiki/France%204 | France 4 () is a French free-to-air television channel owned by France Télévisions, focused on children's programming. The colour of France 4 is purple.
Originally launched as Festival in 1996, the channel took its current name in 2005 when it became a free channel. The channel targets young audiences, and children during the day. In 2016, France 4 was refocused on family programming.
History
Festival (1996–2005)
On 24 June 1996, France Télévision established Festival, a satellite channel for the TPS satellite service, which France Télévision co-owned at the time. Festival offered a selection of films and television series, many of them previously seen on France 2, France 3 and Arte.
France 4 (2001–present)
In 2001, when the French digital terrestrial television system was in its developmental stage, the socialist government of Lionel Jospin asked the president of France Télévisions to consider a bouquet of public channels to be broadcast digitally, so that the public broadcaster could have involvement in this project. France Télévisions proposed the creation of three new channels: "France 1", "France 4" and "France 6", an all-news channel, a channel dedicated to the regions, and a channel featuring repeat broadcasts of France 2 and France 3.
Eventually, France Télévisions would have four digital channels besides France 2 and France 3, with three of them occupying existing channels: France 5 (formerly La Cinquième), Arte, and La Chaîne Parlementaire (a legislative channel); France 5 and Arte would switch from a combined service to two separate 24-hour services in the spring of 2005. France Télévisions thus only had space for one more new channel. The group eventually proposes the existing "Festival" to be the "new" channel. On 23 October 2002, the Audiovisual Superior Council authorised Festival to begin broadcasting in digital. France Télévisions planned for Festival to be renamed "France 8" (as it would have been the eighth television network in France) or "France Prime", but opted instead for France 4 after being allocated to channel 14. The newly created France 4 proposed to present a variety of entertainment, sports, fiction, cinema and series.
In July 2009, France 4 began broadcasting in 16:9. On 6 October 2011, France 4 launched its HD feed.
On 19 December 2009, France Télévisions launched Ludo, a new unique children's brand, to merge all former blocks Toowam (France 3), Les Zouzous (France 5, for preschoolers) and KD2A (France 2, the channel ceased to broadcast children shows). Ludo was broadcast on France 3 (focusing on generalist children's shows), France 5 (for preschoolers) and France 4 focused on more teenagers programs like 6teen, live-action shows and action shows, and broadcasts at middays and preevenings. Due to bad ratings, Ludo was removed from France 5 and France 4 on 25 June 2011: on France 5, it became Zouzous, and on France 4, the children's shows became broadcast without a branded block.
France 4 continued to bro |
https://en.wikipedia.org/wiki/Visual%20radio | Visual radio is a generic term for adding visuals to audio radio broadcasts. Visual Radio is also a trademark for a Nokia product which delivers interactive FM radio over a data connection.
Visual Radio
Visual Radio is a technology developed by Nokia. Visual Radio is built-in functionality available in an increasing number of phones that are already equipped with analog FM radio.
Workings
The audio is received via a regular analog FM radio embedded in the phone. A presentation of graphics and text, synchronized to the audio programming, is streamed to the phone over a data connection and the FM transmission chain is unaffected by the addition of Visual Radio.
Limitations
On phones with built-in Wi-Fi (tested on Nokia E51, E63, E66, E71, N78, N79, N81, N82 a, and N95 8GB), the Nokia application does not allow a Wi-Fi access point to be used for the data connection, only GPRS access points are allowed, allowing the possibility of revenue sharing between Nokia, the Radio stations and GPRS network operators.
Platform components
The platform is composed of three parts:
A Visual Radio Tool that can be integrated with the radio station's legacy play-out system, so the interactive visual channel created by the radio station's content producer is synchronized with the audio programming.
A Visual Radio server that handles the two-way traffic between the audience and radio stations;
A Visual Radio client application on the mobile phone, that displays the interactive visual channel and takes care of user interaction.
The Visual Radio concept was created by Nokia and the platform was originally offered to radio stations and operators globally by HP. Since October 2007, Nokia has been collaborating with RCS Inc., of New York, whose Selector music scheduling system is used by thousands of radio stations around the world. RCS produces the second-generation version of the Visual Radio platform and also markets a similar product for the Internet (and most other digital platforms) under the RCS RadioShow brand.
The interactive visual channel is produced by the radio station. Interactivity options include quizzes, messaging, content download, commerce, etc.
Stations
Kiss FM (Finland) (now defunct) was the first radio station that started using Visual Radio. Other stations supporting Visual Radio included the UK's GWR Bristol, GWR Bath, Virgin Radio (now Absolute Radio), The Voice in Helsinki, Mediacorp stations in Singapore, Radio Mirchi station in New Delhi India, and Los 40 Principales in Spain. RAI has done test transmissions with Visual radio in some selected areas. In Belgium Radio Contact Radio Contact Vision) and Q-music support Visual Radio as a TVTV statio not and they also transmit Visual Radio on the internet.
Devices supported
Nokia is making the Visual Radio client available to users of other phones, and has announced that they are producing a Java applet to enable this.
Nokia 3110 classic, Nokia 3120 classic, Nokia 3230, Nokia |
https://en.wikipedia.org/wiki/Stephen%20C.%20Johnson | Stephen Curtis Johnson (b. 1944; known as Steve Johnson) is a computer scientist who worked at Bell Labs and AT&T for nearly 20 years. He is best known for Yacc, Lint, spell, and the Portable C Compiler, which contributed to the spread of Unix and C. He has also contributed to fields as diverse as computer music, psychometrics and VLSI design.
Life and education
Johnson's passion for computing started at age five, when his grandfather took him along to his work at the Bureau of Standards. The computer he saw ("the size of a small house") made a strong impression on him, and he decided he "wanted to work with computers, and never looked back after".
There were no computer science classes in college, so he studied mathematics, in which he eventually earned a PhD.
Career
Bell Labs and AT&T
Johnson joined Bell Labs and AT&T in the 1960s and worked on Unix tools for nearly 20 years, alongside computer scientists like Jeffrey Ullman, Dennis Ritchie and Alfred Aho. He was best known for writing Yacc, Lint, and the Portable C Compiler.
In the mid-1970s, Johnson and Bell colleague Dennis Ritchie co-authored the first AT&T Unix port. They also "demonstrated that Unix was portable", which Ritchie considers the spark that led to Unix becoming widespread. In the mid-1980s, he served as the head of the UNIX Languages Department (UNIX System V).
Johnson developed Yacc in the early '70s because he wanted to insert an exclusive or operator into Ritchie's B language compiler. Bell Labs colleague Alfred Aho suggested he look at Donald Knuth's work on LR parsing, which served as the basis for Yacc. In a 2008 interview, Johnson reflected that "the contribution Yacc made to the spread of Unix and C is what I'm proudest of". Lint was developed in 1978 while Johnson was debugging the Yacc grammar he was writing for C and struggling with portability issues stemming from porting Unix to a 32-bit machine.
Silicon Valley
In 1986, Johnson moved to Silicon Valley, where he joined several startups, where he worked mostly on compilers, but also 2D and 3D graphics, massively parallel computing and embedded systems. The startups included Dana Computer, Inc., Melismatic Software, and Transmeta, which made low-power, Intel-compatible microprocessors.
Johnson served on the USENIX board for ten years, including four years as president in the early 1990s. He now serves as the USENIX representative to the Computing Research Association.
Later career
In 2002, he moved to Boston to work at MathWorks, where he helped maintain the front end of the MATLAB programming language, for which he also built a lint product called M-Lint. He had met MathWorks founder Cleve Moler while working at a Silicon Valley startup and developed a "long-distance consulting relationship" with him in the 1990s.
As of 2018 Johnson currently lived in Morgan Hill, California busy working on energy-efficient computers for machine learning at Wave Computing.
References
Unix people
Scientists at Bell Labs |
https://en.wikipedia.org/wiki/NIS%2B | NIS+ is a directory service developed by Sun Microsystems to replace its older 'NIS' (Network Information Service). It is designed to eliminate the need for duplication across many computers of configuration data such as user accounts, host names and addresses, printer information and NFS disk mounts on individual systems, instead using a central repository on a master server, simplifying system administration. NIS+ client software has been ported to other Unix and Unix-like platforms.
Prior to the release of Solaris 9 in 2002, Sun announced its intent to remove NIS+ from Solaris in a future release and now recommends that customers instead use an LDAP-based lookup scheme.
NIS+ was present in Solaris 9 and 10 (although both releases include tools to migrate NIS+ data to an LDAP server) and it has been removed from Solaris 11.
NIS vs. NIS+
NIS and NIS+ are similar only in purpose and name, otherwise, they are completely different implementations. They differ in the following ways:
NIS+ is hierarchical.
NIS+ is based around Secure RPC (servers must authenticate clients and vice versa).
NIS+ may be replicated (replicas are read-only).
NIS+ implements permissions on directories, tables, columns and rows.
NIS+ also implements permissions on operations, such as being able to use to transfer changed data from a master to a replica.
The problem of managing network information
In the 1970s, when computers were expensive, and networks consisted of a small number of nodes, administering network information was manageable, and a centralized system was not needed. As computers became cheaper and networks grew larger, it became increasingly difficult to maintain separate copies of network configurations on individual systems.
For example, when a new user was added to the network, the following files would need to be updated on every existing system:
Likewise, would have needed updating every time a new group was added and would have needed updating every time a new computer was added to the network.
If a new user with a new system was added to a network of 20 existing systems, the UNIX administrator would need to modify 5 files on 21 machines - 105 files in all. With NIS+, adding users and machines to the network requires changes only to the NIS+ server's maps and the new host's /etc/nsswitch.conf needs to point to the NIS+ server. When a user logs into any other machine, that host (the NIS+ client), knowing who the NIS+ server is, queries it for the username and password to identify and authenticate the user.
NIS+ also manages several other types of data: NFS mounts (auto_master, auto_home), network booting and other parameters (bootparams, ethers, netmasks, netgroup, networks, protocols, rpc, services), security access (cred), aliases, and time zone.
An installation of NIS+ comes with such table structures predefined. There are facilities available to create other tables as needed.
Alternatives
Other alternative schemes for storing |
https://en.wikipedia.org/wiki/System%20Center%20Operations%20Manager | System Center Operations Manager (SCOM) is a cross-platform data center monitoring system for operating systems and hypervisors. It uses a single interface that shows state, health, and performance information of computer systems. It also provides alerts generated according to some availability, performance, configuration, or security situation being identified. It works with Microsoft Windows Server and Unix-based hosts.
History
The product began as a network management system called SeNTry ELM, which was developed by the British company Serverware Group plc. In June 1998 the intellectual property rights were bought by Mission Critical Software, Inc. who renamed the product Enterprise Event Manager. Mission Critical undertook a complete rewrite of the product, naming the new version OnePoint Operations Manager (OOM). Mission Critical Software merged with NetIQ in early 2000, and sold the rights of the product to Microsoft in October 2000. It was later renamed into Microsoft Operations Manager (MOM) - in 2003, Microsoft began work on the next version of MOM: It was called Microsoft Operations Manager 2005 and was released in August 2004. Service Pack 1 for MOM 2005 was released in July 2005 with support for Windows 2003 Service Pack 1 and SQL Server 2000 Service Pack 4. It was also required to support SQL Server 2005 for the operational and reporting database components. The development for the next version—at this time its codename was “MOM V3”—began in 2005. Microsoft renamed the product System Center Operations Manager and released System Center Operations Manager 2007 in March 2007. System Center Operations Manager 2007 was designed from a fresh code base, and although sharing similarities to Microsoft Operations Manager, is not an upgrade from the previous versions.
2009
In May 2009 System Center Operations Manager 2007 had a so-called “R2” release - the general enhancement was cross platform support for UNIX and Linux servers. Instead of publishing individual service packs, bug fixes to the product after System Center Operations Manager 2007 R2 were released in the form of so-called cumulative updates (CUs).
Central concepts
The basic idea is to place a piece of software, an agent, on the computer to be monitored. The agent watches several sources on that computer, including the Windows Event Log, for specific events or alerts generated by the applications executing on the monitored computer. Upon alert occurrence and detection, the agent forwards the alert to a central SCOM server. This SCOM server application maintains a database that includes a history of alerts. The SCOM server applies filtering rules to alerts as they arrive; a rule can trigger some notification to a human, such as an e-mail or a pager message, generate a network support ticket, or trigger some other workflow intended to correct the cause of the alert in an appropriate manner.
SCOM uses the term management pack to refer to a set of filtering rules spe |
https://en.wikipedia.org/wiki/Traction%20power%20network | A traction network or traction power network is an electricity grid for the supply of electrified rail networks. The installation of a separate traction network generally is done only if the railway in question uses alternating current (AC) with a frequency lower than that of the national grid, such as in Germany, Austria and Switzerland.
Alternatively, the three-phase alternating current of the power grid can be converted in substations by rotary transformers or static inverters into the voltage and type of current required by the trains. For railways which run on direct current (DC), this method is always used, as well as for railways which run on single-phase AC of decreased frequency, as in Mecklenburg-Western Pomerania, Saxony-Anhalt, Norway and Sweden. In these areas there are no traction current networks.
History
Separate power for traction apart from industrial power has historic roots. There is no reason today to apply different frequencies or current types than for transmission and for industrial usage. However, the advantage with DC traction was the easier transmission with single copper wires to the feeder points. The advantage with AC traction is the easier transmission over long distances to the feeder points. Beyond these parameters and securing former investment, no evidence exists to stay with different current schemes in networks.
Applications
Dedicated traction current lines are used when railways are supplied with low-frequency alternating current (AC). The traction current supply line is connected to substations along the line of the railway and is usually run separately from the overhead catenary wire from which the locomotives are fed.
In countries in which the electric trains run with direct current or with single-phase alternating current with the frequency of the general power grid, the required conversion of the current is performed in the substations, so again no traction current lines are required.
Traction current supply lines are not usually laid parallel to the railway line, in order to allow a shorter line length and to avoid unnecessary influences to the electrical system near the railway line; this also is applied to the current supply of some rapid-transit railways operating with alternating current in Germany.
It is also possible to lay out the traction current supply on special cross beams right on the overhead wire pylons above the catenary wire. Because the overhead line pylons have a smaller cross section than traction current supply masts, the cross beams cannot be too wide, so the standard arrangement of four conductor cables in one level cannot be used. In this case, a two-level arrangement is used, or with two electric circuits for double-railed lines the overhead line pylons for both directions are equipped with cross beams for their own traction current system of two conductor cables each.
In densely populated areas, there are pylons which carry circuits for both traction current and for t |
https://en.wikipedia.org/wiki/Baidu | Baidu, Inc. ( ; , meaning "hundred times") is a Chinese multinational technology company specializing in Internet-related services, products, and artificial intelligence (AI), headquartered in Beijing's Haidian District. It is one of the largest AI and Internet companies in the world. The holding company of the group is incorporated in the Cayman Islands. Baidu was incorporated in January 2000 by Robin Li and Eric Xu. Baidu has origins in RankDex, an earlier search engine developed by Robin Li in 1996, before he founded Baidu in 2000.
Baidu offers various services, including a Chinese search engine, as well as a mapping service called Baidu Maps. Baidu offers about 57 search and community services, such as Baidu Baike (an online encyclopedia), Baidu Wangpan (a cloud storage service), and Baidu Tieba (a keyword-based discussion forum).
Baidu Global Business Unit (GBU) is responsible for Baidu's international products and services for markets outside of China. Baidu GBU's product portfolio includes keyboard apps Simeji and Facemoji Keyboard, content recommendation platform popIn, augmented reality network OmniAR, Japanese smart projector popIn Aladdin, and ad platform MediaGo, which is focused on Chinese advertisers looking to reach overseas users. In 2017, Baidu GBU entered into a partnership with Snap Inc. to act as the company's official ad reseller for Snapchat in Greater China, South Korea, Japan and Singapore. The partnership was extended in 2019.
In 2018, Baidu divested the "Global DU business" portion of its overseas business, which developed a series of utility apps including ES File Explorer, DU Caller, Mobojoy, Photo Wonder and DU Recorder, etc. This business now operates independently of Baidu under the name DO Global.
Baidu has the second largest search engine in the world, and held a 76.05% market share in China's search engine market. In December 2007, Baidu became the first Chinese company to be included in the NASDAQ-100 index. As of May 2018, Baidu's market cap rose to US$99 billion. In October 2018, Baidu became the first Chinese firm to join the United States-based computer ethics consortium Partnership on AI.
History
Early development
In 1994, Robin Li (Li Yanhong, 李彦宏) joined IDD Information Services, a New Jersey division of Dow Jones and Company, where he helped develop software for the online edition of The Wall Street Journal. He also worked on developing better algorithms for search engines and remained at IDD Information Services from May 1994 to June 1997.
In 1996, while at IDD, Li developed the RankDex site-scoring algorithm for search engines results page ranking and received a US patent for the technology. Launched in 1996, RankDex was the first search engine that used hyperlinks to measure the quality of websites it was indexing. Li referred to his search mechanism as "link analysis," which involved ranking the popularity of a web site based on how many other sites had linked to it. It predated the similar |
https://en.wikipedia.org/wiki/IJVM | IJVM is an instruction set architecture created by Andrew Tanenbaum for his MIC-1 architecture. It is used to teach assembly basics in his book Structured Computer Organization.
IJVM is mostly a subset of the JVM assembly language that is used in the Java platform. This instruction set is so simple that it's difficult to write complex programs in it (for example, no shift instructions are provided).
IJVM Instructions
There's also a set of special ARRAY instructions.
*where the first value was pushed on the stack first, so the top of the stack is the operand at the bottom of the lists shown above.
Operand descriptions
byte: A numeric literal, in octal (032 - leading zero), decimal (26 - no leading digits), or hexadecimal (0x1A - leading zero-x) format. Character literals ('M - leading single quote) are also allowed. Compiled to a 1-byte constant.
label name: The string name of a label. Compiled to a 2-byte offset.
variable name: The string name of a local variable. Compiled to a 1-byte value, indicating an offset into the local variable frame.
method name: The string name of a method. When compiled, the address of the method is calculated and put into the constant pool. This operand is then replaced with the 2-byte index (in the constant pool) of the address.
constant name: The string name of a constant. Compiled to a 2-byte index.
N/A: This instruction takes no operands.
External links
mic1 Free and open source MIC-1 microarchitecture simulator and IJVM assembler.
emuIJVM Open source and free, with a stack animation IJVM simulator developed by students at the University of Catania (for Windows, Mac, Linux)
A Vrije Universiteit Amsterdam course assignment on implementing an interpreter/ emulator for the IJVM instruction set
Assembly languages |
https://en.wikipedia.org/wiki/Lockstep%20%28computing%29 | Lockstep systems are fault-tolerant computer systems that run the same set of operations at the same time in parallel. The redundancy (duplication) allows error detection and error correction: the output from lockstep operations can be compared to determine if there has been a fault if there are at least two systems (dual modular redundancy), and the error can be automatically corrected if there are at least three systems (triple modular redundancy), via majority vote. The term "lockstep" originates from army usage, where it refers to synchronized walking, in which marchers walk as closely together as physically practical.
To run in lockstep, each system is set up to progress from one well-defined state to the next well-defined state. When a new set of inputs reaches the system, it processes them, generates new outputs and updates its state. This set of changes (new inputs, new outputs, new state) is considered to define that step, and must be treated as an atomic transaction; in other words, either all of it happens, or none of it happens, but not something in between. Sometimes a timeshift (delay) is set between systems, which increases the detection probability of errors induced by external influences (e.g. voltage spikes, ionizing radiation, or in situ reverse engineering).
Lockstep memory
Some vendors, including Intel, use the term lockstep memory to describe a multi-channel memory layout in which cache lines are distributed between two memory channels, so one half of the cache line is stored in a DIMM on the first channel, while the second half goes to a DIMM on the second channel. By combining the single error correction and double error detection (SECDED) capabilities of two ECC-enabled DIMMs in a lockstep layout, their single-device data correction (SDDC) nature can be extended into double-device data correction (DDDC), providing protection against the failure of any single memory chip.
Downsides of the Intel's lockstep memory layout are the reduction of effectively usable amount of RAM (in case of a triple-channel memory layout, maximum amount of memory reduces to one third of the physically available maximum), and reduced performance of the memory subsystem.
Dual modular redundancy
Where the computing systems are duplicated, but both actively process each step, it is difficult to arbitrate between them if their outputs differ at the end of a step. For this reason, it is common practice to run DMR systems as "master/slave" configurations with the slave as a "hot-standby" to the master, rather than in lockstep. Since there is no advantage in having the slave unit actively process each step, a common method of working is for the master to copy its state at the end of each step's processing to the slave. Should the master fail at some point, the slave is ready to continue from the previous known good step.
While either the lockstep or the DMR approach (when combined with some means of detecting errors in the master) can provide r |
https://en.wikipedia.org/wiki/MIC-1 | The MIC-1 is a processor architecture invented by Andrew S. Tanenbaum to use as a simple but complete example in his teaching book Structured Computer Organization.
It consists of a very simple control unit that runs microcode from a 512-words store.
The Micro-Assembly Language (MAL) is engineered to allow simple writing of an IJVM interpreter, and the source code for such an interpreter can be found in the book.
Hardware
Data path
The data path is the core of the MIC-1. It contains 32-bit registers, buses, an ALU and a shifter.
Buses
There are 2 main buses of 32 lines (or 32 bits) each:
B bus: connected to the output of the registers and to the input of the ALU.
C bus: connected to the output of the shifter and to the input of the registers.
Registers
Registers are selected by 2 control lines: one to enable the B bus and the other to enable the C bus.
The B bus can be enabled by just one register at a time, since the transfer of data from 2 registers at the same time, would make this data inconsistent.
In contrast, the C bus can be enabled by more than 1 register at the same time; as a matter of fact, the current value present in the C bus can be written to more than 1 register without problems.
The reading and writing operations are carried out in 1 clock cycle.
The MBR register is a readonly register, and it contains 2 control lines. Since it is an 8-bit register, its output is connected to the least significant 8 bits of the B bus. It can be set to provide its output in 2 ways:
2's complement (MBR): all the remaining 24 bits of the B bus are set to 1, if it's a negative number, or they are set to 0, if it's a positive number (sign extension).
Without complement (MBRU): the remaining 24 bits (of 32 total) are set to 0.
ALU
The ALU (or arithmetic logic unit) has the following input, output and control lines:
2 32-bit input lines: one for the B bus and one for the bus that is connected directly to the H register.
1 32-bit output line, which is connected directly to the shifter.
6 control lines aimed to select which operation to perform.
2 other output lines for the status flags N (negative) and Z (zero).
Shifter
The shifter contains a 32-bit input and output. The output is connected directly to the C bus. The shifter is used to perform logical and arithmetic shift operations, by simply setting respectively the control signal SLL8 (Shift Left Logical) and SRA1 (Shift Right Arithmetic).
External links
Article about implementing an Mic-1 virtual Machine in VHDL
mic1, an open source MIC-1 simulator, including MAL and IJVM assemblers
emuMIC open source, free and animated MIC-1 emulator, developed by students of the University of Catania (for Windows, Mac and Linux)
Mic1MMV, the MIC-1 simulator included in the 5th edition of "Structured Computer Organization" by Andrew S. Tanenbaum
mic1 another open source MIC-1 simulator written by UMass Lowell students, which includes an assembler and microcode compiler
Instr |
https://en.wikipedia.org/wiki/Friend%20or%20Foe%3F%20%28game%20show%29 | Friend or Foe? is an American game show based on knowledge and trust which aired on Game Show Network. Three teams of two strangers attempted to persuade their partner into sharing their accumulated winnings rather than stealing it for themselves.
The show premiered June 3, 2002, and aired for two seasons totaling 105 episodes. It was hosted by Lisa Kennedy Montgomery, who was credited as "Kennedy", except for the April Fool's Day 2003 episode (the final first-run episode), in which Mark L. Walberg, the host of Russian Roulette, hosted as part of GSN's April Fools prank; the hosts traded shows for the day, made cameo appearances, and played for charity on Lingo.
The show "re-debuted" in 2008, re-airing episodes from the series during that year.
Gameplay
Main game
At the start of the game, three of the six contestants secretly choose one of the other three contestants as their teammates. If two or more contestants choose the same contestant as a potential partner, the potential partner selects the contestant to team with. A second round of voting is held if necessary until all three teams have been formed. Each team is then given a "trust fund." In season one, each team's fund began with $200.
The main game is played in two rounds. In each round, Montgomery asks a series of four multiple-choice questions, each with four answer choices. On each question, the teammates have 15 seconds to agree on an answer and simultaneously lock it in on separate keypads. Correct answers add $500 to the trust fund in round one, and $1,000 in round two, and there is no penalty for incorrect answers or failing to respond in time. At the end of each round, the team with the lowest total is eliminated and must go to the "Trust Box" to determine the fate of their money. If there is a tie for low score, the team that took more time overall to lock in their answers for that round is eliminated.
The Trust Box presents the eliminated team with a variation of the prisoner's dilemma. Each contestant attempts to persuade the other to trust him or her, after which they secretly vote "friend" or "foe." If both vote "friend," they split the trust fund evenly. If one votes "friend" and the other "foe," the foe collects the entire trust fund and the friend receives nothing. If both vote "foe," neither contestant wins any money.
Endgame
In the "Right or Wrong?" bonus round, the team has 60 seconds to answer a maximum of 10 questions, each of which has two answer choices. Each correct answer adds $500 to the trust fund, while each miss penalizes the team with a strike. The round ends immediately if the team earns three strikes. Answering all 10 questions correctly doubles the entire trust fund, for a potential maximum of $22,400. The team then advances to the Trust Box in the manner described above.
Season two changes
In season two, contestants were randomly assigned to teams instead of secretly selecting partners, and the teams were not spotted any money at the beginning of |
https://en.wikipedia.org/wiki/Papilio%20multicaudata | Papilio multicaudata, the two-tailed swallowtail, is a species of the family Papilionidae found in western North America from British Columbia to Central America.
Description
The two-tailed swallowtail is a large swallowtail of western North America, one of several species that have yellow wings with black tiger striping. Each hindwing has several blue markings (top and bottom). Like other striped swallowtails, it has a small orange eyespot near the lower angle of each hindwing; the eyespots can fool predators into attacking the rear of the butterfly instead of the head, giving the butterfly a chance to escape. Its appearance is similar to the western, and eastern tiger swallowtails, but has narrower black stripes and usually two tails on each hindwing (rather than only one). Most two-tails have a black "slit pupil" in the orange eyespot on each hindwing, never present in western tiger. It is also usually larger than similar swallowtails within its range, although some eastern tiger swallowtails are as big as any two-tailed. The wingspan ranges from , making it the largest swallowtail in western North America. As is the case with most swallowtails, females are larger and more brightly colored than males, having more blue in a submarginal band around orange spots on the hindwing upperside, and a deeper yellow background color that can shade to orange. Females also have wider black stripes on the forewings than males. Males may engage in mud-puddling, and have claspers that can be seen as a yellow segment at the end of the abdomen, beyond the black abdominal stripes.
It does not tend to hybridize with related species as do the western, eastern, and Canadian tiger swallowtails.
The butterfly can be seen from Guatemala, through Mexico, the western United States to southern Canada in southern British Columbia, Alberta and southwestern Saskatchewan. It typically lives near streams and in moist valleys but also in canyons and cities at lower elevations.
Host plants include: chokecherry, bitter cherry, Arizona rosewood, single-leaf ash, hoptree, and Arizona sycamore. In California it mostly uses California hoptree. Elsewhere in the West, it often uses green ash planted along city roads (in California, city habitats are usually occupied by western tiger swallowtails rather than two-tailed).
The two-tailed swallowtail is the state butterfly of Arizona.
Life cycle
Adults fly during spring and summer and there is one brood. Females lay eggs singly on the host plant. The caterpillar will fold the host plant's leaves and tie them together with silk they will then eat from this structure. The pupae will overwinter then emerge in May.
Subspecies
Listed alphabetically:
P. m. grandiosus Austin & Emmel, 1998 – Mexican mountains.
P. m. multicaudata Kirby, 1884 – widespread subspecies from southern Colorado, northern New Mexico, south through Arizona, New Mexico, Texas and much of Mexico.
P. m. pusillus Austin & Emmel, 1998 – widespread northern sub |
https://en.wikipedia.org/wiki/24%20Hours%20in%20Cyberspace | 24 Hours in Cyberspace (February 8, 1996) was "the largest one-day online event" up to that date, headed by photographer Rick Smolan with Jennifer Erwitt, Tom Melcher, Samir Arora and Clement Mok. The project brought together the world's top 1,000 photographers, editors, programmers, and interactive designers to create a digital time capsule of online life."
Overview
24 Hours in Cyberspace was an online project which took place on the then-active website, cyber24.com (and is still online at a mirror website maintained by Georgia Tech). At the time, it was billed as the "largest collaborative Internet event ever", involving thousands of photographers from all over the world, including 150 of the world's top photojournalists. Then Second Lady Tipper Gore was one of its photographers. In addition, then Vice President Al Gore contributed the introductory essay to the Earthwatch section of the website. In this essay, he discusses the impact of the Internet on the environment, education, and increased communication between people.<ref>[http://undertow.arch.gatech.edu/Homepages/virtualopera/cyber24/SITE/essay/gore.htm Vice President Al Gore's introduction to Earthwatch: 24 Hours In Cyberspace] </ref>
The goal was not to show pictures of websites and computer monitors, but rather images of people whose lives were affected by the use of the growing Internet. Photographs were sent digitally to editors working real-time to choose the best pictures to put on the project's website. The website received more than 4 million hits in the 24 hours that the project was active.24 Hours in Cyberspace served as a cover story for U.S. News & World Report.
The technological infrastructure of the project was provided by a startup company spinoff from Apple Computer named NetObjects that was founded by Samir Arora, David Kleinberg, Clement Mok and Sal Arora. The system supplied by NetObjects allowed Smolan's international network of editors and photojournalists to submit text and images through web forms; it ran on Unix, relied on a database for content storage (Illustra) and used templating for easy and near-instantaneous page generation that obviated the need for the site's editorial staff to have any coding skills. NetObjects was first to create the technology that would enable a team of the world's top picture editors and writers to become instant Web page designers. It let them do what they do best—edit and write—and automatically generate finished, sophisticated Web pages that millions of people were able to see only minutes after they were designed. Three million people clicked onto the 24 Hours site; the blaze of publicity surrounding the 24 Hours in Cyberspace project helped NetObjects raise $5.4 million in venture capital.
The project reportedly cost as much as $5 million, and was funded with assistance from 50 companies, mostly in the form of loans of computer hardware and technology experts. Adobe Systems, Sun Microsystems and Kodak were listed as major s |
https://en.wikipedia.org/wiki/Police%20National%20Computer | The Police National Computer (PNC) is a database used by law enforcement organisations across the United Kingdom and other non-law enforcement agencies. Originally developed in the early 1970s, PNC1 went 'live' in 1974, providing UK police forces with online access to the lost/stolen vehicle database. The vehicle owners application quickly followed, giving the police online access to the names/addresses of every vehicle owner in the UK.
The Police National Computer started holding nominal information based on the computerisation of criminal records held by the Metropolitan Police and other police forces in the late 1970s. These CRO records could be accessed online in real-time by all UK police forces via the "Names" applications. The PNC now consists of several databases available 24 hours a day, giving access to information of national and local matters. As of 18 January 2021, Kit Malthouse said that there are 13 million person records, 58.5 million driver records, and 62.6 million vehicle records stored on the PNC. The PNC is currently directly managed by the Home Office. Between 2007 and 2012, it was maintained by the National Policing Improvement Agency (NPIA) which inherited the activities of the now disbanded Police Information Technology Organisation (PITO).
History
Since its inception in 1974, the PNC has undergone numerous changes that were gradually introduced. The most notable was the introduction of the Phoenix (Police and Home Office Enhanced Names Index) in 1995. This format has been retained to the present day.
The PNC is based on a Fujitsu BS2000/OSD SE700 mainframe with recent PNC applications held on UNIX servers. There are around 26,000 directly connected terminals and 25,000 terminals which are connected via local police force computer systems. The mainframe is connected to the end user by a multitude of ways, for high volume users (i.e. other police forces) via secure IP network, for low volume users a secure dial-up link provided by Cable & Wireless. Another connection method is via an X.25 packet-switched network; this method is being phased out. Databases for vehicles and driver licences are copied from the DVLA databases in the early morning (there is no service loss when an update is in progress). The mainframe server is located at the Hendon Data Centre with back-up servers located around the UK.
In 2005 the only back-up server was located next to Hertfordshire Oil Storage Terminal in Buncefield, which was the scene of a major civil emergency when it burned to the ground in December 2005. According to the Home Office the location had been assessed as low-risk notwithstanding that the site was from a disaster hazard and the site and its surroundings burned to the ground.
Users
Requests for access to PNC are decided upon by the PNC Information Access Panel (PIAP). The members of the panel are the National Police Chiefs' Council (NPCC), the Association of Police Authorities, and the Home Office. Delegated or subco |
https://en.wikipedia.org/wiki/Extensible%20MPEG-4%20Textual%20Format | The Extensible MPEG-4 Textual Format (XMT) is a high-level, XML-based file format for storing MPEG-4 data in a way suitable for further editing. In contrast, the more common MPEG-4 Part 14 (MP4) format is less flexible and used for distributing finished content.
It was developed by MPEG (ISO/IEC JTC 1/SC29/WG11) and defined in MPEG-4 Part 11 Scene description and application engine (ISO/IEC 14496-11).
XMT provides a textual representation of the MPEG-4 binary composition technology, based on XML. The XMT framework accommodates substantial portions of SMIL, W3C Scalable Vector Graphics (SVG) and X3D (the new name of VRML). Such a representation can be directly played back by a SMIL or VRML player, but can also be binarised to become a native MPEG-4 representation that can be played by an MPEG-4 player. Another bridge has been created with BiM (Binary MPEG format for XML).
See also
MPEG-4 Part 11
References
External links
MPEG-4, eXtensible MPEG-4 Textual Format (XMT) - Library of Congress
ISO/IEC 14496-11:2005 - Information technology -- Coding of audio-visual objects -- Part 11: Scene description and application engine
XMT: MPEG-4 Textual Format for Cross-Standard Interoperability by IBM
Computer file formats
MPEG-4
XML-based standards |
https://en.wikipedia.org/wiki/XMT | XMT can refer to:
Extensible MPEG-4 Textual Format, an XML-based file format for storing MPEG-4 data in a way suitable for further editing
Explicit multi-threading, a parallel computing paradigm designed around the parallel random-access machine
Cray XMT - a multithreaded supercomputing architecture, the successor to the Cray MTA-2
8-hydroxyfuranocoumarin 8-O-methyltransferase, an enzyme |
https://en.wikipedia.org/wiki/Rizon | Rizon is a large Internet Relay Chat (IRC) network with an average of around 20,000 users. The IRC network itself ranks number 5 among the largest IRC networks.
Rizon is popular with many anime fansubbing groups who work online, many of whom provide their content through XDCC via IRC bots in their distribution channels. It is also used by many users of eRepublik as a means of communication.
File sharing of other copyrighted material such as Warez is also common in some channels on the network.
Rizon IRCd
Rizon currently uses Plexus IRCd. Plexus was coded specifically with Rizon in mind and is based on ircd-hybrid. Plexus is not exclusive to Rizon as the IRCd is also used by other networks. Plexus versions 1.x and 2.x were originally coded by static & peer. Plexus 3.x was rewritten by ThaPrince and is now maintained and developed by the Rizon Dev Team.
As of the r524 release, the ability for automatic services authentication using SSL client certificates has been implemented, and was largely based on the work done by OFTC , though significant changes were made regarding server-to-server communication.
Controversy
DDoS attack against mIRCX
In early 2004 the mIRCX and Aniverse IRC networks were the victims of Denial-of-service attacks (DDoS) and were forced to shut down temporarily; Aniverse later resumed operations at a greatly reduced capacity. This in turn caused approximately 8,000–10,000 IRC users of various anime fansubbing channels to migrate to Rizon. Rizon was forced to increase its number of servers to handle the additional users. This also had the effect of making Rizon a target for DDoS attacks.
Contrary to rumors, Rizon had no part in a DDoS attack against mIRCX in 2004. Richard "Krashed" Roby was the actual perpetrator who initiated the attacks in retaliation against CJB networks for shutting down his botnet.
Roby was later raided by the FBI as part of Operation Cyberslam.
Initial charges brought against Roby as part of Operation Cyberslam were dropped but he later pleaded guilty to lesser charges and was sentenced to an 18-month prison sentence.
DDoS attacks against rival networks
On May 25, 2007, as part of Operation: Bot Roast conducted by the FBI, Rizon's founder, Jason Michael Downey aka "Nessun" was charged with using a botnet in 2004 to launch Denial-of-service attacks (DDoS) against other computer networks, including rival IRC networks such as IRCHighway.
On June 20, 2007, Downey pleaded guilty in a US Federal court to operating a botnet "of up to 6,000 infected computers" and using it to launch DDoS attacks "From on or about June 18, 2004 through on or about September 5, 2004." Downey faced up to 24 months in prison and a fine of up to $40,000.
When asked his reasons behind performing the DDoS attacks, Downey explained to U.S. District Judge Nancy G. Edmunds that "I was doing it because I could, more than anything," and "It was a dumb thing to do."
Downey was sentenced on October 23, 2007, to 12 months in prison fo |
https://en.wikipedia.org/wiki/K-d%20tree | In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. K-dimensional is that which concerns exactly k orthogonal axes or a space of any number of dimensions. k-d trees are a useful data structure for several applications, such as:
Searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches) &
Creating point clouds.
k-d trees are a special case of binary space partitioning trees.
Description
The k-d tree is a binary tree in which every node is a k-dimensional point. Every non-leaf node can be thought of as implicitly generating a splitting hyperplane that divides the space into two parts, known as half-spaces. Points to the left of this hyperplane are represented by the left subtree of that node and points to the right of the hyperplane are represented by the right subtree. The hyperplane direction is chosen in the following way: every node in the tree is associated with one of the k dimensions, with the hyperplane perpendicular to that dimension's axis. So, for example, if for a particular split the "x" axis is chosen, all points in the subtree with a smaller "x" value than the node will appear in the left subtree and all points with a larger "x" value will be in the right subtree. In such a case, the hyperplane would be set by the x value of the point, and its normal would be the unit x-axis.
Operations on k-d trees
Construction
Since there are many possible ways to choose axis-aligned splitting planes, there are many different ways to construct k-d trees. The canonical method of k-d tree construction has the following constraints:
As one moves down the tree, one cycles through the axes used to select the splitting planes. (For example, in a 3-dimensional tree, the root would have an x-aligned plane, the root's children would both have y-aligned planes, the root's grandchildren would all have z-aligned planes, the root's great-grandchildren would all have x-aligned planes, the root's great-great-grandchildren would all have y-aligned planes, and so on.)
Points are inserted by selecting the median of the points being put into the subtree, with respect to their coordinates in the axis being used to create the splitting plane. (Note the assumption that we feed the entire set of n points into the algorithm up-front.)
This method leads to a balanced k-d tree, in which each leaf node is approximately the same distance from the root. However, balanced trees are not necessarily optimal for all applications.
Note that it is not required to select the median point. In the case where median points are not selected, there is no guarantee that the tree will be balanced. To avoid coding a complex median-finding algorithm or using an sort such as heapsort or mergesort to sort all n points, a popular practice is to sort a fixed number of randomly selected points, and use the median of those points to serve as th |
https://en.wikipedia.org/wiki/Campus%20network | A campus network, campus area network, corporate area network or CAN is a computer network made up of an interconnection of local area networks (LANs) within a limited geographical area. The networking equipments (switches, routers) and transmission media (optical fiber, copper plant, Cat5 cabling etc.) are almost entirely owned by the campus tenant / owner: an enterprise, university, government etc. A campus area network is larger than a local area network but smaller than a metropolitan area network (MAN) or wide area network (WAN).
University campuses
College or university campus area networks often interconnect a variety of buildings, including administrative buildings, academic buildings, university libraries, campus or student centers, residence halls, gymnasiums, and other outlying structures, like conference centers, technology centers, and training institutes.
Early examples include the Stanford University Network at Stanford University, Project Athena at MIT, and the Andrew Project at Carnegie Mellon University.
Corporate campuses
Much like a university campus network, a corporate campus network serves to connect buildings. Examples of such are the networks at Googleplex and Microsoft's campus. Campus networks are normally interconnected with high speed Ethernet links operating over optical fiber such as gigabit Ethernet and 10 Gigabit Ethernet.
Area range
The range of CAN is 1 km to 5 km. If two buildings have the same domain and they are connected with a network, then it will be considered as CAN only. Though the CAN is mainly used for corporate campuses so the data link will be high speed.
References
Metropolitan area networks
Computer networks |
https://en.wikipedia.org/wiki/Polyphony%20Digital | Polyphony Digital is an internal Japanese first-party video game development studio for PlayStation Studios. Originally a development group within Sony Computer Entertainment's Japan Studio known as Polys Entertainment, after the success of Gran Turismo in Japan, they were granted greater autonomy, reestablished as an individual company and renamed themselves Polyphony Digital. It currently has four studios: two studios in Japan, one studio in the Netherlands, and another one in the United States.
Company overview
The studio is best known for the Gran Turismo racing game series. Led by Kazunori Yamauchi, Gran Turismo became the most successful racing series for the PlayStation, PlayStation 2 and PlayStation 3. The Gran Turismo series is designed to be a realistic driving simulator, offering realistic driving physics. In 2006, Polyphony released Tourist Trophy, in an attempt to bring the realism of Gran Turismo to motorcycle racing.
Games developed
as Polys Entertainment
as Polyphony Digital
Other projects
Polyphony Digital has also been involved in real life automotive projects. They have developed special versions of their Gran Turismo games for many car manufacturers as demonstrators for their cars. Nissan also commissioned them to design a special body kit for their 350Z coupe, which first appeared in 'GT Concept: 2002 Tokyo – Geneva' as the "Nissan 350Z Gran Turismo Aero", later becoming the "Fairlady Z NISMO S-Tune Concept by GRAN TURISMO" in GT4. There was also a faster 'Z-Tune' version with minor styling revisions and 400PS. The S-Tune was later sold in real life by NISMO (NISSAN MOTORSPORT) as a tuning package for existing owners.
In 2007, they were contracted to design the multifunction display on the new Nissan GT-R, which displays performance information such as G-forces, acceleration opening, brake pedal pressure, steering angle, an "optimal gearshift map," to emphasize economical vehicle operation.
When Nissan was looking for a company to develop the GT-R's user-friendly 'multi-function meter', the carmaker says Polyphony was the obvious choice because of the simple menu systems applied to video games such as Gran Turismo. "If you think about the GT-R's multi-function meter with the g-force information and everything else, we wanted it to be very easy to read, very easy to use," says Nissan's global vice president of communications, Simon Sproule. "It's really about the logic of how video games work and their menu systems – which anyone can use – and then applying it to the car."
Seiichi Ikiuo from Polyphony Digital encoded and decoded the movies for various SCEI games, such as The Legend of Dragoon, Everybody's Golf 2 and the Japanese versions of Roll Away and the original Crash Bandicoot games for the PS1.
Recognition
In 2012, IGN placed Polyphony Digital at number 24 on their list of the 50 greatest developers of all time. In the March 2015 issue of GamesTM magazine, the company was number 34 on their list of the "50 B |
https://en.wikipedia.org/wiki/Moody%20Radio | Moody Radio is one of the largest Christian radio networks in the United States. Located in downtown Chicago, Moody Radio has 71 owned and operated stations and hundreds of affiliates and outlets that carry all or part of its programming. It is owned by the Moody Bible Institute.
The network airs a variety of programming directed primarily toward a Christian audience. The format features local morning drives, teaching and national talk programming, plus specially selected Christian music.
History
WMBI, the flagship station of Moody Radio, got its start seemingly by accident. A violent storm in October 1925 prevented the talent for WGES scheduled broadcast from performing on the radio. This opened the door for two cornet-playing Moody Bible Institute students, who happened to be on-site and could fill the time slot. Few would have thought this "chance-encounter" would result in a weekly show and less than a year later help to launch WMBI, the first noncommercial educational and religious radio station. Despite changing technology, audiences and formats, the station maintained a familiar presence on the air for over eight decades.
This station was just the beginning of what would come to be known as Moody Radio. In 1958, MBI purchased WCRF in Cleveland, Ohio, and shortly thereafter, WDLM in Moline, Illinois. These purchases were the catalyst for a network that would grow to include 36 stations in the continental U.S. By the end of the 1960s, the network's potential audience had increased to 30 million listeners. In 1982, Moody Radio began a satellite-fed network enabling communications across America.
In 2019, Moody Radio put three of its AM stations up for sale. The company announced that the proceeds from the sale would be put towards furthering the expansion of Moody Radio with added digital and online content in both English and Spanish.
Programs
Moody Radio provides biblical programming 24 hours a day. Some of the most popular and award-winning programs include: Equipped with Chris Brooks, Chris Fabry Live!, In the Market with Janet Parshall, and Open Line with Dr. Michael Rydelnik. From 11pm CT until 5am CT, Music Thru the Night is broadcast. From 1982 until his retirement in 2014, Mike Kellogg hosted the program. It is currently hosted by Bill Maier.
Owned & operated stations
The following stations are owned and operated by Moody Radio.
Full-powered stations
Notes:
Translators
References
External links
Moody Radio Official Site
American radio networks
Christian mass media companies
Christian radio stations in the United States
Radio broadcasting companies of the United States
Companies based in Chicago
Radio stations established in 1925 |
https://en.wikipedia.org/wiki/ESPN%20on%20ABC | ESPN on ABC (formerly known as ABC Sports from 1961 to 2006) is the branding used for sports event and documentary programming televised by the American Broadcasting Company (ABC) in the United States. Officially, the broadcast network retains its own sports division; however, in 2006, ABC's sports division was merged into ESPN Inc., which is the parent subsidiary of the cable sports network ESPN that is majority owned by ABC's corporate parent, The Walt Disney Company, in partnership with Hearst Communications.
ABC broadcasts use ESPN's production and announcing staff, and incorporate elements such as ESPN-branded on-screen graphics, SportsCenter in-game updates, and the BottomLine ticker. The ABC logo is still used for identification purposes such as a digital on-screen graphic during sports broadcasts on the network, and in promotions to disambiguate events airing the broadcast network from those shown on the ESPN cable channel.
The broadcast network's sports event coverage carried the ABC Sports brand prior to September 2, 2006. When ABC acquired a controlling interest in ESPN in 1984, it operated the cable network separately from its network sports division. The integration of ABC Sports with ESPN began after The Walt Disney Company bought ABC in 1996. The branding change to ESPN on ABC was made to better orient ESPN viewers with event telecasts on ABC and provide consistent branding for all sports broadcasts on Disney-owned channels (shortly thereafter, ESPN2's in-game graphics were likewise altered to simply use the main "ESPN" brand). Despite its name, ABC's sports coverage is supplemental to ESPN and (with occasional exceptions) not a simulcast of programs aired by the network. ESPN and ESPN2 may often carry ABC's regional broadcasts that otherwise would not air in certain markets. Furthermore, a similar broadcast was aired on FX during XFL broadcasts since the 2023 season as ESPN on FX.
Since 2021, ABC is the only broadcast television network to have rights to broadcast games from all four major professional leagues all at the same time. This is largely due to joint contracts with ESPN and those four leagues.
History
1960s and 1970s: Pre-Disney/ESPN
Like its longtime competitors CBS Sports and NBC Sports, ABC Sports was originally part of the news division of the ABC network, and, after 1961, was spun off into its own independent division.
When Roone Arledge came to ABC Sports as a producer of NCAA football games in 1960, the network was in financial shambles. The International Olympic Committee even wanted a bank to guarantee ABC's contract to broadcast the 1960 Olympics. At the time, Edgar Scherick served as the de facto head of ABC Sports. Scherick had joined the fledgling ABC television network when he persuaded it to purchase Sports Programs, Inc., in exchange for the network acquiring shares in the company. Scherick had formed the company after he left CBS, when the network would not make him the head of its sports programmi |
https://en.wikipedia.org/wiki/Underdetermination | In the philosophy of science, underdetermination or the underdetermination of theory by data (sometimes abbreviated UTD) is the idea that evidence available to us at a given time may be insufficient to determine what beliefs we should hold in response to it. The underdetermination thesis says that all evidence necessarily underdetermines any scientific theory.
Underdetermination exists when available evidence is insufficient to identify which belief one should hold about that evidence. For example, if all that was known was that exactly $10 were spent on apples and oranges, and that apples cost $1 and oranges $2, then one would know enough to eliminate some possibilities (e.g., 6 oranges could not have been purchased), but one would not have enough evidence to know which specific combination of apples and oranges were purchased. In this example, one would say that belief in what combination was purchased is underdetermined by the available evidence.
In contrast, overdetermination in philosophy of science means that more evidence is available than is necessary to justify a conclusion.
Origin
Ancient Greek skeptics argued for equipollence, the view that reasons for and against claims are equally balanced. This captures at least one sense of saying that the claims themselves are underdetermined.
Underdetermination, again under different labels, arises in the modern period in the work of René Descartes. Among other skeptical arguments, Descartes presents two arguments involving underdetermination. His dream argument points out that experiences perceived while dreaming (for example, falling) do not necessarily contain sufficient information to deduce the true situation (being in bed). He concluded that since one cannot always distinguish dreams from reality, one cannot rule out the possibility that one is dreaming rather than having veridical experiences; thus the conclusion that one is having a veridical experience is underdetermined. His demon argument posits that all of one's experiences and thoughts might be manipulated by a very powerful and deceptive "evil demon". Once again, so long as the perceived reality appears internally consistent to the limits of one's limited ability to tell, the situation is indistinguishable from reality and one cannot logically determine that such a demon does not exist.
Underdetermination and evidence
To show that a conclusion is underdetermined, one must show that there is a rival conclusion that is equally well supported by the standards of evidence. A trivial example of underdetermination is the addition of the statement "whenever we look for evidence" (or more generally, any statement which cannot be falsified). For example, the conclusion "objects near earth fall toward it when dropped" might be opposed by "objects near earth fall toward it when dropped but only when one checks to see that they do." Since one may append this to any conclusion, all conclusions are at least trivially underdetermined. If on |
https://en.wikipedia.org/wiki/XRD | XRD may refer to:
X-ray diffraction, used to study the structure, composition, and physical properties of materials
Extensible Resource Descriptor, an XML format for discovery of metadata about a web resource
Guilty Gear Xrd, a fighting video game. |
https://en.wikipedia.org/wiki/2K | 2K or 2-K may refer to:
Numerical
2000 (number)
2000, a year
Video and images
2K resolution, a digital film resolution, display resolution, of 2048 horizontal pixels of data
JPEG 2K, see JPEG 2000
Music
2K (band), also known as The KLF
2K Sports Mixtape (2006), hosted By Clinton Sparks; produced by Dan the Automator
Crazy 2K Tour, see ...Baby One More Time Tour by Britney Spears
Will 2K, see Willennium, Will Smith's second solo studio album
Video games
Video game publishers
2K Games
2K Sports
2K Play
2K Australia
2K China
2K Czech
2K Marin
Irrational Games (interimly known as 2K Boston)
Video games
NBA 2K (video game)
NFL 2K (video game)
MLB 2K
NBA 2K
NHL 2K
NFL 2K
WWE 2K
Other
2K-tan, see OS-tan, Japanese Internet meme
Chaparral 2K, see Chaparral Cars was a United States automobile racing team which built race cars from 1963 through 1970.
MSW 2K, see Windows 2000
2K, a model of Toyota K engine
Two kingdoms doctrine, theological concept of separate domains for earthly and spiritual power
See also
2000 (disambiguation)
KK (disambiguation) |
https://en.wikipedia.org/wiki/ProFont | ProFont is a monospace font available in many formats. It is intended to be used for programming in IDE environments and it is available in bitmap and TrueType versions for various platforms.
Originally developed as shareware by Andrew Welch for the Apple Macintosh in TrueType format, ProFont was intended to have metrics identical with Apple's default Monaco font—resulting in an 80-column by 25-line display in a Compact Macintosh full screen window—but with additional features desirable for programming, such as a slashed zero and easily distinguished curly brackets. ProFont was bundled with the BBEdit text editor.
References
External links
ProFont for Windows, Mac, Linux
Cyrillic ProFont
ProFont ("Orp") for X11/xterm as BDF/PCF
Monospaced typefaces
Computer-related introductions in 1986 |
https://en.wikipedia.org/wiki/Numerical%20method | In numerical analysis, a numerical method is a mathematical tool designed to solve numerical problems. The implementation of a numerical method with an appropriate convergence check in a programming language is called a numerical algorithm.
Mathematical definition
Let be a well-posed problem, i.e. is a real or complex functional relationship, defined on the cross-product of an input data set and an output data set , such that exists a locally lipschitz function called resolvent, which has the property that for every root of , . We define numerical method for the approximation of , the sequence of problems
with , and for every . The problems of which the method consists need not be well-posed. If they are, the method is said to be stable or well-posed.
Consistency
Necessary conditions for a numerical method to effectively approximate are that and that behaves like when . So, a numerical method is called consistent if and only if the sequence of functions pointwise converges to on the set of its solutions:
When on the method is said to be strictly consistent.
Convergence
Denote by a sequence of admissible perturbations of for some numerical method (i.e. ) and with the value such that . A condition which the method has to satisfy to be a meaningful tool for solving the problem is convergence:
One can easily prove that the point-wise convergence of to implies the convergence of the associated method is function.
See also
Numerical methods for ordinary differential equations
Numerical methods for partial differential equations
References
Numerical analysis |
https://en.wikipedia.org/wiki/Think%20different | "Think different" is an advertising slogan used from 1997 to 2002 by Apple Computer, Inc., now named Apple Inc. The campaign was created by the Los Angeles office of advertising agency TBWA\Chiat\Day.
The slogan has been widely taken as a response to the IBM slogan "Think". It was used in a television advertisement, several print advertisements, and several TV promos for Apple products.
As of 2020, "Think different" was still printed on the back of the box of the iMac.
Development
In 1984, Apple's "1984" Super Bowl advertisement was created by advertising agency Chiat\Day. In 1986, CEO John Sculley replaced Chiat\Day with BBDO. In 1997, under CEO Gil Amelio, BBDO pitched a new brand campaign with the slogan "We're back" to an internal marketing meeting at the then struggling Apple. Reportedly everyone in the meeting expressed approval with the exception of the recently returned Steve Jobs who said "the slogan was stupid because Apple wasn't back [yet]."
Jobs then invited three advertising agencies to present new ideas that reflected the philosophy he thought had to be reinforced within the company he had co-founded. Chiat\Day was one of them.
The script was written by Rob Siltanen with participation of Lee Clow and many others on his creative team. The slogan "Think different" was created by Craig Tanimoto, an art director at Chiat\Day, who also contributed to the initial concept work. The look and feel of the print, outdoor and the photography used was researched, curated, and visually developed by art & design director Jessica (Schulman) Edelstein who, together with Lee Clow, met weekly with Steve Jobs and the team at Apple to hone the campaign in its many forms. Susan Alinsangan and Margaret (Midgett) Keene were also instrumental in developing the campaign further as it progressed and spread throughout the world. Great contributions were made by professionals in all agency departments from account services, to art buying, to production, to contract negotiators and media buyers who secured key placements. The commercial's music was composed by Chip Jenkins for Elias Arts.
The full text of the various versions of this script were co-written by creative director Rob Siltanen and creative director Ken Segall, along with input from many on the team at the agency and at Apple. While Jobs thought the creative concept "brilliant", he originally hated the words of the television commercial, but then changed his mind. According to Rob Siltanen:
Craig Tanimoto is also credited with opting for "Think different" rather than "Think differently," which was considered but rejected by Lee Clow. Jobs insisted that he wanted "different" to be used as a noun, as in "think victory" or "think beauty". He specifically said that "think differently" wouldn't have the same meaning to him. He wanted to make it sound colloquial, like the phrase "think big".
Jobs was crucial to the selection of the historical subjects pictured in the campaign, many of whom had neve |
https://en.wikipedia.org/wiki/Cross%20Country%20services | Cross Country services on the British rail network carry passengers between regions on routes avoiding London termini.
History
Background
The world's first twin-track inter-urban passenger railway in which all the trains were timetabled and ticketed was the Liverpool to Manchester Railway. This line, in 1830, greatly reduced journey times between the two cities and provided a major freight link. This captured the mind of venture capitalists and led to many more Railways in the United Kingdom than operate today. This was at a time when those cities were separated by a bumpy and circuitous road bypassing Chat Moss with divergent main industries: shipping of goods/materials and shipbuilding in the case of Liverpool and textile mills in Manchester thus in economic terms this line can be considered inter-regional. The first cross-country route avoided requiring co-operation between existing operators however still connected rival operators' tracks to the same terminus city, London, and was the Lancashire and Yorkshire Railway's Manchester and Leeds Railway which was constructed in 1847.
Early inter-regional co-operation
As railway building rapidly accelerated the role of the capital city grew and lines tended to radiate from it with companies attempting to restrain other operators from constructing railways within their particular directional sector or narrow territory. However, as railways surged in many directions to new destinations it became increasingly difficult to stop completely major incursions into envisaged territory, instead of total resistance, co-operation to mitigate the impact such incursions often yielded better results for passengers and operators - with interchange stations between such rival operators such as in Birmingham and Westbury, Wiltshire providing for wider connections.
Although a few major railways were partially used by Cross Country services by process of agreement, most cross-operator services formed an exclusive complementary service by being involving two railways in series, i.e. each as a continuation of the next.
A highly successful and economically cohesive example of this was the West Coast Main Line which worked in conjunction with Portpatrick and Wigtownshire Joint Railway and another in Scotland to timetable services from London Euston to the Belfast ferry at Stranraer.
During the 1920s the Liberal and Labour Governments identified unacceptable railway costs, with more than 100 operators, and a national interest desire to achieve better economies of scale led to major statutory Grouping in 1923 almost wholly into the Big Four. This for instance made the Lancashire and Yorkshire Railway by law become subsumed into the London, Midland and Scottish Railway, one of these four. As such Cross Country services from an early slight blossoming in the 1880s were free to develop within and even across these four regions, without fear of facing intense competition to strategic routes.
Major cooperation
Insp |
https://en.wikipedia.org/wiki/Thai%20Pacific%20Airlines | Thai Pacific Airlines was a short-lived airline based in Thailand that ceased all of its operations in July 2004.
Code data
IATA Code: 3P
ICAO Code: TPV
Callsign: THAI PACIFIC
History
Thai Pacific was founded by Wasant Singhamany, who announced the start-up of the airline in August 2003, with plans for a Bangkok-Sydney service starting on October 1 of that year using a Boeing 747-200 aircraft.
But by July 2004, the airline had shut down, with money owed to its staff and to its landlord. And in March 2006, Thailand's Civil Aviation Department said it was withdrawing the license for the failed carrier.
Fleet
Thai Pacific had one aircraft, a Boeing 747-200, HS-VSV.
References
Chiang Mai Mail (July 3–9, 2004) "Thai Pacific Air closes down" (Retrieved March 8, 2006).
Sritama, Suchat (March 7, 2006). "Phuket Air angles for new name, license, The Nation.
External links
Thai Pacific Airlines
Defunct airlines of Thailand
Airlines established in 2003
Airlines disestablished in 2004
2004 disestablishments in Thailand
Thai companies established in 2003 |
https://en.wikipedia.org/wiki/Metrovick%20950 | The Metrovick 950 was a transistorized computer, built from 1956 onwards by British company Metropolitan-Vickers, to the extent of six or seven machines, which were "used commercially within the company" or "mainly for internal use". The 950 appears to have been Metrovick's first and last commercial computer offering.
Transistor Computer
Prototype
In November 1953 Richard Grimsdale and Douglas Webb of Manchester University first demonstrated their prototype transistorized computer using 92 point-contact transistors and 550 diodes in order to test the suitability of transistors in improving the reliability of the Manchester Mark 1 computer. This machine was similar to the Mark I, except that it did not include Williams tubes and used only the magnetic drum for main memory. The machine was based on a 48-bit word, although four bits were used for timing and thus not available for program use. This machine used thermionic valves to generate a clock frequency of 125 kHz.
The only storage used was a drum (reused from the Manchester Mark 1). This meant that the average random access time to a word in store was half a drum revolution, i.e., with 64 words on a track, 32 times the random access time for a word if it could be stored in a true RAM. In comparison, the Mark 1 had also included a number of Williams tubes to provide computer registers and dramatically speed access to a small amount of data; thus the Transistor Computer was slower than the Mark 1. Both versions had a pseudo 2-address (or 1+1) instruction format, where the address of the next instruction to be obeyed was contained within each instruction, to facilitate "optimum programming". The drum was even used to store the Accumulator and the Current Instruction.
Improved version
By 1955 the design was re-built with a Mark I-style B-line accumulator/index register and hardware multiplier. The added circuitry brought the machine to a total of 250 transistors. It used only 150 watts of power, an astonishingly low figure in an era when machines typically used tens of kilowatts to warm their valves. The new model could add two 44-bit numbers in 1.5 drum revolutions, which, at a drum spin rate of 3000 RPM, amounted to roughly 30 milliseconds per addition. Although faster than the Mark I internally, the lack of Williams tubes made it run much more slowly; the Mark I could add two 40-bit numbers in 1.8 milliseconds.
The prototype computer (November 1953) had a simple seven-function order code and one track of 64 words for main storage. For the full-size computer (April 1955) the order code and storage were much extended and a hardware multiplier included. A third "regenerative" drum track formed an 8-word B store. Arithmetic was serial, with a pulse rate of 125,000 per second. The instruction times were directly related to the 30-millisecond drum revolution time (the basic unit being the time to read a word, i.e. 1/64th of a revolution).
The expanded 1955 machine had a total of 200 point-cont |
https://en.wikipedia.org/wiki/Ashton%2C%20Stalybridge%20and%20Liverpool%20Junction%20Railway | The Ashton, Stalybridge and Liverpool Junction Railway was opened in 1846 to connect the industrial town of Ashton-under-Lyne to the developing railway network, and in particular to the port of Liverpool. It was a short line, joining the Manchester and Leeds Railway at Miles Platting (east of Manchester) and the connection to Liverpool was over that line and the Liverpool and Manchester Railway.
A branch line to Ardwick, near the present-day Manchester Piccadilly station, was built giving passenger and freight connection to the West Midlands and southern England.
The AS&LJR was closely aligned to the Manchester and Leeds Railway, and in 1847 the two companies amalgamated, along with another line still under construction, and the combined company was named the Lancashire and Yorkshire Railway. The Ardwick branch was not opened until after the amalgamation.
When the London and North Western Railway developed a route to Leeds via Huddersfield, its trains used the AS&LJR line from Manchester to Stalybridge, so that the S&LJR formed part of an important main line. Most of the small network remains in use at the present day.
Conception
As the Manchester and Leeds Railway established itself, its directors began to think of what branches could be built profitably. Thomas Longridge Gooch, its engineer, was instructed to survey suitable branches in 1843. One of these was from Miles Platting to Ashton and Stalybridge, with a short branch to Ardwick. At the time Ashton had a population of 40,000, and its manufacturing industry relied on the nearest station at Guide Bridge, two miles away, on the Sheffield, Ashton-under-Lyne and Manchester Railway, and goods to and from Liverpool – a most important port for the town's raw materials – had to be carted by road across Manchester at the time.
Gooch's survey showed that a line was feasible, and construction was authorised by the Ashton, Stalybridge & Liverpool Junction Railway Act of 19 July 1844. The Manchester and Leeds Railway was permitted by the Act to purchase or lease the AS&LJR. The reference to Liverpool was to the new connection over the M&LR to the Liverpool and Manchester Railway; there was no intention to build to Liverpool. A Stalybridge branch of the Sheffield, Ashton & Manchester Railway was authorised on the same day. (The SA&MR later was reorganised as the Manchester, Sheffield and Lincolnshire Railway in 1847.) The two Stalybridge terminal stations were to be built alongside one another.
Another AS&LJR Act, on 21 July 1845, authorised the branch from Miles Platting to Ardwick, connecting there with the Manchester and Birmingham Railway (later to become the London and North Western Railway), facing towards Store Street (later London Road) station.
Construction and opening
The main line was built in two sections, by Hemingway & Pearson and Harding & Cropper respectively. As well as a timber viaduct at Park, there was a viaduct over the River Medlock, comprising ten stone arches of 30 ft spa |
https://en.wikipedia.org/wiki/IBM%207090/94%20IBSYS | IBSYS is the discontinued tape-based operating system that IBM supplied with its IBM 709, IBM 7090 and IBM 7094 computers. A similar operating system (but with several significant differences), also called IBSYS, was provided with IBM 7040 and IBM 7044 computers. IBSYS was based on FORTRAN Monitor System (FMS) and (more likely) Bell Labs' "BESYS" rather than the SHARE Operating System.
IBSYS directly supported several old language processors on the $EXECUTE card: 9PAC, FORTRAN and IBSFAP. Newer language processors ran under IBJOB.
IBM later provided similar facilities for the 7040/7044 as IBM 7040/7044 Operating System (16K/32K) 7040-PR-150 and for the IBM 1410/IBM 7010 as IBM 1410/7010 Operating System 1410-PR-155.
IBSYS System Supervisor
IBSYS itself is a resident monitor program, that reads control card images placed between the decks of program and data cards of individual jobs. An IBSYS control card begins with a "$" in column 1, immediately followed by a Control Name that selects the various IBSYS utility programs needed to set up and run the job. These card deck images are usually read from magnetic tapes prepared offline, not directly from the card reader.
IBJOB Processor
The IBJOB Processor is a subsystem that runs under the IBSYS System Supervisor. It reads control cards that request, e.g., compilation, execution. The languages supported include COBOL. Commercial Translator (COMTRAN), Fortran IV (IBFTC) and Macro Assembly Program (IBMAP).
See also
University of Michigan Executive System
Timeline of operating systems
Further reading
Noble, A. S., Jr., "Design of an integrated programming and operating system", IBM Systems Journal, June 1963. "The present paper considers the underlying design concepts of IBSYS/IBJOB, an integrated programming and operating system. The historical background and over-all structure of the system are discussed. Flow of jobs through the IBJOB processor, as controlled by the monitor, is also described."
"IBM 7090/7094 IBSYS Operating System Version 13 System Monitor (IBSYS)", Form C28-6248-7
"IBM 7090/7094 IBSYS Operating System Version 13 IBJOB Processor", Form C28-6389-1
"IBM 7090/7094 IBSYS Operating System Version 13 IBJOB Processor Debugging Package", Form C28-6393-2
Notes
External links
IBM 7090/94 IBSYS Operating System, Jack Harper
Dave Pitts' IBM 7090 support
IBSYS source archived with Bitsavers
History of FORTRAN and FORTRAN II – FORTRAN II and other software running on IBSYS, Software Preservation Group, Computer History Museum
7090 94 IBSYS
OS IBSYS
Discontinued operating systems
1960 software |
https://en.wikipedia.org/wiki/Treehouse%20of%20Horror%20XIV | "Treehouse of Horror XIV" is the first episode of the fifteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on November 2, 2003. In the fourteenth annual Treehouse of Horror episode, Homer takes on the role of the Grim Reaper ("Reaper Madness"), Professor Frink creates a Frankenstein-version of his deceased father ("Frinkenstein") and Bart and Milhouse obtain a time-stopping watch ("Stop the World, I Want to Goof Off"). It was written by John Swartzwelder and directed by Steven Dean Moore. Guest stars in the episode include Jerry Lewis, whose character in The Nutty Professor served as the inspiration for recurring Simpsons character Professor Frink, as Frink's father, and Jennifer Garner, Dudley Herschbach, and Oscar De La Hoya as themselves. The episode was nominated for the 2004 Emmy Award for Outstanding Music Composition for a Series (Dramatic Underscore).
It is also the final Treehouse of Horror episode to play the traditional paced organ variant of the Simpsons theme at the end credits.
Plot
Introduction
Bart and Lisa, dressed as Charlie Brown and Lucy van Pelt from the Peanuts series, discuss their Halloween treats, and Lisa claims that hers are better than Bart's. The two then fight violently until Homer intervenes and orders them to stop fighting. He throws a burning log at them, but misses and hits Grampa, though he complains that he's still cold. Homer gets Bart and Lisa rolled up in the rug and starts to "beat the lumps". A gun-wielding Marge intervenes and says that she does not approve of Homer's parenting techniques, and shoots him. Homer's blood splatters on a nearby wall, spelling the title of the episode. Meanwhile, from their spaceship, the two aliens Kang and Kodos criticize the Simpson family for airing a Halloween special in November, as they are already set up for Christmas.
Reaper Madness
The Grim Reaper enters the Simpson house attempting to take Bart, but the family goes on a Benny Hill-style chase to elude him. Death eventually manages to pin Bart's shirt to the wall with his scythe. As Death is about to sentence Bart to an eternity of pain, Homer kills him by cracking his skull open with a bowling ball in revenge for the deaths of Snowball I and President John F. Kennedy. The Simpsons find that no one can die since Death is dead. The scene cuts to two examples of a world where no one can die: Frankie the Squealer (last seen in "Insane Clown Poppy") surviving an execution by the Springfield Mafia, much to their frustration, and Moe attempting to hang himself from the ceiling of his tavern. On trash day, Marge tells Homer to take Death's corpse to the curb. Homer does, but puts on Death's robe, inadvertently turning himself into the new Grim Reaper. At first, he refuses to reap souls, but when the cloak begins to crush his groin, he complies.
He kills many people who are on God's list (and some who are not), until he is asked to kill Mar |
https://en.wikipedia.org/wiki/NBC%20Sports | NBC Sports is an American programming division of the broadcast network NBC, owned and operated by NBC Sports Group division of NBCUniversal and subsidiary of Comcast. The division is responsible for sports broadcasts on the network, and its dedicated national sports cable channels. Formerly operating as "a service of NBC News", it broadcasts a diverse array of sports events, including Major League Baseball, the French Open, the Premier League, the IndyCar Series, NASCAR, the National Football League (NFL), Notre Dame Fighting Irish college football, the Olympic Games, professional golf, the Tour de France and Thoroughbred racing, among others. Other programming from outside producers – such as coverage of the Ironman Triathlon – is also presented on the network through NBC Sports. With Comcast's acquisition of NBCUniversal in 2011, its own cable sports networks were aligned with NBC Sports into a part of the division known as the NBC Sports Group.
History
Early years
2000s
In 2000, NBC declined to renew its broadcast agreement with Major League Baseball (MLB). In 2002, it was additionally outbid by ESPN and ABC for the National Basketball Association (NBA)'s new broadcast contract, ending the league's twelve-year run on NBC.
During this era, NBC experimented with broadcasting emerging sports. In 2001, the network partnered with the World Wrestling Federation (WWF) to establish the XFL – a new football league which introduced modified rules and debuted to tremendous, but short-lived fanfare, only lasting one season (NBC shared broadcast rights to the league's games, which were mainly held on Saturday nights, with UPN). In 2003, NBC obtained the broadcast rights and a minority interest in the Arena Football League (AFL). The network televised weekly games on a regional basis, as well as the entire playoffs. The deal lasted four years, after which the league and NBC parted ways.
Beginning with the 1999 NASCAR Winston Cup Series, NBC began its foray into NASCAR. NBC, along with Fox and TNT, obtained the broadcast rights of the top two series – the NASCAR Cup Series and NASCAR Xfinity Series – in a six-year deal, beginning in 2001. NBC televised the second half of the season and alternated coverage of the Daytona 500 with Fox. In December 2005, NBC announced that it would not renew its agreement with NASCAR. In 2001, NBC obtained the broadcast rights to horse racing's Triple Crown of Thoroughbred Racing in a five-year deal.
In 2004, NBC reached a broadcast agreement with the National Hockey League (NHL). The revenue-sharing deal called for the two sides to split advertising revenue after the network recouped the expenses. Games were supposed to begin airing on the network during the 2004–05 season, however a league lockout that resulted in the cancellation of that season delayed the start of the contract until the second half of the 2005–06 NHL season. NBC televised regular season games at first on Saturday afternoons before moving the telecast |
https://en.wikipedia.org/wiki/Ordo | Ordo (Latin "order, rank, class") may refer to:
A musical phrase constructed from one or more statements of a rhythmic mode pattern and ending in a rest
Big O notation in calculation of algorithm computational complexity
Orda (organization), also ordo or horde, was a nomadic palace for the Mongol aristocrats and the Turkic rulers
Order (biology), in the taxonomy of organisms
Ordo Recitandi or directorium gives complete details of the celebration of the Eucharist and the Liturgy of the Hours, beginning with the first Sunday of Advent
Religious order in monasticism
The Inquisition from Warhammer 40,000 has three main ordines: Ordo Malleus, Ordo Hereticus and Ordo Xenos
Ordo Templi Orientis, an organization dedicated to the religious philosophy of Thelema
The scholarly economic/political science journal The ORDO Yearbook of Economic and Social Order
Canderous Ordo, a fictional character in the Star Wars video games Star Wars: Knights of the Old Republic and Star Wars Knights of the Old Republic II: The Sith Lords
A fictional encryption program from the book Cryptonomicon, by Neal Stephenson
Novus ordo seclorum which appears on the reverse of the Great Seal of the United States
Ordo Missae or Order of Mass, the order (regulation) of the Eucharist in the Roman Rite of the Catholic Church
See also
Urdu |
https://en.wikipedia.org/wiki/Formula%20C | Formula C may refer to:
Formula C (game), an upcoming computer game
Formula C (karting), a defunct 125 cc karting class
Formula C (SCCA), the predecessor to the Formula Continental SCCA racing class |
https://en.wikipedia.org/wiki/Aus-Air | Aus-Air (Australian Air Charterers Pty Ltd) was an airline based in Melbourne, Australia. It operated a regional airline network, linking rural communities and provincial centres in Tasmania, Victoria and southern New South Wales with Melbourne. Its main base was Moorabbin Airport, Melbourne.
Code data
IATA Code: NO
ICAO Code: AUS
History
The privately owned Australian Air Charterers was established in 1956 and commenced scheduled services in November 1986 between Essendon Airport, Melbourne and Smithton Airport, Tasmania. The company moved its scheduled operations to its home base at Moorabbin Airport in July 1987. The Aus-Air website (in December 2008 still accessible) stated that in the latter-1990s it had 50 employees. The company encountered financial difficulties and in 1999 was placed in Administration - a legal term in Australian Law not unlike Chapter 11 Bankruptcy in the USA. The company and its assets were offered for sale however no buyer was found and Aus-Air ceased scheduled operations on 4 July 1999. The Aus-Air fleet of aircraft was subsequently purchased by Bankstown-based Airtex Aviation. As of December 2008 Aus-Air still operated three single-engined aircraft on a charter Air Operator Certificate.
As of April 2011, Aus-Air operates from Echuca in Victoria, north of Melbourne and offers charter flights.
Destinations
At the time of its closure in 1999 Aus-Air operated services to the following domestic destinations:
Melbourne (Moorabbin Airport)
King Island
Flinders Island
Devonport
Launceston
Burnie
Fleet
The Aus-Air fleet at the time it ceased operations consisted of the following aircraft:
2 Embraer EMB 110 Bandeirante
4 Piper PA31-350 Chieftain
2 Piper PA-31 Navajo
See also
List of defunct airlines of Australia
Aviation in Australia
References
Annual Regional Airline Directory 1999 Australian Aviation issue 157 December 1999 page 49
External links
Website, defunct
Web archive of Aus-Air
Airlines disestablished in 1999
Defunct airlines of Australia
1999 disestablishments in Australia |
https://en.wikipedia.org/wiki/Sony%20Vaio%20U%20series | The Sony U series of subnotebook computers refers to two series of Sony products the PCG-U and the VGN-U. The later VGN-U were, at their release, the smallest independent computers running Windows XP and the most powerful high-end subnotebooks at the time. The VGN-U50 and VGN-U70P models are roughly the size of two DVD cases stacked on top of each other.
The first models of the series to come out were the VGN-U50 and the VGN-U70P in Japan. The American model is the VGN-U750P. A VGN-U8G model was introduced for some south Asian countries.
Technical specifications
Additional specification for VGN-U series
Display: 5 in (127 mm) SVGA, 800×600, 16 million colors, touchscreen
Keyboard: 87 keys, English/Japanese layout (connects via USB, does not attach to unit)
Expansion ports:
Sony Memory Stick
CompactFlash Type-II (can be used as 16-bit PCMCIA with proper adapter)
Soundcard: PCM 16-bit audio, mono speaker, stereo headphone jack
Mouse: TrackStik (trackpoint-like) with 2+1 buttons (left, right, middle)
Handwriting recognition software: RitePen; also compatible with third-party alternatives such as PenOffice
Other:
LCD for headphone remote, time display
1 USB 2.0 Port
Power supply: AC 100/240 V (50/60 Hz) – DC 16 V/2.2 A/? W
Size: 167 × 108 × 26.4 mm
Weight: 550 g (incl. battery)
Hard disk drive
20 GB Ultra-ATA100 [U70p/U750/U50/U8g]
Toshiba MK2004GAL (DC 3.3 V, 500 mA)
30 GB Ultra-ATA100 [U71p]
Floppy disk drive: None (optional accessory)
Optical storage
None (optional accessory) [U70p/U50/U750/U71p]
DVD+/-RW Drive (external slim) [U8G]
PCGA-DDRW2 (Firewire – DC 10 V, 1.5 A)
Docking station:
3 additional USB 2.0 ports
i.Link 4-pin FireWire port
10/100 Intel ethernet
VGA port
Advanced technical information for the VGN-U series
CPU
The Pentium-M series CPU (1.0 GHz, 1.1 GHz) supports SpeedStep, which allows the processor to slow down when not under load, using less power and prolonging battery life. The 1.1 GHz is a Dothan generation processor, and has a 2 MB cache, whereas the 1.0 GHz is a Banias generation CPU with only 1 MB of cache. The 900 MHz Celeron-M does not support SpeedStep, and has only 512 KB cache. Despite the Celeron-M's performance shortcomings, benchmarks show the arithmetic performance difference is marginal. Much of the performance increase seems to result from having a total of 512 MB of memory. Battery life of the Pentium-M series is said to be anywhere from 30 to 45 minutes over the Celeron-M model as a result of having SpeedStep.
Display
The internal display has a resolution of 800x600 pixels. The integrated i855gm graphics card can display a maximum of 16 million colors. Connecting an external monitor to the VGA port of the docking station enables a maximum resolution of 1600x1200x16m. The graphics supports display cloning or extended desktop when using an extended monitor, and also supports OpenGL and Direct3D hardware acceleration, with a performance approximating that of a Radeon 7000 or a GeFo |
https://en.wikipedia.org/wiki/Bart%20Gets%20Hit%20by%20a%20Car | "Bart Gets Hit by a Car" is the tenth episode of the second season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on January 10, 1991. In the episode, Bart is hit by Mr. Burns' car. Prompted by ambulance-chasing lawyer Lionel Hutz and quack doctor Nick Riviera, the Simpsons sue Burns, seeking extensive damages for Bart's injuries. Hutz and Dr. Nick exaggerate Bart's injuries to earn the jury's sympathy at the trial. Marge wants Homer to accept Burns' proposed settlement instead of asking Bart to lie on the witness stand.
"Bart Gets Hit by a Car" was written by John Swartzwelder and directed by Mark Kirkland. The episode's plot was based on Billy Wilder's 1966 film The Fortune Cookie. Much of the ending of the show was pitched by executive producer James L. Brooks, who felt the episode needed a more emotional ending. The episode includes the debuts of three recurring characters, Lionel Hutz, Dr. Nick and the Blue-Haired Lawyer. The Devil also appears on the show for the first time. Recurring guest star Phil Hartman makes his first appearance as Hutz. The show's then-script supervisor Doris Grau also voices a character in the show for the first time.
In its original broadcast, "Bart Gets Hit by a Car" received a Nielsen rating of 14.5, finishing the week ranked 32nd. The episode received generally positive reviews.
Plot
While crossing the road on his skateboard, Bart is struck by Mr. Burns's car and hospitalized. When Bart wakes up, the attorney Lionel Hutz suggests that the Simpsons sue Burns. Marge disagrees since according to Dr. Hibbert, the family's physician, Bart's injuries are minor. After Burns offers Homer a measly $100 - which he immediately rescinds when Homer mentions it won't even cover Bart's medical bills, accusing him of extortion, Homer visits Hutz's law office at Springfield Mall.
Hutz promises Homer a cash settlement of $1 million if Bart lies about the extent of his injuries, of which Hutz gets half of as his fee. Hutz takes Bart to go see Dr. Nick, a quack doctor who claims Bart has extensive injuries and wraps him in bandages. On the stand, Bart and Burns both tell exaggerated versions of the accident to impress the jury, who find Bart's story to be more believable, but Marge and Lisa are furious because they know it is Hutz's attempt to curry their favor.
An angry Burns offers Marge and Homer an out of court $500,000 settlement. Marge pleads with Homer to accept the money and drop the lawsuit. Homer refuses, knowing Burns will lose and have to pay the full $1 million. Angered, Marge admits that she and Lisa are concerned over his recent behavior and the "shifty lawyers" and "phony doctors" he hired. Overhearing Marge, Burns quickly returns and withdraws his offer.
At the trial, Marge is called to the stand and denounces Dr. Nick as a quack with no medical qualifications that Hutz hired to discredit Hibbert. When Burns's lawyer asks about the extent o |
https://en.wikipedia.org/wiki/George%20Hudson | George Hudson (probably 10 March 1800 – 14 December 1871) was an English railway financier and politician who, because he controlled a significant part of the railway network in the 1840s, became known as "The Railway King"—a title conferred on him by Sydney Smith in 1844.
Hudson played a significant role in linking London to Edinburgh by rail, carrying out the first major merging of railway companies (the Midland Railway) and developing his home city of York into a major railway junction. He also represented Sunderland in the House of Commons. Hudson's success was built on dubious financial practices and he frequently paid shareholders out of capital rather than money the company had earned.
Eventually in 1849, a series of enquiries, launched by the railways he was chairman of, exposed his methods, although many leading the enquiries had benefited from and approved of Hudson's methods when it suited them. Hudson fell a long way, becoming bankrupt. After losing his Sunderland seat he was forced to live abroad to avoid arrest for debt, returning only when imprisonment for debt was abolished in 1870.
Hudson's name is associated with financial wrongdoing, although others were at least partially guilty of similar practices. He never named any of his co-conspirators, although many of them turned their backs on him when the bubble burst.
Early life
George Hudson was born in Howsham, a small village about 12 miles from York, to John and Elizabeth Hudson on 10 March 1800. His mother died at the age of 38 in 1806 when George was six and his father two years later in 1808. He was brought up by older brothers William and John and after a cursory education he left Howsham at age 15. suggests that this may have been the result of the slump affecting agriculture in 1815, but there was also a payment of 12 shillings and 6 pence recorded in the Howsham poor book as being "received of George Hudson for bastardry".
Hudson was apprenticed to Bell and Nicholson, a firm of drapers in College Street, York. He finished his apprenticeship in 1820, was taken on as a tradesman, and given a share in the business early in 1821. On 17 July that year he married Nicholson's daughter Elizabeth. When Bell retired, the firm became Nicholson and Hudson. By 1827 the company was the largest business in York.
In 1827, his great-uncle Matthew Botrill fell ill and Hudson attended at his bedside. In thanks for this, the old man made a will leaving him his fortune of £30,000 (). In later years when exiled in France, Hudson acknowledged "it was the very worst thing that could have happened to me. It let me into the railways and all my misfortunes since".
Hudson became a prominent member of the York Board of Health and when cholera visited the city in 1832 Hudson distinguished himself as a spirited public servant visiting the sick and reporting on their welfare".
From being a Methodist and a Dissenter, Hudson changed his allegiance to become a High Church Tory and became treasur |
https://en.wikipedia.org/wiki/Ferranti%20Mercury | The Mercury was an early commercial computer from the mid-1950s built by Ferranti. It was the successor to the Ferranti Mark 1, adding a floating point unit for improved performance, and increased reliability by replacing the Williams tube memory with core memory and using more solid-state components. The computer had roughly 2000 vacuum tubes (mostly type CV2179/A2134 pentodes, EL81 pentodes and CV2493/ECC88 double triodes) and 2000 germanium diodes. Nineteen Mercuries were sold before Ferranti moved on to newer designs.
Predecessor: Mark I
When the Mark I started running in 1951, reliability was poor. The primary concern was the drum memory system, which broke down all the time. Additionally, the machine used 4,200 thermionic valves, mostly EF50 pentodes and diodes that had to be replaced constantly. The Williams tubes, used as random-access memory and registers, were reliable but required constant maintenance. As soon as the system went into operation, teams started looking at solutions to these problems.
One team decided to produce a much smaller and more cost-effective system built entirely with transistors. It first ran in November 1953 and is believed to be the first entirely transistor-based computer. Metropolitan-Vickers later built this commercially as the Metrovick 950, delivering seven. At the time, transistors were very expensive, compared to tubes.
Prototype: Meg
Another team, including the main designers of the Mark I, started with a design very similar to the Mark I but replacing valves used as diodes with solid-state diodes. These were much less expensive than transistors, yet enough of them were used in the design that replacing just the diodes would still result in a significant simplification and improvement in reliability.
At that time computers were used almost always in the sciences, and they decided to add a floating-point unit to greatly improve performance in this role. Additionally the machine was to run at 1 MHz, eight times faster than the Mark I's 125 kHz, leading to the use of the name megacycle machine, and eventually Meg.
Meg first ran in May 1954. The use of solid-state diodes reduced valve count by well over half, reducing the power requirement from the Mark I's 25 kW to the Meg's 12 kW. Like the Mark I, Meg was based on a 10-bit "short word", combining two to form a 20-bit address and four to make a 40-bit integer. This was a result of the physical properties of the Williams tubes, which were used to make eight B-lines, or in modern terminology, accumulator/index registers.
Meg could multiply two integers in about 60 microseconds. The floating-point unit used three words for a 30-bit mantissa, and another as a 10-bit exponent. It could add two floating-point numbers in about 180 microseconds, and multiply them in about 360 microseconds.
Commercial version: Mercury
Ferranti, which had built the Mark I for the university, continued development of the prototype Meg to produce the Mercury. The main chan |
https://en.wikipedia.org/wiki/Renown | Renown may refer to:
Celebrity, fame and broad public recognition
Companies
Renown (company), a Japanese clothing brand
Renown Health, a healthcare network in Nevada, US
Renown Pictures, a British film company
Transport
Ships
Renown (1794 ship), an American whaler
Renown (German Barque), a 19th-century sailing cargo ship
Renown-class battlecruiser, two Royal Navy ships of World War I
HMS Renown, several ships of the Royal Navy
Other
AEC Renown, a bus manufactured by the Associated Equipment Company 1962–1967
LNWR Renown Class, a series of British steam locomotives 1897–1924
Triumph Renown, a car manufactured by Triumph 1946–1954
Wright Renown, a bus manufactured by Wrightbus 1997–2002
Sport
Renown SC, a Sri Lankan association football club |
https://en.wikipedia.org/wiki/Hit%20Me%2C%20Baby%2C%20One%20More%20Time%20%28TV%20series%29 | Hit Me, Baby, One More Time is a television entertainment show first broadcast on the British television network ITV and later, as a new version, by NBC in the United States; both were presented by Vernon Kay. During each programme, five former pop stars sing their biggest hit along with a cover version of a contemporary hit. Each week one winner is picked from each show by a phone vote (in the British version) or a studio-audience vote (in the American version), leading to the grand final when the overall winner can release a single featuring both songs (in the British version) or have $20,000 donated to a charity of their choice (in the American version). The show's title was derived from a line in the Britney Spears song "...Baby One More Time".
The show proved to be a summer hit for NBC hitting the top spot in the ratings on its first outing.
UK version
Week 1 (2 April)
The first week heat was won by Tiffany.
Week 2 (9 April)
This heat was won by Shakin' Stevens.
Week 3 (14 April)
This heat was won by Carol Decker.
Week 4 (21 April)
This heat was won by Hue and Cry.
Week 5 (28 April)
This heat was won by Shalamar.
Week 6 (7 May)
This heat was won by Chesney Hawkes.
Week 7 (14 May)
This heat was won by 911.
Grand Final (21 May)
The final was won by Shakin' Stevens. A single was released with both "This Ole House" and a cover of "Trouble" by Pink, which got to number twenty in the UK Singles Chart in June 2005.
U.S. version
The American version of the show began taping on 1 June 2005 to air the following night, 2 June, on the NBC network. Winners were chosen by the studio audience and got a donation in their name to a charity of their choice.
1 -- Denotes artist who also appeared on the British version.
Week 1 (recorded 1 June; aired 2 June)
This heat was won by Arrested Development.
Week 2 (recorded 8 June; aired 9 June)
This heat was won by Vanilla Ice.
Week 3 (recorded 15 June; aired 16 June)
This heat was won by Irene Cara. Howard Jones won the phone in vote.
Week 4 (recorded 22 June; aired 23 June)
This heat was won by Thelma Houston. Glass Tiger won the online vote.
Week 5 (recorded 29 June; aired 30 June)
This heat was won by PM Dawn. Juice Newton won the online vote.
References
2005 British television series debuts
2005 British television series endings
2005 American television series debuts
2005 American television series endings
2000s American reality television series
American television series based on British television series
British music television shows
2000s British reality television series
ITV reality television shows
NBC original programming
Television series by ITV Studios |
https://en.wikipedia.org/wiki/Royal%20New%20Zealand%20Corps%20of%20Signals | The Royal New Zealand Signals Corps (RNZSigs) provides, co-ordinates and operates the communications networks of the New Zealand Army. The role of RNZSigs is to support other Arms by providing Communication Information System required for Command and Control of Units, Formations and Administrative installations in a theater of Operations and in the New Zealand support area. Modern signal equipment is essential to the army, demanding skilled operators and technicians. Because communications must be maintained even under the worst of conditions, signallers must be expert tradespeople. They must also accept a high degree of personal responsibility because the lives of soldiers can often rely on the fast and accurate transmission of battlefield information.
The Corps comprises systems engineers who configure and implement networks, information systems operators who maintain and operate networks, and communication system operators who operate all sorts of communications equipment and process signals traffic over voice and data circuits. The Corps consist of three regular squadrons and one reserve force squadron.
History
Military signals became a component of the New Zealand Army in 1905 when signals detachment were attached to the Infantry and Cycle Corps. From that the Cycle and Signalling Corps was established in 1909 from the College Rifles Company in Auckland. On 5 October 1911, the Post and Telegraph Corps was formed from personnel in the Post and Telegraph Department. On 1 June 1921, the Post and Telegraph Corps became the New Zealand Corps of Signals, with attached depots in various parts of the country.
New Zealand had the following signal units that operated during the Second World War:
1st Divisional Signals
2nd Divisional Signals (served in North Africa and Italy)
3rd Divisional Signals (served in the Pacific Theatre)
4th Divisional Signals
5th Divisional Signals
Northern District Signals
Southern District Signals
Central District Signals
Army Signal Company
In 1945, J-Force Signal Company was sent to Japan as part of the British Commonwealth Occupation Force. King George VI gave the "Royal" prefix to the unit on 12 July 1947. The principal unit of the RNZCS from 1948 to 1964 was the 1st Divisional Signals Regiment, from which the following units were established after its disbandment:
1st Infantry Brigade Group Squadron
2nd Communication Zone Signal Squadron
3rd Infantry Brigade Group Squadron
1st Communication Zone Signal Squadron
A notable member of the RNZCS was Lieutenant Colonel Cyril Bassett, who was the only soldier serving with the New Zealand Expeditionary Force (NZEF) to be awarded the Victoria Cross (VC) in the Gallipoli Campaign of the First World War. Upon his death, his VC was gifted to the RNZSigs and is displayed at the Auckland War Memorial Museum.
Structure
The RNZSig has the following structure:
1st Command Support Regiment
1st Signal Squadron (Army Reserve) – It is based in Palmerston North, Wellington and Chri |
https://en.wikipedia.org/wiki/Mackenzie%20Northern%20Railway | The Mackenzie Northern Railway is a Canadian railway operating in Alberta and the Northwest Territories. It is the northernmost trackage of the contiguous North American railway network. Since being purchased by CN in 2006, the railway's mainline consists of the Slave Lake (Smith, AB - Winagami, AB), Peace River (Winagami - Roma Jct., AB), Manning (Roma Jct., - High Level, AB), and the Meander River (High Level, AB - Hay River, NT) subdivisions.
History
The majority of the tracks which the Mackenzie Northern Railway uses were built by the federal government as the Great Slave Lake Railway, running from a point on the Northern Alberta Railways (NAR) at Grimshaw, Alberta, to the southern shores of Great Slave Lake at Hay River, Northwest Territories. The undertaking started in 1961 with a proposal to Parliament, and the line opened in 1964. This railroad was part of John Diefenbaker's vision for the north, and facilitated shipment of lead-zinc ore from the Pine Point Mine.
The Great Slave Railway's operation was entrusted to Canadian National Railway in 1966, which had been operating the line on behalf of the federal government since it opened. A spur line continued east from Hay River along the south shore of Great Slave Lake to the mine at Pine Point. This section was abandoned in 1988 after the mine closed and ore concentrate shipments ceased. The total mileage in the Northwest Territories from the border with Alberta to Hay River is approximately .
The NAR had been jointly owned by CN and Canadian Pacific Railway (CP) since 1928. In 1981, CN purchased the other half of the NAR from CP, allowing CN to operate continuously from Edmonton to Hay River.
Sale to RailLink Canada
Between November 1997 and May 1998 CN sold its lines running from Smith, Alberta, on the former NAR (north of Edmonton) to Peace River and Grimshaw and on to Hay River to a shortline operator, RailLink Canada. RailLink Canada consolidated these lines under the name Mackenzie Northern Railway.
RailLink Canada was subsequently purchased by RailAmerica, which operated the Mackenzie Northern Railway between Smith and Hay River. Commodities include agriculture and forest products from northeastern Alberta and the southern Northwest Territories, as well as fuel and supplies destined for Arctic communities to be barged across Great Slave Lake and down the Mackenzie River to the Beaufort Sea.
CN buys lines back
On January 19, 2006, CN announced the purchase from RailAmerica Inc. of the Mackenzie Northern Railway, the Lakeland & Waterways Railway, and the Central Western Railway (jointly known as RLGN/CWRL).
CN came full circle by paying $26 million for the three northern Alberta rail lines it had sold nine years previously.
References
External links
Popular Mechanics article on the railway
Northwest Territories railways
Alberta railways
RailAmerica
Railway companies established in 1964
Canadian companies established in 1964 |
https://en.wikipedia.org/wiki/Jovial | Jovial may refer to:
Brice Jovial (born 1984), French football striker
JOVIAL, a programming language
Jovial High School, Yacharam, Telangana, India
Hamster Jovial, a French comic book series
The archaic adjectival form of:
Jupiter (mythology)
Jupiter, the planet
See also
Jovian (disambiguation)
Joy, a positive emotion |
https://en.wikipedia.org/wiki/DRD | DRD may refer to:
Data Retention Directive, a European Union directive on storing telephony communications
Decision Requirements Diagrams, a part of the Decision Model and Notation standard
Defending Rights & Dissent
Denver Roller Dolls, roller skating
Department of Rural Development, a division of the Ministry of Livestock, Fisheries and Rural Development in Myanmar
Department for Regional Development, a former executive department in Northern Ireland
Design Requirements Document, software engineering; similar to a User Requirements Document
Dividends received deduction, a financial term
Diagnostic Repair Drones, fictional robots from Farscape
Dopamine-responsive dystonia, a disease
Dynamic Root Disk, computing
Codes
Amtrak train station code for Durand Union Station
ICAO airline designator code for Air Madrid
former stock symbol for Duane Reade
People
Dario Faini, Italian songwriter and producer also known under the pseudonyms DRD o Dardust |
https://en.wikipedia.org/wiki/Gold%20Circle%20Films | Gold Circle Films is an American independent film production and sales company, mainly focusing on horror, comedy, and romance films founded in 2000 by former co-founder of Gateway Computer, Norman Waitt Jr. Titles released by Gold Circle include White Noise, My Big Fat Greek Wedding, Slither, The Wedding Date, The Man from Elysian Fields, and the Pitch Perfect series.
History
Gold Circle Films was a subsidiary of Gold Circle Entertainment, which was founded in 1996 by Norman Waitt Jr., one of the co-founders of Gateway, Inc. The original company was launched as an umbrella organization where Gold Circle would help market and distribute music releases for record labels. Waitt launched the film division in May 2000.
Gold Circle was turned down, as well as DreamWorks Pictures, in an offer to produce Twisted's indie film, Saw, as Lionsgate would end up purchasing the rights and made it a huge success, spawning a franchise of films.
In 2011, Blumhouse (studio behind franchises such as Paranormal Activity, Sinister, The Purge, Unfriended, and Happy Death Day) joined forces with Gold Circle to create Angle Films.
Films
Double Whammy (2001)
The Man from Elysian Fields (2001)
Strange Hearts (Roads to Riches) (2001)
Tempted (2001)
13 Moons (2002)
The Badge (2002)
Dawg (Bad Boy) (2002)
My Big Fat Greek Wedding (2002)
Poolhall Junkies (2002)
Sonny (2002)
Wishcraft (2002)
Dysfunktional Family (2003)
Rolling Kansas (2003)
Jiminy Glick in Lalawood (2004)
The Long Weekend (2005)
The Wedding Date (2005)
White Noise (2005)
Griffin & Phoenix (2006)
Slither (2006)
Because I Said So (2007)
Whisper (2007)
White Noise 2: The Light (2007)
Over Her Dead Body (2008)
My Sassy Girl (2008)
New in Town (2009)
The Haunting in Connecticut (2009)
Blood Creek (2009)
The Fourth Kind (2009)
The New Daughter (2009)
In the Land of the Free... (2010)
Life as We Know It (2010)
ATM (2012)
Pitch Perfect (2012)
The Haunting in Connecticut 2 (2013)
The Possession of Michael King (2014)
Search Party (2014)
Pitch Perfect 2 (2015)
My Big Fat Greek Wedding 2 (2016)
Cruel and Unusual (2017)
Pitch Perfect 3 (2017)
I Still See You (2018)
Prey for the Devil (2022)
Champions (2023)
My Big Fat Greek Wedding 3 (2023)
Television
Pitch Perfect: Bumper in Berlin (2022)
References
Film production companies of the United States
Gold Circle Films films
Mass media companies established in 2000
2000 establishments in California |
https://en.wikipedia.org/wiki/Gary%20Grigsby | Gary Grigsby is a designer and programmer of computer wargames. In 1997, he was described as "one of the founding fathers of strategy war games for the PC." Computer Games Magazine later dubbed him "as much of an institution in his niche of computer gaming as Sid Meier, Will Wright, or John Carmack are in theirs."
Career
Gary Grigsby purchased a TRS-80 computer in May 1979 to write wargames, but did not know how to approach the two publishers of computer wargames, Strategic Simulations, Inc. (SSI) and Avalon Hill. In February 1982 he called SSI to complain about a bug in its Torpedo Fire; during the conversation Joel Billings encouraged Grigsby to submit his designs. That year Guadalcanal Campaign, written in BASIC, became his first game for SSI, and was nominated for "Best Adventure Game for Home Computer" at the 1983 Origins Game Fair. Through 1997 he created for SSI several titles that are considered classics of the wargame genre, including Kampfgruppe, USAAF, War in Russia and the Steel Panthers series. Two games, Battle of Britain and 12 O'clock High, were done for TalonSoft in the late 90s. In 2001 Grigsby started a game development company called 2 By 3 Games with Billings and Keith Brors. Their latest Grigsby-designed title, Gary Grigsby's War in the East 2, was released by Matrix Games in 2021.
Game designs
Guadalcanal Campaign (1982)
Bomb Alley (1982)
North Atlantic '86 (1983)
Carrier Force (1983)
Objective: Kursk (1984)
War in Russia (1984)
Reforger '88 (1984)
Kampfgruppe (1985)
Mech Brigade (1985)
USAAF (1985)
Battlegroup (1986)
Warship (1986)
War in the South Pacific (1987)
Battle Cruiser (1987)
Panzer Strike! (1988)
Typhoon of Steel (1988)
Overrun! (1989)
Second Front: Germany Turns East (1990)
Western Front (1991)
Carrier Strike (1992)
Gary Grigsby's Pacific War (1992)
Gary Grigsby's War in Russia (1993)
Steel Panthers (1995)
Steel Panthers II: Modern Battles (1996)
Steel Panthers III: Brigade Command: 1939-1999 (1997)
Battle of Britain (1999)
TalonSoft's 12 O'Clock High: Bombing the Reich (1999)
Uncommon Valor: Campaign for the South Pacific (2002)
War in the Pacific: The Struggle Against Japan 1941-1945 (2004)
Gary Grigsby's World at War (2005)
Gary Grigsby's World at War A World Divided (2006)
Gary Grigsby's War Between the States (2008)
Gary Grigsby's War in the East (2010)
Gary Grigsby's War in the West (2014)
Gary Grigsby's War in the East 2 (2021)
References
External links
2 By 3 Games official website
American company founders
Video game programmers
Video game designers
Living people
People from Encinitas, California
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Quinton%20Flynn | Quinton Flynn is an American voice actor and comedian, who has provided the English voices of video game characters such as Raiden in the Metal Gear series, Marcus Damon in Digimon Data Squad, Lea and Axel in the Kingdom Hearts series.
Early life
Quinton Flynn was born in Cleveland, Ohio. He is a graduate of the Bowling Green State University and Kent State University.
Career
Flynn began his career in 1992, his first acting credit was the character Jonathan Willis Internal Monologe in the television film Jonathan: The Boy Nobody Wanted. He also worked in sketch comedy, such as portraying Paul McCartney on Jimmy Kimmel Live!. He reprised the role again in the comedy film, My Dinner with Jimi.
As a voice actor, he has provided many character voices in animated films, television shows, anime and video games. He is a frequently recurring actor in the Crash Bandicoot video game series. He later became the voice of Silver the Hedgehog in the Sonic the Hedgehog series starting in 2010, he continued to voice the character for seven more years until 2017 when he was replaced by Bryce Papenbrook.
Flynn also provided the voice of Reno in Final Fantasy VII and its sequels and prequels, and Henry in No More Heroes. He is also best known for providing the voices of Raiden in the Metal Gear Solid video game series and Lea and Axel in the Kingdom Hearts series. He played the role of Kael'thas Sunstrider in Warcraft III and World of Warcraft; his lines in the latter were replaced in 2021.
In television, he voiced Timon in Disney's Timon & Pumbaa, replacing Nathan Lane after he voiced the character for 10 episodes. Flynn also provided the voice of Mickey Mouse in the Mickey Mouse Works episode "Minnie Takes Care of Pluto".
Additionally, he voiced many other characters in All Grown Up!, The Angry Beavers, As Told by Ginger, Avatar: The Last Airbender, The Avengers: Earth's Mightiest Heroes, Cow and Chicken, Dave the Barbarian, Fantastic Four, Freakazoid!, Generator Rex, The Grim Adventures of Billy and Mandy, Johnny Bravo, Mad, My Life as a Teenage Robot, The Real Adventures of Jonny Quest, Robot Chicken, Samurai Jack, Scooby-Doo! Mystery Incorporated, Spider-Man: The Animated Series, Stuart Little and Teen Titans.
In anime, he voiced Iruka Umino in Naruto, Naruto: Shippuden and The Last: Naruto the Movie. He also voiced characters such as Shingo Shoji for the Tokyopop dub of the Initial D series, Marcus Damon in Digimon Data Squad, Reno in Final Fantasy VII Advent Children, Raiden in the English dub of Metal Gear Solid 2: Bande Dessinee, Carl and McCoy in Blood+, Kon in Bleach series and Dr. Riddles in Zatch Bell.
Filmography
Animation
All Grown Up! – Kid #3, Funny Hair Man (Ep. 9)
Animaniacs – Joey, and Ross
The Angry Beavers – Rusty, Singer
As Told by Ginger – George Magrority
Avatar: The Last Airbender – Tycho (Ep. 35)
The Avengers: Earth's Mightiest Heroes – Malekith the Accursed
Cow and Chicken – Beaver #1, Man
Dave the Barbarian – King, Cu |
https://en.wikipedia.org/wiki/International%20Media%20Distribution | International Media Distribution (IMD) (formerly International Networks), a division of NBCUniversal, is a leading provider of in-language networks which facilitates the distribution of Asian, European, Middle Eastern and Hispanic channels and Video On Demand services across all platforms including, cable, satellite and OTT.
History
Originally launched as International Channel Networks in 1996, the company was owned by Liberty Media (which was the majority owner with a 90% stake) and JJS II Communications, LLC (which owned the remaining 10% share). They owned and operated The International Channel or I-Channel, which was a basic cable channel that launched in 1990 and featured multilingual, multi-ethnic programming to audiences in the United States. The channel offered programming from Europe, Asia & the Middle East in over 25 languages. In 1998, the company began offering a tier of premium networks featuring various channels from around the world. This tier has since grown and currently consists of over 50 networks.
In July 2004, as part of a larger deal, International Channel Networks was sold to Comcast. In 2005, Comcast re-branded the International Channel as AZN Television, a channel catering to Asian Americans and featuring several original programmes. The company was subsequently renamed International Networks.
On April 9, 2008, AZN television ceased operations as Comcast decided to shut down the channel due to distribution and advertising difficulties.
On March 10, 2009, Comcast decided to rename the company as International Media Distribution. The re-brand was undertaken to reflect the growth of the company and to emphasize the focus which is now on the distribution of premium international channels from around the world. In 2011, Comcast completed its purchase of NBCUniversal, thereafter IMD was reorganized under the international television distribution arm of NBCUniversal rather than the Comcast Entertainment Group.
Premium Television Networks
Current
International Media Distribution’s portfolio includes over 50 networks from across the world including:
Arabic
ART America
Chinese
CCTV-4
CGTN Documentary
CTI-Zhong Tian Channel
Phoenix North America Chinese Channel
Phoenix InfoNews Channel
Phoenix Hong Kong Channel (Cantonese)
CGTN (English)
Filipino
The Filipino Channel (TFC)
Myx TV (English)
ABS-CBN News Channel
Cinema One
Lifestyle Network
French
TV5MONDE
TV5MONDE Cinema On Demand
Tivi5MONDE
TV5MONDE Info
TV5MONDE Style
German
DW Deutsch+
Greek
ANT1 Satellite
Italian
Mediaset Italia
Japanese
TV JAPAN
Korean
TVK
TVK2
TVK-Pop On Demand
Polish
TVP Polonia
Russian
Channel One Russia
Dom Kino Premium
TeleCafe
RTN
RTN+
THT
South Asian
ABP News
Eros Now (Subscription VOD)
TV Asia
Aapka Colors
Colors Rishtey
MTV India
Colors Cineplex
Colors Tamil
Colors Kannada
Colors Bangla
Colors Marathi
News 18
Spanish
Cinema Dinamita
Picardia Nacional
PX Sports
VePlus
Vietnamese
SBTN
References
Exte |
https://en.wikipedia.org/wiki/Schools%20Interoperability%20Framework | The Schools Interoperability Framework, Systems Interoperability Framework (UK), or SIF, is a data-sharing open specification for academic institutions from kindergarten through workforce. This specification is being used primarily in the United States, Canada, the UK, Australia, and New Zealand; however, it is increasingly being implemented in India, and elsewhere.
The specification comprises two parts: an XML specification for modeling educational data which is specific to the educational locale (such as North America, Australia or the UK), and a service-oriented architecture (SOA) based on both direct and brokered RESTful-models for sharing that data between institutions, which is international and shared between the locales.
SIF is not a product, but an industry initiative that enables diverse applications to interact and share data. , SIF was estimated to have been used in more than 48 US states and 6 countries, supporting five million students.
The specification was started and maintained by its specification body, the Schools Interoperability Framework Association, renamed the Access For Learning Community (A4L) in 2015.
History
Traditionally, the standalone applications used by public school districts have the limitation of data isolation; that is, it is difficult to access and share their data. This often results in redundant data entry, data integrity problems, and inefficient or incomplete reporting. In such cases, a student's information can appear in multiple places but may not be identical, for example, or decision makers may be working with incomplete or inaccurate information. Many district and site technology coordinators also experience an increase in technical support problems from maintaining numerous proprietary systems. SIF was created to solve these issues.
The Schools Interoperability Framework (SIF) began as an initiative chiefly championed initially by Microsoft to create "a blueprint for educational software interoperability and data access." It was designed to be an initiative drawing upon the strengths of the leading vendors in the K-12 market to enable schools' IT professionals to build, manage and upgrade their systems. It was endorsed by close to 20 leading K-12 vendors of student information, library, transportation, food service applications and more. The first pilot sites began in the summer of 1999, and the first SIF-based products began to show up in 2000.
In the beginning it was not clear which approach would become the national standard in the United States. Both SIF and EDI were vying for the position in 2000 but SIF began taking the lead in 2002 or so. In 2000, the National School Boards Association held a panel discussion during its annual meeting on the topic of SIF.
In 2007 in the United Kingdom Becta has championed the adoption of SIF as a national standard for schools data interchange.
In 2008 it was announced that in the UK the standard will become known as the "Systems Interoperability |
https://en.wikipedia.org/wiki/Zanac | is a shoot 'em up video game developed by Compile and published in Japan by Pony Canyon and in North America by FCI. It was released for the MSX computer, the Family Computer Disk System, the Nintendo Entertainment System, and for the Virtual Console. It was reworked for the MSX2 computer as Zanac EX and for the PlayStation as Zanac X Zanac. Players fly a lone starfighter, dubbed the AFX-6502 Zanac, through twelve levels; their goal is to destroy the System—a part-organic, part-mechanical entity bent on destroying mankind.
Zanac was developed by main core developers of Compile, including Masamitsu "Moo" Niitani, Koji "Janus" Teramoto, and Takayuki "Jemini" Hirono. All of these developers went on to make other popular similarly based games such as The Guardian Legend, Blazing Lazers, and the Puyo Puyo series. The game is known for its intense and fast-paced gameplay, level of difficulty, and music which seems to match the pace of the game. It has been praised for its unique adaptive artificial intelligence, in which the game automatically adjusts the difficulty level according to the player's skill level, rate of fire and the ship's current defensive status/capability.
Gameplay
In Zanac, the player controls the spaceship AFX-6502 Zanac as it flies through various planets, space stations, and outer space and through an armada of enemies comprising the defenses of the game's main antagonist—the "System". The player must fight through twelve levels and destroy the System and its defenses. The objective is to shoot down enemies and projectiles and accumulate points. Players start with three lives, and they lose a life if they get hit by an enemy or projectile. After losing a life, gameplay continues with the player reappearing on the screen and losing all previously accumulated power-ups; the player remains temporarily invincible for a moment upon reappearing on the screen. The game ends when all the player's lives have been lost or after completing the twelfth and final area. However, the player can earn 1-ups (extra lives) throughout the game by accumulating high point scores. Zanac has a continue option which allows players to restart the game from the level in which they lost all their lives.
The player operates a rapid-fire main cannon, which can be upgraded by collecting power-ups found in blue boxes that periodically descend from the top of the screen. As the main cannon's power level is upgraded, the number of bullets fired from the ship as well as their speed increases. In addition, the player operates a specialty weapon that is separate from the main cannon. There are eight different specialty weapons, each represented by differently-numbered power-ups. The player can change the type of specialty weapon equipped by collecting a differently-numbered power-up or can upgrade their current specialty weapon by collecting a numbered power-up that matches their current weapon. These weapons range from directional bullets to shields to indestruct |
https://en.wikipedia.org/wiki/1K | 1K or 1-K may refer to:
Astra 1K satellite
Astra 1KR satellite
1K ZX Chess computer program
Southern Cross Distribution (IATA code)
Sutra (air company) (IATA code)
BMP-1K, see BMP-1
BRM-1K, see BMP-1 variants
HH-1K, see Bell UH-1 Iroquois variants
XMODEM-1K, a model of XMODEM
YMODEM-1K, a model of YMODEM
GSXR 1K, or Suzuki GSX-R1000
Typ 1K, a chassis code of Volkswagen Golf Mk5
SSH 1K (WA), see Washington State Route 509
Premier 1K, a membership level of United Airlines MileagePlus program
1k as one thousand
See also
Kelvin
Kilobyte
K (disambiguation)
K1 (disambiguation)
IK (disambiguation)
lK (disambiguation)
1000 (disambiguation) |
https://en.wikipedia.org/wiki/Shutdown | Shutdown or shut down may refer to:
Government shutdowns
Shutdown (computing)
Shutdown (economics)
Shutdown (nuclear reactor)
Arts and entertainment
Music
"Shut Down" (The Beach Boys song), 1963
Shut Down Volume 2, a 1964 album by the Beach Boys, and "Shut Down, Part II", a track on the album
Shut Down (album), a multi-artist compilation album of 1963 with hot rod music
"Shut Down" (Australian Crawl song), 1982
"Shutdown" (Skepta song), 2015
"Shut Down" (Blackpink song), a song by Blackpink from their 2022 album Born Pink
"Shut Down", a song by Soul Asylum from the 1995 album Let Your Dim Light Shine
"Shutdown", a song by Pitchshifter from the 2002 album PSI
Television
"Shut Down" (Prison Break), an episode of the TV series
"Shutdown" (Good Girls), an episode of the TV series
"Shutdown", an episode of The West Wing (season 5)
See also
General strike
Occupational burnout
Shutdown valve |
https://en.wikipedia.org/wiki/4K | 4K, 4-K or 4k may refer to:
4000 (number)
Four kibibytes (4 × 1024 bytes, better written 4 KiB)
4K disk sector size (Advanced Format)
4K demoscene compo, a computer art competition using programs limited to 4 kibibytes
The Java 4K Game Programming Contest
4K resolution, a collective term for digital video formats having a horizontal resolution of approximately 4,000 pixels
4K UHDTV, an ultra-high-definition television format
4K, the IATA airline code for Askari Aviation
4K, an alternative name for Cuatro Cabezas (Four Heads), an Argentine multimedia production company.
4K, model of Toyota K engine
4K, the production code for the 1976 Doctor Who serial The Brain of Morbius
4KScore test for prostate cancer screening
See also
4000 (disambiguation)
KKKK (disambiguation) |
https://en.wikipedia.org/wiki/TMF%20%28UK%20%26%20Ireland%29 | TMF (The Music Factory) was a music video and entertainment channel in the United Kingdom and Ireland. The channel was owned by Viacom International Media Networks and was originally a Dutch channel. Formed after the two other TMF stations, which were based in mainland Europe, the channel was created to counter against EMAP's The Hits channel (now 4Music) on the new free-to-air digital terrestrial television service Freeview in 2002.
Upon launch, TMF's description was "TMF is designed to replicate the rhythms of the whole family, playing the best pop videos with the biggest pop stars to become the sound track to the British family life." However, it later broadened its content to air programming from its sister channels MTV, VH1, Nick Jr. and Comedy Central, so it no longer relied on just music videos.
TMF broadcast on Freeview, Sky and Virgin Media and as well as in some Irish cable packages. The channel was the most viewed music video related station in the UK, according to BARB ratings.
Shows on TMF
MTV/VH1 programming
TMF initially launched as a non-stop music channel, though from early 2004 it began to air programming from MTV and VH1:
Beavis and Butt-head
Made
MTV Cribs
Room Raiders
Date My Mom
Drawn Together
The Fabulous Life of...
My Fair Brady
Hogan Knows Best
The Surreal Life
Dirty Sanchez
Pimp My Ride
Jackass
My Super Sweet 16
Noggin
Noggin started broadcasting on 30 January 2006, the first international feed of Noggin (excluding the former vintage block on Nick Jr. which only had the name in common). It was a children's television slot broadcast on TMF from 07:00 to 09:00 daily. It showed a selection of Nick Jr shows and often promoted the full Nick Jr. channels to viewers with only Freeview. It was hosted by Moose A. Moose and Zee D. Bird from the American Noggin.
It was relaunched in 2009 after replacing the former Nick Jr. on TMF block. The final set of programmes shown were Go Diego Go!, Dora the Explorer, Little Bear, Bruno and Maggie and the Ferocious Beast.
Noggin was the first commercial children's television channel launched on 30 January 2006 on TMF to air on the UK's DTT platform, Freeview, followed by CITV, then lastly Playhouse Disney on ABC1.
Following the closure of TMF, the block continued on Viva until March 2010, when the Nick Jr. rebrand caused Noggin to shutdown. However, the branding of Noggin (except the name "Noggin") and the Moose and Zee segments were adopted by Nick Jr. and used until January 2013.
Nick Jr on TMF
Nick Jr on TMF had replaced the strand Noggin on 25 September 2005, but its programming remained identical. It is unknown why the rebrand happened, or why it reverted to Noggin in 2009. It used the same ident and presentation package as its main sister channel, Nick Jr. Moose and Zee's segments were removed as well. Programmes shown included Peppa Pig, Maggie and the Ferocious Beast, Dora the Explorer, The Backyardigans, Thomas & Friends, Blue's Clues, LazyTown, Go Diego Go!, |
https://en.wikipedia.org/wiki/Teuvo%20Kohonen | Teuvo Kalevi Kohonen (11 July 1934 – 13 December 2021) was a Finnish computer scientist. He was professor emeritus of the Academy of Finland.
Career
Kohonen studied at the Helsinki University of Technology and graduated with a master's degree in engineering in 1957. He received his doctorate in 1962 and stayed at the university with a faculty position until 1993. He was an academy professor of the Academy of Finland between 1975 and 1999.
During most of his career, Kohonen conducted research at Helsinki University of Technology (TKK). The Neural Networks Research Centre of TKK, a center of excellence appointed by Academy of Finland was founded to conduct research related to Kohonen's innovations. After Kohonen's retirement, the center was led by Erkki Oja and later renamed to Adaptive Informatics Research Centre with widened foci of research.
Kohonen made contributions to the field of artificial neural networks, including the Learning Vector Quantization algorithm, fundamental theories of distributed associative memory and optimal associative mappings, the learning subspace method and novel algorithms for symbol processing like redundant hash addressing. He published several books and over 300 peer-reviewed papers.
Kohonen’s most famous contribution is the self-organizing map, or "SOM" (also known as the "Kohonen map" or "Kohonen artificial neural network"; Kohonen himself prefers "SOM"). Due to the popularity of the SOM algorithm in research and in practical applications, Kohonen is often considered to be the most cited Finnish scientist. The current version of the SOM bibliography contains close to 8,000 entries.
Kohonen died on 13 December 2021, at the age of 87.
Honors and awards
Kohonen was elected the First Vice President of the International Association for Pattern Recognition from 1982 to 1984, and acted as the first president of the European Neural Network Society from 1991 to 1992.
For his scientific achievements, Kohonen received a number of prizes including the following:
IEEE Neural Networks Council Pioneer Award, 1991
Technical Achievement Award of the IEEE Signal Processing Society, 1995
IEEE Frank Rosenblatt Award, 2008
Selected publications
References
External links
Kohonen, Teuvo (2014): MATLAB Implementations and Applications of the Self-Organizing Map, a text book.
Interview with Teuvo Kohonen, by CIM Editorial Officer. IEEE Computational Intelligence Magazine, August 2008, Volume 3, Number 3, pages 4–5.
1934 births
2021 deaths
Academic staff of the Helsinki University of Technology
Finnish computer scientists
Members of the European Academy of Sciences and Arts
Machine learning researchers
Members of the Finnish Academy of Science and Letters
Fellow Members of the IEEE
People from Lauritsala |
https://en.wikipedia.org/wiki/Yahoo%21%20360%C2%B0 | Yahoo! 360° was a social networking and personal communication portal operated by Yahoo! made available in 2005. It enabled users to create personal web sites, share photos from Yahoo! Photos, maintain blogs and lists, create and share a public profile and see which friends are currently online. 360° also featured a 'friends updates' section, under which each friend's latest update was summarized (e.g. blog posts, updated lists or newly shared photos). This service was never officially launched; Yahoo! prematurely stopped developing this service in 2008.
Yahoo! 360° Plus Vietnam was a similar service that was launched in 2008 and is now defunct. The service that had been available in Vietnam until June 2012, then it was substituted by Yahoo! Blog. Finally, Yahoo! Blog Vietnam was officially shut down on January 17, 2013. The user could make a backup to PC, Wordpress, Blogger, or Vietnamese-blog Zing Blog (which was a main choice) by using http://download.blog.yahoo.com.
History
Yahoo 360° launched as an invitation-only service on March 16, 2005. After the full launch on June 24, 2005, it became available to any Yahoo! user over the age of 18 in the United States, the United Kingdom, France, Germany, Canada, Australia, Japan and Vietnam.
From September 2006 through September 2007, the US-based web traffic visiting 360° dropped by more than half. The service had a more global appeal than some of its counterparts, but its global visits also saw a significant drop during the same time frame.
On October 16, 2007, Yahoo announced that they would no longer provide support for or perform bug fixes on Yahoo! 360° as they intend to abandon it in early 2008 in favor of a "universal profile" that will be similar to their Yahoo! Mash experimental system. They have, however, said, that it will not be replaced with Mash itself.
On May 6, 2008, Yahoo announced that they have several Vietnam-centric initiatives as part of their Southeast Asia business strategies. One of these initiatives were Yahoo! 360° Plus Vietnam, a new Vietnamese blogging application. Subsequently, Yahoo! 360° Plus Vietnam was launched in Vietnam along with other new services for Yahoo! Vietnam such as Yahoo! Music (no longer active since 2009). By the end of January 2010, the number of registered users has increased to 1,500,000.
In May 2009, while the service was still in Beta stage of development, Yahoo! announced that Yahoo! 360° service will be officially closed on July 13, 2009 as Yahoo! developers aimed to "focus their efforts on the new profile on Yahoo". Users were given options to move their Yahoo! 360° information and blog to the new profile before this deadline. Yahoo! 360° Plus Vietnam, however, is still active.
On August 30, 2013, Yahoo! announced Yahoo! Blog would be closed on December 26.
Features
Features introduced with 360°:
Themes – custom and prebuilt
Blogs (with RSS feeds)
Lists – where users may compile interests, favorite movies, books, and so on
Feeds – |
https://en.wikipedia.org/wiki/Beam%20search | In computer science, beam search is a heuristic search algorithm that explores a graph by expanding the most promising node in a limited set. Beam search is an optimization of best-first search that reduces its memory requirements. Best-first search is a graph search which orders all partial solutions (states) according to some heuristic. But in beam search, only a predetermined number of best partial solutions are kept as candidates. It is thus a greedy algorithm.
The term "beam search" was coined by Raj Reddy of Carnegie Mellon University in 1977.
Details
Beam search uses breadth-first search to build its search tree. At each level of the tree, it generates all successors of the states at the current level, sorting them in increasing order of heuristic cost. However, it only stores a predetermined number, , of best states at each level (called the beam width). Only those states are expanded next. The greater the beam width, the fewer states are pruned. With an infinite beam width, no states are pruned and beam search is identical to breadth-first search. The beam width bounds the memory required to perform the search. Since a goal state could potentially be pruned, beam search sacrifices completeness (the guarantee that an algorithm will terminate with a solution, if one exists). Beam search is not optimal (that is, there is no guarantee that it will find the best solution).
Uses
A beam search is most often used to maintain tractability in large systems with insufficient amount of memory to store the entire search tree. For example, it has been used in many machine translation systems. (The state of the art now primarily uses neural machine translation based methods.) To select the best translation, each part is processed, and many different ways of translating the words appear. The top best translations according to their sentence structures are kept, and the rest are discarded. The translator then evaluates the translations according to a given criterion, choosing the translation which best keeps the goals. The first use of a beam search was in the Harpy Speech Recognition System, CMU 1976.
Variants
Beam search has been made complete by combining it with depth-first search, resulting in beam stack search and depth-first beam search, and with limited discrepancy search, resulting in beam search using limited discrepancy backtracking (BULB). The resulting search algorithms are anytime algorithms that find good but likely sub-optimal solutions quickly, like beam search, then backtrack and continue to find improved solutions until convergence to an optimal solution.
In the context of a local search, we call local beam search a specific algorithm that begins selecting randomly generated states and then, for each level of the search tree, it always considers new states among all the possible successors of the current ones, until it reaches a goal.
Since local beam search often ends up on local maxima, a common solution is to choose the |
https://en.wikipedia.org/wiki/Combat%20Mission%203%3A%20Afrika%20Korps | Combat Mission 3: Afrika Korps is a turn-based computer wargame about tactical battles in World War II. It is part of the Combat Mission series. It focuses on the campaigns in North Africa, East Africa, Italy, and Crete.
For the Allies, the game represents the forces of Britain, America, Free France, Canada, Poland, Australia, New Zealand, and South Africa. The Axis forces include Germany and Italy.
Demo scenarios
A playable public demo was offered by Battlefront.com. The demo did not include access to the mission editor, but did permit solo, hotseat, email and TCP/IP play of two included scenarios.
The first scenario depicted German armour and infantry assaulting U.S. armour and infantry over open desert and through a shallow wadi into an oasis in early 1943. The scenario highlight several new features of the CM game system, including vehicle-generated dust clouds and the modelling of multi-turreted tanks.
The second scenario depicted a U.S. assault on a German-held village in Italy in 1944.
Reception
The game received "favorable" reviews according to the review aggregation website Metacritic.
References
External links
Official website
2003 video games
Battlefront.com games
Computer wargames
Classic Mac OS games
Video games developed in the United States
Windows games
World War II video games
CDV Software Entertainment games
Multiplayer and single-player video games |
https://en.wikipedia.org/wiki/Combat%20Mission%20II%3A%20Barbarossa%20to%20Berlin | Combat Mission II: Barbarossa to Berlin is a 2002 computer wargame developed and published by Battlefront.com. A turn-based computer game about tactical battles in World War II, it is the sequel to Combat Mission: Beyond Overlord. The game has been described as the "reigning champ of east front tactical warfare for the PC."
Features
Barbarossa to Berlin is both a complement to the earlier Combat Mission: Beyond Overlord, in that it presented a different theatre of war, as well as a sequel, by way of improving game features and adding new ones. The playable nations are: Nazi Germany, Soviet Union, Romania (pre- and post- defection), Hungary, Finland, Poland (under Soviet command) and Italy.
In order to conform to German law, depictions of the swastika were removed. Additionally, all Waffen SS units were renamed "Waffen Grenadier".
Demo
A playable public demo is offered by Battlefront.com. The demo did not include access to the mission editor, but did permit solo, hotseat, email or TCP/IP play of two pre-made scenarios.
Alternate titles
The game was originally released as Combat Mission: Barbarossa to Berlin; it was known in Europe as Combat Mission 2.
A Special Edition, known as Combat Mission II: Barbarossa to Berlin (Special Edition) was released with a "bonus disc" which included graphic mods and additional scenarios collected from designers within the CM community.
Reception
The game received "generally favorable reviews", just one point short of "universal acclaim", according to the review aggregation website Metacritic. GameSpot named it the second-best computer game of October 2002. It was also a runner-up for GameSpots annual "Best Single-Player Strategy Game on PC" award, which went to Medieval: Total War.
It was a runner-up for GameSpy's 2002 "PC Strategy Game of the Year" award, which ultimately went to Medieval: Total War. The editors wrote of Combat Mission II, "This sleeper hit might be hard to find, but if you like realistic World War II tactics you owe it to yourself to track down a copy." Barbarossa to Berlin won Computer Gaming Worlds 2002 "Wargame of the Year" award. The editors wrote that it "doesn't change the genre the way its predecessor did, [but] it still towers high above the competition."
References
External links
Official website
2002 video games
Battlefront.com games
Classic Mac OS games
Multiplayer hotseat games
Turn-based tactics video games
Windows games
World War II video games
Video games developed in the United States
Video games set in Finland
Computer wargames
CDV Software Entertainment games |
https://en.wikipedia.org/wiki/Combat%20Mission%3A%20Beyond%20Overlord | Combat Mission: Beyond Overlord is a 2000 computer wargame developed and published by Big Time Software. It is a simulation of tactical land battles in World War II.
Combat Mission began development at Big Time Software as Computer Squad Leader, an adaptation of the board wargame Advanced Squad Leader. It was set to be published by Avalon Hill. Big Time and Avalon parted ways shortly before the publisher's closure by Hasbro, and Big Time continued development independently, under the new title Combat Mission.
Combat Mission was a commercial and critical hit, and began the Combat Mission series.
Gameplay
Rather than a purely turn-based system, Combat Mission uses the "WeGo" structure for handling player turns.
Development
Origins at Avalon Hill
In January 1997, Avalon Hill contracted Big Time Software to create a computer version of the publisher's board wargame Advanced Squad Leader. Earlier collaborations between the two included Flight Commander 2 and Over the Reich. Avalon Hill had considered a computer adaptation of Squad Leader for several years, as its board incarnations had sold over 1 million copies by 1997, but the company was initially hesitant to pursue this idea because of the series' complexity. While it ultimately attempted the project with Atomic Games, this version fell through and became the unrelated Close Combat in 1996. Terry Coleman of Computer Gaming World called the decision to try again with Big Time "a breath of fresh air". Discussing the new effort in early 1997, Bill Levay of Avalon forecast a release date of late 1998 or potentially 1999 for Big Time's version, as the developer was slated to create Achtung Spitfire! and an unannounced title for Avalon beforehand. The game was set primarily to adapt Advanced Squad Leader, rather than the original Squad Leader, and Levay remarked that it would stay closer to its board roots than had Atomic's project. However, it was not planned to be a one-to-one translation of the board version. Coleman noted at the time, "The only thing for sure is that the ASL design will be turn-based".
Later in 1997, the title of Big Time Software's game was revealed as Computer Squad Leader. The developer's Charles Moylan explained that the project would automate many of the board version's numerical calculations, and would offer scaling levels of complexity to accommodate novices and veterans. Support for online and play-by-email multiplayer modes was planned. Moylan described Computer Squad Leader as an effort to merge Advanced Squad Leader with "new material" from Big Time. It began production in mid-1997. However, Moylan "suspected problems with Avalon Hill [...] and acted accordingly" as the year progressed, Tom Chick of CNET Gamecenter later wrote. To safeguard his project, he avoided the inclusion of features specific to Advanced Squad Leader until the end of development; early production was focused entirely on material whose copyright was owned by Big Time, rather than Avalon Hill. |
https://en.wikipedia.org/wiki/Norio%20Tsuruta | is a Japanese film director. He directed Premonition, Dream Cruise, and Orochi: Blood.
Career
Tsuruta directed Dream Cruise for the Masters of Horror Showtime cable network series. It is based on the short story of the same name by Koji Suzuki.
He also directed Orochi: Blood, which is based on the manga by Kazuo Umezu.
Filmography
Film
Toneriko (1985)
Scary True Stories: Ten Haunting Tales from the Japanese Underground (1991)
Scary True Stories: Night 2 (1992)
Scary True Stories: Realm of Spectres (1992)
Gotoshi Kabusikigaisha (1993)
Gotoshi Kabusikigaisha 2 (1994)
Ring 0: Birthday (2000)
Kakashi (2001)
Premonition (2004)
Orochi: Blood (2008)
Ōsama Game (2011)
POV: Norowareta Film (2012)
Talk to the Dead (2013)
Z ~Zed~ (2014)
Television
Sky High (2003)
Dream Cruise (2007)
? (series) (2012-2015)
References
External links
Japanese film directors
Horror film directors
1960 births
Living people
Film people from Tokyo |
https://en.wikipedia.org/wiki/My%20Restaurant%20Rules | My Restaurant Rules is an Australian reality television series that aired on the Seven Network.
Overview
The series pits five couples, one each from Australia's five largest cities, to compete against each other in opening a successful restaurant.
In initial episodes of the show the couples are given a vacated restaurant space in their home city that must be renovated. They also compete for additional money that can be used for renovation from a panel of judges based on a presentation of their mission statement and plan for their proposed restaurant. The judges also make further appearances later on in the series in both critiquing the restaurants and offering rewards to the contestants.
After a number of weeks the elimination process begins in which the restaurants (and their owners) are reviewed and judged for nomination. The nominated restaurants then compete for votes from a phone poll, with the victor moving on and the loser being forced to shut down. This process continues until a single competing restaurant remains.
Despite the process of elimination that sees almost all competing restaurants shut down, every restaurant featured in the programme was successful and operated in the black. This may be because of the exposure the restaurants are given via the show. Moreover, some eliminated restaurants managed to re-open at new locations.
Series 1 (2004)
The first series of My Restaurant Rules aired in 2004 and featured the five following restaurants and couples:
Nick & Emily – The Red Sea, Adelaide
Simon & Nathalie – My Little Kitchen, Brisbane
Peter & Tayissa – Seven Stones, Melbourne
Ash & Amanda – Room Nineteen, Perth
Sam & Catherine – Cucina Vera, Sydney
In the series finale, Perth's Room Nineteen and owners Ash and Amanda were declared the winners, beating Peter and Tayissa of Melbourne's Seven Stones.
Series one was hosted by Curtis Stone.
Summary
Brisbane succeeded in securing $300,000 worth of sponsorship which producers felt gave them an "unfair advantage". These sponsorship deals then had to be "shared" amongst their opposing teams.
Sydney won the phone poll during renovations where they won $50,000. The losing teams each "won" $10,000.
Sydney was the first to shut down against another strong restaurant, Perth. This was deemed to be a big surprise for both restaurants to be in the bottom two.
Brisbane was the second restaurant to shut down against Perth again. (Although this elimination was showcased as the publics response to the phonepoll research later uncovered Brisbane was "disqualified" after failing to sign over ownership of their "MYLK – my little kitchen" trademark.)
Adelaide was the third restaurant to shut down against Perth and Melbourne. Many thought Melbourne would be the next to shut down.
Underdogs Melbourne was the last to shut down. Perth were declared the controversial winners even though the restaurant failed to make a profit.
Series 2 (2005)
The second series of My Restaurant Rules aired in |
https://en.wikipedia.org/wiki/Nagoya%20Broadcasting%20Network | JOLX-DTV, virtual channel 6 (UHF digital channel 22), branded as is the Chūbu region flagship station of the All-Nippon News Network, owned by the , with its headquarters in Nagoya. It is broadcast in Aichi Prefecture, Gifu Prefecture, and Mie Prefecture.
The station is well known among anime fans for its close association with the anime studio Sunrise (now known as Bandai Namco Filmworks), including participating in the production of such works as Mobile Suit Gundam, Zambot 3 (and its successor Daitarn 3), and Yoroiden Samurai Troopers.
History
Prior launch
The license for channel 11 in the Tōkai region began its search on November 24, 1959. One of the applicants for the broadcast license was Shotaro Kamiya, the then-president of Toyota Motors Sales Division. At that time there were an initial total of 9 companies which was later reduced to 5 companies (after the other 4 companies agreed to merge under the name of Chūkyō Television Broadcasting). On July 14, 1961, the Ministry of Posts (current Ministry of Internal Affairs and Communications) awarded the license to Chukyo TV being designated on channel 11.
The broadcaster was founded on September 6, 1961. On November 25, 1961, the company was renamed to Nagoya Broadcasting Network. Prior to its official broadcast, there were only two commercial broadcasters in the Tokai region: CBC (which is part of JNN) and Tokai TV (which is part of FNN and NNN). Nagoya TV then decided to become part of the Nippon TV and NET TV (current TV Asahi), which resulted from Tokai TV to become a full-time FNN affiliate.
The first tests (still under the Chūkyō name) were held on March 10, 1962. Eventually, service tests were conducted on March 25 and regular transmissions commenced on April 1.
Initially, the station was affiliated to two networks: NTV and NET (the current TV Asahi). It was one of the founding members of the Nippon News Network in 1966. Color transmissions began in December of that year. The station became a sole affiliate of NNN when Chūkyō TV began broadcasting on April 1, 1969.
When CTV began to show interest in joining NNN in 1972, NBN gradually introduced ANN network programming. The network switch was not officialized until April 1, 1973.
Bi-lingual transmissions commenced in 1986. The following year, the station adopted the Nagoya TV branding.
The current brand, Mētele (メーテレ Mētere, derived from the first character in the name Nagoya (名, on reading "めい" mei'')), and hybrid sheep-wolf mascot (Wolfy) were introduced on April 1, 2003.
Stations
AnalogJOLX-TVNagoya TV Tower - Channel 11
Toyohashi - Channel 60
Takayama - Channel 12
Gujo-Hachiman - Channel 6
Nabari - Channel 56
Toba - Channel 4
Ise - Channel 61
Owase - Channel 10
Kumano - Channel 11, etc.
DigitalJOLX-DTV''' (LX, 旧NBN)
Remote Controller ID 6
Nagoya (Seto Digital Tower) - Channel 22
Toyohashi, Chuno, Nakatsugawa, Takayama and Ise - Channel 14
Nabari - Channel 37
Programmes
Now on air
Regional (in Aichi Prefecture, Gif |
https://en.wikipedia.org/wiki/NBN | NBN or nbn may refer to:
Broadcasting networks
National Black Network, US radio network
National Broadcasting Network (Lebanon)
National Broadcasting Network (Trinidad and Tobago)
Nagoya Broadcasting Network, Japan
Nanjing Broadcasting Network, China
NBN Television, New South Wales, Australia
People's Television Network, Philippines, formerly National Broadcasting Network
Organizations
Bureau of Normalization, Belgium
National Biodiversity Network, UK
NBN Co, aka nbn, Australian Government corporation responsible for National Broadband Network
Nefesh B'Nefesh, Israeli organization encouraging immigration
Publications
North by Northwestern, magazine of Northwestern University, US
Other
Annobón Airport, Equatorial Guinea (IATA code)
National Bingo Night (disambiguation), a game show in several countries
National Bibliography Number, several publication identifier systems
National Broadband Network, Australian national wholesale open-access data network
New Brighton railway station, England, National Rail station code
Nibrin, a protein
Niobium nitride (NbN)
See also |
https://en.wikipedia.org/wiki/Mir%20Shakil-ur-Rahman | Mir Shakil ur Rahman, in short MSR, (born 8 January 1957) is a Pakistani media mogul and businessman. He is the founder of the 24-hour news cycle network, Geo TV.
In addition, he is also the owner of the Jang Group of Newspapers and the News International, which was founded by his father, the late Mir Khalil ur Rahman and part owner of the Independent Media Corporation. This media group publishes a number of newspapers and magazines in Urdu and English. IMC also owns the Geo TV network.
Early life
Mir Shakil ur Rahman was born on 8 January 1957 in Karachi, to father Mir Khalil ur Rahman and mother Mehmooda Khalil ur Rahman. He is of Kashmiri descent as his paternal grandparents were from Kashmir Valley. His father was the founder of the Jang Group. He attended St Patrick's High School, Karachi and is listed among the famous personalities of Pakistan that attended this high school.
Career
In the late 1990s, during Nawaz Sharif's second term as Prime Minister, Shakil was first asked by Sharif's government to dismiss some of the staff members of the Jang Group.
Keeping in line with the tradition of the media group that was founded by Mir Shakil's father, Mir Khalil ur Rehman, Shakil refused to dismiss the staff, a number of tax evasion cases were filed against his news group amounting to 40 million US dollars, followed by freezing of bank accounts and seizure of their assets. The government withdrew their court cases after some facts were made public by Shakil.
Shakil founded Geo TV in May 2002. Shakil established a television channel network by the name of Geo TV in May 2002.
He was arrested by the NAB on 12 March 2020 on the allegations of getting 52 kanal land in Lahore by that time Chief Minister of Punjab Nawaz Sharif.
Media industry associations
Mir Shakil has also served as the president of the All Pakistan Newspapers Society, in 2006. He remained a convener of the 'Wage Board Committee' of the society in 2010. He was the president of the Council of Pakistan Newspaper Editors in 1995–96 and again in 2003–04 and also the president of Pakistan Broadcasters Association (PBA) in 2005. Shakil served as a member of the Press Council of Pakistan in 2013. He owns multiple media outlets such as Jang News, Geo News TV channel, The News, and others.
Personal life
Mir Shakil ur Rahman is the younger brother of former Jang Newspaper Editor Mir Javed ur Rahman (1945 - 2020), and the second youngest child of Mehmooda Khalil ur Rahman (1926 - 2021) and the late Mir Khalil ur Rahman (1918 - 1992), who was the founder and editor of the Jang Group of Newspapers. He has two wives, Shahina and Erum. He shares 5 children (three sons and two daughters) with his first wife and 4 children (one son and three daughters) with his second wife. He has nine children in total.
References
Pakistani businesspeople
Geo TV executives
Living people
St. Patrick's High School, Karachi alumni
Pakistani expatriates in the United Arab Emirates
Rahman family
Pakistani male j |
https://en.wikipedia.org/wiki/Psion%20Series%207 | The Psion Series 7 is a subnotebook computer from Psion that was released in 2000. In size it is fairly original: larger than a palmtop or handheld machine, but smaller than a laptop computer. It was the first and last of the Psion series to have a full color electronic visual display. It has a leather-bound clamshell design, with a touch-sensitive, Video Graphics Array (VGA) resolution liquid-crystal display (LCD) and QWERTY computer keyboard. Internally it has a 132.71 MHz StrongARM SA-1100 processor, 16 (upgradable to 32) megabyte (MB) of random-access memory (RAM) and 16 MB of internal read-only memory (ROM).
The machine runs the EPOC operating system (OS), a predecessor of Symbian OS, and as such, can be programmed in the Open Programming Language (OPL), using the provided development program, or in C++ or Java, using a separate personal computer (PC) hosted development system. It can be synchronized to a PC by means of an RS-232 serial port to serial connector, a method that is obsoleted by later standards.
The unit has an expansion port for a CompactFlash (CF) II device such as the Hitachi Microdrive. It also has a PC Card expansion port supporting flash storage, compact flash adapters, modems, wireless and GPS adapters. For data transfer between Psion computers, printers and to use mobile phones as modems the Series 7 features IrDA (infrared) connectivity.
The Series 7 is a variant of the Psion netBook, a machine aimed at the corporate market. Due to customer demand, the reduced capacity Series 7 was released, distinguished by replacing 16 MB of the 32 MB of RAM with a 16 MB ROM chip. Accessing the OS in ROM required slowing the processor down, leading to the false perception that the netBook and Series 7 used a different processor or printed circuit board (PCB). It is thus possible to convert a Series 7 to netBook configuration by replacing this memory card. However, at least two different (interchangeable) PCBs were used during the product's lifecycle, the later PCB distinguished by higher power output to the PC Card.
Included software
Agenda – a personal information management program
Bombs – a minesweeper game
Calc – a calculator
Comms – a terminal emulator
Contacts – a contacts manager
Data – a flat-file database program
Email – an email, SMS, and fax client
Jotter – a multipage scratchpad
Program – an Open Programming Language (OPL) program editor
Record – a voice recording program, for use with the in-built microphone
Sheet – a spreadsheet and graphing package
Sketch – a drawing program (for use with the touch-screen interface)
Spell – a spellchecker, thesaurus and anagram program
Time – a world clock and alarm program
Web – a web browser
Word – a word processor
Linux on the Series 7
An open source project OpenPsion, formerly PsiLinux, aims to port Linux to the Psion Series 7, netBook, and other Psion PDAs. Linux on the Series 7 rather struggles, given the Series 7's limited resources, but most PC Card (16-bit) |
https://en.wikipedia.org/wiki/Java%20compiler | A Java compiler is a compiler for the Java programming language.
Some Java compilers output optimized machine code for a particular hardware/operating system combination, called a domain specific computer system. An example would be the now discontinued GNU Compiler for Java.
The most common form of output from a Java compiler is Java class files containing cross-platform intermediate representation (IR), called Java bytecode.
The Java virtual machine (JVM) loads the class files and either interprets the bytecode or just-in-time compiles it to machine code and then possibly optimizes it using dynamic compilation.
A standard on how to interact with Java compilers was specified in JSR 199.
See also
List of Java Compilers
javac, the standard Java compiler in Oracle's JDK
References
External links
Sun's OpenJDK javac page
Stephan Diehl, "A Formal Introduction to the Compilation of Java", Software - Practice and Experience, Vol. 28(3), pages 297-327, March 1998.
Java specification requests |
https://en.wikipedia.org/wiki/Javac | javac (pronounced "java-see") is the primary Java compiler included in the Java Development Kit (JDK) from Oracle Corporation. Martin Odersky implemented the GJ compiler, and his implementation became the basis for javac.
The compiler accepts source code conforming to the Java language specification (JLS) and produces Java bytecode conforming to the Java Virtual Machine Specification (JVMS).
javac is itself written in Java. The compiler can also be invoked programmatically.
History
On 13 November 2006, Sun's HotSpot Java virtual machine (JVM) and Java Development Kit (JDK) were made available under the GPL license.
Since version 0.95, GNU Classpath, a free implementation of the Java Class Library, supports compiling and running javac using the Classpath runtime — GNU Interpreter for Java (GIJ) — and compiler — GNU Compiler for Java (GCJ) — and also allows one to compile the GNU Classpath class library, tools and examples with javac itself.
See also
Java compiler – for a general presentation of Java compilers, and a list of other existing alternative compilers.
Java Platform
OpenJDK
References
External links
The Compiler Group
JSR 199 Java Compiler API Java Specification Request for invoking the Java compiler from a Java program
Mercurial repository
Java Language Specification
Java compilers |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.