source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Timothy%20J.%20Hickey | Timothy J. Hickey (born July 24, 1955) is a professor of computer science and former Chair of the Computer Science and Internet Studies Program (INET) at Brandeis University.
Hickey's specialties include analysis of algorithms, logic programming and parallel processing, symbolic manipulation, and groupware. His current research involved the study of Educational Technology, Brain-Computer Interfaces and Game-based Learning. He is the co-creator and lead developer of the JScheme programming language and the GrewpEdit collaborative editor.
Hickey graduated summa cum laude with a B.A. in Mathematics from Brandeis University and holds an M.S. and Ph.D. in Mathematics from the University of Chicago.
References
External links
Professor Hickey's website
GrewpEdit website
JScheme website
Brandeis University faculty
American computer scientists
Brandeis University alumni
1955 births
Living people
University of Chicago alumni |
https://en.wikipedia.org/wiki/NLS%20%28computer%20system%29 | NLS, or the "oN-Line System", was a revolutionary computer collaboration system developed in the 1960s. Designed by Douglas Engelbart and implemented by researchers at the Augmentation Research Center (ARC) at the Stanford Research Institute (SRI), the NLS system was the first to employ the practical use of hypertext links, the mouse, raster-scan video monitors, information organized by relevance, screen windowing, presentation programs, and other modern computing concepts. It was funded by ARPA (the predecessor to Defense Advanced Research Projects Agency), NASA, and the US Air Force.
Development
Douglas Engelbart developed his concepts while supported by the US Air Force from 1959 to 1960 and published a framework in 1962.
The strange acronym, NLS (rather than OLS), was an artifact of the evolution of the system. Engelbart's first computers were not able to support more than one user at a time.
First was the CDC 160A in 1963, which had very little programming power of its own.
As a short-term measure, the team developed a system that allowed off-line users—that is, anyone not sitting at the one available terminal—to edit their documents by punching a string of commands onto paper tape with a Flexowriter. Once the tape was complete, an off-line user would then feed into the computer the paper tape on which the last document draft had been stored, followed by the new commands to be applied, and the computer would print out a new paper tape containing the latest version of the document. Without interactive visualization, this could be awkward, since the user had to mentally simulate the cumulative effects of their commands on the document text. On the other hand, it matched the workflow of the 1960s office, where managers would give marked-up printouts of documents to secretaries.
The design continued to support this "off-line" workflow, as well as an interactive "on-line" ability to edit the same documents. To avoid having two identical acronyms (OLTS), the Off-Line Text System was abbreviated FLTS and the On-Line Text System was abbreviated NLTS. As the system evolved to support more than just text, the "T" was dropped, and the interactive version became known as NLS.
Robert Taylor, who had a background in psychology, provided support from NASA. When Taylor moved to the Information Processing Techniques Office of the US Defense Department's Advanced Research Projects Agency, he was able to provide additional funding to the project.
NLS development moved to a CDC 3100 in 1965.
Jeff Rulifson joined SRI in 1966 and became the lead programmer for NLS until leaving the organization in 1973.
In 1968, NLS development moved to an SDS 940 computer running the Berkeley Timesharing System.
It had an approximately 96 MB storage disk and could support up to 16 workstations, each comprising a raster-scan monitor, a three-button mouse, and an input device known as a chord keyset. Typed text was sent from the keyset to a specific subsystem that relayed the |
https://en.wikipedia.org/wiki/VAXBI%20bus | The VAXBI bus (VAX Bus Interconnect bus) is a computer bus designed and sold by the Digital Equipment Corporation (DEC) of Maynard, Massachusetts.
The bus is an advanced, configuration-free synchronous bus used on DEC's later VAX computers. Like the Unibus and Q-Bus before it, it uses memory-mapped I/O but has 32-bit address and data paths. The VAXBI is a multiplexed bus with fully distributed arbitration and geographic addressing.
All of the logic required to implement a VAXBI interface is contained within a single custom integrated circuit (the "BIIC") and the physical layout and printed wiring board layout for compliant cards is tightly specified, right down to the location of the dual amber status LEDs that are required. The portion of the card that is reserved for the bus interface is referred to as "the VAXBI corner". VAXBI licensees were given the appropriate engineering drawings to allow them to exactly replicate a compliant card.
VAXBI cards mount into backplanes using a ZIF connector; depending on the backplane design, cards can be loaded from the top or the front side of the backplane. No cable connections are permitted on the cards; all connections are made via three uncommitted rows of backplane connectors. Similarly, no configuration jumpers are permitted on the cards; all setup is done by jumpers inserted on the backplane connectors or via software configuration.
Originally conceived by its engineers to be an open bus, it was forced to be a tightly licensed bus by Digital's marketing and management, and was not nearly as successful as had originally been hoped-for.
It is used in the VAX 6000, VAX 8000 (82xx, 83xx, 85xx, 87xx, 88xx models) and the VAX 9000 systems and also on the MIPS R3000 based DECsystem 5800 series.
A PDP-11 implementation (the PDP-11/27) was envisioned but never advanced beyond the concept stage.
References
Computer buses
DEC hardware |
https://en.wikipedia.org/wiki/Global%20Infectious%20Disease%20Epidemiology%20Network | Global Infectious Diseases and Epidemiology Online Network (GIDEON) is a web-based program for decision support and informatics in the fields of Infectious Diseases and Geographic Medicine. Due to the advancement of both disease research and digital media, print media can no longer follow the dynamics of outbreaks and epidemics as they emerge in "real time." As of 2005, more than 300 generic infectious diseases occur haphazardly in time and space and are challenged by over 250 drugs and vaccines. 1,500 species of pathogenic bacteria, viruses, parasites and fungi have been described. GIDEON works to combat this by creating a diagnosis through geographical indicators, a map of the status of the disease in history, a detailed list of potential vaccines and treatments, and finally listing all the potential species of the disease or outbreak such as bacterial classifications.
Organization
GIDEON consists of four modules. The first Diagnosis module generates a Bayesian ranked differential diagnosis based on signs, symptoms, laboratory tests, country of origin and incubation period – and can be used for diagnosis support and simulation of all infectious diseases in all countries. Since the program is web-based, this module can also be adapted to disease and bioterror surveillance.
The second module follows the epidemiology of individual diseases, including their global background and status in each of 205 countries and regions. All past and current outbreaks of all diseases, in all countries, are described in detail. The user may also access a list of diseases compatible with any combination of agent, vector, vehicle, reservoir and country (for example, one could list all the mosquito-borne flaviviruses of Brazil which have an avian reservoir). Over 30,000 graphs display all the data, and are updated in "real time". These graphs can be used for preparation of PowerPoint displays, pamphlets, lecture notes, etc. Several thousand high-quality images are also available, including clinical lesions, roentgenograms, Photomicrographs and disease life cycles.
The third module is an interactive encyclopedia which incorporates the pharmacology, usage, testing standards and global trade names of all antiinfective drugs and vaccines.
The fourth module is designed to identify or characterize all species of bacteria, mycobacteria and yeasts. The database includes 50 to 100 taxa which may not appear in standard texts and laboratory databases for several months.
Additional options allow users to add data (in their own font / language) relevant to their own institution, electronic patient charts, material from the internet, important telephone numbers, drug prices, antimicrobial resistance patterns, etc. This form of custom data is particularly useful when running GIDEON on institutional networks. The data in GIDEON are derived from:
all peer-reviewed journals in the fields of Infectious Diseases, Pediatrics, Internal Medicine, Tropical Medicine, Travel Medicine |
https://en.wikipedia.org/wiki/Windows%20on%20Windows | In computing, Windows on Windows (commonly referred to as WOW) was a compatibility layer of 32-bit versions of the Windows NT family of operating systems since 1993 with the release of Windows NT 3.1, which extends NTVDM to provide limited support for running legacy 16-bit programs written for Windows 3.x or earlier. There is a similar subsystem, known as WoW64, on 64-bit Windows versions that runs 32-bit programs.
This subsystem is not available in 64-bit editions since Windows 11 (including Windows Server 2008 R2 and later, which only have 64-bit editions) and therefore cannot run 16-bit software without third-party emulation software (e.g. DOSBox). Windows 10 is the final version of Windows to include this subsystem.
This subsystem has since been discontinued, as Windows 11 dropped support for 32-bit processors.
Background
Many 16-bit Windows legacy programs can run without changes on newer 32-bit editions of Windows. The reason designers made this possible was to allow software developers time to remedy their software during the industry transition from Windows 3.1x to Windows 95 and later, without restricting the ability for the operating system to be upgraded to a current version before all programs used by a customer had been taken care of.
The Windows 9x series of operating systems, reflecting their roots in DOS, functioned as hybrid 16- and 32-bit systems in the sense that the underlying operating system was not truly 32-bit, and therefore could run 16-bit software natively without requiring any special emulation; Windows NT operating systems differ significantly from Windows 9x in their architecture, and therefore require a more complex solution. Two separate strategies are used in order to let 16-bit programs run on 32-bit versions of Windows (with some runtime limitations). They are called thunking and shimming.
Thunking
The WOW subsystem of the operating system in order to provide support for 16-bit pointers, memory models and address space.
All 16-bit programs run by default in a single virtual DOS machine with shared memory space. However, they can be configured to run in their own separate memory space, in which case each 16-bit process has its own dedicated virtual machine. The separate memory space increases system stability by preventing buggy 16-bit programs from interfering with one another, at the expense of reduced 16-bit inter-process communication and increased memory utilization.
The WOWEXEC.EXE process on a Windows NT system facilitates Windows-on-Windows. In addition to Windows-on-Windows emulating the Windows 95 and Windows 98 kernels, the WIN.COM file emulates a Windows 3.x kernel for NTVDM, which runs the 16-bit DOS-based Windows applications on Windows NT.
Shimming
Application compatibility issues, notably around long filenames, multiple users and the concept of least privilege, may prevent some applications from working. For example, they may incorrectly assume full write access to the whole file syst |
https://en.wikipedia.org/wiki/Digital%20identity | Digital identity refers to the information utilized by computer systems to represent external entities, including a person, organization, application, or device. When used to describe an individual, it encompasses a person's compiled information and plays a crucial role in automating access to computer-based services, verifying identity online, and enabling computers to mediate relationships between entities. Digital identity for individuals is an aspect of a person's social identity and can also be referred to as online identity.
The widespread use of digital identities can include the entire collection of information generated by a person's online activity. This includes usernames, passwords, search history, birthday, social security number, and purchase history. When publicly available, this data can be used by others to discover a person's civil identity. It can also be harvested to create what has been called a "data double", an aggregated profile based on the user's data trail across databases. In turn, these data doubles serve to facilitate personalization methods on the web and across various applications.
If personal information is no longer the currency that people give for online content and services, something else must take its place. Media publishers, app makers, and e-commerce shops are now exploring different paths to surviving a privacy-conscious internet, in some cases overturning their business models. Many are choosing to make people pay for what they get online by levying subscription fees and other charges instead of using their personal data.
An individual's digital identity is often linked to their civil or national identity and many countries have instituted national digital identity systems that provide digital identities to their citizenry.
The legal and social effects of digital identity are complex and challenging. Faking a legal identity in the digital world may present many threats to a digital society and raises the opportunity for criminals, thieves, and terrorists to commit various crimes. These crimes may occur in either the online world, real world, or both.
Background
A critical problem in cyberspace is knowing with whom one is interacting. Using only static identifiers such as passwords and email, there is no way to precisely determine the identity of a person in cyberspace because this information can be stolen or used by many individuals acting as one. Digital identity based on dynamic entity relationships captured from behavioral history across multiple websites and mobile apps can verify and authenticate identity with up to 95% accuracy.
By comparing a set of entity relationships between a new event (e.g., login) and past events, a pattern of convergence can verify or authenticate the identity as legitimate whereas divergence indicates an attempt to mask an identity. Data used for digital identity is generally anonymized using a one-way hash, thereby avoiding privacy concerns. Because it is based o |
https://en.wikipedia.org/wiki/Bhoja%20Air | Bhoja Air () was a Pakistani airline based in Karachi, Sindh, Pakistan.
The airline was founded in 1993 and operated a small domestic network of scheduled passenger flights. Due to financial difficulties, the airline completely suspended operations between 2000 and 2012. After a brief re-launch, and the subsequent crash of Bhoja Air Flight 213 on the day of the re-launch, Bhoja Air lost its operational license and ceased operations for the final time in July 2012.
History
On 7 November 1993, Bhoja Air started operations on domestic routes between Karachi, Lahore and Quetta with a dry leased Boeing 737-200. It was registered in Pakistan, making Bhoja the first private airline in the country to operate a Western manufactured aircraft. Bhoja Air is a privately owned airline of the Bhoja Group of Companies with its head office at Shahrah–e-Liaquat, Karachi and corporate offices at KDA Scheme No 1. In 1996, it signed a deal with the handling agent group OGDENS with complete ground handling equipment at Karachi, capable of handling Boeing 747s.
In the same year another sister company, Pakistan Aviators and Aviation located at Allama Iqbal International Airport, Lahore was purchased, along with a hotel for passenger stop-overs.
On 24 January 1998 Bhoja Air commenced international flights from Karachi to Dubai where Mr Saleem Ahmad Kashmiri was given charge of the airline operations in the Gulf. Later, Bhoja Air operated flights to the U.A.E. from all major cities of Pakistan. However, due to financial difficulties, Bhoja Air suspended its operations in 2000, although its airline licence issued by CAA – Pakistan remained valid and it maintained a fully functional headquarters office in Karachi and a flight ops and camp office at Karachi Jinnah International.
The airline became active again during late 2011, and on 6 March 2012, they operated their first flight in twelve years.
The airline was sold by its former owner and Chairman Mr. M. Farooq Omar Bhoja to M. Arshad Jalil. Under the new ownership structure, 80% shares of Bhoja Air were owned by its Managing Director M. Arshad Jalil, whilst the rest were owned by his wife Mrs. Naz Jalil, his son Mr. Umar Jalil and three other people including its former owner Mr. M. Farooq Omar Bhoja.
Among the minority shareholders Mr. M. Farooq Bhoja owned only five percent of the shares, the remaining shares belong to two directors, Mr. Mazhar Hussain and Mr. Zeeshan Kirmani.
However, on 20 April, a Bhoja Air flight from Karachi to Islamabad crashed, killing all 127 passengers and crew aboard and completely destroying the aircraft.
Closure
Following the crash of Flight 213, the airline fully suspended operations for a second time on 22 April, just six weeks after their relaunch. The crash reduced their fleet size from three to two aircraft, thus, Bhoja Air were in breach of Pakistani law, which requires airlines to have at least three aircraft; Bhoja Air had lost one in the crash of Flight 213, a second was |
https://en.wikipedia.org/wiki/Laoag%20International%20Airlines | Laoag International Airlines was an airline based in the Philippines. It shut down when one of its aircraft, Flight 585 crashed in Manila Bay in 2002.
Code data
Laoag International Airlines Code Data.
IATA Code: L7
ICAO Code: LPN
Callsign: Laoag Air
Destinations
Laoag, Ilocos Norte
Manila
Basco, Batanes
Cebu City, Cebu
Tacloban, Leyte
Tuguegarao, Cagayan
References
Defunct airlines of the Philippines
Airlines established in 1995
Airlines disestablished in 2002
Laoag
Philippine companies established in 1995
2002 disestablishments in the Philippines |
https://en.wikipedia.org/wiki/Softcatal%C3%A0 | Softcatalà is a non-profit association that promotes the use of the Catalan language on computing, Internet and new technologies. This association consists of computer specialists, philologists, translators, students and all kind of volunteers that work in the field of translating software into Catalan, in order to preserve this language in the English-controlled software environment. They also offer several linguistic tools to help users improve their language knowledge.
History
Softcatalà was born in 1997 as a group of volunteers with the aim of improving the presence of Catalan in new technologies. The first step was to translate the most important free and/or open-source software based programs (OpenOffice.org, Firefox, etc.) into Catalan. After that, they delivered some other projects, including the following ones:
1,500 English-Catalan words glossary for software translation.
Software translation style guide
Translation memory with more than 40,000 entries (including translations made by Softcatalà)
Spell-checker
Collaborations
During this last years, Softcatalà has collaborated with the terminology centre TERMCAT standardizing new Catalan terms related to new technologies.
In 2001, they started collaborating with Google, and that permitted the translation of the interface and later, the participation in the adaptation of the search engine related to Catalan pages.
They have also worked on the popularization of Linux, translating GNOME and some installation and configuration tools of Mandriva and Fedora.
Web-page
The main Internet site for Softcatalà is only available in Catalan. It offers all the information about the group and explains its reasons and objectives.
The web page consists of six different sections:
Pantry: Links to software resources organized in different sections (Internet, multimedia, image, language…) for Windows, Linux and Mac.
Forums: Forums focused on solving doubts related to the language used by programmers.
Spell-checker: On-line spell-checker available in general Catalan and also in Valencian. It only corrects orthographic mistakes.
Translator: Ruled-based machine translator based on the technology by Apertium and Scale MT. It offers the chance of translating from Catalan to Spanish and vice versa. There are also new versions which are being tested (French, English, Portuguese, Aranese Occitan and Aragonese to Catalan and vice versa).
Lists: some mail lists belonging to llistes.softcatala.org.
Projects: Projects in which Softcatalà is involved, including OpenOffice.org, Mozilla, GNOME, Ubuntu, Open Thesaurus-ca…
References
External links
Softcatalà web site (Catalan)
Official Twitter account
Official Telegram channel
Official GitHub repo
Free software
Non-profit organisations based in Spain
Catalan advocacy organizations |
https://en.wikipedia.org/wiki/Delegation%20%28disambiguation%29 | Delegation is the assignment of any responsibility or authority to another person.
Delegation may also refer to:
Delegation (band), a British soul musical group 1975–1999
Delegation (computing), passing of something from one entity to another
Delegation (computer security), handing a user's authentication credentials to another user
Delegation (law), in contract law, the act of giving another person the responsibility of carrying out agreed performance
Delegation (object-oriented programming), evaluating a member of one object in the context of another
Delegations of Tunisia, second-level administrative subdivisions
The Delegation, a 2018 Albanian film
See also
Delegate (disambiguation)
Delegation theory
Subsidiarity
Subsidiarity (European Union)
Subsidiarity (Catholicism)
Devolution
Municipalities of Mexico City, or delegaciones |
https://en.wikipedia.org/wiki/Unreal%203 | Unreal 3 may refer to:
Unreal Tournament 3, a multiplayer video game by Epic Games
Unreal Engine 3, a computer game engine developed by Epic Games |
https://en.wikipedia.org/wiki/Thread-local%20storage | In computer programming, thread-local storage (TLS) is a memory management method that uses static or global memory local to a thread.
While the use of global variables is generally discouraged in modern programming, legacy operating systems such as UNIX are designed for uniprocessor hardware and require some additional mechanism to retain the semantics of pre-reentrant APIs. An example of such situations is where functions use a global variable to set an error condition (for example the global variable errno used by many functions of the C library). If errno were a global variable, a call of a system function on one thread may overwrite the value previously set by a call of a system function on a different thread, possibly before following code on that different thread could check for the error condition. The solution is to have errno be a variable that looks like it is global, but in fact exists once per thread—i.e., it lives in thread-local storage. A second use case would be multiple threads accumulating information into a global variable. To avoid a race condition, every access to this global variable would have to be protected by a mutex. Alternatively, each thread might accumulate into a thread-local variable (that, by definition, cannot be read from or written to from other threads, implying that there can be no race conditions). Threads then only have to synchronise a final accumulation from their own thread-local variable into a single, truly global variable.
Many systems impose restrictions on the size of the thread-local memory block, in fact often rather tight limits. On the other hand, if a system can provide at least a memory address (pointer) sized variable thread-local, then this allows the use of arbitrarily sized memory blocks in a thread-local manner, by allocating such a memory block dynamically and storing the memory address of that block in the thread-local variable. On RISC machines, the calling convention often reserves a thread pointer register for this use.
Windows implementation
The application programming interface (API) function TlsAlloc can be used to obtain an unused TLS slot index; the TLS slot index will then be considered 'used'.
The TlsGetValue and TlsSetValue functions are then used to read and write a memory address to a thread-local variable identified by the TLS slot index. TlsSetValue only affects the variable for the current thread. The TlsFree function can be called to release the TLS slot index.
There is a Win32 Thread Information Block for each thread. One of the entries in this block is the thread-local storage table for that thread.
TlsAlloc returns an index to this table, unique per address space, for each call. Each thread has its own copy of the thread-local storage table. Hence, each thread can independently use TlsSetValue(index) and obtain the specified value via TlsGetValue(index), because these set and look up an entry in the thread's own table.
Apart from TlsXxx function family, Window |
https://en.wikipedia.org/wiki/Fun%20House%20%28American%20game%20show%29 | Fun House is an American children's television game show that aired from September 5, 1988, to April 13, 1991. The first two seasons aired in daily syndication, with the Fox network picking it up and renaming it Fox's Fun House for its third and final season.
The format of Fun House was similar to that of Nickelodeon game show Double Dare, which was being produced for syndication at the time and which became a primary competitor for ratings. Two teams of children answered questions and played messy games, competing for a chance to run an obstacle course and win cash and prizes. The course was modeled after the funhouse attractions seen in carnivals and amusement parks, from which the series took its title.
The show was hosted for its entire run by J. D. Roth. John "Tiny" Hurley was the original announcer and appeared on the first two seasons in syndication. Michael "Boogaloo Shrimp" Chambers, a famous breakdancer turned actor, replaced him when the show moved to Fox and took on the name "MC Mike". Identical twin sisters Jacqueline and Samantha Forrest ("Jackie" and "Sammi", respectively) served as the show's cheerleaders.
The show was created by Bob Synes, a veteran producer of game shows who previously worked on Let's Make a Deal and had created several other programs of his own, with Synes and Scott A. Stone serving as executive producers.
Fun House was initially a co-production of Stone Television and Lorimar-Telepictures, the latter of which took on the role of distributor. From the second season onward, Lorimar Television became the co-producer and Warner Bros. Domestic Television Distribution the syndicator. After Bob Synes died in 1990, Scott Stone replaced him with David G. Stanley and his production company then took on the name of Stone Stanley Productions, a name which it kept until the company dissolved.
British Knights sponsored the show during its first two seasons, replaced by LA Gear for the third. Everyone appearing onstage wore a pair of the sponsoring company's shoes.
A year after the show premiered, a spinoff series called College Mad House was created. Premiering in 1989 and running in weekly syndication for one season, it was hosted by Greg Kinnear and featured teams of college students from various universities around the United States competing against each other.
Gameplay
Two new teams, consisting of one boy and girl a piece, competed on each episode. One team wore gold uniforms and was cheered by Jackie, while the other wore red and was supported by Sammi.
Stunt rounds
Three stunts/games were played on each episode. Participants had to undertake challenges such as answering questions, finding requested items, and assembling devices, and frequently ended up covered in disgusting materials such as slime or garbage. Some stunts were races against time or to be the first to complete an objective, while in others each team took turns; in those instances, Roth tossed a giant coin and whatever color it landed on determi |
https://en.wikipedia.org/wiki/Procedural%20surface | In computer graphics, a procedural surface is a representation of a surface as a mathematical implicit equation, rather than an explicit representation.
An explicit representation, for example, describes a line as the straight segment going through two given points. A procedural surface is one which is defined as a procedure.
For example, in CAD/Computer-aided manufacturing milling applications, an offset surface is a procedural representation because it is defined as the surface which is a fixed distance from another surface. Another well-known procedural edge on a 3D body is the silhouette edge. This edge is defined as the collection of points on a surface whose outwards surface normal is perpendicular to the view vector.
Another example of a procedural surface is a Blob as illustrated in movies like The Abyss in the scene where the creature made up of water reaches out and touches the character. The surface is defined as a surface which exists when two or more control points are oriented in such a way as to make the contribution potential exceed a certain threshold. Such procedural surfaces require far more processing to calculate, and for this reason are often used in pre-rendered rather than real-time applications.
This approach is commonly used by structural chemists and was defined by van der Waals when defining a region of space where the electric charge equipotential surface had a definite value.
Computer graphics data structures |
https://en.wikipedia.org/wiki/Biomedical%20cybernetics | Biomedical cybernetics investigates signal processing, decision making and control structures in living organisms. Applications of this research field are in biology, ecology and health sciences.
Fields
Biological cybernetics
Medical cybernetics
Methods
Connectionism
Decision theory
Information theory
Systeomics
Systems theory
See also
Cybernetics
Prosthetics
List of biomedical cybernetics software
References
Kitano, H. (Hrsg.) (2001). Foundations of Systems Biology. Cambridge (Massachusetts), London, MIT Press, .
External links
ResearchGate topic on biomedical cybernetics
Cybernetics |
https://en.wikipedia.org/wiki/Interactive%20media | Interactive media normally refers to products and services on digital computer-based systems which respond to the user's actions by presenting content such as text, moving image, animation, video and audio. Since its early conception, various forms of interactive media have emerged with impacts on educational and commercial markets. With the rise of decision-driven media, concerns surround the impacts of cybersecurity and societal distraction.
Definition
Interactive media is a method of communication in which the output from the media comes from the input of the users.
Interactive media works with the user's participation. The media still has the same purpose but the user's input adds interaction and brings interesting features to the system for better enjoyment.
Development
The analogue videodisc developed by NV Philips was the pioneering technology for interactive media. Additionally, there are several elements that encouraged the development of interactive media including the following:
The laser disc technology was first invented in 1958. It enabled the user to access high-quality analogue images on the computer screen. This increased the ability of interactive video systems.
The concept of the graphical user interface (GUI), which was developed in the 1970s, popularized by Apple Computer, Inc. was essentially about visual metaphors, intuitive feel and sharing information on the virtual desktop. Additional power was the only thing needed to move into multimedia.
The sharp fall in hardware costs and the unprecedented rise in the computer speed and memory transformed the personal computer into an affordable machine capable of combining audio and color video in advanced ways.
Another element is the release of Windows 3.0 in 1990 by Microsoft into the mainstream IBM clone world. It accelerated the acceptance of GUI as the standard mechanism for communicating with small computer systems.
The development by NV Philips of optical digital technologies built around the compact disk (CD) in 1979 is also another leading element in the interactive media development as it raised the issue of developing interactive media.
All of the prior elements contributed in the development of the main hardware and software systems used in interactive media.
Terminology
Though the word media is plural, the term is often used as a singular noun.
Interactive media is related to the concepts interaction design, new media, interactivity, human computer interaction, cyberculture, digital culture, interactive design, and can include augmented reality and virtual reality.
An essential feature of interactivity is that it is mutual: user and machine each take an active role. Most interactive computing systems are for some human purpose and interact with humans in human contexts.
Interactive media are an instance of a computational method influenced by the sciences of cybernetics, autopoiesis and system theories, and challenging notions of reason and cognition, |
https://en.wikipedia.org/wiki/Public%20bodies%20of%20the%20Scottish%20Government | Public bodies of the Scottish Government () are organisations that are funded by the Scottish Government. They form a tightly meshed network of executive and advisory non-departmental public bodies ("quangoes"); tribunals; and nationalised industries. Such public bodies are distinct from executive agencies of the Scottish Government, as unlike them they are not considered to be part of the Government and staff of public bodies are not civil servants, although executive agencies are listed in the Scottish Government's directory of national public bodies alongside other public bodies.
Governance
The Scottish Government is responsible for appointing a board of directors to run public bodies. The Office of the Commissioner for Public Appointments in Scotland is responsible for regulating the process.
Public bodies are assigned "sponsoring departments" who provide funding in the form of grant-in-aid to assist with running costs and capital investment. Most public bodies also have other sources of income (for example the Royal Botanic Garden Edinburgh receives income from charging the public to visit the greenhouses in its gardens).
List of public bodies
Non-ministerial offices
Non-ministerial offices are staffed by civil servants, but do not form part of the Scottish Government. They are accountable to, and funded by the Scottish Parliament, and publish their own annual reports and accounts. Each office is headed by a board or statutory officeholder(s) appointed by the Scottish Government.
Consumer Scotland
Environmental Standards Scotland
Food Standards Scotland
National Records of Scotland
Office of the Scottish Charity Regulator
Registers of Scotland
Revenue Scotland
Scottish Courts and Tribunals Service
Scottish Fiscal Commission
Scottish Housing Regulator
Executive non-departmental public bodies
Executive NDPBs carry out work on behalf of government but do not form part of it, nor are they directly accountable to parliament. They operate within a framework of governance and accountability set by Ministers; often this is defined in specific legislation setting up each body. They employ their own staff, who are not civil servants.
Accounts Commission for Scotland
Architecture and Design Scotland
Bòrd na Gàidhlig
Cairngorms National Park Authority
Care Inspectorate
Children's Hearings Scotland
Community Justice Scotland
Creative Scotland
Crofting Commission
David MacBrayne Ltd
Ferguson Marine (Port Glasgow) Ltd
Highlands and Islands Airports Ltd
Highlands and Islands Enterprise
Historic Environment Scotland
Independent Living Fund Scotland
The Loch Lomond and the Trossachs National Park Authority
National Galleries of Scotland
National Library of Scotland
National Museums Scotland
NatureScot
Police Investigations and Review Commissioner
Quality Meat Scotland
Redress Scotland
Risk Management Authority
Royal Botanic Garden Edinburgh
Scottish Agricultural Wages Board
Scottish Canals
Scottish Children's Reporter Administration
Scottish Crimi |
https://en.wikipedia.org/wiki/Viterbi%20decoder | A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been
encoded using a convolutional code or trellis code.
There are other algorithms for decoding a convolutionally encoded stream (for example, the Fano algorithm). The Viterbi algorithm is the most resource-consuming, but it does the maximum likelihood decoding. It is most often used for decoding convolutional codes with constraint lengths k≤3, but values up to k=15 are used in practice.
Viterbi decoding was developed by Andrew J. Viterbi and published in the paper
There are both hardware (in modems) and software implementations of a Viterbi decoder.
Viterbi decoding is used in the iterative Viterbi decoding algorithm.
Hardware implementation
A hardware Viterbi decoder for basic (not punctured) code usually consists of the following major blocks:
Branch metric unit (BMU)
Path metric unit (PMU)
Traceback unit (TBU)
Branch metric unit (BMU)
A branch metric unit's function is to calculate branch metrics, which are normed distances between every possible symbol in the code alphabet, and the received symbol.
There are hard decision and soft decision Viterbi decoders. A hard decision Viterbi decoder receives a simple bitstream on its input, and a Hamming distance is used as a metric. A soft decision Viterbi decoder receives a bitstream containing information about the reliability of each received symbol. For instance, in a 3-bit encoding, this reliability information can be encoded as follows:
Of course, it is not the only way to encode reliability data.
The squared Euclidean distance is used as a metric for soft decision decoders.
Path metric unit (PMU)
A path metric unit summarizes branch metrics to get metrics for paths, where K is the constraint length of the code, one of which can eventually be chosen as optimal. Every clock it makes decisions, throwing off wittingly nonoptimal paths. The results of these decisions are written to the memory of a traceback unit.
The core elements of a PMU are ACS (Add-Compare-Select) units. The way in which they are connected between themselves is defined by a specific code's trellis diagram.
Since branch metrics are always , there must be an additional circuit (not shown on the image) preventing metric counters from overflow. An alternate method that eliminates the need to monitor the path metric growth is to allow the path metrics to "roll over"; to use this method it is necessary to make sure the path metric accumulators contain enough bits to prevent the "best" and "worst" values from coming within 2(n-1) of each other. The compare circuit is essentially unchanged.
It is possible to monitor the noise level on the incoming bit stream by monitoring the rate of growth of the "best" path metric. A simpler way to do this is to monitor a single location or "state" and watch it pass "upward" through say four discrete levels within the range of the accumulator. As it passes upward through each of these thresholds, |
https://en.wikipedia.org/wiki/Computer%20vision%20syndrome | Computer vision syndrome (CVS) is a condition resulting from focusing the eyes on a computer or other display device for protracted, uninterrupted periods of time and the eye's muscles being unable to recover from the constant tension required to maintain focus on a close object.
Symptoms
Some symptoms of CVS include headaches, blurred vision, neck pain, fatigue, eye strain, dry eyes, irritated eyes, double vision, vertigo/dizziness, polyopia, and difficulty refocusing the eyes. These symptoms can be further aggravated by improper lighting conditions (i.e. glare, strong blue-spectrum backlights, or bright overhead lighting) or air moving past the eyes (e.g. overhead vents, direct air from a fan).
Therapy
Asthenopic (eye strain) symptoms in the eye are responsible for much of the severity in CVS. Proper rest to the eye and its muscles is recommended to relieve the associated eye strain. Observations from persons experiencing chronic eye strain have shown that most people who claim to be getting enough sleep are actually not. This, unaware to them, causes the eye strain to build up over a period of time, when if they had obtained seven to eight hours of uninterrupted sleep, their eye muscles would have recovered during the sleep and the strain would not have built up .
Computer workers are often advised to take breaks and look at distant objects. A routinely recommended approach is to consciously blink the eyes every now and then (this helps replenish the tear film) and to look out the window to a distant object or to the sky—doing so provides rest to the ciliary muscles. One of the catch phrases is the "20–20–20 rule": every 20 minutes, focus the eyes on an object 20 feet (6 meters) away for 20 seconds. This basically gives a convenient distance and timeframe for a person to follow the advice from the optometrist and ophthalmologist.
A number of computer and smartphone applications, such as f.lux, redshift and Night Shift adjust the computer video color temperature, reducing the amount of blue light emitted by the screen, particularly at night.
Dry eye is a symptom that is targeted in the therapy of CVS. The use of over-the-counter artificial-tear solutions can reduce the effects of dry eye in CVS. Prior to using artificial tear solutions, it is necessary to check if dry eye is the actual cause of the problem (measured by a tear meniscus test) or whether there are no actual symptoms of dry eye at all.
Dry eyes because of CVS can also be treated using moisture chamber glasses or humidifier machines. Office spaces with artificially dry air can worsen CVS syndromes, in which case, a desktop or a room humidifier can help the eyes keep a healthy moisture level.
At night, CVS can become worse. It is recommended to use a dark user interface while working at night on the computer. Several browser and OS add-ons exist to darken the user interface.
A 2017 randomized controlled trial evaluated macular carotenoid supplements (lutein, zeaxanthin, and m |
https://en.wikipedia.org/wiki/WordAlone | WordAlone is a network of congregations and individuals originating within the Evangelical Lutheran Church in America (ELCA), the largest Lutheran denomination in the United States. Some congregations are still members of the denomination, but many churches have left and or joined other denominations such as Lutheran Congregations in Mission for Christ. According to its website, WordAlone advocates reform and renewal of the church, representative governance, theological integrity, and freedom from a mandated historic episcopate. The group is generally considered theologically and socially conservative. As of 2005, approximately 215 congregations have officially joined the organization.
Reform efforts
Among other campaigns, WordAlone seeks to pare back what it sees as a top-heavy administrative structure in the ELCA, returning much authority to congregations and freeing up funds for more aggressive mission work. This is in general keeping with conservative renewal movements in other mainline denominations, reflecting an anti-bureaucratic posture against what it believes to be the source of errant teaching and ethics.
More recently, WordAlone has turned its attention to the issue of sexuality in the church. The ELCA has officially welcomed homosexuals within its congregations since 1991, but it has struggled in recent years over whether non-celibate homosexuals in stable relationships should be ordained as ministers and whether ministers should be permitted to bless same-sex partnerships. Groups such as Lutherans Concerned/North America are presently advocating for such ordinations and blessings. Groups such as WordAlone advocate a traditional understanding of marriage, sexuality and sexual orientation.
Perhaps more controversially, WordAlone also started a body called Lutheran Congregations in Mission for Christ (LCMC) which is now legally and organizationally separate from WordAlone though there is some cooperation between the two. LCMC provides organizational resources for congregations that are dissatisfied with the ELCA leadership. Churches that join may either remain members of the ELCA or other Lutheran denominations or may sever such ties and claim the LCMC as their only denominational affiliation. The LCMC describes itself as a "centrist" Lutheran organization and permits the ordination of women. This sets the LCMC apart the Lutheran Church–Missouri Synod and the Wisconsin Evangelical Lutheran Synod, the two major confessionalist Lutheran bodies in the U.S. In keeping with its emphasis on congregational authority, the LCMC rarely makes statements on social or theological issues, although it has issued an "admonition" that sexual activity take place "only within the boundaries of marriage between one man and one woman."
The Institute of Lutheran Theology was also started by the WordAlone Network.
WordAlone played a role in the creation of Lutheran CORE which formed in 2005 in opposition to the growing acceptance of same sex marriage wit |
https://en.wikipedia.org/wiki/SWEET16 | SWEET16 is an interpreted byte-code instruction set invented by Steve Wozniak and implemented as part of the Integer BASIC ROM in the Apple II series of computers. It was created because Wozniak needed to manipulate 16-bit pointer data, and the Apple II was an 8-bit computer.
SWEET16 was not used by the core BASIC code, but was later used to implement several utilities. Notable among these was the line renumbering routine, which was included in the Programmer's Aid #1 ROM, added to later Apple II models and available for user installation on earlier examples.
SWEET16 code is executed as if it were running on a 16-bit processor with sixteen internal 16-bit little-endian registers, named through . Some registers have well-defined functions:
– accumulator
– subroutine stack pointer
– stores the result of all comparison operations for branch testing
– status register
– program counter
The 16 virtual registers, 32 bytes in total, are located in the zero page of the Apple II's real, physical memory map (at –), with values stored as low byte followed by high byte. The SWEET16 interpreter itself is located from to in the Integer BASIC ROM.
According to Wozniak, the SWEET16 implementation is a model of frugal coding, taking up only about 300 bytes in memory. SWEET16 runs at about one-tenth the speed of the equivalent native 6502 code.
Operators
References
External links
Call-A.P.P.L.E. Wozpak II — 1979 Call-A.P.P.L.E. booklet that includes "SWEET 16 Introduction" by Dick Sedgewick and a version of "SWEET 16: The 6502 Dream Machine" by Steve Wozniak with longer descriptions of each opcode
Apple II software
Interpreters (computing)
Register-based virtual machines |
https://en.wikipedia.org/wiki/Playboy%20Radio | Playboy Radio was an internet radio station originally launched on XM Satellite Radio on September 1, 2002. Its programming was dedicated to similar topics and celebrity personalities found in its parent publication, Playboy Magazine. It was XM's first premium station — offered à la carte on top of the base XM subscription price. Playboy Radio gained a healthy following, including a dedicated group of Night Calls fans that established a strong online presence, although some complained the station offered too little content for the monthly premium.
On August 20, 2005, the XM Satellite Radio website informed customers that as of September 1, 2005, XM would no longer offer the Playboy Radio channel. The removal of Playboy Radio brought the end of XM's premium stations as High Voltage was made available free of charge to all subscribers earlier in the year.
In January 2006, XM's competitor Sirius Satellite Radio announced they were picking up Playboy Radio and would be offering additional content. Playboy Radio debuted on Sirius Satellite Radio on March 1, 2006 on channel 198. Sirius made Playboy Radio free of charge, though subscribers could "opt-in" to access stream of the channel online. Sirius moved Playboy Radio to channel 102 on both services on May 4, 2011.
Following the Sirius / XM merger, Playboy Radio returned to XM on September 30, 2008 as part of its "Best of Sirius" package and broadcast on channel 99.
On March 9, 2013, Kevin Klein and Andrea Lowell announced on The Playboy Morning Show that Playboy would no longer be featured on SiriusXM and instead would become available via a standalone online site (PlayboyRadio.com). On March 14, 2013, SiriusXM officially discontinued the channel.
After leaving SiriusXM, Playboy Radio expanded its content to add over a dozen new shows. It operated as an advertisement-free subscription service and offered paid members 24-hour-a-day programming.
Playboy Radio quietly turned off its amplifiers on July 1, 2017 without public fanfare. The final capture of their Web site by the Wayback Machine occurred on December 23, 2017. Their parent company, Playboy Enterprises, has issued no word about the fate of the URL or the future of the service.
Programming
Original programs included Night Calls Radio hosted by adult film star Juli Ashton and Playboy TV star Tiffany Granath as well as Playboy's Sexcetera with reporter Kira Reed. Hall of Fame porn star Christy Canyon was brought in as a replacement when Ashton left to pursue other ventures in April/May 2005. The channel also featured programs such as Playboy TV's Sex Court, The Weekend Flash and Sexy Stories.
In 2010, the Playmate Club radio show launched featuring Patrice Hollis and DJ Colleen Shannon.
Shows
Afternoon Advice, an afternoon call-in show hosted by Tiffany Granath and a rotating panel of "sex experts."
Ask The Doc Show, hosted by Chad and Sunny from Doc Johnson. The first show ever recorded from the dildo factory.
Dave Navarr |
https://en.wikipedia.org/wiki/SCEE | SCEE may refer to:
Sony Computer Entertainment Europe, formerly a subsidiary of Sony, now part of Sony Interactive Entertainment
School of Civil and Environmental Engineering, a constituent college of the National University of Sciences and Technology, Pakistan |
https://en.wikipedia.org/wiki/Bandwidth%20throttling | Bandwidth throttling consists in the intentional limitation of the communication speed (bytes or kilobytes per second), of the ingoing (received) or outgoing (sent) data in a network node or in a network device.
The data speed and rendering may be limited depending on various parameters and conditions.
Overview
Limiting the speed of data sent by a data originator (a client computer or a server computer) is much more efficient than limiting the speed in an intermediate network device between client and server because while in the first case usually no network packets are lost, in the second case network packets can be lost / discarded whenever ingoing data speed overcomes the bandwidth limit or the capacity of device and data packets cannot be temporarily stored in a buffer queue (because it is full or it does not exist); the usage of such a buffer queue is to absorb the peaks of incoming data for very short time lapse.
In the second case discarded data packets can be resent by transmitter and received again.
When a low level network device discards incoming data packets usually can also notify that fact to data transmitter in order to slow down the transmission speed (see also network congestion).
NOTE: Bandwidth throttling should not be confused with rate limiting which operates on client requests at application server level and/or at network management level (i.e. by inspecting protocol data packets). Rate limiting can also help in keeping peaks of data speed under control.
These bandwidth limitations can be implemented:
at (a client program or a server program, i.e. ftp server, web server, etc.) which can be run and configured to throttle data sent through network or even to throttle data received from network (by reading data at most at a throttled amount per second);
at (typically done by an ISP).
The (client/server program) is usually perfectly because it is a choice of the client manager or the server manager (by server administrator) to limit or not to limit the speed of data received from remote program via network or the speed of data sent to target program (server or client).
The (ISP) instead is considered an in the USA under FCC regulations. While ISPs prey on the individuals inability to fight them, fines can range up to $25,000 USD for throttling. In the United States, net neutrality, the principle that Internet service providers (ISPs) treat all data on the Internet the same, and not discriminate, has been an issue of contention between network users and access providers since the 1990s. With net neutrality, ISPs may not intentionally block, slow down, or charge money for specific online content.
Defined as the intentional slowing or speeding of an internet service by an Internet service provider (ISP). It is a reactive measure employed in communication networks to regulate network traffic and minimize bandwidth congestion. Bandwidth throttling can occur at different locations on the network. On a local area net |
https://en.wikipedia.org/wiki/Silhouette%20edge | In computer graphics, a silhouette edge on a 3D body projected onto a 2D plane (display plane) is the collection of points whose outwards surface normal is perpendicular to the view vector. Due to discontinuities in the surface normal, a silhouette edge is also an edge which separates a front facing face from a back facing face. Without loss of generality, this edge is usually chosen to be the closest one on a face, so that in parallel view this edge corresponds to the same one in a perspective view. Hence, if there is an edge between a front facing face and a side facing face, and another edge between a side facing face and back facing face, the closer one is chosen. The easy example is looking at a cube in the direction where the face normal is collinear with the view vector.
The first type of silhouette edge is sometimes troublesome to handle because it does not necessarily correspond to a physical edge in the CAD model. The reason that this can be an issue is that a programmer might corrupt the original model by introducing the new silhouette edge into the problem. Also, given that the edge strongly depends upon the orientation of the model and view vector, this can introduce numerical instabilities into the algorithm (such as when a trick like dilution of precision is considered).
Computation
To determine the silhouette edge of an object, we first have to know the plane equation of all faces. Then, by examining the sign of the point-plane distance from the light-source to each face
Using this result, we can determine if the face is front- or back facing.
The silhouette edge(s) consist of all edges separating a front facing face from a back facing face.
Similar Technique
A convenient and practical implementation of front/back facing detection is to use the unit normal of the plane (which is commonly precomputed for lighting effects anyway), then simply applying the dot product of the light position to the plane's unit normal and adding the D component of the plane equation (a scalar value):
Where plane_D is easily calculated as a point on the plane dot product with the unit normal of the plane:
Note: The homogeneous coordinates, L_w and d, are not always needed for this computation.
After doing this calculation, you may notice indicator is actually the signed distance from the plane to the light position. This distance indicator will be negative if it is behind the face, and positive if it is in front of the face.
This is also the technique used in the 2002 SIGGRAPH paper, "Practical and Robust Stenciled Shadow Volumes for Hardware-Accelerated Rendering"
External links
http://wheger.tripod.com/vhl/vhl.htm
3D computer graphics |
https://en.wikipedia.org/wiki/Far%20East%20Network | The Far East Network (FEN) was a network of American military radio and television stations, primarily serving U.S. Forces in Japan, Okinawa, the Philippines, and Guam.
Overview
Now known as the American Forces Network-Japan (AFN-Japan), with the disestablishment in 1997 of the Far East Network, this network provides military members, Department of Defense civilian employees, and State Department diplomatic personnel and their families with news, information and entertainment by over-the-air radio and TV, and by base cable television.
In addition to its primary military and authorized U.S. civilian audience, AFN-Japan also has a "shadow audience" of an estimated 1.2 million non-military listeners; mostly Japanese studying English, and other English-speaking foreign nationals residing in Japan.
AFN-Japan is headquartered at Yokota Air Base, a major U.S. Air Force installation on the outskirts of Tokyo, and is also known as "AFN-Tokyo".
The network has affiliates located at Misawa Air Base (AFN-Misawa), Marine Corps Air Station Iwakuni (AFN-Iwakuni), and Fleet Activities Sasebo (AFN-Sasebo). While not operationally part of what was once FEN - US Air Force personnel assigned to the Army Network in Korea (AFKN) were under partial administrative control of the FEN Network Headquarters.
Also part of AFN-Japan is AFN-Okinawa, located in the Rycom Plaza Housing Area adjacent to Marine Corps Base Camp S.D. Butler.
AFN-Tokyo is also a Regional News Center, collecting news stories from all Pacific military public affairs offices and AFN affiliates, and packages them into the regional newscast, Pacific Report.
The Pacific Report can be seen every weekday throughout the Pacific and around the world on the AFN-Pacific digital satellite feed and on the Pentagon Channel.
In the Philippines, FEN Philippines was broadcast on UHF Channel 17 (from 1955 until 1981, FEN operated on Channel 8) in Pampanga and Zambales (as in Subic and Clark bases), and UHF Channel 34 in San Miguel, Bulacan (ABS-CBN Corporation occupied the latter frequency until 2020, due to the network's franchise expiration) and also on UHF Channel 50 in Metro Manila. Its radio stations DWFE-AM in Olongapo and DWFA-AM in Balanga, Bataan, and Far East 95.1 (now RW 95.1) on FM are as a part of their network's operations from 1946 to 1991 but the TV channel was forcibly shut down due to the eruption of Mount Pinatubo and the withdrawal of the U.S. military from Clark. Broadcasts ended on June 15, 1991, with Bill & Ted's Excellent Adventures being the last TV show broadcast on the station.
History
In May 1942 the Armed Forces Radio Service (AFRS), was established on the Alaskan island of Kodiak. Radio broadcasts were used to provide information to members of the American armed forces serving off of the U.S. mainland. Evolving from the Morale Services Division of the War Department, the new American Forces Radio Service (AFRS) also included a combination of such activities as command troop i |
https://en.wikipedia.org/wiki/Online%20gaming | Online gaming may refer to:
Online game, a game played over a computer network
Online gambling, gambling using the Internet
See also
Gamble (disambiguation)
Game (disambiguation)
Gamer, a person who plays games, especially video games
Gaming (disambiguation) |
https://en.wikipedia.org/wiki/J.D.%20Power | J.D. Power is an American data analytics, software, and consumer intelligence company. Founded in 1968, the company has been a pioneer in the use of big data, artificial intelligence, and algorithmic modeling capabilities that allow for better understanding of consumer behavior. The firm's business model has evolved to emphasize data and analytics and software products. Industry benchmarking studies are used to evaluate detailed consumer interactions and trends across the automotive, financial services, healthcare, home, insurance, technology, media and telecom, travel and hospitality, senior living, and utilities industries.
The company was founded in 1968 by James David Power III. It is headquartered in Troy, Michigan, but has offices elsewhere in the Americas, Europe, and the Pacific. In March 2018, Dave Habiger was named president and CEO. Private equity firm Thoma Bravo, LLC announced it was acquiring J.D. Power in July 2019. The company announced a merger with Autodata Solutions, a provider of data and software for the automotive ecosystem, in December 2019.
History
J.D. Power was founded in 1968 by James David Power III.
Power had previously worked in advertising and doing customer research for the Ford Motor Company, where he felt customer satisfaction data was too often overlooked. He later joined Marplan, and then McCulloch, a chainsaw manufacturer. He left his position at McCulloch and founded J.D. Power and Associates on April 1, 1968, working at first from his kitchen table. The company incorporated on February 7, 1969. The "associates" referred to in the firm's title were his wife, who assisted him with market research, and his children, who helped stuff envelopes.
J.D. Power began surveying car owners about the various attributes of their vehicles. This enabled the company to gather a significant amount of data on how to improve cars, which it used to assist and guide OEMs and car manufacturers to build better cars. In 1973, the company first drew significant national attention when Julia P. Power discovered a design flaw in the O-rings of certain Mazda rotary engines, working from the results of customer surveys. The report was then publicized by The Wall Street Journal and widely repeated in other outlets. In the following years, J.D. Power and Associates became particularly known for its automotive customer satisfaction rankings, while continuing to work in other areas such as food and computers. The firm created the first Dealer Attitude Study in 1976 and the U.S. Automotive Customer Satisfaction Index in 1981.
Subaru paid J.D. Power to mention the results of their ranking in the J.D. Power Awards in 1984 and became the first company to mention their results in a television commercial, which aired during Super Bowl XVIII. According to J.D. Power, their rankings have appeared in more than 350,000 television commercials and two billion print advertisements. J.D. Power expanded its offerings to sell financial and insurance |
https://en.wikipedia.org/wiki/Artificial%20intelligence%20in%20video%20games | In video games, artificial intelligence (AI) is used to generate responsive, adaptive or intelligent behaviors primarily in non-player characters (NPCs) similar to human-like intelligence. Artificial intelligence has been an integral part of video games since their inception in the 1950s. AI in video games is a distinct subfield and differs from academic AI. It serves to improve the game-player experience rather than machine learning or decision making. During the golden age of arcade video games the idea of AI opponents was largely popularized in the form of graduated difficulty levels, distinct movement patterns, and in-game events dependent on the player's input. Modern games often implement existing techniques such as pathfinding and decision trees to guide the actions of NPCs. AI is often used in mechanisms which are not immediately visible to the user, such as data mining and procedural-content generation.
In general, game AI does not, as might be thought and sometimes is depicted to be the case, mean a realization of an artificial person corresponding to an NPC in the manner of the Turing test or an artificial general intelligence.
Overview
The term "game AI" is used to refer to a broad set of algorithms that also include techniques from control theory, robotics, computer graphics and computer science in general, and so video game AI may often not constitute "true AI" in that such techniques do not necessarily facilitate computer learning or other standard criteria, only constituting "automated computation" or a predetermined and limited set of responses to a predetermined and limited set of inputs.
Many industries and corporate voices claim that so-called video game AI has come a long way in the sense that it has revolutionized the way humans interact with all forms of technology, although many expert researchers are skeptical of such claims, and particularly of the notion that such technologies fit the definition of "intelligence" standardly used in the cognitive sciences. Industry voices make the argument that AI has become more versatile in the way we use all technological devices for more than their intended purpose because the AI allows the technology to operate in multiple ways, allegedly developing their own personalities and carrying out complex instructions of the user.
However, people in the field of AI have argued that video game AI is not true intelligence, but an advertising buzzword used to describe computer programs that use simple sorting and matching algorithms to create the illusion of intelligent behavior while bestowing software with a misleading aura of scientific or technological complexity and advancement. Since game AI for NPCs is centered on appearance of intelligence and good gameplay within environment restrictions, its approach is very different from that of traditional AI.
History
Game playing was an area of research in AI from its inception. One of the first examples of AI is the computerized game of Nim |
https://en.wikipedia.org/wiki/F3 | F3 or F03 may refer to:
Computing
F3, a function key on a computer keyboard
F3 (language), the working name for JavaFX Script, a scripting language
Fat-Free Framework, a PHP web application framework
Military
Douglas F-3 Havoc, a photographic reconnaissance plane
Douglas F3D Skyknight (later F-10 Skyknight), a Douglas twin engine, mid-wing jet fighter
F 3 Malmslätt, a former Swedish Air Force unit
Felixstowe F.3, a 1917 British First World War flying boat
Hannover F.3, a World War I German prototype escort fighter
HMS Cossack (F03), a 1937 British Royal Navy destroyer
HMS F3, a British F class submarine
McDonnell F3H Demon (later F-3 Demon), a United States Navy carrier-based jet fighter
Mk F3 155mm, French self-propelled gun
RAF Tornado F3, a British fighter
USS F-3 (SS-22), a United States Navy submarine
A future Japanese fighter jet (F-3 or F-X) based on the i3 conceptual jet fighter and Mitsubishi X-2 prototype
Transportation
BYD F3, an automobile
EMD F3, a North American cab-style diesel locomotive introduced in 1945
F3 (Istanbul Metro), a funicular railway line in Istanbul, Turkey
F3 class, project name for the mega-cruise ship Norwegian Epic
Faso Airways IATA airline designator
Fokker F.III, a 1921 Dutch single-engine high-winged monoplane aircraft
Hinterhoeller F3, a yacht design by Canadian boat builder Hinterhoeller Yachts
MV Agusta F3 series, an Italian sports motorcycle
Spyder F3, a model of the three-wheeled motorcycle BRP Can-Am Spyder Roadster
Sydney Ferries' Parramatta River ferry services, known as the F3
Pacific Motorway (Sydney–Newcastle), formerly Sydney–Newcastle Freeway and commonly known as F3
LNER Class F3, a class of British steam locomotives
Arts
F3 (Fisz Emade jako Tworzywo Sztuczne album)
F3 (manga) (F³: Frantic, Frustrated & Female), a hentai manga series
F3 (film), a 2022 Indian Telugu-language film by Anil Ravipudi, a sequel to F2 (2019)
Other
F3 (classification), a wheelchair sport classification
F3 (font format), created by Folio, Inc
F3 (gene), a protein
F3 isoprostane
F3 Nation, a network of free peer-led workouts for men in the U.S.
Form, fit and function, an engineering term relating to design processes
Formula Three, a class of automobile racing
Forsmark 3, a unit at Forsmark Nuclear Power Plant, Sweden
Motorola Motofone F3, a mobile phone
Nikon F3, an SLR camera
Taito F3 System, a 1992 arcade system board
A tornado intensity rating on the Fujita scale
F3, a type of formant in speech science
F3, an EEG electrode site according to the 10-20 system
F3 Derby, association football rivalry between Central Coast Mariners and Newcastle Jets
See also
F2 (disambiguation) |
https://en.wikipedia.org/wiki/Task%20%28computing%29 | In computing, a task is a unit of execution or a unit of work. The term is ambiguous; precise alternative terms include process, light-weight process, thread (for execution), step, request, or query (for work). In the adjacent diagram, there are queues of incoming work to do and outgoing completed work, and a thread pool of threads to perform this work. Either the work units themselves or the threads that perform the work can be referred to as "tasks", and these can be referred to respectively as requests/responses/threads, incoming tasks/completed tasks/threads (as illustrated), or requests/responses/tasks.
Terminology
In the sense of "unit of execution", in some operating systems, a task is synonymous with a process, and in others with a thread. In non-interactive execution (batch processing), a task is a unit of execution within a job, with the task itself typically a process. The term "multitasking" primarily refers to the processing sense – multiple tasks executing at the same time – but has nuances of the work sense of multiple tasks being performed at the same time.
In the sense of "unit of work", in a job (meaning "one-off piece of work") a task can correspond to a single step (the step itself, not the execution thereof), while in batch processing individual tasks can correspond to a single step of processing a single item in a batch, or to a single step of processing all items in the batch. In online systems, tasks most commonly correspond to a single request (in request–response architectures) or a query (in information retrieval), either a single stage of handling, or the whole system-wide handling.
Examples
In the Java programming language, these two concepts (unit of work and unit of execution) are conflated when working directly with threads, but clearly distinguished in the Executors framework:
IBM terminology
IBM's use of the term has been influential, though underlining the ambiguity of the term, in IBM terminology, "task" has dozens of specific meanings, including:
A unit of work representing one of the steps in a process.
A unit of work to be accomplished by a device or process.
A process and the procedures that run the process.
A set of actions designed to achieve a particular result. A task is performed on a set of targets on a specific schedule.
A unit of computation. In a parallel job, two or more concurrent tasks work together through message passing and shared memory. Although it is common to allocate one task per physical or logical processor, the terms "task" and "processor" are not interchangeable.
An activity that has business value, is initiated by a user, and is performed by software.
In z/OS specifically, it is defined precisely as:
"In a multiprogramming or multiprocessing environment, one or more sequences of instructions treated by a control program as an element of work to be accomplished by a computer."
The term task in OS/360 through z/OS is roughly equivalent to light-weight process; the tasks i |
https://en.wikipedia.org/wiki/Shading%20language | A shading language is a graphics programming language adapted to programming shader effects. Shading languages usually consist of special data types like "vector", "matrix", "color" and "normal".
Offline rendering
Shading languages used in offline rendering tend to be close to natural language, so that no special knowledge of programming is required. Offline rendering aims to produce maximum-quality images, at the cost of greater time and compute than real-time rendering.
RenderMan Shading Language
The RenderMan Shading Language (RSL or SL, for short), defined in the RenderMan Interface Specification, is a common shading language for production-quality rendering. It is also one of the first shading languages ever implemented.
It defines six major shader types:
Light source shaders compute the color of light emitted from a point on a light source to a point on a target surface.
Surface shaders model the color and position of points on an object's surface, based on incoming light and the object's physical properties.
Displacement shaders manipulate surface geometry independent of color.
Deformation shaders transform the entire space. Only one RenderMan implementation, the AIR renderer by SiTex Graphics, implemented this shader type, supporting only a single linear transformation applied to the space.
Volume shaders manipulate the color of light as it passes through a volume. They create effects such as fog.
Imager shaders describe a color transformation to final pixel values. This is like an image filter, except the imager shader operates on data prior to quantization. Such data have more dynamic range and color resolution than can be displayed on a typical output device.
Houdini VEX Shading Language
Houdini VEX (Vector Expressions) shading language (often abbreviated to "VEX") is closely modeled after RenderMan. However, its integration into a complete 3D package means that the shader writer can access the information inside the shader, a feature that is not usually available in a rendering context. The language differences between RSL and VEX are mainly syntactic, in addition to differences regarding the names of several shadeop names.
Gelato Shading Language
Gelato's shading language, like Houdini's VEX, is closely modeled after RenderMan. The differences between Gelato Shading Language and RSL are mainly syntactical — Gelato uses semicolons instead of commas to separate arguments in function definitions and a few shadeops have different names and parameters.
Open Shading Language
Open Shading Language (OSL) was developed by Sony Pictures Imageworks for use in its Arnold Renderer. It is also used by Blender's Cycles render engine. OSL's surface and volume shaders define how surfaces or volumes scatter light in a way that allows for importance sampling; thus, it is well suited for physically-based renderers that support ray tracing and global illumination.
Real-time rendering
Shading languages for real-time rendering are now w |
https://en.wikipedia.org/wiki/PRIMOS | PRIMOS is a discontinued operating system developed during the 1970s by Prime Computer for its minicomputer systems. It rapidly gained popularity and by the mid-1980s was a serious contender as a mainline minicomputer operating system.
With the advent of PCs and the decline of the minicomputer industry, Prime was forced out of the market in the early 1990s, and by the end of 2010 the trademarks for both PRIME and PRIMOS no longer existed.
Prime had also offered a customizable real-time OS called RTOS.
Internals
One feature of PRIMOS was that it, like UNIX, was largely written in a high level language (with callable assembly language library functions available). At first, this language was FORTRAN IV, which was an odd choice from a pure computer science standpoint: no pointers, no if-then-else, no native string type, etc. FORTRAN was, however, the language most known to engineers, and engineers were a big market for Prime in their early years.
The unusual choice of FORTRAN for the OS programming language had to do with the people who founded Prime. They had worked for Honeywell on a NASA project. FORTRAN was the language they had used both at NASA and, for many of them, at MIT.
Honeywell, at that time, was uninterested in minicomputers, so they left and founded Prime, "taking" the code with them. They developed hardware optimized to run FORTRAN, including machine instructions that directly implemented FORTRAN's distinctive 3-way branch operation.
Since Prime's hardware did not perform byte addressing, there was no impetus to create a C compiler. Late models of the hardware were eventually modified to support I-mode, and programs compiled in C.
Later, around version 18, a version of PL/1, called PL/P, became the high level language of choice within PRIMOS, and
the PL/P and Modula-2 languages were used in the Kernel. Furthermore, some new PRIMOS utilities were written in SP/L, which was similar to PL/P.
The source code to PRIMOS was available to customers and, thanks to FORTRAN and PL/P, customers could reasonably modify PRIMOS as needed. For example, around 1990, the University of Salford in the UK, modified the PRIMOS running on its five 9955 systems so that undergraduates could no longer use the MESSAGE command, that wrapped the PRIMOS SMSG$() call, to send messages to other undergraduates, because online "chatting" using that command was becoming rife, tying up terminals from the limited pool available. Messaging using that command was akin to SMS text messaging today, except a maximum of 80 characters could be sent per message.
Very early versions of PRIMOS (revision 6) were originally called DOS (PRIMOS 2) and later DOSVM (PRIMOS 3), but starting with PRIMOS 4, on the P400 system, PRIMOS was the name that stuck. There were many major releases of PRIMOS. The last official revision (24.0.0.R52) was released July 3, 1997. By this time, a company called Peritus (which employed a number of ex-Prime engineers) was maintaining PRIMOS.
|
https://en.wikipedia.org/wiki/Airport%20%28TV%20series%29 | Airport is a British documentary television series based at London Heathrow Airport, broadcast by the BBC and syndicated to Dave, part of the UKTV network.
The show is a fly-on-the-wall series following passengers and staff who work for the airlines, the airport operator BAA, the animal reception centre, emergency services, customs and immigration, and others. The airlines and staff featured change from series to series, although certain staff feature in multiple series.
History
The first series of Airport aired on BBC One, beginning on 2 May 1996. It was then repeated on BBC Two in April 1997. Originally intended to be a low-key behind-the-scenes documentary, the emergence of several memorable recurring characters gave the show a docusoap feel. Special fame was gained by Jeremy Spake, an Aeroflot employee, whose flamboyance earned him a series of short 'bumpers' on UKTV People explaining how to best use airports. Other airlines featured throughout the series are Aer Lingus, Air Jamaica, Avianca, BMI, Canadian Airlines, Cyprus Airways (1947–2015), Czech Airlines, El Al, Emirates, Gulf Air, Icelandair, Iran Air, Jat Airways, Kuwait Airways, Pakistan International Airlines, Qantas, Qatar Airways and Virgin Atlantic.
There have also been several special Airport programmes over the years featuring airports other than Heathrow, such as Frankfurt and Edinburgh.
The first version from 1996 to 2001 had the opening scenes with the entrance to the Heathrow Airport tunnel and the theme music was composed by Hal Lindes. The opening titles and music were given a make over for the start of the 7th series in 2002. From the 7th series onwards, incidental music (composed by Cherry Lodge) was added over the scenes shown on screen. The title music was once again revamped for the 10th series in 2005. In addition, Liza Tarbuck replaced John Nettles as the show's narrator for series 10.
Celebrities who have been seen on the show include Stephen Fry, Hugh Hefner, Britney Spears, Kylie Minogue, Joan Collins, Michael Jackson, Pamela Anderson, Blue, Brian May, Tom Jones, Mohammed Burhanuddin, Yusuf Islam, Colin Powell, Kate Winslet, David Beckham, Kriss Akabusi, Al Pacino, Engelbert Humperdinck, Lennox Lewis, Bob Geldof and several government or state officials including Queen Elizabeth II, Princess Diana, the Japanese Emperor and Bill Clinton.
In one episode, a BA staff member gets arrested by the airport police for impersonating someone else. He is arrested on board an incoming flight and is led away by un-uniformed officers.
Regular contributors
John Cull, Qantas Airport Manager, appears in 17 episodes of the series. Jeremy Spake, Aeroflot Airlines Manager makes frequent appearances in the series. Maria Demetriou of Cyprus Airways (1947–2015) appears in many shows. Animal Health Officer Stuart King, Royal Suite manager Anita Newcourt and journalists Russell Clisby and Steve Meller all contribute in many of the series.
Other contributors
These include:-
Product |
https://en.wikipedia.org/wiki/Gawker%20Media | Gawker Media LLC (formerly Blogwire, Inc. and Gawker Media, Inc.) was an American online media company and blog network. It was founded by Nick Denton in October 2003 as Blogwire, and was based in New York City. Incorporated in the Cayman Islands, as of 2012, Gawker Media was the parent company for seven different weblogs and many subsites under them: Gawker.com, Deadspin, Lifehacker, Gizmodo, Kotaku, Jalopnik, and Jezebel. All Gawker articles are licensed on a Creative Commons attribution-noncommercial license. In 2004, the company renamed from Blogwire, Inc. to Gawker Media, Inc., and to Gawker Media LLC shortly after.
In 2016, the company filed for Chapter 11 bankruptcy protection after damages of $140 million were awarded against the company as a result of the Hulk Hogan sex tape lawsuit. On August 16, 2016, all of the Gawker Media brands, assets except for Gawker.com, were acquired at auction by Univision Communications for $135 million. Two days later on August 18, the company announced that Gawker.com would cease operations the following week, while its other sites will continue to operate.
On September 21, 2016, Univision moved all of the Gawker Media properties to their newly-created Gizmodo Media Group.
Gizmodo was subsequently acquired by Great Hill Partners along with The Onion in 2019 under the G/O Media Inc. umbrella, reportedly for less than $50 million.
Ownership, finances, and traffic
While Denton has generally not gone into detail over Gawker Media's finances, he made statements in 2005 that downplayed the profit potential of blogs declaring that "[b]logs are likely to be better for readers than for capitalists. While I love the medium, I've always been skeptical about the value of blogs as businesses", on his personal site.
In an article in the February 20, 2006 issue of New York Magazine, Jossip founder David Hauslaib estimated Gawker.coms annual advertising revenue to be at least $1 million, and possibly over $2 million a year. Combined with low operating costs—mostly web hosting fees and writer salaries—Denton was believed to be turning a healthy profit by 2006. In 2015, Gawker Media LLC released its audited revenue for the past five years. In 2010, its revenue was $20 million and operating income of $2.6 million. Gawker Media's revenues steadily increased through 2014 and its audited revenue for 2014 was $45 million with $6.5 million operating income. Business Insider valued the company at $250 million based upon its 2014 revenue. In early 2015, Denton stated that he planned to raise $15 million in debt from various banks so as not to dilute his equity stake in the company by accepting investments from venture capital firms.
In June 2016, Gawker Media revealed its corporate finances in a motion for a stay of judgment pending appeal and accompanying affidavits filed in the Bollea v. Gawker case in Florida state court. In the filings, the company stated that it could not afford to pay the $140.1 million judgment or the |
https://en.wikipedia.org/wiki/Ticket%20lock | In computer science, a ticket lock is a synchronization mechanism, or locking algorithm, that is a type of spinlock that uses "tickets" to control which thread of execution is allowed to enter a critical section.
Overview
The basic concept of a ticket lock is similar to the ticket queue management system. This is the method that many bakeries and delis use to serve customers in the order that they arrive, without making them stand in a line. Generally, there is some type of dispenser from which customers pull sequentially numbered tickets upon arrival. The dispenser usually has a sign above or near it stating something like "Please take a number". There is also typically a dynamic sign, usually digital, that displays the ticket number that is now being served. Each time the next ticket number (customer) is ready to be served, the "Now Serving" sign is incremented and the number called out. This allows all of the waiting customers to know how many people are still ahead of them in the queue or line.
Like this system, a ticket lock is a first in first out (FIFO) queue-based mechanism. It adds the benefit of fairness of lock acquisition and works as follows; there are two integer values which begin at 0. The first value is the queue ticket, the second is the dequeue ticket. The queue ticket is the thread's position in the queue, and the dequeue ticket is the ticket, or queue position, that now has the lock (Now Serving).
When a thread arrives, it atomically obtains and then increments the queue ticket. The atomicity of this operation is required to prevent two threads from simultaneously being able to obtain the same ticket number. It then compares its ticket value, before the increment, with the dequeue ticket's value. If they are the same, the thread is permitted to enter the critical section. If they are not the same, then another thread must already be in the critical section and this thread must busy-wait or yield. When a thread leaves the critical section controlled by the lock, it atomically increments the dequeue ticket. This permits the next waiting thread, the one with the next sequential ticket number, to enter the critical section.
Fairness of lock acquisition
The notion of fairness in lock acquisition applies to the order in which threads acquire a lock successfully. If some type of fairness is implemented, it prevents a thread from being starved out of execution for a long time due to inability to acquire a lock in favor of other threads. With no fairness guarantees, a situation can arise where a thread (or multiple threads) can take a disproportionately long time to execute as compared to others. A simple example will now be presented to show how a thread could be excessively delayed due to a lack of fairness in lock acquisition.
Assume a case where three threads, each executing on one of three processors, are executing the following pseudocode that uses a lock with no consideration for fairness.
while (1) {
|
https://en.wikipedia.org/wiki/KERA%20%28FM%29 | KERA (90.1 MHz) is a National Public Radio member FM station serving North Texas, United States. KERA also relays its programming to three separate FM relay translators, extending the coverage area of KERA's programming into the Sherman-Denison area, Wichita Falls, and Tyler.
Transmitter/Translators
KERA is based in Dallas, and the station's main transmitter is located in Cedar Hill, Texas with translators that serve Tyler (K261CW, 100.1 FM), the Sherman/Denison area (K257EV, 99.3 FM), and Wichita Falls (K202DR, 88.3 FM). It was also rebroadcast on the Public, educational, and government access (PEG) cable tv channel, Irving Community Television Network during its off-air times prior to 2009.
Programming
KERA FM has a news and information format that includes national programs, reports and specials from the KERA newsroom and other original productions. CEO also has a television version that broadcasts on KERA-TV.KERA FM's on-air staff includes Morning Edition host Sam Baker, All Things Considered host Justin Martin, and reporters Stella Chavez, Christopher Connelly, Lauren Silverman, Jerome Weeks and Bill Zeeble.
NPR
KERA is an NPR member station and carries NPR programming.
KERA News
Signature series
KERA News Digital Storytelling projects provide an in-depth look at the people of Texas — the crises they endure, the issues they overcome and the triumphs they achieve.
Think
The KERA production Think, hosted by Krys Boyd, features guests, often authors or speechmakers, who discuss intellectual or intriguing topics with Ms. Boyd, usually supplemented by call-in comments and questions. The show's host and crew have traveled to Washington, D.C., yearly since 2015 to broadcast live from NPR headquarters. Notable guests during Think in D.C. have included Michael Eric Dyson and U.S. Senators Ted Cruz and John Cornyn.
As of October 2021, Think is carried live in its midday time slot by 151 radio stations in Texas, Alabama, Alaska, California, Colorado, Florida, Georgia, Illinois, Indiana, Kentucky, Louisiana, Michigan, Mississippi, Missouri, North Carolina, Oregon, Pennsylvania, Rhode Island, South Carolina, Virginia, and Washington State.
History
KERA FM went on the air in July 1974, serving Dallas, Fort Worth and Denton with a mix of news and music programming. The station has since expanded its broadcast into Wichita Falls (88.3), Tyler (100.1), and Sherman (99.3). KERA FM switched to a news and information format in 2000, with an emphasis on the in-depth news programs and thoughtful conversations that make public radio unique. In 2014, KERA expanded its news department, leading to a surge in local reporting. Since this expansion, hundreds of KERA stories have broadcast nationally and internationally by NPR, PRI and the BBC.Prior to the launch of KXT 91.7 FM, KERA FM aired locally produced music program 90.1 at Night hosted by Paul Slavens, which aired Sunday nights from 8:00pm until 10:00pm. The program was moved to their newly acquired |
https://en.wikipedia.org/wiki/Busicom | was a Japanese company that manufactured and sold computer-related products headquartered in Taito, Tokyo. It owned the rights to Intel's first microprocessor, the Intel 4004, which they created in partnership with Intel in 1970.
Busicom asked Intel to design a set of integrated circuits for a new line of programmable electronic calculators in 1969. In doing this, they spurred the invention of Intel's first microprocessor to be commercialized, the Intel 4004. Busicom owned the exclusive rights to the design and its components in 1970 but shared them with Intel in 1971.
Two other companies have done business as "Busicom" over the years: the Nippon Calculating Machine Corp, Ltd and subsequently Broughtons & Co. (Bristol) Ltd of the UK.
Nippon Calculating Machine Corporation, Ltd
History
The Nippon Calculating Machine Corp was incorporated in 1945 and changed its name in 1967 to Business Computer Corporation, Busicom. Due to a recession in Japan in 1974, Busicom became the first major Japanese company in the calculator industry to fail. Originally, they made Odhner type mechanical calculators and then moved on to electronic calculators always using state of the art designs. They made the first calculator with a microprocessor for their top-of-the-line machines and they were the first to make calculators with an all-in-one calculator chip, the Mostek MK6010, for their line of inexpensive machines.
One of their last mechanical calculators is the HL-21, an Odhner type machine. Their first calculator with a microprocessor is the Busicom 141-PF. Their entry based calculators, the Busicom LE-120A (Handy-LE) and LE-120S (Handy), were the first to fit in a pocket and also the first calculators to use an LED display.
Microprocessor
In order to limit production cost, Busicom wanted to design a calculator engine that would be based on a few integrated circuits (ICs), containing some ROMs and shift registers and that could be adapted to a broad range of calculators by just changing the ROM IC chips.
Busicom's engineers came up with a design that required 12 ICs and asked Intel, a company founded one year earlier in 1968 for the purpose of making solid state random-access memory (RAM), to finalize and manufacture their calculator engine. People who were influential in convincing Busicom to switch to using microprocessors were Tadashi Sasaki and Robert Noyce.
Intel's Ted Hoff was assigned to studying Busicom's design, and came up with a much more elegant, 4 ICs architecture centered on what was to become the 4004 microprocessor surrounded by a mixture of 3 different ICs containing ROM, shift registers, input/output ports and RAM—Intel's first product (1969) was the 3101 Schottky TTL bipolar 64-bit SRAM.
Busicom's management agreed to Hoff's new approach and the chips' implementation was led by Federico Faggin who had previously developed the Silicon Gate Technology at Fairchild Semiconductor. It was this technology that made possible the desi |
https://en.wikipedia.org/wiki/List%20of%20Monk%20episodes | The following is a complete episode list for the criminal dramedy television series Monk. It premiered on the USA Network on July 12, 2002 in the United States and ended with a two-part series finale on November 27 and December 4, 2009. The complete series has a total of 125 episodes, including three 2-part episodes and four Christmas specials.
Series overview
Episodes
Season 1 (2002)
Season 2 (2003–04)
Season 3 (2004–05)
Season 4 (2005–06)
Season 5 (2006–07)
Season 6 (2007–08)
Season 7 (2008–09)
Season 8 (2009)
Webisodes
These four webisodes were also released on the Season 5 DVD.
Mr. Monk and Dr. Kroger
Mr. Monk and the Computer
Mr. Monk and the Blood Test
Mr. Monk Goes to the Gym
Little Monk
USA Network ordered ten episodes that would deal with the Monk brothers' childhood. The first premiered on August 21, 2009. The series starred Aaron Linker as Little Monk, Chris Lizardi as Little Ambrose and Bella Thorne as Wendy, one of the Monks' classmates. The series was directed by Randall Zisk, with Hy Conrad, Andy Breckman, Kevin Albright, and Justin Brenneman serving as writers. Aaron Linker also appeared in the parent show as Little Monk in a flashback. The episodes are available only on the "Best of Monk" DVD.
Ratings
References
External links
Monk
Monk
E
!-- S07E05 -->| 4.65 |
https://en.wikipedia.org/wiki/At%20Ease | At Ease was an alternative to the Macintosh desktop developed by Apple Computer in the early 1990s for the classic Mac OS. It provided a simple environment for new Macintosh users and young children to help them to work without supervision. At Ease replaces the Finder desktop, providing a simple tabbed panel-oriented graphical user interface in which applications and documents are represented by icons on large buttons. Aside from its security features, its interface and basic functionality is very similar to the Packard Bell Navigator.
Features
Panels: at the main At Ease desktop, there are two "panels" which are accessed with tab buttons. One displays the user's applications and one displays their personal documents. When a panel is full, another is created and the user must change the current page.
Multiple users: at the time At Ease was released, System 7 did not support multiple users. At Ease 2.0 and later provided an easy and safe way for Macintosh users to store personal files on their computer and protect them from other people using the same computer.
Sharing: At Ease allows files to be shared with other users.
Privileges: the main user (known as the "Administrator" or "Owner") can set what programs and documents the user has access to.
Security: At Ease allowed passwords to be set for each user, to make sure that one user cannot log on to another user's account.
At Ease for Workgroups
At Ease for Workgroups allows users to log on to a server from any workstation that has the At Ease software installed. At Ease for Workgroups introduced a number of network-specific features not found in the original At Ease. The workgroup version enabled client configuration, network access and restrictions on how the client's computer can be used. In addition to the beige-colored Applications "folder" and the blue-colored Documents "folder" that each user had in his or her workspace, the workgroup version of the software also allowed for easier access to removable media: a pink-colored folder would appear in the user's profile for any CD-ROM inserted into the computer and a green-colored folder would appear for a floppy disk. These features were controlled for each user by the administrator. At Ease for Workgroups also included an Administration program that can add users and workgroups to the network.
At Ease for Workgroups 5 also provided a restricted Finder mode that allowed the Finder to operate instead of the traditional At Ease panels. It provided quick access to the user's documents folder which could be stored on an AppleShare IP server. The restricted Finder mode later evolved into Mac OS 9's multiple users feature.
Starting with version 4.0, At Ease was sold as part of the Apple Network Administrator Toolkit (ANAT), which additionally included Apple Network Assistant and Apple User and Group Manager.
Features brought into Mac OS 9
Built-in support for multiple users was implemented in Mac OS 9, bringing all of the features straigh |
https://en.wikipedia.org/wiki/Wire%20speed | In computer networking, wire speed or wirespeed refers to the hypothetical peak physical layer net bit rate (useful information rate) of a cable (consisting of fiber-optical wires or copper wires) combined with a certain digital communication device, interface, or port. For example, the wire speed of Fast Ethernet is 100 Mbit/s also known as the peak bitrate, connection speed, useful bit rate, information rate, or digital bandwidth capacity. The wire speed is the data transfer rate that a telecommunications standard provides at a reference point between the physical layer and the data link layer.
Related terms
The wire speed should not be confused with the line bitrate, also known as gross bit rate, raw bitrate or data signalling rate, which is 125 Mbit/s in fast Ethernet. In case there is a physical layer overhead, for example due to line coding or error-correcting codes, the line bitrate is higher than the wire speed.
The theoretical channel capacity of the cable may be much higher, especially if the cable is short, but this is not utilized in the communication standard. The channel capacity depends on the physical and electrical properties of the cable, while the wire speed also depends on the connection protocols.
The wire speed may also refer to maximum throughput, which typically is a couple of percent lower than the physical layer net bit rate in wired networks due to data-link-layer protocol overhead, data packet gaps, etc., and much lower in wireless networks.
Communicating "at wire speed"
The term at wire speed, or the adjective wire speed, describes any computer system or hardware device that is able to achieve a throughput equal to the maximum throughput of the communication standard. This requires that the CPU capacity, bus capacity, network switching capacity, etc., be sufficient. Network switches, routers, and similar devices are sometimes described as operating at wire speed. Data encryption and decryption and hardware emulation are software functions that might run at wire speed (or close to it) when embedded in a microchip.
The wire speed is rarely achieved in connections between computers due to CPU limitations, disk read/write overhead, or contention for resources. However, it is still a useful concept for estimating the theoretical best throughput, and how far the real-life performance falls short of the maximum.
The term wire speed (or wirespeed) is considered a non-formal language term.
References
Data transmission |
https://en.wikipedia.org/wiki/Suid | Suid or SUID may refer to:
Suidae, animals such as pigs
SUID, sudden and unexpected infant death
In computing:
setuid, a privilege elevation mechanism
Saved user ID, a type of user identifier for processes |
https://en.wikipedia.org/wiki/Michael%20Okuda | Michael Okuda is an American graphic designer best known for his work on Star Trek including designing futuristic computer user interfaces known as "okudagrams".
Early life and education
Okuda received a bachelor of art in communications from the University of Hawaiʻi.
Career
Work in Star Trek
In the mid-1980s, he designed the look of animated computer displays for the USS Enterprise-A bridge in Star Trek IV: The Voyage Home. This led to a staff position on Star Trek: The Next Generation in 1987 as a scenic artist, adding detail to set designs and props. To The Next Generation he contributed the GUI of the fictional LCARS computer system used throughout the USS Enterprise-D and other Starfleet starships. In homage to its creator, this visual style has come to be known among fans as "okudagrams".
Okuda also served as a technical consultant on the various TNG-era Star Trek series along with Rick Sternbach, advising the scriptwriters on the technology used throughout the Star Trek universe such as the transporters and the warp drive. For example, Okuda created the Heisenberg compensator as a way to explain how Star Treks fictional transporter might work, despite the limitation of the uncertainty principle. Okuda famously answered the question "How does the Heisenberg compensator work?" with "It works very well, thank you." This work resulted in a technical manual which was distributed to prospective scriptwriters along with the series bible. The manual was later published in revised and updated form as the Star Trek: The Next Generation Technical Manual by Pocket Books. Okuda then went on to write a number of Star Trek books with his wife, Denise. He continued working at Paramount Studios on multiple Star Trek series that followed The Next Generation, including as an art supervisor on Star Trek: Deep Space Nine, Star Trek: Voyager and through to the cancellation of Star Trek: Enterprise in 2005. He also worked on the Star Trek movies that were produced while the various television series were in production. He also served as one of the producers when CBS digitally remastered and updated special visual effects for the original series.
Okuda is known for including in-jokes within his designs. In April 2013, Phil Plait (Bad Astronomy blogger) reported that Okuda had included an oblique homage to The West Wing in the Voyager episode "Imperfection", by having Seven of Nine look at a list of Voyager crew who had died, and there listing Commander J. Bartlett (intentional misspelling), Lieutenant Commander L. McGarry, Lieutenant Commander T. Ziegler, Lieutenant J. Lyman, Lieutenant S. Seaborn, Ensign Claudia J. Craig (intentional misspelling) and Ensign Charles Young. Plait reported contacting Okuda who revealed that Okuda and his wife, Denise and graphic artist James Van Over, were all huge fans of The West Wing. Okuda is reported as saying that "one of my rules regarding jokes was that they should never be apparent to the casual viewer. If they were, |
https://en.wikipedia.org/wiki/Permabit | Permabit Technology Corporation was a private supplier of Data Reduction solutions to the Computer Data Storage industry.
On 31 July 2017 it was announced that Red Hat had acquired the assets and technology of Permabit Technology Corporation.
Permabit Albireo
The Permabit Albireo family of products are designed with data reduction features. The common component among these products is the Albireo index - a hash datastore. Three products in the Albireo family range from an embedded SDK (offering integration with existing storage) to a ready-to-deploy appliance.
Albireo SDK – a software development kit designed to add data deduplication to hardware devices or software applications that benefit from sharing duplicate chunks.
Albireo VDO – a drop-in data efficiency solution for Linux architectures. VDO provides fine-grained (4 KB chunk), inline deduplication, thin provisioning, compression and replication.
Albireo SANblox – a ready-to-run data efficiency appliance that integrates data deduplication and data compression transparently into Fibre Channel SAN environments.
History
Permabit was founded as Permabit Inc. in 2000 by a technical and business team from Massachusetts Institute of Technology. The company went through a management buyout in 2007 and a new business entity, Permabit Technology Corporation, was formed at that time.
Permabit’s first product, Permabit Enterprise Archive (originally known as Permeon) was a multi-PB scalable, content-addressable, scale-out storage product, first launched in 2004. Enterprise Archive utilized in-house developed technologies in the areas of capacity optimization, WORM, storage management and data protection.
In 2010, Permabit launched the Albireo family of products which focus on licensing Permabit data efficiency and management innovations to original equipment manufacturers, software vendors and online service providers. Publicly acknowledged companies that offer Albireo-based solutions include Dell EMC, Hitachi Data Systems, IBM, NEC, and NetApp.
In 2016, Permabit launched its data reduction software for data center organizations that utilize the Linux operating system in Cloud Computing environments.
On July 31, 2017, Red Hat announced that it has acquired the assets and technology of Permabit Technology Corporation.
References
.
Red Hat
Software companies established in 2000
Software companies disestablished in 2017
Defunct software companies of the United States
Software companies based in Massachusetts
Computer storage companies |
https://en.wikipedia.org/wiki/List%20of%20acronyms%3A%20P | (Main list of acronyms)
p – (s) pico
P – (s) Peta – Phosphorus
P0–9
P2P – (i) Peer-to-peer (networking)
P3I or P3I – (i) PrePlanned Product Improvement
PA
pa – (s) Punjabi language (ISO 639-1 code)
pA – (s) picoampere
Pa
(s) pascal
Protactinium
PA
(a/i) Pamela Anderson
(s) Panama (ISO 3166 digram)
Paraguay (FIPS 10-4 country code)
(i) Partial Agonist
(s) Pennsylvania (postal symbol)
petampere
(i) PolyAmide (Nylon)
Prince Albert piercing
Public Address (vocal amplification system)
Public Affairs
PA 6 – (s) Nylon 6 (PolyAmide) (similarly for PA 11, 12, 46, 66, 610)
PAA – (i) Position Area for Artillery
PAB – (s) Panamanian balboa (ISO 4217 currency code)
PABX – (p) Private Automated Branch eXchange (company phone system)
PAC
(i) Pan Africanist Congress
(a) Partial Solar Calibrator
Patriot Advanced Capabilities
Political action committee
(a/i) Primary Auditory Cortex
PACER – (a) Public Access to Court Electronic Records (U.S. federal courts)
PACOM – (p) (U.S.) Pacific Command
PADD
(a) Personal Access Display Device (as seen in the Star Trek franchise)
Petroleum Administration for Defense Districts, used for data collection in the U.S. petroleum industry
PADI – (a) Professional Association of Diving Instructors
PAEK – (i) PolyArylEtherKetone
PAFC – (i) Plymouth Argyle Football Club
PAH – (i) Polycyclic aromatic hydrocarbon
PAHO – (i) Pan American Health Organization
PAI
(i) PolyAmide Imide
Pre-Approval Inspection (pharma)
PAK – (s) Pakistan (ISO 3166 trigram)
Pakistan – (p) Punjab, Afghan states, Kashmir, sIndh, baluchiSTAN
PAL
(a) Phase Alternating Line (TV standard)
(p) Philippine Airlines
PAM – (a/i) Precision Attack Missile
Pamida – (p) Patrick, Michael, and David, sons of the department store chain's co-founder Jim Witherspoon
PAMELA
(a) Payload for Antimatter Matter Exploration and Light-nuclei Astrophysics
(a) Pedestrian Accessibility and Movement Environment Laboratory
pan – (s) Punjabi language (ISO 639-2 code)
PAN
(s) Panama (ISO 3166 trigram)
(a) Partai Amanat Nasional (Indonesian, "National Mandate Party") – Indonesian political party
Partido Acción Nacional (Spanish, "National Action Party") – political parties in El Salvador, Mexico, and Nicaragua
Partido de Avanzada Nacional (Spanish, "National Advancement Party") – Guatemalan political party
Personal area network
(i) PolyAcryloNitrile
(a) Programa de Asistencia Nutricional (Spanish, "Nutritional Assistance Program") – U.S. federal program for nutritional needs of poor families in Puerto Rico
PANS – (a) Pretty Advanced/Awesome Network Services (cf. POTS)
Pan-STARRS – (p) Panoramic Survey Telescope And Rapid Response System
PAO
(i) Panathinaikos Athlitikos Omilos (Greek: Παναθηναϊκός Αθλητικός Όμιλος, "Pan-Athenian Athletic Club")
(a/i) Poly Alpha Olefin
Public Affairs Officer
PAOK – (i) Panthessalonikeios Athlitikós Ómilos Konstantinoupoliton (Greek Πανθεσσαλονίκειος Αθλητικός Όμιλος Κωνσταντινοπολιτών, "Pan-The |
https://en.wikipedia.org/wiki/Timeout%20%28computing%29 | In telecommunications and related engineering (including computer networking and programming), the term timeout or time-out has several meanings, including:
A network parameter related to an enforced event designed to occur at the conclusion of a predetermined elapsed time.
A specified period of time that will be allowed to elapse in a system before a specified event is to take place, unless another specified event occurs first; in either case, the period is terminated when either event takes place. Note: A timeout condition can be canceled by the receipt of an appropriate time-out cancellation signal.
An event that occurs at the end of a predetermined period of time that began at the occurrence of another specified event. The timeout can be prevented by an appropriate signal.
Timeouts allow for more efficient usage of limited resources without requiring additional interaction from the agent interested in the goods that cause the consumption of these resources. The basic idea is that in situations where a system must wait for something to happen, rather than waiting indefinitely, the waiting will be aborted after the timeout period has elapsed. This is based on the assumption that further waiting is useless, and some other action is necessary.
Examples
Specific examples include:
In the Microsoft Windows and ReactOS command-line interfaces, the timeout command pauses the command processor for the specified number of seconds.
In POP connections, the server will usually close a client connection after a certain period of inactivity (the timeout period). This ensures that connections do not persist forever, if the client crashes or the network goes down. Open connections consume resources, and may prevent other clients from accessing the same mailbox.
In HTTP persistent connections, the web server saves opened connections (which consume CPU time and memory). The web client does not have to send an "end of requests series" signal. Connections are closed (timed out) after five minutes of inactivity; this ensures that the connections do not persist indefinitely.
In a timed light switch, both energy and lamp's life-span are saved. The user does not have to switch off manually.
Tablet computers and smartphones commonly turn off their backlight after a certain time without user input.
See also
Fibre Channel time out values
Human-Machine Interaction
Permanent signal
References
Further reading
Computer programming
Telecommunications engineering
Computer networking |
https://en.wikipedia.org/wiki/RAM%20image | A RAM image is a sequence of machine code instructions and associated data kept permanently in the non-volatile ROM memory of an embedded system, which is copied into volatile RAM by a bootstrap loader. Typically the RAM image is loaded into RAM when the system is switched on, and it contains a second-level bootstrap loader and basic hardware drivers, enabling the unit to function as desired, or else more sophisticated software to be loaded into the system.
Embedded systems |
https://en.wikipedia.org/wiki/PC-UX | PC-UX is a discontinued NEC port of UNIX System III for their APC III and PC-9801 personal computer. It had extensive graphics capability. PC-UX and MS-DOS could reside on the same hard drive. It also had file transfer utilities that allowed files between PC-UX and MS-DOS.
In 1985, the suggested retail price for PC-UX on APC III was $700.
NEC's subsequent port of UNIX System V was called PC-UX/V.
See also
Xenix for AT etc.
References
Discontinued operating systems
NEC software
Unix variants
X86 operating systems |
https://en.wikipedia.org/wiki/One%20Fish%2C%20Two%20Fish%2C%20Blowfish%2C%20Blue%20Fish | "One Fish, Two Fish, Blowfish, Blue Fish" is the eleventh episode of the second season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on January 24, 1991. In the episode, Homer consumes a poisonous fugu fish at a sushi restaurant and is told he has less than 24 hours to live. He accepts his fate and tries to do everything on his bucket list before he dies.
The episode was written by Nell Scovell and directed by Wes Archer. It features guest appearances from Larry King, George Takei, Sab Shimono, Joey Miyashima, and Diane Tanaka. The episode was selected for release in a video collection of selected episodes, titled The Last Temptation Of Homer, which was released November 9, 1998. The episode features cultural references to songs such as "Theme from Shaft", "Gypsies, Tramps & Thieves", and "When the Saints Go Marching In".
Since airing, the episode has received mostly positive reviews from television critics. It acquired a Nielsen rating of 14.1, and was the highest-rated show on Fox the week it aired.
Plot
At a sushi bar, Homer orders sushi made from fugu, a deadly venomous pufferfish. While the master chef is making out with Edna Krabappel behind the restaurant, an apprentice prepares the fish to remove its toxic organs. After Homer swallows the sushi, the waiter Akira warns him he may have been poisoned.
At the hospital, Dr. Hibbert informs Homer and Marge that Homer likely has only 22 hours to live. That night, Homer tells Marge he will refrain from telling Bart and Lisa the bad news. He makes a list of things he wants to do before he dies.
After oversleeping on his last day, Homer attempts to tackle the things on his list. He has a man-to-man talk with Bart, listens to Lisa play her saxophone, and borrows Ned's camcorder to make a video of himself for Maggie to watch when she is older. Homer reconciles with his father, Abe, which takes up far more time than he expects and forces him to skip some of the other things on his list.
When arrested for speeding, Homer demands officers Lou and Eddie write him a ticket, thinking he will avoid the fine by dying. The officers are rankled by Homer's snarky attitude and throw him in a police cell. After Barney pays his bail to Chief Wiggum, Homer insults his boss, Mr. Burns, and has a last drink at Moe's Tavern, causing him to miss dinner with his family. He hurries home in time to say goodbye to his children and "snuggle" with Marge.
At midnight, Homer quietly leaves his bed and bids each family member goodbye while they sleep. He sits glumly in the living room listening to Larry King read the Bible on tape. The next morning, Marge finds Homer collapsed in the armchair, realizes that his drool is still warm, and wakes him to joyfully inform him he is still alive. Homer celebrates and vows to live life to its fullest. He resumes his life, watching a televised bowling tournament while eating pork rinds.
Production
The episode |
https://en.wikipedia.org/wiki/Berkman%20Klein%20Center%20for%20Internet%20%26%20Society | The Berkman Klein Center for Internet & Society is a research center at Harvard University that focuses on the study of cyberspace. Founded at Harvard Law School, the center traditionally focused on internet-related legal issues. On May 15, 2008, the center was elevated to an interfaculty initiative of Harvard University as a whole. It is named after the Berkman family. On July 5, 2016, the center added "Klein" to its name following a gift of $15 million from Michael R. Klein.
History and mission
The center was founded in 1996 as the "Center on Law and Technology" by Jonathan Zittrain and Professor Charles Nesson. This built on previous work including a 1994 seminar they held on legal issues involving the early Internet. Professor Arthur Miller and students David Marglin and Tom Smuts also worked on that seminar and related discussions. In 1997, the Berkman family underwrote the center, and Lawrence Lessig joined as the first Berkman professor. In 1998, the center changed its name to the "Berkman Center for Internet & Society at Harvard Law School." Since then, it has grown from a small project within Harvard Law School to a major interdisciplinary center at Harvard University. The Berkman Klein Center seeks to understand how the development of Internet-related technologies is inspired by the social context in which they are embedded and how the use of those technologies affects society in turn. It seeks to use the lessons drawn from this research to inform the design of Internet-related law and pioneer the development of the Internet itself. The Berkman Klein Center sponsors Internet-related events and conferences, and hosts numerous visiting lecturers and research fellows.
Members of the center teach, write books, scientific articles, weblogs with RSS 2.0 feeds (for which the Center holds the specification), and podcasts (of which the first series took place at the Berkman Klein Center). Its newsletter, The Buzz, is on the Web and available by e-mail, and it hosts a blog community of Harvard faculty, students, and Berkman Klein Center affiliates.
The Berkman Klein Center faculty and staff have also conducted major public policy reviews of pressing issues. In 2008, John Palfrey led a review of child safety online called the Internet Safety Technical Task Force. In 2009, Yochai Benkler led a review of United States broadband policy. In 2010, Urs Gasser, along with Palfrey and others, led a review of Internet governance body ICANN, focusing on transparency, accountability, and public participation.
Projects and initiatives
The Berkman Klein Center's main research topics are Teens and Media, Monitoring, Privacy, Digital art, Internet Governance, Cloud Computing and Internet censorship. The Berkman Klein Center supports events, presentations, and conferences about the Internet and invites scientists to share their ideas.
Lumen
Lumen, formerly Chilling Effects, is a collaborative archive created by Wendy Seltzer that allows recipients of ceas |
https://en.wikipedia.org/wiki/Dilution%20of%20precision%20%28computer%20graphics%29 | Dilution of precision is an algorithmic trick used to handle difficult problems in hidden-line removal, caused when horizontal and vertical edges lie on top of each other due to numerical instability. Numerically, the severity escalates when a CAD model is viewed along the principal axis or when a geometric form is viewed end-on. The trick is to alter the view vector by a small amount, thereby hiding the flaws. Unfortunately, this mathematical modification introduces new issues of its own, namely that the exact nature of the original problem has been destroyed, and visible artifacts of this kludge will continue to haunt the algorithm. One such issue is that edges that were well defined and hidden will now be problematic. Another common issue is that the bottom edges on circles viewed end-on will often become visible and propagate their visibility throughout the problem.
External links
http://wheger.tripod.com/vhl/vhl.htm
3D computer graphics |
https://en.wikipedia.org/wiki/The%20X%20Factor%20%28Australian%20TV%20series%29 | The X Factor is an Australian television reality music competition, based on the original UK series, to find new singing talent. The first season of the show premiered on Network Ten on 6 February 2005. Ten dropped The X Factor after the first season due to its poor ratings. In 2010, the Seven Network won the rights to the show, and a second season went into production. The X Factor was renewed after the highly successful Australian Idol was no longer broadcast on Network Ten. The X Factor was produced by FremantleMedia Australia, and was broadcast on the Seven Network in Australia and on TV3 in New Zealand. The program was cancelled after its eighth season in 2016.
The original judging panel line-up in 2005 consisted of Mark Holden, Kate Ceberano, and John Reid. When the show was revived in 2010, the judging panel was replaced by Natalie Imbruglia, Ronan Keating, Kyle Sandilands and Guy Sebastian. Imbruglia and Sandilands did not return for season three and were replaced by Natalie Bassingthwaighte and Mel B. Redfoo and Dannii Minogue joined the panel in season five as replacements for Sebastian and Mel B. Sebastian returned to the panel in season seven along with new judges James Blunt and Chris Isaak, as replacements for Keating, Bassingthwaighte and Redfoo. The judging panel will see changes once again for season eight as Minogue has announced her departure. On 12 June 2016 it was announced that Iggy Azalea would be a judge in season eight. It was then later announced that Adam Lambert would be joining the judging panel as well as Guy Sebastian and Mel B returning as the underdog judge.
During the televised audition phases of The X Factor, originally the contestants sang in an "audition room" in front of only the judges, however, from season two onwards all auditionees sing on stage in an arena, in front of the judges and a live audience. The successful acts then progress to the next stage of the competition, "bootcamp" and later "home visits", where the judges narrow their category down to three acts who continued to the live shows, where the public vote for their favourite act, following weekly performances by the contestants.
There have been eight winners: Random, Altiyan Childs, Reece Mastin, Samantha Jade, Dami Im, Marlisa Punzalan, Cyrus Villanueva and Isaiah Firebrace. Winners received a recording contract with record label Sony Music Australia. In season three, the winner also received a management contract, and in season four, a Nissan Dualis car. Each winning contestant's single has charted within the top-ten of the ARIA Singles Chart, only Mastin's, Jade's and Im's singles have reached number one. There have also been a number of hit singles released by other contestants who have appeared on The X Factor. The show has received numerous awards and nominations, including five Logie Award nominations, of which it has won one for Most Outstanding Light Entertainment Program.
History
The X Factor was created by Simon Cowell in the |
https://en.wikipedia.org/wiki/Comedy%20Central%20%28British%20TV%20channel%29 | Comedy Central is a British pay television channel that carries comedy programming, both original and syndicated. This channel is specific to audiences within the United Kingdom and Ireland. The channel is aligned with the original US version of the channel. The channel started as The Paramount Channel in 1995, before rebranding as the Paramount Comedy Channel in 1997 and again as Paramount Comedy 1 in 2004 before finally becoming Comedy Central on 6 April 2009.
History
1995–1997
The channel was launched as The Paramount Channel on 1 November 1995. The original schedule was a mixture of comedy and drama, including such eclectic offerings as Beauty and the Beast, several Japanese anime productions acquired from Manga Entertainment, and authentic Paramount archive programming such as The Magician, as well as Nickelodeon's Ren & Stimpy, which was shown on Paramount rather than Nickelodeon due to its rather adult nature at times. It originally aired every evening after Nickelodeon's closing at 7:00pm until around 4:00am, with a testcard featuring a chicken crossing the road and holding up traffic airing during downtime (a segment deemed as "Chicken Tonite") until Nickelodeon started up at 6:00am.
1997–2009
In February 1997, the Paramount Channel became the Paramount Comedy Channel, a channel dedicated solely to comedy.
With expansion of Sky Digital on 4 February 2001, the channel no longer shared air time with Nickelodeon and started broadcasting with a daytime schedule beginning broadcasts at 9:00am. On 1 July 2002, the channel renamed itself Paramount Comedy. By 2005, with the timeshift channel Paramount Comedy 2 having gone on the air in 2003, the primary channel was renamed as Paramount Comedy 1.
2009–present
On 17 February 2009, it was confirmed that Paramount Comedy 1 would become Comedy Central from 6 April 2009 in the UK and Ireland. Since season 13, Comedy Central has aired new episodes of South Park two days after they aired in the US (i.e., the episodes air on Comedy Central US on Wednesdays, and air on the UK counterpart on Fridays.) At 9:00pm on 6 April, Paramount Comedy 1 was finally relaunched as Comedy Central, with the last programme on PC1 being an episode of Scrubs and the first programme on Comedy Central being a new episode of Two and a Half Men. Comedy Central idents from this era were filmed in locations such as The Gherkin, Forth Bridge and Nelson's Column.
Subsidiary channels
After no longer having to timeshare with Nickelodeon, the station increased its broadcasting hours, and was joined by Paramount Comedy 2 (later rebranded as Comedy Central Extra) on 1 September 2003.
A one-hour timeshift, Paramount Comedy 1 +1 (now Comedy Central +1) was launched on Sky channel 127 on 30 August 2005 and Virgin Media channel 133 shortly after.
A high-definition version, Comedy Central HD, launched on 9 August 2010 on Sky channel 222. On 1 September 2010 the channel also became available on Virgin Media channel 133. Comedy C |
https://en.wikipedia.org/wiki/FreeS/WAN | FreeS/WAN, for Free Secure Wide-Area Networking, was a free software project, which implemented a reference version of the IPsec network security layer for Linux. The project goal of ubiquitous opportunistic encryption of Internet traffic was not realized, although it did contribute to general Internet encryption.
The project was founded by John Gilmore, and administered for most of its duration by Hugh Daniel. John Ioannidis and Angelos Keromytis started the codebase while outside the United States of America prior to autumn 1997. Technical lead for the project was Henry Spencer, and later Michael Richardson. The IKE keying daemon (pluto) was maintained by D. Hugh Redelmeier while the IPsec kernel module (KLIPS) was maintained by Richard Guy Briggs. Sandy Harris was the main documentation person for most of the project, later Claudia Schmeing.
The final FreeS/WAN version 2.06 was released on 22 April 2004. The earlier version 2.04 was forked to form two projects, Openswan and strongSwan. Openswan has since (2012) been forked to Libreswan.
External links
Project website
Documentation
Free security software
History of software
IPsec |
https://en.wikipedia.org/wiki/The%20Assembly%20Line | The Assembly Line was a British video game development company which created games for the Atari ST, Commodore 64 and Amiga systems. Recognized for the quality of its programming, it mostly created 3D action or puzzle games.
Games
Xenon 2 Megablast (coded by The Assembly Line, designed by the Bitmap Brothers)
Interphase
Cybercon III
Pipe Mania also known as Pipe Dream
E-Motion also known as The Game of Harmony and Sphericule
Vaxine
Helter Skelter
Stunt Island (Published by Disney Interactive)
Developers
Developers include:
Andy Beveridge
Adrian Stephens
Martin Day
John Dale
References
Defunct video game companies of the United Kingdom
Video game development companies |
https://en.wikipedia.org/wiki/Log%E2%80%93log%20plot | In science and engineering, a log–log graph or log–log plot is a two-dimensional graph of numerical data that uses logarithmic scales on both the horizontal and vertical axes. Power functions – relationships of the form – appear as straight lines in a log–log graph, with the exponent corresponding to the slope, and the coefficient corresponding to the intercept. Thus these graphs are very useful for recognizing these relationships and estimating parameters. Any base can be used for the logarithm, though most commonly base 10 (common logs) are used.
Relation with monomials
Given a monomial equation taking the logarithm of the equation (with any base) yields:
Setting and which corresponds to using a log–log graph, yields the equation:
where m = k is the slope of the line (gradient) and b = log a is the intercept on the (log y)-axis, meaning where log x = 0, so, reversing the logs, a is the y value corresponding to x = 1.
Equations
The equation for a line on a log–log scale would be:
where m is the slope and b is the intercept point on the log plot.
Slope of a log–log plot
To find the slope of the plot, two points are selected on the x-axis, say x1 and x2. Using the above equation:
and
The slope m is found taking the difference:
where F1 is shorthand for F(x1) and F2 is shorthand for F(x2). The figure at right illustrates the formula. Notice that the slope in the example of the figure is negative. The formula also provides a negative slope, as can be seen from the following property of the logarithm:
Finding the function from the log–log plot
The above procedure now is reversed to find the form of the function F(x) using its (assumed) known log–log plot. To find the function F, pick some fixed point (x0, F0), where F0 is shorthand for F(x0), somewhere on the straight line in the above graph, and further some other arbitrary point (x1, F1) on the same graph. Then from the slope formula above:
which leads to
Notice that 10log10(F1) = F1. Therefore, the logs can be inverted to find:
or
which means that
In other words, F is proportional to x to the power of the slope of the straight line of its log–log graph. Specifically, a straight line on a log–log plot containing points (F0, x0) and (F1, x1) will have the function:
Of course, the inverse is true too: any function of the form
will have a straight line as its log–log graph representation, where the slope of the line is m.
Finding the area under a straight-line segment of log–log plot
To calculate the area under a continuous, straight-line segment of a log–log plot (or estimating an area of an almost-straight line), take the function defined previously
and integrate it. Since it is only operating on a definite integral (two defined endpoints), the area A under the plot takes the form
Rearranging the original equation and plugging in the fixed point values, it is found that
Substituting back into the integral, you find that for A over x0 to x1
Therefore,
For m = −1, |
https://en.wikipedia.org/wiki/Integral%20%28disambiguation%29 | Integral is a concept in calculus.
Integral may also refer to:
in mathematics
Integer, a number
Integral symbol
Integral (measure theory), or Lebesgue integration
Integral element
in computer science
Integral data type, a data type that represents some range of mathematical integers
in philosophy and spirituality
Integral humanism (India), political philosophy in Hindu nationalism
Integral theory, an area of discourse emanating from Ken Wilber's thought on spiritual evolution, methodology and ontology. Also known under other names, including integral philosophy, integral worldview, etc.
Integral Culture, transmodern subculture referred to by sociologist Paul H. Ray
as a proper name
INTEGRAL, the International Gamma-Ray Astrophysics Laboratory
Intégral: The Journal of Applied Musical Thought, a music-theory journal
"Integral (song)", a Pet Shop Boys song from Fundamental
The Integral, a glass spaceship in Yevgeny Zamyatin's novel We
Integral (horse), a British Thoroughbred racehorse
Integral, an extended play by The Sixth Lie
Integral (album)
Integral (train), diesel multiple unit train type
See also
Integralism, ideology according to which a nation is an organic unity
Integrality, in commutative algebra, the notions of an element integral over a ring
Integration (disambiguation) |
https://en.wikipedia.org/wiki/Stirling%20railway%20station%2C%20Perth | Stirling railway station is a railway station on the Transperth network. It is located on the Joondalup line, nine kilometres from Perth station serving the suburb of Stirling.
History
Stirling station opened on 28 February 1993 in the median strip of the Mitchell Freeway. Before Stirling was constructed, the Northern Suburbs Transit System considered a deviation of the rail alignment to directly service Innaloo and its shopping district. However, this idea was rejected by both the project coordinators and the public at large due to the significant cost, lack of identifiable benefits, and environmental impact. The station's location presented some interesting design challenges as the road reserve for the future Stephenson Highway ran in an area directly over the station at the southern end of its platforms. During the design of the station and its approach roads, the engineering firm Ove Arup & Partners was tasked with investigating and designing road layouts to accommodate for both future and current needs.
Innaloo bus station on Oswald Street was the terminus for most bus routes until 1992; these now terminate at Stirling station. A pair of crossovers link the two mainline tracks at the Perth end of the station, allowing the turnback of train services in the event of a disruption in either direction.
In 2003, the contract for extending the platforms on seven Joondalup line stations, including Stirling station, was awarded to Lakis Constructions. The platforms on these stations had to be extended by to accommodate long six car trains, which were planned to enter service. Along with the extensions, the platform edges were upgraded to bring them into line with tactile paving standards. Work on this station was done in mid-2004.
On 12 December 2020 the WA Government announced a $90 million upgrade to the Stirling Bus Interchange. The upgrade will increase the station's number of bus stands from 18 to 30, with completion expected in late 2023.
Services
Stirling station is served by Transperth Joondalup line services.
Stirling station saw 1,468,098 passengers in the 2013–14 financial year. In March 2018, Stirling station had approximately 4,700 boardings per weekday, making it the third busiest station on the Joondalup line.
Platforms
Platforms currently in use are as follows:
Bus routes
References
External links
Joondalup line
Transperth railway stations
Railway stations in Australia opened in 1993
City of Stirling
Transperth railway stations in highway medians
Transperth bus stations |
https://en.wikipedia.org/wiki/Clarkson%20railway%20station%2C%20Perth | Clarkson railway station is a commuter rail station in Clarkson, a suburb of Perth, Western Australia. It is on the Joondalup line, which is part of the Transperth network. Located in the median of the Mitchell Freeway, the station consists of an island platform connected to the west by a pedestrian footbridge. A six stand bus interchange and two carparks are located near the entrance.
Planning for an extension of the Joondalup line north of Currambine railway station was underway by 1995. The government committed to an extension to Clarkson the following year, and a plan detailing the extension was released in 2000. The first contract for the project, a $14 million earthworks contract, was awarded to Brierty Contractors in March 2001. In April 2002, Barclay Mowlem and Alstom were awarded a contract worth $17 million to design and build the extension's rail infrastructure, and in November 2002, a $8.7million contract was awarded to Transfield for the construction of the station. The station opened on 4 October 2004, with five new Transperth B-series trains entering service that day. The following day, bus services in the area were realigned to feed into Clarkson station. On 3 September 2013, there was a minor train crash at Clarkson station. On 21 September 2014, an extension of the Joondalup line north to Butler railway station was opened.
Clarkson station is from Perth Underground station, with train journeys there taking 32 minutes. Train headways reach as low as five minutes during peak hour, with off peak services at 15 minute headways. There are six bus routes that serve Clarkson station.
Description
Clarkson railway station is in the median of the Mitchell Freeway along the Joondalup line. It is owned by the Public Transport Authority (PTA), a state government agency, and is part of the Transperth system. The station is in Clarkson, a suburb of Perth, Western Australia. It is , or a 32-minute train journey, from Perth Underground station, placing the station in fare zone four. The next station to the north is Butler railway station, which is the terminus of the Joondalup line, and the next station to the south is Currambine railway station.
The station consists of two platform faces on a single island platform. The platform is long, or long enough for a Transperth six-car train – the longest trains used on the network. The platforms are linked to the west by a pedestrian bridge. To the east is Neerabup National Park, and so there is no access to the east. The pedestrian bridge is linked to the platforms by stairs, a lift and a set of escalators. On the western side is a six-stand bus interchange, a drop off area and two carparks. The carparks have 1,059 standard bays, 10 short term parking bays and 20 motorcycle bays. At the entrance building is a transit officer booth, toilets and bicycle parking shelters. Clarkson is listed as an independent access station on the Transperth website as the platform can be accessed using lifts, the |
https://en.wikipedia.org/wiki/Greenwood%20railway%20station | Greenwood railway station is a railway station on the Transperth network. It is located on the Joondalup line, from Perth station serving the suburb of Greenwood.
History
The station was originally proposed as the Hepburn station under the Northern Suburbs Transit System Masterplan in 1989 to coincide with the Hepburn Heights development. The master plan placed the station as a future station until demand of the railway and suburbs warranted the construction of the station.
After being promised a number of times but not delivered, construction finally began in 2004 with the aim of reducing peak demand at the nearby Warwick and Whitfords stations, opening on 29 January 2005.
Services
Greenwood station is served by Transperth Joondalup line services.
Greenwood station saw 611,508 passengers in the 2013–14 financial year. In March 2018, Greenwood station had approximately 2,350 boardings on an average weekday, making it the third least used station on the Joondalup line.
Platforms
Platforms currently in use are as follows:
Bus routes
Buses were provided at Greenwood station under trial by routes 451 to Kingsway Shopping Centre and 456 to Hillarys Boat Harbour, however both services were ultimately unsuccessful and withdrawn. Now the station is only served by rail replacement buses.
References
External links
Joondalup line
Transperth railway stations
Railway stations in Australia opened in 2005
Transperth railway stations in highway medians |
https://en.wikipedia.org/wiki/Empress%20Elisabeth%20Railway | The Empress Elisabeth Railway (, KEB) was the name of a former railway company during the time of the Austro-Hungarian monarchy. Its rail network was centred on the Western Railway line from Vienna to Salzburg with a branch to Passau. The company was nationalised by the Imperial Royal Austrian State Railways in 1884.
History
On 21 June 1851 the Austrian Empire and the Kingdom of Bavaria signed a treaty to build a railway line from Vienna via Salzburg to Munich, and also agreed upon an extension from Rosenheim via Kufstein to Innsbruck as well as the continuation of the railroad from Nuremberg via Regensburg and Passau to Linz. First plans were set up at the behest of the industrialist Hermann Dietrich Lindheim (1790–1860), who together with the German businessman Ernst Merck (1811–1863) founded the Kaiserin Elisabeth-Bahn railway company, named after Empress Elisabeth of Austria.
Funded by Salomon Mayer von Rothschild (1774 –1855) and his Creditanstalt, the k.k. privilegierte Kaiserin-Elisabeth-Bahn was changed into a public limited company in 1856. A second state treaty between Austria and Bavaria fixed the line from Vienna to Linz, which was built between 1856 and 1858, and the extensions from Linz to Salzburg and Passau, opened in 1860 and 1861. The KEB was awarded a 90-year-licence to build and operate the railway
The company was nationalized in 1884 and is today operated by the Austrian Federal Railways.
The line today
Since World War I, the former Gisela Railway from Salzburg via Zell am See to Wörgl, the North Tyrolean Railway (Kufstein-Innsbruck, operated by the Austrian Southern Railway until 1923) and the Arlberg railway have been understood as part of the Western Railway. Vienna West Station was heavily damaged in World War II and reconstructed until 1952, when the railway had been equipped with electrical power lines.
Today, ICE trains and Austrian Railjet (ÖBB Railjet description) trains run on it, but most time below 200 km/h. The railway is being upgraded and partially rebuilt, and will partly allow speeds up to 230 km/h.
In numismatics
Empress Elisabeth Western Railway was recently selected as a main motif for a high value collectors' coin: the Empress Elisabeth Western Railway commemorative coin. The obverse shows the steam locomotive kkStB 306.01 crossing a railroad bridge on the Austrian Western Railway path. The locomotive was developed by Karl Gölsdorf in 1908.
References
Western
Railway lines opened in 1858 |
https://en.wikipedia.org/wiki/RKWard | RKWard is a transparent front-end to the R programming language, a scripting-language with a strong focus on statistics functions. RKWard tries to combine the power of the R language with the ease of use of commercial statistical packages.
RKWard is written in C++ and although it can run in numerous environments, it was designed for and integrates the KDE desktop environment with the Qt (software) libraries.
Features
RKWard's features include
Spreadsheet-like data editor
Syntax highlighting, code folding and code completion
Data import (e.g. SPSS, Stata and CSV)
Plot preview and browsable history
R package management
Workspace browser
GUI dialogs for all kinds of statistics and plots
Interface
RKWard aims to be easy to use, both for people with deep knowledge of R, and for users who, although they have experience in statistics, are not familiar with the language. The application design offers the possibility of using the graphic tools as well as ignoring many of them and using the program as integrated development environment.
It includes a workspace viewer, which gives access to packages, functions and variables loaded by R or imported from other sources. It also has a file viewer, and data set editing windows, display of the contents of the variables, help, command log and HTML output.
It also offers components that help in code editing and direct order execution, such as the script window and the R console, where you can enter complete commands or programs as you would in the original R text interface. It provides additional help such as syntax coloring documentation of functions while writing, and includes the feature of capturing graphs or emerging dialogs produced by offering additional options for handling, saving and exporting them.
Package Management
The R package management is carried out through a configuration dialog that allows one to, either automatically (because a plug-in requires it) or manually, install new packages from the repository's official project, update existing ones, delete them or upload / download them from the workspace.
Add-ons system
Thanks to its add-ons system RKWard constantly expands the number of functions that can be accessed without writing the code directly. These components allow, from a graphical user interface, instructions to be generated in R for the most common or complex statistical operations. In this way, even without having deep knowledge about the language it is possible to perform advanced data analysis or elaborated graphs. The results of the computations are formatted and presented as HTML, making it possible, with a single click and drag, to export tables and graphs to, for example, office suites.
rk.Teaching
RKTeaching (stylized as rk.Teaching) is a package specially designed for use in teaching and learning statistics, integrating modern packages (such as R2HTML, plyr and ggplot2 among others) as RKWard native outputs. As of 2020, RKTeaching is in version 1.3.0.
See also
|
https://en.wikipedia.org/wiki/Windows%20Messenger%20service | Messenger service is a network-based system notification Windows service by Microsoft that was included in some earlier versions of Microsoft Windows.
This retired technology, although it has a similar name, is not related in any way to the later, Internet-based Microsoft Messenger service for instant messaging or to Windows Messenger and Windows Live Messenger (formerly named MSN Messenger) client software.
Utilities
WinPopup sends messages from one Windows computer to another on the same LAN. It is available in all Windows versions from Windows for Workgroups (Ver 3.11) to Windows ME, but has never been included with Windows NT-based operating systems. WinPopup works by means of the NetBEUI protocol.
There is also a port to Linux with an extended feature called LinPopUp, which allows adding Linux computers to the set. Linpopup is an X Window graphical port of Winpopup, and a package for Debian linux. It runs over Samba. Linpopup does not have to run all the time, can run minimized, and its messages are encrypted with a strong cypher. The traditional Unix functional equivalent of WinPopUp would be the wall and write commands.
Uses
The Messenger Service was originally designed for use by system administrators to notify Windows users about their networks. It was used maliciously to present pop-up advertisements to users over the Internet (by using mass-messaging systems which sent a desired message to a specified range of IP addresses). Even though Windows XP included a firewall, it was not enabled by default. Because of this, many users received such messages. As a result of this abuse, the Messenger Service was disabled by default in Windows XP Service Pack 2.
The Messenger Service was discontinued in Windows Vista and Windows Server 2008 and replaced by the old MSG.exe.
Architecture
The Messenger service in Windows 2000 and Windows XP uses the NetBIOS over TCP/IP (NetBT) protocol. The service waits for a message, then it displays it onscreen. The alternative way to send a message is to write it to a MailSlot named messngr. It requires UDP ports 135, 137, and 138 and TCP ports 135, 139, and 445 to work. If access to the ports from outside a network is not blocked, it can lead to the aforementioned spam issue. In Windows NT 3.5, NT 3.51 and NT 4.0, Messenger used the older NetBIOS protocol. (NetBIOS is not installed with Windows 2000.)
Messenger service can be used by either Net Send command from a command-line interface. In addition, the Alerter service uses Messenger to send administrative alerts to network subscribers.
See also
Comparison of LAN messengers
LAN messenger
Alerter service
List of Microsoft Windows components
Messaging spam
References
External links
Official Microsoft sources
Knowledgebase entry for Messenger Service of Windows
Command documentation for Net send
Disabling The Messenger Service in Windows XP
Windows services
LAN messengers |
https://en.wikipedia.org/wiki/Channel%204%20%28disambiguation%29 | Channel 4 is a British television station, operated by the Channel Four Television Corporation.
Channel 4 may also refer to:
Television networks, channels and stations
TV4 (Algerian TV channel), fourth Algerian public television channel, operated by EPTV Group
Channel 4 (Australian TV channel), a digital free-to-air electronic program guide
Canal 4 (Salvadoran TV channel), operated by Telecorporación Salvadoreña
IRIB TV4, operated by Islamic Republic of Iran Broadcasting
Canal 4 (Nicaraguan TV channel), a national television channel in Nicaragua
Canal 4 (Uruguayan TV channel), formerly known as Monte Carlo TV, a Uruguayan television channel
Canal 4 Navarra, a former television channel in Spain
4SD, a San Diego sports broadcasting network
4RD, a public TV channel in the Dominican Republic owned by Corporación Estatal de Radio y Televisión
Cuatro (TV channel), a Spanish television network launched in November 2005
DWGT-TV Channel 4, the flagship television station of the People's Television Network in the Philippines
La Red (Chilean TV channel) a Chilean television channel broadcasting on Channel 4 in Santiago de Chile
MBC 4, in the Middle East
Channel 9 MCOT HD, name that replaced channel 4 of Thailand
Nelonen (television) (4), a Finnish broadcaster
RTS (Ecuadorian TV channel), a private Ecuadorian TV network
Rete 4, Italian for Network 4, the fourth television channel in Italian analogue terrestrial television
S4C (Sianel Pedwar Cymru, 'Channel Four Wales'), a Welsh-language television station
E4 (TV channel), British television channel of Channel 4
TG4, Teilifís na Gaeilge, an Irish-language broadcaster
BBC Four, British television channel of the BBC
Canal Cuatro, former name of Peruvian television station América Televisión
Cuatro Televisión, former name of Paraguayan televisión station Telefuturo
Venevisión, a Venezuelan television channel broadcasting on Channel 4 in Caracas, Venezuela
WAPA-TV Channel 4, an independent television station in San Juan, Puerto Rico
WNBC-TV Channel 4, an NBC-affiliated television station in New York City, United States
XHTV-TDT Channel 4, a television station in Mexico City, flagship of Foro TV network
Other uses
Channel 4 (VoD service), a video on demand service formerly known as All 4
Channel 4 FM, a radio station in the United Arab Emirates
Channel 3/4 output, a channel option provided to video cassette recorders, early DVD players and video game consoles
Quadraphonic sound or 4-channel audio, a form of surround sound
4chan, an English-language imageboard website
Channel 4 (Fear the Walking Dead), an episode of the television series Fear the Walking Dead
See also
TV4 (disambiguation)
C4 (disambiguation)
Channel 4 branded TV stations in the United States
Channel 4 virtual TV stations in Canada
Channel 4 virtual TV stations in Mexico
Channel 4 virtual TV stations in the United States
For VHF frequencies covering 66-72 MHz:
Channel 4 TV stations in Canada
Channel 4 TV stations in Mexico
Channel 4 d |
https://en.wikipedia.org/wiki/Cyclos | Cyclos is online banking software for microfinance institutions, local banks (in developing countries) and complementary currency systems like LETS, TD4W Credits, Barter networks and time banks.
Cyclos has the following functionality:
Online banking tools;
E-commerce platform;
Business directory;
Referrals and transaction qualifications;
Messaging and notification system;
Call- and support-center logging;
Integrated management information system;
Cyclos can be accessed through the web but also supports mobile phones (WAP/SMS) and point of sale (POS) devices. Enabling sms and card payments.
References
https://www.nytimes.com/2011/10/02/world/europe/in-greece-barter-networks-surge.html
https://www.theguardian.com/world/2012/mar/16/greece-on-breadline-cashless-currency
https://web.archive.org/web/20120328114321/http://www.sunflower.ch/index.php?p=site4_cyclos&l=en
http://trado.info/node/10
https://web.archive.org/web/20110928151625/http://www.correntewire.com/cyclos_alternative_currency_software
https://web.archive.org/web/20120511215702/http://ccmag.net/cyclos/3/6
External links
Cyclos project site
Cyclos documentation
Cyclos forum
Cyclos parent foundation
Free finance software
Formerly free software |
https://en.wikipedia.org/wiki/Curses%20%28video%20game%29 | Curses is an interactive fiction computer game created by Graham Nelson in 1993. Appearing in the beginning of the non-commercial era of interactive fiction, it is considered one of the milestones of the genre.
Writing for The New York Times, Edward Rothstein described the game as "acclaimed."
Plot
The player plays the part of the current owner of Meldrew Hall. In the course of searching the attic for an old tourist map of Paris, the protagonist steps into a surreal adventure to uncover a centuries-old curse that has been placed on the Meldrew family. The goal of the game is to find the missing map, and thus annul the curse.
Development
Curses was originally developed on an Acorn Archimedes using Acorn C/C++, before Nelson moved to his Inform programming language, which was simultaneously released. It was the first non-test game developed in the language. It is distributed without charge as a Z-Code executable. The Inform source code is not publicly available.
Innovations
Curses contains some innovations that contribute to its appeal.
Managing the player's inventory by automatically placing items in a container to make room for an object needed in hand (such as placing an item in the rucksack when reading an entry in a book), eliminating the tedium of having to manually drop one item before picking up another.
Commands places and objects, displaying all the locations visited and all the objects seen during the game.
See also
Jigsaw (video game), another Graham Nelson game, from 1995.
References
External links
; the entry has some coverage, reviews, and links to both the original release (version 7) and the most recent one (version 16).
Baf's Guide to Interactive Fiction entry also covered the game, but the site is down since 2013.
1993 video games
1990s interactive fiction
Video games about curses
Video games about time travel
Video games based on Greek mythology
Video games developed in the United Kingdom
Single-player video games |
https://en.wikipedia.org/wiki/Neurally%20controlled%20animat | A neurally controlled animat is the conjunction of
a cultured neuronal network
a virtual or physical robotic body, the Animat, "living" in a virtual computer generated environment or in a physical arena, connected to this array
Patterns of neural activity are used to control the virtual body, and the computer is used as a sensory device to provide electrical feedback to the neural network about the Animat's movement in the virtual environment.
The current aim of the Animat research is to study the neuronal activity and plasticity when learning and processing information in order to find a mathematical model for the neural network, and to determine how information is processed and encoded in the rat cortex.
It leads towards interesting questions about consciousness theories as well.
References
T. B., Demarse, D. A. Wagenaar, A. W. Blau and S. M. Potter, ‘Neurally controlled computer-simulated animals: a new tool for studying learning and memory in vitro’ in Society for Neuroscience Annual Meeting, (2000) SFN ID: 2961.
T. B., Demarse, D. A. Wagenaar, A. W. Blau and S. M. Potter, (2001). ‘The neurally controlled Animat: biological brains acting with simulated bodies’. Autonomous Robots no.11, pp.305–310
External links
Neural circuits
Neural engineering |
https://en.wikipedia.org/wiki/FleXML | FleXML is an XML transformation language originally developed by Kristofer Rose. It allows a programmer to specify actions in C programming language or C++, and associate those actions with element definitions in an XML DTD. It is similar in philosophy to Yacc and the Lex programming tool in that it is a syntax-directed driver; one could establish the analogies Yacc:LR(1) grammar::Lex:Regular grammar::FleXML::XML.
The implementation is in Perl. A programmer supplied action file is input to FleXML; the output is a file suitable for input to Flex lexical analyser.
External links
FleXML home page
XML-based standards |
https://en.wikipedia.org/wiki/Rivals.com | Rivals.com (stylized as rivals) is a network of websites that focus mainly on college football and basketball recruiting in the United States. The network was started in 1998 and employs more than 300 personnel.
History
Rivals.com was founded in 1998 by Jim Heckman in Seattle, Washington, with a cadre of outside investors. Heckman was once the son-in-law of Don James, the former head football coach at the University of Washington, where Heckman attended school and was later involved in a recruiting scandal. Initial deriving revenue solely from advertising, Rivals.com later employed a subscription fee of $10.00 per month to users for access to the latest recruiting news and to participate in various message boards dedicated to schools covered by the network. Rivals was funded by money from venture capital firms including the venture funds of Fox and Intel.
Rivals acquired AllianceSports, a regional network that primarily covered college sports in the Southeast of the United States, in January 2000. At its peak, Rivals.com employed close to 200 people, operated a network of 700 independent websites, filed for an initial public offering worth $100 million led by Goldman Sachs, and sponsored the Hula Bowl in Hawaii. However, economic troubles and the collapse of the dot-com "bubble" soon led the Rivals Network, the parent company of Rivals.com, to cease operations in 2001, though it never sought bankruptcy protection. Executives from AllianceSports purchased the Rivals.com assets and subsequently relaunched the website. Heckman, who had been fired as chief executive officer, later started a competitor network named The Insiders, which was later renamed Scout.com and sold to Fox Interactive Media in 2005.
Led by former AllianceSports executive Shannon Terry, Rivals.com became profitable. On June 21, 2007, Yahoo! agreed to acquire Rivals.com. Terms of the deal were not disclosed, but several sources reported Yahoo! paid around $100 million.
Rivals subscribers automatically have their subscription renewed for a term equal to the original term upon expiration of the then-current term, and continually thereafter, unless the subscriber terminates the subscription by phone at least 48 hours prior to the renewal date.
Schools
The individual collegiate sites at rivals.com can be found here (viewable only from within the United States).
Schools featured at Rivals include all members of the Power Five conferences:
ACC
Notre Dame, a football independent and listed as such by Rivals, is a full ACC member in non-football sports.
Big Ten
Big 12
Pac-12
SEC
Rivals also has sites for all football members of the American Athletic Conference (though not for incoming non-football member Wichita State).
Conferences that have sites for some of their schools include:
3 from the Atlantic 10. The schools featured all play Division I FCS football.
8 from the Big East (all except Butler and Providence). The featured schools include two of the conference's |
https://en.wikipedia.org/wiki/Green%20computing | Green computing, green IT (Information Technology), or ICT sustainability, is the study and practice of environmentally sustainable computing or IT.
The goals of green computing are similar to green chemistry: reduce the use of hazardous materials, maximize energy efficiency during the product's lifetime, increase the recyclability or biodegradability of defunct products and factory waste. Green computing is important for all classes of systems, ranging from handheld systems to large-scale data centers. Many corporate IT departments have green computing initiatives to reduce the environmental effect of their IT operations. Yet it is also clear that the environmental footprint of the sector is significant, estimated at 5-9% of the world's total electricity use and more than 2% of all emissions. Data centres and telecommunications will need to become more energy efficient, reuse waste energy, and use more renewable energy sources to stay competitive. Some believe they can and should become climate neutral by 2030.
Origins
In 1992, the U.S. Environmental Protection Agency launched Energy Star, a voluntary labeling program that is designed to promote and recognize the energy efficiency in monitors, climate control equipment, and other technologies. This resulted in the widespread adoption of sleep mode among consumer electronics. Concurrently, the Swedish organization TCO Development launched the TCO Certified program to promote low magnetic and electrical emissions from CRT-based computer displays; this program was later expanded to include criteria on energy consumption, ergonomics, and the use of hazardous materials in construction.
Regulations and industry initiatives
The Organisation for Economic Co-operation and Development (OECD) has published a survey of over 90 government and industry initiatives on "Green ICTs", i.e. information and communication technologies, the environment and climate change. The report concludes that initiatives tend to concentrate on the greening ICTs themselves rather than on their actual implementation to reduce global warming and environmental degradation. In general, only 20% of initiatives have measurable targets, with government programs tending to include targets more frequently than business associations.
Government
Many governmental agencies have continued to implement standards and regulations that encourage green computing. The Energy Star program was revised in October 2006 to include stricter efficiency requirements for computer equipment, along with a tiered ranking system for approved products.
By 2008, 26 US states established statewide recycling programs for obsolete computers and consumer electronics equipment. The statutes either impose an "advance recovery fee" for each unit sold at retail or require the manufacturers to reclaim the equipment at disposal.
In 2010, the American Recovery and Reinvestment Act (ARRA) was signed into legislation by President Obama. The bill allocated over $90 bill |
https://en.wikipedia.org/wiki/LPRng | LPRng is an open-source printing system compatible with the Berkeley printing system and implemented by many open-source Unix-like operating systems. It provides printer spooling and network print server functionality using the Line Printer Daemon protocol.
It was abandoned by its author in early 2005, then picked back up by new developers in October 2006 and hosted on SourceForge.
The latest release is 3.9.0, which was made available on May 15, 2019.
See also
Common Unix Printing System (CUPS)
System V printing system
References
External links
Original LPRng website
LPRng lpinfo web interface
Computer printing |
https://en.wikipedia.org/wiki/Robert%20Hecht-Nielsen | Robert Hecht-Nielsen (July 18, 1947–May 25, 2019) was an American computer scientist, neuroscientist, entrepreneur and professor of electrical and computer engineering at the University of California, San Diego. He co-founded HNC Software Inc. (NASDAQ: HNCS) in 1986 which went on to develop the pervasive card fraud detection system, Falcon®. He became a vice president of R&D at Fair Isaac Corporation when it acquired the company in 2002.
Artificial Neural Networks
As a pioneer in the field of artificial neural networks, he authored the first textbook on the subject, Neurocomputing, in 1989. Hecht-Nielsen was awarded the INNS Gabor Award and INNS Neural Networks Pioneer Award for his significant contributions to the field. He was among the core group of researchers who proved that neural networks are universal function approximators.
Confabulation Theory
In March, 2005, he held an event to announce "the fundamental mechanism of cognition" dubbed Confabulation Theory, which he believes is a process of confabulation (neural networks). He posits that all actions and thoughts begin as the "winners" of competitions, where confabulations are tested for cogency based on antecedent support. He presented some mathematical models of the proposed mechanism, and some experimental results where software using this system was able to add several words to a stub of a sentence, keeping that stub coherent and, optionally, maintaining some connection to a full input sentence supplied as context.
For example, given "But the other ..." the program returns "But the other semifinal match between fourth-seeded ...". Given "Japan manufactures many consumer products." for context, and the same three-word stub, it returns "But the other executives included well-known companies ...". Five pages of such examples were given.
He made red, green, and blue-striped medallions to commemorate the event, and had them distributed to the audience along with pamphlets explaining their significance: "This new era, which as yet has no name, will be characterized by the eternal universal freedom from want provided by intelligent machines."
References
External links
UCSD site, with video
UCSD faculty biography
May/June 2007 Fair Isaac "Viewpoints" article
In memory of Robert Hecht-Nielsen, an influential neuroscientist, entrepreneur and UC San Diego professor
2019 deaths
American computer scientists
Artificial intelligence researchers
University of California, San Diego faculty
1947 births
Arizona State University alumni |
https://en.wikipedia.org/wiki/Natural%20Language%20Toolkit | The Natural Language Toolkit, or more commonly NLTK, is a suite of libraries and programs for symbolic and statistical natural language processing (NLP) for English written in the Python programming language. It supports classification, tokenization, stemming, tagging, parsing, and semantic reasoning functionalities. It was developed by Steven Bird and Edward Loper in the Department of Computer and Information Science at the University of Pennsylvania. NLTK includes graphical demonstrations and sample data. It is accompanied by a book that explains the underlying concepts behind the language processing tasks supported by the toolkit, plus a cookbook.
NLTK is intended to support research and teaching in NLP or closely related areas, including empirical linguistics, cognitive science, artificial intelligence, information retrieval, and machine learning.
NLTK has been used successfully as a teaching tool, as an individual study tool, and as a platform for prototyping and building research systems. There are 32 universities in the US and 25 countries using NLTK in their courses.
Library highlights
Discourse representation
Lexical analysis: Word and text tokenizer
n-gram and collocations
Part-of-speech tagger
Tree model and Text chunker for capturing
Named-entity recognition
See also
SpaCy
References
External links
Data analysis software
Free linguistic software
Free science software
Free software programmed in Python
Natural language parsing
Natural language processing
Natural language processing toolkits
Python (programming language) libraries
Statistical natural language processing |
https://en.wikipedia.org/wiki/Line%20Printer%20Daemon%20protocol | The Line Printer Daemon protocol/Line Printer Remote protocol (or LPD, LPR) is a network printing protocol for submitting print jobs to a remote printer. The original implementation of LPD was in the Berkeley printing system in the BSD UNIX operating system; the LPRng project also supports that protocol. The Common Unix Printing System (or CUPS), which is more common on modern Linux distributions and also found on Mac OS X, supports LPD as well as the Internet Printing Protocol (IPP). Commercial solutions are available that also use Berkeley printing protocol components, where more robust functionality and performance is necessary than is available from LPR/LPD (or CUPS) alone (such as might be required in large corporate environments). The LPD Protocol Specification is documented in RFC 1179.
Usage
A server for the LPD protocol listens for requests on TCP port 515. A request begins with a byte containing the request code, followed by the arguments to the request, and is terminated by an ASCII LF character.
An LPD printer is identified by the IP address of the server machine and the queue name on that machine. Many different queue names may exist in one LPD server, with each queue having unique settings. Note that the LPD queue name is case sensitive. Some modern implementations of LPD on network printers might ignore the case or queue name altogether and send all jobs to the same printer. Others have the option to automatically create a new queue when a print job with a new queue name is received. This helps to simplify the setup of the LPD server. Some companies (e.g. D-Link in model DP-301P+) have a tradition of calling the queue name “lpt1” or “LPT1”.
A printer that supports LPD/LPR is sometimes referred to as a "TCP/IP printer" (TCP/IP is used to establish connections between printers and clients on a network), although that term would be equally applicable to a printer that supports the Internet Printing Protocol.
See also
Lp (Unix)
LPRng
Legacy printing
Common Unix Printing System (CUPS)
System V printing system
Spooling
Print server
Application layer
Foomatic
References
External links
FreeBSD LPD Man Page
Computer printing
Printing protocols
Unix |
https://en.wikipedia.org/wiki/FreeSpace%202 | FreeSpace 2 is a 1999 space combat simulation computer game developed by Volition as the sequel to Descent: FreeSpace – The Great War. It was completed ahead of schedule in less than a year, and released to very positive reviews, but the game became a commercial failure, and was described by certain critics as one of 1999's most unfairly overlooked titles.
The game continues on the story from Descent: FreeSpace, once again thrusting the player into the role of a pilot fighting against the mysterious aliens, the Shivans. While defending the human race and its alien Vasudan allies, the player also gets involved in putting down a rebellion. The game features large numbers of fighters alongside gigantic capital ships in a battlefield fraught with beams, shells and missiles in detailed star systems and nebulae. Free multiplayer games were available via Parallax Online which also ranked players by their statistics. A persistent galaxy was also available as SquadWar for players to fight with each other over territories.
In 2002, Volition released the source code for the game engine under a non-commercial license. This code became the core of the FreeSpace 2 Source Code Project, which continuously improves it and enables new features. In cooperation with the FreeSpace Upgrade Project the game's graphics are kept up to date. The improved game engine is also used by various mod projects, for example The Babylon Project and Diaspora which are based on the science fiction series Babylon 5 and Battlestar Galactica respectively.
Gameplay
FreeSpace 2s gameplay involves the player piloting a starfighter using mounted weapons to destroy enemy starfighters, performing reconnaissance behind enemy lines, or escorting other starships. Its flight model is based on a looser interpretation of space physics instead of realistic Newtonian physics. Hence, the ships are weightless and feel more responsive, though they require constant application of engine power to move. The result is that the game plays more like a "WWII dogfight simulator" unaffected by gravity. Although joysticks are the recommended controller for this game, the mouse is a viable alternative. Single player mode is executed in the form of a campaign, which follows a story as a linear sequence of missions are executed.
The pre-mission briefing stage is where the player gets information on the background and objectives, and selects the ship and weapons. The choices of ships and weapons increase as the player proceeds further along the campaign. Certain missions, however, will dictate certain ships and weapons to be used. Weapons can be classified into primary weapons and secondary weapons. Primary weapons are kinetic and energy weapons, while missiles and torpedoes are classified as secondary weapons. Each weapon has its own specifications such as its rate of fire. They also inflict different damages on hulls (body of the ships) or shields (the protective energy fields surrounding the ships), or posses |
https://en.wikipedia.org/wiki/Mac%20OS%20X%20Server%201.0 | Mac OS X Server 1.0 is an operating system developed by Apple, Inc. released on March 16, 1999. it was the first version of Mac OS X Server.
It was Apple's first commercial product to be derived from "Rhapsody"—an eventual replacement for the classic Mac OS derived from NeXTSTEP's architecture (acquired in 1997 as part of Apple's purchase of NeXT) and BSD-like Mach kernel. It could run applications written using the "Yellow Box" API, and featured components such as NetBoot, the QuickTime Streaming Server, components carried over from NeXTSTEP, and the "Blue Box" environment (which allows a Mac OS 8.5 session to be launched as a separate process to run legacy Mac OS software).
Mac OS X Server 1.0 was a prelude to the first consumer-oriented version of the OS—Mac OS X 10.0—which was released in 2001. It did not include the eventual Aqua user interface (instead using NeXTSTEP's Workspace Manager shell mixed with aspects of Mac OS 8's "Platinum" user interface) or Carbon API.
Features
Mac OS X Server 1.0 contains a mix of features from the classic Mac OS, NeXTSTEP and Mac OS X. Like the classic Mac OS, it has a single menu bar across the top of the screen, but file management is performed in Workspace Manager from NeXTSTEP instead of the classic Mac OS Finder. The user interface still uses the Display PostScript-based window server from NeXTSTEP, instead of the Quartz-based WindowServer, which would appear a year later in Mac OS X Public Beta. Unlike any version of Classic Mac OS, windows with unsaved content display a black dot in the window close button like NeXTSTEP did. The Dock and the Aqua appearance were not included; these were added later in Mac OS X.
"Carbon", essentially a subset of "classic" Mac OS API calls, was also absent. This meant that the only native applications for OS X Server 1.0 were written for the "Yellow Box" API, which went on to become known as "Cocoa". Furthermore, Apple's own FireWire was not supported.
Server 1.0 also includes the first version of a NetBoot server, which allows computers to boot from a disk image over a local network. This was particularly useful in a school or other public-machine setting, as it allowed the machines to be booted from a single OS copy stored on Server 1.0. This made it difficult for users to damage the OS by installing software – as soon as they signed out, the machine would re-boot with a fresh OS from the NetBoot server.
To run classic Mac OS applications, Mac OS X Server 1.0 includes the "Blue Box", which essentially ran a copy of Mac OS 8.5.1 (this could be updated to Mac OS 8.6 in version 1.2 and later) in a separate process as an emulation layer. Blue Box would eventually be renamed as the "Classic Environment" in Mac OS X, featuring the latest version of Mac OS 9.
Reception
Although marketed as a large advancement over AppleShare IP, it cost $499 and did not support Apple's own FireWire, making it incompatible with products like MicroNet's SANcube, a line of external high |
https://en.wikipedia.org/wiki/Louis%20Bourgeois%20%28composer%29 | Loys "Louis" Bourgeois (; c. 1510 – 1559) was a French composer and music theorist of the Renaissance. He is most famous as one of the main compilers of Calvinist hymn tunes in the middle of the 16th century. One of the most famous melodies in all of Christendom, the tune known as the Old 100th, to which the Protestant doxology is often sung, is commonly attributed to him.
Life
Knowledge of his early life is sparse. His first publication, some secular chansons, dates from 1539 in Lyon. By 1545 he had gone to Geneva (according to civic records) and become a music teacher there. In 1547 he was granted citizenship in Geneva, and in that same year he also published his first four-voice psalms.
In 1549 and 1550 he worked on a collections of psalm-tunes, most of which were translated by Clément Marot and Théodore de Bèze. The extent to which he was composer, arranger or compiler was not certain, until a long-lost copy of the Genevan Psalter of 1551 came to the library of the Rutgers University. In an Avertissement (note) to the reader Bourgeois specifies exactly what his predecessors had done, what he had changed and which were his own contributions. He is one of the three main composers of the hymn tunes to the Genevan Psalter.
Unfortunately, he fell foul of local musical authorities and was sent to prison on 3 December 1551 for changing the tunes for some well-known psalms "without a license." He was released on the personal intervention of John Calvin, but the controversy continued: those who had already learned the tunes had no desire to learn new versions, and the town council ordered the burning of Bourgeois's instructions to the singers, claiming they were confusing. Shortly after this incident, Bourgeois left Geneva never to return: he settled in Lyon, his Geneva employment was terminated, and his wife tardily followed him to Lyon.
While in Lyon, Bourgeois wrote a fierce piece of invective against the publishers of Geneva. His daughter was baptized in Paris in May 1560 (as a Catholic), and also in 1560 a Parisian publisher posthumously printed a volume of his secular chansons – a form he had condemned as "dissolute" during his Geneva years.
Music and influence
Louis Bourgeois is the one most responsible for the tunes in the Genevan Psalter, the source for the metrical psalmody of both the Reformed Church in England and the Pilgrims in America. In the original versions by Bourgeois, the music is monophonic, in accordance with the dictates of John Calvin, who disapproved not only of counterpoint but of any multiple parts; Bourgeois though did also provide four-part harmonizations, but they were reserved for singing and playing at home. Many of the four-part settings are syllabic and chordal, a style which has survived in many Protestant church services to the present day.
Of the tunes in the Genevan Psalter, some are reminiscent of secular chansons, others are directly borrowed from the Strasbourg Psalter; The remainder were compose |
https://en.wikipedia.org/wiki/Multimap | In computer science, a multimap (sometimes also multihash, multidict or multidictionary) is a generalization of a map or associative array abstract data type in which more than one value may be associated with and returned for a given key. Both map and multimap are particular cases of containers (for example, see C++ Standard Template Library containers). Often the multimap is implemented as a map with lists or sets as the map values.
Examples
In a student enrollment system, where students may be enrolled in multiple classes simultaneously, there might be an association for each enrollment of a student in a course, where the key is the student ID and the value is the course ID. If a student is enrolled in three courses, there will be three associations containing the same key.
The index of a book may report any number of references for a given index term, and thus may be coded as a multimap from index terms to any number of reference locations or pages.
Querystrings may have multiple values associated with a single field. This is commonly generated when a web form allows multiple check boxes or selections to be chosen in response to a single form element.
Language support
C++
C++'s Standard Template Library provides the multimap container for the sorted multimap using a self-balancing binary search tree, and SGI's STL extension provides the hash_multimap container, which implements a multimap using a hash table.
As of C++11, the Standard Template Library provides the unordered_multimap for the unordered multimap.
Dart
Quiver provides a Multimap for Dart.
Java
Apache Commons Collections provides a MultiMap interface for Java. It also provides a MultiValueMap implementing class that makes a MultiMap out of a Map object and a type of Collection.
Google Guava provides a Multimap interface and implementations of it.
Python
Python provides a collections.defaultdict class that can be used to create a multimap. The user can instantiate the class as collections.defaultdict(list).
OCaml
OCaml's standard library module Hashtbl implements a hash table where it's possible to store multiple values for a key.
Scala
The Scala programming language's API also provides Multimap and implementations.
See also
Abstract data type for the concept of type in general
Associative array for the more fundamental abstract data type
Multiset for the case where same item can appear several times
References
Associative arrays
Abstract data types |
https://en.wikipedia.org/wiki/MPLS%20VPN | MPLS VPN is a family of methods for using Multiprotocol Label Switching (MPLS) to create virtual private networks (VPNs). MPLS VPN is a flexible method to transport and route several types of network traffic using an MPLS backbone.
There are three types of MPLS VPNs deployed in networks today:
1. Point-to-point (Pseudowire)
2. Layer 2 (VPLS)
3. Layer 3 (VPRN)
Point-to-point (pseudowire)
Point-to-point MPLS VPNs employ VLL (virtual leased lines) for providing Layer 2 point-to-point connectivity between two sites. Ethernet, TDM, and ATM frames can be encapsulated within these VLLs.
Some examples of how point-to-point VPNs might be used by utilities include:
encapsulating TDM T1 circuits attached to Remote Terminal Units
forwarding non-routed DNP3 traffic across the backbone network to the SCADA master controller.
Layer 2 VPN (VPLS)
Layer 2 MPLS VPNs, or VPLS (virtual private LAN service), offers a “switch in the cloud” style service. VPLS provides the ability to span VLANs between sites. L2 VPNs are typically used to route voice, video, and AMI traffic between substation and data center locations.
Layer 3 VPN (VPRN)
Layer 3, or VPRN (virtual private routed network), utilizes layer 3 VRF (VPN/virtual routing and forwarding) to segment routing tables for each customer utilizing the service. The customer peers with the service provider router and the two exchange routes, which are placed into a routing table specific to the customer. Multiprotocol BGP (MP-BGP) is required in the cloud to utilize the service, which increases complexity of design and implementation. L3 VPNs are typically not deployed on utility networks due to their complexity; however, a L3 VPN could be used to route traffic between corporate or datacenter locations.
See also
Segment Routing
Ethernet VPN
External links
RFC 4364, BGP/MPLS IP Virtual Private Networks (VPNs)
Virtual Private Network (VPN): A Very Detailed Guide for Newbies
MPLS networking
Virtual private networks |
https://en.wikipedia.org/wiki/Network%20monitoring | Network monitoring is the use of a system that constantly monitors a computer network for slow or failing components and that notifies the network administrator (via email, SMS or other alarms) in case of outages or other trouble. Network monitoring is part of network management.
Details
While an intrusion detection system monitors a network threats from the outside, a network monitoring system monitors the network for problems caused by overloaded or crashed servers, network connections or other devices.
For example, to determine the status of a web server, monitoring software may periodically send an HTTP request to fetch a page. For email servers, a test message might be sent through SMTP and retrieved by IMAP or POP3.
Commonly measured metrics are response time, availability and uptime, although both consistency and reliability metrics are starting to gain popularity. The widespread addition of WAN optimization devices is having an adverse effect on most network monitoring tools, especially when it comes to measuring accurate end-to-end delay because they limit round-trip delay time visibility.
Status request failures, such as when a connection cannot be established, it times-out, or the document or message cannot be retrieved, usually produce an action from the monitoring system. These actions vary; An alarm may be sent (via SMS, email, etc.) to the resident sysadmin, automatic failover systems may be activated to remove the troubled server from duty until it can be repaired, etc.
Monitoring the performance of a network uplink is also known as network traffic measurement.
Network tomography
Network tomography is an important area of network measurement, which deals with monitoring the health of various links in a network using end-to-end probes sent by agents located at vantage points in the network/Internet.
Route analytics
Route analytics is another important area of network measurement. It includes
the methods, systems, algorithms and tools to monitor the routing posture of networks. Incorrect routing or routing issues cause undesirable performance degradation or downtime.
Various types of protocols
Site monitoring services can check HTTP pages, HTTPS, SNMP, FTP, SMTP, POP3, IMAP, DNS, SSH, TELNET, SSL, TCP, ICMP, SIP, UDP, Media Streaming and a range of other ports with a variety of check intervals ranging from every four hours to every one minute. Typically, most network monitoring services test your server anywhere between once per hour to once per minute.
For monitoring network performance, most tools use protocols like SNMP, NetFlow, Packet Sniffing, or WMI.
Internet server monitoring
Monitoring an internet server means that the server owner always knows if one or all of their services go down. Server monitoring may be internal, i.e. web server software checks its status and notifies the owner if some services go down, and external, i.e. some web server monitoring companies check the status of the services with a certain |
https://en.wikipedia.org/wiki/Exit%20criteria | Exit criteria are the criteria or requirements which must be met to complete a specific task or process as used in some fields of business or science, such as software engineering.
Usage
The term exit criteria is often used in research and development, but it could be applicable to any field where business process reengineering is (or could be) applied. The benefits of business process re-engineering — including the use of terms such as this one — could include: understanding goals clearly; using language (and data) carefully when talking about (or measuring) methods for getting things done; and taking a scientific approach towards evaluating and improving the methods that are used.
For example, for Fagan inspection, the low-level document must comply with specific exit criteria (as specified in the high-level document) before the development process can be taken to the next phase.
In telecommunications, when testing new software or hardware for release, a set of test specifications are created to test this new product to ensure that it meets minimum acceptable operational specifications. This test specification will state the minimum criteria necessary for the testing process to be considered complete and the product is ready for release IE: Exit the testing phase of the program.
References
Fagan inspection
Agile software development
Management theory
Process engineering |
https://en.wikipedia.org/wiki/San-in%20Ch%C5%AB%C5%8D%20Television%20Broadcasting | San-in Chūō Television Broadcasting Co., Ltd. (TSK, 山陰中央テレビジョン放送株式会社), formerly Shimane Broadcasting (島根放送株式会社), is a TV station of Fuji News Network (FNN) and Fuji Network System (FNS) that broadcasts in Shimane Prefecture and Tottori Prefecture.
The head office
721, Nishi-Kawatsucho, Matsue, Shimane Prefecture, Japan
channel
Analog
Matsue JOMI-TV 34Ch
Tottori 24Ch
Kurayoshi 58Ch
Hamada 58Ch
Oda 57Ch
Masuda 42Ch
Gotsu 42Ch
Okinoshima 47Ch
Kisuki Mitoya (un'nan city) 57Ch
Misumi 44Ch etc...
Digital
Matsue JOMI-DTV 43Ch
Tottori 36Ch
Programs
TSK Super News
Go! Go! Gulliver-kun (Go! Go!ガリバーくん, end)
Super Sentai Series (produced by TV Asahi)
External links
Official website of San-in Chūō TV (Japanese)
Fuji News Network
Television stations in Japan
Television channels and stations established in 1970
Mass media in Matsue, Shimane |
https://en.wikipedia.org/wiki/Mike%20Follin | The Revd. Michael Stuart Follin is a former computer game programmer, working until the late 1990s. Among other companies, he worked at Software Creations and, while there, worked on ZX Spectrum. The titles included highly rated arcade conversions of Bubble Bobble and Ghouls 'n Ghosts, as well as the innovative The Sentinel, one of the first games on the Spectrum to feature true 3D graphics. The music for these games was often written by his brother Tim Follin.
In CRASH issue 59, Follin cited Knight Lore, Codename MAT and Pentagram as video game classics, with Jonathan Smith as his favorite programmer. Follin's Spectrum conversion of The Sentinel was considered by fellow programmers as one of the top five classic games on that platform.
After sixteen years in the computer games industry, Follin left the industry to train as a priest in the Church of England. He was subsequently ordained at Liverpool Cathedral, and as of 2010 is the vicar at St Peter's, a small Anglican church in Maghull, Merseyside. He married his wife, Lynn Follin, in 1994.
References
External links
personal home page
zxspecticle interview
MobyGames rap sheet
British computer programmers
Living people
Video game designers
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Mereotopology | In formal ontology, a branch of metaphysics, and in ontological computer science, mereotopology is a first-order theory, embodying mereological and topological concepts, of the relations among wholes, parts, parts of parts, and the boundaries between parts.
History and motivation
Mereotopology begins in philosophy with theories articulated by A. N. Whitehead in several books and articles he published between 1916 and 1929, drawing in part on the mereogeometry of De Laguna (1922). The first to have proposed the idea of a point-free definition of the concept of topological space in mathematics was Karl Menger in his book Dimensionstheorie (1928) -- see also his (1940). The early historical background of mereotopology is documented in Bélanger and Marquis (2013) and Whitehead's early work is discussed in Kneebone (1963: ch. 13.5) and Simons (1987: 2.9.1). The theory of Whitehead's 1929 Process and Reality augmented the part-whole relation with topological notions such as contiguity and connection. Despite Whitehead's acumen as a mathematician, his theories were insufficiently formal, even flawed. By showing how Whitehead's theories could be fully formalized and repaired, Clarke (1981, 1985) founded contemporary mereotopology. The theories of Clarke and Whitehead are discussed in Simons (1987: 2.10.2), and Lucas (2000: ch. 10). The entry Whitehead's point-free geometry includes two contemporary treatments of Whitehead's theories, due to Giangiacomo Gerla, each different from the theory set out in the next section.
Although mereotopology is a mathematical theory, we owe its subsequent development to logicians and theoretical computer scientists. Lucas (2000: ch. 10) and Casati and Varzi (1999: ch. 4,5) are introductions to mereotopology that can be read by anyone having done a course in first-order logic. More advanced treatments of mereotopology include Cohn and Varzi (2003) and, for the mathematically sophisticated, Roeper (1997). For a mathematical treatment of point-free geometry, see Gerla (1995). Lattice-theoretic (algebraic) treatments of mereotopology as contact algebras have been applied to separate the topological from the mereological structure, see Stell (2000), Düntsch and Winter (2004).
Applications
Barry Smith, Anthony Cohn, Achille Varzi and their co-authors have shown that mereotopology can be useful in formal ontology and computer science, by allowing the formalization of relations such as contact, connection, boundaries, interiors, holes, and so on. Mereotopology has been applied also as a tool for qualitative spatial-temporal reasoning, with constraint calculi such as the Region Connection Calculus (RCC). It provides the starting point for the theory of fiat boundaries developed by Smith and Varzi, which grew out of the attempt to distinguish formally between
boundaries (in geography, geopolitics, and other domains) which reflect more or less arbitrary human demarcations and
boundaries which reflect bona fide physical disconti |
https://en.wikipedia.org/wiki/UniProt | UniProt is a freely accessible database of protein sequence and functional information, many entries being derived from genome sequencing projects. It contains a large amount of information about the biological function of proteins derived from the research literature. It is maintained by the UniProt consortium, which consists of several European bioinformatics organisations and a foundation from Washington, DC, United States.
The UniProt consortium
The UniProt consortium comprises the European Bioinformatics Institute (EBI), the Swiss Institute of Bioinformatics (SIB), and the Protein Information Resource (PIR). EBI, located at the Wellcome Trust Genome Campus in Hinxton, UK, hosts a large resource of bioinformatics databases and services. SIB, located in Geneva, Switzerland, maintains the ExPASy (Expert Protein Analysis System) servers that are a central resource for proteomics tools and databases. PIR, hosted by the National Biomedical Research Foundation (NBRF) at the Georgetown University Medical Center in Washington, DC, US, is heir to the oldest protein sequence database, Margaret Dayhoff's Atlas of Protein Sequence and Structure, first published in 1965. In 2002, EBI, SIB, and PIR joined forces as the UniProt consortium.
The roots of the UniProt databases
Each consortium member is heavily involved in protein database maintenance and annotation. Until recently, EBI and SIB together produced the Swiss-Prot and TrEMBL databases, while PIR produced the Protein Sequence Database (PIR-PSD). These databases coexisted with differing protein sequence coverage and annotation priorities.
Swiss-Prot was created in 1986 by Amos Bairoch during his PhD and developed by the Swiss Institute of Bioinformatics and subsequently developed by Rolf Apweiler at the European Bioinformatics Institute. Swiss-Prot aimed to provide reliable protein sequences associated with a high level of annotation (such as the description of the function of a protein, its domain structure, post-translational modifications, variants, etc.), a minimal level of redundancy and high level of integration with other databases. Recognizing that sequence data were being generated at a pace exceeding Swiss-Prot's ability to keep up, TrEMBL (Translated EMBL Nucleotide Sequence Data Library) was created to provide automated annotations for those proteins not in Swiss-Prot. Meanwhile, PIR maintained the PIR-PSD and related databases, including iProClass, a database of protein sequences and curated families.
The consortium members pooled their overlapping resources and expertise, and launched UniProt in December 2003.
Organization of the UniProt databases
UniProt provides four core databases: UniProtKB (with sub-parts Swiss-Prot and TrEMBL), UniParc, UniRef and Proteome.
UniProtKB
UniProt Knowledgebase (UniProtKB) is a protein database partially curated by experts, consisting of two sections: UniProtKB/Swiss-Prot (containing reviewed, manually annotated entries) and UniProtKB/TrEMBL |
https://en.wikipedia.org/wiki/Relvar | In relational databases, relvar is a term introduced by C. J. Date and Hugh Darwen as an abbreviation for relation variable in their 1995 paper The Third Manifesto, to avoid the confusion sometimes arising from the use of the term relation, by the inventor of the relational model, E. F. Codd, for a variable to which a relation is assigned as well as for the relation itself. The term is used in Date's well-known database textbook An Introduction to Database Systems and in various other books authored or coauthored by him.
Some database textbooks use the term relation for both the variable and the data it contains. Similarly, texts on SQL tend to use the term table for both purposes, though the qualified term base table is used in the standard for the variable.
A closely related term often used in academic texts is relation schema, this being a set of attributes paired with a set of constraints, together defining a set of relations for the purpose of some discussion (typically, database normalization). Constraints that mention just one relvar are termed relvar constraints, so relation schema can be regarded as a single term encompassing a relvar and its relvar constraints.
References
C.J. Date. An Introduction to Database Systems, 8th Ed. (Addison-Wesley, 2004, ), pp. 65–6.
C.J. Date and Hugh Darwen. Databases, Types, and The Relational Model: The Third Manifesto (Addison-Wesley, 2007, ), p.85
Relational model
Data modeling
Databases
Variable (computer science) |
https://en.wikipedia.org/wiki/NPAPI | Netscape Plugin Application Programming Interface (NPAPI) is a deprecated application programming interface (API) of the web browsers that allows plugins to be integrated.
Initially developed for Netscape browsers, starting in 1995 with Netscape Navigator 2.0, it was subsequently adopted by other browsers.
In NPAPI architecture, a plugin declares content types (e.g. "audio/mp3") that it can handle. When the browser encounters a content type it cannot handle natively, it loads the appropriate plugin, sets aside space within the browser context for the plugin to render and then streams data to it. The plugin is responsible for rendering the data. The plugin runs in-place within the page, as opposed to older browsers that had to launch an external application to handle unknown content types. NPAPI requires each plugin to implement and expose approximately 15 functions for initializing, creating, deleting and positioning plugin content. NPAPI also supports scripting, printing, full-screen plugins, windowless plugins and content streaming.
NPAPI was frequently used for plugins which required intensive, low-level performance such as video players, including Adobe Flash Player and Microsoft Silverlight, as well as platforms for web applications such as the Java Runtime Environment.
NPAPI support among major browsers started to wane since 2015 and it was gradually deprecated over the following 7 years. With the advent of HTML5, all major web browsers have removed support for 3rd party NPAPI plugins for security reasons.
Scripting support
Scripting is a feature allowing JavaScript code in a web page to interact with the plugin. Various versions of Netscape and then Mozilla supported this feature using different technologies, including LiveConnect, XPConnect, and NPRuntime.
LiveConnect
LiveConnect is a feature of Web browsers that allows Java and JavaScript software to intercommunicate within a Web page. From the Java side it allows an applet to invoke the embedded scripts of a page, or to access the built-in JavaScript environment, much as scripts can. Conversely, from the JavaScript side, it allows a script to invoke applet methods, or to access Java runtime libraries, much as applets can.
LiveConnect was used in Netscape 4 to implement scriptability of NPAPI plugins.
The Open Java Interface-dependent implementation of LiveConnect was removed from the Mozilla source code tree in late June 2009 as part of the Mozilla 2 cleanup effort. It is no longer needed with the release of a redesigned Java Runtime Environment from Sun Microsystems. However the old implementation was restored for Gecko 1.9.2, as Apple had yet to port the newer JRE over to Mac OS X.
The Java–JavaScript functionality supported by the redesigned Java Runtime Environment is still called "LiveConnect", despite the Open Java Interface-specific approach having been abandoned. With Netscape 4, NPAPI was extended to allow plugins to be scripted. This extension is called LiveConne |
https://en.wikipedia.org/wiki/Ionization%20energies%20of%20the%20elements%20%28data%20page%29 |
Numerical values
For each atom, the column marked 1 is the first ionization energy to ionize the neutral atom, the column marked 2 is the second ionization energy to remove a second electron from the +1 ion, the column marked 3 is the third ionization energy to remove a third electron from the +2 ion, and so on.
"use" and "WEL" give ionization energy in the unit kJ/mol; "CRC" gives atomic ionization energy in the unit eV.
Notes
Values from CRC are ionization energies given in the unit eV; other values are molar ionization energies given in the unit kJ/mol. The first of these quantities is used in atomic physics, the second in chemistry, but both refer to the same basic property of the element. To convert from "value of ionization energy" to the corresponding "value of molar ionization energy", the conversion is:
1 eV = 96.48534 kJ/mol
1 kJ/mol = 0.0103642688 eV
References
WEL (Webelements)
As quoted at http://www.webelements.com/ from these sources:
J.E. Huheey, E.A. Keiter, and R.L. Keiter in Inorganic Chemistry : Principles of Structure and Reactivity, 4th edition, HarperCollins, New York, USA, 1993.
A.M. James and M.P. Lord in Macmillan's Chemical and Physical Data, Macmillan, London, UK, 1992.
External links
NIST Atomic Spectra Database Ionization Energies
See also
Molar ionization energies of the elements
Properties of chemical elements
Chemical element data pages |
https://en.wikipedia.org/wiki/AA%20tree | An AA tree in computer science is a form of balanced tree used for storing and retrieving ordered data efficiently. AA trees are named after their originator, Swedish computer scientist Arne Andersson.
AA trees are a variation of the red–black tree, a form of binary search tree which supports efficient addition and deletion of entries. Unlike red–black trees, red nodes on an AA tree can only be added as a right subchild. In other words, no red node can be a left sub-child. This results in the simulation of a 2–3 tree instead of a 2–3–4 tree, which greatly simplifies the maintenance operations. The maintenance algorithms for a red–black tree need to consider seven different shapes to properly balance the tree:
An AA tree on the other hand only needs to consider two shapes due to the strict requirement that only right links can be red:
Balancing rotations
Whereas red–black trees require one bit of balancing metadata per node (the color), AA trees require O(log(log(N))) bits of metadata per node, in the form of an integer "level". The following invariants hold for AA trees:
The level of every leaf node is one.
The level of every left child is exactly one less than that of its parent.
The level of every right child is equal to or one less than that of its parent.
The level of every right grandchild is strictly less than that of its grandparent.
Every node of level greater than one has two children.
A link where the child's level is equal to that of its parent is called a horizontal link, and is analogous to a red link in the red–black tree. Individual right horizontal links are allowed, but consecutive ones are forbidden; all left horizontal links are forbidden. These are more restrictive constraints than the analogous ones on red–black trees, with the result that re-balancing an AA tree is procedurally much simpler than re-balancing a red–black tree.
Insertions and deletions may transiently cause an AA tree to become unbalanced (that is, to violate the AA tree invariants). Only two distinct operations are needed for restoring balance: "skew" and "split". Skew is a right rotation to replace a subtree containing a left horizontal link with one containing a right horizontal link instead. Split is a left rotation and level increase to replace a subtree containing two or more consecutive right horizontal links with one containing two fewer consecutive right horizontal links. Implementation of balance-preserving insertion and deletion is simplified by relying on the skew and split operations to modify the tree only if needed, instead of making their callers decide whether to skew or split.
function skew is
input: T, a node representing an AA tree that needs to be rebalanced.
output: Another node representing the rebalanced AA tree.
if nil(T) then
return Nil
else if nil(left(T)) then
return T
else if level(left(T)) == level(T) then
Swap the pointers of horizontal left links.
|
https://en.wikipedia.org/wiki/Driver%20License%20Compact | The Driver License Compact is an agreement between states in the United States of America. The compact is used to exchange data between motorist's home state and a state where the motorist incurred a vehicular violation. Not all states are members, and states respond to the data differently.
Overview
The Driver License Compact, a framework setting out the basis of a series of laws within adopting states in the United States (as well as similar reciprocal agreements in adopting provinces of Canada), gives states a simple standard for reporting, tracking, and punishing traffic violations occurring outside of their state, without requiring individual treaties between every pair of states. Convictions and dispositions of driving violations are reported to a licensee's home state, which may assess its own administrative actions for the violations. Pre-conviction reports may also be made for serious crimes. Out-of-state suspensions, revocations, or blocked renewals must also be honored by every state within the Compact. A final provision ensures that no one can hold a license in two states by requiring the surrender of the old.
History
The Driver License Compact came into existence with Nevada becoming the first member in 1960. Organizations in the Western States such as governors came together to cooperate on traffic safety. Under the Beamer Resolution ("Interstate Compacts for Highway Safety Resolution"), Public Law 85-684, enacted on August 20, 1958, 72 Stat. 635 (named for Rep. John V. Beamer, R-Indiana), states were automatically given permission to form compacts in the areas of traffic safety. Originally, the Driver License Compact dealt with dangerous driving violations such as drunk driving, reckless driving, commission of a felony involving a motor vehicle and others. Later on, minor violations were included as well. 23 states joined during the 1960's, and the 1986-87 period saw 10 more states join; the rest trickled in until Pennsylvania became the last to join in 1996.
The Driver License Compact is no longer being pushed by the AAMVA as it is being superseded by the Driver License Agreement (DLA), which also replaces the Non-Resident Violator Compact. However, , there were only three member states to the DLA: Arkansas, Connecticut, and Massachusetts.
States that are not members
Some states such as Michigan, Wisconsin, and Georgia are not members. According to the American Association of Motor Vehicle Administrators, Nevada repealed the authorizing legislation in 2007, although it still generally conforms to the agreement through regulations.
Exceptions
Some states, such as Colorado, Maryland, Nevada, New York, and Pennsylvania, do not assess points for minor offenses and apply the DLC for only major violations.
States that are members are free to take action on violations reported from a non-member state as well.
Michigan Legislature passed in 2018 as House Bill 6011, allows Michigan enter into the compact. As of 2021 the Gove |
https://en.wikipedia.org/wiki/Crystal%20Analysis | Crystal Analysis (a.k.a. Crystal Analysis Professional) is an On Line Analytical Processing (OLAP) application for analysing business data originally developed by Seagate Software.
It was first released under the name Seagate Analysis as a free application written in Java released in 1999. After disappointing application performance, a decision was made to rewrite using ATL COM in C++. The initial rewrite only supported Microsoft Analysis Services, but support for other vendors soon followed, with Holos cubes in version 8.5, Essbase, IBM Db2 and SAP BW following in later releases. The web client was rewritten using an XSLT abstraction layer for the version 9.0 release, with better standards compliance to support Mozilla based browsers—this work also set the building blocks for support for Safari.
Crystal Analysis relies on Crystal Enterprise for distribution of analytical applications created with it.
Release timeline
Seagate Analysis 1999, by Seagate Software
Crystal Analysis Professional v8.0, 29 May 2001 by Crystal Decisions
Crystal Analysis Professional v8.1, Q4 2001 by Crystal Decisions
Crystal Analysis Professional v8.5 9 July 2002 , by Crystal Decisions
Crystal Analysis Professional v9.0 9 April 2003 , by Crystal Decisions
Crystal Analysis Professional v10.0 8 January 2004 , by Business Objects
Crystal Analysis Professional v11.0 31 January 2005, by Business Objects
Crystal Analysis Professional v11.0 Release 2 30 November 2005 , by Business Objects
Future versions will be released under the name, BusinessObjects OLAP Intelligence.
External links
Product page at Business Objects
Business intelligence software
Online analytical processing |
https://en.wikipedia.org/wiki/Zork%20Zero | Zork Zero: The Revenge of Megaboz is an interactive fiction computer game, written by Steve Meretzky over nearly 18 months and published by Infocom in 1988. Although it is the ninth and last Zork game released by Infocom before the company's closure, Zork Zero takes place before the previous eight games (Zork I, Zork II, Zork III, Enchanter, Sorcerer, Wishbringer, Spellbreaker and Beyond Zork). Unlike its predecessors, Zork Zero is a vast game, featuring a graphical interface with scene-based colors and borders, an interactive map, menus, an in-game hints system, an interactive Encyclopedia Frobozzica, and playable graphical mini-games. The graphics were created by computer artist James Shook. It is Infocom's thirty-second game.
Previous games by Infocom used a parser evolved from the one in Zork I, but for Zork Zero, they designed a new LALR parser from scratch. Zork Zero'''s parser has some innovative features. If it notices if a player is having trouble with it, it offers helpful suggestions, such as sample commands.
Three of the four graphical mini-games are based on older logic puzzles. Peggleboz is a version of peg solitaire, Snarfem is Nim, and the Tower of Bozbar is Towers of Hanoi. Other puzzles based on established logic puzzle types include a river-crossing puzzle with a fox, a rooster, and a worm, and a Knights and Knaves puzzle in which violently xenophobic Veritassi and Prevaricons are truth-tellers and liars respectively, and peaceful Wishyfoo are alternators.
Plot
Lord Dimwit Flathead the Excessive certainly earned his nickname. Never one to do things on a small scale, when Dimwit decided in 789 GUE to have a statue erected in his honor, it had to be the largest statue ever. This angered a local resident of Fublio Valley (where the statue was built), Megaboz the Magnificent, who cast a deadly curse over Dimwit, the royal family, and the entire Empire before disappearing. The king's conjurers employed their most powerful magic in an effort to counteract the curse, but they were unable to save Dimwit and his eleven siblings; they only managed to delay the kingdom's destruction temporarily.
The game begins with a brief prelude in which the player is a humble servant in Lord Dimwit's scullery. Present when Megaboz appears and casts his fateful curse, the player manages to grab a small piece of parchment left behind in the chaos.
94 years later, the strength of the counter-curse is rapidly fading. If the curse can't be lifted by Curse Day, the anniversary of Dimwit's death, the Empire will surely fall. The reigning monarch, Wurb Flathead, has sent out a call in desperation: anyone who can save the Empire will be given half its riches! Predictably, this results in an avalanche of crackpot treasure seekers, none of whom have any more luck than did the royal sorcerers.
As the game begins in earnest, it is Mumberbur 14: Curse Day. The erstwhile curse-breakers have fled, along with everyone else in Flathead Castle. The player, a desce |
https://en.wikipedia.org/wiki/Sorcerer%20%28video%20game%29 | Sorcerer is an interactive fiction computer game written by Steve Meretzky and released by Infocom in 1984. It is the second game in the magic-themed "Enchanter trilogy", preceded by Enchanter and followed by Spellbreaker. It is Infocom's eleventh game.
Plot
Following the unlikely defeat of Krill in Enchanter, the player's character has progressed from an Apprentice Enchanter to earning a coveted seat in the Circle of Enchanters. Belboz the Necromancer, the leader of the Circle, has become not only a mentor but a close friend as well. Lately, Belboz has seemed different, distracted, even talking to himself at length. Whatever he's dealing with, Belboz doesn't see fit to confide in anyone, then suddenly he disappears.
Gameplay
Potions are used by drinking them and each can only be used once. Sorcerer has 70 ways for the player to die.
Release
The Sorcerer package includes the following physical items:
A copy of the fictitious magazine Popular Enchanting featuring a profile of Belboz
An "Infotater", a paper code wheel disguised as information about creatures in the game. The Infotater was found in the original package only. When the game was later re-released in the "gray stripe" box format, the Infotater was replaced by a "Field Guide to the Creatures of Frobozz" brochure containing the same information. Consequently, original Infotaters are highly sought-after by collectors. The Field Guide or Infotater is necessary to open the chest and acquire its contents in the game.
Reception
St.Game stated that "The world of the Sorcerer is rich in detail and wonderment. The magical experiences resemble the exotic adventures of Carlos Castaneda", with "several diabolical traps and puzzles", and concluded that "The final solution is like a delicate orchid achieving full bloom. Long after the game is over, the heady fragrance stays with you". PC Magazine gave Sorcerer 10.5 points out of 12. It noted the dramatic opening and the game's "predisposition against violence", offering the player spells instead of weapons. Zzap!64 noted the high (£45.30) British price of the game and necessity to own a disk drive, but called it "a tremendous challenge and full of surprises ... lengthy location descriptions, great atmosphere, and highly addictive qualities".
References
External links
Package scans
1980s interactive fiction
1984 video games
Adventure games
Amiga games
Amstrad CPC games
Amstrad PCW games
Apple II games
Atari 8-bit family games
Atari ST games
Classic Mac OS games
Commodore 64 games
CP/M games
DOS games
Fantasy video games
Infocom games
Steve Meretzky games
TI-99/4A games
TRS-80 games
Video games developed in the United States
Zork
Single-player video games |
https://en.wikipedia.org/wiki/Spellbreaker | Spellbreaker is an interactive fiction computer game written by Dave Lebling and published by Infocom in 1985, the third and final game in the "Enchanter Trilogy." It was released for the Amiga, Amstrad CPC, Apple II, Atari 8-bit family, Atari ST, Commodore 64, Macintosh, and DOS. Infocom's nineteenth game, Spellbreaker is rated "Expert" difficulty.
Plot
Ten years after the events of Enchanter, the very foundations of magic itself seem to be failing, and the leaders of all the Guilds in the land have gathered to demand answers. In the midst of this impassioned meeting, the crowd is suddenly transformed into a group of toads and newts. Everyone present is affected except for the player and a shadowy figure who flees the hall.
In the course of investigating the mystery, the player learns new, powerful spells that must be used in novel ways. But since magic is no longer dependable, each spell has a chance of failing. The only objects that can help to shore up the effectiveness of sorcery are the Cubes of Foundation, each of which can transport the player to a different location and strengthen certain spells.
Release
Spellbreaker includes the following physical items in the packaging:
A Frobozz Magic Magic Equipment Catalog, Special Crisis Edition
An Enchanter's Guild pin
Six "Enchanter cards", baseball card-like items each containing a picture and information about legendary wizards
Reception
Charles Ardai of Computer Gaming World called parts of Spellbreaker "transcendent". Computer Gaming Worlds Scorpia stated, "This one is a toughie, folks."
Zzap! ended up giving the game a 91 out of 100 rating, commenting "Nevertheless, Dave Lebling (co author of Zork and Enchanter) has done an excellent job. Dave was responsible for Suspect, a real tour de force of character interaction, and the influence of this game can be seen at all times in Spellbreaker, where the characters play a rather more significant role than in Sorcerer, for example. Yet another Infocom masterpiece - need I say more?"
Popular Computing Weekly rated the game 5 out of 5 stars, saying of it that "The vocabulary is massive. The parser will accept such commands has 'Take the fish out of Belbozs ear then eat it' or 'Read the scroll. Write "Broken" on it. Open the garbage can and drop scroll into the can'. The game is also rich in humour, casting the mind probe spell at various creatures will reward you with very witty and responses. In conclusion this is another of those Infocom adventures worth buying an Atari or Commodore merely in order to play."
Conversely, SPAG gave the game 3 out of 5 stars, saying "A resounding conclusion to a somewhat uneven series, Spellbreaker deserves to be considered one of Infocom's very best."
References
External links
Spellbreaker at GUETech.org
1980s interactive fiction
1985 video games
Adventure games
Amiga games
Amstrad CPC games
Apple II games
Atari 8-bit family games
Atari ST games
Classic Mac OS games
Commodore 64 games
DOS games
Fanta |
https://en.wikipedia.org/wiki/Lee%20Giles | Clyde Lee Giles is an American computer scientist and the David Reese Professor at the College of Information Sciences and Technology (IST) at the Pennsylvania State University. He is also Graduate Faculty Professor of Computer Science and Engineering, Courtesy Professor of Supply Chain and Information Systems, and Director of the Intelligent Systems Research Laboratory. He was Interim Associate Dean of Research in the College of IST. His graduate degrees are from the University of Michigan and the University of Arizona and his undergraduate degrees are from Rhodes College and the University of Tennessee. His PhD is in optical sciences with advisor Harrison H. Barrett. His academic genealogy includes two Nobel laureates (Felix Bloch and Werner Heisenberg), Arnold Sommerfeld and prominent mathematicians.
Research
Giles has been associated with the computer science or electrical engineering departments at Princeton University, the University of Pennsylvania, Columbia University, the University of Pisa, the University of Trento and the University of Maryland, College Park. Previous positions were at NEC Research Institute (now NEC Labs), Princeton, NJ; Air Force Research Laboratory; and the United States Naval Research Laboratory. He is best known for his work on the creation of novel scientific and academic search engines and digital libraries and is considered by some one of the founders of academic document search. Earlier research was concerned with recurrent neural networks and optical computing.
His research interests are in intelligent web and cyberinfrastructure tools, search engines and information retrieval, digital libraries, web services, knowledge and information management and extraction, machine learning, and information and data mining. He has created several vertical search engines in these areas. He has over 500 publications with some in Nature, Science and the Proceedings of the National Academy of Sciences. His research is well cited with an h-index of 113 according to Google Scholar and over 55,000 total citations as evidenced in Google Scholar. He has one of the top 200 h-indexes in Computer Science and the top 10 in Information Retrieval. At Penn State he has graduated 36 PHD students.
Most of his papers author his name as C. Lee Giles or C.L. Giles.
Awards
He is a Fellow of the Association for Computing Machinery (ACM), Institute of Electrical and Electronics Engineers (IEEE), and International Neural Networks Society, INNS. He also received the Gabor Award from the International Neural Network Society recognizing achievements in engineering/applications in neural networks. Most recently he received the 2018 Institute of Electrical and Electronics Engineers (IEEE) Computational Intelligence Society (CIS) Neural Networks Pioneer Award and the 2018 National Federation of Advanced Information Services (NFAIS) Miles Conrad Award.
He has twice received the IBM Distinguished Faculty Award.
Electromagnetics
Before his work o |
https://en.wikipedia.org/wiki/Steve%20Lawrence%20%28computer%20scientist%29 | Steve Lawrence is an Australian computer scientist. He was among the group at NEC Research which was responsible for the creation of the Search Engine/Digital Library CiteSeer. He was an employee at Google. He is currently a co-founder & CTO at Xoo.
Lawrence received Bachelor of Science and Bachelor of Engineering degrees from Queensland University of Technology in Australia, and his PhD from the University of Queensland in Australia.
He became a senior research scientist at NEC Research Institute.
He was a senior research scientist at Google where he developed Google Desktop.
Lawrence's professional service includes being program committee co-chair for WWW 2003, program committee vice chair for WWW 2002, co-chair for workshops at AAAI and WWW, a program committee member for conferences including WWW, CIKM, and NIPS, and a reviewer for many journals including Science and Nature.
Lawrence's research interests include information retrieval, digital libraries, and machine learning. He has published over 50 papers in these areas, including articles in Science, Nature, CACM, and IEEE Computer. He has been interviewed by over 100 news organizations including the New York Times, the Wall Street Journal, Washington Post, Reuters, Associated Press, CNN, MSNBC, the BBC, and NPR. Hundreds of articles about his research have appeared worldwide in over 10 different languages.
Awards and honors
NEC Research Institute Excellence awards
NEC Research Impact awards
Queensland University of Technology university medal and award for excellence
ATERB scholarship
APRA priority scholarship,
Technology NJ Internet Innovator award
QEC and Telecom Australia Engineering prizes,
Three prizes in the Australian Mathematics Competition.
External links
The Internet Archive's copy of Dr. Steve Lawrence's old NEC Research homepage
"Online or Invisible?: Free online availability substantially increases a paper's impact" -(open access)
CiteSeer
Living people
Australian computer scientists
Google employees
Queensland University of Technology alumni
University of Queensland alumni
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Paul%20Moss | Paul Raymond Moss is the general manager of Media Prima network's media portal and a judge in 8TV's One in a Million singing contest.
Moss was the AS A&R director of record company Positive Tone from its inception in 1994 until last year. Moss oversaw the transformation in Malaysian music that created whole new markets for English-language artistes and new genres of music.
Background
Before settling in Malaysia, Moss, sometimes fondly addressed as Uncle Paul, was the song writer, guitarist and musical director for international pop band Aishah and The Fan Club.
The band originated in New Zealand and had five members: Paul Moss himself on guitars, Malcolm Smith on keyboards, Glenn Peters on Bass, Dave Larsen on drums and Aishah as their lead vocalist.
Aishah and The Fan Club were a big hit in 1990 when they released the album Sensation which had three #1 singles in New Zealand and Malaysian charts. The hits were "Sensation", "Paradise" and "Call Me".
Their next album, titled "Respect The Beat", also produced three hit singles such as "I Feel Love", "Never Gave Up On You" and the only single to actually debut in the US Billboard Hot 100 charts, "Don't Let Me Fall Alone". The remixes for the song were also released and were frequently played dance tunes during that time.
After the band split in 1993, Aishah continued with a solo career, and the rest of the members went back to New Zealand. Moss, however, returned and decided to settle down in Malaysia in 1995. He and Ahmad Izham Omar (who is today the CEO of 8TV, a Malaysian TV channel) formed their own music company called Positive Tone under the EMI label.
Paul Moss is responsible for artist signing, artistic direction, recording, production and content development at Positive Tone. Paul Moss is also a multi-award-winning music producer, songwriter and arranger. He has produced several gold and platinum releases and Anugerah Industri Muzik (AIM) winners from OAG, Innuendo and Juliet the Orange. He has also worked with other recording artists such as Too Phat, Ella and Nicestupidplayground.
Malaysian Idol
Along with Roslan Aziz and Fauziah Latiff, Paul Moss is one of the judges in Malaysian Idol, a singing competition that is part of the Idol series that first started as Pop Idol. Moss expresses his opinions on Malaysian Idol harshly, often causing himself to be compared to Simon Cowell.
He was a judge in the first Asian Idol held in Indonesia, representing Malaysian Idol.
One in a Million
Paul Moss is currently a judge on the reality television series One in a Million alongside Syafinaz Selamat. Moss's job is similar to his previous role in Malaysian Idol.
Media portals
Moss was appointed as Media Prima Network Media Portals Super General Manager.
References
Living people
Malaysian businesspeople
Malaysian socialites
Malaysian people of New Zealand descent
One in a Million (Malaysian TV series)
Malaysian Idol
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Computer%20Shopper%20%28UK%20magazine%29 | Computer Shopper was a magazine published monthly between 1988 and 2020 in the UK by Dennis Publishing Ltd. It contained reviews of home computers, consumer technology and software as well as technology-focused news, analysis and feature articles.
The final editorial staff include Madeline Bennett (editor), David Ludlow (contributing editor) and James Archer (reviews editor). Contributors of columns, features and specialist reviews include Mel Croucher, Kay Ewbank, Simon Handby, Ben Pitt and David Crookes.
Content
The first section of the magazine was dedicated to columns, opinions and the Letters pages. This was followed by several news spreads on recent developments in the technology industry.
The magazine claimed the "UK's biggest reviews section" with much of the magazine devoted to product tests of the latest hardware. The Reviews section was typically occupied by desktop PCs, laptops, PC components, smartphones, tablets, cameras, displays and printers. This section of new products was typically followed by two or three Group Tests which pitch ten or more similar products against one another to find an overall Best Buy. Previous tests have included budget laptops, cloud storage providers, action cameras and gaming PCs.
The Best Buys section of the magazine was updated monthly to reflect the latest products the editorial team has deemed the overall best choice(s) in each area of consumer technology.
Two or three longer-form feature articles follow the reviews section, focusing on the wider world of technology and its applications in various industries. Recent features have included a history of coding, a guide on how to build racing, flight and train simulators as well as more consumer-focused features on broadband and mobile coverage. A Retro section is also included.
The magazine was tailed by several tutorial pages including Advanced Projects, Multimedia Expert, Business Help and Helpfile.
The final page of the magazine is traditionally occupied by the Zygote column and the Great Moments in Computing comic.
See also
Computer Shopper (US magazine)
References
External links
1988 establishments in the United Kingdom
2020 disestablishments in the United Kingdom
2020 disestablishments in England
Amiga magazines
Computer magazines published in the United Kingdom
Defunct computer magazines published in the United Kingdom
Home computer magazines
Magazines established in 1988
Magazines published in London
Monthly magazines published in the United Kingdom |
https://en.wikipedia.org/wiki/Clink | Clink may refer to:
The Clink, a historic prison in Southwark, England
The Clink (restaurant), British restaurants employing prisoners for rehabilitation
Prison, in general
CLINK, an algorithm for hierarchical clustering
Channel Link (C-Link), a high-speed data transmission interface
A nickname for CenturyLink Field, in Seattle, Washington
Clink is the English name for the Turkish dessert Kazandibi
The sound "clink", a form of onomatopoeia
C-Link, the closing track of Sir Paul McCartney's 2018 album Egypt Station
Clink (TV series), a television prison drama series on 5Star
Clink (FBNYV), a virulence protein produced by the faba bean necrotic yellows virus |
https://en.wikipedia.org/wiki/Automated%20fingerprint%20identification | Automated fingerprint identification is the process of using a computer to match fingerprints against a database of known and unknown prints in the fingerprint identification system. Automated fingerprint identification systems (AFIS) are primarily used by law enforcement agencies for criminal identification purposes, the most important of which is the identification of a person suspected of committing a crime or linking a suspect to other unsolved crimes.
Automated fingerprint verification is a closely related technique used in applications such as attendance and access control systems. On a technical level, verification systems verify a claimed identity (a user might claim to be John by presenting his PIN or ID card and verify his identity using his fingerprint), whereas identification systems determine identity based solely on fingerprints.
AFISs have been used in large-scale civil identifications, the chief purpose of which is to prevent multiple enrollments in an electoral, welfare, driver licensing, or similar system. Another benefit of a civil AFISs is to check the background of job applicants for sensitive posts and educational personnel who have close contact with children.
Deployed systems
The United States Integrated Automated Fingerprint Identification System (IAFIS) holds the fingerprint sets collected in the United States, and is managed by the FBI. However, the IAFIS is being retired to make room for a more improved software called the Next Generation Identification (NGI) system. Many states also have their own AFISs. AFISs have capabilities such as latent searching, electronic image storage, and electronic exchange of fingerprints and responses.
Many other countries and entities — including Canada, the European Union, the United Kingdom, Bangladesh, India, Israel, Pakistan, Sri Lanka, Argentina, Turkey, Morocco, Italy, Chile, Peru, Venezuela, Australia, Denmark, the International Criminal Police Organization, and various states, provinces, and local administrative regions — have their own systems, which are used for a variety of purposes, including criminal identification, applicant background checks, receipt of benefits, and receipt of credentials (such as passports). In Australia, the system is called the National Automated Fingerprint Identification System.
European police agencies are now required by a European council act to open their AFISs to each other to improve the war on terror and the investigation of cross-border crime. The act followed the Prüm treaty, an initiative between the countries Belgium, Germany, Spain, France, Luxembourg, the Netherlands and Austria. While technically not being an AFIS itself, the Pruem treaty's decentral infrastructure allows AFIS queries on all European criminal AFISs within a reasonable time.
Fingerprint-matching algorithms
Fingerprint-matching algorithms vary greatly in terms of Type I (false positive) and Type II (false negative) error rates. They also vary in terms of features |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.