source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Brian%20Paul | Brian E. Paul is a computer programmer who originally wrote and maintained the source code for the open source Mesa graphics library until 2012, and is still active in the project. He began writing its source code in August 1993. Mesa is a free software/open source graphics library that provides a generic OpenGL implementation for rendering three-dimensional graphics on multiple platforms.
Education
Paul obtained his bachelor's degree at the University of Wisconsin–Oshkosh in 1990. He worked on the SSEC Visualization Project while obtaining his master's degree at the University of Wisconsin–Madison.
Mesa development
Paul was a graphics hobbyist. He thought it would be fun to implement a simple 3D graphics library using the OpenGL API, which he might then use instead of VOGL. He spent eighteen months of part-time development before he released the software on the Internet. The software was well received, and people began contributing to its development. Graphics hardware support was added to Mesa in 1997 in the form of a Glide driver for the new 3dfx Voodoo graphics card.
Career
Paul continued working on the SSEC Project after graduation. He has also worked for Silicon Graphics, Avid Technology, and Precision Insight (bought out by VA Linux Systems).
In 2000, Paul won the third Free Software Foundation Award for the Advancement of Free Software.
In November 2001, he co-founded Tungsten Graphics, which was acquired by VMware in December 2008, where he now works.
Other contributions
Paul has also contributed to or written:
Chromium
Direct Rendering Infrastructure in XFree86
Blockbuster – a high-res movie player for scientific visualization applications
Glean – OpenGL validation
Togl – an OpenGL widget for Tcl/Tk
Vis5D visualization system
VisAD visualization system
Cave5D – an adaptation of Vis5D to immersive virtual reality
TR – OpenGL tile rendering library
V-Blocks – virtual building blocks
Avid Marquee – video animation, 3D text, graphics
References
External links
Brian Paul's Home Page
"Interview: Brian Paul Answers"; slashdot; December 17, 1999; Retrieved February 11, 2007
Free software programmers
Living people
Year of birth missing (living people)
University of Wisconsin–Oshkosh alumni
University of Wisconsin–Madison alumni |
https://en.wikipedia.org/wiki/ADOdb | ADOdb is a database abstraction library for PHP, originally based on the same concept as Microsoft's ActiveX Data Objects. It allows developers to write applications in a consistent way regardless of the underlying database system storing the information. The advantage is that the database system can be changed without re-writing every call to it in the application.
Features
ADOdb supports the following databases:
Firebird
IBM Db2
Interbase
Lightweight Directory Access Protocol (LDAP)
Microsoft Access
Microsoft SQL Server
MySQL
Oracle database
PHP Data Objects (PDO)
PostgreSQL
SQLite
generic ODBC
MariaDB
Legacy, unsupported or obsolete drivers may still be found in older releases of ADOdb.
In addition to the Database Abstraction Layer, ADOdb includes the following features:
Schema management tools: a suite of tools to interrogate the attributes of tables, fields and indexes in databases as well as providing cross-database schema management including a full suite of XML based functions
Date and time library: provides a drop-in replacement for PHP date functions, but provide access to dates outside the normal range of dates supported by normal PHP functions
Session management tools: allows storing session data in a database table or as encrypted data
References
External links
SourceForge project page
Data access technologies
PHP libraries
Python (programming language) libraries |
https://en.wikipedia.org/wiki/Nokia%206680 | The Nokia 6680 is a high-end 3G smartphone running Symbian operating system, with Series 60 2nd Edition user interface. It was announced on 14 February 2005, and was released the next month. The 6680 was Nokia's first device with a front camera, and was specifically marketed for video calling. It was also Nokia's first with a camera flash. It went on sale retailing for 500 euros. It was the spring-board onto the Nseries in April that year; its successor being the N70.
Features
The device features Bluetooth, a 1.3-megapixel fixed-focus camera, front VGA (0.3-megapixel) video call camera, hot swappable Dual Voltage Reduced Size MMC (DV-RS-MMC) memory expansion card support, stereo audio playback and a 2.1", 176x208, 18-bit (262,144) color display with automatic brightness control based on the environment.
The 6680 remains a high-end 3G device. It is a smartphone offering office and personal management facilities, including Microsoft Office compatible software. The phone initially offered an innovative active standby mode, but this was removed by some network operators (for example, Orange) under their own adapted firmware. The phone, however, has been marred by a more-than-normal number of bugs, which have included crashes and security issues. The phone was also criticised in some reviews for the relatively limited memory available.
In addition to the standard RS-MMC card, the 6680 can also use Dual Voltage Reduced Size MMC (DV-RS-MMC) cards which are also marketed as MMCmobile. While these cards have the same form factor as RS-MMC, the DV-RS-MMC have a 2nd row of connectors on the bottom. Make sure any upgraded card supports or claims to support 1.8V in addition to 3.0V.
The phone operates on GSM 900/1800/1900, and UMTS 2100 on 3G networks.
During its development, the 6680 was codenamed Milla.
This handset was similar to its predecessor, the Nokia 6630. Key changes were the new "active standby" feature, the facility for face-to-face video calls, a camera flash, better screen and improved styling.
The hardware application platform of this device is OMAP 1710.
Variants
The Nokia 6681 and Nokia 6682 are GSM handsets by Nokia, running the Series 60 user interface on the Symbian operating system. The phones are GSM-only versions of the Nokia 6680.
The only difference between the 6681 and the 6682 is the fact that the 6681 is targeted at the European market, being a GSM 900/1800/1900 tri-band handset, while the 6682 is targeted at the American one, supporting 850/1800/1900 frequencies.
In turn, both handset's specs are almost identical to those of the 6680, except for the lack of support for 3G networks, which means no UMTS support, or video call, thus the absence of the front video call camera.
The hardware application platform of the device is OMAP 1710. The resolution of the display is 176x208.
Related handsets
Nokia N70
References
External links
Product pages
Nokia 6680 Official product page
Nokia 6681
Nokia 6682
Rui Carmo's 6 |
https://en.wikipedia.org/wiki/Alex%20Elmsley | Alex Elmsley (2 March 1929 – 8 January 2006) was a Scottish magician and computer programmer. He was notable for his invention of the Ghost Count or Elmsley Count, creating mathematical card tricks, and for publishing on the mathematics of playing card shuffling.
He began practising magic in 1946, as a teenager. He studied physics and mathematics at Cambridge University; whilst there he was also secretary of the Pentacle Club. He was a patent agent, and later a computer expert, in his day job. Otherwise, he was an amateur card and close-up magician. He was awarded an Academy of Magical Arts Creative Fellowship in 1972.
He created a number of well-known magic tricks, including The Four Card Trick, Between Your Palms, Point Of Departure and Diamond Cut Diamond.
In 1975 he briefly toured the US giving a highly praised lecture known as the "Dazzle Card Act", which consisted of a magic act followed by a detailed discussion of routining. Notes on the lecture were released under the title Cardwork. Elmsley was the subject of The Collected Works of Alex Elmsley (vol. 1 1991, vol. 2 1994).
He named the special count used in The Four Card Trick the ghost count, though it would later become known as the Elmsley Count.
References
Notes
External links
Elmsley on Magicdirectory.com
Elmsley from Magicweek.co.uk
British magicians
1929 births
2006 deaths
Academy of Magical Arts Creative Fellowship winners
Academy of Magical Arts Lifetime Achievement Fellowship winners |
https://en.wikipedia.org/wiki/Roots%20Air | Roots Air was a low-cost airline based in Canada. It started and ceased operations in 2001.
Code data
IATA Code: 6J
ICAO Code: SSV
Callsign: SKYTOUR
History
The airline was a brief experiment by clothier Roots Canada outside of its core business. The new discount airline was created in 2000 and service began in March 2001, but was suspended in May 2001 when Air Canada acquired a 30% equity interest and 50% voting stake in Roots Air operator Skyservice. All flights involving Roots Air were transferred to Air Canada.
Services
Roots Air served the Canadian cities of Vancouver, Calgary and Toronto. Service to Los Angeles was cancelled prior to Roots Air's launch. International connections were facilitated by partnerships with other airlines.
List of routes:
Toronto-Calgary: three daily flights
Toronto-Vancouver: two daily flights
Fleet
The Roots Air fleet consisted of the following aircraft:
3 Airbus A320-200 ( C-GTDC, C-FRAA, C-FRAR )
1 Airbus A330-300 (C-FRAE) - arrived in Toronto, but the airline shut down prior to its utilization.
1 Boeing 727-200 ( leased from Kelowna Flightcraft. C-GOKF (Original Braniff Airlines) )
See also
List of defunct airlines of Canada
References
Roots Air Intro
RootsAir Takes Off - CBC
External links
Rootsair.com (Archive)
Roots official Website
Defunct airlines of Canada
Defunct low-cost airlines
Airlines established in 2000
Airlines disestablished in 2001 |
https://en.wikipedia.org/wiki/Tim%20Hartnell | Tim Hartnell (1951–1991) was an Australian journalist, self-taught programmer and author of books and magazines on computer games. He set up The National ZX80 User Group with Trevor Sharples in 1980 producing a more-or-less monthly magazine entitled Interface. This User Group then expanded to include the ZX81, Acorn Atom and Spectrum computers, and provided a springboard for Tim and Trevor to launch the first of their home computing books. His company, Interface Publications (set up with Elizabeth North), produced titles for all of the machines in the home computer market, including Sinclair machines. Hartnell wrote several compendiums of computer games, which typically had several categories of games, with several games in each category. Each category had tips for writing enjoyable games in that genre. Each game had a description of the program and an explanation of its implementation, sometimes with ideas for modifications; this was followed by the raw code, which the reader had to enter into the computer. Some long games, such as Bannochburn Legacy, had more than 500 lines of code.
To illustrate the style of these compendiums, here is the Table of Contents from Hartnell's Giant Book of Computer Games:
BOARD GAMES - Chess, Gomoku, Awari, Knightsbridge, Shogun and others
ADVENTURE GAMES - Stronghold of the Dwarven Lords, The Duke of Dragonfear, The Bannochburn Legacy
SIMULATIONS - including Mistress of Xenophobia
DICE GAMES - Chemin de Computer, No Sweat, and three more
ARTIFICIAL INTELLIGENCE - including Eliza and Electronic Brain
JUST FOR FUN - Inner Spring, Robot Minefield, and five others
FUN WITH YOUR PRINTER - Celestia and Billboard
SPACE GAMES - including Moonlander
BRAIN GAMES - Fastermind, Switcheroo and several others
Hartnell also wrote several how-to books about various genres of computer games, including Giant Book of Spectrum Games published in 1983, and also edited others, including Pete Shaw's Creating Adventure Games On Your ZX Spectrum, also published in 1983. They were designed so that a beginner could, using his programs as examples, intuitively learn the BASIC programming language. Although he created a wide variety of games, the code for all of them tended to be characterized by an outline-style organization that made it easy to discern the basics of how the program worked. His prose showed a passionate interest in, and enjoyment of, the games he created; he tended to be imaginative, witty, and dramatic, as well as nostalgic - he had little use for graphics, favoring text games that let the programmer's and player's imaginations do the work of creating the setting.
Hartnell returned to Australia in 1984 and died of cancer in 1991, at the age of 40.
References
External links
The Giant Book of Computer Games, Table of Contents,
The Giant Book of Spectrum Arcade Games, Tanzarine Technology Ltd.
Hartnell, Tim: Creating Adventure Games On Your Computer.
Tribute at worldofspectrum.org
About Interface Publications
Hartnel |
https://en.wikipedia.org/wiki/Pollard%27s%20rho%20algorithm%20for%20logarithms | Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, analogous to Pollard's rho algorithm to solve the integer factorization problem.
The goal is to compute such that , where belongs to a cyclic group generated by . The algorithm computes integers , , , and such that . If the underlying group is cyclic of order , by substituting as and noting that two powers are equal if and only if the exponents are equivalent modulo the order of the base, in this case modulo , we get that is one of the solutions of the equation . Solutions to this equation are easily obtained using the extended Euclidean algorithm.
To find the needed , , , and the algorithm uses Floyd's cycle-finding algorithm to find a cycle in the sequence , where the function is assumed to be random-looking and thus is likely to enter into a loop of approximate length after steps. One way to define such a function is to use the following rules: Divide into three disjoint subsets of approximately equal size: , , and . If is in then double both and ; if then increment , if then increment .
Algorithm
Let be a cyclic group of order , and given , and a partition , let be the map
and define maps and by
input: a: a generator of G
b: an element of G
output: An integer x such that ax = b, or failure
Initialise a0 ← 0, b0 ← 0, x0 ← 1 ∈ G
i ← 1
loop
xi ← f(xi-1),
ai ← g(xi-1, ai-1),
bi ← h(xi-1, bi-1)
x2i ← f(f(x2i-2)),
a2i ← g(f(x2i-2), g(x2i-2, a2i-2)),
b2i ← h(f(x2i-2), h(x2i-2, b2i-2))
if xi = x2i then
r ← bi - b2i
if r = 0 return failure
x ← r−1(a2i - ai) mod n
return x
else // xi ≠ x2i
i ← i + 1
end if
end loop
Example
Consider, for example, the group generated by 2 modulo (the order of the group is , 2 generates the group of units modulo 1019). The algorithm is implemented by the following C++ program:
#include <stdio.h>
const int n = 1018, N = n + 1; /* N = 1019 -- prime */
const int alpha = 2; /* generator */
const int beta = 5; /* 2^{10} = 1024 = 5 (N) */
void new_xab(int& x, int& a, int& b) {
switch (x % 3) {
case 0: x = x * x % N; a = a*2 % n; b = b*2 % n; break;
case 1: x = x * alpha % N; a = (a+1) % n; break;
case 2: x = x * beta % N; b = (b+1) % n; break;
}
}
int main(void) {
int x = 1, a = 0, b = 0;
int X = x, A = a, B = b;
for (int i = 1; i < n; ++i) {
new_xab(x, a, b);
new_xab(X, A, B);
new_xab(X, A, B);
printf("%3d %4d %3d %3d %4d %3d %3d\n", i, x, a, b, X, A, B);
if (x == X) break;
}
return 0;
}
The results are as follows (edited):
i x a b X A B
------------------------------
1 2 1 0 10 1 1
2 10 1 1 100 2 2
3 20 2 1 1000 3 3
4 100 2 2 425 8 6
5 2 |
https://en.wikipedia.org/wiki/Oh%20Yeon-ho | Oh Yeon-ho (born 18 September 1964) is the founder of "citizen journalism" in South Korea, and CEO of OhmyNews a new approach to cyber-journalism in which ordinary citizens can contribute to a major news organization through being at news events, filing reports, and having their work verified and edited by trained news staff. He is seen as one of the pivotal figures in the contemporary culture of South Korea.
Biography
Oh was born in 1964 in Gokseong. He graduated from Yonsei University in 1988 with a degree in Korean literature. He earned a master's degree in journalism from Regent University in 1998 and has a PhD in mass-communication at Sogang University in Seoul. In 2006, he received the Wharton Infosys Business Transformation Award for his work with information technology, most specifically his pioneering development of OhmyNews and the society-transforming contributions that resulted.
Media career
1988–1999 Reporter, Chief Reporter in Monthly magazine Mahl
1995–1997 Correspondent in Washington, DC in Monthly magazine Mahl
22 Feb 2000 Founded OhmyNews, served as CEO and managing editor
2007–2009 President of Korea Internet Newspaper Association
Awards
May 2001 Awarded: The Media Grand Prize of This Year
October 2001 Selection: 55 people of South Korea
December 2001 Winning the Grand prize: Democratic Press Award
October 2004 Winning the Grand prize: Ahn Jong-Pil Press Award
January 2006 Awarded: Management Innovation
October 2007 Awarded: Medal of Missouri University
October 2018 Awarded: Grundtvig Prize 2018
Ranked 16th in 'This year's 50s for IT characters' as UK Information Technology site (www.silicon.com)
See also
Citizen journalism
Independent Media Center
Ohmynews
References
External links
OhmyNews official site
http://english.ohmynews.com/articleview/article_view.asp?no=153109&rel_no=1
http://news.bbc.co.uk/2/hi/asia-pacific/2843651.stm
https://web.archive.org/web/20051125021916/http://www.changemakers.net/library/temp/nytimes030603.cfm
https://web.archive.org/web/20050309193948/http://www.atimes.com.by-parakeet.gibeo.net/atimes/Korea/FK25Dg01.html
http://www.wacc.org.uk/wacc/publications/media_action/253_oct_2003/ohmynews_anyone_can_be_a_reporter
Howard W. French "Online Newspaper Shakes Up Korean Politics" New York Times, March 6, 2003
http://creativeink.blogspot.com/2004/12/citizen-journalists.html
http://www.editorsweblog.org/2004/05/every_citizen_i.html
1964 births
Living people
South Korean businesspeople
South Korean journalists
Regent University alumni
Sogang University alumni
Yonsei University alumni |
https://en.wikipedia.org/wiki/Arcada | Arcada may refer to the following:
Arcada Software, was a computer software company that was formed in early 1994.
Arcada Theater Building, a Registered Historic Place in St. Charles, Illinois, USA.
Arcada Township, Michigan, a civil township of Gratiot County in the U.S. state of Michigan.
Arcada University of Applied Sciences, a university of applied sciences (polytechnic) in Helsinki, Finland. |
https://en.wikipedia.org/wiki/Registry%20of%20Toxic%20Effects%20of%20Chemical%20Substances | Registry of Toxic Effects of Chemical Substances (RTECS) is a database of toxicity information compiled from the open scientific literature without reference to the validity or usefulness of the studies reported. Until 2001 it was maintained by US National Institute for Occupational Safety and Health (NIOSH) as a freely available publication. It is now maintained by the private company BIOVIA or from several value-added resellers and is available only for a fee or by subscription.
Contents
Six types of toxicity data are included in the file:
Primary irritation
Mutagenic effects
Reproductive effects
Tumorigenic effects
Acute toxicity
Other multiple dose toxicity
Specific numeric toxicity values such as , LC50, TDLo, and TCLo are noted as well as species studied and the route of administration used. For all data the bibliographic source is listed. The studies are not evaluated in any way.
History
RTECS was an activity mandated by the US Congress, established by Section 20(a)(6) of the Occupational Safety and Health Act of 1970 (PL 91-596). The original edition, known as the Toxic Substances List was published on June 28, 1971, and included toxicological data for approximately 5,000 chemicals. The name changed later to its current name Registry of Toxic Effects of Chemical Substances. In January 2001 the database contained 152,970 chemicals. In December 2001 RTECS was transferred from NIOSH to the private company Elsevier MDL. Symyx acquired MDL from Elsevier in 2007 and the Toxicity database was included in the acquisition. The Toxicity database is only accessible for charge on an annual subscription base.
RTECS is available in English, French and Spanish language versions, offered by the Canadian Centre for Occupational Health and Safety. The database subscription is offered on the Web, on CD-ROM and as an Intranet format. The database is also available online from NISC (National Information Services Corporation, RightAnswer.com, and ToxPlanet (Timberlake Ventures, Inc)).
References
External links
RTECS overview
Accelrys website
RightAnswer Website
ToxPlanet Website
Chemical safety
Chemical databases
Toxic effects of substances chiefly nonmedicinal as to source |
https://en.wikipedia.org/wiki/Tanktics%3A%20Computer%20Game%20of%20Armored%20Combat%20on%20the%20Eastern%20Front | Tanktics: Computer Game of Armored Combat on the Eastern Front is a 1976 two-player tank battle computer wargame by Chris Crawford. It was Crawford's first video game. He initially self-published it as Wargy I. It was published by Avalon Hill in 1981 as Tanktics.
The game has no graphics; the player moves tokens on a physical map to represent a tank battle, with the computer controlling one of the sides.
The game received weak reviews by critics, who found the artificial intelligence to be weak and suited for players who wanted neither a complex nor fast-paced game.
Gameplay
The game simulates a two-player tank battle on a large hex grid. Tanktics has no graphics; the player moves tokens on a map using coordinates the computer, acting as referee, provided. Crawford used maps and tokens from Avalon Hill's Panzer Leader when developing the game. To compensate for the computer's weak artificial intelligence, he gave it twice as many tanks as the player and deleted U-shaped lakes from the map. There are several terrain types: forests, lakes, plains, rough and depressed ground, and also roads which allow much faster movement. There are many types of tanks—different ones for the German and Russian side each—as well as stationary anti-tank guns. At the end of the game, a point system determines whether the player has won or lost the game.
Development
Crawford created the game, first called Wargy I, in FORTRAN for the IBM 1130 from May to September 1976, reporting that it defeated several experienced war gamers at a December 1976 convention. It was his first video game; he did not sell any copies, which he attributed to the IBM 1130 not being a consumer computer that war gamers would have. He ported it to a KIM-1, then the Commodore PET in December 1978. Crawford sold the PET version himself; as this version was programmed in BASIC, it was easy to port from one system to the other. By 1981, the game had been expanded and renamed into Tanktics, and was published by Avalon Hill under that name for the TRS-80, Apple II, and Atari 8-bit family.
Reception
Computer Gaming World in 1982 reported that Tankticss computer opponent was not as intelligent as the manual claimed, advising players to give themselves "poorer tanks" once they began beating it often. While disliking how the game handled line of sight, and bugs in the Apple II version (the review offered unofficial patches for the BASIC source code), the magazine recommended it for those seeking neither arcade action nor the complexity of Avalon Hill's Panzer games or Squad Leader. A 1991 survey in the magazine of strategy and war games gave Tanktics two and a half stars out of five.
Reviews
Moves #59, p32-32
References
External links
Tanktics at Atari Mania
1976 video games
Turn-based tactics video games
Apple II games
Atari 8-bit family games
Commodore PET games
Mainframe games
TRS-80 games
World War II video games
Chris Crawford (game designer) games
Video games developed in the United Sta |
https://en.wikipedia.org/wiki/Matt%20Curtin | Matt Curtin (born 1973) is a computer scientist and entrepreneur in Columbus, Ohio best known for his work in cryptography and firewall systems. He is the founder of Interhack Corporation, first faculty advisor of Open Source Club at The Ohio State University, and lecturer in the Department of Computer Science and Engineering at The Ohio State University, where he teaches a Common Lisp course. The author of two books, Developing Trust: Online Privacy and Security and Brute Force: Cracking the Data Encryption Standard.
Curtin's work includes helping to prove the weakness of the Data Encryption Standard and providing expert testimony in Blumofe v. Pharmatrak, in which a key ruling was made by the U.S. Court of Appeals for the First Circuit, showing how the Electronic Communications Privacy Act (ECPA) applies to Web technology.
References
External links
Matt Curtin's homepage
Interhack Corporation
1973 births
Computer systems researchers
American computer scientists
Cypherpunks
Living people
Ohio State University faculty
Businesspeople from Columbus, Ohio
Place of birth missing (living people)
Engineers from Ohio |
https://en.wikipedia.org/wiki/Business%20rules%20approach | Business rules are abstractions of the policies and practices of a business organization. In computer software development, the business rules approach is a development methodology where rules are in a form that is used by, but does not have to be embedded in, business process management systems.
The business rules approach formalizes an enterprise's critical business rules in a language that managers and technologists understand. Business rules create an unambiguous statement of what a business does with information to decide a proposition. The formal specification becomes information for process and rules engines to run.
Advantages
The adoption of business rules adds another tier to systems that automate business processes. Compared to traditional systems, this approach has the following major advantages,
lowers the cost incurred in the modification of business logic
shortens development time
rules are externalized and easily shared among multiple applications
changes can be made faster and with less risk
Business process automation
Business rules represent a natural step in the application of computer technology aimed at enhancing productivity in the workplace. Automated business processes that have business logic embedded inside often take substantial time to change, and such changes can be prone to errors. And in a world where the life cycle of business models has greatly shortened, it has become increasingly critical to be able to adapt to changes in external environments promptly. These needs are addressed by a business rules approach.
Business agility
Business rules enhance business agility. And the manageability of business processes also increases as rules become more accessible.
Technical details
The programs designed specifically to run business rules are called rule engines. More complete systems that support the writing, deployment and management of business rules are called business rules management systems (BRMSs).
Many commercial rule engines provide the Rete algorithm, a proprietary algorithm that embodies many of the principles of Rete. However, there are other execution algorithms such as the sequential algorithm (ILOG and Blaze Advisor terminology), algorithms for evaluating decision tables/trees, and algorithms tuned for hierarchical XML. The Rete algorithm is a stateful pattern matching algorithm designed to minimize the evaluation of repetitive tests across many objects/attributes and many rules. Different fields of usage are best for Rete-based and non-Rete-based execution algorithms. For simple stateless applications with minimal sharing of conditions across rules, a non-Rete-based execution algorithm (such as the sequential algorithm) may be preferable. For evaluating decision tables and trees, an algorithm that exploits the hierarchical relationships between the rule conditions may perform better than a simple Rete or sequential algorithm tuned for discrete rules.
Business rules can be expressed in conven |
https://en.wikipedia.org/wiki/Oliver%20Selfridge | Oliver Gordon Selfridge (10 May 1926 – 3 December 2008) was a pioneer of artificial intelligence. He has been called the "Father of Machine Perception."
Biography
Selfridge, born in England, was a grandson of Harry Gordon Selfridge, the founder of Selfridges department stores. His father was Harry Gordon Selfridge Jr. and his mother was a clerk at Selfridge's store. His parents had met, fallen in love, married and had children all in secret, and Oliver never met his grandfather, Harry Sr. He was educated at Malvern College, and, upon moving to the US, at Middlesex School in Concord, Massachusetts, before earning an S.B. from MIT in mathematics in 1945. He then became a graduate student of Norbert Wiener at MIT, but did not write up his doctoral research and never earned a Ph.D.
Marvin Minsky considered Selfridge to be one of his mentors, and Selfridge was one of the 11 attendees, with Minsky, of the Dartmouth workshop that is considered the founding event of artificial intelligence as a field.
Selfridge wrote important early papers on neural networks, pattern recognition, and machine learning, and his "Pandemonium" paper (1959) is generally recognized as a classic in artificial intelligence. In it, Selfridge introduced the notion of "demons" that record events as they occur, recognize patterns in those events, and may trigger subsequent events according to patterns they recognize. Over time, this idea gave rise to aspect-oriented programming.
In 1968, in their formative paper "The Computer as a Communication Device", J. C. R. Licklider and Robert Taylor introduced a concept known as an OLIVER (On-Line Interactive Vicarious Expediter and Responder), which was named in honor of Selfridge.
Selfridge spent his career at Lincoln Laboratory, MIT (where he was Associate Director of Project MAC), Bolt, Beranek and Newman, and GTE Laboratories where he became Chief Scientist. He served on the NSA Advisory Board for 20 years, chairing the Data Processing Panel. Selfridge retired in 1993.
In 2015, Duncan Campbell identified Selfridge as his "best source" for Campbell's 1980 reporting on US National Security Agency wiretapping activity at Menwith Hill, UK. Campbell described this operation in New Statesman as a "billion dollar phone tap".
Selfridge also authored four children's books: Sticks, Fingers Come In Fives, All About Mud, and Trouble With Dragons.
Selfridge was married and divorced twice and is survived by two daughters and two sons.
See also
Pandemonium architecture
Notes
Further reading
O. G. Selfridge. "Pandemonium: A paradigm for learning." In D. V. Blake and A. M. Uttley, editors, Proceedings of the Symposium on Mechanisation of Thought Processes, pages 511–529, London, 1959.
1926 births
2008 deaths
Artificial intelligence researchers
British cognitive scientists
English computer scientists
People educated at Malvern College
Massachusetts Institute of Technology School of Science alumni
Massachusetts Institute of Technology fac |
https://en.wikipedia.org/wiki/Recca | Recca is a 1992 scrolling shooter video game developed by KID and published by Naxat Soft for the Family Computer. Controlling the titular space fighter craft, the player is sent to counterattack an invading alien armada while avoiding collision with their projectiles and other obstacles. The ship has a powerful bomb at its disposal that can be used as shield and clear the screen of enemies and bullets when fully charged.
Known for pushing the Famicom hardware to the limits with its uncompromising high number of sprites and speed, Recca was created for a shooting game competition hosted by Naxat Soft called "Summer Carnival", which took place on July 17, 1992 and featured alongside the PC Engine CD-ROM² shooter Alzadick. It was programmed by Shinobu Yagawa, whose later works includes Battle Garegga, Ibara, Pink Sweets: Ibara Sorekara and Muchi Muchi Pork!. The game was released in Japan amid focus shifting to the Super Famicom, resulting in few copies sold when released to the market and is considered by gaming journalists as one of the rarest, most valuable and sought-after Famicom titles.
Recca received mostly positive reception from critics for pushing the Famicom to its limits; praise was given to its action, game modes, music and fun factor but criticism was geared towards the unsuitable difficulty for beginners and graphics. It was re-released worldwide on the 3DS Virtual Console via Nintendo eShop in 2012 and 2013, marking the game's first international appearance. Retrospective commentary has been positive and is regarded as a precursor to modern bullet hell games.
Gameplay
Recca is a fast-paced vertical-scrolling shooter game where the player takes control of the Recca415 space fighter craft in the year 2302, where an invading alien armada plans to destroy mankind after obliterating the Andromeda galaxy shortly after humans made a peace agreement with its inhabitants. The game features three modes of play: "Normal Game", "Score Attack" and "Time Attack". A fourth game mode, "Zanki Attack", is hidden and only accessible via cheat code.
In normal mode, the player must destroy incoming enemies and face bosses while avoiding collision with their bullets and other obstacles across four stages. The Recca ship can be equipped with five distinct main weapons, each with their own advantages and disadvantages. In addition, the ship can also be equipped with two satellite-like options by collecting five sub-weapons that fire in multiple directions. These power-up items are dropped from enemies after being destroyed and can be upgraded by collecting the respective weapon icon. Enemies also spawn 1UPs after destroying multiple enemy waves. Unique to the game is the charging shield: when not firing the main weapon for a brief time period, an energy shield is charged in front of the ship capable of absorbing standard enemy projectiles and obliterate any enemy caught within its blast radius when launched. Finishing the first loop in normal mode un |
https://en.wikipedia.org/wiki/Write%20%28Unix%29 | In Unix and Unix-like operating systems, is a utility used to send messages to another user by writing a message directly to another user's TTY.
History
The write command was included in the First Edition of the Research Unix operating system. A similar command appeared in Compatible Time-Sharing System.
Sample usage
The syntax for the write command is:
$ write user [tty]
message
The write session is terminated by sending EOF, which can be done by pressing Ctrl+D. The tty argument is only necessary when a user is logged into more than one terminal.
A conversation initiated between two users on the same machine:
$ write root pts/7
test
Will show up to the user on that console as:
Message from root@wiki on pts/8 at 11:19 ...
test
See also
List of Unix commands
talk (Unix)
wall (Unix)
References
Unix user management and support-related utilities
Standard Unix programs
Unix SUS2008 utilities |
https://en.wikipedia.org/wiki/International%20House%20World%20Organisation | International House World Organisation is a worldwide network of 160 language schools and teacher training institutes in more than 50 countries.
International House was founded in 1953 by John Haycraft and his wife Brita Haycraft in Cordoba (Spain), to provide an innovative approach to language teaching. At that time formal programmes of training for teachers of English as a Foreign Language were almost non-existent.
John Haycraft was the first to introduce formalised teacher training in 1962, and the course International House developed in the 1960s and 1970s became first the Royal Society of Arts Certificate in teaching English, and then the current CELTA training course organised by Cambridge ESOL.
Teaching at International House schools broadly follows what is often called the "communicative method", which focuses on student to student interaction as opposed to the teacher-centred approach of traditional language teaching. However, since the mid-nineties, this has been augmented into what is called 'principled eclecticism' to incorporate lexical, task-based and generally more 'function-based' approaches to language learning and teaching.
The International House affiliate network
All International House schools are independently owned affiliates which share the same philosophy, branding and many resources. All affiliates are regularly inspected by International House World Organisation approved inspectors for quality control purposes. Administration and control of the Organisation is maintained through a Board of Directors, an Executive Director and a Chief Operations Officer and staff.
The International House World Organisation also arranges annual academic and management conferences for affiliate Teachers and Directors.
International House also has the Online Teacher Training Institute (OTTI) offering teacher development by distance study. These courses are assessed by the International House Assessment Unit.
References
External links
IH World website
John Haycraft's publications
IH OTTI website
Cambridge English website
Language schools
Organisations based in the London Borough of Southwark |
https://en.wikipedia.org/wiki/Susan%20Barnes | Susan Barnes may refer to:
Sue Barnes (born 1952), Canadian politician
Susan Barnes (computing), Apple Computer executive
Susan Barnes (actress), in the TV series Titus
Susan Barnes Carson (born 1942), née Susan Barnes, American serial killer
Sue Barnes, a character in Peak Practice, played by Amelda Brown
Suzanne Paul, née Susan Barnes, TV personality |
https://en.wikipedia.org/wiki/Policy-based%20routing | In computer networking, policy-based routing (PBR) is a technique used to make routing decisions based on policies set by the network administrator.
When a router receives a packet it normally decides where to forward it based on the destination address in the packet, which is then used to look up an entry in a routing table. However, in some cases, there may be a need to forward the packet based on other criteria. For example, a network administrator might want to forward a packet based on the source address, not the destination address. This permits routing of packets originating from different sources to different networks even when the destinations are the same and can be useful when interconnecting several private networks.
Policy-based routing may also be based on the size of the packet, the protocol of the payload, or other information available in a packet header or payload.
In the Cisco IOS, PBR is implemented using route maps. Linux supports multiple routing tables since version 2.2. FreeBSD supports PBR using either IPFW, IPFilter or OpenBSD's PF.
Examples
PBR can be used to redirect traffic to a proxy server by using a PBR-aware L3-switch (router). In such deployment, specific source traffic (e.g. HTTP, FTP) can be redirected to a cache engine. This is known as virtual inline deployment.
Notes
References
External links
Policy routing Cisco Press article
Policy based routing with Linux (ONLINE edition)
Network overview by Rami Rosen
Routing |
https://en.wikipedia.org/wiki/List%20of%20BBS%20software | This is a list of notable bulletin board system (BBS) software packages.
Multi-platform
Citadel – originally written for the CP/M operating system, had many forks for different systems under different names.
CONFER – CONFER II on the MTS, CONFER U on Unix and CONFER V on VAX/VMS, written by Robert Parnes starting in 1975.
Mystic BBS – written by James Coyle with versions for Windows/Linux/ARM Linux/OSX. Past versions: MS-DOS and OS/2.
Synchronet – Windows/Linux/BSD, past versions: MS-DOS and OS/2.
WWIV – WWIV v5.x is supported on both Windows 7+ 32bit as well as Linux 32bit and 64bit. Written by Wayne Bell, included WWIVNet. Past versions: MS-DOS and OS/2.
Altos 68000
PicoSpan
Amiga based
Ami-Express – aka "/X", very popular in the crackers/warez software scene.
C-Net – aka "Cnet"
Apple II series
Diversi-Dial (DDial) – Chat-room atmosphere supporting up to 7 incoming lines allowing links to other DDial boards.
GBBS – Applesoft and assembler-based BBS program by Greg Schaeffer.
GBBS Pro – based on the ACOS or MACOS (modified ACOS) language.
Net-Works II – by Nick Naimo.
SBBS – Sonic BBS by Patrick Sonnek.
Apple Macintosh
Citadel – including Macadel, MacCitadel.
FirstClass (SoftArc)
Hermes
Second Sight
TeleFinder
Atari 8-bit computer
Atari Message Information System – and derivatives
Commodore computers
Blue Board – by Martin Sikes.
Superboard – by Greg Francis and Randy Schnedler.
C*Base – by Gunther Birznieks, Jerome P. Yoner, and David Weinehall.
C-Net DS2 – by Jim Selleck.
Color64 – by Greg Pfountz.
McBBS – by Derek E. McDonald.
CP/M
CBBS – The first ever BBS software, written by Ward Christensen.
Citadel
RBBS
TBBS
Microsoft Windows
Excalibur BBS
Maximus
Mystic BBS
MS-DOS and compatible
Celerity BBS
Citadel – including DragCit, Cit86, TurboCit, Citadel+
Ezycom – written by Peter Davies.
FBB (F6FBB) – packet radio BBS system, still in use.
GBBS (Graphics BBS) – used in the Melbourne area.
GT-Power
L.S.D. BBS – written by The Slavelord of The Humble Guys (THG).
The Major BBS
Maximus
McBBS – by Derek E. McDonald.
Opus-CBCS – first written by Wynn Wagner III.
PCBoard
PegaSys
ProBoard BBS – written by Philippe Leybaert (Belgium).
Pyroto Mountain
QuickBBS – written by Adam Hudson, with assistance by Phil Becker.
RBBS-PC
RemoteAccess – written by Andrew Milner.
Renegade – written by Cott Lang until 1997. Currently maintained by T.J. McMillen since 2003.
RoboBOARD/FX – written by Seth Hamilton.
Searchlight BBS (SLBBS)
Spitfire
SuperBBS – by Aki Antman and Risto Virkkala.
TBBS
TCL
Telegard
TriBBS
TAG
Virtual Advanced – also known as VBBS.
Waffle – written by Tom Dell, and supported UUCP (and Fidonet through extensions).
Wildcat! – originally by Mustang Software.
Worldgroup – The latest version of MajorBBS, the last released by Galacticomm.
OS/2
AdeptXBBS
Maximus
PCBoard
Virtual Advanced – also known as VBBS.
Tandy TRS-80
Forum 80
TBBS - by Phil Becker, for t |
https://en.wikipedia.org/wiki/WSES | WSES (channel 33) is a television station licensed to Tuscaloosa, Alabama, United States, serving the western portion of the Birmingham market as an affiliate of the digital multicast network Heroes & Icons. The station is owned by Howard Stirk Holdings, a partner company of the Sinclair Broadcast Group. WSES' advertising sales office is located on Golden Crest Drive in Birmingham, and its transmitter is located near County Road 38/Blue Creek Road, east of State Route 69 near Windham Springs.
WGWW (channel 40) in Anniston operates as a full-time satellite of WSES.
History
As an independent station
The station first signed on the air on October 27, 1965, as WCFT-TV. Originally operating as an independent station, it was the first television station to sign on in western Alabama. It was originally owned by Chapman Family Television, a consortium of eight Tuscaloosa businessmen who saw the benefits of operating a television station to serve west-central Alabama, in terms of both business and community service purposes.
However, the station did not return a profit suitable enough for its owners throughout its first two years of operation, an issue that led Chapman Family Television to sell the station to South Mississippi Broadcasting, Inc. (later Service Broadcasters) in 1967, becoming the company's second television station, after flagship WDAM-TV in the company's home market of Hattiesburg, Mississippi. The new owners rejuvenated WCFT by heavily investing in the station, purchasing new broadcasting and transmission equipment, and improving the station's image. In addition to carrying syndicated programming, WCFT-TV also aired network programs from CBS and NBC that were not cleared for broadcast in the Birmingham market by WAPI-TV (channel 13, now WVTM-TV), which WBMG (channel 42, now WIAT) did during that same timeframe.
As an exclusive CBS affiliate
On May 31, 1970, when WAPI-TV formally removed CBS programming and became the exclusive NBC affiliate for the Birmingham market, WCFT-TV became an exclusive CBS affiliate; WBMG in Birmingham (which had been affiliated with the network since it signed in October 1965, in a similar split arrangement with NBC) and WHMA-TV (channel 40) in Anniston (which had been an exclusive CBS affiliate since it debuted in October 1969) also became exclusive CBS affiliates, with each serving different portions of central Alabama.
Even though Tuscaloosa is southwest of Birmingham, CBS opted to retain its affiliation with WCFT because, at the time, WBMG suffered from a severely weak broadcast signal that did not provide adequate coverage to all of central Alabama. Despite Birmingham's relatively close proximity to the city, the WBMG signal barely covered Tuscaloosa. Even after channel 42 increased its transmitter power to 1.2 million watts in 1969, it provided marginal to non-existent coverage of much of west-central Alabama. As such, many cable providers in the western part of the market opted to carry WCFT rathe |
https://en.wikipedia.org/wiki/WGWW | WGWW (channel 40) is a television station licensed to Anniston, Alabama, United States, serving the eastern portion of the Birmingham market as an affiliate of the digital multicast network Heroes & Icons. The station is owned by Howard Stirk Holdings, a partner company of the Sinclair Broadcast Group. WGWW's transmitter is located at Bald Rock Mountain (off of Kelly Creek Road), near Moody in unincorporated southern St. Clair County.
WGWW operates as a full-time satellite of Tuscaloosa-licensed WSES (channel 33), whose advertising sales office is located on Golden Crest Drive in Birmingham. WGWW covers areas of northeastern Alabama that receive a marginal to non-existent over-the-air signal from WSES, although there is significant overlap between the two stations' contours otherwise, including in Birmingham proper. WGWW is a straight simulcast of WSES; on-air references to WGWW are limited to Federal Communications Commission (FCC)-mandated hourly station identifications during programming. Aside from the transmitter, WGWW does not maintain any physical presence locally in Anniston.
Through a time-brokerage agreement (TBA) with Sinclair, WGWW's second digital subchannel serves as a repeater of ABC affiliate WBMA-LD (channel 58), of which WGWW had served as a full-time satellite station on its main feed from September 1996 to September 2014.
History
Beginnings in Anniston
The station first signed on the air on October 26, 1969, as WHMA-TV. Originally operating as a primary CBS and secondary NBC affiliate, the station was initially owned by the Anniston Broadcasting Company, which was run by members of the family of Harry M. Ayers, who also owned the Anniston Star newspaper and local radio station WHMA (1390 AM and 100.5 FM, the FM station is now Atlanta-based WNNX-FM). It originally operated from studio facilities located on Noble Street in downtown Anniston.
Harry Mabry—who served as WHMA-TV's original general manager—came to Anniston from Birmingham, where he had served as news director at WBRC-TV (channel 6) for several years. Mabry already was familiar with Anniston, though, having worked as a staff announcer for WHMA-AM more than fifteen years prior to WHMA-TV's sign-on. Another former Birmingham personality who was part of the station's original staff was "Cousin Cliff" Holman, who left WAPI-TV (channel 13, now WVTM-TV) in 1969 after that station moved his cartoon showcase series, The Popeye Show, from weekday mornings to Saturday and Sunday mornings (due to declining ratings resulting from the show's move to a weekday morning slot and its switch from a mostly live broadcast to being pre-recorded the day before air several months beforehand) the previous year. Holman, who was also hired as its publicity director, resumed his program on WHMA-TV in the afternoons as The Cousin Cliff Show. However, the show was hampered by changes in the television industry and the Federal Communications Commission (FCC)'s decision in the early 1970s to p |
https://en.wikipedia.org/wiki/Radio%20format | A radio format or programming format (not to be confused with broadcast programming) describes the overall content broadcast on a radio station. The radio format emerged mainly in the United States in the 1950s, at a time when radio was compelled to develop new and exclusive ways to programming by competition with television. The formula has since spread as a reference for commercial radio programming worldwide.
A radio format aims to reach a more or less specific audience according to a certain type of programming, which can be thematic or general, more informative or more musical, among other possibilities. Radio formats are often used as a marketing tool and are subject to frequent changes.
Except for talk radio or sports radio formats, most programming formats are based on commercial music. However the term also includes the news, bulletins, DJ talk, jingles, commercials, competitions, traffic news, sports, weather and community announcements between the tracks.
Background
Even before World War II, radio stations in North America and Europe almost always adopted a generalist radio format.
However, the United States witnessed the growing strengthening of television over the radio as the major mass media in the country by the late 1940s. American television had more financial resources to produce generalist programs that provoked the migration of countless talents from radio networks to the new medium. Under this context, the radio was pressured to seek alternatives to maintain its audience and cultural relevance.
As a consequence, AM radios stations began to emerge in the United States and Canada – many of which "independents", that is not affiliated with the network – developed a format which targeted audiences with programming consisted of music, news, charismatic disc jockeys to directly attract a certain audience.
For example, by the 1960s, the Easy listening obtained a stable position on FM radio – a spectrum considered ideal for good music and high fidelity listening as it grew in popularity during that period – and the Middle of the road (MOR) rose as a radio industry term to discern radio stations that played mainstream pop songs from radio stations whose programming was geared towards teenagers and was dominated by rock and roll, the most popular musical genre of the period in the United States and which held the first successful radio format called Top-40. In reality, the Top-40 format was conscientiously prepared to attract the young audience, who was the main consumer of the records sold by the American record industry at that time. Soon, playlists became central to programming and radio formats, although the number of records in a playlist really depends on the format.
By the mid-1960s, American FM radio's penetration began achieving balance with AM radio since the Federal Communications Commission required that co-owned AM and FM stations be programmed independently from each other. This resulted in huge competition betwe |
https://en.wikipedia.org/wiki/List%20of%20FM%20Towns%20games | The FM Towns is a fourth generation home computer developed and manufactured by Fujitsu, first released only in Japan on 28 February, 1989. It was the fourth computer to be released under the Fujitsu brand, succeeding the FM-7 series. The following list contains all of the known games released commercially for the FM Towns platform.
Featuring an operating system based on MS-DOS called Towns OS, the FM Towns operates with both 3.5" floppy disks and CD-ROMs. Many add-ons were released including networking, SCSI, memory upgrades and CPU enhancements, among others that increased the performance of the system. A fifth-generation home video game console based on the FM Towns computer called FM Towns Marty was released exclusively for the Japanese market on 20 February 1993, featuring backward-compatibility with older FM Towns titles. Multiple revisions were later released that included several changes compared to the original model, with the last model being released in 1995 before being officially discontinued in the market on Summer 1997. A total of 500,000 FM Towns units were reportedly sold during its commercial life span, while 45,000 FM Towns Marty consoles were sold as of 31 December 1993.
Games
There are currently games on this list.
See also
Lists of video games
Notes
References
External links
List of FM Towns games at MobyGames
FM Towns games
FM Towns
FM Towns games |
https://en.wikipedia.org/wiki/David%20Mays | David Mays is the founder of The Source Magazine and co-founder of Hip Hop Weekly. He is the co-founder of Breakbeat, a multimedia podcast network launched in September 2021 that is dedicated to serving the interests and perspectives of the hip-hop community across the globe.
Mays created The Source in 1988 as a single-sheet newsletter while a Harvard undergraduate. It soon became a national magazine.
While at Harvard, Mays co-hosted a radio show on WHRB, Street Beat, using the name "Go-Go Dave." Mays' co-host was Jon Shecter, "J the Sultan of Rap." Mays made Shecter a partner in The Source, which provided news and information on hip-hop to listeners of the radio show. After graduation, Mays and Shecter brought The Source to New York, with classmate Ed Young and Harvard Law School graduate James Bernard as additional partners.
Mays, as publisher, guided the rapid growth of the magazine, fostering its role as the champion of and critical voice for hip-hop culture. The Source's “5 Mics” album rating system became the standard by which all hip-hop albums were measured. The magazine's "Unsigned Hype" column was responsible for discovering and helping launch the careers of The Notorious B.I.G, Common, Mobb Deep, DMX, and many more artists who would go on to become stars. In 1991, Mays created The Source Awards, which started as a feature on the TV show Yo! MTV Raps, and later became an independent annual production with some of the highest-rated TV specials for a hip-hop audience ever with the UPN Network and then on BET.
Mays partnered with the mayor and city of Miami to host a weekend of entertainment and community activities, in conjunction with The Source Awards in August 2004, that attracted over 50,000 attendees. The Source Awards Weekend generated over $50 million in tourist revenue for the city.
Mays built a stable of companies around The Source brand, including a compilation album series (The Source Presents: Hip Hop Hits), two weekly TV shows (The Source All Access, The Source Sound Lab), a mobile content download business and a clothing line, as well as foreign-language editions of the magazine: The Source France, The Source Japan and The Source Latino. Mays was the first entrepreneur to introduce hip-hop to Madison Avenue, opening the doors for Nike, Mountain Dew and other corporate brands to begin marketing to the hip-hop consumer.
In 1999, Mays created The Source Youth Foundation, which raised over $1 million to fund programs and organizations across the country using Hip-Hop to effectively reach at-risk, inner-city youth. Mays co-created the first national hip-hop political summit ("A Special Summit on Social Responsibility in the Hip-Hop Industry") in 2000 with the Reverend Al Sharpton and the National Action Network
References
American publishers (people)
American television producers
Harvard University alumni
American music journalists
Living people
American music industry executives
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Essbase | Essbase is a multidimensional database management system (MDBMS) that provides a platform upon which to build analytic applications. Essbase began as a product from Arbor Software, which merged with Hyperion Software in 1998. Oracle Corporation acquired Hyperion Solutions Corporation in 2007. Until late 2005 IBM also marketed an OEM version of Essbase as DB2 OLAP Server.
The database researcher E. F. Codd coined the term "on-line analytical processing" (OLAP) in a whitepaper
that set out twelve rules for analytic systems (an allusion to his earlier famous set of twelve rules defining the relational model). This whitepaper, published by Computerworld, was somewhat explicit in its reference to Essbase features, and when it was later discovered that Codd had been sponsored by Arbor Software, Computerworld withdrew the paper.
In contrast to "on-line transaction processing" (OLTP), OLAP defines a database technology optimized for processing human queries rather than transactions. The results of this orientation were that multidimensional databases oriented their performance requirements around a different set of benchmarks (Analytic Performance Benchmark, APB-1) than that of RDBMS (Transaction Processing Performance Council [TPC]).
Hyperion renamed many of its products in 2005, giving Essbase an official name of Hyperion System 9 BI+ Analytic Services, but the new name was largely ignored by practitioners. The Essbase brand was later returned to the official product name for marketing purposes, but the server software still carried the "Analytic Services" title until it was incorporated into Oracle's Business Intelligence Foundation Suite (BIFS) product.
In August 2005, Information Age magazine named Essbase as one of the 10 most influential technology innovations of the previous 10 years, along with Netscape, the BlackBerry, Google, virtualization, Voice Over IP (VOIP), Linux, XML, the Pentium processor, and ADSL. Editor Kenny MacIver said: "Hyperion Essbase was the multi-dimensional database technology that put online analytical processing on the business intelligence map. It has spurred the creation of scores of rival OLAP products – and billions of OLAP cubes".
History and motivation
Essbase was originally developed to address the scalability issues associated with spreadsheets such as Lotus 1-2-3 and Microsoft Excel. Indeed, the patent covering (now expired) Essbase uses spreadsheets as a motivating example to illustrate the need for such a system.
In this context, "multi-dimensional" refers to the representation of financial data in spreadsheet format. A typical spreadsheet may display time intervals along column headings, and account names on row headings. For example:
If a user wants to break down these values by region, for example, this typically involves the duplication of this table on multiple spreadsheets:
An alternative representation of this structure would require a three-dimensional spreadsheet grid, giving rise to the |
https://en.wikipedia.org/wiki/GEOS%20%288-bit%20operating%20system%29 | GEOS (Graphic Environment Operating System) is a discontinued operating system from Berkeley Softworks (later GeoWorks). Originally designed for the Commodore 64 with its version being released in 1986, enhanced versions of GEOS later became available in 1987 for the Commodore 128 and in 1988 for the Apple II series of computers. A lesser-known version was also released for the Commodore Plus/4.
GEOS closely resembles early versions of the classic Mac OS and includes a graphical word processor (geoWrite) and paint program (geoPaint).
A December 1987 survey by the Commodore-dedicated magazine Compute!'s Gazette found that nearly half of respondents used GEOS. For many years, Commodore bundled GEOS with its redesigned and cost-reduced C64, the C64C. At its peak, GEOS was the third-most-popular microcomputer operating system in the world in terms of units shipped, trailing only MS-DOS and Mac OS (besides the original Commodore 64's KERNAL).
Other GEOS-compatible software packages were available from Berkeley Softworks or from third parties, including a reasonably sophisticated desktop publishing application called geoPublish and a spreadsheet called geoCalc. While geoPublish is not as sophisticated as Aldus Pagemaker and geoCalc not as sophisticated as Microsoft Excel, the packages provide reasonable functionality, and Berkeley Softworks founder Brian Dougherty claimed the company ran its business using its own software on Commodore 8-bit computers for several years.
Development
Written by a group of programmers at Berkeley Softworks, the GEOS Design Team: Jim DeFrisco, Dave Durran, Michael Farr, Doug Fults, Chris Hawley, Clayton Jung, and Tony Requist, led by Dougherty, who cut their teeth on limited-resource video game machines such as the Atari 2600, GEOS was revered for what it could accomplish on machines with 64–128 kB of RAM memory and 1–2 MHz of 8-bit processing power.
Unlike many pieces of proprietary software for the C64 and C128, GEOS takes full advantage of many of the add-ons and improvements available for these systems. Commodore's 1351 mouse is supported by GEOS, as are its various RAM expansion units. GEOS 128 also fully supports the C128's 640×200 high-resolution VDC display mode through a compatible RGB monitor.
The C64 version of GEOS incorporates a built-in fast loader, called diskTurbo, that significantly increases the speed of drive access on the slow 1541. GEOS is the first Commodore software that could use a floppy disk as swap space or virtual memory. GEOS 128 can take advantage of the C128's enhanced "burst mode" in conjunction with the 1571 and 1581 drives. The Commodore version of GEOS uses a copy protection scheme that renders users' disks unbootable if it detects that the disk has been illegally duplicated.
Via Berkeley's special geoCable interface converter or other third-party interfaces to connect standard RS-232 or Centronics printers to the Commodore serial bus, GEOS supports a wide variety of printers, inc |
https://en.wikipedia.org/wiki/SURAN | The Survivable Radio Network (SURAN) project was sponsored by DARPA in the 1980s to develop a set of mobile ad hoc network (MANET) radio-routers, then known as "packet radios". It was a follow-on to DARPA's earlier PRNET project. The program began in 1983 with the following goals:
develop a small, low-cost, low-power radio that would support more sophisticated packet radio protocols than the DARPA Packet Radio project from the 1970s
develop and demonstrate algorithms that could scale to tens of thousands of nodes
develop and demonstrate techniques for robust and survivable packet networking in sophisticated electronic attacks.
A follow-on program in 1987, the Low-cost Packet Radio (LPR), attempted further innovations in mobile networking protocols, with design goals including:
management of radio spreading codes for security, and increasing capacity
new queue management and forwarding techniques for spread spectrum channels
scalability based on dynamic clustering
BBN Technologies provided the MANET protocols, and Rockwell provided radio hardware. The prototype radios produced in these programs were known as VRC-99 radios, and were used by the Department of Defense throughout the 1990s for experimentation.
References
See also
Survivable Low Frequency Communications System
Radio resource management |
https://en.wikipedia.org/wiki/List%20of%20Persian-language%20magazines | This is a list of magazines published in the Persian language.
See also
Media of Iran
List of newspapers in Iran
External links
List of Iranian magazines in Persian -
MagIran - Database of the Iranian Press
Persia Page - Persian Language Magazines
Magazines
Persian-language |
https://en.wikipedia.org/wiki/RedLightGreen | RedLightGreen was a database of bibliographic descriptions on the Web created by Research Libraries Group (RLG). It used a set of four million records extracted from OCLC's WorldCat database, and was designed to help novice users make selections from the vast bibliographic resources they would encounter in such a large set. RedLightGreen also allowed users to create citations for works found.
Work on RedLightGreen began in 2001 with funding from the Andrew W. Mellon Foundation. It was one of the earliest experiments with the Functional Requirements for Bibliographic Records which provides a structured view of bibliographic data. On July 1, 2006, RLG was merged with OCLC, and it was announced that the RedLightGreen service would be replaced by WorldCat, via Open WorldCat, available at WorldCat.org.
References
External links
Open WorldCat site
Library 2.0
Bibliographic databases and indexes |
https://en.wikipedia.org/wiki/Atomic%20%28magazine%29 | Atomic (or Atomic MPC) once was a monthly Australian magazine and online community that focused on computing and technology, with a great emphasis on gaming, modding and computer hardware. Atomic was marketed at technology enthusiasts and covered topics that were not normally found in mainstream PC publications, including video card and CPU overclocking, Windows registry tweaking, and programming. The magazine's strapline was 'Maximum Power Computing', reflecting the broad nature of its technology content.
In November 2012 publisher Haymarket Media Group announced that Atomic would close and be merged into sister monthly title PC & Tech Authority (beginning with the February 2013 issue of PCTA), although the Atomic online forums would continue to exist in their own right and under the Atomic brand.
In 2018, nextmedia, the successor of Haymarket Australia sold its computing assets to Future. PC & Tech Authority print content was absorbed into APC and online content was absorbed into TechRadar but the Atomic forums remained available until 11 June 2020.
History
With a small team of writers led by magazine founder and ex-editor Ben Mansill, who is also the founder of the magazine's only competitor, PC PowerPlay, the first issue of Atomic was published in February 2001. This team consisted of John Gillooly, Bennett Ring, Tim Dean and Daniel Rutter. Gillooly and Ring later left the magazine.
Atomic was originally published by AJB Publishing, but in July 2004 AJB was acquired by UK publisher Haymarket Media. The magazine was edited in 2005 and 2006 by Ashton Mills, who in the past has contributed to PC Authority, Atomic's sister publication. In 2006, Logan Booker took over as editor. In April 2005, Atomic reached the milestone of 50 issues, and the January 2006 issue celebrated its fifth birthday. Logan Booker announced at the end of August 2007 he would be stepping down, issue 81 being his last as editor. In October 2007, David Hollingworth became the new editor of the magazine.
Ben Mansill announced in October 2007 that he would be leaving Haymarket Media to pursue other interests in the publishing industry.
Atomic celebrated then release of its 100th issue on April 8, 2009. In late 2012 the magazine merged with PC & Tech Authority. In 2013, nextmedia acquired Haymarket Australia which effectively made PC & Tech Authority a sister title to PC PowerPlay.
The Atomic site and forums
Atomic's online forums were launched on the same day as the magazine. They had various PC gaming and technology sections, as well as a general chat area known as the "Green Room". As of January 2006, approximately 3,600,000 posts had been made across the forums' twenty-one sections. An active community section organises 'meets' and other events regularly.
Readers and subscribers to the magazine, as well as members of the online Atomic community were colloquially referred to as Atomicans.
In mid-2005, the site was revamped to include regular content, both unique to t |
https://en.wikipedia.org/wiki/Near-term%20digital%20radio | The Near-term digital radio (NTDR) program provided a prototype mobile ad hoc network (MANET) radio system to the United States Army, starting in the 1990s. The MANET protocols were provided by Bolt, Beranek and Newman; the radio hardware was supplied by ITT. These systems have been fielded by the United Kingdom as the High-capacity data radio (HCDR) and by the Israelis as the Israeli data radio. They have also been purchased by a number of other countries for experimentation.
The NTDR protocols consist of two components: clustering and routing. The clustering algorithms dynamically organize a given network into cluster heads and cluster members. The cluster heads create a backbone; the cluster members use the services of this backbone to send and receive packets. The cluster heads use a link-state routing algorithm to maintain the integrity of their backbone and to track the locations of cluster members.
The NTDR routers also use a variant of Open Shortest Path First (OSPF) that is called Radio-OSPF (ROSPF). ROSPF does not use the OSPF hello protocol for link discovery, etc. Instead, OSPF adjacencies are created and destroyed as a function of MANET information that is distributed by the NTDR routers, both cluster heads and cluster members. It also supported multicasting.
References
Wireless networking |
https://en.wikipedia.org/wiki/Lua | Lua or LUA may refer to:
Science and technology
Lua (programming language)
Latvia University of Agriculture
Last universal ancestor, in evolution
Ethnicity and language
Lua people, of Laos
Lawa people, of Thailand sometimes referred to as Lua
Lua language (disambiguation), several languages (including Lua’)
Luba-Kasai language, ISO 639 code
Lai (surname) (賴), Chinese, sometimes romanised as Lua
Places
Tenzing-Hillary Airport (IATA code), in Lukla, Nepal
One of the Duff Islands
People
Lua (goddess), a Roman goddess
Saint Lua (died c 609)
Lua Blanco (born 1987), Brazilian actress and singer
Lua Getsinger (1871–1916)
A member of Weki Meki band
Other uses
Lua (martial art), of Hawaii
"Lua" (song), by Bright Eyes |
https://en.wikipedia.org/wiki/Online%20magazine | An online magazine is a magazine published on the Internet, through bulletin board systems and other forms of public computer networks. One of the first magazines to convert from a print magazine format to an online only magazine was the computer magazine Datamation. Some online magazines distributed through the World Wide Web call themselves webzines. An ezine (also spelled e-zine) is a more specialized term appropriately used for small magazines and newsletters distributed by any electronic method, for example, by email. Some social groups may use the terms cyberzine and hyperzine when referring to electronically distributed resources. Similarly, some online magazines may refer to themselves as "electronic magazines", "digital magazines", or "e-magazines" to reflect their readership demographics or to capture alternative terms and spellings in online searches.
An online magazine shares some features with a blog and also with online newspapers, but can usually be distinguished by its approach to editorial control. Magazines typically have editors or editorial boards who review submissions and perform a quality control function to ensure that all material meets the expectations of the publishers (those investing time or money in its production) and the readership.
Many large print publishers now provide digital reproduction of their print magazine titles through various online services for a fee. These service providers also refer to their collections of these digital format products as online magazines, and sometimes as digital magazines.
Online magazines representing matters of interest to specialists or societies for academic subjects, science, trade, or industry are typically referred to as online journals.
Business model
Many general interest online magazines provide free access to all aspects of their online content, although some publishers have opted to require a subscription fee to access premium online article and/or multimedia content. Online magazines may generate revenue based on targeted search ads to website visitors, banner ads (online display advertising), affiliations to retail web sites, classified advertisements, product-purchase capabilities, advertiser directory links, or alternative informational/commercial purpose.
Due to their low cost and initial non-mainstream targets, The original online magazines, e-zines and disk magazines (or diskmags), may be seen as a disruptive technology to traditional publishing houses. The high cost of print publication and large Web readership has encouraged these publishers to embrace the World Wide Web as a marketing and content delivery system and another medium for delivering their advertisers' messages.
Growth
In the late 1990s, e-zine publishers began adapting to the interactive and informative qualities of the internet instead of simply duplicating print magazines on the web. Publishers of traditional print magazines and entrepreneurs with an eye to a potential readership in |
https://en.wikipedia.org/wiki/The%20Scene%20%28miniseries%29 | The Scene is a miniseries created by Jun Group. The series was financed through sponsorship deals and released for free on the web and on P2P networks under a Creative Commons license (attribution, no derivative works). Mitchell Reichgut, director of the series, says in an e-mail newsletter:
Season 1
The story centers on Drosan (Brian Sandro), a member of a fictitious scene group called CPX. Drosan is forced by circumstances to sell the pre-release films to commercial unauthorized distributors in Asia.
Each episode is filmed as a combination of a webcam video showing one of the actors superimposed on their desktop, showing e-mail, Internet Relay Chat (IRC) and instant messaging conversations. Most of the action takes place on the computer screen.
Cast
Joe Testa as Drosan (Brian Sandro)
Trice Able as melissbliss04 (Melissa)
Laura Minarich as danaburke123 (Dana Burke)
Dinarte Freitas as coda
Noah Rothman as slipknot (Johannes)
Jill Howell as trooper (Jodi)
Curt Rosloff as teflon (Ed Koenig)
Nick White as pyr0 (David)
Music featured in The Scene
The theme song is "Catch Me" by Maylynne.
Season 2
The Scene continued for a second season. Instead of focusing on warez culture, the second season took a look at illicit weapons trade happening online, as the director of the series saw the storyline of season 1 to be complete. The production pace of the series had changed from one monthly episode to much shorter weekly episodes.
Cast
Samantha Turvill as sng330 aka Houdini6 aka Lukai (Danika Li)
(Katerina Li)
Music featured in The Scene 2.0
Parody
Close to the initial release of The Scene, a spin-off parody called Teh Scene was released on the Internet. It imitated the format of the original series and overtly criticised it for its possible connections with groups opposed to unauthorized copying (and Sony sponsorship in general), mocking its amateurish approach to depicting people who copy and distribute software without authorization using the exaggerated mannerisms of script kiddies. "Teh Scene" featured a dynamic format (as opposed to The Scenes static presentation of a computer monitor, on which a small video and a few instant messaging windows would appear).
The parody also released its first episode for season 2 on November 1, 2006. From what is seen in the first episode of season 2, they are not going to have the same storyline or concept as seen in The Scene season 2.
Cast
Hydrosan
Jordan as T3hSuppl13r
Matt Jakubowski (Jaku) as Agent Gryphun Symthe
LordDusty as Agent Fitzgerald aka babygurl123
References
External links
Official Site
Jun Group Entertainment
The Scene on YouTube
The Scene on 0xDB.
The Scene on archive.org.
Warez
Screenlife films |
https://en.wikipedia.org/wiki/Torrespa%C3%B1a | Torrespaña () is a high reinforced concrete freestanding broadcasting tower in Madrid, Spain. It is the central and main transmission node of the terrestrial television and radio networks in the country as well as the station that covers the city and its metropolitan area. National and regional television channels and radio stations broadcast from there. The tower, currently owned by Cellnex, is located in a depression at the Salamanca district near the M30 highway.
Torrespaña is also the name of the television production center at the foot of the tower where the central news services of Televisión Española (TVE) are located. Both facilities were built jointly by Radiotelevisión Española (RTVE) on the occasion of the 1982 FIFA World Cup.
Characteristics
Torrespaña is a high reinforced concrete freestanding broadcasting tower that reaches with the antenna on top. Its shaft supports eight floors and more than four hundred different antennas. Despite its height and panoramic views, it is not open to the public.
Torrespaña is the central and main transmission node of the terrestrial television and radio networks in Spain. It is in visual contact with the production centers of the main national broadcasters. Through a radio link, they send their signal to the tower, which is in charge of relay it to all the repeaters in the country. Radiotelevisión Española (RTVE), Mediaset España, Atresmedia and PRISA, among others, broadcast their television channels and radio stations nationwide through Torrespaña.
The tower is also the broadcasting station that covers Madrid and its metropolitan area. Regional broadcasters, such as Radio Televisión Madrid (RTVM), also broadcast throughout the tower.
It is also used by the broadcasters as a link to receive the signal from remote broadcasts.
History
Torrespaña was built as part of the infrastructure works for the 1982 FIFA World Cup, which allowed Televisión Española (TVE) –who held the monopoly on television broadcasting in the country and was in charge of producing the official live television feed of the event– to carry out a major modernization with the construction of the broadcasting tower and the production center at its foot. Both facilities were designed by RTVE's architect Emilio Fernández Martínez de Velasco.
Construction work on the tower began on 17 February 1981 and was completed in just twelve months. It was carried out by the temporary union of the companies Dragados and Agroman and it costed 350 million pesetas. The freestanding construction technique used was pioneering, as it had never been used before, and it makes the tower stand by its own weight. The idea of installing a revolving restaurant in the tower was initially considered, but was soon rejected for safety and economic reasons.
The tower and the production center were inaugurated on 7 June 1982 by the King and the Queen of Spain, although the tower was in operation since the night of 18 May. The production center, which served |
https://en.wikipedia.org/wiki/Rough%20set | In computer science, a rough set, first described by Polish computer scientist Zdzisław I. Pawlak, is a formal approximation of a crisp set (i.e., conventional set) in terms of a pair of sets which give the lower and the upper approximation of the original set. In the standard version of rough set theory (Pawlak 1991), the lower- and upper-approximation sets are crisp sets, but in other variations, the approximating sets may be fuzzy sets.
Definitions
The following section contains an overview of the basic framework of rough set theory, as originally proposed by Zdzisław I. Pawlak, along with some of the key definitions. More formal properties and boundaries of rough sets can be found in Pawlak (1991) and cited references. The initial and basic theory of rough sets is sometimes referred to as "Pawlak Rough Sets" or "classical rough sets", as a means to distinguish from more recent extensions and generalizations.
Information system framework
Let be an information system (attribute–value system), where is a non-empty, finite set of objects (the universe) and is a non-empty, finite set of attributes such that for every . is the set of values that attribute may take. The information table assigns a value from to each attribute and object in the universe .
With any there is an associated equivalence relation :
The relation is called a -indiscernibility relation. The partition of is a family of all equivalence classes of and is denoted by (or ).
If , then and are indiscernible (or indistinguishable) by attributes from .
The equivalence classes of the -indiscernibility relation are denoted .
Example: equivalence-class structure
For example, consider the following information table:
{| class="wikitable" style="text-align:center; width:30%" border="1"
|+ Sample Information System
! Object !! !! !! !! !!
|-
!
| 1 || 2 || 0 || 1 || 1
|-
!
| 1 || 2 || 0 || 1 || 1
|-
!
| 2 || 0 || 0 || 1 || 0
|-
!
| 0 || 0 || 1 || 2 || 1
|-
!
| 2 || 1 || 0 || 2 || 1
|-
!
| 0 || 0 || 1 || 2 || 2
|-
!
| 2 || 0 || 0 || 1 || 0
|-
!
| 0 || 1 || 2 || 2 || 1
|-
!
| 2 || 1 || 0 || 2 || 2
|-
!
| 2 || 0 || 0 || 1 || 0
|}
When the full set of attributes is considered, we see that we have the following seven equivalence classes:
Thus, the two objects within the first equivalence class, , cannot be distinguished from each other based on the available attributes, and the three objects within the second equivalence class, , cannot be distinguished from one another based on the available attributes. The remaining five objects are each discernible from all other objects.
It is apparent that different attribute subset selections will in general lead to different indiscernibility classes. For example, if attribute alone is selected, we obtain the following, much coarser, equivalence-class structure:
Definition of a rough set
Let be a target set that we wish to represent using attribute subset ; that is, we are told that an arbitrary set of object |
https://en.wikipedia.org/wiki/Carfax%20%28company%29 | CARFAX, Inc. is an American company that provides vehicle data to individuals and businesses. Its most well-known product is the CARFAX Vehicle History Report. Their other products include vehicle listings, car valuation, and buying and maintenance advice.
History
CARFAX was founded in Columbia, Missouri in 1984 by Ewin Barnett III and Robert Daniel Clark. In 1986, by working closely with the Missouri Automobile Dealers Association, the company offered an early version of the CARFAX vehicle history report to the dealer market. These reports were developed with a database of 10,000 records and distributed via fax. In December 1996, the company launched its website as part of an effort to sell its reports directly to consumers.
CARFAX has undergone several ownership changes since its founding. In the fall of 1999, Carfax became a wholly owned subsidiary of R.L. Polk & Company. In 2013, IHS acquired Polk and CARFAX. In March 2016, IHS had a merger of equals with Markit, becoming IHS Markit. On February 28, 2022, S&P Global purchased IHS Markit, and CARFAX became a brand in the company's newly formed S&P Global Mobility business unit.
Products and services
Vehicle history reports
The CARFAX Vehicle History Report is the company's best-known product. A CARFAX Report can provide information about the number of owners a used car has had, accidents it has been in, title issues, whether it was a fleet vehicle, and its maintenance record, among other aspects of its history.
Information sourcing
CARFAX claims to have access to over 30 billion records from more than 131,000 sources, including motor vehicle departments for the 50 U.S. states and the 10 Canadian provinces. The company's information sources include U.S. state title and registration records, auto and salvage auctions, Canadian motor vehicle records, rental and fleet vehicle companies, consumer protection agencies, state inspection stations, extended warranty companies, insurance companies, fire and police departments, manufacturers, inspection companies, service and repair facilities, dealers and import/export companies.
CARFAX lists only information that is reported to them. Hence, consumers should not take these reports to be an exhaustive accident history. Not all accidents are disclosed and CARFAX uses the language "no accidents have been reported to CARFAX," the emphasis being on "reported". Consumers should not rely on CARFAX alone when checking out a used vehicle.
Although CARFAX continuously expands its database and resources, some information is not allowed to be provided. Under the 1994 U.S. Drivers Privacy Protection Act, personal information such as names, telephone numbers and addresses of current or previous owners are neither collected nor reported. CARFAX does not have access to every facility and mistakes are sometimes made by those who input data. In the event information is disputed but cannot be verified, CARFAX allows consumers and dealerships to add information to i |
https://en.wikipedia.org/wiki/Mehrotra%20predictor%E2%80%93corrector%20method | Mehrotra's predictor–corrector method in optimization is a specific interior point method for linear programming. It was proposed in 1989 by Sanjay Mehrotra.
The method is based on the fact that at each iteration of an interior point algorithm it is necessary to compute the Cholesky decomposition (factorization) of a large matrix to find the search direction. The factorization step is the most computationally expensive step in the algorithm. Therefore, it makes sense to use the same decomposition more than once before recomputing it.
At each iteration of the algorithm, Mehrotra's predictor–corrector method uses the same Cholesky decomposition to find two different directions: a predictor and a corrector.
The idea is to first compute an optimizing search direction based on a first order term (predictor). The step size that can be taken in this direction is used to evaluate how much centrality correction is needed. Then, a corrector term is computed: this contains both a centrality term and a second order term.
The complete search direction is the sum of the predictor direction and the corrector direction.
Although there is no theoretical complexity bound on it yet, Mehrotra's predictor–corrector method is widely used in practice. Its corrector step uses the same Cholesky decomposition found during the predictor step in an effective way, and thus it is only marginally more expensive than a standard interior point algorithm. However, the additional overhead per iteration is usually paid off by a reduction in the number of iterations needed to reach an optimal solution. It also appears to converge very fast when close to the optimum.
Derivation
The derivation of this section follows the outline by Nocedal and Wright.
Predictor step - Affine scaling direction
A linear program can always be formulated in the standard form
where and define the problem with constraints and equations while is a vector of variables.
The Karush-Kuhn-Tucker (KKT) conditions for the problem are
where and whence .
These conditions can be reformulated as a mapping as follows
The predictor-corrector method then works by using Newton's method to obtain the affine scaling direction. This is achieved by solving the following system of linear equations
where , defined as
is the Jacobian of F.
Thus, the system becomes
Centering step
The average value of the products constitute an important measure of the desirability of a certain set (the superscripts denote the value of the iteration number, , of the method). This is called the duality measure and is defined by
For a value of the centering parameter, the centering step can be computed as the solution to
Corrector step
Considering the system used to compute the affine scaling direction defined in the above, one can note that taking a full step in the affine scaling direction results in the complementarity condition not being satisfied:
As such, a system can be defined to compute a step that attempts |
https://en.wikipedia.org/wiki/Optical%20neural%20network | An optical neural network is a physical implementation of an artificial neural network with optical components. Early optical neural networks used a photorefractive Volume hologram to interconnect arrays of input neurons to arrays of output with synaptic weights in proportion to the multiplexed hologram's strength. Volume holograms were further multiplexed using spectral hole burning to add one dimension of wavelength to space to achieve four dimensional interconnects of two dimensional arrays of neural inputs and outputs. This research led to extensive research on alternative methods using the strength of the optical interconnect for implementing neuronal communications.
Some artificial neural networks that have been implemented as optical neural networks include the Hopfield neural network and the Kohonen self-organizing map with liquid crystal spatial light modulators Optical neural networks can also be based on the principles of neuromorphic engineering, creating neuromorphic photonic systems. Typically, these systems encode information in the networks using spikes, mimicking the functionality of spiking neural networks in optical and photonic hardware. Photonic devices that have demonstrated neuromorphic functionalities include (among others) vertical-cavity surface-emitting lasers, integrated photonic modulators, optoelectronic systems based on superconducting Josephson junctions or systems based on resonant tunnelling diodes.
Electrochemical vs. optical neural networks
Biological neural networks function on an electrochemical basis, while optical neural networks use electromagnetic waves. Optical interfaces to biological neural networks can be created with optogenetics, but is not the same as an optical neural networks. In biological neural networks there exist a lot of different mechanisms for dynamically changing the state of the neurons, these include short-term and long-term synaptic plasticity. Synaptic plasticity is among the electrophysiological phenomena used to control the efficiency of synaptic transmission, long-term for learning and memory, and short-term for short transient changes in synaptic transmission efficiency. Implementing this with optical components is difficult, and ideally requires advanced photonic materials. Properties that might be desirable in photonic materials for optical neural networks include the ability to change their efficiency of transmitting light, based on the intensity of incoming light.
Rising Era of Optical Neural Networks
With the increasing significance of computer vision in various domains, the computational cost of these tasks has increased, making it more important to develop the new approaches of the processing acceleration. Optical computing has emerged as a potential alternative to GPU acceleration for modern neural networks, particularly considering the looming obsolescence of Moore's Law. Consequently, optical neural networks have garnered increased attention in the research |
https://en.wikipedia.org/wiki/ECRYPT | ECRYPT (European Network of Excellence in Cryptology) was a 4-year European research initiative launched on 1 February 2004 with the stated objective of promoting the collaboration of European researchers in information security, and especially in cryptology and digital watermarking.
ECRYPT listed five core research areas, termed "virtual laboratories": symmetric key algorithms (STVL), public key algorithms (AZTEC), protocol (PROVILAB), secure and efficient implementations (VAMPIRE) and watermarking (WAVILA).
In August 2008 the network started another 4-year phase as ECRYPT II.
ECRYPT II products
Yearly report on algorithms and key lengths
During the project, algorithms and key lengths were evaluated yearly. The most recent of these documents is dated 30 September 2012.
Key sizes
Considering the budget of a large intelligence agency to be about US$300 million for a single ASIC machine, the recommended minimum key size is 84 bits, which would give protection for a few months. In practice, most commonly used algorithms have key sizes of 128 bits or more, providing sufficient security also in the case that the chosen algorithm is slightly weakened by cryptanalysis.
Different kinds of keys are compared in the document (e.g. RSA keys vs. EC keys). This "translation table" can be used to roughly equate keys of other types of algorithms with symmetric encryption algorithms. In short, 128 bit symmetric keys are said to be equivalent to 3248 bits RSA keys or 256-bit EC keys. Symmetric keys of 256 bits are roughly equivalent to 15424 bit RSA keys or 512 bit EC keys. Finally 2048 bit RSA keys are said to be equivalent to 103 bit symmetric keys.
Among key sizes, 8 security levels are defined, from the lowest "Attacks possible in real-time by individuals" (level 1, 32 bits) to "Good for the foreseeable future, also against quantum computers unless Shor's algorithm applies" (level 8, 256 bits). For general long-term protection (30 years), 128 bit keys are recommended (level 7).
Use of specific algorithms
Many different primitives and algorithms are evaluated. The primitives are:
symmetric encryption algorithms such as 3DES and AES;
block cipher modes of operation such as ECB, CBC, CTR and XTS;
authenticated encryption methods such as GCM;
stream ciphers RC4, eSTREAM and SNOW 2.0;
hashing algorithms MD5, RIPEMD-128/160, SHA-1, SHA-2 and Whirlpool;
MAC algorithms HMAC, CBC-MAC and CMAC;
asymmetric encryption algorithms ElGamal and RSA;
key exchange schemes and algorithms such as SSH, TLS, ISO/IEC 11770, IKE and RFC 5114;
key encapsulation mechanisms RSA-KEM and ECIES-KEM;
signature schemes such as RSA-PSS, DSA and ECDSA; and
public key authentication and identification algorithm GQ.
Note that the list of algorithms and schemes is non-exhaustive (the document contains more algorithms than are mentioned here).
Main Computational Assumptions in Cryptography
This document, dated 11 January 2013, provides "an exhaustive overview of every |
https://en.wikipedia.org/wiki/Bingolotto | Bingolotto is a Swedish primetime television lottery game show that was first broadcast 1989 on local TV and since 1991 nationwide on the Swedish network TV4. The show is a collaboration work between Swedish TV channel TV4, the Swedish lottery game company Folkspel and the Swedish sports life. The show premiered on 16 January 1989 on the local TV channel Kållevisionen with the highly popular Leif "Loket" Olsson as show host. Since the beginning, the show has given 16 billion Swedish krona to the Swedish sports life centre.
History
In January 1989, Bingolotto premiered in Gothenburg, introduced by Leif "Loket" Olsson. The programme became very popular in this area and 10,000 lottery tickets were sold to every episode between 1989 and 1991. In the autumn of 1990, the game show's owner and C.E.O. Gert Eklund started his collaboration with TV4 to start broadcasting the show nationwide. Olsson, who had built the game and company together with Eklund in 1988, owned a 25 percent share of the game but was bought out in 1999.
On 19 October 1991, Bingolotto premiered nationwide on TV4, still hosted by Olsson. The premiere episode was watched by 1.3 million viewers in Sweden, a surprisingly high viewing figure. From October 1991 to March 1992, Bingolotto'''s viewing figures rose from 1.3 million viewers to 2.1 million. The success of the show was positively associated with the popularity of host Leif "Loket" Olsson.
In 1992, Olsson received the television award The Lennart Hyland TV Prize for Best Male Show Host of the Year. Loket received this prize again in 1994 and 1997. In 1993, Loket received the prize "Årets Göteborgare" (Gothenburg Citizen of the Year).
In 1994, Olsson attracted 3.5 million viewers to watch every single program throughout the whole year, a record-high viewing figure. In 1995, Olsson attracted 4.5 million viewers to every programme, the highest viewing figure that has been registered in Swedish TV.
In 1999, Olsson left the show and was replaced by Lasse Kronér. The viewing figure immediately crashed to only 900,000 viewers per programme, and many viewers and fans of the show wanted "Loket" to return. In January 2004, Kronér was fired and Olsson was asked to return briefly.
The price of the lottery ticket has been between 25 and 50 Swedish kronor, and in March 2005, one billion tickets had been sold since the beginning. The surplus is given to Swedish sport associations, a fact which is commonly believed to have increased the penetration of the show. 31.5 million Swedish kronor (approx £2.5 million) is the highest ever prize in the history of Bingolotto, won by a woman from Vara.
After Olsson's second retirement from the show in 2004, it was hosted by entertainer and musician , skiing athlete Gunde Svan, and TV-personality Rickard Olsson, none of whom were able to maintain the show's earlier popularity. A significant rise in popularity developed when the singer Lotta Engberg took over the hosting in autumn 2008. From autumn 201 |
https://en.wikipedia.org/wiki/BLE | BLE or Ble may refer to:
Ble (band), a pop-rock band from Greece
Ble., a trade abbreviation for Bletilla, an orchid genus
Bluetooth Low Energy, a wireless personal area network technology
Transport
Air
Borlänge Airport, in Dalarna, Sweden, by IATA code
Blue Line (airline), based in Paris, France, by ICAO code
Rail
Bessemer and Lake Erie Railroad, in the United States by reporting mark
Bramley (West Yorkshire) railway station, in Leeds, England, by National Rail code
Brotherhood of Locomotive Engineers, a railway labor union in the United States
Braunschweigische Landes-Eisenbahn-Gesellschaft, the German name of the Brunswick State Railway Company |
https://en.wikipedia.org/wiki/MAC%20flooding | In computer networking, a media access control attack or MAC flooding is a technique employed to compromise the security of network switches. The attack works by forcing legitimate MAC table contents out of the switch and forcing a unicast flooding behavior potentially sending sensitive information to portions of the network where it is not normally intended to go.
Attack method
Switches maintain a MAC table that maps individual MAC addresses on the network to the physical ports on the switch. This allows the switch to direct data out of the physical port where the recipient is located, as opposed to indiscriminately broadcasting the data out of all ports as an Ethernet hub does. The advantage of this method is that data is bridged exclusively to the network segment containing the computer that the data is specifically destined for.
In a typical MAC flooding attack, a switch is fed many Ethernet frames, each containing different source MAC addresses, by the attacker. The intention is to consume the limited memory set aside in the switch to store the MAC address table.
The effect of this attack may vary across implementations, however the desired effect (by the attacker) is to force legitimate MAC addresses out of the MAC address table, causing significant quantities of incoming frames to be flooded out on all ports. It is from this flooding behavior that the MAC flooding attack gets its name.
After launching a successful MAC flooding attack, a malicious user can use a packet analyzer to capture sensitive data being transmitted between other computers, which would not be accessible were the switch operating normally. The attacker may also follow up with an ARP spoofing attack which will allow them to retain access to privileged data after switches recover from the initial MAC flooding attack.
MAC flooding can also be used as a rudimentary VLAN hopping attack.
Counter measures
To prevent MAC flooding attacks, network operators usually rely on the presence of one or more features in their network equipment:
With a feature often called "port security" by vendors, many advanced switches can be configured to limit the number of MAC addresses that can be learned on ports connected to end stations. A smaller table of secure MAC addresses is maintained in addition to (and as a subset to) the traditional MAC address table.
Many vendors allow discovered MAC addresses to be authenticated against an authentication, authorization and accounting (AAA) server and subsequently filtered.
Implementations of IEEE 802.1X suites often allow packet filtering rules to be installed explicitly by an AAA server based on dynamically learned information about clients, including the MAC address.
Security features to prevent ARP spoofing or IP address spoofing in some cases may also perform additional MAC address filtering on unicast packets, however this is an implementation-dependent side-effect.
Additional security measures are sometimes applied along with |
https://en.wikipedia.org/wiki/Workspot | Workspot was the first Linux desktop Web Service, i.e. it provided Open Source personal computing without computer ownership. Founded by Greg Bryant, Gal Cohen, Kathy Giori, Curt Brune, Benny Soetarman, Bruce Robertson, and Asao Kamei, in 1999, it was the first application service to make use of Virtual Network Computing. Workspot also hosted a free Linux Desktop demo using VNC: 'one-click to Linux' It eventually began to charge for a remote, web-accessible, persistent desktop, and several desktop collaboration features. Workspot won Linux Journal's Best Web Application award for 2000. Badly hit by the dotcom crash, it ceased activity by 2005.
Workspot was based in downtown Palo Alto, California during the dotcom boom, and funded its free desktop service through wireless contracting: they may have been the first mobile web app shop, involved in creating the first mobile apps for Google, eBay, Barnes & Noble, Amazon, Metro Traffic etc., as well as client-server software for OmniSky and Palm.
Workspot released AES encryption patches for VNC.
Workspot's domain and name was sold in 2013 to Workspot, Inc.
References
Virtual Network Computing |
https://en.wikipedia.org/wiki/Network%20computing | Network computing is a generic term in computing which refers to computers or nodes working together over a network.
The two basic models of computing are:
1- centralized computing:- where computing is done at a central location, using terminals that are attached to a central computer.
2- decentralized computing:- where computing is done at various individual station or location and each system have power to run independently.
It may also mean:
Cloud computing, a kind of Internet-based computing that provides shared processing resources and data to devices on demand
Distributed computing
Virtual Network Computing |
https://en.wikipedia.org/wiki/Fredkin%20gate | The Fredkin gate (also CSWAP gate and conservative logic gate) is a computational circuit suitable for reversible computing, invented by Edward Fredkin. It is universal, which means that any logical or arithmetic operation can be constructed entirely of Fredkin gates. The Fredkin gate is a circuit or device with three inputs and three outputs that transmits the first bit unchanged and swaps the last two bits if, and only if, the first bit is 1.
Definition
The basic Fredkin gate is a controlled swap gate that maps three inputs onto three outputs . The C input is mapped directly to the C output. If C = 0, no swap is performed; maps to , and maps to . Otherwise, the two outputs are swapped so that maps to , and maps to . It is easy to see that this circuit is reversible, i.e., "undoes" itself when run backwards. A generalized n×n Fredkin gate passes its first n−2 inputs unchanged to the corresponding outputs, and swaps its last two outputs if and only if the first n−2 inputs are all 1.
The Fredkin gate is the reversible three-bit gate that swaps the last two bits if, and only if, the first bit is 1.
It has the useful property that the numbers of 0s and 1s are conserved throughout, which in the billiard ball model means the same number of balls are output as input. This corresponds nicely to the conservation of mass in physics, and helps to show that the model is not wasteful.
Truth functions with AND, OR, XOR, and NOT
The Fredkin gate can be defined using truth functions with AND, OR, XOR, and NOT, as follows:
Cout= Cin
where
Alternatively:
Cout= Cin
Completeness
One way to see that the Fredkin gate is universal is to observe that it can be used to implement AND, NOT and OR:
If , then .
If , then .
If and , then .
Example
Three-bit full adder (add with carry) using five Fredkin gates. The "g" garbage output bit is if , and if .
Inputs on the left, including two constants, go through three gates to quickly determine the parity. The 0 and 1 bits swap places for each input bit that is set, resulting in parity bit on the 4th row and inverse of parity on 5th row.
Then the carry row and the inverse parity row swap if the parity bit is set and swap again if one of the or input bits are set (it doesn't matter which is used) and the resulting carry output appears on the 3rd row.
The and inputs are only used as gate controls so they appear unchanged in the output.
Quantum Fredkin gate
On March 25, 2016, researchers from Griffith University and the University of Queensland announced they had built a quantum Fredkin gate that uses the quantum entanglement of particles of light to swap qubits. The availability of quantum Fredkin gates may facilitate the construction of quantum computers.
See also
Quantum computing
Quantum gate
Quantum circuit
Quantum programming
Toffoli gate, which is a controlled-controlled-NOT gate.
References
Further reading
Logic gates
Quantum gates
Reversible computing |
https://en.wikipedia.org/wiki/KNSD | KNSD (channel 39) is a television station in San Diego, California, United States, serving as the market's NBC outlet. It is owned and operated by the network's NBC Owned Television Stations alongside Poway-licensed Telemundo station KUAN-LD (channel 48). KNSD and KUAN-LD share studios on Granite Ridge Drive in the Serra Mesa section of San Diego; through a channel sharing agreement, the two stations transmit using KNSD's spectrum from an antenna southeast of Spring Valley.
KNSD's on-air branding, NBC 7 San Diego, is derived from its cable channel position in the market on Charter Spectrum, Cox Communications and AT&T U-verse. The station is also available on channel 39 on satellite providers DirecTV and Dish Network.
History
Early history
The station first signed on the air on November 14, 1965, as KAAR, owned by San Diego Telecasters. It was the first television station in the San Diego market to operate on the UHF band and was the market's first independent station. The station originally operated from a building that was once occupied by the National Pen Company, located in the neighborhood of Kearny Mesa, northeast of downtown San Diego. Initially broadcasting from 12 noon to either midnight or 12:30 a.m. (based on the length of its late movie), the station aired a mix of local and first-run syndicated programming, both vintage and more recent films, and reruns of several 1950s dramatic series. However, in the summer of 1966, KAAR cut its operating hours significantly, with sign-on time moved up to 5 p.m., and by that fall, the station was only broadcasting on weeknights with a 15-minute 7 p.m. newscast, a travelogue and a single black-and-white movie (which ran for a week at a time).
A short time later, in January 1967, KAAR made an arrangement with San Diego State College to air programming produced by the San Diego Area Instructional Television Authority from 9 a.m. to 4 p.m. daily, which was followed by two hours of cartoons; this lasted until the sign-on of educational station KEBS on June 12 of that year. Channel 39 then went dark and was subsequently sold to Western Telecasters Inc., controlled by the Texas-based Bass family, and returned to the air on February 2, 1968, as KCST (standing for "California San Diego Television").
For a four-year period from the late 1960s to the early 1970s, Western Telecasters tried to take the ABC affiliation from XETV (channel 6)–a station licensed across the Mexican border in Tijuana but which broadcast exclusively in English, with a studio facility based in San Diego. XETV had been San Diego's ABC affiliate since 1956 under a special arrangement between the Federal Communications Commission (FCC) and Mexican authorities, subject to renewal by the Commission every year. Upon the FCC granting its annual renewal to ABC/XETV in late 1968, Western Telecasters countered, claiming that the presence of KCST made it no longer necessary for an American television network to affiliate with a Mexican tele |
https://en.wikipedia.org/wiki/KFMB-TV | KFMB-TV (channel 8) is a television station in San Diego, California, United States, affiliated with CBS, The CW, and MyNetworkTV. Owned by Tegna Inc., it has studios on Engineer Road in the Kearny Mesa section of San Diego, and its transmitter is atop Mount Soledad in La Jolla.
History
The station first signed on the air on May 16, 1949. It was the first television station in the San Diego market. The station was founded by Jack O. Gross, who also owned local radio station KFMB 760 AM (now KGB). San Diego Mayor Harley E. Knox was present at the station's first broadcast. The station cost Gross $300,000 to build. KFMB-TV has been a primary CBS affiliate since its sign-on and is the only television station in the market that has never changed its network affiliation. In its early years, channel 8 also maintained secondary affiliations with ABC, NBC and the DuMont Television Network.
In October 1949, KFMB-TV signed an affiliation agreement with the short-lived Paramount Television Network. Channel 8 quickly became its strongest affiliate. The station received a network feed of Paramount programs that included among others, Hollywood Opportunity, Meet Me in Hollywood, Magazine of the Week, Time For Beany and Your Old Buddy. KFMB-TV aired six hours of Paramount programs each week. Since there was no technical transmission network to distribute Paramount programs to its affiliates, KFMB-TV instead carried the network's programming via a transmitter link from the broadcast tower of Paramount's Los Angeles affiliate KTLA atop Mount Wilson, from the KFMB-TV transmitter site on Mount Soledad.
Changes in ownership
In November 1950, Gross sold KFMB-AM-TV to John A. Kennedy, a former publisher of the San Diego Daily Journal newspaper. Three years later, Kennedy divested KFMB to a partnership of television producer Jack Wrather and industry executive Helen Alvarez. That same year, channel 8 lost its television monopoly in San Diego when two new stations went on the air—Tijuana-based XETV (channel 6) and San Diego–licensed KFSD-TV (channel 10, now KGTV), the latter of which assumed the NBC affiliation from channel 8. KFMB-TV continued to air ABC programs until 1956, when XETV was granted permission to take the ABC affiliation under a special agreement between the FCC and Mexican authorities, most notably the Secretariat of Communications and Public Works.
After the Wrather-Alvarez partnership broke up in 1957, Wrather kept the San Diego outlets and KERO-TV in upstate Bakersfield for his renamed broadcasting company, Marietta Broadcasting. In 1959, Wrather merged Marietta Broadcasting with Buffalo, New York–based Transcontinent Television Corporation. In 1964, as part of Transcontinent's exit from broadcasting, the KFMB stations were sold to Midwest Television, controlled by the family of Champaign, Illinois, banker August Meyer. In 1999, Midwest Television divested its other outlets, WCIA/WCFN in Champaign–Springfield and WMBD-AM-TV and WPBG in Peoria, I |
https://en.wikipedia.org/wiki/Radio%20Bart | "Radio Bart" is the thirteenth episode of the third season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on January 9, 1992. In the episode, Bart receives a microphone that transmits sound to nearby AM radios. To play a prank on the citizens of Springfield, he lowers a radio down a well and uses the microphone to trick the town into thinking a little boy is trapped there. The prank succeeds, but Bart remembers labelling the radio with his name, tries to retrieve it, and becomes trapped himself. Angry at being duped by Bart, the townspeople refuse to rescue him.
The episode was written by Jon Vitti and directed by Carlos Baeza.
Musician Sting guest starred in the episode as himself, though the producers originally approached Bruce Springsteen to appear. The episode features cultural references to charity singles such as "We Are the World". Since airing, "Radio Bart" has received a positive critical reception from television critics.
It acquired a Nielsen rating of 14.1 and was the highest-rated show on Fox the week it aired. It was nominated for an Emmy Award but lost to A Claymation Easter.
Plot
Homer sees a television commercial for the Superstar Celebrity Microphone — which can broadcast anyone's voice over AM radio — and impulsively buys one for Bart's birthday. At his party, Bart is crestfallen when he receives gifts such as a cactus, a label maker, and a new suit. At first, Bart dislikes the microphone, but he later uses it to play practical jokes, such as tricking Ned's sons, Rod and Todd, into believing that God is talking to them, eavesdropping on Lisa and Janey's conversations about boys, and convincing Homer that Martians are invading. He also uses the microphone to make it look like Mrs. Krabappel made flatulent noises.
Bart ends up losing the radio down the well, but plays this to his advantage, tricking the townspeople into thinking an orphan named Timmy O'Toole has fallen down the well. Although they are unable to rescue Timmy, since the well is too small to accommodate an adult, the entire town offers its love and moral support. Krusty persuades Sting to join other celebrities in recording a charity single, "We're Sending Our Love Down the Well".
Lisa catches Bart imitating Timmy's voice and reminds him that the townspeople will be angry at him for being duped, while correctly assuming that he put a "Property of Bart Simpson" label on the radio. For fear of reprisal, Bart tries to retrieve the radio after nightfall but falls to the bottom when policemen Eddie and Lou undo the rope Bart used to lower himself down the well. When the townspeople find Bart trapped there, he admits Timmy does not exist. Angry at being tricked, the townspeople refuse to rescue him.
After a tearful speech by Bart saying that there would be many things he would miss out on including what would happen in the family, Homer has finally had enough and decides to dig a tunnel and resc |
https://en.wikipedia.org/wiki/Portmap | The port mapper (rpc.portmap or just portmap, or rpcbind) is an Open Network Computing Remote Procedure Call (ONC RPC) service that runs on network nodes that provide other ONC RPC services.
Version 2 of the port mapper protocol maps ONC RPC program number/version number pairs to the network port number for that version of that program. When an ONC RPC server is started, it will tell the port mapper, for each particular program number/version number pair it implements for a particular transport protocol (TCP or UDP), what port number it is using for that particular program number/version number pair on that transport protocol. Clients wishing to make an ONC RPC call to a particular version of a particular ONC RPC service must first contact the port mapper on the server machine to determine the actual TCP or UDP port to use.
Versions 3 and 4 of the protocol, called the rpcbind protocol, map a program number/version number pair, and an indicator that specifies a transport protocol, to a transport-layer endpoint address for that program number/version number pair on that transport protocol.
The port mapper service always uses TCP or UDP port 111; a fixed port is required for it, as a client would not be able to get the port number for the port mapper service from the port mapper itself.
The port mapper must be started before any other RPC servers are started.
The port mapper service first appeared in SunOS 2.0.
Example portmap instance
This shows the different programs and their versions, and which ports they use. For example, it shows that NFS is running, both version 2 and 3, and can be reached at TCP port 2049 or UDP port 2049, depending on what transport protocol the client wants to use, and that the mount protocol, both version 1 and 2, is running, and can be reached at UDP port 644 or TCP port 645, depending on what transport protocol the client wants to use.
$ rpcinfo -p
program vers proto port
100000 2 tcp 111 portmapper
100000 2 udp 111 portmapper
100003 2 udp 2049 nfs
100003 3 udp 2049 nfs
100003 4 udp 2049 nfs
100003 2 tcp 2049 nfs
100003 3 tcp 2049 nfs
100003 4 tcp 2049 nfs
100024 1 udp 32770 status
100021 1 udp 32770 nlockmgr
100021 3 udp 32770 nlockmgr
100021 4 udp 32770 nlockmgr
100024 1 tcp 32769 status
100021 1 tcp 32769 nlockmgr
100021 3 tcp 32769 nlockmgr
100021 4 tcp 32769 nlockmgr
100005 1 udp 644 mountd
100005 1 tcp 645 mountd
100005 2 udp 644 mountd
100005 2 tcp 645 mountd
100005 3 udp 644 mountd
100005 3 tcp 645 mountd
Security concerns
The port mapper service was discovered to be used in Distributed Denial of Service (DDoS) attacks and Distributed Reflective Denial of Service (DRDoS) attacks in 2015. By using a spoofed port mapper request, an at |
https://en.wikipedia.org/wiki/KG-84 | The KG-84A and KG-84C are encryption devices developed by the U.S. National Security Agency (NSA) to ensure secure transmission of digital data. The KG-84C is a Dedicated Loop Encryption Device (DLED), and both devices are General-Purpose Telegraph Encryption Equipment (GPTEE). The KG-84A is primarily used for point-to-point encrypted communications via landline, microwave, and satellite systems. The KG-84C is an outgrowth of the U.S. Navy high frequency (HF) communications program and supports these needs. The KG-84A and KG-84C are devices that operate in simplex, half-duplex, or full-duplex modes. The KG-84C contains all of the KG-84 and KG-84A modes, plus a variable update counter, improved HF performance, synchronous out-of-sync detection, asynchronous cipher text, plain text, bypass, and European TELEX protocol. The KG-84 (A/C) is certified to handle data at all levels of security. The KG-84 (A/C) is a Controlled Cryptographic Item (CCI) and is unclassified when unkeyed. Keyed KG-84 equipment assumes the classification level equal to that of the keying material used.
Characteristics
KG-84 A/C physical characteristics
Height 7.8 in (198 mm)
Width 7.5 in (191 mm)
Depth 15 in (381 mm)
Weight 23 lb (10 kg)
Data rate
KG-84A 256 kbit/s synchronous and 9.6 kbit/s asynchronous
KG-84C Up to 64 kbit/s synchronous and 9.6 kbit/s asynchronous
Power
24 V DC, 15 W
115 V AC
220 V AC
Operating temperature
Operating temperature: 0 to 55 °C
MTBF
69,000 hours (7.9 years)
See also
NSA encryption systems
External links
More info on KG-84; see also .
National Security Agency encryption devices |
https://en.wikipedia.org/wiki/Enter | Enter or ENTER may refer to:
Enter key, on computer keyboards
Enter, Netherlands, a village
Enter (magazine), an American technology magazine for children 1983–1985
Enter (Finnish magazine), a Finnish computer magazine
Enter Air, a Polish airline
Equivalent National Tertiary Entrance Rank, an Australian school student assessment
Entertain
Music
Enter (Cybotron album) or the title song, 1983
Enter (Russian Circles album) or the title song, 2006
Enter (Within Temptation album) or the title song, 1997
Enter, an album by Bin-Jip, 2010
Enter, an album by DJ Kentaro, 2007
See also
Entrance (disambiguation)
Entry (disambiguation)
Access (disambiguation) |
https://en.wikipedia.org/wiki/Chauvenet%27s%20criterion | In statistical theory, Chauvenet's criterion (named for William Chauvenet) is a means of assessing whether one piece of experimental data — an outlier — from a set of observations, is likely to be spurious.
Derivation
The idea behind Chauvenet's criterion finds a probability band that reasonably contains all n samples of a data set, centred on the mean of a normal distribution. By doing this, any data point from the n samples that lies outside this probability band can be considered an outlier, removed from the data set, and a new mean and standard deviation based on the remaining values and new sample size can be calculated. This identification of the outliers will be achieved by finding the number of standard deviations that correspond to the bounds of the probability band around the mean () and comparing that value to the absolute value of the difference between the suspected outliers and the mean divided by the sample standard deviation (Eq.1).
where
is the maximum allowable deviation,
is the absolute value,
is the value of suspected outlier,
is sample mean, and
is sample standard deviation.
In order to be considered as including all observations in the sample, the probability band (centered on the mean) must only account for samples (if then only 2.5 of the samples must be accounted for in the probability band). In reality we cannot have partial samples so (2.5 for ) is approximately . Anything less than is approximately (2 if ) and is not valid because we want to find the probability band that contains observations, not samples. In short, we are looking for the probability, , that is equal to out of samples (Eq.2).
where
is the probability band centered on the sample mean and
is the sample size.
The quantity corresponds to the combined probability represented by the two tails of the normal distribution that fall outside of the probability band . In order to find the standard deviation level associated with , only the probability of one of the tails of the normal distribution needs to be analyzed due to its symmetry (Eq.3).
where
is probability represented by one tail of the normal distribution and
= sample size.
Eq.1 is analogous to the -score equation (Eq.4).
where
is the -score,
is the sample value,
is the mean of standard normal distribution, and
is the standard deviation of standard normal distribution.
Based on Eq.4, to find the (Eq.1) find the z-score corresponding to in a -score table. is equal to the score for . Using this method can be determined for any sample size. In Excel, can be found with the following formula: =ABS(NORM.S.INV(1/(4n))).
Calculation
To apply Chauvenet's criterion, first calculate the mean and standard deviation of the observed data. Based on how much the suspect datum differs from the mean, use the normal distribution function (or a table thereof) to determine the probability that a given data point will be at the value of the suspect data point. |
https://en.wikipedia.org/wiki/Actor%20model | The actor model in computer science is a mathematical model of concurrent computation that treats an actor as the basic building block of concurrent computation. In response to a message it receives, an actor can: make local decisions, create more actors, send more messages, and determine how to respond to the next message received. Actors may modify their own private state, but can only affect each other indirectly through messaging (removing the need for lock-based synchronization).
The actor model originated in 1973. It has been used both as a framework for a theoretical understanding of computation and as the theoretical basis for several practical implementations of concurrent systems. The relationship of the model to other work is discussed in actor model and process calculi.
History
According to Carl Hewitt, unlike previous models of computation, the actor model was inspired by physics, including general relativity and quantum mechanics. It was also influenced by the programming languages Lisp, Simula, early versions of Smalltalk, capability-based systems, and packet switching. Its development was "motivated by the prospect of highly parallel computing machines consisting of dozens, hundreds, or even thousands of independent microprocessors, each with its own local memory and communications processor, communicating via a high-performance communications network." Since that time, the advent of massive concurrency through multi-core and manycore computer architectures has revived interest in the actor model.
Following Hewitt, Bishop, and Steiger's 1973 publication, Irene Greif developed an operational semantics for the actor model as part of her doctoral research. Two years later, Henry Baker and Hewitt published a set of axiomatic laws for actor systems. Other major milestones include William Clinger's 1981 dissertation introducing a denotational semantics based on power domains and Gul Agha's 1985 dissertation which further developed a transition-based semantic model complementary to Clinger's. This resulted in the full development of actor model theory.
Major software implementation work was done by Russ Atkinson, Giuseppe Attardi, Henry Baker, Gerry Barber, Peter Bishop, Peter de Jong, Ken Kahn, Henry Lieberman, Carl Manning, Tom Reinhardt, Richard Steiger and Dan Theriault in the Message Passing Semantics Group at Massachusetts Institute of Technology (MIT). Research groups led by Chuck Seitz at California Institute of Technology (Caltech) and Bill Dally at MIT constructed computer architectures that further developed the message passing in the model. See Actor model implementation.
Research on the actor model has been carried out at California Institute of Technology, Kyoto University Tokoro Laboratory, Microelectronics and Computer Technology Corporation (MCC), MIT Artificial Intelligence Laboratory, SRI, Stanford University, University of Illinois at Urbana–Champaign, Pierre and Marie Curie University (University of Paris 6), |
https://en.wikipedia.org/wiki/Branch%20target%20predictor | In computer architecture, a branch target predictor is the part of a processor that predicts the target, i.e. the address of the instruction that is executed next, of a taken conditional branch or an unconditional branch instruction before the target of the branch instruction is computed by the execution unit of the processor.
Branch target prediction is not the same as branch prediction which attempts to guess whether a conditional branch will be taken or not-taken (i.e., binary).
In more parallel processor designs, as the instruction cache latency grows longer and the fetch width grows wider, branch target extraction becomes a bottleneck. The recurrence is:
Instruction cache fetches block of instructions
Instructions in block are scanned to identify branches
First predicted taken branch is identified
Target of that branch is computed
Instruction fetch restarts at branch target
In machines where this recurrence takes two cycles, the machine loses one full cycle of fetch after every predicted taken branch. As predicted branches happen every 10 instructions or so, this can force a substantial drop in fetch bandwidth. Some machines with longer instruction cache latencies would have an even larger loss. To ameliorate the loss, some machines implement branch target prediction: given the address of a branch, they predict the target of that branch. A refinement of the idea predicts the start of a sequential run of instructions given the address of the start of the previous sequential run of instructions.
This predictor reduces the recurrence above to:
Hash the address of the first instruction in a run
Fetch the prediction for the addresses of the targets of branches in that run of instructions
Select the address corresponding to the branch predicted taken
As the predictor RAM can be 5–10% of the size of the instruction cache, the fetch happens much faster than the instruction cache fetch, and so this recurrence is much faster. If it were not fast enough, it could be parallelized, by predicting target addresses of target branches.
See also
Indirect branch control (IBC)
Indirect branch prediction barrier (IBPB)
Indirect branch restricted speculation (IBRS)
Single thread indirect branch predictor (STIBP)
Further reading
External links
(EE461)
Instruction processing |
https://en.wikipedia.org/wiki/SHA-2 | SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published in 2001. They are built using the Merkle–Damgård construction, from a one-way compression function itself built using the Davies–Meyer structure from a specialized block cipher.
SHA-2 includes significant changes from its predecessor, SHA-1. The SHA-2 family consists of six hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256. SHA-256 and SHA-512 are novel hash functions computed with eight 32-bit and 64-bit words, respectively. They use different shift amounts and additive constants, but their structures are otherwise virtually identical, differing only in the number of rounds. SHA-224 and SHA-384 are truncated versions of SHA-256 and SHA-512 respectively, computed with different initial values. SHA-512/224 and SHA-512/256 are also truncated versions of SHA-512, but the initial values are generated using the method described in Federal Information Processing Standards (FIPS) PUB 180-4.
SHA-2 was first published by the National Institute of Standards and Technology (NIST) as a U.S. federal standard. The SHA-2 family of algorithms are patented in the U.S.. The United States has released the patent under a royalty-free license.
As of 2011, the best public attacks break preimage resistance for 52 out of 64 rounds of SHA-256 or 57 out of 80 rounds of SHA-512, and collision resistance for 46 out of 64 rounds of SHA-256.
Hash standard
With the publication of FIPS PUB 180-2, NIST added three additional hash functions in the SHA family. The algorithms are collectively known as SHA-2, named after their digest lengths (in bits): SHA-256, SHA-384, and SHA-512.
The algorithms were first published in 2001 in the draft FIPS PUB 180-2, at which time public review and comments were accepted. In August 2002, FIPS PUB 180-2 became the new Secure Hash Standard, replacing FIPS PUB 180-1, which was released in April 1995. The updated standard included the original SHA-1 algorithm, with updated technical notation consistent with that describing the inner workings of the SHA-2 family.
In February 2004, a change notice was published for FIPS PUB 180-2, specifying an additional variant, SHA-224, defined to match the key length of two-key Triple DES. In October 2008, the standard was updated in FIPS PUB 180-3, including SHA-224 from the change notice, but otherwise making no fundamental changes to the standard. The primary motivation for updating the standard was relocating security information about the hash algorithms and recommendations for their use to Special Publications 800-107 and 800-57. Detailed test data and example message digests were also removed from the standard, and provided as separate documents.
In January 2011, NIST published SP800-131A, which specified a move from the then-current minimum of 80-bit security |
https://en.wikipedia.org/wiki/Gippsland%20Lakes | The Gippsland Lakes are a network of coastal lakes, marshes and lagoons in East Gippsland, Victoria, Australia covering an overall area of about between the rural towns of Lakes Entrance, Bairnsdale and Sale. The largest of the lakes are Lake Wellington (Gunai language: Murla), Lake King (Gunai: Ngarrang) and Lake Victoria (Gunai: Toonallook). The lakes are collectively fed by the Avon, Thomson, Latrobe, Mitchell, Nicholson and Tambo Rivers, and drain into the Bass Strait through a short canal about southwest of Lakes Entrance town centre.
History
The Gippsland Lakes were formed by two principal processes. The first is river delta alluvial deposition of sediment brought in by the rivers which flow into the lakes. Silt deposited by this process forms into long jetties which can run many kilometres into a lake, as exemplified by the Mitchell River silt jetties that run into Lake King. The second process is the action of sea current in Bass Strait which created the Ninety Mile Beach and cut off the river deltas from the sea.
Once the lakes were closed off a new cycle started, whereby the water level of the lakes would gradually rise until the waters broke through the barrier beach and the level would drop down until it equalised with sea-level. Eventually the beach would close-off the lakes and the cycle would begin anew. Sometimes it would take many years before a new channel to the sea was formed and not necessarily in the same place as the last one.
In 1889, a wall was built to fix the position of a naturally occurring channel between the lakes and the ocean at Lakes Entrance, to stabilise the water level, create a harbour for fishing boats and open up the lakes to shipping. This entrance needs to be dredged regularly, or the same process that created the Gippsland Lakes would render the entrance too shallow for seagoing vessels to pass through.
Due to flooding in 2011, Gippsland Lakes experienced blooms of bioluminescent Noctiluca scintillans.
Overview
Tourism
The Gippsland Lakes provide a major hub for tourism, particularly for recreational boating and fishing enthusiasts. The lakes network can be explored by cruise, water taxi, or boat and kayak hire. On the fringes of the lakes are several tourist towns that swell to support the tourist trade, particularly in the summer months.
Lakes Entrance is the largest of the towns on the lakes with a population of 4,500. The town is well serviced with resorts, hotels and facilities. It is located with easy access to both the lakes network and the surf beach on Ninety Mile Beach, which is patrolled each summer.
Metung is a small village located on the tip of a peninsula sitting in the Gippsland Lakes, surrounded almost completely by water. It is an upmarket tourist destination with many dining options and artisan galleries.
Much of Paynesville’s accommodation and infrastructure are located on the network of canals. One of the key attractions is Raymond Island, known for its koala populati |
https://en.wikipedia.org/wiki/Greenford%20branch%20line | The Greenford branch line is a Network Rail suburban railway line in west London, England. It runs northerly from a triangular junction with the Great Western Main Line west of West Ealing to a central bay platform at Greenford station, where it has cross-platform interchanges to the London Underground's Central line. A triangular junction near Greenford connects to the Acton–Northolt line (formerly the New North Main Line). The line serves mainly the suburbs of Ealing and Greenford.
History
The opening of the line in 1903 coincided with the opening of a station at Park Royal on the Acton–Northolt line to serve the Royal Agricultural Show held in the grounds of part of the Twyford Abbey Estate. The Show ran from 15 June 1903 to 4 July 1903 during which period trains operated a circular service to and from Paddington via Park Royal and Ealing. Normal services started on 2 May 1904 and the links to Greenford station were put in on 1 October 1904.
The loop formed by the GWML, the branch and the ANL is sometimes used for turning trains for operational reasons such as balancing wheel wear. On weekends in 2008 during engineering works on the West Coast Main Line the line was used by Virgin Trains' Euston-Birmingham International "Blockade Buster" service which ran to Euston via Willesden, Acton Main Line, Ealing Broadway, Greenford, High Wycombe, Banbury and Coventry using pairs of 5-car Voyager sets. On two Sundays in February 2010, Chiltern and Wrexham & Shropshire trains were diverted to Paddington via the line while engineering work blocked the route to Marylebone.
Locally the service is called the 'Push-and-pull', a term which dates from the days of steam, when the engine could not change ends at Greenford and so the locomotive pulled the carriages one way and pushed them on the return run (see GWR Autocoach). In the 1950s the service frequently ran with two auto-trailers, one either side of the engine.
During the 1960s and '70s the service was normally operated by a 'Bubble Car' two-carriage diesel railcar, although this was later reduced to a single carriage.
As , and have short platforms the maximum length of train that can be used is two cars.
In preparation for Crossrail, a new platform 5 has been constructed at West Ealing, and most services now terminate there.
In February 2022, GWR announced plans to test fast-charge battery technology on the route. As it is a low priority to be electrified, the only realistic alternative option to replace diesel powered rolling stock is with battery powered. The test will see the existing Class 165 units replaced by battery-electric multiple unit trains produced by Vivarail, with the company's Fast Charge equipment installed in the bay platform at West Ealing. This will entail the installation of a conductor rail that becomes live only when a train is above it. This is then used to charge the lithium-ion batteries on the train, a process that would take about ten minutes.
Current service
Th |
https://en.wikipedia.org/wiki/Gericom | Gericom was an Austrian computer equipment manufacturer, based in Linz, Upper Austria. Prior to being bought by bought by Taiwan-based Quanmax, Inc in 2008 and subsequently converted to Quanmax AG, the company received investment from the Oberlehner Private Foundation and Charles Dickson, an investor from Hong Kong.
History
The company was founded in 1990 by Hermann Oberlehner and went public as Gericom AG in 2000.
Gericom products were initially sold via chains such as Media Markt and Saturn. In 1998 a webshop was established, and later Gericom products were also sold in supermarkets such as Aldi, Hofer, Plus, and Lidl. The company was mostly popular in German-speaking countries of Europe.
A range of Gericom PC and laptops have been marketed for a few years via Aldi in England, high specification and a long support offer, the laptops are with Intel Centrino mobile technology.
In 2004, Gericom planned to sell nearly 25% of its shares to German computer manufacturer Medion, but the deal was later aborted by Gericom's founder Hermann Oberlehner.
Since 2007, sales figures of Gericom products dropped dramatically, issued stocks lost 93% of value between 2003 and 2008. The drastic decrease in sales was often pulled together with quality of Gericom products, that had deteriorated over the years. Gericom products often got very negative test results by computer magazines, often being the last one in comparison tests. In 2008, the annual revenue had dropped to 30 million Euro.
In 2008 the majority of Gericom's company shares (61.32 percent) were sold by Oberlehner and bought by Taiwanese computer manufacturer Quanmax, Inc. Gericom AG was then renamed to Quanmax AG, whose shares continue to be sold at the Frankfurt Stock Exchange in Germany. Quanmax AG experienced significant growth and generated a revenue of about 60 million Euro and employed over 150 people in 2009. Quanmax AG is developing its own products independently from its Taiwanese owner.
References
Companies based in Linz
Computer companies of Austria
Defunct computer hardware companies
Manufacturing companies of Austria |
https://en.wikipedia.org/wiki/Loose%20coupling | In computing and systems design, a loosely coupled system is one
in which components are weakly associated (have breakable relationships) with each other, and thus changes in one component least affect existence or performance of another component.
in which each of its components has, or makes use of, little or no knowledge of the definitions of other separate components. Subareas include the coupling of classes, interfaces, data, and services. Loose coupling is the opposite of tight coupling.
Advantages and disadvantages
Components in a loosely coupled system can be replaced with alternative implementations that provide the same services. Components in a loosely coupled system are less constrained to the same platform, language, operating system, or build environment.
If systems are decoupled in time, it is difficult to also provide transactional integrity; additional coordination protocols are required. Data replication across different systems provides loose coupling (in availability), but creates issues in maintaining consistency (data synchronization).
In integration
Loose coupling in broader distributed system design is achieved by the use of transactions, queues provided by message-oriented middleware, and interoperability standards.
Four types of autonomy, which promote loose coupling, are: reference autonomy, time autonomy, format autonomy, and platform autonomy.
Loose coupling is an architectural principle and design goal in service-oriented architectures; eleven forms of loose coupling and their tight coupling counterparts are listed in:
physical connections via mediator,
asynchronous communication style,
simple common types only in data model,
weak type system,
data-centric and self-contained messages,
distributed control of process logic,
dynamic binding (of service consumers and providers),
platform independence,
business-level compensation rather than system-level transactions,
deployment at different times,
implicit upgrades in versioning.
Enterprise Service Bus (ESB) middleware was invented to achieve loose coupling in multiple dimensions; however, overengineered and mispositioned ESBs can also have the contrary effect and create undesired tight coupling and a central architectural hotspot.
Event-driven architecture also aims at promoting loose coupling.
Methods for decreasing coupling
Loose coupling of interfaces can be enhanced by publishing data in a standard format (such as XML or JSON).
Loose coupling between program components can be enhanced by using standard data types in parameters. Passing customized data types or objects requires both components to have knowledge of the custom data definition.
Loose coupling of services can be enhanced by reducing the information passed into a service to the key data. For example, a service that sends a letter is most reusable when just the customer identifier is passed and the customer address is obtained within the service. This decouples services because se |
https://en.wikipedia.org/wiki/Const%20%28computer%20programming%29 | In some programming languages, const is a type qualifier (a keyword applied to a data type) that indicates that the data is read-only. While this can be used to declare constants, in the C family of languages differs from similar constructs in other languages in being part of the type, and thus has complicated behavior when combined with pointers, references, composite data types, and type-checking. In other languages, the data is not in a single memory location, but copied at compile time on each use. Languages which use it include C, C++, D, JavaScript, Julia, and Rust.
Introduction
When applied in an object declaration, it indicates that the object is a constant: its value may not be changed, unlike a variable. This basic use – to declare constants – has parallels in many other languages.
However, unlike in other languages, in the C family of languages the const is part of the type, not part of the object. For example, in C, declares an object x of int const type – the const is part of the type, as if it were parsed "(int const) x" – while in Ada, declares a constant (a kind of object) X of INTEGER type: the constant is part of the object, but not part of the type.
This has two subtle results. Firstly, const can be applied to parts of a more complex type – for example, int const * const x; declares a constant pointer to a constant integer, while int const * x; declares a variable pointer to a constant integer, and int * const x; declares a constant pointer to a variable integer. Secondly, because const is part of the type, it must match as part of type-checking. For example, the following code is invalid:
void f(int& x);
// ...
int const i;
f(i);
because the argument to f must be a variable integer, but i is a constant integer. This matching is a form of program correctness, and is known as const-correctness. This allows a form of programming by contract, where functions specify as part of their type signature whether they modify their arguments or not, and whether their return value is modifiable or not. This type-checking is primarily of interest in pointers and references – not basic value types like integers – but also for composite data types or templated types such as containers. It is concealed by the fact that the const can often be omitted, due to type coercion (implicit type conversion) and C being call-by-value (C++ and D are either call-by-value or call-by-reference).
Consequences
The idea of const-ness does not imply that the variable as it is stored in computer memory is unwritable. Rather, const-ness is a compile-time construct that indicates what a programmer should do, not necessarily what they can do. Note, however, that in the case of predefined data (such as char const * string literals), C const is often unwritable.
Distinction from constants
While a constant does not change its value while the program is running, an object declared const may indeed change its value while the program is running. A common example |
https://en.wikipedia.org/wiki/Sedris | SEDRIS (Synthetic Environment Data Representation and Interchange Specification) is an international data coding standard infrastructure technology created to represent environmental data in virtual environments. Environmental data represented by SEDRIS may be concrete, such as trees and mountains, or abstract, such as the behavior of light. The infrastructure frees users to place their focus on application development and also facilitates the exchange of data for reuse and wider scrutiny. Research into shared ways to represent environmental data was begun in the 1980s in order to permit distributed simulations to work together. SEDRIS was launched in 1994 by program managers of the United States Army's Simulation Training and Instrumentation Command and the US Department of Defense's Defense Advanced Research Projects Agency.
Standardization
SEDRIS has led to forming the series standards of
ISO/IEC 18023:2006(E) Information technology - SEDRIS -
ISO/IEC 18023-1:2006(E) Information technology - SEDRIS - Part 1: Functional specification
ISO/IEC 18023-2:2006(E) Information technology - SEDRIS - Part 2: Abstract transmittal format
ISO/IEC 18023-3:2006(E) Information technology - SEDRIS - Part 3: Transmittal format binary encoding
ISO/IEC 18024-4:2006(E) Information technology - SEDRIS language bindings - Part 4: C
ISO/IEC 18025:2005(E) Information technology - Environmental Data Coding Specification (EDCS)
ISO/IEC 18026:2006(E) Information technology - Spatial Reference Model (SRM)
ISO/IEC 18041-4:2005(E) Information technology - EDCS language bindings - Part 4: C
ISO/IEC 18042-4:2006(E) Information technology - Spatial Reference Model (SRM) language bindings - Part 4: C
See also
3D Computer Graphics
Environmental management system
Geographic information system
Glossary of Military Modeling & Simulation
Environment
Simulation Interoperability Standards Organization
References
External links
SEDRIS - Environmental Data Representation & Interchange (home page)
GIS software
Synthetic environment |
https://en.wikipedia.org/wiki/MA%C5%A4O | The Maťo (Matthew) was an 8-bit personal computer produced in the former Czechoslovakia by Štátny majetok Závadka š.p., Závadka nad Hronom, from 1989 to 1992. Their primary goal was to produce a personal computer as cheaply as possible, and therefore it was also sold as a self-assembly kit. It was basically a modified PMD 85, but without backward compatibility. This, combined with its late arrival to the market, made the MAŤO a commercial failure.
Specifications
MHB 8080A 2.048 MHz CPU
48 KB RAM
16 KB ROM
System monitor and built-in BASIC-G or simple games
Tape recorder interface
Monochromatic TV output
288×256 resolution
Built-in power supply
See also
PDM 85
Tesla (Czechoslovak company)
IQ 151
Didaktik
References
External links
Old-computers.com - Mato
Maťo (Czech)
Emulator of PMD 85 and compatibles for Win32
Home computers
Science and technology in Czechoslovakia |
https://en.wikipedia.org/wiki/SBS%20Aircraft | SBS Aircraft was an aviation company based in Kazakhstan. It ceased operations in 2001.
Code data
IATA Code: XE
ICAO Code: ALT
Callsign: Green Craft
Defunct airlines of Kazakhstan
Airlines disestablished in 2001 |
https://en.wikipedia.org/wiki/List%20of%20William%20Shakespeare%20screen%20adaptations | The Guinness Book of Records lists 410 feature-length film and TV versions of William Shakespeares plays, making Shakespeare the most filmed author ever in any language.
, the Internet Movie Database lists Shakespeare as having writing credit on 1,500 films, including those under production but not yet released. The earliest known production is King John from 1899.
Comedies
All's Well That Ends Well
As You Like It
The Comedy of Errors
Love's Labour's Lost
Measure for Measure
The Merchant of Venice
The Merry Wives of Windsor
A Midsummer Night's Dream
Much Ado About Nothing
The Taming of the Shrew
Twelfth Night
The Two Gentlemen of Verona
Tragedies
Antony and Cleopatra
Coriolanus
Hamlet
Julius Caesar
King Lear
Macbeth
Othello
Romeo and Juliet
Timon of Athens
Titus Andronicus
Troilus and Cressida
Histories
Henry IV, Part 1
Henry IV, Part 2
Henry V
Henry VI, Part 1
Henry VI, Part 2
Henry VI, Part 3
Henry VIII
King John
Richard II
Richard III
Romances
Pericles
Cymbeline
The Winter's Tale
The Tempest
Other
Shakespeare as a character
Acting Shakespeare
Television series
NOTE: "ShakespeaRe-Told", "The Animated Shakespeare" and "BBC Television Shakespeare" series have been covered above, under the respective play performed in each episode.
Playing Shakespeare (TV, UK, 1979–1984) began as two consecutive episodes of the UK arts series The South Bank Show, and developed into a nine-part series of its own. It features director John Barton, then a leading light of the Royal Shakespeare Company, putting a host of actors through their paces. Many of those actors are now household names, including Judi Dench, Michael Pennington, Patrick Stewart, Ben Kingsley, David Suchet and Ian McKellen. The episodes were:
The South Bank Show: "Speaking Shakespearean Verse"
The South Bank Show: "Preparing to Perform Shakespeare"
1. "The Two Traditions"
2. "Using the Verse"
3. "Language and Character"
4. "Set Speeches and Soliloquies"
5. "Irony and Ambiguity"
6. "Passion and Coolness"
7. "Rehearsing the Text"
8. "Exploring a Character"
9. "Poetry and Hidden Poetry"
Three further episodes were filmed but never edited or screened. They were to be called "Using the Prose", "Using the Sonnets" and "Contemporary Shakespeare". Their text can be read in the book "Playing Shakespeare" by John Barton.
The Shakespeare Sessions (USA 2003): An American spin-off from Playing Shakespeare (above) in which John Barton directs notable American actors in Shakespeare scenes.
Conjuring Shakespeare (TV, UK, 199?): A series of half-hour documentaries hosted by Fiona Shaw, each episode dealing with scenes from a particular play.
In Search of Shakespeare (TV, UK, 2003): A BBC documentary series of four 1-hour episodes, chronicling the life of William Shakespeare, written and presented by Michael Wood.
Slings & Arrows (TV, Canada, 2003–2006): A Canadian comedy drama set in the New Burbage Shakespeare Festival, a fictional Shakespearean festival in a s |
https://en.wikipedia.org/wiki/Digital%20Signature%20Standard | The Digital Signature Standard (DSS ) is a Federal Information Processing Standard specifying a suite of algorithms that can be used to generate digital signatures established by the U.S. National Institute of Standards and Technology (NIST) in 1994. Five revisions to the initial specification have been released: FIPS in 1998, FIPS in 2000, FIPS in 2009, FIPS in 2013, and FIPS in 2023.
It defines the Digital Signature Algorithm, contains a definition of RSA signatures based on the definitions contained within PKCS #1 version 2.1 and in American National Standard X9.31 with some additional requirements, and contains a definition of the Elliptic Curve Digital Signature Algorithm based on the definition provided by American National Standard X9.62 with some additional requirements and some recommended elliptic curves. It also approves the use of all three algorithms.
References
Digital signature schemes |
https://en.wikipedia.org/wiki/WFNA%20%28TV%29 | WFNA (channel 55) is a television station licensed to Gulf Shores, Alabama, United States, serving as the CW outlet for southwest Alabama and northwest Florida. It is owned and operated by network majority owner Nexstar Media Group alongside Mobile-licensed CBS affiliate WKRG-TV (channel 5). The two stations share studios with several radio stations owned by iHeartMedia on Broadcast Drive in southwest Mobile; WFNA's transmitter is located in unincorporated Baldwin County near Spanish Fort, Alabama.
History
Prior to the station's sign-on, WFNA's call letters were originally planned to be WGMP (standing for "Gulf Shores, Mobile, Pensacola"). The station first signed on the air as WBPG on September 2, 2001; it replaced WFGX (channel 35) as the area's WB affiliate after the station reverted to independent status four days earlier on August 31. The station was originally owned by Pegasus Broadcasting. At the time, WFGX's signal was all but unviewable over-the-air on the Alabama side of the market, but WBPG's signal decently covered the entire market.
In 2003, Emmis Communications purchased the station, which created a duopoly with Fox affiliate WALA-TV (channel 10); WBPG's operations were subsequently merged with WALA at the latter station's facility on Satchel Paige Drive. LIN TV Corporation acquired WALA-TV on November 30, 2005; instead of acquiring WBPG directly along with it, the company instead began to operate the station under a local marketing agreement. Just over seven months later, on July 7, 2006, LIN purchased WBPG outright.
On January 24, 2006, CBS Corporation and Time Warner announced the shutdown of both UPN and The WB effective that fall. In place of these two networks, a new "fifth" network—"The CW Television Network" (its name representing the first initials of parent companies CBS and Warner Bros.), jointly owned by both companies, would launch, with a lineup primarily featuring the most popular programs from both networks. WBPG joined The CW on September 18, 2006.
With WALA having been relaunched using the myFox format, WBPG is now relaunched on a separate website on late August 2007.
The station changed its call letters to WFNA in October 2009, as part of a larger rebranding campaign that took effect on December 18. The rebranding de-emphasized the CW network branding in favor of the station's call letters—a practice similar to that of what Tribune Broadcasting's CW affiliates adopted starting in 2008. However, in September 2012, WFNA reverted to using CW branding and became known as "CW 55."
On March 21, 2014, LIN Media entered into an agreement to merge with Media General (which itself would be acquired by Nexstar Media Group three years later) in a $1.6 billion deal. Because Media General already owned CBS affiliate WKRG-TV (channel 5), the companies planned to either sell WALA or WKRG to comply with FCC ownership rules as well as planned changes to those rules regarding same-market television stations which would prohib |
https://en.wikipedia.org/wiki/NaPTAN | The National Public Transport Access Node (NaPTAN) database is a UK nationwide system for uniquely identifying all the points of access to public transport in the UK. The dataset is closely associated with the National Public Transport Gazetteer.
Every UK railway station, coach terminus, airport, ferry terminal, bus stop, taxi rank or other place where public transport can be joined or left is allocated a unique NaPTAN identifier. The relationship of the stop to a City, Town, Village or other locality can be indicated through an association with elements of the National Public Transport Gazetteer.
There is a CEN standardisation initiative, Identification of Fixed Objects In Public Transport ('IFOPT'), to develop NaPTAN concepts into a European standard for stop identification as an extension to Transmodel, the European standard for Public Transport information.
Purpose of NaPTAN
The ability to identify and locate stops in relation to topography, both consistently and economically, is fundamental to modern computer based systems that provide passenger information and manage public transport networks. Stop data is needed by journey planners, scheduling systems, real-time systems, for transport planning, performance monitoring, and for many other purposes. Digitalising a nation's public transport stops is an essential step in creating a national information infrastructure.
In the UK NaPTAN enabled the creation of the Transport Direct Portal, a UK nationwide system for multi-modal journey planning. NaPTAN also underpins TransXChange, the UK standard for bus schedules, which is used for the Electronic Registration of Bus Services.
NaPTAN Components
NaPTAN comprises several distinct elements
A data model, based on Transmodel.
A data exchange format, specified as an XML schema (see http://www.naptan.org.uk/schema/schemas.htm)
A central data store used to aggregate and distribute stop data from different UK regions.
A process for different stakeholders to contribute, validate and share data.
A website to access the data www.beta-naptan.dft.gov.uk
A simple API that can be used to download the data (https://naptan.api.dft.gov.uk/swagger/index.html)
NaPTAN identifiers are designed to be used within the UK's Digital National Framework a system of unique persistent reference for shareable information resources of all types managed by the Ordnance Survey.
NaPTAN includes on a related standard - the UK National Public Transport Gazetteer.
The NaPTAN Database
The National Public Transport Access Node dataset has information on all UK public transport stops. Stops are submitted by PTEs to a central authority which consolidates the stops and distributes them back to users. There are currently 380,000 active stop points.
NaPTAN is maintained by the Department of Transport.
The NaPTAN XML Schema
NaPTAN data is described by a NaPTAN XML Schema. This can be used to describe NaPTAN data when exchanging it between systems as XML documents. It |
https://en.wikipedia.org/wiki/Morrow%20Pivot%20II | The Morrow Pivot II, released in May 1985, was a portable personal computer 100% compatible with IBM PC Software. It was designed by Norman Towson and Micheal Stolowitz, and manufactured by Morrow Designs - based on the Pivot designed by Vadem Inc. With one drive, 256 KB RAM, and a monochrome backlit LCD, the Pivot II had a list price of US$1,995.
The Morrow Pivot II included one or two 5-1/4" floppy drives. This machine was in a vertical configuration with a fold down keyboard. This was called a "lunch box" style unlike the typical laptop today. The only external component was a single AC adapter. It would have been a little top heavy except for the large Panasonic camcorder battery loaded into its base.
The Pivot II design was licensed to Zenith Data Systems for $2M and sold as the Zenith Z-171; Zenith sold over $500M to the US government, many to the Internal Revenue Service. The IBM-compatible Pivot was Morrow's first non-Z80 machine. While modern laptops don't share its design, it was arguably the most practical machine until desktops embraced 3-1/2" floppies. Robert Dilworth went from being General Manager of Morrow Designs to being CEO of Zenith Data Systems for years as part of Zenith's paying him to talk George Morrow into licensing the Pivot to them.
Osborne Computer Corporation licensed the original Pivot (not backlit, 80x16 line/480x128 display, 128 KB RAM, 16 KB ROM) from 1984 as the basis for their Osborne 3, known as the Osborne Encore in Europe.
See also
George Morrow
References
Early laptops |
https://en.wikipedia.org/wiki/Sandvine | Sandvine Incorporated is an application and network intelligence company based in Waterloo, Ontario.
Sandvine markets network policy control products that are designed to implement broad network policies, including Internet censorship, congestion management, and security. Sandvine's products target Tier 1 and Tier 2 networks for consumers, including cable, DSL, and mobile.
Operation
Sandvine classifies application traffic across mobile and local networks by user, device, network type, location and other parameters. The company then applies machine learning-based analytics to real-time data and makes technical policy changes.
As of 2021, Sandvine has over 500 customers globally.
Company history
Sandvine was formed in August, 2001 in Waterloo, Ontario, by a team of approximately 30 people from PixStream, a then-recently closed company acquired by Cisco. An initial round of VC funding launched the company with $20 million CDN. A subsequent round of financing of $19 million (CDN) was completed in May 2005. In March 2006 Sandvine completed an initial public offering on the London AIM exchange under the ticker 'SAND'. In October 2006 Sandvine completed an initial public offering on the Toronto Stock Exchange under the ticker 'SVC'.
Initial product sales focused on congestion management and fair usage as service providers struggled with the rapid growth in broadband traffic. As fiber rollouts and 4G networks became more prevalent, the company's application optimization and monetization use cases were adopted by many customers. This allowed service providers to deliver usage and application-based plans, zero-rate applications, reduce fraud, and introduce security and parental controls as a way to generate new revenues.
In June 2007 Sandvine acquired CableMatrix Technologies for its PacketCable Multimedia (PCMM)-based PCRF that enable broadband operators to increase subscriber satisfaction while delivering media-rich IP applications and services such as SIP telephony, video streaming, on-line gaming, and videoconferencing.
In July 2017 Sandvine shareholders accepted a $562 million (CDN) takeover bid from PNI Acquireco Corp., an affiliate of Francisco Partners and Procera Networks. The acquisition was completed in September 2017 when Sandvine shares ceased to be listed in the Toronto Stock Exchange.
The acquisition was completed despite concerns raised by Ronald Deibert, the director of the Citizen Lab at the Munk School of Global Affairs at the University of Toronto who argued that the takeover required “closer scrutiny” by the federal government, largely in light of some of the activities done by two of Francisco's portfolio companies. Most notably Procera Networks was part of a controversy where its technology is alleged to have been used to spy on Turkish citizens.
Internet throttling and censorship
Sandvine products were used by Comcast in the United States to limit number of sessions of Internet traffic generated by peer-to-peer file shari |
https://en.wikipedia.org/wiki/IBC | IBC is an initialism that can stand for:
Broadcasting
Intercontinental Broadcasting Corporation, Channel 13, Philippines
International Beacon Project, Worldwide network of radio propagation beacons
International Broadcast Centre
International Broadcasting Company, created by Leonard Plugge
IBC Studios, the studios for the above
International Broadcasting Convention, an annual media, entertainment and technology show
Inuit Broadcasting Corporation, Canada
Iwate Broadcasting Company, Japan
Business
IBC Airways, an American airline company
IBC (bus manufacturer), a former Australian bus manufacturer
IBC Vehicles, Isuzu Bedford Company
Índice Bursátil de Capitalización, a stock market index in Venezuela
Institute of Business Consulting, UK
Insolvency and Bankruptcy Code, 2016, India
International Bank of Commerce, Texas, United States
International Biographical Centre, a publisher
International Boxing Club of New York
International Building Code, used in most of the US
International business company (or corporation)
Interstate Bakeries Corporation
Intertemporal budget constraint, a budgeting term
Religion
Indiana Bible College, USA
International Bahá'í Council
International Buddhist College, Thailand
International Old Catholic Bishops' Conference, or International Bishops' Conference
Irish Baptist College, Republic of Ireland
Isaac Breuer College of Hebraic Studies, Israel
Irish Baptist College, Republic of Ireland
International Buddhist Confederation, Republic of India
Other uses
IBC Root Beer
Indirect Branch Control, information returned by the CPUID instruction for the Intel Pentium and successors
Inflammatory breast cancer
Information-based complexity
Intermediate Bulk Container, industrial-grade containers engineered for the mass handling, transport, and storage of materials
International Botanical Congress
International Boundary Commission
International Boxing Council
International branch campus
Iran Bioinformatics Center, Iran
Iraq Body Count project
Italy. Common Good (Italia. Bene Comune), Italian political coalition |
https://en.wikipedia.org/wiki/Chaintech | Walton Chaintech Corporation (), founded in November 1986, is a Taiwanese computer hardware manufacturer.
The company was known as Chaintech Computer Co. Ltd. but renamed itself Walton Chaintech Corporation in October 2005.
Chaintech employs approximately 1,100 people. It is best known for manufacturing graphics cards and motherboards, although it also produces sound cards, modems and memory modules. Besides its Taipei headquarters in Taiwan, Chaintech has eight branch offices in Hong Kong, Beijing and Shenzhen (China), Korea, Sydney (Australia), California (United States), Paris (France) and Moscow (Russia).
In 2012, Walton Chaintech returned to motherboard and graphics card businesses.
See also
List of companies of Taiwan
External links
List of Chaintech motherboards
News of motherboard phase out - xbitlabs.com
Returns to Motherboard and Graphics Card Businesses
Manufacturing companies established in 1986
Graphics hardware companies
Motherboard companies
Electronics companies of Taiwan
Manufacturing companies based in Taipei
Taiwanese companies established in 1986
Taiwanese brands |
https://en.wikipedia.org/wiki/Transactional%20database | Transactional database may refer to:
Operational database of customer transactions
Database transaction - a transactional database could be one that is ACID-compliant for each database transaction
Navigational database |
https://en.wikipedia.org/wiki/AlphaSmart | AlphaSmart, Inc., formerly Intelligent Peripheral Devices, Inc., was an education technology company founded by Apple Computer engineers Joe Barrus and Ketan Kothari, and Kothari's brother, Manish Kothari, in the early 1990s. At the time of their initial release in 1993, the first AlphaSmart models were marketed as smart keyboards designed to promote writing in the classroom as an alternative to expensive computer labs. The units' durability, long battery life, and limited functionality made them ideal for K-12 classrooms. Later models expanded functionality to spell-checking, running applications, and accessing wireless printers.
After their initial public offering in 2004, AlphaSmart, Inc. was quickly acquired by Renaissance Learning, Inc., in 2005. The last AlphaSmart branded device, named the Neo 2, was released by Renaissance Learning in 2007. 6 years later in late September 2013, production of all AlphaSmart branded devices was discontinued. While AlphaSmart no longer exists as a brand, a cult following of distraction-free writers has kept a healthy secondhand market for Alphasmart devices alive to this day.
In August 2022, Freewrite, a manufacturer of single purpose distraction-free writing tools such as the Hemingwrite and the Traveler, revived the alphasmart.com domain for the release of a product called the Freewrite Alpha.
Background
The AlphaSmart was a keyboarding device that enabled a person to work on the go, much like a laptop computer, but it was strictly for word processing, as it functioned essentially like a simple digital typewriter. The Dana (one of the last devices made by AlphaSmart) was an exception, as this device also ran Palm OS applications. Since the AlphaSmart, Dana, and NEO were specialized for limited purposes, they were generally much cheaper than a standard laptop computer. All of these devices were meant to be plugged into an ADB, PS/2, or USB port for transferring the written text into a computer's word processing document for further editing (such as indentation and font preference) or printing if so desired.
The AlphaSmart saved every keystroke directly to the machine's RAM, which was maintained by a battery backup even when powered down. AlphaSmarts could transfer data either by a special program that communicated with the AlphaSmart or by the simpler method of transmitting the keystrokes of the written text as if it were the computer's keyboard. When not transferring text, the AlphaSmart could be used as a standard keyboard.
AlphaSmarts were very popular in schools for their affordability and durability. Elementary schools and high schools used them; and they were particularly popular among special education departments for use by students with graphomotor challenges.
The machines were also popular among journalists and writers, who found them easy to carry and appreciated the full-size keyboard and long battery life. AlphaSmarts continue to be popular with small groups of writers, despite attempts |
https://en.wikipedia.org/wiki/Bolgimo | Bolgimo is a Win32 computer worm, a self-replicating computer program similar to a computer virus, which propagates by attempting to exploit unpatched Windows computers vulnerable to the DCOM RPC Interface Buffer Overrun Vulnerability using TCP port 445 on a network. The worm was discovered on November 10, 2003, and targets Windows NT, 2000 and XP Operating Systems.
If a target computer is successfully infected, the worm will call the user's attention to the fact that the machine is vulnerable, download the patch to the user's desktop and run the patch installer. The worm also attempts to shut down processes linked to other malware known to exploit the same vulnerability, like MSBlaster.
Aliases
Worm.Win32.Bolgi (Kaspersky)
W32/Bolgimo.worm (McAfee)
W32.Bogi.Worm (Symantec)
Worm/Bolgi.A (Avira)
W32/Bolgi-A (Sophos)
Worm:Win32/Bolgimo.A (Microsoft)
References
Exploit-based worms
Hacking in the 2000s |
https://en.wikipedia.org/wiki/Valiant%20%28film%29 | Valiant is a 2005 computer-animated comedy film produced by Vanguard Animation, Ealing Studios and Odyssey Entertainment, and released by Entertainment Film Distributors in the United Kingdom on March 25, 2005, and by Walt Disney Pictures in the United States on August 19, 2005. Set in May of the year 1944, it tells the story of a group of war pigeons during World War II. The film is based on a story by George Webster, and inspired by true stories of hundreds of pigeons that helped the soldiers in the war.
Plot
In May 1944, five years after the declaration of World War II, three Royal Homing Pigeon Service war pigeons are flying across the English Channel with the White Cliffs of Dover in sight, carrying vital messages to Great Britain. Despite the poor weather conditions the pigeons have nearly reached their destination. They are, however, suddenly ambushed and attacked by a Nazi German enemy peregrine falcon named General Von Talon; two of the pigeons are instantly killed, yet the third, Mercury, is taken as a prisoner of war.
Elsewhere, a small wood pigeon named Valiant is watching an Allied forces propaganda film in his local bar (an overturned rowing boat) in West Nestington. He is best friends with Felix, an old seagull with a peg leg and the local barman. Wing Commander Gutsy, a war hero, flies into the bar, informing everyone that signups are scheduled the next day in Trafalgar Square, London. Valiant flies off to London, bidding his mother and Felix goodbye. In London, Valiant meets an unhygienic slacker pigeon named Bugsy, who is being hunted by two magpie thugs, after having tricked them at a shell game. In order to escape the thugs, he signs up with Valiant.
The recruits, Valiant, Bugsy, Lofty, an intellectual red pigeon, and Toughwood and Tailfeather, two muscular but dim-witted twin brothers, form Royal Homing Pigeon Service Squad F, and are sent to a recruit training facility. Under the command of Sergeant Monty, who declares that he will toughen them up for the RHPS, the training begins. Meanwhile, Von Talon and his henchmen, Cufflingk and Underlingk, try numerous attempts to discover the message's departure location. However, Mercury refuses to tell, despite the tortures inflicted upon him, such as irritating him with yodeling music and injecting him with truth serum, before Mercury accidentally reveals the location: Saint-Pierre.
Valiant develops a crush on Victoria, the camp's nursing dove. Eventually, Gutsy arrives and tells the Sergeant that the recruits need to leave the next morning, despite their training being vastly incomplete. Bugsy, however, decides not to go on the "highly dangerous" mission and flees the camp that night. Next morning Valiant and the others prepare to leave, and start to board a Handley Page Halifax bound for occupied France, but not before Bugsy shows up at the last second. The journey quickly becomes dangerous, as the plane is caught in an anti-aircraft attack. Their plane sustains heavy damag |
https://en.wikipedia.org/wiki/Welshpool%20railway%20station%2C%20Perth | Welshpool railway station is on the Transperth network. It is located on the Armadale and Thornlie lines, 9.5 kilometres from Perth Station serving the suburbs of Welshpool and Bentley, Western Australia.
The station will close on 20 November 2023 as part of a wider upgrade to the line.
History
Welshpool Station opened in 1889 as one of the original stations on the Armadale line.
As early as the 1930s the location was concern for railway crossing safety.
During the second world war, it was considered as a suitable location for a proposed munitions factory.
Welshpool Station was planned to be closed under the original 1999 South West Metropolitan Railway Master Plan for the Armadale line branch route of the Mandurah line to enable the construction of a bridge over Welshpool Road instead of the current level crossing. However, with the change in route alignment, the closure was no longer necessary at that point in time.
Future
The station is planned to close on 20 November 2023 as part of a Metronet project for the removal of level crossings on the Armadale line. The project involves the removal of the Welshpool Road level crossing. Because Welshpool Station does not have high patronage, and it is close to Welshpool Road and a bridge that Leach Highway goes over, it was determined that it was not possible to remove the Welshpool Road level crossing without closing Welshpool Station.
Services
Welshpool Station is served by Transperth Armadale and Thornlie line services.
The station saw 116,681 passengers in the 2013-14 financial year.
Platforms
References
Bibliography
External links
Gallery History of Western Australian Railways & Stations
Armadale and Thornlie lines
Transperth railway stations
Railway stations in Australia opened in 1889 |
https://en.wikipedia.org/wiki/Computing%20with%20words%20and%20perceptions | In computing with words and perceptions (CWP), the objects of computation are words, perceptions, and propositions drawn from a natural language. The central theme of CWP is the concept of a generalised constraint. The meaning of a proposition is expressed as a generalised constraint.
CWP is a necessary tool when the available information is perception-based or not precise enough to use numbers.
See also
Fuzzy set
Lotfi Zadeh
Perceptual computing
Type-2 fuzzy sets and systems
References
L. A. Zadeh, “Fuzzy logic = computing with words,” IEEE Trans. on Fuzzy Systems, vol. 4, pp. 103-111, 1996.
Soft computing |
https://en.wikipedia.org/wiki/Refinement%20%28computing%29 | Refinement is a generic term of computer science that encompasses various approaches for producing correct computer programs and simplifying existing programs to enable their formal verification.
Program refinement
In formal methods, program refinement is the verifiable transformation of an abstract (high-level) formal specification into a concrete (low-level) executable program. Stepwise refinement allows this process to be done in stages. Logically, refinement normally involves implication, but there can be additional complications.
The progressive just-in-time preparation of the product backlog (requirements list) in agile software development approaches, such as Scrum, is also commonly described as refinement.
Data refinement
Data refinement is used to convert an abstract data model (in terms of sets for example) into implementable data structures (such as arrays). Operation refinement converts a specification of an operation on a system into an implementable program (e.g., a procedure). The postcondition can be strengthened and/or the precondition weakened in this process. This reduces any nondeterminism in the specification, typically to a completely deterministic implementation.
For example, x ∈ {1,2,3} (where x is the value of the variable x after an operation) could be refined to x ∈ {1,2}, then x ∈ {1}, and implemented as x := 1. Implementations of x := 2 and x := 3 would be equally acceptable in this case, using a different route for the refinement. However, we must be careful not to refine to x ∈ {} (equivalent to false) since this is unimplementable; it is impossible to select a member from the empty set.
The term reification is also sometimes used (coined by Cliff Jones). Retrenchment is an alternative technique when formal refinement is not possible. The opposite of refinement is abstraction.
Refinement calculus
Refinement calculus is a formal system (inspired from Hoare logic) that promotes program refinement. The FermaT Transformation System is an industrial-strength implementation of refinement. The B-Method is also a formal method that extends refinement calculus with a component language: it has been used in industrial developments.
Refinement types
In type theory, a refinement type is a type endowed with a predicate which is assumed to hold for any element of the refined type. Refinement types can express preconditions when used as function arguments or postconditions when used as return types: for instance, the type of a function which accepts natural numbers and returns natural numbers greater than 5 may be written as . Refinement types are thus related to behavioral subtyping.
See also
Reification (computer science)
References
Formal methods terminology
Computer programming |
https://en.wikipedia.org/wiki/WQRF-TV | WQRF-TV (channel 39) is a television station in Rockford, Illinois, United States, affiliated with the Fox network. It is owned by Nexstar Media Group, which provides certain services to dual ABC/MyNetworkTV affiliate WTVO (channel 17) under joint sales and shared services agreements (JSA/SSA) with Mission Broadcasting. The two stations share studios on North Meridian Road in Rockford, where WQRF-TV's transmitter is also located.
History
The station signed on November 27, 1978, as the market's fourth television outlet, first broadcasting from studios located on Kishwaukee Street between State and 1st streets in downtown Rockford. It was the last full-power analog television station to sign on in Rockford, while other stations in the area since then have either been low-powered, cable-only, or on digital subchannels. Airing an analog signal on UHF channel 39, WQRF was founded by local businessman Marvin Palmquist. The channel allotment was previously used by WTVO from its sign-on in 1953 until 1967. It was promoted as an independent, "family-oriented" alternative to the area's big three network affiliates. Palmquist sold the station to Orion Broadcasting in 1984.
Overcoming a four-month wait to finally get on-the-air, WQRF's first program was an episode of the classic sitcom Gomer Pyle, U.S.M.C.. Among some of the earlier programs to also air on the station were I Love Lucy, The Bob Newhart Show, The Jeffersons, The Dick Van Dyke Show and first-run fare such as Entertainment Tonight, the original nighttime edition of Family Feud, The PTL Club and The 700 Club.
As it was the only Independent outlet in the market, WQRF stocked up much of its programming schedule with live sports including Major League Baseball (Chicago White Sox, St. Louis Cardinals and Milwaukee Brewers), the NBA (Chicago Bulls and Milwaukee Bucks), NFL preseason action (Chicago Bears) and college sports (specifically Big Ten Conference football and basketball). Orion Broadcasting sold WQRF to Family Group Broadcasting in May 1986, sharing ownership and graphical imaging with WGBA-TV in Green Bay, Wisconsin, WVFT-TV in Roanoke, Virginia, WPGX in Panama City, Florida, WFGX in Fort Walton Beach, Florida and WLAX in La Crosse, Wisconsin. The station later relocated its operations to a new building located on South Main Street/IL 2 in Rockford.
The station joined Fox in August 1989. For the network's first three years of existence, cable subscribers watched Fox through Chicago's WFLD, Madison's WMSN-TV, or Milwaukee's WCGV-TV, depending on the location. Within four years of joining Fox, WQRF ranked as one of the network's highest-rated stations. On September 12 of that year, Family Group sold the station to Petracom Broadcasting. Petracom in turn sold it to Quorum Broadcasting in 1998.
With the expansion of Fox's prime time programming and the move of sports coverage to cable on Comcast SportsNet Chicago and its forerunners and the Big Ten Network, much of WQRF's off-network rerun |
https://en.wikipedia.org/wiki/Giada%20De%20Laurentiis | Giada Pamela De Laurentiis (; born August 22, 1970) is an Italian American chef, entrepreneur, writer, and television personality. She was the host of Food Network's program called Giada at Home. She also appears regularly as a contributor and guest co-host on NBC's program entitled Today. De Laurentiis is the founder of the catering business GDL Foods. She is a winner of the Daytime Emmy Award for Outstanding Lifestyle Host and the Gracie Award for Best Television Host. She was also recognized by the International Hospitality Institute as one of the Global 100 in Hospitality, a list featuring the 100 Most Powerful People in Global Hospitality.
Early life
Giada Pamela De Benedetti was born on August 22, 1970, in Rome, Italy, the eldest child of actress Veronica De Laurentiis and her first husband, actor-producer Alex De Benedetti. De Benedetti was a close associate of Giada's maternal grandfather, film producer Dino De Laurentiis. As a child, Giada often found herself in the family's kitchen and spent a great deal of time at her grandfather's restaurant, DDL Foodshow. Her parents were married in February 1970 but were later divorced. After her parents' divorce, Giada and her siblings moved to Southern California, where they took their mother's surname. After graduating from Marymount High School in Los Angeles, De Laurentiis attended the University of California, Los Angeles, earning her bachelor's degree in social anthropology in 1996.
Her maternal great-grandmother was English and her grandmother was British-Italian film star Silvana Mangano. Her paternal grandmother, Pamela De Benedetti née Leslie-Jones (1923–1998), was also English. Her siblings include sister Eloisa, a make-up artist, and brothers Igor and Dino Alexander II, a Hollywood film editor who died of melanoma in 2003. Her stepfather is producer Ivan Kavalsky.
Career
De Laurentiis studied at Le Cordon Bleu in Paris, with aspirations of becoming a pastry chef. After returning to the United States, she became a professional chef working in several Los Angeles restaurants, notably the Wolfgang Puck-owned Spago. She later worked as a food stylist and was contacted by the Food Network after styling a piece in Food & Wine magazine in 2002.
Her daytime cooking show on the Food Network, Everyday Italian, premiered April 5, 2003. On Chefography, a Food Network biography program, she said she never wanted to be in her "family business" of show business, and that she felt uncomfortable in front of the camera when she first began hosting Everyday Italian. When the program first aired, the Food Network received mail accusing the network of hiring a model or actress pretending to cook instead of a real chef.
De Laurentiis began hosting Behind the Bash in October 2005. The program examines the catering process behind big event extravaganzas such as the Grammy Awards. In January 2007, a third De Laurentiis-hosted show, Giada's Weekend Getaways, debuted on Food Network. On this show, De Laur |
https://en.wikipedia.org/wiki/Itchy%20%26%20Scratchy%20%26%20Marge | "Itchy & Scratchy & Marge" is the ninth episode of the second season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on December 20, 1990. In the episode, which is a satire of censorship issues, Maggie bullies Homer by attacking him with a mallet and Marge blames The Itchy & Scratchy Show for Maggie's actions. It was written by John Swartzwelder and was the first episode to be directed by Jim Reardon. Alex Rocco makes his first of three guest appearances as Roger Meyers, Jr.
Plot
Homer clumsily attempts to build a spice rack for Marge, when Maggie suddenly knocks him out by hitting him on the head with a mallet. Marge is puzzled by Maggie's behavior until she realizes that Maggie is imitating the violence on The Itchy & Scratchy Show. Marge forbids Bart and Lisa from watching the show, but they continue to watch it at their friends' houses. Marge writes a letter to the cartoon studio asking them to tone down the violence, but chairman, Roger Meyers, Jr., dismisses her concerns, which prompts Marge to form a protest group.
Marge organizes Springfieldians for Nonviolence, Understanding, and Helping (SNUH), and forces her family to picket outside the studio. SNUH gains momentum and residents boycott The Krusty the Clown Show, which airs Itchy & Scratchy cartoons. After Marge appears on the panel discussion show Smartline, concerned parents send thousands of angry letters to Meyers, who reluctantly agrees to eliminate violence from Itchy & Scratchy and solicits story ideas from Marge. The children dislike the rather schmaltzy format change and abandon the cartoons to play outside instead.
Afterwards, a traveling exhibition of Michelangelo's sculpture David schedules a stop in Springfield. Other SNUH members urge Marge to protest the exhibition due to its nudity, but Marge, an artist herself, considers David a masterpiece. During another Smartline appearance, Marge concedes it is hypocritical to censor Itchy & Scratchy and not David as they're both free forms of expression, realizing that her protests have done more harm than good.
Now free of public negativity, Itchy & Scratchy quickly returns to its old format after SNUH disbands, prompting the town's kids to stop going outside and resume watching the show. While Marge and Homer view David at an art museum, Marge laments that the kids would rather watch violent cartoons than see a work of great art. Homer cheers her up by revealing that the school is forcing students to see the sculpture on a field trip to the museum.
Production
"Itchy & Scratchy & Marge" is an acclaimed episode that dealt with censorship issues and allowed the writers to insert several Itchy & Scratchy cartoons, which many fans had been clamoring for. The episode was written by John Swartzwelder, who loved Itchy & Scratchy and wrote several episodes that have them at the center. The episode was partially inspired by Terry Rakolta, who protested the Fox network ov |
https://en.wikipedia.org/wiki/KNOW-FM | KNOW-FM (91.1 FM) is the flagship radio station of Minnesota Public Radio's news and information network, primarily broadcasting a talk radio format to the Minneapolis-St. Paul market. The frequency was the original home of KSJN, but the purchase of a commercial station at 99.5 MHz in 1991 allowed MPR to broadcast distinct talk radio and classical music services.
KNOW-FM's studios are located in the MPR Broadcast Center on Cedar Street in downtown St. Paul, while its transmitter is located on the Telefarm Towers in Shoreview.
History
The KNOW intellectual unit dates from 1980, when WLOL (1330 AM) was purchased by MPR in 1980 and changed its call letters to KSJN-AM, a simulcast of its FM sister. MPR was already making plans to offer a two-channel network when it acquired the frequencies to do so, and bought the AM frequency as a stopgap. In 1989, KSJN-AM changed its call letters to KNOW and began airing an expanded lineup of NPR programming. Two years later, MPR bought 99.5 FM–the former WLOL-FM. At that time, MPR moved the KNOW call letters and intellectual unit to 91.1, while the KSJN calls moved to 99.5 as a full-time classical music station. The AM signal was later spun off into a for-profit subsidiary to help fund the public broadcaster, and was eventually sold off. The station has since reverted to its original WLOL call sign.
In the 1970s, KSJN 91.1 FM and WLOL (99.5 FM) cooperated in an experimental use of quadraphonic stereo, with each station carrying two channels of audio. However, this "quadcast" had some undesirable "ping-pong" effects, much like early stereo broadcasts using the same method did. As KNOW now mainly broadcasts spoken word programming, the station broadcasts in analog in monaural audio in order to extend the station's coverage to its fullest extent possible.
HD Radio
KNOW-FM features "Radio Heartland", a Web-and HD Radio- service, on its HD Radio subchannel. Its playlist consists primarily of acoustic, singer-songwriter, folk and Americana music. The service launched in December 2008.
Radio Heartland's schedule also includes the programs Live from Here and American Routes from American Public Media, and the shows The Thistle & Shamrock and Mountain Stage from NPR. These additional shows were added to Radio Heartland's schedule in November 2009.
Austin, Texas
The callsign KNOW was also used by a major AC radio station in Austin, Texas, located at 1490 kHz. The station signed off in 1989 after operating for 50 years. The Spanish station KLGO assumed the frequency in 1993.
Lufkin, Texas
The callsign KNOW was also used by an oldies station in Lufkin, Texas, located at 1420 kHz, until it suffered a fire and shut down in 1987. It was owned by Pine Air, Inc.
See also
KCMP, MPR's eclectic music station
KSJN, MPR's classical music station
References
Mark Durenberger (1999). Early quad-casts and other fun. The Broadcast Archive: War Stories.
External links
Minnesota Public Radio
MPR: KNOW 91.1/KSJN 99.5/KCMP 89.3 |
https://en.wikipedia.org/wiki/Multimedia%20framework | A multimedia framework is a software framework that handles media on a computer and through a network. A good multimedia framework offers an intuitive API and a modular architecture to easily add support for new audio, video and container formats and transmission protocols. It is meant to be used by applications such as media players and audio or video editors, but can also be used to build videoconferencing applications, media converters and other multimedia tools. Data is processed among modules automatically, it is unnecessary for app to pass buffers between connected modules one by one.
In contrast to function libraries, a multimedia framework provides a run time environment for the media processing. Ideally such an environment provides execution contexts for the media processing blocks separated from the application using the framework. The separation supports the independent processing of multimedia data in a timely manner. These separate contexts can be implemented as threads.
See also
AVFoundation, Apple QuickTime multimedia framework replacement
DirectShow, a multimedia framework and API produced by Microsoft for software developers to perform various operations with media files or streams.
FFmpeg, a cross-platform multimedia framework to decode, encode, transcode, mux, demux, stream, filter and play media.
GStreamer, a cross-platform pipeline-based multimedia framework Multimedia software
Media Foundation, a COM-based multimedia framework pipeline and infrastructure platform provided by Microsoft for digital media in Windows Vista & Windows 7.
Media Lovin' Toolkit, an open-source multimedia framework for television editing.
Phonon, a cross-platform multimedia framework from the Qt toolkit
QuickTime, a multimedia framework provided by Apple for Mac OS and Windows
VLC Media Player, a media player and a multimedia framework by the VideoLAN project. |
https://en.wikipedia.org/wiki/United%20States%20Air%20Force%20Stability%20and%20Control%20Digital%20DATCOM | The United States Air Force Stability and Control Digital DATCOM is a computer program that implements the methods contained in the USAF Stability and Control DATCOM to calculate the static stability, control and dynamic derivative characteristics of fixed-wing aircraft. Digital DATCOM requires an input file containing a geometric description of an aircraft, and outputs its corresponding dimensionless stability derivatives according to the specified flight conditions. The values obtained can be used to calculate meaningful aspects of flight dynamics.
History
In February 1976, work commenced to automate the methods contained in the USAF Stability and Control DATCOM, specifically those contained in sections 4, 5, 6 and 7. The work was performed by the McDonnell Douglas Corporation under contract with the United States Air Force in conjunction with engineers at the Air Force Flight Dynamics Laboratory in Wright-Patterson Air Force Base. Implementation of the Digital DATCOM concluded in November 1978.
The program is written in FORTRAN IV and has since been updated; however, the core of the program remains the same.
A report was published, separated into three volumes, which explains the use of Digital DATCOM. The report consists of
Volume I, User's Manual
Volume II, Implementation of DATCOM Methods
Volume III, Plot Module
Inputs
Section 3 of the USAF Digital DATCOM Manual Volume I defines the inputs available for modeling an aircraft. The inputs are categorized by namelists to facilitate reading the file into FORTRAN.
Flight conditions and options
The FLTCON Namelist describes the flight conditions for the case. A maximum of 400 Mach-altitude combinations can be run at once, with up to 20 angles of attack for each combination. The user can specify whether the Mach number and altitude varies together, the Mach number varies at a constant altitude, or the altitude varies at a constant Mach number. Both subsonic and supersonic analysis can be run in Digital DATCOM.
The OPTINS Namelist defines the reference parameters for the aircraft. The theoretical wing area, mean aerodynamic chord, and wing span are input along with a parameter defining the surface roughness of the aircraft.
Synthesis parameters
The SYNTHS Namelist allows the user to define the positions of the center of gravity and apexes of the wings. The X- and Z- coordinates are needed for the wing, horizontal tail, and vertical tail in order for the aircraft to be synthesized correctly. DATCOM does not require that the origin for the aircraft has to be the nose of the aircraft; any arbitrary point will do, but all of the dimensions need to be referenced from that point. Incidence angles can also be added to the wing and horizontal tail.
Body parameters
The BODY Namelist defines the shape of the body. Digital DATCOM assumes an axisymmetrical shape for the body. Up to 20 stations can be specified with the fuselage half-width, upper coordinate and lower coordinate bei |
https://en.wikipedia.org/wiki/EComStation | eComStation or eCS is an operating system based on OS/2 Warp for the 32-bit x86 architecture. It was originally developed by Serenity Systems and Mensys BV under license from IBM. It includes additional applications, and support for new hardware which were not present in OS/2 Warp. It is intended to allow OS/2 applications to run on modern hardware, and is used by a number of large organizations for this purpose. By 2014, approximately thirty to forty thousand licenses of eComStation had been sold.
Financial difficulties at Mensys in 2012 led to the development of eComStation stalling, and ownership being transferred to a sister company named XEU.com (now known as PayGlobal Technologies BV), who continue to sell and support the operating system. The lack of a new release since 2011 was one of the motivations for the creation of the ArcaOS OS/2 distribution.
Differences between eComStation and OS/2
Version 1 of eComStation, released in 2001, was based around the integrated OS/2 version 4.5 client Convenience Package for OS/2 Warp version 4, which was released by IBM in 2000. The latter had been made available only to holders of existing OS/2 support contracts; it included the following new features (among others) compared to the final retail version of OS/2 (1996's OS/2 Warp version 4):
IBM-supplied updates of software and components that had shipped with the 1999 release of OS/2 Warp Server for e-business, but had not been made available to users of the client version. Key among these were the JFS file system and the logical volume manager.
Operating system features and enhancements that had been made available as updates but never offered as an install-time option. These included an updated kernel, a 32-bit TCP/IP stack and associated networking utilities, a firewall, updated drivers and other system components, newer versions of Java, SciTech SNAP Graphics video support, and more.
IBM-supplied updates that had previously only been offered to customers with maintenance contracts, such as UDF support and a new USB stack.
eComStation provided a retail channel for end users to obtain these updates. In addition, from the beginning it bundled a number of additional features and enhancements, including (but not limited to):
Value-added applications, including the Lotus Smartsuite office suite, IBM's Desktop On-call remote-control software, and more.
Utilities and drivers licensed from third parties including scanner support and drivers for multiple serial cards, as well as enhanced storage drivers developed by Daniela Engert.
A number of features from OS/2 Warp 4 which IBM had omitted from the Convenience Package release, such as voice navigation and dictation,
System improvements developed by Serenity itself including a new installer, various user interface enhancements, system configuration changes, and a rapid deployment system based on Serenity Managed Client.
Open-source utilities from the Unix world.
A number of small utilities and |
https://en.wikipedia.org/wiki/AdaBoost | AdaBoost, short for Adaptive Boosting, is a statistical classification meta-algorithm formulated by Yoav Freund and Robert Schapire in 1995, who won the 2003 Gödel Prize for their work. It can be used in conjunction with many other types of learning algorithms to improve performance. The output of the other learning algorithms ('weak learners') is combined into a weighted sum that represents the final output of the boosted classifier. Usually, AdaBoost is presented for binary classification, although it can be generalized to multiple classes or bounded intervals on the real line.
AdaBoost is adaptive in the sense that subsequent weak learners are tweaked in favor of those instances misclassified by previous classifiers. In some problems it can be less susceptible to the overfitting problem than other learning algorithms. The individual learners can be weak, but as long as the performance of each one is slightly better than random guessing, the final model can be proven to converge to a strong learner.
Although AdaBoost is typically used to combine weak base learners (such as decision stumps), it has been shown that it can also effectively combine strong base learners (such as deep decision trees), producing an even more accurate model.
Every learning algorithm tends to suit some problem types better than others, and typically has many different parameters and configurations to adjust before it achieves optimal performance on a dataset. AdaBoost (with decision trees as the weak learners) is often referred to as the best out-of-the-box classifier. When used with decision tree learning, information gathered at each stage of the AdaBoost algorithm about the relative 'hardness' of each training sample is fed into the tree growing algorithm such that later trees tend to focus on harder-to-classify examples.
Training
AdaBoost refers to a particular method of training a boosted classifier. A boosted classifier is a classifier of the form
where each is a weak learner that takes an object as input and returns a value indicating the class of the object. For example, in the two-class problem, the sign of the weak learner's output identifies the predicted object class and the absolute value gives the confidence in that classification. Similarly, the -th classifier is positive if the sample is in a positive class and negative otherwise.
Each weak learner produces an output hypothesis which fixes a prediction for each sample in the training set. At each iteration , a weak learner is selected and assigned a coefficient such that the total training error of the resulting -stage boosted classifier is minimized.
Here is the boosted classifier that has been built up to the previous stage of training and is the weak learner that is being considered for addition to the final classifier.
Weighting
At each iteration of the training process, a weight is assigned to each sample in the training set equal to the current error on that sample. These weights |
https://en.wikipedia.org/wiki/List%20of%20OS/2%20games | This is a list of games for the OS/2 operating system.
List
Angband
AVARICE: The Final Saga
B.U.G.S
Battle for Wesnoth
Crown of Might
Doom
Entrepreneur
Freeciv
Galactic Civilizations
Hopkins FBI
Lemmings/Oh No! More Lemmings/Christmas Lemmings
Links
Master of Empire
OS/2 Chess
Rocks'n'Diamonds
Semtex
SimCity
SimCity 2000
Stellar Frontier
Super Star Trek
Trials of Battle
References
External links
OS/2 World Gaming site
Stardock - Games for OS/2 Warp (PDF)
Stardock - Cross Platform Gaming (PDF)
Stellar Frontier for OS/2 - multimedia 2D action/strategy game
OS 2 |
https://en.wikipedia.org/wiki/Globo | Globo (meaning globe in Portuguese, Spanish and Italian) may refer to:
Grupo Globo, a Brazilian conglomerate primarily in mass media
TV Globo, a television network
GloboNews, a television 24-hour news channel
Globo (Portuguese TV channel)
Canais Globo, a satellite TV service; also in Portugal
O Globo, a newspaper
Globo Filmes, a movie production company
Editora Globo, a publishing house
Globo Marcas, a branding and marketing company
Globo Futebol Clube, a Brazilian football club
Il Globo, an Italian-language newspaper published in Australia
Radio Globo (Honduras), a radio station |
https://en.wikipedia.org/wiki/Secure%20by%20design | Secure by design, in software engineering, means that software products and capabilities have been designed to be foundationally secure.
Alternate security strategies, tactics and patterns are considered at the beginning of a software design, and the best are selected and enforced by the architecture, and they are used as guiding principles for developers. It is also encouraged to use strategic design patterns that have beneficial effects on security, even though those design patterns were not originally devised with security in mind.
Secure by Design is increasingly becoming the mainstream development approach to ensure security and privacy of software systems. In this approach, security is considered and built into the system at every layer and starts with a robust architecture design. Security architectural design decisions are based on well-known security strategies, tactics, and patterns defined as reusable techniques for achieving specific quality concerns. Security tactics/patterns provide solutions for enforcing the necessary authentication, authorization, confidentiality, data integrity, privacy, accountability, availability, safety and non-repudiation requirements, even when the system is under attack.
In order to ensure the security of a software system, not only is it important to design a robust intended security architecture but it is also necessary to map updated security strategies, tactics and patterns to software development in order to maintain security persistence.
Expect attacks
Malicious attacks on software should be assumed to occur, and care is taken to minimize impact. Security vulnerabilities are anticipated, along with invalid user input. Closely related is the practice of using "good" software design, such as domain-driven design or cloud native, as a way to increase security by reducing risk of vulnerability-opening mistakes—even though the design principles used were not originally conceived for security purposes.
Avoid security through obscurity
Generally, designs that work well do not rely on being secret. Often, secrecy reduces the number of attackers by demotivating a subset of the threat population. The logic is that if there is an increase in complexity for the attacker, the increased attacker effort to compromise the target will discourage them. While this technique implies reduced inherent risks, a virtually infinite set of threat actors and techniques applied over time will cause most secrecy methods to fail. While not mandatory, proper security usually means that everyone is allowed to know and understand the design because it is secure. This has the advantage that many people are looking at the computer code, which improves the odds that any flaws will be found sooner (see Linus's law). The disadvantage is that attackers can also obtain the code, which makes it easier for them to find vulnerabilities to exploit. It is generally believed, though, that the advantage of the open computer code outweighs t |
https://en.wikipedia.org/wiki/LSO | LSO may refer to:
Computing
Large segment offload, a technology for reducing CPU overhead
Local shared object, an HTTP cookie-like data entity used by Adobe Flash Player
Location search optimization, a web optimization method
Organisations
LSO (company), a delivery company formerly known as Lonestar Overnight
Law Society of Ontario, the regulatory body for lawyers in Ontario, Canada (formerly called the Law Society of Upper Canada)
Limburg Symphony Orchestra or Limburgs Symfonie Orkest, a Dutch orchestra
London School of Osteopathy, an osteopathic school in London, England
London Symphony Orchestra, a United Kingdom symphony orchestra
Other uses
Landing signal officer or landing safety officer on an aircraft carrier
Lateral superior olive, an auditory nucleus in the brainstem
Lutetium orthosilicate, an inorganic scintillator
Landing Signal Officer, a naval aviator
Lesotho (ISO 3166-1 code)
Linguistic Sign-Off |
https://en.wikipedia.org/wiki/Kingswood%20Country | Kingswood Country is an Australian sitcom that screened from 1980 to 1984 on the Seven Network. The series started on 30 January 1980 and was a spin-off from the sketch on comedy program The Naked Vicar Show that had featured Ross Higgins as blustering suburban father, Ted Bullpitt. It was written by Gary Reilly and Tony Sattler and produced by their production company, RS Productions. The show won Logie Awards for Best Comedy in 1981 and 1982, and was briefly revived in a spin-off in 1997 titled Bullpitt, although it proved less successful.
Premise
The show is a family sitcom focusing on the main character, Edward Melba "Ted" Bullpitt (Ross Higgins), a white Australian, conservative, Holden Kingswood-loving putty factory worker and WWII veteran and his interactions with his more progressive wife and two adult children.
He lives for three things: his beloved chair in front of the TV, his unsuccessful racing greyhounds Repco Lad and Gay Akubra and his Holden Kingswood car (late in the show's run Ted traded-in the Kingswood, which had gone out of production around the time the series began, for Holden's replacement mid-range family car, the Commodore). His long-suffering wife, the vague and dithering Thelma (Judi Farr), was cast as a traditional housewife trapped by Ted's conservative family views, but she often got her own back on Ted (this often included using old Myer receipts she had hidden in a drawer to fool Ted into thinking she paid less for a new item, often clothes, than she really had).
Ted's Kingswood is never shown on any episode.
Humour was generated by the conflict of Ted's traditional views and his children's progressive nature. For example, his son Craig (Peter Fisher) is portrayed as a sexually rampant medical student and is referred to as an "Al Grassby Groupie". His daughter, Greta (Laurel McGowan), is portrayed as a feminist and is married to Bruno (Lex Marinos), the son of Italian immigrants, to whom Ted objects (often referring to him as a "bloody wog"). Other politically incorrect humour includes Ted's references to Neville, the concrete Aboriginal garden statue. This was named after Australia's first Aboriginal Senator, Neville Bonner, who enjoyed it so much he visited the show's recording.
At other times, humour was based on the more traditional comedic methods of poorly thought-out schemes of Ted's (usually get-rich-quick); class differences (between the suburban Bullpitts and Ted's 'Datsun dealer' brother Bob and his upwardly-mobile wife Merle) and simple misunderstandings leading to a chain of humorous events.
Cast
Main cast and characters
Guests
Bruce Spence as Dentist / Samson
Cornelia Frances as Dr Hemingway
Graham Kennedy
Henri Szeps as Mr O'Grady / Eric the Postman
Ian Gilmour as Troy Bridges
Johnny Lockwood as Tony Bertolucci
Julieanne Newbould as Wendy
Lenore Smith as Cathy
Liddy Clark as Jennifer / Vicki
Noeline Brown as Janet Green / Elizabeth Windsor
Peter Whitford as Hayden De Witt / Bil |
https://en.wikipedia.org/wiki/Clipper%20architecture | The Clipper architecture is a 32-bit RISC-like instruction set architecture designed by Fairchild Semiconductor. The architecture never enjoyed much market success, and the only computer manufacturers to create major product lines using Clipper processors were Intergraph and High Level Hardware, although Opus Systems offered a product based on the Clipper as part of its Personal Mainframe range. The first processors using the Clipper architecture were designed and sold by Fairchild, but the division responsible for them was subsequently sold to Intergraph in 1987; Intergraph continued work on Clipper processors for use in its own systems.
The Clipper architecture used a simplified instruction set compared to earlier CISC architectures, but it did incorporate some more complicated instructions than were present in other contemporary RISC processors. These instructions were implemented in a so-called Macro Instruction ROM within the Clipper CPU. This scheme allowed the Clipper to have somewhat higher code density than other RISC CPUs.
Versions
The initial Clipper microprocessor produced by Fairchild was the C100, which became available in 1986. This was followed by the faster C300 from Intergraph in 1988. The final model of the Clipper was the C400, released in 1990, which was extensively redesigned to be faster and added more floating-point registers. The C400 processor combined two key architectural techniques to achieve a new level of performance — superscalar instruction dispatch and superpipelined operation.
While many processors of the time used either superscalar instruction dispatch or superpipelined operation, the Clipper C400 was the first processor to use both.
Intergraph started work on a subsequent Clipper processor design known as the C5, but this was never completed or released. Nonetheless, some advanced processor design techniques were devised for the C5, and Intergraph was granted patents on these. These patents, along with the original Clipper patents, have been the basis of patent-infringement lawsuits by Intergraph against Intel and other companies.
Unlike many other microprocessors, the Clipper processors were actually sets of several distinct chips. The C100 and C300 consist of three chips: one central processing unit containing both an integer unit and a floating point unit, and two cache and memory management units (CAMMUs), one responsible for data and one for instructions. The CAMMUs contained caches, translation lookaside buffers, and support for memory protection and virtual memory. The C400 consists of four basic units: an integer CPU, an FPU, an MMU, and a cache unit. The initial version used one chip each for the CPU and FPU and discrete elements for the MMU and cache unit, but in later versions the MMU and cache unit were combined into one CAMMU chip.
Registers and instruction set
The Clipper has 16 integer registers (R15 is used as the stack pointer), 16 floating-point registers (limited to 8 in e |
https://en.wikipedia.org/wiki/List%20of%20Los%20Angeles%20television%20stations | Los Angeles is currently defined by Nielsen Media Research as the second-largest television market in the United States, with all of the major U.S. television networks having affiliates serving the region. All of the major U.S. television networks are directly owned by the networks.
Currently, television stations that primarily serve Greater Los Angeles include:
2 KCBS-TV Los Angeles (CBS)*
3 KSGA-LD Los Angeles (LATV/Jewelry TV)
4 KNBC Los Angeles (NBC)*
5 KTLA Los Angeles (The CW)*
6 KHTV-CD Los Angeles (MeTV+)*
7 KABC-TV Los Angeles (ABC)*
8 KFLA-LD Los Angeles (NewsNet)
9 KCAL-TV Los Angeles (Independent)
10 KIIO-LD Los Angeles (Armenian independent)
11 KTTV Los Angeles (Fox)*
12 KZNO-LD Los Angeles (Jewelry TV)
13 KCOP-TV Los Angeles (MyNetworkTV)*
14 KPOM-CD Ontario (Catchy Comedy)*
18 KSCI Long Beach (ShopHQ)
20 KNLA-CD Los Angeles (Crossings TV)
20 KVME-TV Bishop (Jewelry TV)
22 KWHY-TV Los Angeles (Spanish Independent)
24 KVCR-DT San Bernardino (PBS)
25 KNET-CD Los Angeles (Multicultural independent)
26 KVHD-LD Los Angeles (Comfy TV)
27 KSFV-CD Los Angeles (Jewelry TV)
28 KCET Los Angeles (PBS)
30 KPXN-TV San Bernardino (Ion Television)*
31 KVMD Twentynine Palms (NTD America)
33 KRVD-LD Banning (Vietnamese independent)
34 KMEX-DT Los Angeles (Univision)*
35 KTAV-LD Los Angeles (Almavision)*
39 KHIZ-LD Los Angeles (beIN Sports Xtra)
40 KTBN-TV Santa Ana (TBN)*
44 KXLA Rancho Palos Verdes (LATV)
45 KSKJ-CD Van Nuys (Daystar Español)
46 KFTR-DT Ontario (UniMás)*
50 KOCE-TV Huntington Beach (PBS)
51 K03JB-D Temecula (Independent)
52 KVEA Corona (Telemundo)*
54 KAZA-TV Los Angeles (MeTV)*
56 KDOC-TV Anaheim (TCT)*
57 KJLA Ventura (Visión Latina)
58 KLCS Los Angeles (PBS)
62 KRCA Riverside (Estrella TV)*
63 KBEH Garden Grove (Canal de La Fe)
64 KILM Inglewood (Bounce)*
Asterisk (*) indicates channel is a network owned-and-operated station.
KZNO-LD additionally transmits with an experimental analog FM radio subcarrier that is accessible at .
Defunct stations
KBLM-LP—Riverside (1999–2016)
KEEF-TV—Los Angeles (1987)
KKOG-TV—Ventura (1968–69)
KPAL-LP—Palmdale (1989–2012)
KVST-TV—Los Angeles (1974–75)
KVKV-LP—Victorville
KVTU-LD—Agoura Hills (2004–10; 2016–20)
See also
Bally Sports SoCal
Bally Sports West
CBS News Los Angeles
NBC Sports California
Spectrum News 1
Spectrum SportsNet
Spectrum SportsNet LA
References
Lists of television channels in the United States |
https://en.wikipedia.org/wiki/Microsoft%20Mail | Microsoft Mail (or MSMail/MSM) was the name given to several early Microsoft e-mail products for local area networks, primarily two architectures: one for Macintosh networks, and one for PC architecture-based LANs. All were eventually replaced by the Exchange and Outlook product lines.
Mac Networks
The first Microsoft Mail product was introduced in 1988 for AppleTalk Networks. It was based on InterMail, a product that Microsoft purchased and updated. An MS-DOS client was added for PCs on AppleTalk networks. It was later sold off to become Star Nine Mail, then Quarterdeck Mail, and has long since been discontinued.
PC Networks
The second Microsoft Mail product, Microsoft Mail for PC Networks v2.1, was introduced in 1991. It was based on Network Courier, a LAN email system produced by Consumers Software of Vancouver BC, which Microsoft had purchased. Following the initial 1991 rebranding release, Microsoft issued its first major update as Version 3.0 in 1992. This version included Microsoft's first Global Address Book technology and first networked scheduling application, Microsoft Schedule+.
Versions 3.0 through 3.5 included email clients for MS-DOS, OS/2 1.31, Mac OS, Windows (both 16 and 32-bit), a separate Windows for Workgroups Mail client, and a DOS-based Remote Client for use over pre-PPP/pre-SLIP dialup modem connections. A stripped-down version of the PC-based server, Microsoft Mail for PC Networks, was included in Windows 95 and Windows NT 4.0. The last version based on this architecture was 3.5; afterwards, it was replaced by Microsoft Exchange Server, which started with version 4.0.
The client software was also named Microsoft Mail, and was included in some older versions of Microsoft Office such as version 4.x. The original "Inbox" (Exchange client or Windows Messaging) of Windows 95 also had the capability to connect to an MS Mail server.
Microsoft Mail Server was eventually replaced by Microsoft Exchange; Microsoft Mail Client, Microsoft Exchange Client, and Schedule+ were eventually replaced by Outlook (Windows and Mac).
Server Architecture
Microsoft Mail was a shared-file mail system; the "postoffice" was a passive database of files which could reside on any file server. Clients used mapped network drives and file sharing to write mail to the postoffice. Clients also acted as Message Transfer Agents (MTAs) for their own postoffices, moving around messages on the postoffice as needed, including queueing messages for outbound delivery to other postoffices, and processing messages queued as arriving from external sources.
Mail that needed to travel between postoffices were moved by an external MTA called External (external.exe), which originally ran on MS-DOS. A version of External for OS/2 1.31 was added with Microsoft Mail for PC Networks version 3.2, and a multitasking MTA for Windows NT was added with version 3.5. This ran in the OS/2 subsystem of Windows NT and Windows 2000, and consisted mostly of the Version 3.2a Externa |
https://en.wikipedia.org/wiki/Xara | Xara is an international software company founded in 1981, with an HQ in Berlin and development office in Hemel Hempstead, UK. It has developed software for a variety of computer platforms, in chronological order: the Acorn Atom, BBC Micro, Z88, Atari ST, Acorn Archimedes, Microsoft Windows, Linux, and more recently web browser-based services.
History
The company was founded in 1981 by Charles Moir. It started by developing for various 8-bit systems, such as the Acorn Atom and BBC Micro. It was originally called Computer Concepts, Ltd.; the company name was changed to Xara, Ltd., in 1995, and later to The Xara Group, Ltd. started to explore cloud developments, and since 2016 both companies have been subsidiaries of Xara GmbH.
Atari ST and Acorn Archimedes development
Dissatisfied with the evolution of Acorn's product range, having "stretched the BBC micro beyond the limit", Computer Concepts announced in late 1985 that the company would concentrate on development for the Atari ST, noting that its need for software was similar to that of the early days of the BBC Micro. Support was set to continue for the company's BBC Micro products, however, and despite showing the Atari ST at the Acorn User Exhibition in 1986, the company introduced new products for the BBC Micro: the Inter-Base and Inter-Word office suite products.
In 1986, Computer Concepts released its first piece of software for the Atari ST, Fast ASM, but the company's development focus returned to the Acorn platform when the Acorn Archimedes was released in 1987, pledging "almost exclusively ARM-related" development and indicating that software developed for the Archimedes would not merely be conversions of ST-based software already in progress. Various existing BBC Micro products were to be offered to run under emulation on the Archimedes, but the principal new product was to be a "WYSIWYG wordprocessor which makes full use of the RISC windowing environment". This word processor would eventually be released as Impression.
ArtWorks, the predecessor to Xara Xtreme, was released on the Archimedes, having been announced early in the life of the machine as an "object-orientated drawing package, similar to MacDraw in many respects". By the mid-1990s, the company had determined that the size of the Acorn market was not large enough to provide the revenues needed to invest in developing "the best new programs", and that the tools available for Windows (C++ compilers and class libraries) facilitating development of such new products were not likely to become available for the RISC OS platform, despite the company encouraging Acorn and others to provide them. Once again in its history, Computer Concepts insisted that it was not abandoning the Acorn market, noting the introduction of various product upgrades and peripherals for the Acorn machines, while promoting Xara Studio – "really like an ArtWorks Version 2" – to users of the Risc PC with PC processor card. Since the Computer Concepts na |
https://en.wikipedia.org/wiki/Boundary%20representation | In solid modeling and computer-aided design, boundary representation (often abbreviated B-rep or BREP) is a method for representing a 3D shape by defining the limits of its volume. A solid is represented as a collection of connected surface elements, which define the boundary between interior and exterior points.
Overview
A boundary representation of a model comprises topological components (faces, edges and vertices) and the connections between them, along with geometric definitions for those components (surfaces, curves and points, respectively). A face is a bounded portion of a surface; an edge is a bounded piece of a curve and a vertex lies at a point. Other elements are the shell (a set of connected faces), the loop (a circuit of edges bounding a face) and loop-edge links (also known as winged edge links or half-edges) which are used to create the edge circuits.
Compared to constructive solid geometry
Compared to the constructive solid geometry (CSG) representation, which uses only primitive objects and Boolean operations to combine them, boundary representation is more flexible and has a much richer operation set. In addition to the Boolean operations, B-rep has extrusion (or sweeping), chamfer, blending, drafting, shelling, tweaking and other operations which make use of these.
History
The basic method for BREP was developed independently in the early 1970s by both Ian C. Braid in Cambridge (for CAD) and Bruce G. Baumgart at Stanford (for computer vision). Braid continued his work with the research solid modeller BUILD which was the forerunner of many research and commercial solid modelling systems. Braid worked on the commercial systems ROMULUS, the forerunner of Parasolid, and on ACIS. Parasolid and ACIS are the basis for many of today's commercial CAD systems.
Following Braid's work for solids, a Swedish team led by Professor Torsten Kjellberg, developed the philosophy and methods for working with hybrid models, wire-frames, sheet objects and volumetric models during the early 1980s. In Finland, Martti Mäntylä produced a solid modelling system called GWB. In the USA Eastman and Weiler were also working on Boundary Representation and in Japan Professor Fumihiko Kimura and his team at Tokyo University also produced their own B-rep modelling system.
Initially CSG was used by several commercial systems because it was easier to implement. The advent of reliable commercial B-rep kernel systems like Parasolid and ACIS, mentioned above, as well as OpenCASCADE and C3D that were later developed, has led to widespread adoption of B-rep for CAD.
Boundary representation is essentially a local representation connecting faces, edges and vertices. An extension of this was to group sub-elements of the shape into logical units called geometric features, or simply features. Pioneering work was done by Kyprianou in Cambridge also using the BUILD system and continued and extended by Jared and others. Features are the basis of many other |
https://en.wikipedia.org/wiki/Weak%20artificial%20intelligence | Weak artificial intelligence (weak AI) is artificial intelligence that implements a limited part of mind, or, as narrow AI, is focused on one narrow task. In John Searle's terms it “would be useful for testing hypotheses about minds, but would not actually be minds”. Weak artificial intelligence focuses on mimicking how humans perform basic actions such as remembering things, perceiving things, and solving simple problems. As opposed to strong AI, which uses technology to be able to think and learn on its own. Computers are able to use methods such as algorithms and prior knowledge to develop their own ways of thinking like human beings do. Strong artificial intelligence systems are learning how to run independently of the programmers who programmed them. Weak AI is not able to have a mind of its own, and can only imitate physical behaviors that it can observe.
It is contrasted with Strong AI, which is defined variously as:
Artificial general intelligence: a machine with the ability to apply intelligence to any problem, rather than just one specific problem.
Human-level intelligence: a machine with a similar intelligence to an average human being.
Superintelligence: a machine with a vastly superior intelligence to the average human being.
Artificial consciousness: a machine that has consciousness, sentience and mind.
Scholars like Antonio Lieto have argued that the current research on both AI and cognitive modelling are perfectly aligned with the weak-AI hypothesis (that should not be confused with the "general" vs "narrow" AI distinction) and that the popular assumption that cognitively inspired AI systems espouse the strong AI hypothesis is ill-posed and problematic since "artificial models of brain and mind can be used to understand mental phenomena without pretending that that they are the real phenomena that they are modelling" (p. 85) (as, on the other hand, implied by the strong AI assumption).
AI can be classified as being “... limited to a single, narrowly defined task. Most modern AI systems would be classified in this category.” Narrow means the robot or computer is strictly limited to only being able to solve one problem at a time. Strong AI is conversely the opposite. Strong AI is as close to the human brain or mind as possible. This is all believed to be the case by philosopher John Searle. This idea of strong AI is also controversial, and Searle believes that the Turing test (created by Alan Turing during WW2, originally called the Imitation Game, used to test if a machine is as intelligent as a human) is not accurate or appropriate for testing strong AI.
Terminology
“Weak AI” is sometimes called “narrow AI”, but the latter is usually interpreted as subfields within the former. Hypothesis testing about minds or part of minds are typically not part of narrow AI, but rather implementation of some superficial lookalike feature. Many currently existing systems that claim to use “artificial intelligence” are likely oper |
https://en.wikipedia.org/wiki/Heterogeneous%20network | In computer networking, a heterogeneous network is a network connecting computers and other devices where the operating systems and protocols have significant differences. For example, local area networks (LANs) that connect Microsoft Windows and Linux based personal computers with Apple Macintosh computers are heterogeneous.
Heterogeneous network also describes wireless networks using different access technologies. For example, a wireless network that provides a service through a wireless LAN and is able to maintain the service when switching to a cellular network is called a wireless heterogeneous network.
HetNet
Reference to a HetNet often indicates the use of multiple types of access nodes in a wireless network. A Wide Area Network can use some combination of macrocells, picocells, and femtocells in order to offer wireless coverage in an environment with a wide variety of wireless coverage zones, ranging from an open outdoor environment to office buildings, homes, and underground areas. Mobile experts define a HetNet as a network with complex interoperation between macrocell, small cell, and in some cases WiFi network elements used together to provide a mosaic of coverage, with handoff capability between network elements. A study from ARCchart estimates that HetNets will help drive the mobile infrastructure market to account for nearly US$57 billion in spending globally by 2017. Small Cell Forum defines the HetNet as ‘multi-x environment – multi-technology, multi-domain, multi-spectrum, multi-operator and multi-vendor. It must be able to automate the reconfiguration of its operation to deliver assured service quality across the entire network, and flexible enough to accommodate changing user needs, business goals and subscriber behaviours.’
HetNet architecture
From an architectural perspective, the HetNet can be viewed as encompassing conventional macro radio access network (RAN) functions, RAN transport capability, small cells, and Wi-Fi functionality, which are increasingly being virtualized and delivered in an operational environment where span of control includes data center resources associated with compute, networking, and storage.
In this framework, self-optimizing network (SON) functionality is essential to enable order-of-magnitude network densification with small cells. Self-configuration or ‘plug and play’ reduces time and cost of deployment, while self-optimization then ensures the network auto-tunes itself for maximum efficiency as conditions change. Traffic demand, user movements and service mix will all evolve over time, and the network needs to adapt to keep pace. These enhanced SON capabilities will therefore need to take into account the evolving user needs, business goals and subscriber behaviors.
Importantly, functions associated with HetNet operations and management take earlier SON capability that may have only been targeted at a single domain or technology, and expand it to deliver automated service quality ma |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.