source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/KRIV%20%28TV%29 | KRIV (channel 26) is a television station in Houston, Texas, United States, serving as the market's Fox network outlet. It is owned and operated by the network's Fox Television Stations division alongside MyNetworkTV station KTXH (channel 20). Both stations share studios on Southwest Freeway (I-69/US 59) in Houston, while KRIV's transmitter is located near Missouri City, Texas.
Established in 1971 as an independent station under the KVRL call sign and later as KDOG-TV, channel 26 hit its stride after being sold to Metromedia in 1978; it was then renamed in honor of the Metromedia executive who had encouraged the company to purchase it. Metromedia started the station's news department before being sold and becoming the nucleus of the Fox network in 1986. KRIV's local news programming has since steadily expanded to cover hours of morning, evening, and late news.
History
Early years
On February 17, 1964, the Crest Broadcasting Company, headed by former KIKK owner Leroy J. Gloger, filed an application to build a new TV station on channel 29 in Houston. The Federal Communications Commission (FCC)'s UHF allotment overhaul of 1965 substituted channel 26 for 29. Crest was selected over a competing application from radio station KXYZ, as it got the nod on diversification grounds and superior financial qualifications. KXYZ appealed and asked to submit a revised financial statement, also claiming that Crest had made a misrepresentation as to one of its stockholders, but FCC hearing examiner Chester F. Naumowicz denied the request and upheld the Crest grant.
Construction got underway for KVRL in late 1970, with a mast being erected atop One Shell Plaza in downtown Houston and studios being built in the Schindler Center development at 3935 Westheimer Road in the Highland Village section, now the site of an H-E-B Central Market. The station began broadcasting on August 15, 1971. Programming mostly consisted of syndicated reruns, Texas Rangers baseball, and an affiliation with the Christian Broadcasting Network.
In 1975, Leroy Gloger, who had also taken over general manager duties, was having a conversation when someone remarked that channel 26 was an underdog. For Gloger, who had a penchant for memorable station brands, it was the spark of an idea. He checked with the FCC, found that the call letters KDOG were available, and then changed channel 26 to KDOG-TV on September 1. A series of program changes accompanied the new moniker; the station added 90 minutes a night of Spanish-language programming in prime time.
Acquisition by Metromedia
Six years after going on the air, Crest Broadcasting announced the sale of KDOG-TV to Metromedia for $11 million, including $6 million for the station itself and another $5 million in liabilities. The acquisition closed in April, and on April 17, 1978, the call letters were changed to the current KRIV, in honor of then-Metromedia executive Albert Krivin, who had convinced John Kluge to take a chance on the Houston stati |
https://en.wikipedia.org/wiki/Muller%27s%20method | Muller's method is a root-finding algorithm, a numerical method for solving equations of the form f(x) = 0. It was first presented by David E. Muller in 1956.
Muller's method is based on the secant method, which constructs at every iteration a line through two points on the graph of f. Instead, Muller's method uses three points, constructs the parabola through these three points, and takes the intersection of the x-axis with the parabola to be the next approximation.
Recurrence relation
Muller's method is a recursive method which generates an approximation of the root ξ of f at each iteration. Starting with the three initial values x0, x−1 and x−2, the first iteration calculates the first approximation x1, the second iteration calculates the second approximation x2, the third iteration calculates the third approximation x3, etc. Hence the kth iteration generates approximation xk. Each iteration takes as input the last three generated approximations and the value of f at these approximations. Hence the kth iteration takes as input the values xk-1, xk-2 and xk-3 and the function values f(xk-1), f(xk-2) and f(xk-3). The approximation xk is calculated as follows.
A parabola yk(x) is constructed which goes through the three points (xk-1, f(xk-1)), (xk-2, f(xk-2)) and (xk-3, f(xk-3)). When written in the Newton form, yk(x) is
where f[xk-1, xk-2] and f[xk-1, xk-2, xk-3] denote divided differences. This can be rewritten as
where
The next iterate xk is now given as the solution closest to xk-1 of the quadratic equation yk(x) = 0. This yields the recurrence relation
In this formula, the sign should be chosen such that the denominator is as large as possible in magnitude. We do not use the standard formula for solving quadratic equations because that may lead to loss of significance.
Note that xk can be complex, even if the previous iterates were all real. This is in contrast with other root-finding algorithms like the secant method, Sidi's generalized secant method or Newton's method, whose iterates will remain real if one starts with real numbers. Having complex iterates can be an advantage (if one is looking for complex roots) or a disadvantage (if it is known that all roots are real), depending on the problem.
Speed of convergence
The order of convergence of Muller's method is approximately 1.84. This can be compared with 1.62 for the secant method and 2 for Newton's method. So, the secant method makes less progress per iteration than Muller's method and Newton's method makes more progress.
More precisely, if ξ denotes a single root of f (so f(ξ) = 0 and f'(ξ) ≠ 0), f is three times continuously differentiable, and the initial guesses x0, x1, and x2 are taken sufficiently close to ξ, then the iterates satisfy
where μ ≈ 1.84 is the positive solution of .
Generalizations and related methods
Muller's method fits a parabola, i.e. a second-order polynomial, to the last three obtained points f(xk-1), f(xk-2) and f(xk-3) in each iteration. One |
https://en.wikipedia.org/wiki/PXE | PXE may refer to:
Preboot Execution Environment, booting computers via a network
Proof and Experimental Establishment, an Indian defense laboratory
Pseudoxanthoma elasticum, a genetic disease
Pentium Extreme Edition, a variant of the Pentium D microprocessor
PXE (EP), an EP by Ecco2K
See also
Pex (disambiguation)
it:PXE |
https://en.wikipedia.org/wiki/Low%20poly | Low poly is a polygon mesh in 3D computer graphics that has a relatively small number of polygons. Low poly meshes occur in real-time applications (e.g. games) as contrast with high-poly meshes in animated movies and special effects of the same era. The term low poly is used in both a technical and a descriptive sense; the number of polygons in a mesh is an important factor to optimize for performance but can give an undesirable appearance to the resulting graphics.
Necessity for low poly meshes
Polygon meshes are one of the major methods of modelling a 3D object for display by a computer. Polygons can, in theory, have any number of sides but are commonly broken down into triangles for display. In general the more triangles in a mesh the more detailed the object is, but the more computationally intensive it is to display. In order to decrease render times (i.e. increase frame rate) the number of triangles in the scene must be reduced, by using low poly meshes.
Computer graphics techniques such as normal and bump mapping have been designed to compensate for the decrease of polygons by making a low poly object appear to contain more detail than it does. This is done by altering the shading of polygons to contain internal detail which is not in the mesh.
Polygon budget
A combination of the game engine or rendering method and the computer being used defines the polygon budget; the number of polygons which can appear in a scene and still be rendered at an acceptable frame rate. Therefore, the use of low poly meshes are mostly confined to computer games and other software a user must manipulate 3D objects in real time because processing power is limited to that of a typical personal computer or games console and the frame rate must be high. Computer generated imagery, for example, for films or still images have a higher polygon budget because rendering does not need to be done in real-time, which requires higher frame rates. In addition, computer processing power in these situations is typically less limited, often using a large network of computers or what is known as a render farm. Each frame can take hours to create, despite the enormous computer power involved. A common example of the difference this makes is full motion video sequences in computer games which, because they can be pre-rendered, look much smoother than the games themselves.
Aesthetic
Models that are said to be low poly often appear blocky and simple while still maintaining the basic shape of what they are meant to represent. With computer graphics getting more powerful, it has become increasingly computationally cheap to render low poly graphics. Some artists use the resulting low-detail from a low polygon count as an aesthetic rather than as an optimization technique. They are often used by indie developers due to being faster and cheaper to create. In addition, there is an element of nostalgia to low poly styles, hearkening to older video game consoles such as the Nintendo 6 |
https://en.wikipedia.org/wiki/Heterogeneous%20database%20system | A heterogeneous database system is an automated (or semi-automated) system for the integration of heterogeneous, disparate database management systems to present a user with a single, unified query interface.
Heterogeneous database systems (HDBs) are computational models and software implementations that provide heterogeneous database integration.
Problems of heterogeneous database integration
This article does not contain details of distributed database management systems (sometimes known as federated database systems).
Technical heterogeneity
Different file formats, access protocols, query languages etc. Often called syntactic heterogeneity from the point of view of data.
Data model heterogeneity
Different ways of representing and storing the same data. Table decompositions may vary, column names (data labels) may be different (but have the same semantics), data encoding schemes may vary (i.e., should a measurement scale be explicitly included in a field or should it be implied elsewhere). Also referred as schematic heterogeneity.
Semantic heterogeneity
Data across constituent databases may be related but different. Perhaps a database system must be able to integrate genomic and proteomic data. They are related—a gene may have several protein products—but the data are different (nucleotide sequences and amino acid sequences, or hydrophilic or -phobic amino acid sequence and positively or negatively charged amino acids). There may be many ways of looking at semantically similar, but distinct, datasets.
The system may also be required to present "new" knowledge to the user. Relationships may be inferred between data according to rules specified in domain ontologies.
See also
Big data
Expert system
Knowledge base
Ontology
References
Database management systems |
https://en.wikipedia.org/wiki/Menu%20key | In computing, the menu key or application key () is a key found on Microsoft Windows-oriented computer keyboards, introduced at the same time as the Windows logo key. Its symbol is usually a small icon depicting a pointer hovering above a menu, and it is typically found on the right side of the keyboard between the right Windows logo key and the right control key (or between the right AltGr key and the right control key). While the Windows key is present on the vast majority of keyboards intended for use with the Windows operating system, the menu key is frequently omitted in the interest of space, particularly on portable and laptop keyboards.
The key's primary function is to launch a context menu with the keyboard rather than with the usual right-mouse button. It can be used when the right-mouse button is not present on a mouse.
Some Windows public terminals do not have a Menu key on their keyboard to prevent users from right-clicking; however, in many Windows applications, a similar functionality can be invoked with the keyboard shortcut, or sometimes .
Some laptop computers include a menu function on the fn key (usually operated by typing ), however, this generally invokes functions built into the vendor's software and is not the same as the key described above. For example, the Logitech Illuminated Keyboard has an FN key where the menu key is usually found. Pressing FN, together with the keyboard's print screen key (above home), produces the Menu key function.
Programmers using the Windows API can intercept this key by looking for a WM_KEYDOWN message with wParam VK_APPS (defined as 0x5D in winuser.h). It has key code 93 (VK_APPS 0x5D.)
Android devices formerly came with physical Menu buttons, but with the release of Android Honeycomb, this was deprecated in favor of an on-screen button.
See also
Hamburger button
References
External links
Menu key at Free Dictionary
Computer keys |
https://en.wikipedia.org/wiki/Acorn%20System%201 | The Acorn System 1, initially called the Acorn Microcomputer (Micro-Computer), was an early 8-bit microcomputer for hobbyists, based on the MOS 6502 CPU, and produced by British company Acorn Computers from 1979.
The main parts of the system were designed by then-Cambridge-undergraduate student Sophie Wilson, with a cassette interface designed by Steve Furber. It was Acorn's first product, and was based on an automated cow feeder.
It was a small machine built on two Eurocard-standard circuit boards and it could be purchased ready-built or in kit form.
one card (shown right) with the I/O part of the computer: a LED seven segment display, a 25-key keypad (hex+function keys), and a cassette CUTS interface (the circuitry to the left of the keypad)
the second card (the computer board - see below), which included the CPU, RAM/ROM memory, and support chips
the two boards were interconnected by a semi-flexible, multi-conductor cable, known by its commercial name 'Spectra Strip'
the whole assembly was held together by four 2.5mm × 20mm nylon screws and clear plastic spacing tubes for rigidity.
Main Components (left to right)
Top Row: INS8154 RAMIO Integrated Circuit (for keyboard and display), 6502 CPU, 2 × 2114 1024×4 RAM, 2 × 74S571 512×4 PROM, RAM/ROM expansion socket, second INS8154 for peripheral expansion (optional extra with the kit version).
Bottom row: 1 MHz clock crystal, 4 × TTL logic chips providing address decoding for the memory and I/O expansion, 5V regulator.
The smaller empty socket in the middle of the board was used to set the memory map of the RAM, ROM and I/O expansion by fitting or soldering wires between various positions according to the instructions in the Acorn System 1 Technical Manual.
The three semi-circular legends on the bottom left of the board marked positions for optional push switches to trigger the board's RESET, IRQ (Interrupt ReQuest) and NMI (Non Maskable Interrupt) lines.
Almost all CPU signals were accessible via the standard Eurocard connector on the right-hand side of the board. This connector was not fitted/supplied as standard with the kit version.
The System 1 front board was used as the control panel for the fictional computer Slave in the 1981 series of the BBC science-fiction series Blake's 7.
See also
Acorn System 2,
Acorn System 3,
Acorn System 4,
Acorn System 5
Acorn Atom
References
External links
Comprehensive information on the System 1, including an emulator – Provided by Mike Cowlishaw
Acorn System 1 manuals and schematics at ARCHIVE.ORG
Early microcomputers
System 1
6502-based home computers |
https://en.wikipedia.org/wiki/Enfield%20Town%20railway%20station | Enfield Town is one of three northern termini of the Lea Valley lines on the London Overground network in England. It is the most central of several stations in the London Borough of Enfield, north London. It is down the line from London Liverpool Street, the southern terminus.
Its three-letter station code is ENF and it is in Travelcard zone 5. In 2015 the line and Enfield Town station were transferred from Abellio Greater Anglia operation to London Overground and added to the Tube map.
History
The station was opened on 1 March 1849 by the Eastern Counties Railways as Enfield. It was renamed Enfield Town on 1 April 1886.
A house which had stood on the site since the late 17th century is said to have been the birthplace of Isaac D'Israeli, father of Benjamin Disraeli. It later became a school, at which John Keats was educated. It then became the original station-house before being demolished in 1872. The fine 17th-century brickwork facade, once attributed to Christopher Wren, was dismantled, and reconstructed at South Kensington Museum.
Its place was taken by a brick station building with an attached station-master's house and a walled forecourt. This in turn was replaced in 1957 by the present building by the British Railways architect H. H. Powell.
Operation of the station was transferred from National Express to Abellio Greater Anglia in 2012, and again in 2015 from Abellio Greater Anglia to London Overground.
Stations in Enfield
Enfield Town is also served by the Hertford Loop Line with a station at Enfield Chase on the opposite side of the town centre. The nearest station on the West Anglia Main Line is at Ponders End. Enfield Lock is another main line station in the north of the town, on the branch of the Lea Valley Lines.
Services
The typical off-peak service from the station is two trains per hour to/from London Liverpool Street. At peak times four trains per hour serve the station, and on Tottenham Hotspur Football Club match days there are additional trains, which do not call at all stations along the line.
Connections
London Buses routes 121, 191, 192, 231, 307, 313, 317, 456, W8 and school route 629 serve the station.
Accidents
There have been at least four incidents of trains colliding with the buffer stops, including:
8 September 1850 – an Eastern Counties Railway passenger train collided with the buffers. The cause was determined to be a combination of brake failure and excessive speed.
17 October 1893 – a Great Eastern Railway locomotive collided with the buffers.
2002 - a train collided with the buffers due to low adhesion. There were no injuries.
12 October 2021 – an 8-car Class 710 train (headed by 710124) forming a London Overground service from Liverpool Street failed to stop at the buffers at the end of Platform 2, crashing through them and lifting the front car off the tracks. Seventy-five passengers were evacuated from the train, while the driver and one passenger were injured. Following a post-crash drug |
https://en.wikipedia.org/wiki/Linux%20Desktop%20Testing%20Project | The Linux Desktop Testing Project (LDTP) is a testing tool that uses computer assistive technology to automate graphical user interface (GUI) testing. The GUI functionality of an application can be tested in Linux, macOS, Windows, Solaris, FreeBSD, and embedded system environments. The macOS version is named PyATOM, and the Windows version is Cobra. The LDTP is released as free and open-source software under the GNU Lesser General Public License (LGPL).
LDTP can test any accessibility-enabled GNOME application, Mozilla, OpenOffice.org, any Swing-based Java, Qt 4-based and KDE 4.x applications.
LDTP is/was used by the following companies and organizations:
GNOME
Mozilla
Openoffice.org
KDE
Novell/SuSE
Palm Source
VMware
LDTP can be used to remotely test applications.
History
LDTP version 0.1.0 was released in January 2005 and then showcased and discussed at GNOME Users And Developers European Conference (GUADEC) 2005. It was then used at the Google Summer of Code in 2006 for Tinderbox integration, Evolution automation, and LDTP regression suite under GNOME organization. Then again in 2007, it was used by the Mozilla Foundation for Firefox automation and Tinderbox integration.
Example
This is an example of how LDTP would test writing in gedit:
#!/usr/bin/env python3
# The standard import stuff.
from ldtp import *
from ooldtp import context as locate
from time import sleep
# Here we open the app.
launchapp("gedit")
# Now we find it and make sure it is open.
gedit_win = locate("*gedit")
gedit_win.waittillguiexist()
# Now we type into gedit.
text_field = gedit_win.getchild("txt1")
text_field.enterstring("G'Day mate!")
# Save a picture to prove we did it.
imagecapture("*gedit", "/tmp/foo.png")
# Quit gedit.
quit = gedit_win.getchild("mnuQuit")
quit.selectmenuitem()
# Close without saving.
dont_save = locate("Question")
dont_save.waittillguiexist()
button = dont_save.getchild("btnClosewithoutSaving")
button.click()
# Wait until gedit is gone.
gedit_win.waittillguinotexist()
Diagram of how LDTP works
See also
List of Linux GUI testing tools
Desktop Linux
References
External links
Mago Ubuntu wrapper using LDTP
Freedesktop.org
Free software programmed in Python |
https://en.wikipedia.org/wiki/TNM | TNM may refer to:
TNM staging system, a cancer staging system
Teniente R. Marsh Airport, the main airport in Antarctica
Telekom Networks Malawi, a Malawian mobile telecommunications company
Tetranitromethane, an organic oxidizer
The Nameless Mod, a total conversion mod released in 2009 for the game Deus Ex
Thomas Nelson (publisher) (NYSE stock symbol), a publishing firm that began in Scotland in 1798
Tokyo National Museum, the oldest and largest museum in Japan
The News Minute, an Indian online publication
Texas Nationalist Movement, a Texan political organization |
https://en.wikipedia.org/wiki/Complex%20network | In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often occur in networks representing real systems. The study of complex networks is a young and active area of scientific research (since 2000) inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks.
Definition
Most social, biological, and technological networks display substantial non-trivial topological features, with patterns of connection between their elements that are neither purely regular nor purely random. Such features include a heavy tail in the degree distribution, a high clustering coefficient, assortativity or disassortativity among vertices, community structure, and hierarchical structure. In the case of directed networks these features also include reciprocity, triad significance profile and other features. In contrast, many of the mathematical models of networks that have been studied in the past, such as lattices and random graphs, do not show these features. The most complex structures can be realized by networks with a medium number of interactions. This corresponds to the fact that the maximum information content (entropy) is obtained for medium probabilities.
Two well-known and much studied classes of complex networks are scale-free networks and small-world networks, whose discovery and definition are canonical case-studies in the field. Both are characterized by specific structural features—power-law degree distributions for the former and short path lengths and high clustering for the latter. However, as the study of complex networks has continued to grow in importance and popularity, many other aspects of network structures have attracted attention as well.
The field continues to develop at a brisk pace, and has brought together researchers from many areas including mathematics, physics, electric power systems, biology, climate, computer science, sociology, epidemiology, and others. Ideas and tools from network science and engineering have been applied to the analysis of metabolic and genetic regulatory networks; the study of ecosystem stability and robustness; clinical science; the modeling and design of scalable communication networks such as the generation and visualization of complex wireless networks; and a broad range of other practical issues. Network science is the topic of many conferences in a variety of different fields, and has been the subject of numerous books both for the lay person and for the expert.
Scale-free networks
A network is called scale-free if its degree distribution, i.e., the probability that a node selected uniformly at random has a certain number of links (degree), follows a mathematical function called a power law. The power law implies that the degree distribut |
https://en.wikipedia.org/wiki/Albert%20One | Albert One is an AI chatterbot bot created by Robby Garner and designed to mimic the way humans make conversations using a multi-faceted approach in natural language programming.
History
In both 1998 and 1999, Albert One won the Loebner Prize Contest, a competition between chatterbots.
Some parts of Albert were deployed on the internet beginning in 1995, to gather information about what kinds of things people would say to a chatterbot. Another element of Albert One involved the building of a large database of human statements, and associated replies. This portion of the project was tested at the 1994-1997 Loebner Prize contests.
Albert was the first of Robby Garner's multifaceted bots. The Albert One system was composed of several subsystems. Among those were a version of Eliza, the therapist, Elivs, another Eliza-like bot, and several other helper applications working together in a hierarchical arrangement. As a continuation of the stimulus-response library, various other database queries and assertions were tested to arrive at each of Albert's responses. Robby went on to develop networked examples of this kind of hierarchical "glue" at The Turing Hub.
References
External links
Loebner Prize Contest home page
Chatbots |
https://en.wikipedia.org/wiki/Data%20validation | In computer science, data validation is the process of ensuring data has undergone data cleansing to confirm they have data quality, that is, that they are both correct and useful. It uses routines, often called "validation rules", "validation constraints", or "check routines", that check for correctness, meaningfulness, and security of data that are input to the system. The rules may be implemented through the automated facilities of a data dictionary, or by the inclusion of explicit application program validation logic of the computer and its application.
This is distinct from formal verification, which attempts to prove or disprove the correctness of algorithms for implementing a specification or property.
Overview
Data validation is intended to provide certain well-defined guarantees for fitness and consistency of data in an application or automated system. Data validation rules can be defined and designed using various methodologies, and be deployed in various contexts. Their implementation can use declarative data integrity rules, or procedure-based business rules.
The guarantees of data validation do not necessarily include accuracy, and it is possible for data entry errors such as misspellings to be accepted as valid. Other clerical and/or computer controls may be applied to reduce inaccuracy within a system.
Different kinds
In evaluating the basics of data validation, generalizations can be made regarding the different kinds of validation according to their scope, complexity, and purpose.
For example:
Data type validation;
Range and constraint validation;
Code and cross-reference validation;
Structured validation; and
Consistency validation
Data-type check
Data type validation is customarily carried out on one or more simple data fields.
The simplest kind of data type validation verifies that the individual characters provided through user input are consistent with the expected characters of one or more known primitive data types as defined in a programming language or data storage and retrieval mechanism.
For example, an integer field may require input to use only characters 0 through 9.
Simple range and constraint check
Simple range and constraint validation may examine input for consistency with a minimum/maximum range, or consistency with a test for evaluating a sequence of characters, such as one or more tests against regular expressions. For example, a counter value may be required to be a non-negative integer, and a password may be required to meet a minimum length and contain characters from multiple categories.
Code and cross-reference check
Code and cross-reference validation includes operations to verify that data is consistent with one or more possibly-external rules, requirements, or collections relevant to a particular organization, context or set of underlying assumptions. These additional validity constraints may involve cross-referencing supplied data with a known look-up table or directory information s |
https://en.wikipedia.org/wiki/Acorn%20Eurocard%20systems | The Acorn Eurocard systems were a series of modular microcomputer systems based on rack-mounted Eurocards developed by Acorn Computers from 1979 to 1982, aimed primarily at industrial and laboratory use, but also home enthusiasts.
The experience gained in developing this modular system strongly influenced the design of Acorn's first all-in-one home computer, the Acorn Atom, released in March 1980; and also much of the circuitry in its successor, the BBC Micro, first shown in late 1981.
Acorn's final rack-based machine was the System 5, released in late 1982. The Eurocard business was then sold on to one of its principal resellers, Control Universal Ltd, which continued to develop various cards for industrial use based on the Acorn-standard bus during the 1980s, but ultimately went into receivership in 1989.
Eurocards
Placing the two Eurocards from the original Acorn Microcomputer onto a backplane made the system straightforward to expand in a modular way. The original I/O card, minus its keypad and LED display, became the cassette interface card; while the original 6502 CPU card, slightly adapted with the addition of a keyboard interface, became the basic CPU card of the system.
A series of interchangeable expansion cards were then developed: additional RAM cards; a card containing the Acorn System BASIC interpreter on ROM; a 40×25 character VDU card, and a UHF adaptor for it; interface cards; a floppy disk controller; Econet network cards; an 80×25 character VDU card; and later also alternate processor cards, offering a 6809 or a faster 6502.
System 2
The Acorn System 2 was offered as a system by Acorn Computers from 1980. It was the successor to the Acorn Microcomputer (renamed the Acorn System 1).
The system comprised four Eurocard-sized printed circuit boards mounted in a 19 inch sub-rack frame on an 8-slot backplane, plus a (separately supplied) additional external keyboard. The four PCB cards contained respectively:
a CPU card, containing a 1 MHz 6502 microprocessor, the keyboard interface, and a 2K ROM with the cassette operating system (The 6502 card could be swapped for a 6809.)
a VDU card, providing a 40×25 character teletext-standard display, based on an MC6845 CRT controller and an SAA5050 teletext character generator,
a cassette interface card,
a memory card with 4K of RAM and a 4K BASIC ROM. A further 4K of RAM could be added, and also an additional 4K ROM containing floating-point routines and scientific functions.
The CPU card and cassette interface card were the same cards as used the System 1, but with the keypad and LED display of the latter left unused. The system could be expanded with any of Acorn's standard Eurocards to add further functionality. In 1982 it was being offered for £320, or £480 with power supply, plus an additional £136 for the optional keyboard.
System 3
The Acorn System 3 added a floppy disk controller card, floppy disk drive, and disk operating system ROM, replacing the cassette interfac |
https://en.wikipedia.org/wiki/Playboy%3A%20The%20Mansion | Playboy: The Mansion is a simulation video game for the PlayStation 2, Microsoft Windows and Xbox consoles, developed by Cyberlore Studios, published by Groove Games and Arush Entertainment and licensed by Playboy Enterprises.
Gameplay
Playboy: The Mansion puts players in the role of Hugh Hefner, the founder of Playboy Magazine and Playboy Enterprises, referred to in the game as 'Hef'. The aim of the game is to build the famed Playboy Empire from scratch, starting from a humble magazine to celebrity endorsements to home entertainment to Internet websites to merchandise.
The player can mold the famed Playboy Mansion to their own needs and wants, and has the option of experiencing the infamous Playboy Playmate parties in locations such as the Grotto and the Clubhouse. Hef, as well as all other characters in the game, can build three types of relationships with other characters: casual, business, and romantic. Each month, the player has to print an issue of the magazine. To do that the player needs a cover shoot, a centerfold, an essay from a celebrity, interview with a celebrity, a pictorial about a subject and an article about a subject. The player must hire photographers and writers to create each issue. All the characters have interests, such as sports and music, and writers on those topics will produce higher-quality articles. In the game, the player is the photographer during photo shoots. The game contains many sexual references, including sexual relationships.
There are twelve missions in total. Some of the goals include making and/or fixing relationships with people, publishing certain magazine content, and throwing parties. Players can also choose not to achieve goals, as there is no time limit, and do other things such as parties, mansion renovations and playing with the mansion's variety of games; however, magazines must continue to be published as that is the player's income source.
Music
The main song on the video game is "Playboy Mansion" by Prince Charming, from the album Songs For My Therapist.
A soundtrack to the game, mixed by American DJ and record producer Felix da Housecat has been released. It features house tracks by many renowned producers like Armand Van Helden, DJ Sneak or Kaskade.
Expansion pack
Playboy: The Mansion - Private Party Expansion Pack is the expansion pack. It adds extra features such as parties like Midsummer Night's Dream, world-famous celebrities and Playmates, new animations, enhanced character editing and party-themed music.
Features
The expansion adds many new features to the game. When characters engage in sexual activities, they now remove their underwear and their genitals are blurred, much like The Sims characters. Another feature is the ability to throw "theme parties", which consist of Halloween, A Midsummer Night's Dream, Hef's Birthday, Tropical, Playmate of the Year and more.
Reception
The game was met with mixed reception. GameRankings and Metacritic gave it a score of 60% and 5 |
https://en.wikipedia.org/wiki/Acorn%20Communicator | The Acorn Communicator is a discontinued business computer developed by Acorn Computers. Mentioned in the computing press in late 1984 as the C30, previewed in early 1985 with estimated pricing between £500 and £800, in late 1985 with a built-in LCD display, and subsequently unveiled in a slightly different form, the system sold in very low numbers to companies requiring a computer with a built-in modem.
Orders for the machine were reported in late 1986, with an initial 500 units to be rebadged by Thorn EMI Business Communications for its own customers and approximately 1400 units going to Pickfords Travel for use in its high street stores. As a "smart videotex terminal" and a "complete turnkey comms solution" featuring Prestel connectivity and built-in word processing and spreadsheet capabilities, the extensibility of the product through the development of additional software appealed to customers such as Pickfords. Although not openly priced, rumoured pricing of a Communicator was around £1000 in late 1985 for the basic model, remaining at a similar price level in early 1987 with colour monitor included.
Origins
Launched as part of Acorn's range of new products (alongside the Acorn Cambridge Workstation) targeting "new and more specialised market areas" following the decline of the home computer market and the financial crisis that led to Acorn's rescue by Olivetti, the Communicator had its origins in a concept mentioned publicly by co-founder Chris Curry as early as April 1984, envisioning a communications terminal aimed at business users offering a single-device solution for online information access in an elegant package with a small footprint. Acting as a personal computer, desirable features included the ability to run existing business software, offer networking support and connectivity to mainframes, connect to public data services such as Prestel and Telecom Gold mailboxes, and also support services over other cable-based infrastructure (such as cable television infrastructure then being introduced in the United Kingdom). A meeting between Curry and product design consultant David Morgan, who had approached Acorn with an idea for a personal computer, led to a deeper collaboration that would establish the nature of the Communicator's physical characteristics.
Intending for the product to be customised and sold by other vendors, an emphasis was placed on a physical product design that would permit such customisation and offer a degree of modularity. Thus, a "basic keyboard unit" would be central in any eventual product configuration, being augmented by a telephone, display, storage, printer and other peripherals and accessories. Although Morgan had proposed an electroluminescent display within a lid folding shut over the keyboard in an arrangement that would become common with laptop computers, cost and reliability concerns directed the design towards an optional LCD display and the use of a separate monitor. Alongside the industrial |
https://en.wikipedia.org/wiki/Rather | Rather may refer to:
Ratherius, bishop of Verona
Surname
Dan Rather, news presenter
Elizabeth Rather, expert in the computer programming language Forth
Susan Rather, character in 555 (1988 film)
See also
would rather
"Rather Be (disambiguation)" (song title) |
https://en.wikipedia.org/wiki/QCP | The QCP file format is used by many cellular telephone manufacturers to provide ring tones and record voice. It is based on RIFF, a generic format for storing chunks of data identified by tags. The QCP format does not specify how voice data in the file is encoded. Rather, it is a container format. QCP files are typically encoded QCELP or EVRC.
Qualcomm, which originated the format, has removed an internal web page link from the page that formerly discussed QCP. "Out of an abundance of caution, due to the December 31st, 2007 injunction ordered against certain Qualcomm products, Qualcomm has temporarily removed certain web content until it can be reviewed and modified if necessary to ensure compliance with the injunction. It may be several more days or weeks before these pages are accessible again. Thank you for your patience."
QCP files have the same signature as RIFF files: A SOF (start of file) header of 52494646 ("RIFF"), and an EOF (end of file) of 0000.
Playing QCP files
Qualcomm previously offered downloads of the software and SDK for its PureVoice voice and audio enhancement products that could play and convert QCP files.
References
Digital audio
Computer file formats |
https://en.wikipedia.org/wiki/Battery%20room | A battery room is a room that houses batteries for backup or uninterruptible power systems. The rooms are found in telecommunication central offices, and provide standby power for computing equipment in datacenters. Batteries provide direct current (DC) electricity, which may be used directly by some types of equipment, or which may be converted to alternating current (AC) by uninterruptible power supply (UPS) equipment. The batteries may provide power for minutes, hours or days, depending on each system's design, although they are most commonly activated during brief electric utility outages lasting only seconds.
Battery rooms were used to segregate the fumes and corrosive chemicals of wet cell batteries (often lead–acid) from the operating equipment, and for better control of temperature and ventilation. In 1890, the Western Union central telegraph office in New York City had 20,000 wet cells, mostly of the primary zinc-copper type.
Telecommunications
Telephone system central offices contain large battery systems to provide power for customer telephones, telephone switches, and related apparatus. Terrestrial microwave links, cellular telephone sites, fibre optic apparatus and satellite communications facilities also have standby battery systems, which may be large enough to occupy a separate room in the building. In normal operation power from the local commercial utility operates telecommunication equipment, and batteries provide power if the normal supply is interrupted. These can be sized for the expected full duration of an interruption, or may be required only to provide power while a standby generator set or other emergency power supply is started.
Batteries often used in battery rooms are the flooded lead-acid battery, the valve regulated lead-acid battery or the nickel–cadmium battery. Batteries are installed in groups. Several batteries are wired together in a series circuit forming a group providing DC electric power at 12, 24, 48 or 60 volts (or higher). Usually there are two or more groups of series-connected batteries. These groups of batteries are connected in a parallel circuit. This arrangement allows an individual group of batteries to be taken offline for service or replacement without compromising the availability of uninterruptible power. Generally, the larger the battery room's electrical capacity, the larger the size of each individual battery and the higher the room's DC voltage.
Electrical utilities
Battery rooms are also found in electric power plants and substations where reliable power is required for operation of switchgear, critical standby systems, and possibly black start of the station. Often batteries for large switchgear line-ups are 125 V or 250 V nominal systems, and feature redundant battery chargers with independent power sources. Separate battery rooms may be provided to protect against loss of the station due to a fire in a battery bank. For stations that are capable of black start, power from th |
https://en.wikipedia.org/wiki/KIAH | KIAH (channel 39) is a television station in Houston, Texas, United States, serving as the local CW outlet. Owned and operated by network majority owner Nexstar Media Group, the station maintains studios adjacent to the Westpark Tollway on the southwest side of Houston, and its transmitter is located near Missouri City, in unincorporated Fort Bend County.
History
Origins
The station first signed on the air on January 6, 1967, as an independent station under the callsign KHTV (standing for "Houston Television"). Prior to its debut, the channel 39 allocation in Houston belonged to the now-defunct DuMont affiliate KNUZ-TV, which existed during the mid-1950s. Channel 39 was originally owned by the WKY Television System, a subsidiary of the Oklahoma Publishing Company, publishers of Oklahoma City's major daily newspaper, The Daily Oklahoman. After the company's namesake station, WKY-TV, was sold in 1976, the WKY Television System became Gaylord Broadcasting, named for the family that owned Oklahoma Publishing.
As Houston's first general entertainment independent station, KHTV ran a schedule of programs including children's shows, syndicated programs, movies, religious programs and some sporting events. One of its best known locally produced programs was Houston Wrestling, hosted by local promoter Paul Boesch, which aired on Saturday evenings (having been taped the night before at the weekly live shows in the Sam Houston Coliseum). From 1983 to 1985, the station was branded on-air as "KHTV 39 Gold". It was the leading independent station in Houston, even as competitors entered the market (including KVRL/KDOG (channel 26, now KRIV), when it launched in 1971). During this time, KHTV was distributed to cable providers as a regional superstation of sorts, with carriage on systems as far east as Baton Rouge, Louisiana.
As a WB affiliate
On November 2, 1993, the Warner Bros. Television division of Time Warner and the Tribune Company announced the formation of The WB Television Network, one of two television networks scheduled to launch during the 1994–95 season to compete against Fox and, to a lesser extent, with ABC, NBC and CBS. Among the affiliation agreements it initially signed, which included the eight independent stations Tribune owned at the time, The WB reached an agreement with Gaylord Broadcasting in which KHTV and sister independents KTVT (now a CBS owned-and-operated station) in Dallas–Fort Worth, WVTV (now a CW affiliate) in Milwaukee and KSTW (now an independent station) in Tacoma, Washington, would become charter WB affiliates.
A wrench was thrown into that agreement in May 1994, after New World Communications signed a long-term agreement to affiliate its major network-affiliated stations with Fox, starting that September and as individual contractual agreements with the affected stations expired. Under the deal, Fox tapped longtime Dallas-Fort Worth CBS affiliate KDFW (now a Fox owned-and-operated station) – which New World had recently |
https://en.wikipedia.org/wiki/Decwar | DECWAR is a multiplayer computer game first written in 1978 at the University of Texas at Austin for the PDP-10. It was developed from a lesser-known two-player version, WAR, adding multi-terminal support for between one and ten players. WAR and DECWAR are essentially multiplayer versions of the classic Star Trek game, but with added strategic elements. The game was later used, by scrubbing copyright notices and replacing them, as MegaWars on CompuServe and Stellar Warrior on GEnie. Both versions ran for years.
History
Original versions
The original game that led to DECWAR was WAR, a two-player version of Star Trek for the CDC 6600. In Star Trek, a single player would hunt around the galaxy looking for an invasion force of Klingon warships, and return to a number of starbases to refit and repair. In WAR, the starbases were replaced by planets that either player could capture after attacking them, turning them "friendly". The game ended when one user captured all of the planets and destroyed his opponent's ship. The 6600 supported only one operating terminal, so the players had to take turns entering their commands.
During a port to the PDP-10, the game was more heavily modified and became DECWAR. The game was no longer run as a single instance, but instead as a number of programs (or "jobs"), one for each user, communicating through a shared memory. This allowed up to 18 players to join or leave the game as they wished, the other players continuing to see the map as it was before. Another addition was a single computer-controlled Romulan ship, who would be spawned into games with less than full players in order to give the humans someone to fight. When the roster filled with players (the number depended on the version) the Romulan would not be re-spawned after being killed.
Version 1.0 of DECWAR was released in August 1978. The university would make copies available on tape for the nominal fee of $50, and it soon appeared on PDP-10s around the world. The greatly updated 2.0 was released in July 1979, and another major version, 2.3, on 20 November 1981.
Commercial versions
Bill Louden, who was in charge of games at CompuServe, purchased a version of DECWAR from UT Austin after having been told of its existence one night on CB Simulator by Merlyn Cousins. In 1982, Louden gave it to the programmers at Kesmai, who wrote many of CompuServe's games. They found that the copyright said nothing about commercial uses, and quickly produced a new version after replacing any potentially lawsuit-friendly references to the Star Trek universe with more generic references.
The new version, MegaWars, went live on CompuServe in 1983 and ran continuously until 1998, although there were a few times where they closed it down during that period only to revive it after receiving complaints from the players. Numerous additions were made during its run, notably different classes of ships, and later versions looked little like the original DECWAR.
Kesmai also worke |
https://en.wikipedia.org/wiki/Recurrent%20neural%20network | A recurrent neural network (RNN) is one of the two broad types of artificial neural network, characterized by direction of the flow of information between its layers. In contrast to the uni-directional feedforward neural network, it is a bi-directional artificial neural network, meaning that it allows the output from some nodes to affect subsequent input to the same nodes. Their ability to use internal state (memory) to process arbitrary sequences of inputs makes them applicable to tasks such as unsegmented, connected handwriting recognition or speech recognition. The term "recurrent neural network" is used to refer to the class of networks with an infinite impulse response, whereas "convolutional neural network" refers to the class of finite impulse response. Both classes of networks exhibit temporal dynamic behavior. A finite impulse recurrent network is a directed acyclic graph that can be unrolled and replaced with a strictly feedforward neural network, while an infinite impulse recurrent network is a directed cyclic graph that can not be unrolled.
Additional stored states and the storage under direct control by the network can be added to both infinite-impulse and finite-impulse networks. The storage can also be replaced by another network or graph if that incorporates time delays or has feedback loops. Such controlled states are referred to as gated state or gated memory, and are part of long short-term memory networks (LSTMs) and gated recurrent units. This is also called Feedforward Neural Network (FNN). Recurrent neural networks are theoretically Turing complete and can run arbitrary programs to process arbitrary sequences of inputs.
History
The Ising model (1925) by Wilhelm Lenz and Ernst Ising
was a first RNN architecture that did not learn. Shun'ichi Amari made it adaptive in 1972. This was also called the Hopfield network (1982). See also David Rumelhart's work in 1986. In 1993, a neural history compressor system solved a "Very Deep Learning" task that required more than 1000 subsequent layers in an RNN unfolded in time.
LSTM
Long short-term memory (LSTM) networks were invented by Hochreiter and Schmidhuber in 1997 and set accuracy records in multiple applications domains.
Around 2007, LSTM started to revolutionize speech recognition, outperforming traditional models in certain speech applications. In 2009, a Connectionist Temporal Classification (CTC)-trained LSTM network was the first RNN to win pattern recognition contests when it won several competitions in connected handwriting recognition. In 2014, the Chinese company Baidu used CTC-trained RNNs to break the 2S09 Switchboard Hub5'00 speech recognition dataset benchmark without using any traditional speech processing methods.
LSTM also improved large-vocabulary speech recognition and text-to-speech synthesis and was used in Google Android. In 2015, Google's speech recognition reportedly experienced a dramatic performance jump of 49% through CTC-trained LSTM.
LSTM broke re |
https://en.wikipedia.org/wiki/Feedforward%20neural%20network | A feedforward neural network (FNN) is one of the two broad types of artificial neural network, characterized by direction of the flow of information between its layers. Its flow is uni-directional, meaning that the information in the model flows in only one direction—forward—from the input nodes, through the hidden nodes (if any) and to the output nodes, without any cycles or loops, in contrast to recurrent neural networks, which have a bi-directional flow. Modern feedforward networks are trained using the backpropagation method and are colloquially referred to as the "vanilla" neural networks.
Timeline
In 1958, a layered network of perceptrons, consisting of an input layer, a hidden layer with randomized weights that did not learn, and an output layer with learning connections, was introduced already by Frank Rosenblatt in his book Perceptron. This extreme learning machine was not yet a deep learning network.
In 1965, the first deep-learning feedforward network, not yet using stochastic gradient descent, was published by Alexey Grigorevich Ivakhnenko and Valentin Lapa, at the time called the Group Method of Data Handling.
In 1967, a deep-learning network, using stochastic gradient descent for the first time, was able to classify non-linearily separable pattern classes, as reported Shun'ichi Amari. Amari's student Saito conducted the computer experiments, using a five-layered feedforward network with two learning layers.
In 1970, modern backpropagation method, an efficient application of a chain-rule-based supervised learning, was for the first time published by the Finnish researcher Seppo Linnainmaa. The term (i.e. "back-propagating errors") itself has been used by Rosenblatt himself, but he did not know how to implement it, although a continuous precursor of backpropagation was already used in the context of control theory in 1960 by Henry J. Kelley. It is known also as a reverse mode of automatic differentiation.
In 1982, backpropagation was applied in the way that has become standard, for the first time by Paul Werbos.
In 1985, an experimental analysis of the technique was conducted by David E. Rumelhart et al.. Many improvements to the approach have been made in subsequent decades.
In 1987, using a stochastic gradient descent within a (wide 12-layer nonlinear) feed-forward network, Matthew Brand has trained it to reproduce logic functions of nontrivial circuit depth, using small batches of random input/output samples. He, however, concluded that on hardware (sub-megaflop computers) available at the time it was impractical, and proposed using fixed random early layers as an input hash for a single modifiable layer.
In 1990s, an (much simpler) alternative to using neural networks, although still related support vector machine approach was developed by Vladimir Vapnik and his colleagues. In addition to performing linear classification, they were able to efficiently perform a non-linear classification using what is called the |
https://en.wikipedia.org/wiki/UNIVAC%20III | The UNIVAC III, designed as an improved transistorized replacement for the vacuum tube UNIVAC I and UNIVAC II computers, was introduced in June 1962, with Westinghouse agreeing to furnish system programing and marketing on June 1, 1962. It was designed to be compatible for all data formats. However the word size and instruction set were completely different; this presented significant difficulty as all programs had to be rewritten, so many customers switched to different vendors instead of upgrading existing UNIVACs.
The UNIVAC III weighed about .
The system was engineered to use as little core memory as possible, as it was a very expensive item. The memory system was 25 bits wide and could be configured with from 8,192 words to 32,768 words of memory. Memory was built in stacks of 29 planes of 4,096 cores: 25 for the data word, two for "modulo-3 check" bits, and two for spares. Each memory cabinet held up to four stacks (16,384 words).
It supported the following data formats:
25-bit signed binary numbers
excess-3 binary-coded decimal with four bits per digit, allowing six-digit signed decimal numbers
alphanumerics with six bits per character, allowing four-character signed alphanumeric values
Instructions were 25 bits long.
The CPU had four accumulators, a four-bit field (ar) allowed selection of any combination of the accumulators for operations on data from one to four words in length. For backward compatibility with the UNIVAC I and UNIVAC II data, two accumulators were needed to store a 12-digit decimal number and three accumulators were needed to store a 12-character alphanumeric value. When accumulators were combined in an instruction, the sign bit of the Most Significant Accumulator was used and the others ignored.
The CPU had 15 index registers, a four-bit field (x) allowed selection of one index register as the base register. Operand addresses were determined by adding the contents of the selected base register and the 10-bit displacement field (m). Instructions that modified or stored index registers used a four-bit field (xo) to select that index register.
Indirect addressing or field selection was selected if the one-bit field (i/a) was set. Both indirect addressing and a base register could be selected in the indirect address in memory. Only a base register could be selected in the field selector in memory.
Sperry Rand began shipment in June 1962 and produced 96 UNIVAC III systems.
The operating systems(s) which were developed for the UNIVAC III's were called CHIEF, and BOSS.The assembly language was SALT. The majority of UNIVAC III systems were equipped with tape drives; tapes contained images of the system data at the head of any tape, followed by data. The OS could handle jobs at this time, so some tapes had data relating to job control, and others had data. UNIVAC III systems could have up to 32 tape drives.
Some systems were equipped at a later time with a random-access FASTRAND drum.
See also
List of UNIVAC pr |
https://en.wikipedia.org/wiki/Tag%20%28metadata%29 | In information systems, a tag is a keyword or term assigned to a piece of information (such as an Internet bookmark, multimedia, database record, or computer file). This kind of metadata helps describe an item and allows it to be found again by browsing or searching. Tags are generally chosen informally and personally by the item's creator or by its viewer, depending on the system, although they may also be chosen from a controlled vocabulary.
Tagging was popularized by websites associated with Web 2.0 and is an important feature of many Web 2.0 services. It is now also part of other database systems, desktop applications, and operating systems.
Overview
People use tags to aid classification, mark ownership, note boundaries, and indicate online identity. Tags may take the form of words, images, or other identifying marks. An analogous example of tags in the physical world is museum object tagging. People were using textual keywords to classify information and objects long before computers. Computer based search algorithms made the use of such keywords a rapid way of exploring records.
Tagging gained popularity due to the growth of social bookmarking, image sharing, and social networking websites. These sites allow users to create and manage labels (or "tags") that categorize content using simple keywords. Websites that include tags often display collections of tags as tag clouds, as do some desktop applications. On websites that aggregate the tags of all users, an individual user's tags can be useful both to them and to the larger community of the website's users.
Tagging systems have sometimes been classified into two kinds: top-down and bottom-up. Top-down taxonomies are created by an authorized group of designers (sometimes in the form of a controlled vocabulary), whereas bottom-up taxonomies (called folksonomies) are created by all users. This definition of "top down" and "bottom up" should not be confused with the distinction between a single hierarchical tree structure (in which there is one correct way to classify each item) versus multiple non-hierarchical sets (in which there are multiple ways to classify an item); the structure of both top-down and bottom-up taxonomies may be either hierarchical, non-hierarchical, or a combination of both. Some researchers and applications have experimented with combining hierarchical and non-hierarchical tagging to aid in information retrieval. Others are combining top-down and bottom-up tagging, including in some large library catalogs (OPACs) such as WorldCat.
When tags or other taxonomies have further properties (or semantics) such as relationships and attributes, they constitute an ontology.
Metadata tags as described in this article should not be confused with the use of the word "tag" in some software to refer to an automatically generated cross-reference; examples of the latter are tags tables in Emacs and smart tags in Microsoft Office.
History
The use of keywords as part of an identifi |
https://en.wikipedia.org/wiki/Eric%20Server | Eric Server (born December 4, 1944 in Santa Monica, California) is an American television actor, best known for providing the voice of computer brain Dr. Theopolis in the 1979 TV series Buck Rogers in the 25th Century. From 1979 to 1981 he appeared as Lt. Jim Steiger in 17 episodes of B.J. and the Bear.
He guest-starred in the Star Trek: Deep Space Nine episode "The Circle" and in the Battlestar Galactica episode "The Magnificent Warriors". He also appeared as a police officer in the pilot episode of The Incredible Hulk. Server also appeared in two more episodes of The Incredible Hulk as a race car driver in the season 2 episode "Ricky" and as a thief in the Season 3 episode "A Rock and a Hard Place".
Starting in the early 1970s Server had guest roles in a number of network series. The shows he appeared in more than once include Ironside, Barnaby Jones, The Rockford Files, Police Story, The Streets of San Francisco, Hunter, Switch, Emergency!, Lou Grant, Simon & Simon, T.J. Hooker, Murder, She Wrote and L.A. Law.
References
External links
1944 births
Living people
American male television actors
American male voice actors
Male actors from Los Angeles
Actors from Santa Monica, California |
https://en.wikipedia.org/wiki/Paul%20Debevec | Paul Ernest Debevec is a researcher in computer graphics at the University of Southern California's Institute for Creative Technologies. He is best known for his work in finding, capturing and synthesizing the bidirectional scattering distribution function utilizing the light stages his research team constructed to find and capture the reflectance field over the human face, high-dynamic-range imaging and image-based modeling and rendering.
Debevec received his undergraduate degree in mathematics and engineering from the University of Michigan, and a Ph.D. in computer science from University of California, Berkeley in 1996; his thesis research was in photogrammetry, or the recovery of the 3D shape of an object from a collection of still photographs taken from various angles. In 1997 he and a team of students produced The Campanile Movie (1997), a virtual flyby of UC Berkeley's Campanile tower. Debevec's more recent research has included methods for recording real-world illumination for use in computer graphics; a number of novel inventions for recording ambient and incident light have resulted from the work of Debevec and his team, including the light stage, of which five or more versions have been constructed, each an evolutionary improvement over the previous.
Techniques based on Debevec's work have been used in several major motion pictures, including The Matrix (1999), The Matrix Reloaded and The Matrix Revolutions (2003) Spider-Man 2 (2004), King Kong (2005), Superman Returns (2006), Spider-Man 3 (2007), and Avatar (2009).
In addition Debevec and his team produced several short films that have premiered at SIGGRAPH's annual Electronic Theater, including Fiat Lux (1999) and The Parthenon (2004).
Debevec, along with Tim Hawkins, John Monos and Mark Sagar, was awarded a 2010 Scientific and Engineering Award from the Academy of Motion Picture Arts and Sciences for the design and engineering of the Light Stage capture devices and the image-based facial rendering system developed for character relighting in motion pictures.
In 2002, he was named to the MIT Technology Review TR100 as one of the top 100 innovators in the world under the age of 35.
Some of his later work he presented to the SIGGRAPH convention in 2008 and 2013, Digital Emily in association with Image Metrics and Digital Ira in association with Activision respectively. Digital Emily shown in 2008 was a pre-computed simulation meanwhile Digital Ira ran in real-time in 2013 and is fairly realistic looking even in real-time animation.
In June 2016, Debevec joined Google's Virtual Reality group.
References
External links
HDRshop
Computer graphics professionals
University of Michigan College of Engineering alumni
University of Southern California faculty
University Laboratory High School (Urbana, Illinois) alumni
Academy Award for Technical Achievement winners
Living people
Year of birth missing (living people)
Place of birth missing (living people)
Google employees |
https://en.wikipedia.org/wiki/Kendal%20railway%20station | Kendal railway station is a railway station serving the market town of Kendal in Cumbria, England. The station is owned by Network Rail and is operated by Northern Trains who provide all passenger train services.
History
The station opened on 28 September 1846 as the temporary terminus of the Lancaster and Carlisle Railway. Through trains operated from 20 April 1847 when the Kendal and Windermere Railway opened its line to Windermere.
The second platform at the station was taken out of use when the line was singled in May 1973. A car park now occupies the site of the demolished Oxenholme-bound platform, signal box and goods depot. The signal box was dismantled after closure and rebuilt at on the Settle-Carlisle Line. The former station building survives but no longer forms part of the station itself (now in private commercial use).
Description
It is on the Windermere Branch Line from Oxenholme to Windermere. It is operated by Northern. It only has one platform, which has a stone-built shelter. The station is unstaffed: passengers must buy tickets in advance or from the conductor on board the train. Train running information is provided via digital CIS displays, a customer help point and timetable posters. Step-free access is available from the car park and main entrance to the platform.
The station is served by one train per hour in each direction between Windermere and Oxenholme, with some services running direct to . Passengers for most other destinations must change at Oxenholme.
Services are operated with Class 195 diesel multiple units.
References
External links
Video footage and history of Kendal Station
Railway stations in Cumbria
DfT Category F1 stations
Former London and North Western Railway stations
Railway stations in Great Britain opened in 1846
Northern franchise railway stations
Kendal
1846 establishments in England |
https://en.wikipedia.org/wiki/Staveley%20railway%20station | Staveley railway station is a railway station in Staveley in Cumbria, England. The station is on the Windermere Branch Line connecting Oxenholme and Windermere. The station is owned by Network Rail and is operated by Northern Trains who provide all passenger train services, Staveley was a request stop until December 2012.
History
The station opened on 20 April 1847. On 28 October 1887, John Studholme was using the foot crossing with the intention of getting a train to Windermere, when he was struck by an engine travelling at around 45 mph. He sustained a compound fracture to his right leg, and his collar bone was broken. At the Kendal Memorial Hospital, his leg was amputated the following day.
Until the branch line was reduced to single track in 1973, there were two platforms staggered either side of the road bridge at the east end of the station.
Facilities
The station has a single platform. There is a single waiting shelter provided, along with digital CIS display, customer help point and a telephone to offer train running details. No step-free access is available, as the only entrance is via a staircase from Station Road.
Services
Monday through Saturday there is an hourly service to Windermere and hourly to Oxenholme, with a few daily services extending to , Preston and Manchester. On Sundays, there is an hourly service to Oxenholme and return to Windermere.
References
External links
Railway stations in Cumbria
DfT Category F2 stations
Former London and North Western Railway stations
Railway stations in Great Britain opened in 1847
Northern franchise railway stations
1847 establishments in England |
https://en.wikipedia.org/wiki/Chinese%20Software%20Developer%20Network | The "Chinese Software Developer Network" or "China Software Developer Network", (CSDN), operated by Bailian Midami Digital Technology Co., Ltd., is one of the biggest networks of software developers in China. CSDN provides Web forums, blog hosting, IT news, and other services. CSDN has about 10 million registered users and is the largest developer community in China.
Services offered
Web forums with a ranking system and similar topics
Blog hosting , with 69,484 bloggers at April 7, 2005
Document Center , a selection of blog articles
IT News
IT job hunting and training services
Online bookmark service
Web Forum
The CSDN community website is where Chinese software programmers seek advice. A poster describes a problem, posts it in the forum with a price in CSDN points, and then waits for replies. On some popular boards, a poster will get a response in a few hours, if not minutes. Most replies are short but enough to point out the mistake and give possible solutions. Some posts include code and may grow to several pages. The majority of posts are written in Simplified Chinese, although Traditional Chinese and English posts are not uncommon. .
Topics are mainly IT related and focused on programming, but political and life topics are also active. The forums were closed for two weeks in June 2004. This was likely for political reasons, because many political words, such as the names of political leaders and organizations, have been banned in posts since then. However, political discussions with intentional misspellings are still active.
Blog
The site hosts many IT blogs, but the large number of bloggers makes the server slow. In December 2005, Baidu rated CSDN as one of the top Chinese blog service providers.
Collaboration with Microsoft
CSDN started cooperation with Microsoft in 2002, and several Microsoft technical support staff have provided their support in CSDN forums since then. CSDN is also a major source of Chinese Microsoft Most Valuable Professionals.
Criticism
Some people have complained about the CPU-consuming XML page format of the web forum. Other have complained about its unfriendly interface in browsers other than Internet Explorer. Nevertheless, the website receives 1.3 million hits every day, according to Alexa .
User information leakage
In December 2011, the information of 6,000,000 CSDN users was reported to be leaked. This serious security problem was caused by storing users' passwords in clear text without any hashing/encryption in the CSDN database.
See also
Software industry in China
China Software Industry Association
External links
Official website of Bailian Midami Digital Technology Co., Ltd.
PalmSource and CSDN Launch New Online Forum for Chinese Developer Community
Sources of knowledge acquisition for Chinese software engineers
Chinese social networking websites
Knowledge markets
Software developer communities |
https://en.wikipedia.org/wiki/Chuck%20Forsberg | Charles Alton "Chuck" Forsberg (May 6, 1944 – September 24, 2015) developed two data transmission protocols popular in the 1990s, for uploading and downloading files from dial-up bulletin board systems. He received a Dvorak Award for Excellence in Telecommunications in 1992 for developing ZMODEM. He was also the project engineer on the Tektronix 4010-series graphics terminals.
The widely adopted ZMODEM uses a sliding window protocol. Rather than wait for positive acknowledgment after each block is sent, it sends blocks in rapid succession and resends unacknowledged blocks later. By avoiding delays due to latency, the bandwidth usable for transmission more closely approached the bandwidth of the underlying link. ZMODEM could also resume interrupted transfers without retransmitting the already-received blocks. In addition to developing the protocol, Forsberg developed software for sending and receiving files using ZMODEM.
Forsberg then wrote a version, Zmodem G, which was for use over "guaranteed error free" communications lines, such as Ethernet or short serial-to-serial computer connections. This protocol waived the usual retransmission overhead, to send files as fast as possible.
Originally, he wrote a program for Unix called rbsb (receive batch / send batch) which used block 0 to transmit a file's name, and optionally date and time, since Ward Christensen designed XMODEM to start at block 1, leaving block 0 available. Christensen suggested Forsberg call his protocol YMODEM because it was "one better" than Xmodem. Forsberg created the program YAM, which in traditional Unix nomenclature stood for Yet Another Modem after "Modem.asm", the original version of Xmodem released by Christensen in the CP/M User's group in 1977.
Forsberg most recently resided in Portland, Oregon, prior to his death. He ran data transmission software company Omen Technology which he founded in 1984. Omen Technology published software tools such as ZComm (a terminal-based communications program that included the ZMODEM-90 file transfer protocol) and DSZ. He was an amateur radio operator (call sign WA7KGX) and a licensed aircraft pilot.
Jesse Walker cited Forsberg as a participant in WMAS, a pirate radio station at Western Military Academy in Alton, Illinois. He graduated from the academy in 1962.
References
1944 births
2015 deaths
Amateur radio people
American computer programmers
American electrical engineers
Aviators from Illinois |
https://en.wikipedia.org/wiki/Ted%20Selker | Edwin Joseph Selker, better known as Ted Selker, is an American computer scientist known for his user interface inventions.
Biography
Selker graduated from Brown University in 1979 with a BS in Applied Mathematics, and from the University of Massachusetts Amherst with an MS in Computer and Information Sciences in 1981. From June 1981 to 1983 he worked as research assistant in the Stanford University, Robotics Laboratory. One of his projects was a collaborative display system for the WAITS system of the Stanford Artificial Intelligence Laboratory (SAIL).
He worked for Atari for a year, then returned to Stanford to teach for a year.
Selker joined IBM in August 1985, first at the Thomas J. Watson Research Center. He graduated with a PhD from City University of New York in 1992. His thesis was titled "A Framework for Proactive Interactive Adaptive Computer Help".
He then moved to the IBM Almaden Research Center where he founded and directed the User Systems Ergonomics Research lab.
He was made an IBM Fellow in 1996. Selker holds 67 US patents. He developed the pointing stick (known as TrackPoint) technology which are the distinctive feature of the ThinkPad line of laptop computers (designed, developed and sold by IBM but produced by Lenovo since 2005).
Selker joined the MIT faculty in September 1999. He headed the Context Aware Computing group at the MIT Media Lab and was the MIT director of The Voting Technology Project and Design Intelligence.
He joined the faculty of Carnegie Mellon Silicon Valley In November 2008 to help create its PhD program and to head the Considerate Systems group. From June to August 2011 he was the Director of Research at start-up Scanadu. Scanadu aims to turn smart phones into medical monitoring devices.
He has taught at Stanford University, Hampshire College, University of Massachusetts Amherst, and Brown University and consulted at Xerox PARC. His work often takes the form of bleeding edge prototype concept products, for example hybrid search engines, and is supported by cognitive science research into human computer interaction.
He is regarded as a pioneer in the field of context awareness and has been cited in the media.
Selker's technologies have been featured on Good Morning America, ABC, the Wall Street Journal, the BBC, NPR, and the Discovery channel among others.
In recognition of his work in voting technology; he was co-recipient of computer science policy leader award for Scientific American 50 in 2004, and in the American Association for People with Disabilities Thomas Paine award in 2006.
He advocates a crowd model of innovation that he calls Excubation.
He is married with two children.
References
External links
Context Aware Computing group homepage
Ted Selker election research papers
Year of birth missing (living people)
Living people
American computer scientists
Human–computer interaction
Human–computer interaction researchers
IBM Fellows
Brown University alumni
University of Massachusetts |
https://en.wikipedia.org/wiki/Datasaab%20D2 | D2 was a concept and prototype computer designed by Datasaab in Linköping, Sweden. It was built with discrete transistors and completed in 1960. Its purpose was to investigate the feasibility of building a computer for use in an aircraft to assist with navigation, ultimately leading to the design of the CK37 computer used in Saab 37 Viggen. This military side of the project was known as SANK, or Saabs Automatiska Navigations-Kalkylator (Saab's Automatic Navigational-Calculator), and D2 was the name for its civilian application.
The D2 weighed approximately 200 kg, and could be placed on a desktop. It used words of 20 bits corresponding to 6 decimal digits. The memory capacity was 6K words, corresponding to 15 kilobytes. Programs and data were stored in separate memories. It could perform 100,000 integer additions per second. Paper tape was used for input.
Experience from the D2 prototype was the foundation for Datasaab's continued development both of the civilian D21 computer and military aircraft models. The commercial D21, launched already in 1962, used magnetic tape, 24 bit words, and unified program and data memory. Otherwise it was close to the D2 prototype, while a working airborne computer required a lot more miniaturization.
The D2 is on exhibit at IT-ceum, the computer museum in Linköping, Sweden.
References
External links
D2 presented at the Datasaab's Friends' Society website
One-of-a-kind computers
Science and technology in Sweden
20-bit computers
Transistorized computers |
https://en.wikipedia.org/wiki/Pitch%20detection%20algorithm | A pitch detection algorithm (PDA) is an algorithm designed to estimate the pitch or fundamental frequency of a quasiperiodic or oscillating signal, usually a digital recording of speech or a musical note or tone. This can be done in the time domain, the frequency domain, or both.
PDAs are used in various contexts (e.g. phonetics, music information retrieval, speech coding, musical performance systems) and so there may be different demands placed upon the algorithm. There is as yet no single ideal PDA, so a variety of algorithms exist, most falling broadly into the classes given below.
A PDA typically estimates the period of a quasiperiodic signal, then inverts that value to give the frequency.
General approaches
One simple approach would be to measure the distance between zero crossing points of the signal (i.e. the zero-crossing rate). However, this does not work well with complicated waveforms which are composed of multiple sine waves with differing periods or noisy data. Nevertheless, there are cases in which zero-crossing can be a useful measure, e.g. in some speech applications where a single source is assumed. The algorithm's simplicity makes it "cheap" to implement.
More sophisticated approaches compare segments of the signal with other segments offset by a trial period to find a match. AMDF (average magnitude difference function), ASMDF (Average Squared Mean Difference Function), and other similar autocorrelation algorithms work this way. These algorithms can give quite accurate results for highly periodic signals. However, they have false detection problems (often "octave errors"), can sometimes cope badly with noisy signals (depending on the implementation), and - in their basic implementations - do not deal well with polyphonic sounds (which involve multiple musical notes of different pitches).
Current time-domain pitch detector algorithms tend to build upon the basic methods mentioned above, with additional refinements to bring the performance more in line with a human assessment of pitch. For example, the YIN algorithm and the MPM algorithm are both based upon autocorrelation.
Frequency-domain approaches
Frequency domain, polyphonic detection is possible, usually utilizing the periodogram to convert the signal to an estimate of the frequency spectrum
. This requires more processing power as the desired accuracy increases, although the well-known efficiency of the FFT, a key part of the periodogram algorithm, makes it suitably efficient for many purposes.
Popular frequency domain algorithms include: the harmonic product spectrum; cepstral analysis and maximum likelihood which attempts to match the frequency domain characteristics to pre-defined frequency maps (useful for detecting pitch of fixed tuning instruments); and the detection of peaks due to harmonic series.
To improve on the pitch estimate derived from the discrete Fourier spectrum, techniques such as spectral reassignment (phase based) or Grandke interpolation (mag |
https://en.wikipedia.org/wiki/Solitaire%20%28cipher%29 | The Solitaire cryptographic algorithm was designed by Bruce Schneier at the request of Neal Stephenson for use in his novel Cryptonomicon, in which field agents use it to communicate securely without having to rely on electronics or having to carry incriminating tools. It was designed to be a manual cryptosystem calculated with an ordinary deck of playing cards. In Cryptonomicon, this algorithm was originally called Pontifex to hide the fact that it involved playing cards.
One of the motivations behind Solitaire's creation is that in totalitarian environments, a deck of cards is far more affordable (and less incriminating) than a personal computer with an array of cryptological utilities. However, as Schneier warns in the appendix of Cryptonomicon, just about everyone with an interest in cryptanalysis will now know about this algorithm, so carrying a deck of cards may also be considered incriminating. Furthermore, analysis has revealed flaws in the cipher such that it is now considered insecure.
Encryption and decryption
This algorithm uses a standard deck of cards with 52 suited cards and two jokers which are distinguishable from each other, called the A joker and the B joker. For simplicity's sake, only two suits will be used in this example, clubs and diamonds. Each card is assigned a numerical value: the clubs will be numbered from 1 to 13 (Ace through King) and the diamonds will be numbered 14 through 26 in the same manner. The jokers will be assigned the values of 27 and 28. Thus, the jack of clubs would have the value 11, and the two of diamonds would have the value 15. (In a full deck of cards, the suits are valued in bridge order: clubs, diamonds, hearts, spades, with the suited cards numbered 1 through 52, and the jokers numbered 53 and 54.)
To begin encryption or decryption, arrange the deck of cards face-up in an order previously agreed upon. The person decrypting a message must have a deck arranged in the same order as the deck used by the person who encrypted the message. How the order is initially decided upon is up to the recipients; shuffling the deck perfectly randomly is preferable, although there are many other methods.
The algorithm generates a keystream, a sequence of values which are combined with the message to encrypt and decrypt it. Each value of the keystream is used to encrypt one character of the message, so the keystream must be at least as long as the message. If the keystream is longer than the message, the message may be padded with an additional repeated character, thus denying the attacker knowledge of the exact length of the message.
To encrypt a message:
Remove all punctuation and spaces, leaving only the 26 letters A–Z.
Convert each letter to its natural numerical value, A = 1, B = 2, ..., Z = 26.
Generate one keystream value for each letter in the message using the keystream algorithm below.
Add each keystream value to the corresponding plaintext number, subtracting 26 if the resulting value is gr |
https://en.wikipedia.org/wiki/Pizza%20Tycoon | Pizza Tycoon (also known as Pizza Connection in Europe) is a business simulation video game. The game was designed by the German company Cybernetic Corporation and Software 2000 in 1994, and was published by Assemble Entertainment after its re-release in 2017. It was published and adapted for the American market by MicroProse with changed artwork and locations.
Gameplay
The game is centered on being the manager of a pizza restaurant in a town in Europe or the U.S. It gives the player the option to choose among more than thirty different characters, to create one's own pizza, have cooking contests and modify the display of the restaurant and kitchen. The player can call upon local mafia to sabotage competitor restaurants or get money from criminal activities such as weapon and drug dealing.
The game displays a playful sense of humor from the graphics and cartoonish drawings, game messages, and animated faces that are put on interacting characters. The original European version ("Pizza Connection") featured a graphical style very similar to MAD artist Don Martin. Microprose's adapted version ("Pizza Tycoon") for the American market distanced itself from this style due to copyright concerns with newly created characters in a different style modeled after famous people as Richard Nixon, Ronald Reagan or Lenin.
Reception
Amiga Joker 2/94 magazine gave Pizza Connection 88 of 100%, Powerplay magazin rated the Amiga version 82 of 100%.
Next Generation reviewed the PC version of the game, rating it four stars out of five, and stated that "Not a game for die hard action fans, but a winner for just about everyone else."
In 1996, Computer Gaming World declared Pizza Tycoon the 34th-worst computer game ever released.
Legacy
Pizza Tycoon (Pizza Connection) was followed by Fast Food Tycoon (Pizza Syndicate), and Fast Food Tycoon 2 (Pizza Connection 2), developed by Software 2000. A fourth game, Pizza Connection 3 was developed by Gentlymad Studios in 2018.
Pizza Connection 1 & 2 were released on GOG.com in January 2017.
See also
Transport Tycoon
References
External links
Pizza Tycoon at MobyGames
Pizza Tycoon Page Unofficial fan page
Terry Greer's Microprose Misc graphics page Page the Microprose artist who worked on the conversion from the original German game.
1994 video games
Amiga games
Business simulation games
DOS games
Linux games
MacOS games
MicroProse games
Multiplayer and single-player video games
Organized crime video games
Software 2000 games
Video games about food and drink
Video games developed in Germany
Windows games
Assemble Entertainment games |
https://en.wikipedia.org/wiki/Spatial%20network | A spatial network (sometimes also geometric graph) is a graph in which the vertices or edges are spatial elements associated with geometric objects, i.e., the nodes are located in a space equipped with a certain metric. The simplest mathematical realization of spatial network is a lattice or a random geometric graph (see figure in the right), where nodes are distributed uniformly at random over a two-dimensional plane; a pair of nodes are connected if the Euclidean distance is smaller than a given neighborhood radius. Transportation and mobility networks, Internet, mobile phone networks, power grids, social and contact networks and biological neural networks are all examples where the underlying space is relevant and where the graph's topology alone does not contain all the information. Characterizing and understanding the structure, resilience and the evolution of spatial networks is crucial for many different fields ranging from urbanism to epidemiology.
Examples
An urban spatial network can be constructed by abstracting intersections as nodes and streets as links, which is referred to as a transportation network.
One might think of the 'space map' as being the negative image of the standard map, with the open space cut out of the background buildings or walls.
Characterizing spatial networks
The following aspects are some of the characteristics to examine a spatial network:
Planar networks
In many applications, such as railways, roads, and other transportation networks, the network is assumed to be planar. Planar networks build up an important group out of the spatial networks, but not all spatial networks are planar. Indeed, the airline passenger
networks is a non-planar example: Many large airports in the world are connected through direct flights.
The way it is embedded in space
There are examples of networks, which seem to be not "directly" embedded in space. Social networks for instance
connect individuals through friendship relations. But in this case, space intervenes in the fact that the connection
probability between two individuals usually decreases with the distance between them.
Voronoi tessellation
A spatial network can be represented by a Voronoi diagram, which is a way of dividing space into a number of regions. The dual graph for a Voronoi diagram corresponds to the Delaunay triangulation for the same set of points.
Voronoi tessellations are interesting for spatial networks in the sense that they provide a natural representation model
to which one can compare a real world network.
Mixing space and topology
Examining the topology of the nodes and edges itself is another way to characterize networks. The distribution of degree of the nodes is often considered, regarding the structure of edges it is useful to find the Minimum spanning tree, or the generalization, the Steiner tree and the relative neighborhood graph.
Probability and spatial networks
In "real" world many aspects of networks are not deterministic - rando |
https://en.wikipedia.org/wiki/NDIS | NDIS may refer to:
National Disability Insurance Scheme, Australia's disability support service scheme
Network Driver Interface Specification, in computing, an application programming interface for network interface cards
National DNA Index System, an American interstate DNA database |
https://en.wikipedia.org/wiki/List%20of%20roads%20in%20Metro%20Manila | This list of roads in Metro Manila summarizes the major thoroughfares and the numbering system currently being implemented in Metro Manila, Philippines.
Metro Manila's major road network comprises six circumferential roads and ten radial roads connecting the cities of Caloocan, Las Piñas, Makati, Malabon, Mandaluyong, Manila, Marikina, Muntinlupa, Navotas, Parañaque, Pasay, Pasig, Quezon City, San Juan, Taguig, and Valenzuela, and the municipality of Pateros.
Route classification
This list only covers roads that are listed as National Primary, National Secondary, or National Tertiary Roads on the Department of Public Works and Highways's Infrastructure Atlas, as well as the previous Circumferential and Radial Road system prior to 2014. These road classifications are defined as follows:
National Primary Roads – Contiguous road sections extending that connect major cities. Primary roads make up the main trunk line or backbone of the National Road System.
National Secondary Roads – Roads that directly connect major ports, major ferry terminals, major airports, tourist service centers, and major government infrastructure to National Primary Roads.
Both Primary and Secondary roads may be named as Bypass Roads or Diversion Roads, which divert pass-through traffic away from city or municipality business centers with affirmative feasibility studies, or roads that would connect or fill the gap between adjoining National roads.
National Tertiary Roads – Other existing roads under the Department of Public Works and Highways that perform a local function.
Any roads not classified as National Primary, National Secondary, or National Tertiary may be classified as follows:
Expressways – Limited-access roads, normally with interchanges that may include facilities for levying tolls for passage in an open or closed system.
Provincial Roads – Roads that connect barangays through rural areas, major provincial government infrastructure, and/or cities and municipalities without traversing any National Roads.
Municipal and City Roads – Roads within a poblacion or roads that connect Provincial and National Roads or provide inter-barangay connections to major Municipal and City Infrastructure without traversing Provincial Roads
Barangay Roads – Any other public roads within a barangay not covered by other classifications.
Numbered routes
Circumferential and radial roads
The first road numbering system in the Philippines was adapted in 1940 by the administration of President Manuel Quezon, and was very much similar to U.S. Highway numbering system. Portions of it are 70 roads labeled Highway 1 to Highway 60. Some parts of the numbering system are Admiral Dewey Boulevard (Highway 1), Calle Manila (Highway 50) and 19 de Junio (Highway 54).
In 1945, the Metropolitan Thoroughfare Plan was submitted by Quezon City planners Louis Croft and Antonio Kayanan which proposed the laying of 10 radial roads, which purposes in conveying traffic in and out of the city |
https://en.wikipedia.org/wiki/Matt%20Nagle | Matthew Nagle (October 16, 1979 – July 24, 2007) was the first person to use a brain–computer interface to restore functionality lost due to paralysis. He was a C3 tetraplegic, paralyzed from the neck down after being stabbed.
Biography
Nagle attended Weymouth High School (Class of 1998). He was an exceptional athlete and a star football player. In 2001, he sustained a stabbing injury while leaving the town’s annual fireworks show near Wessagussett Beach on July 3. He was stabbed and his spinal cord severed when he stepped in to help a friend.
Nagle died on July 24, 2007, in Stoughton, Massachusetts, from sepsis.
BrainGate Clinical Trial
Nagle agreed to participate in a clinical trial involving the BrainGate Neural Interface System (developed by Cyberkinetics) out of a desire to again be healthy and lead a normal life, and in hopes that modern medical discoveries could help him. He also hoped that his participation in this Clinical Trial would help improve the lives of people who, like him, suffered injuries or diseases that cause severe motor disabilities.
The device was implanted on June 22, 2004, by neurosurgeon Gerhard Friehs. A 96-electrode "Utah Array" was placed on the surface of his brain over the region of motor cortex that controlled his dominant left hand and arm. A link connected it to the outside of his skull, where it could be connected to a computer. The computer was then trained to recognize Nagle's thought patterns and associate them with movements he was trying to achieve.
While he was implanted, Matt could control a computer "mouse" cursor, using it then to press buttons that can control TV, check e-mail, and do basically everything that can be done by pressing buttons. He could draw (although the cursor control is not precise) on the screen. He could also send commands to an external prosthetic hand (close and open). The results of the study are published in the journal Nature. Per Food and Drug Administration (FDA) regulations and the study protocol, the BrainGate device was removed from him after approximately one year.
Charges against assailant
On June 5, 2008, a grand jury in Norfolk County, Massachusetts, indicted on a second-degree murder charge Nagle's attacker Nicholas Cirignano. Cirignano had in 2005 been convicted of Nagle's stabbing and sentenced to nine years' imprisonment. District Attorney William Keating used the state medical examiner's ruling that the stabbing had caused Nagle's eventual death as grounds to seek the murder charge.
On April 10, 2009, a Superior Court Judge ruled that Cirignano could not be tried for murder, as the jury's verdict from the original assault case had already determined that one of the key components to a murder charge, malice, was negated by excessive force in self-defence. However, the lesser charge of manslaughter could still, in theory, be applied.
References
Nagle, Matthew
1979 births
2007 deaths
American murder victims
People murdered in Massachusetts
People from Sto |
https://en.wikipedia.org/wiki/Radio%20Live | Radio Live (stylised as Radio LIVE) was a nationwide Auckland-based New Zealand talkback, news and sport radio network owned and operated by MediaWorks New Zealand.
It was formed by the 2005 split of talk and racing network Radio Pacific into a dedicated talk network which prioritised breaking news coverage (Radio Live) and a talk network which broadcast live horse racing and greyhound racing commentaries which initially retained the Radio Pacific name before a rebrand to Bsport and finally LiveSport. The network competes directly against NZME. station Newstalk ZB.
In November 2018, it was announced that RadioLIVE would be merging with Mediaworks sister network, Magic, to form a talk-music radio hybrid known as Magic Talk, which started on 19 January 2019. Former TVNZ news presenter Peter Williams was the first host revealed for the new network.
History
Radio Pacific
The network began as one, Auckland's Radio Pacific station, in 1978. Set up originally by talkback host Gordon Dryden, Radio Pacific became a New Zealand Stock Exchange listed company, with the Totalisator Agency Board as major shareholder. The company also bought a share of a group of North Island music stations known as Energy Enterprises and merged with the South Island radio company Radio Otago in 1999. The merged company, now known as Radioworks was purchased by a subsidiary of CanWest Global Communications which at that time owned the More FM radio network and TV3. CanWest later sold off the company as part of MediaWorks New Zealand.
During the 1990s Pacific became one of the first commercial stations to be networked across the country. Although ownership of the network changed, live races and live betting odds continued to be broadcast on the network in pre-determined, limited periods during the race day under a contract with the New Zealand Racing Board. Between 2001 and 2005, this was complemented by a trial Radio Trackside station in the Southland market which simulcast Trackside TV and Radio Pacific as a dedicated racing station.
Relaunch
In April 2005, MediaWorks launched the Radio Live talkback network with newsreader Sarah Bradley and talk host Martin Devlin, making it the first New Zealand radio network to begin broadcasting nationwide on the same day. It launched the station, "the new voice of talk radio", as a sister network to Pacific, "more stimulating talk radio". The new network gained many of Radio Pacific's frequencies and presenters, including Michael Laws, Kerry Smith until 2006 and Paul Henry until 2007.
Live was a dedicated talkback network that could prioritise breaking news coverage, while Radio Pacific continued as a talkback and racing network on new frequencies. John Banks, Alice Worsley and Martin Crump remained behind on Radio Pacific to present morning talkback, while a Trackside TV simulcast, branded as Radio Trackside, was broadcast in the afternoon. On 29 October 2007, the station changed its morning format to sports radio and introduced n |
https://en.wikipedia.org/wiki/CAST%20tool | CAST tools are software applications used in the process of software testing. The acronym stands for "Computer Aided Software Testing". Such tools are available from various vendors and there are different tools for different types of testing, as well as for test management. They are known to be cost-effective and time-saving because they reduce the incidence of human error and are thorough.
'Cast is also a multimedia professional development tool or multimedia database'
External links
Cast Tools: some examples.
Software testing tools |
https://en.wikipedia.org/wiki/Architecture%20tradeoff%20analysis%20method | In software engineering, architecture tradeoff analysis method (ATAM) is a risk-mitigation process used early in the software development life cycle.
ATAM was developed by the Software Engineering Institute at the Carnegie Mellon University. Its purpose is to help choose a suitable architecture for a software system by discovering trade-offs and sensitivity points.
ATAM is most beneficial when done early in the software development life-cycle, when the cost of changing architectures is minimal.
ATAM benefits
The following are some of the benefits of the ATAM process:
identified risks early in the life cycle
increased communication among stakeholders
clarified quality attribute requirements
improved architecture documentation
documented basis for architectural decisions
ATAM process
The ATAM process consists of gathering stakeholders together to analyze business drivers (system functionality, goals, constraints, desired non-functional properties) and from these drivers extract quality attributes that are used to create scenarios. These scenarios are then used in conjunction with architectural approaches and architectural decisions to create an analysis of trade-offs, sensitivity points, and risks (or non-risks). This analysis can be converted to risk themes and their impacts whereupon the process can be repeated. With every analysis cycle, the analysis process proceeds from the more general to the more specific, examining the questions that have been discovered in the previous cycle, until such time as the architecture has been fine-tuned and the risk themes have been addressed.
Steps of the ATAM process
ATAM formally consists of nine steps, outlined below:
Present ATAM – Present the concept of ATAM to the stakeholders, and answer any questions about the process.
Present business drivers – everyone in the process presents and evaluates the business drivers for the system in question.
Present the architecture – the architect presents the high-level architecture to the team, with an 'appropriate level of detail'
Identify architectural approaches – different architectural approaches to the system are presented by the team, and discussed.
Generate quality attribute utility tree – define the core business and technical requirements of the system, and map them to an appropriate architectural property. Present a scenario for this given requirement.
Analyze architectural approaches – Analyze each scenario, rating them by priority. The architecture is then evaluated against each scenario.
Brainstorm and prioritize scenarios – among the larger stakeholder group, present the current scenarios, and expand.
Analyze architectural approaches – Perform step 6 again with the added knowledge of the larger stakeholder community.
Present results – provide all documentation to the stakeholders.
These steps are separated in two phases: Phase 1 consists of steps 1-6 and after this phase, the state and context of the project, the driving architectural req |
https://en.wikipedia.org/wiki/EAccelerator | eAccelerator is a PHP accelerator derived from the MMCache extension for the PHP programming language. eAccelerator provides a bytecode cache. eAccelerator is open source and thereby free to use and distribute. Old and unmaintained versions also provided an encoder.
Every time a PHP script is accessed, PHP usually parses and compiles scripts to bytecode. Once installed, eAccelerator optimizes the compiled bytecode and caches this to shared memory or disk or both. Upon subsequent accesses to a script, eAccelerator will access cached bytecode if it is available instead of the script being compiled. This avoids the performance overhead of repeated parsing and compilation.
Previous eAccelerator versions also provided functions for use in PHP scripts that allow access to shared memory, automatic web (content) caching, and other related tasks. These were removed as of version 0.9.6rc1.
Old eAccelerator versions had an encoder component that creates a file that cannot be as easily read as a normal PHP script, offering some code protection. A dedicated extension named eLoader is available to process such encoded scripts if the eAccelerator extension is not desired. This functionality has been removed from the current developer version and will not be part of the next release.
No new version was released since Jan. 2010. The latest supported PHP version was 5.3, which had its end-of-life in 2014.
eAccelerator is free software released under the GNU GPL 2.0.
See also
Zend Performance Suite
Alternative PHP Cache
References
External links
eAccelerator Web Site
eAccelerator Windows Downloads
doc eAccelerator
PHPCoder: web based front-end
various versions of eAccelerator Windows binaries (VC6/VC9, TS/NTS)
eAccelerator Configuration With PHP5
Free proxy servers
PHP software |
https://en.wikipedia.org/wiki/Robert%20van%20de%20Geijn | Robert A. van de Geijn is a Professor of Computer Sciences at the University of Texas at Austin. He received his B.S. in Mathematics and Computer Science (1981) from the University of Wisconsin–Madison and his Ph.D. in Applied Mathematics (1987) from the University of Maryland, College Park. His areas of interest include numerical analysis and parallel processing.
Major work
Van de Geijn's has turned toward the theoretical, in particular with his development of the Formal Linear Algebra Method (FLAME). FLAME is an original effort at formalizing the efficient derivation of linear algebra algorithms that are provably correct. This approach benefits from his less theoretical experience; it is designed to ultimately lead to the efficient design and implementation of these algorithms.
He is the principal author of the widely cited book. Using PLAPACK—parallel linear algebra package. Scientific and engineering computation. Cambridge, Mass: MIT Press, 1997.
Personal
Robert van de Geijn was born on August 14, 1962, in the Netherlands. He later moved to the United States, where he enrolled at the University of Wisconsin-Madison in 1978. He is married to a fellow academic, Margaret Myers. They have three children, and now live in a historic house in downtown Pflugerville, Texas.
References
External links
Robert A. van de Geijn
Year of birth missing (living people)
Living people
American computer scientists
Geijn, Robert
Geijn, Robert
University of Texas at Austin faculty
University of Wisconsin–Madison College of Letters and Science alumni
University of Maryland, College Park alumni
People from Pflugerville, Texas |
https://en.wikipedia.org/wiki/URI%20fragment | In computer hypertext, a URI fragment is a string of characters that refers to a resource that is subordinate to another, primary resource. The primary resource is identified by a Uniform Resource Identifier (URI), and the fragment identifier points to the subordinate resource.
The fragment identifier introduced by a hash mark # is the optional last part of a URL for a document. It is typically used to identify a portion of that document. The generic syntax is specified in RFC 3986. The hash mark separator in URIs is not part of the fragment identifier.
Basics
In URIs, a hash mark # introduces the optional fragment near the end of the URL. The generic RFC 3986 syntax for URIs also allows an optional query part introduced by a question mark ?. In URIs with a query and a fragment, the fragment follows the query. Query parts depend on the URI scheme and are evaluated by the server—e.g., http: supports queries unlike ftp:. Fragments depend on the document MIME type and are evaluated by the client (web browser). Clients are not supposed to send URI fragments to servers when they retrieve a document, and without help from a local application (see below) fragments do not participate in HTTP redirections.
A URI ending with # is permitted by the generic syntax and is a kind of empty fragment. In MIME document types such as text/html or any XML type, empty identifiers to match this syntactically legal construct are not permitted. Web browsers typically display the top of the document for an empty fragment.
The fragment identifier functions differently to the rest of the URI: its processing is exclusively client-sided with no participation from the web server, though the server typically helps to determine the MIME type, and the MIME type determines the processing of fragments. When an agent (such as a web browser) requests a web resource from a web server, the agent sends the URI to the server, but does not send the fragment. Instead, the agent waits for the server to send the resource, and then the agent processes the resource according to the document type and fragment value.
In an HTML web page, the agent will look for an anchor identified with an HTML tag that includes an id= or name= attribute equal to the fragment identifier.
Examples
In URIs for MIME text/html pages such as http://www.example.org/foo.html#bar the fragment refers to the element with id="bar".
Graphical Web browsers typically scroll to position pages so that the top of the element identified by the fragment id is aligned with the top of the viewport; thus fragment identifiers are often used in tables of content and in permalinks.
The appearance of the identified element can be changed through the :target CSS pseudoclass; Wikipedia uses this to highlight the selected reference. Notably CSS display: block can be used to show content only if it is the target, and otherwise hidden by display: none.
The deprecated name attribute (allowed only for some elements) had a similar pur |
https://en.wikipedia.org/wiki/Roy%20Fielding | Roy Thomas Fielding (born 1965) is an American computer scientist, one of the principal authors of the HTTP specification and the originator of the Representational State Transfer (REST) architectural style. He is an authority on computer network architecture and co-founded the Apache HTTP Server project.
Fielding works as a Senior Principal Scientist at Adobe Systems in San Jose, California.
Biography
Fielding was born in 1965 in Laguna Beach, California. He describes himself as "part Maori, Kiwi, Yank, Irish, Scottish, British, and California beach bum". In 1999, the Massachusetts Institute of Technology (MIT) Technology Review TR100 named him one of the top 100 innovators in the world under the age of 35. In 2000, he received his doctorate from the University of California, Irvine.
Contributions
Architectural Styles and the Design of Network-based Software Architectures, Fielding's doctoral dissertation, describes Representational State Transfer (REST) as a key architectural principle of the World Wide Web and received a large amount of attention. Computer engineers frequently hold up REST as an approach to developing web services, as an alternative to other distributed-computing specifications such as SOAP. Fielding has also been heavily involved in the development of HTML and Uniform Resource Identifiers. Fielding co-founded the Apache HTTP Server project and was a member of the interim OpenSolaris Boards until he resigned from the community in 2008. He chaired the Apache Software Foundation for its first three years and sat on its board of directors until May 2014.
Between 2001 and 2006, Fielding worked on Waka, an application protocol intended as "a binary, token-based replacement for HTTP". It was "designed to match the efficiency of the REST architectural style".
References
Bibliography
External links
Fielding's blog
1965 births
Living people
Computer programmers
Web developers
University of California, Irvine alumni
Free software programmers
Hypertext Transfer Protocol |
https://en.wikipedia.org/wiki/Michael%20Garey | Michael Randolph Garey (born November 19, 1945) is a computer science researcher, and co-author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory of NP-completeness. He and Johnson received the 1979 Frederick W. Lanchester Prize from the Operations Research Society of America for the book. Garey earned his PhD in computer science in 1970 from the University of Wisconsin–Madison. He was employed by AT&T Bell Laboratories in the Mathematical Sciences Research Center from 1970 until his retirement in 1999. For his last 11 years with the organization, he served as its director. His technical specialties included discrete algorithms and computational complexity, approximation algorithms, scheduling theory, and graph theory. From 1978 until 1981 he served as Editor-in-Chief of the Journal of the Association for Computing Machinery. In 1995, Garey was inducted as a Fellow of the Association for Computing Machinery.
References
External links
Garey's personal web page
University of Wisconsin–Madison College of Letters and Science alumni
American computer scientists
Fellows of the Association for Computing Machinery
Theoretical computer scientists
Living people
1945 births
American textbook writers |
https://en.wikipedia.org/wiki/AC-3%20algorithm | In constraint satisfaction, the AC-3 algorithm (short for Arc Consistency Algorithm #3) is one of a series of algorithms used for the solution of constraint satisfaction problems (or CSP's). It was developed by Alan Mackworth in 1977. The earlier AC algorithms are often considered too inefficient, and many of the later ones are difficult to implement, and so AC-3 is the one most often taught and used in very simple constraint solvers.
The algorithm
AC-3 operates on constraints, variables, and the variables' domains (scopes). A variable can take any of several discrete values; the set of values for a particular variable is known as its domain. A constraint is a relation that limits or constrains the values a variable may have. The constraint may involve the values of other variables.
The current status of the CSP during the algorithm can be viewed as a directed graph, where the nodes are the variables of the problem, with edges or arcs between variables that are related by symmetric constraints, where each arc in the worklist represents a constraint that needs to be checked for consistency. AC-3 proceeds by examining the arcs between pairs of variables (x, y). It removes those values from the domain of x that aren't consistent with the constraints between x and y. The algorithm keeps a collection of arcs that are yet to be checked; when the domain of a variable has any values removed, all the arcs of constraints pointing to that pruned variable (except the arc of the current constraint) are added to the collection. Since the domains of the variables are finite and either one arc or at least one value are removed at each step, this algorithm is guaranteed to terminate.
For illustration, here is an example of a very simple constraint problem:
X (a variable) has the possible values {0, 1, 2, 3, 4, 5}—the set of these values are the domain of X, or D(X). The variable Y has the domain D(Y) = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}. Together with the constraints C1 = "X must be even" and C2 = "X + Y must equal 4" we have a CSP that AC-3 can solve. Notice that the actual constraint graph representing this problem must contain two edges between X and Y since C2 is undirected but the graph representation being used by AC-3 is directed.
AC-3 solves the problem by first removing the non-even values from of the domain of X as required by C1, leaving D(X) = { 0, 2, 4 }. It then examines the arcs between X and Y implied by C2. Only the pairs (X=0, Y=4), (X=2, Y=2), and (X=4, Y=0) match the constraint C2. AC-3 then terminates, with D(X) = {0, 2, 4} and D(Y) = {0, 2, 4}.
AC-3 is expressed in pseudocode as follows:
Input:
A set of variables X
A set of domains D(x) for each variable x in X. D(x) contains vx0, vx1... vxn, the possible values of x
A set of unary constraints R1(x) on variable x that must be satisfied
A set of binary constraints R2(x, y) on variables x and y that must be satisfied
Output:
Arc consistent domains for each |
https://en.wikipedia.org/wiki/TV3%20%28Malaysian%20TV%20network%29 | Sistem Televisyen Malaysia Berhad, operating as TV3 (pronounced as Tivi Tiga), is a Malaysian free-to-air television channel owned by Malaysian media conglomerate, Media Prima. TV3 is the third and third oldest TV station in Malaysia. It was launched on 1 June 1984 as the country's first and oldest private television channel. As of October 2021, TV3 remains to be the most-watched television station in Malaysia with about 17% of its viewing share among other Malaysian television stations, followed by TV9 with 15% of its viewing share, making two of them become the second most-watched television station in the country, despite the declining viewership of 3 free-to-air television channels.
History
As early as 1976, some members of parliament demanded the creation of a commercial television channel, but concerns were raised by the government over a potential loss of revenue from newspapers and magazines.
A license was granted to Fleet Group in August 1983. Officials from CBS were in talks with Fleet Group executives regarding the development of broadcasting in the country. The plan was to produce 30% national content and air 70% international content, with the option to buy programmes produced by the government. Fleet Group, the publisher of the New Straits Times, was chosen due to its "capacity, capability and expertise". The channel, with a projected launch date of 1 January 1985, was budgeted at RM 45 million. One of the plans was to recapture urban audiences, who had escaped television in pursuit of other forms of entertainment, especially home video, a practice that, among the ethnic groups, was more prevalent in Chinese Malaysians.
In November 1983, TV3 announced that its broadcasts would start ahead of schedule, at some point in 1984. Work for the transmitter at Bukit Besi started in February 1984, revealing the TV3 name to the public. In a surprise move, the channel later secured the rights to the 1984 Summer Olympics days later, to be held later in the year in Los Angeles. The decision still depended on whether or not the owners would start the channel on time. A prospective launch date of between June and July was then announced.
TV3 (Sistem Televisyen Malaysia Berhad) officially began broadcasting in the Greater Kuala Lumpur (the area surrounding Kuala Lumpur, capital of Malaysia) in conjunction the Hijri date of the first day of the holy month of Ramadan year 1404 AH (1 June 1984) at 5:00pm local time. The deliberate choice of starting the channel during Ramadan was to test the openness of the Malaysian society. The television channel used to broadcast from a building in Jalan Liku, Bangsar, Lembah Pantai, Kuala Lumpur before it moved to Sri Pentas, Bandar Utama, Petaling Jaya, Selangor in 1995.
Initially, the channel ran for seven hours a day - 5:00pm to 12:00am relying largely on television series produced mainly in the UK and the USA. The programming was mostly new to Malaysia, although some shows were already acquired by SBC i |
https://en.wikipedia.org/wiki/NTV7 | NTV7 is a Malaysian free-to-air channel owned by Media Prima Berhad. The network focused on the Urban area with various types of programmes, dramas and news. As of October 2021, NTV7 is now become the second most-watched television station in Malaysia with about 15% of its viewing share, together with TV9, despite the declining viewership of 2 free-to-air television channels.
History
Establishment, as part of Media Prima and early history (1998–2018)
The Sarawak company Nasional Televisyen (NTV), from Kuching, was given the green light from the Malaysian government on 5 June 1996. Under the conditions, the station would broadcast nationwide, 18 hours a day in various languages, with a minimum quota of 60% for national content. The station was owned by Mohd Effendi Norwawi's company Kenyalang Jasa Sdn Bhd.
The channel was launched on 7 April 1998 under the entity of Natseven TV Sdn Bhd by businessman Mohd Effendi Norwawi, broadcasting daily from 6 am to 1 am the next day. At the time of its establishment, its headquarters was located at Hicom-Glenmarie Industrial Park in Shah Alam, Selangor. It also had a studio in Kuching, Sarawak. Its first day started with the then-prime minister attending a prayer service for Eid ul-Adha prayers at a mosque in the state of Kedah. NTV7 at launch employed a staff of 250 people, with broadcast centres at Shah Alam in Selangor and had a transmitting network of ten stations, reaching peninsular Malaysia and the cities of Kuching in Sarawak and Kota Kinabalu in Sabah. There were already plans outlined for the station to go national "within a year". The slogan "Feel Good with NTV7" had the aim of creating "a happy and more enlightened" Malaysia. For years, the channel started and ended with the James Brown song I Feel Good, which became a part of NTV7's branding.
In 2001, NTV7 began using a variation of the Circle 7 logo used by the American broadcast network ABC for its several owned-and-operated and affiliated stations; the logo would stay in use until 2018.
On 19 January 2003, NTV7 aired a special tribute to the nation's longest serving Prime Minister, Mahathir Mohamad at 8pm.
In 2005, Media Prima Berhad announced its acquisition of NTV7 under a price of RM90 million, effectively making the latter one of its subsidiaries. As a result, it operates from Sri Pentas, Petaling Jaya from that year onward along with three other private television channels in Malaysia: TV3, 8TV and TV9.
In its early history, the channel offered a wide variety of programming which targets the Malaysian urban demographic including drama, comedy, entertainment, game shows, children's programmes, anime, documentaries and movies. There were also news bulletins in English, Mandarin and Malay through the 7 Edition, Mandarin 7, and Edisi 7 brands, respectively.
Introduction of home shopping block (2016–2021)
On 1 April 2016, a teleshopping block bought by the Korean conglomerate CJ Group through subsidiary CJ E&M Co Ltd called CJ WOW Sh |
https://en.wikipedia.org/wiki/Mir%20Ibrahim%20Rahman | Mir Ibrahim Rahman (born 11 March 1977) is a Pakistani media proprietor who serves as the chief executive of the Geo Television Network.
Early life and education
Mir Ibrahim Rahman was born on 11 March 1977 in Karachi, to media mogul Mir Shakil-ur-Rahman and Shahina Shakil. Kashmiri family. His father, a media mogul, Mir Shakil-ur-Rahman, Rahman studied at the Karachi American School and moved to the United States, where he received his BBA degree from Babson College in 2000. In the U.S., he started his career as an investment banker with Goldman Sachs. In 2002, he returned to Pakistan and joined his family media business and subsequently launched Pakistan's first private news channel in the fall of 2002. In 2009, he returned to the U.S and received his Master of Public Administration degree from the Harvard Kennedy School in 2010.
He is a recipient of the Robert F. Kennedy Award for Excellence in Public Service for his contribution towards the Lawyers' Movement. He was named World Economic Forum's Young Global Leaders in 2011.
Career
In 2000, Rahman graduated summa cum laude from Babson College with honours in economics, finance and entrepreneurship. After his graduation, he worked as an investment banker with Goldman Sachs specialising in media and telecom. After a brief stint with the
investment banking and securities firm, he returned to Pakistan in 2002.
Until 2002, the electronic media in Pakistan was largely dominated by state-owned institutions like Pakistan Television Corporation and the Pakistan Broadcasting Corporation. This monopoly was thwarted when the Musharraf regime regulated electronic media allowing for private television channels to be operated independently. It was during this liberalisation of the media in Pakistan that Rahman saw an opportunity to expand his family business.
In 2002, he co-founded the privately owned television network, Geo TV. What started as a 5-member operation out of a hotel room turned into one of largest television broadcast networks in Pakistan. Geo TV was later recognised as a pertinent driver of change in the media landscape of the country. "Geo has changed Pakistan's media landscape, consistently challenging the monopoly-and monotony of state-run Pakistan Television, or PTV." "For the first time, analysts say, television in Pakistan is reflecting this predominantly Muslim country's diverse society and offering an independent source of news." Rahman has since served as the CEO of the television network that now employs more than 2,500 workers across the globe.
In 2009, he joined the Harvard University John F Kennedy School of Government while pursuing his master's degree in public administration. He later had to take a sabbatical alongside his wife Sheena following her pregnancy. Sheena was also a fellow Harvard alumni pursuing her master's degree in education. Rahman also serves as a member of the Young presidents' Organization in Pakistan, a charter member of the Indus Entrepreneur and th |
https://en.wikipedia.org/wiki/Equivalence%20partitioning | Equivalence partitioning or equivalence class partitioning (ECP) is a software testing technique that divides the input data of a software unit into partitions of equivalent data from which test cases can be derived. In principle, test cases are designed to cover each partition at least once. This technique tries to define test cases that uncover classes of errors, thereby reducing the total number of test cases that must be developed. An advantage of this approach is reduction in the time required for testing software due to lesser number of test cases.
Equivalence partitioning is typically applied to the inputs of a tested component, but may be applied to the outputs in rare cases. The equivalence partitions are usually derived from the requirements specification for input attributes that influence the processing of the test object.
The fundamental concept of ECP comes from equivalence class which in turn comes from equivalence relation.
A software system is in effect a computable function implemented as an algorithm in some implementation programming language.
Given an input test vector some instructions of that algorithm get covered, ( see code coverage for details ) others do not.
This gives the interesting relationship between input test vectors:-
is an equivalence relation between test vectors if and only if the coverage foot print of the
vectors are exactly the same, that is, they cover the same instructions, at same step.
This would evidently mean that the relation cover would partition the domain of the test vector
into multiple equivalence class. This partitioning is called equivalence class partitioning of test input.
If there are equivalent classes, only vectors are sufficient to fully cover the system.
The demonstration can be done using a function written in C:
int safe_add( int a, int b )
{
int c = a + b;
if ( a > 0 && b > 0 && c <= 0 )
{
fprintf ( stderr, "Overflow (positive)!\n" );
}
if ( a < 0 && b < 0 && c >= 0 )
{
fprintf ( stderr, "Overflow (negative)!\n" );
}
return c;
}
On the basis of the code, the input vectors of are partitioned. The blocks we need to cover are the overflow in the positive direction, negative direction, and neither of these 2. That gives rise to 3 equivalent classes, from the code review itself.
To solve the input problem, we take refuge in the inequation
we note that there is a fixed size of Integer (computer science) hence, the z can be replaced with:-
and
with and
The values of the test vector at the strict condition of the equality that is and are called the boundary values, Boundary-value analysis has detailed information about it. Note that the graph only covers the overflow case, first quadrant for X and Y positive values.
In general an input has certain ranges which are valid and other ranges which are invalid. Invalid data here does not mean that the data is incorrect, it means that this data lies outside of |
https://en.wikipedia.org/wiki/Expanded%20Books | The Expanded Books Project was a project by The Voyager Company during 1991, that investigated how a book could be presented on a computer screen in a way that would be both familiar and useful to regular book readers. The project focused on perfecting font choice, font size, line spacing, margin notes, book marks, and other publishing details to work in digital format.
Much of the impetus for Expanded Books derived from a meeting on digital books that Voyager sponsored on Bloomsday in 1990, attended by various pioneering multimedia and hypertext experts. Voyager had earlier released a successful CD companion to Beethoven's Symphony No. 9, and its president Bob Stein had obtained a grant to work on creating a similar product for literature. At this meeting, a consensus emerged that, to overcome the relative inconvenience of being tied to a low-resolution and cumbersome digital display, digital books would have to offer "added value". Florian Brody, head of the Expanded Books project, had the idea to design digital books specifically for the then-new Apple PowerBook 100, which Apple had donated to Voyager.
The programming for the initial products took place between October and December 1991. The first three book titles (The Complete Hitch Hiker's Guide to the Galaxy, The Complete Annotated Alice, and Jurassic Park) were released at MacWorld San Francisco in January 1992. These books and their successors relied on a "book engine" that provided a simple but powerful feature set: convenient and simple search methods, the ability to switch between large print and normal print versions, unobtrusive navigation tools (such as a chapter menu that dropped down from the chapter heading on each "page"), a margin area on each page in which readers could write notes, and interactive annotations. For example, Moby-Dick included a sound clip of the sea as an annotation, and The Annotated Alice provided pop-up annotations derived from both editions of Martin Gardner's work. However, some readers found these annotations unwieldy and difficult to navigate, with poor usability.
Expanded Books was not initially the definitive title of the product range. Another favored contender was "Power Books", but that idea died when Voyager was told Apple's about-to-be-released notebooks were to be called PowerBooks. Hence, the original project name became the product name.
Between February 1992 and August 1992, Voyager created the Expanded Books Toolkit, which allowed authors to create their own Expanded Books. Voyager themselves went on to produce over 60 books as Expanded Books; the underlying software was also used in CD-ROMs such as A Hard Day's Night, Salt of the Earth, and Macbeth.
All programming for the Expanded Books and Toolkit was in HyperCard, with the exception of a few XCMDs and strings stored as resources.
References
Digital library software |
https://en.wikipedia.org/wiki/Royal%20Aruban%20Airlines | Royal Aruban Airlines was an airline based in Aruba. It filed for bankruptcy in September 2002.
Code data
IATA code: V5 (originally R8)
ICAO code: RYL
Callsign: Royal Aruban
References
Defunct airlines of Aruba
Defunct airlines of the Netherlands Antilles |
https://en.wikipedia.org/wiki/CSL%20Mobile | CSL Mobile Limited () is a Hong Kong telecommunications company, which operates mobile network brands of "csl", "1O1O" and "Club SIM". CSL is a subsidiary of Hong Kong Telecom (HKT) and was Hong Kong's first mobile communications operator established in 1983, and also the first network to launch the world’s first dual band 4G LTE network with DC-HSPA+.
The brand CSL was under different legal person in its operating history, namely Communication Services Limited, which known as Hong Kong Telecom CSL Limited from 1990 to 1999, and then Cable & Wireless HKT CSL Limited from 1999 to 2001, and then Hong Kong CSL Limited from 2001 (it became a subsidiary of CSL Limited after the formation of CSL New World Mobility), CSL Limited (formerly known as New World PCS) and CSL Mobile Limited; The current legal person of the brand, CSL Mobile Limited, was formally known as PCCW Mobile HK Limited. It was the result of the merger of the brands CSL and PCCW Mobile.
History
In the 1990s, CSL was a company of PCCW (formerly HKT). In 2002, PCCW sold CSL. In 2005, PCCW re-entered the mobile network operator business by acquiring SUNDAY and setting up a new brand "PCCW Mobile". In 2014, HKT (a member of PCCW Group) acquired CSL New World Mobility and its subsidiaries such as CSL Limited and New World Mobility. In 2014, the legal person of PCCW Mobile was renamed into CSL Mobile Limited. However, it used the brand CSL instead.
CSL was an abbreviation for Communication Services Limited and their original branding of "Create a Simple Life". The CSL brand, logo and corporate colour (green) were all updated in August 2011 and again in recent year.
Timeline
1980: Communication Services Limited was incorporated.
1984: CSL, a wholly owned subsidiary of Hong Kong Telecom, launches Hong Kong's first public mobile radiotelephone service using NEC's Advance Mobile Telephone System.
July 1993: CSL launches its GSM service.
June 1997: CSL launches its GSM 1800 network.
December 1997: CSL acquires Pacific Link Communications. The acquisition included the digital cellular phone services (D-Amps), PCS (GSM1800) and radio paging services.
2000: PCCW Limited buys HKT, including subsidiary CSL (known as Hong Kong Telecom CSL Limited at that time), for an estimated US$38 billion from Cable & Wireless.
February 2001: PCCW sells 60% of CSL to Telstra for $3.05 billion, in a joint venture called "Regional Wireless Company" (RWC).
July 2002: Telstra purchases PCCW's 40% stake in RWC for A$1.1billion, giving Telstra 100% ownership of CSL.
March 2006: CSL & New World PCS merge to become the CSL New World Mobility. The enlarged group owned the brands CSL, 1010, One2Free and New World Mobility, and was majority owned by Telstra; New World Mobile Holdings was a minor shareholder.
January 2007: New World Mobile Holdings agrees to sell its quarter stake of CSL New World Mobility to its parent company New World Development, for US$321 million.
March 2009: CSL launches the international award wi |
https://en.wikipedia.org/wiki/Avia%20Air | Avia Air was an airline based in Aruba.
Code data
IATA Code: 3R
ICAO Code: ARB
Callsign: Aviair
History
Avia Air suspended service in November 2003 and was working to restructure its operations under bankruptcy protection.
Fleet
Short 360-200
Embraer EMB 110 Bandeirante
References
External links
Aircraft pictures
Defunct airlines of Aruba
Airlines disestablished in 2003
Defunct airlines of the Netherlands Antilles
2003 establishments in the Netherlands Antilles |
https://en.wikipedia.org/wiki/Fuzzing | In programming and software development, fuzzing or fuzz testing is an automated software testing technique that involves providing invalid, unexpected, or random data as inputs to a computer program. The program is then monitored for exceptions such as crashes, failing built-in code assertions, or potential memory leaks. Typically, fuzzers are used to test programs that take structured inputs. This structure is specified, e.g., in a file format or protocol and distinguishes valid from invalid input. An effective fuzzer generates semi-valid inputs that are "valid enough" in that they are not directly rejected by the parser, but do create unexpected behaviors deeper in the program and are "invalid enough" to expose corner cases that have not been properly dealt with.
For the purpose of security, input that crosses a trust boundary is often the most useful. For example, it is more important to fuzz code that handles the upload of a file by any user than it is to fuzz the code that parses a configuration file that is accessible only to a privileged user.
History
The term "fuzz" originates from a fall 1988 class project in the graduate Advanced Operating Systems class (CS736), taught by Prof. Barton Miller at the University of Wisconsin, whose results were subsequently published in 1990. To fuzz test a UNIX utility meant to automatically generate random input and command-line parameters for the utility. The project was designed to test the reliability of UNIX command line programs by executing a large number of random inputs in quick succession until they crashed. Miller's team was able to crash 25 to 33 percent of the utilities that they tested. They then debugged each of the crashes to determine the cause and categorized each detected failure. To allow other researchers to conduct similar experiments with other software, the source code of the tools, the test procedures, and the raw result data were made publicly available. This early fuzzing would now be called black box, generational, unstructured (dumb) fuzzing.
In April 2012, Google announced ClusterFuzz, a cloud-based fuzzing infrastructure for security-critical components of the Chromium web browser. Security researchers can upload their own fuzzers and collect bug bounties if ClusterFuzz finds a crash with the uploaded fuzzer.
In September 2014, Shellshock was disclosed as a family of security bugs in the widely used UNIX Bash shell; most vulnerabilities of Shellshock were found using the fuzzer AFL. (Many Internet-facing services, such as some web server deployments, use Bash to process certain requests, allowing an attacker to cause vulnerable versions of Bash to execute arbitrary commands. This can allow an attacker to gain unauthorized access to a computer system.)
In April 2015, Hanno Böck showed how the fuzzer AFL could have found the 2014 Heartbleed vulnerability. (The Heartbleed vulnerability was disclosed in April 2014. It is a serious vulnerability that allows adversaries to |
https://en.wikipedia.org/wiki/Query%20plan | A query plan (or query execution plan) is a sequence of steps used to access data in a SQL relational database management system. This is a specific case of the relational model concept of access plans.
Since SQL is declarative, there are typically many alternative ways to execute a given query, with widely varying performance. When a query is submitted to the database, the query optimizer evaluates some of the different, correct possible plans for executing the query and returns what it considers the best option. Because query optimizers are imperfect, database users and administrators sometimes need to manually examine and tune the plans produced by the optimizer to get better performance.
Generating query plans
A given database management system may offer one or more mechanisms for returning the plan for a given query. Some packages feature tools which will generate a graphical representation of a query plan. Other tools allow a special mode to be set on the connection to cause the DBMS to return a textual description of the query plan. Another mechanism for retrieving the query plan involves querying a virtual database table after executing the query to be examined. In Oracle, for instance, this can be achieved using the EXPLAIN PLAN statement.
Graphical plans
The Microsoft SQL Server Management Studio tool, which ships with Microsoft SQL Server, for example, shows this graphical plan when executing this two-table join example against an included sample database:
SELECT *
FROM HumanResources.Employee AS e
INNER JOIN Person.Contact AS c
ON e.ContactID = c.ContactID
ORDER BY c.LastName
The UI allows exploration of various attributes of the operators involved in the query plan, including the operator type, the number of rows each operator consumes or produces, and the expected cost of each operator's work.
Textual plans
The textual plan given for the same query in the screenshot is shown here:
StmtText
----
|--Sort(ORDER BY:([c].[LastName] ASC))
|--Nested Loops(Inner Join, OUTER REFERENCES:([e].[ContactID], [Expr1004]) WITH UNORDERED PREFETCH)
|--Clustered Index Scan(OBJECT:([AdventureWorks].[HumanResources].[Employee].[PK_Employee_EmployeeID] AS [e]))
|--Clustered Index Seek(OBJECT:([AdventureWorks].[Person].[Contact].[PK_Contact_ContactID] AS [c]),
SEEK:([c].[ContactID]=[AdventureWorks].[HumanResources].[Employee].[ContactID] as [e].[ContactID]) ORDERED FORWARD)
It indicates that the query engine will do a scan over the primary key index on the Employee table and a matching seek through the primary key index (the ContactID column) on the Contact table to find matching rows. The resulting rows from each side will be shown to a nested loops join operator, sorted, then returned as the result set to the connection.
In order to tune the query, the user must understand the different operators that the database may use, and which ones might be more efficient than others while still pr |
https://en.wikipedia.org/wiki/Database%20index | A database index is a data structure that improves the speed of data retrieval operations on a database table at the cost of additional writes and storage space to maintain the index data structure. Indexes are used to quickly locate data without having to search every row in a database table every time said table is accessed. Indexes can be created using one or more columns of a database table, providing the basis for both rapid random lookups and efficient access of ordered records.
An index is a copy of selected columns of data, from a table, that is designed to enable very efficient search. An index normally includes a "key" or direct link to the original row of data from which it was copied, to allow the complete row to be retrieved efficiently. Some databases extend the power of indexing by letting developers create indexes on column values that have been transformed by functions or expressions. For example, an index could be created on upper(last_name), which would only store the upper-case versions of the last_name field in the index. Another option sometimes supported is the use of partial index, where index entries are created only for those records that satisfy some conditional expression. A further aspect of flexibility is to permit indexing on user-defined functions, as well as expressions formed from an assortment of built-in functions.
Usage
Support for fast lookup
Most database software includes indexing technology that enables sub-linear time lookup to improve performance, as linear search is inefficient for large databases.
Suppose a database contains N data items and one must be retrieved based on the value of one of the fields. A simple implementation retrieves and examines each item according to the test. If there is only one matching item, this can stop when it finds that single item, but if there are multiple matches, it must test everything. This means that the number of operations in the average case is O(N) or linear time. Since databases may contain many objects, and since lookup is a common operation, it is often desirable to improve performance.
An index is any data structure that improves the performance of lookup. There are many different data structures used for this purpose. There are complex design trade-offs involving lookup performance, index size, and index-update performance. Many index designs exhibit logarithmic (O(log(N))) lookup performance and in some applications it is possible to achieve flat (O(1)) performance.
Policing the database constraints
Indexes are used to police database constraints, such as UNIQUE, EXCLUSION, PRIMARY KEY and FOREIGN KEY. An index may be declared as UNIQUE, which creates an implicit constraint on the underlying table. Database systems usually implicitly create an index on a set of columns declared PRIMARY KEY, and some are capable of using an already-existing index to police this constraint. Many database systems require that both referencing and referenced sets of |
https://en.wikipedia.org/wiki/Simbad | Simbad may refer to:
Simbad missile, a version of the Mistral
Simbad robot simulator, a software simulator
SIMBAD, a database of astronomical information
4692 SIMBAD, an asteroid named in honour of the astronomical database.
See also
Sinbad (disambiguation) |
https://en.wikipedia.org/wiki/Interlink%20Computer%20Sciences | Interlink Computer Sciences, of Fremont, California, was a developer of hardware and software that allowed IBM mainframe computers running the MVS operating system to be connected to non-IBM networks.
Interlink was founded in 1983 by Lambert Onuma, Fred Wright, Karl Johnson and Greg Thompson, formerly of Digital Equipment Corporation. The company's first product, called simply Interlink, allowed IBM MVS mainframes to be connected to VAX computers on a DECnet network. Later a VM/DECnet product was developed in cooperation with Dupont to link IBM VM/CMS systems with a DECnet network interconnecting e-mail, file, tape, and storage access, terminal emulation, a program-to-program API, and enabling DECnet to be tunneled over an SNA LU6.2 network.
In 1990, Interlink acquired a product called ACCES/MVS from Advanced Computer Communications, which implemented a native TCP/IP protocol stack on the MVS and VM operating systems and within CICS regions. First released in 1986, ACCES/MVS had been the first commercial TCP/IP implementation for MVS mainframes. Interlink developed and marketed this product as SNS/TCPaccess. The prefix was later dropped, and TCPaccess became the company's main focus of development by the mid-1990s.
Meanwhile, in 1989, IBM had introduced its own TCP/IP offering on MVS. This product had been ported from the VM operating system, and required expensive and inefficient protocol conversions. Interlink was able to successfully sell TCPaccess as a more efficient and better-performing alternative, and as late as 1996 it still held 25% of the TCP/IP market on MVS. As the decade progressed, IBM improved its product, and Interlink's market share steadily eroded.
In August 1996, Interlink became a public corporation, with an initial offering of $10 per share on the NASDAQ exchange. In December of that year, a strategic agreement was announced with Cisco Systems to jointly develop and market the TCPaccess product as Cisco IOS for S/390. Shares of Interlink stock jumped to $15 on this news, and ultimately approached $18. Sales of the re-branded Cisco product fell below expectations, and Interlink struggled to rebuild its own sales channel. Interlink stock eventually fell below $4 per share.
In 1998, Interlink introduced e-Control, a new TCP/IP network management product for the mainframe. The company came to the attention of Dallas-based Sterling Software Inc., which had its own product in this space. In March, 1999, Sterling announced it had agreed to acquire Interlink Computer Sciences Inc. for $7 per share. The deal was valued at $64 million. On May 3, 1999, the acquisition was completed.
References
Defunct computer companies based in California
Defunct software companies of the United States |
https://en.wikipedia.org/wiki/TCPaccess | TCPaccess is a software product which implements the TCP/IP protocol suite on IBM mainframe computers using the MVS operating system. It was developed in 1986 by Advanced Computer Communications under the name ACCES/MVS, and was the first commercial TCP/IP implementation for MVS mainframes. It is usually associated with Interlink Computer Sciences, which developed and marketed the product from 1990 until 1999, and is frequently referred to as "the Interlink stack".
The product was marketed by Cisco Systems as Cisco IOS for S/390. It is currently offered by Computer Associates as Unicenter TCPaccess Communications Server.
External links
Cisco IOS for S/390 – From Cisco Systems.
Internet Protocol based network software
IBM mainframe software |
https://en.wikipedia.org/wiki/Comecon%20%28band%29 | Comecon was a Swedish death metal project founded in 1990. The band consisted of two guitarists, a drum computer and a session singer; a different one on each album. The debut album featured the Swede Lars-Göran Petrov, who was then dismissed from Entombed. Their second album was sung by Dutchman Martin van Drunen (Asphyx). German Marc Grewe, from Morgoth handled the vocals on their final album. All three albums were produced by Tomas Skogsberg.
Discography
Split album with Merciless (1991)
Megatrends in Brutality (1992)
Converging Conspiracies (1993)
Fable Frolic (1995)
Members
Rasmus Ekman – guitar, bass
Pelle Ström – guitar, bass
Lars-Göran Petrov – vocals (1992)
Martin van Drunen – vocals (1993)
Marc Grewe – vocals (1995)
External links
Band website
[ Comecon] at AllMusic
Comecon at Encyclopaedia Metallum
Swedish death metal musical groups
Musical groups established in 1989
Musical groups disestablished in 1995 |
https://en.wikipedia.org/wiki/Bay%20Networks | Bay Networks, Inc., was a network hardware vendor formed through the merger of Santa Clara, California, based SynOptics Communications and Billerica, Massachusetts based Wellfleet Communications on July 6, 1994. SynOptics was an important early innovator of Ethernet products, having developed a pre-standard twisted pair 10Mbit/s Ethernet product and a modular Ethernet hub product that dominated the enterprise networking market. Wellfleet was an important competitor to Cisco Systems in the router market, ultimately commanding up to a 20% market share of the network router business worldwide. The combined company was renamed Bay Networks as a nod to the legacy that SynOptics was based in the San Francisco area and Wellfleet was based in the Boston area, two cities well known for their bays.
Acquisitions
Bay Networks expanded its product line both through internal development and acquisition, acquiring the following companies during the course of its existence:
Centillion Networks, Inc. (May, 1995) - Provided Asynchronous Transfer Mode switching and Token Ring technology.
Xylogics, Inc. (December, 1995) - Remote access technologies.
Performance Technology (March, 1996) - LAN-to-WAN access technology.
ARMON Networking, Ltd. (April, 1996) - RMON and RMON2 network management technology.
LANcity Corporation (October, 1996) - Cable modem technology.
Penril Datability Networks (November, 1996) - Dial-up modems and remote access products based on Digital Signal Processing technology.
NetICs, Inc. (December, 1996) - ASIC-based Fast Ethernet switching technology.
ISOTRO Network Management, Inc. (April, 1997) - DNS and DHCP technologies.
Rapid City Communications (June, 1997) - Gigabit Ethernet switching and routing technology.
New Oak Communications (January, 1998) - Provided VPN technology to Bay Networks product line.
Netsation Corp. (February, 1998) - Technology was used to augment Bay Networks Optivity network management system.
NetServe GmbH (July, 1998) - VoIPX technology
Acquisition by Nortel
Bay Networks was acquired by Northern Telecom in June 1998 for US$ 9.1 billion, broadening Nortel's reach from its traditional carrier customer base into enterprise data networking. Reflective of this expanded product set and market, Nortel renamed itself Nortel Networks after the merger. In December 2009, as part of its bankruptcy proceedings, Nortel sold its Enterprise Networking equipment and software business to Avaya. The sale included a few remaining Bay Networks products that were still active in Nortel's portfolio at the time of the sale, such as the Ethernet Switch 450 and Backbone Concentrator Node (BCN) router.
The Bay Networks product Small office/home office line survives to this day as the Netgear products that are widely sold by electronics retailers. Example products include Gigabit Ethernet switches, cable modems, print servers, and similar inexpensive, consumer-oriented networking equipment. Bay Networks had originally launched |
https://en.wikipedia.org/wiki/Syphon%20Filter | Syphon Filter is a third-person shooter video game series developed by Bend Studio (formerly Eidetic) and published by Sony Computer Entertainment (previously 989 Studios), for the PlayStation, PlayStation 2 and PlayStation Portable. In the series, Syphon Filter is the name given to a mysterious biological weapon.
Games
Syphon Filter (1999)
The plot centers on special agents, Gabriel Logan and Lian Xing, who are tasked by the United States government to apprehend Erich Rhoemer, an international terrorist.
Syphon Filter 2 (2000)
The plot picks up immediately after where the previous Syphon Filter ended. Gabe sets out to cure the virus, whilst being targeted as a "terrorist" by the United States government.
Syphon Filter 3 (2001)
Gabe and his team are suspected of treason. Summoned to prove their innocence, the team recounts the incidents that led to this moment. In the background, Gabe moves to rid the world of Syphon Filter once and for all.
Syphon Filter: The Omega Strain (2004)
Gabe, now commander of a government agency, leads global investigation of viral outbreaks in order to stop a deadlier strain of the titular virus from emerging. Unlike previous games, the main protagonist is I.P.C.A. recruit Cobra, while Gabe and Lian Xing appear as supporting NPCs. In multiplayer, a maximum of three more characters may join Cobra, these are Python, Dragon and Viper.
Syphon Filter: Dark Mirror (2006)
Following a mixed reception of The Omega Strain, Dark Mirror is a return to the series' roots. Gabe investigates a terrorist incident in an Alaskan oil refinery, only to discover a big conspiracy around the titular Dark Mirror. This is the first Syphon Filer title developed for PlayStation Portable. The PlayStation 2 port removed multiplayer and mature content, but restored the roll ability.
Syphon Filter: Logan's Shadow (2007)
Serving as a direct sequel to Dark Mirror, Gabe receives a mission to retrieve stolen military equipment from Somali pirates, while discovering that his partner, Lian Xing, could be a double agent.
References
External links
Sony Interactive Entertainment franchises
Spy video games
Stealth video games
Stealth video games by series
Third-person shooters
Video game franchises
Video games developed in the United States
Video games featuring female protagonists
Video game franchises introduced in 1999 |
https://en.wikipedia.org/wiki/Marshall%20Law%20%28TV%20series%29 | Marshall Law is an Australian television series, which aired on the Seven Network in 2002, starring Lisa McCune and Alison Whyte as lawyers and sisters.
History
The show was originally conceived as a legal drama mixed with Ally McBeal-style romantic comedy, and was one of four new prime-time series in 2002, as the beginning of an attempt to revive the Australian television industry. The concept combined with the cast of industry heavyweights initially seemed like a package that could not fail.
Although ratings were good the first week, figures quickly slumped and the series, which first aired in August, finished airing in November, cancelled after only 17 episodes. Subsequently, repeat screenings were reedited to remove the Ally McBeal style CGI effects.
Synopsis
Set in Melbourne, Marshall Law tells the story of two sisters – Ros and Verity Marshall (played by Lisa McCune, popular after her seven-year run on Blue Heelers; and Alison Whyte, well known for her role on Frontline) – working at the Magistrate's Court. Ros is a Junior Prosecutor who is more interested in partying, and is having to prove her worth at the bench; while the more-experienced and overachieving Verity is now working as a barrister.
Both sisters soon find themselves in for surprises. Ros realises just how out of her depth she may be, begging the help of legal aid solicitor Mikey O'Dea (Nick Farnell), and mentor Esther Hersch, QC (Anne Phelan of Something in the Air).
Meanwhile, Verity, working with her handsome but inept assistant Scott (Nathaniel Kiwi) faces her biggest challenge going up against one of the city's most eminent counsels, Dylan Boyd (William McInnes from SeaChange and Blue Heelers) – her ex-husband.
Verity and Ros, despite leading very different lifestyles, find themselves being forced to work together in this competitive world, particularly with the likes of Judge Don Foster (Greg Stone), Ros's boss Frank Dellabosca (Frank Gallacher), and the ambitious lawyer Prue Staley (Jane Hall). Verity McIntyre appeared as Julie Larson.
Original pilot
The original Marshall Law pilot was a different affair. Titled Leather and Silk, with more emphasis on drama, Bevan Lee, co-creator with Alison Nisselle, described the pilot as being too serious. Executive Producer John Holmes acknowledged that emphasis on the workings of the law "... didn't hold a lot of excitement or interest, except for some die-hard people who love the law and are really interested in it".
Most major characters other than Lisa McCune's were cast differently, and many smaller roles were removed. Holmes explained :
"There were too many people in it. You didn't get a chance to get any traction with any of the characters. There were so many incidental characters, when you watched it, you weren't quite sure who to focus on. Now there's much more concentration on Verity, Ros and Dylan. The show is much more about them and their lives and how they deal with each other, with the background of the le |
https://en.wikipedia.org/wiki/SynOptics | SynOptics Communications was a Santa Clara, California-based early computer network equipment vendor from 1985 until 1994. SynOptics popularized the concept of the modular Ethernet hub and high-speed Ethernet networking over copper twisted-pair and fiber optic cables.
History
SynOptics Communications was founded in 1985 by Andrew K. Ludwick and Ronald V. Schmidt, both of whom worked at Xerox's Palo Alto Research Center (PARC).
The most significant product that Synoptics produced was LattisNet (originally named AstraNet) in 1987.
This meant that unshielded twisted-pair cabling already installed in office buildings could be re-utilized for computer networking instead of special coaxial cables.
The star network topology made the network much easier to manage and maintain. Together these two innovations directly led to the ubiquity of Ethernet networks.
Before the final standard version of what is known today as the 10BASE-T protocol, there were several different methods and standards for running Ethernet over twisted-pair cabling at various speeds, such as StarLAN. LattisNet was similar to the final 10BASE-T protocol except that it had slightly different voltage and signal characteristics. Synoptics updated their product line to the 10BASE-T specification once it was published.
Through the late 1980s and into the early 1990s, SynOptics produced a series of innovative products including early 10BASE-2 hubs, pre-standard (LattisNet), and 100BASE-TX products.
The company was the market leader in Ethernet LAN hubs over rivals 3Com and Cabletron.
Despite intense competition that drove down prices, Synoptics' annual revenue grew to a high of $700 million in 1993.
To move away from the rapidly commoditizing Layer 1/2 Ethernet equipment market and grow their market share in the increasingly lucrative and more profitable Layer 3 networking arena, SynOptics merged with Billerica, Massachusetts based Wellfleet Communications on July 6, 1994, in a US$ 2.7 Billion dollar deal to form Bay Networks.
SynOptics headquarters at the time of the merger with Wellfleet was in the pair of strikingly-designed sloped buildings at the Northeast corner of the intersection of California's Great America Parkway and Mission College Blvd in Santa Clara, an area known for featuring numerous networking start-ups such as Ungermann-Bass. These buildings are currently occupied by Palo Alto Networks.
Bay Networks was acquired by Canadian company Nortel in June 1998 for $9.1 billion, forming Nortel Networks.
See also
SynOptics Network Management Protocol
References
1985 establishments in California
1994 disestablishments in California
American companies established in 1985
American companies disestablished in 1994
Companies based in Santa Clara, California
Computer companies established in 1985
Computer companies disestablished in 1994
Defunct companies based in the San Francisco Bay Area
Defunct computer companies of the United States
Defunct networking companies
Manufac |
https://en.wikipedia.org/wiki/NASCAR%20Racing%202003%20Season | NASCAR Racing 2003 Season, or NR2003 for short, is a computer racing simulator released in February 2003 by Papyrus Design Group for Windows and Mac OS X. The game was the last to be released by the company before EA Sports bought the NASCAR license exclusively from 2004 to 2009 (parent company Sierra's successor company, Activision Blizzard, reacquired NASCAR rights in 2011, with NASCAR The Game: 2011). The game included all of the 2003 NASCAR season tracks and many of the drivers, including Dave Blaney, who was absent in NASCAR Thunder 2004.
Gameplay
NASCAR Racing 2003 Season contains 40 Winston Cup teams that were anticipated to run throughout the season, with the exception of the cars from Chip Ganassi Racing, as well as 23 Winston Cup series tracks, putting the player behind the wheel of a NASCAR stock car. Players are able to choose between testing sessions, offline single racing, championship, and multiplayer options as well as car setup choices.
Ownership
At the end of March 2004, NR2003 was pulled from shelves when Electronic Arts acquired the exclusive NASCAR rights. In May 2004, Papyrus was shut down, and David Kaemmer bought the source code and assets a couple months later for his company FIRST, LLC where it became the base code for iRacing. In 2007, Sierra, the game's publishers, shut down the online servers.
Reception
The game received "generally favorable reviews", according to the review aggregation website Metacritic.
According to Edge, the game sold at least 100,000 copies in the United States, but was beaten by NASCAR Racing 4s 260,000 sales in the region. Total US sales of NASCAR Racing computer games released in the 2000s reached 900,000 copies by August 2006.
The game won PC Gamer USs 2003 "Best Racing Game" award. The magazine's Andy Mahood wrote that it "established a daunting new standard for PC racing simulations that may take years to eclipse".
Notes
References
External links
2003 video games
MacOS games
Multiplayer and single-player video games
NASCAR video games
Papyrus Design Group games
Racing simulators
Racing video games
Sierra Entertainment games
Video games developed in the United States
Windows games |
https://en.wikipedia.org/wiki/Perl%20Compatible%20Regular%20Expressions | Perl Compatible Regular Expressions (PCRE) is a library written in C, which implements a regular expression engine, inspired by the capabilities of the Perl programming language. Philip Hazel started writing PCRE in summer 1997. PCRE's syntax is much more powerful and flexible than either of the POSIX regular expression flavors (BRE, ERE) and than that of many other regular-expression libraries.
While PCRE originally aimed at feature-equivalence with Perl, the two implementations are not fully equivalent. During the PCRE 7.x and Perl 5.9.x phase, the two projects coordinated development, with features being ported between them in both directions.
In 2015, a fork of PCRE was released with a revised programming interface (API). The original software, now called PCRE1 (the 1.xx–8.xx series), has had bugs mended, but no further development. , it is considered obsolete, and the current 8.45 release is likely to be the last. The new PCRE2 code (the 10.xx series) has had a number of extensions and coding improvements and is where development takes place.
A number of prominent open-source programs, such as the Apache and Nginx HTTP servers, and the PHP and R scripting languages, incorporate the PCRE library; proprietary software can do likewise, as the library is BSD-licensed. As of Perl 5.10, PCRE is also available as a replacement for Perl's default regular-expression engine through the re::engine::PCRE module.
The library can be built on Unix, Windows, and several other environments. PCRE2 is distributed with a POSIX C wrapper, several test programs, and the utility program pcre2grep that is built in tandem with the library.
Features
Just-in-time compiler support
This optional feature is available if enabled when the PCRE2 library is built. Large performance benefits are possible when (for example) the calling program utilizes the feature with compatible patterns that are executed repeatedly. The just-in-time compiler support was written by Zoltan Herczeg and is not addressed in the POSIX wrapper.
Flexible memory management
The use of the system stack for backtracking can be problematic in PCRE1, which is why this feature of the implementation was changed in PCRE2. The heap is now used for this purpose, and the total amount can be limited. The problem of stack overflow, which came up regularly with PCRE1, is no longer an issue with PCRE2 from release 10.30 (2017).
Consistent escaping rules
Like Perl, PCRE2 has consistent escaping rules: any non-alpha-numeric character may be escaped to mean its literal value by prefixing a \ (backslash) before the character. Any alpha-numeric character preceded by a backslash typically gives it a special meaning. In the case where the sequence has not been defined to be special, an error occurs. This is different to Perl, which gives an error only if it is in warning mode (PCRE2 does not have a warning mode). In basic POSIX regular expressions, sometimes backslashes escaped non-alpha-numerics (e.g. \.), |
https://en.wikipedia.org/wiki/Feed%20%28Anderson%20novel%29 | Feed (2002) is a cyberpunk, satirical, dystopian, young-adult novel by M. T. Anderson, focusing on issues such as corporate power, consumerism, information technology, data mining, and environmental decay, with a sometimes sardonic, sometimes somber tone. From the first-person perspective of a teenaged boy, the book takes place in a near-futuristic American culture completely dominated by advertising and corporate exploitation, corresponding to the enormous popularity of internetworking brain implants called feeds.
Plot
Context
The novel portrays a near-future in which the feednet, a huge computer network (apparently an advanced form of the Internet), is directly connected to the brains of about 73% of American citizens by an implanted device called a feed. The feed allows people: to mentally access vast digital databases (individually called "sites"); to experience shareable virtual-reality phenomena (including entertainment programs, music, and even others' memories); to continually interact with intrusive corporations in a personal preference-based way; and to communicate telepathically on closed channels with others who also have feeds (a feature called m-chatting).
In the book's setting, the natural environment is deteriorating, with natural clouds having been replaced by trademarked Clouds™, and many parents have their children custom-designed. The corporations responsible for the feed have immense power and even run the school system, which is now known as School™. Throughout the book, corporations appear to hold the true power in the United States, leading to the destruction of the environment and leaving the president virtually helpless as the Global Alliance, a coalition of other countries, begins contemplating war with the U.S.
Synopsis
Titus and his thrill-seeking teenaged friends meet teen girl Violet Durn, whose critically questioning attitude is completely new to the others. While at a club, a man from an anti-feed organization hacks all of their feeds. They wake up in a hospital to find, for the first time in most of their lives, that their feeds are unavailable: partially deactivated while under repair. During their recovery, Violet and Titus become sweethearts. Eventually, their feeds are repaired enough for them to return to Earth; however, Violet's feed is not completely fixed.
One day, Violet reveals her idea of resisting the feed to Titus. She plans to show interest in a wide and random assortment of products to prevent the corporations that control the feed from developing a reliable consumer profile of her. The two go to the mall and create wild consumer profiles, by requesting information on certain random items, then not buying them. Later, Violet realizes that someone has been accessing her personal information through her dreams; this soon becomes a normal occurrence for many feed users. Violet calls FeedTech customer service but receives no help. Later, she tells Titus that her feed has been severely malfunction |
https://en.wikipedia.org/wiki/John%20Henry%20Holland | John Henry Holland (February 2, 1929 – August 9, 2015) was an American scientist and professor of psychology and electrical engineering and computer science at the University of Michigan, Ann Arbor. He was a pioneer in what became known as genetic algorithms.
Biography
John Henry Holland was born on 2 February 1929 in Fort Wayne, Allen County, Indiana, son of Gustave A. Holland (b. 24 July 1896 in Russian Poland; only son of Christopher Holland and Appolonia Greiber / Graeber; three sisters) and Mildred P. Gfroerer (b. 1 July 1901
in Columbus Grove, Ohio; the second of three daughters of John Joseph Gfroerer and Ila Savilla "Ily S." Kiefer). He had one younger sister, Shirley Ann "Hollie" Holland (b. about 1931; m1. c.1955 John William Ringgenberg (div. bef. 3 Aug 1968, d. 1982), had issue; m2. 2003 to Albert Vernon "Vern" Kinner (d. 2015)).
Holland studied physics at the Massachusetts Institute of Technology and received a B.S. degree in 1950. He then studied Mathematics at the University of Michigan, receiving an M.A. in 1954. In 1959, he received the first computer science Ph.D. from the University of Michigan. He was a Professor of psychology and Professor of electrical engineering and computer science at the University of Michigan, Ann Arbor. He held visiting positions at the Rowland Institute for Science and the University of Bergen.
"Holland is best known for his role as a founding father of the complex systems approach. In particular, he developed genetic algorithms and learning classifier systems. These foundational building blocks of an evolutionary approach to optimization are now included in all texts on optimization and programming." – Carl Simon, professor of mathematics, economics, complex systems and public policy
Holland was a member of the Board of Trustees and Science Board of the Santa Fe Institute and a fellow of the World Economic Forum.
Holland received the 1961 Louis E. Levy Medal from The Franklin Institute, and the MacArthur Fellowship in 1992.
He was profiled extensively in chapters 5 and 7 of the book Complexity (1993), by M. Mitchell Waldrop.
Holland died on August 9, 2015, in Ann Arbor, Michigan.
Work
Holland frequently lectured around the world on his own research, and on research and open questions in complex adaptive systems (CAS) studies. In 1975, he wrote the ground-breaking book on genetic algorithms, "Adaptation in Natural and Artificial Systems". He also developed Holland's schema theorem.
Publications
Holland authored a number of books about complex adaptive systems, including:
Adaptation in Natural and Artificial Systems (1975, MIT Press)
Hidden Order: How Adaptation Builds Complexity (1995, Basic Books); reviewed by Mark S. Miller in Reason
Emergence: From Chaos to Order (1998, Basic Books)
Signals and Boundaries: Building Blocks for Complex Adaptive Systems (2012, MIT Press)
Complexity: A Very Short Introduction (2014, Oxford University Press)
Articles, a selection:
"A universal computer capable |
https://en.wikipedia.org/wiki/Mayan%20World%20Airlines | Mayan World Airlines was an airline based in Guatemala.
Code data
ICAO Code: MYN
Call-sign: Mayan World
2-letter code: EY
Fleet
As of August 2006, the Mayan World Airlines fleet included:
1 Yakovlev Yak-40
1 ATR 42-300
Destinations
As of November 1999 Mayan World Airlines flew to:
Cancun
Guatemala City
Flores(Guatemala)
References
Defunct airlines of Guatemala
Airlines established in 1996
Airlines disestablished in 1999 |
https://en.wikipedia.org/wiki/2Day%20FM | 2Day FM (call sign 2DAY) is a commercial FM radio station broadcasting in Sydney, New South Wales, Australia, on a frequency of 104.1 MHz, and is part of Southern Cross Austereo's Hit Network.
History
1980s
2Day FM was one of three radio stations (along with Triple M and Triple J) to be granted new FM broadcasting licenses in Sydney in 1980, and commenced broadcasting on 2 August of that year. The original owners were well known media personalities John Laws (30%), Mike Willesee (30%), Village Roadshow (30%) and Graham Kennedy (10%). The station's original programming format was focused towards easy-listening music, but shifted to more pop and rock oriented programming since the late 1980s, with the later addition of Hip-Hop and dance music to their playlists.
Originally the studios were located on the second floor of the Sovereign Inn at 220 Pacific Highway, Crows Nest. The building became the All Seasons hotel during the 2000s and in 2009 was demolished and re-developed into a mixed commercial building.
The original equipment comprised BMX Pacific Recorder mixing consoles, and CEI cartridge machines.
The station was sold to the Lamb Family in February 1987, who sold it again to radio group Austereo in May 1989.
1990s
In 1995, the station's owner Austereo bought out the Triple M network from Hoyts, and following the merger of the two companies in 1996 2Day FM moved its studios and administration to Level 24, Tower 1, Westfield Bondi Junction at 520 Oxford Street, just one floor below the original home of Triple M since 1980. Austereo also took over Level 26 of the same building for its corporate departments. With the move to new premises, 2Day FM also adopted digital audio playout, incorporating the DCS audio system built by Computer Concepts, sold and supported in Australia by Techtel.
During the 1990s, 2Day FM enjoyed ratings success, especially with its breakfast program The Morning Crew (featuring well-known Australian comedian Wendy Harmer and television comedian Peter Moon), which consistently topped its segment in the Sydney radio market for years.
From 1995 to 1998, 2Day FM broadcast the highly successful Martin/Molloy drive program with Tony Martin and Mick Molloy. This program was networked to over 50 stations around Australia (from the studios of Fox FM in Melbourne, Victoria), and is considered one of Australia's most successful FM radio shows. Martin and Molloy left the Today Network in late 1998 at the top of the ratings, citing the need for a break from the pressures of radio.
Nights on 2Day FM have also been controversial. In 1997, night announcer David Rymer, host of the then Top 30 Countdown, was castigated in the media for a poorly thought-out on air stunt in which he called a top ranking Year 12 student, pretending to be from the Board of Studies. He told the girl her results were incorrect and that her marks had been adjusted. He played the segment to air after receiving verbal permission to do so from the girl's m |
https://en.wikipedia.org/wiki/Adobe%20Flash%20Player | Adobe Flash Player (known in Internet Explorer, Firefox, and Google Chrome as Shockwave Flash) is computer software for viewing multimedia contents, executing rich Internet applications, and streaming audio and video content created on the Adobe Flash platform. It can run from a web browser as a browser plug-in or independently on supported devices. Originally created by FutureWave under the name FutureSplash Player, it was renamed to Macromedia Flash Player after Macromedia acquired FutureWave in 1996. It was then developed and distributed by Adobe Systems as Flash Player after Adobe acquired Macromedia in 2005. It is currently developed and distributed by Zhongcheng for users in China, and by Harman International for enterprise users outside of China, in collaboration with Adobe.
Flash Player runs SWF files that can be created by Adobe Flash Professional, Adobe Flash Builder, or by third-party tools such as FlashDevelop. Flash Player supports vector graphics, 3D graphics, embedded audio, video and raster graphics, and a scripting language called ActionScript, which is based on ECMAScript (similar to JavaScript) and supports object-oriented code. Internet Explorer 11 and Microsoft Edge Legacy, in Windows 8 and later, along with Google Chrome on all versions of Windows, came bundled with a sandboxed Adobe Flash plug-in.
Flash Player once had a large user base, and was a common format for web games, animations, and graphical user interface (GUI) elements embedded in web pages. Adobe stated in 2013 that more than 400 million out of over 1 billion connected desktops updated to new versions of Flash Player within six weeks of release. However, Flash Player became increasingly criticized for its performance, consumption of battery on mobile devices, the number of security vulnerabilities that had been discovered in the software, and its closed platform nature. Apple co-founder Steve Jobs was highly critical of Flash Player, having published an open letter detailing Apple's reasoning for not supporting Flash on its iOS device family. Its usage also waned because of modern web standards that allow some of Flash's use cases to be fulfilled without third-party plugins. This led to the eventual deprecation of the platform by Adobe. Flash Player was officially discontinued on 31 December 2020, and its download page was removed two days later. Since 12 January 2021, Flash Player (original global variants) versions newer than 32.0.0.371, released in May 2020, refuse to play Flash content and instead display a static warning message. The software remains supported in mainland China and in some enterprise variants.
Features
Adobe Flash Player is a runtime that executes and displays content from a provided SWF file, although it has no in-built features to modify the SWF file at runtime. It can execute software written in the ActionScript programming language which enables the runtime manipulation of text, data, vector graphics, raster graphics, sound, and v |
https://en.wikipedia.org/wiki/Family%20Business%20%28American%20TV%20series%29 | Family Business (referred to as Porn: A Family Business in the UK) was an American reality TV series produced for the cable network Showtime. Based in Los Angeles, the series focused on the pornography industry and the life of Adam Glasser, a reality porn star and video director who uses the stage name Seymore Butts.
Also featured on the series were his son, Brady, along with his mother, Lila Glasser, and his older cousin, Stevie Glasser, both of whom help Adam run the eponymous "family business" of the series, which is a successful porn video production and distribution house in the San Fernando Valley, known for the "Seymore Butts" line of videos.
The series first aired in 2003. In Canada it is broadcast on The Movie Network, Movie Central, and Showcase Television, in the UK on Channel 4, and in Latin America on FX. The first two seasons are currently available on DVD in North America. The series ran for four seasons.
The series won the 2005 AVN award for 'Best Alternative Release'.
Overview
Episodes usually followed a day or two in the life of the Glassers. Many episodes focused on Adam, a single father, raising his young son, Brady, while keeping his professional life separate from his private life. Other episodes focused on his difficulties in establishing relationships (finding "Miss Right") outside the porn industry. Adam's mother, Lila, contributes by setting her son up on blind dates or with a speed dating service.
Much of the show's comic relief was provided by Stevie, a cantankerous character who often gets into mischief and, as the series progresses, becomes a video director in his own right, as does Bishop, Glasser's camera operator and video editor.
The series was sexually explicit (though hardcore content was either pixelated or edited out) as it also went behind the scenes of Adam's video shoots, and looked at the life of other porn stars away from the camera. One episode follows Herschel Savage, a performer whose career dated back 33 years, as he tries to establish a second career as a stand-up comedian. Another episode saw Adam and Stevie going to great lengths in order to convince a young woman, his assistant, not to enter the porn industry. The show follows the young woman as she decides to go in front of the camera and creates the porn actress persona Mari Possa. In the second season, an episode featured Stevie and Adam trying to convince Mari not to get breast implants. Another episode followed Stevie as he experienced a cancer scare, spending several days waiting for test results from his doctor.
The second season also includes an episode that follows Glasser's efforts to mount an Internet-based telethon to raise money for freedom of speech causes; this event was in response to his nearly being jailed on obscenity charges several years prior and, according to the episode, was sparked when Glasser discovered a shipment of Seymour Butts tapes that was about to be inadvertently mailed to an American state where importa |
https://en.wikipedia.org/wiki/Nova%20TV%20%28Croatia%29 | Nova TV is a Croatian free-to-air television network launched on 28 May 2000. It was the first commercial television network with national concession in the country and from 2004 until 2018 it was fully owned by the Central European Media Enterprises. In 2018, Direct Media purchased Nova TV and Doma TV.
Overview
As the first Croatian commercial television network, Nova TV made the Croatian TV viewers familiar with reality shows when first showing the American shows such as Survivor and Temptation Island. They were also the first television network to show The Jerry Springer Show in Croatia, although they stopped showing it in 2002. A short time later they started to produce their own talent show Story Supernova, which was then followed by the Croatian version of Pop Idol called Hrvatski idol.
The station also became notable for showing one of the first Croatian sitcoms called Naša mala klinika, which started to air in November 2004, and in early June 2005 they started to show another domestically produced sitcom called Bumerang. In 2005 Nova TV also introduced popular American TV series such as Lost and Desperate Housewives as well as reality show The Apprentice to the Croatian audience, and in the same year they were also showing the controversial domestically produced animated series Laku noć, Hrvatska. They are also known for broadcasting newer blockbusters first released in the 1990s and the 2000s (decade) as well as some less popular TV or cinema movies that are quite hard to find anywhere else in Croatia.
Currently, their program schedule usually consists of cartoons and children's program in the morning, the afternoons are generally reserved for Latin American telenovelas, foreign sitcoms and US American soap operas while the evenings begin with daily news program followed by movies and TV series or reality shows as well as domestic shows or sitcoms.
Nova TV are also notable for their live broadcasts of various sporting events such as alpine skiing and Mirko Filipović's fights. For many years, they have also been broadcasting FA Premier League matches, as well as some of the English cup matches. However, they stopped showing English football following the end of the 2006–07 season, with the Premier League now available in Croatia through RTL Televizija. In 2009, Nova TV bought the rights to show the UEFA Champions League matches played on Tuesdays until 2012. Their Champions League coverage consists of one live broadcast and the highlights of all the remaining matches of the night, but not the final, which is broadcast by HRT. In 2018, Nova TV bought all Croatia national football team fixtures live until 2028.
Dnevnik Nove TV
Dnevnik Nove TV is the main news program of the Croatian Nova TV, broadcast daily at 18:15 UTC.
, it was the second most popular news program in Croatia, closing in on Dnevnik HRT, its main competitor. The show overtook Dnevnik HRT in 2010, becoming the most watched news programme in Croatia. Since its launch |
https://en.wikipedia.org/wiki/Controller%20%28computing%29 | In computer hardware, a controller may refer to:
Memory controller, a unit that manages access to memory
Game controller, a device by which the user controls the operation of the computer
Host controller
Network controller
Graphics controller or video display controller
SCSI host bus adapter
Network interface controller (NIC)
Parallel port controller
Microcontroller unit (MCU)
Keyboard controller
Programmable Interrupt Controller
Northbridge (computing)
Southbridge (computing)
Universal asynchronous receiver/transmitter (UART) communications controller chip
Peripheral DMA controller
Floppy disk controller
Disk array controller, also known as a RAID controller, a type of storage controller
Flash controller, or SSD controller, which manages flash memory
Terminal Access Controller
IBM 2821 Control Unit, used to attach card readers, punches and line printers to IBM System/360 and IBM System/370 computers
IBM 270x and IBM 37xx, used for telecommunications
IBM 3271, 3272, 3271, and 3174, used to attach terminals (display devices)
MIDI controller
Programmable logic controller |
https://en.wikipedia.org/wiki/Reid%27s%20base%20line | Reid's base line is used for an unambiguous definition of the orientation of the human skull in conventional radiography, computer tomography (CT), and magnetic resonance imaging (MRI) studies. It is defined as a line drawn from the inferior margin of the orbit (Orbitale point) to the auricular point (center of the orifice of the external acoustic meatus, Auriculare point) and extending backward to the center of the occipital bone. Reid's base line is used as the zero plane in computed tomography. Paediatric base line is an anatomic line that maintains a fixed relation to facial bones throughout the period of growth
In 1962, the World Federation of Radiology defined it as the line between the infraorbital margin and the upper margin of the external auditory meatus.
With the head upright, it is typically tilted about 7 degrees nose up with respect to the horizontal plane.
See also
Frankfurt plane
External links
Radiology |
https://en.wikipedia.org/wiki/Allocation%20group | An AG or allocation group is a subvolume in a file system which maintains its own track of free blocks and file data.
This makes simultaneous file operations possible; only one write can happen to an AG at any time, but multiple operations can be performed on the file system, each happening in a different AG. In SMP systems, multiple CPUs can write to different AGs, enabling physically concurrent disk operations on a single file system.
Whereas a single hard disk is not capable of reading or writing to multiple places simultaneously, a file system or partition that utilizes a scheme such as RAID or logical volume management may encompass multiple physical disks. In this case, the use of allocation groups may grant additional file system throughput.
Allocation groups are used by these file systems:
XFS from SGI, an XFS AG can have a max size of 1TiB
Btrfs
JFS
ext2, ext3 and ext4 use block groups
Disk file systems |
https://en.wikipedia.org/wiki/Densities%20of%20the%20elements%20%28data%20page%29 |
Density, solid phase
In the following table, the use row is the value recommended for use in other Wikipedia pages in order to maintain consistency across content.
Density, liquid phase
Density, gas phase
Notes
The suggested values for solid densities refer to "near room temperature (r.t.)" by default.
The suggested values for liquid densities refer to "at the melting point (m.p.)" by default.
See also
Hardnesses of the elements (data page)
References
WEL
As quoted at http://www.webelements.com/ from these sources:
A.M. James and M.P. Lord in Macmillan's Chemical and Physical Data, Macmillan, London, UK, 1992.
D.R. Lide, (ed.) in Chemical Rubber Company handbook of chemistry and physics, CRC Press, Boca Raton, Florida, USA, 77th edition, 1996.
J.A. Dean (ed) in Lange's Handbook of Chemistry, McGraw-Hill, New York, USA, 14th edition, 1992.
G.W.C. Kaye and T.H. Laby in Tables of physical and chemical constants, Longman, London, UK, 15th edition, 1993.
CRC
As quoted from various sources in an online version of:
David R. Lide (ed), CRC Handbook of Chemistry and Physics, 84th Edition. CRC Press. Boca Raton, Florida, 2003; Section 4, Properties of the Elements and Inorganic Compounds; Physical Constants of Inorganic Compounds
CR2
David R. Lide (ed), CRC Handbook of Chemistry and Physics, 84th Edition. CRC Press. Boca Raton, Florida, 2003; Section 4, Properties of the Elements and Inorganic Compounds; Density of Molten Elements and Representative Salts
LNG
As quoted from an online version of:
J.A. Dean (ed), Lange's Handbook of Chemistry (15th Edition), McGraw-Hill, 1999; Section 3; Table 3.2 Physical Constants of Inorganic Compounds
VDW
The following molar volumes and densities for the majority of the gaseous elements were calculated from the van der Waals equation of state, using the quoted values of the van der Waals constants. The source for the van der Waals constants and for the literature densities was: R. C. Weast (Ed.), Handbook of Chemistry and Physics (53rd Edn.), Cleveland:Chemical Rubber Co., 1972.
Donnelly et al.
Hoffer et al.
Other
KCH: Kuchling, Horst, Taschenbuch der Physik, 13. Auflage, Verlag Harri Deutsch, Thun und Frankfurt/Main, German edition, 1991.
(a) Gray and Ramsay, Proceedings of the Royal Society (London). A. Mathematical and Physical Sciences. 84: 536; (1911)
Properties of chemical elements
Chemical element data pages |
https://en.wikipedia.org/wiki/The%20Wandering%20Juvie | "The Wandering Juvie" is the sixteenth 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 March 28, 2004. It guest-starred Sarah Michelle Gellar as Gina Vendetti. It also guest-starred Charles Napier and Jane Kaczmarek. Bart gets sent to juvenile hall after registering for gifts at a department store and having a fraudulent wedding to obtain gifts. This episode sees the first appearance of Gina Vendetti, who later appears in "Moonshine River".
Plot
When the Simpson family is at the Costington's department store, Bart uses the wedding gift registry as a prank to register himself and his bride, "Lotta Cooties", for wedding presents. Bart invites many people to his so-called "wedding" and plans to take all the unused gifts back for store credit, but he is stopped by Chief Wiggum, who arrests Bart and rejects his bribe of the wedding presents. Bart is sentenced to six months of juvenile detention by Judge Constance Harm.
At the detention center, Bart is afraid he will be buried alive in the sandpit or photographed being punched while going down a slide. He soon notices that the girls' Juvie is on the other side of a chain-link fence. Bart attempts to schmooze with these girls, only to have them attack and immobilize him. One of the girls, Gina Vendetti, uses a knife to destroy Bart's uniform, threatening to castrate him next time he comes near their fence. Bart's problems continue when two weeks before his release he is partnered with Gina for the dance by the warden. When they are dancing, Gina escapes with Bart using a rope, finding themselves on a window ledge. Due to the fact that they are handcuffed together, Gina is forced to bring a reluctant Bart along before the window can be closed, though he only comes after she kisses him. Slowly, they gain each other's trust.
On the lam, the duo look for a blacksmith who can remove their cuffs. They are freed, but after it happens, Gina is alone and forlorn. She starts crying and admits to Bart that she has no family. When he sympathizes with her, she angrily tackles him until the police come and arrest them (and a bear that Cletus correctly predicted would attack Wiggum). Feeling terrible for causing Bart's sentence to be extended, Gina confesses that she was behind the escape, clearing Bart of further charges. In the end, the Simpsons and the warden step in to help Gina feel better for being without family, offering a Mexican food feast in her cell.
Cultural references
Gina's surname, "Vendetti", resembles the Italian word "vendetta", which means "revenge".
The episode's title is a play on the name of a figure from medieval Christian folklore, the Wandering Jew.
The "Little Hooker" T-shirt line sold at Costington's is a spoof of clothing manufacturers marketing adult fashions toward a pre-teen (especially female) demographic made by Abercrombie & Fitch and others.
The Itchy & Scratchy cartoon, |
https://en.wikipedia.org/wiki/List%20of%20Transformers%20comics%20characters | This is a list of characters in the Transformers Generation 1 comics series.
Non-Transformer characters
A
Aunty - The Autobots computer on board the Ark.
B
Walter Barnett - US government official and friend of the Autobots. Originally suspicious of the Autobots, Barnett became convinced they were friendly after seeing they chose not to fight back when attacked by humans. Barnett saved the lives of the Throttlebots by transferring their "brains" to toy cars before their bodies were destroyed.
Berko - Originally a homeless man, abducted into the Cosmic Carnival. Eventually becomes the Cosmic Carnival's ringmaster.
B'ghdad - Crime lord. He appears in a Matrix Quest story based on the film The Maltese Falcon.
Big Top - Owner of the Cosmic Carnival.
G. B. Blackrock - Millionaire and friend of the Autobots. Blackrock owns several companies, most prominently a chain of gas stations. He is a bit of a playboy and likes to flaunt his riches. Following an attack by the current Decepticon commander, Shockwave, at one of his seabound oil refineries, one of Blackrock's workers, Josie Beller, was crippled. Feeling responsible for her neurological injuries, Blackrock swore revenge on the Transformers by developing an anti-robot weapon. Later, though, Blackrock joins the Autobots. In the latter part of the series, Blackrock founded a team of human superheroes called the Neo-Knights. Blackrock himself does not have super powers, he simply acts as the team's manager. In the ReGeneration One comics by IDW Publishing, two decades of constant war against the Decepticons has forced Blackrock to abandon his millionaire playboy lifestyle and become a survivalist warrior, joining Spike Witwicky's resistance group against the Decepticons. The war has disabled Blackrock, leaving him requiring a mobile chair device, similar to the wheelchair-using Professor Charles Xavier. Blackrock also has a Shattered Glass counterpart by the name of R.J. Blackrock.
C
Carissa Carr - Science fiction film actress. Carr played the lead female character in a movie, where the Decepticon Pretender Skullgrin was chosen as the main villain. This led to an enormously successful movie career for Skullgrin, but it ended abruptly when Circuit Breaker discovered he was a robot and attacked him.
Charlene - Woman who accidentally became Skids's friend.
D
Jake Dalrymple - Short-tempered man.
Death's Head - A robotic bounty hunter (or rather, as he calls himself, a "freelance peace-keeping agent").
F
Miss Fatale - Resourceful female adventurer. She appears in a Matrix Quest story based on the film The Maltese Falcon.
Charlie Fong - Scientist. Fong helped the Autobots Goldbug and Blaster survive an infection of Scraplets.
G
Galen Kord - A Nebulan who preceded Spike Witwicky as the biological binary-bonded partner of Fortress Maximus. Like the other Nebulan partners of the Headmasters, Galen was binary-bonded to Fortress Maximus already on Nebulos, before the Nebulan council drove all the |
https://en.wikipedia.org/wiki/The%20Ziff%20Who%20Came%20to%20Dinner | "The Ziff Who Came to Dinner" is the fourteenth 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 March 14, 2004. The episode focuses on Artie Ziff, who takes residence in the Simpson family's attic after declaring bankruptcy. After playing poker with Homer and losing, he gives Homer all the shares of stock of his bankrupt company. Homer then gets arrested and Marge gets upset with Artie.
This is the third of nine episodes to date written by The Simpsons voice actor Dan Castellaneta and his wife, Deb Lacusta.
Plot
Homer takes Bart and Lisa to see The Wild Dingleberries Movie and he has to bring Ned Flanders' children with him, because Ned volunteered to take the senior citizens for ice cream for Jasper's birthday. However, at the Googolplex Theatre, the movie and every other kid-friendly movie is sold out, and Rod and Todd will not let Homer see a raunchy comedy called Teenage Sex Wager since it is one of many movies condemned by a Christian publication called "What Would Jesus View?". After hearing Lenny mention he had a small part in the horror movie The Re-Deadening as a gardener, Homer takes the kids to see the movie. The movie is very scary, causing it to scare Bart and Lisa at home, who think they hear noises from the attic. But when they look in the attic, their fears scare them away. When Bart and Lisa ask Homer and Marge to look in the attic, they discover Artie Ziff living there.
Artie explains that he was living in the attic because his Internet business, Ziffcorp, crashed in the dot-com bubble, and he lost all his money after spending it on many extravagant items which then got repossessed, including the repo vans. He chose to live with the Simpsons, claiming that Marge was the closest thing he ever had to true love - although Marge quickly points out that she and Artie only had one date where he almost raped her on their high school prom night. Artie promises that he will not hit on Marge if he stays with them, which Marge objects to, but Homer, Bart, and Lisa do not. While living with the family, Artie connects with Lisa by reading her The Corrections. He then tries to buy ice cream for Bart and Milhouse, but when his credit card gets cut up, he unsuccessfully attempts to hang himself. Homer gets Artie down and takes him to Moe's.
Marge sees on the news that the SEC is looking for Artie, who is playing poker with Homer and his friends. Homer wins 98% of Ziffcorp's outstanding stock. The SEC sweeps in to arrest Artie, but Homer says he owns 230 million shares of Ziffcorp, making him the majority stockholder. To protect himself, Artie has Homer take the blame. Homer is taken into SEC custody, placed on trial, and ultimately sentenced to ten years in prison. Blaming Artie for this and angered by his selfishness, Marge kicks him out of the house and tells him she never wants to see him ever again.
Visiting Moe's Tavern, Artie encou |
https://en.wikipedia.org/wiki/KDFW | KDFW (channel 4) is a television station licensed to Dallas, Texas, United States, serving as the Fox network outlet for the Dallas–Fort Worth metroplex. It is owned and operated by the network's Fox Television Stations division alongside MyNetworkTV station KDFI (channel 27, also licensed to Dallas). The stations share studios on North Griffin Street in downtown Dallas, while KDFW's transmitter is located in Cedar Hill, Texas.
History
As a CBS affiliate
Times-Herald ownership
On August 20, 1945, the KRLD Radio Corp.—a subsidiary of the now-defunct Dallas Times Herald newspaper, which was headed at the time by Times Herald Printing Co. president Tom C. Gooch—filed an application with the Federal Communications Commission (FCC) for a license and construction permit to operate a commercial television station on VHF channel 2. On August 22, 1946, one year and two days after it filed for the broadcast license, KRLD Radio Corp. amended its application to instead seek assignment on VHF channel 4. (The VHF channel 2 allocation was later reassigned to Denton as part of the FCC's "Sixth Report and Order" in November 1951; it would eventually be assigned to North Texas Public Broadcasting, which signed on KDTN—now a Daystar owned-and-operated station—over that allocation on September 1, 1988.) The FCC Broadcast Bureau granted the license to the Times Herald on September 13, 1946.
The newspaper chose to assign KRLD-TV for use as the television station's call letters; the base KRLD callsign had been used by the Times Herald-owned radio station on 1080 AM – a combined reference to both Edwin J. Kiest, an original investor and one-time owner of the Times Herald, and KRLD (AM), and the radio station's founding owner, Radio Laboratories of Dallas (which changed its name from Dallas Radio Laboratories as it sought the radio permit upon discovering that the KDRL calls had already been assigned for maritime use) – since it signed on its original 1040 AM frequency in October 1926, and applied to its FM sister on 92.5 (now KZPS) upon its March 1948 sign-on.
The station began test broadcasts on November 21, 1949. Channel 4 officially signed on the air, as KRLD-TV, two weeks later on December 3, 1949, at 12:30 p.m., with a short inaugural program featuring speeches from Gooch and KRLD-AM-TV managing director Clyde Rembert dedicating the station's launch, followed by a broadcast of the CBS game show It Pays to Be Ignorant. The first local program aired on the station that day was a college football game in which the Notre Dame Fighting Irish defeated the Southern Methodist Mustangs, 27–20. (The station was originally scheduled to debut on October 1, later pushed back to November 15.) KRLD-TV was the third television station to sign on in the Dallas–Fort Worth metroplex, following Dallas-based KBTV (channel 8, now WFAA) and Fort Worth-licensed WBAP-TV (channel 5, now KXAS-TV), all signing on within a 15-month timeframe. It was also the fourth Texas-based television |
https://en.wikipedia.org/wiki/Acorn%20Business%20Computer | The Acorn Business Computer (ABC) was a series of microcomputers announced at the end of 1983 by the British company Acorn Computers. The series of eight computers was aimed at the business, research and further education markets. Demonstrated at the Personal Computer World Show in September 1984, having been under development for "about a year" and having been undergoing field trials from May 1984, the range "understandably attracted a great deal of attention" and was favourably received by some commentators. The official launch of the range was scheduled for January 1985.
Acorn had stated in a February 1985 press release that the ABC machines would soon be available in 50 stores, but having been rescued by Olivetti, no dealers were stocking the range and only the Personal Assistant and 300 series models were expected to be on display by the end of March. However, the ABC range was cancelled before any of the models were shipped to customers. The ABC 210 was subsequently relaunched as the Acorn Cambridge Workstation in July 1985, and sold in modest numbers to academic and scientific users.
The ABC range was developed by Acorn essentially as a repackaged BBC Micro, expanded to 64 KB RAM, to which was added (in some models) a second processor and extra memory to complement the Micro's 6502. The electronics and disk drives were integrated into the monitor housing, with a separate keyboard.
The Zilog Z80, Intel 80286 and National Semiconductor 32016 were all used as second processors in the various models. Two of the eight models produced, the Personal Assistant and the Terminal, had no second processor.
Origins
As part of the agreement made between Acorn and the BBC to supply a microcomputer to accompany the BBC Computer Literacy Project, Acorn had committed to deliver a business upgrade for the BBC Micro, with Z80-based computers running the CP/M operating system being the established business platform at that time and thus the likely form of any such upgrade. This upgrade was eventually delivered in 1984 as the Z80 Second Processor, requiring a BBC Micro, dual floppy drives and a display to complete a basic business system for a total cost of around £1500. As such, the bundle was not offered as a single, packaged business computer product, unlike a widening range of competing products that could be obtained at such a price.
Various systems had already been proposed by Acorn early in the life of the BBC Micro before the Acorn Business Computer name had been publicly adopted. For instance, the machine that would eventually be known as the ABC 210 was described in mid-1982 in the context of an apparent deal with National Semiconductor, indicating a 1 MB system with hard disks and "Acorn, Unix or Idris operating systems" at an estimated price of around $3500, with a second processor product for the BBC Micro having only 256 KB RAM. The Gluon concept, offering a 32016 second processor solution for the BBC Micro and other microcomputers, featured |
https://en.wikipedia.org/wiki/Peter%20Coveney | Coveney is a Professor of Physical Chemistry, Honorary Professor of Computer Science, and the Director of the Centre for Computational Science (CCS) and Associate Director of the Advanced Research Computing Centre at University College London (UCL). He is also a Professor of Applied High Performance Computing at University of Amsterdam (UvA) and Professor Adjunct at the Yale School of Medicine, Yale University. He is a Fellow of the Royal Academy of Engineering and Member of Academia Europaea. Coveney is active in a broad area of interdisciplinary research including condensed matter physics and chemistry, materials science, as well as life and medical sciences in all of which high performance computing plays a major role. The citation about Coveney on his election as a FREng says: Coveney "has made outstanding contributions across a wide range of scientific and engineering fields, including physics, chemistry, chemical engineering, materials, computer science, high performance computing and biomedicine, much of it harnessing the power of supercomputing to conduct original research at unprecedented space and time scales. He has shown outstanding leadership across these fields, manifested through running multiple initiatives and multi-partner interdisciplinary grants, in the UK, Europe and the US. His achievements at national and international level in advocacy and enablement are exceptional".
Education
Coveney was awarded a Doctor of Philosophy degree from the University of Oxford in 1985 for his work on Semiclassical methods in scattering and spectroscopy.
Career
Coveney has held positions at many of the world's top institutes throughout his academic career spanning over 30 years, including the University of Oxford, Princeton University, Schlumberger and QMUL, and currently holds positions at UCL, UvA and Yale, as well as acting as a Member of several academic councils in the UK and EU.
Books
He has co-authored three popular science books with his long term friend and collaborator, Roger Highfield:
Virtual You
This book, with a foreword by Nobelist Venki Ramakrishnan, is the first popular account of efforts to build digital twins of human beings to usher in a new era of truly personalized and predictive medicine. The Financial Times listed it as a book to read in 2023. Reviews have called Virtual You ‘the most comprehensive and comprehensible account so far’ of human digital twin technology, ‘immensely thought provoking’, with a scope ‘as epic as its vision’.
Frontiers of Complexity
In 1996, Frontiers of Complexity: the search for order in a chaotic world was published with a foreword written by Nobelist Barry Blumberg. The Nobel Laureate Philip Warren Anderson commented: “Arguably the best general book so far on this highly complex subject. I believe firmly, with Coveney and Highfield, that complexity is the scientific frontier."
The Arrow of Time
In 1991, Coveney and Highfield published their first book The Arrow of Time with a f |
https://en.wikipedia.org/wiki/Milestones%20Museum | Milestones Museum of Living History is a museum located on the Leisure Park in Basingstoke, Hampshire, UK. Milestones is made up of a network of streets that have been recreated according to those found in Victorian and 1930s Hampshire.
It was opened on 1 December 2000 by Duke of Edinburgh as a joint project between Hampshire County Council and Basingstoke and Deane Borough Council, supported by the Heritage Lottery Fund.
In the year running 2007/8 the museum received 88,338 visitors.
In 2014, ownership of the Milestones Museum was transferred to the Hampshire Cultural Trust as part of a larger transfer of museums from Hampshire County Council and Winchester City Council.
Exhibits
Buildings
Features include recreations of:
a Victorian public house, the Baverstock Arms, named for a 19th-century Alton brewer. Serves alcoholic refreshments at lunchtime.
a Victorian railway station based on the GWR station at . Features a 4mm scale model of the station with operating trains.
a Victorian Ironmonger
a Victorian watchmaker and jeweller
a Victorian terraced house
a Victorian milliners
a Victorian light engineering shop
a Victorian paintworks, powered by a Tasker stationary steam engine
a Victorian pier amusement arcade
a sawmill
a saddlery
a 1930s town with shops
Cooperative Society shop
sweet shop
toy shop (with original toys)
record and television shop (including original equipment)
Car showroom
1940s period home interiors, kitchen and living room.
A new addition for 2021 is Mr Simpson's Teddy Bear museum, featuring more than 260 examples dating from 1905 onwards.
Many of the shops and workshops feature sound tracks of appropriate conversations and sound effects.
Road vehicles
There is a large collection of road vehicles, notably by local manufacturers, Thornycroft of Basingstoke and Taskers of Andover. These cover examples of human powered, horse drawn, steam and motor driven vehicles.
Human powered
Hand cart
Hand propelled bakers cart.
Grocer's delivery bicycle
2 tradesmens' tricycles
Various bicycles, including penny-farthings
Horse drawn vehicles
Pantechnicon
Governess cart
Brewers dray
Coalman's cart
Milk float
Farm wagon
Stickback undercut gig
Hutchings caravan
Reading type Romany caravan or vardo
Portable steam engine
Steam vehicles
Include two road rollers by Taskers and two by Wallis & Steevens. There are also two Taskers Little Giant traction engines, one displayed with a log trailer.
EL 3908 Thornycroft Steam Wagon, works number 115, built in 1902.
AA 5296 Taskers Little Giant, works number 1599, built in 1914.
SR 1294 Taskers Little Giant, works number 1726, built in 1917.
BD 7994 Taskers road roller, works number 1906, built in 1923.
YB 183 Taskers Little Giant steam lorry, works number 1915, built in 1924.
OT 8201 Taskers road roller, works number 1933, built in 1928.
AA 2470 Wallis & Steevens steam wagon, works number 7279.
OT 3078 Wallis & Steevens Advance road roller, works number 7867 |
https://en.wikipedia.org/wiki/Virtual%20piano | A virtual piano is an application (software) designed to simulate playing a piano on a computer. The virtual piano is played using a keyboard and/or mouse and typically comes with many features found on a digital piano.
Virtual player piano software can simultaneously play MIDI / score music files, highlight the piano keys corresponding to the notes and highlight the sheet music notes.
See also
Synthesia
Scorewriter
List of music software
References
Piano
Music software
Musical composition |
https://en.wikipedia.org/wiki/Apple%20Remote%20Desktop | Apple Remote Desktop (ARD) is a Macintosh application produced by Apple Inc., first released on March 14, 2002, that replaced a similar product called Apple Network Assistant. Aimed at computer administrators responsible for large numbers of computers and teachers who need to assist individuals or perform group demonstrations, Apple Remote Desktop allows users to remotely control or monitor other computers over a network. Mac Pro (2019), Mac mini (M1, 2020) with a 10Gb Ethernet card, and Mac Studio (2022) have Lights Out Management function and are able to power-on by Apple Remote Desktop.
Releases
The original release, which used the User Datagram Protocol (UDP) on port 3283, allowed remote computers (running Mac OS 8.1 or later) to be observed or controlled from a computer running Mac OS X 10.1. It also allowed remote computers to be restarted or shut down, to have their screens locked or unlocked, or be put to sleep or awakened, all remotely. Version 1 also included simple file transfer abilities that would allow administrators to install simple applications remotely; however, to install applications that required the use of an installer, the administrator would have to run the installer manually through the client system's interface.
Version 1.1 (released August 20, 2002) introduced the ability to schedule remote tasks.
Version 1.2 (released April 2, 2003) added a number of features that were designed to ease the administration of a large number of computers. Software could now be installed remotely on a number of machines simultaneously, without using the client system's interface. The startup disk on remote computers can also be changed, setting them to boot from a NetBoot server, a Network Install image, or a partition on their own drives. The client ARD software could also now be upgraded remotely to allow administrators to take advantage of new features without having to visit each individual computer.
Apple released a minor update on December 16, 2003, that brought ARD to 1.2.4. This update concentrated on security, performance and reliability.
On June 21, 2004, Apple announced Apple Remote Desktop 2 (released in July), which was designed to use the VNC protocol instead of Apple's original ARD protocol. This allows the ARD administration software to observe and control any computer running VNC-compatible server software (such as Windows and Unix systems) not just Macs and conversely allowing standard VNC viewing software to connect to any Mac with the ARD 2 software installed and VNC access enabled. This version also uses the Transmission Control Protocol (TCP) for most functions (on ports 5900 and 5988), which is designed to be more reliable than the UDP used in ARD 1. Another significant addition to ARD 2 was the Task List, that allows remote tasks to be queued and monitored, reporting their status (such as Succeeded or Failed). This release also dropped support for older versions of the Mac OS, requiring 10.2.8 or higher.
On Oc |
https://en.wikipedia.org/wiki/My%20Mother%20the%20Carjacker | "My Mother the Carjacker" is the second episode of the fifteenth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on November 9, 2003. In the episode, Homer receives a cryptic message in the newspaper informing him to come to a certain place at midnight, and soon discovers that the person who wrote the message is his mother, Mona Simpson. It was written by Michael Price and directed by Nancy Kruse. Glenn Close makes her second of six guest spots as Homer's mother. It has a direct link from the season seven episode "Mother Simpson". It was nominated for a Writers Guild of America Award in 2004. In its original run, the episode received 12.4 million viewers.
Plot
On Kent Brockman's Channel Six "Oops Patrol" segment, he displays a humorous headline ("Mayor Unveils Erection to Cheering Crowd"), noticed and submitted by Marge, for which she receives a free T-shirt and other perks from the town. An envious Homer, after trying on and stretching out Marge's shirt, attempts to find his own funny headline so he too can win a T-shirt. Homer spends the following night with newspapers plastered over his bedroom wall, exhausting himself in his search. He finds an article entitled "World's Biggest Pizza". The first letters of each line spell out an invitation for Homer to meet someone at Fourth Street Overpass at midnight. He wakes Bart so they can both go. When they reach the overpass, the mystery person reveals herself to be Mona Simpson, Homer's mother.
At the Overpass Diner, Mona explains that the government is still hunting her because of her crime of sabotaging Mr. Burns' germ warfare lab. Her nostalgia aroused by a macaroni pencil case Homer had made for her when he was five, her liberal links at the Springfield Shopper published the story of the giant pizza to lure Homer. Chief Wiggum, Lou, and Eddie arrive at the diner, and Lou recognizes Mona. Waitress Hora lets Homer, Mona, and Bart escape through the back after they increase her tip. After they drive off, Homer rams into the police station, where Mona is arrested. At the trial, during which it is implied by Homer afterwards that Mona's ex-husband Grampa testifies against her, Homer is put on the stand and, after a long clueless pause, gives a heartfelt request that they do not take his mother away from him again. The jury, deeply moved, acquit Mona, much to Burns' fury.
Mona catches up on Homer's missed childhood; giving Homer a bath, watching Homer in the school play, knitting for Homer, teaching Homer how to ride a bike, and seeing a reenactment of the birth of Bart. To make Mona more welcome, Homer steals a whole room from Ned Flanders's house so she can have her own private bedroom. Burns renames his Germ Warfare Laboratory the "Grandma Simpson Peace Museum and Kid-teractive Learnatorium" to a crowd of cheering onlookers. Burns asks Mona to be the first to sign the museum's guest book. However, it is revealed to be a confes |
https://en.wikipedia.org/wiki/AAAA | AAAA may refer to:
Internet and computing
AAAA protocol, within computer security, "authentication, authorization, accounting and auditing" – the AAA protocol combined with auditing
AAAA record, also known as "IPv6 address record", maps a hostname to a 128-bit IPv6 address in the Domain Name System (DNS)
Internet Authentication Service, as an acronym for the four main services provided: Authentication, Authorization, Accounting, and Auditing
Organizations
Associated Actors and Artistes of America, an association of the performer trade unions Actors' Equity, AFTRA, Agma, and Agva
American Association of Advertising Agencies, a U.S. trade association for advertising agencies
Asociación Argentina Amigos de la Astronomía, an amateur astronomy civil association
Australian Automotive Aftermarket Association, an automotive industry association for automotive aftermarket parts
American Association for the Advancement of Atheism, an atheistic and antireligious organization
Anguilla Amateur Athletic Association, former name of the Anguilla Amateur Athletic Federation, governing body for athletics in Anguilla
Other uses
AAAA battery, a 1.5 volt battery, smaller than the AAA size
AaAa, possible reading of the name Aa, an ancient Egyptian architect
AAAA, a rhyme scheme
See also
4A (disambiguation)
A4 (disambiguation)
A (disambiguation)
AA (disambiguation)
AAA (disambiguation)
AAAA Tourist attraction
AAAAA Tourist Attractions of China
AaAaAA!!! – A Reckless Disregard for Gravity |
https://en.wikipedia.org/wiki/List%20of%20countries%20by%20carbon%20dioxide%20emissions | This is a list of sovereign states and territories by carbon dioxide emissions due to certain forms of human activity, based on the EDGAR database created by European Commission and Netherlands Environmental Assessment Agency released in 2018. The following table lists the 1990, 2005 and 2017 annual emissions estimates (in megatonnes of per year) along with a list of calculated emissions per km2 (in tonnes of per year) and emissions per capita (in tonnes of per year).
The data only consider carbon dioxide emissions from the burning of fossil fuels and cement manufacture, but not emissions from land use, land-use change and forestry. Emissions from international shipping or bunker fuels are also not included in national figures, which can make a large difference for small countries with important ports. When carbon dioxide emissions from land-use change are factored in, the majority of carbon emissions since 1905 occurred in Asia, Central and Southern America, reflecting the fact that developed nations cleared their forests in earlier centuries. Land-use factors have contributed nearly a third of total cumulative anthropogenic emissions of carbon dioxide since 1850, and until as recently as 1965 was actually a greater source of emissions than the combustion of fossil fuels and production of cement. The methodology for the calculations is public.
The top 10 largest emitter countries account for 67.6% of the world total. Since 2006, China has been emitting more than any other country. When looking at CO2 emissions per person, China's levels are less than half those of the United States (the next largest source of emissions) and about one-eighth of those of Palau (the biggest emitter per person).
Measures of territorial-based emissions, also known as production-based emissions, do not account for emissions embedded in global trade, where emissions may be imported or exported in the form of traded goods, as it only reports emissions emitted within geographical boundaries. Accordingly, a proportion of the produced and reported in Asia and Eastern Europe is for the production of goods consumed in Western Europe and North America.
According to the review of the scientific literature conducted by the Intergovernmental Panel on Climate Change (IPCC), carbon dioxide is the most important anthropogenic greenhouse gas by warming contribution. The other major anthropogenic greenhouse gases (methane, nitrous oxide (NO) and some fluorinated gases (sulfur hexafluoride (SF), hydrofluorocarbons (HFCs), and perfluorocarbons (PFCs))), are not included in the following list, nor are humans emissions of water vapor (HO), the most important greenhouse gases, as they are negligible compared to naturally occurring quantities. Space-based measurements of carbon dioxide should allow independent monitoring in the mid-2020s.
Per capita emissions
Fossil emissions by country/region
Note: the point is a decimal point, so 1.000 Mt means 1 Mt, i.e. 1,000,000 tonne |
https://en.wikipedia.org/wiki/Lisa%20the%20Skeptic | "Lisa the Skeptic" is the eighth episode of the ninth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on November 23, 1997. On an archaeological dig with her class, Lisa discovers a skeleton that resembles an angel. All of the townspeople believe that the skeleton actually came from an angel, but skeptical Lisa attempts to persuade them that there must be a rational scientific explanation. The episode's writer, David X. Cohen, developed the idea after visiting the American Museum of Natural History, and decided to loosely parallel themes from the Scopes Monkey Trial. The episode also makes allusions to actual hoaxes, such as the Cardiff Giant.
It has been discussed in the context of ontology, existentialism, and skepticism; it has also been used in Christian religious education classes to initiate discussion about angels, science, and faith.
Plot
Homer Simpson attempts to claim a motorboat from a "police raffle" that turns out to be a sting operation. While returning home, the family passes a new mall being built on an area where a number of fossils were found. Lisa Simpson protests and the management allows Springfield Elementary to conduct an archaeological survey. During the excavations, Lisa finds a human skeleton with wings. Springfield's residents are convinced it is the remains of an angel, and Homer cashes in by moving the skeleton into the family's garage, charging visitors to see it.
Lisa remains skeptical and asks scientist Dr. Stephen Jay Gould to test a sample of the skeleton. When Dr. Gould appears at the Simpson house the next day to tell Lisa that the tests were inconclusive, Lisa goes on television to compare the belief in angels to the belief in fictional things, such as leprechauns. In response, Springfield's religious zealots go on a rampage to destroy all scientific institutions. Appalled with the violence, Lisa goes into the garage to destroy the skeleton, but finds that it has disappeared. The mob soon converges on the Simpson household, and Lisa is arrested and put on trial for destroying the skeleton.
Before the trial even begins, the skeleton is seen outside the courtroom. Everyone rushes to it to see a foreboding message added to the skeleton, warning that "The End" will come at sundown. Sunset approaches and the citizens gather around the skeleton, but nothing happens. As Lisa reprimands them, a booming voice from the skeleton silences her and announces, "The End... of high prices!" The skeleton is then hoisted over to the entrance of the new Heavenly Hills Mall. Lisa realizes the whole event was a publicity stunt for the mall, and criticizes management for taking advantage of peoples' beliefs. She attempts to boycott them, but the bargain-loving public shrugs off the exploitation and goes shopping, while Dr. Gould confesses that he never actually tested the sample. Marge observes that while it was talking, Lisa believed the angel was real. She |
https://en.wikipedia.org/wiki/Command%20verb | In human–computer interaction, a command verb is a verb that appears in a user interface and is used for the user to tell the computer to do something (rather than vice versa). For instance, the words "edit" and "view" and "help" that appear in the Web browser menu are all clearly verbs. Other items such as "file" or "favorites" or "tools" are nouns, but the verb appears in the submenu, for instance, "save", "open", "send", "treat", "add to", or "organize".
A Web page typically includes a few such verbs also, typically including "search", "log in" and perhaps "edit this page".
A reflexive user interface is one in which commands and perhaps other controls are defined in the interface itself.
User interfaces |
https://en.wikipedia.org/wiki/Windows%20ChallengE | Windows ChallengE was a programming competition run by Microsoft Corporation. The contest is composed of teams of 3 or 4 students at colleges/universities from around the world, along with a faculty mentor. The only requirement of the contest is that the teams utilize the hardware provided to them (an eBoxII from ICOPTech), as well as build a customized image of the Windows CE operating system.
The first Windows ChallengE was held in 2004, consisting of less than 30 teams within the United States. The goal was to use Windows CE to "Make the World a Safer Place". James Madison University won the contest, led by students Marcus O'Malley, Joshua Blake, Justin Creasy and Kevin Ferrell. Computer science professor Ramon A. Mata-Toledo served as team adviser. Their winning project was an airport security checkpoint device designed to help protect the millions of people who fly daily. The mobile handheld device collects information from a passenger's boarding pass and uses a chemical sniffer to sense and identify potential high-security risks posed by baggage or passengers.
In 2005, it was opened to the rest of the world. 278 teams from all over the world participated. The winner of the 2005 contest was the team from the Royal Melbourne Institute of Technology (RMIT), Australia, with the "EverGreen" project.
In 2006 more than 300 teams registered for the contest. The final was held in Redmond, WA, at the Microsoft Campus. In the finals only 20 teams participated, among which only 12 made it to the last day of the competition. The 44Tech team of Romania won the contest with their project "Forest Watcher". That team was composed of Cristian Pop, Ioana Bratie, Omar Choudary and Mircea Gheorghe.
In 2007 the contest became part of the Imagine Cup. Imagine Cup is a bigger competition, also organized by Microsoft, which is composed of several competition tracks, including algorithms, photography, embedded software.
References
Microsoft events |
https://en.wikipedia.org/wiki/Allen%20Boothroyd | Allen Boothroyd M Des RCA, FSCD, FRSA (1943–2020) was a British industrial designer of consumer electronics, best known for the Lecson amplifiers, BBC Microcomputer and co-founder of Meridian Audio.
Career
Inspired by his Meccano set, Allen knew from an early age that he wanted to design mechanical objects. He went to Merchant Taylors’ school and, after a foundation year at Hornsey College of Art, went on to study Art and Design at Manchester. On graduating he obtained a scholarship to the Industrial Design department at the Royal College of Art in London. During his time there, he designed hoppers for moving books around in a bookshop, a hospital bed, a parking meter, and received a prize for his pushchair design. He was a great admirer of the designers and architects of the Bauhaus, notably Walter Gropius who designed the Dessau Art School, and Mies van der Rohe whose adage, ‘less is more’, Allen adhered to and often quoted.
When Allen graduated from the Royal College of Art. in the 1960s, not many people knew what an industrial designer did. He was always at pains to explain that it was not just a question of the product's appearance: it encompassed all the production engineering and mechanical stages to take a product from concept to market. He was a talented draftsman and, for most of his professional life, Allen's designs were produced by hand, with 3D visuals as well as detailed engineering drawings.
On graduation, he joined Hulme Chadwick and Partners, an architectural and design practice. His work there included the design of a new corporate identity for Bass Charrington.
Designs
Together with Bob Stuart, an award-winning electronics engineer, they designed the Lecson AC1 pre-amp and AP1 power amplifier which they produced in 1974. The Lecson hi-fi is now in the permanent collections of the Victoria and Albert Museum, London and the Museum of Modern Art, New York. It also earned them their first British Design Council Award in 1974.
Allen joined Cambridge Consultants Ltd in 1972 to set up their Industrial Design division. One of his designs was an electric bicycle, which was the winner of the Prince Philip Designers Prize.
In 1981, he provided the case design for the BBC Micro, the computer used in the BBC’s Computer Literacy Project. He also worked on the design for the Acorn RiscPC computer.
Meanwhile, Bob had also moved to Cambridge and together he and Allen founded Boothroyd Stuart Meridian (later Meridian Audio Ltd). They designed, manufactured, and sold the entire product range themselves, with very little investment. Allen and Bob received their second Design Council Award for the company's 100 Series in 1982. In 1986, a new line – the 200 Series – was launched and continued to be produced until 1993 when it was replaced by the 500 Series. It grew to include the whole range of domestic hi-fi, from CD players, radio tuners, pre-amplifiers, power amplifiers, digital-to-analogue converters, and a range of multi-room compo |
https://en.wikipedia.org/wiki/Nat%20Goldhaber | A. Nathaniel ("Nat") Goldhaber is an American venture capitalist, computer entrepreneur and politician. Goldhaber helped found Maharishi International University and was special assistant to lieutenant governor William Scranton III and founder and chief executive of TOPS, a computer networking company. He served as president of the venture capital firm Cole Gilburne Goldhaber & Ariyoshi Management and was the founding CEO of CyberGold, an Internet marketing company that became a public stock offering in 1999. He was the 2000 U.S. Vice President candidate for the Natural Law Party and serves as the managing director of Claremont Creek Ventures, an investment firm.
Education
Goldhaber received a BA in interdisciplinary studies from Maharishi International University and an MA in Education from the University of California, Berkeley.
In June 2013 he received an PhD (H. C.) from Maharishi University of Management. Goldhaber is an emeritus member of the Executive Board of the College of Letters and Science at UC Berkeley.
Goldhaber is a private and part 135 pilot and holds an Airline Transport Pilot License (twin, instrument, with ratings for CE525S (CitationJet single-pilot) and a CE750 PIC (Citation X Jet Pilot in Command).
Career
In the 1960s, Goldhaber became interested in meditation and worked directly with Maharishi Mahesh Yogi, the founder of the Transcendental Meditation technique. In 1971, Goldhaber helped establish Maharishi International University, an accredited institution in Fairfield, Iowa, In 1976, he wrote TM: an Alphabetical Guide to the Transcendental Meditation Program with Denise Denniston and Peter McWilliams.
From 1979 to 1982, Goldhaber worked in Pennsylvania politics as special assistant to the lieutenant governor William Scranton III and later as the interim director of the state's energy agency. Goldhaber left government to build a career in high technology and founded his first company, Centram Systems Inc., which developed networking for personal computers. Goldhaber was founder and chief executive of TOPS, a computer networking company which Goldhaber sold to Sun Microsystems in 1987 for $20 million. Goldhaber then served as Vice President of Sun Microsystems. Centram Systems product, called TOPS ("Transcendental Operating System"), allowed transparent file sharing among Macs, PCs, and Unix machines, using the AppleTalk protocol.
In 1989, Goldhaber became the president of Cole Gilburne Goldhaber & Ariyoshi Management, a venture capital firm specializing in high technology for computers. In 1992, IBM and Apple Computer Inc. appointed Goldhaber as president and founding CEO of their joint multi-media venture, Kaleida Labs. In 1995, Goldhaber became the founding CEO of Cybergold, an Internet marketing and payment system which went public in 1999 and was acquired by MyPoints.com, Inc. in August 2000 in a stock-for-stock deal worth approximately $160 million.
Goldhaber was the Natural Law Party nominee for vice presiden |
https://en.wikipedia.org/wiki/Acorn%20Online%20Media%20Set%20Top%20Box | The Acorn Online Media Set Top Box was produced by the Online Media division of Acorn Computers Ltd for the Cambridge Cable and Online Media Video on Demand trial and launched early 1996. Part of this trial involved a home-shopping system in partnership with Parcelforce.
The hardware was trialled by NatWest bank, as exhibited at the 1995 Acorn World trade show.
Specification
STB1
The STB1 was a customised Risc PC based system, with a Wild Vision Movie Magic expansion card in a podule slot, and a network card based on Asynchronous Transfer Mode.
Memory: 4 MiB RAM
Processor: ARM 610 processor at 33 MHz; approx 28.7 MIPS
Operating system: RISC OS 3.50 held in 4 MiB ROM
STB20
The STB20 was a new PCB based around the ARM7500 System On Chip.
Memory:
Processor: ARM7500 processor
Operating system: RISC OS 3.61, a version specific for this STB, held in 4 MiB ROM.
STB22
By this time Online Media had been restructured back into Acorn Computers, so the STB22 is branded as 'Acorn'.
Memory:
Processor:
Operating system: a development of RISC OS held in 4 MiB ROM
References
External links
The Full Acorn Machine List: STB
Computer-related introductions in 1996
Online Media Set Top Box
Legacy systems
Set-top box |
https://en.wikipedia.org/wiki/Acorn%20Network%20Computer | The Acorn Network Computer was a network computer (a type of thin client) designed and manufactured by Acorn Computers Ltd. It was the implementation of the Network Computer Reference Profile that Oracle Corporation commissioned Acorn to specify for network computers (for more detail on the history, see Acorn's Network Computer). Sophie Wilson of Acorn led the effort. It was launched in August 1996.
The NCOS operating system used in this first implementation was based on RISC OS and ran on ARM hardware. Manufacturing obligations were achieved through a contract with Fujitsu subsidiary D2D.
In 1997, Acorn offered its designs at no cost to licensees of .
Hardware models
Original model
The NetStation was available in two versions, one with a modem for home use via a television, and a version with an Ethernet card for use in businesses and schools with VGA monitors and an on-site BSD Unix fileserver based on RiscBSD, an early ARM port of NetBSD. Both versions were upgradable, as the modem and Ethernet cards were replaceable "podules" (Acorn-format Eurocards). The home version was trialled in 1997/98 in conjunction with BT.
The and both used the and supported PAL, NTSC and SVGA displays. They had identical specifications. The used a StrongARM SA-110 200 MHz processor. The ARM7500-based DeskLite was launched in 1998.
StrongARM
Acorn continued to produce ARM-based designs, demonstrating its first StrongARM prototype in May 1996, and the 6 months later. This evolved into the CoNCord, launched in late 1997.
New markets
Further designs included the Set-top Box NC (), the , and the .
Later versions
The second generation Network Computer operating system was no longer based on RISC OS. NC Desktop, from Oracle subsidiary Network Computer Inc., instead combined NetBSD and the X Window System, featuring desktop windows whose contents were typically described using HTML, reminiscent of (but not entirely equivalent to) the use of Display PostScript in NeXTStep. The product ran on ARM, StrongARM and x86 architectures and could be run on traditional personal computers. NC Desktop was the recommended software solution for products based on the StrongARM-based Digital Network Appliance Reference Design (DNARD). Later NCs were produced based on the Intel Pentium architecture such as products from Accton Technology Corporation and UMAX Data Systems.
Usage
The NetStation was planned to ship with a smart card to enable internet banking.
See also
Mac NC
References
External links
The Full Acorn Machine List: NC
Network Computer
Network computer (brand) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.