source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Lawrence%20L.%20Larmore | Lawrence L. Larmore is an American mathematician and theoretical computer scientist. Since 1994 he has been a professor of computer science at the University of Nevada, Las Vegas (UNLV). Larmore developed the package-merge algorithm for the length-limited Huffman coding problem, as well as an algorithm for optimizing paragraph breaking in linear time. He is perhaps best known for his work with competitive analysis of online algorithms, particularly for the k-server problem. His contributions, with his co-author Marek Chrobak, led to the application of T-theory to the server problem.
Larmore earned a Ph.D. in Mathematics in the field of algebraic topology from Northwestern University in 1965. He later earned a second Ph.D., this time in Computer Science, in the field of theoretical computer science from University of California, Irvine. He is a past member of Institute for Advanced Study in Princeton, New Jersey and Gastwissenschaftler (visiting scholar) at the University of Bonn.
Awards
NSF graduate fellowship (1961)
References
External links
Larmore's entry in the Mathematics Genealogy Project
Professor Larmore's research page
Professor Larmore's Webpage at UNLV
American computer scientists
20th-century American mathematicians
21st-century American mathematicians
University of Nevada, Las Vegas faculty
Academic staff of the University of Bonn
Northwestern University alumni
University of California, Irvine alumni
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Unique%20key | In relational database management systems, a unique key is a candidate key. All the candidate keys of a relation can uniquely identify the records of the relation, but only one of them is used as the primary key of the relation. The remaining candidate keys are called unique keys because they can uniquely identify a record in a relation. Unique keys can consist of multiple columns. Unique keys are also called alternate keys. Unique keys are an alternative to the primary key of the relation. In SQL, the unique keys have a UNIQUE constraint assigned to them in order to prevent duplicates (a duplicate entry is not valid in a unique column). Alternate keys may be used like the primary key when doing a single-table select or when filtering in a where clause, but are not typically used to join multiple tables.
Summary
Keys provide the means for database users and application software to identify, access and update information in a database table. There may be several keys in any given table. For example, in a table of employees, both employee number and login name are individually unique. The enforcement of a key constraint (i.e. a uniqueness constraint) in a table is also a data integrity feature of the database. The DBMS prevents updates that would cause duplicate key values and thereby ensures that tables always comply with the desired rules for uniqueness. Proper selection of keys when designing a database is therefore an important aspect of database integrity.
A relational database table may have one or more available unique keys (formally called candidate keys). One of those keys per table may be designated the primary key; other keys are called alternate keys.
Any key may consist of one or more attributes. For example, a Social Security Number might be a single attribute key for an employee; a combination of flight number and date might be a key consisting of two attributes for a scheduled flight.
There are several types of keys used in database modeling and implementations.
At the most basic definition, "a key is a unique identifier", so unique key is a pleonasm. Keys that are within their originating entity are unique within that entity. Keys that migrate to another entity may or may not be unique, depending on the design and how they are used in the other table. Foreign keys may be the primary key in another table; for example a PersonID may become the EmployeeID in the Employee table. In this case, the EmployeeID is both a foreign key and the unique primary key, meaning that the tables have a 1:1 relationship. In the case where the person entity contained the biological father ID, the father ID would not be expected to be unique because a father may have more than one child.
Here is an example of a primary key becoming a foreign key on a related table. ID migrates from the Author table to the Book table.
Author Table Schema:
Author(ID, Name, Address, Born)
Book Table Schema:
Book(ISBN, AuthorID, Title, Publisher, Price)
Here ID s |
https://en.wikipedia.org/wiki/ANCA%20%28company%29 | ANCA Pty Ltd (formerly Australian Numerical Control and Automation Pty Ltd) is an Australia company which designs and manufactures computer numerical controlled grinding machines. The company was founded in 1974 by Pat Boland and Pat McCluskey in Melbourne, Australia.
ANCA has its headquarters and main manufacturing plant in Melbourne where it employs about 400 people (2012). Since 2006 two additional plants have been opened in Thailand and Taiwan. The company is export-oriented and has expanded its operations by opening sales offices in nine other countries (2006 data) throughout America, Europe and Asia. In 2006 it won three Governor of Victoria Export Awards, and was reported to be a leader in its field of high-end precision grinders that are used in many industries including aeronautics and automotive production.
The company produces a range of computer numerical control (CNC) tool and cutter grinders to meet large-scale manufacturing and entry-level production requirements. The company also produces medical and dental drills.
ANCA has exported approximately 4000 machines, and was named Australian Exporter of the Year in 1999. The company is also the world's leading manufacturer of CNC Tool and Cutter Grinders. Its new subsidiary, ANCA Motion, is supplying computer controls to other Australian manufacturers and exporting to China and Taiwan.
ANCA designs and manufactures its own machines. Machines produced include:
CNC grinding machines
CNC tool and cutting machines
CNC sharpening machines
CNC tap manufacturing machines
CNC specialist stick-blade grinding machines
Applications
ANCA CNC machines are commonly used for the following applications:
Aerospace
Cutting tools
Medical
Woodworking
Awards
ANCA has won over 25 industry awards, including Australian Exporter of the Year in 1999 and the Institution of Engineers Australia - Engineering Excellence Award in 2001.
References
External links
ANCA Pty Ltd - Official ANCA website
ANCA Motion Pty Ltd - Official ANCA Motion website
Case Study JETRO Australia
Manufacturing companies of Australia |
https://en.wikipedia.org/wiki/Shell%20shoveling | Shell shoveling, in network security, is the act of redirecting the input and output of a shell to a service so that it can be remotely accessed, a reverse shell.
In computing, the most basic method of interfacing with the operating system is the shell. On Microsoft Windows based systems, this is a program called cmd.exe or COMMAND.COM. On Unix or Unix-like systems, it may be any of a variety of programs such as bash, ksh, etc. This program accepts commands typed from a prompt and executes them, usually in real time, displaying the results to what is referred to as standard output, usually a monitor or screen.
In the shell shoveling process, one of these programs is set to run (perhaps silently or without notifying someone observing the computer) accepting input from a remote system and redirecting output to the same remote system; therefore the operator of the shoveled shell is able to operate the computer as if they were present at the console.
See also
Console redirection
CTTY (DOS command)
Serial over LAN redirection (SOL)
References
Further reading
Computer network security
Command shells |
https://en.wikipedia.org/wiki/Tax%20Justice%20Network | The Tax Justice Network (TJN) is an advocacy group consisting of a coalition of researchers and activists with a shared concern about tax avoidance, tax competition, and tax havens.
Activity
Research
The TJN has reported on the OECD Base erosion and profit shifting (BEPS) projects and conducted their own research that the scale of corporate taxes being avoided by multinationals is an estimated $660bn in 2012 (a quarter of US multinationals’ gross profits), which is equivalent to 0.9% of World GDP.
In July 2012, following a study into wealthy individuals with offshore accounts, the Tax Justice Network published claims regarding deposits worth at least $21 trillion (£13 trillion), potentially even $32 trillion, in secretive tax havens. As a result, governments suffer a lack of income taxes of up to $280 billion.
In November 2020, the TJN published "The State of Tax Justice 2020" report. It claims $427 billion is lost every year to tax abuse.
Financial Secrecy Index
The Financial Secrecy Index is a biennial publication of the TJN which was started in 2009 and was last released in February 2020. It covers 133 global jurisdictions and produces a "Secrecy Indicator" score for each based on 20 qualitative criteria. Releases are widely covered in the media.
Corporate Tax Haven Index
The Corporate Tax Haven Index is a biennial publication of the TJN which had its inaugural publication in May 2019. It covers 64 global jurisdictions and produces a “Corporate Tax Haven Index” value by combining two core measures; first a "Haven Score" based on 20 mostly tax related criteria, second a "Global Scale Weight" showing the scale of activity. Release are widely covered in the media.
Publicity
Experts of TJN appeared at public hearings of the Finance Committee of the German Bundestag in 2016.
Funding
TJN has been rated as 'highly transparent' in its funding by Transparify and has been given an A grade for funding transparency by Who Funds You?
Leadership and authors
John Christensen, founding director and chief executive 2003-2016, board chair 2016-2021
Richard Murphy, co-founder and research director 2003-2010
Alex Cobham, chief executive since 2016
Notable authors who have worked with TJN include accounting scholar Prem Sikka, activist Sony Kapoor, journalist Nicholas Shaxson, and legal scholar Sol Picciotto.
See also
ATTAC
Tax Foundation
Offshore financial centre
Corporate haven
Tax haven
Notes
External links
Global Tax Alliance for Justice
Briefing Paper of the TJN
TJN Co-founder Richard Murphy Tax Blog
Bullough, Oliver. "The Fall of Jersey: How a Tax Haven Goes Bust," The Guardian online, 8 December 2015 - includes an interview with John Christensen, a native of Jersey, about the origins of TJN
Tax avoidance
Business ethics organizations
International taxation
Political organisations based in London
Tax organizations |
https://en.wikipedia.org/wiki/Carmella%20Cammeniti | Carmella Cammeniti (also Silvani and Sister Mary Catherine) is a fictional character from the Australian Network Ten soap opera Neighbours, played by Natalie Blair. She appeared on a recurring basis from 2003 to 2005, then became a main character from 2006 to 2008, before making a final guest appearance in 2011. Carmella was created as a replacement for Nina Tucker, portrayed by Delta Goodrem, who was written out of the series when Goodrem became ill. Her early storylines, including a romance with Connor O'Neill (Patrick Harvey), were originally intended for Nina. The daughter of a protective gangster father, Carmella was initially a "fun, feisty" character. She gradually became "tortured [and] depressive", with storylines which saw her attract the attention of a stalker, become a nun, suffer facial scarring, develop an addiction to prescription medication and lose her husband after a bushfire.
Carmella was the second member of the Cammeniti family to appear in Neighbours, after her father, Rocco (Robert Forza). She was later joined by her mother, sister, and two cousins. She had long-standing relationships with Marco Silvani (Jesse Rosenfeld) and Oliver Barnes (David Hoflin), the father of her daughter, Chloe (Sarah May). When Blair resigned from the serial in 2008 in order to pursue new projects, the producers arranged for a separated Carmella and Oliver to reunite. The two briefly returned three years later, to consolidate their family unit.
Blair won the "Most Popular New Female Talent" Logie Award for her portrayal of Carmella, and was additionally nominated for several Golden Logies and Inside Soap Awards. Critics have deemed Carmella as one of the series' most popular characters. Blair's versatility has attracted praise, though several publications have highlighted the implausibility of many of Carmella's storylines.
Storylines
Carmella is introduced as a barmaid at the Erinsborough bar Lou's Place. She becomes romantically involved with her colleague, Connor O'Neill (Patrick Harvey), to the disapproval of her father Rocco (Robert Forza). A feud with Connor's ex-girlfriend, Michelle Scully (Kate Keltie), results in Carmella slapping her and leaving the area. She later returns in 2004, reconciles with Connor and helps him to maintain access to his daughter Madeleine (Madison Lu). To prove that she is business-minded, Carmella becomes a magazine editor. She departs from Erinsborough suddenly after she becomes the victim of a stalker, Frank Romano (Lliam Amor). Before she leaves, she drives around with a shotgun in an attempt to kill Frank. Upon her return, Carmella loses Connor's affection to Serena Bishop (Lara Sacher). She attempts to ruin their relationship, which results in Serena's mother Liljana (Marcella Russo) slapping her to warn her off. Carmella then tries a different approach; she borrows money from her mother Lucia (Maria Mercedes) to pay for an operation Madeleine needs, then blackmails Connor into spending time with her. S |
https://en.wikipedia.org/wiki/Complex%20Networks | Complex Networks is an American media and entertainment company for youth culture, based in New York City. It was founded as a bi-monthly magazine, Complex, by fashion designer Marc (Ecko) Milecofsky. Complex Networks reports on popular and emerging trends in style, sneakers, food, music, sports and pop culture. Complex Networks reached over 90 million unique users per month in 2013 across its owned and operated and partner sites, socials and YouTube channels. The print magazine ceased publication with the December 2016/January 2017 issue. Complex currently has 6.02 million subscribers and 1.8 billion total views on YouTube. the company's yearly revenue was estimated to be US$200 million, 15% of which came from commerce.
Complex Networks has been named by Business Insider as one of the Most Valuable Startups in New York, and Most Valuable Private Companies in the World. Complex Networks CEO Rich Antoniello was named among the Silicon Alley 100. In 2012, the company launched Complex TV, an online broadcasting platform.
In 2016, it became a joint-venture subsidiary of Verizon and Hearst. Subsequently in 2021, BuzzFeed, Inc. announced the acquisition of the company.
History
Complex was established in 2002 by the founder of the Eckō Unltd. brand, Marc Ecko, as a print magazine aimed at providing young men a report of the latest in hip hop, fashion and pop culture without regard to race. The name Complex evolved from a slogan developed to promote the Eckō Unltd. website: "Ecko.complex". The idea was to create a men's magazine that combined Eckō's streetwear and hip hop attitude along with the style of Japanese men's magazines by providing consumer guides. This was achieved by creating a magazine in two sections: one traditional magazine, and the other a shopping guide.
In 2005, Complex was joined by senior publishing executive turned future CEO, Rich Antoniello and the former senior editor of Vibe magazine, Noah Callahan-Bever, who became editor-in-chief and chief content officer a year later. By 2006, Complex had begun to turn a profit which allowed the magazine to consider an expansion of their online presence. In April 2007, Complex soft-launched a media network with four websites: NahRight, Nice Kicks, SlamxHype and MoeJackson.
Complex
In September 2007, Complex launched Complex Media in order to fully capitalize on the trend toward digital content. In 2010, ad sales grew 154%. According to comScore, Complex got 12 million unique hits in March 2012. This encouraged large brands such as Coors, AT&T, Ford, McDonald's, Nike, Adidas and Apple to advertise within the collective. Complex now includes over 100 sites.
In 2011, Complex acquired Pigeons & Planes, an indie music and rap blog, and brought their total sites to 51 with monthly traffic of 25 million uniques. In 2012, Complex launched Four Pins, a humorous menswear site, edited by Fuck Yeah Menswear author Lawrence Schlossman; Sneaker Report, a performance footwear site; and First We Feast |
https://en.wikipedia.org/wiki/History%20TV18 | History TV18 (formerly known as The History Channel) is a television channel in India. It broadcasts infotainment and documentary shows. It is owned by a joint venture between A+E Networks, owner of the American History channel, and TV18, an Indian media group owned by Mukesh Ambani. It is available in five languages in full HD across the Indian subcontinent.
History
History was first launched as The History Channel on 30 November 2003. It was launched by a joint venture between AETN International and News Corporation's STAR, through its subsidiary NGC Networks. It had aired series like Boy's Toys, Biography, Conspiracy?, Crusades, Secret Agents and Breaking Vegas and television movies like Marilyn and Me. Following the expiration of the deal between AETN and STAR on 21 November 2008, STAR took over the channel and re-branded it as Fox History & Entertainment. That channel has since been re-branded again as Fox History & Traveller, then Fox Traveller and is currently available in India as Fox Life.
On 9 October 2011, The History Channel was re-launched in India as History TV18, by a joint venture between A+E Networks and TV18.
Programming
Original Programming
Morden marvels - Treasures of the Indus
Vital Stats of India
OMG! Yeh Hai Mera India'
OMG! Chhattisgarh
Taj Mahal History
Saving the GangaAnsuni Kahani – Shantanu (Untold Story of Shantanu and Cricket)
Saving the Western Ghats
Republic Day Line Up
Lost World of Kamasutra
India's Deadliest Roads
India On Four Wheels
India Showcase
India 70 Wonders
Independence Day Special
History of Sex
Genius
Air India 182
26/11 Mumbai Terror Attack
A Brush With Life:Satish Gujral
Bollywood@100
A Passage through India
Source:
Acquired Programming
Dynamo: Magician Impossible Four Rooms In Search of Aliens Metropolis Serial Killer Earth Tamas: India's partitionFrom History Channel
American Restoration Ancient Aliens Baggage Battles Barbarians Rising Biker Battleground Phoenix The Bible Bonnie & Clyde Cajun Pawn Stars Counting Cars Food Tech Forged In Fire Houdini Hunting Hitler Leepu & Pitbull Pawn Stars Pawn Stars UK Pawnography Smartest Guy in The Room
Spartan X
Stan Lee's Superhumans Storage WarsUpcoming product
Crassy Wheels''
References
External links
History Channel official website
Television channels and stations established in 2003
Television channels and stations disestablished in 2008
English-language television stations in India
Television stations in Mumbai
Television channels and stations established in 2011
Network18 Group
A&E Networks
2003 establishments in Maharashtra
2011 establishments in Maharashtra |
https://en.wikipedia.org/wiki/FastPath | The Kinetics FastPath was a LocalTalk-to-Ethernet bridge (now referred to as a router) created in 1985 to allow Apple Macintosh computers (which at the time only had LocalTalk network connections) to communicate with other computers on Ethernet networks. The product had five significant revisions (known as KFPS-1 through KFPS-5) during its lifetime and was ultimately sold to Shiva Networks late in its existence. The original FastPath was developed to extend AppleTalk on Ethernet for Apple Computer, but from the beginning it was also modeled after an implementation of the Stanford Ethernet - AppleTalk Gateway (SEAGATE) created at Stanford University Medical Center by Bill Croft in 1984 and 1985. SEAGATE was a combination of hardware and software that picked up IP packets from the Ethernet network and encapsulated them inside of DDP packets on the AppleTalk network and conversely picked up specially-encoded DDP packets on the AppleTalk network and placed them on the Ethernet network as IP packets.
Although a few sites used the original SEAGATE multibus hardware as defined, it served as a proof-of-concept and was eclipsed by the Kinetics FastPath and similar hardware gateways by other companies. However, many university and research FastPath owners continued to be able to run the Stanford gateway software (later called KIP incorporating MacIP) inside the Kinetics FastPath. This is because KIP was an open source interface to the Kinetics hardware and local modifications and adaptations could be made.
By 1987, Apple had begun shipping Macintosh computers that were capable of having Ethernet connections directly, but the LocalTalk networking products prospered into the early 1990s, due to the popularity of Apple's plug-and-play networking and the continued existence of popular LocalTalk devices such as the LaserWriter.
See also
GatorBox
LocalTalk-to-Ethernet bridge
MacIP
References
External links
Information about the Shiva FastPath 5
Networking hardware |
https://en.wikipedia.org/wiki/PowerBook%20180 | The PowerBook 180 is a portable computer released by Apple Computer along with the PowerBook 160 in October 1992. At the time, it constituted the new top-of-the-range model, replacing the previous PowerBook 170. Its case design and features are the same as that of the 170, but it shipped with the more powerful 33 MHz Motorola 68030 CPU and Motorola 68882 FPU. Along with the 160, it introduced a new power-saving feature which allowed the processor to run at a slower 16 MHz rate, the same speed as the original 140.
PowerBook 180
The PowerBook 180 came with a (diagonal) active matrix LCD screen capable of displaying 4-bit grayscale at a resolution of 640×400, and a trackball was mounted beneath the keyboard. A 1.44 MB floppy disk drive and 80 MB 2.5-inch hard drive were also standard.
The Apple Powerbook also gave an option of possible expansion to a 120 MB hard drive. They are equipped with keyboard stands to slant the keyboard.
Like the Macintosh Portable before it, with the addition of an external color video port (missing on the 170), the 180 became a full-featured, no-compromises desktop replacement, equivalent in performance to the Macintosh LC III+. It was sold until May 1994.
PowerBook 180c
In June 1993, Apple released an identical color version of this model, the PowerBook 180c. It had an diagonal active matrix color LCD capable of displaying 256 colors and was the first PowerBook to natively display 640×480 (all previous PowerBooks had 640×400 resolution). As a result of the thicker color display, the exterior case lid was redesigned, more closely resembling that used on the PowerBook Duo series. This modification was used on the PowerBook 165c for the same reason.
Timeline
References
External links
apple-history.com: PowerBook 180
180
68k Macintosh computers |
https://en.wikipedia.org/wiki/All%20in%20Good%20Faith | All in Good Faith is a British sitcom that aired on ITV from 1985 to 1988. Starring Richard Briers, it was written by John Kane. All in Good Faith was made for the ITV network by Thames Television.
Synopsis
Rev Lambe is vicar of All Saints Church in a typical middle England town. Each episode focusses on his role as mediator in various issues between parishioners or resolving the troubles of an individual.
Cast
Richard Briers - The Reverend Philip Lambe
Barbara Ferris - Emma Lambe (series 1 and 2)
Susan Jameson - Emma Lambe (series 3)
Lydia Smith - Miranda Lambe (series 1 and 2)
James Campbell - Peter Lambe (series 1 and 2)
James Cossins - Major Andrews (series 1)
Robert Bridges - Wilf (series 1)
Frank Middlemass - Desmond Frank (series 2 and 3)
T. P. McKenna - Oscar Randolph (series 2)
John Woodvine - Oscar Randolph (series 3)
Plot
All in Good Faith was written especially for its lead star, The Good Life actor Richard Briers. The series was his first ITV sitcom. He played the Reverend Philip Lambe who, in his middle age, decides to move from his wealthy Oxfordshire parish to one in Edendale, a fictional urban town in the Midlands. He is determined to do things in his new parish and is faced with new problems like homeless people. He is accompanied by his wife Emma, sixteen-year-old daughter Miranda and twelve-year-old son Peter.
Episodes
Series 1 (1985-6)
Series 2 (1987)
Series 3 (1988)
Special (1988)
Short special as part of ITV Telethon.
DVD release
References
Mark Lewisohn, "Radio Times Guide to TV Comedy", BBC Worldwide Ltd, 2003
All in Good Faith at British TV Comedy
External links
1985 British television series debuts
1988 British television series endings
1980s British sitcoms
English-language television shows
ITV sitcoms
Television series by Fremantle (company)
Television shows produced by Thames Television |
https://en.wikipedia.org/wiki/Parish%20Assembly%20%28Jersey%29 | A Parish Assembly in Jersey is the decision-making body of local government, comprising ratepayers (including mandataires) and electors of the parish.
The Parish Assembly:
sets the annual domestic rate according to the budget proposed by the Connétable;
elects members of the municipality, including the Roads Committee, Roads Inspectors, Vingteniers, Constable's Officers;
recommends liquor licences to the licensing bench;
adopts road names;
authorises the Procureurs du Bien Public to enter into contracts in the name of the parish;
may discuss other matters as proposed by the Connétable, or at the written request of a number of members of the Assembly
Municipal structure
Each parish is headed by a Constable (French: Connétable; Jèrriais: Connêtabl'ye) who is elected for a three-year period by the residents of the Parish.
The Constable is assisted in all matters by a Parish Municipality which consists of two Procureurs du Bien Public.
Vingtaines
The Parish is further divided into Vingtaines (or in Saint Ouen cueillettes). Each vingtaine is represented by two Vingteniers, two Roads Inspectors and three Constable's Officers. All are elected and sworn officers of the Royal Court.
Roads Committee
A Roads Committee of five elected principals is also available to offer advice on a range of issues; chiefly related to the roads. Centeniers are the highest ranking police officers in Jersey and are elected.
In Jersey, the Roads Committee (French: Comité des Chemins) is the highway authority for Parish roads in each Parish. In accordance with the Loi (1914) sur la Voirie it superintends the repair and maintenance of by-roads in the Parish, establishes boundary stones, issues Choses Publiques licenses, examines planning applications that fall within its responsibilities, supervises refuse collection, adjudicates fines during the Visite du Branchage, and proposes new road names, as may be necessary, for approval by the Parish Assembly. The Connétable presides over the Roads Committee which also includes the Rector and three Principals of the Parish [five Principals for St Helier] elected for a term of three years by the Parish Assembly.
Instructions are passed to Roads Inspectors whose duty it is to ensure that the repairs are carried out.
In St. Helier, the larger Roads Committee also undertakes additional non-statutory responsibilities with regard to parks and other matters, and acts, in the absence of a municipal council, as an advisory body to the Connétable. By convention, the two Procureur du Bien Public of St. Helier attend meetings of the Roads Committee, but cannot vote.
Roads Inspectors
The Parish Assembly elects two Roads Inspectors for each Vingtaine [or Cueillette in St Ouen] for a three-year term of office in accordance with the Loi (1914) sur la Voirie. Roads Inspectors are responsible for the repair of by-roads of the Parish and have to ensure the instructions of the Roads Committee are carried out.
In the Parish of St Helier, the R |
https://en.wikipedia.org/wiki/Comparison%20of%20eDonkey%20software | The following tables compare general and technical information for a number of available applications supporting the eDonkey network.
General
Features
Features (continued)
Versions
See also
Comparison of file sharing applications
File sharing
Notes
References
External links
(Incomplete) list of eMule mods (German)
eMule mod download archive (German)
File sharing software
Network software comparisons |
https://en.wikipedia.org/wiki/A-normal%20form | In computer science, A-normal form (abbreviated ANF, sometimes expanded as administrative normal form) is an intermediate representation of programs in functional programming language compilers.
In ANF, all arguments to a function must be trivial (constants or variables). That is, evaluation of each argument must halt immediately.
ANF was introduced by Sabry and Felleisen in 1992 as a simpler alternative to continuation-passing style (CPS). Some of the advantages of using CPS as an intermediate representation are that optimizations are easier to perform on programs in CPS than in the source language, and that it is also easier for compilers to generate machine code for programs in CPS. Flanagan et al. showed how compilers could use ANF to achieve those same benefits with one source-level transformation; in contrast, for realistic compilers the CPS transformation typically involves additional phases, for example, to simplify CPS terms.
Grammar
Consider the pure λ-calculus with weak reduction and let-expressions. The ANF restriction is enforced by
allowing only constants, λ-terms, and variables, to serve as arguments of function applications, and
requiring that the result of a non-trivial expression be captured by a let-bound variable or returned from a function.
The following BNF grammar describes the syntax of λ-expressions modified to support the constraints of ANF:
EXP ::= VAL
| let VAR = VAL in EXP
| let VAR = VAL VAL in EXP
VAL ::= VAR
| λ VAR . EXP
Variants of ANF used in compilers or in research often allow constants, records, tuples, multiargument functions, primitive operations and conditional expressions as well.
Examples
The expression:
f(g(x),h(y))
is written in ANF as:
let v0 = g(x) in
let v1 = h(y) in
f(v0,v1)
By imagining the sort of assembly this function call would produce:
;; let v0 = g(x)
move x into args[0]
call g
move result into temp[0]
;; let v1 = h(y)
move y into args[0]
call h
move result into temp[1]
;; f(v0, v1)
move temp[0] into args[0]
move temp[1] into args[1]
call f
One can see the immediate similarities between ANF and the compiled form of a function; this property is a part of what makes ANF a good intermediate representation for optimisations in compilers.
See also
Continuation-passing style
Static single assignment form
References
Functional programming
Implementation of functional programming languages |
https://en.wikipedia.org/wiki/Polygonizer | In computer graphics, a polygonizer is a software component for converting a geometric model represented as an implicit surface to a polygon mesh.
References
Computer graphics |
https://en.wikipedia.org/wiki/NCSA%20Telnet | NCSA Telnet is an implementation of the Telnet protocol developed at the National Center for Supercomputing Applications of the University of Illinois at Urbana-Champaign, first released in 1986 and continuously developed until 1995. The initial implementation ran under Mac OS and Microsoft MS-DOS, and provided basic DEC VT102 terminal emulation with support for multiple simultaneous connections and an internal FTP server. NCSA Telnet was the first implementation of telnet for the Macintosh or PC that provided the ability to connect to multiple hosts simultaneously.
Over time, the program evolved with added features and revisions to the user interface. Support for Tektronix 4010/4014 vector terminal emulation and a protocol for downloading and viewing raster images were added.
In 1987, a short-lived version for Sun Microsystems SunOS was released.
Although the MS-DOS version of NCSA Telnet lost popularity after Microsoft Windows became widespread, the Macintosh version remained in use throughout the 1990s as a basic connectivity tool in academic and commercial installations.
NCSA Telnet originally used a built-in TCP/IP protocol stack to communicate over the network. As standard APIs became available for network communication, the program was adapted to use them, most notably Apple's MacTCP. However, the built-in stack, one of the few completely independently developed TCP/IP stacks in use at the time, continued to ship in the software for years.
NCSA Telnet was released as free and open source software (although the term "open source" was not yet in use), and as such spawned a number of spin-off products including
BetterTelnet
Brown tn3270
BYUTelnet
InterCon's TCP/Connect series
MacBlue Telnet (Chinese-language version)
MacTelnet
NCSA Telnet-J (Japanese-language version)
References
External links
Free terminal emulators
1986 software
Clear text protocols
History of the Internet
Telnet |
https://en.wikipedia.org/wiki/CFLAGS | CFLAGS and CXXFLAGS are either the name of environment variables or of Makefile variables that can be set to specify additional switches to be passed to a compiler in the process of building computer software. FFLAGS fulfills a similar role.
These variables are usually set inside a Makefile and are then appended to the command line when the compiler is invoked. If they are not specified in the Makefile, then they will be read from the environment, if present. Tools like autoconf's ./configure script will usually pick them up from the environment and write them into the generated Makefiles. Some package install scripts, like SDL, allow CFLAGS settings to override their normal settings (instead of append to them), so setting CFLAGS can cause harm in this case.
CFLAGS enables the addition of switches for the C compiler, while CXXFLAGS is meant to be used when invoking a C++ compiler. Similarly, a variable CPPFLAGS exists with switches to be passed to the C or C++ preprocessor. Similarly, FFLAGS enables the addition of switches for a Fortran compiler.
These variables are most commonly used to specify optimization or debugging switches to a compiler, as for example -g, -O2 or (GCC-specific) -march=athlon.
See also
Compiler optimization
References
External links
GNU optimization page
Gentoo Wiki CFLAG guide
Gentoo Wiki guide to safe CFLAGS
Linux Review page on optimized gcc compiling
Build automation
C (programming language)
C++ |
https://en.wikipedia.org/wiki/Truespeech | Truespeech is a proprietary audio codec produced by the DSP Group. It is designed for encoding voice data at low bitrates (8.5kbps for 8kHz samples), and to be embedded into DSP chips.
Truespeech had been integrated into Windows Media Player in older versions of Windows, but no longer supported since Windows Vista. It was also the format used by the voice chat features of Yahoo! Messenger. It is implemented through the Tsd32.dll
A Truespeech decoder was implemented in the 0.5 release of FFmpeg.
References
Audio codecs |
https://en.wikipedia.org/wiki/Hot%20%28Israel%29 | Hot Telecommunication Systems Ltd. () is a company that provides cable television, last-mile Internet access, broadband and telecommunication services in Israel. It also provides various data transmission services and network services at different rates, services to the business sector and other ancillary services.
In November 2004, Hot Telecom commenced providing domestic fixed line telephone services to residential and business subscribers. The company’s shares were traded on the Tel Aviv Stock Exchange and was a constitute of the TA-100 Index until its acquisition by Altice. In March 2013, the company employed 3,958 workers.
History
The company was founded on 18 August 2003 as union of the three national cable companies in Israel: Matav, Tevel and Golden Channels that can be directly linked to the growing competition of the local satellite television provider Yes. While these companies had pursued a union since the late 1990s in order to save administrative and content purchasing costs, and especially after Yes was founded in order to stop it before it could grow, the Israeli government monopoly regulator had denied it until the time when Yes had grown at least a minimum subscriber base. The three original companies had not competed with each other since each had been regulated with specific cities and regions.
Hot offers about 200 local and foreign-language channels in its digital television services. Hot also offers several exclusive channels under the Hot brand name. In addition to the digital television services, Hot still provides an analog television service, despite plans to abandon it by 2012, but it has already disconnected the analog service in many areas including central Israel, in favor of digital signals. Many HOT subscribers must now have a decoder box to view broadcasts.
Not long after it was created, Hot began offering local telecom service using VoIP, a voice-over-internet technology and internet access services as well. Hot is not an Internet service provider and is only permitted to offer last mile access. , Hot had about 950,000 customers; 60% using the digital television services, over 400,000 using the internet services and over 100,000 using the phone services.
As of late 2005, Hot offered a wide VOD service, offering content from almost all channels and content that is not broadcast by other companies.
In 2009, businessman Patrick Drahi increased his stake in the company. Drahi completed the takeover in 2011, and offered to buy remaining shares in 2012. As a result, Hot is a part of Drahi's company, Altice Europe NV, as of 2018.
In December 2010, Hot received a license to operate an Internet service provider in the form of a subsidiary. In February 2021, Israel's Ministry of Communications approved Hot's NIS 170 million investment in the fiber-optic infrastructure venture IBC, subject to a number of antitrust conditions.
In 2018, Hot started broadcasting the Kan11 channel at 4K resolution for the first time at |
https://en.wikipedia.org/wiki/LIFL | LIFL may refer to:
Laboratoire d'Informatique Fondamentale de Lille, a computer science research laboratory of Lille University of Science and Technology. |
https://en.wikipedia.org/wiki/Hz-program | Hz-program was a proprietary, patented typographic composition computer program, created by German typeface designer Hermann Zapf. The goal of this program was - "To produce the perfect grey type area without the rivers and holes of too-wide word spacing."
History
In a 1993 essay, Zapf explained the history of Hz-program, which included work at Harvard University prior to his current work at the Rochester Institute of Technology, the first university in the world to establish a chair for research and development on the basic structures of typographic computer programs. He cited the development of the Macintosh as a big step:
... in 1984 Steve Jobs with his Macintosh started in a completely new direction. New software was needed, and typographic presentation on the screen could be more varied and easier to handle. The possibility of getting various typefaces without any big investment enlarged the typographic palette very quickly in the following years. More and more quality was wanted, and plenty of computer space was now available and cheap for everybody. Software was offered for all kinds of solutions from many new companies. This was the time formed to begin work again on a high-level typographic computer program. People now took such ideas seriously and not just as the dreams of a perfectionist. What was tailored at RIT in the seventies has been refined in a final version together with URW in Hamburg since 1988. Our goal was to include all the digital developments available.
How it works
Little is known about the composition algorithm created by Zapf and implemented in Hz-program; in the same essay, Zapf stated it is "partly based on a typographically acceptable expansion or condensing of letters, called scaling. Connected with this is a kerning program, which calculates kerning values at 100 pairs per second. The kerning is not limited only to negative changes of space between two critical characters, but also allows in some cases positive kerning, which means the addition of space."
The Hz-program was patented by URW (the patent expired in July 2010). Later, it was acquired by Adobe Systems for inclusion as the composition engine in Adobe InDesign application. It is not known if the Hz-program algorithm is still included in latest releases of InDesign.
According to Zapf, Hàn Thế Thành made a detailed analysis of the Hz-program for microtypography extensions to the TeX typesetting system and implemented them in pdfTeX. These are available as part of the LaTeX and ConTeXt typesetting packages.
Myth
The quality of the text composition produced by Hz-program, together with the lack of details of its inner working, created some mythology about it. Zapf greatly contributed to this, claiming to have reached the same level as Johannes Gutenberg. The particular technique of condensing and expanding characters (glyph scaling) which is an essential part of the Hz-program, and which is now an option in Adobe InDesign and pdfTeX, has aroused cr |
https://en.wikipedia.org/wiki/Mobile%20country%20code | The ITU-T Recommendation E.212 defines mobile country codes (MCC) as well as mobile network codes (MNC).
Overview
The mobile country code consists of three decimal digits and the mobile network code consists of two or three decimal digits (for example: MNC of 001 is not the same as MNC of 01). The first digit of the mobile country code identifies the geographic region as follows (the digits 1 and 8 are not used):
0: Test networks
2: Europe
3: North America and the Caribbean
4: Asia and the Middle East
5: Australia and Oceania
6: Africa
7: South and Central America
9: Worldwide (Satellite, Air—aboard aircraft, Maritime—aboard ships, Antarctica)
An MCC is used in combination with an MNC (a combination known as an "MCC/MNC tuple") to uniquely identify a mobile network operator (carrier) using the GSM (including GSM-R), UMTS, LTE, and 5G public land mobile networks. Some but not all CDMA, iDEN, and satellite mobile networks are identified with an MCC/MNC tuple as well. For WiMAX networks, a globally unique Broadband Operator ID can be derived from the MCC/MNC tuple. TETRA networks use the mobile country code from ITU-T Recommendation E.212 together with a 10-bit binary mobile network code. However, a TETRA network may be assigned an E.212 network code as well. Some network operators do not have their own radio access network at all. These are called mobile virtual network operators (MVNO) and are marked in the tables as such. Note that MVNOs without their own MCC/MNC (that is, they share the MCC/MNC of their host network) are not listed here.
The following tables attempt to provide a complete list of mobile network operators. Country information, including ISO 3166-1 alpha-2 country codes is provided for completeness. Mostly for historical reasons, one E.212 MCC may correspond to multiple ISO country codes (e.g., MCC 362 corresponds to BQ, CW, and SX). Some operators also choose to use an MCC outside the geographic area that it was assigned to (e.g. Digicel uses the Jamaica MCC throughout the Caribbean). ITU-T updates an official list of mobile network codes in its Operational Bulletins which are published twice a month. ITU-T also publishes complete lists: as of January 2019 list issued on 15 December 2018 was current, having all MCC/MNC before 15 December 2018. The official list is often incomplete as national MNC authorities do not forward changes to the ITU in a timely manner. The official list does not provide additional details such as bands and technologies and may not list disputed territories such as Abkhazia or Kosovo.
Test networks
National operators
International operators
British Indian Ocean Territory (United Kingdom) – IO
See also
Mobile Network Codes in ITU region 2xx (Europe)
Mobile Network Codes in ITU region 3xx (North America)
Mobile Network Codes in ITU region 4xx (Asia)
Mobile Network Codes in ITU region 5xx (Oceania)
Mobile Network Codes in ITU region 6xx (Africa)
Mobile Network Codes in ITU region 7xx ( |
https://en.wikipedia.org/wiki/Kevin%20Eschenfelder | Kevin Eschenfelder is an American sportscaster who currently serves as the primary host of Houston Astros and Houston Rockets pregame and postgame on Space City Home Network. Eschenfelder also works in radio as the play-by-play announcer for Houston Cougars football games since their start in the American Athletic Conference and current in-studio host and fill-in television play-by-play announcer for the Houston Astros.
Early career
When Eschenfelder was in elementary school, his father worked as a statistician and spotter for the Houston Oilers, giving him access to the radio press box at the Astrodome. At the age of 15, he began helping his dad keep statistics for the Houston Astros and Houston Oilers.
Eschenfelder graduated from Dulles High School in Sugar Land, Texas. During his senior year at Dulles, he began working as a statistician for the Home Sports Entertainment (HSE) network and interned at Newsradio 740 KTRH.
Eschenfelder attended Alvin Community College, where he served as the voice announcer for Alvin High School sporting events on KACC (the on-campus radio station for ACC). Just before he graduated from Alvin Community College, Eschenfelder got hired as a play-by-play announcer for Houston Baptist University (an NCAA Division I team at the time) at HSE. Eschenfelder's first event for Home Sports Entertainment was a Houston Baptist University basketball game with Greg Lucas in 1987.
In 1990, Eschenfelder graduated with a bachelor's degree from the .
Fox Sports Net
Eschenfelder joined Home Sports Entertainment (later known as Fox Sports Net) full-time in June 1991 and worked pre- and postgame shows for 17 seasons, with stints in Dallas–Fort Worth and Houston. His pre- and postgame commitments included coverage of the Dallas Mavericks, Houston Rockets and San Antonio Spurs NBA teams as well as the Dallas Stars NHL team.
During baseball season, he anchored shows for the Houston Astros and Texas Rangers and has said his favorite memory with HSE/Prime Sports/FSN was Game 6 of the 2005 National League Championship Series when the Astros clinched their first pennant.
Eschenfelder became known to Houston viewers during Rockets and Astros games as the in-studio host for "Club House," a pre-game show that later evolved "Southwest Sports Tonight." Southwest Sports Tonight was a half-hour program on FSN Southwest and its Houston-area feed, FSN Houston, but also complemented its regional news program, the "Southwest Sports Report" on non-event nights.
Eschenfelder's additional contributions includes calling college football and basketball play-by-play for the Southland Conference, Southwest Conference, Big 12 Conference, and WAC. Eschenfelder has also served as a fill-in analyst during Astros telecasts and fill-in play-by-play voice for Dallas Mavericks games with Fox Sports Southwest.
Eschenfelder bid farewell to viewers over an Astros telecast on September 20, 2012. His final day with the station was September 21, 2012.
Space City H |
https://en.wikipedia.org/wiki/Cartoon%20Network%20%28Australian%20and%20New%20Zealand%20TV%20channel%29 | Cartoon Network Australia & New Zealand is an Australian pay television channel launched on October 3, 1995 and owned by Warner Bros. Discovery Asia-Pacific. It primarily shows animated programming.
The channel began broadcasting as a part of the Cartoon Network Asia service on June 30, 1995. It was later separated from the broader pan-Asian service on October 3, 1995.
History
Cartoon Network started its broadcast in Australia in 1995 as the dual-channel TNT & Cartoon Network as part of the Foxtel cable TV launch, operating from 6:00 a.m. to 9:00 p.m., with Turner Classic Movies (formerly TNT) taking the remainder of the daily schedule. On July 1, 1997, Cartoon Network Australia became a separate 24-hour channel, with exclusive local feeds for Sydney, Melbourne, Brisbane, Perth, Adelaide, Newcastle, Darwin, etc. It originally aired only Hanna-Barbera cartoons such as Yogi Bear, Top Cat, The Flintstones etc. The channel quickly started to develop though, airing for the first time MGM cartoons (Tom and Jerry, Droopy, and Spike and Tyke) on 1 January 1996, and (after Time Warner's purchase of Turner in 1996) Warner Bros. shows (Looney Tunes, and several other Looney Tunes related cartoons) on January 1, 1997. In mid-1997, Cartoon Network started to air its first original shows (Space Ghost Coast to Coast, Dexter's Laboratory and The Moxy Show).
In April 2004, the channel was added to TransTV. Cartoon Network had, up until mid-2004, been tied with the Disney Channel as Australia's most popular family network. The removal of older programming from the network during this period led to a fall in average audience share during 2004 as fans of older cartoons moved to Boomerang. Cartoon Network had slipped to second spot among Australian family networks behind the Disney Channel.
In February 2008, Adult Swim relaunched on The Comedy Channel airing shows such as Robot Chicken and Harvey Birdman, Attorney at Law. The network transitioned to a widescreen format presentation on 30 November 2010, ahead of a deadline by Foxtel to do so.
On February 7, 2017, Cartoon Network Australia announced an exclusive video on-demand content deal with the streaming service Stan. As part of the deal, episodes from some shows such as Adventure Time and The Powerpuff Girls will premiere on Stan at the same time as the Cartoon Network Australia channel.
On April 22, 2021, the channel was discontinued on Fetch TV, alongside its sister channel Boomerang.
On January 8, 2022, the channel rebranded to Redraw Your World with new graphics and a new typeface.
Programming
Current
50/50 Heroes
Adventure Time
The Amazing World Of Gumball
Boy Girl Dog Cat Mouse Cheese
Clarence
Cupcake & Dino: General Services
Ekans - Snakes Awake
Grizzy & the Lemmings
Jellystone!
Lamput
Looney Tunes Cartoons
Mechamato
Monkie Kid
Regular Show
Steven Universe
Summer Camp Island
Teen Titans Go!
We Bare Bears
Former
League of Super Evil (2010–2016)
Yogi Bear
Top Cat
The Flintsto |
https://en.wikipedia.org/wiki/Dan%20Paymar | Dan Paymar is a video poker expert with a background in computer programming and engineering. He has worked for such companies as Encyclopædia Britannica, Bendix Computer, and Control Data in a career spanning 30 years. He also helped start Educational Data Systems (later renamed Point 4 Data Corp.), which developed products for the Data General Nova computer. He left Point 4 in 1982 to market his own products for the Apple II computer.
Paymar moved to Las Vegas in 1988 and began working as a poker dealer in a casino. He started playing video poker on a regular basis and soon developed a directory of the best video poker games. This directory lead to the 1992 book Video Poker - Precision Play which went through 10 editions. This began his career as a video poker author and expert, leading to his well-known 1998 book Video Poker - Optimum Play.
For 14 years he edited and published his own newsletter, the Video Poker Times. He also had a long standing relationship with the Casino Gaming School of Nevada.
The primary difference between Dan and other video poker experts is that he is not a professional gambler, considering himself a skilled recreational player. He devotes his efforts to productive endeavours, including putting his long training and experience in mathematics and programming to work in analysing video poker games. His latest product is "Optimum Video Poker", an analysis and trainer program for Macintosh, Windows and Linux platforms. This is the only such program being marketed by its primary developer, who is also an active player, and it includes more features for bankroll requirements than any other such program, and features a training mode that teaches correct play according to a strategy chart of the player's choice that is displayed alongside the game window.
See also
Bob Dancer
Lenny Frome
Arnold Snyder
External links
Official site
Video Poker 365 profile
American gambling writers
American male non-fiction writers
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Cray%20SV1 | The Cray SV1 is a vector processor supercomputer from the Cray Research division of Silicon Graphics introduced in 1998. The SV1 has since been succeeded by the Cray X1 and X1E vector supercomputers. Like its predecessor, the Cray J90, the SV1 used CMOS processors, which lowered the cost of the system, and allowed the computer to be air-cooled. The SV1 was backwards compatible with J90 and Y-MP software, and ran the same UNIX-derived UNICOS operating system. The SV1 used Cray floating point representation, not the IEEE 754 floating point format used on the Cray T3E and some Cray T90 systems.
Unlike earlier Cray designs, the SV1 included a vector cache. It also introduced a feature called multi-streaming, in which one processor from each of four processor boards work together to form a virtual processor with four times the performance. The SV1 processor was clocked at 300 MHz. Later variants of the SV1, the SV1e and SV1ex, ran at 500 MHz, the latter also having faster memory and support for the SSD-I Solid-State Storage Device. Systems could include up to 32 processors with up to 512 shared memory buses.
Multiple SV1 cabinets could be clustered together using the GigaRing I/O channel, which also provided connection to HIPPI, FDDI, ATM, Ethernet and SCSI devices for network, disk, and tape services. In theory, up to 32 nodes could be clustered together, offering up to one teraflops in theoretical peak performance.
References
Computer-related introductions in 1998
Sv1
Vector supercomputers |
https://en.wikipedia.org/wiki/Animax%20Taish%C5%8D | , also known as Animax Awards, is a Japanese anime scriptwriting competition organized by the Japanese anime satellite television network, Animax, a subsidiary of Sony Pictures Entertainment.
History and broadcasts
Held annually since 2002, the competition awards the best original anime scripts submitted across Japan, judged by a panel of noted manga artists, animators and anime creators, which has included Ryōsuke Takahashi and Kaiji Kawaguchi among others, and which subsequently gets animated into an anime by a noted Japanese animation studio for broadcast on Animax's networks the following year. Winners of the Animax Award have gone on to forge successful careers in the anime and manga industry, with the second award winner, Yūko Kawabe going on to co-write Ergo Proxy and Tweeny Witches, among others, while the fourth winner, Ikuko Yoshinari, went on to publish a shōjo manga for Ribon.
The first four award-winning screenplays were animated by each of Animax's co-founders, the studios Sunrise, Toei Animation, and Tokyo Movie Shinsha, while the fifth and seventh were animated by Production I.G and the sixth animated by Sony's A-1 Pictures. In 2007, the awards were made open to Animax's viewers across its networks worldwide, under the name Animax Awards, with one of the winning scripts going on to be animated into the anime movie LaMB.
The seventh iteration of the award, in 2008, was won by Kenji Saidō, for his entry Shoka (lit. "Calligraphy"), and will be animated by Production I.G and to be broadcast on Animax's networks in 2009. The seventh iteration of the competition received a record of 1,235 entries, the largest in the competition's seven-year history, and its judging panel included manga artist Kaiji Kawaguchi, Detroit Metal City film screenwriter Mika Ōmori and Densha Otoko film screenwriter Arisa Kaneko. The award ceremony for the seventh iteration was also broadcast in Japan on November 9, 2008.
Winners
Super Kuma-san
—the first winner of the annual Animax Taishō in 2002.
Original concept/story:
Director: Yukio Kaizawa
Character design: Daisuke Yoshida
Cast: Taiki Matsuno, others.
Production: Toei Animation
Azusa, Otetsudai Shimasu!
—the second winner of the annual Animax Taishō in 2003.
Original concept/story:
Director: Hajime Kamegaki
Original character design: Rie Nakajima
Cast: Mamiko Noto, others.
Production: Tokyo Movie Shinsha (TMS Entertainment)
Hotori ~ Tada Saiwai wo Koinegau
—the third winner of the annual Animax Taishō in 2004.
Original concept/story:
Director: Takeshi Annō
Character design: Shin'ichi Yamashita
Creative producer: Ryōsuke Takahashi
Cast: Ryōko Shiraishi, others.
Production: Sunrise
Lily to Kaeru to (Ototo)
—the fourth winner of the annual Animax Taishō in 2005. A manga adaptation was serialized in Shueisha's Ribon shōjo magazine.
Original concept/story:
Director: Yuriko Kado
Character design: Kozue Komatsu
Cast: Chinami Nishimura, others
Production: Toei Animation
Yumedama |
https://en.wikipedia.org/wiki/Integrated%20Ocean%20Observing%20System | The Integrated Ocean Observing System (IOOS) is an organization of systems that routinely and continuously provides quality controlled data and information on current and future states of the oceans and Great Lakes from the global scale of ocean basins to local scales of coastal ecosystems. It is a multidisciplinary system designed to provide data in forms and at rates required by decision makers to address seven societal goals.
IOOS is developing as a multi-scale system that incorporates two, interdependent components, a global ocean component, called the Global Ocean Observing System, with an emphasis on ocean-basin scale observations and a coastal component that focuses on local to Large Marine Ecosystem (LME) scales.
Large Marine Ecosystems (LMEs) in U.S. coastal waters and IOOS Regional Associations.
Many of IOOS' component regional systems are being dismantled for lack of federal funding, including the Gulf of Maine Ocean Observing System GoMOOS . This has resulted in the loss of long term data sets and information used by Coast Guard search and rescue operations.
Regional associations
The coastal component consists of Regional Coastal Ocean Observing Systems (RCOOSs) nested in a National Backbone of coastal observations. From a coastal perspective, the global ocean component is critical for providing data and information on basin scale forcings (e.g., ENSO events), as well as providing the data and information necessary to run coastal models (such as storm surge models).
Alaska Ocean Observing System (AOOS)
Central California Ocean Observing System (CeNCOOS)
Great Lakes Observing System (GLOS)
Gulf of Maine Ocean Observing System (GoMOOS)
Gulf of Mexico Coastal Ocean Observing System (GCOOS)
Pacific Islands Ocean Observing System (PacIOOS)
Mid-Atlantic Coastal Ocean Observing Regional Association (MACOORA)
Northwest Association of Networked Ocean Observing Systems (NANOOS)
Southern California Coastal Ocean Observing System (SCCOOS)
Southeast Coastal Ocean Observing Regional Association (SECOORA)
Caribbean Integrated Ocean Observing System (CarICOOS)
See also
GOOS
Global Earth Observing System of Systems (GEOSS)
Ocean acoustic tomography
Argo (oceanography)
Alliance for Coastal Technologies
Omnibus Public Land Management Act of 2009 (authorizing legislation for IOOS)
References
External links
Monterey Accelerated Research System (MARS)
Regional Associations
Coastal Ocean Observing System
Social & Economic Benefits of IOOS from "NOAA Socioeconomics" website initiative
Rutgers University RU27 through the IOOS - Smithsonian Ocean Portal
Oceanography
Earth observation projects
Oceanographic organizations |
https://en.wikipedia.org/wiki/OCFA | OCFA may refer to:
Odd-chain fatty acid
Orange County Fire Authority
Open Computer Forensics Architecture |
https://en.wikipedia.org/wiki/European%20route%20E15 | The European route E15 is part of the United Nations international E-road network. It is a north–south "reference road", running from Inverness, Scotland south through England and France to Algeciras, Spain. Along most of its route between Paris and London, the road parallels the LGV Nord (as the French A1 autoroute) and High Speed 1 (as the English M20 motorway). Its length is .
Features
The E15 has a gap at the English Channel between Dover and Calais, France. There is a ferry link between Dover and Calais. The Eurotunnel Shuttle (using the Channel Tunnel) provides an alternative link via Folkestone.
The roads in the UK are signed solely by the local number (e.g. M20).
Route
: Inverness - Perth
: Perth - M90
: M90 - M8 (Interchange with E16)
: Edinburgh
: Edinburgh City Bypass
: Edinburgh - Gateshead (Interchange with E18 at A69 Newcastle upon Tyne)
: Gateshead - Pontefract (Interchange with E20 and E22 at M62)
: Pontefract - Doncaster
: Doncaster Bypass (Interchange with E13 at M18)
: Doncaster - Peterborough
: Peterborough - Huntingdon (Interchange with E24 at A14)
: Huntingdon - Stevenage
: Stevenage - M25
: London Orbital (Multiplex with E30 between A1(M) and A12)
: Dartford Crossing (Charge)
: London Orbital
: Channel Tunnel
Gap (English Channel)
: Folkestone - Calais
: Calais (E 40 E 402)
: Calais (E 40) - Arras (E 17)
: Arras (E 17) - Combles (Start of concurrency with E 19) - Chaulnes (E 44) - Compiègne (E 46) - Roissy-en-France (End of concurrency with E 19)
: Roissy-en-France (E 19) - Paris
Boulevard Périphérique: Paris (E 50 E 54)
: Paris (E 50) - Massy (E 5 E 50)
: Massy (E 5 E 50) - Courtenay (E 511, Start of concurrency with E 60) - Auxerre - Beaune (End of concurrency with E 60, Start of concurrency with E 21) - Chalon-sur-Saône (E 607) - Mâcon (E 62, End of concurrency with E 21) - Anse
: Anse - Vaulx-en-Velin (E 611)
: Vaulx-en-Velin (E 611) - Saint-Priest (E 70 E 711)
: Saint-Priest (E 70 E 711) - Givors (E 70)
: Givors (E 70) - Valence (E 713) - Orange (E 714)
: Orange (E 714) - Nîmes (Start of concurrency with E 80) - Montpellier - Béziers (E 11) - Narbonne (End of concurrency with E 80) - Perpignan - Le Boulou
: La Jonquera - Girona - Rubí (E-9) - Rubí (Start of concurrency with E-90) - El Vendrell (End of concurrency with E-90) - Tarragona - Castelló de la Plana - València (E-901) - Alacant(E-903) - Crevillent
: Crevillent - Murcia - Motril (E-902) - Málaga
: Málaga - Guadiaro
: Guadiaro - Algeciras (E-5)
References
External links
UN Economic Commission for Europe: Overall Map of E-road Network (2007)
http://www.elbruz.org/eroads/E15.htm
15
15
1-0015
E015
1-0015
E015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
1-0015
A1 road (Great Britain) |
https://en.wikipedia.org/wiki/TACC | TACC may refer to:
The 618th Air and Space Operations Center (Tanker Airlift Control Center), 618th AOC (TACC), a United States Air Force unit
Texas Advanced Computing Center, a research center at the University of Texas at Austin
Territorial Approach to Climate Change, a programme undertaken by the United Nations
Territorial Army Commissioning Course, a three-week course run at the Royal Military Academy Sandhurst for officer cadets commissioning into the UK Army Reserve (formerly the Territorial Army)
Tetraammine copper chlorate a colouring for fireworks
Traffic Aware Cruise Control, an alternative name for Adaptive cruise control
Turkish American Community Center, a non-profit organization in the Washington metropolitan area
See also
TASS (), a Russian news agency |
https://en.wikipedia.org/wiki/WMYT-TV | WMYT-TV (channel 55) is a television station licensed to Rock Hill, South Carolina, United States, serving the Charlotte, North Carolina area as an affiliate of MyNetworkTV. It is the only major commercial television station in the Charlotte market to be licensed to a community in South Carolina. WMYT-TV is owned by Nexstar Media Group alongside Belmont, North Carolina–licensed Fox affiliate WJZY (channel 46). Both outlets share studios on Performance Road (along I-85) in unincorporated northwestern Mecklenburg County (with a Charlotte mailing address); through a channel sharing agreement, the stations transmit using WJZY's spectrum from an antenna in Dallas, North Carolina, along the Catawba River.
WMYT-TV is branded as My 12, in reference to its channel location on most Charlotte area cable providers.
History
Early history
From 1974 to 1978, the UHF channel 55 allocation in Rock Hill belonged to W55AA, a low-powered repeater of PBS member network South Carolina Educational Television. On January 3, 1978, SCETV programming moved to full-powered WNSC-TV on channel 30.
The present station on channel 55 first signed on the air on October 21, 1994, as WFVT, an independent station owned by Indiana-based Family 55. Capitol Broadcasting Company, then owner of WJZY, operated the station under a local marketing agreement. WJZY had the rights to a large amount of syndicated programming, but didn't have nearly enough time to air it. WFVT's arrival offered a solution. Under the terms of the LMA, WJZY bought WFVT's entire broadcast day, and aired most of its surplus syndicated programming on WFVT.
WFVT became a charter affiliate of The WB Television Network when it debuted on January 11, 1995, and changed its on-air branding from "TV55" to "WB55" shortly afterward. WJZY joined the United Paramount Network (UPN) when that network debuted five days later on January 16. In February of that year, the station was added to most Charlotte area cable systems. In the city of Charlotte, it was placed on Time Warner Cable channel 17, a slot that had long been held by The Disney Channel (then carried by most area providers as a premium service). The station ran ads in local newspapers that featured Bugs Bunny (though not the network's mascot, often used in Kids' WB marketing) pulling off a pair of Mickey Mouse ears and suggesting that viewers should re-program their televisions and VCRs lest they think "some rodent still lives there."
On August 5, 1999, the Federal Communications Commission (FCC) reversed its longstanding regulations against permitting common ownership of two full-power stations in the same television market; Capitol Broadcasting bought channel 55 outright the following year, creating a duopoly with WJZY. This was one of two duopolies formed in the Charlotte market during the 2000 calendar year, the other involving the purchase of WAXN-TV (channel 64) by WSOC-TV (channel 9)'s owner Cox Enterprises. WFVT subsequently changed its callsign to WWWB in |
https://en.wikipedia.org/wiki/National%20Women%27s%20Health%20Network | The National Women's Health Network (NWHN) is a non-profit women's health advocacy organization located in Washington, D.C. It was founded in 1975 by Barbara Seaman, Alice Wolfson, Belita Cowan, Mary Howell, and Phyllis Chesler. The stated mission of the organization is to give women a greater voice within the healthcare system. The NWHN researches and lobbies federal agencies on such issues as AIDS, reproductive rights, breast cancer, older women's health, and new contraceptive technologies. The Women's Health Voice, the NWHN's health information program, provides independent research on a variety of women's health topics.
History
The NWHN was founded in late 1975 as the National Women's Health Lobby by Barbara Seaman, Alice Wolfson, Belita Cowan, Mary Howell, and Phyllis Chesler. It was created to be both a lobbying organization and to monitor federal legislation and research relating to women's health, Food and Drug Administration (FDA) hearings, and Department of Health, Education and Welfare regulations. By December 1975, the organization was renamed the National Women's Health Network after the group realized that regulatory groups, as opposed to legislative bodies, had more influence on women's health.
The first action of the NWHN was a demonstration held outside of the FDA building in Rockville, Maryland, on December 15 and 16 of that year, in order protest against the FDA's approval and lack of oversight of synthetic estrogens. The protest was planned for those days because two scientific studies done on the risks of estrogenic drugs were about to be published in The New England Journal of Medicine and inside the building, the FDA was going to be holding hearings on the risks of DES (diethylstilbestrol)--formerly prescribed to pregnant women in order to prevent miscarriages and other complications, by 1971 DES had been found to cause a rare cancer, clear-cell adenocarcinoma of the vagina, in women and girls exposed to the drug in utero—and whether to mandate patient packaging inserts for estrogen replacement therapy drugs prescribed to menopausal women. On the outside of the building, the demonstrators held a funeral service to memorialize women who had died after taking drugs containing synthetic estrogens. Speakers discussed the risks of taking medications like DES, the morning-after pill, estrogen replacement therapy for menopausal women, as well as combined oral contraceptive pills. Speakers included Jim Luggen, a widower whose late wife had died of a pulmonary embolism caused by the oral birth control she was taking; Mary Daly, a radical feminist theologian and philosopher; a DES daughter Sherry Leibowitz; and Barbara Seaman. The protest had approximately 100 participants and Richard Crout, the head of FDA Bureau of Drugs at the time, attended.
Participants carried signs reading "Feed Estrogen to the Rats at the FDA" and "Women's Health, Not Drug Company Wealth". After the protests and the Nelson Pill Hearings, Patient Packaging |
https://en.wikipedia.org/wiki/Rick%20Forrester | Rick Forrester is a fictional character from The Bold and the Beautiful, an American soap opera on the CBS network. He was born in 1990 as the son of Brooke Logan and Eric Forrester. Portrayed by several adult actors, he is currently portrayed by Jacob Young, who took claim of the role from 1997 to 1999, and returned from 2011 to 2018.
Rick is known for his extreme jealous obsession of Ridge Forrester, Ridge's relationship with Eric and heir apparent position at Forrester Creations. He has been known to manipulate those close to his life, and also for seducing Ridge's daughters Phoebe and Steffy Forrester, then seducing their mother and Ridge's ex-wife, Dr. Taylor Hayes, in a twisted revenge plot against Ridge.
Casting
The role was originated by child actor Jeremy Snider, who remained in the role from 1991 to January 1995. The character was aged to a teen with Steve Hartman playing the role on a recurring basis from December 1995 to December 1997.
On December 31, 1997, Jacob Young took over the role. He remained in the role of Rick until the fall of 1999, when the actor decided to leave the series. For his portrayal of Rick, he received a Daytime Emmy nomination In 1999 for Outstanding Younger Actor in a Drama Series.
Following Young's departure, the role was recast with then-unknown actor Justin Torkildsen, who played the role from Fall 1999 to November 2006. In December 2006, it was announced that former star of the NBC Daytime series Days of Our Lives, actor Kyle Lowder, known for his five-year portrayal of Brady Black, would join the cast in January 2007. Lowder remained with the series until in January 2011 when it was announced that Lowder and executive producer Bradley Bell had reached a mutual decision to write the character off due to lack of storyline and creative direction.
In September 2011, it was announced Young would reprise the role of Rick twelve years after departing the role. Since departing the series, Young went on to portray Lucky Spencer on ABC's General Hospital, and became most recognized as JR Chandler on All My Children, until the serial's end in September 2011. Young first began airing on September 26, 2011. When asked about how his return happened, Young stated:
Though originally intended to be a 13-week engagement, Young agreed to extend his stay. He further confirmed in interviews that he did not go onto the planned online version of All My Children due to the insecurity it could potentially have job-wise, something he would not have with his return to The Bold and the Beautiful.
Following the departure of original cast member Ronn Moss, it was announced that Rick would become the new focal point of the series, becoming the so-called "new Ridge". In February 2014, Young alongside Linsey Godfrey crossed over to The Young and the Restless, airing from April 11 to 16, 2014. In April 2018, Young announced he had been dropped to recurring capacity, which he called a "blessing." He last appeared on May 29, 2018.
|
https://en.wikipedia.org/wiki/Reflection%20%28computer%20graphics%29 | Reflection in computer graphics is used to render reflective objects like mirrors and shiny surfaces.
Accurate reflections are commonly computed using ray tracing whereas approximate reflections can usually be computed faster by using simpler methods such as environment mapping. Reflections on shiny surfaces like wood or tile can add to the photorealistic effects of a 3D rendering.
Approaches to reflection rendering
For rendering environment reflections there exist many techniques that differ in precision, computational and implementation complexity. Combination of these techniques are also possible.
Image order rendering algorithms based on tracing rays of light, such as ray tracing or path tracing, typically compute accurate reflections on general surfaces, including multiple reflections and self reflections. However these algorithms are generally still too computationally expensive for real time rendering (even though specialized HW exists, such as Nvidia RTX) and require a different rendering approach from typically used rasterization.
Reflections on planar surfaces, such as planar mirrors or water surfaces, can be computed simply and accurately in real time with two pass rendering — one for the viewer, one for the view in the mirror, usually with the help of stencil buffer. Some older video games used a trick to achieve this effect with one pass rendering by putting the whole mirrored scene behind a transparent plane representing the mirror.
Reflections on non-planar (curved) surfaces are more challenging for real time rendering. Main approaches that are used include:
Environment mapping (e.g. cube mapping): a technique that has been widely used e.g. in video games, offering reflection approximation that's mostly sufficient to the eye, but lacking self-reflections and requiring prerendering of the environment map. The precision can be increased by using a spatial array of environment maps instead of just one.
Screen space reflections (SSR): a more expensive technique that traces reflection rays in screen space (as opposed to world space in e.g. ray tracing). This is done for each rendered pixel of the reflected surface, using the surface normal and scene depth. The disadvantage is that objects not captured in the rendered frame cannot appear in the reflections, which results in unresolved intersections and incomplete reflection image subsequently causing artefacts on the edge of the reflection. SSR was originally introduced as Real Time Local Reflections and was later changed.
Types of reflection
Polished
- A polished reflection is an undisturbed reflection, like a mirror or chrome surface.
Blurry
- A blurry reflection means that tiny random bumps on the surface of the material causes the reflection to be blurry.
Metallic
- A reflection is metallic if the highlights and reflections retain the color of the reflective object.
Glossy
- This term can be misused: sometimes, it is a setting which is the opposite of blurry (e.g. when "glo |
https://en.wikipedia.org/wiki/Qfusion | Qfusion is a 3D game engine. The project was started by Victor Luchitz along with several others. It is written in C for use on Windows and Unix-based systems. The engine also supports the data of Quake III as maps, 3D models and shaders.
Qfusion is a fork of id Tech 2, popularly known as the Quake II engine. Qfusion is free and open-source software subject to the terms of the GNU GPL-2.0-or-later.
The engine supports Ogg Vorbis sound and KTX (ETC1), TGA, JPEG, PNG for images. More recent versions of Qfusion engine also extend the Q3 rendering scheme to include Normal Mapping, GLSL shaders (including bump mapping and cel shading), and skeletal animation.
Games using Qfusion
The engine is used by following games:
Cocaine Diesel
Nosferatu
Warsow
Warfork
References
External links
Directory of Qfusion powered games
Unofficial website
Free software
Free software programmed in C
Game engines for Linux
Id Tech
Video game engines |
https://en.wikipedia.org/wiki/Locate | Locate may refer to:
Locate (finance)
Locator software, in computing
Locate (Unix), Linux command to find files
Locate di Triulzi, an Italian commune of Lombardy
Locate Varesino, an Italian commune of Lombardy
See also
Find (disambiguation)
Move (disambiguation)
Location (disambiguation)
Locator (disambiguation) |
https://en.wikipedia.org/wiki/Sha1sum | is a computer program that calculates and verifies SHA-1 hashes. It is commonly used to verify the integrity of files. It (or a variant) is installed by default on most Linux distributions. Typically distributed alongside are , , and , which use a specific SHA-2 hash function and , which uses the BLAKE2 cryptographic hash function.
The SHA-1 variants are proven vulnerable to collision attacks, and users should instead use, for example, a SHA-2 variant such as or the BLAKE2 variant to prevent tampering by an adversary.
It is included in GNU Core Utilities, Busybox (excluding ), and Toybox (excluding ). Ports to a wide variety of systems are available, including Microsoft Windows.
Examples
To create a file with a SHA-1 hash in it, if one is not provided:
$ sha1sum filename [filename2] ... > SHA1SUM
If distributing one file, the file extension may be appended to the filename e.g.:
$ sha1sum --binary my-zip.tar.gz > my-zip.tar.gz.sha1
The output contains one line per file of the form "{hash} SPACE (ASTERISK|SPACE) [{directory} SLASH] {filename}". (Note well, if the hash digest creation is performed in text mode instead of binary mode, then there will be two space characters instead of a single space character and an asterisk.) For example:
$ sha1sum -b my-zip.tar.gz
d5db29cd03a2ed055086cef9c31c252b4587d6d0 *my-zip.tar.gz
$ sha1sum -b subdir/filename2
55086cef9c87d6d031cd5db29cd03a2ed0252b45 *subdir/filename2
To verify that a file was downloaded correctly or that it has not been tampered with:
$ sha1sum -c SHA1SUM
filename: OK
filename2: OK
$ sha1sum -c my-zip.tar.gz.sha1
my-zip.tar.gz: OK
Hash file trees
can only create checksums of one or multiple files inside a directory, but not of a directory tree, i.e. of subdirectories, sub-subdirectories, etc. and the files they contain. This is possible by using in combination with the find command with the option, or by piping the output from into xargs. can create checksums of a directory tree.
To use with :
$ find s_* -type f -exec sha1sum '{}' \;
65c23f142ff6bcfdddeccebc0e5e63c41c9c1721 s_1/file_s11
d3d59905cf5fc930cd4bf5b709d5ffdbaa9443b2 s_2/file_s21
5590e00ea904568199b86aee4b770fb1b5645ab8 s_a/file_02
Likewise, piping the output from into yields the same output:
$ find s_* -type f | xargs sha1sum
65c23f142ff6bcfdddeccebc0e5e63c41c9c1721 s_1/file_s11
d3d59905cf5fc930cd4bf5b709d5ffdbaa9443b2 s_2/file_s21
5590e00ea904568199b86aee4b770fb1b5645ab8 s_a/file_02
Related programs
is a Perl program to calculate any of SHA-1, 224, 256, 384, 512 hashes. It is part of the ActivePerl distribution.
is a similarly named program that calculates SHA-3, HAKE, RawSHAKE, and Keccak functions.
The naming convention is also used by the BLAKE team with and , by the program tthsum, and many others.
On FreeBSD and OpenBSD, the utilities are called , , , and . These versions offer slightly different options and features. Additionally, FreeBSD offers the Skein family of message digests.
Se |
https://en.wikipedia.org/wiki/The%20Emperor%27s%20Secret | The Emperor's Secret (), released on 8 September 2006, is the first Finnish computer-animated feature film.
Plot
The film stars the familiar characters from the Finnish TV show The Autocrats (a political satire of Finnish politics) in a fairy tale where the inhabitants of a small Finnish village have to defend themselves against a despotic emperor.
Voice cast
Anna Bentley
Jukka Puotila
Krisse Salminen
See also
List of animated feature films
List of computer-animated films
References
External links
2006 films
2006 computer-animated films
2000s Finnish-language films
Finnish animated films
Finnish children's films
2000s children's animated films |
https://en.wikipedia.org/wiki/Arya%20Vaiv | Arya Vaiv is a 1994 computer game for the Amiga and MS-DOS platforms. It is a top-down space shooter with available power-ups and a constant stream of enemies.
References
1994 video games
Amiga games
Dongleware Verlags games
DOS games
Scrolling shooters
Single-player video games
Video games developed in Germany |
https://en.wikipedia.org/wiki/Threshold%20cryptosystem | A threshold cryptosystem, the basis for the field of threshold cryptography, is a cryptosystem that protects information by encrypting it and distributing it among a cluster of fault-tolerant computers. The message is encrypted using a public key, and the corresponding private key is shared among the participating parties. With a threshold cryptosystem, in order to decrypt an encrypted message or to sign a message, several parties (more than some threshold number) must cooperate in the decryption or signature protocol.
History
Perhaps the first system with complete threshold properties for a trapdoor function (such as RSA) and a proof of security was published in 1994 by Alfredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung.
Historically, only organizations with very valuable secrets, such as certificate authorities, the military, and governments made use of this technology. One of the earliest implementations was done in the 1990s by Certco for the planned deployment of the original Secure electronic transaction.
However, in October 2012, after a number of large public website password ciphertext compromises, RSA Security announced that it would release software to make the technology available to the general public.
In March 2019, the National Institute of Standards and Technology (NIST) conducted a workshop on threshold cryptography to establish consensus on applications, and define specifications. In July 2020, NIST published "Roadmap Toward Criteria for Threshold Schemes for Cryptographic Primitives" as NISTIR 8214A.
Methodology
Let be the number of parties. Such a system is called (t,n)-threshold, if at least t of these parties can efficiently decrypt the ciphertext, while fewer than t have no useful information. Similarly it is possible to define a (t,n)-threshold signature scheme, where at least t parties are required for creating a signature.
Application
The most common application is in the storage of secrets in multiple locations to prevent the capture of the secret and the subsequent cryptanalysis of that system. Most often the secrets that are "split" are the secret key material of a public key cryptography or of a Digital signature scheme. The method primarily enforces the decryption or the signing operation to take place only if a threshold of the secret sharer operates (otherwise the operation is not made). This makes the method a primary trust sharing mechanism, besides its safety of storage aspects.
Derivatives of asymmetric cryptography
Threshold versions of encryption or signature schemes can be built for many asymmetric cryptographic schemes. The natural goal of such schemes is to be as secure as the original scheme. Such threshold versions have been defined by the above and by the following:
Damgård–Jurik cryptosystem
DSA
ElGamal
ECDSA (these are used in protecting Bitcoin wallets)
Paillier cryptosystem
RSA
Schnorr signature
See also
Broadcast encryption
Distributed key generation
Secret shar |
https://en.wikipedia.org/wiki/Resistance%20%28Star%20Trek%3A%20Voyager%29 | "Resistance" is the 28th episode of Star Trek: Voyager, and the 12th episode in the second season. It is one installment of a Star Trek television series that aired on the United Paramount Network in November 1995. With a teleplay by Lisa Klink and story by Michael Jan Friedman and Kevin J. Ryan, the episode depicts the USS Voyager, a space ship stranded on the other side of the galaxy, encountering an alien planet. Starship Captain Kathryn Janeway must rescue officers Tuvok and B'Elanna Torres from an alien prison. The episode was directed by Winrich Kolbe.
The episode aired on UPN on November 27, 1995.
Plot
During an away mission, Tuvok and B'Elanna Torres are captured and imprisoned while attempting to obtain a chemical vital to Voyagers systems. An injured Captain Janeway is rescued by a local man, Caylem, who believes her to be his daughter. The action takes place among Alsaurians who are contacts of Neelix, and whose planet is occupied by the aggressive Mokra.
Caylem eventually helps Janeway gain entrance into the caves where Tuvok and B'Elanna are being held prisoner and she releases them. Soon after, they are seized by the Mokra prison guards. The Mokra commanding officer, Augris, reveals that Caylem's real daughter Ralkana was shot and killed 12 years ago while attempting to rescue his wife from prison, who, unbeknown to her, had already died. Augris also indicates that Caylem has made this rescue attempt several times since then, having been rendered delusional after being unable to accept their deaths. Before Augris can interrogate Captain Janeway with the brutal methods that he used on Tuvok, Caylem, who still believes Janeway is his daughter, attacks. Caylem stabs Augris during the fight, but is shot by two prison guards before they can be stopped.
As Caylem lies dying, Janeway tells him the commander was lying about Ralkana being shot. She reminds him that his wife had forgiven him for past actions, and asks that he accept that forgiveness. "My sweet girl" are Caylem's last words before he dies in her arms, and Janeway is saddened at his death. Back on Voyager, Janeway ponders Ralkana's precious metal necklace that he had presented to her, which she kept to remind herself of his kindness.
Production
Writer Lisa Klink had previously worked as a writing intern on Deep Space Nine. This was the first episode she had written for Voyager.
Joel Grey had previously worked with Kate Mulgrew in the 1985 film Remo Williams: The Adventure Begins. Prior to this he had won both a Tony Award and an Academy Award for the stage and film versions of the musical Cabaret. The producers of Voyager had invited him to appear on several occasions, but after Mulgrew suggested he played Caylem, he agreed to make his debut appearance in Star Trek. He described the experience as "fun, fun and crazy", despite requiring a couple of hours each day to apply his prosthetic make-up. In a later interview he noted the skilled makeup artists of Star Trek, nee |
https://en.wikipedia.org/wiki/SCOOP%20%28software%29 | SCOOP (Simple Concurrent Object Oriented Programming) is a concurrency model designed for the Eiffel programming language, conceived by Eiffel's creator and designer, Bertrand Meyer.
SCOOP defines a way for an object oriented program to be written without the concept of threads, locks, or other typical multiprogramming methods. This allows the compiler or runtime environment to optimize the amount of concurrency as well as eliminate typical design flaws such as deadlock.
The model was first designed in the early 1990s and published in 1993 in the Communications of the ACM An updated version was described in chapter 30 of the book Object-Oriented Software Construction.
A prototype implementation was developed in 1995 by Eiffel Software. An article by Compton and Walker provides an overview of SCOOP and describes another early implementation. Nienaltowski, Arslan and Meyer have published a description of the model as of 2003. Work on SCOOP proceeded at the Chair of Software Engineering at ETH Zurich. SCOOP became available as a standard part of EiffelStudio early in 2011.
Technical overview
SCOOP works by allowing references to certain objects to be declared as separate. In the code below, an entity local_inventory is declared as a separate type, by specifying the Eiffel language keyword separate in the declaration.
local_inventory: separate INVENTORY
A separate object may be handled by a SCOOP processor that is different from the processor handling the referencing object. A SCOOP processor is the abstract notion of an autonomous thread of control that handles the execution of operations on one or more objects. SCOOP processors are independent of underlying concurrency mechanisms like processor threads, multiple processor cores, and distributed computer systems.
In addition to the concept of separateness, SCOOP exploits the principles of design by contract as part of the SCOOP strategy for synchronizing access to shared separate resources. For example, a precondition for a consumer wishing to access an item in the inventory example above, might be that such an item does currently exist. This would be expressed with a contract on the feature of class INVENTORY which returns the item.
item: PRODUCT
-- Current item
require
inventory_has_item: has_item
In traditional, sequential processing, a client intending to call local_inventory.item would be responsible for making certain that the precondition local_inventory.has_item holds before making the call. If the call to item were made in a state in which has_item did not hold, the caller would incur a precondition violation exception.
In the presence of SCOOP and given the separateness of local_inventory, making the check on has_item before calling item would not be reliable. This is because the state of local_inventory could have been changed by requests from other SCOOP processors between the time that the check was made and the time that item could be called.
As |
https://en.wikipedia.org/wiki/Domain-key%20normal%20form | Domain-key normal form (DK/NF or DKNF) is a normal form used in database normalization which requires that the database contains no constraints other than domain constraints and key constraints.
A domain constraint specifies the permissible values for a given attribute, while a key constraint specifies the attributes that uniquely identify a row in a given table.
The domain/key normal form is achieved when every constraint on the relation is a logical consequence of the definition of keys and domains, and enforcing key and domain restraints and conditions causes all constraints to be met. Thus, it avoids all non-temporal anomalies.
The reason to use domain/key normal form is to avoid having general constraints in the database that are not clear domain or key constraints. Most databases can easily test domain and key constraints on attributes. General constraints however would normally require special database programming in the form of stored procedures (often of the trigger variety) that are expensive to maintain and expensive for the database to execute. Therefore, general constraints are split into domain and key constraints.
It's much easier to build a database in domain/key normal form than it is to convert lesser databases which may contain numerous anomalies. However, successfully building a domain/key normal form database remains a difficult task, even for experienced database programmers. Thus, while the domain/key normal form eliminates the problems found in most databases, it tends to be the most costly normal form to achieve. However, failing to achieve the domain/key normal form may carry long-term, hidden costs due to anomalies which appear in databases adhering only to lower normal forms over time.
The third normal form, Boyce–Codd normal form, fourth normal form and fifth normal form are special cases of the domain/key normal form. All have either functional, multi-valued or join dependencies that can be converted into superkeys. The domains on those normal forms were unconstrained so all domain constraints are satisfied. However, transforming a higher normal form into domain/key normal form is not always a dependency-preserving transformation and therefore not always possible.
Example
A violation of DKNF occurs in the following table:
(Assume that the domain for Wealthy Person consists of the names of all wealthy people in a pre-defined sample of wealthy people; the domain for Wealthy Person Type consists of the values 'Millionaire' and 'Billionaire'; and the domain for Net Worth in Dollars consists of all integers greater than or equal to 1,000,000.)
There is a constraint linking Wealthy Person Type to Net Worth in Dollars, even though we cannot deduce one from the other. The constraint dictates that a Millionaire will have a net worth of 1,000,000 to 999,999,999 inclusive, whilst a Billionaire will have a net worth of 1,000,000,000 or higher. This constraint is neither a domain constraint nor a key constraint; therefor |
https://en.wikipedia.org/wiki/List%20of%20diplomatic%20missions%20of%20Botswana | This is a list of diplomatic missions of Botswana. Botswana has a small but far-reaching network of foreign missions abroad.
As a member of the Commonwealth of Nations, Botswanan diplomatic missions in the capitals of other Commonwealth member-states are known as High Commissions.
Excluded from this listing are honorary consulates and trade missions.
Africa
Americas
Asia
Europe
Oceania
Multilateral organizations
Gallery
See also
Foreign relations of Botswana
List of diplomatic missions in Botswana
Visa policy of Botswana
References
Ministry of Foreign Affairs and International Cooperation of Botswana
https://www.botswanatourism.co.bw/embassy-type/botswana-missions-abroad
Botswana
Diplomatic missions |
https://en.wikipedia.org/wiki/AllPeers | AllPeers was a free software browser extension for Mozilla Firefox.
On March 2, 2008, AllPeers announced the end of the service.
The extension allowed building a social network and sharing files on a P2P basis. It used a darknet style of peer-to-peer communication; files and information shared between users are only accessible as long as the users have each other on their respective access lists - their 'trusted private network'. AllPeers beta version was launched on August 24, 2006. It worked on Windows, Linux and Mac, which, once downloaded, becomes a toolbar in Mozilla Firefox.
AllPeers used open source BitTorrent technology to facilitate file transfer. The extension did not require any ports be opened. AllPeers encrypted its communication using standard protocols like SSL so as to protect the user against 3rd party intervention listening in.
At its beta launch AllPeers comprised 200,000 lines of C++ and JavaScript code.
Although the AllPeers client was open sourced in March 2007, the server source remains closed. AllPeers claimed this was because the network must have a single, stable server instance to function reliably.
See also
BitTorrent
List of Firefox extensions
P2P
References
Free Firefox legacy extensions
File sharing software
BitTorrent |
https://en.wikipedia.org/wiki/Cray%20J90 | The Cray J90 series (code-named Jedi during development) was an air-cooled vector processor supercomputer first sold by Cray Research in 1994. The J90 evolved from the Cray Y-MP EL minisupercomputer, and is compatible with Y-MP software, running the same UNICOS operating system. The J90 supported up to 32 CMOS processors with a 10 ns (100 MHz) clock. It supported up to 4 GB of main memory and up to 48 GB/s of memory bandwidth, giving it considerably less performance than the contemporary Cray T90, but making it a strong competitor to other technical computers in its price range. All input/output in a J90 system was handled by an IOS (Input/Output Subsystem) called IOS Model V. The IOS-V was based on the VME64 bus and SPARC I/O processors (IOPs) running the VxWorks RTOS. The IOS was programmed to emulate the IOS Model E, used in the larger Cray Y-MP systems, in order to minimize changes in the UNICOS operating system. By using standard VME boards, a wide variety of commodity peripherals could be used.
The J90 was available in three basic configurations, the J98 with up to eight processors, the J916 with up to 16 processors, and the J932 with up to 32 processors.
Each J90 processor was composed of two chips - one for the scalar portion of the processor, and the other for the vector portion. The scalar chip was also notable for including a small (128 word) data cache to enhance scalar performance. (Cray machines have always had instruction caching.)
In 1997 the J90se (Scalar Enhanced) series became available, which doubled the scalar speed of the processors to 200 MHz; the vector chip remained at 100 MHz. Support was also added for the GigaRing I/O system found on the Cray T3E and Cray SV1, replacing IOS-V. Later, SV1 processors could be installed in a J90 or J90se, further increasing performance within the same frame.
External links
Fred Gannett's Cray FAQ
J90 at top500.org
Computer-related introductions in 1994
J90
Vector supercomputers |
https://en.wikipedia.org/wiki/Cray%20X1 | The Cray X1 is a non-uniform memory access, vector processor supercomputer manufactured and sold by Cray Inc. since 2003. The X1 is often described as the unification of the Cray T90, Cray SV1, and Cray T3E architectures into a single machine. The X1 shares the multistreaming processors, vector caches, and CMOS design of the SV1, the highly scalable distributed memory design of the T3E, and the high memory bandwidth and liquid cooling of the T90.
The X1 uses a 1.2 ns (800 MHz) clock cycle, and 8-wide vector pipes in MSP mode, offering a peak speed of 12.8 gigaflops per processor. Air-cooled models are available with up to 64 processors. Liquid-cooled systems scale to a theoretical maximum of 4096 processors, comprising 1024 shared-memory nodes connected in a two-dimensional torus network, in 32 frames. Such a system would supply a peak speed of 50 teraflops. The largest unclassified X1 system was the 512 processor system at Oak Ridge National Laboratory, though this has since been upgraded to an X1E system.
The X1 can be programmed either with widely used message passing software like MPI and PVM, or with shared-memory languages like Unified Parallel C programming language or Co-array Fortran. The X1 runs an operating system called UNICOS/mp which shares more with the SGI IRIX operating system than it does with the UNICOS found on prior generation Cray machines.
In 2005, Cray released the X1E upgrade, which uses dual-core processors, allowing two quad-processor nodes to fit on a node board. The processors are also upgraded to 1150 MHz. This upgrade almost triples the peak performance per board, but reduces the per-processor memory and interconnect bandwidth. X1 and X1E boards can be combined within the same system.
The X1 is notable for its development being partly funded by United States
Government's National Security Agency (under the code name
SV2).
The X1 was not a financially successful product and it seems doubtful that it
or its successors would have been produced without this support.
References
External links
ORNL X1 evaluation
Cray Legacy Products
Cray X1E at top500.org
X1
Vector supercomputers
Computer-related introductions in 2003 |
https://en.wikipedia.org/wiki/Declan%20McCullagh | Declan McCullagh is an American entrepreneur, journalist, and software engineer.
He is the CEO and co-founder, with computer scientist Celine Bursztein, of Recent Media Inc., a startup in Silicon Valley that has built a recommendation engine and iOS and Android news app. Recent, which uses artificial intelligence and machine learning for its recommendation engine, was released to early users in June 2015.
He previously worked for Wired, CNET, CBS Interactive, and Time Inc. His articles about technology have been published in Reason, Playboy, the Wall Street Journal, Communications of the ACM (co-authored with computer scientist Peter G. Neumann), and the Harvard Journal of Law & Public Policy.
Previously as a journalist he specialized in computer security and privacy. For many years, he moderated the Politech mailing list, giving commentary on the intersection of politics and technology. He is notable, among other things, for his early involvement with the media interpretation of U.S. presidential candidate Al Gore's statement that he "took the initiative in creating the Internet".
In addition to technology, McCullagh has written approvingly of free markets and individual liberty. He began writing weekly columns for CBS News entitled Other People's Money upon CBS Corporation's acquisition of CNET Networks. In August 2009, McCullagh renamed his column to Taking Liberties, which focuses on "individual rights and liberties, including both civil and economic liberties."
References
External links
Taking Liberties, columns by McCullagh (Discontinued)
Other People's Money, columns by McCullagh (Discontinued)
CNET News, blog entries and podcast episodes by McCullagh (Discontinued)
American aviators
American bloggers
American columnists
American computer programmers
American libertarians
American podcasters
American University faculty and staff
Case Western Reserve University faculty
CNET
Free speech activists
Internet activists
Living people
Writers from San Francisco
Time (magazine) people
Wired (magazine) people
21st-century American non-fiction writers
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Norton%20Guides | Norton Guides were a product family sold by Peter Norton Computing. The guides were written in 1985 by Warren Woodford for the x86 Assembly Language, C, BASIC, and Forth languages and made available to DOS users via a terminate-and-stay-resident (TSR) program that integrated with programming language editors on IBM PC type computers.
Norton Guides appears to be one of the first Online help systems and the first example of a commercial product where programming reference information was integrated into the software development environment. The format was later used by independent users to create simple hypertexts before this concept was more popular. Hypertext capabilities however were limited, links between entries were only possibly by "see also" references at the end of each entry.
The concept of providing "information at your fingertips", as he called it, via a TSR program was a signature technology developed by Woodford in 1980 and used in other programs he created in that era including MathStar, WordFinder/SynonymFinder and a TEMPEST WWMCCS workstation developed for Systematics General Corporation. Warren's Guides, aka the Norton Guides, were the last application of this type written by Woodford.
Norton Guides were compiled from ASCII source files with a tool called NGC. Morten Elling wrote an alternative guides compiler NGX in 1994 or earlier.
A utility to view Norton Guides .ng files is found at http://www.davep.org/norton-guides/
Editions
Norton on-line programmer's guides. An on-line reference library of programming data. Version 1.0. 4 5-1/4" floppy disks. System requirements: IBM PC or compatible computer; 128K RAM; DOS 2.0 or higher; one disk drive.
Links
http://www.davep.org/norton-guides/
http://x-hacker.org/ng/
Computer programming books
Hypertext |
https://en.wikipedia.org/wiki/Column-oriented%20DBMS | A column-oriented DBMS or columnar DBMS is a database management system (DBMS) that stores data tables by column rather than by row. Benefits include more efficient access to data when only querying a subset of columns (by eliminating the need to read columns that are not relevant), and more options for data compression. However, they are typically less efficient for inserting new data.
Practical use of a column store versus a row store differs little in the relational DBMS world. Both columnar and row databases can use traditional database query languages like SQL to load data and perform queries. Both row and columnar databases can become the backbone in a system to serve data for common extract, transform, load (ETL) and tools.
Description
Background
A relational database management system provides data that represents a two-dimensional table of columns and rows. For example, a database might have this table:
This simple table includes an employee identifier (EmpId), name fields (Lastname and Firstname) and a salary (Salary). This two-dimensional format is an abstraction. In an actual implementation, storage hardware requires the data to be serialized into one form or another.
The most expensive operations involving hard disks are seeks. In order to improve overall performance, related data should be stored in a fashion to minimize the number of seeks. This is known as locality of reference, and the basic concept appears in a number of different contexts. Hard disks are organized into a series of blocks of a fixed size, typically enough to store several rows of the table. By organizing the table's data so rows fit within these blocks, and grouping related rows onto sequential blocks, the number of blocks that need to be read or sought is minimized in many cases, along with the number of seeks.
A survey by Pinnecke et al. covers techniques for column-/row hybridization as of 2017.
Row-oriented systems
A common method of storing a table is to serialize each row of data, like this:
001:10,Smith,Joe,60000;
002:12,Jones,Mary,80000;
003:11,Johnson,Cathy,94000;
004:22,Jones,Bob,55000;
As data is inserted into the table, it is assigned an internal ID, the rowid that is used internally in the system to refer to data. In this case the records have sequential rowids independent of the user-assigned empid. In this example, the DBMS uses short integers to store rowids. In practice, larger numbers, 64-bit or 128-bit, are normally used.
Row-oriented systems are designed to efficiently return data for an entire row, or record, in as few operations as possible. This matches the common use-case where the system is attempting to retrieve information about a particular object, say the contact information for a user in a rolodex system, or product information for an online shopping system. By storing the record's data in a single block on the disk, along with related records, the system can quickly retrieve records with a minimum of disk operation |
https://en.wikipedia.org/wiki/ChipWits | ChipWits is a programming game for the Macintosh written by Doug Sharp and Mike Johnston, and published by BrainPower software in 1984. Ports to the Apple II and Commodore 64 were published by Epyx in 1985.
The player uses a visual programming language to teach a virtual robot how to navigate various mazes of varying difficulty. The gameplay straddles the line between entertainment and programming education. The game was developed in MacFORTH and later ported to the Apple II and Commodore 64.
Reception
Computer Gaming World preferred Robot Odyssey to ChipWits but stated that both were "incredibly vivid simulation experiences". The magazine criticized ChipWits inability to save more than 16 robots or copy a robot to a new save slot, and cautioned that it "may be too simple for people familiar with programming". The magazine added that the criticism was "more a cry for a more complex Chipwits II game than condemnation of the current product".
ChipWits won numerous awards, including MACazine Best of '85 and MacUser's Editor's Choice 1985 Award, as well as being named The 8th Best Apple Game of All Time by Maclife.
Reviews
Games #66
Legacy
From 2006 to 2008, Mike Johnston and Doug Sharp developed and released ChipWits II, written in Adobe AIR. That version featured several innovations including an in-game tutorial, updated graphics, a soundtrack, isometric and 3D rendering, several new chips, and new missions. That version is no longer supported, but the original site is archived at .
In September 2021, ChipWits, Inc. was formed by Doug Sharp and Mark Roth to create a modern reboot of the game. The new version is being written in Unity and is in early access testing.
References
External links
ChipWits II Official Website (archive)
1984 video games
Apple II games
Commodore 64 games
Classic Mac OS games
Programming games
Video games developed in the United States |
https://en.wikipedia.org/wiki/Luhn%20mod%20N%20algorithm | The Luhn mod N algorithm is an extension to the Luhn algorithm (also known as mod 10 algorithm) that allows it to work with sequences of values in any even-numbered base. This can be useful when a check digit is required to validate an identification string composed of letters, a combination of letters and digits or any arbitrary set of characters where is divisible by 2.
Informal explanation
The Luhn mod N algorithm generates a check digit (more precisely, a check character) within the same range of valid characters as the input string. For example, if the algorithm is applied to a string of lower-case letters (a to z), the check character will also be a lower-case letter. Apart from this distinction, it resembles very closely the original algorithm.
The main idea behind the extension is that the full set of valid input characters is mapped to a list of code-points (i.e., sequential integers beginning with zero). The algorithm processes the input string by converting each character to its associated code-point and then performing the computations in mod N (where is the number of valid input characters). Finally, the resulting check code-point is mapped back to obtain its corresponding check character.
Limitation
The Luhn mod N algorithm only works where is divisible by 2. This is because there is an operation to correct the value of a position after doubling its value which does not work where is not divisible by 2. For applications using the English alphabet this is not a problem, since a string of lower-case letters has 26 code-points, and adding Decimal characters adds a further 10, maintaining an divisible by 2.
Explanation
The second step in the Luhn algorithm re-packs the doubled value of a position into the original digit's base by adding together the individual digits in the doubled value when written in base . This step results in even numbers if the doubled value is less than or equal to , and odd numbers if the doubled value is greater than . For example, in Decimal applications where is 10, original values between 0 and 4 result in even numbers and original values between 5 and 9 result in odd numbers, effectively re-packing the doubled values between 0 and 18 into a single distinct result between 0 and 9.
Where an is used that is not divisible by 2 this step returns even numbers for doubled values greater than which cannot be distinguished from doubled values less than or equal to .
Outcome
The algorithm will neither detect all single-digit errors nor all transpositions of adjacent digits if an is used that is not divisible by 2. As these detection capabilities are the algorithm's primary strengths, the algorithm is weakened almost entirely by this limitation. The Luhn mod N algorithm odd variation enables applications where is not divisible by 2 by replacing the doubled value at each position with the remainder after dividing the position's value by which gives odd number remainders consistent with the ori |
https://en.wikipedia.org/wiki/Demzilla | DataMart and Demzilla were databases that were rolled out by the United States Democratic Party from 2002. By 2004, Datamart contained information on 166 million registered voters, and with input from public voter information and consumer data from data mining companies a single entry might have 200 to 400 items of information. Demzilla was a smaller database used for fundraising and organization volunteers, it includes the names and information persons or groups the DNC does business with, and those who are donors to the Democratic party, it also includes volunteers, activists, local and state party leaders, and members of the press.
The goal was to aggregate and analyze voter and public information data in order to target Democratic voters as part of their national GOTV effort as well as fund raising campaigns. This data was also available to Senatorial and Congressional candidates as well as other party members.
The Republican Party had a similar project, the Voter Vault, started in the 1990s.
See also
Cambridge Analytica
Catalist
Civis Analytics
Data dredging
Get out the vote
Herd behaviour
Left-wing politics
Predictive analytics
Psychographic
References
External links
"GOP Voter Vault shipped overseas" from PC World, 2004
Time article on Demzilla and Voter Vault.
Wonkette article on Demzilla.
Political campaigns
Democratic Party (United States)
Databases in the United States
Voter databases |
https://en.wikipedia.org/wiki/MUSIC%20%28algorithm%29 | MUSIC (MUltiple SIgnal Classification) is an algorithm used for frequency estimation and radio direction finding.
History
In many practical signal processing problems, the objective is to estimate from measurements a set of constant parameters upon which the received signals depend. There have been several approaches to such problems including the so-called maximum likelihood (ML) method of Capon (1969) and Burg's maximum entropy (ME) method. Although often successful and widely used, these methods have certain fundamental limitations (especially bias and sensitivity in parameter estimates), largely because they use an incorrect model (e.g., AR rather than special ARMA) of the measurements.
Pisarenko (1973) was one of the first to exploit the structure of the data model, doing so in the context of estimation of parameters of complex sinusoids in additive noise using a covariance approach. Schmidt (1977), while working at Northrop Grumman and independently Bienvenu and Kopp (1979) were the first to correctly exploit the measurement model in the case of sensor arrays of arbitrary form. Schmidt, in particular, accomplished this by first deriving a complete geometric solution in the absence of noise, then cleverly extending the geometric concepts to obtain a reasonable approximate solution in the presence of noise. The resulting algorithm was called MUSIC (MUltiple SIgnal Classification) and has been widely studied.
In a detailed evaluation based on thousands of simulations, the Massachusetts Institute of Technology's Lincoln Laboratory concluded in 1998 that, among currently accepted high-resolution algorithms, MUSIC was the most promising and a leading candidate for further study and actual hardware implementation. However, although the performance advantages of MUSIC are substantial, they are achieved at a cost in computation (searching over parameter space) and storage (of array calibration data).
Theory
MUSIC method assumes that a signal vector, , consists of complex exponentials, whose frequencies are unknown, in the presence of Gaussian white noise, , as given by the linear model
Here is an Vandermonde matrix of steering vectors and is the amplitude vector. A crucial assumption is that number of sources, , is less than the number of elements in the measurement vector, , i.e. .
The autocorrelation matrix of is then given by
where is the noise variance, is identity matrix, and is the autocorrelation matrix of .
The autocorrelation matrix is traditionally estimated using sample correlation matrix
where is the number of vector observations and . Given the estimate of , MUSIC estimates the frequency content of the signal or autocorrelation matrix using an eigenspace method.
Since is a Hermitian matrix, all of its eigenvectors are orthogonal to each other. If the eigenvalues of are sorted in decreasing order, the eigenvectors corresponding to the largest eigenvalues (i.e. directions of largest variabil |
https://en.wikipedia.org/wiki/CSIX%20%28disambiguation%29 | CSIX may refer to:
CSIX, common switch interface
CSix Connect, a social network and weekly gathering of high tech professionals in career transition
CSIRO Index, abstracts by the Australian Commonwealth Scientific and Industrial Research Organisation (CSIRO)
See also
C6 (disambiguation) |
https://en.wikipedia.org/wiki/Process.h | process.h is a C header file which contains function declarations and macros used in working with threads and processes. Most C compilers that target DOS, Windows 3.1x, Win32, OS/2, Novell NetWare or DOS extenders supply this header and the library functions in their C library. Neither the header file nor most of the functions are defined by either the ANSI/ISO C standard or by POSIX.
History
Microsoft's version of the file dates back to at least 1985, according to its copyright statement. An early reference to the file was in a post on the net.micro.pc usenet on Oct-26-1986. The compiler used was Microsoft C compiler version 3.0.
The Lattice C compiler version 3.30 (Aug-24-1988) did not have such a header file, but offered similar functions.
Borland provided the header in their Turbo C compiler version 2.01.
The C Ware-Personal C compiler version 1.2c (June 1989) had only the ANSI headers.
Functions
Constants
Implementations
Given the fact there is no standard on which to base the implementation, the functions declared by process.h differ, depending on the compiler in use. Below is a list of compilers which provide process.h.
DJGPP
OpenWatcom,
Digital Mars
MinGW
Microsoft Visual C++
Borland Turbo C, 2.0 and later
Lcc32
QNX Neutrino QCC 6.x
Differences
Another aspect that might vary is the combined length of exec* and spawn* parameters.
Delorie DJGPP: does not have such a limit.
Digital Mars: the maximum is 128 bytes; nothing is stated about the ending '\0' character.
Microsoft cl: the argument list for the new process must not exceed 1024 bytes.
References
External links
Digital Mars _exec reference
C (programming language) headers |
https://en.wikipedia.org/wiki/Prisoner%202 | The Prisoner 2 is a 1982 computer game by Edu-Ware is a remake of the 1980 game The Prisoner.
Gameplay
In 1982, Edu-Ware released a second version of the game entitled Prisoner 2, with color and improved high-resolution graphics replacing the original's top-down perspective with a first-person view. In addition to the Apple II, this version was also available on the Atari 8-bit and DOS platforms. While sometimes incorrectly considered a sequel due to its title, Prisoner 2 was essentially the same as the first Prisoner game, only with updated graphics and a limited number of design changes, several of which referenced other games:
A fence (which the player may attempt to jump over) now surrounds the Island.
Rover's appearance was changed from a white ball to that of an entity resembling Pac-Man.
The Hospital is now home to the Milgram Experiment, which is now a special event that occurs periodically.
The Free Information display was moved to the Town Hall; the Hall still houses the Run the Island task but only as a special event occurring periodically.
The Recreation Hall has expanded obstacle courses.
The Great Chair has been moved into a multi-roomed building called the Switchyard. Most rooms are identical to each other except for a single letter on the wall, which together spell out "Rubik's Cube". Three rooms are special: the Great Chair room itself, the switch room (with a switch to disable the music that accompanies the scrolling game text), and the exit.
The Library sends the player on literary-themed quests for the Wicked Witch of the West's broomstick or Injun Joe's treasure (from The Adventures of Tom Sawyer), if he chooses not to burn books.
The building that formerly housed the Milgram Experiment is renamed Grail Hall and contains items for the Library quests. It is a maze of rooms, including some that mimick the look of Scott Adams' adventure games, or that reference adventure games such as Colossal Cave Adventure (a cave with the word "PLUGH" written on the wall), Wizard and the Princess (a castle, whereupon arrival, the player is sent back to the Castle), and Mystery House (whereupon arrival, the player is told "He's killed Ken!" (a reference to Ken Williams of Sierra On-Line) and is accused of murder until granted absolution in the Church).
Reception
Jeff Rovin for Videogaming Illustrated said that "A great piece of computergaming from both a design point of view and as a challenge, though the lack of originality is disappointing."
C.J. Thorns for ANALOG Computing said that "Prisoner II is a superb package (I dare not call it a "game") that should provide weeks of entertainment. It goes far beyond the traditional "collect the right combination of treasures" adventure, and includes some diabolical arcade-like sequences to frustrate you even more."
Jeff Hurlburt for SoftSide said that "Prisoner 2 is a superbly crafted adventuring experience. Surely among the more complex computer games, it will repay the involved playe |
https://en.wikipedia.org/wiki/Cray%20XT3 | The Cray XT3 is a distributed memory massively parallel MIMD supercomputer designed by Cray Inc. with Sandia National Laboratories under the codename Red Storm. Cray turned the design into a commercial product in 2004. The XT3 derives much of its architecture from the previous Cray T3E system, and also from the Intel ASCI Red supercomputer.
XT3
The XT3 consists of between 192 and 32,768 processing elements (PEs), where each PE comprises a 2.4 or 2.6 GHz AMD Opteron processor with up to two cores, a custom "SeaStar" communications chip, and between 1 and 8 GB of RAM. The PowerPC 440 based SeaStar device provides a 6.4 gigabyte per second connection to the processor across HyperTransport, as well as six 8-gigabyte per second links to neighboring PEs. The PEs are arranged in a 3-dimensional torus topology, with 96 PEs in each cabinet.
The XT3 runs an operating system called UNICOS/lc that partitions the machine into three sections, the largest comprising the Compute nodes, and two smaller sections for Service nodes and IO nodes. In UNICOS/lc 1.x, the Compute PEs run a Sandia developed microkernel called Catamount, which is descended from the SUNMOS OS of the Intel Paragon; in UNICOS/lc 2.0, Catamount was replaced by a specially tuned version of Linux called Compute Node Linux (CNL). Service and IO PEs run the full version of SuSE Linux and are used for interactive logins, systems management, application compiling and job launch. I/O PEs use physically distinct hardware, in that the node boards include PCI-X slots for connections to Ethernet and Fibre Channel networks.
Though the performance of each XT3 model will vary with the speed and number of processors installed, the November 2007 Top500 results for the Red Storm machine, the largest XT3 machine installed at Sandia, measured 102.7 teraflops on the Linpack benchmark, placing it at #6 on the list. After upgrades in 2008 to install some XT4 nodes with quad-core Opterons, Red Storm achieved 248 teraflops to place at #9 on the November 2008 Top500. The architecture was superseded in 2006 by the Cray XT4.
External links
XT3 at top500.org
Fireworks with new products at Cray - the XT3, Primeur, November 2004
Cray XT3 Datasheet
Xt3
X86 supercomputers
Computer-related introductions in 2004 |
https://en.wikipedia.org/wiki/Micro%20Mouse%20Goes%20Debugging | Micro Mouse Goes Debugging is a computer game for the ZX Spectrum. It was released by MC Lothlorien in 1983.
Gameplay
The premise was to control Micro Mouse around a screen which contained lines of BASIC program, some of which is missing. While Micro Mouse is replacing the code, he must avoid bugs which will try to kill you and also pinch part of the code. Micro Mouse's only form of defense was a can of data kill.
Legacy
MC Lothlorien produced another game of the same name in 1989 which was released by Mastertronic. It was also released for the Amstrad CPC and the Commodore 64. This has completely different gameplay compared to the original. In this version, you guided Micro Mouse around a circuit board picking up parts and placing them in the correct spot. This version was poorly received by critics.
References
External links
http://www.lemon64.com/?game_id=1667
1983 video games
Amstrad CPC games
Commodore 64 games
Single-player video games
Video games developed in the United Kingdom
ZX Spectrum games |
https://en.wikipedia.org/wiki/Domino%20computer | A domino computer is a mechanical computer built using dominoes to represent mechanical amplification or logic gating of digital signals.
Basic phenomenon
Sequences of standing dominoes (so that each domino topples the next one) can be arranged to demonstrate digital concepts such as amplification and digital signals. Since digital information is conducted by a string of dominoes, this effect differs from phenomena where:
energy is conducted without amplification, thus dissipating; or
amplification is applied to non-digital signals, allowing noise effects to occur.
The Domino Day event shows many constructs, mainly for the purposes of entertainment. Some constructs may remind people of digital circuits, suggesting that not only telegraph-like tools can be shown, but also simple information processing modules can be constructed.
It is possible to use this phenomenon for constructing unconventional computing tools. The base phenomenon is sufficient to achieve this goal, but also sophisticated “mechanical synapses” can be used (see online ), to the analogy of electrical synapses or chemical synapses.
Logical aspects
The logic gate OR is very natural in dominoes.
The problem is which gate is able to be added to OR, and obtain a functionally complete set.
Note that no domino gate can produce output 1 with all inputs 0,
so there is no NOT gate, making it impossible to make an IMPLY gate without an external 'power source' sequence.
Once we admit it, NOT is realized and we have a complete set.
But it is however distant to lead in a sequence from one source to many gates in each suitable timing.
Let us suppose we do not have one.
A root breaking system is basically needed if one wants a logical connective with output 0 for input 1.
Let P$Q be the gate in which the sequence to be turned down by P is broken by that by Q.
Then P$Q is logically equivalent to P AND (NOT Q), if the input Q is earlier than P.
The set of OR and $ can represent any logical connectives in any parity except for ones which generates 1 with all inputs 0.
Similarly, an XOR gate can be realized with the gate as a bi-root breaking system.
The problems of these two root breaking systems is that they heavily depend on the simultaneity of two inputs.
In the gate of XOR one input may destroy the opposite input root tracking back.
Note that the expression of P AND Q, P$(P$Q) OR Q$(Q$P) is symmetric,
hence does not depend on the simultaneity, and with no worry of tracking back, though it is complicated.
Record
The current record for biggest domino computer is a 5-bit adder.
At the Manchester Science Festival in 2012, mathematician Matt Parker and a team of volunteers worked together to build a domino binary adder which could add two three-bit inputs and produce a 3-bit output, which ran successfully. The following day, they attempted to build a 4-bit adder, which they completed, but the final test run had some errors (one due to signal bleed between chains of dominoes, and one |
https://en.wikipedia.org/wiki/TV/COM%20International | TV/COM International is a company that developed the Compression NetWORKS digital broadcasting system that evolved into the current DVB-S standard for digital satellite broadcasting. It was used by the short-lived AlphaStar satellite platform for content delivery and conditional access. TV/COM was formed from the former Oak Communications in San Diego to develop its Compression NetWORKS system. The company was bought by Hyundai in 1994 and became a wholly owned subsidiary of Hyundai. The company was eventually closed and its intellectual property sold to Irdeto in The Netherlands.
See also
Conditional access
AlphaStar (satellite broadcasting service)
EchoStar
Satellite television
Satellite television
Television companies of the United States |
https://en.wikipedia.org/wiki/Compression%20Networks | Compression Networks is a digital content delivery system developed by TV/COM International that evolved into the current DVB-S standard for satellite broadcasting. The system provided MPEG2 video, audio, signalling, enhanced program guide, and conditional access for pay-television services like AlphaStar.
See also
EchoStar
Satellite television
Broadcasting
Video |
https://en.wikipedia.org/wiki/Helaman%20Ferguson | Helaman Rolfe Pratt Ferguson (born 1940 in Salt Lake City, Utah) is an American sculptor and a digital artist, specifically an algorist. He is also well known for his development of the PSLQ algorithm, an integer relation detection algorithm.
Early life and education
Ferguson's mother died when he was about three and his father went off to serve in the Second World War. He was adopted by an Irish immigrant and raised in New York. He learned to work with his hands in an old-world style with earthen materials from his adoptive father who was a carpenter and stonemason by trade. An art-inclined math teacher in high school helped him develop his dual interests in math and art.
Ferguson is a graduate of Hamilton College, a liberal arts school in New York. In 1971, he received a Ph.D. in mathematics from the University of Washington.
Work
In 1977, Ferguson and another mathematician, Rodney Forcade, developed an algorithm for integer relation detection. It was the first viable generalization of the Euclidean algorithm for three or more variables. He later developed a more notable integer relation detection algorithm - the PSLQ algorithm - which was selected as one of the "Top Ten Algorithms of the Century" by Jack Dongarra and Francis Sullivan.
In January 2014, Ferguson and his wife Claire Ferguson delivered an MAA Invited Address, titled "Mathematics in Stone and Bronze," at the Joint Math Meetings in Baltimore Maryland. He is an active artist, often representing mathematical shapes in his works. One of the first bronze torii sculpted by Ferguson was exhibited at a computer art exhibition in 1989 at the Computer Museum in Boston. His most widely known piece of art is a 69 cm (27") bronze sculpture, Umbilic Torus. In 2010, the Simons Foundation, a private institution committed to the advancement of science and mathematics, commissioned him to create the Umbilic Torus SC, a massive 8.5 m (28½') high sculpture in cast bronze and granite weighing more than nine tons. With its installation completed in 2012, the torus sculpture was donated to Stony Brook University in Long Island, N.Y., and sits outside the Math and Physics buildings of the same university, near the Simons Center for Geometry and Physics. Mounted on a stainless steel column, the torus sits on a 7.7 m (25¼') diameter granite base, where various mathematical formulas defining the torus are inscribed. To create the huge sculpture, Ferguson wrote a program consisting of 25,000 movements to control a 4.9 m (16') x 6.1 m (20') robot arm and its affixed 30 cm (12") long industrial diamond-encrusted cutting tool.
Juggling
In 1987 Ferguson ran 50 miles in 16 hours while joggling.
Around that time he used to make and sell juggling balls by mail.
See also
Umbilic torus
References
External links
Home page
Celebrating Mathematics in Stone and Bronze by Helaman and Claire Ferguson, Notices of the AMS 57:7, July 2010.
20th-century American mathematicians
21st-century American mathematici |
https://en.wikipedia.org/wiki/ESPN%20Megacast | ESPN Megacast, formerly known as ESPN Full Circle, is a multi-network simulcast of a single sporting event across multiple ESPN networks and serviceswith each feed providing a different version of the telecast making use of different features, functions or perspectives. These simulcasts typically involve ESPN's linear television channels and internet streaming platforms, and may occasionally incorporate other Walt Disney Television networks at once.
ESPN Full Circle debuted with ESPN Full Circle: North Carolina at Duke on March 4, 2006, on the one-year anniversary of ESPNU. The game was the North Carolina Tar Heels at the Duke Blue Devils in college basketball. Five further Full Circle broadcasts were produced (one NBA playoff game, one NASCAR race and three more college basketball games) before the format was discontinued in 2007.
After a seven-year hiatus, full-circle broadcasts resumed under the Megacast branding in 2014. To date, the feature has primarily been used for the College Football Playoff and National Championship. ESPN has occasionally provided smaller-scale slates of alternate feeds during other broadcasts, although these have not always used the "Megacast" branding.
College Basketball Megacasts
North Carolina at Duke
The first Full Circle telecast covered the college basketball game between the North Carolina Tar Heels and the Duke Blue Devils, to honor the one-year anniversary of the launch of ESPN's college sports network ESPNU.
ESPN aired the game's traditional coverage (along with live "look-ins" to the other views, simulcast in 120 countries through ESPN International), ESPN2 featured an "Above the Rim" camera, and ESPNU featured a split-screen with the "Cameron Crazy Cam". ESPN360 offered additional stats, hosted by ESPN Radio's Jeff Rickard, Mobile ESPN featured game alerts, live updates and in-game polling for a replay of a classic Duke-North Carolina game, and ESPN.com featured live chats, in-game polling and highlights. The ESPN and ESPN2 broadcasts were also available in HD.
The game was seen by an average of 3.78 million households on ESPN and ESPN2 making it the most-viewed men's college basketball game ever combining the networks. There were also two million page views on ESPN.com and one million video streams across ESPN.com and ESPN 360. ESPN's single network coverage garnered a 3.5 rating, the network's highest-rated men's college basketball game in more than four years (Maryland at Duke posted a 3.5 in January 2002). ESPN2's "Above the Rim" coverage generated a 0.7 rating, 40% higher than the network's per-game season average. Brad Nessler called the game along with Dick Vitale and Erin Andrews. This game is significant since it was the last time to date that Nessler called a Saturday Primetime game.
NCAA Women's Basketball Championship
The sixth installment of ESPN Full Circle was on April 3, 2007, in Cleveland, Ohio. The official name of the telecast was ESPN Full Circle: NCAA Women's Championship and |
https://en.wikipedia.org/wiki/RDF%20query%20language | An RDF query language is a computer language, specifically a query language for databases, able to retrieve and manipulate data stored in Resource Description Framework (RDF) format.
SPARQL has emerged as the standard RDF query language, and in 2008 became a W3C recommendation.
Query language properties
Properties relevant to RDF query language design include support for the RDF format:
Support for RDF data, which is a collection of triples that form the RDF graph
Support for RDF semantics and inference that allows for entailment, the reasoning about the meaning of RDF graphs
Support for schema data types, such as XML schema
and for desirable language features:
Expressiveness: the power of query expression that may be constructed
Closure: data operations on an RDF graph should result in another RDF graph
Orthogonality: data operations are independent of the context in which they are used
Safety: every expression returns a finite set of results.
Query language families
RDF query languages can be grouped into language families, each family comprising a set of closely related languages.
The SPARQL family of languages includes SquishQL, RDQL, SPARQL, and TriQL. These languages treat RDF data stores as triple stores that do not necessarily have ontology or schema information associated with them. Members of the SPARQL family are considered relational query languages because they have relational or pattern-based operations. SquishQL was a language constructed to be easy to use and similar in structure to SQL. RDQL, an acronym for RDF Data Query Language, was a further development of SquishQL. RDQL was intended to be a simple low level RDF language and was at one point a candidate for W3C standardization. SPARQL is an extension of RDQL that supports extraction of RDF subgraphs. In 2008, SPARQL 1.0 became a W3C recommendation and SPARQL 1.1 became a W3C recommendation in 2013.
The RQL family of languages includes RQL, SeRQL, and eRQL. These languages support querying of both data and schema. RQL, an acronym for RDF Query Language, is known for using types defined in RDF schemas (RDFS) to query the schema class hierarchy and to support data querying by type. RQL is considered more expressive than the SPARQL family of languages, but has been criticized for too many features and unusual syntactic constructs. SeRQL and eRQL were developed as simplified alternatives to RQL.
There is a family of RDF query languages inspired by XML query technology. XQuery for RDF uses the XML query language XQuery to query RDF data by serializing RDF into an XML format and then using XQuery on the result; this has been called the "syntactic web approach". TreeHugger and RDF Twig use XSLT to query RDF data. Versa by 4Suite is a query language that drew inspiration from XPath.
There exist RDF query languages based on other principles. Metalog combines querying with reasoning and has an English like syntax. Algae is a query language developed by the W3C that |
https://en.wikipedia.org/wiki/Remi%2C%20Nobody%27s%20Girl | is a 26-episode Japanese anime television series by Nippon Animation, broacasted since 1996 to 1997 across Japan on the Fuji Television network as an installment to Nippon Animation's famed World Masterpiece Theater series. The show was Directed by Kusaba Kouzo, write by Man Shimada with character design Ooshiro Katsu . The story is adapted from Sans famille, a 1878 French novel, written by Hector Malot (Adapted previously to anime in 1977 Nobody's Boy: Remi) , This version made major changes from the book, including changing the gender of the main character or the "Swan" chapter, along with many other main events.
Started airing on September 1, 1996; the show was canceled by Fuji TV on account of low ratings; ended March 23, 1997, with a staggeringly low episode count of 23 episodes, but the complete series, all 26 episodes, was later aired by the anime satellite television network, Animax, who translated and dubbed the series into English for broadcast across its respective English-language networks in Southeast Asia and South Asia, under the title Remi, Nobody's Girl, as well as other languages.
Story
Remi, Nobody's Girl tells the story of Remi, a cheerful and tender-hearted young girl, who is an excellent singer and lives in a French country town of Chavanon with her mother. One day her father returns to the town after a long period working away from home in a city. She discovers that she was a "foundling" or an abandoned child and was adopted by Mother Barberin. Her step father Jerome leaves to work in Paris and expects Mother Barberin to send Remi to the workhouse. He returns 10 years later and finds that Remi is still there, and becomes furious and Remi is almost sold to an evil slave trader. It is Vitalis, a strolling entertainer, who helps Remi. Vitalis discovers her talent for singing and decides to take her in with his troupe. Remi starts her journey with Vitalis and his troupe animals such as the monkey Georicoule and the dogs Capi, Dolce, and Zelbino. On her journeys with Vitalis and his company she must endure and overcome many difficulties while looking for her real family.
Characters
A bright and energetic 10 year old girl. She was raised in a French village called Chavanon, but she doesn't know where she was born. Remi is an excellent singer. Her foster father, Jerome sells her to Vitalis for her to sing and perform with his band.
Her husband, Jerome, found Remi abandoned as a child on a street corner of Paris. Afterwards, Jerome leaves to work in Paris and Anne raises Remi in secret.
Remi's little sister, she is the real child of Anne Barberin.
Remi's step father. He found Remi as a baby, abandoned. He goes away to Paris to work and expects his wife to get rid of Remi and send her to the workhouse. He returns ten years later because of a work injury and sells Remi to Vitalis because they had become so poor.
The family cow, which is sold because they had become so poor.
The owner of three dogs and a monkey. He is a per |
https://en.wikipedia.org/wiki/Renegade%3A%20The%20Battle%20for%20Jacob%27s%20Star | Renegade: the Battle for Jacob's Star is a video game developed by Midnight Software and published by SSI for the personal computer.
Gameplay
Renegade: the Battle for Jacob's Star is based on Renegade Legion.
Reception
A reviewer for Next Generation hailed Renegade: The Battle for Jacob's Star as one of the few Wing Commander III: Heart of the Tiger clones which does not rely on expensive production to emulate that game's success. Particularly praising the 3D fighter models, absorbing storyline, detailed character development, and strategic gameplay, he gave it four out of five stars.
Reviews
PC Gamer (May 1995)
Computer Gaming World (May, 1995)
MikroBitti - Jun, 1995
PC Player - Mar, 1995
PC Games - Apr, 1995
References
External links
Renegade: The Battle for Jacob's Star at MobyGames
1995 video games
DOS games
DOS-only games
Single-player video games
Space combat simulators
Strategic Simulations games
Video games developed in Canada
Video games based on miniatures games |
https://en.wikipedia.org/wiki/Investigations%20in%20Numbers%2C%20Data%2C%20and%20Space | Investigations in Numbers, Data, and Space is a K–5 mathematics curriculum, developed at TERC in Cambridge, Massachusetts, United States. The curriculum is often referred to as Investigations or simply TERC. Patterned after the NCTM standards for mathematics, it is among the most widely used of the new reform mathematics curricula. As opposed to referring to textbooks and having teachers impose methods for solving arithmetic problems, the TERC program uses a constructivist approach that encourages students to develop their own understanding of mathematics. The curriculum underwent a major revision in 2005–2007.
History
Investigations was developed between 1990 and 1998. It was just one of a number of reform mathematics curricula initially funded by a National Science Foundation grant. The goals of the project raised opposition to the curriculum from critics (both parents and mathematics teachers) who objected to the emphasis on conceptual learning instead of instruction in more recognized specific methods for basic arithmetic..
The goal of the Investigations curriculum is to help all children understand the fundamental ideas of number and arithmetic, geometry, data, measurement and early algebra. Unlike traditional methods, the original edition did not provide student textbooks to describe standard methods or provide solved examples. Instead, students were guided to develop their own invented algorithms through working with concrete representations of number such as manipulatives and drawings as well as more traditional number sentences. Additional activities include journaling, cutting and pasting, interviewing (for data collection) and playing conceptual games.
Investigations released its second edition for 2006 that continues its focus on the core value of teaching for understanding. The revised version has further emphasis on basic skills and computation to complement the development of place value concepts and number sense. It is also easier for teachers to use since the format is more user friendly, though some districts have failed to carefully implement the second edition as well, and moved back to textbooks that teach traditional arithmetic methods.
Research
A systematic review of research into Investigations was conducted by the U.S. Department of Education, Institute of Education Sciences and published as part of the What Works Clearinghouse in February 2013. This found "potentially positive effects" on mathematics achievement, supported by a "medium to large" evidence base.
A variety of measures of student achievement and learning including state-mandated standardized tests, research-based interview protocols, items from research studies published in peer-reviewed journals and specially constructed paper-and-pencil tests have been used to evaluate the effectiveness of Investigations
Research featured at the TERC website states that students who use Investigations, among other things, 'do as well or better than students using |
https://en.wikipedia.org/wiki/Sans | Sans or SANS may refer to:
Acronyms
SANS device (Stoller Afferent Nerve Stimulator), a medical instrument
SANS Institute (SysAdmin, Audit, Network and Security), an American internet security training company
Sag Harbor Hills, Azurest, and Ninevah Beach Subdivisions Historic District, in Sag Harbor, New York, US
Small-angle neutron scattering, a method of studying polymers and colloids
Spaceflight-associated neuro-ocular syndrome, a disease observed in long-term spaceflight
Music
Şans, a 2009 album by Murat Boz
"sans.", a 2015 song by Toby Fox from Undertale Soundtrack
Sans, a 2018 album by Keller Williams
People
San people, an indigenous people of Southern Africa
Persons
Daniel Sans (born 1975), German tenor
Matthieu Sans (born 1988), French footballer
Other
Sans (Undertale), a video game character
Sans-serif, or sans, a typeface feature
See also
SAN (disambiguation)
Sans Souci (disambiguation) |
https://en.wikipedia.org/wiki/Line%20chart | A line chart or line graph, also known as curve chart, is a type of chart which displays information as a series of data points called 'markers' connected by straight line segments. It is a basic type of chart common in many fields. It is similar to a scatter plot except that the measurement points are ordered (typically by their x-axis value) and joined with straight line segments. A line chart is often used to visualize a trend in data over intervals of time – a time series – thus the line is often drawn chronologically. In these cases they are known as run charts.
History
Some of the earliest known line charts are generally credited to Francis Hauksbee, Nicolaus Samuel Cruquius, Johann Heinrich Lambert and William Playfair.
Example
In the experimental sciences, data collected from experiments are often visualized by a graph. For example, if one collects data on the speed of an object at certain points in time, one can visualize the data in a data table such as the following:
Such a table representation of data is a great way to display exact values, but it can prevent the discovery and understanding of patterns in the values. In addition, a table display is often erroneously considered to be an objective, neutral collection or storage of the data (and may in that sense even be erroneously considered to be the data itself) whereas it is in fact just one of various possible visualizations of the data.
Understanding the process described by the data in the table is aided by producing a graph or line chart of speed versus time. Such a visualisation appears in the figure to the right. This visualization can let the viewer quickly understand the entire process at a glance.
This visualization can however be misunderstood, especially when expressed as showing the mathematical function that expresses the speed (the dependent variable) as a function of time . This can be misunderstood as showing speed to be a variable that is dependent only on time. This would however only be true in the case of an object being acted on only by a constant force acting in a vacuum.
Such misunderstanding of the mathematical concept of something called A being a function of something called B as expressing a causal relationship is however common among laypeople (and reinforced by the term "dependent variable") and is not dependent on representation in a line chart.
Best-fit
Charts often include an overlaid mathematical function depicting the best-fit trend of the scattered data. This layer is referred to as a best-fit layer and the graph containing this layer is often referred to as a line graph.
It is simple to construct a "best-fit" layer consisting of a set of line segments connecting adjacent data points; however, such a "best-fit" is usually not an ideal representation of the trend of the underlying scatter data for the following reasons:
It is highly improbable that the discontinuities in the slope of the best-fit would correspond exactly with th |
https://en.wikipedia.org/wiki/Bernard%20Galler | Bernard A. Galler ( in Chicago – in Ann Arbor, Michigan) was an American mathematician and computer scientist at the University of Michigan who was involved in the development of large-scale operating systems and computer languages including the MAD programming language and the Michigan Terminal System operating system.
Education and career
Galler attended the University of Chicago where he earned a BSc in mathematics at the University of Chicago (1947), followed by a MSc from UCLA and a PhD from the University of Chicago (1955), advised by Paul Halmos and Marshall Stone. He joined the mathematics department at the University of Michigan (1955) where he taught the first programming course (1956) using an IBM 704. Galler helped to develop the computer language called the Michigan Algorithm Decoder (1959-) in use at several universities. He formed the Communication Sciences dept (1965), renamed Computer Sciences (CS), which became the Computer and Communications (CCS) dept (1984), and Computer Science Department in the 70s, where he retired in 1994.
Galler's class developed the realtime course scheduling program called Computer Registration Involving Student Participation (CRISP) which allowed students to register for courses without waiting in long lines. The University used the CRISP application for over fifteen years.
From 1968 to 1970, Prof. Galler was the President of the Association for Computing Machinery (ACM). In 1994 he was inducted as a Fellow of the Association for Computing Machinery. He was the founding editor of the journal IEEE Annals of the History of Computing (1979–87). He was also the President of the Software Patent Institute (1992).
For fifteen years, he served as an expert witness in numerous important legal cases around the country involving computer software issues.
Personal life
Galler was married to Enid Harris, played violin in several orchestras and chamber groups, co-founded the Ypsilanti Youth Orchestra (2001) for children
whose schools did not have string music education. He was president of the Orchestra Board at the University of Michigan and a member of the Ann Arbor chapter of Rotary International. He died from pulmonary embolism.
The Bernard A. Galler Fellowship Fund has been established at the University of Michigan Department of Electrical Engineering and Computer Science to "attract and support outstanding graduate students pursuing an advanced degree in computer science."
References
External links
Oral history interview with Bernard A. Galler Charles Babbage Institute, University of Minnesota, Minneapolis. Galler describes the development of computer science at the University of Michigan from the 1950s through the 1980s and discusses his own work in computer science. Galler also discusses Michigan's relationship with ARPANET, CSNET, and BITNET. He describes the atmosphere on campus in the 1960s and early 1970s and his various administrative roles at the university. Galler discusses his i |
https://en.wikipedia.org/wiki/PCMark | PCMark is a computer benchmark tool developed by UL (formerly Futuremark) to test the performance of a PC at the system and component level. In most cases, the tests in PCMark are designed to represent typical home user workloads. Running PCMark produces a score with higher numbers indicating better performance. Several versions of PCMark have been released. Scores cannot be compared across versions since each includes different tests.
Versions
Controversy
In a 2008 Ars Technica article, a VIA Nano gained significant performance after its CPUID changed to Intel. This was because Intel compilers create conditional code that uses more advanced instructions for CPUs that identify as Intel.
See also
Benchmark (computing)
3DMark
Futuremark
References
External links
PCMark benchmarks
Unsupported PCMark benchmarks (PCMark2002 - 7)
UL Benchmarks
Benchmarks (computing)
Software developed in Finland |
https://en.wikipedia.org/wiki/Xavier%20Minniecon | Xavier Minniecon (born 4 July 1967) is a former Australian television weather presenter. He was the weekend weather presenter on the Adelaide, South Australia edition of the Nine Network's Nine News from 1997 to 2011.
Minniecon was born in Rockhampton, Queensland on 4 July 1967. He moved to Darwin, Northern Territory in his late teens and attended Darwin High School, where he matriculated. Before working in media, he was employed variously as a computer salesman, assistant gardener, barman, waiter and singing telegram messenger.
Minniecon's media career began in Darwin in 1985 as a police and court radio reporter for the Australian Broadcasting Corporation (ABC), and then later as a television weather presenter for ABC. He joined Channel 9's weekend news team as weatherman in 1997. He is also a popular host for a wide spectrum of organisations and events around the Adelaide area.
Minniecon's recreational interests include cooking, meditation and massage therapy. He also has a long-standing interest in new religion and the supernatural and has published a book of supernatural stories, Shadows—Tales of South Australia's Supernatural.
On 13 January 2011, a spokesperson for Nine Adelaide revealed Minniecon's contract had not been renewed. He now works as a voice artist and professional speaker.
Minniecon is a widower and has three children.
References
Nine News presenters
Television meteorologists
Journalists from South Australia
Living people
1967 births |
https://en.wikipedia.org/wiki/Police%20Files%3A%20Unlocked | Police Files: Unlocked is an Australian television program that aired on the Seven Network, showcasing police videos from around the world in similar vein to World's Wildest Police Videos. The first two seasons of the program were hosted by former Blue Heelers star Ditch Davey. Repeats of the show and the third season features the narration of David Field, who also had a recurring guest role in Blue Heelers. Unlike Davey, Field did not appear on camera.
The program looks at police operations from Australia and around the world, featuring footage of high speed police pursuits, police stings and surveillance operations. At the end of each story, a summary of consequences the offender faces for their crime is revealed, and occasionally what the action would be if the offender was caught in Australia. The program claims that the vision is from actual police tapes.
The first-season finale of Police Files: Unlocked was broadcast on 29 November 2006 in a one-hour special episode. A second season aired in 2007, and a third season began airing in March 2008. It was axed in 2008.
References
External links
Official Yahoo!7 site
News article telling of Ditch Davey's return to TV
Seven Network original programming
2000s Australian documentary television series
2006 Australian television series debuts
2008 Australian television series endings
Australian factual television series
Documentary television series about policing |
https://en.wikipedia.org/wiki/Prior%20knowledge%20for%20pattern%20recognition | Pattern recognition is a very active field of research intimately bound to machine learning. Also known as classification or statistical classification, pattern recognition aims at building a classifier that can determine the class of an input pattern. This procedure, known as training, corresponds to learning an unknown decision function based only on a set of input-output pairs that form the training data (or training set). Nonetheless, in real world applications such as character recognition, a certain amount of information on the problem is usually known beforehand. The incorporation of this prior knowledge into the training is the key element that will allow an increase of performance in many applications.
Prior Knowledge
Prior knowledge refers to all information about the problem available in addition to the training data. However, in this most general form, determining a model from a finite set of samples without prior knowledge is an ill-posed problem, in the sense that a unique model may not exist. Many classifiers incorporate the general smoothness assumption that a test pattern similar to one of the training samples tends to be assigned to the same class.
The importance of prior knowledge in machine learning is suggested by its role in search and optimization. Loosely, the no free lunch theorem states that all search algorithms have the same average performance over all problems, and thus implies that to gain in performance on a certain application one must use a specialized algorithm that includes some prior knowledge about the problem.
The different types of prior knowledge encountered in pattern recognition are now regrouped under two main categories: class-invariance and knowledge on the data.
Class-invariance
A very common type of prior knowledge in pattern recognition is the invariance of the class (or the output of the classifier) to a transformation of the input pattern. This type of knowledge is referred to as transformation-invariance. The mostly used transformations used in image recognition are:
translation;
rotation;
skewing;
scaling.
Incorporating the invariance to a transformation parametrized in into a classifier of output for an input pattern corresponds to enforcing the equality
Local invariance can also be considered for a transformation centered at , so that , by using the constraint
The function in these equations can be either the decision function of the classifier or its real-valued output.
Another approach is to consider class-invariance with respect to a "domain of the input space" instead of a transformation. In this case, the problem becomes finding so that
where is the membership class of the region of the input space.
A different type of class-invariance found in pattern recognition is permutation-invariance, i.e. invariance of the class to a permutation of elements in a structured input. A typical application of this type of prior knowledge is a classifier invariant to permut |
https://en.wikipedia.org/wiki/International%20Association%20of%20Homes%20and%20Services%20for%20the%20Aging | The Global Ageing Network (formerly the International Association for Homes and Services for the Aging (IAHSA)) is an international, not-for-profit educational and charitable organization founded in 1994.
Affiliations
The Global Ageing Network is a Non-Governmental Organization (NGO) in Special Consultative Status with the United Nations. It works with other organizations, including:
AARP International
Alzheimer's Disease International
Helpage International
International Coalition of Intergenerational Programs
International Federation on Ageing
International Longevity Center
United Nations Department of Economic and Social Affairs
Education
The Global Ageing Network hosts a biennial international conference.
Past conference site have included:
Amsterdam, The Netherlands
Barcelona, Spain
Honolulu, Hawaii, United States of America
Vancouver, BC, Canada
Sydney, Australia
Trondheim, Norway
St. Julian's, Malta
London, England
Washington, D.C.
Shanghai, China
Perth, Australia
Membership
The Global Ageing Network membership is open providers of aging services, governments, universities, individuals and corporations.
Global Ageing Network
Global Ageing Network Members are from the following countries:
Australia, Austria, Canada, People's Republic of China, Czech Republic, Croatia, Denmark, Ecuador, Finland, France, Germany, India, Italy, Japan, South Korea, Hong Kong, Malta, The Netherlands, New Zealand, Norway, Portugal, Russia, Singapore, South Africa, Spain, Sweden, Switzerland, Taiwan, Thailand, United Kingdom, Ukraine and the United States of America.
International non-profit organizations
Organizations established in 1994
Non-profit organizations based in Washington, D.C.
Gerontology organizations |
https://en.wikipedia.org/wiki/Pinakamamahal | (International title: Beloved) is a 2006 Philippine television drama romance series broadcast by GMA Network. It stars Oyo Boy Sotto and Marian Rivera. It premiered on August 14, 2006 on the network's Dramarama sa Hapon line up replacing Agawin Mo Man ang Lahat. The series concluded on November 3, 2006 with a total of 60 episodes. It was replaced by Makita Ka Lang Muli in its timeslot.
Cast and characters
Lead cast
Oyo Boy Sotto as Martin Padua
Marian Rivera as Carissa Crismundo
Pauleen Luna as Nanette Casayuran
Danilo Barrios as Jeremy Dizon
Danica Sotto as Amy Querubin
AJ Eigenmann as Lito Arguelles
Supporting cast
Hero Angeles as Michael Casayuran
Maritoni Fernandez as Marikrissa Padua
Lollie Mara as Sofia Padua
Gary Estrada as Ricardo Padua
Pinky Amador as Margie Crismundo
Krystal Reyes as Cristine "Tintin" Padua
Menggie Cobarrubias as Gustino "Father Gustin"
Robert Seña as Edward
Bing Loyzaga as Sister Salve Querubin
Guest cast
Sandy Andolong as Sister Agatha Lucero
Joyce Ching as young Nanette Casayuran
Vice Ganda
References
External links
2006 Philippine television series debuts
2006 Philippine television series endings
Filipino-language television shows
GMA Network drama series
Philippine romance television series
Television series by TAPE Inc.
Television shows set in the Philippines |
https://en.wikipedia.org/wiki/Tesseract%20%28software%29 | Tesseract is an optical character recognition engine for various operating systems. It is free software, released under the Apache License. Originally developed by Hewlett-Packard as proprietary software in the 1980s, it was released as open source in 2005 and development has been sponsored by Google since 2006.
In 2006, Tesseract was considered one of the most accurate open-source OCR engines available.
History
The Tesseract engine was originally developed as proprietary software at Hewlett-Packard labs in Bristol, England and Greeley, Colorado between 1985 and 1994, with more changes made in 1996 to port to Windows, and some migration from C to C++ in 1998. A lot of the code was written in C, and then some more was written in C++. Since then, all the code has been converted to at least compile with a C++ compiler. Very little work was done in the following decade. It was then released as open source in 2005 by Hewlett-Packard and the University of Nevada, Las Vegas (UNLV). Tesseract development has been sponsored by Google since 2006.
Version 4 adds LSTM-based OCR engine and models for many additional languages and scripts, bringing the total to 116 languages. Additionally 37 scripts are supported. So it is for example possible to recognize text with a mix of Western and Central European languages by using the model for the Latin script it is written in.
Version 5 was released in 2021, after more than two years of testing and developing.
Features
Tesseract was in the top three OCR engines in terms of character accuracy in 1995. It is available for Linux, Windows and Mac OS X.
Tesseract up to and including version 2 could only accept TIFF images of simple one-column text as inputs. These early versions did not include layout analysis, and so inputting multi-columned text, images, or equations produced garbled output. Since version 3.00 Tesseract has supported output text formatting, hOCR positional information and page-layout analysis. Support for a number of new image formats was added using the Leptonica library. Tesseract can detect whether text is monospaced or proportionally spaced.
The initial versions of Tesseract could only recognize English-language text. Tesseract v2 added six additional Western languages (French, Italian, German, Spanish, Brazilian Portuguese, Dutch). Version 3 extended language support significantly to include ideographic (Chinese & Japanese) and right-to-left (e.g. Arabic, Hebrew) languages, as well as many more scripts. New languages included Arabic, Bulgarian, Catalan, Chinese (Simplified and Traditional), Croatian, Czech, Danish, German (Fraktur script), Greek, Finnish, Hebrew, Hindi, Hungarian, Indonesian, Japanese, Korean, Latvian, Lithuanian, Norwegian, Polish, Portuguese, Romanian, Russian, Serbian, Slovak (standard and Fraktur script), Slovenian, Swedish, Tagalog, Tamil, Thai, Turkish, Ukrainian and Vietnamese. V3.04, released in July 2015, added an additional 39 language/script combinations, brin |
https://en.wikipedia.org/wiki/List%20of%20diplomatic%20missions%20of%20Russia | This is a list of diplomatic missions of Russia. These missions are subordinate to the Russian Ministry of Foreign Affairs. The Russian Federation has one of the largest networks of embassies and consulates of any country. Russia has significant interests in Eastern Europe, the Near East and especially in the former states of the Soviet Union. It also has extensive ties to countries in the developing world, a legacy of Cold War diplomatic efforts to extend the Soviet Union's influence in Africa and Asia which are now more important for commercial reasons.
Russia established several consulates in the United States and Canada to cater to Russian immigrants. In 1917, the Tsarist government vanished, with a number of consuls who maintained tsarist loyalties establishing the "Council of Ambassadors" (), through which they worked as embassies without a government. Among these were consuls in seven U.S. cities and three Canadian cities, receiving financing from the U.S. government. The consuls stopped their services in the late 1920s; the U.S. government seized the records of the consulates. The seizure started a long dispute. The National Archives and Records Administration received the documents in 1949. In 1980 the U.S. government loaned the documents of the Canadian consulates to the Library and Archives Canada. On 31 January 1990 the U.S. returned the documents to the Soviet Union and kept the microfilms as evidence.
After 1992, due to financial reasons, embassies in Freetown (Sierra Leone), Monrovia (Liberia), Maseru (Lesotho), Mogadishu (Somalia), Niamey (Niger), Ouagadougou (Burkina Faso), and Port Moresby (Papua New Guinea) were closed. In 1995 the embassy in Paramaribo (Suriname) also suspended operations.
The Russian Federation has no diplomatic relations with Bhutan and Solomon Islands. Since Georgia and Russia severed diplomatic relations in 2008, the Swiss embassy in Tbilisi hosts a Russian interests section.
In February 2022, Micronesia and Ukraine severed diplomatic relations with Russia.
Current missions
Africa
Americas
Asia
Europe
Oceania
International organizations
Embassies to open
Closed missions
Africa
Americas
Asia
Oceania
Europe
See also
Ambassadors of Russia
Foreign relations of Russia
List of diplomatic missions in Russia
Notes
References
Russian Ministry of Foreign Affairs
Дипломатические и консульские представительства России за рубежом
External links
Ministry of Foreign Affairs
Archived Ministry of Foreign Affairs
Ministry of Foreign Affairs
Russia
Diplomatic missions |
https://en.wikipedia.org/wiki/Dalhousie%20University%20Faculty%20of%20Computer%20Science | The Faculty of Computer Science is a faculty of Dalhousie University in Halifax, Nova Scotia, Canada.
History
The Faculty of Computer Science was officially founded on 1 April 1997 with the merger of the Technical University of Nova Scotia (TUNS) into Dalhousie University.
The Faculty of Computer Science traces its history to the School of Computer Science at TUNS and the Computer Science Division of the Department of Mathematics, Statistics and Computer Science at Dalhousie University.
Upon its founding, the Faculty of Computer Science took residence on the 15th and 16th floors of the Maritime Centre until the new Computer Science Building was completed in the fall of 1999. The new building was designed by Brian MacKay-Lyons and was featured in Canadian Architect in March 2000. It was renamed "Goldberg Computer Science Building" in June 2008 in recognition of a donation by Seymour Schulich and his wife, Tanna Goldberg-Schulich.
In July 2013, the Faculty launched the Institute for Big Data Analytics.
Programs
The Faculty of Computer Science offers several undergraduate programs including:
Bachelor of Computer Science (with/without Honours)
Data science Specialization
Artificial Intelligence Specialization
Cyber Security Specialization
Digital Media Specialization
Bioinformatics Specialization
Bachelor of Applied Computer Science (with/without Honours)
In general, the philosophy of the undergraduate program is to build a solid foundation of mathematics and computer science during the first three years of the program, allowing students more flexibility in fourth year.
The school offers a number of graduate level programs spanning fields such as bioinformatics, computational neuroscience, and machine learning.
Notable people
Erik Demaine, Professor at MIT
Danielle Fong, Co-founder of LightSail Energy
Paul Gauthier, Co-founder of Inktomi and CTO of Groupon
Peter O'Hearn
References
External links
Dalhousie Computer Science Website
Computer Science
Dalhousie |
https://en.wikipedia.org/wiki/Center%20for%20Computer%20Games%20Research | The Center for Computer Games Research is located at the IT University of Copenhagen, Denmark and was one of the first academic departments entirely dedicated to the scholarly study of digital gaming. Originally a part of the Department of Digital Aesthetics and Communication and spun off into its own independent unit in 2003, the Center was notable at the time for its sole specialization in gaming. It has historically been a multidisciplinary unit with faculty from fields ranging from literature to sociology to computer science. It has hosted a number of key conferences over the years including Other Players (2004), the 2005 iteration of the Digital Arts and Culture conference, and the IEEE Conference on Computational Intelligence and Games in 2010.
It continues to provide institutional support to the peer-reviewed journal Game Studies, which launched in 2001 (the editor-in-chief, Espen Aarseth, is former head of the Center and current Professor at the ITU).
The Center played a significant role for a number of important game studies scholars and designers. In addition to being the intellectual home for the university's Masters Program in Gaming, the Center has produced a number of PhD's over the years including scholars who have gone on to do major work in the field (see below).
Researchers affiliated with the Center include (current and former):
Espen Aarseth
T. L. Taylor
Miguel Sicart
Lisbeth Klastrup
Susanna Tosca
Jesper Juul
Gonzalo Frasca
Simon Egenfeldt-Nielsen
Georgios N. Yannakakis
Julian Togelius
Mark Nelson
Katherine Isbister
Emma Witkowski
Douglas Wilson
Martin Pichlmair
Sebastian Risi
References
The New York Times The Ivy Covered Console
New Scientist: Adaptive games promise high scores for everyone
BBC: Academics take on video games
Miami Herald: Higher education is child's play in video game degree program
External links
Center for Computer Games Research website
Computer science institutes in Denmark
Video game culture
IT University of Copenhagen |
https://en.wikipedia.org/wiki/PDP-16 | The PDP-16 (Programmed Data Processor-16) was mainly intended for industrial control systems, but with more capability than DEC's PDP-14.
Overview
The PDP-16 family of modules was introduced in 1971, and a pre-assembled system using these modules, the PDP-16/M was introduced in 1972. The 16/M was nicknamed "Subminicomputer" and described as "a small microprogrammable computer."
The general-purpose modules included:
components to build a data path (registers, memories, ALUs, etc.)
components to build a control structure (evoke an operation in the datapath, branch on a condition from the datapath, merge, etc.)
other components necessary to complete a digital system (lights, switches, bus termination, backplane, etc.)
The control structure was similar to a flow chart,
which was very familiar to software developers.
As a result, the PDP-16 opened up digital system design to those with experience writing software but less hardware design experience than was traditionally required for this work.
These modules were in the company's M series of Flip-Chip modules, which used TTL circuit technology.
The economic strength of the PDP-16 was that it was effective "for designing unique (or relatively low production volume) systems."
References
DEC computers |
https://en.wikipedia.org/wiki/%C3%9E%C3%B3rvaldr%20Hjaltason | Þórvaldr Hjaltason (Old Norse: ; Modern Icelandic: ) was a late 10th-century Icelandic skald in the service of the Swedish king Eric the Victorious.
He is listed in Skáldatal as in Eric's service. Styrbjarnar þáttr Svíakappa recounts that he took part in the Battle of the Fýrisvellir against Styrbjörn the Strong and in response to the king's call for verses commemorating the victory, composed in dróttkvætt the following two lausavísur:
These are the only verses attributed to him; the tale says that he received a ring worth half a mark for each verse, and that he is not known to have composed any other verses, either before or after. He may have brought the news of the battle back to Iceland.
He may be the same person as the Þorvaldr Hjaltason who is mentioned with his brother Þórðr in Landnamabók and a number of Sagas of Icelanders, but that Þorvaldr is not said to be a skald.
References
10th-century Icelandic poets |
https://en.wikipedia.org/wiki/Tera-10 | TERA-10 is a supercomputer built by Bull SA for the French Commissariat à l'Énergie Atomique, (Atomic Energy Commission).
TERA-10 was ranked 142nd on the TOP500 list in 2010. By 2015 it had dropped off the bottom of the list. It runs at 52.84 teraFLOPs (52.84 trillion floating-point calculations per second) using nearly 10,000 processor cores (in about 4800 dual-core processors). It runs the Linux operating system, with an SMP kernel specially modified to handle very large symmetric clusters currently cadenced by an 8-processors central system.
Its main application is the simulation of atomic experiences and the maintenance of the French nuclear defence force, using the results of true nuclear tests (between 1956 and 1995, most of them in the French Nuclear Test Plant in the Pacific) and the new results obtained from the LMJ (Laser Mega-Joule) built in continental France.
Evolution
This is the end of a second generation of evolutions, the next generation Tera-100 reached about 1 petaFLOPS using processors with more internal cores and a new central scheduling system allowing asymmetric operation on a variable number of processors, for easier upgrades, lower maintenance cost, and more experiences requiring different computing scales, without having to rebuild the whole cluster.
Supercomputing in Europe
Supercomputers |
https://en.wikipedia.org/wiki/Ken%20Arnold | Kenneth Cutts Richard Cabot Arnold (born 1958) is an American computer programmer well known as one of the developers of the 1980s dungeon-crawling video game Rogue, for his contributions to the original Berkeley (BSD) distribution of Unix, for his books and articles about C and C++ (e.g. his 1980s–1990s Unix Review column, "The C Advisor"), and his high-profile work on the Java platform.
At Berkeley
Arnold attended the University of California, Berkeley, after having worked at Lawrence Berkeley National Laboratory computer labs for a year, receiving his A.B. in computer science in 1985. At Berkeley, he was president of the Berkeley Computer Club and of the Computer Science Undergraduates Association, and made many contributions to the 2BSD and 4BSD Berkeley Unix distributions, including:
curses and termcap: a hardware-independent library for controlling cursor movement, screen editing, and window creation on ASCII display terminals, based on termcap (based on Bill Joy's vi screen control code). Curses was a landmark display library that made it possible for a vast number of new applications to create full-screen user interfaces that were portable between different brands of display terminal.
Rogue: Arnold, Michael Toy, and Glenn Wichman co-wrote Rogue, a full-screen role-playing video game that presented a then-novel view of the "dungeon" from above (rather than via textual description as in the older Zork and Adventure). It spawned an entire genre of "roguelike" games.
fortune: a fortune cookie program. Although Arnold's quote-displaying program was not the first in history, as the BSD standard it became by far the most widely used, and its database of quotes was voluminous. It also standardized a plain-text file format that was philosophically aligned with Unix and thus became widely used both for other fortune programs as well as non-fortune purposes.
ctags: a program for generating cross-references in computer source code.
Selected bibliography
JavaSpaces. Principles, Patterns, and Practice; Eric Freeman, Susanne Hupfer, Ken Arnold;
The Java Programming Language; 4th Edition; Ken Arnold, James Gosling, David Holmes;
Sample chapter: A Taste of Java's I/O Package: Streams, Files, and So Much More
The Jini(TM) Specification, 2nd Edition; Ken Arnold, Jim Waldo and the rest of the Jini technology team. Part of the official Jini Technology Series, published by Addison Wesley.
"Fear and Loathing on the UNIX Trail -- Confessions of a Berkeley system mole."; Doug Merritt with Ken Arnold and Bob Toxen; Unix Review, Jan 1985
"Rogue: Where It has Been, Why It Was There, And Why It Shouldn't Have Been There In The First Place"; USENIX Conference Proceedings; Boston, July 1982, p. 139 ff; Ken C.R.C. Arnold, Michael C. Toy
See also
History of video games
The Art of Unix Programming
References
External links
Ken Arnold's (low volume) Artima log
Ken Arnold's (low volume) java.net blog
curses
Wichman's view of Rogue history
Napkin Lo |
https://en.wikipedia.org/wiki/The%20Little%20Kingdom | The Little Kingdom: The Private Story of Apple Computer is the first book that documented the development of Apple Computer. It was published in 1984 and written by then-Time Magazine reporter Michael Moritz. While Steve Jobs initially cooperated with Moritz, he ended communication in the middle of the project and did not authorize the published final version. Moritz reissued an updated version of the book in 2009 as Return to the Little Kingdom: Steve Jobs, the Creation of Apple, and How It Changed the World.
Jobs contracted Moritz in the early 1980s to document the development of the Macintosh for a book he was writing about Apple. According to Andy Hertzfeld, Jobs stated that "Mike's going to be our historian," a comment made in response to a published history in the previous year of another computer company. As he was close in age to many on the development team, he seemed to be a good choice. By late 1982, Moritz was Time Magazine's San Francisco Bureau Chief and working on the special Time Person of the Year issue. His work on that issue (which was initially supposed to be about Jobs) included a lengthy interview with Jobs' high school girlfriend, Chrisann Brennan, in which she discussed the history of their child, Lisa. Moritz's follow up interview with Jobs on the subject led to denial of paternity on his part. The issue also contained negative commentary on Jobs from other Apple employees.
The special issue was later renamed Machine of the Year prior to publication,
In the Prologue to Return to the Little Kingdom: Steve Jobs, the Creation of Apple, and How It Changed the World (the 2009 updated reissue of The Little Kingdom) Moritz states that he was as incensed as Jobs was about the Time Magazine special issue: "Steve rightly took umbrage over his portrayal and what he saw as a grotesque betrayal of confidences, while I was equally distraught by the way in which material I had arduously gathered for a book about Apple was siphoned, filtered, and poisoned with a gossipy benzene by an editor in New York whose regular task was to chronicle the wayward world of rock-and-roll music. Steve made no secret of his anger and left a torrent of messages on the answering machine I kept in my converted earthquake cottage at the foot of San Francisco’s Potrero Hill. He, understandably, banished me from Apple and forbade anyone in his orbit to talk to me. The experience made me decide that I would never again work anywhere I could not exert a large amount of control over my own destiny or where I would be paid by the word. I finished my leave [and] published my book, The Little Kingdom: The Private Story of Apple Computer, which I felt, unlike the unfortunate magazine article, presented a balanced portrait of the young Steve Jobs."
Notes
External links
Official Website
1984 non-fiction books
Books about Apple Inc.
Books about Steve Jobs
William Morrow and Company books |
https://en.wikipedia.org/wiki/Window%20Snyder | Mwende Window Snyder (born 1975), better known as Window Snyder, is an American computer security expert. She has been a top security officer at Square, Inc., Apple, Fastly, Intel and Mozilla Corporation. She was also a senior security strategist at Microsoft. She is co-author of Threat Modeling, a standard manual on application security.
Biography
Snyder was born in New Jersey, from an American father and a Kenyan-born mother, Wayua Muasa. She goes by her middle name Window; her first name is used only by family members. She attended Boston College, after graduating from Choate Rosemary Hall in 1993 and has served on their board. While earning her undergraduate degree in computer science, she became interested in cryptography and crypto-analysis and began actively working on the topic of cybersecurity with the Boston hacker community in the 1990s, building her own tools and getting familiar with multi-user systems. She went by the nickname Rosie the Riveter in the hacker scene.
She then pursued this career path as one of the first computer scientists to specialize in cybersecurity, and to proactively try to bridge the gap between corporations and the security researchers often termed 'hackers.' She joined @stake as the 10th employee, and rose to director of security architecture, until she left the company in 2002. Subsequently, she worked as a senior security strategist at Microsoft in the Security Engineering and Communications group. During this time, she was a contributor to the Security Design Lifecycle (SDL) and co-developed a new methodology for threat modeling software, as well as acting as security lead and signoff on Microsoft Windows XP Service Pack 2 and Windows Server 2003. She also created the Blue Hat Microsoft Hacker Conference, an event bringing together engineers at Microsoft and hackers for a dialogue about the security of Microsoft's software. After leaving Microsoft in 2005, she worked as a principal, founder, and CTO at Matasano Security, a security services and product company later acquired by NCC Group. She joined Mozilla in September 2006.
On December 10, 2008, Snyder said that she would be leaving Mozilla Corporation at the end of the year. On March 1, 2010, Snyder began work at Apple Inc. as product manager responsible for the privacy and security of all Apple products.
In 2015, Snyder became chief security officer at content distribution network Fastly.
Intel's Software and Services Group senior vice president and general manager, Doug Fisher, announced in July 2018 that Snyder would become the company's Platforms Security Division's chief security officer, vice president and general manager. She has since left Intel and in May 2019 joined Square, Inc.
On April 22, 2021, Snyder announced she had started a new company, Thistle Technologies, which describes itself as providing a "secure foundation for devices."
Works
Public appearances
Window Snyder has been appearing publicly to speak about challenges in compu |
https://en.wikipedia.org/wiki/Zoomracks | Zoomracks was a shareware database management system for the Atari ST and IBM PC that used a card-file metaphor for displaying and manipulating data. Its main claim to fame was an early and somewhat contentious software patent lawsuit filed against Apple Computer's HyperCard and similar products.
Zoomracks, introduced in 1985, represented data in a form that was visually represented by filing cards, known as "QUICKCARD"s. Cards could be designed within the program as "templates", using general-purpose data fields known as "FIELDSCROLL"s, which could hold up to 250 lines of 80 characters. Cards were collected into a "RACK", which was essentially a single database file. The display was character-based and did not make use of the Atari's GEM interface even though this was the primary platform for the product. Unlike similar database programs of the era, Zoomracks did not support different types of data internally; everything was represented as text.
When a rack was opened the cards were displayed as if they were in a sort of linear rolodex, and the user could "zoom in", non-graphically, on any particular area to see more details of the cards in that area, and then zoom in again to see all of the fields on a particular card. The racks could display their cards sorted in a variety of ways, making navigation much easier than with a real-world rolodex, which is sorted only by a single pre-defined index (normally last name). Data could be moved from database to database simply by cutting a card out of one stack and pasting it into another. Up to nine racks could be opened at one time.
Zoomracks II, introduced in 1987, added support for report generation and some basic mathematics. In order to extract a certain subset of the information in a rack and lay it out for printing, the original Zoomracks required the user to cut and paste the desired cards into a new rack. In Zoomracks II a report (possibly only one per rack?) could be defined, laid out as needed complete with headers and footers.
Zoomracks II also added a rudimentary "macro" system that allowed the user to assign a series of commands to a letter on the keyboard. A series of programming commands could be added by the user to the resulting macros, including basic loops, if/then and data input. Macros were physically stored as cards in a separate rack, and could be used "against" any other rack, although the usefulness of this seems questionable (since code is generally tightly bound to the data it works on).
Zoomracks was well received and won "Best Database" by Compute! magazine in January 1989. This does not appear to have translated into widespread use or sales, however, although much of this is likely due to Atari's deteriorating sales in the late 1980s.
Zoomracks' author, Paul Heckel (formerly of Xerox PARC), received US Patent #4486857 for "Display system for the suppression and regeneration of characters in a series of fields in a stored record", describing the basic on-screen operat |
https://en.wikipedia.org/wiki/Cadena%20COPE | COPE, an acronym for Cadena de Ondas Populares Españolas ("People's Radiowaves of Spain Network") formerly called Radio Popular, is a Spanish language radio station. It is the second most listened to in Spain's generalist radio. Owned by the Spanish Episcopal Conference company "Radio Popular SA", belongs to the "Group COPE" with music stations Cadena 100, Rock FM and Megastar FM, in addition to Spain's generalist TV channel Trece. The station is associated with Spain's journal Diario ABC.
Created with the aim of offering religious services, since the 1980s its programming has evolved into the model of conventional general radio, while maintaining programs with religious content, such as El Espejo (The Mirror) of José Luis Restán and La linterna de la Iglesia (The Lantern of the Church) of Faustino Catalina, especially on Sundays in the day when Holy Mass and special dates News Church and Catholic liturgical calendar as Christmas and Easter is issued. Its editorial guideline is the promotion of the views of the hierarchy of the Spanish Catholic Church.
See also
Radio Maria
External links
COPE
Catholic Church in Spain
Radio stations established in 1960
1960 establishments in Spain
Catholic radio stations |
https://en.wikipedia.org/wiki/Vertex%20normal | In the geometry of computer graphics, a vertex normal at a vertex of a polyhedron is a directional vector associated with a vertex, intended as a replacement to the true geometric normal of the surface. Commonly, it is computed as the normalized average of the surface normals of the faces that contain that vertex. The average can be weighted for example by the area of the face or it can be unweighted. Vertex normals can also be computed for polygonal approximations to surfaces such as NURBS, or specified explicitly for artistic purposes. Vertex normals are used in Gouraud shading, Phong shading and other lighting models. Using vertex normals, much smoother shading than flat shading can be achieved; however, without some modifications to topology such a support loops, it cannot produce a sharper edge.
See also
Specular highlight
Per-pixel lighting
References
Shading
pt:Normal de Vértice |
https://en.wikipedia.org/wiki/T/Maker | T/Maker (Table Maker) was one of the first spreadsheet programs designed for the personal computer user and released by Peter Roizen in 1979. The application ran on CP/M, TRSDOS, and later on MS-DOS computers. T/Maker was originally distributed by Lifeboat Associates of New York.
T/Maker took a different approach to most other spreadsheets: instead of embedding formulas in each cell, formulas were defined on a per-row and per-column basis in the margins.
Although T/Maker was released six months after VisiCalc, it was perhaps the first application to provide an 'office' suite approach to data. Tables could be used in databases or spreadsheets and were accessible in 'word' type documents.
T/Maker company
The T/Maker Company was an early personal computer software company, formed in 1983 in order to market CP/M and MS-DOS programs that had originally been published by 3rd party publishing houses. They expanded into the Apple Macintosh market, releasing the ClickArt line of clip art. Other products included WriteNow on the Mac and NeXT platforms.
In 1983 T/Maker Company was incorporated in Mountain View, California by Heidi Roizen – Peter's sister and a then-recent Stanford University Graduate School of Business graduate – who became its CEO.
T/Maker Company went on to publish its own line of integrated applications, and also products by others intended for DOS and Windows computers as well as the Apple Macintosh, including ClickArt, the fifth software title available for the Mac. It was also one of the first companies to offer fonts for the Macintosh. By 1988, it no longer sold the product of its namesake, T/Maker.
Other notable T/Maker products include Personal Publisher, a consumer-oriented desktop publishing application for the PC (acquired by Software Publishing Corporation in 1986), SmartBundle, an "office" styled bundle of major applications, Vroombooks, a multimedia storybook, and the Macintosh word processor WriteNow, (which it licensed from NeXT in 1985 and ultimately sold to WordStar in 1993).
Heidi and business partner/chairman Royal Farros purchased T/Maker from Peter in 1986 and continued bootstrapping until 1989, when it became venture capital firm Hummer Winblad Venture Partners’ first venture investment. Ann Winblad became a director of the company at that time. Tim Draper of Draper Fisher led the company’s second round in 1993 and also joined the board.
T/Maker was acquired in 1994 by Deluxe Corporation. Both Heidi and Royal left the company in 1996, Heidi becoming VP of Worldwide Developer Relations at Apple Computer and Royal founding and becoming CEO of an online print shop, iPrint.com.
T/Maker’s remaining products were ultimately acquired by Broderbund, who continues to market and expand the ClickArt line.
References
External links
Broderbund official website
Peter Roizen official website
Heidi.roizen.com
T/Maker Five website
CP/M software
DOS software
Spreadsheet software
Proprietary software
1979 software |
https://en.wikipedia.org/wiki/Texture%20atlas | In computer graphics, a texture atlas (also called a spritesheet or an image sprite in 2d game development) is an image containing multiple smaller images, usually packed together to reduce overall dimensions. An atlas can consist of uniformly-sized images or images of varying dimensions. A sub-image is drawn using custom texture coordinates to pick it out of the atlas.
Benefits
In an application where many small textures are used frequently, it is often more efficient to store the textures in a texture atlas which is treated as a single unit by the graphics hardware. This reduces both the disk I/O overhead and the overhead of a context switch by increasing memory locality. Careful alignment may be needed to avoid bleeding between sub textures when used with mipmapping and texture compression.
In web development, images are packed into a sprite sheet to reduce the number of image resources that need to be fetched in order to display a page.
Gallery
References
External links
Explanations and algorithms
Texture Atlas Whitepaper - A whitepaper by NVIDIA which explains the technique.
Practical Texture Atlases - A guide on using a texture atlas (and the pros and cons).
A thousand ways to pack the bin - Review and benchmark of the different packing algorithms
Sprite Sheets - Essential Facts Every Game Developer Should Know - Funny video explaining the benefits of using sprite sheets
What is Texture Atlas? - Blog post that explain atlas textures and their usage areas
Tools
TexturePacker - sprite sheet packer with graphical user interface and tons of options. Works with almost all game engines.
LibGDX texture packer - Open source texture packer utility from libGDX
Texture Atlas Maker - Open source texture atlas utility for 2D OpenGL games.
SpriteMapper - Open source texture atlas (sprite map) utility including an Apache Ant task.
CC0 Atlas Textures - Copyright-free atlas texture library
3D rendering
Computer graphics |
https://en.wikipedia.org/wiki/Beaverhill%20Lake | Beaverhill Lake () is a large lake in central Alberta, Canada. It is a site of regional importance in the Western Hemisphere Shorebird Reserve Network. It is managed by the Canadian Wildlife Service division of Environment Canada.
It is located 70 km southeast of Edmonton, near the town of Tofield, and lies in the hydrographic basin of the North Saskatchewan River.
As recently as 1990, the lake had a total area of and a maximum depth of only Like similar "prairie pothole" lakes, Beaverhill lake receded significantly after much of its headwaters were diverted, in recent years it has lost about one-quarter of its depth between 1999 and 2009.
The lake is an important bird habitat and has been designated as a "National Nature Viewpoint" by Nature Canada (formerly known as the Canadian Nature Federation) in 1981. The Beaverhill Natural Area was established in 1987 to protect the lake and its surrounding area. Beaverhill Lake Heritage Rangeland Natural Area is also established on what were the shores of the lake.
The Beaverhill Lake Group, a stratigraphical unit of the Western Canadian Sedimentary Basin was named for this lake.
References
Beaver County, Alberta
Lakes of Alberta
Lamont County
Ramsar sites in Canada |
https://en.wikipedia.org/wiki/Data%20consistency | Data inconsistency refers to whether the same data kept at different places do or do not match.
Point-in-time consistency
Point-in-time consistency is an important property of backup files and a critical objective of software that creates backups. It is also relevant to the design of disk memory systems, specifically relating to what happens when they are unexpectedly shut down.
As a relevant backup example, consider a website with a database such as the online encyclopedia Wikipedia, which needs to be operational around the clock, but also must be backed up with regularity to protect against disaster. Portions of Wikipedia are constantly being updated every minute of every day, meanwhile, Wikipedia's database is stored on servers in the form of one or several very large files which require minutes or hours to back up.
These large files—as with any database—contain numerous data structures which reference each other by location. For example, some structures are indexes which permit the database subsystem to quickly find search results. If the data structures cease to reference each other properly, then the database can be said to be corrupted.
Counter example
The importance of point-in-time consistency can be illustrated with what would happen if a backup were made without it.
Assume Wikipedia's database is a huge file, which has an important index located 20% of the way through, and saves article data at the 75% mark. Consider a scenario where an editor comes and creates a new article at the same time a backup is being performed, which is being made as a simple "file copy" which copies from the beginning to the end of the large file(s) and doesn't consider data consistency - and at the time of the article edit, it is 50% complete. The new article is added to the article space (at the 75% mark) and a corresponding index entry is added (at the 20% mark).
Because the backup is already halfway done and the index already copied, the backup will be written with the article data present, but with the index reference missing. As a result of the inconsistency, this file is considered corrupted.
In real life, a real database such as Wikipedia's may be edited thousands of times per hour, and references are virtually always spread throughout the file and can number into the millions, billions, or more. A sequential "copy" backup would literally contain so many small corruptions that the backup would be completely unusable without a lengthy repair process which could provide no guarantee as to the completeness of what has been recovered.
A backup process which properly accounts for data consistency ensures that the backup is a snapshot of how the entire database looked at a single moment. In the given Wikipedia example, it would ensure that the backup was written without the added article at the 75% mark, so that the article data would be consistent with the index data previously written.
Disk caching systems
Point-in-time consistency is |
https://en.wikipedia.org/wiki/Spirit%20Television | Spirit tv is a non-profit Christian music station which airs in a stream on the Internet, on the Sky Angel satellite network and also on Roku devices. It is owned by Spirit Communications, which also owns RadioU. Spirit tv plays adult contemporary music and has little to no programming, other than the VJ's. Spirit tv was formerly known as Spirit Television until early 2017.
External links
Official website
Music video networks in the United States |
https://en.wikipedia.org/wiki/List%20of%20Asian%20Americans | Notable Asian Americans include:
Academia
Manjul Bhargava, mathematician
Raj Chetty, professor of economics
Leon O. Chua, computer scientist
S. I. Hayakawa, professor of English, president of San Francisco State University, and U.S. Senator
Sumiko Hennessy, professor of social work
Hao Huang, Frankel Chair of Music, ethnomusicologist, Scripps College
Jaegwon Kim, professor of philosophy
Jagdish Natwarlal Bhagwati, professor of economics
Eswar Prasad, economist
Raghuram Rajan, economist and an international academician
Amartya Sen, economist and philosopher
Jim Toy, gay activist & educator
S. R. Srinivasa Varadhan, NYU mathematician
Ocean Vuong, writer, poet, professor
Thomas Zacharia, computational material sciences
Astrid S. Tuminez, Utah Valley University, President
Conrado Gempesaw, Former President, St. John's University
Science
Subrahmanyan Chandrasekhar, 1983 Nobel laureate in Physics.
Min Chueh Chang, co-inventor of the combined oral contraceptive pill.
Shiing-Shen Chern, mathematician and winner of the 1983 Wolf Prize for his work in differential geometry.
Steven Chu, Nobel laureate in Physics in 1997 for research on cooling and trapping atoms using laser light and former United States Secretary of Energy.
David D. Ho, HIV/AIDS researcher
June Huh, mathematician, 2022 Fields Medal winner.
Michio Kaku, theoretical physicist
Har Gobind Khorana, shared the Nobel laureate in "Physiology or Medicine" in 1968 for work in genetics and protein synthesis.
Tsung-Dao Lee, received the 1957 Nobel Laureate in Physics for work in particle physics along with Chen Ning Yang.
Yuan T. Lee, 1986 Nobel Prize winner in Chemistry
Syukuro Manabe, 2021 Nobel Laureate in Physics
Shuji Nakamura, 2014 Nobel Laureate in Physics
Yoichiro Nambu, 2008 Nobel laureate in Physics
Santa J. Ono, former President University of Cincinnati, immunologist and vision scientist, current President of University of Michigan
Charles J. Pedersen, 1987 Nobel laureate in Chemistry.
Ching W. Tang, inventor of the organic light-emitting diode and the hetero-junction organic photovoltaic cell. Winner of the 2011 Wolf Prize in Chemistry.
Terence Tao, mathematician, 2006 Fields Medal winner.
Samuel C.C. Ting, 1976 Nobel laureate in physics for discovering the existence of a new particle called j/psi.
Roger Y. Tsien, 2008 Nobel Prize winner in chemistry, for the discovery of the green fluorescent protein.
Daniel Tsui, 1998 Nobel laureate in Physics for contributions to the discovery of the fractional Quantum Hall effect.
Chien-Shiung Wu, winner of the 1978 Wolf Prize in Physics. First woman to be elected president of American Physical Society.
Chen Ning Yang, received the 1957 Nobel Laureate in Physics for work in particle physics along with Tsung-Dao Lee.
Shing-Tung Yau, mathematician, 1982 Fields Medal winner.
Arts/architecture/design
Fazlur Rahman Khan, a Bangladeshi-American structural engineer and architect, who was considered the "Einstein of structural engeering", he was the des |
https://en.wikipedia.org/wiki/Datanomic | Datanomic was a software engineering company based in Cambridge, England.
Founded in 2001, Datanomic was a UK-based software company developing data quality solutions. In 2006, Datanomic acquired Tranato and integrated Tranato's semantic profiling and parsing capabilities with Datanomic's data auditing and cleansing to produce a new data quality application. Launched in July 2007, dn:Director provided an end-to-end data quality tool kit encompassing, data profiling, auditing, cleansing and matching through a single graphical user interface and all written in Java.
Although dn:Director had capabilities to handle data quality issues in all kinds of data, Datanomic targeted its dn:Director application at business users with customer data quality challenges. It adopted a strategy of building "applications", consisting of pre-configured rules and reference data, on top of the data quality platform to address specific business issues.
Most successful of these was its Watchlist Screening application (in support of compliance with anti-money laundering and anti-terrorism know-your-customer regulation), which was adopted by clients including Barclays Bank, Bank of America, MetLife and Vodafone.
Datanomic was funded by private investors and venture capital companies 3i and DN Capital. In July 2011, Datanomic was acquired by Oracle Corporation, which announced that it would combine Datanomic's technology with the Oracle product data quality capabilities it secured when it acquired Silver Creek Systems in 2010; the new combined suite is known as Oracle Enterprise Data Quality. Datanomic's compliance screening application has also been persisted as Oracle Watchlist Screening.
References
Further reading
External links
Case study: Data Excellence at the London Borough of Brent, finalist in the e-Government National Awards 2008
Release of dn:Director
Datanomic acquired by Oracle
Oracle announcement of Datanomic acquisition
Software companies of the United Kingdom
Oracle acquisitions |
https://en.wikipedia.org/wiki/M-Net%20Literary%20Awards | M-Net Literary Awards were a group of South African literary awards, awarded from 1991 to 2013. They were established and sponsored by M-Net (Electronic Media Network), a South African television station. The award was suspended indefinitely after the 2013 season. In the awards' fourth year, an award for indigenous African languages was inaugurated, alongside the original English and Afrikaans awards, to encourage writing in indigenous languages. In subsequent years there were six language categories, covering all eleven official South African languages: English; Afrikaans; Nguni (Zulu, Xhosa, Ndebele, and Swati); SeSotho (Sotho, Pedi, and Tswana); TshiVenda; and SeTsonga. In 2005, a Film award was introduced, for novels that novels that showed promise for translation into a visual medium. Three Lifetime Achievements Awards were also given: to Mazisi Kunene (2005), Cynthia Marivate (2006), and Mzilikazi Khumalo (2007).
In their early years, the M-Net Awards were notable among South African literary awards for considering, under their judging criteria, not only literary merit but also "strong narrative content" and "accessibility to a broad reading public." They were also, in the 1990s, the best remunerated literary awards in South Africa. From 2011, winners received a prize of R50 000, up from R30,000 in previous years.
Until 2010, the Awards were announced at the same event as the Via Afrika Awards (previously known as the Nasboek Literary Awards), which are ongoing as the Media24 Books Literary Awards.
Award winners
References
External links
M-Net Literary Awards, African Book Awards Database, Indiana University
South African literary awards
Awards established in 1991
1991 establishments in South Africa
Fiction awards
South African literary events
Awards disestablished in 2013
2013 disestablishments in South Africa |
https://en.wikipedia.org/wiki/Data%20quality%20firewall | A data quality firewall is the use of software to protect a computer system from the entry of erroneous, duplicated or poor quality data. Gartner estimates that poor quality data causes failure in up to 50% of customer relationship management systems. Older technology required the tight integration of data quality software, whereas this can now be accomplished by loosely coupling technology in a service-oriented architecture.
Features and functionality
A data quality firewall guarantees database accuracy and consistency. This application ensures that only valid and high quality data enter the system, which means that it obliquely protects the database from damage; this is extremely important since database integrity and security are absolutely essential. A data quality firewall provides real time feedback information about the quality of the data submitted to the system.
The main goal of a data quality process consists in capturing erroneous and invalid data, processing them and eliminating duplicates and, lastly, exporting valid data to the user without failing to store a back-up copy into the database. A data quality firewall acts similarly to a network security firewall. It enables packets to pass through specified ports by filtering out data that present quality issues and allowing the remaining, valid data to be stored in the database. In other words, the firewall sits between the data source and the database and works throughout the extraction, processing and loading of data.
It is necessary that data streams be subject to accurate validity checks before they can be considered as being correct or trustworthy. Such checks are of a temporal, formal, logic and forecasting kind.
See also
Data quality
Data cleansing
Data validation
Data quality |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.