source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/The%20Man%20in%20the%20S.U.V. | "The Man in the S.U.V." is the second episode of the first season of the television series, Bones. Originally aired on September 20, 2005 on FOX network, the episode is written by Stephen Nathan and directed by Allan Kroeker. The plot features the investigation of Dr. Temperance Brennan and FBI Special Agent Seeley Booth into a man whose S.U.V. exploded, killing him and several other civilians, and highlights issues about terrorism.
Summary
After an S.U.V. explodes in front of a busy café in Washington, D.C., forensic anthropologist Dr. Temperance Brennan is asked to confirm the identity of the SUV's driver as Hamid Masruk, the leader of the Arab-American Friendship League. With the help of her assistant, Zack Addy, Brennan cleans the skeleton and compares the bones to Masruk's medical records.
Although she is convinced the victim is Hamid Masruk, Brennan sends Zack to reconstruct the skull. Zack finds that the ethmoid and sphenoid fragments do not fit together, which Brennan suspects is due to a degenerative disease.
However, it was not from Paget's disease or Lupus as she had first suspected but from gypsum, an environmental contaminant which Zack and Dr. Jack Hodgins found. They determine that the gypsum found was probably used to insulate the bomb that had exploded. After Brennan finds microscopic fissures in the trabecular pattern of Hamid's skull, Hodgins was able to find the cause - Hamid was exposed to dioxins.
Hamid's wife, Sahar, vehemently states that her husband is not a terrorist. Booth suspects that the wife is having an affair, to which Brennan disagrees while her friend, Angela Montenegro, agrees with Booth. Booth finds out the man with whom Sahar was having an affair is Ali Ladjavardi, but he could not have killed Hamid since he was training with Homeland Security during the time when Hamid would have been exposed to the dioxin.
When Hodgins and Zack were able to tie the gypsum they found to a type of plaster used in pyrobar, a gypsum-based, fire-proof tile developed in 1903, Booth and Brennan are able to find out the area in which the tile was used and the bomb was built. They realize the home of Hamid's brother, Farid Masruk, is located in that area. However, when they arrive at his house, they find him missing but the insulation used for the explosives is in plain sight. Farid had planned another attack but fails to set off the bomb when Booth and Brennan arrive just in time to stop him.
Music
The episode featured the following tracks: -
I Turn My Camera On - Spoon
Every ship must sail away - Blue Merle
Shalom - Moonraker
Try - Deep Audio
Production details
This episode was written and filmed after "A Boy in the Tree", which was aired as the series' third episode. According to Stephan Nathan, executive producer and writer of Bones, the episode's main focus is misdirection. The opening scene featuring a Middle Eastern man driving an SUV, which stops in front of a busy café and explodes, is used to cause the audience |
https://en.wikipedia.org/wiki/A%20Boy%20in%20a%20Tree | "A Boy in a Tree" is the third episode of the first season of the television series, Bones. Originally aired on September 27, 2005 on Fox network, the episode is written by Hart Hanson and directed by Patrick Norris. The plot features FBI Special Agent Seeley Booth and Dr. Temperance Brennan's investigation of a teenage boy's remains found inside an exclusive private school.
Summary
Booth brings Brennan and her assistant Zack Addy to the exclusive Hanover Preparatory School, where a decomposing body has been found hanging from a tree. They retrieve the body and return to their lab at the Jeffersonian Institution in Washington, D.C., where they confirm that the body belongs to a teenage boy, most likely a student. Dr. Jack Hodgins determines that the boy died 10 to 14 days earlier.
As Booth asks for a list of students from the headmaster of the school, Brennan calls to tell him of the cochlear implant she found in the victim's ear. She informs him that they will be able to identify the victim by tracing the serial number on the device. The victim is Nestor Olivos, a student of the school and the only son of the Venezuelan ambassador. The team finds it odd that Nestor's hyoid bone is broken, as the hyoid of an adolescent should be flexible and almost unbreakable.
While the school's headmaster and its head of security are adamant that Nestor had committed suicide, Nestor's mother, the Venezuelan ambassador, urges Dr. Brennan to find the truth and believes that Nestor had been murdered. The central mystery of the case is whether Nestor killed himself or was murdered.
Based on the Tabinid maggots' pupal casing, Hodgins determines that Nestor ingested a heavy dose of ketamine, a dissociative anesthetic, before he died. However, the team cannot be certain if the boy had taken the drug involuntarily but Dr. Brennan is able to give a scenario of Nestor's death involving the ketamine. Combined with the ketamine, the choking would have caused Nestor to regurgitate stomach acids, which would have been trapped in the throat and weakened the hyoid bone. The weight of Nestor's body could then break his hyoid.
In addition to the forensic evidence, Dr. Brennan and Agent Booth find DVD recordings of sexual activities, which they discover had led to blackmail. Nestor's classmates Tucker Pattison and Camden Destry had set up a video camera facing Nestor's bed. After Tucker used a video recording to blackmail Camden's mother, he and Camden decided to blackmail Nestor as well. When Tucker and Camden learned that Nestor was going to tell the headmaster of their blackmail attempt, they drugged Nestor and hung him on a tree in order to feign a suicide. In the end, Dr. Brennan and Agent Booth were able to prove that Nestor was murdered.
After the case, Booth is given his own access pass to the lab courtesy of Brennan.
Music
The episode featured music by the following artists: -
Miles from Montery - West Indian Girl
Sunshine everywhere - Deep Audio
City Streets - |
https://en.wikipedia.org/wiki/SapWin | Symbolic Analysis Program for Windows (SAPWIN) is a proprietary symbolic circuit simulator written in C++ for the Microsoft Windows operating systems Vista, 7.0 and 8.1. Unlike more common numerical circuit simulators (such as Simulation Program with Integrated Circuit Emphasis (SPICE)), SAPWIN can generate analytical Laplace domain expressions for arbitrary network functions of linear analog circuits. The SAPWIN package also includes tools for schematic capture and graphic post-processing.
SAPWIN is available free from its homepage at the University of Florence website.
SapecNG
Symbolic Analysis Program for Electric Circuits - Next Generation (SapecNG) is the open-source software relative of SAPWIN, written in Boost C++ libraries and designed to be cross-platform. QSapecNG is a Qt-based graphical user interface (GUI) and schematic capture program for SAPEC-NG.
See also
Comparison of EDA software
List of free electronics circuit simulators
Symbolic Circuit Analysis
References
External links
SAPWIN - A Symbolic Simulator as a Support in Electrical Engineering Education
Electronic circuit simulators
Free software programmed in C++
Free electronic design automation software
Electronic design automation software for Linux
University of Florence
Windows-only free software
Engineering software that uses Qt |
https://en.wikipedia.org/wiki/Claris%20CAD | Claris CAD was a two-dimensional computer-aided design program for Apple Inc. Macintosh.
History
Claris CAD was developed in 1988 by Claris Corporation in a joint effort with Craig S. Young of Computer Aided Systems for Engineering (CASE). It was based on MacDraw II and Young's earlier CAD application, EZ-Draft. Version 1 was released in 1989 for Macintosh computers running System Software 6 or later. The initial releases were plagued with bugs, especially with the bundled plotter driver. Development halted in June 1991 with the release of version 2.0.3. Currently, Claris CAD can be run on older Macintoshes using the "Classic" emulator included by Apple in Mac OS X 10.4.11 or older, or on current machines using the SheepShaver open-source "Classic" emulator (tested through Mac OS X 10.7).
Features
Claris CAD uses a drawing system defined by Tools, Methods, and Modifiers. Tools draw objects, methods allow different ways of drawing with the tools, and modifiers help to position objects.
Some notable tool functions include: walls, arcs, chamfers, fillets, spline curves, perpendiculars, and tangents. Dimensioning tools can create point-to-point, chain, datum, angle, radius, diameter, and circle-center dimensions.
Predefined ANSI Y14.5, ISO, DIN, JIS, and BS-308 drawing standards templates are also included with the software.
A special Claris version of Microspot Ltd.'s MacPlot plotter driver was also part of the package, allowing Claris CAD to plot to Hewlett-Packard and Houston Instruments plotters. A utility called MacPlot Configure also lets the user specify a plotter model and assign pen colors to carousel positions.
The physical software package provides a reference, tutorial, and a videotape tutorial.
Limitations
Though Claris CAD is sufficient for creating floor plans and manual orthographic projections, many users require three-dimensional capability. Most users have abandoned it because it can no longer run natively on modern machines. However, long-term users with numerous files in ClarisCAD format and limited 3D needs continue to use it by running the Sheepshaver "Classic" emulator on current Mac computers. Due to speed/memory increases of current hardware, performance under emulation is superior to native operation on older machines, and stability does not seem to have been compromised.
Among its other anomalies, the limited accuracy QuickDraw routines were not sufficient for direct use with highly accurate applications such as computer numerical control (CNC) machines.
Some versions of the program (including 2.0 v3) have a bug where users are unable to save their work, encountering an error stating that an additional 1k of disk space is required. This is due to a limitation of saving to large size, HFS+ formatted disks. One can save to a floppy disk or small RAM disk as a workaround, or use the "Save As..." command, renaming the file in the process.
Interoperability
Claris Graphics Translator by Claris Corp. converts drawings |
https://en.wikipedia.org/wiki/Zune%20%28widget%20toolkit%29 | Zune is an object-oriented GUI toolkit which is part of the AROS (AROS Research Operating System) project and nearly a clone, at both an API and look-and-feel level, of Magic User Interface (MUI), a well-known Amiga shareware product by Stefan Stuntz.
Zune is based on the BOOPSI system, the framework inherited from AmigaOS for object-oriented programming in C. Zune classes don't derive from existing BOOPSI gadget classes; instead, the Notify class (base class of the Zune hierarchy) derives from the BOOPSI root class.
Wanderer
Wanderer is the whole desktop and not only window manager user interface that is based on Zune widget toolkit. It sports an interface that recalls Amiga GUI Workbench window manager which presents a desktop environment paradigm, and its graphical aspect is enhanced with Magical User Interface features and styleguides. It supports themes and various types of icons such as Amiga Icons planar style (AmigaOS 3.1), Iconcolor (AmigaOS 3.5) and .png icons. The actual set of icons in Wanderer has been realized by Adam Chodorowski, and is based upon Linux icon subset called Gorilla icons present in GNOME repository.
As a work in progress Wanderer is still far from being completed. The main task of the developers of AROS is to make its desktop interface capable to recall the aspect and the ease of use of its predecessor (the Amiga Workbench), and enhancing the Wanderer desktop with any modern technology and feature as any modern user interface nowadays.
References
External links
Article about AROS on OSNews.com
Zune Application Development Manual
Amiga APIs
AROS software
Widget toolkits |
https://en.wikipedia.org/wiki/Ruthenium%28IV%29%20oxide%20%28data%20page%29 | This page provides supplementary chemical data on ruthenium(IV) oxide.
Thermodynamic properties
Spectral data
Structure and properties data
Material Safety Data Sheet
The handling of this chemical may require notable safety precautions. Safety information can be found on the Material Safety Datasheet (MSDS) for this chemical or from a reliable source, such as SIRI.
References
Chemical data pages
Chemical data pages cleanup |
https://en.wikipedia.org/wiki/Micropal | Micropal Group Limited, known as Micropal, was a global financial services company specialising in the collection and analysis of mutual fund performance data.
History
The firm was founded and financed in 1985 by Christopher Poll who with John Richardson established Opal as a mainframe fund data service that soon became Micropal as it migrated to the PC. In 1985 , the company consisted of 7 people with a combined vision to bring improved transparency and credibility to fund performance industry From its London base within 3 years it opened its Hong Kong office. In the USA it expanded through acquisition of Interactive Data Corporation of Des Moines, Iowa and AIM technical analysis system based in Portland Oregon. In parallel bases were established in Europe and by mid-1990s it had established 15 offices around the world, including an agency started in 1991 in Switzerland by Justin Wheatley, Along with creating credible data bases of global fund information, Micropal mainly through Chris Poll, became a major influencer in extending AIMR rules, improving fund regulation globally and in helping to establish GIPS (Global Investment Performance Standards).
Acquisition by The McGraw-Hill Companies
In November 1997, The McGraw-Hill Companies, a global publisher purchased Micropal, in order to add the firm to its Standard & Poor's market information brand. Micropal became the '"S&P Micropal" division of Standard & Poor's. Christopher Poll, who had been serving as Chairman, retired from the company and focused on advising the Chinese authorities on the development of their fund industry. Mark Adorian was appointed to head the new division.
On March 22, 2007, Standard & Poor's mutual fund data business, including Micropal, was acquired by Morningstar, Inc. for US$55 million.
Business description
During its existence, Micropal came to be considered a global leader in providing independent information on mutual funds In Europe, their data, rankings & awards were widely quoted in media outlets as well as the marketing materials of fund companies. Christopher Poll and other members of the company would also be called upon to offer sound bites on subjects related to the mutual fund industry.
Micropal was the first mutual fund tracking company to establish itself in Asia, and by the time competitors began to seriously enter the market in 1997 Micropal had 12 employees in four regional offices
References
External links
Official Site (Redirects)
Virtual Currency News
Financial services companies established in 1985
Financial services companies disestablished in 1997
Defunct financial data vendors
Research and analysis firms of the United States
Defunct research and analysis firms
1985 establishments in the United Kingdom |
https://en.wikipedia.org/wiki/Map%20database%20management | Map database management systems are software programs designed to store and recall spatial information for navigation applications, and are thus a form of Geographic information system. They are widely used in localization and navigation, especially in automotive applications. Moreover, they are playing an increasingly important role in the emerging areas of location-based services, active safety functions and advanced driver-assistance systems. Common to these functions is the requirement for an on-board map database that contains information describing the road network.
When designed well, a map database enables the rapid indexing and lookup of a large amount of geographic data.
Content of a map database
Maps are stored as graphs, or two dimensional arrays of objects with attributes of location and category, where some common categories include parks, roads, cities, and the like.
A map database represents a road network along with associated features. Map providers can choose various models of a road network as a basis to formulate a database. Commonly, such a model comprises basic elements (nodes, links and areas) of the road network and properties of those elements (location coordinates, shape, addresses, road class, speed range, etc.). The basic elements are referred to as features and the properties as attributes. Other information associated with the road network is also included, including points of interest, building shapes, and political boundaries. This is shown schematically in the adjacent image. Geographic Data Files (GDF) is a standardized description of such a model.
Each node within a map graph represents a point location of the surface of the Earth and is represented by a pair of longitude (lon) and latitude (lat) coordinates. Each link represents a stretch of road between two nodes, and is represented by a line segment (corresponding to a straight section of road) or a curve having a shape that is generally described by intermediate points (called shape points) along the link. However, curves may also be represented by a combination of centroid (point or node), with a radius, and polar coordinates to define the boundaries of the curve. Shape points are represented by lon-lat coordinates as are nodes, but shape points do not serve the purpose of connecting links, as do nodes. Areas are two-dimensional shapes that represent things like parks, cities, blocks and are defined by their boundaries. These are usually formed by a closed polygon, which are shapes that indicated an object over a map has to have a close boundary, meaning the first vertex should be same as the last vertex. (For example, to plot a square object on a map, the vertices of the polygon are numbered 1,2,3,4,1, in this order)
Another point for validation on data is the point in polygon, which helps in finding points lying outside a polygon. E.g., for a particular lon-lat coordinates in a city, if the point is intersecting the polygon in an odd number, then |
https://en.wikipedia.org/wiki/Einar%20Stefferud | Einar A. Stefferud (Stef) (11 January 1930 – 22 September 2011) was a computer researcher and entrepreneur, who made many significant contributions to the development of the Internet, particularly in the areas of IETF RFCs and standards, secure online payment systems, DNS, and secure email. Stefferud was one of the original designers of the MIME protocol for sending multimedia Internet electronic mail.
Creating new paradigms was part of Stefferud's life. This experience was presented in his classic talk, What is the Internet Paradigm?
Career
Stefferud was born in Wausau, Wisconsin and earned a BA and MBA from University of California, Los Angeles. He was a Retired Adjunct Professor of Information and Computer Science at the University of California, Irvine.
Stefferud was active in ARPA/NSF/IETF DARPA Internet research and development since 1975. He was involved in pre-standards work for X.400/X.500 in the International Federation for Information Processing (IFIP) WG 6.5, and post-standards profiling in the National Institute of Standards and Technology OIW. He was involved in the US ANSI OSI Registration Authority; the US National Mail Transfer Service Interest Group (USMTS) and the IETF (Internet Engineering Task Force) where he has been involved with email standards development (e.g. MIME, SMTP Extensions and MHTML). He was Chair of IFIP Working Group 6.5 on Upper Layer Protocols, Architectures and Applications (ULPAA) from 1990 to 1996. He served as Chair of the 1988, 1990, 1992, 1994 IFIP WG 6.5 ULPAA Conferences.
Stefferud was founder (1969) and President of Network Management Associates, where he provided Strategic Technical and Management Advisory Information Services on internet environments until 2000. He was a co-founder (1994) and Chief Visionary Officer of First Virtual Holdings, called "the first cyberbank" by the Smithsonian Institution, that launched an Internet Payment System in October 1994. First Virtual technology and patents are still in current use.
Stefferud was honored by Communications Week Magazine as one of the Top 10 Visionaries in the Computer-Communications Industry for 1993. He was awarded Patent No. 5,757,917 with Marshall Rose and Nathaniel Borenstein for a "Computerized Payment System for Purchasing Goods and Services on the Internet".
In 1997 Stefferud, Brian K. Reid and Richard J. Sexton formed the Open Root Server Confederation as a potential organization to serve as an institutional version of John Postel's IANA, and a proposal was submitted to the US Government Department of Commerce NTIA, which eventually picked the joint Network Solutions/IANA proposal that became ICANN.
In 1999, at the end of the DNS domain name registry management discussions during the formation of ICANN, Stefferud was nominated Registry Advisory Board Member at Network Solutions (NSI), to provide independent external advisory review of the design and testing of the NSI Shared Registration System.
As the Internet developed, the |
https://en.wikipedia.org/wiki/Database%20model | A database model is a type of data model that determines the logical structure of a database. It fundamentally determines in which manner data can be stored, organized and manipulated. The most popular example of a database model is the relational model, which uses a table-based format.
Types
Common logical data models for databases include:
Hierarchical database model
This is the oldest form of database model. It was developed by IBM for IMS (information Management System), and is a set of organized data in tree structure. DB record is a tree consisting of many groups called segments. It uses one-to-many relationships, and the data access is also predictable.
Network model
Relational model
Entity–relationship model
Enhanced entity–relationship model
Object model
Document model
Entity–attribute–value model
Star schema
An object–relational database combines the two related structures.
Physical data models include:
Inverted index
Flat file
Other models include:
Correlational model
Multidimensional model
Multivalue model
Semantic model
XML database
Named graph
Triplestore
Relationships and functions
A given database management system may provide one or more models. The optimal structure depends on the natural organization of the application's data, and on the application's requirements, which include transaction rate (speed), reliability, maintainability, scalability, and cost. Most database management systems are built around one particular data model, although it is possible for products to offer support for more than one model.
Various physical data models can implement any given logical model. Most database software will offer the user some level of control in tuning the physical implementation, since the choices that are made have a significant effect on performance.
A model is not just a way of structuring data: it also defines a set of operations that can be performed on the data. The relational model, for example, defines operations such as select (project) and join. Although these operations may not be explicit in a particular query language, they provide the foundation on which a query language is built.
Flat model
The flat (or table) model consists of a single, two-dimensional array of data elements, where all members of a given column are assumed to be similar values, and all members of a row are assumed to be related to one another. For instance, columns for name and password that might be used as a part of a system security database. Each row would have the specific password associated with an individual user. Columns of the table often have a type associated with them, defining them as character data, date or time information, integers, or floating point numbers. This tabular format is a precursor to the relational model.
Early data models
These models were popular in the 1960s, 1970s, but nowadays can be found primarily in old legacy systems. They are characterized primarily by being navigational with |
https://en.wikipedia.org/wiki/Electronic%20Media%20Union%20of%20Trinidad%20and%20Tobago | The Electronic Media Union of Trinidad and Tobago is a trade union in Trinidad and Tobago. It main membership base was in the now defunct National Broadcasting Network (NBN) which was the state broadcasting company.
See also
List of trade unions
Trade unions in Trinidad and Tobago |
https://en.wikipedia.org/wiki/Xmonad | xmonad is a dynamic window manager (tiling) for the X Window System, noted for being written in the functional programming language Haskell.
Window manager
Begun in March 2007, version 0.1 was announced in April 2007 as 500 lines of Haskell (which have since grown to 2000 lines). xmonad is a tiling window manager—akin to dwm, larswm, and StumpWM. It arranges windows in a non-overlapping pattern, and enables managing windows without using the mouse. xmonad is packaged and distributed on a wide range of Unix-like operating systems, such as a large number of Linux distributions, and Berkeley Software Distribution (BSD) systems.
While originally a clone of dwm (derivative in areas such as default keybindings), xmonad now supports features not available to dwm users such as per-workspace layout, tiling reflection, state preservation, layout mirroring, GNOME support and per-screen status bars; it can be customised by modifying an external configuration file and 'reloaded' while running. xmonad features have begun to influence other tiling window managers: dwm has borrowed "urgency hooks" from xmonad, has also included Xinerama support (for multihead displays) with release 4.8, and patches exist to reimplement xmonad's Fibonacci layout.
Haskell project
In 2023 the man page stated: By utilising the expressivity of a modern functional language with a rich static type system, xmonad provides a complete, featureful window manager [...], with an emphasis on correctness and robustness. Internal properties of the window manager are checked using a combination of static guarantees provided by the type system, and type-based automated testing. A benefit of this is that the code is simple to understand, and easy to modify.
Since xmonad's inception, when its small code size of 500 lines of code was advertised, it has grown to ca. 2000 lines in 2023.
Extensions to the core system, including emulation of other window managers, and unusual layout algorithms, such as window tiling based on the Fibonacci spiral—have been implemented by the active community and are available as a library.
Along with obviating the need for a mouse, the xmonad developers make heavy use of semi-formal methods and program derivation for improving reliability and enabling a total line of code count less than 1200, as of version 0.7; window manager properties (such as the behavior of window focus) are checked through use of QuickCheck. This emphasis makes xmonad unusual in a number of ways; besides being the first window manager written in Haskell, it is also the first to use the zipper data structure for automatically managing focus, and its core has been proven to be safe with respect to pattern matches, contributing further to reliability. The developers write:
xmonad is a tiling window manager for the X Window system, implemented, configured and dynamically extensible in Haskell. This demonstration presents the case that software dominated by side effects can be developed with the |
https://en.wikipedia.org/wiki/MakeHuman | MakeHuman is a free and open source 3D computer graphics middleware designed for the prototyping of photorealistic humanoids. It is developed by a community of programmers, artists, and academics interested in 3D character modeling.
Technology
MakeHuman is developed using 3D morphing technology. Starting from a standard (unique) androgynous human base mesh, it can be transformed into a great variety of characters (male and female), mixing them with linear interpolation. For example, given the four main morphing targets (baby, teen, young, old), it is possible to obtain all the intermediate shapes.
Using this technology, with a large database of morphing targets, it's virtually possible to reproduce any character. It uses a very simple GUI in order to access and easily handle hundreds of morphings. The MakeHuman approach is to use sliders with common parameters like height, weight, gender, ethnicity and muscularity. In order to make it available on all major operating systems, beginning from 1.0 alpha 8 it's developed in Python using OpenGL and Qt, with an architecture fully realized with plugins.
The tool is specifically designed for the modeling of virtual 3D human models, with a simple and complete pose system that includes the simulation of muscular movement. The interface is easy to use, with fast and intuitive access to the numerous parameters required in modeling the human form.
The development of MakeHuman is derived from a detailed technical and artistic study of the morphological characteristics of the human body. The work deals with morphing, using linear interpolation of both translation and rotation. With these two methods, together with a simple calculation of a form factor and an algorithm of mesh relaxing, it is possible to achieve results such as the simulation of muscular movement that accompanies the rotation of the limbs.
License
MakeHuman is free and open-source, with the source code and database released under the GNU Affero GPL. Models exported from an official version are released under an exception to this, CC0, in order to be widely used in free and non-free projects. These projects may or may not be commercialised.
Awards
In 2004, MakeHuman won the Suzanne Award as best Blender Python script.
Software history
The ancestor of MakeHuman was MakeHead, a python script for Blender, written by Manuel Bastioni, artist and coder, in 1999. A year later, a team of developers had formed, and they released the first version of MakeHuman for Blender. The project evolved and, in 2003, it was officially recognized by the Blender Foundation and hosted on http://projects.blender.org. In 2004, the development stopped because it was difficult to write a Python script so big using only Blender API. In 2005, MH was moved outside Blender, hosted on SourceForge and rewritten from scratch in C. At this point, version counting restarted from zero. During successive years, the software gradually transitioned from C to C++.
While perfo |
https://en.wikipedia.org/wiki/A.I.%20Artificial%20Intelligence%20%28soundtrack%29 | A.I. Artificial Intelligence - Music from the Motion Picture is the film score of the 2001 film of the same name, composed and conducted by John Williams. The original score was composed by Williams and featured singers Lara Fabian on two songs and Josh Groban on one. Soprano Barbara Bonney provided the vocal solos in several tracks.
Background
The album was nominated for the Academy Award for Best Original Score (ceding to the score of The Lord of the Rings: The Fellowship of the Ring), the Golden Globe Award for Best Original Score (ceding to the score of Moulin Rouge!) and the Grammy Award for Best Score Soundtrack for Visual Media (ceding to the score of Crouching Tiger, Hidden Dragon).
The 2001 official soundtrack album did not include all of the music from the film, and several cues were conspicuously absent. A promotion-only release of the complete soundtrack was created for members of the Academy of Motion Picture Arts and Sciences that were responsible for voting for the award for Best Original Score. This version of the soundtrack later leaked to the public, and has been issued in several bootleg editions by various record labels. Then, in 2015, the complete score was officially issued for the first time in a 3-CD set by La-La Land Records.
Original WB Track listing
The cues presented on the initial commercial release do not follow the order they are heard in the film. The album cues can be heard in the following order: 6, 4, 2, 7, 10, 1, 3, 11, 8, 12, 9.
Track listing
Complete score
La-La Land Records released John Williams' complete score to A.I. Artificial Intelligence in 2015 as a Limited Edition 3-CD set of 3000 units. The album contains the entire score as heard in the film in chronological order as well as alternate and extended versions of key cues in the film. This reissue was produced, assembled and mastered by Mike Matessino and it also features exclusive, in-depth liner notes by Jeff Bond as well as art design by Jim Titus.
Disc one
Cybertronics - 3:33
Henry Is Selected - 1:54
David's Arrival - 2:46
Of Course I'm Not Sure - 2:41
Hide and Seek (extended version) - 3:25
David Studies Monica - 2:06
Reading the Words - 5:58
Wearing Perfume - 4:13
Martin Is Alive - 1:30
David and Martin - 2:19
Canoeing With Pinocchio - 1:36
David and the Spinach / The Operating Scene - 3:07
The Scissor Scene - 3:48
The Pool Rescue - 1:42
Monica's Plan - 3:30
Abandoned in the Woods (extended version) - 3:57
The Moon Rising / The Biker Hounds - 5:10
Remembering David Hobby - 2:20
Journey to Rouge City - 3:51
Immaculate Heart - :46
To Manhattan - 1:28
A.I. Theme (instrumental version) - 4:08
Disc two
The Mecha World (extended version) - 8:43
Replicas - 5:59
Finding the Blue Fairy - 6:02
Journey Through the Ice (Part 1) - 4:43
Journey Through the Ice (Part 2) - 5:07
Stored Memories - 3:08
What Is Your Wish - 4:10
The Specialist Visits - 4:03
The Reunion - 7:50
Where Dreams Are Born - 4:23
A.I. Theme (vocal |
https://en.wikipedia.org/wiki/The%20Maid%20of%20Honour | The Maid of Honour is a Jacobean era stage play, a tragicomedy written by Philip Massinger, first published in 1632. It may be Massinger's earliest extant solo work.
Performance
Firm data on the play's date of authorship and initial theatrical production have not survived; scholars estimate a date in the early 1620s, perhaps 1621–23. The title page of the earliest edition states that the play was acted by Queen Henrietta's Men at the Cockpit Theatre—though that company did not exist under that name prior to 1625. The title page may refer to performances in the 1625–32 period rather than the work's debut.
John Philip Kemble, an admirer of Massinger's dramas, staged an adaptation of the play called Camiola, or The Maid of Honour, at Drury Lane in 1785. It starred his sister Sarah Siddons; but it was not a success, and lasted only three performances.
Publication
The 1632 quarto, published by the bookseller Robert Allot, bore a commendatory poem by Massinger's friend Sir Aston Cockayne, which indicates that the publication of The Maid of Honour followed that of The Emperor of the East in the same year. The quarto bears Massinger's dedication of the play to two of his patrons, Sir Francis Foljambe and Sir Thomas Bland, in gratitude for their "frequent courtesies and favours." A second quarto appeared in 1638.
Synopsis
The play is set in Palermo and Siena in Italy. The court of King Roberto of Sicily receives an ambassador from Roberto's ally Ferdinand, the duke of Urbino. Ferdinand has launched a military assault on the duchy of Siena, because the duchess, Aurelia, has refused his proposal of marriage. Ferdinand and his forces have taken Siena, but now face a vigorous counterattack, led by the general Gonzaga, a member of the Knights of Malta. Ferdinand has sent an appeal to his ally Roberto for help. Roberto, however, responds that the alliance between Sicily and Urbino is purely defensive in nature—the two have promised to come to each other's aid if attacked. The alliance does not cover aggressive warfare; and on that basis Roberto refuses to send any troops.
The King's sensible decision is protested by his "natural" (illegitimate) half-brother Bertoldo, another Knight of Malta. Bertoldo is a fiery character who has his own following among the kingdom's younger nobility and gentry, and he criticises his brother's caution and passivity. Roberto allows Bertoldo to lead a contingent of volunteers to Ferdinand's assistance—as long as it is understood by all concerned that their mission is unofficial and will receive no direct support from the Sicilian monarch. This is Roberto's way of ridding his kingdom of troublesome malcontents, especially Bertoldo.
The play's second scene introduces Camiola, the title character. Her "beauty, youth, and fortune" make her the target of several suitors, including: Signior Sylli, a ridiculously vain "self-lover;" Fulgentio, the corrupt and egomaniacal favourite of the king; Adorni, a retainer of Camiola's late fa |
https://en.wikipedia.org/wiki/Social%20system | In sociology, a social system is the patterned network of relationships constituting a coherent whole that exist between individuals, groups, and institutions. It is the formal structure of role and status that can form in a small, stable group. An individual may belong to multiple social systems at once; examples of social systems include nuclear family units, communities, cities, nations, college campuses, religions, corporations, and industries. The organization and definition of groups within a social system depend on various shared properties such as location, socioeconomic status, race, religion, societal function, or other distinguishable features.
Notable theorists
The study of social systems is integral to the fields of sociology and public policy. Social systems have been studied for as long as sociology has existed.
Talcott Parsons
Talcott Parsons was the first to formulate a systematic theory of social systems, which he did as a part of his AGIL paradigm. He defined a social system as only a segment (or a "subsystem") of what he called action theory. Parsons organized social systems in terms of action units, where one action executed by an individual is one unit. He defines a social system as a network of interactions between actors. According to Parsons, social systems rely on a system of language, and culture must exist in a society in order for it to qualify as a social system. Parsons' work laid the foundations for the rest of the study of social systems theory and ignited the debate over what framework social systems should be built around, such as actions, communication, or other relationships.
Niklas Luhmann
Niklas Luhmann was a prominent sociologist and social systems theorist who laid the foundations of modern social system thought. He based his definition of a "social system" on the mass network of communication between people and defined society itself as an "autopoietic" system, meaning a self-referential and self-reliant system that is distinct from its environment. Luhmann considered social systems as belonging to three categories: societal systems, organizations, and interaction systems. Luhmann considered societal systems, such as religion, law, art, education, science, etc., to be closed systems consisting of different fields of interaction. Organizations were defined as a network of decisions which reproduce themselves; his definition is difficult to apply in terms of finding a real-world example. Finally, interaction systems are systems that reproduce themselves on the basis of co-presence rather than decision making.
Jay Wright Forrester
Jay Wright Forrester founded the field of system dynamics, which deals with the simulation of interactions in dynamic systems. In his work on social systems, he discusses the possibilities of social system dynamics, or modeling social systems using computers with the aim of testing the possible effects of passing new public policies or laws. In his paper he recognized the d |
https://en.wikipedia.org/wiki/Caspase%202 | Caspase 2 also known as CASP2 is an enzyme that, in humans, is encoded by the CASP2 gene. CASP2 orthologs have been identified in nearly all mammals for which complete genome data are available. Unique orthologs are also present in birds, lizards, lissamphibians, and teleosts.
Function
Sequential activation of caspases plays a central role in the execution-phase of cell apoptosis. Caspases exist as inactive proenzymes that undergo proteolytic processing at conserved aspartic residues to produce two subunits, large and small, that dimerize to form the active enzyme. The proteolytic cleavage of this protein is induced by a variety of apoptotic stimuli.
Caspase 2 proteolytically cleaves other proteins. It belongs to a family of cysteine proteases called caspases that cleave proteins only at an amino acid following an aspartic acid residue. Within this family, caspase 2 is part of the Ich-1 subfamily. It is one of the most conserved caspases in different species of animal. Caspase 2 has a similar amino acid sequence to initiator caspases, including caspase 1, caspase 4, caspase 5, and caspase 9. It is produced as a zymogen, which contains a long pro-domain that is similar to that of caspase 9 and contains a protein interaction domain known as a CARD domain. Pro-caspase-2 contains two subunits, p19 and p12.
It has been shown to associate with several proteins involved in apoptosis using its CARD domain, including RIP-associated Ich-1/Ced-3-homologue protein with a death domain (RAIDD), apoptosis repressor with caspase recruitment domain (ARC), and death effector filament-forming Ced-4-like apoptosis protein (DEFCAP). Together with RAIDD and p53-induced protein with a death domain ([PIDD])(LRDD), caspase 2 has been shown to form the so-called PIDDosome, which may serve as an activation platform for the protease, although it may also be activated in the absence of PIDD. Overall, caspase 2 appears to be a very versatile caspase with multiple functions beyond cell death induction.
Interactions
Caspase 2 has been shown to interact with:
BH3 interacting domain death agonist,
CRADD, and
Caspase 8.
See also
The Proteolysis Map
Caspase
References
External links
The MEROPS online database for peptidases and their inhibitors: C14.006
EC 3.4.22
Caspases |
https://en.wikipedia.org/wiki/Scalable%20Network%20Application%20Package | Scalable Network Application Package (SNAP) or SNAP Mobile is an online gaming platform from Nokia. It is intended for use for Java multiplayer online games. It consists of SNAP Mobile API for the client and it uses HTTP or TCP to connect to the SNAP Mobile gateway.
This gaming platform was the old Sega Network Application Package that Sega sold to Nokia on 2003 and renamed it as Scalable Network Application Package.
See also
N-Gage Arena
Mobile game
Java ME
References
External links
SNAP Mobile
SNAP Arcade
Nokia services |
https://en.wikipedia.org/wiki/PhpCodeGenie | phpCodeGenie is a code generator for web applications. Once the user designs their database tables, phpCodeGenie generates the scripts and programs. It will build data entry forms, insert scripts, database lister scripts, edit record forms, update record scripts, delete confirmation scripts, delete scripts, search forms, search scripts and other frontend/database interaction code.
As a code generator for database-driven applications, it also can be considered as a CASE tool. It generates the core CRUD code in SQL and the basic front end for PHP and Java applications. It can communicate with multiple databases such as: MySQL, PostgreSQL, ODBC, SQLite, Oracle, IBM Db2, MS SQL Server, MaxDB, Visual FoxPro, FrontBase, InterBase, Firebird, Informix, LDAP, Netezza, SAP DB, Sybase, and generate code from them.
See also
Comparison of web frameworks
External links
PHPCodeGenie Sourceforge site
List of opensource software from Nilesh Dosooye
PHPCodeGenie profile in Code Generation Network
PHPCodeGenie profile in FSF/Unesco Free Software Directory
Web frameworks |
https://en.wikipedia.org/wiki/Line%20Impedance%20Stabilization%20Network | A line impedance stabilization network (LISN) is a device used in conducted and radiated radio-frequency emission and susceptibility tests, as specified in various electromagnetic compatibility (EMC)/EMI test standards (e.g., by CISPR, International Electrotechnical Commission, CENELEC, U.S. Federal Communications Commission, MIL-STD, DO-160 Sections 20-21-22).
A LISN is a low-pass filter typically placed between an AC or DC power source and the EUT (equipment under test) to create a known impedance and to provide a radio frequency (RF) noise measurement port. It also isolates the unwanted RF signals from the power source. In addition, LISNs can be used to predict conducted emission for diagnostic and pre-compliance testing.
Functions of a LISN
Stable line impedance
The main function of a LISN is to provide a precise impedance to the power input of the EUT, in order to get repeatable measurements of the EUT noise present at the LISN measurement port. This is important because the impedance of the power source and the impedance of the EUT effectively operate as a voltage divider. The impedance of the power source varies, depending on the geometry of the supply wiring behind it.
The anticipated inductance of the power line for the intended installation of the EUT also plays a role in identifying the correct type of LISN needed for testing. For example, a connection in a building will often use 50 μH inductor, whereas in automobile measurement standards a 5 μH inductor is used to emulate a shorter typical wire length.
Isolation of the power source noise
Another important function of a LISN is to prevent the high-frequency noise of the power source from coupling in the system. A LISN functions as a low-pass filter, which provides high impedance to the outside RF noise while allowing the low-frequency power to flow through to the EUT.
Safe connection of the measuring equipment
Typically, a spectrum analyzer or an EMI receiver is used to take the measurements during an EMC test. The input port of such an equipment is very sensitive and prone to damage if overloaded. A LISN provides a measurement port with, usually, 50 Ω output impedance. The stabilized impedance, the built-in low-pass filter function, and the DC rejection properties of the LISN measurement port makes it easy to couple the high frequency noise signal to the input of the measuring equipment.
LISN types
Under a particular EMC test standard, a specific LISN type is required for evaluating and characterizing the operation of the EUT.
Different types of LISNs are available for analyzing DC, single-phase or 3-phase AC power connections. The main parameters for selecting the proper type of LISN are impedance, insertion loss, voltage rating, current rating, number of power conductors and connector types. The upper frequency limit of the LISN also plays an important role when conducted emissions measurements are used for predicting radiated emissions problems. A 100 MHz LISN is used in |
https://en.wikipedia.org/wiki/Andrew%20Glaister | Andrew Glaister (born 4 July 1967 in Marlow, Buckinghamshire, England) is a video game programmer.
He initially started programming games on the ZX81 and ZX Spectrum between 1981 and 1987, forming a company called Programmers Development Systems Ltd.
Andrew then worked as a developer for Viacom New Media, Kinesoft Development and FASA Interactive in the United States. When Microsoft Game Studios acquired FASA in 1999, Andrew continued to work for them as a Development Manager, in later years particularly for the Windows Graphics and Gaming team working on Direct X 10, display drivers and other features for Windows Vista.
Work history
Andrew first started playing with electronics at age 10, and had built his first computer at age 12. This was a simple design based on the SC/MP 8060, in a wooden box with 8 LEDs, 8 input switches and 32 bytes of RAM from 4 74LS89 16x4 chips.
Sinclair projects
In 1980 he acquired his first 'real' computer, a Microtan 65, and spent time using his friend's ZX80.
In 1981 his parents purchased a ZX81 for Andrew, and within months he began selling his own games. This was done at first through one of the first computer stores in England–the Buffer Micro Shop in Streatham. Duplication was performed on C15 cassette tapes after school, with photocopied inserts. He managed four or five duplications a night, selling each for ten pounds. Andrew would then go by train from Crawley to Streatham and return with his profits. After meeting an employee from Silversoft in the shop one day, Andrew decided to let that company publish the games instead.
1982 saw the release of the ZX Spectrum. Glaister's first program for Silversoft was the video game Orbiter, which sold 30,000 copies over Christmas. He started working with Softek (later EDGE Games), writing a number of games such as Ostron.
Using the money from those games, Andrew purchased an Osborne 1 and started to use Z80 assemblers to try to produce code for the Spectrum. He also used the built-in 300 baud modem to play (with friends Jez San and Fouad Katan) a new game called MUD - Multi User Dungeon, remotely logging into Essex University. Andrew is credited for becoming the second external 'Wizard' in the game (Jez San of Argonaut Games being the first.)
In the late 80s, he worked on the development of an early IBM PC clone, the Apricot PC. It was sold under the name Programmers Development Systems Ltd., a company founded with Jacqui Lyons and Fouad Katan. Due to the Apricot's programming tools and connectivity with home computers like the ZX Spectrum, Commodore 64 and Amstrad CPC, it became popular with many developers, such as Richard Aplin and the Oliver twins.
During this time he was writing both Spectrum ports (of Konami games Jail Break and Salamander for example) and original games (Empire!).
In 1989 Andrew moved to Vancouver after joining Mission Electronics as their lead firmware engineer, to help develop the first MCA laptop. In 1992 he joined Icom simulations |
https://en.wikipedia.org/wiki/Seven%20Two | Seven Two may refer to:
"Seven Two", song from the album Barragán by the rock band Blonde Redhead
72 (number)
7two, Australian television channel from the Seven Network
72, the Alexander–Briggs notation of a twist knot with five half-twists |
https://en.wikipedia.org/wiki/Louis%20Kondos | Louis Kondos (born 13 February 1946, Athens, Greece), is a Greek soap opera actor. He appeared on Kalimera Zoi on the ANT1 network from 1994 until the show's end in 2006.
References
1946 births
Living people
Greek male television actors
Male actors from Athens
20th-century Greek male actors
21st-century Greek male actors |
https://en.wikipedia.org/wiki/The%20Man%20in%20the%20Bear | "The Man in the Bear" is the fourth episode of the first season of the television series Bones. Originally aired on November 1, 2005, on FOX network, the episode is written by Laura Wolner and directed by Allan Kroeker. The plot features FBI Special Agent Seeley Booth and Dr. Temperance Brennan's investigation concerning a human hand that was found inside a bear in Washington state.
Summary
To Brennan's dismay, Booth takes her, with Dr. Goodman's permission, to small town Aurora, Washington, to identify the victim whose arm was found inside a black bear. From a photograph taken of the arm, Brennan sees that the victim had his arm cut off by a saw before the bear ate it.
Once there, Booth and Brennan meet with the sheriff and the local doctors. The victim is a young male but only one person has been reported missing — a woman by the name of Ann Noyes. Brennan sends the bone fragments back to the Jeffersonian, where her assistant, Zack Addy, debrides them and finds indentations belonging to bite marks from a human — Brennan realizes the killer is a cannibal. Since a cannibal would get sick with prion disease, Brennan visits local coroner Dr. Andrew Rigby to ask him if he has met with any patients with such symptoms. He says that he has not.
Back at the lab, Dr. Jack Hodgins examines the bear scat Brennan had sent to him and finds a flap of skin with a tattoo, which turns out to be a Haida Sun motif, when recreated by Angela Montenegro. From the tattoo, the sheriff is able to find the victim's identity via a missing persons check. The victim is Adam Langer, and according to the sheriff, he used to come up to Aurora to visit Sherman Rivers, the town's Native American Park Ranger. However, when Booth and Brennan go to question Rivers, he escapes into the woods.
They find Rivers the next morning in the woods. From the evidence Booth and Brennan gathered from Rivers' house, they are convinced that he is a poacher but not the cannibal. With Hodgins' expertise and Rivers' help, they find the crime scene in the woods, where they also find a perverse version of a medicine wheel and two dead bodies belonging to Adam Langer and Ann Noyes, whose heart has been removed.
Based on adipocere formation, Brennan estimates Ann Noyes has been dead for about a week. When it is revealed that Adam Langer was seeing local veterinarian Dr. Denise Randall, Booth and Brennan corner her at a local bar, where they get her to bite into a block of dental medium so they can check her teeth marks. However, Brennan points out that Randall had no motives for killing Ann Noyes and that they are more likely looking for someone who is clinically insane. Meanwhile, Zack finds more marks on Ann Noyes's sternum, which Brennan determines to be made by a sternum spreader. She realizes that Dr. Rigby would have seen this beforehand but did not mention it because he is the cannibal. Booth and Brennan find Rigby in the process of cremating the bodies; Brennan knocks Rigby out with a bedpa |
https://en.wikipedia.org/wiki/Database%20storage%20structures | Database tables and indexes may be stored on disk in one of a number of forms, including ordered/unordered flat files, ISAM, heap files, hash buckets, or B+ trees. Each form has its own particular advantages and disadvantages. The most commonly used forms are B-trees and ISAM. Such forms or structures are one aspect of the overall schema used by a database engine to store information.
Unordered
Unordered storage typically stores the records in the order they are inserted. Such storage offers good insertion efficiency (), but inefficient retrieval times (). Typically these retrieval times are better, however, as most databases use indexes on the primary keys, resulting in retrieval times of or for keys that are the same as the database row offsets within the storage system.
Ordered
Ordered storage typically stores the records in order and may have to rearrange or increase the file size when a new record is inserted, resulting in lower insertion efficiency. However, ordered storage provides more efficient retrieval as the records are pre-sorted, resulting in a complexity of .
Structured files
Heap files
Heap files are lists of unordered records of variable size. Although sharing a similar name, heap files are widely different from in-memory heaps. In-memory heaps are ordered, as opposed to heap files.
Simplest and most basic method
insert efficient, with new records added at the end of the file, providing chronological order
retrieval efficient when the handle to the memory is the address of the memory
search inefficient, as searching has to be linear
deletion is accomplished by marking selected records as "deleted"
requires periodic reorganization if file is very volatile (changed frequently)
Advantages
efficient for bulk loading data
efficient for relatively small relations as indexing overheads are avoided
efficient when retrievals involve large proportion of stored records
Disadvantages
not efficient for selective retrieval using key values, especially if large
sorting may be time-consuming
not suitable for volatile tables
Hash buckets
Hash functions calculate the address of the page in which the record is to be stored based on one or more fields in the record
hashing functions chosen to ensure that addresses are spread evenly across the address space
‘occupancy’ is generally 40% to 60% of the total file size
unique address not guaranteed so collision detection and collision resolution mechanisms are required
Open addressing
Chained/unchained overflow
Pros and cons
efficient for exact matches on key field
not suitable for range retrieval, which requires sequential storage
calculates where the record is stored based on fields in the record
hash functions ensure even spread of data
collisions are possible, so collision detection and restoration is required
B+ trees
These are the most commonly used in practice.
Time taken to access any record is the same because the same number of nodes is searched
Index |
https://en.wikipedia.org/wiki/WANK%20%28computer%20worm%29 | The WANK Worm and the OILZ Worm were computer worms that attacked DEC VMS computers in 1989 over the DECnet. They were written in DIGITAL Command Language.
Origin
The worm is believed to have been created by Melbourne-based hackers, the first to be created by an Australian or Australians. The Australian Federal Police thought the worm was created by two hackers who used the names Electron and Phoenix. Julian Assange may have been involved, but this has never been proven.
Approximately two weeks later a modified version of the worm called OILZ attacked other systems. The original version of the worm, WANK (Worms Against Nuclear Killers), contained bugs preventing, among other things. In OILZ, some of the problems of the first worm were corrected, allowing penetration of unpassworded accounts and altering passwords. The code indicated that the worms evolved over time and was not written by a single person.
Political message
The WANK worm had a distinct political message attached; it was the first major worm to have a political message. WANK in this context stands for Worms Against Nuclear Killers. The following message appeared on an infected computer's screen:
The worm coincidentally appeared on a DECnet network operated by NASA days before the launch of a NASA Space Shuttle carrying the Galileo spacecraft. At the time, there were protests by anti-nuclear groups regarding the use of the plutonium-based power modules in Galileo. The protesters contended that if this shuttle blew up as Challenger did three years earlier in 1986, the plutonium spilled would cause widespread death to residents of Florida.
The worm propagated through the network pseudo-randomly from one system to the other by using an algorithm which converted the victim machine's system time into a candidate target node address (composed of a DECnet Area and Node number) and subsequently attempted to exploit weakly secured accounts such as SYSTEM and DECNET that had password identical to the usernames. The worm did not attack computers within DECnet area 48, which was New Zealand. A comment inside the worm source code at the point of this branch logic indicated that New Zealand was a nuclear-free zone. New Zealand had recently forbidden U.S. nuclear-powered vessels from docking at its harbours, thus further fueling the speculation inside NASA that the worm attack was related to the anti-nuclear protest. The line "You talk of times of peace for all, and then prepare for war" is drawn from the lyrics of the Midnight Oil song "Blossom and Blood". Midnight Oil are an Australian rock band known for their political activism and opposition to both nuclear power and nuclear weapons. The process name of the second version of the worm to be detected was "oilz", an Australian shorthand term for the band.
Playful nature
DECnet networks affected included those operated by the NASA Space Physics Analysis Network (SPAN), the US Department of Energy's High Energy Physics Network (HEPnet), CER |
https://en.wikipedia.org/wiki/Raster%20burn | Raster burn may refer to:
Phosphor burn-in, a permanent disfigurement of a TV or computer monitor
Computer vision syndrome, eyestrain caused by excessive computer usage |
https://en.wikipedia.org/wiki/R%C3%B6%20runestone | The Rö runestone, designated under Rundata as Bo KJ73 U, is one of Sweden's oldest and most notable runestones.
Description
The Rö runestone was discovered in 1919 at the farm Rö on the island of Otterö, north of the fishing village Grebbestad in Bohuslän. At that time, it was erected near the location where it was found, but currently resides in the Swedish History Museum in Stockholm.
The stone is made of granite and it is 2 metres tall and more than 1.2 metres wide. The inscription was made on a flat surface, unfortunately damaged due to flaking, and runs in four parallel rows from top to bottom. Using the elder futhark, the runes are composed in Proto-Norse exhibiting preserved declensions and intermediate vowels that would ultimately be lost when the language transitioned into Old Norse. The form of the runes suggests that the inscription dates from the early 5th century and is consequently the longest inscription from a period earlier than the 7th century.
Because the location where this runestone stood is adjacent to an ancient sailing route, it is possible that the inscription was made by visitors and not by locals.
The name Stainawarijaz in the text means "Stone Guard" or "Keeper of Stones." In addition, the word fahido, often translated as "carved" or "inscribed," actually means "painted." Many runestones had their inscriptions painted, although there is no direct evidence that the Rö runestone was painted other than the use of this word.
Inscription
Transcription of the runes
ek hra(z)az/hra(þ)az satido -tain ¶ ana----(r) ¶ swabaharjaz ¶ s-irawidaz ¶ ... stainawarijaz fahido
Transliteration
Ek Hrazaz/Hraþaz satido [s]tain[a] ... Swabaharjaz s[a]irawidaz. ... Stainawarijaz fahido.
Translation
I, Hrazaz/Hraþaz raised the stone ... Suebian warrior with wide wounds. ... Stainawarijaz carved.
See also
List of runestones
Hogganvik runestone
References
Sources
External links
Photograph of Rö runestone
5th-century inscriptions
Runestones in Bohuslän
Proto-Norse language
Elder Futhark inscriptions |
https://en.wikipedia.org/wiki/Information%20Tribunal | The Information Tribunal was a tribunal non-departmental public body in the United Kingdom. It was established as the Data Protection Tribunal to hear appeals under the Data Protection Act 1984. Its name was changed to reflect its wider responsibilities under other freedom of information legislation, as it then heard appeals from notices issued by Information Commissioner under two Acts of Parliament, the Data Protection Act 1998 and the Freedom of Information Act 2000, and two related Statutory Instruments, the Privacy and Electronic Communications Regulations 2003 and the Environmental Information Regulations 2004.
In 2010 the tribunal became part of the General Regulatory Chamber of the First-tier Tribunal, referred to as the First-tier Tribunal (Information Rights), as part of the reform of the structure of the UK system of tribunals.
The last Chairman of the tribunal was lawyer John Angel, formerly of Clifford Chance, and now a consultant with Jomati and a Visiting Professorial Fellow at Queen Mary, University of London. There were nine Deputy Chairmen, all of whom were experienced solicitors or barristers.
External links
Website
Former courts and tribunals in the United Kingdom
Defunct non-departmental public bodies of the United Kingdom government
Ministry of Justice (United Kingdom)
Freedom of information in the United Kingdom
1984 establishments in the United Kingdom
2010 disestablishments in the United Kingdom
Courts and tribunals established in 1984
Courts and tribunals disestablished in 2010 |
https://en.wikipedia.org/wiki/WCF%20Data%20Services | WCF Data Services (formerly ADO.NET Data Services, codename "Astoria") is a platform for what Microsoft calls Data Services. It is actually a combination of the runtime and a web service through which the services are exposed. It also includes the Data Services Toolkit which lets Astoria Data Services be created from within ASP.NET itself. The Astoria project was announced at MIX 2007, and the first developer preview was made available on April 30, 2007. The first CTP was made available as a part of the ASP.NET 3.5 Extensions Preview. The final version was released as part of Service Pack 1 of the .NET Framework 3.5 on August 11, 2008. The name change from ADO.NET Data Services to WCF data Services was announced at the 2009 PDC.
Overview
WCF Data Services exposes data, represented as Entity Data Model (EDM) objects, via web services accessed over HTTP. The data can be addressed using a REST-like URI. The data service, when accessed via the HTTP GET method with such a URI, will return the data. The web service can be configured to return the data in either plain XML, JSON or RDF+XML. In the initial release, formats like RSS and ATOM are not supported, though they may be in the future. In addition, using other HTTP methods like PUT, POST or DELETE, the data can be updated as well. POST can be used to create new entities, PUT for updating an entity, and DELETE for deleting an entity.
Description
Windows Communication Foundation (WCF) comes to the rescue when we find ourselves not able to achieve what we want to achieve using web services, i.e., other protocols support and even duplex communication. With WCF, we can define our service once and then configure it in such a way that it can be used via HTTP, TCP, IPC, and even Message Queues. We can consume Web Services using server side scripts (ASP.NET), JavaScript Object Notations (JSON), and even REST (Representational State Transfer).
Understanding the basics
When we say that a WCF service can be used to communicate using different protocols and from different kinds of applications, we will need to understand how we can achieve this. If we want to use a WCF service from an application, then we have three major questions:
1.Where is the WCF service located from a client's perspective?
2.How can a client access the service, i.e., protocols and message formats?
3.What is the functionality that a service is providing to the clients?
Once we have the answer to these three questions, then creating and consuming the WCF service will be a lot easier for us. The WCF service has the concept of endpoints. A WCF service provides endpoints which client applications can use to communicate with the WCF service. The answer to these above questions is what is known as the ABC of WCF services and in fact are the main components of a WCF service. So let's tackle each question one by one.
Address: Like a webservice, a WCF service also provides a URI which can be used by clients to get to the WCF service. This U |
https://en.wikipedia.org/wiki/Radio%20Sputnik%20%28Finland%29 | Radio Sputnik was a Finnish radio station with programming in the Russian language. The station ceased broadcasting in 2018.
References
External links
Radio stations in Finland
Radio stations established in 1999
Radio stations disestablished in 2018
Defunct radio stations
Defunct mass media in Finland |
https://en.wikipedia.org/wiki/World%20Sports%20Competition | World Sports Competition is a sports video game developed by Make software for the PC-Engine in 1992 and released on the TurboGrafx-16 in 1993. It has also been released on the PlayStation Network in Japan and North America and on the Virtual Console in Europe and North America. The game has a Summer Olympics theme and features several events, including archery, rowing, shooting, swimming, and track and field.
The game is known in Japan as Power Sports which was part of the Power Sports Series, a series of sports games released between 1988 and 1998.
See also
Summer Games
References
External links
World Sports Competition review by Virtual Console Reviews
1992 video games
Hudson Soft games
Video games developed in Japan
Virtual Console games
Virtual Console games for Wii U
Multiple-sport video games
TurboGrafx-16 games
PlayStation Network games
Make Software games |
https://en.wikipedia.org/wiki/Dynamic%20Language%20Runtime | The Dynamic Language Runtime (DLR) from Microsoft runs on top of the Common Language Runtime (CLR) and provides computer language services for dynamic languages. These services include:
A dynamic type system, to be shared by all languages using the DLR services
Dynamic method dispatch
Dynamic code generation
Hosting API
The DLR is used to implement dynamic languages on the .NET Framework, including the IronPython and IronRuby projects.
Because the dynamic language implementations share a common underlying system, it should be easier for them to interact with one another. For example, it should be possible to use libraries from any dynamic language in any other dynamic language. In addition, the hosting API allows interoperability with statically typed CLI languages like C# and Visual Basic .NET.
History
Microsoft's Dynamic Language Runtime project was announced by Microsoft at MIX 2007.
Microsoft shipped .NET DLR 0.9 beta in November 2008, and final 0.9 in December 2008. Version 1.0 shipped in April 2010. In July 2010, Microsoft changed the license of the DLR from the Microsoft Public License to the Apache License 2.0. With the release of .NET 4, also in April 2010, DLR was incorporated into the .NET Framework itself.
The open source DLR project hosted on GitHub has a few additional features for language implementers. After the July 2010 release, there was little activity on the project for some years. This was interpreted by a Microsoft developer who worked on IronRuby as a lack of commitment from Microsoft to dynamic languages on the .NET Framework. However, there has been regular activity since 2016/17, leading to a number of improvements and upgrades.
Language implementations
In 2007, Microsoft initially planned to use the DLR for the upcoming Visual Basic 2010 (VB 10.0) and Managed JScript (ECMAScript 3.0) as well as Python and Ruby.
The DLR work on Ruby and Python resulted in IronRuby, a .NET implementation of the Ruby language, and IronPython.
By August 2009, Microsoft had announced it had no more plans to implement Managed JScript on the DLR. Fredrik Holmström later independently contributed a JavaScript implementation for the DLR which he dubbed "IronJS" in the naming tradition of IronPython and IronRuby.
Like C#, Visual Basic can access objects from dynamic languages built on the DLR such as IronPython and IronRuby.
PowerShell 3.0, released in Windows 8, was updated to use the DLR.
IronScheme, a Scheme implementation, was planning to build upon the DLR. This idea was abandoned because the DLR branch used by the project became out of sync with the trunk, and also because (according to the project coordinator) the current version of the DLR at that time could not support the majority of Scheme's requirements.
Architecture
The Dynamic Language Runtime is built on the idea that it is possible to implement language specificities on top of a generic language-agnostic abstract syntax tree, whose nodes correspond to a spec |
https://en.wikipedia.org/wiki/WMXF | WMXF (1400 AM), known as "ESPN Asheville", is a sports radio station licensed to Waynesville, North Carolina which mostly airs the programming of WPEK in Asheville.
History
WHCC was the only radio station in Waynesville for many years. It went on the air with a formal opening September 10, 1947, operating on 1400 kHz with 250 watts of power. The station was licensed to Smoky Mountain Broadcasters, of which W. Curtiss Russ was president.
In the 1980s the format was adult contemporary. Later formats included oldies and Country.
In 1990, WQNS/WHCC owner KAT Communications of Myrtle Beach, South Carolina filed for Chapter 11, but the stations were doing well and no changes were planned.
The switch to the current call letters was made around 1998 or 1999, and the station began playing adult standards soon after that. By this time Blue Dolphin Communications owned the station.
WMXF, WQNQ and WQNS were purchased by Clear Channel Communications now iHeartMedia, Inc. in 2001.
The switch to talk was made in 2008, except for the morning show, which kept standards as part of the programming for a time.
On June 11, 2018, WMXF changed their format from a simulcast of news/talk-formatted WWNC 570 AM Asheville to a simulcast of ESPN sports-formatted WPEK 880 AM Fairview.
Current programming
WMXF simulcasts WPEK from Fairview. The station also features local sports programming such as Tuscola High School football games.
Previous logo
References
External links
MXF
Sports radio stations in the United States
IHeartMedia radio stations
1947 establishments in North Carolina
Radio stations established in 1947 |
https://en.wikipedia.org/wiki/Ah%20Diddums | Ah Diddums is a computer game released by Imagine Software for the ZX Spectrum in 1983 and can be run on the 16KB/48KB versions of the machine and the Commodore 64 in 1984.
Gameplay
The player controls a teddy bear who is trying to escape a toy box in order to comfort his crying baby owner. Teddy's job is to arrange building blocks in a certain order in the shelf at the top of the screen, allowing him to escape the toy box. On escaping one box Teddy finds himself in another toy box, escape from which is more difficult; there are 99 toy boxes in total from which to escape.
Reception
Ah Diddums won "Best Original Game" at the Computer and Video Games 1983 Golden Joystick Awards.
References
1983 video games
Action games
Commodore 64 games
Fictional teddy bears
Golden Joystick Award winners
Imagine Software games
Sentient toys in fiction
Single-player video games
Video games about bears
Video games about toys
Video games developed in the United Kingdom
ZX Spectrum games |
https://en.wikipedia.org/wiki/Methods%20of%20neuro-linguistic%20programming | The methods of neuro-linguistic programming are the specific techniques used to perform and teach neuro-linguistic programming, which teaches that people are only able to directly perceive a small part of the world using their conscious awareness, and that this view of the world is filtered by experience, beliefs, values, assumptions, and biological sensory systems. NLP argues that people act and feel based on their perception of the world and how they feel about that world they subjectively experience.
NLP claims that language and behaviors (whether functional or dysfunctional) are highly structured, and that this structure can be 'modeled' or copied into a reproducible form. Using NLP a person can 'model' the more successful parts of their own behavior in order to reproduce it in areas where they are less successful or 'model' another person to effect belief and behavior changes to improve functioning. If someone excels in some activity, it can be learned how specifically they do it by observing certain important details of their behavior. NLP embodies several techniques, including hypnotic techniques, which proponents claim can affect changes in the way people think, learn and communicate.
Internal 'maps' of the world
NLP claims that our mind-body (neuro) and what we say (language) all interact together to form our perceptions of the world, or maps (programming) and that said map of the world determines feelings and behavior.
As an approach to personal development or therapy it claims that people create their own internal 'map' or world, recognizing unhelpful or destructive patterns of thinking based on impoverished maps of the world, then modifying or replacing these patterns with more useful or helpful ones. There is also an emphasis on ways to change internal representations or maps of the world with the intent of increasing behavioral flexibility.
Modeling
"Modeling" in NLP is the process of adopting the behaviors, language, strategies and beliefs of another person or exemplar in order to 'build a model of what they do.
The original models were: Milton Erickson (hypnotherapy), Virginia Satir (family therapy), and Fritz Perls (gestalt therapy). NLP modeling methods are designed to unconsciously assimilate the tacit knowledge to learn what the master is doing of which the master is not aware. As an approach to learning it can involve modeling exceptional people. As Bandler and Grinder state "the function of NLP modeling is to arrive at descriptions which are useful." Einspruch & Forman 1985 state that "when modeling another person the modeler suspends his or her own beliefs and adopts the structure of the physiology, language, strategies, and beliefs of the person being modeled. After the modeler is capable of behaviorally reproducing the patterns (of behavior, communication, and behavioral outcomes) of the one being modeled, a process occurs in which the modeler modifies and readopts his or her own belief system while also integrating |
https://en.wikipedia.org/wiki/Punch%20down%20tool | A punch down tool, punchdown tool, IDC tool, or a Krone tool (named after the Krone LSA-PLUS connector), is a small hand tool used by telecommunication and network technicians. It is used for inserting wire into insulation-displacement connectors on punch down blocks, patch panels, keystone modules, and surface mount boxes (also known as biscuit jacks).
Description and use
Most punch down tools are of the impact type, consisting of a handle, an internal spring mechanism, and a removable slotted blade. To use the punch down tool, a wire is pre-positioned into a slotted post on a punch block, and then the punch down tool is pressed down on top of the wire, over the post. Once the required pressure is reached, an internal spring is triggered, and the blade pushes the wire into the slot, simultaneously cutting the insulation and securing the wire. The tool blade does not cut through the wire insulation to make contact, but rather the sharp edges of the slot in the contact post itself slice through the insulation.
However, the punch down tool blade also is usually used to cut off excess wire, in the same operation as making the connection; this is done with a sharp edge of the punch down tool blade trapping the wire to be cut against the plastic punch block. If this cutoff feature is heavily used, the tool blade must be resharpened or replaced from time to time. Tool blades without the sharp edge are also available; these are used for continuing a wire through a slotted post to make connections with another slotted post ("daisy-chained" wiring).
For light-duty use, there are also less-expensive punch down tools with fixed blades and no impact mechanism. These low-cost tools are more time-consuming for making reliable connections, and can cause muscle fatigue when used for large numbers of connections.
To accommodate different connector types, 66, 110, BIX and krone blocks require different blades. Removable blades for 66 or 110 are almost always double-ended. Some blades have one end that only inserts the wire for daisy-chain wiring from post to post, and another end that inserts wire and trims the excess length for termination at a post. Other blades have a cutting 66 blade on one end and a cutting 110 blade on the other. Krone blades require a separate scissor-like mechanism for trimming the wire.
References
Telephone connectors |
https://en.wikipedia.org/wiki/Lutetium%28III%29%20oxide%20%28data%20page%29 | This page provides supplementary chemical data on Lutetium(III) oxide
Thermodynamic properties
Spectral data
Structure and properties data
Material Safety Data Sheet
The handling of this chemical may incur notable safety precautions. It is highly recommend that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source such as SIRI, and follow its directions.
References
A.F. Trotman-Dickenson, (ed.) in Comprehensive Inorganic Chemistry, Pergamon, Oxford, UK, 1973.
Chemical data pages
Chemical data pages cleanup |
https://en.wikipedia.org/wiki/Select%20%28Unix%29 | is a system call and application programming interface (API) in Unix-like and POSIX-compliant operating systems for examining the status of file descriptors of open input/output channels. The select system call is similar to the facility introduced in UNIX System V and later operating systems. However, with the c10k problem, both select and poll have been superseded by the likes of kqueue, epoll, /dev/poll and I/O completion ports.
One common use of select outside of its stated use of waiting on filehandles is to implement a portable sub-second sleep. This can be achieved by passing NULL for all three fd_set arguments, and the duration of the desired sleep as the timeout argument.
In the C programming language, the select system call is declared in the header file sys/select.h or unistd.h, and has the following syntax:
int select(int nfds, fd_set *readfds, fd_set *writefds, fd_set *errorfds, struct timeval *timeout);
fd_set type arguments may be manipulated with four utility macros: , and .
Select returns the total number of bits set in and , or zero if the timeout expired, and -1 on error.
The sets of file descriptor used in select are finite in size, depending on the operating system. The newer system call provides a more flexible solution.
Example
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
#include <sys/select.h>
#include <fcntl.h>
#include <unistd.h>
#include <err.h>
#include <errno.h>
#define PORT "9421"
/* function prototypes */
void die(const char*);
int main(int argc, char **argv)
{
int sockfd, new, maxfd, on = 1, nready, i;
struct addrinfo *res0, *res, hints;
char buffer[BUFSIZ];
fd_set master, readfds;
int error;
ssize_t nbytes;
(void)memset(&hints, '\0', sizeof(struct addrinfo));
hints.ai_family = AF_INET;
hints.ai_socktype = SOCK_STREAM;
hints.ai_protocol = IPPROTO_TCP;
hints.ai_flags = AI_PASSIVE;
if (0 != (error = getaddrinfo(NULL, PORT, &hints, &res0)))
errx(EXIT_FAILURE, "%s", gai_strerror(error));
for (res = res0; res; res = res->ai_next)
{
if (-1 == (sockfd = socket(res->ai_family, res->ai_socktype, res->ai_protocol)))
{
perror("socket()");
continue;
}
if (-1 == (setsockopt(sockfd, SOL_SOCKET, SO_REUSEADDR, (char*)&on, sizeof(int))))
{
perror("setsockopt()");
continue;
}
if (-1 == (bind(sockfd, res->ai_addr, res->ai_addrlen)))
{
perror("bind()");
continue;
}
break;
}
if (-1 == sockfd)
exit(EXIT_FAILURE);
freeaddrinfo(res0);
if (-1 == (listen(sockfd, 32)))
die("listen()");
if (-1 == (fcntl(sockfd, F_SETFD, O_NONBLOCK)))
die("fcntl()");
FD_ZERO(&master);
FD_ZERO(&readfds);
FD_SET(sockfd, &master);
maxfd = sockfd;
|
https://en.wikipedia.org/wiki/Bun%20%28disambiguation%29 | A bun is a type of small sweet cake or bread roll.
BUN or Bun may also refer to:
Acronyms
Blood urea nitrogen
BUN test
BUN-to-creatinine ratio
Computer
Bun (software)
Places
Bún or Boiu village, Albești, Mureș, Romania
Bun, Hautes-Pyrénées, a commune of France
Bun Island, Qikiqtaaluk Region, Nunavut, Canada
Language
Bun language, Yuat language of Papua New Guinea
Bun language (Vanuatu) or Mwotlap language, an Oceanic language
Sherbro language of Sierra Leone, ISO 639 code
Human body
Bun (hairstyle)
Occipital bun, a bulge at the back of the skull
Buns, a slang term for the buttocks
People
Alexandru cel Bun, prince of Moldavia 1400-1432
Bun E. Carlos (born 1951), American drummer
Bun Cook (1904–1988), Canadian ice hockey player
Bun B (born 1973), American rapper
Bun Bun (Yasuaki Fujita), Japanese composer
Bun Kenny (born 1990), Cambodian–French retired tennis player
Bun Lai, Asian American chef
Bun LaPrairie (1911–1986), ice hockey player
Bun Rany (born 1953), wife of Cambodian Prime Minister
Bun Troy (1888–1918), baseball player
Chou Bun Eng (born 1956), Cambodian politician
Kuoy Bun Reun (born 1967), Cambodian politician
Lam Bun (1930–1967), assassinated Hong Kong radio commentator
Mam Bun Neang, Cambodian politician
Nhek Bun Chhay, Cambodian politician
Poa Bun Sreu, Cambodian politician
Note: Cambodian names put the surname first, so "Bun" is the first given name for the five Cambodians above.
Fictional characters
Bun-bun, in Sluggy Freelance webcomic
Bun (or Tuff), in the anime Kirby: Right Back At Ya!
Cinnamon Bun, a character in the animated series Adventure Time
Other
Bún, rice vermicelli in Vietnamese
Bun Bars, a chocolate candy bar
Bun, short for bunny, slang for rabbit.
See also
Bunn (surname)
Bunne, Dutch town |
https://en.wikipedia.org/wiki/Fat%20Guy%20Stuck%20in%20Internet | Fat Guy Stuck in Internet is an American science-fiction comedy television series created by John Gemberling and Curtis Gwinn for Cartoon Network's late-night adult-oriented programming block Adult Swim; and ended with a total of ten episodes.
An adaptation/remake of Gemberling and Gwinn's 2005 Channel 102 web series Gemberling, Fat Guy Stuck in Internet follows computer programmer Ken Gemberling – the titular "Fat Guy" – who is accidentally sucked into his computer and learns he is destined to save cyberspace from a variety of evils. After a pilot aired in May 2007, Adult Swim commissioned a full season of Fat Guy Stuck in Internet which lasted ten episodes, airing from June 2008 to August 2008. Following the run of its first season, the channel chose not to renew the show for a second, effectively cancelling the series.
Setting and premise
Hotshot computer programmer Ken Gemberling is the top programmer at Ynapmoclive Interactive, but is also remarkably rude, selfish, and arrogant. After dumping beer on his computer keyboard, Gemberling is inexplicably sucked into his computer, landing in the farthest reaches of the internet where he soon discovers that he is in fact "The Chosen One", prophesied to save cyberspace from a devastating virus known as the nanoplague. Joined by a pair of humanoid "programs" named Bit and Byte, Gemberling embarks on an epic adventure to save the internet, return home and unleash the hero within, all the while hunted through cyberspace by ruthless white trash bounty hunter Chains.
Production
Fat Guy Stuck in Internet first appeared as a 2005 web series created by Upright Citizens Brigade alumni John Gemberling and Curtis Gwinn, known as the comedy duo of The Cowboy & John. Originally titled Gemberling, the series followed the same storyline and major plot points of its television adaptation, featuring much of the same cast (with the notable exception of Katie Dippold in the role of Byte) though with a considerably lower budget and more profanity. Aired in five-minute episodes as part of Channel 102, Gemberling became Channel 102's longest-running original series, lasting a total of eight episodes including a 17-minute finale. The shorts also aired as part of Fuse TVs Munchies.
In January 2007, Cartoon Network announced that they had commissioned Gemberling and Gwinn to create a series based on Gemberling as part of the Adult Swim programming block. Adult Swim made the decision to rename the series as Fat Guy Stuck in Internet, a title which both creators disliked. The entirety of the series was filmed and produced inside of a warehouse in Bushwick, Brooklyn. On May 30, 2008, Gemberling and Gwinn premiered Fat Guy Stuck in Internet before a live audience at the Upright Citizens Brigade theatre in New York City.
Fat Guy Stuck in Internet uses a mix of greenscreen effects, hard sets, miniatures, matte paintings and computer animation to create the show's cyberspace environment, though carries over many of the intent |
https://en.wikipedia.org/wiki/CSI-DOS | CSI-DOS is an operating system, created in Samara, for the Soviet Elektronika BK-0011M and Elektronika BK-0011 microcomputers. CSI-DOS did not support the earlier BK-0010. CSI-DOS used its own unique file system and only supported a color graphics video mode. The system supported both hard and floppy drives as well as RAM disks in the computer's memory. It also included software to work with the AY-3-8910 and AY-3-8912 music co-processors, and the Covox Speech Thing. There are a number of games and demos designed specially for the system.
The system also included a Turbo Vision-like application programming interface (API) allowing simpler design of user applications, and a graphical file manager called X-Shell.
External links
Article, contains description of some advantages of CSI-DOS for gaming over other OSs (Russian)
Elektronika BK operating systems |
https://en.wikipedia.org/wiki/I/O%20request%20packet | I/O request packets (IRPs) are kernel mode structures that are used by Windows Driver Model (WDM) and Windows NT device drivers to communicate with each other and with the operating system. They are data structures that describe I/O requests, and can be equally well thought of as "I/O request descriptors" or similar. Rather than passing a large number of small arguments (such as buffer address, buffer size, I/O function type, etc.) to a driver, all of these parameters are passed via a single pointer to this persistent data structure. The IRP with all of its parameters can be put on a queue if the I/O request cannot be performed immediately. I/O completion is reported back to the I/O manager by passing its address to a routine for that purpose, IoCompleteRequest. The IRP may be repurposed as a special kernel APC object if such is required to report completion of the I/O to the requesting thread.
IRPs are typically created by the I/O Manager in response to I/O requests from user mode. However, IRPs are sometimes created by the plug-and-play manager, power manager, and other system components, and can also be created by drivers and then passed to other drivers.
The I/O request packet mechanism is also used by Digital Equipment Corporation's VMS operating system, and was used by Digital's RSX-11 family of operating systems before that. An I/O request packet in RSX-11 is called a directive parameter block, as it is also used for system calls other than I/O calls.
See also
Architecture of Windows NT
References
External links
Whitepaper on Windows I/O model
IRP (Windows Drivers)
Windows NT architecture
Device drivers
Data structures by computing platform
Windows NT kernel
OpenVMS
de:IRP |
https://en.wikipedia.org/wiki/Triangular%20routing | Triangular routing is a method for transmitting packets of data in communications networks. It uses a form of routing that sends a packet to a proxy system before transmission to the intended destination. Triangular routing is a problem in mobile IP; however, it finds applications in other networking situations, for instance to avoid problems associated with network address translation (NAT), implemented for example by Skype.
2) Datagram is intercepted 3) Datagram is
by home agent and detunneled and
is tunneled to the delivered to the
care-of address. mobile node.
+-----+ +-------+ +------+
|home | =======> |foreign| ------> |mobile|
|agent| | agent | <------ | node |
+-----+ +-------+ +------+
1) Datagram to /|\ /
mobile node | / 4) For datagrams sent by the
arrives on | / mobile node, standard IP
home network | / routing delivers each to its
via standard | |_ destination. In this figure,
IP routing. +----+ the foreign agent is the
|host| mobile node's default router.
+----+
Figure 1: Operation of Mobile IPv4
Description
Notations Used
CH - Correspondent Host
MH - Mobile Host
HA - Home Agent
FA - Foreign Agent
Triangular Routing Problem
The problem in communication between a fixed host and a mobile host, such as a home computer and a smartphone, is that while the mobile host knows the fixed host's address, the fixed host does not know the mobile host's current address. Therefore, different routing must be used for the different directions.
In mobile IP, packets that are sent to a mobile host by the correspondent host are first routed to the mobile host's home agent and then forwarded to the mobile host at its current location by its home agent. However, packets that are sent from the mobile host should not be handled in this way.
Solution
For mobile IP, routing optimization is necessary because all packets sent to the mobile host (MH) shall pass through the home agent (HA) but the route may not be the best. After receiving the packets sent by the correspondent host (CH) to the MH, the HA notifies the CH of the binding information about the MH, i.e., the current foreign agent (FA) address of the MH, and the CH encapsulates the packets and establishes the tunnel to the FA for transparent transmission. The binding information is transferred via a definite port number. If the MH moves again, the new FA will transfer the updated binding information to the old FA to ensure that the packets are transferred to the new FA. And meanwhile, the HA gets the updated binding information so the subsequent packets will be transferred di |
https://en.wikipedia.org/wiki/Father%20Christmas%20%28computer%20worm%29 | The Father Christmas worm, also known as the HI.COM VMS worm, was a computer worm that used the DECnet to attack VAX/VMS systems. It was released in December 1988. The aim of this worm was to send a Christmas greeting from "Father Christmas" from the affected system.
History
At around 17:00 EST on December 22, 1988, a worm was detected on the Space Physics Analysis Network (SPAN). This was a NASA network on the DECnet Internet with many connections to other networks such as HEPnet. The majority of the computers on SPAN were VAX computers running the VAX/VMS operating system. The worm originated from a computer on the DECnet in Switzerland by a person using the multi-user login name PHSOLIDE. The infection was thought to have spread to more than 6,000 computer nodes.
On December 23, an email went out to warn SPAN centre managers that a worm had been released onto SPAN. The purpose of the worm was to create a file entitled "Hi.com" prior to December 24. At half past midnight on that day, it was designed to send out a message from Father Christmas to all users on the local rights database for each network. It exclusively targeted VAX/VMS systems, but it did not perform any other actions than sending that message. One recommended strategy to prevent infection at the time was to create an empty "Hi.com" file which would stop the worm from being able to create a new version of the same file. It was subsequently estimated that only 2% of infected devices launched the worm.
The Father Christmas worm had the effect of strengthening security measures on SPAN and the DECnet Internet. This was demonstrated on January 13, 1989, when a nearly identical worm was released into the Easynet intranet. The network manager was able to quickly prevent the spread of the worm because of the exposure of the Father Christmas worm from the previous month.
See also
WANK worm
Notes
References
External links
"official 'Father Christmas' Worm Report"
Computer worms
Hacking in the 1980s |
https://en.wikipedia.org/wiki/Logging%20%28computing%29 | In computing, logging is the act of keeping a log of events that occur in a computer system, such as problems, errors or just information on current operations. These events may occur in the operating system or in other software. A message or log entry is recorded for each such event. These log messages can then be used to monitor and understand the operation of the system, to debug problems, or during an audit. Logging is particularly important in multi-user software, to have a central overview of the operation of the system.
In the simplest case, messages are written to a file, called a log file. Alternatively, the messages may be written to a dedicated logging system or to a log management software, where it is stored in a database or on a different computer system.
Specifically, a transaction log is a log of the communications between a system and the users of that system, or a data collection method that automatically captures the type, content, or time of transactions made by a person from a terminal with that system. For Web searching, a transaction log is an electronic record of interactions that have occurred during a searching episode between a Web search engine and users searching for information on that Web search engine.
Many operating systems, software frameworks and programs include a logging system. A widely used logging standard is Syslog, defined in Internet Engineering Task Force (IETF) RFC 5424). The Syslog standard enables a dedicated, standardized subsystem to generate, filter, record, and analyze log messages. This relieves software developers of having to design and code their ad hoc logging systems.
Event logs
Event logs record events taking place in the execution of a system in order to provide an audit trail that can be used to understand the activity of the system and to diagnose problems. They are essential to understand the activities of complex systems, particularly in the case of applications with little user interaction (such as server applications).
It can also be useful to combine log file entries from multiple sources. This approach, in combination with statistical analysis, may yield correlations between seemingly unrelated events on different servers. Other solutions employ network-wide querying and reporting.
Transaction logs
Most database systems maintain some kind of transaction log, which are not mainly intended as an audit trail for later analysis, and are not intended to be human-readable. These logs record changes to the stored data to allow the database to recover from crashes or other data errors and maintain the stored data in a consistent state. Thus, database systems usually have both general event logs and transaction logs.
Transaction log analysis
The use of data stored in transaction logs of Web search engines, Intranets, and Web sites can provide valuable insight into understanding the information-searching process of online searchers. This understanding can enlighten information |
https://en.wikipedia.org/wiki/Mean%20shift | Mean shift is a non-parametric feature-space mathematical analysis technique for locating the maxima of a density function, a so-called mode-seeking algorithm. Application domains include cluster analysis in computer vision and image processing.
History
The mean shift procedure is usually credited to work by Fukunaga and Hostetler in 1975. It is, however, reminiscent of earlier work by Schnell in 1964.
Overview
Mean shift is a procedure for locating the maxima—the modes—of a density function given discrete data sampled from that function. This is an iterative method, and we start with an initial estimate . Let a kernel function be given. This function determines the weight of nearby points for re-estimation of the mean. Typically a Gaussian kernel on the distance to the current estimate is used, . The weighted mean of the density in the window determined by is
where is the neighborhood of , a set of points for which .
The difference is called mean shift in Fukunaga and Hostetler.
The mean-shift algorithm now sets , and repeats the estimation until converges.
Although the mean shift algorithm has been widely used in many applications, a rigid proof for the convergence of the algorithm using a general kernel in a high dimensional space is still not known. Aliyari Ghassabeh showed the convergence of the mean shift algorithm in one dimension with a differentiable, convex, and strictly decreasing profile function. However, the one-dimensional case has limited real world applications. Also, the convergence of the algorithm in higher dimensions with a finite number of the stationary (or isolated) points has been proved. However, sufficient conditions for a general kernel function to have finite stationary (or isolated) points have not been provided.
Gaussian Mean-Shift is an Expectation–maximization algorithm.
Details
Let data be a finite set embedded in the -dimensional Euclidean space, . Let be a flat kernel that is the characteristic function of the -ball in ,
In each iteration of the algorithm, is performed for all simultaneously. The first question, then, is how to estimate the density function given a sparse set of samples. One of the simplest approaches is to just smooth the data, e.g., by convolving it with a fixed kernel of width ,
where are the input samples and is the kernel function (or Parzen window). is the only parameter in the algorithm and is called the bandwidth. This approach is known as kernel density estimation or the Parzen window technique. Once we have computed from the equation above, we can find its local maxima using gradient ascent or some other optimization technique. The problem with this "brute force" approach is that, for higher dimensions, it becomes computationally prohibitive to evaluate over the complete search space. Instead, mean shift uses a variant of what is known in the optimization literature as multiple restart gradient descent. Starting at some guess for a local maximum, , whi |
https://en.wikipedia.org/wiki/Homomorphic%20secret%20sharing | In cryptography, homomorphic secret sharing is a type of secret sharing algorithm in which the secret is encrypted via homomorphic encryption. A homomorphism is a transformation from one algebraic structure into another of the same type so that the structure is preserved. Importantly, this means that for every kind of manipulation of the original data, there is a corresponding manipulation of the transformed data.
Technique
Homomorphic secret sharing is used to transmit a secret to several recipients as follows:
Transform the "secret" using a homomorphism. This often puts the secret into a form which is easy to manipulate or store. In particular, there may be a natural way to 'split' the new form as required by step (2).
Split the transformed secret into several parts, one for each recipient. The secret must be split in such a way that it can only be recovered when all or most of the parts are combined. (See Secret sharing.)
Distribute the parts of the secret to each of the recipients.
Combine each of the recipients' parts to recover the transformed secret, perhaps at a specified time.
Reverse the homomorphism to recover the original secret.
Examples
Suppose a community wants to perform an election, using a decentralized voting protocol, but they want to ensure that the vote-counters won't lie about the results. Using a type of homomorphic secret sharing known as Shamir's secret sharing, each member of the community can add their vote to a form that is split into pieces, each piece is then submitted to a different vote-counter. The pieces are designed so that the vote-counters can't predict how any alterations to each piece will affect the whole, thus, discouraging vote-counters from tampering with their pieces. When all votes have been received, the vote-counters combine them, allowing them to recover the aggregate election results.
In detail, suppose we have an election with:
Two possible outcomes, either yes or no. We'll represent those outcomes numerically by +1 and −1, respectively.
A number of authorities, k, who will count the votes.
A number of voters, n, who will submit votes.
In advance, each authority generates a publicly available numerical key, xk.
Each voter encodes his vote in a polynomial pn according to the following rules: The polynomial should have degree , its constant term should be either +1 or −1 (corresponding to voting "yes" or voting "no"), and its other coefficients should be randomly generated.
Each voter computes the value of his polynomial pn at each authority's public key xk.
This produces k points, one for each authority.
These k points are the "pieces" of the vote: If you know all of the points, you can figure out the polynomial pn (and hence you can figure out how the voter voted). However, if you know only some of the points, you can't figure out the polynomial. (This is because you need n points to determine a degree- polynomial. Two points determine a line, three points determine a parab |
https://en.wikipedia.org/wiki/IronRuby | IronRuby is an implementation of the Ruby programming language targeting Microsoft .NET Framework. It is implemented on top of the Dynamic Language Runtime (DLR), a library running on top of the Common Language Infrastructure that provides dynamic typing and dynamic method dispatch, among other things, for dynamic languages.
The project is currently inactive, with the last release of IronRuby (version 1.1.3) being in March 2011.
History
On April 30, 2007, at MIX 2007, Microsoft announced IronRuby, which uses the same name as Wilco Bauwer's IronRuby project with permission. It was planned to be released to the public at OSCON 2007.
On July 23, 2007, as promised, John Lam and the DLR Design Team presented the pre-Alpha version of the IronRuby compiler at OSCON. He also announced a quick timeline for further integration of IronRuby into the open source community.
On August 31, 2007, John Lam and the DLR Design Team released the code in its pre-alpha stage on RubyForge. The source code has continued to be updated regularly by the core Microsoft team (but not for every check-in). The team also does not accept community contributions for the core Dynamic Language Runtime library, at least for now.
On July 24, 2008, the IronRuby team released the first binary alpha version, in line with OSCON 2008. On November 19, 2008, they released a second Alpha version.
The team actively worked to support Rails on IronRuby. Some Rails functional tests started to run, but a lot of work still needed to be done to be able to run Rails in a production environment.
On May 21, 2009, they released 0.5 version in conjunction with RailsConf 2009. With this version, IronRuby could run some Rails applications, but still not on a production environment.
Version 0.9 was announced as OSCON 2009. This version improved performance. Version 1.0 RC1 became available on November 20, 2009.
Version 1.0 became available on April 12, 2010, in two different versions:
The preferred one, which runs on top of .NET 4.0.
A version with more limited features, which ran on top of .NET 2.0. This version was the only one compatible with Mono.
The IronRuby team planned to support Ruby 1.8.6 only for 1.0 point releases, and 1.9 version only for upcoming 1.x releases, skipping support for Ruby 1.8.7.
In July 2010, Microsoft let go Jimmy Schementi, one of two remaining members of the IronRuby core team, and stopped funding the project. In October 2010 Microsoft announced the Iron projects (IronRuby and IronPython) were being changed to "external" projects and enabling "community members to make contributions without Microsoft's involvement or sponsorship by a Microsoft employee".
The last published release of IronRuby was on March 13, 2011 as version 1.1.3.
Architecture
Mono support
IronRuby may run as well on Mono as it does on Microsoft Common Language Runtime (CLR), but as the IronRuby team only tests it with the CLR on Windows., it may not build on Mono depending on the build.
.NE |
https://en.wikipedia.org/wiki/The%20Ski%20Channel | The Ski Channel is a Video On Demand Cable, Satellite and Telco television channel distributed on Comcast, Time Warner Cable, DirecTV, Verizon FiOS, Brighthouse Networks, Cablevision, RCN, AT&T U-Verse and Cox Communications. The technical term for a channel of this type is VODnet. It features mountain oriented sports, activity and lifestyle content and is devoted to year-round mountain activities such as skiing, snowboarding, hiking, biking, backpacking, climbing and other mountain sports. The channel launched on December 25, 2008. Tennis doubles team Bob and Mike Bryan are investors in the channel. It was founded by Steve Bellamy who also founded Tennis Channel.
Background
About 1997, Bellamy had the idea of cable channel for skiing and started work on the concept. He switch to working on a tennis channel concept given the broader audience for tennis. In 2005, Bellamy and the rest of the Tennis Channel's management was swept out by the owners.
History
In April 2007, Bellamy announced the formation of The Ski Channel television Video on demand channel that would focus on mountain oriented sports, activity and lifestyle. That announcement brought a long term cable distribution deal with Time Warner and advertising deals with: Panasonic, Fender Guitars, Marquis Jets and Mirage Resorts. Panasonic's President, Andy Nelkin stated they were going to use the networks affluent audience to market their new 107 inch hi definition television that cost $70,000. Shortly after a flurry of programming announcements were made with ski film maker Rage Films, episodic television series Ride Guide and a series with legendary action sports photographer Tony Harrington, entitled, "Storm Hunter".
A big announcement was a partnership with Olympic Gold Medalist Jonny Moseley that made Moseley an investor in the channel, a spokesperson and gave Moseley a signature show on the network. The Moseley announcement came at “The Ski Channel Baby Shower” and was attended by ski and snowboard stars: Julia Mancuso, Kirstina Koznick, Lauren Ross and Dash Longe. Alexandra Paul, Donna Mills, Melissa Rivers, Dawnn Lewis, Jaron Lowenstein, Scott Grimes, Kevin Durand, Amy Pietz, Jason Gray Stanford, Sinjin Smith, Pam Shriver and George Lazenby attended as well.
On November 17, 2008, it was reported by Business Week that the channel had added DirecTV and Verizon to its list of distributors, that it was launching on Christmas Day of 2008 and that it had acquired the broadcast rights to classic Warren Miller movies. The channel was launched on December 25, 2008. Cox and Bright House were also on board as launch carriers.
On June 1, 2009, it was announced that The Ski Channel had entered into a long term partnership with AT&T Uverse that would put the channel available as a fee on-demand service. The channel also made its first theatrical licensing deal for the Universal Pictures film, First Descent, featuring Shawn White, facing down Alaska's "extreme slopes".
In July 2010, |
https://en.wikipedia.org/wiki/Bill%20Dally | William James Dally (born August 17, 1960) is an American computer scientist and educator. Since 2021, he has been a member of the President’s Council of Advisors on Science and Technology (PCAST).
Microelectronics
He developed a number of techniques used in modern interconnection networks including routing-based deadlock avoidance, wormhole routing, link-level retry, virtual channels, global adaptive routing, and high-radix routers. He has developed efficient mechanisms for communication, synchronization, and naming in parallel computers including message-driven computing and fast capability-based addressing. He has developed a number of stream processors starting in 1995 including Imagine, for graphics, signal, and image processing, and Merrimac, for scientific computing.
He has published over 200 papers as well as the textbooks Digital Systems Engineering with John Poulton, and Principles and Practices of Interconnection Networks with Brian Towles. He was inventor or co-inventor on over 70 granted patents.
An author quoted him saying: "Locality is efficiency, Efficiency is power, Power is performance, Performance is king".
Career
Bell Labs
Dally has received a Bachelor's degree in electrical engineering from Virginia Tech. While working for Bell Telephone Laboratories he contributed to the design of the Bellmac 32, an early 32-bit microprocessor, and earned an Master's degree in electrical engineering from Stanford University in 1981. He then went to the California Institute of Technology (Caltech) from 1983 to 1986, graduating with a Ph.D. degree in computer science in 1986. At Caltech he designed the MOSSIM simulation engine and an integrated circuit for routing. While at Caltech, he was part of the founding group of Stac Electronics in 1983.
MIT
From 1986 to 1997 he taught at MIT where he and his group built the J–Machine and the M–Machine, parallel machines emphasizing low overhead synchronization and communication. During his MIT times he claims to have collaborated on developing design of Cray T3D and Cray T3E supercomputers. He became the Willard R. and Inez Kerr Bell Professor in the Stanford University School of Engineering and chairman of the computer science department at Stanford. He served as chairman for twelve years before moving on to Nvidia.
Dally's corporate involvements include various collaborations at Cray Research since 1989. He did Internet router work at Avici Systems starting in 1997, was chief technical officer at Velio Communications from 1999 until its 2003 acquisition by LSI Logic, founder and chairman of Stream Processors, Inc until it folded.
Nvidia and IEEE fellow
Dally was elected a Fellow of the Association for Computing Machinery in 2002, and a Fellow of the IEEE, also in 2002. In 2003 he became a consultant for NVIDIA for the first time and helped to develop GeForce 8800 GPUs series. He received the ACM/SIGARCH Maurice Wilkes Award in 2000, the Seymour Cray Computer Science and Engineering Award |
https://en.wikipedia.org/wiki/WAAW | WAAW (94.7 MHz) is a commercial FM radio station licensed to Williston, South Carolina, and serving the Augusta metropolitan area. The station carries a sports format with programming from Fox Sports Radio. It uses the moniker "Fox Sports 94.7" and its slogan is "Augusta's Sports Station". It is owned by Wisdom, Inc., led by Dr. Frank Neely. The radio studios and offices are on Park Avenue SE in Aiken, South Carolina.
WAAW has an effective radiated power (ERP) of 2,550 watts. The transmitter is on Perry Street at Old Barnwell Road in Montmorenci, South Carolina.
History
WAAW signed on the air in late 1995 with a classic R&B format as "94.7 The Boss". It was owned by legendary soul music singer James Brown (a native of the area) under his company Brown Family Broadcasting.
Brown sold the station in 2002 and the format was changed to urban gospel.
On June 8, 2023 due to owner Dr. Frank Neely's retirement, it was announced that it would drop the urban gospel format on July 3, resulting in a format change to sports talk, and become an affiliate of Fox Sports Radio. In addition to the change, it was also announced that an unknown radio company would operate the station though a LMA agreement. The LMA agreement was finally confirmed on June 28, when Gray Radio LLC (a company which is not related to Gray Television, owner of CBS affiliate WRDW-TV, channel 12, and NBC affiliate WAGT-CD, channel 26), announced that it will partner with the station to officially launch "Fox Sports 94.7 FM Augusta". Coinciding with the change, it was announced that WAAW will become the new home for the Masters.
References
External links
Radio stations established in 1996
Sports radio stations in the United States |
https://en.wikipedia.org/wiki/Systems%20simulation | Computers are used to generate numeric models for the purpose of describing or displaying complex interaction among multiple variables within a system. The complexity of the system arises from the stochastic (probabilistic) nature of the events, rules for the interaction of the elements and the difficulty in perceiving the behavior of the systems as a whole with the passing of time.
Systems Simulation in Video Games
One of the most notable video games to incorporate systems simulation is Sim City, which simulates the multiple systems of a functioning city including but not limited to: electricity, water, sewage, public transportation, population growth, social interactions (including, but not limited to jobs, education and emergency response).
See also
Agent-based model
Discrete event simulation
NetLogo
Systems Dynamics
References
External links
A Brief Introduction to Systems Simulation
Resources and Courses in Systems Simulation
Guide to the Winter Simulation Conference Collection 1968-2003, 2013-2014
Stochastic simulation
Systems theory |
https://en.wikipedia.org/wiki/Buy%20Me | Buy Me is a television program that has aired on HGTV in the U.S. since 2005, and on HGTV Canada since 2003, where it is that cable network's most popular show. It is also seen in Belgium and South Africa, either dubbed or with subtitles. It is produced by Whalley-Abbey Media Holdings (WHAM), which is owned by Debbie Travis and her husband, and produced Debbie Travis' Facelift.
It shows the entire process of selling a home, from listing the property, to repairing any problems with it, to open houses, to the negotiations of the selling process. It covers all of the details of the process, including home inspections, and occasionally even mild arguments between the sellers and real estate agents. Occasionally, the home fails to sell within the six-month period allotted, but in most cases (whether it sells or not) a postscript of sorts is given by the narrator or in text, stating how things turned out.
The show is generally taped around WHAM's native Montreal, and receives a Quebec tax credit for film and video production. A few more recent episodes are clearly shot around Vancouver in coastal British Columbia, and some in Calgary, Alberta's largest city. New episodes are being taped in the U.S., in both Raleigh, North Carolina and Denver, Colorado. The show has been renewed for five more 13-episode seasons.
Apparently because the show is seen by both Canadian and American audiences, any obvious indications of the shooting location are eliminated, including the blurring of street signs, and the omission of any place names by the narrator. Prices discussed are not changed or converted however, particularly since the U.S. dollar and Canadian dollar are nearly equal in value ().
A similar series, Bought & Sold, has started airing on HGTV in the U.S.
External links
Buy Me at HGTV Canada
Buy Me at HGTV (U.S.)
Montreal Gazette article
HGTV (Canada) original programming
2003 Canadian television series debuts
2000s Canadian reality television series |
https://en.wikipedia.org/wiki/WAGN%20%28AM%29 | WAGN (1340 AM) is a radio station licensed to Menominee, Michigan broadcasting an oldies and talk format.
Formerly an affiliate of ABC Radio's OldiesRadio network, the web site dx-midAMerica reported in January 2008 that the station had dropped Oldies Radio in favor of local voicetracking with the new moniker "1340 Gold" (1). Prior to affiliating with Oldies Radio, WAGN had programmed Adult Standards as an affiliate of the Westwood One/Dial Global America's Best Music network.
In late December 2008, WAGN began to simulcast its oldies format on its FM sister WHYB 103.7 FM (formerly an adult contemporary-formatted station). WAGN will launch a News/Talk format featuring hosts such as Dave Ramsey, Rush Limbaugh, and Laura Ingraham on January 5, 2009, while the Oldies format will move permanently to 103.7 FM. (1)
References
Michiguide.com - WAGN History
External links
Official Website
AGN (AM)
Oldies radio stations in the United States
Radio stations established in 2008 |
https://en.wikipedia.org/wiki/WKVR%20%28FM%29 | WKVR (88.9 FM) is a radio station broadcasting a contemporary Christian format. Licensed to Flint, Michigan, it is a member of the K-Love radio network.
History
The station signed on in September 1997 as WGRI with an urban gospel format. After Gospel Radio International sold the station to the Educational Media Foundation, WGRI joined K-Love on October 1, 2001, and changed its call letters to WAKL on October 29. The station became WKMF on May 31, 2019, after EMF moved the WAKL call sign to a station it had acquired in the Atlanta market.
The station changed its call sign to WKVR on December 6, 2022.
Translators
References
External links
KVR
Contemporary Christian radio stations in the United States
K-Love radio stations
Radio stations established in 1998
1998 establishments in Michigan
Educational Media Foundation radio stations
KVR |
https://en.wikipedia.org/wiki/Meos | Meo or Meos may refer to:
MenuetOS, or MeOS, an operating system
Microsomal ethanol oxidizing system, an alternate ethanol metabolic pathway
mEos, a variant of the photoactivatable fluorescent protein Eos
Mati Meos (born 1946), Estonian engineer and politician
See also
Meo (disambiguation) |
https://en.wikipedia.org/wiki/Stephen%20J.%20Mellor | Stephen J. Mellor (born 1952) is an American computer scientist, developer of the Ward–Mellor method for real-time computing, the Shlaer–Mellor method, and Executable UML, and signatory to the Agile Manifesto.
Biography
Mellor received a BA in computer science from the University of Essex in 1974, and started working at CERN in Geneva, Switzerland as a programmer in BCPL. In 1977 he became software engineer at the Lawrence Berkeley Laboratory, and in 1982 consultant at Yourdon, Inc.
At Yourdon in cooperation with Paul Ward they developed the Ward–Mellor method, and published the book-series Structured Development for Real Time Systems in 1985.
Together with Sally Shlaer he founded Project Technology in 1985. That company was acquired by Mentor Graphics in 2004. Mellor stayed as chief scientist of the Embedded Systems Division at Mentor Graphics for another two years, and is self-employed since 2006.
Since 1998 Mellor has contributed to the Object Management Group, chairing the consortium that added executable actions to the UML, and the specification of model-driven architecture (MDA). He is also chairing the advisory board of the IEEE Software magazine. Since 2013, Mellor has served as CTO for the Industrial Internet Consortium.
Publications
1985. Structured Development for Real-Time Systems: Essential Modeling Techniques. With Paul T. Ward. Prentice Hall.
1986. Structured Development for Real-Time Systems: Implementation Modeling Techniques (Structured Development for Real-Time Systems Vol. 1). With Paul T. Ward. Prentice Hall.
1988. Object Oriented Systems Analysis: Modeling the World in Data. With Sally Shlaer. Prentice Hall.
1992. Object Life Cycles: Modeling the World In States. With Sally Shlaer. Prentice Hall.
2002. Executable UML: A Foundation for Model Driven Architecture. With Marc J. Balcer. Addison-Wesley.
2004. MDA Distilled. With Kendall Scott, Axel Uhl, Dirk Weise. Addison-Wesley.
Articles, a selection:
1989. "An object-oriented approach to domain analysis" with S. Shlaer. In: ACM SIGSOFT Software Engineering Notes. Vol 14–5, July 1989. pp. 66–77.
1997. "Why explore object methods, patterns, and architectures?" with Ralph Johnson. In: IEEE Software. Vol. 14, no. 1, pp. 27–29.
1999. "Softwareplatform-independent, precise action specifications for UML". With S. Tockey, R. Arthaud, P. LeBlanc - The Unified Modeling ..., 1999.
2002. "Make models be assets". In: Commun. ACM Vol 45–11. pp. 76–78.
2003. "A framework for aspect-oriented modeling". Paper from 4th (AOSD) Modeling With (UML) Workshop, October 2003.
2004. "Agile MDA" White paper 2004.
See also
Data flow
State transition
References
External links
Stephen J. Mellor homepage
R. Whetton, M. Jones and D. Murray, "The use of Ward and Mellor Structured Methodology for the design of a complex real time system," IEE Colloquium on Computer Aided Software Engineering Tools for Real-Time Control, 1991, pp. 5/1-5/4.
Ward and Mellor methodology.
1952 birth |
https://en.wikipedia.org/wiki/Edward%20of%20Aberdeen | Edward [Ēadweard, Eadward, Édouard, Étbard] was a 12th-century prelate based in Scotland. He occurs in the records for the first time as Bishop of Aberdeen in a document datable to some point between 1147 and 1151. His immediate predecessor, as far as the records are concerned, was Bishop Nechtán. The latter can be shown to have been active at least between 1131 and 1132, and possibly as late as 1137. Edward's accession must have occurred, then, sometime between 1131 and 1151, with a date after the 1130s more likely than not.
Edward witnessed charters of Kings David I, Máel Coluim IV and William the Lion. Bishop Edward was the recipient of a Bull, dated 10 August 1157, of Pope Adrian IV, confirming the possessions of the diocese of Aberdeen and authorising the bishop to appoint at his own discretion either monastic or secular canons to staff his cathedral. This to some extent marks Bishop Edward as a founding father figure for the bishopric, though he was not the first bishop. His name, Edward, may indicate an Anglo-Norman or even an Anglo-Saxon origin, though this cannot be taken with certainty, as the name was associated with the saintly and famous Normanised English King Edward the Confessor, and had been the name of a son of King Máel Coluim III mac Donnchada. Nevertheless, if the former is the case, he is the first non-native Scot to ascend the bishopric of Aberdeen.
It is possible, if not likely, that Edward was the Chancellor of that name who served King David I in the 1140s. Edward's death, recorded in the Chronicle of Melrose, occurred in 1171. He was succeeded by Matthew.
References
Dowden, John, The Bishops of Scotland, ed. J. Maitland Thomson, (Glasgow, 1912), pp. 98–9
Innes, Cosmo, Registrum Episcopatus Aberdonensis: Ecclesie Cathedralis Aberdonensis Regesta Que Extant in Unum Collecta, Vol. 1, (Edinburgh, 1845), pp. xix-xx
Keith, Robert, An Historical Catalogue of the Scottish Bishops: Down to the Year 1688, (London, 1924), p. 104
Lawrie, Sir Archibald, Early Scottish Charters Prior to A.D. 1153, (Glasgow, 1905)
Watt, D.E.R., Fasti Ecclesiae Scotinanae Medii Aevi ad annum 1638, 2nd Draft, (St Andrews, 1969), p. 1
1171 deaths
Bishops of Aberdeen
Scoto-Normans
12th-century Scottish Roman Catholic bishops
Lord chancellors of Scotland
Year of birth unknown |
https://en.wikipedia.org/wiki/DVD | The DVD (common abbreviation for Digital Video Disc or Digital Versatile Disc) is a digital optical disc data storage format. It was invented and developed in 1995 and first released on November 1, 1996, in Japan. The medium can store any kind of digital data and has been widely used for video programs (watched using DVD players) or formerly for storing software and other computer files as well. DVDs offer significantly higher storage capacity than compact discs (CD) while having the same dimensions. A standard single-layer DVD can store up to 4.7 GB of data, a dual-layer DVD up to 8.5 GB. Variants can store up to a maximum of 17.08 GB.
Prerecorded DVDs are mass-produced using molding machines that physically stamp data onto the DVD. Such discs are a form of DVD-ROM because data can only be read and not written or erased. Blank recordable DVD discs (DVD-R and DVD+R) can be recorded once using a DVD recorder and then function as a DVD-ROM. Rewritable DVDs (DVD-RW, DVD+RW, and DVD-RAM) can be recorded and erased many times.
DVDs are used in DVD-Video consumer digital video format and less commonly in DVD-Audio consumer digital audio format, as well as for authoring DVD discs written in a special AVCHD format to hold high definition material (often in conjunction with AVCHD format camcorders). DVDs containing other types of information may be referred to as DVD data discs.
Etymology
The Oxford English Dictionary comments that, "In 1995, rival manufacturers of the product initially named digital video disc agreed that, in order to emphasize the flexibility of the format for multimedia applications, the preferred abbreviation DVD would be understood to denote digital versatile disc." The OED also states that in 1995, "The companies said the official name of the format will simply be DVD. Toshiba had been using the name 'digital video disc', but that was switched to 'digital versatile disc' after computer companies complained that it left out their applications."
"Digital versatile disc" is the explanation provided in a DVD Forum Primer from 2000 and in the DVD Forum's mission statement, which the purpose is to promote broad acceptance of DVD products on technology, across entertainment, and other industries.
Because DVDs became highly popular for the distribution of movies in the 2000s, the term DVD became popularly used in English as a noun to describe specifically a full-length movie released on the format; for example the sentence to "watch a DVD" describes watching a movie on DVD.
History
Development and launch
Released in 1987, CD Video used analog video encoding on optical discs matching the established standard size of audio CDs. Video CD (VCD) became one of the first formats for distributing digitally encoded films in this format, in 1993. In the same year, two new optical disc storage formats were being developed. One was the Multimedia Compact Disc (MMCD), backed by Philips and Sony (developers of the CD and CD-i), and the other w |
https://en.wikipedia.org/wiki/Tiny | Tiny may refer to:
Places
Tiny, Ontario, a township in Canada
Tiny, Virginia, an unincorporated community in the US
Tiny Glacier, Wyoming, US
Computing
Tiny BASIC, a dialect of the computer programming language BASIC
Tiny Encryption Algorithm, in cryptography, a block cipher notable for its simplicity of description and implementation
Tiny Computers, a defunct UK computer manufacturer
TinyMCE, a web-based editor
TinyMUD, a MUD server
MU*, a family of MUD servers often called the Tiny family
Automobiles
Tara Tiny, an Indian electric car
Tiny (car), a British cyclecar manufactured between 1912 and 1915
People
Nickname
Nate Archibald (born 1948), American National Basketball Association player
Tiny Bonham (1913–1949), American Major League Baseball pitcher
Tiny Bradshaw (1905–1958), American jazz and rhythm and blues bandleader, singer, composer, and musician
Tiny Broadwick (1893–1978), American pioneering parachutist
Tiny Cahoon (1900–1973), American National Football League player
Tameka Cottle, (born 1975), American singer-songwriter and former member of Xscape
Tiny Croft (1920–1977), American National Football League player
Paul Engebretsen (1910–1979), American National Football League player
Tiny Gooch (1903-1986), American all-around college athlete, attorney and politician
Tiny Grimes (1916–1989), American jazz and R&B guitarist
Tiny Kahn (1923–1953), American jazz drummer, arranger and composer
Tiny Kox (born 1953), Dutch politician
Tiny Leys (1907–1989), New Zealand rugby union player
Tom Lister Jr. (1958-2020), American actor and wrestler
Big Tiny Little (1930–2010), American pianist
Tiny Lund (1929–1975), American race car driver
Tiny Osborne (1893–1969), American Major League Baseball pitcher
Tiny Parham (1900–1943), Canadian-born American jazz bandleader and pianist
Kendal Pinder (born 1956), American basketball player
Tiny Rowland (1917–1998), British businessman and chief executive of the Lonrho conglomerate from 1962 to 1994
Tiny Ron Taylor (1947–2019), American film actor and former basketball player
Tiny Sandford (1894–1961), American film actor
Tiny Thompson (1903–1981), Canadian National Hockey League goaltender
Tiny Timbrell (1917–1992), Canadian guitarist
Tiny Wharton (1927–2005), Scottish football referee
Carl Whiting (born 1981), New Zealand sailor
Xu Linyin (born 1986), Chinese beach volleyball player
Given name
Tiny Bounmalay (born 1993), Laotian footballer
Tiny Hoekstra (born 1996), Dutch footballer
Tiny Janssen, Dutch retired sidecarcross rider and 1990 world champion
Tiny Ruys (born 1957), Dutch football coach
Surname
Tieng Tiny (born 1986), Cambodian footballer
Fictional characters
Tiny, a character in the 1987 American comedy movie Revenge of the Nerds II: Nerds in Paradise
Tiny (Rob Zombie), from the Rob Zombie horror films House of 1000 Corpses and The Devil's Rejects
Tiny (comics), a comic strip character from The Topper
Tiny Tiger, from the Crash Bandicoot vid |
https://en.wikipedia.org/wiki/Dynamic%20Markov%20compression | Dynamic Markov compression (DMC) is a lossless data compression algorithm developed by Gordon Cormack and Nigel Horspool. It uses predictive arithmetic coding similar to prediction by partial matching (PPM), except that the input is predicted one bit at a time (rather than one byte at a time). DMC has a good compression ratio and moderate speed, similar to PPM, but requires somewhat more memory and is not widely implemented. Some recent implementations include the experimental compression programs hook by Nania Francesco Antonio, ocamyd by Frank Schwellinger, and as a submodel in paq8l by Matt Mahoney. These are based on the 1993 implementation in C by Gordon Cormack.
Algorithm
DMC predicts and codes one bit at a time. It differs from PPM in that it codes bits rather than bytes, and from context mixing algorithms such as PAQ in that there is only one context per prediction. The predicted bit is then coded using arithmetic coding.
Arithmetic coding
A bitwise arithmetic coder such as DMC has two components, a predictor and an arithmetic coder. The predictor accepts an n-bit input string x = x1x2...xn and assigns it a probability p(x), expressed as a product of a series of predictions, p(x1)p(x2|x1)p(x3|x1x2) ... p(xn| x1x2...xn–1). The arithmetic coder maintains two high precision binary numbers, plow and phigh, representing the possible range for the total probability that the model would assign to all strings lexicographically less than x, given the bits of x seen so far. The compressed code for x is px, the shortest bit string representing a number between plow and phigh. It is always possible to find a number in this range no more than one bit longer than the Shannon limit, log2 1 / p(x). One such number can be obtained from phigh by dropping all of the trailing bits after the first bit that differs from plow.
Compression proceeds as follows. The initial range is set to plow = 0, phigh = 1. For each bit, the predictor estimates p0 = p(xi = 0|x1x2...xi–1) and p1 = 1 − p0, the probability of a 0 or 1, respectively. The arithmetic coder then divides the current range, (plow, phigh) into two parts in proportion to p0 and p1. Then the subrange corresponding to the next bit xi becomes the new range.
For decompression, the predictor makes an identical series of predictions, given the bits decompressed so far. The arithmetic coder makes an identical series of range splits, then selects the range containing px and outputs the bit xi corresponding to that subrange.
In practice, it is not necessary to keep plow and phigh in memory to high precision. As the range narrows the leading bits of both numbers will be the same, and can be output immediately.
DMC model
The DMC predictor is a table which maps (bitwise) contexts to a pair of counts, n0 and n1, representing the number of zeros and ones previously observed in this context. Thus, it predicts that the next bit will be a 0 with probability p0 = n0 / n = n0 / (n0 + n1) and 1 |
https://en.wikipedia.org/wiki/Good%20Samaritan%20Hospital%20%28Los%20Angeles%29 | PIH Health Good Samaritan Hospital is a hospital in Los Angeles, California. The hospital has 408 beds. In 2019 Good Samaritan joined the PIH Health network.
History
In 1885, Sister Mary Wood opened a care facility with 9 beds. The hospital was historically affiliated with the Episcopal Church, but currently pastoral care services are available for all religions and denominations. The current hospital was built in 1976.
Prominent American suffragist Inez Milholland died at the hospital on November 25, 1916. Actress Jean Harlow died of kidney disease at the hospital at age 26 at 11:37 AM on June 7, 1937.
Presidential candidate United States Senator Robert F. Kennedy died at the hospital early in the morning of June 6, 1968, 25 hours after he was shot at the Ambassador Hotel.
In 1996, the hospital's neonatal intensive care unit was featured in Visiting... with Huell Howser Episode 401.
In 2011, Becker's Hospital Review listed Good Samaritan Hospital under 60 Hospitals With Great Orthopedic Programs.
In 2019 the hospital joined the PIH Health network becoming the third hospital in the network which includes PIH Health Hospital-Whittier and PIH Health Hospital-Downey.
Controversies
Since 2020, Good Samaritan Hospital has been accused of poor, unsafe work conditions for its nursing staff, with workers reporting shortages of PPE and unsafe recycling of masks and gloves. These unsanitary and poor working conditions have led to multiple strikes by nurses affiliated with the California Nurses Association/National Nurses Organizing Committee (CNA/NNU). Chief Nurse Union Representative Alejandro Cuevas said that Good Samaritan Hospital has put patients at risk just to save money in the process. Good Samaritan Hospital was later accused of engaging in Union busting by CNA/NNU when Union Representative Alejandro Cuevas was fired from his position.
Good Samaritan has also been accused of violating California's safe staffing law due to its chronic short-staffing, which has led to nurses assigned too many patients to care for and that means they are unable to take breaks during their 12-hour shifts, forcing them to work overtime and take extra shifts.
See also
Elizabeth McMaster
References
Hospitals in Los Angeles
Keck School of Medicine of USC
Assassination of Robert F. Kennedy
Hospitals established in 1885
1885 establishments in California
19th century in Los Angeles |
https://en.wikipedia.org/wiki/Micro-Term%20ERGO-201 | The Micro-Term ERGO-201 is a computer terminal produced in 1983 as part of the ERGO series of computers manufactured by Micro-Term Incorporated, located in St. Louis, MO. It consists of a monitor and a keyboard. The monitor contains the motherboard with a keyboard, printer, and auxiliary port. The computer runs on a SGS Z8400 CPU, a clone of the Zilog Z80A CPU
The Micro-Term Ergo Series can emulate a variety of terminals but the most common terminal emulation is vt100.
See also
Computer terminal
Micro-Term Incorporated
References
https://www.iana.org/assignments/terminal-type-names
https://web.archive.org/web/20070507123912/http://mintaka.sdsu.edu/faculty/wfw/CLASSES/ASTR680/utexas.unix_beyond.html
Motherboard image
Character-oriented terminal |
https://en.wikipedia.org/wiki/Philippine%20Human%20Development%20Network | The Human Development Network Foundation Inc. (HDN) is a non-stock, non-profit organization whose mission is to propagate and mainstream the concept of sustainable human development through research and advocacy.
The HDN is a group of development practitioners who first got together in 1992 through the initiative of Professor Solita Collas-Monsod, past HDN President, and the previous Resident Representative of the United Nations Development Programme (UNDP), Kevin McGrath. The group met in a series of "brainstorming" sessions to discuss how best to apply the major findings and conclusions of the Human Development Report in the Philippine setting. From an informal group in 1992, the HDN became a registered organization in 1997.
There are now about 150 HDN members from national government agencies, international organizations, non-governmental organizations and research institutions. In terms of discipline and background, the group is composed of political scientists, sociologists, and specialists in public administration, education and social work. The UNDP has been providing financial and technical assistance to the HDN for the preparation of the Philippine Human Development Reports and advocacy activities since 1994.
Mission
HDN's mission is to build knowledge that will help strengthen institutional capacity in achieving human development outcomes primarily through research and advocacy. Projects and programs are conducted while in constant consultation and engagement with stakeholders from civil society, research and academic institutions around the country, and the Philippine government.
Vision
HDN's vision is to build an environment for Filipinos where they can develop their full potential and lead productive, creative lives in accord with their needs and interests. Human development is about enabling people to have wider choices and expanding capabilities that will allow them to live a full life as human beings.
Our Work
To promote the sustainable human development concept, the HDN spearheads the following projects and activities: (1) preparation of a Philippine Human Development Report on a regular basis; (2) conduct and publication of policy researches on human development issues; (3) monitoring of the achievements, breakthroughs, deficiencies and gaps regarding human development in the work of both government and non-government organizations, (4) organization of and participation in fora, dialogues and symposia on human development concerns; (5) provision of briefings, workshops, lectures and training sessions relating to human development concepts and measures to different audiences.
Philippine Human Development Report
The Philippine Human Development Report (PHDR) is the HDN's main vehicle for advocating people-centered development, and generating discussion and consensus on human development issues. It is the national counterpart of the United Nations Development Programme's Global Human Development Report. To date, the HDN has |
https://en.wikipedia.org/wiki/Blu-ray | Blu-ray (Blu-ray Disc or BD) is a digital optical disc data storage format designed to supersede the DVD format. It was invented and developed in 2005 and released worldwide on June 20, 2006, capable of storing several hours of high-definition video (HDTV 720p and 1080p). The main application of Blu-ray is as a medium for video material such as feature films and for the physical distribution of video games for the PlayStation 3, PlayStation 4, PlayStation 5, Xbox One, and Xbox Series X. The name refers to the blue laser (actually a violet laser) used to read the disc, which allows information to be stored at a greater density than is possible with the longer-wavelength red laser used for DVDs.
The polycarbonate disc is in diameter and thick, the same size as DVDs and CDs. Conventional (or "pre-BD-XL") Blu-ray Discs contain 25 GB per layer, with dual-layer discs (50 GB) being the industry standard for feature-length video discs. Triple-layer discs (100 GB) and quadruple-layer discs (128 GB) are available for BD-XL re-writer drives.
High-definition (HD) video may be stored on Blu-ray Discs with up to pixel resolution, at 24& 50/60 progressive or 50/60 interlaced frames per second. DVD discs were limited to a maximum resolution of 480 (NTSC, 720×480 pixels) or 576 lines (CCIR 625/50, 720×576 pixels, commonly used with PAL). Besides these hardware specifications, Blu-ray is associated with a set of multimedia formats.
The BD format was developed by the Blu-ray Disc Association, a group representing makers of consumer electronics, computer hardware, and motion pictures. Sony unveiled the first Blu-ray Disc prototypes in October 2000, and the first prototype player was released in Japan in April 2003. Afterward, it continued to be developed until its official worldwide release on June 20, 2006, beginning the high-definition optical disc format war, where Blu-ray Disc competed with the HD DVD format. Toshiba, the main company supporting HD DVD, conceded in February 2008, and later released its own Blu-ray Disc player in late 2009. According to Media Research, high-definition software sales in the United States were slower in the first two years than DVD software sales. Blu-ray's competition includes video on demand (VOD) and DVD. In January 2016, 44% of U.S. broadband households had a Blu-ray player.
Since the standard Blu-ray Discs only support content with up to 2K resolution (1080p), the Blu-ray Disc Association introduced an enhanced variant of Blu-ray called Ultra HD Blu-ray (or 4K Blu-ray) for playback of 4K content. Also, the Association introduced an enhanced variant of Blu-ray for playback of 8K content in Japan.
History
Early history
The information density of the DVD format was limited by the wavelength of the laser diodes used. Following protracted development, blue laser diodes operating at 405 nanometers became available on a production basis, allowing for development of a denser storage format that could hold higher-definition m |
https://en.wikipedia.org/wiki/Norm%20Pattiz | Norman Joel Pattiz (January 18, 1943 – December 4, 2022) was an American broadcasting entrepreneur who founded radio network Westwood One. Pattiz was a member of the National Radio Hall of Fame.
Career
Pattiz worked in the sales dept at KCOP TV 13 in Hollywood from 1970–1974. He founded Westwood One, a radio syndication company, in 1976. It became America's largest radio network and one of the world's leading media companies.
In 2001, Pattiz joined the board of regents of the University of California and served as chair of the Board of the Regents Oversight Committee of the Department of Energy Laboratories. In January 2014, Governor of California Jerry Brown reappointed Pattiz to a second twelve year term on the board of regents. In November 2016, he was accused of workplace sexual harassment. The University of California Student Association called for dismissal of Pattiz from the Board of Regents in 2017 following an allegation by a podcast host. Pattiz apologized and claimed it was a joke. In December 2017, Pattiz resigned from the board of regents.
Pattiz was also chairman of the board of Lawrence Livermore and Los Alamos National Security LLC and on the board of the USC Annenberg School for Communication and Journalism. He was president of the Broadcast Education Association and was on the Council of Foreign Relations and the Pacific Council on International Policy. He was appointed by President Clinton for the United States Broadcasting Board of Governors (BBG), which oversees all U.S. non-military international broadcast services, in 2000, and reappointed by President Bush in 2002. He was chairman of BBG's Middle East Committee, where he helped create the U.S. government's Arabic-language radio and TV services broadcast to the 22 Middle East countries, including Radio Sawa and Alhurra Television.
In 2009, Pattiz was inducted into the National Radio Hall of Fame. Pattiz also received the Giants of Broadcasting Award from the Library of American Broadcasting.
Pattiz founded Courtside Entertainment Group in 2010 and was the company’s CEO. In October 2012, Pattiz founded Launchpad, which became PodcastOne in February 2013. Pattiz worked with the Los Angeles Lakers and Jay Mohr to develop the "America's Lakers Podcast With Jay Mohr" in 2017. Pattiz was inspired by his support of the Lakers, including his 35 years with courtside seats.
Personal life and death
Pattiz was married to Mary Turner, former radio personality and chairman of the board of the Betty Ford Center. They resided in both Beverly Hills, California, and Santa Barbara, California. He was a reserve deputy in the Los Angeles County Sheriff's Department and a member of the Region 1 Homeland Security Advisory Council. He was the benefactor of the Academy of Music at Hamilton High School and on the board of the Sheriff's Youth Foundation. The Norman J. Pattiz Concert Hall on the Hamilton campus is named in his honor.
Pattiz died on December 4, 2022, at the age of 79.
Referen |
https://en.wikipedia.org/wiki/Fantasy%20Interactive%20Scenarios%20by%20Telephone | Fantasy Interactive Scenarios by Telephone (F.I.S.T.) were a series of single-player telephone-based roleplaying games launched by UK games designer Steve Jackson in 1988 through the company Computerdial, who until then had used their service to provide astrology services. The product was a radio drama version of Jackson's popular Fighting Fantasy novels, and the outcome of the story could be affected by choices the user made, using a touch-tone telephone. A free starter pack could be ordered by sending a self-addressed stamped envelope to the game creators.
Two scenarios were produced for the F.I.S.T. game. The first of these was released under the title F.I.S.T. 1 – Castle Mammon: Lair of the Demon Prince in September 1988, and the second was a direct sequel titled F.I.S.T. 2 – The Rings of Allion in March 1989.
Players could register over the phone and create a character, which would be saved and restored the next time the player called. Both games were dungeon crawls, depicting the player's unnamed character progressing through the titular Castle Mammon in an attempt to slay the Demon Prince Kaddis Ra. The games featured sound effects and voice-overs illustrating the adventures of the character. Combat consisted of the player being read a description of what their opponent was doing, and pushing a key combination to take action or cast a spell in response. The game could be saved and quit at any time by pushing 9, and the last message could be repeated by pushing 0. Although a solo-game, players could hear the high scores of other players, and physical gold coins were awarded monthly to the highest scoring players. There was also 'The Black Claw Tavern', a group discussion line which connected with other adventurers calling at the same time.
In popular culture
The sketch comedy Limmy's Show! features a F.I.S.T.-esque parody called "Adventure Call", using the same formula with fantasy scenarios hosted by a costumed narrator, "Falconhoof" (played by Brian Limond).
References
Gamebooks |
https://en.wikipedia.org/wiki/DXRV | DXRV (103.5 FM), broadcasting as Barangay FM 103.5, is a radio station owned and operated by GMA Network. The station's studio and transmitter are located at GMA Complex, Broadcast Ave., Shrine Hills, Matina, Davao City.
The station was originally launched on March 9, 1996, as Campus Radio 103.5. On July 29, 2002, it was rebranded as 103.5 Wow FM with the slogan Wow! Nindota Ah!. On February 17, 2014, as part of RGMA's brand unification due to rebranding of its flagship station in Manila, the station rebranded as Barangay 103.5.
References
Barangay FM stations
Radio stations in Davao City
Radio stations established in 1996 |
https://en.wikipedia.org/wiki/ISO/IEEE%2011073 | CEN ISO/IEEE 11073 Health informatics - Medical / health device communication standards enable communication between medical, health care and wellness devices and external computer systems. They provide automatic and detailed electronic data capture of client-related and vital signs information, and of device operational data.
Background
Goals
Real-time plug-and-play interoperability for citizen-related medical, healthcare and wellness devices;
Efficient exchange of care device data, acquired at the point-of-care, in all care environments.
"Real-time" means that data from multiple devices can be retrieved, time correlated, and displayed or processed in fractions of a second.
"Plug-and-play" means that all a user has to do is make the connection – the systems automatically detect, configure, and communicate without any other human interaction
"Efficient exchange of care device data" means that information that is captured at the point-of-care (e.g., personal vital signs data) can be archived, retrieved, and processed by many different types of applications without extensive software and equipment support, and without needless loss of information.
The standards are targeted at both point-of-care devices (ventilators, infusion pumps, ECG, etc.) and personal health and fitness devices (such as glucose monitors, pulse oximeters, weighing scales, medication dispensers and activity monitors) and at continuing and acute care devices (such as pulse oximeters, ventilators and infusion pumps). They comprise a family of standards that can be layered together to provide connectivity optimized for the specific devices being interfaced. There are four main partitions to the standards:
Device data, including a nomenclature, or terminology, optimized for vital signs information representation based on an object-oriented data model, and device specialisations;
General application services (e.g., polled vs. "event driven" services);
Internetworking and gateway standards (e.g., an observation reporting interface from CEN ISO/IEEE 11073-based messaging and data representation to HL7 or DICOM);
Transports (e.g., cable connected or wireless).
Problems
In the absence of standards for these devices, (a) data is captured either manually or at considerable expense (using specialized equipment), or (b) it is not captured at all, which is most often the case.
Manually captured data is labour-intensive, recorded infrequently (e.g., written down hourly by a nurse clinician), and prone to human error.
Use of expensive custom connectivity equipment (a) drives up the cost of care delivery; (b) is only used for patients with the highest acuity; and (c) tends to lock care providers into single companies or partnerships that provide "complete" information system solutions, making it difficult to choose best-of-breed technologies to meet client needs, or the most cost effective systems.
Development and deployment of advanced care delivery systems are hindere |
https://en.wikipedia.org/wiki/Friend%20function | In object-oriented programming, a friend function, that is a "friend" of a given class, is a function that is given the same access as methods to private and protected data.
A friend function is declared by the class that is granting access, so friend functions are part of the class interface, like methods. Friend functions allow alternative syntax to use objects, for instance f(x) instead of x.f(), or g(x,y) instead of x.g(y). Friend functions have the same implications on encapsulation as methods.
A similar concept is that of friend class.
Use cases
This approach may be used in friendly function when a function needs to access private data in objects from two different classes.
This may be accomplished in two similar ways:
A function of global or namespace scope may be declared as friend of both classes.
A member function of one class may be declared as friend of another one.
// C++ implementation of friend functions.
#include <iostream>
using namespace std;
class Foo; // Forward declaration of class Foo in order for example to compile.
class Bar {
private:
int a = 0;
public:
void show(Bar& x, Foo& y);
friend void show(Bar& x, Foo& y); // declaration of global friend
};
class Foo {
private:
int b = 6;
public:
friend void show(Bar& x, Foo& y); // declaration of global friend
friend void Bar::show(Bar& x, Foo& y); // declaration of friend from other class
};
// Definition of a member function of Bar; this member is a friend of Foo
void Bar::show(Bar& x, Foo& y) {
cout << "Show via function member of Bar" << endl;
cout << "Bar::a = " << x.a << endl;
cout << "Foo::b = " << y.b << endl;
}
// Friend for Bar and Foo, definition of global function
void show(Bar& x, Foo& y) {
cout << "Show via global function" << endl;
cout << "Bar::a = " << x.a << endl;
cout << "Foo::b = " << y.b << endl;
}
int main() {
Bar a;
Foo b;
show(a,b);
a.show(a,b);
}
References
The C++ Programming Language by Bjarne Stroustrup
External links
C++ friend function tutorial at CoderSource.net
C++ friendship and inheritance tutorial at cplusplus.com
Method (computer programming)
Articles with example C++ code |
https://en.wikipedia.org/wiki/Matrix%20coefficient | In mathematics, a matrix coefficient (or matrix element) is a function on a group of a special form, which depends on a linear representation of the group and additional data. Precisely, it is a function on a compact topological group G obtained by composing a representation of G on a vector space V with a linear map from the endomorphisms of V into V underlying field. It is also called a representative function. They arise naturally from finite-dimensional representations of G as the matrix-entry functions of the corresponding matrix representations. The Peter–Weyl theorem says that the matrix coefficients on G are dense in the Hilbert space of square-integrable functions on G.
Matrix coefficients of representations of Lie groups turned out to be intimately related with the theory of special functions, providing a unifying approach to large parts of this theory. Growth properties of matrix coefficients play a key role in the classification of irreducible representations of locally compact groups, in particular, reductive real and p-adic groups. The formalism of matrix coefficients leads to a generalization of the notion of a modular form. In a different direction, mixing properties of certain dynamical systems are controlled by the properties of suitable matrix coefficients.
Definition
A matrix coefficient (or matrix element) of a linear representation of a group on a vector space is a function on the group, of the type
where is a vector in , is a continuous linear functional on , and is an element of . This function takes scalar values on . If is a Hilbert space, then by the Riesz representation theorem, all matrix coefficients have the form
for some vectors and in .
For of finite dimension, and and taken from a standard basis, this is actually the function given by the matrix entry in a fixed place.
Applications
Finite groups
Matrix coefficients of irreducible representations of finite groups play a prominent role in representation theory of these groups, as developed by Burnside, Frobenius and Schur. They satisfy Schur orthogonality relations. The character of a representation ρ is a sum of the matrix coefficients fvi,ηi, where {vi} form a basis in the representation space of ρ, and {ηi} form the dual basis.
Finite-dimensional Lie groups and special functions
Matrix coefficients of representations of Lie groups were first considered by Élie Cartan.
Israel Gelfand realized that many classical special functions and orthogonal polynomials are expressible as the matrix coefficients of representation of Lie groups G. This description provides a uniform framework for proving many hitherto disparate properties of special functions, such as addition formulas, certain recurrence relations, orthogonality relations, integral representations, and eigenvalue properties with respect to differential operators. Special functions of mathematical physics, such as the trigonometric functions, the hypergeometric function and its generali |
https://en.wikipedia.org/wiki/Stars%20%28shader%20effect%29 | Stars is a computer graphics effect used by computer games. The effect takes the bright parts of a rendered image of the scene, and then smears them outward in a number of directions. The result is that bright areas have streaks emanating from them. Stars can be used to enhance blooming. The effect is also sometimes known as light streaks or just as the star effect.
External links
Double Steal Fake HDR Rundown
Demo effects
Shading |
https://en.wikipedia.org/wiki/Skype%20security | Skype is a Voice over Internet Protocol (VoIP) system developed by Skype Technologies S.A. It is a peer-to-peer network where voice calls pass over the Internet rather than through a special-purpose network. Skype users can search for other users and send them messages.
Skype reports that it uses 256 bit Advanced Encryption Standard (AES)/ Rijnadel encryption to communicate between Skype clients; although when calling a telephone or mobile, the part of the call over the public switched telephone network (PSTN) is not encrypted. User public keys are certified by the Skype server at login with 1536-bit or 2048-bit RSA certificates. Skype's encryption is inherent in the Skype Protocol and is transparent to callers. Some private conversations through Skype such as audio calls, text messages, and file sending (image, audio, or video) can make use of end-to-end encryption, but it may have to be manually turned on.
Security policy
The company's security policy states that:
Usernames are unique.
Callers must present a username and password or another authentication credential.
Each caller provides the other with proof of identity and privileges whenever a session is established. Each verifies the other's evidence before the session can carry messages.
Messages transmitted between Skype users (with no PSTN users included) are encrypted from caller to caller. No intermediate node (router) has access to the meaning of these messages. This claim was undermined in May 2013 by evidence that Microsoft (owner of Skype) has pinged unique URLs embedded in a Skype conversation; this could only happen if Microsoft has access to the unencrypted form of these messages.
Implementation and protocols
Registration
Skype holds registration information both on the caller's computer and on a Skype server. Skype uses this information to authenticate call recipients and assure that callers seeking authentication access a Skype server rather than an impostor. Skype says that it uses public-key encryption as defined by RSA to accomplish this.
The Skype server has a private key and distributes that key's public counterpart with every copy of the software. As part of user registration, the user selects a desired username and password. Skype locally generates public and private keys. The private key and a password hash are stored on the user's computer.
Then a 256-bit AES-encrypted session is established with the Skype server. The client creates a session key using its random number generator.
The Skype server verifies that the selected username is unique and follows Skype's naming rules. The server stores the username and a hash of the user's password [ H ( H ( P ) ) ] {\displaystyle [H(H(P))]} in its database.
The server now forms and signs an identity certificate for the username that binds the username, verification key, and key identifier.
Peer-to-peer key agreement
For each call, Skype creates a session with a 256-bit session key. This session exists |
https://en.wikipedia.org/wiki/Johnny%20Swank | Johnny Swank was the name of a radio comedy serial produced by Working Dog Productions in 1996 for Australia's Austereo radio network. The show was created by members of The D-Generation. The serial was about a secret agent named Johnny Swank (voiced by Rob Sitch) and his sidekick K2 (voiced by Santo Cilauro).
The show had a different theme song for each day of the week:
Monday
When he walks, you can hear the ladies swoon (Johnny Swank! Johnny Swank!)
He's the man who will save the world from doom (Johnny Swank! Johnny Swank!)
His aim is true, he's got more frequent-flyer points than you,
He drives a '95 Daewoo ("the big one...")
Johnny Swank! Johnny Swank! Johnny Swank!
Tuesday
When he walks, all the people stop and stare (Johnny Swank! Johnny Swank!)
He's fastidious, when it comes to underwear (Johnny Swank! Johnny Swank!)
He is not afraid of death, he's a five-star gourmet chef,
He is also somewhat deaf ("what was that?")
Johnny Swank! Johnny Swank! Johnny Swank!
Wednesday
He's the man, he's the man for you and me (Johnny Swank! Johnny Swank!)
He's the man, who makes the ladies sing off-key (Johnny Swank! Johnny Swank!)
He's the man we all adore, with chicks he'll always score,
His gun safety is poor ("uh, sorry!")
Johnny Swank! Johnny Swank! Johnny Swank!
Thursday
When he walks, you can tell he's one cool cat (Johnny Swank! Johnny Swank!)
With his gun and his ... cravat (Johnny Swank! Johnny Swank!)
He knows no fear, he won Lotto last year,
He chucks after just one beer!
Johnny Swank! Johnny Swank! Johnny Swank!
Friday
He's the spy, he's the spy who's suave and brave (Johnny Swank! Johnny Swank!)
He's the spy who wears too much aftershave (Johnny Swank! Johnny Swank!)
He is on the best-dressed list, he's a pilot and linguist,
He is prone to getting pissed!
Johnny Swank! Johnny Swank! Johnny Swank!
External links
Working Dog
D-Gen
Australian comedy radio programs
1990s Australian radio programs |
https://en.wikipedia.org/wiki/GlobalData | GlobalData Plc is a data analytics and consulting company, headquartered in London, England. The company was established in 1999, and, under different names, has been listed on the London Stock Exchange's Alternative Investment Market (AIM) since 2000. It was previously called Progressive Digital Media and, before that, the TMN Group. GlobalData employs over 3000 personnel in offices across the UK, US, Argentina, South Korea, Mexico, China, Japan, India and Australia. It has an R&D centre in India. The group is chaired by Murray Legg, a former partner at PwC. Mike Danson, one of the founders of Datamonitor, is CEO.
Background
TMN Group, founded in 1999 as TheMutual.net, was a London-based provider of online marketing, business information, research and marketing services. In December 2007, it acquired Internet Business Group in a £9.8m deal. Four months later, in March 2008, TMN rejected a £40m cash and shares offer from Tangent Communications, another marketing services group. Then in May 2008, two TMN directors, CEO Mark Smith and CFO Craig Dixon, put together a £52.8m management buy-out offer for the business, backed by August Equity. Following the Tangent offer, withdrawn in April 2008, founder and former Datamonitor CEO, Mike Danson had built a 27% shareholding in TMN. The MBO failed after August Equity could not secure the funding needed.
Progressive Digital Media was founded in 2007 as a holding company for a set of media assets purchased from Wilmington plc; it expanded further by a series of acquisitions, purchasing Business Review from Datamonitor PLC in July 2008, followed in November 2008 by acquiring the entire share capital of SPG Media Group PLC.
In 2009, TMN was acquired via a reverse takeover by Progressive Digital Media Ltd, and changed its name to Progressive Digital Media Group Ltd.
Progressive Digital Media acquired Current Analysis Inc in 2014.
On 27 July 2015, Progressive Digital Media announced that it had agreed to acquire Datamonitor Financial, Datamonitor Consumer, MarketLine and Verdict businesses from Informa for a combined cash price of £25m.
In January 2016, Progressive Digital Media bought the GlobalData Holding Ltd business and changed its own name to GlobalData Plc.
In the year to 31 December 2022, GlobalData had revenues of £243.2m and reported a statutory profit before tax of £38.4m, an 18% increase on the previous year.
References
External links
GlobalData PLC
SPG Media
London Stock Exchange
Market research companies of the United Kingdom
Companies based in the City of London
Analytics companies
Consulting firms of the United Kingdom |
https://en.wikipedia.org/wiki/Network-i | Network-i Ltd was a datacentre company headquartered in Slough, Berkshire, England. The company provided hosting, colocation, network and cloud based services from its datacentres located in the United Kingdom.
The company was formed in 1996 as the Internet Service Provider Consortium with a remit to provide reliable core transit facilities. The company changed its name to Network-i in 1998 when the consortium members sold a controlling majority of the shares to the management team, headed by Barry Reynolds, a former finance director at British Gas. Under his stewardship, the company established a carrier class datacentre on Slough Trading Estate and began to offer broadband services and hosting facilities. In early 2000, Reynolds ceded responsibility for running the company to Sandeep Sharma, a conferencing industry veteran.
In 2006, the company was the first datacentre operator worldwide to gain ISO 27001:2005 accreditation. Network-i opened a second datacentre in January 2009.
On 5 August 2010 Network-i was acquired by Virtustream.
Network-i ceased trading on 28 December 2017.
Datacentres
Network-i operated two ISO 27001 certified carrier-neutral datacentres in the UK.
References
Companies based in Slough
Internet properties established in 1996
1996 establishments in England |
https://en.wikipedia.org/wiki/SecureLog | In cryptology, SecureLog is an algorithm used to convert digital data into trusted data that can be verified if the authenticity is questioned. SecureLog is used in IT solutions that generates data to support compliance regulations like SOX.
History
An algorithm used to make datalogs secure from manipulation. The first infrastructure supporting the algorithm was available on the Internet in 2006.
Operation
SecureLog involves an active key provider, a managed data store and a verification provider.
Active Key Provider
An active key provider distributes active keys to subscribers. An active key contains encrypted data representing time and a private secret. An active key has a validity period that is set by the active key provider.
Managed data store
The managed data store is a subscriber to the active keys delivered by the active key provider. The managed data store uses the active keys to do asymmetric encryption, timestamping and archive the data into a locked database.
Verification provider
The verification provider may read segments from the locked database and verify content, timestamps and that the integrity of the data has not been broken or manipulated since it was saved.
Uses
The algorithm is used in several different use cases:
Compliance issues
SecureLog is used to secure different types of data logs like access logs, email archives or transaction logs and is primarily in use where compliance might be an issue.
The administrator weak link problem
One drawback with archiving solutions is that there is always an administrator that in the end has access to the information. This makes it difficult to trust the integrity of the data. SecureLog is used to solve the traditional administrator problem.
Proposed uses
Government use
In the public sector several laws handles the archiving of data. It has been proposed that SecureLog can be used by a free institution to lock government logs and stop them from potential manipulation. Several potential use cases has been identified by EDRI
The traffic logging problem
The method can be used by the public to monitor what data the government is collecting from the public. It has been proposed to be used as a method to solve the privacy issues in the EU Directive on Mandatory Retention of Communications Traffic Data
References
Directive 2006/24/EC of the European Parliament
Weatech
USPTO patent 20060053294
Cryptographic algorithms |
https://en.wikipedia.org/wiki/Comic%20Strip%20Live%20%28TV%20series%29 | Comic Strip Live was a weekly, late-night, hour-long stand-up comedy showcase that aired on the Fox network from 1989 to 1994. It started as a local show at Igby's comedy club, originally hosted by John Mulrooney and filmed at the club. Jamie Masada, owner of the Laugh Factory, proposed that they take the show national; Fox agreed, and moved the show to the Laugh Factory in Hollywood. Mulrooney was replaced by Gary Kroeger for the second season, then Wayne Cotter for the remaining seasons.
The show was successful enough that Fox created a prime time version called The Sunday Comics.
See also
List of late night network TV programs
References
External links
1980s American late-night television series
1990s American late-night television series
1989 American television series debuts
1994 American television series endings
Fox late-night programming |
https://en.wikipedia.org/wiki/Solus | Solus may refer to:
Solus or Soluntum, an ancient city of Sicily
Solus (comics), an American comic book series
Solus (operating system), an operating system based on the Linux kernel
Solus (moth), a genus of moths in the family Saturniidae
Solus (typeface), a serif typeface
Solus, Western Australia, a locality in Western Australia
McLaren Solus GT, a sports car |
https://en.wikipedia.org/wiki/Sexfriend | is a hentai computer game and anime. Sexfriend focuses on the protagonist, Tomohiro Takabe, who has his first sexual encounter in the nurse's office after school with his classmate, Mina Hayase. He eventually desires a real romantic relationship, not just "friends with benefits". Another student, Kaori Nonomiya, sees Tomohiro and Mina having sex and runs off disappointed because she also loves Tomohiro. She eventually joins them in a threesome.
Cast
Wasshoi Taro: Takabe Tomohiro
Dynamite Ami: Mina Hayase
Kanari Kanzaki: Kaori Nonomiya
Erena Kaibara: Nurse Taeko Nonomiya
Bokyle: Otoko, Additional Voices
Credits
Kurige Katsura: Director, Screenplay, Storyboard
Shida Tadashi: Animation Director, Character Designer
Toru Yukawa: Music
Ayumi Shimazu: Art Direction
Kanashi Bari: Color Design
Dynamite Ami: Theme Song Performer
References
Further reading
Animeland Hors-Série #9: HS Q, February 2006
External links
2003 video games
2004 anime OVAs
Casual sex in fiction
Group sex
Eroge
Japan-exclusive video games
Video games developed in Japan
Windows games
Windows-only games |
https://en.wikipedia.org/wiki/Orsay%20%28disambiguation%29 | Orsay is a commune in the southwestern suburbs of Paris, France.
Orsay may also refer to:
Orsay, Inner Hebrides, an island in Scotland
Orsay (operating system), a proprietary operating system made by Samsung; see NetCast
See also
D’Orsay (disambiguation) |
https://en.wikipedia.org/wiki/TSX-32 | TSX-32 has been a general purpose 32-bit multi-user multitasking operating system for x86 architecture platform, with a command line user interface. It is compatible with some 16-bit DOS applications and supports file systems FAT16 and FAT32. It was developed by S&H Computer Systems, and has been available since 1989.
DEC-oriented columnist Kevin G. Barkes noted that TSX-32 is "not a port of the PDP-11 TSX-Plus" and that it runs
well on 386, 486 and Pentium-based systems. He reported a limitation: since it supports the MS/DOS (FAT) file system, filenames are DOS's 8+3.
TSX-Plus
An earlier non-DEC operating system, also from S&H, was named TSX-Plus. Released in 1980, TSX-Plus was the successor to TSX, released in 1976.
The strength of TSX-Plus is to simultaneously provide to multiple users the services of DEC's single-user RT-11. Depending on which PDP-11 model and the amount of memory, the system could support a minimum of 12 users (14-18 users on a 2Mb 11/73, depending on workload). A productivity feature called "virtual lines" "allows a single user to control several tasks from a single terminal."
History
S&H wrote the original TSX because "Spending $25K on a computer that could only support one user bugged" (founder Harry Sanders); the outcome was the initial four-user TSX in 1976.
For TSX-32, they said in an interview, "We started with a clean sheet of paper" rather than starting with a "port."
As of 2021, it appears to be defunct.
VAX
The company's product line was ported/expanded for the VAX line.
See also
Multiuser DOS Federation
References
External links
TSX-32 official description page
X86 operating systems
DOS variants
1989 software |
https://en.wikipedia.org/wiki/God%20of%20War%20III | God of War III is an action-adventure hack and slash video game developed by Santa Monica Studio and published by Sony Computer Entertainment. First released for the PlayStation 3 on March 16, 2010, it is the fifth installment in the God of War series, the seventh chronologically, and the sequel to 2007's God of War II. Loosely based on Greek mythology, the game is set in ancient Greece with vengeance as its central motif. The player controls the protagonist Kratos, the former God of War, after his betrayal at the hands of his father Zeus, King of the Olympian gods. Reigniting the Great War, Kratos ascends Mount Olympus until he is abandoned by the Titan Gaia. Guided by Athena's spirit, Kratos battles monsters, gods, and Titans in a search for Pandora, without whom he cannot open Pandora's Box, defeat Zeus, and end the reign of the Olympian gods to have his revenge.
The gameplay is similar to previous installments, focusing on combo-based combat with the player's main weapon—the Blades of Exile—and secondary weapons acquired during the game. It uses quick time events, where the player acts in a timed sequence to defeat strong enemies and bosses. The player can use up to four magical attacks and a power-enhancing ability as alternative combat options, and the game features puzzles and platforming elements. Compared with previous installments, God of War III offers a revamped magic system, more enemies, new camera angles, and downloadable content.
God of War III was critically acclaimed upon release, with praise for the graphics, gameplay, and scope, although the plot received a mixed reception. The game received several awards, including "Most Anticipated Game of 2010" and "Best PS3 Game" at the 2009 and 2010 Spike Video Game Awards, respectively, and the "Artistic Achievement" award at the 2011 British Academy of Film and Television Arts (BAFTA) Video Game Awards. The second best-selling game in the God of War series and the ninth best-selling PlayStation 3 game of all time, it sold nearly 5.2 million copies worldwide by June 2012 and was included in the God of War Saga released for PlayStation 3 on August 28, 2012. Since its release, it has also been named as one of the greatest games of all time. In celebration of the God of War franchise's tenth anniversary, a remastered version of the game, titled God of War III Remastered, was released for the PlayStation 4 (PS4) on July 14, 2015; as of June 2023, the remastered version has sold an estimated 4 million copies. After two more prequels were released, a direct sequel to God of War III simply titled God of War was released on April 20, 2018, which shifted the setting to Norse mythology.
Gameplay
God of War III is an action-adventure game with hack and slash elements. It is a third-person single-player video game. As with previous installments, the player controls the character Kratos from a fixed-camera perspective in combo-based combat, platforming, and puzzle games. The enemies are an assor |
https://en.wikipedia.org/wiki/The%20One%20in%20Barbados | "The One in Barbados" is a double length episode of Friends, the final episode of the ninth season. It first aired on the NBC network in the United States on May 15, 2003.
The first part marks the final appearance of David (Hank Azaria).
Plot
Part I
Ross is selected to deliver a keynote speech at a paleontology convention in Barbados, and invites the gang to accompany him. Upon arrival, Monica's hair becomes frizzy due to the humidity, which annoys Chandler, Joey feels out of place with the attending paleontologists and the tourists who are fans of Ross, and a heavy downpour of rain prevents the group from going outside to the beach.
Phoebe cannot stop thinking about her ex Mike, while going out with David. When Chandler inadvertently persuades David to propose to Phoebe, Monica warns Phoebe, who plans to accept the proposal, leading to Monica calling Mike to try to convince him to win Phoebe back since his refusal to marry again destroyed their relationship. During dinner, as David begins to propose to Phoebe, Mike shows up and proposes first, having realized that he does not want to lose her ever again. She rejects both proposals but ends up choosing Mike over David, explaining that she did not need a proposal from him; just the reassurance that they have a future together. A defeated David decides to leave, and Phoebe apologizes for rejecting him, saying it would have been wrong for her to accept his proposal.
Whilst sampling Ross's presentation on his laptop, Chandler accidentally opens an email containing a virus, which erases the files for the presentation which takes place the next day. Charlie volunteers to help a panicked Ross recreate his speech, delaying her dinner plans with Joey, who then takes Rachel to crash a nearby pharmaceutical convention for fun. After quickly recreating the speech, Ross and Charlie celebrate by indulging in the hotel room snacks and find they have a lot in common, from intellectual pursuits to relationship problems. Meanwhile, Joey and Rachel have fun at the convention and get closer, and Rachel tries to confess her feelings to Joey but is interrupted by Ross and Charlie leaving the hotel room. Joey and Charlie then leave for dinner together, much to Ross and Rachel's chagrin.
Part II
The next morning, the rain subsides on the beach leading to a sunny morning; however the rest of the group are forced to attend Ross' keynote speech, much to their consternation. Charlie sees Joey and Rachel smirking at the word "homoerectus", and another fresh downpour outside prevents the group from going to the beach following the presentation.
Bored at the weather and the convention, Monica and Mike decide to take an unwilling Chandler and Phoebe to the game room, where both Monica and Mike show their competitive nature during a game of ping-pong, which displeasures Chandler and turns Phoebe on. They trash talk each other and tie at 41-41 when Monica injures her hand. Chandler agrees to play for her, but she complains |
https://en.wikipedia.org/wiki/AOS/VS%20II | AOS/VS II is a discontinued operating system for the Data General 32-bit MV/Eclipse computers.
Overview
The AOS/VS II operating system was released in 1988 and was originally to be simply rev 8.00 of the AOS/VS operating system. However, it introduced a new file system which was not compatible with the original AOS and AOS/VS file system and also contained new features like Access control list (ACL) groups. Since some customers did not want to upgrade to the new file system, or invest in new hardware, Data General agreed to continue bug-fix support of an “immortal” revision of AOS/VS, which became known colloquially as AOS/VS “Classic”, while new development would proceed as AOS/VS II, with revision numbers rolled back to 1.00.
Both VS-Classic (rev 7.7x) and VS-II (rev. 3.2x) were updated to survive the Year 2000 problem, although by this time both were obsolescent.
Among the other new features that were part of AOS/VS II were a full TCP/IP stack, NFS support, expanded kernel address space using ring-1 and a logical disk-level user data cache. /VS (classic) had a file system metadata cache, but no user data cache.
See also
Data General RDOS
Proprietary operating systems
Data General |
https://en.wikipedia.org/wiki/UNA%20Europe | UNA Europe Network is a network of United Nations Associations (UNAs) based in Europe.
United Nations Associations are Non-Governmental Organisations, usually with individual and organizational members. They are peoples movements with the common goal of working for a better and stronger United Nations. Often they work with information, advocacy, international cooperation and fundraising. There are over 100 UNA's around the world and are presently organized in a world federation, World Federation of United Nations Associations (WFUNA).
There are currently 33 UNAs in the UNA Europe Network:
Armenia
Austria
Belgium
Bulgaria
Croatia
Cyprus
Czech Republic
Denmark
Estonia
Finland
France
Georgia
Germany
Greece
Hungary
Iceland
Israel
Italy
Lithuania
Luxembourg
Montenegro
Netherlands
Norway
Portugal
Romania
Russia
Serbia
Slovenia
Spain
Sweden
Switzerland
Turkey
United Kingdom
References
External links
World Federation of United Nations Associations |
https://en.wikipedia.org/wiki/Full%20service | Full service or Full Service may refer to:
Full-service radio, a wide range of programming
Full Service Network, a communications company
Entertainment
"Full Service", a song by the New Kids on the Block from their album The Block
Full Service (band), an Austin-based band
Full Service (book), a 2012 memoir by Scotty Bowers
Full Service, a 2005 novel by Will Weaver
Full Service No Waiting, a 1998 album by Peter Case
Other meanings
A level of hospitality or comprehensiveness
An airline with a traditional service level, as opposed to a low-cost carrier
A full-service restaurant, where waiters take food orders from customers seated at tables
A hotel that offers full standardized industry amenities
A car wash where attendants wash the interior as well as the exterior of vehicles
A filling station that pumps fuel, washes windshields and checks vehicle fluid levels
A rest area that offers a gas station, food, rest rooms and other amenities for travelers
A law firm that offers legal services in a variety of areas of law
A code word or euphemism for prostitution |
https://en.wikipedia.org/wiki/Airline%20reservations%20system | Airline reservation systems (ARS) are systems that allow an airline to sell their inventory (seats). It contains information on schedules and fares and contains a database of reservations (or passenger name records) and of tickets issued (if applicable). ARSs are part of passenger service systems (PSS), which are applications supporting the direct contact with the passenger.
ARS eventually evolved into the computer reservations system (CRS). A computer reservation system is used for the reservations of a particular airline and interfaces with a global distribution system (GDS) which supports travel agencies and other distribution channels in making reservations for most major airlines in a single system.
Overview
Airline reservation systems incorporate airline schedules, fare tariffs, passenger reservations and ticket records. An airline's direct distribution works within their own reservation system, as well as pushing out information to the GDS. The second type of direct distribution channel are consumers who use the internet or mobile applications to make their own reservations. Travel agencies and other indirect distribution channels access the same GDS as those accessed by the airline reservation systems, and all messaging is transmitted by a standardized messaging system that functions on two types of messaging that transmit on SITA's high level network (HLN). These messaging types are called Type A [usually EDIFACT format] for real time interactive communication and Type B [TTY] for informational and booking type of messages. Message construction standards set by IATA and ICAO, are global, and apply to more than air transportation. Since airline reservation systems are business critical applications, and they are functionally quite complex, the operation of an in-house airline reservation system is relatively expensive.
Prior to deregulation, airlines owned their own reservation systems with travel agents subscribing to them. Today, the GDS are run by independent companies with airlines and travel agencies being major subscribers.
As of February 2009, there are only four major GDS providers in the market: Amadeus, Travelport (which operates the Apollo, Worldspan and Galileo systems), Sabre and Shares. There is one major Regional GDS, Abacus, serving the Asian market and a number of regional players serving single countries, including Travelsky (China), Infini and Axess (both Japan) and Topas (South Korea). Of these, Infini is hosted within the Sabre complex, Axess is in the process of moving into a partition within the Worldspan complex, and Topas agencies will be migrating into Amadeus.
Reservation systems may host "ticket-less" airlines and "hybrid" airlines that use e-ticketing in addition to ticket-less to accommodate code-shares and interlines.
In addition to these "standardized" GDS, some airlines have proprietary versions which they use to run their flight operations. A few examples are Delta's OSS and Deltamatic systems and |
https://en.wikipedia.org/wiki/WSKY%20%28AM%29 | WSKY (1230 AM) is a radio station broadcasting a religious format. Licensed to Asheville, North Carolina, United States. The station is currently owned by Wilkins Communications Network.
History
For almost 50 years, Zeb Lee ran WSKY, including serving as an announcer for high-school football games. He was the first to introduce rock and roll to Asheville when he sponsored an Elvis Presley concert in 1955. Zeb Lee was a pioneer in Asheville broadcasting. First he loved radio and honestly cared about the community; he produced many great radio programs, including "The Man on the Street" a daily talk show live in front of the S & W Cafeteria in downtown Asheville. For many years Zeb and his engineer "Buddy" Resienburg did a live broadcast of every Asheville High football game. Zeb Lee hired and trained many DJs who went on to have great careers in large market radio. WSKY was a Top 40 station in the 1970s and early 1980s.
In March 1994, Lee sold WSKY in order to put WZLS on the air. New owner River City Communications switched the format from a mix of music and Larry King, Rush Limbaugh and the Atlanta Braves to a format of mostly satellite-delivered oldies, with Limbaugh and a local morning host called Mountain Man. Between the songs, Mountain Man included comedy, some of it risqué, and he was dropped or resigned after several months because he "crossed the line". Station manager Chris Pedersen took over July 18, 1994 promising a "kinder, gentler" program.
On January 25, 1995, WSKY switched from oldies to news/talk. In addition to Limbaugh, WSKY added Good Day USA with Doug Stephan (with Dan Poe doing local reports), Derrick DeSilva, G. Gordon Liddy, David Brenner, Tom Leykis, Jim Bohannon and Stan Major.
Rick Howerton tried to purchase the station to no avail, however he was able to secure the rights to an old Southern Railway frequency (AM 880) that was eventually sold to a local businessman/entrepreneur - while WSKY was sold to Wilkins Communications and changed to Christian programming. After several months of trying to get the station on the air, Howerton was asked back and to assist and signed on WTZY in the summer of 1997. Subsequently, most of the programming on WSKY was added to the new WTZY (now WPEK). WTZY also shared simulcast duties with WTZK (formerly WZQR in Black Mountain, North Carolina) which was also purchased by the local businessman. Howerton went on to form Zybek Media Group with his wife Beth and they purchased WAAK (WZRH and WCRU) in Dallas, North Carolina and WWRN (WZNN and WZGM) in Black Mountain, North Carolina.
References
External links
SKY
SKY
Radio stations established in 1955
1955 establishments in North Carolina |
https://en.wikipedia.org/wiki/Control%20flow%20analysis | In computer science, control-flow analysis (CFA) is a static-code-analysis technique for determining the control flow of a program. The control flow is expressed as a control-flow graph (CFG). For both functional programming languages and object-oriented programming languages, the term CFA, and elaborations such as k-CFA, refer to specific algorithms that compute control flow.
For many imperative programming languages, the control flow of a program is explicit in a program's source code. As a result, interprocedural control-flow analysis implicitly usually refers to a static analysis technique for determining the receiver(s) of function or method calls in computer programs written in a higher-order programming language. For example, in a programming language with higher-order functions like Scheme, the target of a function call may not be explicit: in the isolated expression
(lambda (f) (f x))
it is unclear to which procedure f may refer. A control-flow analysis must consider where this expression could be invoked and what argument it may receive to determine the possible targets.
Techniques such as abstract interpretation, constraint solving, and type systems may be used for control-flow analysis.
See also
Control-flow diagram (CFD)
Data-flow analysis
Cartesian product algorithm
Pointer analysis
References
External links
for textbook intraprocedural CFA in imperative languages
CFA in functional programs (survey)
for the relationship between CFA analysis in functional languages and points-to analysis in imperative/OOP languages |
https://en.wikipedia.org/wiki/Three-way%20comparison | In computer science, a three-way comparison takes two values A and B belonging to a type with a total order and determines whether A < B, A = B, or A > B in a single operation, in accordance with the mathematical law of trichotomy.
It can be implemented in terms of a function (such as strcmp in C), a method (such as compareTo in Java), or an operator (such as the spaceship operator <=>, in C++).
Machine-level computation
Many processors have instruction sets that support such an operation on primitive types. Some machines have signed integers based on a sign-and-magnitude or one's complement representation (see signed number representations), both of which allow a differentiated positive and negative zero. This does not violate trichotomy as long as a consistent total order is adopted: either −0 = +0 or −0 < +0 is valid. Common floating point types, however, have an exception to trichotomy: there is a special value "NaN" (Not a Number) such that x < NaN, x > NaN, and x = NaN are all false for all floating-point values x (including NaN itself).
High-level languages
Abilities
In C, the functions strcmp and memcmp perform a three-way comparison between strings and memory buffers, respectively. They return a negative number when the first argument is lexicographically smaller than the second, zero when the arguments are equal, and a positive number otherwise. This convention of returning the "sign of the difference" is extended to arbitrary comparison functions by the standard sorting function qsort, which takes a comparison function as an argument and requires it to abide by it.
In Perl (for numeric comparisons only, the cmp operator is used for string lexical comparisons), PHP (since version 7), Ruby, and Apache Groovy, the "spaceship operator" <=> returns the values −1, 0, or 1 depending on whether A < B, A = B, or A > B, respectively. The Python 2.x cmp(removed in 3.x), OCaml compare, and Kotlin compareTo functions compute the same thing. In the Haskell standard library, the three-way comparison function compare is defined for all types in the Ord class; it returns type Ordering, whose values are LT (less than), EQ (equal), and GT (greater than):
data Ordering = LT | EQ | GT
Many object-oriented programming languages have a three-way comparison method, which performs a three-way comparison between the object and another given object. For example, in Java, any class that implements the Comparable interface has a compareTo method which either returns a negative integer, zero, or a positive integer, or throws a NullPointerException (if one or both objects are null). Similarly, in the .NET framework, any class that implements the IComparable interface has such a CompareTo method.
Since Java version 1.5, the same can be computed using the Math.signum static method if the difference can be known without computational problems such as arithmetic overflow mentioned below. Many computer languages allow the definition of functions so a compare( |
https://en.wikipedia.org/wiki/Autonetics%20Recomp%20II | The Autonetics RECOMP II was a computer first introduced in 1958. It was made by the Autonetics division of North American Aviation.
It was attached to a desk that housed the input/output devices. Its desk integration made it a hands-on small system intended for the scientific and engineering computing market. The computer weighed about , including input-output.
Architecture
It had a 40-bit word size, 20-bit instruction size. Memory and registers were on a fixed head disk that operated like a drum memory—4080 words on standard tracks, 16 words on fast loop tracks, registers A, B, R, X each on their own high-speed loop track, and one prerecorded read only clock track.
It had a complete set of built-in floating point operations, including square root. Floating-point values used two words, one for the exponent and one for the fraction for a total of 80 bits.
Whereas the full 40-bit word was used for data, instructions were only 20 bits long and were stored two per word. Since indexing was commonly done by modifying the address part of an instruction (say, by adding one to access the next data item in a list), such instructions always had to be in the second half-word, and the first half-word was padded with a NOP instruction. Programmers also used these NOP instructions to provide space for future inserted instructions, since the assembler did not allow for use of symbolic addresses, and the insertion of a single instruction could otherwise require rewriting a lot of code.
The machine had a bit-serial architecture.
Punched paper tape was the external storage medium. The desk also had an electronic typewriter for printed output and a keyboard integrated with the system console to allow typed input and system control. Programs written in machine code could be input to the system from the console.
References
Further reading
External links
Autonetics RECOMP II documents On Bitsavers.org
Early computers
Computer-related introductions in 1958 |
https://en.wikipedia.org/wiki/MOR%20Music%20TV | MOR Music TV was an American cable television network that ran music videos 24 hours a day. However, as it played each music video, viewers had the opportunity to buy the album by calling a toll-free number in the same manner as the Home Shopping Network or QVC, and was offered to cable systems with the same revenue sharing opportunities for cable operators from album sales as HSN and QVC offered for item sales. The music ranged from light country to soft rock with no hard rock (let alone heavy metal) or rap music.
The network's name has a double meaning - "MOR" refers to both the word "more" as in "more music" but is also an acronym for "middle of the road", referring to its musical format of light AC and country songs.
The channel closed on August 31, 1997.
See also
List of defunct television networks in the United States
References
External links
MOR Music TV promo
MOR Music news articles
Defunct television networks in the United States
Music video networks in the United States
Shopping networks in the United States
Television channels and stations established in 1992
1992 establishments in the United States
Television channels and stations disestablished in 1997
1997 disestablishments in the United States |
https://en.wikipedia.org/wiki/Volvelle | A volvelle or wheel chart is a type of slide chart, a paper construction with rotating parts. It is considered an early example of a paper analog computer. Volvelles have been produced to accommodate organization and calculation in many diverse subjects. Early examples of volvelles are found in the pages of astronomy books. They can be traced back to "certain Arabic treatises on humoral medicine" and to the Persian astronomer, Abu Rayhan Biruni (c. 1000), who made important contributions to the development of the volvelle.
In the twentieth century, the volvelle had many diverse uses. In Reinventing the Wheel, author Jessica Helfand introduces twentieth-century volvelles with this:
The rock band Led Zeppelin employed a volvelle in the sleeve design for the album Led Zeppelin III (1970).
Two games from the game company Infocom included volvelles inside their package as "feelies": Sorcerer (1983) and A Mind Forever Voyaging (1985). Both volvelles served to impede copying of the games, because they contained information needed to play the game.
See also
E6B
Ramon Llull
Pop-up book
Slide chart
Zairja
References
Further reading
Eye, No. 41, Vol. 11, edited by John L. Walters, Quantum Publishing, Autumn 2001.
Lindberg, Sten G. "Mobiles in Books: Volvelles, Inserts, Pyramids, Divinations, and Children's Games". The Private Library, 3rd series 2.2 (1979): 49.
An exhibition of volvelles at New York's Grolier Club.
Analog computers
Astronomical instruments
Communication design
Graphic design |
https://en.wikipedia.org/wiki/WBCH-FM | WBCH-FM (100.1 FM) is a radio station licensed to Hastings, Michigan broadcasting a country music format.
Bronco Radio Network
WBCH is an affiliate of the Western Michigan University "Broncos Radio Network" and carries all of the Broncos football and men's hockey games.
References
Michiguide.com - WBCH-FM History
External links
BCH-FM
Country radio stations in the United States
Radio stations established in 1979
1979 establishments in Michigan |
https://en.wikipedia.org/wiki/System%20%28disambiguation%29 | A system is a set of entities, real or abstract, comprising a whole.
System may also refer to:
Science and technology
Biological system, a complex network of biological entities, for instance, a group of organs
Ecosystem, an entity comprising a large number of organisms and their environment
Energy system, an interpretation of the energy sector in system terms
Binary system (disambiguation), term is used for multiple purposes, such as:
Binary system (astronomy), a system of two celestial bodies on a mutual orbit
Star or stellar system, is a system of any multiple number of stars
Planetary system, gravitationally bound non-stellar objects in or out of orbit around a star or star system
Satellite system (astronomy), is a set of gravitationally bound non-planetary objects in orbit of a planetary mass object or minor planet, or its barycenter
Ring system, is a system of cosmic dust or moonlets, forming rings around, and gravitationally bound to a host non-stellar body.
Physical system, that portion of the physical universe chosen for analysis
Thermodynamic system, a body of matter and/or radiation, confined in space by walls, with defined permeabilities, which separate it from its surroundings
Systems science, an interdisciplinary field that studies the nature of complex systems in nature, society, and science
System (stratigraphy), a unit of the geologic record of a rock column
Systems engineering, a field about design, integration, and management of complex systems
System of equations, a set of mathematical equations
Computing
Computer system, the combination of hardware and software which forms a complete, working computer
Operating system
system, a C process control function in the C Standard Library used to execute subprocesses and commands
System (typeface), a raster font packaged with Microsoft Windows
Social science
Economic system, covering the production and distribution of goods and services
Social system, based on the interrelationships between individuals, groups, and institutions
Music
System (music notation), a collection of staves to be played simultaneously
System (Seal album), a 2007 album by Seal
"System", a song by Jonathan Davis on his 2007 album Alone I Play
"System", a song by Labelle on their 2008 album Back to Now
"System", a song by Reks on his 2009 album More Grey Hairs
System, a Danish electronic trio consisting of Anders Remmer, Jesper Skaaning, and Thomas Knak
System of a Down, an Armenian-American heavy metal band also known as "System"
Other uses
System (journal), a scientific journal
System (magazine)
When talking about plurality or multiplicity, "system" can be used to refer to all personas (or "headmates") present in a single body, taken together as a group.
See also
Classic Mac OS versions 1 through 7 were known as "System 1" through "System 7"
Meta-system, something composed of multiple smaller systems
The System (disambiguation)
Systematics (disambiguation)
Systema (disa |
https://en.wikipedia.org/wiki/Medivac%20%28TV%20series%29 | Medivac, an Australian television drama series, ran on Network Ten from 1996 to 1998. There were 48 episodes produced. Medivac is an abbreviation of the term medical evacuation. The series was also known as Adrenaline Junkies overseas. It is a cult program amongst King Island's LGBTIQ+ community.
Medivac was set in the emergency department of Brisbane's fictional Bethlehem West Hospital, where a dedicated medical team works in the demanding world of emergency medicine. The team specialises in the evacuation of disaster areas, journeying by helicopter to remote areas inaccessible by ambulance. They also work in the city streets and the suburbs involving themselves with the patients, their families and the police.
Cast
Nicholas Eadie as Dr. Red Buchanan
Geneviève Picot as Dr. Julia McAlpine
Graeme Blundell as Dr. Harry Edwards
Grant Bowler as Dr. Arch Craven
Rena Owen as Macy Fields, RN
Caroline Kennison as Gosia Maléski, RN
Eugene Gilfedder as Dr. Wayne Doubé
Danielle Carter as Bree Dalrymple, RN
Mark Constable as Dr. "Oopy" Hiltonwood
Lisa Forrest as Dr. Marina Zamoyski
Stephen Lovatt as Dr. Tom Shawcross
Dieter Brummer as Dr. Sean Michaels
Simone Kessell as Dr. Stella O'Shaughnessy
Melissa Tkautz as Evie Morrison RN
Sean Scully
Steve Jacobs
Locations
The former Australian Taxation Office building, at the corner of Wharf and Adelaide Streets in Brisbane, was used as the location of the hospital.
Also used old Brisbane domestic airport terminal area where the car auctions are for a scene set in western QLD.
Tarmac covered in dirt for it.
See also
List of Australian television series
References
External links
Australian Television Information Archive
|%20Number%3A664824%20|%20Number%3A664825;querytype=;resCount=10 Medivac at the National Film and Sound Archive
1990s Australian drama television series
Network 10 original programming
Australian medical television series
Television shows set in Queensland
1996 Australian television series debuts
1998 Australian television series endings
Television series by Beyond Television Productions |
https://en.wikipedia.org/wiki/Jaiku | Jaiku was a social networking, micro-blogging and lifestreaming service comparable to Twitter, founded a month before the latter. Jaiku was founded in February 2006 by Jyri Engeström and Petteri Koponen from Finland and launched in July of that year. It was purchased by Google on October 9, 2007.
When Jaiku Ltd was an independent company, its head office was in Helsinki.
History
Jaiku was created in February 2006 by Helsinki-based Jaiku Ltd. The founders of Jaiku chose the name because the posts on Jaiku resembled Japanese haiku. Also, the indigenous Sami people of Finland have traditionally shared stories by singing joiks.
On January 14, 2009, it was announced that Google would be open-sourcing the product but would "no longer actively develop the Jaiku codebase," instead leaving development to a "passionate volunteer team of Googlers". The financial terms of the deal were not released. It was said that the Jaiku team would also help Google on its upcoming G phone project. New user registrations were closed.
On March 12, 2009, Jaiku was re-launched on Google's App Engine platform and on March 13, 2009 the source code to JaikuEngine (the open source equivalent of the jaiku.com codebase) was released. The intent was to compete in the enterprise microblogging arena with a fully customizable microblogging offer.
On October 14, 2011, Google announced that Jaiku would be shut down by January 15, 2012. This announcement came around the same time Google shut down Google Buzz and iGoogle's social features.
On November 29, 2011, a group of former users launched Jaikuarchive.com – The Jaiku Presence archiver "to save an important part of our digital heritage." The original archive site shut down somewhere in 2014 and has since been offline.
As of February 2019, the domain led to an error page on Google's servers.
Software
Jaiku consisted of a website, a mobile website and a client application which acts as a replacement address book that runs on S60 phones.
Jaiku was compatible with Nokia S60 platform mobile devices through its Jaiku Mobile client software. The software allowed users to make posts through the software onto their Jaiku page. Jaiku released their API, which allowed programmers to make their own third party software components such as Feedalizr. One of the main differences between Jaiku and its competitor Twitter was Lifestream, an internet feed that shared users online activities utilizing other programs such as Flickr for photos, last.fm for music, and location by mobile phone. Since Jaiku became open-source, the Lifestream function was removed.
Features
Jaiku.com allowed users to post their thoughts, opinions, and comments in regards to their lives or any other subject. The posts that users created were called "Jaikus" and users had the option of making them publicly visible or private. The site allowed users to keep in touch and interact with friends either through the website, or through the mobile application.
See also
Iden |
https://en.wikipedia.org/wiki/Spektrum%20%28band%29 | Spektrum is a London-based house act consisting of:
Gabriel Olegavich (synths, programming and vocals), who was born in South East London and is based in Hackney;
Lola Olafisoye (vocals), from North London;
Isaac Tucker (drums) from New Zealand;
Teia Williams (bass), a Maori also from New Zealand.
The band had a No. 1 song on the UK Dance Chart in 2007, with the Dirty South remix of their 2004 track, "Kinda New". The same track had peaked at No. 70 on the UK Singles Chart in September 2004.
References
External links
SPEKTRUM - The Last Inhabited Place on Earth
Spektrum
British dance music groups |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.