source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/BDS%20C
|
BDS C (or the BD Software C Compiler) is a compiler for a sizeable subset of the C programming language, that ran on and generated code for the Intel 8080 and Zilog Z80 processors. It was the first C compiler for CP/M. It was written by Leor Zolman and first released in 1979 when he was 20 years old. "BDS" stands for "Brain Damage Software."
BDS C was popular and influential among CP/M users and developers. It ran much faster than other Z80-hosted compilers. It was possible to run BDS C on single-floppy machines with as little as 30K of RAM in comparison to most other commercial compilers which required many passes and the writing of intermediate files to disk.
Weak points of BDS C were that the floating point math routines and the file access functions were incompatible with the C compiler used on UNIX, and that its relocatable object files were incompatible with the Microsoft MACRO-80 assembler, making it more difficult to integrate C code with assembly language.
BDS C was bundled with a subset of the Unix system written in about 1980, called MARC (Machine Assisted Resource Coordinator). This effort in some ways resembled GNU, though MARC was to be able to run CP/M software through emulation. Unfortunately MARC's author, Ed Ziemba, perished in a snorkeling accident before he could complete the project.
In 2002, Leor Zolman released the 8080 assembly language source code for BDS C into the public domain.
Reception
Around 75,000 copies were sold, including a stripped down Japanese version.
A number of commercial CP/M products were written in the BDS C subset of the C language, including PeachText from PeachTree Software, MINCE and Scribble from Mark of the Unicorn, and most of the software in the Perfect Software suite including Perfect Writer, PerfectCalc, PerfectSpeller, and PerfectFiler (which suite was bundled with the Kaypro).
See also
Small-C
References
External links
BD Software download page
MUF Mastery - historical note about Leor Zolman and BDS C
Interview with Leor Zolman
BDS C Users Group
1979 software
C (programming language) compilers
CP/M software
Free compilers and interpreters
Formerly proprietary software
Public-domain software with source code
Assembly language software
|
https://en.wikipedia.org/wiki/List%20of%20computer%20algebra%20systems
|
The following tables provide a comparison of computer algebra systems (CAS). A CAS is a package comprising a set of algorithms for performing symbolic manipulations on algebraic objects, a language to implement them, and an environment in which to use the language. A CAS may include a user interface and graphics capability; and to be effective may require a large library of algorithms, efficient data structures and a fast kernel.
General
These computer algebra systems are sometimes combined with "front end" programs that provide a better user interface, such as the general-purpose GNU TeXmacs.
Functionality
Below is a summary of significantly developed symbolic functionality in each of the systems.
via SymPy
<li> via qepcad optional package
Those which do not "edit equations" may have a GUI, plotting, ASCII graphic formulae and math font printing. The ability to generate plaintext files is also a sought-after feature because it allows a work to be understood by people who do not have a computer algebra system installed.
Operating system support
The software can run under their respective operating systems natively without emulation. Some systems must be compiled first using an appropriate compiler for the source language and target platform. For some platforms, only older releases of the software may be available.
Graphing calculators
Some graphing calculators have CAS features.
See also
:Category:Computer algebra systems
Comparison of numerical-analysis software
Comparison of statistical packages
List of information graphics software
List of numerical-analysis software
List of numerical libraries
List of statistical software
Mathematical software
Web-based simulation
References
External links
Comparisons of mathematical software
Mathematics-related lists
|
https://en.wikipedia.org/wiki/Lambda%20lifting
|
Lambda lifting is a meta-process that restructures a computer program so that functions are defined independently of each other in a global scope. An individual "lift" transforms a local function into a global function. It is a two step process, consisting of;
Eliminating free variables in the function by adding parameters.
Moving functions from a restricted scope to broader or global scope.
The term "lambda lifting" was first introduced by Thomas Johnsson around 1982 and was historically considered as a mechanism for implementing functional programming languages. It is used in conjunction with other techniques in some modern compilers.
Lambda lifting is not the same as closure conversion. It requires all call sites to be adjusted (adding extra arguments to calls) and does not introduce a closure for the lifted lambda expression. In contrast, closure conversion does not require call sites to be adjusted but does introduce a closure for the lambda expression mapping free variables to values.
The technique may be used on individual functions, in code refactoring, to make a function usable outside the scope in which it was written. Lambda lifts may also be repeated, in order to transform the program. Repeated lifts may be used to convert a program written in lambda calculus into a set of recursive functions, without lambdas. This demonstrates the equivalence of programs written in lambda calculus and programs written as functions. However it does not demonstrate the soundness of lambda calculus for deduction, as the eta reduction used in lambda lifting is the step that introduces cardinality problems into the lambda calculus, because it removes the value from the variable, without first checking that there is only one value that satisfies the conditions on the variable (see Curry's paradox).
Lambda lifting is expensive on processing time for the compiler. An efficient implementation of lambda lifting is on processing time for the compiler.
In the untyped lambda calculus, where the basic types are functions, lifting may change the result of beta reduction of a lambda expression. The resulting functions will have the same meaning, in a mathematical sense, but are not regarded as the same function in the untyped lambda calculus. See also intensional versus extensional equality.
The reverse operation to lambda lifting is lambda dropping.
Lambda dropping may make the compilation of programs quicker for the compiler, and may also increase the efficiency of the resulting program, by reducing the number of parameters, and reducing the size of stack frames.
However it makes a function harder to re-use. A dropped function is tied to its context, and can only be used in a different context if it is first lifted.
Algorithm
The following algorithm is one way to lambda-lift an arbitrary program in a language which doesn't support closures as first-class objects:
Rename the functions so that each function has a unique name.
Replace each free
|
https://en.wikipedia.org/wiki/Ghee%20Hin%20Kongsi
|
The Ghee Hin Kongsi () was a secret society in Singapore and Malaya, formed in 1820. Ghee Hin literally means "the rise of righteousness" in Chinese and was part of the Hongmen overseas network. The Ghee Hin often fought against the Hakka-dominated Hai San secret society.
Ghee Hin was initially dominated by Cantonese people, although Hokkien people formed the majority by 1860. Teochew, Hainanese, and Hakka people formed smaller minorities. One of the major leaders of Ghee Hin was Chin Ah Yam, a Hakka peasant from rural Dabu County, Guangdong. The secret society was of Hongmen origin and set up to provide mutual aid and support for Chinese migrants, with the common aim of overthrowing the Qing dynasty and restoring the Ming. Their main lodge in Singapore was located on Lavender Street, and contained the ancestral tablets of important ex-members, before being donated to the Tan Tock Seng Hospital when it was torn down in 1892, following the "Suppression of Secret Societies Ordinance".
The Ghee Hin were notorious for committing mass killings of such targets as the Catholic Hakka ethnic group in 1850 (with approximately 500 casualties), and post office workers in 1876, due to their opposition to a new, more expensive monopoly on postage and remittances. The colonial government began to move towards surveillance, control, and finally suppression of Ghee Hin from the 1890s onwards. The Teochew people who belonged to the Ghee Hin secret society were massacred by the hundreds, if not thousands.
References
Lim, Irene. (1999) Secret societies in Singapore, National Heritage Board, Singapore History Museum, Singapore
External links
Ghee Hin — Encyclopædia Britannica
Secret societies in Singapore
Organized crime groups in Malaysia
Organised crime groups in Singapore
History of Perak
Triad groups
Chinese secret societies
Hokkien-language phrases
Teochew culture in Singapore
|
https://en.wikipedia.org/wiki/Real%20Programmers%20Don%27t%20Use%20Pascal
|
"Real Programmers Don't Use Pascal" (a parody of the bestselling 1982 tongue-in-cheek book on stereotypes about masculinity Real Men Don't Eat Quiche) is an essay about computer programming written by Ed Post of Tektronix, Inc., and published in July 1983 as a letter to the editor in Datamation.
History
Widely circulated on Usenet in its day, and well known in the computer software industry, the article compares and contrasts real programmers, who use punch cards and write programs in FORTRAN or assembly language, with modern-day "quiche eaters" who use programming languages such as Pascal which support structured programming and impose restrictions meant to prevent or minimize common bugs due to inadvertent programming logic errors. Also mentioned are feats such as the inventor of the Cray-1 supercomputer toggling in the first operating system for the CDC 7600 through the front panel without notes when it was first powered on.
The next year Ed Nather’s The Story of Mel, also known as The realest programmer of all, extended the theme. Immortalized in the piece is Mel Kaye of the Royal McBee Computer Corporation. As the story famously puts it, "He wrote in machine code—in 'raw, unadorned, inscrutable hexadecimal numbers. Directly.'"
Since then, the computer folklore term Real Programmer has come to describe the archetypical "hardcore" programmer who eschews the modern languages and tools of the day in favour of more direct and efficient solutions—closer to the hardware. The term is used in many subsequent articles, webcomics and in-jokes—although the alleged defining features of a "Real Programmer" differ with time and place.
See also
Pascal – early criticism
References
Notes
External links
Real Programmers Don't Use Pascal (full original)
Computer folklore
Pascal (programming language)
1983 essays
1983 in computing
Parodies of literature
|
https://en.wikipedia.org/wiki/Connection%20pool
|
In software engineering, a connection pool is a cache of database connections maintained so that the connections can be reused when future requests to the database are required.
Connection pools are used to enhance the performance of executing commands on a database. Opening and maintaining a database connection for each user, especially requests made to a dynamic database-driven website application, is costly and wastes resources. In connection pooling, after a connection is created, it is placed in the pool and it is used again so that a new connection does not have to be established. If all the connections are being used, a new connection is made and is added to the pool. Connection pooling also cuts down on the amount of time a user must wait to establish a connection to the database.
Applications
Web-based and enterprise applications use an application server to handle connection pooling. Dynamic web pages without connection pooling open connections to database services as required and close them when the page is done servicing a particular request. Pages that use connection pooling, on the other hand, maintain open connections in a pool. When the page requires access to the database, it simply uses an existing connection from the pool, and establishes a new connection only if no pooled connections are available. This reduces the overhead associated with connecting to the database to service individual requests.
Local applications that need frequent access to databases can also benefit from connection pooling. Open connections can be maintained in local applications that do not need to service separate remote requests like application servers, but implementations of connection pooling can become complicated. A number of available libraries implement connection pooling and related SQL query pooling, simplifying the implementation of connection pools in database-intensive applications.
Administrators can configure connection pools with restrictions on the numbers of minimum connections, maximum connections and idle connections to optimize the performance of pooling in specific problem contexts and in specific environments.
See also
Object pool pattern
References
External links
"Properly Handling Pooled JDBC Connections", blog post by Christopher Schultz
Database management systems
|
https://en.wikipedia.org/wiki/Alacritech
|
Alacritech was a Silicon Valley company which marketed "intelligent" network interface controllers (NICs) to offload TCP/IP processing from the CPU of computer systems to dedicated hardware on the NIC: a concept now known as a TCP offload engine (TOE). Later it manufactured storage network products. Alacritech's main products were the ANX 1500 series of network throughput acceleration appliances.
History
Alacritech was founded in 1997 by Larry Boucher, the author of the SCSI standard and founder of both Auspex Systems and Adaptec. The company's network interface cards (NICs) were promoted for enhanced performance by moving some TCP/IP processing from the CPU to the NIC. In 2004, Alacritech sued Microsoft and Broadcom for patent infringement. The suits were settled in 2005 with both companies agreeing to license the Alacritech patents.
In 2008 Alacritech decided that the TOE / NIC business was not sufficient to sustain a viably growing company, and changed its focus to leveraging this technology for accelerating of network attached storage (NAS), resulting in the development of the ANX series of appliances.
Appliances
The ANX 1500 throughput acceleration appliance supported TCP/IP, NFS, DHCP and 10GbE standards and features 48GB of DRAM and up to 4TB of solid state drives. The ANX 1500 caches active data stemming from client requests, such as frequent access of the same payload data or NFS metadata, and optimizes performance through the use of TCP and NFS Offload technology embedded in Alacritech's custom silicon. The ANX 1500 has a two-tiered caching system that provides record performance by accelerating READ and NFS metadata-intensive OPS, greatly reducing the burden on existing NAS devices, and enabling better WRITE performance and scalability. With a performance layer based on frequency of use, NFS OPS are maximized, resulting in reduced traffic on backend NAS servers, and a dramatic reduction in total IOPS required and storage drives needed from back-end storage.
The ANX 1500 accelerates NFS throughput and enhances the performance of existing NAS boxes. A single ANX 1500, with 4TB of SSDs, can deliver 120,000 NFS SPECsfs2008 operations per second (OPS) and an ORT of .92ms and only requires 1/5 of the NAS infrastructure otherwise required to deliver the comparable NFS OPS performance. The appliance allows enterprises to achieve significantly higher disk utilization, using 80 percent of available disk space, versus the current standard of 20 percent in performance environments.
Present operation
The company did not achieve sufficient sales of the ANX product line to sustain ongoing operations and development, and shut down manufacturing and development operations in November 2013. The company website currently notes that the ANX product line is no longer being manufactured, but provides links for support of existing installations. As of 2018 the company was in the business of licensing its technology.
References
External links
Alac
|
https://en.wikipedia.org/wiki/OpenIllusionist
|
The OpenIllusionist Project is a computer program for the rapid development of augmented reality applications.
OpenIllusionist provides software libraries to make easier the tasks of generating these images, performing the necessary computer vision tasks to interpret the user input, modelling the behaviour of any of the virtual objects (or 'agents'), and threading all of the above to provide the illusion of reality.
Explanation
Open Illusionist focuses on the area of virtually augmented environments (VAEs), where the augmentation is not worn but is instead inherently communal and environmental - most commonly by the use of a digital projector and some kind of video camera to cause some surface to appear to be populated by objects which can be manipulated physically by the user. These objects do not exist as anything other than projected computer graphics.
History
OpenIllusionist is closely connected with the Media Engineering Group (MEG) of the Department of Electronics at the University of York, UK - specifically the Visual Systems subgroup. This group was formed when John Robinson took up a professorship in the Department in 2000/2001, bringing with him a background in image coding and an interest in augmented reality.
This manifested itself in the work of three undergraduates - Dan Parnham, who experimented with the interpretation of the pose of a mannequin by the use of a single webcam focussed exclusively on the input side of the augmentation problem during his Master's degree, Sean O'Mahoney, who developed the first incarnation what would come to be termed PenPets as his Masters project, and Enrico Costanza, who developed a variety of tangible augmented interfaces using fiducials stuck to blocks of wood, with augmentation provided variously by audio feedback ("Audio d-Touch"), and a projector ("Magic Desk"). Much of Audio d-Touch was created by Enrico in his spare time as a personal project, (with collaboration from the aforementioned Robinson, and Simon Shelley, another York alumni) while the Magic Desk became his Masters project.
All of these projects fed into a collective culture in the group - with Justen Hyde, then a research student studying the reconstruction of human facial images, getting sucked into the work, making minor contributions to all of the projects, though officially working on none of them. The projects most often wheeled out to demonstrations were quickly established as PenPets (O'Mahoney) and d-Touch (Costanza) both of which had a strong commonality - they appeared to work by magic. The computer could be hidden from view, and the user could then simply interact with the augmentation directly. In the case of d-Touch, by moving marked blocks in front of a webcam to sample, edit and produce music with very low-cost paraphernalia - just a cheap microphone, printed fiducials and a standard PC. PenPets required more of a hardware overhead - a data projector pointed at a table. Onto this agents resembling mice were p
|
https://en.wikipedia.org/wiki/CherryPy
|
CherryPy is an object-oriented web application framework using the Python programming language. It is designed for rapid development of web applications by wrapping the HTTP protocol but stays at a low level and does not offer much more than what is defined in RFC 7231.
CherryPy can be a web server itself or one can launch it via any WSGI compatible environment. It does not deal with tasks such as templating for output rendering or backend access. The framework is extensible with filters, which are called at defined points in the request/response processing.
Pythonic interface
One of the goals of the project founder, Remi Delon, was to make CherryPy as pythonic as possible. This allows the developer to use the framework as any regular Python module and to forget (from a technical point of view) that the application is for the web.
For instance, the common Hello World program with CherryPy 3 would look like:
import cherrypy
class HelloWorld:
def index(self):
return "Hello World!"
index.exposed = True
cherrypy.quickstart(HelloWorld())
Features
CherryPy implements:
A HTTP/1.1-compliant, WSGI thread-pooled webserver. Typically, CherryPy itself takes only 1–2 ms per page.
Support for any other WSGI-enabled web server or adapter, including Apache, IIS, lighttpd, mod_python, FastCGI, SCGI, and mod_wsgi.
A native mod_python adapter.
Multiple HTTP servers (e.g. ability to listen on multiple ports).
A plugin system CherryPy plugins hook into events within the server process — into server startup, server shutdown, server exiting, etc. — to run code that needs to be run when the server starts up or shuts down.
Built-in tools for caching, encoding, sessions, authorization, static content, and others. CherryPy tools hook into events within the request process. Whenever the CherryPy server receives a request, there is a specific set of steps it goes through to handle that request. Page handlers are only one step in the process. Tools also provide a syntax and configuration API for turning them on and off for a specific set of handlers.
A configuration system for developers and deployers . CherryPy deployments are configurable on site, on application and on controller level, through Python dictionaries, configuration files, and open file objects.
A complete test suite for core functionality and associated framework which can be used to test CherryPy applications.
Built-in profiling since v2.1, coverage and testing support.
CherryPy doesn't force you to use a specific object-relational mapper (ORM), template language or JavaScript library.
Can be used with CherryPy
Routes — a Python re-implementation of the Ruby on Rails's routes system for mapping URLs to controllers/actions and generating URLs.
Object-relational mappers
SQLAlchemy — a database backend and ORM for Python applications. TurboGears 2.x uses CherryPy as server and SQLAlchemy as its default ORM.
SQLObject — a popular ORM for providing an object interface to a da
|
https://en.wikipedia.org/wiki/Susan%20Dumais
|
Susan Dumais (born August 11, 1953) is an American computer scientist who is a leader in the field of information retrieval, and has been a significant contributor to Microsoft's search technologies.
According to Mary Jane Irwin, who heads the Athena Lecture awards committee, “Her sustained contributions have shaped the thinking and direction of human-computer interaction and information retrieval."
Biography
Susan Dumais is a Technical Fellow at Microsoft and Managing Director of the Microsoft Research Northeast Labs, inclusive of MSR New England, MSR New York and MSR Montreal. She is also an Affiliate Professor at the University of Washington Information School.
Before joining Microsoft in 1997, Dumais was a researcher at Bellcore (now Telcordia Technologies), where she and her colleagues conducted research into what is now called the vocabulary problem in information retrieval. Their study demonstrated, through a variety of experiments, that different people use different vocabulary to describe the same thing, and that even choosing the "best" term to describe something is not enough for others to find it. One implication of this work is that because the author of a document may use different vocabulary than someone searching for the document, traditional information retrieval methods will have limited success.
Dumais and the other Bellcore researchers then began investigating ways to build search systems that avoided the vocabulary problem. The result was their invention of Latent Semantic Indexing.
Awards
In 2006, Dumais was inducted as a Fellow of the Association for Computing Machinery. In 2009, she received the Gerard Salton Award, an information retrieval lifetime achievement award. In 2011, she was inducted to the National Academy of Engineering for innovation and leadership in organizing, accessing, and interacting with information. In 2014, Dumais received the Athena Lecturer Award for "fundamental contributions to computer science.". and the Tony Kent Strix award for "sustained contributions that are both innovative and practical" with "significant impact".
In 2015, she was inducted into the American Academy of Arts and Sciences. In 2020 she received the SIGCHI Lifetime Research Award.
References
External links
Home page at Microsoft Research
Fellows of the Association for Computing Machinery
Microsoft employees
Microsoft Research people
Living people
American women computer scientists
American computer scientists
University of Washington faculty
Information retrieval researchers
Microsoft technical fellows
American women academics
1953 births
21st-century American women scientists
20th-century American women scientists
|
https://en.wikipedia.org/wiki/Jazz%20Jackrabbit%20%281994%20video%20game%29
|
Jazz Jackrabbit is a 1994 platform game developed and published by Epic MegaGames. It was released for MS-DOS-based computers. On November 30, 2017, the game was re-released on GOG.com along with Jazz Jackrabbit 2, with support for Windows, macOS, and Linux.
Gameplay
Jazz Jackrabbit is a 2D platform game. The game was originally divided into six episodes. Each episode has three planets, with every planet itself consisting of two levels. Each episode have an additional secret level (in the first you control bird Hip Hop and in later regular Jazz). The final level of every episode features a boss that the player must deal with in order to complete the level. Episodes are tied by a single storyline usually progressing after each episode is finished.
Gameplay mechanics in Jazz are very similar to Zools, with the exception of not being able to destroy the enemies by simply jumping at them (which was not added until the second game). Jazz will run faster and jump higher the longer he runs, avoiding chasms that might lead to harmful objects. Unlike other platform games, however, there are no abysses and every level bifurcates into subsections that might lead to valuable items (such as weapon pick-ups, score items, etc.) while the direction of general progression is hinted at with occasional arrows. Jazz has a life bar that changes in colour based on how much health Jazz has remaining. Jazz can withstand a limited number of hits (5 on Easy mode, 4 on Medium mode, 3 on Hard or Turbo mode) from harmful objects before losing a life; one hit's worth of health can be restored by picking up a carrot. Lives can also be accumulated to the maximum number of ten. When killed, Jazz starts from the level beginning or at any checkpoint sign that had been reached and shot before.
Items that the player can pick up usually resemble food, computer hardware components or other familiar shapes, and give 100 score points each. There are also several beneficial pick-ups in the game: a "force shield" that protects Jazz from one or four hits, a Hip Hop that shoots enemies, a hoverboard that allows flight, rapid fire/super jump bonuses, a temporary "speed-up" and invincibility, as well as extra lives. Weapons also vary in numbers and consistency and include (besides the Blaster) Bouncer, Toaster, RF Missile, and TNT sets. Large sets of ammunition can only be collected by being shot from their enclosure.
The first game has a timer that starts a number of minutes at the beginning of each level (9 minutes and 59 seconds on Easy mode, 8 minutes on Medium, 6 minutes on Hard, and 4 minutes on Turbo) and counts down to zero; on Hard and Turbo, another countdown appears at the top of the screen when there is less than a minute left, and if time expires, Jazz loses a life. If Jazz reaches and shoots the finish sign before time runs out, the player is then provided with additional score points awarded for the remaining time and a perfect score if he picks up all items and/or deals w
|
https://en.wikipedia.org/wiki/Sean%20Parker
|
Sean Parker (born December 3, 1979) is an American entrepreneur and philanthropist, most notable for co-founding the file-sharing computer service Napster, and serving as the first president of the social networking website Facebook. He also co-founded Plaxo, Causes, Airtime.com, and Brigade, an online platform for civic engagement. He is the founder and chairman of the Parker Foundation, which focuses on life sciences, global public health, and civic engagement. On the Forbes 2022 list of the world's billionaires, he was ranked No. 1,096 with a net worth of US$2.8 billion.
Early life
Parker was born in Herndon, Virginia, to Diane Parker, a TV advertising broker, and Bruce Parker, a U.S. government oceanographer and chief scientist at NOAA. When Parker was seven, his father taught him how to program on an Atari 800. Parker's father, who put his family before his entrepreneurial dreams, told Parker, "if you are going to take risks, take them early before you have a family." In his teens, Parker's hobbies were hacking and programming. One night, while hacking into the network of a Fortune 500 company, Parker was unable to log out after his father confiscated his computer keyboard. Because his IP address was exposed, FBI agents tracked down the 16-year-old. Since Parker was under 18, he was sentenced to community service.
Education
Parker attended Oakton High School in Fairfax County, Virginia for two years before transferring to Chantilly High School in 1996 for his junior and senior years. While there, Parker wrote a letter to the school administration and persuaded them to count the time he spent coding in the computer lab as a foreign language class. Consequently, towards the end of Parker's senior year at Chantilly, he was mostly writing code and starting companies. He graduated in 1998. While still in high school, he interned for Mark Pincus (who would later become the CEO of Zynga) at Pincus's Washington, DC startup FreeLoader. He won the Virginia state computer science fair for developing a web crawler, and was recruited by the FBI. By his senior year of high school, Parker was earning more than $80,000 a year through various projects, enough to convince his parents to allow him to skip college and pursue a career as an entrepreneur.
In his childhood, Parker was an avid reader, which was the beginning of his lifelong autodidacticism. Several media profiles refer to Parker as a genius. He considers his time at Napster to be his college education, calling it "Napster University", since he became well-versed in intellectual property law, corporate finance, and entrepreneurship.
Ventures
Napster
When Parker was 15, he met 14-year-old Shawn Fanning over the Internet, where the pair bonded over topics such as programming, theoretical physics and hacking. A few years later, Parker and Fanning, a student at Northeastern University, cofounded Napster, a free file-sharing service for music. Parker raised the initial $50,000, and they launched Nap
|
https://en.wikipedia.org/wiki/Analog%20Display%20Services%20Interface
|
Analog Display Services Interface (ADSI) is a telephony technology that is used in plain old telephone service (POTS) or computer-based private branch exchange (PBX) telephone service. It works in conjunction with a screen-based telephone ("screenphone") or other compatible customer-premises equipment (CPE) to provide the user with softkey access to telephone company or internal PBX custom calling features. It is an analog service because it uses analog frequency-shift keying (FSK) technology to interact with an LCD screen via short, low-baud rate, downloads to refresh and re-program softkeys in real-time.
The technology introduced in the United States and rolled out to Regional Bell Operating Companies (RBOCs) from Bellcore in April 1995, (very soon after the introduction of CLASS-based services through electronic switching system (ESS)), was marketed by the RBOCs who implemented it, as a way to streamline all available custom calling options through the use of a screen-based telephone; giving Residential and Small Business telephone subscribers PBX-like functionality at home or in small office/home office (SOHO) locations at a significantly lower cost. The service debuted before the onslaught of Personal Communications Service (PCS) and Voice over Internet Protocol (VoIP)-based telephony technologies became available and was originally slated to also work in conjunction with other types of services such as Enhanced Directory Assistance, telephone banking, movie theatre ticket sales, and other services that could interact with an LCD-screen.
Some of those services did become available later, though, not at the dramatic increase the US-based telephone companies had hoped. Canadian telephone companies such as Telus and Bell Canada, however, had much better luck implementing more ADSI-based services with other industries such as banking, and were still marketing the service actively as of 2005.
The service is marketed at telephone customers who subscribe to the majority of Custom Local Area Signaling Services (CLASS)-based services offered by their local telephone company (such as caller ID, Call Return, etc.) by the customization of a telephone capable of providing one-touch access to these features. This greatly increases customer usability by alleviating the need to memorize dialing codes such as *69.
Additionally, a few RBOCs introduced new features such as Call Waiting Deluxe and Message Waiting Indicator to work exclusively with ADSI telephones. The former being perhaps the most involved example of ADSI capabilities and the latter being an example of Visual FSK; another new technology available through CLASS.
The RBOCs who offer this service also restructured their billing of these services into value-based "packages" to stimulate customer interest.
Compatible equipment
U S West Communications, the first local RBOC to offer this service, marketed it as "Home Receptionist" service. Home Receptionist service included a Nortel Powertou
|
https://en.wikipedia.org/wiki/Nylon%20Angel
|
Nylon Angel is a postcyberpunk novel by science fiction author Marianne de Pierres
Plot summary
The story is set in post-apocalyptic Australia, around a city called the Tert. There, a bounty hunter/bodyguard named Parrish Plessis has ended up working for a ganglord called Jamon Mondo. She wants out, and her answer arrives in the form of two men wanted in connection with the killing of a journalist called Razz Retribution (In this world, the army, churches and the government have given up on the world, so it is now ruled by the media).
The story is divided between the Tert, a rundown slum reminiscent of Mega-City One, and Viva City (a pun on the word vivacity), a walled suburb some forty kilometres up the coast.
Adaptations
A role playing game based on the series has been created by White Mice Worldbuilding.
Notes
2004 novels
2004 science fiction novels
Australian science fiction novels
Postcyberpunk novels
Novels set in Australia
Orbit Books books
|
https://en.wikipedia.org/wiki/MOPAC
|
MOPAC is a popular computer program used in computational chemistry. It is designed to implement semi-empirical quantum chemistry algorithms, and it runs on Windows, Mac, and Linux.
MOPAC2016 is the current version. MOPAC2016 is able to perform calculations on small molecules and enzymes using PM7, PM6, PM3, AM1, MNDO, and RM1. The Sparkle model (for lanthanide chemistry) is also available. Academic users can use this program for free, whereas government and commercial users must purchase the software.
MOPAC was largely written by Michael Dewar's research group at the University of Texas at Austin. Its name is derived from Molecular Orbital PACkage, and it is also a pun on the Mopac Expressway that runs around Austin.
MOPAC2007 included the new Sparkle/AM1, Sparkle/PM3, RM1 and PM6 models, with an increased emphasis on solid state capabilities. However, it does not have yet MINDO/3, PM5, analytical derivatives, the Tomasi solvation model and intersystem crossing. MOPAC2007 was followed by the release of MOPAC2009 in 2008 which presents many improved features
The latest versions are no longer public domain software as were the earlier versions such as MOPAC6 and MOPAC7. However, there are recent efforts to keep MOPAC7 working as open source software. An open source version of MOPAC7 for Linux is also available. The author of MOPAC, James Stewart, released in 2006 a public domain version of MOPAC7 entirely written in Fortran 90 called MOPAC7.1.
See also
Semi-empirical quantum chemistry methods
AMPAC
Quantum chemistry computer programs
References
External links
MOPAC 2016 sales and support information
MOPAC 2002 Manual
MOPAC 2009 Manual
Source code and compiled binaries at the Computational Chemistry List repository:
Source code (in FORTRAN):
MOPAC 6
MOPAC 7
Compiled binaries:
MOPAC 6 for MS-DOS/Windows;
MOPAC 6 for Windows 95/NT;
MOPAC 6 with GUI (Winmostar)
MOPAC 7 for MS-DOS/Windows
MOPAC 7 for Linux
MOPAC 2009 for Linux Windows and Mac
MOPAC-5.022mn (MOPAC at the University of Minnesota)
Computational chemistry software
|
https://en.wikipedia.org/wiki/Kevin%20Spencer%20%28TV%20series%29
|
Kevin Spencer is a Canadian animated television series created by Greg Lawrence for CTV and The Comedy Network. The show is aimed at adult audiences, and takes its name from the main character, taking place in Ottawa, Ontario. It is based on the shorts of the same name that premiered on Mondo Media's flash cartoon site and CTV in 1999. It also aired on Burly Bear Network and Spike TV in the US.
Plot and characters
The show revolves around the everyday happenings of the Spencer family. Kevin himself is a 16-year-old, sociopathic juvenile delinquent addicted to alcohol and tobacco. He lives with his parents, whom he often shows ambivalence towards, and is a student at a local high school, although he rarely attends school. It is demonstrated many times throughout the series that Kevin is mentally unstable, as he is prone to random outbursts of violence, even towards himself, shows signs of insanity, and has a complete disregard for life, including his own. It is also shown that Kevin is probably mentally challenged, as he often has difficulties with performing the simplest of tasks, such as making himself a bowl of cereal, forgetting what he was talking about the instant after saying something, or even realizing that he was hungry, yet at times throughout the series, makes very well-articulated statements about certain aspects of society, culture, politics, and education, possibly indicating Kevin is a savant. Throughout the series, Kevin almost never speaks, aside from during dream sequences and occasional one-sentenced outbursts. Instead, the show's narrator (voiced by Lawrence) speaks for Kevin; that is, he describes what Kevin is saying, thinking, and how Kevin reacts to the world around him.
His parents, Anastasia (voiced by Thomasin Langlands) and Percy (voiced by Lawrence), are also alcoholic, cough syrup-addicted chain-smokers. Both are crude, overweight, unattractive and extraordinarily stupid people who live off of welfare. Both parents neglect or otherwise use Kevin for their own selfish gains, and both show clear signs of sociopathic tendencies. Neither parent is faithful to the other, and Anastasia in particular is highly promiscuous. Their antics usually involve attempting to gain money or alcohol through illegal acts, which quite randomly succeed or fail. While both parents primarily show hatred and disgust towards one another, both occasionally demonstrate a small degree of lust for each other, though these moments rarely last longer than a scene of an episode.
Another frequent character in the show is Kevin's imaginary friend, Allen the Magic Goose (voiced by Mike Wetmore). Allen often encourages Kevin's sociopathic nature, noally asking him to do illegal, indecent, and/or dangerous things simply for the sake of the thrill or for vengeance. However, Kevin, being a sociopath, often shows ambivalence towards Allen, sometimes threatening or intimidating the bird. During such times, Allen often reminds Kevin of the futility of these
|
https://en.wikipedia.org/wiki/List%20of%20impact%20craters%20on%20Earth
|
This list of impact craters on Earth contains a selection of the 190 confirmed craters given in the Earth Impact Database as of 2017.
To keep the lists manageable, only the largest craters within a time period are included. Alphabetical lists for different continents can be found under Craters by continent below.
Confirmed impact craters listed by size and age
These features were caused by the collision of meteors (consisting of large fragments of asteroids) or comets (consisting of ice, dust particles and rocky fragments) with the Earth. For eroded or buried craters, the stated diameter typically refers to the best available estimate of the original rim diameter, and may not correspond to present surface features. Time units are either in ka (thousands) or Ma (millions) of years.
10 ka or less
Less than ten thousand years old, and with a diameter of or more. The EID lists fewer than ten such craters, and the largest in the last 100,000 years (100 ka) is the Rio Cuarto crater in Argentina. However, there is some uncertainty regarding its origins and age, with some sources giving it as < 10 ka while the EID gives a broader < 100 ka.
The Kaali impacts (c. 1500 BC) during the Nordic Bronze Age may have influenced Estonian and Finnish mythology, the Campo del Cielo (c. 2500 BC) could be in the legends of some Native American tribes, while Henbury (c. 2700 BC) has figured in Australian Aboriginal oral traditions.
For the Rio Cuarto craters, 2002 research suggests they may actually be aeolian structures. The EID gives a size of about for Campo del Cielo, but other sources quote .
10 ka to 1 Ma
From between 10 thousand years and one million years ago, and with a diameter of less than :
From between ten thousand years and one million years ago, and with a diameter of or more. The largest in the last one million years is the Zhamanshin crater in Kazakhstan and has been described as being capable of producing a nuclear-like winter.
However, the currently unknown source of the enormous Australasian strewnfield (c. 780 ka) could be a crater about across.
1 Ma to 10 Ma
From between 1 and 10 million years ago, and with a diameter of 5 km or more. If uncertainties regarding its age are resolved, then the largest in the last 10 million years would be the Karakul crater which is listed in EID with an age of less than 5 Ma, or the Pliocene. The large but apparently craterless Eltanin impact (2.5 Ma) into the Pacific Ocean has been suggested as contributing to the glaciations and cooling during the Pliocene.
10 Ma or more
Craters with diameter or more are all older than 10 Ma, except possibly Karakul, , whose age is uncertain.
There are more than forty craters of such size. The largest two within the last hundred million years have been linked to two extinction events: Chicxulub for the Cretaceous–Paleogene and the Popigai impact for the Eocene–Oligocene extinction event.
Craters by continent
, the Earth Impact Database (EID) contains 190 confi
|
https://en.wikipedia.org/wiki/Execute%20in%20place
|
In computer science, execute in place (XIP) is a method of executing programs directly from long-term storage rather than copying it into RAM. It is an extension of using shared memory to reduce the total amount of memory required.
Its general effect is that the program text consumes no writable memory, saving it for dynamic data, and that all instances of the program are run from a single copy.
For this to work, several criteria have to be met:
The storage must provide a similar interface to the CPU as regular memory (or an adaptive layer must be present).
This interface must provide sufficiently fast read operations with a random access pattern.
The file system, if one is used, needs to expose appropriate mapping functions.
The program must either be linked to be aware of the address the storage appears at in the system or be position-independent.
The program must not modify data within the loaded image.
The storage requirements are usually met by using NOR flash memory or EEPROM, which can be addressed as individual words for read operations, although it is a bit slower than normal system RAM in most setups.
XIP during boot load
Typically, the First Stage Boot Loader is an XIP program that is linked to run at the address at which the flash chip(s) are mapped at power-up and contains a minimal program to set up the system RAM (which depends on the components used on the individual boards and cannot be generalized enough so that the proper sequence could be embedded into the processor hardware) and then loads the second stage bootloader or the OS kernel into RAM.
During this initialization, writable memory may not be available, so all computations have to be performed within the processor registers. For this reason, first stage boot loaders tend to be written in assembly language and only do the minimum to provide a normal execution environment for the next program. Some processors either embed a small amount of SRAM in the chip itself, or allow using the onboard cache memory as RAM, to make this first stage boot loader easier to write using high-level language.
For a kernel or bootloader, address space generally is assigned internally, so in order to use XIP for them, it is sufficient to instruct the linker to place unmodifiable and modifiable data in different address ranges and provide a mechanism for the modifiable data to be copied to writable memory before any code is run that assumes that data can be accessed normally. This can be done as part of the previous stage, or within a small code segment at the beginning of the program.
If address space is assigned externally, such as in an application program that is run on a system that does not provide virtual memory, the compiler needs to access all modifiable data by adding an offset to a pointer to a private copy of the data area. In this case, the external loader is responsible for setting up the instance specific memory areas.
BIOS and UEFI use XIP to initialize the main memo
|
https://en.wikipedia.org/wiki/Data%20%28computer%20science%29
|
In computer science, data (treated as singular, plural, or as a mass noun) is any sequence of one or more symbols; datum is a single symbol of data. Data requires interpretation to become information. Digital data is data that is represented using the binary number system of ones (1) and zeros (0), instead of analog representation. In modern (post-1960) computer systems, all data is digital.
Data exists in three states: data at rest, data in transit and data in use. Data within a computer, in most cases, moves as parallel data. Data moving to or from a computer, in most cases, moves as serial data. Data sourced from an analog device, such as a temperature sensor, may be converted to digital using an analog-to-digital converter. Data representing quantities, characters, or symbols on which operations are performed by a computer are stored and recorded on magnetic, optical, electronic, or mechanical recording media, and transmitted in the form of digital electrical or optical signals. Data pass in and out of computers via peripheral devices.
Physical computer memory elements consist of an address and a byte/word of data storage. Digital data are often stored in relational databases, like tables or SQL databases, and can generally be represented as abstract key/value pairs. Data can be organized in many different types of data structures, including arrays, graphs, and objects. Data structures can store data of many different types, including 01677877777, strings and even other data structures.
Characteristics
Metadata helps translate data to information. Metadata is data about the data. Metadata may be implied, specified or given.
Data relating to physical events or processes will have a temporal component. This temporal component may be implied. This is the case when a device such as a temperature logger receives data from a temperature sensor. When the temperature is received it is assumed that the data has a temporal reference of now. So the device records the date, time and temperature together. When the data logger communicates temperatures, it must also report the date and time as metadata for each temperature reading.
Fundamentally, computers follow a sequence of instructions they are given in the form of data. A set of instructions to perform a given task (or tasks) is called a program. A program is data in the form of coded instructions to control the operation of a computer or other machine. In the nominal case, the program, as executed by the computer, will consist of machine code. The elements of storage manipulated by the program, but not actually executed by the central processing unit (CPU), are also data. At its most essential, a single datum is a value stored at a specific location. Therefore, it is possible for computer programs to operate on other computer programs, by manipulating their programmatic data.
To store data bytes in a file, they have to be serialized in a file format. Typically, programs are stored in special
|
https://en.wikipedia.org/wiki/The%20Carol%20Duvall%20Show
|
The Carol Duvall Show is an arts and crafts show which aired on the HGTV cable channel from 1994 to 2005 hosted by Carol Duvall. It was also broadcast on the DIY Network from 2005 until late-2009. Recordings of segments from the show can be viewed on their website.
The show is devoted to demonstrating and teaching a wide variety of crafts from very basic "cut and glue" projects to intricate polymer clay creations. Duvall's program was one of the original offerings on the newly founded Home & Garden Television network in 1994, and it has remained one of the lifestyle network's most popular shows throughout its 12-year run. She introduced many polymer clay artists to the community including Judy Belcher, Maureen Carlson, Kim Cavender, Katherine Dewey, Emi Fukushima, Syndee Holt, Debbie Jackson, Donna Kato, Barbara McGuire, Ann Mitchell, Karen Mitchell, Becky Meverden, Lisa Pavelka, Gail Ritchey, Nan Roche, Michelle Ross, and Bob Wiley who have inspired countless polymer enthusiasts.
The show also featured interviews with crafters and fine artists - painters, sculptors, glass-blowers, etc. with footage of them at work in their studios.
The cancellation of the show on HGTV caused dismay among many of her fans; whose protests might have influenced the decision to continue broadcasting it on the DIY Network (owned by the same parent company Scripps Networks).
References
Sources
The Carol Duvall Show
Carol Duvall Balances Her Life
HGTV original programming
1994 American television series debuts
2005 American television series endings
Arts and crafts television series
|
https://en.wikipedia.org/wiki/Internet%20Adult%20Film%20Database
|
The Internet Adult Film Database (IAFD) is an online database of information pertaining the pornography industry: actors, actresses, directors, studios, distributors and pornographic films.
History
The predecessor to IAFD was email- and FTP-accessible database of adult film actresses called Abserver that had been created by Dan Abend in 1993.
IAFD was started by Peter van Aarle, who had collected data on adult movies since 1981, when he began keeping notes on index cards on adult movies he had seen or were reviewed in Adam Film World. In 1993, he began contributing to the Usenet newsgroup alt.sex.movies, where he met Dan Abend. The two exchanged databases and began work on a WWW-based database.
Van Aarle later collaborated on this Web database with Ron Wilhelm, who went by the pseudonym of "Heretic". The first version of the IAFD was brought on-line in 1995 by the programming efforts of Wilhelm, who used the project as a training ground for SGML programming which he was learning in college. After Wilhelm left the Internet to join the military, the site eventually fell victim to link rot.
In the fall of 1998, Van Aarle was at a trade show with Jeff Vanzetti, who asked if Van Aarle would be interested in resurrecting the IAFD — this time under its own domain. Vanzetti was looking for a project on which to teach himself on-line database programming using SQL Server, and this seemed like a natural fit, since they were both co-moderators of the newsgroup rec.arts.movies.erotica (RAME), and members of the newsgroup would often lament about the passing of the original Internet Adult Film Database.
The beginning of 1999 brought the first steps towards the relaunch of the IAFD. Initially, search boxes only searched females, and data was restricted to movies released post-1989.
Van Aarle said on this:
In those early days of the IAFD I had made one stipulation: I did not want the movie info on movies before 1989 to be available. The idea behind this was basically that if I would ever decide I wanted to do something commercially with my database it would be a good idea to keep the most valuable parts of it off limits. The data on older titles was clearly the most difficult to compile (and very few people I ever talked to had much info on the older stuff, with a few notable exceptions like Jim Holliday), and therefore the more valuable part of the data. The cut-off date of 1989 was a compromise to include at least the titles of Buttman, who was one of the most popular directors of the time.
Van Aarle died on September 18, 2005, at the age of 42 from a heart attack. In 2011, he was inducted into the XRCO Hall of Fame.
On March 1, 2007, the IAFD rolled out information on over 18,000 gay titles and some 39,000 gay performers.
According to Vanzetti, IAFD adds about 500 new titles a month and processes thousands of corrections—corrections that anyone can submit for review. IAFD takes user corrections though forms on the site. The forms are not automated
|
https://en.wikipedia.org/wiki/LSR
|
LSR may refer to:
Computing
Label switch router, a type of router located in the middle of an MPLS network
Lego Stunt Rally, a video game
Link-state routing protocol, one of the two main classes of routing protocols used in packet switching networks
Linux Screen Reader, a free and open source assistive technology of the GNOME desktop environment
Logical shift right, a type of logical shift operator used in some computer languages
Loose Source Routing, an IP routing option used for mobility in IP networks
Link state request, a type of OSPF protocol message
Organizations
LSR Group, one of Russia's largest construction firms
Lady Shri Ram College for Women, a university in Delhi, India
League for Socialist Reconstruction, a DeLeonist political organization in the United States
League for Social Reconstruction, a socialist think-tank in Canada which ran from 1931 to 1942
Leeds Student Radio, a student radio station based in Leeds
Liberdade, Socialismo e Revolução, a Brazilian socialist organization
Life Sciences Research, the U.S. incorporation of Huntingdon Life Sciences
LifeRing Secular Recovery, an addiction recovery support group
Freedom of Russia Legion (Legion "Svoboda Rossii")
Sciences
Local standard of rest, a frame of reference for motion of matter in the Milky Way galaxy proximate to the Sun
Land speed record, the record for highest speed by a land vehicle
Liquid silicone rubber, a form of silicone rubber
Lipolysis-stimulated lipoprotein receptor
Other
LSR (sniper rifle), a Pakistani sniper rifle
Local storm report, a product issued by the U.S. National Weather Service
A type of equipment on the Israel television show HaShminiya
|
https://en.wikipedia.org/wiki/Red%20Metropolitana%20de%20Movilidad
|
Red Metropolitana de Movilidad (English: Metropolitan Mobility Network; named Transantiago until March 2019) is a public transport system that serves Santiago, the capital of Chile. It is considered the most ambitious transport reform undertaken by a developing country according to the World Resources Institute.
The system, largely influenced by Bogotá, Colombia's TransMilenio and Curitiba, Brazil's RIT, was introduced on February 10, 2007. It standardized bus routes and eliminated redundancy of same; redundancies were commonplace in the old system, which was run by thousands of independent bus operators. The system combines local (feeder) bus lines, main bus lines and the Metro (subway) network. It includes an integrated fare system, which allows passengers to make bus-to-bus or bus-to-metro transfers for the price of one ticket, using a single contactless smart card.
Transantiago's implementation was problematic, as the decreased bus fleet and the newer routes have proved insufficient to properly serve a population inadequately informed of pending changes. The major complaints are the lack of buses and their inconsistent frequencies, missing or poor infrastructure (such as segregated corridors, prepaid areas and bus stops), the network's coverage, and the number of transfers needed for longer trips. As a result, users have overcrowded the Metro, which is generally held to be fast and dependable.
Details
Transantiago's first stage of implementation began on October 22, 2005, when a group of ten new companies took control of the capital's bus system, immediately introducing 1,181 new, modern low-floor buses (approximately half of them being articulated) made by Volvo in Brazil, replacing 461 yellow-colored buses from the old system. The new buses will temporarily run alongside the over 7,000 existing older buses that will be gradually removed from the system until 2010. In October 2006, a users' information system was introduced.
Transantiago became fully operational on February 10, 2007, with the introduction of a new route system dividing bus lines into two complementary groups: main and local lines. In addition, a new fare structure was implemented, allowing transfers at small or zero fares between buses and metro, when using the new contactless smartcard. 1,776 new buses will operate at this stage. The older yellow-colored (now painted over) buses will only operate through the secondary local lines in conjunction with new but simpler buses. It is expected that by 2010, the older buses will be completely replaced by over 4,600 new vehicles.
Objectives
Encouraging the use of public transport
Enhancing the quality of public transport, eliminating the on-the-street competition and replacing the existing bus fleet
Palliating the city's high air and sound pollution levels by reducing the number of buses from over 7,000 to about 4,600, and by reducing the emission levels of the buses
Reducing travel times
New lines structure
Bus services we
|
https://en.wikipedia.org/wiki/Xming
|
Xming is an X11 display server for Microsoft Windows operating systems, including Windows XP and later.
Features
Xming provides the X Window System display server, a set of traditional sample X applications and tools, as well as a set of fonts. It features support of several languages and has Mesa 3D, OpenGL, and GLX 3D graphics extensions capabilities.
The Xming X server is based on Cygwin/X, the X.Org Server. It is cross-compiled on Linux with the MinGW compiler suite and the Pthreads-Win32 multi-threading library. Xming runs natively on Windows and does not need any third-party emulation software.
Xming may be used with implementations of Secure Shell (SSH) to securely forward X11 sessions from other computers. It supports PuTTY and ssh.exe, and comes with a version of PuTTY's plink.exe. The Xming project also offers a portable version of PuTTY. When SSH forwarding is not used, the local file Xn.hosts must be updated with host name or IP address of the remote machine where the GUI application is started.
The software has been recommended by authors of books on free software when a free X server is needed, and described as simple and easier to install though less configurable than other popular free choices like Cygwin/X.
Transition to proprietary license
Since May 2007, payment must be made to download new releases. Purchasing a license will allow the user access to new downloads for one year; however, MIT-licensed releases (referred to by the author as "public domain" releases) can still be downloaded with no payment on SourceForge.
See also
Cygwin/X
Notes
References
External links
Public-domain software with source code
X servers
|
https://en.wikipedia.org/wiki/Small%20form%20factor%20%28desktop%20and%20motherboard%29
|
Small form factor (abbreviated: SFF) is a term used for desktop computers and for some of its components, chassis and motherboard, to indicate that they are designed in accordance with one of several standardized computer form factors intended to minimize the volume and footprint of a desktop computer compared to the standard ATX form factor .
For comparison purposes, the size of an SFF case is usually measured in litres. SFFs are available in a variety of sizes and shapes, including shoeboxes, cubes, and book-sized PCs. Their smaller and often lighter construction has made them popular as home theater PCs and as gaming computers for attending LAN parties. Manufacturers also emphasize the aesthetic and ergonomic design of SFFs since users are more likely to place them on top of a desk or carry them around. Advancements in component technology together with reductions in size means a powerful computer is no longer restricted to the huge towers of old.
Small form factors do not include computing devices that have traditionally been small, such as embedded or mobile systems. However, "small form factor" lacks a normative definition and is consequently open to interpretation and misuse. Manufacturers often provide definitions that serve the interests of their products. According to marketing strategy, one manufacturer may decide to mark their product as "small form factor" while other manufacturers are using different marketing name (such as "Minitower", "Microtower" or "Desktop") for personal computers of similar or even smaller footprint.
History
The acronym SFF originally stood for "Shuttle Form Factor," describing shoebox-sized personal computers with two expansion slots. The meaning of SFF evolved to include other, similar PC designs from brands such as AOpen and First International Computer, with the word "Small" replacing the word "Shuttle".
The term SFF is used in contrast with terms for larger systems such as "mini-towers" and "desktops."
Features
Small form factor computers are generally designed to support the same features as modern desktop computers, but in a smaller space. Most accept standard x86 microprocessors, standard DIMM memory modules, standard 8.9 cm (3.5") hard disks, and standard 13.3 cm (5.25") optical drives.
However, the small size of SFF cases may limit expansion options; many commercial offerings provide only one 8.9 cm (3.5") drive bay and one or two 13.3 cm (5.25") external bays. Standard CPU heatsinks do not always fit inside an SFF computer, so some manufacturers provide custom cooling systems. Though limited to one or two expansion cards, a few have the space for -length cards such as the GeForce GTX-295. Most SFF computers use highly integrated motherboards containing many on-board peripherals, reducing the need for expansion cards. As of 2020 many SFF PC cases do not include any expansion bays larger than 2.5 inches (large enough to accommodate SATA SSDs), due to the declining popularity of optical disc dri
|
https://en.wikipedia.org/wiki/CVN
|
CVN may refer to:
Cohen Veterans Network, a not for profit series of mental health clinics for veterans and military families.
Central Venous Nutrition, in parenteral nutrition
Cable Value Network, a 1980s cable shopping channel, purchased in 1989 by QVC
Charpy V-notch Number (Charpy Energy), the output of a Charpy impact test
Card Verification Number for credit cards (3 or 4 digits on the back or front of the card)
Courtroom View Network, a media company that webcasts trials
The constellation Canes Venatici, CVn, standard astronomical abbreviation
CVN (Carrier, Volplane, Nuclear), a United States Navy hull classification symbol for nuclear aircraft carriers
Crime Victim Notification (computerised system)
Countervandalism Network, a network of volunteers dedicated to reducing vandalism on Wikimedia Foundation wikis
Clovis Municipal Airport, an airport located in Clovis, New Mexico with IATA code CVN
Chinese VLBI Network, a network of large antennas and part of European VLBI Network
|
https://en.wikipedia.org/wiki/Tunisia%20Monitoring%20Group
|
The Tunisia Monitoring Group (IFEX-TMG) is a coalition of 21 free-expression organisations that belong to the International Freedom of Expression Exchange (IFEX), a global network of non-governmental organisations that promotes and defends the right to freedom of expression and freedom of the press.
The IFEX-TMG monitors free expression violations in Tunisia and works to raise international awareness of censorship in the country. In the lead-up to, and during, the November 2005 World Summit on the Information Society (WSIS), the IFEX-TMG called attention to Tunisia's failure to respect international human rights standards as the summit's host.
In the years running up to and during the Arab Spring, and the immediate months after, the chairman spokesman and chief fundraiser of the IFEX-TMG was Rohan Jayasekera, then Associate Editor of Index on Censorship. He was succeeded in 2012 by Virginie Jouan of the World Association of Newspapers who remained in post until IFEX wound up the group in late 2012.
April 2011 IFEX-TMG mission to Tunisia
A mission carried out in April 2011 post-revolution took place in an entirely different context. In stark contrast to previous missions, the delegation of seven IFEX-TMG member groups was able to meet and talk openly with civil society groups, human rights activists, journalists, bloggers and representatives from across the political spectrum. The work of the IFEX-TMG in consistently raising freedom of expression issues both inside Tunisia and on the international stage during the country's darkest years was widely praised, while opinions on how the transition process is unfolding were freely given. A full report is being issued on 1 June 2011.
Previous fact-finding missions to Tunisia
April/May 2010
"Tunisia needs a truly independent judiciary to reverse its worsening record on human rights and treatment of prisoners of opinion." This is a key conclusion of the latest IFEX-TMG mission to Tunisia in April/May 2010.
It draws from research and interviews during the IFEX-TMG's seventh mission to Tunisia, conducted between 25 April and 6 May 2010. The IFEX-TMG found that there had been a significant deterioration of human rights in Tunisia since the last IFEX-TMG mission in 2007.
The report records a number of recurring cases of harassment, surveillance, and imprisonment of journalists and human rights activists some of whom have been detained in harsh conditions, physically harassed and dismissed from their jobs. Others have been denied their rights to communicate and move freely. The report culminates with 18 specific recommendations for change.
A pot-pourri of administrative sanctions used to limit free expression and exert indirect pressure on journalists and human rights defenders are also addressed. These include denying licences to independent and opposition media, the harassment of critical journalists and human rights defenders and the confiscation of publications.
Another chapter analyses the tacti
|
https://en.wikipedia.org/wiki/Skating%20on%20Thin%20Ice
|
Skating on Thin Ice was a short-lived Australian celebrity reality television programme broadcast on the Nine Network in 2005. Hosted by Jamie Durie, nine celebrities learnt to skate with the ultimate goal being to perform with Disney on Ice, with proceeds going toward children's charity, CanTeen.
Nine revived the concept more successfully in 2006 as Torvill and Dean's Dancing on Ice, also hosted by Durie.
Contestants
The celebrities included:
Deni Hines – singer
Kim Kilbey – presenter
Imogen Bailey – model
James Blundell – singer
Belinda Green – former beauty queen
Regina Bird – Big Brother 3 winner
Vince Sorrenti – comedian
David Whitehill – presenter of Hot Source
Peter Everett – presenter and home designer
See also
List of Australian television series
List of Nine Network programs
References
External links
2000s Australian reality television series
Nine Network original programming
Figure skating on television
2005 Australian television series debuts
2005 Australian television series endings
|
https://en.wikipedia.org/wiki/Ambient%20lighting
|
Ambient lighting may refer to:
Available light in an environment
Low-key lighting, a photographic technique using a single key light
A type of lighting in computer graphics
See also
Ambient light sensor
Ambiance lighting, lighting for mood
|
https://en.wikipedia.org/wiki/Gang%20scheduling
|
In computer science, gang scheduling is a scheduling algorithm for parallel systems that schedules related threads or processes to run simultaneously on different processors. Usually these will be threads all belonging to the same process, but they may also be from different processes, where the processes could have a producer-consumer relationship or come from the same MPI program.
Gang scheduling is used to ensure that if two or more threads or processes communicate with each other, they will all be ready to communicate at the same time. If they were not gang-scheduled, then one could wait to send or receive a message to another while it is sleeping, and vice versa. When processors are over-subscribed and gang scheduling is not used within a group of processes or threads which communicate with each other, each communication event could suffer the overhead of a context switch.
Gang scheduling is based on a data structure called the Ousterhout matrix. In this matrix each row represents a time slice, and each column a processor. The threads or processes of each job are packed into a single row of the matrix. During execution, coordinated context switching is performed across all nodes to switch from the processes in one row to those in the next row.
Gang scheduling is stricter than coscheduling. It requires all threads of the same process to run concurrently, while coscheduling allows for fragments, which are sets of threads that do not run concurrently with the rest of the gang.
Gang scheduling was implemented and used in production mode on several parallel machines, most notably the Connection Machine CM-5.
Types
Bag of gangs (BoG)
In gang scheduling, one to one mapping happens, which means each task will be mapped to a processor. Usually, jobs are considered as independent gangs, but with a bag of gangs scheme, all the gangs can be combined and sent together to the system. When jobs are executed in the system, the execution can never be completed until and unless all the gangs that belong to the same BoG complete their executions. Thus, if one gang belonging to some job completes its execution, it will have to wait until all the gangs complete their executions. This leads to increased synchronization delay overhead.
Response time of Bag of Gangs is defined as the time interval from the arrival of the BoG at the grid dispatcher to the completion of jobs of all of the sub-gangs which belong to the BoG. The average response time is defined as follows:
Response Time (RT)=.
The response time is further affected when a priority job arrives. Whenever a priority job arrives at the system, that job will be given priority with respect to all other jobs, even over the ones which are currently being executed on the processors. In this case, when a priority job arrives, the sub-gang which is currently executing on the system will be stopped and all the progress that has been made will be lost and need to be redone. This interruption of the job
|
https://en.wikipedia.org/wiki/MIL-STD-6011
|
TADIL-A/Link 11 is a secure half-duplex tactical data link used by NATO to exchange digital data. It was originally developed by a joint committee including members from the Royal Canadian Navy, US Navy and Royal Navy to pass accurate targeting information between ships. The final standard was signed in Ottawa in November 1957, where the British proposed the name "TIDE" for "Tactical International Data Exchange". It was later made part of the NATO STANAG standardization process.
The system operates on two frequencies, one in the high frequency (HF) range for over-the-horizon (OTH) communications, and another in the ultra high frequency (UHF) range that uses much smaller antennas and is suitable for smaller ships but lacks the OTH performance. The system broadcasts packets of 30 bits length, with 6 bits of error correction and 24 bits of payload data. The payload is encrypted.
Link 14 was adopted at the same time as a low-end counterpart to Link 11. Link 14 is essentially a digital teleprinter system lacking encryption and automation, intended for ships lacking the ability to use Link 11 data in an automated fashion.
The designation "Link 11" is derived from "Link II", the British designation using Roman numerals before NATO standardized on Arabic numerals. "Link I" was the data link used by the Comprehensive Display System.
Overview
MIL-STD-6011 exchanges digital information among airborne, land-based, and shipboard tactical data systems. It is the primary means to exchange data such as radar tracking information beyond line of sight. TADIL-A can be used on either high frequency (HF) or ultrahigh frequency (UHF). However, the U.S. Army uses only HF. Link 11 relies on a single platform to report positional information on sensor detections. This positional information can be amplified with additional data to qualify the identity of the detected track. Link 11 was developed by Ralph Benjamin while with the Admiralty Surface Weapons Establishment (ASWE), Portsmouth.
Link 11 will be replaced by Link 22.
Link 11 is defined by the United States Department of Defense as MIL-STD-6011.
The NAUTIS (Naval Autonomous Tactical Information System) originally included the Link 11 system as installed in the Royal New Zealand Navy's s as part of the mid-life upgrades in the 1980s HMNZS Canterbury; NAUTIS versions were also found on the Royal Navy Hunt-class minesweepers.
Technical Characteristics
Link 11 is a half-duplex, netted link that normally operates by roll call from a Data Net Control Station (DNCS). Link 11 can also operate in the broadcast mode. The roll call mode of operation used in the Link 11 interface requires that each Participating Unit
(PU) respond in turn while all other stations are receiving. A DNCS initiates the roll call by addressing and transmitting an interrogation message to a specific PU that then responds by transmitting its data. The DNCS then interrogates the next PU in the prescribed roll call. Link 11 can be transmitted on
|
https://en.wikipedia.org/wiki/Reconfigurability
|
Reconfigurability denotes the Reconfigurable Computing capability of a system, so that its behavior can be changed by reconfiguration, i. e. by loading different configware code. This static reconfigurability distinguishes between reconfiguration time and run time. Dynamic reconfigurability denotes the capability of a dynamically reconfigurable system that can dynamically change its behavior during run time, usually in response to dynamic changes in its environment.
In the context of wireless communication dynamic reconfigurability tackles the changeable behavior of wireless networks and associated equipment, specifically in the fields of radio spectrum, radio access technologies, protocol stacks, and application services.
Research regarding the (dynamic) reconfigurability of wireless communication systems is ongoing for example in working group 6 of the Wireless World Research Forum (WWRF), in the Wireless Innovation Forum (WINNF) (formerly Software Defined Radio Forum), and in the European FP6 project End-to-End Reconfigurability (E²R). Recently, E²R initiated a related standardization effort on the cohabitation of heterogeneous wireless radio systems in the framework of the IEEE P1900.4 Working Group.
See cognitive radio.
In the context of Control reconfiguration, a field of fault-tolerant control within control engineering, reconfigurability is a property of faulty systems meaning that the original control goals specified for the fault-free system can be reached after suitable control reconfiguration.
External links
Wireless World Research Forum
Wireless World Research Forum, Working Group 6
Wireless Innovation Forum (formerly Software Defined Radio Forum)
Wireless networking
Radio resource management
Reconfigurable computing
|
https://en.wikipedia.org/wiki/Terry%20Lupton
|
Terry Martin Lupton is a successful songwriter and producer based in Los Angeles.
His songwriting catalogue include almost 100 commercially published songs, due to the databases of BMI and ASCAP.
His work
He wrote songs for the following artists:
1988 on the album "Apollonia" by Apollonia Kotero
1989 on the album "The Party" by The Party
1991 on the album "Michael Learns to Rock" by Michael Learns to Rock
1992 on the album "Something Real" by Stephanie Mills
1993 on the album "Joey Lawrence" by Joey Lawrence
2000 on the album "Steamin'" by Scott Ellison
2003 on the album "Bad Case of the Blues" by Scott Ellison
2004 on the album "Everyday's Another Chance" by Jamie Stevens
2005 on the album "All The Girls I Am" by Jeannie Kendall
the song "Shine em up" by Keely Hawkes on the album "Shake it up"
References
Visit Terry Lupton's Official Website at http://terrylupton.net
Record producers from California
Living people
Musicians from California
Year of birth missing (living people)
Place of birth missing (living people)
Songwriters from California
|
https://en.wikipedia.org/wiki/Kate%20Langbroek
|
Katherine Langbroek (born 8 August 1965) is an Australian comedian, radio and television presenter. Langbroek currently hosts Nine Network's reality program My Mum Your Dad, and is a regular presenter on The Project and co-hosts the show on Tuesday nights alongside Waleed Aly, Sarah Harris and Sam Taunton. She has previously hosted Hughesy & Kate with Dave Hughes on the HIT Network.
Career
Langbroek has a degree in journalism and has appeared on The Panel, Thank God You're Here, The Project, All Star Family Feud, Have You Been Paying Attention?, and Hughesy, We Have a Problem.
From the start of 2018, Langbroek co-hosts Hughesy & Kate on the Australian HIT Network, with Dave Hughes and anchor Jack Laurence. It is an afternoon drive time program. The program was on the KIIS Network until the end of 2017. A previous segment of the program was 'Katie Cracks It' in which she talked about whatever has made her angry over the past few days.
She was a radio announcer on the 3RRR programme Breakfasters. Langbroek previously worked as an actress (appearing in soap opera Chances and in a Transport Accident Commission Community Service Announcement); and as a script writer for Neighbours. Langbroek was a competitor in Dancing with the Stars in 2006. She was the sixth celebrity eliminated in Episode 8. She also competed in, and won, the weekly Thank God You're Here challenge on Network Ten on Wednesday, 18 July 2007.
Kate was also a guest on, and won, the quiz show Out of the Question, for the episode airing on Thursday 28 February 2008. Her name was engraved on the 'Out of the Question' trophy, alongside the likes of Ed Kavalee and Tony Moclair. Langbroek has also been a guest co-host on Network Ten's morning show The Circle. In November 2020, it was announced that Langbroek would replace Rebecca Judd as the co-host of the 3pm Pick-up in 2021. In October 2022, it was announced that Langbroek and her co-hosts Monty Dimond and Yumi Stynes would be leaving the show and the KIIS Network.
In November 2022, it was announced that Langbroek would be joining the Nine Network as the host of the brand new love and dating show titled My Mum Your Dad.
Personal life
Her mother, Anne, is part Jamaican and American, and her father, Jan Langbroek, is Dutch, and they both worked as missionaries in Papua New Guinea. She was raised as a Jehovah's Witness and was bullied for her religion and appearance during her attendance at Salisbury High School (Queensland). She married engineer Peter Allen Lewis in 2003, and is the mother of four children. She breast-fed live on The Panel shortly after the birth of her first son. Her brother is John-Paul Langbroek, a Queensland state politician and former leader of the Liberal National Party.
On 8 August 2013, Langbroek revealed that in March 2013, her eldest child had received the "all clear" after a three and a half year battle with leukaemia. The family had chosen not to share on the radio his battle with cancer. In 2015, Langbro
|
https://en.wikipedia.org/wiki/ARTE
|
Arte or ARTE can refer to:
Art in Italian
Arte - public Franco-German TV network
ARTE (Thermal Exchange) - project intended to create “Thermal Exchange”, an experiment for the International Space Station
Arte River - river in Australia
Nokia 8800 Arte - a luxury mobile phone
Arte Johnson (1929–2019) - American comic actor
Arte (manga) - Japanese manga series
|
https://en.wikipedia.org/wiki/Manifold%20System
|
Manifold System is a geographic information system (GIS) software package developed by Manifold Software Limited that runs on Microsoft Windows. Manifold System handles both vector and raster data, includes spatial SQL, a built-in Internet Map Server (IMS), and other general GIS features.
History
The development team for Manifold was created in 1993 to optimize mathematics libraries for a massively-parallel supercomputer created in a joint venture between Intel Corporation and the US Department of Defense. The team subsequently embarked on a plan to create and sell mathematics libraries, including the General Graph Facilities library (GGF) and the Computational Geometry Library (CGL), under the name of the Center for Digital Algorithms.
A series of "workbench" products were created to help teach customers the operation of algorithms in the libraries using visual means. Road networks and geometric data in geographic contexts were used to provide visual familiarity and interest, in effect creating a GIS-like product. In 1997 and 1998 customers asked for a true GIS product based on the workbench products and development of Manifold System was launched. The company soon changed its name to Manifold Software Limited to match the new product's name.
Manifold System releases
Manifold System was first sold in January 1998 as Release 3.00. Releases 3.00 and 4.00 were heavily weighted to analytics, with many tools for abstract graph theory analysis but a very limited GIS toolset. Release 4.50 emphasized general GIS features of broader interest and emerged as Manifold's first commercial GIS, a typical vector GIS more or less equivalent to classic vector GIS packages such as ArcView 3.x or MapInfo Professional.
The Release 5.00 series in 2001 and 2002 integrated display and editing of raster images and surfaces, including terrain elevation surfaces, and both 2D and 3D rendering. The 5.x series also introduced an integrated Internet Map Server (IMS) and the first Enterprise editions of Manifold System allowing collaboration by teams using shared components. The 5.x series also introduced a new spatial SQL and fuzzy logic using the Decision Support System.
Releases since 2003 include 5.50, 6.00 (two major feature upgrades via service pack), 6.50, 7.00 and 7x. 6.50 introduced image tiling from Terraserver and OGC WMS image servers using Manifold as a client and extended IMS support to include OGC WMS when using Manifold as a server. 7.00 further extended IMS to include OGC WFS-T and image server functionality as well.
Release 7.00 was issued in May 2006 and followed up by Release 7x in the next three months. Release 7.00 introduced direct support for Oracle Spatial (vector drawings, raster images and raster surfaces) and included concurrent multiuser editing capability for Oracle and a variety of other databases, including DB2 and Microsoft SQL Server. 7.00 introduced multiprocessor support with multithreaded rendering of image libraries, multithre
|
https://en.wikipedia.org/wiki/The%20Last%20Temptation%20of%20Krust
|
"The Last Temptation of Krust" is the fifteenth episode of the ninth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on February 22, 1998. It was written by Donick Cary and directed by Mike B. Anderson. Comedian Jay Leno makes a guest appearance. In the episode, Bart convinces Krusty the Clown to appear at a comedy festival organized by Jay Leno, but Krusty's old material does not go over well with the audience and he receives bad reviews. He briefly retires from comedy but returns with a new, better-received gimmick. He soon returns to his old ways, selling out to a motor-vehicle company.
The production team's decision to write an episode about stand-up comedy was influenced by comedy festivals. The writing staff initially had trouble getting Krusty's offensive bad jokes through network censors, but convinced them this was simply a way to emphasize his old and dated comedic material. The "Canyonero" sequence was modeled after Ford commercials and was given its own segment at the end of the episode because the production staff liked it so much.
The episode was highlighted by USA Today in a review of The Simpsons ninth season and received positive reviews in The Washington Times, the Evening Herald, and in books on The Simpsons.
Plot
Krusty the Clown is persuaded by Bart Simpson to appear at a comedy festival organized by Jay Leno. Krusty's outdated and offensive material fails to impress the audience when compared with the trendier comedians also appearing. Discouraged by a negative review of his act, Krusty goes on a bender and passes out on Ned Flanders' lawn. While recovering in Bart's memorabilia-covered room, Krusty realizes that he should have spent more time honing his act rather than selling out, and he enlists Bart and Leno's aid. However, his attempts at observational humor fall flat with the Simpson family. Krusty holds a press conference to announce his retirement and in short order launches into a bitter tirade against modern-day comedians. The audience finds Krusty's rant hysterically funny and he subsequently announces his return to comedy.
Krusty is inspired to return to doing low-key events, where he structures a new image for himself as a stand-up comedian who tells the truth, criticizes commercialism, and refuses to sell out to corporate America. He also changes his appearance, sporting a dark sweater and tying his hair in a ponytail. Observing his newfound popularity, two marketing executives try to persuade Krusty to endorse a new sport utility vehicle called the Canyonero. Although he tries to resist, he eventually succumbs to the lure of money. After promoting the Canyonero at a comedy performance in Moe's Tavern, he is booed off stage by the patrons. He finally admits to himself that comedy is not in his blood and selling out is. The episode ends with an extended advertisement for the Canyonero, as Krusty and Bart leave Moe Szyslak's tavern in Krust
|
https://en.wikipedia.org/wiki/Wheel%20%28computing%29
|
In Unix operating systems, the term wheel refers to a user account with a wheel bit, a system setting that provides additional special system privileges that empower a user to execute restricted commands that ordinary user accounts cannot access.
Origins
The term wheel was first applied to computer user privilege levels after the introduction of the TENEX operating system, later distributed under the name TOPS-20 in the 1960s and early 1970s. The term was derived from the slang phrase big wheel, referring to a person with great power or influence.
In the 1980s, the term was imported into Unix culture due to the migration of operating system developers and users from TENEX/TOPS-20 to Unix.
Wheel group
Modern Unix systems generally use user groups as a security protocol to control access privileges. The wheel group is a special user group used on some Unix systems, mostly BSD systems, to control access to the su or sudo command, which allows a user to masquerade as another user (usually the super user). Debian-like operating systems create a group called sudo with purpose similar to that of a wheel group.
Wheel war
The phrase wheel war, which originated at Stanford University, is a term used in computer culture, first documented in the 1983 version of The Jargon File. A 'wheel war' was a user conflict in a multi-user (see also: multiseat) computer system, in which students with administrative privileges would attempt to lock each other out of a university's computer system, sometimes causing unintentional harm to other users.
See also
Superuser
References
Unix
Computer jargon
|
https://en.wikipedia.org/wiki/3Server
|
The 3Com 3Server was a headless dedicated network-attached storage machine designed to run 3Com local area network (LAN) server software, 3+Share.
Background
The companion product was the diskless 3Station network workstation, a dedicated client machine. However, 3Servers could also network with standard PC-compatibles and were commonly used in this role. Having no display other than a small one-line LCD and no keyboard or mouse interface, 3Servers were controlled via another PC on the network which allowed console access to the internal server software.
The original 3Server was a x86 computer that wasn't compatible with any ordinary PC based on an Intel 80186 CPU, running a special version of MS-DOS and 3Com's proprietary 3+Share network server software. This was a multitasking network server stack that ran on top of single-tasking DOS. Internally, it had a network stack, file and print server modules, disk caching, user handling and more, all running simultaneously inside the DOS memory space. Because they were not limited by the PC memory map, 3Servers could support 1 megabyte of flat memory, breaking the PC's 640 kB barrier. This was a large amount of RAM for the time.
The original 3Server shipped in 1985 with of RAM and a single hard disk. It had slots for adding six additional drives, making it one of the first network attached storage (NAS) arrays. It supported both Ethernet (then branded EtherSeries) and AppleTalk and was quick to add IBM Token Ring as well. The 3Server/70, introduced in July 1985, doubled the storage space to The 3Server/500 was a 80386-based version introduced in the late 1980s, with the 80486-based 3Server/600 introduced in 1991.
The last models, the 3Server386 family, ran OS/2 1.3 as the basic operating system, using 3+Open, a variant of OS/2 LAN Manager. 3Com's version was an enhancement of the basic LAN Manager package, also sold by Microsoft and IBM and on other operating systems - for example, running on VAX/VMS it was the basis of DEC Pathworks.
Decline
In February, 1991, 3Com announced that it would hand over all rights to LAN Manager, 3+Open, its Macintosh and NetWare integration, and related software to Microsoft. The company soon exited the network server business as well.
References
Server hardware
|
https://en.wikipedia.org/wiki/Workforce%20Australia
|
Workforce Australia is an Australian Government-funded network of organisations (private and community, and originally also government) that are contracted by the Australian Government, through the Department of Employment and Workplace Relations (DEWR), to deliver employment services to unemployed job seekers on Government income support payments and employers.
Providers were initially selected for the network and allocated business through a competitive public tender process, with contract periods running for varying lengths of time determined by the Australian Government. There were over 1,000 sites across Australia delivering Job Services Australia.
To be eligible for support, people need to be in receipt of eligible income support payments, such as Newstart Allowance, Youth Allowance, the Disability Support Pension or Parenting Payment.
History
The Keating government's Employment Services Act 1994 established the Employment Service Regulatory Agency (ESRA). According to policy document "Working Nation", ESRA was created to "promote the development of community and private sector case managers and to ensure fair competition between the CES and other agencies." However, the new act created what would later be known as Employment National to take the role here allocated to the CES (Commonwealth Employment Service). At this time the CES delivered almost all federally funded employment services, however over time more and more funding was allocated to ESRA to put out to tender.
The new Howard government elected in 1996 continued Keating's structural reforms. On April 1, 1998, the CES was dissolved, and its remaining employment services were vested with ESRA. Simultaneously, ESRA became known as the Job Network. The delivery of employment services was tendered out to Job Agencies whose primary responsibility was to assist people into work. Most of these Job Agencies were owned by private or charity organisations, however Employment National was a large one owned by the federal government. Employment National was dissolved in 2003, its work given to other Job Agencies.
In 2009, the Rudd government renamed Job Network as Job Services Australia.
The services provided by Job Services Australia differed according to the level of disadvantage of the job seeker, circumstances or the allowance they were receiving from Centrelink. Services include:
Stream 1 (Limited): Job Services Australia assists in creating an online resume for the purpose of applying for jobs through DEEWR's online Australian JobSearch (AJS) website, and automatically matching the job seeker's knowledge, skills and experience to new jobs that are available.
Stream 1: This part of the JSA model includes Intensive Activities, where job seekers participate in activities to develop their skills in resume development, application writing, cold canvassing, goal setting, career planning, interview techniques, job search and work experience.
Stream 2 & 3: These job seekers are experi
|
https://en.wikipedia.org/wiki/Elephant%20in%20Cairo
|
An elephant in Cairo is a term used in computer programming to describe a piece of data that matches the search criteria purposefully inserted at the end of a search space, in order to make sure the search algorithm terminates; it is a humorous example of a sentinel value. The term derives from a humorous essay circulated on the Internet that was published in Byte magazine on September 1989, describing how various professions would go about hunting elephants.
Algorithm
When hunting elephants, the article describes programmers as following this algorithm:
Go to Africa.
Start at the Cape of Good Hope.
Work northward in an orderly manner, traversing the continent alternately east and west,
During each traverse pass:
Catch each animal seen.
Compare each animal caught to a known elephant.
Stop when a match is detected.
This algorithm has a bug, namely a bounds checking error: if no elephants are found, the programmer will continue northwards and end up in the Mediterranean sea, causing abnormal termination by drowning.
Thus experienced programmers modify the above algorithm by placing a known elephant in Cairo to ensure that the algorithm will terminate. The modified algorithm is therefore as follows:
Go to Africa.
Put an elephant in Cairo.
Start at the Cape of Good Hope.
Work northward in an orderly manner, traversing the continent alternately east and west,
During each traverse pass:
Catch each animal seen.
Compare each animal caught to a known elephant.
Stop when a match is detected.
If you are in Cairo, then there are no elephants in Africa (other than the one you placed there).
See also
Elephant test
Notes
References
External links
List of the other elephant hunting techniques (PDF)
Computer humor
Metaphors referring to elephants
|
https://en.wikipedia.org/wiki/Commonsense%20knowledge%20%28artificial%20intelligence%29
|
In artificial intelligence research, commonsense knowledge consists of facts about the everyday world, such as "Lemons are sour", or "Cows say moo", that all humans are expected to know. It is currently an unsolved problem in Artificial General Intelligence. The first AI program to address common sense knowledge was Advice Taker in 1959 by John McCarthy.
Commonsense knowledge can underpin a commonsense reasoning process, to attempt inferences such as "You might bake a cake because you want people to eat the cake." A natural language processing process can be attached to the commonsense knowledge base to allow the knowledge base to attempt to answer questions about the world. Common sense knowledge also helps to solve problems in the face of incomplete information. Using widely held beliefs about everyday objects, or common sense knowledge, AI systems make common sense assumptions or default assumptions about the unknown similar to the way people do. In an AI system or in English, this is expressed as "Normally P holds", "Usually P" or "Typically P so Assume P". For example, if we know the fact "Tweety is a bird", because we know the commonly held belief about birds, "typically birds fly," without knowing anything else about Tweety, we may reasonably assume the fact that "Tweety can fly." As more knowledge of the world is discovered or learned over time, the AI system can revise its assumptions about Tweety using a truth maintenance process. If we later learn that "Tweety is a penguin" then truth maintenance revises this assumption because we also know "penguins do not fly".
Commonsense reasoning
Commonsense reasoning simulates the human ability to use commonsense knowledge to make presumptions about the type and essence of ordinary situations they encounter every day, and to change their "minds" should new information come to light. This includes time, missing or incomplete information and cause and effect. The ability to explain cause and effect is an important aspect of explainable AI. Truth maintenance algorithms automatically provide an explanation facility because they create elaborate records of presumptions. Compared with humans, all existing computer programs that attempt human-level AI perform extremely poorly on modern "commonsense reasoning" benchmark tests such as the Winograd Schema Challenge. The problem of attaining human-level competency at "commonsense knowledge" tasks is considered to probably be "AI complete" (that is, solving it would require the ability to synthesize a fully human-level intelligence), although some oppose this notion and believe compassionate intelligence is also required for human-level AI. Common sense reasoning has been applied successfully in more limited domains such as natural language processing and automated diagnosis or analysis.
Commonsense knowledge base construction
Compiling comprehensive knowledge bases of commonsense assertions (CSKBs) is a long-standing challenge in AI rese
|
https://en.wikipedia.org/wiki/UMTS%20Terrestrial%20Radio%20Access%20Network
|
UMTS Terrestrial Radio Access Network (UTRAN) is a collective term for the network and equipment that connects mobile handsets to the public telephone network or the Internet. It contains the base stations, which are called Node B's and Radio Network Controllers (RNCs) which make up the Universal Mobile Telecommunications System (UMTS) radio access network. This communications network, commonly referred to as 3G (for 3rd Generation Wireless Mobile Communication Technology), can carry many traffic types from real-time Circuit Switched to IP based Packet Switched. The UTRAN allows connectivity between the UE (user equipment) and the core network.
The RNC provides control functionalities for one or more Node Bs. A Node B and an RNC can be the same device, although typical implementations have a separate RNC located in a central office serving multiple Node Bs. Despite the fact that they do not have to be physically separated, there is a logical interface between them known as the Iub. The RNC and its corresponding Node Bs are called the Radio Network Subsystem (RNS). There can be more than one RNS present in a UTRAN.
There are four interfaces connecting the UTRAN internally or externally to other functional entities: Iu, Uu, Iub and Iur. The Iu interface is an external interface that connects the RNC to the Core Network (CN). The Uu is also external, connecting Node B with the User Equipment (UE). The Iub is an internal interface connecting the RNC with Node B. And at last, there is the Iur interface which is an internal interface most of the time but can, exceptionally be an external interface too for some network architectures. The Iur connects two RNCs with each other.
See also
UMTS - Universal Mobile Telecommunications System
GERAN - GSM EDGE Radio Access Network
References
Code division multiple access
UMTS
|
https://en.wikipedia.org/wiki/The%20Lastest%20Gun%20in%20the%20West
|
"The Lastest Gun in the West" is the twelfth episode of the thirteenth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on February 24, 2002. In the episode, Bart meets a retired Western star named Buck McCoy who soon becomes his idol. After McCoy shows the Simpsons some of his films, they help him revive his acting career.
The episode was directed by Bob Anderson and written by John Swartzwelder, who based the script on a story idea pitched by fellow Simpsons writer Ron Hauge. The episode features Dennis Weaver as the retired Western actor Buck McCoy, Frank Welker as the vicious dog, and Karl Wiedergott as an alcoholic resembling Walter Brennan.
When it was first broadcast, "The Lastest Gun in the West" was seen by 5.9% of the American population between ages 18 and 49. It has garnered mixed reviews from critics.
Plot
When a vicious dog chases Bart, he takes refuge in the garden of a house belonging to former Western actor Buck McCoy. After Buck shows Bart a trick to calm the dog, Bart starts to hero-worship him. Naturally, Homer learns about Bart's new idol and demands he worship him instead.
To help revive Buck's career, Bart lands him a job on Krusty the Clown's show. However, Buck gets drunk before the show and makes a fool of himself, culminating in him shooting Krusty live on air. Seeing how crushed Bart is, Marge and Homer help Buck overcome his alcoholism by cleaning his house and enrolling him in an Alcoholics Anonymous program. Despite making progress, Buck fails to restore Bart's hero-worship.
When Homer sees a news report about a robbery at the Bank of Springfield, he convinces Buck to foil the robbery and become a hero. Buck subdues the bank robbers and again becomes a hero in Bart's eyes. After acknowledging everything Homer has done, Bart declares him a hero too. As the episode ends, Bart is again chased by the vicious dog.
Production
”The Lastest Gun in the West” was written by John Swartzwelder and directed by Bob Anderson. It was first broadcast on the Fox network in the United States on February 24, 2002.
Writing
The idea for the episode was pitched by Simpsons writer Ron Hauge, who thought it would be interesting to see an episode in which Bart would run into a retired Western film star in the neighborhood and "think he was the coolest guy in the world", although the actor had seen better days. Hauge suggested that Swartzwelder, who is an avid Western fan, would be the appropriate writer for the episode. Swartzwelder also pitched the plot idea about the angry dog who chases Bart in the episode.
Animation
The design for Buck McCoy was primarily based on Dennis Weaver, who portrayed him in the episode, as well as aspects of other western actors such as Roy Rogers and John Wayne. McCoy's costume in the fictional television show McTrigger was based on the attire worn by the main character in real-life television series McCloud. The design for the dog w
|
https://en.wikipedia.org/wiki/The%20Old%20Man%20and%20the%20Key
|
"The Old Man and the Key" is the thirteenth episode of the thirteenth season of the American animated television series The Simpsons. It first aired in the United States on the Fox network on March 10, 2002. In the episode, Grampa Simpson falls in love with Zelda, an old woman who has just moved into the senior home in which Grampa lives. However, Grampa is not the only one in the home who is infatuated with Zelda.
The episode was written by Jon Vitti and directed by Lance Kramer. The storyline was pitched by Vitti, who based it on an article about social status in senior homes. The episode features Olympia Dukakis as Zelda, and Bill Saluga as his television character Ray J. Johnson. The song "Ode to Branson", which was written by Vitti and composed by Alf Clausen, was submitted for the Primetime Emmy Award for Outstanding Music And Lyrics in 2002, which it ultimately lost to a score from The Blue Planet.
Plot
The episode begins with the Simpson family visiting Grampa after his retirement home mistakenly reports his death. An old woman named Zelda moves into his retirement home in place of the actual deceased resident. Grampa is determined to win her love over Zack, another resident who owns and drives a minivan. After renewing his driver's license, Grampa convinces Homer to let him borrow the car to romance her. Although he impresses Zelda, Homer and Marge think she is a hoochie and only likes Grampa because he can drive. After he crashes Homer's car in a drag race with a rival seniors gang, Homer becomes furious with Grampa and takes his keys away, forbidding him to drive ever again. Zelda informs Grampa that she got them tickets to a theater in Branson, Missouri, but when he tells her he does not have a car, she leaves with Zack and his minivan.
Grampa steals Marge's car and takes Bart with him on the road to Branson to win back Zelda. When realizing that Grampa and Bart are heading to Branson, Homer, Marge, Lisa, and Maggie take a bus there. At the theater, Grampa calls out to Zelda from on-stage, but then denounces her in front of everyone, who then chant to her a hoochie, forcing her to leave the stage. Grampa then reconciles with Homer.
Production
"The Old Man and the Key" was written by Jon Vitti and directed by Lance Kramer. It was first broadcast on the Fox network in the United States on March 10, 2002. The idea for the episode was pitched by Vitti, who was inspired by an article about senior homes. The article described senior homes as being a lot like high schools, in that there are popular and unpopular people, and that those who, for example, own a car are "like kings". Vitti suggested that the episode should be that "Grampa's life [is] basically like that of a teenager", with Homer acting as if he was Grampa's father. The Souvenir Jackitos, who challenge Grampa to a death race in the episode, were conceived from an observation by the writers. The writers argued that the only ones buying expensive trademarked jackets are old pe
|
https://en.wikipedia.org/wiki/Exabyte%20Corporation
|
Exabyte Corporation was a manufacturer of magnetic tape data storage products headquartered in Boulder, Colorado, United States. Exabyte Corp. is now defunct, but the company's technology is sold by Tandberg Data under both brand names. Prior to the 2006 demise, Exabyte offered tape storage and automation solutions for servers, workstations, LANs and SANs. Exabyte is best known for introducing the Data8 (8 mm) magnetic tape format in 1987. At the time of its demise, Exabyte manufactured VXA and LTO based products. The company controlled VXA technology but did not play a large role in the LTO community.
Corporate history
The company was formed in 1985 by Juan Rodriguez, Harry Hinz, and Kelly Beavers, and a group of ex-StorageTek engineers who were interested in using consumer videotape technology for data storage. The company advanced technology for computer backups in 1987 when they introduced the Data8 magnetic tape format. The company's follow-up technologies, including Mammoth and Mammoth-2, were less successful.
Exabyte went public on the NASDAQ in 1989 under the symbol EXBT.
Acquisitions
Exabyte's history of acquisitions includes:
1992 - R-Byte, Inc., a maker of 4mm tape systems.
1993 - Tallgrass Technologies of Lenexa within Johnson County, Kansas. Tallgrass manufactured 4mm DDS drives, backup software, and had a significant distribution channel.
1993 - Everex's Mass Storage Division (MSD). Everex did its research and development in Ann Arbor, MI and manufactured its products in Fremont, CA. Everex MSD made QIC products.
October 1994 - Grundig Data Scanner GmbH, for $2.9 million and renamed Exabyte Magnetics GmbH. This subsidiary designed and manufactured helical scan tape heads.
Ecrix merger
was a magnetic tape data storage company founded in 1996 in Boulder, Colorado. The founders, Kelly Beavers and Juan Rodriguez, were two of the three founders of Exabyte. The research and development done by Ecrix focused on making a cheaper 8 mm tape drive. In 1999, Ecrix released their first product, the VXA tape drive. In 2001, Ecrix and Exabyte merged, giving Exabyte access to Ecrix's VXA Packet Technology tape drive format.
Demise
On 30 June 2006, Exabyte announced that they were looking for a buyer.
On 30 August 2006, Tandberg Data announced that they were buying Exabyte's assets for US$28 million.
The acquisition was completed on 20 November 2006.
References
External links
Overland-Tandberg homepage
Company history, 1985-2000
Companies established in 1985
Companies disestablished in 2006
1985 establishments in Colorado
2006 disestablishments in Colorado
Defunct computer companies of the United States
|
https://en.wikipedia.org/wiki/Comparison%20of%20SSH%20clients
|
An SSH client is a software program which uses the secure shell protocol to connect to a remote computer. This article compares a selection of notable clients.
General
Platform
The operating systems or virtual machines the SSH clients are designed to run on without emulation include several possibilities:
Partial indicates that while it works, the client lacks important functionality compared to versions for other OSs but may still be under development.
The list is not exhaustive, but rather reflects the most common platforms today.
Technical
Features
Authentication key algorithms
This table lists standard authentication key algorithms implemented by SSH clients. Some SSH implementations include both server and client implementations and support custom non-standard authentication algorithms not listed in this table.
See also
Comparison of SSH servers
Comparison of FTP client software
Comparison of remote desktop software
References
Cryptographic software
Internet Protocol based network software
SSH clients
Secure Shell
|
https://en.wikipedia.org/wiki/Inuyasha%3A%20Feudal%20Combat
|
is a 3D computer graphics fighting game for the PlayStation 2 based on the Inuyasha manga and anime series.
Bandai planned to release this video game on August 16, 2005 in North America, but it was postponed to August 24 due to the Miyagi earthquake. It was released in Japan on June 16, 2005.
Bandai also planned to release this game on Nintendo DS and PlayStation Portable but it was cancelled.
Characters
Here is a list of playable characters, characters in italics have to be unlocked throughout story mode.
Inuyasha
Kagome Higurashi
Miroku
Sango
Shippo
Sesshomaru
Kagura
Koga
Kikyo
Kohaku
Naraku
Demon Inuyasha
Human Inuyasha
Bankotsu
Gameplay
In Inuyasha: Feudal Combat, up to four characters, two per team, may be present at once in a battle, however, two player characters cannot be on the same team. (IE: Player 1 as main fighter; Player 2 as their partner) Both the player and opponent may each select another character as their partner. There are four modes of gameplay, including Story, Mission, Battle, and Practice modes.
When the Spirit Gauge is full, a special Finishing Move can be performed. Each character's basic Finishing Move can be activated by pressing and holding the circle button. But when a character is fighting alongside a partner and the duo reaches Great affinity, pressing circle will trigger a combined Finishing Move, a combined team attack between the two characters. Certain player/partner combinations will have their own special finishing move together. Those combinations are:
Inuyasha/Sesshomaru
Inuyasha/Kikyo
Inuyasha/Kagome
Kikyo/Kagome
Sango/Miroku
Four different formations (the different ways the player's partner can assist the player) can be selected during the battle: Wind formation (partner mimics the actions of the player), Forest formation (the player and the partner are always targeted on different opponents), Mountain formation (partner stays between the player and opponent and blocks enemy attacks) or Fire formation (both player and partner focus on the same opponent and attack continuously). The Fire and Mountain formations also increase the strength and defense of the player and partner, respectively.
Affinity will have an effect on what the characters say to each other.
Bad Affinity - Not very good at all.
Normal Affinity - How they would normally treat each other.
Good Affinity - Pretty well.
Great Affinity - Good enough to pull off the Combined Finishing Move.
Also, some characters will have a certain affinity from the start. For example, Inuyasha and Koga will have a low affinity, however, Inuyasha and Kagome will have a high affinity.
Story mode
In Story Mode, the player must choose to follow first Inuyasha's, then Sango and Miroku, then Sesshomaru's, and finally Shippo's "Chapter". These consist of a series of battles interlaced with cut scenes illustrating a story. If the player is KO'd (knocked out) in one of these battles, a screen with the option to reattempt the last battle is av
|
https://en.wikipedia.org/wiki/OpenEHR
|
openEHR is an open standard specification in health informatics that describes the management and storage, retrieval and exchange of health data in electronic health records (EHRs). In openEHR, all health data for a person is stored in a "one lifetime", vendor-independent, person-centred EHR. The openEHR specifications include an EHR Extract specification but are otherwise not primarily concerned with the exchange of data between EHR-systems as this is the focus of other standards such as EN 13606 and HL7.
The openEHR specifications are maintained by the openEHR Foundation, a not for profit foundation supporting the open research, development, and implementation of openEHR EHRs. The specifications are based on a combination of 15 years of European and Australian research and development into EHRs and new paradigms, including what has become known as the archetype methodology for specification of content.
The openEHR specifications include information and service models for the EHR, demographics, clinical workflow and archetypes. They are designed to be the basis of a medico-legally sound, distributed, versioned EHR infrastructure.
Architecture
The architecture of the openEHR specifications as a whole consists of the following key elements:
information models (aka 'Reference Model');
the archetype formalism;
the portable archetype query language;
service models / APIs.
The use of the first two enable the development of 'archetypes' and 'templates', which are formal models of clinical and related content, and constitute a layer of de facto standards of their own, far more numerous than the base specifications on which they are built. The query language enables queries to be built based on the archetypes, rather than physical database schemata, thus decoupling queries from physical persistence details. The service models define access to key back-end services, including the EHR Service and Demographics Service, while a growing set of lightweight REST-based APIs based on archetype paths are used for application access.
The openEHR Architecture Overview provides a summary of the architecture and the detailed specifications.
Reference model
A central part of the openEHR specifications is the set of information models, known in openEHR as 'reference models'. The models constitute the base information models for openEHR systems, and define the invariant semantics of the Electronic Health Record (EHR), EHR Extract, and Demographics model, as well as supporting data types, data structures, identifiers and useful design patterns.
Some of the key classes in the EHR component are the ENTRY classes, whose subtypes include OBSERVATION, EVALUATION, INSTRUCTION, ACTION and ADMIN_ENTRY, as well as the Instruction State Machine, a state machine defining a standard model of the lifecycle of interventions, including medication orders, surgery and other therapies.
Archetypes and multi-level modelling
A key innovation in the openEHR framework is to leave
|
https://en.wikipedia.org/wiki/Online%20storage
|
Online storage may refer to:
Computer data storage on a medium or a device that is under the control of a processing unit, i.e. storage that is not offline storage
Online file storage provided by a file hosting service
Cloud storage, a model of networked enterprise storage
See also
Online and offline
Nearline storage
|
https://en.wikipedia.org/wiki/Stagecast%20Creator
|
Stagecast Creator is a visual programming language intended for use in teaching programming to children. It is based on the programming by demonstration
concept, where rules are created by giving examples of what actions should take place in a given situation. It can be used to construct simulations, animations and games, which run under Java on any suitable platform.
History
The software known as Creator originally started as a project by Allen Cypher and David Canfield Smith in Apple's Advanced Technology Group (ATG) known as KidSim. It was intended to allow kids to construct their own simulations, reducing the programming task to something that anyone could handle. Programming in Creator uses graphical rewrite rules augmented with non-graphical tests and actions.
In 1994, Kurt Schmucker became the project manager, and under him, the project was renamed Cocoa, and expanded to include a Netscape plug-in. It was also repositioned as "Internet Authoring for Kids", as the Internet was becoming increasingly accessible. The project was officially announced on May 13, 1996. There were three releases:
DR1 (Developer Release 1) on October 31, 1996
DR2 in June, 1997
DR3 in June, 1998
When Steve Jobs returned to Apple in 1997, he began dismantling a number of non-productive departments. One of these was the ATG. Larry Tesler, Cypher, and Smith, left to form Stagecast Software after retaining the rights to the Cocoa system.
Apple went on to reuse the Cocoa name for the entirely unrelated Cocoa application framework, which had originated as OpenStep.
Sales of Stagecast Creator ended on September 30, 2014 as part of Stagecast Software's cessation of operations and support ended on December 1, 2014.
Description
Creator is based on the idea of independent characters that have a graphical appearance and non-graphical properties. Each character has a list of rules that determine how it behaves. The rules are created by demonstrating what the character does in a specific situation. Each graphical rewrite rule is a before / after rule, stating that when the before conditions of the rule are met, the after actions of the rule are performed.
For a simple example, consider a simulation showing a character walking across a field, jumping over any rocks it encounters. Such a simulation would start with the construction of the playfield, in this case a line of icons representing the grass and a few rocks. A character is then placed on the playfield and double-clicked to open a rule editor. The rule editor will start by displaying the current conditions, that is, the character is standing on the grass. Below is an area to place the various "after" conditions, in this case the user drags open the default grid to two spaces, drags the character into the new grid cell, say to the right, and closes the rule editor.
If the simulation is started at this point, the character will start walking across the playfield to the right until it reaches the first rock. Sinc
|
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Vermont
|
The following is a list of FCC-licensed radio stations in the U.S. state of Vermont, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
In 2011, the license of WNHV was cancelled. It had been on 910 AM, White River Junction, Nassau Broadcasting III, LLC and was an All Sports station.
In 2015, the license of WAOT-LP, 98.3 FM, Derby, was cancelled. It had been licensed to the Vermont Agency of Transportation.
On May 22, 2019, the license of WIUV, 91.3 FM, Castleton, was cancelled. It had been licensed to the Board of Trustees/Vermont State Colleges, and transitioned to online-only operation following the license's cancellation.
On November 1, 2022, the license for WCAT, 1390 AM, Burlington, was cancelled. It had been airing a simulcast of mainstream-rock-formatted WWMP 103.3 FM Waterbury.
On June 21, 2023, the license for WVNR, 1340 AM, Poultney, was cancelled.
Notes
Radio stations
Vermont
|
https://en.wikipedia.org/wiki/Bitap%20algorithm
|
The bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates-Gonnet algorithm) is an approximate string matching algorithm. The algorithm tells whether a given text contains a substring which is "approximately equal" to a given pattern, where approximate equality is defined in terms of Levenshtein distance if the substring and pattern are within a given distance k of each other, then the algorithm considers them equal. The algorithm begins by precomputing a set of bitmasks containing one bit for each element of the pattern. Then it is able to do most of the work with bitwise operations, which are extremely fast.
The bitap algorithm is perhaps best known as one of the underlying algorithms of the Unix utility agrep, written by Udi Manber, Sun Wu, and Burra Gopal. Manber and Wu's original paper gives extensions of the algorithm to deal with fuzzy matching of general regular expressions.
Due to the data structures required by the algorithm, it performs best on patterns less than a constant length (typically the word length of the machine in question), and also prefers inputs over a small alphabet. Once it has been implemented for a given alphabet and word length m, however, its running time is completely predictableit runs in O(mn) operations, no matter the structure of the text or the pattern.
The bitap algorithm for exact string searching was invented by Bálint Dömölki in 1964 and extended by R. K. Shyamasundar in 1977, before being reinvented by Ricardo Baeza-Yates and Gaston Gonnet in 1989 (one chapter of first author's PhD thesis) which also extended it to handle classes of characters, wildcards, and mismatches. In 1991, it was extended by Manber and Wu to handle also insertions and deletions (full fuzzy string searching). This algorithm was later improved by Baeza-Yates and Navarro in 1996.
Exact searching
The bitap algorithm for exact string searching, in full generality, looks like this in pseudocode:
algorithm bitap_search is
input: text as a string.
pattern as a string.
output: string
m := length(pattern)
if m = 0 then
return text
/* Initialize the bit array R. */
R := new array[m+1] of bit, initially all 0
R[0] := 1
for i := 0; i < length(text); i += 1 do
/* Update the bit array. */
for k := m; k ≥ 1; k -= 1 do
R[k] := R[k - 1] & (text[i] = pattern[k - 1])
if R[m] then
return (text + i - m) + 1
return null
Bitap distinguishes itself from other well-known string searching algorithms in its natural mapping onto simple bitwise operations, as in the following modification of the above program. Notice that in this implementation, counterintuitively, each bit with value zero indicates a match, and each bit with value 1 indicates a non-match. The same algorithm can be written with the intuitive semantics for 0 and 1, but in that case we must introduce another instruction into the inner loop to s
|
https://en.wikipedia.org/wiki/MotorStorm%20%28video%20game%29
|
MotorStorm is a 2006 racing video game developed by Evolution Studios and published by Sony Computer Entertainment for the Sony PlayStation 3 computer entertainment system. Announced at E3 2005, the game was released in Japan on 14 December 2006 and worldwide in March 2007. MotorStorm has sold over 3 million copies. Two sequels were made, MotorStorm: Pacific Rift in 2008, and MotorStorm: Apocalypse in 2011. Another game was also created, MotorStorm: Arctic Edge, for the PlayStation 2 and PlayStation Portable. As of January 2012, the online multiplayer servers for the game have been permanently shut down.
Gameplay
The events of the game take place at the fictional MotorStorm Festival in Monument Valley. The objective of the game is to win a series of off-road races and to be the overall winner of the Festival. MotorStorm holds the Guinness World Record for the biggest variety of vehicles in a racing game - players are in control of seven different types of vehicles throughout the game: bikes, ATVs, buggies, rally cars, racing trucks, mudpluggers and big rigs. Each vehicle has its own strengths and weaknesses. For example, dirt bikes are capable of accelerating very fast and capable of maneuvering through tight spaces, but they are also easily damaged, and only reach mediocre top speeds. On the other hand, big rigs have great durability, medium speed, but poor acceleration and handling.
Each race requires the player to choose a particular vehicle type and often race against many of the other vehicles. Every track has many different ways of getting through it, each catering to a specific class of vehicle thereby making the racing field more even. The events in the game occur in real-time, such as the mud effects, tire marks, and crashes (for example, if a car loses a wheel, it will remain where it lands for the duration of the race). Each track is filled with a variety of jumps, bumps, cliffs, ledges, mud pits, parts from other cars, and other obstacles. Races are generally three-lap events with two to fifteen racers. There are nine playable tracks in the game with a further four, which were available to purchase as downloadable content through the PlayStation Store.
Tracks experience real-time deformation, which means each lap is different from the last; obstacles and other elements that are displaced from their original position will remain that way unless disturbed again. Larger vehicles can create large holes or leave ruts that can easily upset smaller, lighter vehicles, and every vehicle responds in different ways to different track environments. Vehicles like big rigs and mudpluggers get excellent traction in mud, whereas lighter vehicles like dirt bikes and ATVs will slip and slide.
Nitrous boost plays a large part in MotorStorm and is used to either catch up to opponents or pull away from them. Players must keep an eye on their boost meter, which shows how hot the car's engine is. The longer the boost is held, the hotter the engine becom
|
https://en.wikipedia.org/wiki/Parallel%20programming%20model
|
In computing, a parallel programming model is an abstraction of parallel computer architecture, with which it is convenient to express algorithms and their composition in programs. The value of a programming model can be judged on its generality: how well a range of different problems can be expressed for a variety of different architectures, and its performance: how efficiently the compiled programs can execute. The implementation of a parallel programming model can take the form of a library invoked from a sequential language, as an extension to an existing language, or as an entirely new language.
Consensus around a particular programming model is important because it leads to different parallel computers being built with support for the model, thereby facilitating portability of software. In this sense, programming models are referred to as bridging between hardware and software.
Classification of parallel programming models
Classifications of parallel programming models can be divided broadly into two areas: process interaction and problem decomposition.
Process interaction
Process interaction relates to the mechanisms by which parallel processes are able to communicate with each other. The most common forms of interaction are shared memory and message passing, but interaction can also be implicit (invisible to the programmer).
Shared memory
Shared memory is an efficient means of passing data between processes. In a shared-memory model, parallel processes share a global address space that they read and write to asynchronously. Asynchronous concurrent access can lead to race conditions, and mechanisms such as locks, semaphores and monitors can be used to avoid these. Conventional multi-core processors directly support shared memory, which many parallel programming languages and libraries, such as Cilk, OpenMP and Threading Building Blocks, are designed to exploit.
Message passing
In a message-passing model, parallel processes exchange data through passing messages to one another. These communications can be asynchronous, where a message can be sent before the receiver is ready, or synchronous, where the receiver must be ready. The Communicating sequential processes (CSP) formalisation of message passing uses synchronous communication channels to connect processes, and led to important languages such as Occam, Limbo and Go. In contrast, the actor model uses asynchronous message passing and has been employed in the design of languages such as D, Scala and SALSA.
Partitioned global address space
Partitioned Global Address Space (PGAS) models provide a middle ground between shared memory and message passing. PGAS provides a global memory address space abstraction that is logically partitioned, where a portion is local to each process. Parallel processes communicate by asynchronously performing operations (e.g. reads and writes) on the global address space, in a manner reminiscent of shared memory models. However by semantically partition
|
https://en.wikipedia.org/wiki/Cach%C3%A9%20ObjectScript
|
Caché ObjectScript is a part of the Caché database system sold by InterSystems. The language is a functional superset of the ANSI-standard MUMPS programming language. Since Caché is at its core a MUMPS implementation, it can run ANSI MUMPS routines with no change. To appeal as a commercial product, Caché implements support for object-oriented programming, a macro preprocessing language, embedded SQL for ANSI-standard SQL access to M's built-in database, procedure and control blocks using C-like brace syntax, procedure-scoped variables, and relaxed whitespace syntax limitations.
The language has private and public variables and globals. Global has a different meaning in this language than in most; such variables are global across routines, processes, and sessions. Thus, editing a global variable is making permanent and immediate changes to a system-universal database (which survives reboots, etc.). The scope of a private variable is the local function, the scope of a public variable is the entire process. Variables, private and public, may be single elements or complete multi-dimensional arrays.
The great majority of Caché's feature-set is inherited from the ANSI MUMPS standard. See that article for details on how data is represented and the different ways a programmer can think about the data during development.
Caché programming examples
Hello world program as a routine
hello // hello world routine
write "hello world"
end quit // end
Then in Caché Terminal (assuming you wrote the hello routine to the SAMPLE namespace):
SAMPLE> DO ^hello
Hello world program as a ClassMethod
Class User.Helloworld
{
ClassMethod HelloWorld()
{
// Write to console
Write "Hello World"
Quit
}
}
Then in Caché Terminal (assuming you wrote the User.Helloworld Class to the SAMPLE namespace):
SAMPLE> DO ##class(User.Helloworld).HelloWorld()
See also
GT.M, an implementation of MUMPS
Profile Scripting Language, an extension to MUMPS
References
External links
http://www.intersystems.com/cache
Persistent programming languages
|
https://en.wikipedia.org/wiki/P%E2%80%B2%E2%80%B2
|
P′′ (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines.
Definition
(hereinafter written P′′) is formally defined as a set of words on the four-instruction alphabet , as follows:
Syntax
and are words in P′′.
If and are words in P′′, then is a word in P′′.
If is a word in P′′, then is a word in P′′.
Only words derivable from the previous three rules are words in P′′.
Semantics
is the tape-alphabet of a Turing machine with left-infinite tape, being the blank symbol, equivalent to .
All instructions in P′′ are permutations of the set of all possible tape configurations; that is, all possible configurations of both the contents of the tape and the position of the tape-head.
is a predicate saying that the current symbol is not . It is not an instruction and is not used in programs, but is instead used to help define the language.
means move the tape-head rightward one cell (if possible).
means replace the current symbol with , and then move the tape-head leftward one cell.
means the function composition . In other words, the instruction is performed before .
means iterate in a while loop, with the condition .
Relation to other programming languages
P′′ was the first "GOTO-less" imperative structured programming language to be proven Turing-complete
The Brainfuck language (apart from its I/O commands) is a minor informal variation of P′′. Böhm gives explicit P′′ programs for each of a set of basic functions sufficient to compute any computable function, using only , and the four words where with denoting the th iterate of , and . These are the equivalents of the six respective Brainfuck commands , , , , , . Note that since , incrementing the current symbol times will wrap around so that the result is to "decrement" the symbol in the current cell by one ().
Example program
Böhm gives the following program to compute the predecessor (x-1) of an integer x > 0:
which translates directly to the equivalent Brainfuck program:
>[>]<[−[<[<]]−<]>+
The program expects an integer to be represented in bijective base-k notation, with encoding the digits respectively, and to have before and after the digit-string. (E.g., in bijective base-2, the number eight would be encoded as , because 8 in bijective base-2 is 112.) At the beginning and end of the computation, the tape-head is on the preceding the digit-string.
References
Weblinks
P′′Online interpreter: Demonstrating the iterative 99 Bottles of Beer song construed in 337568 P′′ instructions.
Models of computation
Academic programming languages
Experimental programming languages
|
https://en.wikipedia.org/wiki/Zone%20d%27%C3%A9tudes%20et%20d%27am%C3%A9nagement%20du%20territoire
|
In 1967 the (French National Institute for Statistics and Economic Studies, INSEE), together with the French Commissariat général and DATAR () declared the nominal division of France into eight large regions. These were named (Research and National Development Zones) or ZEAT.
Until 2016, the ZEAT corresponded to the first level in the European Union Nomenclature of Territorial Units for Statistics (NUTS 1).
External links
ZEAT
ZEAT
Types of geographical division
|
https://en.wikipedia.org/wiki/At%20the%20Carnival
|
At The Carnival is a puzzle video game by Cliff Johnson published in 1989 by Miles Computing.
It was intended to be the first of a series of games called Puzzle Gallery, but Miles Computing went out of business before any further games could be made.
At The Carnival is a collection of games similar to some in The Fool's Errand, but with enhanced user interfaces. The endgame puzzle is simpler compared to Fool's Errand and 3 in Three, consisting merely of a crossword puzzle filled by key words found in other solved puzzles.
Plot
The game has no overarching story as such; each puzzle shows a small section of Hazard Park, an amusement park with woeful disdain for its customers. Completing the puzzles in a particular section displays the fate of the unfortunate guests at a given ride, attraction, or location for that particular section.
One puzzle in the game has Cliff Johnson describing the discovery of Elmer McCurdy.
Gameplay
Some of the major puzzle types in the games include:
Jumbles - mixed-up words to be reordered.
Word searches - find words hidden in a grid of letters
Cryptograms - decipher encrypted phrases
Crosswords - fill answers into boxes based on specified clues. (Not full-sized crossword puzzles.)
Word grids - rearrange 9 letters into a grid to make words in all horizontal, vertical, and diagonal directions.
Polygons - fit pentomino-like polygons into a grid; letters on the polygons spell out words.
Jigsaw puzzles - rearrange cut-up pictures to remake the original
Concatenations - several buttons concatenate letters to the current phrase; find the correct order to build a complete phrase
Mazes - various types of mazes that must be navigated
XOR displays - a set of buttons XORs various shapes together; the right combination of buttons will produce a word
Release
The original version of the game was for Macintosh. A port to MS-DOS was made, but it is not as visually appealing due to the lower resolution available to IBM PC-class machines at the time (320×200 VGA vs. 512×342 minimum on Macintoshes). In later years the author made the game freely downloadable Freeware on his website. Cliff Johnson strongly recommends playing the Macintosh version instead of the MS-DOS version, using an emulator such as Executor or Basilisk II if necessary.
Reception
Compute! stated that players would find At the Carnival "hard to stop playing", with "the best mazes you'll ever see on the Mac".
Macworld noted that At the Carnival made certain improvements on Johnson's previous game The Fool's Errand, including color graphics and built-in hints; however, for the reviewer, At the Carnival missed some of the magic of The Fool's Errand, lacking its mythical journey and animated finale. The review concluded that At the Carnival was an enjoyable game, that its "only real problem may be that it has to follow a masterpiece." Macworld inducted At the Carnival into its Game Hall of Fame in 1989 in the Brain Teaser category.
References
External links
Offici
|
https://en.wikipedia.org/wiki/Gone%20Nutty
|
Gone Nutty (also known as Scrat's Missing Adventure) is a 2002 American computer-animated short film directed by Carlos Saldanha for Blue Sky Studios. The short features the character Scrat from Ice Age, who is yet again having troubles with collecting his beloved acorns. It was debuted on November 26, 2002 on the Ice Age DVD and VHS. This film was shown in theaters with Garfield: The Movie in 2004.
The film was nominated for the 2003 Academy Award for Best Animated Short Film.
Plot
After the events of the first film, Scrat (Chris Wedge) after having found a new acorn, discovers a huge tree hollowed out and filled to the brim with acorns. There is one more empty spot in the middle of the acorns where Scrat tries to stuff the last acorn he brought with him (he first tries to put it in the same way he had done in the opening of the first film, but he seems to remember what would happen if he did, so he gently screws it in instead). However, it pops back out when his back is turned and after two more tries at getting it in place both of which end up with the same result, Scrat gets angry and stomps it into place, causing all the acorns to fall out of a large hole in the tree. The avalanche of acorns sends Scrat sliding down the side of a mountain. The acorns and Scrat then go into free fall.
A short musical scene follows (to the tune of Tchaikovsky's Sleeping Beauty Waltz) with Scrat collecting acorns as he falls. Eventually Scrat collects and forms a CGI sphere with the acorns, but then (with Scrat on top of it) it tilts upside down so Scrat and the acorns finally land hard on the icy land down below. There is one lone acorn left in the atmosphere (presumably the one he was trying to stuff into the tree). Scrat, who is still stuck in the snow, is only able to free his arms before the acorn impacts right between his eyes with the force of a rifle bullet. The extreme force with which the acorn hits the ground causes a great big earthquake, which shapes the Earth's continents (probably Pangaea) into their present-day form, taking all the other acorns with them and trapping Scrat on the original spot from the center of the impact. When Scrat digs out the acorn that hit him, he finds it has been charred and thus crumbled into ash. In disappointment and defeat, he turns to the camera, then sighs and puts on the remaining acorn cap as a beret.
Voice cast
Chris Wedge as Scrat
References
External links
Ice Age (franchise) films
2002 films
2002 computer-animated films
2000s American animated films
2002 short films
2000s animated short films
American animated short films
20th Century Fox short films
Computer-animated short films
Blue Sky Studios short films
Films directed by Carlos Saldanha
Animated films without speech
American comedy short films
Animated films about squirrels
Acorns
|
https://en.wikipedia.org/wiki/CCM%20mode
|
CCM mode (counter with cipher block chaining message authentication code; counter with CBC-MAC) is a mode of operation for cryptographic block ciphers. It is an authenticated encryption algorithm designed to provide both authentication and confidentiality. CCM mode is only defined for block ciphers with a block length of 128 bits.
The nonce of CCM must be carefully chosen to never be used more than once for a given key.
This is because CCM is a derivation of counter (CTR) mode and the latter is effectively a stream cipher.
Encryption and authentication
As the name suggests, CCM mode combines counter (CTR) mode for confidentiality with cipher block chaining message authentication code (CBC-MAC) for authentication. These two primitives are applied in an "authenticate-then-encrypt" manner: CBC-MAC is first computed on the message to obtain a message authentication code (MAC), then the message and the MAC are encrypted using counter mode. The main insight is that the same encryption key can be used for both, provided that the counter values used in the encryption do not collide with the (pre-)initialization vector used in the authentication. A proof of security exists for this combination, based on the security of the underlying block cipher. The proof also applies to a generalization of CCM for any block size, and for any size of cryptographically strong pseudo-random function (since in both counter mode and CBC-MAC, the block cipher is only ever used in one direction).
CCM mode was designed by Russ Housley, Doug Whiting and Niels Ferguson. At the time CCM mode was developed, Russ Housley was employed by RSA Laboratories.
A minor variation of CCM, called CCM*, is used in the Zigbee standard. CCM* includes all of the features of CCM and additionally offers encryption-only capabilities.
Performance
CCM requires two block cipher encryption operations on each block of an encrypted-and-authenticated message, and one encryption on each block of associated authenticated data.
According to Crypto++ benchmarks, AES CCM requires 28.6 cycles per byte on an Intel Core 2 processor in 32-bit mode.
Notable inefficiencies:
CCM is not an "on-line" authenticated encryption with associated data (AEAD), in that the length of the message (and associated data) must be known in advance.
In the MAC construction, the length of the associated data has a variable-length encoding, which can be shorter than machine word size. This can cause pessimistic MAC performance if associated data is long (which is uncommon).
Associated data is processed after message data, so it is not possible to pre-calculate state for static associated data.
Patents
The catalyst for the development of CCM mode was the submission of offset codebook (OCB) mode for inclusion in the IEEE 802.11i standard. Opposition was voiced to the inclusion of OCB mode because of a pending patent application on the algorithm. Inclusion of a patented algorithm meant significant licensing complications
|
https://en.wikipedia.org/wiki/Authenticated%20encryption
|
Authenticated Encryption (AE) is an encryption scheme which simultaneously assures the data confidentiality (also known as privacy: the encrypted message is impossible to understand without the knowledge of a secret key) and authenticity (in other words, it is unforgeable: the encrypted message includes an authentication tag that the sender can calculate only while possessing the secret key). Examples of encryption modes that provide AE are GCM, CCM.
Many (but not all) AE schemes allow the message to contain "associated data" (AD) which is not made confidential, but its integrity is protected (i.e., it is readable, but tampering with it will be detected). A typical example is the header of a network packet that contains its destination address. To properly route the packet, all intermediate nodes in the message path need to know the destination, but for security reasons they cannot possess the secret key. Schemes that allow associated data provide authenticated encryption with associated data, or AEAD.
Programming interface
A typical programming interface for an AE implementation provides the following functions:
Encryption
Input: plaintext, key, and optionally a header (also known as additional authenticated data, AAD or associated data, AD) in plaintext that will not be encrypted, but will be covered by authenticity protection.
Output: ciphertext and authentication tag (message authentication code or MAC).
Decryption
Input: ciphertext, key, authentication tag, and optionally a header (if used during the encryption).
Output: plaintext, or an error if the authentication tag does not match the supplied ciphertext or header.
The header part is intended to provide authenticity and integrity protection for networking or storage metadata for which confidentiality is unnecessary, but authenticity is desired.
History
The need for authenticated encryption emerged from the observation that securely combining separate confidentiality and authentication block cipher operation modes could be error prone and difficult. This was confirmed by a number of practical attacks introduced into production protocols and applications by incorrect implementation, or lack of authentication ().
Around the year 2000, a number of efforts evolved around the notion of standardizing modes that ensured correct implementation. In particular, strong interest in possibly secure modes was sparked by the publication of Charanjit Jutla's integrity-aware CBC and integrity-aware parallelizable, IAPM, modes in 2000 (see OCB and chronology).
Six different authenticated encryption modes (namely offset codebook mode 2.0, OCB2.0; Key Wrap; counter with CBC-MAC, CCM; encrypt then authenticate then translate, EAX; encrypt-then-MAC, EtM; and Galois/counter mode, GCM) have been standardized in ISO/IEC 19772:2009. More authenticated encryption methods were developed in response to NIST solicitation. Sponge functions can be used in duplex mode to provide authenticated encryption.
Be
|
https://en.wikipedia.org/wiki/G-Phoria
|
G-Phoria is a former annual video game awards show started in 2003 and ended in 2009, produced by and for the defunct G4 network.
Formerly the event was formatted like a regular awards ceremony taped in front of an audience, featuring celebrities such as Hal Sparks, Carmen Electra, Wilmer Valderrama and Anna Nicole Smith, and musical performances, along with a red carpet preview show, and some game premieres. In 2006, the control of the show was given over to X-Play, which made it a pure viewer's choice show hosted by Adam Sessler and Morgan Webb. After 2009 G-Phoria's honors were effectively blended into the traditional "year in review" show aired by X-Play in mid-December of each year until the show's end in 2012.
Winners of G-Phoria
2003
Best Adaptation: The Lord of the Rings: The Two Towers
Best Brawl: Mortal Kombat: Deadly Alliance
Best Cinematic: Warcraft III: Reign of Chaos
Best Graphics: Tom Clancy's Splinter Cell
Best Handheld/Mobile game: The Legend of Zelda: A Link to the Past/Four Swords
Best Live Action/Voice Male Performance: Ray Liotta, Grand Theft Auto: Vice City
Best Live Action/Voice Female Performance: Jenna Jameson, Grand Theft Auto: Vice City
Best Online Game: Battlefield 1942
Best Revival: The Legend of Zelda: The Wind Waker
Best Rookie: Tom Clancy's Splinter Cell
Best Soundtrack: Grand Theft Auto: Vice City
Best Sports Game: Madden NFL 2003
Best Story: Kingdom Hearts
Best Villain: Ganon, The Legend of Zelda: The Wind Waker
Best Weapon: Light Saber, Star Wars Jedi Knight II: Jedi Outcast
Character You'd Most Like To Be: Dante, Devil May Cry 2
Coolest Cheat/Easter Egg: Unlock original game, Panzer Dragoon Orta
EB Gamers Choice Award: Grand Theft Auto: Vice City
Game of the Year: Grand Theft Auto: Vice City
Guiltiest Pleasure: Dead or Alive Xtreme Beach Volleyball
Hottest Character: Tina Armstrong, Dead or Alive Xtreme Beach Volleyball
Most Annoying Character: Zill, The Legend of Zelda: The Wind Waker
Most Innovative Game: Animal Crossing
Most Underrated Game: Super Mario Sunshine
2004
Alt Sports Award Powered by Mountain Dew: Tony Hawk's Underground
Best Adaptation: Star Wars: Knights of the Old Republic
Best Cinematic: Final Fantasy X-2
Best Easter Egg: Snoop Dogg Cheat, True Crime: Streets of LA
Best Graphics: Ninja Gaiden
Best Handheld Game: Final Fantasy Tactics Advance
Best Innovation: Tom Clancy's Splinter Cell: Pandora Tomorrow, multi-player mode
Best Mobile Phone Game: Bejeweled multiplayer
Best Multiplayer Game: Unreal Tournament 2004
Best New Franchise: Call of Duty
Best Racing Game: Need for Speed Underground
Best RPG: Star Wars: Knights of the Old Republic
Best Sound Design: The Lord of the Rings: The Return of the King
Best Soundtrack: Tony Hawk's Underground
Best Traditional Sports Game: Madden NFL 2004
Best Voice Female Performance: Jada Pinkett Smith, Enter the Matrix
Best Voice Male Performance: Pierce Brosnan, James Bond 007: Everything or Nothing
Favorite Character: Ryu Hayabusa, Ninja Gaiden
Game o
|
https://en.wikipedia.org/wiki/Life%20Is%20Worth%20Living
|
Life Is Worth Living is an inspirational American television series which ran on the DuMont Television Network from February 12, 1952, to April 26, 1955, then on ABC until April 8, 1957, featuring the Archbishop Fulton J. Sheen. Similar series, also featuring Sheen, followed in 1958–1961 and 1961–1968.
Broadcast history
Hosted by Bishop (later Archbishop) Fulton J. Sheen, the series consisted of Sheen speaking to the camera and discussing moral issues of the day, often using blackboard drawings and lists to help explain the topic. When the blackboard was filled, Sheen would move to another part of the set, and request one of his "angels" (one of the TV crew) to clean the blackboard.
In 1952, DuMont was searching for programming ideas and tried a rotating series of religious programs hosted by a Protestant minister, a Jewish rabbi, and a Catholic bishop. While the other shows did not catch on, the bishop (Sheen) was a hit, found a sponsor in Admiral television sets, and became DuMont's only Emmy Award winner during its decade of broadcasting. Life Is Worth Living held the distinction of being aired on more stations (169) than any other regularly scheduled DuMont program, and is believed to have been the most widely viewed religious series in the history of television.
Prior to Life Is Worth Living, Sheen had appeared on the radio program The Catholic Hour from 1928 to 1952. With his hypnotic gaze, disarming smile, and dramatic delivery, Sheen was deemed a natural for television. Airing opposite NBC's Milton Berle show on Tuesday nights, Sheen was the only person to be competitive with Berle. Sheen drew as many as 10 million viewers each week.
Sheen and Berle enjoyed a friendly rivalry. Berle is reported to have joked, "We both work for the same boss, 'Sky Chief Supreme'", making reference to a grade of gasoline produced by Texaco, his sponsor. Later, when Sheen won an Emmy, Berle quipped, "He's got better writers – Matthew, Mark, Luke and John!" As a take-off on Berle's nickname "Uncle Miltie," Sheen once opened his program by saying, "Good evening, this is Uncle Fultie."
The charismatic Sheen became one of early television's most unlikely stars, winning an Emmy Award for "Most Outstanding Television Personality" in 1953. During his acceptance speech he happily borrowed Berle's line, crediting his four writers – Matthew, Mark, Luke, and John – for his success.
Sheen made famous statements against communism. In 1953 an episode of Life Is Worth Living consisted of a reading of the burial scene from Julius Caesar, with Sheen substituting the names of Stalin, Beria, Malenkov, and Vyshinsky for Caesar, Cassius, Marc Antony, and Brutus. Sheen dramatically stated, "Stalin must one day meet his judgment." One week later, the Russian dictator was dead from a stroke.
Network change
When DuMont ceased network broadcasting in 1955, Sheen moved his show to ABC, lectured for a while, and returned to television from 1958 to 1961 with The Best of Bishop Sh
|
https://en.wikipedia.org/wiki/Library%20for%20WWW%20in%20Perl
|
LWP - The World-Wide Web library for Perl (also called libwww-perl) is a set of Perl modules that give Perl programming easy access to sending requests to the World Wide Web. libwww-perl provides an application programming interface (API) to an HTTP client as well as a number of HTML utilities, and standard objects to represent HTTP requests and responses.
History
The first generation of libwww-perl was written by Roy Fielding using version 4.036 of Perl. Fielding's work on libwww-perl provided a backend HTTP interface for his MOMSpider Web crawler. Fielding's work on libwww-perl was informed by Tim Berners-Lee's work on libwww, and helped to clarify the architecture of the Web that was eventually documented in HTTP v1.0. The second generation of libwww-perl was based on version 5.004 of Perl, and written by Martijn Koster and Gisle Aas. The current version is 6.72.
References
External links
LWP on GitHub
The book Perl & LWP, free online
Perl modules
|
https://en.wikipedia.org/wiki/Vector%20sum%20excited%20linear%20prediction
|
Vector sum excited linear prediction (VSELP) is a speech coding method used in several cellular standards. The VSELP algorithm is an analysis-by-synthesis coding technique and belongs to the class of speech coding algorithms known as CELP (Code Excited Linear Prediction).
Variations of this codec have been used in several 2G cellular telephony standards, including IS-54, IS-136 (D-AMPS), GSM (Half Rate speech) and iDEN. It was also used in the first version of RealAudio for audio over the Internet. The IS-54 VSELP standard was published by the Telecommunications Industry Association in 1989.
D-AMPS (IS-54 and IS-136) VSELP specifies an encoding of each 20 ms of speech into 159-bit frames, thus achieving a raw data rate of 7.95 kbit/s. In an actual TDMA cell phone, the vocoder output is packaged with error correction and signaling information, resulting in an over-the-air data rate of 16.2 kbit/s. For internet audio, each 159-bit frame is stored in 20 bytes, leaving 1 bit unused. The resulting file thus has a data rate of exactly 8 kbit/s.
GSM half-rate VSELP (GSM 06.20) uses 20 ms frames with 112 bits per frame, giving a raw data rate of 5.6 kbit/s. The iDEN VSELP coder has three modes:
30 ms frames at 126 bits per frame with a raw data rate of 4.2 kbit/s,
22.5 ms frames at 99 bits per frame with a raw data rate of 4.4 kbit/s and
22.5 ms frames at 180 bits per frame with a raw data rate of 8.0 kbit/s.
A major drawback of VSELP is its limited ability to encode non-speech sounds, so that it performs poorly when encoding speech in the presence of background noise. For this reason, use of VSELP has been gradually phased out in favor of newer codecs.
VSELP is also the encoding method used in some early Motorola Type II trunking systems. It was phased out in favor of the newer IMBE method.
References
Ira A. Gerson and Mark A. Jasiuk, Vector Sum Excited Linear Prediction (VSELP), IEEE Workshop on Speech Coding for Telecommunications, September 1989, pp. 66–68
Ira A. Gerson and Mark A. Jasiuk, Vector sum excited linear prediction (VSELP) speech coding at 8 kbps, Proceedings of the 1990 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP-90), April 1990, pp. 461–464
External links
Telecommunications Industry Association web site
Speech codecs
|
https://en.wikipedia.org/wiki/Mosaic%20%28geodemography%29
|
Mosaic is Experian's system for geodemographic classification of households. It applies the principles of geodemography to consumer household and individual data collated from a number of government and commercial sources. The statistical development of the system was led by professor Richard Webber in association with Experian in the 1980s, and it has been regularly refreshed and reclassified since then, each based on more recent data from national censuses and other sources. Since its initial development in the UK, the Mosaic brand name has also been used to market separate products which classify other national consumers including most of Western Europe, USA, selected Asian regions and Australia.
The initial UK version was based at the postcode level, which would cover an average of 20 properties with the same code. More recent versions have been developed at the individual household level and offer more accurate classification based on specific characteristics of each household. The 2009 Mosaic UK version, for example, classified the UK population into 15 main socio-economic groups and, within this, 67 different types.
Professor Webber also developed the competing ACORN system with CACI. Both Mosaic and Acorn have found application outside their original purpose of direct marketing, including governmental estimates and forecasts, and it is regularly employed by life insurance companies and pension funds in the UK to assess longevity for pricing and reserving. Both are also used extensively in understanding local service users, although Mosaic's naming has proved to be controversial, leading Experian to introduce Mosaic Public Sector with more politically correct segment names.
Mosaic 2004 Classification Groups and Types
Source - Mosaic Geodemographics Summary
Mosaic classifies the UK into 11 Main Groups and 61 distinct types. detailed description link may be more relevant
References
External links
Guardian article referencing Mosaic
http://observer.guardian.co.uk/uk_news/story/0,6903,1227910,00.html
http://technology.guardian.co.uk/online/story/0,,1428612,00.html
http://property.timesonline.co.uk/tol/life_and_style/property/buying_and_selling/article1390447.ece
http://www.prnewswire.co.uk/cgi/news/release?id=181549
http://education.guardian.co.uk/primaryeducation/story/0,,1719385,00.html
http://www.channel4.com/news/microsites/E/election2005_features/new_feature.html
http://news.bbc.co.uk/1/low/uk_politics/vote_2005/frontpage/4485507.stm
http://society.guardian.co.uk/e-public/story/0,13927,1420204,00.html
Demographics of the United Kingdom
Geodemographic databases
Geographical databases in the United Kingdom
Market research
Market segmentation
Postcodes in the United Kingdom
|
https://en.wikipedia.org/wiki/LOCKSS
|
The LOCKSS ("Lots of Copies Keep Stuff Safe") project, under the auspices of Stanford University, is a peer-to-peer network that develops and supports an open source system allowing libraries to collect, preserve and provide their readers with access to material published on the Web. Its main goal is digital preservation.
The system attempts to replicate the way libraries do this for material published on paper. It was originally designed for scholarly journals, but is now also used for a range of other materials. Examples include the SOLINET project to preserve theses and dissertations at eight universities, US government documents, and the MetaArchive Cooperative program preserving at-risk digital archival collections, including Electronic Theses and Dissertations (ETDs), newspapers, photograph collections, and audio-visual collections.
A similar project called CLOCKSS (Controlled LOCKSS) "is a tax-exempt, 501(c)(3), not-for-profit organization, governed by a Board of Directors made up of librarians and publishers." CLOCKSS runs on LOCKSS technology.
Problem
Traditionally, academic libraries have retained issues of scholarly journals, either individually or collaboratively, providing their readers access to the content received even after the publisher has ceased or the subscription has been canceled. In the digital age, libraries often subscribe to journals that are only available digitally over the Internet. Although convenient for patron access, the model for digital subscriptions does not allow the libraries to retain a copy of the journal. If the publisher ceases to publish, or the library cancels the subscription, or if the publisher's website is down for the day, the content that has been paid for is no longer available.
Methods
The LOCKSS system allows a library, with permission from the publisher, to collect, preserve and disseminate to its patrons a copy of the materials to which it has subscribed as well as open access material (perhaps published under a Creative Commons license). Each library's system collects a copy using a specialized web crawler that verifies that the publisher has granted suitable permission. The system is format-agnostic, collecting whatever formats the publisher delivers via HTTP. Libraries which have collected the same material cooperate in a peer-to-peer network to ensure its preservation. Peers in the network vote on cryptographic hash functions of preserved content and a nonce; a peer that is outvoted regards its copy as damaged and repairs it from the publisher or other peers.
The LOCKSS license used by most publishers allows a library's readers access to its own copy, but does not allow similar access to other libraries or unaffiliated readers; the system does not support file sharing. On request, a library may supply another library with content to effect a repair, but only if the requesting library proved that in the past that it had a good copy by voting with the majority. If the reader's
|
https://en.wikipedia.org/wiki/Hoefler%20Text
|
Hoefler Text is an old-style serif font by Jonathan Hoefler and released by Apple Computer Inc. (now Apple Inc.) in 1991 to showcase advanced type technologies. Intended as a versatile font that is suitable for body text, it takes cues from a range of classic fonts, such as Janson and Garamond (Jean Jannon's design).
A version of Hoefler Text has been included with every version of the classic Mac OS since System 7.5 and in every version of macOS. Hoefler's company, Hoefler&Co., have continued development of the typeface, developing for sale a range of additional variants.
Released free with every Mac during the growth of desktop publishing, at a time when producing printed documents was becoming dramatically easier, Hoefler Text raised awareness of type features previously the concern only of professional printers. New York magazine commented in 2014 that it "helped launch a thousand font obsessives." Hoefler Text was used in the Wikipedia logo until the 2010 redesign, when it was replaced with Linux Libertine.
Features
Hoefler Text incorporates then-advanced features which have since become standard practice for font designers, such as automatic ligature insertion, real small capitals, optional old style figures and optional insertion of characters such as true superscript and subscript characters, the historical round and long s, engraved capitals and swashes. Hoefler Text also has a matching ornament font containing arabesque motifs. It was, until OpenType made alternate characters more common, one of only a few system fonts that contained old style, or ranging, figures, which are designed to harmonize with body text.
Hoefler&Co. expanded Hoefler Text to include additional typographic features, and the current commercial release now includes three weights (an additional bold weight beside the regular and black included with Macs) and two sets of engraved capitals, as well as the more slender display variant Hoefler Titling. These are released in the OpenType format, intended for cross-platform usage.
Gallery
See also
Apple Advanced Typography
References
External links
Hoefler Text in the Hoefler & Frere-Jones catalog
Hoefler Text features in the Hoefler & Frere-Jones catalog
Hoefler Titling in the Hoefler & Frere-Jones catalog
Old style serif typefaces
Typefaces with text figures
Hoefler & Frere-Jones typefaces
Typefaces designed by Jonathan Hoefler
Typefaces with optical sizes
Typefaces and fonts introduced in 1991
Apple Inc. typefaces
|
https://en.wikipedia.org/wiki/British%20Rail%20Class%20466
|
The British Rail Class 466 Networker are a fleet of 43 electric multiple units that were built by Metro-Cammell in 1993 and 1994. The units are currently operated by Southeastern.
Description
The Class 466 EMUs were built between 1993 and 1994 by Metro-Cammell in Washwood Heath, for the Network SouthEast sector of British Rail. As part of the privatisation of British Rail, all were sold to Angel Trains. They were operated by Network SouthEast until 1997, and then by Connex South Eastern until 2003, South Eastern Trains until 2006 and Southeastern to the present day.
Each of these units is formed of two coaches that have dimensions of and a top speed of .
Class 466 units operate in multiple with Class 465s. They were historically used as individual units on rural routes, mainly the Sheerness Line between Sittingbourne and Sheerness, displacing the Class 508/2s which operated on this branch line and on the Bromley North branch between Grove Park and Bromley North. However, owing to their non-compliance with accessibility standards, since 1 January 2021 they may only run coupled to a Class 465 unit.
The Class 466s were also used on the Medway Valley line between Strood, Maidstone West and Tonbridge, and in the leaf fall and winter season of 2011, the Class 466s were doubled up to make 4 car units on the Medway Valley line to help stop the poor adhesion along the line when only a single unit runs. They also ran doubled up or coupled with a Class 465 on the Sheerness Line during the winters of 2009/10 and 2010/11. From the May 2012 timetable changes, Class 375s replaced the Class 466s on the Medway Valley line and from December 2019 on the Sheerness Branch Line.
These two-car EMUs are formed of a driving motor carriage (DMSO: Driving Motor Standard Open) and a driving trailer carriage (DTSO, with lavatory); all on-board seating is standard accommodation. A Solid State Traction Converter package controls 3-phase AC Traction motors, which allows for Rheostatic or Regenerative Dynamic braking. Primary braking system is electro-pneumatically actuated disc brakes, which is blended with the Dynamic brakes. Speed Probes on every axle of the unit provide for Wheel Slip/Slide Protection. A solid-state Auxiliary Converter provides 110 V DC and 240 V AC supplies; this is the source of the loud buzzing noise which can be heard when the train is stationary. The Aux Converter is located on the driving trailer, along with the toilet. The units use air-operated sliding plug doors.
Some are scheduled to be replaced by Class 707s, with two hauled to Worksop for store by Harry Needle Railroad Company in June 2021.
Refurbishment
The 466s were repainted by Wabtec Rail at Doncaster Works into a variation of Southeastern livery with lilac doors and midnight blue lower band.
Fleet details
Accidents and incidents
On 5 February 2007 a bridge inspection unit working on the M20 motorway was deployed over a railway bridge between Maidstone Barracks and Aylesford station
|
https://en.wikipedia.org/wiki/Develo
|
The Develo (デベロ) is an official Japanese PC Engine hobbyist development accessory for NEC's console. It includes a C compiler and an assembler. Some games made with this kit were published on demo discs, such as Frisbee Ken John.
NEC consoles
Video game development software
|
https://en.wikipedia.org/wiki/Dongdaegu%20Station
|
Dongdaegu Station, meaning "East Daegu Station", is a railway station in Daegu, South Korea. It is on the national high-speed KTX railway network, south of Seoul Station.
History
The station opened in 1962 and KTX trains on the Gyeongbu Line began services on April 1, 2004, shortly after the completion of the new building earlier that year.
Services
Dongdaegu has become the chief station for Daegu, surpassing Daegu Station.
Overground
Dongdaegu Station serves all KTX trains on the Gyeongbu Line. It also has express services and local services on the normal speed Gyeongbu Line. The station is served by the Daegu Line, a short line which connects to the Jungang Line.
Subway
The station also serves the Daegu Subway. The overground railway and subway stations are not connected directly: the Subway Line 1 station entrance lies in a park close by the railway station.
Popular culture
Dongdaegu station features in the 2016 zombie horror film Train to Busan.
See also
Transportation in South Korea
Korail
KTX
References
External links
Korea Train eXpress
Route Map
Station homepage (Korean)
Cyber station information from Daegu Metropolitan Transit Corporation
Korea Train Express stations
Railway stations in Daegu
Daegu Metro stations
Dong District, Daegu
Railway stations opened in 1962
Railway stations in South Korea opened in the 1990s
|
https://en.wikipedia.org/wiki/Specification%20and%20Description%20Language
|
Specification and Description Language (SDL) is a specification language targeted at the unambiguous specification and description of the behaviour of reactive and distributed systems.
Overview
The ITU-T has defined SDL in Recommendations Z.100 to Z.106. SDL originally focused on telecommunication systems; its current areas of application include process control and real-time applications in general. Due to its nature it can be used to represent simulation systems without ambiguity and with a graphical notation.
The Specification and Description Language provides both a graphical Graphic Representation (SDL/GR) as well as a textual Phrase Representation (SDL/PR), which are both equivalent representations of the same underlying semantics. Models are usually shown in the graphical SDL/GR form, and SDL/PR is mainly used for exchanging models between tools. A system is specified as a set of interconnected abstract machines which are extensions of finite state machines (FSM).
The language is formally complete,
so it can be used for code generation for either simulation or final targets.
The Specification and Description Language covers five main aspects: structure, communication, behavior, data, and inheritance. The behavior of components is explained by partitioning the system into a series of hierarchies. Communication between the components takes place through gates connected by channels. The channels are of delayed channel type, so communication is usually asynchronous, but when the delay is set to zero (that is, no delay) the communication becomes synchronous.
The first version of the language was released in 1976 using graphical syntax (SDL-76). This was revised in 1980 with some rudimentary semantics (SDL-80). The semantics were refined in 1984 (SDL-84), the textual form was introduced for machine processing and data was introduced. In 1988, SDL-88 was released with a formal basis for the language: an abstract grammar as well as a concrete grammar and a full formal definition. The version released in 1992 (SDL-92) introduced object-oriented concepts such as inheritance, abstract generic types etc., with the object-oriented features described by transformations into non-object oriented ones. SDL-2010 is the latest version, an updated version of SDL-2000 that was completely based on object-orientation, rather than description by transformations. This version is accompanied by a UML-Profile: ITU-T Recommendation Z.109 (04/12), SDL-2010 combined with UML. SDL-2010 also introduced the support of C data types as initially introduced by SDL-RT.
Organization
Hierarchy level
The Hierarchy level of SDL is structured as follows.
Library package
System agent
Block agent
Process agent
Procedure type
Remote procedure
Architecture
An SDL system is made of functional blocks and each block can be further decomposed in sub-blocks. The lowest level block is composed of one process or several processes described as finite state machines.
Communicat
|
https://en.wikipedia.org/wiki/Registered%20port
|
A registered port is a network port designated for use with a certain protocol or application.
Registered port numbers are currently assigned by the Internet Assigned Numbers Authority (IANA) and were assigned by Internet Corporation for Assigned Names and Numbers (ICANN) before March 21, 2001, and were assigned by the Information Sciences Institute (USC/ISI) before 1998.
Ports with numbers 0–1023 are called system or well-known ports; ports with numbers 1024-49151 are called user or registered ports, and ports with numbers 49152-65535 are called dynamic, private or ephemeral ports. Both system and user ports are used by transport protocols (TCP, UDP, DCCP, SCTP) to identify an application or service.
See also
List of TCP and UDP port numbers
References
External links
IANA's Official list of ports
Internet protocols
|
https://en.wikipedia.org/wiki/Jim%20Buckmaster
|
Jim Buckmaster (born August 14, 1962) is an American computer programmer who has been the CEO of Craigslist since 2000.
Early life
Buckmaster was born in Ann Arbor, Michigan. He graduated with a bachelor's from Virginia Tech and attended medical school at the University of Michigan. However, he dropped out in 1986, citing a lack of interest. He remained a student for the next ten years by taking at least one class for credit, therefore maintaining certain student privileges like gym access. During this time, he audited classics courses, did data entry, and eventually taught himself how to code.
In the early 1990s, he worked as a programmer for the Inter-university Consortium for Political and Social Research, where he designed the organization's web interface. Buckmaster later got a job in San Jose, California and moved to San Francisco, where he commuted 5 hours roundtrip to work. During the Dot-com bubble, he worked as a webmaster for a short lived tech company, Creditland, in San Francisco.
Craigslist
In late 1999, Buckmaster posted his resume onto Craigslist, where he was recruited by Craig Newmark, the founder of the website. As lead programmer, he contributed to the site's multi-city architecture, search engine, discussion forums, flagging system, self-posting process, homepage design, personals categories, and best-of-craigslist. In November 2000, he was promoted to the post of CEO.
Buckmaster wrote a series of haiku that appear in lieu of error messages on craigslist:
"The little poems he has written appear on the screen at times when users might expect a helpful message from the staff. They function as a gnomic clue that what you are seeing is intentional, while discouraging further conversation or inquiry. For instance, start too many conversations in the forums and your new threads may fail to show up. Instead, you will see this:
'Frogs croak and gulls cry
silently a river floods
a red leaf floats by.'"
Referring to the purple peace sign he created that serves as craigslist's symbol and favicon:
"The only topic he can remember their disagreeing about is the peace sign that adorns the craigslist Web address. "Craig thought it was associated with the hippies and that hippies were discredited," Buckmaster says. "Whereas I think peace is among the most desirable things you can have."
On the topic of craigslist's company culture:
"The long-running tech-industry war between engineers and marketers has been ended at craigslist by the simple expedient of having no marketers. Only programmers, customer service reps, and accounting staff work at craigslist. There is no business development, no human resources, no sales. As a result, there are no meetings. The staff communicates by email and IM. This is a nice environment for employees of a certain temperament. "Not that we're a Shangri-La or anything," Buckmaster says, "but no technical people have ever left the company of their own accord."
Buckmaster also manages the Craigslist Ch
|
https://en.wikipedia.org/wiki/Data%20structure%20alignment
|
Data structure alignment is the way data is arranged and accessed in computer memory. It consists of three separate but related issues: data alignment, data structure padding, and packing.
The CPU in modern computer hardware performs reads and writes to memory most efficiently when the data is naturally aligned, which generally means that the data's memory address is a multiple of the data size. For instance, in a 32-bit architecture, the data may be aligned if the data is stored in four consecutive bytes and the first byte lies on a 4-byte boundary.
Data alignment is the aligning of elements according to their natural alignment. To ensure natural alignment, it may be necessary to insert some padding between structure elements or after the last element of a structure. For example, on a 32-bit machine, a data structure containing a 16-bit value followed by a 32-bit value could have 16 bits of padding between the 16-bit value and the 32-bit value to align the 32-bit value on a 32-bit boundary. Alternatively, one can pack the structure, omitting the padding, which may lead to slower access, but uses three quarters as much memory.
Although data structure alignment is a fundamental issue for all modern computers, many computer languages and computer language implementations handle data alignment automatically. Fortran, Ada, PL/I, Pascal, certain C and C++ implementations, D, Rust, C#, and assembly language allow at least partial control of data structure padding, which may be useful in certain special circumstances.
Definitions
A memory address a is said to be n-byte aligned when a is a multiple of n (where n is a power of 2). In this context, a byte is the smallest unit of memory access, i.e. each memory address specifies a different byte. An n-byte aligned address would have a minimum of least-significant zeros when expressed in binary.
The alternate wording b-bit aligned designates a b/8 byte aligned address (ex. 64-bit aligned is 8 bytes aligned).
A memory access is said to be aligned when the data being accessed is n bytes long and the datum address is n-byte aligned. When a memory access is not aligned, it is said to be misaligned. Note that by definition byte memory accesses are always aligned.
A memory pointer that refers to primitive data that is n bytes long is said to be aligned if it is only allowed to contain addresses that are n-byte aligned, otherwise it is said to be unaligned. A memory pointer that refers to a data aggregate (a data structure or array) is aligned if (and only if) each primitive datum in the aggregate is aligned.
Note that the definitions above assume that each primitive datum is a power of two bytes long. When this is not the case (as with 80-bit floating-point on x86) the context influences the conditions where the datum is considered aligned or not.
Data structures can be stored in memory on the stack with a static size known as bounded or on the heap with a dynamic size known as unbounded.
Problems
The C
|
https://en.wikipedia.org/wiki/Rogers%20Cadenhead
|
Rogers Cadenhead (born April 13, 1967) is an American computer book author and web publisher who served from 2006 to 2008 as chairman of the RSS Advisory Board, a group that publishes the RSS 2.0 specification. He graduated from Lloyd V. Berkner High School in Richardson, Texas in 1985 and the University of North Texas in 1991.
Background
Cadenhead is the author of several editions of the Java in 21 Days and Java in 24 Hours series from SAMS Publishing and has written other books on Radio UserLand, Microsoft FrontPage and the Internet. From 1982 to 1986, Cadenhead operated the Parallax BBS in Dallas, Texas, which was possibly the first BBS to offer BBS door games.
He published the Internet humor site Cruel.com and is the copublisher of the community weblog SportsFilter. He has also been a contributor to Suck.com and previously authored a syndicated question-and-answer column for the Fort Worth Star-Telegram called "Ask Ed Brice."
Drudge Retort
When news aggregator Matt Drudge failed to register drudge.com for his news website Drudge Report, Cadenhead registered drudge.com in 1998 and started the Drudge Retort as a liberal alternative to what he perceived to be the right-leaning Drudge Report, and as "a send-up of Mr. Drudge's breathless style". Cadenhead edits the site with television writer Jonathan Bourne. Both conservative and liberal bloggers utilize the open forum format, encouraged by Cadenhead. The headline selections for discussion are the liberal alternative to the Drudge Report.
Some readers may be confused between the two websites because the typography and page layouts are almost identical, and this is no coincidence since the site was deliberately designed to be like Drudge's website, using "the same style of type, the same rows of links to other journalists and columnists, the same screaming, sensational headlines trumpeting world exclusives". Cadenhead uses a yellow background, which implies that Drudge is a yellow journalist.
Even Matt Drudge visits the Drudge Retort, saying "I go there when I can't get into my own Web site because mine's so popular" in a 1999 interview with the New York Times.
In the news
In 2005, Cadenhead achieved brief notoriety for registering the domain name benedictxvi.com several weeks before the name was chosen by Pope Benedict XVI, joking that he would give it to the Vatican in exchange for a mitre and "complete absolution, no questions asked, for the third week of March 1987." Those demands not being met, he donated the domain to the Internet charity Modest Needs.
In December 2005, Cadenhead again achieved blog and media coverage by highlighting that Wikipedia co-founder Jimmy Wales had edited his own Wikipedia article repeatedly, which Wales admitted was "in poor taste."
In June 2008, the Associated Press filed seven DMCA takedown requests against Cadenhead for stories published by users on the Drudge Retort reproducing from 39 to 79 words of AP articles. The action sparked a backlash among b
|
https://en.wikipedia.org/wiki/Canvas%20X
|
Canvas X is a drawing, imaging, and publishing computer program from Canvas GFX for personal computers.
Development
Canvas GFX's origins date back to 1986. The original idea for Canvas came from Jorge Miranda, Manuel Menendez, and Joaquin DeSoto, the founders of Deneba Systems Inc. of Miami Florida, for Apple's Macintosh computers—part of the wave of programs that made the desktop publishing revolution.
The first version was unique in many ways; not least because it was released as both an application and a desk accessory. In the latter form, it could be used while another program, e.g. PageMaker, was running simultaneously; very handy in that time of single-program operation.
Canvas provides tools for creating and editing vector and raster graphics. It is used for illustration, page layout, animation, presentations, and publications in printed and World Wide Web formats.
From its inception, Canvas differed from other graphics applications because it combined tools and file formats for both vector graphics (line art) and raster images (photographic and other pixel-based), adding word-processing and page-layout features such as multiple-page documents and master pages in subsequent releases. The user works in a window, which is the familiar "page on a pasteboard" analog used by many DTP and vector graphics programs, but in that window, which might be a single illustration page or one page of a multi-page magazine, book, web site, animation or presentation, the user can create or edit and layout text, vector graphics and raster images. Canvas also emphasized technical drawing in addition to artistic illustration features.
With Version 3.5, Deneba went cross-platform, releasing a version with file-format compatibility for Macintosh and Windows computers.
At Version 5, Canvas was completely rewritten for both platforms and included a QuickDraw 3D-based palette for creating 3D primitives and renderings.
Version 7 of the software saw an internal extrusion engine being used instead of QuickDraw 3D.
At version 8, it was the first of the complex graphics programs to be "Carbonized" to run on both Classic and Mac OS X.
In April 2003, Deneba Systems was acquired by ACD Systems of Victoria, BC, Canada, the developers of Windows image editing and handling software such as ACDSee, before the release of version 9. Canvas development continued in Miami, under the aegis of ACD Systems of America. Later, in 2017, it was spun out as Canvas GFX.
With the introduction of Canvas 11, support for the Macintosh platform was dropped, making the application Windows-only.
Canvas is available in a standard and extended version. The once-optional Scientific Imaging module is now integrated into Canvas and provides enhanced input-output filters for file formats commonly used in science and engineering visualization. The geographic information system (GIS) module provides tools for use in mapping and GIS-based data analysis.
Following the release of the Windows-only
|
https://en.wikipedia.org/wiki/Moetan
|
is a series of English language study aids published by SansaiBooks in Japan. Targeted at otaku, it attempted to teach English words using examples drawn from computer games and anime.
In the reprint of the first Moetan book and the bath towel sold during Comic Market 69, "MOETAN" stands for 'Methodology Of English, The Academic Necessity'. The acronym may have been chosen as a play on combining the words moé and -tan, both terms of cuteness used in relation to girl characters in anime, to create a portmanteauic double meaning.
Moeru Eitango Moetan
Moeru Eitango Moetan (萌える英単語 もえたん), also known as The Moetan Wordbook, is the first in the Moetan series, published in 2003.
Each chapter consists of a short story, written in pure Japanese, concerning the adventures of "Nao-kun" (a high school student) and "Ink-chan" (a mysterious magical girl who arrives to help him with his studying), followed by a set of word examples.
In 2005-3-25, the book was revised with improved grammar, and retitled 'MOETAN Methodology Of English, The Academic Necessity' (もえたん Methodology Of English, The Academic Necessity). This version was published in Korean and Traditional Chinese (Taiwan, Hong Kong).
The Chinese version was published by Min-Hsien Cultural Enterprise Co., Ltd.
Characters
- Heroine of Moetan. She lives next door to Nao and is infatuated with him.
- The transformed version of Ink Nijihara, differentiated by the blue hair and duck costume.
- A well liked but lazy high school student.
- A magician in the magical kingdom, usually in the form of a duck.
- A magician in the form of a pencil.
- A magician in the form of an eraser.
- A magician in the magical kingdom, usually in the form of a cat.
Voice cast (CD version)
Ink Nijihara: Yukari Tamura
Nao-kun: Yuji Ueda
Ah-kun: Masaya Onosaka
Moetan II
The sequel of Moeru Eitango Moetan was published in two volumes. It includes 1601 words.
Moetan II is available in Chinese (Taiwan, Hong Kong) and Korean (South Korea).
This book is targeted towards serious, tutorial readers.
Characters
Tōya (透也) - Moetan II'''s protagonist.
Yuni (優仁) - Moetan II's heroine.
Chitose (千歳) - Touya and Yuni's classmate.
Moetan subreader
AKA -> (もえたん サブリーダー 〜文法·表現編〜)
Based on previous two books in the Moetan series, it teaches English grammar.
This book is targeted towards casual, tutorial readers.
Moetan 3
AKA -> (もえたん3 魔法少女の帰還〜Return of the Little Witch〜)
This version added poetry and Japanese culture. The book included two stories: Bill and Sam's Excellent Adventure and Return of the Little Witch. Return of the Little Witch was illustrated by POP.
This book is targeted towards casual, entertainment readers.
Chinese version was published on September 9, 2006 by Min-Hsien Cultural Enterprise Co., Ltd.
This book features characters from first Moetan book.
Moetan Online
This is a series of phone applications published by Marvelous Liveware. They are available to i-mode, EZWeb, and SoftBank Mobile users.
Moetan Lis
|
https://en.wikipedia.org/wiki/Yoix
|
In computer programming, Yoix is a high-level, general-purpose, interpreted, object-based, dynamic programming language. The Yoix interpreter is implemented using standard Java technology without any add-on packages and requires only a Sun-compliant JVM to operate. Initially developed by AT&T Labs researchers for internal use, it has been available as free and open source software since late 2000.
History
In 1998, Java technology was still emerging: the Swing toolkit was an add-on package; interruptible I/O, regular expressions, and a printf capability were not yet features; nor had Java Web Start been developed. Moreover, Java scripting languages were largely non-existent at that time: Groovy and JRuby had not yet been invented and Jython had just been created in late 1997. Browsers in 1998 had limited feature sets, were too unstable for production use in an 8-hour shift and were still fighting skirmishes in the Browser Wars. In this environment, Yoix technology was created in response to a pressing need for a reliable, easy to distribute and maintain, GUI front-end for a mission-critical application being developed within AT&T, namely its Global Fraud Management System, which to this day monitors and tracks fraud activity related to voice traffic on AT&T's expanding networks: wireline, wireless, and IP. Yoix technology was first released to the public in late 2000 under the Open Source Initiative Common Public License V1.0.
The Yoix name came about partially from the fox hunting cry of encouragement to the hounds, partially to echo another familiar four-letter name that ends in ix, and partially to avoid too many false-positives in a Google search.
Overview
Yoix technology provides a pure Java programming language implementation of a general purpose dynamic programming language developed by researchers at AT&T Labs. Its syntax and grammar should be easy to learn for those familiar with the C programming language and Java. To an end-user, a Yoix application is indistinguishable from a Java application, but to the application developer Yoix should provide a simpler coding experience than working in Java directly, much like writing Perl code can be simpler than writing C code.
Features
The Yoix language is not an object oriented language, but makes use of over 165 object types that provide access to most of the standard Java classes. Because the Yoix interpreter is built entirely using Java technology, it means that Yoix applications are cross-platform, GUI-capable and both network and thread friendly, yet Yoix developers find themselves insulated from the more complex and error-prone parts of coding the same functionality directly in Java. It does not use reflection to access Java functionality and thus adds value by not only simplifying access to that functionality, but also improving application reliability by coding through both Java glitches and complicated Java features one-time, behind-the-scenes. The Yoix language includes safe poin
|
https://en.wikipedia.org/wiki/Trash%20%28video%20game%29
|
Trash is a real-time strategy computer game developed by Inhuman Games for the Microsoft Windows operating systems. It was released on September 20, 2005.
Storyline
The game takes place in a post-apocalyptic future where, after the great nuclear war of 2015, peace treaties were signed, nuclear weapons were destroyed, and civilization was slowly rebuilt. However, 8 years after treaties were signed, a fleet of alien ships appeared outside Earth's atmosphere. Several super weapons were fired from the largest of the alien spacecraft, the resulting explosions causing major alterations to Earth's geography. Fearing for the lives of every human on earth, the United States Government unleashed its hidden nuclear arsenal on the alien ships. The resulting explosions rained down onto the planet, causing buildings to be destroyed and the air to be poisoned by radiation. As a result, in 10 hours, 5 of the 9 billion humans on Earth were killed.
The remaining smaller alien ships traveled into Earth's atmosphere, but never landed due to resistance by the remaining humans on earth.
After the alien ships left, mutants slowly began to appear, initially doing nothing more than raiding human settlements for building materials and kidnapping humans. As these incidents were few and far between, and by now many people had lost much of their families and other social contacts, most of these went unnoticed.
However, the mutants had their own plans. The mutants were hybrids of the aliens that came to conquer Earth. They injected captured humans with their own DNA, causing them to mutate. Eventually, the mutants' forces were strong enough to take on the humans. The mutants deployed their forces, and the war between the humans and mutants began.
Gameplay
Trash consists of two species: Humans and Mutants. A machine race is to be added in a sequel, but for now this has been left out as Inhuman Games is a very small team, and want to focus their efforts on the humans and mutants.
The gameplay is focused mostly on multiplayer skirmishes. There are now single player campaigns, although they are still in beta mode, and there is an AI for single player skirmishes though it is not highly advanced. One integral feature is that if a human and a mutant are allied then they are able to benefit from each other's technology; something that most games do not allow. This does somewhat contradict the game story, but the story is not a central focus of the gameplay.
The main resource in the game, used by both races, is trash. Trash is used as a building material for almost every unit in the game. It must be collected by Dump Trucks or Thralls, which are the collection and building units for humans and mutants respectively. Both of these units are collectively referred to as peons.
There are two other resources in the game, Gas and People. Gas is used as a resource only by humans, while people are as a resource only used by mutants. Gas is gathered by building a refinery on top of a g
|
https://en.wikipedia.org/wiki/Farid%20F.%20Abraham
|
Farid F. Abraham (born May 5, 1937) is an American scientist.
He has pioneered new methods of using computer modeling in the fields of fracture mechanics, membrane dynamics and phase transformation behavior of matter. He has written two textbooks and over 200 papers published in international journals. He won the Aneesur Rahman Prize in Computational Physics, which is the highest prize given by the American Physical Society.
Biography
Abraham is a native of Phoenix, Arizona and received both his B.S. (1959) and Ph.D. (1962) degrees in physics from the University of Arizona. He spent two postdoctoral years (1962–63) at the Enrico Fermi Institute at the University of Chicago and two years as a research scientist at the Lawrence Livermore National Laboratory in California. He joined IBM in 1966 as a staff member at its Palo Alto Scientific Center. In 1971, he was named the first Consulting Professor at Stanford University and developed a graduate course in computational applied science in its Materials Science Department. In 1972, he moved to the IBM Research Division's San Jose Research Laboratory, known since 1985 as the Almaden Research Center. During 1994, he held the Sandoval Vallarta Chair at the Universidad Autonoma Metropolitana in Mexico City.
For the period of 1995 to 2003, he was awarded several computer grants at the National Science Foundation Computational Centers and Department of Defence Grand Challenge Grants at the Maui High Performance Computing Center (MHPCC). He has been awarded several IBM Outstanding Technical Achievement Awards. He is a Fellow of the American Physical Society and, in 1998/99, was an American Physical Society Centennial Speaker. He was the Chair of the American Physical Society's Division of Computational Physics in 2000-2001. He was elected the recipient of the Alexander von Humboldt Research Award for Senior Scientists. In March 2004, he received the Aneesur Rahman Prize for Computational Physics from the American Physical Society. Retiring from IBM in 2004, he joined Lawrence Livermore National Laboratory as a Senior Scientist and was named the Graham-Perdue Visiting Professor at The University of Georgia. In 2010, he retired from LLNL. For over four decades he has pursued a wide range of computational physics applications, mainly in condensed matter physics and chemical physics.
Bibliography
Abraham, Farid F., and Tiller, William A. (1972) An Introduction to Computer Simulation in Applied Science. New York: Plenum Press.
Abraham, Farid F. (1974) Homogeneous Nucleation Theory, New York: Academic Press
Living people
University of Arizona alumni
1937 births
Place of birth missing (living people)
American scientists
Computational physicists
IBM employees
Humboldt Research Award recipients
Fellows of the American Physical Society
|
https://en.wikipedia.org/wiki/FSSP
|
FSSP may refer to:
Families of structurally similar proteins, a protein structures database
Federal Bailiffs Service (Russia), abbreviated FSSP in Russian
Firing squad synchronization problem, a problem in computer science and cellular automata
Frances Slocum State Park, a state park in Luzerne County, Pennsylvania
Priestly Fraternity of Saint Peter, a society of traditionalist Catholic priests and seminarians
Fresh Start Schools Programme, a programme for schools in South Africa
Forward Scattering Spectrometer Probe, a class of optical instruments designed to measure size and concentration of particles suspended in the air (such as cloud droplets)
|
https://en.wikipedia.org/wiki/WSAV-TV
|
WSAV-TV (channel 3) is a television station in Savannah, Georgia, United States, affiliated with NBC, The CW Plus, and MyNetworkTV. Owned by Nexstar Media Group, the station maintains studios on East Victory Drive/US 80/SR 26 in Savannah's Live Oak section, and its transmitter is located on Little Neck Road in unincorporated northwestern Chatham County, near Pooler.
History
The station began broadcasting on VHF channel 3 on February 1, 1956 and was co-owned with WSAV radio (630 AM; later WBMQ) after a long legal battle over the frequency with the owners of WJIV (900 AM). It initially aired an analog signal from a transmitter on top of a bank building on Broughton Street in Downtown Savannah. The flashing WSAV sign was a landmark on the street for many years. WSAV radio had long carried NBC Radio programming, so WSAV-TV took the NBC television affiliation.
It shared ABC with CBS affiliate WTOC-TV (channel 11) until 1970, when WJCL-TV (channel 22) started operations as a full-time ABC affiliate. During the late 1950s, WSAV-TV was also briefly affiliated with the NTA Film Network. WSAV briefly had an FM station using an antenna atop the middle of three AM towers at the transmitter facility on Oatland Island. However, without many listeners to the simulcast programming, the FM operation was ended in the 1950s.
In 1960, WSAV-AM-TV moved into a brand-new facility on Victory Drive, where WSAV-TV still is located today. A new tower was built at the site boosting its signal to many of the surrounding counties in Georgia and South Carolina. The current tower near Pooler was built in 1976. In the same year, the WSAV stations were sold to different parties, with WSAV-TV going to the News-Press & Gazette Company. In 1982, the station swapped affiliations with WJCL and became an ABC affiliate. That network had become number one in the country and was searching for stronger affiliates. However, by 1985, WSAV was one of several ABC affiliates nationwide that were disappointed with the network's weak prime time programming offerings, particularly on Thursday nights, which were bogging down WSAV's otherwise successful lineup. Meanwhile, WSAV returned to NBC a mere three years later in 1985, one year before that network became number one again, reversing the 1982 affiliation swap.
In the 1990s, like many other commercial television stations in the United States, WSAV was sold several times. NPG sold its entire broadcasting group of the time to the first incarnation of New Vision Television in 1993. Ellis Communications bought the New Vision stations in 1995.
In 1996, Ellis was sold to Retirement Systems of Alabama who merged it with AFLAC's former broadcasting division to form Raycom Media. Since AFLAC had owned rival WTOC, Raycom could not keep both stations due to Federal Communications Commission (FCC) regulations at the time forbidding common ownership of two stations in the same market; this rule would be partially repealed in 2000 when the FCC allowed c
|
https://en.wikipedia.org/wiki/Rio%20de%20Janeiro%20Metro
|
The Rio de Janeiro Metro (, ), commonly referred to as just the Metrô () is a rapid transit network that serves the city of Rio de Janeiro, Brazil. The Metrô was inaugurated on 5 March 1979, and consisted of five stations operating on a single line. The system currently covers a total of , serving 41 stations, divided into three lines: Line 1 (); Line 2 (), which together travel over a shared stretch of line that covers 10 stations of an approximate distance of ; and Line 4 (). Metrô Rio has the second highest passenger volume of the metro systems in Brazil, after the São Paulo Metro.
Line 1 (orange line) serves downtown Rio, tourist areas in the South Zone, and several neighbourhoods in the North Zone. It is a semicircular line, and is fully underground. It runs from Uruguai Station to Ipanema/General Osório Station. Line 2 (green line) serves working-class residential neighborhoods extending toward the north. It is a northwest-to-southeast line, and almost completely above-ground (mostly at grade and partly elevated). This line started as a light rail, but due to increasing numbers of commuters, it gradually changed to rapid transit or metro. Because of its origin as light rail, it is at grade except for Estácio Station (the former connection station between lines 1 and 2), which is underground and Cidade Nova Station, which is elevated, and Line 4 (yellow line), connecting Barra da Tijuca/Jardim Oceânico Station in the West Zone to Ipanema/General Osório Station on Line 1.
The Government of the State of Rio de Janeiro remains responsible for the expansion of the metro network through Rio Trilhos. In late December 2007, the lease was renewed until 2038 and Metrô Rio assumed responsibility for the construction of Cidade Nova Station , which serves as a link between Line 2 and Line 1 ending the need to transfer stations, with the purchase of 114 cars, and construction of Uruguai Station, extending Line 1 further north.
The extension works of Line 2, called Line 1A, which ended the need for a transfer at Estácio Station and allowed the direct connection from Pavuna Station to Botafogo were started by Metrô Rio on 13 November 2008, and the tracks were completed in December 2009. With the extension, the 250 thousand passengers that circulate daily on Line 2 do not need to change trains any more in order to get to the South Zone. The interconnection of the two metro lines will reduce, by up to 13 minutes, the journey time from Pavuna station to the city's downtown, the destination of 83% of Line 2's passengers.
History
Rio de Janeiro is the second largest city in Brazil and the most popular tourist attraction in the country. After 1950, the number of motor vehicles on the roads increased dramatically. Rio de Janeiro lies in a hilly region, between the mountains and the Atlantic Ocean. The landscape of the city is extremely uneven, making travelling by car or bus a very time-consuming task through the narrow streets. These conditions are ideal f
|
https://en.wikipedia.org/wiki/ZipZoomfly
|
ZipZoomfly was an internet retailer for computer parts and related products. Based in Newark, California, ZipZoomfly was founded in May 1999 under the name XtraPlus. The site relaunched in January 2000 as Googlegear. ZipZoomfly is a U.S. service mark of Xtraplus Corporation.
Name change
A formal complaint by Google to an ICANN domain-name dispute resolution provider led to the company changing its name from Googlegear to ZipZoomFly in 2003. The domain googlegear.com is now owned by Google, was redirected to a Google page that used to explain that Googlegear had never been associated with Google and provided a link to zipzoomfly.com, but it now it displays an HTTP 404 error.
Mascot
The original mascot of Googlegear was a smiling bean-shaped cartoon character as the first letter "O" in the name. Named GoogleGuy, the mascot was shown giving a thumbs-up sign with one of his two floating hands. The U.S. trademark filing describes GoogleGuy as an edible nut without a shell. Nevertheless, the website claimed that GoogleGuy was neither a bean nor a pancake, but a numeral "zero" from the virtual googol of products they carried.
Claims of fraud
Several customers accused ZipZoomFly of committing "rebate fraud" or promising good deals on technology once rebates are applied. Several reports indicated that the company failed to follow up on rebates, making false claims of refunding money lost through rebate fraud.
On January 5, 2011, the company's Better Business Bureau (BBB) accreditation was revoked due to failure to respond to one or more customer complaints filed with the BBB.
In November 2011, the company's BBB rating was again listed as their highest rating: A+.
Their web site was marked "closed for maintenance" beginning August 21, 2011.
In March 2012, the website was updated to read:
In May 2012 the website went offline permanently.
References
External links
ZipZoomfly's website
ZipZoomfly's ResellerRatings.com Page
Online retailers of the United States
1998 establishments in California
Companies based in Newark, California
Retail companies established in 1998
Internet properties established in 1998
|
https://en.wikipedia.org/wiki/Mock%20object
|
In object-oriented programming, mock objects are simulated objects that mimic the behaviour of real objects in controlled ways, most often as part of a software testing initiative. A programmer typically creates a mock object to test the behaviour of some other object, in much the same way that a car designer uses a crash test dummy to simulate the dynamic behaviour of a human in vehicle impacts. The technique is also applicable in generic programming.
Motivation
In a unit test, mock objects can simulate the behavior of complex, real objects and are therefore useful when a real object is impractical or impossible to incorporate into a unit test. If an object has any of the following characteristics, it may be useful to use a mock object in its place:
the object supplies non-deterministic results (e.g. the current time or the current temperature);
it has states that are difficult to create or reproduce (e.g. a network error);
it is slow (e.g. a complete database, which would have to be prepared before the test);
it does not yet exist or may change behavior;
it would have to include information and methods exclusively for testing purposes (and not for its actual task).
For example, an alarm clock program which causes a bell to ring at a certain time might get the current time from a time service. To test this, the test must wait until the alarm time to know whether it has rung the bell correctly. If a mock time service is used in place of the real time service, it can be programmed to provide the bell-ringing time (or any other time) regardless of the real time, so that the alarm clock program can be tested in isolation.
Technical details
Mock objects have the same interface as the real objects they mimic, allowing a client object to remain unaware of whether it is using a real object or a mock object. Many available mock object frameworks allow the programmer to specify which, and in what order, methods will be invoked on a mock object and what parameters will be passed to them, as well as what values will be returned. Thus, the behavior of a complex object such as a network socket can be mimicked by a mock object, allowing the programmer to discover whether the object being tested responds appropriately to the wide variety of states such mock objects may be in.
Mocks, fakes, and stubs
Classification between mocks, fakes, and stubs is highly inconsistent across the literature. Consistent among the literature, though, is that they all represent a production object in a testing environment by exposing the same interface.
Which out of mock, fake, or stub is the simplest is inconsistent, but the simplest always returns pre-arranged responses (as in a method stub). On the other side of the spectrum, the most complex object will fully simulate a production object with complete logic, exceptions, etc. Whether any of the mock, fake, or stub trio fits such a definition is, again, inconsistent across the literature.
For example, a mock,
|
https://en.wikipedia.org/wiki/Blade%20PC
|
A blade PC is a form of client or personal computer (PC). In conjunction with a client access device (usually a thin client) on a user's desk, the supporting blade PC is typically housed in a rack enclosure, usually in a datacenter or specialised environment. Together, they accomplish many of the same functions of a traditional PC, but they also take advantage of many of the architectural achievements pioneered by blade servers.
Description
Like a traditional PC, a blade PC has a CPU, RAM and a hard drive. It may or may not have an integrated graphics sub-system. Some can support multiple hard drives. It is in a “blade” form that plugs into an enclosure. Enclosures offered by current blade PC vendors are similar but not identical. Most have moved the power supplies, cooling fans and some management capabilities from the blade PC to the enclosure. Up to 14 enclosures can be placed in one industry standard 42U rack.
Blade PCs support one or more common operating systems (for instance Microsoft has created a “blade PC” version of their XP and Vista Business operating systems and many Linux distributions are installable). Importantly, these solutions are intended to support one user per discrete device. This is a major difference from server-based computing, which supports multiple users simultaneously using an application hosted on one discrete server (be it a discrete piece of hardware or a discrete virtual machine on a server).
Access to the device is usually achieved via various Virtual Network Computing (VNC), which allows users to log on to the blade PC via a client device (usually a thin client). Once logged on the end user experience is largely the same as if they were logged on to a local PC. It is less effective at delivering multimedia, in part because the audio and video are not synchronized, so in circumstances where there is increasing latency, there is a proportional decrease in the quality of the end user experience. All protocols are negatively impacted by increasing latency between the end user’s access device and the blade PC. One of the biggest challenges the blade PC vendors have experienced is how to minimize the impact of latency and deliver an end user experience comparable to that offered by a traditional PC, and there has been a number of new entrants in this sub-category of the blade PC in 2007.
International Data Corporation recognizes blade PCs as a category separate from other types of PCs and has begun issuing forecasts for blade PCs.
History and vendors
ClearCube, a small privately held company based in Austin, Texas, gets credit for creating and popularizing the category. Started in the late 1990s, they have been very aggressive promoting the concept especially in the United States and in vertical markets such as financial traders, hospitals and national defense organizations.
HP was second to the category with the 2004 announcement of their “Consolidated Client Infrastructure” in North America. In contrast to
|
https://en.wikipedia.org/wiki/Mulawin
|
Mulawin is a Philippine television drama fantasy series broadcast by GMA Network. Directed by Don Michael Perez and Dode Cruz, it stars Richard Gutierrez, Angel Locsin and Dennis Trillo. It premiered on August 2, 2004 on the network's Telebabad line up. The series concluded on March 18, 2005 with a total of 166 episodes. It was replaced by Darna in its timeslot.
The success of the series led to television spin-offs: Encantadia in 2005 and Iglot in 2011. While continuations of the series, the film Mulawin: The Movie was released in 2005 and the television series Mulawin vs. Ravena was broadcast in 2017.
The series is streaming online on YouTube.
Premise
The story centers around the species called "Mulawin" who once helped the humans save mother nature, then withdrew themselves and hid in the mountains due to humanity's greed. In the meantime a rebel band of Mulawins called "Ravena" sought revenge against the humans. The peace between the humans and Mulawins depends on Aguiluz, the protector and Alwina, the envoy.
Cast and characters
Lead cast
Richard Gutierrez as Aguiluz / Aguilar
Angel Locsin as Alwina
Dennis Trillo as Gabriel
Supporting cast
Ara Mina as Vultra / Violeta / Veronica
Gary Estrada as Rasmus
Amy Austria as Lourdes
Zoren Legaspi as Bagwis
Romnick Sarmenta as Habagat
Lloyd Samartino as Lucio Montenegro
Karen delos Reyes as Savannah Montenegro
Bearwin Meily as Kuwak / Makisig
Bryan Revilla as Lino
Pia Pilapil as Lucila Montenegro
Marissa Sanchez as Tuka
Alicia Alonzo as Rosing
Kiel Rogriduez as Terong
Bianca King as Aviona
Jaja Bolivar as Biba
Happy Lynn Sy as Yolly
Eddie Gutierrez as Dakila
Recurring cast
Miguel Tanfelix as Pagaspas / Gas
Sam Bumatay as Lawiswis / Wis
Tricia Roman as Pamela
Michael de Mesa as Ravenum
Guest cast
Kurt Perez as young Aguiluz
Kristel Fulgar as young Alwina
Paul Salas as young Gabriel
Shamel Leask as young Aviona
Eunice Lagusad as young Biba
Carmina Villaroel as Ina / Salimbay
Tanya Garcia as Paloma
Isabella de Leon as Mayi
Rainier Castillo as adult Pagaspas
Denise Laurel as adult Lawiswis
Eagle Riggs as Dak-dak
Bidz dela Cruz as Ngas-ngas
Sasi Casas as Gad-gad
Ang-ang - Portrayed by
Michael Roy Jornales as Kuskos
Musmos - Portrayed by
Sakmal - Portrayed by
Jeff Carpio as Laab
Hampas - Portrayed by
Procopio - Portrayed by
Bianca- Portrayed by
Princess Punzalan as Maningning
Cristine Reyes as Estrea
Shermaine Santiago as Oyayi
Ehra Madrigal as Dalaginding
Giselle Toengi as Ynang Reyna
Sheryl Cruz as Linang
Nancy Castiglione as Muyak
James Blanco as Aramis
Ian Veneracion as Panabon
Bettina Carlos as Florona
Katarina Perez as Banayad
Mayumi - Portrayed by
Daluyong - Portrayed by
Jay Aquitania as Mulagat
Edwin Zarate as Lumbas
Roi Vinzon as Daragit
Balasik - Portrayed by
Geneva Cruz as Haraya
Botchok - Portrayed by
Ching ching - Portrayed by
Caloy / Laki / Hidalgo
Sequels
A direct sequel to the series, the film Mulawin: The Movie
|
https://en.wikipedia.org/wiki/A%2Amazing
|
A*mazing is an Australian children's television game show that aired between 16 May 1994 until 1998 on the Seven Network. It was famous for a relatively large and elaborate maze/obstacle course that was part of the show's studio set. A*mazing was hosted by James Sherry for the entire run of the series. A*mazing was produced at Channel 7 in Brisbane from 1994–1996 and then at Channel 7 in Perth from 1997–1998.
Format
The show pitted teams from two different primary schools against each other during the course of a week. Points gained by each contestant during the week would be totalled up to decide the winning school at the end of each week. There were two rounds of a game called "Timezone", each followed by a maze run, then the contestants competed in a "computer challenge" on a video game.
Timezone
In Timezone, a 90-second countdown timer begins, and Sherry begins to provide clues to a word or phrase to the first school's contestants. Contestants have to correctly guess the word or phrase before running down to a large QWERTY keyboard mounted on the floor and stepping on the letters to spell it out. The process is repeated for the second school. If contestants were unable to guess the word initially, the clues would get easier until the word was spelled out by Sherry. The time remaining determines how many points they get, plus how long each school gets to spend in the maze during round two.
Maze Run
After both teams had completed Timezone, one contestant from each school would enter the maze and attempt to collect the letters of the answer which are hidden in such places as a garbage can, or behind a mock cactus. Ten points are given for every letter they retrieve inside the maze before their time runs out.
Occasionally, the maze would include letters that are not part of the answer; if a contestant collected these superfluous letters, they would not receive any extra points in addition to the points earned by collecting the valid letters.
Computer Challenge
After the teams had completed two maze runs, the contestants competed in a video game face off. During the course of the show, three different gaming platforms, all provided by sponsor Nintendo, were used. Originally, the Super Nintendo Entertainment System (1994–1996), and later the Nintendo 64 (1997–1998).
Games played included Tetris, Bubsy, Donkey Kong Country, Donkey Kong Country 2: Diddy's Kong Quest, Super Mario World, Nigel Mansell's World Championship, Plok, Pac-Attack, 1080° Snowboarding, Donkey Kong Country 3: Dixie Kong's Double Trouble!, Wave Race 64, Super Mario Kart, Mario Kart 64, San Francisco Rush, Multi-Racing Championship, Cruis'n USA, Diddy Kong Racing, Super Mario 64, Unirally, Winter Gold, Super Mario Bros. 3, Super Tennis, Cruis'n World, and the fly-swatting minigame from Mario Paint.
The team with the most points/fastest time win 50 points for their team, while runners-up in this challenge win 25 points for their team. Should there be a tie (e.g. both teams s
|
https://en.wikipedia.org/wiki/Super%20RTL
|
Super RTL is a German free-to-air television network owned by RTL Deutschland. The channel originally launched in 1995 as a joint venture between RTL Group predecessor company CLT-UFA and Disney's Buena Vista International Television Investments (later Disney International Operations) division.
The channel operates under three different programming slots - Toggolino, which is aimed at pre-schoolers, Toggo, which is aimed at mainstream children, and RTL Super, which is aimed at families and young adults.
History
On 24 August 1994, with Jeffrey Katzenberg's resignation, a reorganization of Disney Company took place in which Richard Frank became head of newly formed Disney Television and Telecommunications (DTT), which included Walt Disney Television International, which held Disney's Super RTL stake. The Luxembourgish CLT (owners of the German RTL channel) made a deal with Disney to form RTL Disney Fernsehen GmbH & Co. in 1995.
Super RTL
Super RTL was finally launched on 28 April 1995, with The New Adventures of Winnie the Pooh as its first ever program (aside from showing Disney Channel's "TV" ident, Super RTL is not owned by Disney Branded Television, instead, it was owned by Disney's Buena Vista International Television Investments division). The Disney-CC/ABC merger led to DTT being split up in April 1996, Walt Disney Television International was transferred to Capital Cities/ABC in that same month. CC/ABC combined the international units, Walt Disney Television International and ACIBG, into Disney–ABC International Television (DAIT) in July. Around the same time, in the 1990s, Bertelsmann ultimately came out on top after having gradually increased its stake in the German television channel RTL. Following a legal dispute with RTL/CLT, Bertelsmann announced plans to merge the television businesses of UFA to form the joint venture CLT-UFA in April 1996. A merger agreement was signed on 8 July 1996. It was approved by the CLT board of directors on 5 December, and the formation of CLT-UFA was completed on 14 January 1997. As a result, German television channels such as RTL Television and VOX and international broadcasting services, including M6 in France, were all brought together under one roof.
The Fun & Action Tour, a Germany-wide roadshow event for children, was started in 1997 featuring TV program characters. The tour was later renamed the Toggo Tour. The following year, the channel became the top view channel by the 3-to-13-year-old target age group.
In 1999, the joint venture saw its channel make a net profit of DM 4.5 million, launched its website and started the Super RTL Licensing Agency to make more revenues from TV licensing. A new managing director, Claude Schmit, took charge of the venture in 2000.
Also in 2000, the preschool programming is labeled "Toggolino". Toggolino Club is started in 2002 and offers paid pre-school children education content.
The Toggo umbrella brand was introduced in 2001 for all activities for 6- to 13-
|
https://en.wikipedia.org/wiki/Captain%20Power%20and%20the%20Soldiers%20of%20the%20Future
|
Captain Power and the Soldiers of the Future is a science fiction-action television series, merging live action with animation based on computer-generated images, that ran for 22 episodes in Canadian and American syndication. A toy line was also produced by Mattel, and during each episode there was a segment that included visual and audio material which interacted with the toys. A production of Landmark Entertainment Group, Captain Power and the Soldiers of the Future was created by Gary Goddard and Tony Christopher, and developed by Marc Scott Zicree, with J. Michael Straczynski becoming de facto head writer. Plans to bring the series back, set 28 years after the first series, were announced in July 2016. Goddard Film Group, headed by one of the original series co-creators, Gary Goddard, was one of the development teams working on the new series.
General plot
The storyline was set on Earth in the 22nd century following the Metal Wars, a cybernetic revolt that resulted in the subjugation of the human race by intelligent machines. Captain Jonathan Power and a small group of guerrilla fighters, called the "Soldiers of the Future", oppose the machine forces that dominate Earth.
Central storyline
Each episode began with the following introduction, plus a recap of the storyline:
"Power on". Actor Timothy Dunigan, outfitted in his character's full regalia (one of the "Power Suits" of exoskeletal armor that Robert Short Productions created for the show), turned to the camera and delivered this line.
Voiceover artist Brad Crandall:
By the year 2132, advanced robotic soldiers known as "Bio-Mechs" had replaced humans in the armed forces of the world's nations. The existence of Bio-Mechs meant that wars could be fought without significant loss of life, allowing turning war into a nearly harmless battle between machines. A group of scientists, led by Dr. Stuart Gordon Power (Bruce Gray), had begun working on an advanced supercomputer, called OverMind, capable of overriding the control systems which the world's armed forces used to operate the Bio-Mechs, and thus stop them, bringing an end to war. It required an equivalent to human brain patterns to become operational. But Dr. Power's closest associate, Dr. Lyman Taggart (David Hemblen), became impatient with the slow pace of the project and hooked himself up to the system, bringing the supercomputer to operational status.
With the new opportunities offered by the human-machine combination, Taggart becomes obsessed with the precision and "perfection" of machines and convinces himself that merging human consciousness with mechanical bodies is the next step in human evolution. OverMind achieves self-awareness and shares Taggart's beliefs as they take over Bio-Mech armies throughout the world and attack humanity in a conflict known as the Metal Wars.
World governments turn to Dr. Power for find a way to stop Taggart. He develops the "Power Suits", a combination of exoskeletal body armor and advanced weapo
|
https://en.wikipedia.org/wiki/Jet%20Set%20Willy%20II
|
Jet Set Willy II: The Final Frontier is a platform game released 1985 by Software Projects as the Amstrad CPC port of Jet Set Willy. It was then rebranded as the sequel and ported other home computers. Jet Set Willy II was developed by Derrick P. Rowson and Steve Wetherill rather than Jet Set Willy programmer Matthew Smith and is an expansion of the original game, rather than an entirely new one.
Gameplay
The map is primarily an expanded version of the original mansion from Jet Set Willy, with only a few new elements over its predecessor several of which are based on rumoured events in JSW that were in fact never programmed (such as being able to launch the titular ship in the screen called "The Yacht" and explore an island). In the ZX Spectrum, Amstrad CPC and MSX versions, Willy is blasted from the Rocket Room into space, and for these 33 rooms he dons a spacesuit.
Due to the proliferation of hacking and cheating in the original game, Jet Set Willy II pays homage to this and includes a screen called Cheat that can only be accessed by cheating.
Control of Willy also differs from the original:
The player can jump in the opposite direction immediately upon landing, without releasing the jump button.
Willy now takes a step forward before jumping from a standstill.
Some previous "safe spots" in Jet Set Willy are now hazardous to the player in Jet Set Willy II - the tall candle in "The Chapel" for example.
The ending of the game is also different.
Development
Jet Set Willy II was originally created as the Amstrad conversion of Jet Set Willy by Derrick P. Rowson and Steve Wetherill, but Rowson's use of an algorithm to compress much of the screen data meant there was enough memory available to create new rooms.
It came with a form of enhanced copy protection called Padlock II. To discourage felt tip copying, it had seven pages, rather than the single page used in Jet Set Willy.
Software Projects later had Rowson remove all of the enhancements from the Amstrad version to produce a straight conversion of the original ZX Spectrum version of Jet Set Willy. This version was included on the Ocean Software compilation They Sold A Million released in November 1985.
Ports
The game was ported to the ZX Spectrum, Commodore 64, Commodore 16, BBC Micro, Acorn Electron, and MSX.
Rowson ported the game to the Spectrum alone as Steve Wetherill had moved to Odin Computer Graphics. It has a number of small differences, including the loss of coloured backgrounds in certain screens as the CPC version ran in a 4-colour display mode. In an in-depth article about both the game and the code, Your Spectrum stated that as each room was compressed and took up differing amounts of memory, "a room editor would be virtually impossible to write."
The BBC Micro cassette version has 2 rooms not in the ZX Spectrum version, and omits 60 of the rooms, rather than being a subset of it as are the CPC and ZX Spectrum versions.
The C64 screen was a different format to the Amstr
|
https://en.wikipedia.org/wiki/Kanal%205%20%28Croatia%29
|
Kanal 5 (en:Channel 5) is a Croatian commercial television station operating in the city of Split.
It was founded in 2005 and its programming consists mostly of various talk shows dealing with local issues.
External links
Kanal 5 (Croatia) at LyngSat Address
Television channels in Croatia
Mass media in Split, Croatia
Television channels and stations established in 2005
2005 establishments in Croatia
|
https://en.wikipedia.org/wiki/Silicon%20Beach%20Software
|
Silicon Beach Software, Inc., was an early American developer of software products for the Macintosh personal computer. It was founded in San Diego, California in 1984 by Charlie Jackson and his wife Hallie. Jackson later co-founded FutureWave Software with Jonathan Gay. FutureWave produced the first version of what is now Adobe Flash. Although Silicon Beach Software began as a publisher of game software, it also published what was called "productivity software" at the time.
History
Silicon Beach's best known "productivity software" product was SuperPaint, a graphics program which combined features of Apple's MacDraw and MacPaint with several innovations of its own. SuperPaint2 and Digital Darkroom were the first programs on the Macintosh to offer a Plug-in Architecture, allowing outside software developers to extend both programs' capabilities. Silicon Beach coined the term "plug-in".
Silicon Beach was a pioneer in graphic tools for desktop publishing. Not only was SuperPaint a tool that had advanced graphic editing capabilities for its day, but Digital Darkroom was also a pioneering photo editor. It was grayscale only, not color (like the early Macintosh computers), but had a number of interface innovations, including the Magic Wand tool, which also appeared later in Photoshop. It also had a proprietary option for printing grayscale content on dot matrix printers. Digital Darkroom was used professionally to clean up scanned images for clip art libraries.
Another Silicon Beach product was SuperCard which, like SuperPaint, superseded the capabilities of an Apple-branded product (in this case, HyperCard). SuperCard used a superset of the HyperTalk programming language and addressed common complaints about HyperCard by adding native support for color, multiple windows, support for vector images, menus and other features.
Silicon Beach Software produced video games for the Macintosh. The most well known is Dark Castle released in 1986. It was ported to several other operating systems by other companies. Sequel Beyond Dark Castle was Silicon Beach's last game, because productivity software was much more lucrative. Their 1985 release, Airborne!, was the first Macintosh game to feature digitized sound.
Silicon Beach Software is credited with coining the term Silicon Beach to refer to San Diego in the same way that Silicon Valley refers to the Santa Clara Valley and San Jose area.
Silicon Beach was acquired by Aldus Corporation in 1990 and Aldus, in turn, by Adobe Systems in 1994.
Other products
Airborne! (1985) combat game. A demo before the game was released was called Banzai!.
Enchanted Scepters (1984) Point-and-click adventure game made with the engine that later became World Builder.
World Builder (1986) graphical adventure game authoring package.
Apache Strike (1987) 3D helicopter game.
Beyond Dark Castle (1987) Sequel to Dark Castle.
Super 3D (1988) 3D modeling application.
Silicon Press (1986) card and label printing software
Personal
|
https://en.wikipedia.org/wiki/Formatting%20Output%20Specification%20Instance
|
In computing, FOSI (Formatting Output Specification Instance) is a stylesheet language for SGML and, later, XML. FOSI was developed by the US Department of Defense to control the pagination and layout of SGML and XML technical data. FOSI stylesheets are themselves written in SGML, an approach that would later be adopted by XSL.
FOSI was implemented by, among others, Datalogics, Arbortext and X.Systems. FOSI is documented in the book Practical FOSI for Arbortext Editor (©2015) by Suzanne Napoleon.
References
Stylesheet languages
|
https://en.wikipedia.org/wiki/Joss
|
Joss may refer to:
Joss (name), including a list of people with the name
JOSS, a time-sharing programming language
Joss (Chinese statue), a religious object
Joss JP1, an Australian-built supercar
Joss paper, a type of burnt offering
Joss Pass, a mountain pass in British Columbia, Canada
Joss stick, a form of incense
Abbreviation for the Journal of Open Source Software
Joss., taxonomic author abbreviation of Marcel Josserand (1900–1992), a French mycologist
See also
Joe (disambiguation)
Jos (disambiguation)
Joseph (disambiguation)
|
https://en.wikipedia.org/wiki/WVUE-DT
|
WVUE-DT (channel 8), branded on-air as Fox 8, is a television station in New Orleans, Louisiana, United States, affiliated with the Fox network. Owned by Gray Television, the station maintains primary studios on Norman C. Francis Parkway in the city's Gert Town section, with a secondary studio within the Benson Tower in downtown New Orleans; its transmitter is located on Magistrate Street in Chalmette, Louisiana.
History
Early years with ABC and CBS
The station first signed on the air on November 1, 1953, as WJMR-TV. Founded by Supreme Broadcasting Co., a locally based company run by lawyer Chester F. Owens (who served as the company's president), it was the second television station in the New Orleans market, signing on six years after WDSU-TV, and the third in Louisiana only seven months after Baton Rouge's WAFB. Originally broadcasting on UHF channel 61, it was moved to channel 20 on July 20, 1955. It originally operated as a primary CBS affiliate, while splitting ABC programming in off-hours with WDSU-TV. During 1957 and 1958, WJMR-TV had simulcast its signal on VHF channel 12, using the call sign KK2XFW. When WWL-TV (channel 4) signed on in September 1957, WWL took over the CBS affiliation because of WWL radio's longtime affiliation with the CBS Radio Network, allowing WJMR to upgrade its ABC affiliation to full-time.
The station moved to VHF channel 13 on January 13, 1959, and subsequently changed its call letters to WVUE on February 1. The station moved to channel 12 on September 6, 1962, to accommodate Biloxi, Mississippi, ABC affiliate WLOX onto channel 13, which would launch nine days later. Screen Gems, the television arm of Columbia Pictures, acquired the station from Supreme Broadcasting in 1965. On June 8, 1970, at 8:00 p.m., it made a highly publicized switch of channel positions with the city's PBS member station, WYES-TV, and moved to VHF channel 8, during an airing of the 1954 movie The Naked Jungle. This was done to give WVUE a greater broadcast signal range; while on channel 12, it had operated at relatively low power to avoid interfering with the signal of Jackson, Mississippi's WJTV, which had also broadcast on channel 12. The channel 61 allocation was later assigned to WLPN-LP (which operated from 1989 to the late 2000s) and the channel 20 allocation was assigned to religious station WHNO (which signed on in October 1994).
Columbia Pictures sold WVUE to Oklahoma City-based Gaylord Broadcasting Company in 1977. In March 1983, A. H. Belo Corporation announced its intention to acquire the station; no formal sale agreement was reached, and by May the deal was off (Belo would go on to acquire WWL-TV in 1994 and WUPL in 2007). WVUE started broadcasting 24 hours a day in June 1986, becoming the last commercial television station in New Orleans to transition to a round-the-clock schedule. When Gaylord Broadcasting began a gradual paring down of its station group in 1987 (which would not be completed until 1999), WVUE was sold t
|
https://en.wikipedia.org/wiki/WISH-TV
|
WISH-TV (channel 8) is a television station in Indianapolis, Indiana, United States, affiliated with The CW. It is locally owned by Circle City Broadcasting alongside Marion-licensed MyNetworkTV affiliate WNDY-TV (channel 23) and low-power, Class A getTV affiliate WIIH-CD (channel 17). The stations share studios on North Meridian Street (at the north end of the Television Row section) on the near north side of Indianapolis; WISH-TV and WNDY-TV also share transmitter facilities on Walnut Drive in the Augusta section of the city's northwest side (near Meridian Hills).
History
Early history
The station first signed on the air on July 1, 1954 at 6:00 pm. Founded by C. Bruce McConnell—owner of WISH radio (1310 AM, now WTLC)—it was the third television station to sign on in the Indianapolis market, after WFBM-TV (channel 6, now WRTV), which signed on in May 1949 and Bloomington-licensed WTTV (channel 10, now on channel 4), which signed on six months later in November 1949. WISH-TV originally operated as a primary ABC affiliate with a secondary affiliation with DuMont Television Network and NBC. WISH-TV originally transmitted its signal from a tower it shared with WISH radio; the following year, the station constructed a transmitter tower, which allowed the station to improve its signal coverage in the market.
CBS affiliate (1956–2014)
In 1956, McConnell sold the station to the Indiana Broadcasting Company, the broadcasting subsidiary of J.H. Whitney & Company and owners of WANE-TV in Fort Wayne. The new owners persuaded CBS to move its programming to channel 8, taking that affiliation from WFBM. Conversely that same year, WISH-TV lost the ABC affiliation to WTTV; this resulted in WLBC-TV, channel 49 in Muncie (whose allocation is now occupied by PBS member station WIPB) serving as the de facto ABC affiliate for the northern part of the market as WTTV's signal did not extend very far north outside of Indianapolis's northern suburbs as its transmitter was located farther south than the market's other stations. Also in 1956, WISH became one of the first television stations in the United States to install a videotape machine.
Indiana Broadcasting became the Corinthian Broadcasting Corporation in 1957, with WISH-TV serving as the company's flagship station. From 1958 to 1959, it was an affiliate of the NTA Film Network. Corinthian merged with Dun & Bradstreet in 1971. Dun & Bradstreet sold its entire broadcasting unit to the Belo Corporation in February 1984. However, the merger put Belo two stations over the television ownership limits that the Federal Communications Commission had in effect at the time. As a result, the company sold WISH-TV and WANE to LIN Broadcasting (the predecessor of LIN Media) the following month in March 1984. LIN was headquartered in Indianapolis for many years, with WISH-TV serving as that company's flagship television property; the company eventually moved its headquarters to Providence, Rhode Island in the late 1990s, resu
|
https://en.wikipedia.org/wiki/Ammonia%20%28data%20page%29
|
This page provides supplementary chemical data on ammonia.
Structure and properties
Thermodynamic properties
Vapor–liquid equilibrium data
Table data (above) obtained from CRC Handbook of Chemistry and Physics 44th ed. The (s) notation indicates equilibrium temperature of vapor over solid. Otherwise temperature is equilibrium of vapor over liquid.
Vapor-pressure formula for ammonia:
log10P = A – B / (T − C),
where P is pressure in kPa, and T is temperature in kelvins;
A = 6.67956, B = 1002.711, C = 25.215 for T = 190 K through 333 K.
Heat capacity of liquid and vapor
Spectral data
Regulatory data
Safety data sheet
The handling of this chemical may incur notable safety precautions... It is highly recommend that you seek the Safety Data Sheet (SDS) for this chemical from a reliable source and follow its directions.
SIRI
Science Stuff (Ammonia Solution)
References
External links
Phase diagram for ammonia
IR spectrum (from NIST)
Chemical data pages
Chemical data pages cleanup
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.