source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/CIMOSA | CIMOSA, standing for "Computer Integrated Manufacturing Open System Architecture", is an enterprise modeling framework, which aims to support the enterprise integration of machines, computers and people. The framework is based on the system life cycle concept, and offers a modelling language, methodology and supporting technology to support these goals.
It was developed in the 1990s by the AMICE Consortium, in an EU project. A non-profit organization CIMOSA Association was later established to keep ownership of the CIMOSA specification, to promote it and to support its further evolution.
Overview
The original aim of CIMOSA (1992) was "to elaborate an open system architecture for CIM and to define a set of concepts and rules to facilitate the building of future CIM systems". One of the main ideas of CIMOSA is the categorization of manufacturing operations in:
Generic functions: generic parts of every enterprise, independent of organisation structure or business area.
Specific (partial and particular) functions: specific for individual enterprises.
The development of CIMOSA has ultimately resulted in two key items:
Modeling Framework: This framework supports "all phases of the CIM system life-cycle from requirements definition, through design specification, implementation description and execution of the daily enterprise operation".
Integrating Infrastructure: This infrastructure provides "specific information technology services for the execution of the Particular Implementation Model", which has proven to be vendor independent and portable.
The framework furthermore offers an "event-driven, process-based modeling approach with the goal to cover essential enterprise aspects in one integrated model. The main aspects are the functional, behavioral, resource, information and organizational aspect".
CIMOSA can be applied in process simulation and analysis. Standardized CIMOSA models "can also be used on line in the manufacturing enterprise for scheduling, dispatching, monitoring and providing process information". One of the standards based on CIMOSA is the Generalised Enterprise Reference Architecture and Methodology (GERAM).
Building blocks
The main focus of CIMOSA has been to construct:
a framework for enterprise modelling, a reference architecture
an enterprise modelling language
an integrating infrastructure for model enactment supported by
a common terminology
A close liaison with European and international standardization organisations was established to stimulate the standardization process for enterprise integration.
CIMOSA aims at integrating enterprise operations by means of efficient information exchange within the enterprise. CIMOSA models enterprises using four perspectives:
the function view describes the functional structure required to satisfy the objectives of an enterprise and related control structures;
the information view describes the information required by each function;
the resource view describes the reso |
https://en.wikipedia.org/wiki/Armature | Armature may refer to:
Armature (computer animation), kinematic chain used in computer animation to simulate the motions of virtual characters
Armature (electrical), one of the two principal electrical components of an electromechanical machine
Armature (sculpture), framework around which a sculpture is built
Armature Studio, video game developer |
https://en.wikipedia.org/wiki/Broadcast%20Standards%20and%20Practices | In the United States, Standards and Practices (also referred to as Broadcast Standards and Practices or BS&P for short) is the name traditionally given to the department at a television network which is responsible for the moral, ethical, and legal implications of the program that the network airs. Standards and Practices also ensures fairness on televised game shows, in which they are the adjunct to the judges at the production company level. They also have the power to reprimand and to recommend the termination of television network stars and employees for violations of standards and practices.
Examples of intervention
The Standards and Practices department of NBC censored one of Jack Paar's jokes on the February 10, 1960, episode of The Tonight Show.
Paar was so very taken aback by the network's decision to censor the joke, he walked off the live show the very next day. As he left his desk in the middle of the program, he said, "I am leaving The Tonight Show. There must be a better way of, uh, making a living than this." Paar reappeared on March 7, 1960, strolled on stage, struck a pose, and said, "As I was saying before I was interrupted..." After the audience erupted in applause, Paar continued, "When I walked off, I said there must be a better way of making a living. Well, I've looked...and there isn't." He then went on to explain his departure with typical frankness: "Leaving the show was a childish and perhaps emotional thing. I have been guilty of such action in the past and will perhaps be again. I'm totally unable to hide what I feel. It is not an asset in show business, but I shall do the best I can to amuse and entertain you and let other people speak freely, as I have in the past."
Prior to filming the 2007 double-episode "The Gang Gets Whacked" of It's Always Sunny in Philadelphia, the network FX banned the actors from miming snorting cocaine or snorting another substance, but rather would be allowed to place the drug against their gums.
Animation
X-Men: The Animated Series was very heavily influenced by BS&P. Unlike the comic book, characters were rarely ever in any danger and characters almost never hit each other directly.
The CGI series ReBoot was heavily censored by ABC during its two-season run on the network. The network announced the show would be cancelled after its second season after it was purchased by The Walt Disney Company, which would make way for a schedule of all Disney-produced series. The writers wrote scripts for episodes that mocked ABC's S&P department due to it being cancelled, including the insertion of unnoticed profanity within a stream of binary numbers. ReBoot went on to produce another successful season and two made-for-TV movies on other networks which had less strict S&P departments and content standards.
Episode 97 of Teenage Mutant Ninja Turtles (2003) was unaired in the United States until 2015 due to pressures from Fox Broadcast & Standards (although 4Kids Entertainment leased the time fr |
https://en.wikipedia.org/wiki/Linux%20on%20embedded%20systems | Computer operating systems based on the Linux kernel are used in embedded systems such as consumer electronics (eg. set-top boxes, smart TVs and personal video recorders (PVRs)), in-vehicle infotainment (IVI), networking equipment (such as routers, switches, wireless access points (WAPs) or wireless routers), machine control, industrial automation, navigation equipment, spacecraft flight software, and medical instruments in general.
Because of their versatility, operating systems based on the Linux kernel can be also found in mobile devices that are actually touchscreen-based embedded devices, such as smartphones and tablets, together with personal digital assistants (PDAs) and portable media players that also include a touchscreen. This is a challenge for most learners because their computer experience is mainly based on GUI (Graphical user interface) based interaction with the machine and high-level programming on the one hand and low-level programming of small microcontrollers (MCU) on the other hand while the concept of command line interfaces is widely unknown.
History
The Linux kernel has been ported to a variety of CPUs which are not only primarily used as the processor of a desktop or server computer, but also ARC, ARM, AVR32, ETRAX CRIS, FR-V, H8300, IP7000, m68k, MIPS, mn10300, PowerPC, SuperH, and Xtensa processors. Linux is also used as an alternative to using a proprietary operating system and its associated toolchain.
Variants
The Embeddable Linux Kernel Subset is a Linux distribution that fits on a floppy disk for outdated or low resource hardware.
Devices coverage
Due to its low cost (freely available source code) and ease of customization, Linux has been shipped in many consumer devices. Devices covering PDAs (like the Sharp Zaurus family), TomTom GPS navigation devices, residential gateways like the Linksys WRT54G series or smartphones such as the Motorola exz series, Openmoko handsets, devices running Sailfish OS developed by Jolla like Jolla C and Intex Aqua Fish and the Nokia N900 and Nokia N9.
Android, a Linux-kernel-based operating system acquired and extended by Google and introduced in 2008, has become a highly competitive platform for smartphones and tablets. In July 2012, Android's smartphone market share in the United States was at 52%, reaching 82% worldwide in Q2 2015.
Starlink and SpaceX use embedded Linux on their constellations and rockets.
Communities
With the availability of consumer embedded devices, communities of users and developers were formed around these devices: replacement or enhancements of the Linux distribution shipped on the device has often been made possible thanks to availability of the source code and to the communities surrounding the devices. Due to the high number of devices, standardized build systems have appeared, including Yocto, OpenEmbedded, Buildroot, OpenWrt, and LTIB.
Platform usage
The advantages of embedded Linux over proprietary embedded operating systems include multiple |
https://en.wikipedia.org/wiki/Raku%20%28programming%20language%29 | Raku is a member of the Perl family of programming languages. Formerly known as Perl 6, it was renamed in October 2019. Raku introduces elements of many modern and historical languages. Compatibility with Perl was not a goal, though a compatibility mode is part of the specification. The design process for Raku began in 2000.
History
The Raku design process was first announced on 19 July 2000, on the fourth day of that year's Perl Conference, by Larry Wall in his State of the Onion 2000 talk. At that time, the primary goals were to remove "historical warts" from the language; "easy things should stay easy, hard things should get easier, and impossible things should get hard"; a general cleanup of the internal design and APIs. The process began with a series of requests for comments or "RFCs". This process was open to all contributors, and left no aspect of the language closed to change.
Once the RFC process was complete, Wall reviewed and classified each of the 361 requests received. He then began the process of writing several "Apocalypses", using the original meaning of the term, "revealing". While the original goal was to write one Apocalypse for each chapter of Programming Perl, it became obvious that, as each Apocalypse was written, previous Apocalypses were being invalidated by later changes. For this reason, a set of Synopses were published, each one relating the contents of an Apocalypse, but with any subsequent changes reflected in updates. Today, the Raku specification is managed through the "roast" testing suite, while the Synopses are kept as a historical reference.
There are also a series of Exegeses written by Damian Conway that explain the content of each Apocalypse in terms of practical usage. Each Exegesis consists of code examples along with discussion of the usage and implications of the examples.
There are three primary methods of communication used in the development of Raku today. The first is the raku IRC channel on Libera Chat. The second is a set of mailing lists. The third is the Git source code repository hosted at GitHub.
Initial goals and implications
The major goal Wall suggested in his initial speech was the removal of historical warts. These included the confusion surrounding sigil usage for containers, the ambiguity between the select functions, and the syntactic impact of bareword filehandles. There were many other problems that Perl programmers had discussed fixing for years that were explicitly addressed by Wall in his speech.
An implication of these goals was that Perl 6 would not have backward compatibility with the existing Perl codebase. This meant that some code which was correctly interpreted by a Perl 5 compiler would not be accepted by a Perl 6 compiler. Since backward compatibility is a common goal when enhancing software, the breaking changes in Perl 6 had to be stated explicitly. The distinction between Perl 5 and Perl 6 became so large that eventually Perl 6 was renamed Raku.
Mascot
The lang |
https://en.wikipedia.org/wiki/Slammer | Slammer may refer to:
SQL Slammer, a computer worm
AIM-120 AMRAAM, an American missile, nicknamed Slammer
Sholef / Slammer, an Israeli self-propelled howitzer gun
The Slammer, a children's talent show on British television
Slammer Guitars, a budget subsidiary of Hamer Guitars
Penn Jillette's house in Las Vegas, known as "the slammer"
Slammer (ride), at Thorpe Park theme park, England
Slammer, an entity who changes a telephone carrier of a telephone line illegally (Telephone slamming)
British Slam-door trains, also known as slammers
Slammers, a mercenary unit in the science fiction Hammerverse
A type of POG, a children's game
"The slammer", a colloquial term for prison
See also
Alabama Slammer, a cocktail
Tequila Slammer, a cocktail |
https://en.wikipedia.org/wiki/NaviServer | NaviServer is a high performance web server written in C and Tcl. It can be easily extended in either language to create web sites and services; there are over 35 modules available (including database integration or protocol support for UDP, SMTP, LDAP, DNS, COAP, etc.)
The project is under active development,
NaviServer is mostly written in C with a very well-commented source code, had more than 6,000 commits made by 35 contributors
representing more than 100,000 lines of code. NaviServer is licensed under the terms of the Mozilla Public License (MPL).
Recent new features include:
an internal watchdog for automatic server restarts
server internals exposed in a command line mode
thread shared arrays (atomic operations, dict support)
built-in caching with cache transaction semantics (cache commit/rollback)
hot code swapping (update code in the running system without server restart)
asynchronous spooling of requests and replies
delivery of static files optionally with gzip or brotli compression with automatic re-compression on updates
selective logging with color highlighting (non-blocking)
efficient built-in crypto support
mass virtual hosting
byte-range requests for streaming and resumption of downloads
rich HTTPS support (server and client-side SNI, OCSP Stapling)
built-in HTTP/HTTPS client support, with log-files
built-in statistics (for mutex locks/rwlocks, cache, db-handles, ...)
bandwidth management via multiple connection thread pools
WebSocket and IPv6 support
History
NaviServer is based on AOLserver (version 4.10), AOL's open-source web server. The NaviServer project started as a fork of the AOLserver project in July 2005. It is different by supporting multiple protocols, providing higher scalability through asynchronous I/O and aims to be less conservative with new feature development.
Historically NaviServer was the original name of the server, a closed-source product by a company called NaviSoft in the early 1990s. It was bought by AOL in 1995, and released as open-source in 1999 as AOLserver after they released Mozilla. This friendly-fork takes the code back to its original name.
Large applications of NaviServer are the ArsDigita Community System and OpenACS in particular.
See also
Comparison of web servers
External links
NaviServer Home page
NaviServer Bitbucket Source Code
NaviServer Documentation
References
Free web server software
Free software programmed in C
Free software programmed in Tcl |
https://en.wikipedia.org/wiki/PC%20Format | PC Format was a computer magazine published in the United Kingdom by Future plc, and licensed to other publishers in countries around the world. In publication between 1991 and 2015, it was part of Future plc's Format series of magazines that include articles about games, entertainment and how to get the most out of the platform. Despite the occasional mention of alternatives, PC Format takes the term 'PC' to mean a Microsoft Windows-based computer.
Details
Aimed at a reader with an age of around 30, PCF was far more irreverent and opinionated than its competition, edging it towards being a lifestyle magazine as well as a computing one. In its earlier days, it promoted itself as a PC entertainment magazine - meaning it was not aimed at the business market, and it was not aimed at solely games. This included content such as video editing, animation, web design, and others - many of which were not very common on the PC at the time.
PC Format included a cover disk or cover CD, similar to many other computer magazines. Initially these were in 5¼" and 3½" inch floppy disk formats; this standard progressed to CD-ROM and DVD-ROM as technology advanced.
PC Format prided itself on being unbiased with its reviews, and frequently gave low scores to blockbuster games its reviewers considered poor quality. It used the full range of 0-100% for its game reviews, rather than having 50% for a bad game and 100% for a great game. The magazine rarely awarded anything between 30% and 50%, showing radical scores for games with the belief mediocre games are difficult to review. Scores over 90% were very rarely granted. If a game scored above 90% it received a PCF Gold award. Before the magazine was redesigned in January 2007, the magazine also awarded 80% plus scores with a high score or top gear award.
Immediately prior to PC Format's launch, the Format series encompassed three platforms - Commodore Format, ST Format and Amiga Format. The magazines in the 'Format' series on the date of its last publication were MacFormat (launched 1993), Linux Format (launched 2000), and PC Format; as of 2023 only MacFormat and Linux Format are still published.
PCFormat's website was part of the TechRadar.com network of sites, Future plc's technology portal.
Content
The main content of the magazine included previews and reviews of the latest games, software and hardware reviews, computing news, a wide range of tutorials and a technical help section. It also included left-field and investigative features on wider computing culture. Since the final redesign, the magazine focused more on games (PLAY) and performance hardware (WIRED), instead of the greater range previously explored. There was then also a much greater emphasis on Overclocking and Modding articles, keeping in line with the new performance hardware and gaming focus.
The magazine gradually shifted its focus away from games, concentrating more on hardware. As of the September 2010 issue, typically no more than fou |
https://en.wikipedia.org/wiki/Goku%20Midnight%20Eye | is a manga series by Buichi Terasawa about a detective named who gains a cybernetic eye implant that can control any computer system on the planet. The manga has been published in English by ComicsOne and DrMaster.
Reception
Helen McCarthy in 500 Essential Anime Movies calls the plot "incredibly silly", but praises "stylish locations" and "widely theatrical design ideas".
References
Further reading
Goku II: Midnight Eye review
Goku Midnight Eye Review by The Nine Hells of Anime Podcast / Anime of Yesteryear Podcast
Goku: Midnight Eye review
The Anime Review: Goku: Midnight Eye
External links
Goku Midnight Eye at ComicsOne
1989 anime OVAs
ComicsOne titles
Cyborg comics
Discotek Media
Madhouse (company)
Seinen manga
Cyberpunk anime and manga |
https://en.wikipedia.org/wiki/Chris%20Wallace%20%28computer%20scientist%29 | Christopher Stewart Wallace (26 October 1933 – 7 August 2004) was an Australian computer scientist and physicist.
Wallace is notable for having devised:
The minimum message length principle — an information-theoretic principle in statistics, econometrics, machine learning, inductive inference and knowledge discovery which can be seen both as a mathematical formalisation of Occam's Razor and as an invariant Bayesian method of model selection and point estimation,
The Wallace tree form of binary multiplier (1964),
a variety of random number generators,
a theory in physics and philosophy that entropy is not the arrow of time,
a refrigeration system (from the 1950s, whose design is still in use in 2010),
hardware for detecting and counting cosmic rays,
design of computer operating systems,
the notion of universality probability in mathematical logic,
and a vast range of other works - see, e.g., and its Foreword re C. S. Wallace , pp 523-560.
He was appointed Foundation Chair of Information Science at Monash University in 1968 at the age of 34 (before the Department was re-named Computer Science), and Professor Emeritus in 1996. Wallace was a fellow of the Australian Computer Society and in 1995 he was appointed a fellow of the ACM "For research in a number of areas in Computer Science including fast multiplication algorithm, minimum message length principle and its applications, random number generation, computer architecture, numerical solution of ODE's, and contribution to Australian Computer Science."
Wallace received his PhD (in Physics) from the University of Sydney in 1959. He was married to Judy Ogilvie, the first secretary and programme librarian of SILLIAC, which was launched on the 12 of September 1956 at the University of Sydney and which was one of Australia's first computers. He also engineered one of the world's first Local Area Networks in the mid-1960s.
References
External links
Tribute to IT pioneer Chris Wallace — 13 October 2004
Remembering Emeritus Professor Chris Wallace (Information Technology), 2008
Innovative studios honour Monash pioneer — 2 November 2011
Christopher S. Wallace publications, and searchable publications database
Wallace, C.S. (posthumous, 2005), Statistical and Inductive Inference by Minimum Message Length, Springer (Series: Information Science and Statistics), 2005, XVI, 432 pp., 22 illus., Hardcover, . (Links to chapter headings, table of contents and sample pages.)
(and here). (As far as we know, this cites and includes references to every paper which Chris Wallace ever wrote [and every thesis he ever supervised].)
Chris Wallace Award for Outstanding Research Contribution — established by CORE (The Computing Research and Education Association of Australasia) - see also The Chris Wallace Award for Outstanding Research (for 2015) and CORE brief Chris Wallace bio'
1933 births
2004 deaths
Australian computer scientists
Australian physicists
Fellows of the Association for Computing Mac |
https://en.wikipedia.org/wiki/Boo%20%28programming%20language%29 | Boo is an object-oriented, statically typed, general-purpose programming language that seeks to make use of the Common Language Infrastructure's support for Unicode, internationalization, and web applications, while using a Python-inspired syntax and a special focus on language and compiler extensibility. Some features of note include type inference, generators, multimethods, optional duck typing, macros, true closures, currying, and first-class functions.
Boo was one of the three scripting languages for the Unity game engine (Unity Technologies employed De Oliveira, its designer), until official support was dropped in 2014 due to the small userbase. The Boo Compiler was removed from the engine in 2017. Boo has since been abandoned by De Oliveira, with development being taken over by Mason Wheeler.
Boo is free software released under the BSD 3-Clause license. It is compatible with the Microsoft .NET and Mono frameworks.
Syntax
print ("Hello World")
def fib():
a, b = 0L, 1L h
# The 'L's make the numbers double word length (typically 64 bits)
while true:
yield b
a, b = b, a + b
# Print the first 5 numbers in the series:
for index as int, element in zip(range(5), fib()):
print("${index+1}: ${element}")
See also
Fantom
Apache Groovy
IronPython
IronRuby
Nemerle
REBOL
StaDyn
References
External links
Official website
How To Think Like a Computer Scientist: Learning to Program with Boo
Boo Succinctly Revealed
Bootorial
Programming languages
.NET programming languages
Brazilian inventions
Class-based programming languages
Free compilers and interpreters
Object-oriented programming languages
Procedural programming languages
Programming languages created in 2003
Software using the BSD license
Statically typed programming languages
2003 software |
https://en.wikipedia.org/wiki/Thalamus%20Ltd | Thalamus Ltd (also known as Thalamus) was a British computer game developer that published titles for a number of 8-bit and 16-bit platforms during the late 1980s and early 1990s.
History
Genesis
Thalamus Ltd was created in 1986 as an in-house software publishing label of British magazine publisher Newsfield Publications Ltd, to take advantage of their leading position publishing computer game magazines, such as Crash and Zzap!64, during the mid-1980s. Ex-Activision PR Manager Andrew Wright was assigned the position of Company Director and Newsfield staff writer Gary Liddon was appointed Technical Executive. The company was initially based in Canonbury, North London, in an office shared with staff of Newsfield's newly launched lifestyle magazine LM.
First titles
Thalamus capitalised on the success of the Commodore 64 gaming scene by releasing their first batch of titles on this platform. Having established numerous contacts within the C64 development scene through the popularity of their Zzap!64 gaming magazine, Thalamus were able to sign up Finnish programmer Stavros Fasoulas to develop their first three titles, Sanxion, Delta and Quedex. Sanxion was the first release to bear the Thalamus name, and it garnered a Sizzler rating from Zzap!64 - this led to accusations of favouritism from rival publication Commodore User. Rob Hubbard provided the music for the first two titles, while Matt Gray provided the music for Quedex. "Thalamusik", the loading tune that accompanied the C64 version of Sanxion proved to be so popular amongst fans that Zzap!64 later included a full synthesised version on one of their cover cassettes.
The C64 version of Delta popularised the concept of the Mix-E-Load loading system. Provided as standard on the cassette versions of each game (and as a bonus on the floppy disk versions), the Mix-E-Load system allowed players to remix the loading music of the game, in real time, as the main program loaded in the background. Mix-E-Load was created by Gary Liddon in conjunction with Rob Hubbard and derived from an idea by Nick Pelling, author of well known BBC Micro games Frak! and Firetrack.
The staff changes
During the development of Delta, Liddon and Wright both left Thalamus, with Wright returning to Activision and Liddon pursuing a career in games programming. Ex Quicksilva & Electric Dreams development manager Paul Cooper was brought on board to head up the company and moved the offices from London to Aldermaston in Berkshire.
Stavros Fasoulas returned to Finland for National Service, so for their next release Thalamus turned to upcoming C64 programmer Martin Walker. Having already programmed the well-received C64 titles Rupert and the Toymaker's Party, Chameleon and Back to the Future, Martin Walker delivered an innovative puzzle/shooter hybrid named Hunter's Moon. Despite a favourable response from critics, the game didn't sell as well as previous Thalamus titles.
In the second half of 1988, Thalamus returned from a peri |
https://en.wikipedia.org/wiki/Global%20National | Global National is the English language flagship national newscast of Canada's Global Television Network. Editorial and production staff are based out of Global's national news centre at Global BC in Burnaby, British Columbia, with Dawna Friesen presenting from the Global BC studios Mondays to Thursdays, and Farah Nasser presenting from the Global Toronto studios Fridays to Sundays. From 2008 to 2010, the program was the only Canadian network newscast to be regularly anchored from the nation's capital, Ottawa.
In addition to Global's owned-and-operated stations (O&Os), Global National also airs on affiliate CHFD-DT in Thunder Bay, Ontario and independent station CJON-DT in St. John's, Newfoundland.
Global also produced a Mandarin version of the newscast, titled Global National Mandarin from 2012 to 2016. It was anchored by Carol Wang. The newscast was seen on Shaw Multicultural Channel in Vancouver, British Columbia & Calgary, Alberta.
History
Global's first tentative steps towards a national news presence came in 1994 with the launch of First National, a regional newscast presented by Peter Kent which was aired in Manitoba, Ontario and (starting in 1997) Quebec. Around the same time, the rival WIC television station group launched Canada Tonight, a newscast produced at WIC's Vancouver station CHAN-TV (better known as British Columbia Television or BCTV), and also aired on its stations in Alberta and Ontario.
Following the purchase of WIC's television stations by Global's then-parent company Canwest, Global announced in January 2001 its plans to launch a new network newscast in September of that year, with Kevin Newman returning to Canada from ABC News as the newscast's chief anchor. First National ended production in February, and the Global stations which had aired that program broadcast Canada Tonight in its place until the new newscast launched.
The final broadcast of Canada Tonight aired on August 31, 2001, and the new newscast, titled Global National, debuted on September 3 from a renovated studio at CHAN, which became a Global O&O two days earlier and produces its local newscasts from the same studio. As part of the deal in which Global bought CHAN, it became home to Global's national news centre; the station had wanted to do a national newscast for its former network CTV (with Canada Tonight emerging as the result after CTV's board turned CHAN's proposal down). When the program began, it had only 15 people on staff and a budget of $8 million; the newscast was tied in part to $20 million worth of funding Global had put aside, in exchange for the CRTC to give Global a national network license (a bid approved in January 2000); Global National, as well as public-affairs shows and "wellness documentaries" were the fruits of the deal.
Global National set several technological firsts; it was the first daily newscast in the world to use digital cameras in addition to videotape, as well as editing all stories on Apple's then-new Final Cut ed |
https://en.wikipedia.org/wiki/Matt%20Pinto | Matt Pinto is the radio voice for the Oklahoma City Thunder for WWLS-FM 98.1, the flagship station for the Thunder Radio Network. He formerly served as the radio play-by-play voice for the Seattle SuperSonics for KTTH-AM 770, the flagship station for the Sonics Radio Network. He was previously named as the radio voice of the Los Angeles Clippers for KSPN-AM (710 ESPN, Los Angeles) on August 24, 2005, and he would work at least 70 games a year, while the regular television announcing team of Ralph Lawler and Michael Smith would work the remaining 12 games on radio only. He was replaced by Minnesota Timberwolves radio man Brian Sieman in 2007.
Previously, he spent eight years doing radio and television coverage for the Dallas Mavericks, the first four exclusively on radio and the other four exclusively for television. While in Dallas, he often referred to players as "water bugs" on plays in which they were driving to the basket. He worked alongside Bob Ortegel during his television career in Dallas.
From 1990 through 1996, Pinto was also the radio voice of the Charlotte Hornets. Before that he was a sports anchor for KGMB-TV, the CBS affiliate station in Honolulu.
References
Los Angeles Clippers broadcaster bio
Sieman replaces Matt Pinto
Living people
Charlotte Hornets announcers
Dallas Mavericks announcers
Los Angeles Clippers announcers
Oklahoma City Thunder announcers
Seattle SuperSonics announcers
Year of birth missing (living people)
National Basketball Association broadcasters |
https://en.wikipedia.org/wiki/WNYW | WNYW (channel 5) is a television station in New York City, serving as the flagship of the Fox network. It is owned and operated by the network's Fox Television Stations division alongside Secaucus, New Jersey–licensed MyNetworkTV flagship WWOR-TV (channel 9). Both stations share studios at the Fox Television Center on East 67th Street in Manhattan's Lenox Hill neighborhood, while WNYW's transmitter is located at One World Trade Center.
History
DuMont origins (1944–1956)
The station traces its history to 1938, when television set and equipment manufacturer Allen B. DuMont founded experimental station W2XVT in Passaic, New Jersey. That station's call sign was changed to W2XWV when it moved to Manhattan in 1940. On May 2, 1944, the station received its commercial license, the third in New York City. It began broadcasting on VHF channel 4 as WABD with its call sign made up of DuMont's initials. It was one of the few television stations that continued to broadcast during World War II, making it the fourth-oldest continuously broadcasting commercial station in the United States. The station originally had its studios in the DuMont Building at 515 Madison Avenue, with its transmitter tower atop the same building. (The original tower, long abandoned by the station, still remains.) On December 17, 1945, WABD moved to channel 5. WNBT (now WNBC) took over channel 4 the following spring, moving from channel 1, which the FCC was de-allocating from the VHF TV broadcast band.
Soon after channel 5 received its commercial license, DuMont Laboratories began a series of experimental coaxial cable hookups between WABD and W3XWT, a DuMont-owned experimental station in Washington, D.C. (now WTTG). These hookups were the beginning of the DuMont Television Network, the world's first licensed commercial television network. (However, NBC was feeding a few programs and special events from its New York station WNBT to outlets in Philadelphia and Schenectady as early as 1940.) DuMont began regular network service in 1946 with WABD as the flagship station. On June 14, 1954, WABD and DuMont moved into the $5 million DuMont Tele-Centre at 205 East 67th Street in Manhattan's Lenox Hill neighborhood, inside the shell of the space formerly occupied by Jacob Ruppert's Central Opera House. Channel 5 is still headquartered in the same building, which was later renamed the Metromedia TeleCenter, and is now known as the Fox Television Center.
By February 1955, DuMont realized it could not continue in network television. In most cities around the U.S., NBC and CBS had secured affiliations with the top TV stations, making it difficult for DuMont shows to develop an audience and attract advertising dollars. DuMont decided to shut down the network's operations and run WABD and Washington station WTTG as independent stations. DuMont had previously sold WDTV in Pittsburgh to the locally based Westinghouse Electric Corporation, arguably hastening DuMont's demise. WABD thus became the New |
https://en.wikipedia.org/wiki/Exponential%20backoff | Exponential backoff is an algorithm that uses feedback to multiplicatively decrease the rate of some process, in order to gradually find an acceptable rate. These algorithms find usage in a wide range of systems and processes, with radio networks and computer networks being particularly notable.
Exponential backoff algorithm
An exponential backoff algorithm is a form of closed-loop control system that reduces the rate of a controlled process in response to adverse events. For example, if a smartphone app fails to connect to its server, it might try again 1 second later, then if it fails again, 2 seconds later, then 4, etc. Each time the pause is multiplied by a fixed amount (in this case 2). In this case, the adverse event is failing to connect to the server. Other examples of adverse events include collisions of network traffic, an error response from a service, or an explicit request to reduce the rate (i.e. "back off").
The rate reduction can be modelled as an exponential function:
or
Here, is the time delay applied between actions, is the multiplicative factor or "base", is the number of adverse events observed, and is the frequency (or rate) of the process (i.e. number of actions per unit of time). The value of is incremented each time an adverse event is observed, leading to an exponential rise in delay and, therefore, an inversely proportionate rate. An exponential backoff algorithm where is referred to as a binary exponential backoff algorithm.
When the rate has been reduced in response to an adverse event, it usually does not remain at that reduced level forever. If no adverse events are observed for some period of time, often referred to as the recovery time or cooling-off period, the rate may be increased again. The time period that must elapse before attempting to increase the rate again may, itself, be determined by an exponential backoff algorithm. Typically, recovery of the rate occurs more slowly than reduction of the rate due to backoff, and often requires careful tuning to avoid oscillation of the rate. The exact recovery behaviour is implementation-specific and may be informed by any number of environmental factors.
The mechanism by which rate reduction is practically achieved in a system may be more complex than a simple time delay. In some cases the value may refer to an upper bound to the time delay, rather than a specific time delay value. The name "expontential backoff" refers to the exponential growth characteristic of the backoff, rather than an exact numeric relationship between adverse event counts and delay times.
Rate limiting
Exponential backoff is commonly utilised as part of rate limiting mechanisms in computer systems such as web services, to help enforce fair distribution of access to resources and prevent network congestion. Each time a service informs a client that it is sending requests too frequently, the client reduces its rate by some predetermined factor, until the client's request rate rea |
https://en.wikipedia.org/wiki/MareNostrum | MareNostrum (, ) is the main supercomputer in the Barcelona Supercomputing Center. It is the most powerful supercomputer in Spain, one of thirteen supercomputers in the Spanish Supercomputing Network and one of the seven supercomputers of the European infrastructure PRACE (Partnership for Advanced Computing in Europe).
MareNostrum runs SUSE Linux 11 SP3. It occupies 180 m² (less than half a basketball court).
The supercomputer is used in human genome research, protein research, astrophysical simulations, weather forecasting, geological or geophysical modeling, and the design of new drugs. It was booted up for the first time on 12 April 2005, and is available to the national and international scientific community.
Mare Nostrum ("our sea") was the Roman name for the Mediterranean Sea. The supercomputer is housed in the deconsecrated Chapel Torre Girona at the Polytechnic University of Catalonia, Barcelona, Spain.
MareNostrum 4
MareNostrum 4 has been dubbed the most diverse and likely the most interesting supercomputer in the world thanks to the heterogeneity of the architecture it will include once the installation of the supercomputer is complete. Its total speed will be 13.7 petaflops. It has five storage racks with the capacity to store 14 petabytes (14 million gigabytes) of data. A high-speed Omnipath network connects all the components in the supercomputer to one another.
MareNostrum 4 is built inside of the Torre Girona chapel.
The supercomputer includes two separate parts: a general-purpose block and a block featuring emerging technologies.
The general-purpose block has 48 racks with 3,456 Lenovo ThinkSystem SD530 compute nodes. Each node has two Intel Xeon Platinum chips, each with 24 processors, amounting to a total of 165,888 processors and main memory of 390 terabytes. Its peak performance is 11.15 petaflops. While its performance is 10 times greater than its predecessor, MareNostrum 3, its power will only increase by 30% to 1.3 MW.
The block of emerging technologies is formed of clusters of three different technologies, which will be incorporated and updated as they become available on the market. These technologies are currently being developed in the United States and Japan to speed up the arrival of the new generation of pre-exascale supercomputers. They are as follows:
Cluster comprising IBM POWER9 and NVIDIA Volta GPUs, with a computational capacity of over 1.5 petaflops. IBM and NVIDIA will use these processors for the Summit and Sierra supercomputers that the US Department of Energy has ordered for its Oak Ridge and Lawrence Livermore National Laboratories.
Cluster made up of AMD Rome processors and AMD Radeon Instinct MI50. The machine will have a processor and accelerator similar to the Frontier supercomputer that will be installed in 2021 at ORNL. The computing power of the machine will be 0.52 Petaflop/s.
Cluster formed of 64-bit ARMv8 processors in a prototype machine, using state-of-the-art technologies from |
https://en.wikipedia.org/wiki/RosettaNet | RosettaNet is a non-profit consortium aimed at establishing standard processes for the sharing of business information (B2B). RosettaNet is a consortium of major Computer and Consumer Electronics, Electronic Components, Semiconductor Manufacturing, Telecommunications and Logistics companies working to create and implement industry-wide, open e-business process standards. These standards form a common e-business language, aligning processes between supply chain partners on a global basis.
RosettaNet is a subsidiary of GS1 US, formerly the Uniform Code Council, Inc. (UCC). It was formed mainly through the efforts of Fadi Chehade, its first CEO. RosettaNet's 500 members come from companies around the world. The consortium has a presence in USA, Malaysia, Europe, Japan, Taiwan, China, Singapore, Thailand and Australia.
RosettaNet has several local user groups. The European User Group is called EDIFICE.
The RosettaNet Standards website shut down by the end of 2013 and RosettaNet Standards is now managed as part of GS1 US website.
The RosettaNet standard
The RosettaNet standard defines both e-commerce document and exchange protocols, as part of the Electronic data interchange (EDI).
The RosettaNet standard is based on XML and defines message guidelines, interfaces for business processes, and implementation frameworks for interactions between companies. Mostly addressed is the supply chain area, but also manufacturing, product and material data and service processes are in scope.
The standard is widely spread in the global semiconductor industry, but also in electronic components, consumer electronics, telecommunication and logistics. RosettaNet originated in the USA and is widely used there, but it is also well accepted and even supported by governments in Asia. Due to the widespread use of EDIFACT in Europe, RosettaNet is used less, but it is growing.
The RosettaNet Automated Enablement standard (RAE) uses the Office Open XML document standard.
The RosettaNet Technical Dictionary (RNTD) is the reference model for the classification and characterization of the products in the supply chains that use RosettaNet for their interactions.
Industrial products standards
ECLASS
ETIM
UNSPSC
eOTD
SWIFT
RosettaNet
See also
ebXML
Electronic Data Interchange
Office Open XML software
References
External links
RosettaNet Website maintained by GS1 US
Original RosettaNet Website (Archived 2013)
EDIFICE - European RosettaNet User Group
Introductory article on RosettaNet
Haadumim B2B Marketplace
GS1
Business-to-business
Trade and industrial classification systems |
https://en.wikipedia.org/wiki/Kenneth%20Iverson | Kenneth Iverson may refer to:
Kenneth E. Iverson (1920–2004), developer of the APL programming language
F. Kenneth Iverson (1925–2002), former CEO of Nucor |
https://en.wikipedia.org/wiki/Electrohome | Founded in 1907, Electrohome was Canada's largest manufacturer of television sets (TVs) from 1949 to 1987. The company was also involved in television broadcasting, and was a leader in data, video, graphics displays and projectors.
From 1984 to 1999, Electrohome-branded TVs were produced under licence by Mitsubishi Electric, and from 1999 to 2007 by Jutan (distributed by Canadian distributor Citizen Electronics).
The company underwent an orderly wind-up in late 2008. In February 2010, the Electrohome brand was acquired by Bluetronics Group a division of Circus World Displays Limited (CWD).
History
In 1907, Arthur Bell Pollock founded Pollock Manufacturing Co. Ltd., after winning a coin flip with his wife. The Kitchener, Ontario company manufactured the first phonographs in Canada. In the 1920s and 30s the company branched out into other consumer goods such as records, radios, furniture, and was the largest Canadian maker of electric fans. In 1933 the company name became Dominion Electrohome Industries Ltd. and the Electrohome brand was introduced for products ranging from heaters to food mixers.
With the outbreak of World War II, however, everything changed. Electrohome devoted 99% of its production to the war effort. It manufactured wooden aircraft elements including wings, munitions components, and communications equipment, including a radio transmitter for the Royal Canadian Air Force. After the war, Electrohome ranked as a nationally known and important company with 1,400 employees geared to meet the demands of the post-war economy. The war enabled the company to acquire new equipment, more production capacity and a wider range of skills. There was also a perception that Electrohome could be a major player on the Canadian national electronics scene.
The company began manufacturing and selling television sets in 1949, competing with companies such as Northern Electric and Canadian General Electric for a share of the Canadian market. Electrohome developed its reputation with large console model TV sets made with real hardwood cases.
In 1954, Carl Arthur Pollock, son of the company's founder, led Electrohome in joining the Famous Players theatre chain to launch Kitchener-Waterloo's first television station, CKCO-TV, as a CBC Television affiliate. It joined CTV in 1964. Electrohome assumed full control of CKCO in 1970 when broadcasting laws substantially reduced the amount of foreign ownership in Canadian media (Famous Players was controlled by Paramount Pictures).
In the 1960s, Electrohome continued to manufacture consumer products including organs, radios, console stereos, speakers, high fidelity tube amplifiers, and televisions, as it became the first and only Canadian company to make colour television sets. By 1965, Electrohome products were being sold in 23 countries. Total sales in 1968 were $44.5 million. Over the years the company had ten manufacturing plants and two administrative offices in the Kitchener-Waterloo area.
In 197 |
https://en.wikipedia.org/wiki/Industry%20Foundation%20Classes | The Industry Foundation Classes (IFC) is a CAD data exchange data schema intended for description of architectural, building and construction industry data.
It is a platform-neutral, open data schema specification that is not controlled by a single vendor or group of vendors. It is an object-based data schema with a data model developed by buildingSMART (formerly the International Alliance for Interoperability, IAI) to facilitate interoperability in the architecture, engineering and construction (AEC) industry, and is a commonly used collaboration format in Building information modeling (BIM) based projects. The IFC model specification is open and available. It is registered by ISO and is an official International Standard ISO 16739-1:2018.
Because of its focus on interoperability the Danish government in 2010 made the use of IFC format(s) compulsory for publicly aided building projects. In 2017 the Finnish state-owned facility management company Senate Properties started to demand use of IFC compatible software and BIM in all their projects. Also the Norwegian Government, Health and Defense client organisations require use of IFC BIM in all projects as well as many municipalities, private clients, contractors and designers have integrated IFC BIM in their business.. The popularity of the IFC data schema in construction has continued to grow, primarily for the purpose of exchanging geometry.
History
The IFC initiative began in 1994, when Autodesk formed an industry consortium to advise the company on the development of a set of C++ classes that could support integrated application development. Twelve US companies joined the consortium. These companies included AT&T, HOK Architects, Honeywell, Carrier, Tishman and Butler Manufacturing. Initially named the Industry Alliance for Interoperability, the Alliance opened membership to all interested parties in September, 1995 and changed its name in 1997 to the International Alliance for Interoperability. The new Alliance was reconstituted as a non-profit industry-led organization, with the goal of publishing the Industry Foundation Class (IFC) as a neutral AEC product model responding to the AEC building lifecycle. A further name change occurred in 2005, and the IFC specification is now developed and maintained by buildingSMART.
IFC Specifications
The following IFC Specification versions are available
IFC4.3.RC4 (2021-07): additions of Rail and Infrastructure
IFC4.2 (2019-04): withdrawn
IFC4.1 (2018-86): withdrawn
IFC4 Add2 TC1 (2017)
IFC4 Add2 (2016)
IFC4 Add1 (2015)
IFC4 (March 2013)
ifcXML2x3 (June 2007)
IFC2x3 (February 2006)
ifcXML2 for IFC2x2 add1 (RC2)
IFC2x2 Addendum 1 (July 2004)
ifcXML2 for IFC2x2 (RC1)
IFC 2x2
IFC 2x Addendum 1
ifcXML1 for IFC2x and IFC2x Addendum 1
IFC 2x
IFC 2.0 (March 1999)
IFC 1.5.1 (September 1998)
IFC 1.5 (November 1997)
IFC 1.0 (June 1996)
File Formats
IFC defines multiple file formats that may be used, supporting various encodings of the sam |
https://en.wikipedia.org/wiki/British%20Rail%20Class%20456 | The British Rail Class 456 was an electric multiple unit passenger train introduced by Network SouthEast on inner-suburban services in South London to replace the elderly Class 416 2EPB units. Twenty-four two-car units were built by British Rail Engineering Limited's York Carriage Works in 1990 and 1991.
Following the privatisation of British Rail, the fleet was sold to Porterbrook and operated by Southern up until late 2013, when they were transferred to South West Trains and heavily refurbished. Routes that were operated by Class 456 units will be operated by new Class 701 Bombardier Aventra units in the future.
Entry into service
While originally approved for use by Network SouthEast (NSE) on services out of Waterloo, the 24 two-car units were first accepted into traffic as direct replacements for the 2EPB units on the Central Division of the Southern Region of British Rail. Units were delivered into traffic painted in NSE blue, red and white livery with cabs based on the Class 321 units, and were initially based at Selhurst depot. Although Network SouthEast had shifted to units painted with pale grey, the Class 456s were introduced painted with a darker grey shade to match the livery of the Class 455 units they would be working with. Units were numbered in the range 456001–456024, each unit consisting of a driving motor (DMSO) and a driving trailer (DTSO).
Entry into service for the Class 456 was originally planned for 18 March 1991, with trains to be driver-only operated (without the presence of a guard). This meant that the driver had to have a clear view of the platform with a bank of CCTV cameras mounted at the platform end for this purpose, however it was discovered that the position of the CCTV cameras on the platforms were not visible from the driver's position. To resolve this Selhurst depot designed a replacement fixing for the driver's seat so that it could slide sideways, allowing a good view of the CCTV units. The modified drivers' seats were installed at Fratton Depot with the work completed by the end of July 1991, and services with the new units commenced in September 1991.
Operations
Connex South Central and SouthCentral/Southern
When Britain's railways were privatised, the entire Class 456 fleet passed into the South Central franchise (later known as the Southern franchise), which was originally won by Connex South Central. Only one unit, No. 456024, was repainted in white and yellow Connex livery, when it was named Sir Cosmo Bonsor after a chairman of the South Eastern Railway. The rest of the fleet had remained in Network South East livery until summer 2006, when the fleet started to be repainted into Southern livery.
In 2000, Connex lost the South Central franchise to the Go-Ahead Group, who rebranded the company as Southern in 2004.
On 8 May 2012 it was announced by the Department for Transport that the entire fleet of 24 2-car Class 456s would transfer to South West Trains (SWT) in 2014, to be used in conjunc |
https://en.wikipedia.org/wiki/Dropper%20%28malware%29 | A dropper is a kind of Trojan that has been designed to "install" malware (virus, backdoor, etc.) to a computer. The malware code can be contained within the dropper in such a way as to avoid detection by virus scanners; or the dropper may download the malware to the targeted computer once activated.
There are two types of droppers. The first is known as a persistent dropper. Upon running the malware, it hides itself on the device. It then modifies the system registry keys. Even if the malware is removed the hidden file will execute upon rebooting the system. This allows it to reinstall the malware even if it was previously removed. The second type is known as a non-persistent dropper. It is less dangerous because upon executing its payload it removes itself from the system. This way, when the malware is removed it will not be able to reinstall itself.
A Trojan works by disguising itself into another program. It then requires the user to click on it to be executed. It unpacks code and then loads the payload into memory. It then installs the malicious software (malware). A notable example of such malware is GCleaner, which is a dropper that disguises itself as a genuine PC optimization program.
In order to prevent malware droppers from infecting a computer, precautions can be taken. For example, not opening links from unknown sources, and downloading software only from known verified distributors, such as the Microsoft Store and the Apple App Store. Also a firewall can be used to allow only incoming traffic from verified sources.
Droppers can also work on mobile devices. For instance, if a user downloads an application from a link in a text message, upon the installation of the application the dropper infects the device with malware. An example of a Trojan dropper created for mobile devices is the Sharkbot dropper. It is a financial Trojan that takes user's funds by exploiting an Automatic Transfer Service (ATS). This can automatically complete financial transaction fields with almost no user help. This allows an attacker to quickly transfer funds out of a user's mobile banking applications. This type of malware is not found in app stores. Instead, it has to be installed through a process called sideloading.
See also
Drive-by download
References
Types of malware |
https://en.wikipedia.org/wiki/Operaci%C3%B3n%20Triunfo%20%28Spanish%20TV%20series%29 | Operación Triunfo (English: Operation Triumph) is a reality television talent show which first aired on Spain's TVE network in 2001. A music talent contest with viewer voting and reality show elements that originated Endemol's Star Academy franchise, the show aims to find the country's next solo singing sensation.
Operación Triunfo (also known as OT) first aired in 2001. On its first run between 2001 and 2004, three series were aired on TVE, which also served as the national final to select the Spanish entry for the Eurovision Song Contest. The first series of OT was particularly successful in ratings, becoming one of the most popular shows in the history of Spanish television and featuring singers that went on to enjoy long-term recognition from the public: notably Rosa López, David Bisbal, David Bustamante or Chenoa. After the third series, TVE decided not to renew the show and its rights were acquired by Telecinco, which aired series 5–8 of the series. Series 8 in 2011 was cancelled due to poor ratings and its finale was rushed as a result.
On 26 April 2017, RTVE approved a new series of the talent show produced by Gestmusic Endemol, returning to TVE after 13 years. The total cost of the series was €10.2 million. Due to its ratings success, it was renewed for a further series. This was the second most successful edition of the program to date, artists like Aitana, Ana Guerra, Amaia, Alfred García, Luis Cepeda, Agoney, Miriam Rodríguez or Lola Índigo have emerged from this edition.
In 2023, Amazon Prime Video acquired the rights to air the twelfth series.
Format
A selection of hopefuls is boarded in "The Academy", managed by a headmaster, where they are coached by various professionals in several artistic disciplines and are filmed with cameras (an idea borrowed from another of Endemol's major reality shows Big Brother). Once a week, the contestants have to face a prime time show, where they sing a cover version of a popular song they have prepared during the week before, as well as recapping their trials and tribulations at The Academy from the past week. The live show will often feature special guest stars, with whom some of the contestants have the opportunity to sing. Based on the judges' verdicts and viewer voting, the weakest contestant is dropped. The eventual winner is awarded a record deal and/or some amount of money.
Series overview
All contestants appearing above (1st to 6th) were born in Spain, except for Chenoa who is Argentinian-born (from series 1), Moritz Weisskopf who is German (series 5), Chipper Cooke who is from the United States (series 6), Brenda Mau who is from Peru (series 7), Alexandra Masangkay who is from the Philippines (series 8), winner of series 8 Nahuel Sachak who is from Paraguay, and winner of series 10 Famous Oberogo who is Nigerian-born.
Series 1 (2001–02)
All three finalists of the inaugural series released debut albums, but while Rosa (accompanied by some fellow contenders as backing singers) scored |
https://en.wikipedia.org/wiki/Man%20or%20boy%20test | The man or boy test was proposed by computer scientist Donald Knuth as a means of evaluating implementations of the ALGOL 60 programming language. The aim of the test was to distinguish compilers that correctly implemented "recursion and non-local references" from those that did not.
Knuth's example
In ALGOL 60:
begin
real procedure A(k, x1, x2, x3, x4, x5);
value k; integer k;
real x1, x2, x3, x4, x5;
begin
real procedure B;
begin k := k - 1;
B := A := A(k, B, x1, x2, x3, x4)
end;
if k ≤ 0 then A := x4 + x5 else B
end
outreal(1, A(10, 1, -1, -1, 1, 0))
end
This creates a tree of B call frames that refer to each other and to the containing A call frames, each of which has its own copy of k that changes every time the associated B is called. Trying to work it through on paper is probably fruitless, but for k = 10, the correct answer is −67, despite the fact that in the original article Knuth conjectured it to be −121. Even modern machines quickly run out of stack space for larger values of k, which are tabulated below ().
Explanation
There are three Algol features used in this program that can be difficult to implement properly in a compiler:
Nested function definitions: Since B is being defined in the local context of A, the body of B has access to symbols that are local to A — most notably k, which it modifies, but also x1, x2, x3, x4, and x5. This is straightforward in the Algol descendant Pascal, but not possible in the other major Algol descendant C (without manually simulating the mechanism by using C's address-of operator, passing around pointers to local variables between the functions).
Function references: The B in the recursive call A(k, B, x1, x2, x3, x4) is not a call to B, but a reference to B, which will be called only when k is greater than zero. This is straightforward in standard Pascal (ISO 7185), and also in C. Some variants of Pascal (e.g. older versions of Turbo Pascal) do not support procedure references, but when the set of functions that may be referenced is known beforehand (in this program it is only B), this can be worked around.
Constant/function dualism: The x1 through x5 parameters of A may be numeric constants or references to the function B — the x4 + x5 expression must be prepared to handle both cases as if the formal parameters x4 and x5 had been replaced by the corresponding actual parameter (call by name). This is probably more of a problem in statically typed languages than in dynamically typed languages, but the standard workaround is to reinterpret the constants 1, 0, and −1 in the main call to A as functions without arguments that return these values.
These things are, however, not what the test is about; they are merely prerequisites for the test to at all be meaningful. What the test is about is whether the different references to B resolve to the correct instance of B — one that has access to the same A-local symbols as the B that created the reference. A "boy |
https://en.wikipedia.org/wiki/TPK%20algorithm | The TPK algorithm is a simple program introduced by Donald Knuth and Luis Trabb Pardo to illustrate the evolution of computer programming languages. In their 1977 work "The Early Development of Programming Languages", Trabb Pardo and Knuth introduced a small program that involved arrays, indexing, mathematical functions, subroutines, I/O, conditionals and iteration. They then wrote implementations of the algorithm in several early programming languages to show how such concepts were expressed.
To explain the name "TPK", the authors referred to Grimm's law (which concerns the consonants 't', 'p', and 'k'), the sounds in the word "typical", and their own initials (Trabb Pardo and Knuth). In a talk based on the paper, Knuth said:
The algorithm
Knuth describes it as follows:
In pseudocode:
ask for 11 numbers to be read into a sequence S
reverse sequence S
for each item in sequence S
call a function to do an operation
if result overflows
alert user
else
print result
The algorithm reads eleven numbers from an input device, stores them in an array, and then processes them in reverse order, applying a user-defined function to each value and reporting either the value of the function or a message to the effect that the value has exceeded some threshold.
Implementations
Implementations in the original paper
In the original paper, which covered "roughly the first decade" of the development of high-level programming languages (from 1945 up to 1957), they gave the following example implementation "in a dialect of ALGOL 60", noting that ALGOL 60 was a later development than the languages actually discussed in the paper:
TPK: begin integer i; real y; real array a[0:10];
real procedure f(t); real t; value t;
f := sqrt(abs(t)) + 5 × t ↑ 3;
for i := 0 step 1 until 10 do read(a[i]);
for i := 10 step -1 until 0 do
begin y := f(a[i]);
if y > 400 then write(i, 'TOO LARGE')
else write(i, y);
end
end TPK.
As many of the early high-level languages could not handle the TPK algorithm exactly, they allow the following modifications:
If the language supports only integer variables, then assume that all inputs and outputs are integer-valued, and that sqrt(x) means the largest integer not exceeding .
If the language does not support alphabetic output, then instead of the string 'TOO LARGE', output the number 999.
If the language does not allow any input and output, then assume that the 11 input values have been supplied by an external process somehow, and the task is to compute the 22 output values (with 999 replacing too-large values of ).
If the language does not allow programmers to define their own functions, then replace f(a[i]) with an expression equivalent to .
With these modifications when necessary, the authors implement this algorithm in Konrad Zuse's Plankalkül, in Goldstine and von Neumann's flow diagrams, in Haskell Curry's proposed notation, in Short Code of John |
https://en.wikipedia.org/wiki/ALGO | ALGO is an algebraic programming language developed for the Bendix G-15 computer.
ALGO was one of several programming languages inspired by the Preliminary Report on the International Algorithmic Language written in Zürich in 1958. This report underwent several modifications before becoming the Revised Report on which most ALGOL implementations are based. As a result, ALGO and other early ALGOL-related languages have a very different syntax from ALGOL 60.
Example
Here is the Trabb Pardo – Knuth algorithm in ALGO:
TITLE TRABB PARDO-KNUTH ALGORITHM
SUBSCript I,J
DATA A(11)
FORMAt FI(2DT), FLARGE(3D)
PROCEDURE F(T=Z)
BEGIN
Z=SQRT(ABS(T))+5*T^3
END
FOR I=0(1)10
A[I]=KEYBD
FOR J=0(1)10 BEGIN
I=J-10
F(A[I]=Y)
PRINT(FI)=I
IF Y > 400
GO TO LARGE
PRINT(FL)=Y
GO TO NEXT
LARGE: PRINT(FLARGE)=999
NEXT: CARR(1) END
2END
Remarks
See also
ALGOL 58
ALGOL 60
References
External links
ALGO manual (PDF)
ALGOL 58 dialect |
https://en.wikipedia.org/wiki/Tower%20%28disambiguation%29 | A tower is a tall human-made structure.
Tower may also refer to:
Types of towers
Air traffic control tower
Bell tower
Cell tower, a cellular telephone communications site
Clock tower
Computer tower
Conning tower
Cooling tower
Drop tower, an amusement park ride
Fire lookout tower
Fortified tower
Interlocking tower or control cabin, directs railroad traffic
Lattice tower or truss tower
Martello tower, a small defensive fort
Office tower
Peel tower, a small fortified keep or tower house
Radio tower
Siege tower or breaching tower
Telecommunications tower (disambiguation)
Television tower
Tower houses in the Balkans, tower houses built in the Balkans
Transmission tower, used for electric power transmission
Watchtower, a type fortification used in many parts of the world
Water tower
Places
Geography
Tower (ward), ward of the City of London, England
Tower, County Cork, Ireland
Tower, Michigan, United States
Tower, Minnesota, United States
Tower Branch, a stream in Pennsylvania, United States
Buildings with the name
Tower of London, also known as "The Tower"
Towers (Boston University), a dormitory at Boston University
Trump Tower, a mixed use commercial and residential building in New York City
People
Tower (surname), also Towers (surname)
Arts, entertainment, media and sports
Fictional entities
Tower (Code Lyoko), element of virtual world in animated TV series
Tower (comics), a Marvel Comics character
Music
Tower (album), an album by the Finnish rock band Circle featuring Verde
, a 1980s Dutch Symphonic Rock band
"Towers", a song by Little Mix
Other uses in arts, entertainment, and media
Tower (2012 Canadian film), directed by Kazik Radwanski
Tower (2016 film), about the 1966 shootings at the University of Texas at Austin
"Towers", an episode of the television series Teletubbies
The Tower (Tarot card)
Sports
Hamburg Towers, German basketball team
London Towers, former English basketball team
Brands and enterprises
Alton Towers, a theme park and resort located in Staffordshire, England
Tower Comics
Tower International
Tower Records (music retailer)
Tower Records (record label)
TOWER Software
Towers Department Stores, Canada
Tower Semiconductor, Israel
Mathematics
Tower of fields, a sequence of field extensions
Tower of objects, in category theory
Tower of powers, nested exponentiation
Organizations
Hamburg Towers, German basketball club
Princeton Tower Club, an eating club at Princeton University
Tower Transit, a bus operating company in London since 2013 owned by Transit Systems
Tower Transit Singapore, a bus operating company in Singapore since June 2016 owned by Transit Systems
Other uses
Tower (typeface)
See also
List of leaning towers
Tall buildings in London
The Tower (disambiguation)
The Towers (disambiguation)
Tower blocks in Great Britain
Tower City (disambiguation) |
https://en.wikipedia.org/wiki/Computer%20tower | In personal computing, a tower is a form factor of desktop computer case whose height is much greater than its width, thus having the appearance of an upstanding tower block, as opposed to a traditional "pizza box" computer case whose width is greater than its height and appears lying flat.
Compared to a pizza box case, the tower tends to be larger and offers more potential for internal volume for the same desk area occupied, and therefore allows more hardware installation and theoretically better airflow for cooling. Multiple size subclasses of the tower form factor have been established to differentiate their varying heights, including full-tower, mid-tower, midi-tower and mini-tower; these classifications are however nebulously defined and inconsistently applied by different manufacturers.
Although the traditional layout for a tower system is to have the case placed on top of the desk alongside the monitor and other peripherals, a far more common configuration is to place the case on the floor below the desk or in an under-desk compartment, in order to free up desktop space for other items. Computer systems housed in the horizontal "pizza box" form factor — once popularized by the IBM PC in the 1980s but fallen out of mass use since the late 1990s — have been given the term desktops to contrast them with the often underdesk-situated towers.
Subclasses
Tower cases are often categorized as mini-tower, midi-tower, mid-tower, or full-tower. The terms are subjective and inconsistently defined by different manufacturers.
Full-tower
Full-tower cases, typically or more in height, are designed for maximum scalability. For case modding enthusiasts and gamers wanting to play the most technically challenging video games, the full-tower case also makes for an ideal gaming PC case because of their ability to accommodate extensive water cooling setups and larger case fans. Traditionally, full-tower systems had between four and six externally accessible half-height 5.25-inch drive bays and up to ten 3.5-inch drive bays. Some full-tower cases included locking side-doors and other physical security features to prevent theft of the discs inside those bays. However, as modern computing technology has moved away from mechanical hard drives and optical drives toward solid-state devices such as USB flash drives, solid-state drives (SSDs), large-capacity external storage, and cloud storage, such an abundance of internal and external drive bays is less common. More recent full-tower cases instead only have one or two external drive bays, or none at all, with the internal bays moved elsewhere in the case to free up room and improve airflow.
Full-tower cases readily fit full-size ATX motherboards but may also accommodate smaller microATX motherboards due to the former standard's interoperability in mounting holes. Full-tower cases may also have increased dimensional depth and length over their shorter counterparts, allowing them to accommodate Extended ATX moth |
https://en.wikipedia.org/wiki/Instant-on | In computing, instant-on is the ability to boot nearly instantly, allowing to go online or to use a specific application without waiting for a PC's traditional operating system to launch. Instant-on technology is today mostly used on laptops, netbooks, and nettops because the user can boot up one program, instead of waiting for the PC's operating system to boot. This allows a user to launch a single program, such as a movie-playing program or a web browser, without the need of the whole operating system. There still remain a few true instant-on machines such as the Atari ST, as described in the Booting article. These machines had complete Operating Systems resident in ROM similar to the way in which the BIOS function is conventionally provided on current computer architectures. The "instant-on" concept as used here results from loading an OS, such as a legacy system DOS, with a small hard drive footprint. Latency inherent to mechanical drive performance can also be eliminated by using Live USB or Live SD flash memory to load systems at electronic speeds which are orders of magnitude faster.
List of systems
Acer InstaBoot Netbook (based on Splashtop)
Acer RevoBoot Nettop (based on Splashtop)
Asus Express Gate motherboards, notebooks, Eee Box (nettop), and EeePCs (based on Splashtop)
Canonical product announced in early 2010
Dell Latitude ON, Latitude On Reader (based on Splashtop), Latitude On Flash (based on Splashtop)
Google ChromeOS
HP QuickWeb Probook notebook (based on Splashtop)
HP Instant On Solution Voodoo & Envy notebook (based on Splashtop)
HP Instant Web netbook (based on Splashtop)
Lenovo QuickStart (based on Splashtop)
LG SmartOn (based on Splashtop)
Mandriva InstantOn
MSI Winki
Palm Foleo
Phoenix HyperSpace
Sony Quick Web Access (based on Splashtop)
Splashtop Inc. Splashtop
Xandros Presto
Timeline
In October 2007, ASUS introduced an instant-on capability branded "Express Gate" on select motherboards, using DeviceVM's Splashtop software and dedicated flash memory.
In May 2008, Asus shipping "Express Gate" based on Splashtop to its notebooks.
In July 2008, HP started shipping Splashtop on its Voodoo notebooks, calling it "Instant On Solution (IOS)."
In October 2008, Lenovo started shipping Splashtop on its netbooks, calling it "QuickStart."
Dell Computer Corporation announced on 13 August 2008 that they would support "instant on" in their Latitude line of laptops, leveraging "a dedicated low-voltage sub-processor and OS that can enable multi-day battery life and which provides "near-instant access to e-mail, calendar, attachments, contacts and the Web without booting into the system’s main operating system (OS)..." This OS will be running a Linux variant.
In January 2009, LG started shipping Splashtop on its netbooks, calling it "Smart On."
In June 2009, Acer started using Splashtop on its netbook, calling it "RevoBoot."
In June 2009, Sony started installing an instant-on browser-only version of Splashtop software on its Vaio NW |
https://en.wikipedia.org/wiki/Vivo%20Software | Vivo Software was a pioneer internet streaming media company which was acquired by RealNetworks in March 1998. Vivo Software designed the Vivo Video/Audio platform, including its encoding tools and end-user VivoActive Player.
The Vivo format, obsolete today, was one of the first to be designed and used for internet streaming. The Vivo platform was a well-known player when streaming media was in its infancy and was deployed mainly on erotic sites during the mid-1990s. Since then RealPlayer, QuickTime and Windows Media have evolved as the dominant platforms. The development of Vivo ceased in 1997 to be replaced by RealPlayer from RealNetworks.
VivoActive
VivoActive is an audio/video format created by Vivo Software, acquired by RealNetworks in 1997. The Vivo format is based upon H.263 video and G.723 ADPCM audio (not the G.723.1 speech codec). It uses inter-frame coding, but does not insert any key frames, except at the beginning of the clip, which effectively disables the possibility of seeking to specific locations in the stream. One of the last released versions of VivoActive Player added a workaround for this handicap by quickly decoding all frames from the first one to the requested position.
MPlayer is able to play and convert Vivo video clips.
Playback
The official client (The VivoActive Player) was limited. Current available clients are:
Mplayer – http://www.mplayerhq.hu
RealPlayer – http://www.real.com
VivoActive Browser Plug-in – http://egg.real.com/vivo-player/vivodl.html
See also
RealMedia
RealNetworks
References
External links
Internet Assigned Numbers Authority for vivo
VivoActive Browser Plug-In Download
RealNetworks Acquisition History
Multimedia Vivo
Defunct software companies of the United States
Software companies disestablished in 1998
Video codecs
Audio codecs
RealNetworks
1998 mergers and acquisitions |
https://en.wikipedia.org/wiki/Memory%20space | Memory space can refer to:
Memory space (computational resource), a computer science/information theory concept related to computational resources
Memory space (social science), a sociological concept related to collective memory |
https://en.wikipedia.org/wiki/GSN | GSN may refer to:
Game Show Network, an American television channel
Gay Star News, a British news website
Gelsolin
Gigabyte System Network, a computer networking technology
Global SchoolNet, an American educational organization
Global Seismographic Network
Goal Structuring Notation, a graphical argument notation used in safety cases
Nema language
Saipan International Airport, in the Northern Mariana Islands
Yashica Electro 35 GSN, a camera |
https://en.wikipedia.org/wiki/4D | 4D or 4-D may refer to:
4-dimensional spacetime: three-dimensional space of length, width, and height, plus time
Four-dimensional space
Computers and photography
4D (software), a complete programming environment including database and web server
4D SAS, developers of 4D and Wakanda
4D Inc, a US-based subsidiary of 4D SAS
4D BIM, a term used in computer aided design
4D printing
Cinema 4D, a commercial cross platform 3D graphics application
SGI IRIS 4D, a line of workstations from Silicon Graphics
4D, a photo print size for digital cameras
Arts and entertainment
4D (album), a 2010 album by Matthew Shipp
"4-D" (The X-Files), an episode of The X-Files
4D Audio Recording system, an audio recording system developed by Deutsche Grammophon
4D film, a high technology film experience augmented with physical or environmental effects
4DTV, a satellite TV broadcasting technology from Motorola
4DX, a 4D film format
"4D", a song by Grand Mixer DXT and Bill Laswell from Aftermathematics (2003)
"4D", a song by Northlane from Alien (2019)
4D, the production code for the 1975 Doctor Who serial Revenge of the Cybermen
Other
Class 4-D, a classification of the Selective Service System
4-D (psychedelic), a psychedelic drug
4D (train) in Melbourne, Australia
4-Digits, a lottery in Malaysia and Singapore
Air Sinai (IATA: 4D)
Ring finger, the fourth digit (abbreviated 4D) of the hand
Potez 4D, a four-cylinder aircraft engine
See also
D4 (disambiguation)
Fourth dimension (disambiguation)
Four Dimensions (disambiguation) |
https://en.wikipedia.org/wiki/Mega%20Man%20Battle%20Network | is a tactical role-playing video game series created by Masahiro Yasuma and developed and published by Capcom as a spin-off of the Mega Man series; it premiered in 2001 on the Game Boy Advance and takes place in an alternate continuity where computers and networking technology was the main focus on scientific advancement, rather than robotics. There are a total of six mainline games, alongside several spin-offs.
Created amidst the success of Nintendo's and Game Freak's Pokémon series, alongside the rise of collectable card games, Mega Man Battle Network has players control MegaMan.EXE, a NetNavi operated by Lan Hikari as they attempt to stop the schemes of a net-crime organization called WWW (called "World Three"), headed by the universe's interpretation of Dr. Wily. Players battle enemies on a 6x3 grid, selecting "Battle Chips" which allow for more powerful attacks.
The series has been met with positive reviews from critics, although later games, particularly 5 and 6, have been criticized for a perceived lack of innovation; the series was followed-up by a sequel series titled Mega Man Star Force, which is set 200 years after Battle Network and focuses on radio waves. A compilation of all six mainline entries, Mega Man Battle Network Legacy Collection, was released in April 2023 for PlayStation 4, Nintendo Switch and PC.
Plot
Mega Man Battle Network is set in an ambiguous year in the 21st century ("20XX AD") in an alternate reality to the original Mega Man series. Within the world of Battle Network, the Net has become humanity's primary means of communication, commerce, and even crime. Users are able to "jack in" to the Net and other computerized devices, and explore their various aspects using Digital people called "NetNavis (Network Navigators)" as if they were physical locations. The Net and the inner workings of computers are displayed as a virtual world with which computer programs of all varieties, as personified in a humanoid form, can interact. Users often do so by accessing their NetNavis via a "PET (PErsonal information Terminal)" device.
The plot of Mega Man Battle Network follows one such pair, Lan Hikari and his NetNavi MegaMan.EXE. Lan is a fifth grader in the town of ACDC. His father, Dr. Yuichiro Hikari, is one of the world's top scientists and NetNavi researchers. Most of the series (barring spin-offs) involve Lan Hikari and MegaMan.EXE stopping an evil crime syndicate from taking over the world; "WWW" (said out loud as "World Three") in the first, third, and sixth games, Gospel in the second game, and Nebula in the fourth and fifth games.
Gameplay
Mega Man Battle Network is a real-time tactical RPG series. To progress through the games, the player must alternately navigate the outside world as Lan Hikari and the Net as MegaMan.EXE, each containing certain tasks that must be completed to allow advancement in the other. Controlling Lan, the player may travel around the world map, interact with non-player characters, check e |
https://en.wikipedia.org/wiki/The%20Biggest%20Loser%20%28American%20TV%20series%29 | The Biggest Loser is an American competition reality show that initially ran on NBC for 17 seasons from 2004 to 2016 before moving to USA Network in 2020. The show features obese or overweight contestants competing to win a cash prize by losing the highest percentage of weight relative to their initial weight.
Premise
Each season of The Biggest Loser starts the 30-week competition with a weigh-in to determine the contestants' starting weights, which serve as the baseline for determining the overall winner.
The contestants are grouped into teams of three, each wearing separate colored T-shirts. Depending on the season a team may work with a specific trainer or all trainers may work with all contestants. The trainers are responsible (in conjunction with medical personnel retained by the show) for designing comprehensive workout and nutrition plans and teaching them to the contestants. However, the contestants are individually responsible for implementing the principles taught.
During an episode, various challenges and temptations (see below) are featured. Those who win a particular challenge are given special privileges, such as a weight advantage for the next weigh-in or even full immunity from being voted off the show.
Each week culminates in another weigh-in to determine which team has lost the most weight for that week, in percentage of total weight lost. The team that has lost the least percentage during that week (known as "falling below the yellow line", which refers to a line featured on a video screen showing the cutoff between safety and being at-risk) will have one member voted off (unless the team consists of only one remaining member, in which case there is no vote). The vote is usually made by the other teams, though some episodes feature one team making the decision alone. Some episodes feature a second, "red line"; if a contestant falls below the red line the contestant is automatically off the show with no vote. Other episodes allow for the contestants, if successfully meeting a goal at the weigh-in, to all receive immunity for the week.
When the number of contestants has shrunk to a predetermined smaller number (unknown to the contestants), the teams are dissolved and the contestants compete one-on-one against each other.
The season finale reunited the final contestants remaining on the show and those eliminated. The eliminated contestants compete for a smaller prize while those remaining on the show compete for a larger prize and the title of "The Biggest Loser".
Episode format
Episodes are typically two hours long. Some episodes have been aired in a shortened one-hour format to accommodate adjacent network programming such as The Voice and the State of the Union address. Each episode features some, but not all, of the following activities (some contestants may not participate in an activity with physical requirements if placed on medical restrictions):
Temptation:Contestants prepare for the first day of the week o |
https://en.wikipedia.org/wiki/ANSI.SYS | ANSI.SYS is a device driver in the DOS family of operating systems that provides extra console functions through ANSI escape sequences. It is partially based upon a subset of the text terminal control standard proposed by the ANSI X3L2 Technical Committee on Codes and Character Sets (the "X3 Committee").
As it was not installed by default, and was notoriously slow, little software took advantage of it and instead resorted to directly manipulating the IBM PC hardware. A number of third-party alternatives that ran at reasonable speed were created, such as , and to attempt to change this.
Usage
To use under DOS, a line is added to the (or under Windows NT based versions of Windows) file that reads:
DEVICE=drive:\path\ANSI.SYS options
where drive: and path are the drive letter and path to the directory in which the file is found, and options can be a number of optional switches to control the behaviour. may also be loaded into upper memory via /.
use extended keyboard BIOS functions (INT 16h) rather than standard ones This made the F11 and F12 keys work.
force number of lines
adjust line scrolling to support screen readers
or set screensize
support redefinition of extended key codes independent of standard codes
Functionality
Using this driver, programs that write to the standard output can make use of the 16 text foreground colors and 8 background colors available in VGA-compatible text mode, make text blink, change the location of the cursor on the screen, and blank the screen. It also allows for the changing of the video mode from standard 80×25 text mode to a number of different graphics modes (for example, 320×200 graphics mode with text drawn as pixels, though ANSI.SYS is not able to turn individual pixels on and off).
The standard is relatively slow as it maps escape sequences to BIOS calls (which managed to be designed so that two calls were needed to put a character on the screen and move the cursor right). Several companies made third-party replacements that interface directly with the video memory, in a similar way to most DOS programs that have a full-screen user interface.
By default, the internal DOS command works by directly calling the corresponding BIOS function to clear the screen, thereby prominently violating the hardware abstraction model.
Keyboard remapping
An interesting feature of is the ability to remap any key on the keyboard in order to perform shortcuts or macros for complex instructions. Using special escape sequences, the user can define any keystroke that has a character-code mapping to simulate an arbitrary sequence of such keystrokes. This feature was also used to create simple trojans out of text files laced with nefarious keyboard remaps, known as "ANSI bombs". A number of products were released to protect users against this:
Some versions of ANSI.SYS support a command line switch to disable the key remapping feature, f.e. the option (Secure) in ANSI.SYS of Datalight ROM-DOS or NANSI. |
https://en.wikipedia.org/wiki/XMG | XMG may refer to:
Crossmaglen a British Military abbreviation for the village
Xiamen Media Group, television and radio broadcasting network
XMG Studio, mobile games developer |
https://en.wikipedia.org/wiki/BRL-CAD | BRL-CAD is a constructive solid geometry (CSG) solid modeling computer-aided design (CAD) system. It includes an interactive geometry editor, ray tracing support for graphics rendering and geometric analysis, computer network distributed framebuffer support, scripting, image-processing and signal-processing tools. The entire package is distributed in source code and binary form.
Although BRL-CAD can be used for a variety of engineering and graphics applications, the package's primary purpose continues to be the support of ballistic and electromagnetic analyses. In keeping with the Unix philosophy of developing independent tools to perform single, specific tasks and then linking the tools together in a package, BRL-CAD is basically a collection of libraries, tools, and utilities that work together to create, raytrace, and interrogate geometry and manipulate files and data. In contrast to many other 3D modelling applications, BRL-CAD primarily uses CSG rather than boundary representation. This means BRL-CAD can "study physical phenomena such as ballistic penetration and thermal, radiative, neutron, and other types of transport". It does also support boundary representation.
The BRL-CAD libraries are designed primarily for the geometric modeler who also wants to tinker with software and design custom tools. Each library is designed for a specific purpose: creating, editing, and ray tracing geometry, and image handling. The application side of BRL-CAD also offers a number of tools and utilities that are primarily concerned with geometric conversion, interrogation, image format conversion, and command-line-oriented image manipulation.
History
In 1979, the U.S. Army Ballistic Research Laboratory (BRL) expressed a need for tools that could assist with the computer simulation and engineering analysis of combat vehicle systems and environments. When no CAD package was found to be adequate for this purpose, BRL software developers – led by Mike Muuss – began assembling a suite of utilities capable of interactively displaying, editing, and interrogating geometric models. This suite became known as BRL-CAD. Development on BRL-CAD as a package subsequently began in 1983; the first public release was made in 1984. BRL-CAD became an open-source project in December 2004.
The BRL-CAD source code repository is the oldest known public version-controlled codebase in the world that's still under active development, dating back to 1983-12-16 00:10:31 UTC.
See also
PLaSM - Programming Language of Solid Modeling
Comparison of CAD editors
References
External links
Computer-aided design software for Linux
Computer-aided design software
Engineering software that uses Qt
Free computer-aided design software
Free software programmed in C
Free software programmed in Tcl
MacOS computer-aided design software
Software that uses Tk (software)
Software using the BSD license |
https://en.wikipedia.org/wiki/Angela%20Sarkis | Angela Sarkis CBE (born 1955), was the Chief Executive of the Nurture Group Network, a charitable organisation which promotes and supports the development of specialist support for vulnerable children within mainstream education. She is also a board member of the Youth Justice Board for England and Wales.
A former BBC Governor (2002–2006), she was also formerly a member of the House of Lords Appointments Commission. She has held senior leadership roles with charitable organisations including the DIVERT Trust, Church Urban Fund and YMCA England.
Sarkis is an advisor to the Ascension Trust, which established the Street Pastors initiative in 2003.
She was appointed a CBE in 2000.
References
Living people
BBC Governors
Commanders of the Order of the British Empire
1955 births |
https://en.wikipedia.org/wiki/Logic%20in%20computer%20science | Logic in computer science covers the overlap between the field of logic and that of computer science. The topic can essentially be divided into three main areas:
Theoretical foundations and analysis
Use of computer technology to aid logicians
Use of concepts from logic for computer applications
Theoretical foundations and analysis
Logic plays a fundamental role in computer science. Some of the key areas of logic that are particularly significant are computability theory (formerly called recursion theory), modal logic and category theory. The theory of computation is based on concepts defined by logicians and mathematicians such as Alonzo Church and Alan Turing. Church first showed the existence of algorithmically unsolvable problems using his notion of lambda-definability. Turing gave the first compelling analysis of what can be called a mechanical procedure and Kurt Gödel asserted that he found Turing's analysis "perfect."
In addition some other major areas of theoretical overlap between logic and computer science are:
Gödel's incompleteness theorem proves that any logical system powerful enough to characterize arithmetic will contain statements that can neither be proved nor disproved within that system. This has direct application to theoretical issues relating to the feasibility of proving the completeness and correctness of software.
The frame problem is a basic problem that must be overcome when using first-order logic to represent the goals and state of an artificial intelligence agent.
The Curry–Howard correspondence is a relation between logical systems and software. This theory established a precise correspondence between proofs and programs. In particular it showed that terms in the simply typed lambda calculus correspond to proofs of intuitionistic propositional logic.
Category theory represents a view of mathematics that emphasizes the relations between structures. It is intimately tied to many aspects of computer science: type systems for programming languages, the theory of transition systems, models of programming languages and the theory of programming language semantics.
Computers to assist logicians
One of the first applications to use the term artificial intelligence was the Logic Theorist system developed by Allen Newell, Cliff Shaw, and Herbert Simon in 1956. One of the things that a logician does is to take a set of statements in logic and deduce the conclusions (additional statements) that must be true by the laws of logic. For example, if given the statements "All humans are mortal" and "Socrates is human" a valid conclusion is "Socrates is mortal". Of course this is a trivial example. In actual logical systems the statements can be numerous and complex. It was realized early on that this kind of analysis could be significantly aided by the use of computers. The Logic Theorist validated the theoretical work of Bertrand Russell and Alfred North Whitehead in their influential work on mathematical logic cal |
https://en.wikipedia.org/wiki/K-minimum%20spanning%20tree | The -minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly vertices and forms a subgraph of a larger graph. It is also called the -MST or edge-weighted -cardinality tree. Finding this tree is NP-hard, but it can be approximated to within a constant approximation ratio in polynomial time.
Problem statement
The input to the problem consists of an undirected graph with weights on its edges, and a The output is a tree with vertices and edges, with all of the edges of the output tree belonging to the input graph. The cost of the output is the sum of the weights of its edges, and the goal is to find the tree that has minimum cost. The problem was formulated by and by .
Ravi et al. also considered a geometric version of the problem, which can be seen as a special case of the graph problem.
In the geometric -minimum spanning tree problem, the input is a set of points in the plane. Again, the output should be a tree with of the points as its vertices, minimizing the total Euclidean length of its edges. That is, it is a graph -minimum spanning tree on a complete graph with Euclidean distances as weights.
Computational complexity
When is a fixed constant, the -minimum spanning tree problem can be solved in polynomial time by a brute-force search algorithm that tries all -tuples of vertices.
However, for variable , the -minimum spanning tree problem has been shown to be NP-hard by a reduction from the Steiner tree problem.
The reduction takes as input an instance of the Steiner tree problem: a weighted graph, with a subset of its vertices selected as terminals. The goal of the Steiner tree problem is to connect these terminals by a tree whose weight is as small as possible. To transform this problem into an instance of the -minimum spanning tree problem, attach to each terminal a tree of zero-weight edges with a large number of vertices per tree. (For a graph with vertices and terminals, they use added vertices per tree.) Then, they ask for the -minimum spanning tree in this augmented graph with . The only way to include this many vertices in a -spanning tree is to use at least one vertex from each added tree, for there are not enough vertices remaining if even one of the added trees is missed. However, for this choice of , it is possible for -spanning tree to include only as few edges of the original graph as are needed to connect all the terminals. Therefore, the -minimum spanning tree must be formed by combining the optimal Steiner tree with enough of the zero-weight edges of the added trees to make the total tree size large enough.
Even for a graph whose edge weights belong to the set }, testing whether the optimal solution value is less than a given threshold is NP-complete. It remains NP-complete for planar graphs. The geometric version of the problem is also NP-hard, but not known to belong to NP, because of the difficulty of comparing sums of square roots; instead i |
https://en.wikipedia.org/wiki/Mathematics%20Genealogy%20Project | The Mathematics Genealogy Project (MGP) is a web-based database for the academic genealogy of mathematicians. it contained information on 274,575 mathematical scientists who contributed to research-level mathematics. For a typical mathematician, the project entry includes graduation year, thesis title (in its Mathematics Subject Classification), alma mater, doctoral advisor, and doctoral students.
Origin of the database
The project grew out of founder Harry Coonce's desire to know the name of his advisor's advisor. Coonce was Professor of Mathematics at Minnesota State University, Mankato, at the time of the project's founding, and the project went online there in fall 1997. Coonce retired from Mankato in 1999, and in fall 2002 the university decided that it would no longer support the project. The project relocated at that time to North Dakota State University. Since 2003, the project has also operated under the auspices of the American Mathematical Society and in 2005 it received a grant from the Clay Mathematics Institute. Harry Coonce has been assisted by Mitchel T. Keller, Assistant Professor at Morningside College. Keller is currently the Managing Director of the project.
Mission and scope
The Mathematics Genealogy Mission statement: "Throughout this project when we use the word 'mathematics' or 'mathematician' we mean that word in a very inclusive sense. Thus, all relevant data from statistics, computer science, philosophy or operations research is welcome."
Scope
The genealogy information is obtained from sources such as Dissertation Abstracts International and Notices of the American Mathematical Society, but may be supplied by anyone via the project's website. The searchable database contains the name of the mathematician, university which awarded the degree, year when the degree was awarded, title of the dissertation, names of the advisor and second advisor, a flag of the country where the degree was awarded, a listing of doctoral students, and a count of academic descendants. Some historically significant figures who lacked a doctoral degree are listed, notably Joseph-Louis Lagrange.
Reliability and completeness
It has been noted that "the data collected by the mathematics genealogy project are self-reported, so there is no guarantee that the observed genealogy network is a complete description of the mentorship network. In fact, 16,147 mathematicians do not have a recorded mentor, and of these, 8,336 do not have any recorded proteges." Maimgren, Ottino and Amaral (2010) stated that "for [mathematicians who graduated between 1900 and 1960] we believe that the graduation and mentorship record is the most reliable."
See also
Neurotree, Academic Family Tree
References
External links
Projects established in 1997
Internet properties established in 1997
Mathematical projects
Historiography of mathematics
Mathematical databases |
https://en.wikipedia.org/wiki/Innovative%20Research%20Universities | Innovative Research Universities (IRU), formerly Innovative Research Universities Australia, is a network of eight comprehensive universities in Australia.
The main purpose of the group is to undertake advocacy on issues related to higher education policy, research and university students.
The IRU has eight university members: Charles Darwin University, James Cook University, Griffith University, La Trobe University, Flinders University, Murdoch University, Western Sydney University and the University of Canberra. Between them, the universities enrol over 238,000 students including around 55,000 international students.
The IRU is one of the four main university groupings in Australia. The other groups are Australian Technology Network, Group of Eight and Regional Universities Network.
History
In 2003, a group of universities sharing common origins established the Innovative Research Universities a collaborative network to enhance the outcomes of higher education. The members were established as research-intensive universities during the 1960s and 1970s.
The founding six universities were: Flinders University, Griffith University, La Trobe University, Macquarie University, Murdoch University and The University of Newcastle. James Cook University joined in 2007, followed by Charles Darwin University in 2009. These additions were balanced as first Macquarie (2008) and then Newcastle (2014) left the group to pursue their future independently. In 2017, Western Sydney University joined, followed by the University of Canberra in 2021.
Members
Research
All members of the IRU are ranked between 170 and 540 in the Times Higher Education World University Rankings 2021. Five IRU universities are also ranked in the global top 100 in the Times Higher Education Impact Ranking 2021. The group collectively attracts A$415 million per annum in research funding from national research agencies, industry and public sector agencies including local and state governments. The members are core partners in half of all Australian Co-operative Research Centres (CRCs). The CRC Program links researchers with industry and government, and emphasises research application.
Map
See also
Universities in Australia
Universities Australia
Australian Technology Network
Golden Triangle (English universities)
C9 League, alliance of top universities in China
National Institutes of Technology (Indian engineering universities)
Group of Eight
Regional Universities Network
References
External links
College and university associations and consortia in Australia |
https://en.wikipedia.org/wiki/Katie%20Salen | Katie Salen Tekinbas is an American game designer, animator, and educator. She is a professor at the University of California, Irvine. Previously, she taught at DePaul University College of Computing and Digital Media, Parsons The New School for Design the University of Texas at Austin, New York University, and the Rhode Island School of Design. She has an MFA in graphic design from the Rhode Island School of Design.
Salen has received grants as principal investigator or co-principal investigator from the Bill & Melinda Gates Foundation, the MacArthur Foundation, the Carnegie Corporation, and Intel. She is one of the co-authors of Rules of Play, a textbook on game design, and the co-editor of The Game Design Reader, a Rules of Play Anthology, as well as the co-editor of The International Journal of Learning and Media. She is the former Director of Graduate Students for the Design and Technology Program at Parsons The New School for Design, as well as the former Director of the Center for Transformative Media, a research center focused on emerging trends in design and media. She is the Executive Director of Institute of Play, a non-profit learning design studio that bases its work on the principles of games and play. In 2009, she helped design and launch Quest to Learn (Q2L), a public school in Manhattan, New York City, and later participated in developing ChicagoQuest, a charter school in Chicago.
Salen's work has involved the development of slow games, online games, mobile games, and big games, both commercially and institutionally.
Education
Salen graduated from the University of Texas in 1990 with a B.A. in Fine Arts. She holds a Masters of Fine Arts in Graphic Design from the Rhode Island School of Design. At RISD, she studied semiotics with Tom Ockerse, who focused on the work of Charles Sanders Peirce. She also worked with designers Jan van Toorn of the Netherlands, Michael Rock, and Sharon Poggenpohl. She has an honorary Doctorate of Letters from Bank Street College of Education.
Early career
2001–2003
In 2001, Salen started to work at gameLab, where she still serves as a member of the advisory board as of 2010. In 2002, Creative Time in New York hired Salen to develop the curriculum and workshops for the Blur Conference. From 2002–2003, she was a writer and animator for music videos for the band Zero7, which had extended play on MYV, MTV and VH1. Also from 2002–2003, Salen was asked to design the Big Urban Game (BUG), a citywide multiplayer game which was to be played by the residents of Minneapolis and St.Paul in Minnesota as part of the Twin Cities Design Celebration.
The Film Society of Lincoln Center engaged Salen to co-curate with Graham Leggatt, the director of the society, "Game Engine", an evening of programming for the New York Video Festival in 2003. In that same year, Salen started writing for RES Magazine, which focuses on film, design, culture, art and music; She continued as a contributor until 2006.
Also in 2003, |
https://en.wikipedia.org/wiki/Eric%20Zimmerman | Eric Zimmerman (born 1969) is an American game designer and the co-founder and CEO of Gamelab, a computer game development company based in Manhattan. GameLab is known for the game Diner Dash. Each year Zimmerman hosts the Game Design Challenge at the Game Developers Conference. He is also the co-author of four books including Rules of Play with Katie Salen, which was published in November 2004. Eric Zimmerman has written at least 24 essays and whitepapers since 1996, mostly pertaining to game development from an academic standpoint. He's currently a founding faculty at the NYU Game Center.
Career
Zimmerman develops video games and teaches game design. He has taught at universities including MIT, the University of Texas at Austin, Parsons School of Design, New York University, Rhode Island School of Design and School of Visual Arts. He co-designed the 1996 video game Gearheads with Frank Lantz at R/GA Interactive. During the game's development, they coined the term "engine" to refer to combinations of toys. Beginning in 2010, he serves as an Arts Professor at the NYU Game Center, within the Tisch School of the Arts.
In 2009, game development company Arkadium acquired Gamelab. Zimmerman continued as workshop director for the company.
Since 2009, Zimmerman has created a series of large-scale, performative games for art galleries and public space, in collaboration with architect Nathalie Pozzi. These games include Sixteen Tons, Cross My Heart + Hope to Die, Starry Heavens, which was shown at the New York Museum of Modern Art, Interference. and Waiting Rooms, at the Rubin Museum of Art
Zimmerman is a director of the RE:PLAY series of events and activities on gaming that included an exhibition, conference and accompanying book.
The first online game he helped create was a collaboration with Word.com called SiSSYFiGHT 2000.
Zimmerman is also a co-writer of a screenplay for a short film Play (2009).
Zimmerman was an Honorary Fellow at Eyebeam from 1997–1999.
Awards
IndieCade 2010 award – Finalists Choice award for Sixteen Tons
IndieCade 2012 – Game Design award for Armada d6 and Interaction award for Interference
References
External links
Official website
Gamelab site
1969 births
Living people
American video game designers
American entertainment industry businesspeople
Place of birth missing (living people)
Video game researchers
American male writers
Pervasive games |
https://en.wikipedia.org/wiki/IP%20Multimedia%20Subsystem | The IP Multimedia Subsystem or IP Multimedia Core Network Subsystem (IMS) is a standardised architectural framework for delivering IP multimedia services. Historically, mobile phones have provided voice call services over a circuit-switched-style network, rather than strictly over an IP packet-switched network. Alternative methods of delivering voice (VoIP) or other multimedia services have become available on smartphones, but they have not become standardized across the industry. IMS is an architectural framework that provides such standardization.
IMS was originally designed by the wireless standards body 3rd Generation Partnership Project (3GPP), as a part of the vision for evolving mobile networks beyond GSM. Its original formulation (3GPP Rel-5) represented an approach for delivering Internet services over GPRS. This vision was later updated by 3GPP, 3GPP2 and ETSI TISPAN by requiring support of networks other than GPRS, such as Wireless LAN, CDMA2000 and fixed lines.
IMS uses IETF protocols wherever possible, e.g., the Session Initiation Protocol (SIP). According to the 3GPP, IMS is not intended to standardize applications, but rather to aid the access of multimedia and voice applications from wireless and wireline terminals, i.e., to create a form of fixed-mobile convergence (FMC). This is done by having a horizontal control layer that isolates the access network from the service layer. From a logical architecture perspective, services need not have their own control functions, as the control layer is a common horizontal layer. However, in implementation this does not necessarily map into greater reduced cost and complexity.
Alternative and overlapping technologies for access and provisioning of services across wired and wireless networks include combinations of Generic Access Network, softswitches and "naked" SIP.
Since it is becoming increasingly easier to access content and contacts using mechanisms outside the control of traditional wireless/fixed operators, the interest of IMS is being challenged.
Examples of global standards based on IMS are MMTel which is the basis for Voice over LTE (VoLTE), Wi-Fi Calling (VoWIFI), Video over LTE (ViLTE), SMS/MMS over WiFi and LTE, USSD over LTE, and Rich Communication Services (RCS), which is also known as joyn or Advanced Messaging, and now RCS is operator's implementation. RCS also further added Presence/EAB (enhanced address book) functionality.
History
IMS was defined by an industry forum called 3G.IP, formed in 1999. 3G.IP developed the initial IMS architecture, which was brought to the 3rd Generation Partnership Project (3GPP), as part of their standardization work for 3G mobile phone systems in UMTS networks. It first appeared in Release 5 (evolution from 2G to 3G networks), when SIP-based multimedia was added. Support for the older GSM and GPRS networks was also provided.
3GPP2 (a different organization from 3GPP) based their CDMA2000 Multimedia Domain (MMD) on 3GPP IMS, adding s |
https://en.wikipedia.org/wiki/Subsumption | Subsumption may refer to:
A minor premise in symbolic logic (see syllogism)
The Liskov substitution principle in object-oriented programming
Subtyping in programming language theory
Subsumption architecture in robotics
A subsumption relation in category theory, semantic networks and linguistics, also known as a "hyponym-hypernym relationship" (Is-a)
Formal and real capitalist subsumption describes different processes whereby capital comes to dominate an economic process. Coined in Karl Marx's Capital, Volume I |
https://en.wikipedia.org/wiki/Expectiminimax | The expectiminimax algorithm is a variation of the minimax algorithm, for use in artificial intelligence systems that play two-player zero-sum games, such as backgammon, in which the outcome depends on a combination of the player's skill and chance elements such as dice rolls. In addition to "min" and "max" nodes of the traditional minimax tree, this variant has "chance" ("move by nature") nodes, which take the expected value of a random event occurring. In game theory terms, an expectiminimax tree is the game tree of an extensive-form game of perfect, but incomplete information.
In the traditional minimax method, the levels of the tree alternate from max to min until the depth limit of the tree has been reached. In an expectiminimax tree, the "chance" nodes are interleaved with the max and min nodes. Instead of taking the max or min of the utility values of their children, chance nodes take a weighted average, with the weight being the probability that child is reached.
The interleaving depends on the game. Each "turn" of the game is evaluated as a "max" node (representing the AI player's turn), a "min" node (representing a potentially-optimal opponent's turn), or a "chance" node (representing a random effect or player).
For example, consider a game in which each round consists of a single die throw, and then decisions made by first the AI player, and then another intelligent opponent. The order of nodes in this game would alternate between "chance", "max" and then "min".
Pseudocode
The expectiminimax algorithm is a variant of the minimax algorithm and was firstly proposed by Donald Michie in 1966.
Its pseudocode is given below.
function expectiminimax(node, depth)
if node is a terminal node or depth = 0
return the heuristic value of node
if the adversary is to play at node
// Return value of minimum-valued child node
let α := +∞
foreach child of node
α := min(α, expectiminimax(child, depth-1))
else if we are to play at node
// Return value of maximum-valued child node
let α := -∞
foreach child of node
α := max(α, expectiminimax(child, depth-1))
else if random event at node
// Return weighted average of all child nodes' values
let α := 0
foreach child of node
α := α + (Probability[child] × expectiminimax(child, depth-1))
return α
Note that for random nodes, there must be a known probability of reaching each child. (For most games of chance, child nodes will be equally-weighted, which means the return value can simply be the average of all child values.)
Expectimax search
Expectimax search is a variant described in Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability (2005) by Tom Everitt and Marcus Hutter.
See also
Minimax
Alpha–beta pruning
Negamax
Expected value
References
Game theory
Search algorithms
Game artificial intelligence
Trees (d |
https://en.wikipedia.org/wiki/KVM%20switch | A KVM switch (with KVM being an abbreviation for "keyboard, video, and mouse") is a hardware device that allows a user to control multiple computers from one or more sets of keyboards, video monitors, and mice.
Name
Switches to connect multiple computers to one or more peripherals have had a variety of names.
The earliest name was Keyboard Video Switch (KVS). With the advent of the mouse, the Keyboard, Video and Mouse (KVM) switch became popular. The name was introduced by Remigius Shatas, the founder of Cybex, a peripheral switch manufacturer, in 1995. Some companies call their switches Keyboard, Video, Mouse and Peripheral (KVMP).
Types
With the popularity of USB—USB keyboards, mice, and I/O devices are still the most common devices connected to a KVM switch. The classes of KVM switches that are reviewed, are based on different types of core technologies in terms of how the KVM switch handles USB I/O devices—including keyboards, mice, touchscreen displays, etc. (USB-HID = USB Human Interface Device)
USB Hub Based KVMAlso called an Enumerated KVM switch or USB switch selector, a connected/shared USB device must go through the full initiation process (USB enumeration) every time the KVM is switched to another target system/port. The switching to different ports is just as if you were to physically plug and unplug a USB device into your targeted system.
Emulated USB KVM Dedicated USB console port(s) are assigned to emulate special sets of USB keyboard or mouse switching control information to each connected/targeted system. Emulated USB provides an instantaneous and reliable switching action that makes keyboard hotkeys and mouse switching possible. However, this class of KVM switch only uses generic emulations and consequently has only been able to support the most basic keyboard and mouse features. There are also USB KVM devices that allow cross-platform operating systems and basic keyboard and mouse sharing.
Semi-DDM USB KVM Dedicated USB console port(s) work with all USB-HID (including keyboard and mouse), but do not maintain the connected devices' presence to all of the targeted systems simultaneously. This class of KVM takes advantage of DDM (Dynamic Device Mapping) technology.
DDM USB KVM Dedicated Dynamic device mapping USB console port(s) work with all USB-HID (including keyboard and mouse) and maintain the connected devices' special functions and characteristics to each connected/targeted system. This class of KVM switch overcomes the frustrating limitations of an Emulated USB Class KVM by emulating the true characters of the connected devices to all the computers simultaneously. This means that you can now use the extra function keys, wheels, buttons, and controls that are commonly found on modern keyboards and mice.
Limited*supported, but does not allow USB re-enumeration, which not only causes long delays in switching, but also sometimes causes HPD (Hot-Plug Device) errors to the OS system(s).
Yes*Latency time within 1 se |
https://en.wikipedia.org/wiki/HPE%20Integrity%20Servers | HPE Integrity Servers is a series of server computers produced by Hewlett Packard Enterprise (formerly Hewlett-Packard) since 2003, based on the Itanium processor. The Integrity brand name was inherited by HP from Tandem Computers via Compaq.
In 2015 HP released the Superdome X line of Integrity Servers based on the x86 Architecture. It is a 'small' Box holding up to 8 dual Socket Blades and supporting up to 16 processors/240 cores (when populated with Intel Xeon E7-2890 or E7-2880 Processors).
General
Over the years, Integrity systems have supported Windows Server, HP-UX 11i, OpenVMS, NonStop, Red Hat Enterprise Linux and SUSE Linux Enterprise Server operating systems on Integrity servers. As of 2020 the operating systems that are supported are HP-UX 11i, OpenVMS and NonStop.
Early Integrity servers were based on two closely related chipsets. The zx1 chipset supported up to 4 CPUs and up to 8 PCI-X busses. They consisted of three distinct application-specific integrated circuits; a memory and I/O controller, a scalable memory adapter and an I/O adapter. The PA-8800 and PA-8900 microprocessors use the same bus as the Itanium 2 processors, allowing HP to also use this chipset for the HP 9000 servers and C8000 workstations.
The memory and I/O controller can be attached directly to up to 12 DDR SDRAM slots. If more slots than this are needed, two scalable memory adapters can be attached instead, allowing up to 48 memory slots. The chipset supports DIMM sizes up to 4 GB, theoretically allowing a machine to support up to 192 GB of RAM, although the largest supported configuration was 128 GB.
The sx1000 chipset supported up to 64 CPUs and up to 192 PCI-X buses. The successor chipsets were the zx2 and sx2000 respectively.
Entry-level servers
rx1600 series
The 1U rx1600 server is based on the zx1 chipset and has support for one or two 1 GHz Deerfield Itanium 2 CPUs.
The 1U rx1620 server is based on the zx1 chipset and has support for one or two 1.3/1.6 GHz Fanwood Itanium 2 CPUs.
Common for the series is:
Memory: Up to 8 DIMMs
Storage: Dual-channel Ultra-320 SCSI controller with support for two hot-swappable Ultra 320 drives
One external Ultra 320 SCSI port
Network:10/100/1000BaseTX LAN port
An additional 10/100BaseTX LAN port
General-purpose RS-232 serial port
Possibility for redundant power supplies
Two USB ports
Two PCI-X slots
Optional features are:
SCSI RAID controller
Management processor card (required for support of Windows Server 2003)
CD/DVD-ROM (required for installation of Windows Server 2003 and OpenVMS)
The series support five operating systems:
HP-UX 11i v2 or later
OpenVMS for Itanium
Windows Server 2003 for Itanium
Windows Server 2008 for Itanium
Linux with kernel that supports Itanium
rx2600 series
The 2U rx2600 server is based on the zx1 chipset and has support for one or two 1.0/1.4 GHz Deerfield/Madison, 1.3 GHz Madison or 1.5 GHz Madison CPUs.
The 2U rx2620 server is based on the zx1 chipset and has su |
https://en.wikipedia.org/wiki/InvisiClues | InvisiClues were hint booklets sold by Infocom to help players solve puzzles in their interactive fiction computer games.
Before Infocom's games exploded in popularity, players could request hints by mail and receive a type-written sheet in response. When the number of requests proved unmanageable, the Zork Users Group began a pay-per-hint telephone system. The invention of InvisiClues replaced this system and was revolutionary: a player could often buy a hint book at the same time and at the same location as the game itself.
Questions relating to the game were printed in the book, for example, the InvisiClues for Zork I contained the question "How can I kill the songbird?" A series of "empty" boxes located below or following the text contained the answers, printed in invisible ink. The contents of each box could be revealed by using a highlighter-like marker that came with the book. Over time, the ink degraded and the text reverted to invisibility.
To discourage players from accidentally learning what awaited by reading all the questions, each booklet contained a number of plausible-sounding "fake" questions. Revealing these answers usually resulted in a mild scolding. Several "non-puzzles" also had questions, such as the songbird example used above. The answer to these was usually a tersely-worded statement saying "You can't do that", often followed by one or more items reading "This space intentionally left blank" or, on occasion, showed false clues such as "How Do I get off the roof of the House?" the clue being "How did you get up there?". Even the answers to real questions began with vague hints, so a player could choose to stop short of getting explicit solutions to the puzzles.
The InvisiClues books were very popular. By late 1984 Infocom had sold more than 500,000 copies at $9.95 each for its games, including about 200,000 for the Zork I book. Richard E. Snyder of Simon & Schuster amazed InvisiClues author Mike Dornbrook by stating that such volumes made him "one of the bestselling authors on the planet ... In terms of dollars you're at Stephen King level!"
For a short time, The Status Line, the Infocom Game newsletter, included "Visiclues". These were just select InvisiClues questions from a couple of newer games, with answers written in a simple cryptogram.
InvisiClues books were almost always packaged with the navigation map for the same given game.
Though InvisiClues, like the games themselves, are no longer available, a few Internet sites have recreated the booklets. Typically, either all the answers are printed normally on the site or the user must "highlight" a section by clicking and dragging the mouse to reveal the hints.
The InvisiClues were included in a hint booklet packaged with The Lost Treasures of Infocom. However, the InvisiClues packaged with the Treasures were not produced to Infocom's high standards:
The clues were not written in invisible ink, which made it easy to accidentally get answers to puzzles.
|
https://en.wikipedia.org/wiki/Runway%20bus | The Runway bus is a front-side bus developed by Hewlett-Packard for use by its PA-RISC microprocessor family. The Runway bus is a 64-bit wide, split transaction, time multiplexed address and data bus running at 120 MHz. This scheme was chosen by HP as they determined that a bus using separate address and data wires would have only delivered 20% more bandwidth for a 50% increase in pin count, which would have made microprocessors using the bus more expensive. The Runway bus was introduced with the release of the PA-7200 and was subsequently used by the PA-8000, PA-8200, PA-8500, PA-8600 and PA-8700 microprocessors. Early implementations of the bus used in the PA-7200, PA-8000 and PA-8200 had a theoretical bandwidth of 960 MB/s. Beginning with the PA-8500, the Runway bus was revised to transmit on both rising and falling edges of a 125 MHz clock signal, which increased its theoretical bandwidth to 2 GB/s. The Runway bus was succeeded with the introduction of the PA-8800, which used the Itanium 2 bus.
Bus features
64-bit multiplexed address/data
20 bus protocol signals
Supports cache coherency
Three frequency options (1.0, 0.75 and 0.67 of CPU clock — 0.50 apparently was later added)
Parity protection on address/data and control signal
Each attached device contains its own arbitrator logic
Split transactions, up to six transactions can be pending at once
Snooping cache coherency protocol
1-4 processors "glueless" multi-processing (no support chips needed)
768 MB/s sustainable throughput, peak 960 MB/s at 120 MHz
Runway+/Runway DDR: On PA-8500, PA-8600 and PA-8700, the bus operates in DDR (double data rate) mode,
resulting in a peak bandwidth of about 2.0 GB/s (Runway+ or Runway DDR) with 125 MHz
Most machines use the Runway bus to connect the CPUs directly to the IOMMU (Astro, U2/Uturn or Java) and memory.
However, the N class and L3000 servers use an interface chip called Dew to bridge the Runway bus to the Merced bus that connects to the IOMMU and memory.
References
Gwennap, Linley (November 17, 1997). "PA-8500's 1.5M Cache Aids Performance". Microprocessor Report.
Hewlett-Packard products
Computer buses |
https://en.wikipedia.org/wiki/Double%20data%20rate | In computing, double data rate (DDR) describes a computer bus that transfers data on both the rising and falling edges of the clock signal. This is also known as double pumped, dual-pumped, and double transition. The term toggle mode is used in the context of NAND flash memory.
Overview
The simplest way to design a clocked electronic circuit is to make it perform one transfer per full cycle (rise and fall) of a clock signal. This, however, requires that the clock signal changes twice per transfer, while the data lines change at most once per transfer. When operating at a high bandwidth, signal integrity limitations constrain the clock frequency. By using both edges of the clock, the data signals operate with the same limiting frequency, thereby doubling the data transmission rate.
This technique has been used for microprocessor front-side busses, Ultra-3 SCSI, expansion buses (AGP, PCI-X), graphics memory (GDDR), main memory (both RDRAM and DDR1 through DDR5), and the HyperTransport bus on AMD's Athlon 64 processors. It is more recently being used for other systems with high data transfer speed requirements as an example, for the output of analog-to-digital converters (ADCs).
DDR should not be confused with dual channel, in which each memory channel accesses two RAM modules simultaneously. The two technologies are independent of each other and many motherboards use both, by using DDR memory in a dual channel configuration.
An alternative to double or quad pumping is to make the link self-clocking. This tactic was chosen by InfiniBand and PCI Express.
Relation of bandwidth and frequency
Describing the bandwidth of a double-pumped bus can be confusing. Each clock edge is referred to as a beat, with two beats (one upbeat and one downbeat) per cycle. Technically, the hertz is a unit of cycles per second, but many people refer to the number of transfers per second. Careful usage generally talks about "500 MHz, double data rate" or "1000 MT/s", but many refer casually to a "1000 MHz bus," even though no signal cycles faster than 500 MHz.
DDR SDRAM popularized the technique of referring to the bus bandwidth in megabytes per second, the product of the transfer rate and the bus width in bytes. DDR SDRAM operating with a 100 MHz clock is called DDR-200 (after its 200 MT/s data transfer rate), and a 64-bit (8-byte) wide DIMM operated at that data rate is called PC-1600, after its 1600 MB/s peak (theoretical) bandwidth. Likewise, 12.8 GB/s transfer rate DDR3-1600 is called PC3-12800.
Some examples of popular designations of DDR modules:
DDR SDRAM uses double-data-rate signalling only on the data lines. Address and control signals are still sent to the DRAM once per clock cycle (to be precise, on the rising edge of the clock), and timing parameters such as CAS latency are specified in clock cycles. Some less common DRAM interfaces, notably LPDDR2, GDDR5 and XDR DRAM, send commands and addresses using double data rate. DDR5 uses two 7-bit d |
https://en.wikipedia.org/wiki/DSSC | DSSC may mean:
Double-sideband suppressed carrier, radio technology
Data Storage Systems Center at Carnegie Mellon University
The Defense Services Staff College in Wellington, Tamil Nadu, India
D.S. Senanayake College Colombo 7, Sri Lanka
Dye-sensitized solar cell
Data Structure for the Security Suitability of Cryptographic Algorithms RFC 5698 |
https://en.wikipedia.org/wiki/Moo3 | Moo3 may refer to:
Master of Orion III, a computer game
Molybdenum(VI) oxide, a chemical compound |
https://en.wikipedia.org/wiki/LNS | LNS may refer to:
East Lansing (Amtrak station), Amtrak station code
L2TP Network Server in Layer 2 Tunneling Protocol VPNs
Lancaster Airport (Pennsylvania), US, IATA code
Lesch–Nyhan syndrome, an inherited genetic disorder
League of National Security, a 1930s Australian far-right group also known as the White Army
Liberation News Service, a former American underground press news agency
Local nonsatiation, a property in microeconomics
Logarithmic number system, an arithmetic system used for representing real numbers in digital hardware |
https://en.wikipedia.org/wiki/USENIX%20Annual%20Technical%20Conference | The USENIX Annual Technical Conference (USENIX ATC, or, canonically, USENIX) is a conference of computing professions sponsored by the USENIX association. The conference includes computing tutorials, and a single track technical session for presenting refereed research papers, SIG meetings, and BoFs.
There have been several notable announcements and talks at USENIX. In 1995, James Gosling announced "Oak", which was to become the Java Programming Language. John Ousterhout first presented TCL here, and Usenet was announced here.
It is considered one of the most prestigious operating systems venues and has an 'A' rating from the Australian Ranking of ICT Conferences (ERA).
List of conferences
USENIX ATC 2018 — Boston, Massachusetts, July 11–13, 2018.
USENIX ATC 2017 — Santa Clara, California, July 12–14, 2017.
USENIX ATC 2016 — Denver, Colorado, June 22–24, 2016.
USENIX ATC 2015 — Santa Clara, California, July 8–10, 2015.
USENIX ATC 2014 — Philadelphia, Pennsylvania, June 19–20, 2014.
USENIX ATC 2013 — San Jose, California, June 26–28, 2013.
USENIX ATC 2012 — Boston, Massachusetts, June 13–15, 2012.
USENIX ATC 2011 — Portland, Oregon, June 15–17, 2011.
USENIX ATC 2010 — Boston, Massachusetts, June 23–25, 2010.
USENIX ATC 2009 — San Diego, California, June 14–19, 2009.
USENIX ATC 2008 — Boston, Massachusetts, June 22–June 27, 2008.
USENIX ATC 2007 — Santa Clara, California, June 17–22, 2007.
USENIX ATC 2006 — Boston, Massachusetts, May 30–June 3, 2006.
USENIX ATC 2005 — Anaheim, California, April 10–15, 2005.
USENIX ATC 2004 — Boston, Massachusetts, June 27–July 2, 2004.
USENIX ATC 2003 — San Antonio, Texas, June 9–14, 2003.
USENIX ATC 2002 — Monterey, California, June 10–15, 2002.
USENIX ATC 2001 — Boston, Massachusetts, June 25–30, 2001.
USENIX ATC 2000 — San Diego, California, June 18–23, 2000.
USENIX ATC 1999 — Monterey, California, June 6–11, 1999.
USENIX ATC 1998 — New Orleans, Louisiana, June 15–19, 1998.
USENIX ATC 1997 — Anaheim, California, January 6–10, 1997.
USENIX ATC 1996 — San Diego, California, January 22–26, 1996.
USENIX TC 1995 — New Orleans, Louisiana, January 16–20, 1995.
Prior to 1995 there were two USENIX Technical Conferences held each year, with one held in the summer and the other during the winter.
References
External links
The USENIX Association
USENIX ATC Conferences
Computer conferences
Unix |
https://en.wikipedia.org/wiki/Tierra | Tierra may refer to:
Astronomy
Earth in the Spanish and Asturian language
Computing and games
Tierra (computer simulation), a computer simulation of life by the ecologist Thomas S. Ray
Tierra Entertainment, now known as AGD Interactive, a non-profit game company specializing in remakes of classic adventure games by Sierra Entertainment
Film
Tierra (film), a 1996 movie by the Spanish filmmaker Julio Medem
Music
Tierra (band), a Latin R&B band from the 1970s and 1980s
Albums
Tierra (Tierra album), a 1973 album by Tierra
Tierra (L'Arc-en-Ciel album), a 1994 album by the Japanese rock band L'Arc-en-Ciel
See also
Tiara, a type of crown or headpiece |
https://en.wikipedia.org/wiki/Soft%20error | In electronics and computing, a soft error is a type of error where a signal or datum is wrong. Errors may be caused by a defect, usually understood either to be a mistake in design or construction, or a broken component. A soft error is also a signal or datum which is wrong, but is not assumed to imply such a mistake or breakage. After observing a soft error, there is no implication that the system is any less reliable than before. One cause of soft errors is single event upsets from cosmic rays.
In a computer's memory system, a soft error changes an instruction in a program or a data value. Soft errors typically can be remedied by cold booting the computer. A soft error will not damage a system's hardware; the only damage is to the data that is being processed.
There are two types of soft errors, chip-level soft error and system-level soft error. Chip-level soft errors occur when particles hit the chip, e.g., when secondary particles from cosmic rays land on the silicon die. If a particle with certain properties hits a memory cell it can cause the cell to change state to a different value. The atomic reaction in this example is so tiny that it does not damage the physical structure of the chip. System-level soft errors occur when the data being processed is hit with a noise phenomenon, typically when the data is on a data bus. The computer tries to interpret the noise as a data bit, which can cause errors in addressing or processing program code. The bad data bit can even be saved in memory and cause problems at a later time.
If detected, a soft error may be corrected by rewriting correct data in place of erroneous data. Highly reliable systems use error correction to correct soft errors on the fly. However, in many systems, it may be impossible to determine the correct data, or even to discover that an error is present at all. In addition, before the correction can occur, the system may have crashed, in which case the recovery procedure must include a reboot. Soft errors involve changes to datathe electrons in a storage circuit, for examplebut not changes to the physical circuit itself, the atoms. If the data is rewritten, the circuit will work perfectly again. Soft errors can occur on transmission lines, in digital logic, analog circuits, magnetic storage, and elsewhere, but are most commonly known in semiconductor storage.
Critical charge
Whether or not a circuit experiences a soft error depends on the energy of the incoming particle, the geometry of the impact, the location of the strike, and the design of the logic circuit. Logic circuits with higher capacitance and higher logic voltages are less likely to suffer an error. This combination of capacitance and voltage is described by the critical charge parameter, Qcrit, the minimum electron charge disturbance needed to change the logic level. A higher Qcrit means fewer soft errors. Unfortunately, a higher Qcrit also means a slower logic gate and a higher power dissipation. Reducti |
https://en.wikipedia.org/wiki/Jon%20Freeman%20%28game%20designer%29 | Jon Freeman is a game designer and co-founder of software developer Automated Simulations, which was later renamed to Epyx and became a major company during the 8-bit era of home computing. He is married to game programmer Anne Westfall, and they work together as Free Fall Associates. Free Fall is best known for Archon: The Light and the Dark, one of the earliest titles from Electronic Arts.
Career
Automated Simulations and Epyx
Freeman worked as a game designer for video game developer and publisher, Epyx, which he co-founded with Jim Connelley in 1978 as Automated Simulations.
Their first game, Starfleet Orion, was a two-player only game developed mainly so Connelley could write off the cost of his Commodore PET computer. Freeman provided design while Connelley handled the programming in BASIC. Freeman was amazed when they actually had a finished product and they had to create a company to publish it. So, both he and Connelley fell into the computer game industry by accident.
It was while with this company, still known as Automated Simulations in 1980, that Freeman met his future wife, Anne Westfall, at a computer fair.
Starfleet Orion was quickly followed by Invasion Orion. What followed was a slew of very successful titles for various platforms. Freeman designed or co-designed a number of Epyx games, such as Crush, Crumble and Chomp! and Rescue at Rigel. Freeman tired of what he called "office politics" and yearned to get away from the now much larger company.
The Complete Book of Wargames
In 1980, Freeman, in collaboration with the editors of Consumer Guide, wrote The Complete Book of Wargames, which was published by Simon & Schuster under their "Fireside" imprint. In the book, Freeman, explained the history of wargames to that point, the notable companies, the usual components, and evaluated most of the major wargames in print at the time, as well as the role that computer games would play in this field.
Free Fall Associates
In 1981, Freeman and Anne Westfall left Epyx to create Free Fall Associates along with game designer Paul Reiche III.
Free Falls' first game was 1982's Tax Dodge, which remained obscure. Free Fall went on to develop two highly acclaimed games published by Electronic Arts: Archon and Archon II: Adept. Originally written for the Atari 8-bit family, they were ported to other contemporary home computers.
Free Fall developed a few more titles after Archon II, but nothing as well-known. Freeman is credited with some recent development work with Square Enix.
References
External links
List of games developed by Freeman
American video game designers
American businesspeople
Living people
Year of birth missing (living people)
Software developer communities |
https://en.wikipedia.org/wiki/SlashNET | SlashNET is a medium-sized, independently operated Internet Relay Chat (IRC) network. Originally sponsored by Slashdot and founded in 1998, in 1999 SlashNET split off to become its own entity. A few well-known communities and projects maintain an IRC presence at SlashNET, including #g7 (the IRC idle RPG), #totse (Totse), #idiots-club (ZZT Community), #mefi (a Metafilter-related community), various Penny Arcade-related communities, #Twitterponies (a Twitter roleplaying group), and #rags (an old-style rag calligraphy community). As of 2012 it is ranked in the top 40 networks by IRC.Netsplit.de, with an estimated relatively constant 1700 users, and #25/737 by SearchIRC.com.
Administration
According to SlashNET's website, a "hands-off" approach to administration is used. More specifically, SlashNET claims that IRC Operators are just regular users with a status flag next to their nicknames. SlashNET's administration officially decries the use of mission statements and other business-like "buzzwords" for IRC networks and rejects the notion that these are necessary for the operation of a network. The overall objective of the administration as described by the network's website is "keep the servers running."
SlashNET is run entirely by volunteers from around the globe. SlashNET's servers run UnrealIRCd v3.2.5 on FreeBSD and Linux. IRC services and Blitzed Open Proxy Monitor are also utilized to provide a quality IRC experience for users.
Forums
SlashNET has been host to numerous IRC forums with famous people in the tech industry, including Ken Coar, Marcel Gagne, Richard Stallman, Jamie Zawinski, Matt Dillon of DragonflyBSD, Rob 'CmdrTaco' Malda and Jeff 'Hemos' Bates of Slashdot, Rusty Foster and Dylan 'Inoshiro' Griffiths of kuro5hin, and the distributed.net crew. Logs of past forums on SlashNET may be found on the network's website.
Events
SlashNET, as the key communications method for Slashdot staff, was used in selecting and approving stories on the website. On 9/11, Rob Malda, as "Daddy Pants" of the day, with final say on story acceptance, elected to focus Slashdot only on the unfolding news of the attacks. Telephone exchanges and cell networks were overburdened; many reports and eyewitness accounts came in via IRC. Many of these were posted on Slashdot. The site had 3 million page views for the day.
References
External links
Official Website
Slashnet at Netsplit.de
Free Online Chat Portal WebyChat
Internet Relay Chat networks |
https://en.wikipedia.org/wiki/Business%20service%20provider | A business service provider is one of several categories of service provider in the business world. As opposed to an application service provider which provides application components over a computer network, the services provided by a business service provider are more in the area of infrastructure: mail delivery, building security, finance, administration, and human services.
Types of business service providers
Back Office
Back office operations are the off-site delivery of a range of non-core service functions, including routine administration tasks, customer service and technical support. Offshore back office operations involve the ongoing use of an outsourcing base in another country.
Front Office
The front office is the part of a company that comes in contact with clients, such as the marketing, sales, and service departments. In the hotel industry, the front office (also known as front desk) welcomes guests to the accommodation section: meeting and greeting them, taking and organizing reservations, allocating check in and out of rooms, organizing porter service, issuing keys and other security arrangements, passing on messages to customers and settling the accounts.
Examples
Front Office Solutions Provider
References
General
Further reading
Service economy |
https://en.wikipedia.org/wiki/Computer%20reservation%20system | Computer reservation systems, or central reservation systems (CRS), are computerized systems used to store and retrieve information and conduct transactions related to air travel, hotels, car rental, or other activities. Originally designed and operated by airlines, CRSs were later extended for use by travel agencies, and global distribution systems (GDSs) to book and sell tickets for multiple airlines. Most airlines have outsourced their CRSs to GDS companies, which also enable consumer access through Internet gateways. Modern GDSs typically also allow users to book hotel rooms, rental cars, airline tickets as well as other activities and tours. They also provide access to railway reservations and bus reservations in some markets, although these are not always integrated with the main system. These are also used to relay computerized information for users in the hotel industry, making reservation and ensuring that the hotel is not overbooked.
Airline reservations systems may be integrated into a larger passenger service system, which also includes an airline inventory system and a departure control system. The current centralised reservation systems are vulnerable to network-wide system disruptions.
History
Origins
In 1946, American Airlines installed the first automated booking system, the experimental electromechanical Reservisor. A newer machine with temporary storage based on a magnetic drum, the Magnetronic Reservisor, soon followed. This system proved successful, and was soon being used by several airlines, as well as Sheraton Hotels and Goodyear for inventory control. It was seriously hampered by the need for local human operators to do the actual lookups; ticketing agents would have to call a booking office, whose operators would direct a small team operating the Reservisor and then read the results over the telephone. There was no way for agents to directly query the system.
The MARS-1 train ticket reservation system was designed and planned in the 1950s by the Japanese National Railways' R&D Institute, now the Railway Technical Research Institute, with the system eventually being produced by Hitachi in 1958. It was the world's first seat reservation system for trains. The MARS-1 was capable of reserving seat positions, and was controlled by a transistor computer with a central processing unit and a 400,000-bit magnetic drum memory unit to hold seating files. It used many registers, to indicate whether seats in a train were vacant or reserved to accelerate searches of and updates to seat patterns, for communications with terminals, printing reservation notices, and CRT displays.
Remote access
In 1953, Trans-Canada Airlines (TCA) started investigating a computer-based system with remote terminals, testing one design on the University of Toronto's Manchester Mark 1 machine that summer. Though successful, the researchers found that input and output was a major problem. Ferranti Canada became involved in the project and suggested a ne |
https://en.wikipedia.org/wiki/Richard%20Brent | Richard Brent may refer to:
Richard Brent (politician) (1757–1814), U.S. Congressman and senator from Virginia
Richard P. Brent (born 1946), Australian mathematician and computer science professor
See also
R. Brent Tully (born 1943), Canadian-born American astronomer based in Hawaii |
https://en.wikipedia.org/wiki/Robot%20%28disambiguation%29 | A robot is a virtual or mechanical artificial agent, usually an electro-mechanical machine.
Robot or Robots may also refer to:
Computing
Internet robot, an automated computer program that runs tasks on the Internet
Robot Framework, a generic test automation framework for acceptance testing and acceptance test-driven development (ATDD)
Robots exclusion standard, a World Wide Web protocol
Return Of Bleichenbacher's Oracle Threat (ROBOT) attack, see Adaptive chosen-ciphertext attack
Film and television
Robots (1988 film) a television film
Robots (2005 film), an American animated film based on the children's book by William Joyce
Robots (2023 film), an American film starring Shailene Woodley
Enthiran, a 2010 Indian Tamil-language feature film, titled Robot in Hindi
Enthiran (soundtrack)
"Robot" (Doctor Who), a serial on Doctor Who
"Robot" (The Goodies), an episode of The Goodies
"The Robots" (Code Lyoko), an episode of Code Lyoko
Robot (Lost in Space), also known as The Robot or Robot B-9, a character from the sci-fi television show Lost in Space
Mr. Robot, a television series
Music
Robot (dance)
Robot (album), an album by Nikos Karvelas
Robot, an album by 3OH!3
Robot Face, or <|°_°|>, an album by Caravan Palace
Songs
"Robot" (CNBLUE song)
"Robots" (song), a song by Kate Ryan
"The Robots", a song by Kraftwerk
"Robot", a song by Miley Cyrus from Can't Be Tamed
"Robot", a song by the Futureheads from The Futureheads
"Robot", a song by Nada Surf from The Proximity Effect
"Robots", a song by Gabriella Cilmi from Ten
"Robots", a song by Flight of the Conchords from The Distant Future
"Robots", a song by TV on the Radio from OK Calculator
"Robot", a song by Getter Janni from Rockefeller Street
Publications
Robot Magazine
Robot series (Asimov), a series of novels and short stories by Isaac Asimov
Robot: Super Color Comic, a manga series
Video games
Robots (1984 video game), a computer game originally developed for Unix
Robots (2005 video game), a video game based on the animated film
Robot (video game series), a series of NES games that used the Robotic Operating Buddy accessory
Robot Entertainment, an American video game development company
"The Robot", a nickname given to professional Super Smash Bros. player Jason Zimmerman
Other uses
Robot (Czech robota), another name for corvée labour
Robot (camera)
Robot Communications, a Japanese independent animation and visual effects studio
Robot Patent, a historical labour rent in the Habsburg Empire
Operation ROBOT, a 1952 plan to float the pound
Traffic light (robot in South African English) a signaling device positioned at a road intersection
People with the surname
Alexandru Robot (1916–), Bessarabian writer
Isidore Robot (1837–1887), French Roman Catholic missionary
See also
Android (disambiguation)
Bot (disambiguation)
I, Robot (disambiguation)
List of Robots
Metalman (disambiguation)
Mr. Robot (disambiguation)
Robo (disambiguation)
Robot & Fr |
https://en.wikipedia.org/wiki/Melbourne%20tram%20route%2075 | Melbourne tram route 75 is operated by Yarra Trams on the Melbourne tram network from Vermont South to Central Pier. The 22.8 kilometre route is operated out of Camberwell depot with A and B class trams. It is the longest route on the network.
History
The origins of route 75 lie in separate tram lines, Australia's first cable tram from Bourke Street to Hawthorn Bridge and a horse tram from Hawthorn Bridge to Auburn Road, which was converted to an electric line and extended over many years to its current terminus at Vermont South.
The first cable tram line opened by the Melbourne Tramway & Omnibus Company was from Bourke Street to Hawthorn Bridge along Spencer Street, Flinders Street, Wellington Parade and Bridge Road opened on 11 November 1885. On 27 January 1889 a horse tram from Hawthorn Bridge to Auburn Road, travelling via Burwood Road, Power Street and Riversdale Road was opened.
The Hawthorn Tramways Trust (HTT) closed the horse tramway for conversion to electric traction on 31 January 1916, with the electric line opening in two stages; Power Street to Auburn Road along Riversdale Road opening on 7 May 1916, and from Hawthorn Bridge to Riversdale Road along Burwood Road and Power Street on 21 June 1916.
The Riversdale Road line was extended by the HTT on 31 May 1916 to Bowen Street in Camberwell, along Riversdale Road and Camberwell Road and passing through Camberwell Junction. It was extended a week later on 10 June 1916 to Boundary Road (now Warrigal Road) in Burwood, along Camberwell Road and Norwood Road (now Toorak Road).
The Melbourne & Metropolitan Tramways Board (MMTB) converted the Bourke Street to Hawthorn Bridge cable line to electric traction in three stages, closing the line on 29 June 1927. Reopening with electric trams running from Lonsdale Street, a short electric extension to the previous cable terminus of Bourke Street, to Swanston Street on 14 July 1927, from Swanston Street to Simpson Street on 17 September 1927, and Simpson Street to Hawthorn Bridge on 4 December 1927.
Throughout 1934, Hawthorn and Camberwell depot services were allocated route numbers. Route 74 was allocated the service between the Batman Avenue tram terminus in the City (route 70's long-time terminus until 1999) and the Burwood terminus via Swan Street on 9 December, while route 27 was allocated the service between Spencer Street and Hawthorn tram depot via Bridge Road on 6 June. Route 75 was a short-working service of route 74 between the Batman Avenue terminus and Smith Road at Hartwell.
Route 27's terminus in the City was extended slightly north to terminate at La Trobe Street, when the MMTB opened the La Trobe Street line on 15 January 1951. Initially, services on weekday daytime and Saturday mornings were also extended to Brunswick Street but the through-routing ceased just a month later on 26 February, due to congestion on Flinders Street hampering on-time running of the Hawthorn service.
In February 1965, Hawthorn tram depot closed, an |
https://en.wikipedia.org/wiki/Home%20%28Star%20Trek%3A%20Enterprise%29 | "Home" is the third episode of the fourth season of the American science fiction television series Star Trek: Enterprise. It first aired on October 22, 2004, on the UPN network in the United States. It was the second episode of the season directed by Allan Kroeker and the first in season four to be written by Michael Sussman.
Set in the 22nd century, the series follows the adventures of the first Starfleet starship, Enterprise, registration NX-01. This episode brought to a close the Xindi story arc that ran throughout Season 3, with the crew returning to Earth after the successful mission. It features three stories; Captain Jonathan Archer (Scott Bakula) coming to terms with the psychological impact of the previous mission, Doctor Phlox (John Billingsley) finds that the people on Earth have become hostile to aliens, while Commander Charles "Trip" Tucker (Connor Trinneer) and Sub-Commander T'Pol (Jolene Blalock) travel to Vulcan for her arranged marriage.
The episode featured the return of several recurring characters, such as Vaughn Armstrong as Admiral Maxwell Forrest and Gary Graham as Ambassador Soval. Others who made their first of several appearances included Michael Reilly Burke, Ada Maris, Jack Donner and Joanna Cassidy as T'Pol's mother. Filming took seven days, during which time the standing sets used for the interior of Enterprise were redressed to appear as its sister ship, Columbia (NX-02), and location filming was conducted at Malibu Creek State Park. "Home" received a mixed reception from critics, and was watched by 3.16 million viewers on first broadcast.
Plot
Captain Archer and the crew are welcomed back to Earth following the successful Xindi mission. As Enterprise undergoes repairs and refitting, Archer is reunited with a former girlfriend, Captain Erika Hernandez, who has been appointed to Starfleet's second Warp 5 starship, Columbia (NX-02). Archer is debriefed by Admiral Maxwell Forrest and Ambassador Soval. After reacting in anger when Soval asks pointed questions about the Seleya incident, he is ordered by Forrest to take some relaxation leave.
He chooses to go mountain climbing; to his initial annoyance, Hernandez invites herself along. That night, Archer dreams that he is attacked by Reptilians, and Hernandez tries to help him come to terms with his memories and new-found adulation. In return, Archer tries to caution her that space exploration is not as idealistic as she thinks it is. In spite of this, the two manage to rekindle their romance. Returning to Starfleet Command, Archer is able to keep his emotions in check, and ultimately receives an unexpected thanks from Soval who admits that he was wrong about humanity. Elsewhere, Doctor Phlox learns that some humans still hold a grudge over the Xindi attack, xenophobically blaming all aliens, and Phlox's presence in a bar results in a brawl.
Meanwhile, Sub-Commander T'Pol – who has been invited to accept a Starfleet commission – takes the opportunity to travel to Vu |
https://en.wikipedia.org/wiki/Volatile%20memory | Volatile memory, in contrast to non-volatile memory, is computer memory that requires power to maintain the stored information; it retains its contents while powered on but when the power is interrupted, the stored data is quickly lost.
Volatile memory has several uses including as primary storage. In addition to usually being faster than forms of mass storage such as a hard disk drive, volatility can protect sensitive information, as it becomes unavailable on power-down. Most general-purpose random-access memory (RAM) is volatile.
Types
There are two kinds of volatile RAM: dynamic and static. Even though both types need continuous electrical current to retain data, there are some important differences between them.
Dynamic RAM (DRAM) is very popular due to its cost-effectiveness. DRAM stores each bit of information in a different capacitor within the integrated circuit. DRAM chips need just one single capacitor and one transistor to store each bit of information. This makes it space-efficient and inexpensive.
The main advantage of static RAM (SRAM) is that it is much faster than dynamic RAM. Its disadvantage is its high price. SRAM does not need continuous electrical refreshes, but it still requires constant current to sustain the difference in voltage. Every single bit in a static RAM chip needs a cell of six transistors, whereas dynamic RAM requires only one capacitor and one transistor. As a result, SRAM is unable to accomplish the storage capabilities of the DRAM family. SRAM is commonly used as CPU cache and for processor registers and in networking devices.
References
Computer memory |
https://en.wikipedia.org/wiki/K42 | K42 is a discontinued open-source research operating system (OS) for cache-coherent 64-bit multiprocessor systems. It was developed primarily at IBM Thomas J. Watson Research Center in collaboration with the University of Toronto and University of New Mexico. The main focus of this OS is to address performance and scalability issues of system software on large-scale, shared memory, non-uniform memory access (NUMA) multiprocessing computers.
K42 uses a microkernel architecture rather than the traditional monolithic kernel design. K42 consists of a small exception-handling component that serves as the microkernel, a fast inter-process communication (IPC) mechanism named protected procedure call (PPC), and servers for most other components of the operating system. These servers exist in separate address spaces and rely upon the fast IPC mechanism for communication with the microkernel and other servers.
History
The core of K42 is based on the University of Toronto's operating system Tornado. K42 is the university's third generation of research on scalable operating systems. Tornado OS on a nuMachine Multiprocessor was the second generation and Hurricane OS on a Hector Multiprocessor was the first generation.
Features
K42 supports the Linux PowerPC 64 and 32 application binary interfaces (ABIs), so most PowerPC Linux binary files can run on K42 without modification, including the relational database DB2. K42 has some device drivers implemented specifically for it, but it gets most of its hardware support by directly linking in Linux device drivers to a special server.
Another goal of the K42 design is to achieve a customizable and maintainable system. Being built with an object-oriented programming design, it allows applications to customize and thus optimize the OS services required, and then on the fly, hot swap kernel object implementations. This is particularly important for applications, such as databases and web servers, where the ability to control physical resources can improve performance.
Open source
The K42 source is via git:
https://github.com/jimix/k42
References
External links
(from the Internet Archive)
Free software operating systems
Microkernels
IBM operating systems |
https://en.wikipedia.org/wiki/Martin%20Wiberg | Martin Wiberg (4 September 1826 – 29 December 1905) was a Swedish inventor. He enrolled at Lund University in 1845 and became a Doctor of Philosophy in 1850.
He is known as a computer pioneer for his c. 1859 (1857-1860) invention of a machine the size of a sewing machine that could print logarithmic tables (first interest tables appeared in 1860, logarithmic in 1875). The logarithmic tables were subsequently published in English, French and German in 1876. The device was investigated by the French academy of science which also wrote an extensive report on it in 1863. The device was inspired by the similar work done by Per Georg Scheutz (had the same capacity: 15-digit numbers and fourth-order differences) and has similarities with Charles Babbage's difference engine. (Scheutz machine was based on the difference engine). The device is preserved at Tekniska museet (The Technical Museum) of Sweden in Stockholm. Wiberg failed to sell his machine, and also failed to sell the output tables due to their bad looks.
Apart from this invention, Wiberg invented numerous other devices and gadgets, among these a cream separator and a pulse jet engine. None of these were commercially successful.
See also
Difference engine
Per Georg Scheutz
References
Further reading
1826 births
1905 deaths
19th-century Swedish inventors
People connected to Lund University |
https://en.wikipedia.org/wiki/Per%20Georg%20Scheutz | Pehr (Per) Georg Scheutz (23 September 1785 – 22 May 1873) was a Swedish lawyer, translator, and inventor, who is now best known for his pioneering work in computer technology.
Life
Scheutz studied law at Lund University, graduating in 1805. He then worked as a legal expert and translator (he translated several works of William Shakespeare and Sir Walter Scott) before turning predominantly to liberal politics and mechanical engineering.
He is most known for his inventions; the best known of these is the Scheutzian calculation engine, invented in 1837 and finalized in 1843. This machine, which he constructed with his son Edvard Scheutz, was based on Charles Babbage's difference engine. In 1851 they obtained funds from government to build an improved model, which was created in 1853 (was roughly the size of a piano), and subsequently demonstrated at the World's Fair in Paris, 1855. The machine was then sold in 1856 to the Dudley Observatory in Albany, New York. In 1857 British government ordered another model, which was built by Donkin's company in 1859.
The devices were used for creating logarithmic tables.
While the machine was not perfect and could not produce complete tables, Martin Wiberg reworked the construction from the ground up and in 1875 created a compact device which would print complete tables.
Scheutz was elected a member of the Royal Swedish Academy of Sciences in 1856.
See also
Difference engine
Martin Wiberg
Timeline of computing hardware before 1950
References
Further reading
Mario G. Losano (ed.), Scheutz: La macchina alle differenze. Un secolo di calcolo automatico, Etas Libri, Milano 1974, pp. 164.
1785 births
1873 deaths
19th-century Swedish inventors
19th-century Swedish businesspeople
19th-century Swedish lawyers
People connected to Lund University
Members of the Royal Swedish Academy of Sciences |
https://en.wikipedia.org/wiki/W%5EX | W^X ("write xor execute", pronounced W xor X) is a security feature in operating systems and virtual machines. It is a memory protection policy whereby every page in a process's or kernel's address space may be either writable or executable, but not both. Without such protection, a program can write (as data "W") CPU instructions in an area of memory intended for data and then run (as executable "X"; or read-execute "RX") those instructions. This can be dangerous if the writer of the memory is malicious. W^X is the Unix-like terminology for a strict use of the general concept of executable space protection, controlled via the system call.
W^X is relatively simple on processors that support fine-grained page permissions, such as Sun's SPARC and SPARC64, AMD's AMD64, Hewlett-Packard's PA-RISC, HP's (originally Digital Equipment Corporation's) Alpha, and ARM.
The term W^X has also been applied to file system write/execute permissions to mitigate file write vulnerabilities (as with in memory) and attacker persistence. Enforcing restrictions on file permissions can also close gaps in W^X enforcement caused by memory mapped files. Outright forbidding the usage of arbitrary native code can also mitigate kernel and CPU vulnerabilities not exposed via the existing code on the computer. A less intrusive approach is to lock a file for the duration of any mapping into executable memory, which suffices to prevent post-inspection bypasses.
Compatibility
Some early Intel 64 processors lacked the NX bit required for W^X, but this appeared in later chips. On more limited processors such as the Intel i386, W^X requires using the CS code segment limit as a "line in the sand", a point in the address space above which execution is not permitted and data is located, and below which it is allowed and executable pages are placed. This scheme was used in Exec Shield.
Linker changes are generally required to separate data from code (such as trampolines that are needed for linker and library runtime functions). The switch allowing mixing is usually called execstack on Unix-like systems
W^X can also pose a minor problem for just-in-time compilation, which involves an interpreter generating machine code on the fly and then running it. The simple solution used by most, including Firefox, involves just making the page executable after the interpreter is done writing machine code, using on Windows or on Unix-like operating systems. The other solution involves mapping the same region of memory to two pages, one with RW and the other with RX. There is no simple consensus on which solution is safer: supporters of the latter approach believe allowing a page that has ever been writable to be executed defeats the point of W^X (there exists an SELinux policy to control such operations called ) and that address space layout randomization would make it safe to put both pages in the same process. Supporters of the former approach believe that the latter approach is only safe wh |
https://en.wikipedia.org/wiki/Page%20fault | In computing, a page fault (sometimes called PF or hard fault) is an exception that the memory management unit (MMU) raises when a process accesses a memory page without proper preparations. Accessing the page requires a mapping to be added to the process's virtual address space. Besides, the actual page contents may need to be loaded from a backing store, such as a disk. The MMU detects the page fault, but the operating system's kernel handles the exception by making the required page accessible in the physical memory or denying an illegal memory access.
Valid page faults are common and necessary to increase the amount of memory available to programs in any operating system that uses virtual memory, such as Windows, macOS, and the Linux kernel.
Types
Minor
If the page is loaded in memory at the time the fault is generated, but is not marked in the memory management unit as being loaded in memory, then it is called a minor or soft page fault. The page fault handler in the operating system merely needs to make the entry for that page in the memory management unit point to the page in memory and indicate that the page is loaded in memory; it does not need to read the page into memory. This could happen if the memory is shared by different programs and the page is already brought into memory for other programs.
The page could also have been removed from the working set of a process, but not yet written to disk or erased, such as in operating systems that use Secondary Page Caching. For example, HP OpenVMS may remove a page that does not need to be written to disk (if it has remained unchanged since it was last read from disk, for example) and place it on a Free Page List if the working set is deemed too large. However, the page contents are not overwritten until the page is assigned elsewhere, meaning it is still available if it is referenced by the original process before being allocated. Since these faults do not involve disk latency, they are faster and less expensive than major page faults.
Major
This is the mechanism used by an operating system to increase the amount of program memory available on demand. The operating system delays loading parts of the program from disk until the program attempts to use it and the page fault is generated. If the page is not loaded in memory at the time of the fault, then it is called a major or hard page fault. The page fault handler in the OS needs to find a free location: either a free page in memory, or a non-free page in memory. This latter might be used by another process, in which case the OS needs to write out the data in that page (if it has not been written out since it was last modified) and mark that page as not being loaded in memory in its process page table. Once the space has been made available, the OS can read the data for the new page into memory, add an entry to its location in the memory management unit, and indicate that the page is loaded. Thus major faults are more expensive t |
https://en.wikipedia.org/wiki/Extase | Extase is a computer game developed by Cryo and published by Virgin Mastertronic.
Summary
It features some puzzles involving a sleeping female android that the player needed to wake up by cleaning its circuit. Each level represented a different level of emotion until the final extase (ecstasy). The gameplay mechanic is based on the "Brain Bowler" minigame in Purple Saturn Day, an 'alien sports' compilation created by the Cryo team under the name ERE and published by Epyx.
The music was designed by Stéphane Picq, and was co-credited to Philippe Eidel, and The Bulgarian Voices. It punctuated each action of the player or each event, becoming gradually richer until the level was finally completed.
Critical reception
Ace Magazine wrote that the game was highly original, though noted it is one players would either love or hate. Amiga Format described the game as a "musical masterpiece" and "graphic extravaganza".
Further reading
Jeux & Stratégie nouvelle formule #8
Legacy
The sleeping female android later became the mascot for Cryo Interactive, and appeared in their many logos.
References
External links
1990 video games
Amiga games
Atari ST games
Cryo Interactive games
Cyberpunk video games
DOS games
Europe-exclusive video games
Video games developed in France
Video games scored by Stéphane Picq
Single-player video games |
https://en.wikipedia.org/wiki/ICPC | ICPC is an initialism which may refer to:
International Collegiate Programming Contest
Independent Corrupt Practices Commission, Nigeria
International Cable Protection Committee, United Kingdom
International Centre for the Prevention of Crime, Montreal, Canada
International Classification of Primary Care, a medical classification method
International Criminal Police Commission, former name of Interpol
Interstate Compact on the Placement of Children, a contract among all 50 U.S. states, the District of Columbia and the Virgin Islands
International Cyber Policy Centre, Australia |
https://en.wikipedia.org/wiki/Who%20%28Unix%29 | The standard Unix command who displays a list of users who are currently logged into the computer.
The who command is related to the command , which provides the same information but also displays additional data and statistics.
History
A command that displays the names of users logged in was first implemented within Multics. Later, it appeared in Version 1 Unix and became part of the X/Open Portability Guide since issue 2 of 1987. It was inherited into the first version of POSIX.1 and the Single Unix Specification.
The version of who bundled in GNU coreutils was written by Joseph Arceneaux, David MacKenzie, and Michael Stone.
Specification
The Single UNIX Specification (SUS) specifies that who should list information about accessible users. The XSI extension also specifies that the data of the username, terminal, login time, process ID, and time since last activity occurred on the terminal, furthermore, an alternate system database used for user information can be specified as an optional argument to .
The command can be invoked with the arguments am i or am I (so it is invoked as who am i or who am I), showing information about the current terminal only (see the command and the -m option below, of which this invocation is equivalent).
Usage
The SUS without extensions only specifies the following -m, -T, and -u options, all other options are specified in the XSI extension.
-a, process the system database used for user information with the -b, -d, -l, -p, -r, -t, -T and -u.
-b, show time when system was last rebooted
-d, show zombie processes and details
-H, show column headers
-l, show terminals where a user can log in
-m, show information about the current terminal only
-p, show active processes
-q, quick format, show only names and the number of all users logged on, disables all other options; equivalent to users command line utility
-r, show runlevel of the init process.
-s, (default) show only name, terminal, and time details
-t, show when system clock was last changed
-T, show details of each terminal in a standard format (see note in Examples section)
-u, show idle time; XSI shows users logged in and displays information whether the terminal has been used recently or not
Other Unix and Unix-like operating systems may add extra options. GNU includes a -i option behaving similarly to -u and a -w option displaying whether the user listed accepts messages (the SUS displays this when -T is specified), yet GNU who and BSD who both omit a number of the above options (such as -a, -b, -d, and others); GNU who instead uses -l to perform DNS lookups on hostnames listed.
Output
The SUS without extensions specifies that the output format is to be "implementation-defined". The XSI extension specifies a format, but notes that it is not fully specified; delimiters and field lengths are not precisely specified. Thus, the format of the output differs considerably among Unix implementations.
See also
List of Unix commands
References
Ext |
https://en.wikipedia.org/wiki/Raking | Raking (also called "raking ratio estimation" or "iterative proportional fitting") is the statistical process of adjusting data sample weights of a contingency table to match desired marginal totals.
References
Estimation methods |
https://en.wikipedia.org/wiki/DCF | DCF may refer to:
Medical
Data clarification form in clinical trials
Dénomination Commune Française, a formal French generic name for a drug
Organizations
Child protective services, called Department of Children and Families in some U.S. states
Connecticut Department of Children and Families
Florida Department of Children and Families
Vermont Department for Children and Families
Wisconsin Department of Children and Families
DCF Advertising, an American advertising agency
Delaware Community Foundation, a charitable organization
Dominion Car and Foundry, a former Canadian railcar maker
Donors Capital Fund, a Virginia-based donor advised charity
Science
Dichlorofluorescein, a fluorescent dye
L-dopachrome isomerase, also called dopachrome conversion factor
Technology
DCF77, time signal radio station in Germany.
Design rule for Camera File system, file system specification for digital cameras
Device Configuration File, an element of the CANopen communication protocol
Distributed coordination function, WLAN technique
Double-clad fiber
Document Composition Facility, IBM software
Other uses
Canefield Airport, Roseau, Dominica (IATA airport code)
Dallas Christmas Festival
Discounted cash flow, in financial analysis
Direct Consular Filing, process related to immigration, US
Dorothy Canfield Fisher Children's Book Award, Vermont, US
Dyneema Composite Fabric, a high-performance non-woven composite material used in high-strength, low-weight applications.
Supervised injection site, also called drug consumption facility
The theory of differentially closed fields |
https://en.wikipedia.org/wiki/.si | .si is the Internet country code top-level domain (ccTLD) for Slovenia. It is administered by the ARNES, the Academic and Research Network of Slovenia. In 2010, the registry hosted 80,000 domain names. In 2012, that number increased to 100,000.
Domain hacks
Domain hacks for the .si TLD are quite popular, since si is second person singular of the verb 'to be' in Slovene. As such, many domains have been created that are using such domain hacks, one of the most popular being zadovoljna.si ('You are pleased', feminine form).
Sí also translates from Spanish as yes, so the TLD has been used by some Spanish-language websites. A notable example of this is the Mexican political party MORENA, whose website is found at morena.si.
Italian party Sinistra Italiana (abbreviation: SI) also uses Slovenian domain for its website (sinistraitaliana.si).
Pepsi uses the URL shortening pep.si.
Risk
According to research by McAfee performed in 2010, the Slovenian TLD is the tenth most secure.
References
External links
IANA .si whois information
ARNES
Official .si registry website (English)
Official .si registry website (Slovene)
Unofficial directory of .si domains
Unofficial .si registry website (Slovene) – statistical data and expired .si domains
Country code top-level domains
Council of European National Top Level Domain Registries members
Internet in Slovenia
Computer-related introductions in 1992
sv:Toppdomän#S |
https://en.wikipedia.org/wiki/.mk | .mk is the Internet country code top-level domain (ccTLD) for North Macedonia; it is administered by the Macedonian Academic Research Network (MARnet).
Registering .mk domains
Anyone can register a .mk domain. Registration is possible directly at the second level without any restrictions. Registrations under a number of second level domains are also possible, however those use of those domains are restricted to certain entities.
Structure
Cyrillic domain
The Internationalized Cyrillic country code top-level domain .мкд was officially approved and registered on March 20, 2014.
See also
Telecommunications in North Macedonia
References
External links
Macedonian Academic Research Network
IANA .mk whois information
Country code top-level domains
Communications in North Macedonia
Council of European National Top Level Domain Registries members |
https://en.wikipedia.org/wiki/Splatterhouse%3A%20Wanpaku%20Graffiti | is an action platform video game developed by Now Production and published by Namco for the Family Computer in 1989. Wanpaku Graffiti was originally released only in Japan, although it saw a localized Western release in 2020 as part of the Namco Museum Archives Vol. 1 compilation. It is the second game to be released in the Splatterhouse video game series. It is also the first Splatterhouse game to be released for a home console.
The game is a parody of the arcade game Splatterhouse. It takes a comical approach to its presentation, having "super deformed” characters, parodying horror movies and by incorporating other pop-culture references related with the genre into itself.
Gameplay
Unlike the other Splatterhouse games, Wanpaku Graffiti focuses more on platforming elements than beat 'em up gameplay. Instead of using punches and kicks, Rick wields an axe and can pick up a shotgun with limited ammo during certain levels. This game also features an experience point system. By defeating a certain number of enemies, Rick's health bar grows. The number of enemies needed is seen at the top of the screen. New to the series is the password system, which allows players to enter stages through four digit numbers.
If both of the crystal orbs are collected during the game, a shot at the end with Rick and Jennifer approaching the West Mansion like in the original Splatterhouse will be revealed. The ending would suggest that Rick was possibly dreaming all the events of this game when he is seen on the hill with Jennifer. The dream may have been a warning about what was going to happen in the West Mansion in the next game.
Plot
Wanpaku Graffiti opens as Jennifer weeps over Rick's grave. Lightning strikes, hitting the grave and reviving Rick, who has been wearing a mask. Lightning strikes again, hitting the grave next to Rick's and revives the Pumpkin King, the game's main antagonist. The Pumpkin King kidnaps Jennifer and Rick must go save her.
After fighting through several levels of super deformed monster parodies, Rick finds himself in the office of the Pumpkin King. Upon defeating him, it is revealed to the player that the whole game was merely a movie. A director congratulates Rick on his fine acting, Rick removes his mask, and they leave. Once everyone has left, the mask comes to life, revealing it is not what it seems. If the two crystal balls are collected, there is an extended epilogue. One crystal ball contains a picture of Rick lying on top a hill with Jennifer, stating that they live happily ever after. The second crystal ball has a glimpse of Rick looking uncertain as Jennifer excitedly approaches what appears to be West Mansion during a storm, ominously stating that they will face a crisis. This may imply that Wanpaku Graffiti was intended to be a prequel to the original game.
Reception
JC Fletcher of Joystiq.com reviewed the game in the "Virtually Overlooked" column, devoted to games that should appear on the Wii's Virtual Console. Fletcher |
https://en.wikipedia.org/wiki/Data%20security | Data security means protecting digital data, such as those in a database, from destructive forces and from the unwanted actions of unauthorized users, such as a cyberattack or a data breach.
Technologies
Disk encryption
Disk encryption refers to encryption technology that encrypts data on a hard disk drive. Disk encryption typically takes form in either software (see disk encryption software) or hardware (see disk encryption hardware). Disk encryption is often referred to as on-the-fly encryption (OTFE) or transparent encryption.
Software versus hardware-based mechanisms for protecting data
Software-based security solutions encrypt the data to protect it from theft. However, a malicious program or a hacker could corrupt the data to make it unrecoverable, making the system unusable. Hardware-based security solutions prevent read and write access to data, which provides very strong protection against tampering and unauthorized access.
Hardware-based security or assisted computer security offers an alternative to software-only computer security. Security tokens such as those using PKCS#11 or a mobile phone may be more secure due to the physical access required in order to be compromised. Access is enabled only when the token is connected and the correct PIN is entered (see two-factor authentication). However, dongles can be used by anyone who can gain physical access to it. Newer technologies in hardware-based security solve this problem by offering full proof of security for data.
Working off hardware-based security: A hardware device allows a user to log in, log out and set different levels through manual actions. The device uses biometric technology to prevent malicious users from logging in, logging out, and changing privilege levels. The current state of a user of the device is read by controllers in peripheral devices such as hard disks. Illegal access by a malicious user or a malicious program is interrupted based on the current state of a user by hard disk and DVD controllers making illegal access to data impossible. Hardware-based access control is more secure than the protection provided by the operating systems as operating systems are vulnerable to malicious attacks by viruses and hackers. The data on hard disks can be corrupted after malicious access is obtained. With hardware-based protection, the software cannot manipulate the user privilege levels. A hacker or a malicious program cannot gain access to secure data protected by hardware or perform unauthorized privileged operations. This assumption is broken only if the hardware itself is malicious or contains a backdoor. The hardware protects the operating system image and file system privileges from being tampered with. Therefore, a completely secure system can be created using a combination of hardware-based security and secure system administration policies.
Backups
Backups are used to ensure data that is lost can be recovered from another source. It is considered ess |
https://en.wikipedia.org/wiki/OOPSLA | OOPSLA (Object-Oriented Programming, Systems, Languages & Applications) is an annual ACM research conference. OOPSLA mainly takes place in the United States, while the sister conference of OOPSLA, ECOOP, is typically held in Europe. It is operated by the Special Interest Group for Programming Languages (SIGPLAN) group of the Association for Computing Machinery (ACM).
OOPSLA has been instrumental in helping object-oriented programming develop into a mainstream programming paradigm. It has also helped incubate a number of related topics, including design patterns, refactoring, aspect-oriented programming, model-driven engineering, agile software development, and domain specific languages.
The first OOPSLA conference was held in Portland, Oregon in 1986. As of 2010, OOPSLA became a part of the SPLASH conference. SPLASH stands for Systems, Programming, Languages, and Applications: Software for Humanity.
Locations and organizers
References
External links
OOPSLA history
Official website—SPLASH
Computer science conferences
Object-oriented programming
Association for Computing Machinery conferences
Programming languages conferences |
https://en.wikipedia.org/wiki/Tryggve%20Fossum | Tryggve Fossum is a Norwegian computer architect at Intel. He transferred there from DEC, where he was a lead architect of Alpha processors, after working on several VAX processors.
References
Year of birth missing (living people)
Living people
Computer hardware engineers
Digital Equipment Corporation people
Intel people
Norwegian engineers
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/Windows%20Installer | Windows Installer (msiexec.exe, previously known as Microsoft Installer, codename Darwin) is a software component and application programming interface (API) of Microsoft Windows used for the installation, maintenance, and removal of software. The installation information, and optionally the files themselves, are packaged in installation packages, loosely relational databases structured as COM Structured Storages and commonly known as "MSI files", from their default filename extensions. The packages with the file extensions mst contain Windows Installer "Transformation Scripts", those with the msm extensions contain "Merge Modules" and the file extension pcp is used for "Patch Creation Properties". Windows Installer contains significant changes from its predecessor, Setup API. New features include a GUI framework and automatic generation of the uninstallation sequence. Windows Installer is positioned as an alternative to stand-alone executable installer frameworks such as older versions of InstallShield and NSIS.
Before the introduction of Microsoft Store (then named Windows Store), Microsoft encouraged third parties to use Windows Installer as the basis for installation frameworks, so that they synchronize correctly with other installers and keep the internal database of installed products consistent. Important features such as rollback and versioning depend on a consistent internal database for reliable operation. Furthermore, Windows Installer facilitates the principle of least privilege by performing software installations by proxy for unprivileged users.
Logical structure of packages
A package describes the installation of one or more full products and is universally identified by a GUID. A product is made up of components, grouped into features. Windows Installer does not handle dependencies between products.
Products
A single, installed, working program (or set of programs) is a product. A product is identified by a unique GUID (the ProductCode property) providing an authoritative identity throughout the world. The GUID, in combination with the version number (ProductVersion property), allows for release management of the product's files and registry keys.
A package includes the package logic and other metadata that relates to how the package executes when running. For example, changing an EXE file in the product may require the ProductCode or ProductVersion to be changed for the release management. However, merely changing or adding a launch condition (with the product remaining exactly the same as the previous version) would still require the PackageCode to change for release management of the MSI file itself.
Features
A feature is a hierarchical group of components. A feature may contain any number of components and other sub-features. Smaller packages can consist of a single feature. More complex installers may display a "custom setup" dialog box, from which the user can select which features to install or remove.
The package |
https://en.wikipedia.org/wiki/Hi%20Hi%20Puffy%20AmiYumi | Hi Hi Puffy AmiYumi is an American animated television series created by Sam Register and produced by Renegade Animation and Cartoon Network Studios, which aired on Cartoon Network from 2004 to 2006. The series stars fictionalized and animated versions of the Japanese pop rock group Puffy AmiYumi. The series premiered on November 19, 2004, and ended on June 27, 2006, with a total of three seasons and 39 episodes, leaving a total of 34 episodes aired and five episodes unaired in North America.
During its run, the series was nominated for an Annie Award three times. Merchandise based on the series has also been produced, such as video games, home media releases, toys, and clothing.
Premise
Hi Hi Puffy AmiYumi follows the adventures of two best friends: Ami Onuki (voiced by Janice Kawaye), a peppy, optimistic, and cheerful girly girl, and Yumi Yoshimura (voiced by Grey DeLisle), a cynical, sarcastic, and grumpy tomboy. Both are based on the Japanese pop duo Puffy AmiYumi, but with different appearances and exaggerated personalities. They travel around the world on their customized tour bus along with their well-intentioned yet greedy manager Kaz Harada (voiced by Keone Young). From rocking out at a concert to hanging out in their hometown of Tokyo, the duo take the world by storm with their musical talent, trend-setting style, and humor, dishing out lessons in J-pop justice and establishing the international language of "cool" along the way.
Secondary characters include: Jang-Keng (voiced by Grey DeLisle) and Tekirai (voiced by Janice Kawaye), the duo's pet cats who enjoy tormenting Kaz; Harmony (voiced by Sandy Fox), a six-year-old girl who is the self-proclaimed "Number One Fan" of Puffy AmiYumi and (later) Kaz and constantly stalks them; Eldwin Blair (voiced by Nathan Carlson), a sinister land developer who tries to tear down beloved places for his own selfish needs; the evil Talent Suckers (voiced by Nathan Carlson and Corey Burton), a vampire rock trio from Transylvania; and Atchan (voiced by Rob Paulsen), a caricature of Atsushi (lead singer of the punk band New Rote'ka) who speaks in third-person and thinks he is a superhero.
The animated Puffy AmiYumi travel all over the world in their tour bus. While appearing the same size as a regular bus on the outside, it appears to have enough internal space to house the girls' rooms (including full-sized beds), Kaz's room, their equipment, televisions, and computers, among other things. In the episode "Domo", Kaz refers to an upstairs area. It also seems capable of running on autopilot, as Kaz, Ami, and Yumi are sometimes sitting in the rear cabin of the bus while traveling. Occasionally, the rear door has been opened to receive packages delivered by a boy on a scooter.
During the first season, the show included live-action clips of the real Ami and Yumi making childish commentary (in English and non-subtitled Japanese) at the beginning and end of each episode. They only performed short clips a |
https://en.wikipedia.org/wiki/Alpha%205%20%28Power%20Rangers%29 | Alpha 5 is a fictional character from the television series Mighty Morphin Power Rangers. A fully self-aware artificial intelligence, he is the robotic assistant of the Power Rangers, and resides in their base of operations, the Command Center along their mentor Zordon. The character is known for his "Aye-yi-yi-yi-yi!" catchphrase.
Alpha 5 has been physically portrayed by multiple actors: Romy J. Sharf, Sandi Sellner and Donene Kistler in the television series, and Peta-Maree Rixon in Mighty Morphin Power Rangers: The Movie. Richard Steven Horvitz voiced Alpha 5 for the character's appearances in most Power Rangers franchise media, starting from Mighty Morphin Power Rangers television series until Power Rangers Turbo, which marked the character's final appearance in the Power Rangers television series. In the 2017 reboot film, Alpha 5 is a CGI character voiced by Bill Hader. Various merchandise for the character, as with other of the series' characters, has been released since the inception of the Power Rangers franchise.
Character overview
Alpha 5 appears as a recurring supporting character for the Power Rangers in the series. His role is to provide communications support for the Rangers on their missions and is responsible for maintenance of the Command Center. He also serves as the Rangers' technician, constructing weapons for them to use against their opponents. He is best known for his signature catchphrase, "Aye-yi-yi-yi-yi!", usually uttered by the character when he is distressed or excited. Alpha 5's original iteration is described by Nicholas Mojica of International Business Times as a "vintage robot look"; his head is shaped like a golden flying saucer, adorned with a visor that flashes when he is speaking. Another one of the character's visual cues is an inverted yellow stylized lightning bolt similar to the Power Rangers' lightning bolt symbol on his chest.
The character is depicted as naive and childlike in temperament, and often behaves like a surrogate younger sibling to the Power Rangers wanting to spend time with them.
Creation and development
Richard Horvitz, credited as "Richard Wood" for the Power Rangers series, developed Alpha’s catchphrase when the series was in development. Horvitz also voiced Alpha 5's future successor, Alpha 7, in the Power Rangers Wild Force episode Forever Red.
Romy J. Sharf physically portrayed Alpha 5 for 89 episodes of the Mighty Morphin Power Rangers series as well as the Alpha’s Magical Christmas holiday special. Sandi Sellner took over the role for 45 episodes in seasons 2 and 3. Donene Kistler, who also worked as a production assistant on the series, assumed the role for the remainder of Alpha 5's appearances in the series. Kistler would go on to portray Alpha 5's successor, Alpha 6, for Power Rangers Turbo and Power Rangers In Space.
Appearances
Mighty Morphin Power Rangers
Alpha 5 debuted in the first episode of Mighty Morphin Power Rangers and provides a support role for the titular p |
https://en.wikipedia.org/wiki/360-day%20calendar | The 360-day calendar is a method of measuring durations used in financial markets, in computer models, in ancient literature, and in prophetic literary genres.
It is based on merging the three major calendar systems into one complex clock, with the 360-day year derived from the average year of the lunar and the solar: (365.2425 (solar) + 354.3829 (lunar))/2 = 719.6254/2 = 359.8127 days, rounding to 360.
A 360-day year consists of 12 months of 30 days each, so to derive such a calendar from the standard Gregorian calendar, certain days are skipped.
For example, the 27th of June (Gregorian calendar) would be the 4th of July in the USA.
Ancient Calendars
Ancient calendars around the world initially used a 360 day calendar.
Rome
According to Plutarch's Parallel Lives Romans initially used a calendar which had 360 days, with varying length of months. However, Macrobius' Saturnalia and Censorinus' The Birthday Book, claim that the original Roman calendar had 304 days split into 10 months.
India
The Rig Veda describes a calendar with twelve months and 360 days.
Mesoamerica
In the Mayan Long Count Calendar, the equivalent of the year, the tun, was 360 days.
Egypt
Ancient Egyptians also used a 360 day calendar.
One myth tells of how the extra 5 days were added.
Financial use
A duration is calculated as an integral number of days between startdate and enddate B. The difference in years, months and days are usually calculated separately:
There are several methods commonly available which differ in the way that they handle the cases where the months are not 30 days long, i.e. how they adjust dates:
European method (30E/360)
If either date A or B falls on the 31st of the month, that date will be changed to the 30th.
Where date B falls on the last day of February, the actual date B will be used.
All months are considered to last 30 days and hence a full year has 360 days, but another source says that February has its actual number of days.
US/NASD method (30US/360)
If both date A and B fall on the last day of February, then date B will be changed to the 30th.
If date A falls on the 31st of a month or last day of February, then date A will be changed to the 30th.
If date A falls on the 30th of a month after applying (2) above and date B falls on the 31st of a month, then date B will be changed to the 30th.
All months are considered to last 30 days and hence a full year has 360 days.
ISDA method
If date A falls on the 31st of a month, then date A will be changed to the 30th.
If date A falls on the 30th of the month after applying the rule above, and date B falls on the 31st of the month, then date B will be changed to the 30th.
All months are considered to last 30 days except February which has its actual length. Any full year, however, always counts for 360 days.
BMA/PSA method
If date A falls on the 31st of a month or last day of February, then date A will be changed to the 30th.
If date A falls on the 30th of the month |
https://en.wikipedia.org/wiki/Kids%20News%20Network | Kids News Network, created 1991 in New York City by JoAnna Levenglick who also produced the show featuring junior reporters. The Kids News Network covered entertainment, pro sports, books, technology, style, and health. Celebrity interviews are one-on-one, and are done by two young reporters, including Diandra Levenglick, who had done celebrity interviews since 1993, and have traveled all over the United States, Canada and the Bahamas doing movie junkets and were on the set of feature films. Some of the guests include: Arnold Swarzeneggar, Al Jareau, George Benson, Lindsay Lohan, Sinbad, Martin Short, Rosie O'Donnell, Oprah, Shaq, Phil Hartman, Natalie Portman, Richie Sambora, Tina Fey, the Olsen Twins, Derek Jeter, Kobe Bryant, Samuel L. Jackson, Morgan Freeman. The Kids News Network was the first TV news and entertainment show that featured so many celebrities and famous authors of children's books and pro sports players. The show is in the process of going Broadband.
External links
Official site
1991 American television series debuts
1990s American television news shows
2000s American television news shows
2010s American television news shows
2020s American television news shows |
https://en.wikipedia.org/wiki/Mesochronous%20network | A mesochronous network is a telecommunications network in which the clocks run with the same frequency but unknown phases. Compare synchronous network.
See also
Synchronization in telecommunications
Isochronous signal
Plesiochronous system
Asynchronous system
Network architecture
Synchronization |
https://en.wikipedia.org/wiki/Apple%20ProFile | The ProFile (codenamed Pippin) was the first hard disk drive produced by Apple Computer, initially for use with the Apple III personal computer. The original model had a formatted capacity of 5 MB and connected to a special interface card that plugged into an Apple III slot. In 1983, Apple offered a ProFile interface card for the Apple II, with software support for Apple ProDOS and Apple Pascal.
Additionally, in 1983, Apple introduced the Lisa computer, which was normally sold with a ProFile. The ProFile could be connected to the built-in parallel port of the Lisa, or to a port on an optional dual-port parallel interface card. Up to three such interface cards could be installed, so in principle up to seven ProFile drives could be used on a Lisa.
The 5 MB ProFile was Apple's first hard drive, and was introduced in September 1981 at a price of . Later, a 10 MB model was offered, but required an upgraded PROM/interface card to recognize the additional 5 MB.
Internally, the ProFile consisted of a bare Seagate ST-506 stepper motor drive and mechanism, without the usual Seagate electronics, a digital and an analog circuit board designed and manufactured by Apple, and a power supply.
Later Lisa models could be configured with an internal 10 MB "Widget" voice-coil drive with a proprietary controller designed and built entirely by Apple, but the Widget was never offered as an external product for use with other Apple computers.
Apple did not offer another hard drive until it released the Hard Disk 20 designed specifically for the Macintosh 512K in September 1985 which could not be used on the Apple II or III families, or Lisa series. The ProFile could not be used on the Macintosh or the Apple IIc (for which Apple never offered an external hard disk drive of any kind).
By September 1986, the ProFile would be superseded by the introduction of the first cross-platform Hard Disk 20SC SCSI-based drive for the Macintosh and interface card for the Apple II family (excluding the IIc series, which had no SCSI interface of any kind) and Lisa/XL series.
References
ProFile
Apple II peripherals
Apple Inc. peripherals
Hard disk drives
Computer-related introductions in 1981 |
https://en.wikipedia.org/wiki/CUDI | The University Corporation for Internet Development (; CUDI) is a non-profit consortium to build and operate a Mexican high-performance backbone network for research and education, sometimes called Internet-2 for Mexico.
Overview
Established in 2000, the RedCUDI (CUDI Network) backbone had, during many years, a capacity of 155 Megabits per second (STM-1) using ATM, recently 10 Gigabits links, with 3 international links to Abilene Network, Gigabit links to the California Research and Education Network (CalREN) managed by CENIC, and one Mbit link to RedCLARA. Over 200 members institutions (research centers, universities) participate in RedCUDI, some corporate and affiliate institutions, in all of the 31 states of Mexico. Its purpose has been to develop and deploy advanced network applications and technologies such as IPv6, IP multicasting, quality of service, Software-defined networking and other innovations.
External links
Home of CUDI
National research and education networks
Universities and colleges in Mexico |
https://en.wikipedia.org/wiki/Luminate%20%28company%29 | Luminate (formerly MRC Data and P-MRC Data) is a provider of music and entertainment data. Established as a joint-venture in 2020, it brought together Nielsen Music, Alpha Data (formerly BuzzAngle Music) and Variety Business Intelligence (formerly TVtracker).
In December 2019, Eldridge Industries' Valence Media, the current parent company of Billboard, acquired Nielsen's music data business, reuniting it with Billboard for the first time since its spin-off to E5 Global Media from Nielsen Business Media. It was renamed MRC Data in 2020 after Eldridge Industries merged Valence with the film and television studio MRC. and was then brought under its PMRC joint venture with Penske Media Corporation as P-MRC Data. It was renamed once more to Luminate Data in March 2022. In August 2022, the MRC merger was unwound, with Eldridge Industries taking sole ownership of its stake in PMRC.
Nielsen Music
Nielsen Music, originally established by Mike Fine and Mike Shalett in 1991, collects music consumption and sales weekly and makes this available every Sunday (for album sales) and every Monday (for song sales) to subscribers, which include record companies, publishing firms, music retailers, independent promoters, film and TV companies, and artist managers. It is the source of sales information for the Billboard music charts. The company operates the analytics platform Music Connect, Music 360 and Broadcast Data Systems (which tracks airplay of music), the latter of which was shut down in September 2022
Nielsen SoundScan began tracking sales data for Nielsen on March 1, 1991. The May 25 issue of Billboard published Billboard 200 and Country Album charts based on SoundScan "piece count data," and the first Hot 100 chart to debut with the system was released on November 30, 1991. Previously, Billboard tracked sales by calling stores across the U.S. and asking about sales—a method that was inherently error-prone and open to outright fraud. Indeed, while transitioning from the calling to tracking methods, the airplay and sales charts (already monitored by Nielsen) and the Hot 100 (then still using the calling system) often did not match (for instance Paula Abdul's "Promise of a New Day" and Roxette's "Fading Like a Flower" reached much higher Hot 100 peaks than their actual sales and airplay would have allowed them to).
Although most record company executives conceded that the new method was far more accurate than the old, the chart's volatility and its geographical balance initially caused deep concern, before the change and the market shifts it brought about were accepted across the industry. Tower Records, the country's second-largest retail chain, was originally not included in the sample because its stores were equipped with different technology to measure sales.
At first, some industry executives complained that the new system—which relied on high-tech sales measurement rather than store employee estimates—was based on an inadequate sample, one that fav |
https://en.wikipedia.org/wiki/Worms%20Armageddon | Worms Armageddon is a 1999 turn-based strategy video game developed and published by Team17. It was originally released for the Microsoft Windows operating system, and was later ported to the PlayStation, Dreamcast, Nintendo 64, and Game Boy Color. Worms Armageddon is the third installment in the Worms series. In the game, the player controls a team of up to eight earthworms tasked with defeating an opposing team using a wide range of weapons at their disposal. The game takes place on a destructible and customizable two-dimensional board and is characterized by cartoonish graphics and a unique brand of humour.
Worms Armageddon was originally developed as an expansion pack to Worms 2 and initially titled Wormageddon before it was released as a standalone game. Worms Armageddon was acclaimed by critics, who praised the refined gameplay and stylized graphics, and it has been featured in a number of "greatest games of all time" lists. Worms Armageddon is still updated periodically as of 2020, and was released on the Steam platform in 2013.
Gameplay
Gameplay is turn-based, with each team moving in sequence, which is determined randomly, across two-dimensional terrain. During a single turn, a team can only move one of their worms (unless an item that allows the team to select their worm is used). Worms can walk and jump, as well as (when the proper items are available) swing by rope, parachute, teleport, and bungee. The objective of a traditional match is to defeat all opposing teams by killing their worms, although in the campaign some missions have other objectives such as collecting a specific crate.
Each worm begins the round with a specific amount of health, which is predefined by the chosen game options or by scripting in campaign levels. When hit with a weapon, the worm will lose health depending upon the power of the weapon and the directness of the hit. A worm can be killed either by exploding after having its health reduced to zero or by being knocked into the water around and below the level.
The game includes a wide variety of weapons, including melee, projectile, and explosive weapons, as well as airstrike-based attacks. Some are based on real-life arms, such as the shotgun, bazooka, and hand grenade; others are rather fanciful and cartoonish, such as the sheep, which serves as a mobile explosive, and the skunk, which releases poisonous gas. In a normal match, all teams begin with the same weapons, based on the chosen weapon set. Some weapons may not become available until a certain number of turns pass. Depending on the game options, additional weapons may randomly fall onto the terrain in airdropped and teleported crates. In addition to normal weapons, during team creation, each team chooses a special weapon which becomes available to them after a certain number of turns. The special weapons are more powerful than regular weapons and often offer special abilities; super weapons will rarely fall in weapon crates. These weapons are of |
https://en.wikipedia.org/wiki/Legal%20Electronic%20Data%20Exchange%20Standard | The Legal Electronic Data Exchange Standard is a set of file format specifications intended to facilitate electronic data transmission in the legal industry. The phrase is abbreviated LEDES and is usually pronounced as "leeds". The LEDES specifications are maintained by the LEDES Oversight Committee (LOC), which started informally as an industry-wide project led by the Law Firm and Law Department Services Group within PricewaterhouseCoopers in 1995. In 2001, the LEDES Oversight Committee was incorporated as a California mutual-benefit nonprofit corporation and is now led by a seven-member Board of Directors.
The LOC maintains four types of data exchange standards for legal electronic billing (ebilling); budgeting; timekeeper attributes; and intellectual property matter management.
The LOC also maintains five types of data elements in the LEDES data exchange standards: Uniform Task-Based Management System codes, which classify the work performed by type of legal matter; activity codes, which classify the actual work performed; expense codes, which classify the type of expense incurred; timekeeper classification codes; and error codes, which assist law firms with understanding invoice validation errors.
The LOC has also created an API that allows for system-to-system transmission of legal invoices from law firms and other legal vendors required by their clients to ebill, to the third-party ebilling systems. Other functionality is also supported in this very complex standard, which is intended to ease the burden at the law firm for managing client-required ebilling.
Electronic billing formats
The electronic billing data exchange format types provide a standard data format for electronically transmitted invoices, typically from a law firm to a corporate client. The LEDES e-billing format currently has the following variations:
LEDES 1998, the first "LEDES" format, created in 1998, but no longer in use. The format does not appear on www.LEDES.org.
LEDES 1998B, a pipe-delimited plain text file. The standard was adopted in 1998, and it is the more commonly used LEDES format in the US. It lacks flexibility, having a rigid structure, and does not support taxes on legal fees. Another disadvantage of LEDES 1998B is that invoice-level data is repeated on every line item even though it is only needed once, as it does not vary per line. Many clients attempt to impose nonstandard customizations, thus defeating the purpose of having a standard. Nonetheless, US-based law firms prefer it for its simplicity and familiarity.
LEDES XML 2000, adopted in 2000, is an older XML format that uses a DTD. In LEDES 2000, although the structure is well defined, the specification defines "extend" segments, allowing the insertion of client-specific fields without breaking the format or violating the standard. The format is no longer supported by the LEDES Oversight Committee and information on the format will be removed from www.LEDES.org on February 1, 202 |
https://en.wikipedia.org/wiki/Melbourne%20tram%20route%2070 | Melbourne tram route 70 is operated by Yarra Trams on the Melbourne tram network from Waterfront City to Wattle Park. The 16.5 kilometre route is operated out of Camberwell depot with A and B class trams.
History
Most of the line currently used by route 70 was initially built and run by the Hawthorn Tramways Trust (HTT) in 1916–17. It ran between the Batman Avenue terminus (opposite Flinders Street station) to the intersection of Warrigal Road (then Boundary Road) and Riversdale Road. At the time, the HTT's Batman Avenue line was Melbourne's only electric tram line that reached the CBD. The Melbourne & Metropolitan Tramways Board took over the line in 1920, and in 1928, extended the line a further two kilometres to Wattle Park at the Riversdale Road and Elgar Road intersection. In 1934, the line was given the route 70 designation, which it still holds today.
On 6 June 1999 it was diverted to operate via the Exhibition Street extension with a four-lane divided road built over the Jolimont Yard, enabling Batman Avenue west of Melbourne Park to be closed with route 70 extended to terminate at the intersection of Flinders and Spencer Streets. This new route was better able to serve all of the Melbourne Park venues such as the Melbourne Cricket Ground and Rod Laver Arena. Extra sidings were also built along the route in order to accommodate special events. On 5 December 1999, at the City end, the route was amended to terminate at new sidings west of Spencer Street.
On 4 May 2003, the route was extended along Spencer Street to the intersection of Spencer and La Trobe Streets, swapping route termini with route 75. Between May and November 2005, the route temporarily terminated at Market Street due to the closure and removal of the Flinders Street Overpass over King Street. After the works were completed, on 21 November 2005, the route was re-extended along Flinders Street and its permanent terminus was altered to the intersection of Bourke Street and Harbour Esplanade at Docklands, no longer running along Spencer Street. The route was extended to Waterfront City in September 2009 to replace route 48 which was re-routed away from Flinders Street and Waterfront City.
Route
From Waterfront City, the route runs along Docklands Drive, Harbour Esplanade and Flinders Street in the city, behind Melbourne Park at Richmond and then along Swan Street and Riversdale Road through Hawthorn and Camberwell to the eastern end of Wattle Park, terminating at Elgar Road.
Operation
Route 70 is operated out of Camberwell depot with A class trams, although B class trams are occasionally used. During the Australian Open it is operated by B class trams for extra capacity. Additional services run between Melbourne Park and the city. These services are signed as Route 70a and run a mix of B and E class trams.
Route map
References
External links
070
070
1917 establishments in Australia
Transport in the City of Whitehorse
Transport in the City of Boroondara
Transport in th |
https://en.wikipedia.org/wiki/Universal%20integrated%20circuit%20card | The universal integrated circuit card (UICC) is the smart card (integrated circuit card) used in mobile terminals in 2G (GSM) , 3G (UMTS), 4G (LTE), and 5G networks. The UICC ensures the integrity and security of all kinds of personal data, and it typically holds a few hundred kilobytes. The official definition for UICC is found in ETSI TR 102 216, where it is defined as a "smart card that conforms to the specifications written and maintained by the ETSI Smart Card Platform project". In addition, the definition has a note that states that "UICC is neither an abbreviation nor an acronym". NIST SP 800-101 Rev. 1 and NIST Computer Security Resource Center Glossary state that, "A UICC may be referred to as a SIM, USIM, RUIM or CSIM, and is used interchangeably with those terms", though this is an over-simplification. The primary component of a UICC is a SIM card.
Design
A UICC consists of a CPU, ROM, RAM, EEPROM and I/O circuits. Early versions consisted of the whole full-size (85 × 54 mm, ISO/IEC 7810 ID-1) smart card. Soon the race for smaller telephones called for a smaller version of the card. The card was cropped down to 25 × 15 mm (ISO/IEC 7810 ID-000), as illustrated.
2G versus 3G
In 2G networks, the SIM card and SIM application were bound together, so that "SIM card" could mean the physical card, or any physical card with the SIM application.
In a GSM network, the UICC contains a SIM application and in a UMTS network, it contains a USIM application. A UICC may contain several applications, making it possible for the same smart card to give access to both GSM and UMTS networks, and also provide storage of a phone book and other applications. It is also possible to access a GSM network using a USIM application and it is possible to access UMTS networks using a SIM application with mobile terminals prepared for this. With the UMTS release 5 a new application, the IP multimedia Services Identity Module (ISIM) is required for services in the IMS. The telephone book is a separate application and not part of either subscriber identity module.
In a cdmaOne/CDMA2000 ("CDMA") network, the UICC contains a CSIM application, in addition to 3GPP USIM and SIM applications. A card with all 3 features is called a removable user identity card, or R-UIM. Thus, the R-UIM card can be inserted into CDMA, GSM, or UMTS handsets, and will work in all three cases.
In 3G networks, it is a mistake to speak of a USIM, CSIM, or SIM card, as all three are applications running on a UICC card.
Usage
Since the card slot is standardized, a subscriber can easily move their wireless account and phone number from one handset to another. This will also transfer their phone book and text messages. Similarly, usually a subscriber can change carriers by inserting a new carrier's UICC card into their existing handset. However, it is not always possible because some carriers (e.g., in U.S.) SIM-lock the phones that they sell, preventing rival carriers' cards from being u |
https://en.wikipedia.org/wiki/Mrityudata | Mrityudaata (Death Giver) is a 1997 Indian Hindi-language action drama film directed by Mehul Kumar with music by Anand Milind. The film is considered to be a comeback role for Amitabh Bachchan, who temporarily left the industry in 1992. This film was produced by his own production company called Amitabh Bachchan Corporation Limited (ABCL). It marked Bachchan's comeback after five years but was a box-office bomb. One of the songs in the film picturized on Amitabh and Daler Mehndi was very popular when released.
Plot
Dr. Ram Prasad Ghayal (Amitabh Bachchan) is a renowned doctor who has been successful in all operations in his career and has skillfully operated many delicate surgeries. He lives with his wife Janki (Dimple Kapadia) and brother Bharat (Arbaaz Ali Khan). Bharat is in love with Renu (Karishma Kapoor), the daughter of Umeshchan Jain (Tiku Talsania). At the same time, Raja Tunga (Deepak Tijori), the brother of Rana Tunga (Mukesh Rishi) has a longing for Renu. The miscreant Raja with his mob severely assaults Bharat when Bharat resists Raja's advances toward Renu.
A corrupt minister Mohanlal (Ashish Vidyarthi) wants to execute a disastrous scheme called the "Pawanghat Power Project" at the expense of the lives and property of the tribes living at the project site. He coaxes and later threatens Bharat, the concerned engineer to sign his approval for the project, whereas Bharat refuses to endorse such a scheme. On the other hand, Rana devises an evil plot against Bharat to wipe the latter out eventually leading to his brother Raja winning Renu. Bharat is framed for murdering a woman and Inspector Danapani (Mushtaq Khan), a subordinate of Rana, arrests him and puts him behind bars. Woefully, Bharat dies in jail presumably by committing suicide. The agony of Bharat's death claims the life of Janki as well. With the death of his beloved wife and brother, Dr. Ram becomes desolate and alcoholic. Renu marries Raja, without any regret for the death of her former lover.
Now that Bharat is dead, Mohanlal conspires with Rana for the implementation of the power project. However, they end up becoming enemies of each other. Mohanlal plans to kill Raja. His henchmen attack Raja who is critically injured. Raja is admitted to the hospital where Dr. Ram is to conduct his operation. Renu fears that Dr. Ram may kill Raja to take vengeance for the death of his brother. She refuses to sign the operation papers, but Dr. Ram, who considers it his moral duty to save the life of a patient regardless of them being his friend or foe, conducts the operation. His expertise pays off as Raja is saved. He goes out to convey the news to Renu but returns to find Raja dead, beyond all his expectations. Renu files an F.I.R. against Dr. Ram, who is arrested and imprisoned.
In jail, Dr. Ram meets an inmate bearing the number 92, Prof Nizamuddin Azad (Pran), a scientist of "Bharat Atomic Energy". He has been jailed after a false allegation of revealing confidential nuclear |
https://en.wikipedia.org/wiki/Carnival%20Films | Carnival Film & Television Limited, trading as Carnival Films, is a British production company based in London, UK, founded in 1978. It has produced television series for all the major UK networks including the BBC, ITV, Channel 4, and Sky, as well as international broadcasters including PBS, A&E, HBO and NBC. Productions include single dramas, long-running television dramas, feature films, and stage productions.
History
Carnival Films was founded in 1978 by feature film producer Brian Eastman.
As of 2014, Carnival has produced over 500 hours of drama and comedy for television, cinema and stage. This included 70 episodes of Agatha Christie's Poirot starring David Suchet and 22 episodes of Rosemary & Thyme, starring Felicity Kendal and Pam Ferris. In the action/adventure genre it produced BUGS, Oktober and The Grid, in comedy drama it produced Jeeves and Wooster starring Hugh Laurie and Stephen Fry, teenage drama-comedy As If, as well as the adaptations of Tom Sharpe's novels Blott on the Landscape and Porterhouse Blue.
In 2004, the BBC's former Head of Drama Commissioning Gareth Neame joined Carnival as managing director. In 2007, former Creative Director of BBC Drama Sally Woodward Gentle joined the company as Creative Director. The two had previously worked together on Spooks (MI:5), Tipping the Velvet and Cambridge Spies.
In 2007 Australian production company Southern Star acquired 75% percent of Carnival Films but by 2008 the company was acquired by American-based NBCUniversal as part of its plan to increase its presence in content creation outside the United States. Following several more acquisitions Carnival is now part of NBCUniversal International Television Production alongside newer additions Monkey Kingdom, Working Title Television, Chocolate Media and Lucky Giant in the UK, Lark in Canada and Matchbox Pictures in Australia.
Under the direction of Gareth Neame, Carnival has produced series such as; The Philanthropist for NBC; hit BBC series Hotel Babylon; the television films Enid starring Helena Bonham Carter and Matthew Macfadyen; Page Eight starring Bill Nighy, Rachel Weisz, Michael Gambon and Ralph Fiennes; four-part drama Any Human Heart starring Jim Broadbent, Matthew MacFadyen, Hayley Atwell and Kim Cattrall; The Hollow Crown, a BBC adaptation of Shakespeare's history plays starring Tom Hiddleston, Ben Whishaw and Jeremy Irons; The Last Weekend, a three-part adaptation of Blake Morrison's novel; and Whitechapel for ITV.
Carnival's biggest hit, both critically and commercially, is Downton Abbey, written and co-produced by Julian Fellowes. The final episode of the TV series aired on 25 December 2015. In 2016, Neame and Fellowes started planning a feature adaptation; it was officially confirmed in July 2018 and filming began later that month. Downton Abbey (film) was released in the United Kingdom on 13 September 2019 by Universal Pictures, and in the United States on 20 September 2019 by Focus Features. It received generall |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.